for (i=0; i<1024; i++)
{
struct node1 *n = test1_find(i);
- if (!n != (i&1) || (n && n->data != i+123))
+ if ((!n) != (i&1) || (n && n->data != i+123))
die("Inconsistency at i=%d", i);
}
i=0;
struct node2 *n;
sprintf(x, "ABC%d", i);
n = test2_find(x);
- if (!n != (i&1))
+ if ((!n) != (i&1))
die("Inconsistency at i=%d", i);
}
puts("OK");
struct node3 *n;
sprintf(x, "abc%d", i);
n = test3_find(x);
- if (!n != (i&1))
+ if ((!n) != (i&1))
die("Inconsistency at i=%d", i);
}
puts("OK");
{
sprintf(x, "ABC%d", i);
n = test4_find(x, i%10);
- if (!n != (i&1) || (n && n->data != i))
+ if ((!n) != (i&1) || (n && n->data != i))
die("Inconsistency at i=%d", i);
}
test4_cleanup();
for (i=0; i<1024; i++)
{
struct node5 *n = test5_find(&tab, i);
- if (!n != (i&1) || (n && n->data != i+123))
+ if ((!n) != (i&1) || (n && n->data != i+123))
die("Inconsistency at i=%d", i);
}
i=0;