Symbol: ITER
regress/sys/sys/tree/rb-linux/rb-linux.c
101
for (i = 0; i < ITER; i++) {
regress/sys/sys/tree/rb-linux/rb-linux.c
133
for (i = 0; i < ITER - 1; i++) {
regress/sys/sys/tree/rb/rb-test.c
141
nodes = calloc((ITER + 5), sizeof(struct node));
regress/sys/sys/tree/rb/rb-test.c
142
perm = calloc(ITER, sizeof(int));
regress/sys/sys/tree/rb/rb-test.c
143
nums = calloc(ITER, sizeof(int));
regress/sys/sys/tree/rb/rb-test.c
152
for(i = 1; i < ITER; i++) {
regress/sys/sys/tree/rb/rb-test.c
199
mix_operations(perm, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rb-test.c
207
assert(ITER + 1 == ins->size);
regress/sys/sys/tree/rb/rb-test.c
226
assert(ITER + 5 == ins->key);
regress/sys/sys/tree/rb/rb-test.c
233
assert(ITER == (RB_ROOT(&root))->size);
regress/sys/sys/tree/rb/rb-test.c
238
for (i = 0; i < ITER; i++) {
regress/sys/sys/tree/rb/rb-test.c
251
if (!(RB_EMPTY(&root)) && (RB_ROOT(&root))->size != ITER - 1 - i)
regress/sys/sys/tree/rb/rb-test.c
269
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rb-test.c
277
for (i = 0; i < ITER + 1; i++) {
regress/sys/sys/tree/rb/rb-test.c
303
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rb-test.c
312
for(i = 0; i < ITER; i++) {
regress/sys/sys/tree/rb/rb-test.c
346
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rb-test.c
356
for(i = 0; i < ITER; i++) {
regress/sys/sys/tree/rb/rb-test.c
393
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rb-test.c
402
for(i = 0; i < ITER + 1; i++) {
regress/sys/sys/tree/rb/rb-test.c
433
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rb-test.c
442
for(i = 0; i < ITER + 1; i++) {
regress/sys/sys/tree/rb/rb-test.c
443
tmp->key = ITER + 6;
regress/sys/sys/tree/rb/rb-test.c
472
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rb-test.c
483
for(i = 1; i < ITER; i++) {
regress/sys/sys/tree/rb/rb-test.c
497
assert(tmp->key == ITER + 5);
regress/sys/sys/tree/rb/rb-test.c
498
for(i = 0; i < ITER; i++) {
regress/sys/sys/tree/rb/rb-test.c
501
assert(tmp->key == ITER - 1 - i);
regress/sys/sys/tree/rb/rb-test.c
510
for (i = 0; i < ITER + 1; i++) {
regress/sys/sys/tree/rb/rb-test.c
536
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rb-test.c
547
if (i < ITER)
regress/sys/sys/tree/rb/rb-test.c
550
assert(ins->key == ITER + 5);
regress/sys/sys/tree/rb/rb-test.c
562
i = ITER + 5;
regress/sys/sys/tree/rb/rb-test.c
565
if (i > ITER)
regress/sys/sys/tree/rb/rb-test.c
566
i = ITER - 1;
regress/sys/sys/tree/rb/rb-test.c
578
for (i = 0; i < ITER + 1; i++) {
regress/sys/sys/tree/rb/rb-test.c
598
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rb-test.c
608
if (i < ITER)
regress/sys/sys/tree/rb/rb-test.c
611
assert(ins->key == ITER + 5);
regress/sys/sys/tree/rb/rb-test.c
624
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rb-test.c
632
i = ITER + 5;
regress/sys/sys/tree/rb/rb-test.c
635
if (i > ITER)
regress/sys/sys/tree/rb/rb-test.c
636
i = ITER - 1;
regress/sys/sys/tree/rb/rb-test.c
664
for(i = 1; i < ITER; i++) {
regress/sys/sys/tree/rb/rb-test.c
706
tmp = &(nodes[ITER]);
regress/sys/sys/tree/rb/rb-test.c
709
tmp->key = ITER;
regress/sys/sys/tree/rb/rb-test.c
713
for(i = ITER - 1; i >= 0; i--) {
regress/sys/sys/tree/rb/rb-test.c
751
mix_operations(perm, ITER, nodes, ITER, ITER / 2, ITER / 2, 1);
regress/sys/sys/tree/rb/rb-test.c
759
for (i = 0; i < ITER / 2 + 1; i++) {
regress/sys/sys/tree/rb/rb-test.c
773
mix_operations(perm, ITER, nodes, ITER, ITER / 5, 4 * (ITER / 5), 1);
regress/sys/sys/tree/rb/rb-test.c
781
for (i = 0; i < ITER / 5 + 1; i++) {
regress/sys/sys/tree/rb/rb-test.c
795
mix_operations(perm, ITER, nodes, ITER, ITER / 10, 9 * (ITER / 10), 1);
regress/sys/sys/tree/rb/rb-test.c
803
for (i = 0; i < ITER / 10 + 1; i++) {
regress/sys/sys/tree/rb/rb-test.c
817
mix_operations(perm, ITER, nodes,
regress/sys/sys/tree/rb/rb-test.c
818
ITER, 5 * (ITER / 100),
regress/sys/sys/tree/rb/rb-test.c
819
95 * (ITER / 100), 1);
regress/sys/sys/tree/rb/rb-test.c
827
for (i = 0; i < 5 * (ITER / 100) + 1; i++) {
regress/sys/sys/tree/rb/rb-test.c
84
int ITER=150000;
regress/sys/sys/tree/rb/rb-test.c
841
mix_operations(perm, ITER, nodes, ITER,
regress/sys/sys/tree/rb/rb-test.c
842
2 * (ITER / 100),
regress/sys/sys/tree/rb/rb-test.c
843
98 * (ITER / 100), 1);
regress/sys/sys/tree/rb/rb-test.c
851
for (i = 0; i < 2 * (ITER / 100) + 1; i++) {
regress/sys/sys/tree/rb/rb-test.c
958
tmp->key = ITER + 5;
regress/sys/sys/tree/rb/rbt-test.c
140
nodes = calloc((ITER + 5), sizeof(struct node));
regress/sys/sys/tree/rb/rbt-test.c
141
perm = calloc(ITER, sizeof(int));
regress/sys/sys/tree/rb/rbt-test.c
142
nums = calloc(ITER, sizeof(int));
regress/sys/sys/tree/rb/rbt-test.c
151
for(i = 1; i < ITER; i++) {
regress/sys/sys/tree/rb/rbt-test.c
198
mix_operations(perm, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rbt-test.c
206
assert(ITER + 1 == ins->size);
regress/sys/sys/tree/rb/rbt-test.c
225
assert(ITER + 5 == ins->key);
regress/sys/sys/tree/rb/rbt-test.c
232
assert(ITER == (RBT_ROOT(tree, &root))->size);
regress/sys/sys/tree/rb/rbt-test.c
237
for (i = 0; i < ITER; i++) {
regress/sys/sys/tree/rb/rbt-test.c
250
if (!(RBT_EMPTY(&root)) && (RBT_ROOT(tree, &root))->size != ITER - 1 - i)
regress/sys/sys/tree/rb/rbt-test.c
268
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rbt-test.c
276
for (i = 0; i < ITER + 1; i++) {
regress/sys/sys/tree/rb/rbt-test.c
302
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rbt-test.c
311
for(i = 0; i < ITER; i++) {
regress/sys/sys/tree/rb/rbt-test.c
345
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rbt-test.c
355
for(i = 0; i < ITER; i++) {
regress/sys/sys/tree/rb/rbt-test.c
392
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rbt-test.c
401
for(i = 0; i < ITER + 1; i++) {
regress/sys/sys/tree/rb/rbt-test.c
432
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rbt-test.c
441
for(i = 0; i < ITER + 1; i++) {
regress/sys/sys/tree/rb/rbt-test.c
442
tmp->key = ITER + 6;
regress/sys/sys/tree/rb/rbt-test.c
471
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rbt-test.c
482
for(i = 1; i < ITER; i++) {
regress/sys/sys/tree/rb/rbt-test.c
496
assert(tmp->key == ITER + 5);
regress/sys/sys/tree/rb/rbt-test.c
497
for(i = 0; i < ITER; i++) {
regress/sys/sys/tree/rb/rbt-test.c
500
assert(tmp->key == ITER - 1 - i);
regress/sys/sys/tree/rb/rbt-test.c
509
for (i = 0; i < ITER + 1; i++) {
regress/sys/sys/tree/rb/rbt-test.c
535
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rbt-test.c
546
if (i < ITER)
regress/sys/sys/tree/rb/rbt-test.c
549
assert(ins->key == ITER + 5);
regress/sys/sys/tree/rb/rbt-test.c
561
i = ITER + 5;
regress/sys/sys/tree/rb/rbt-test.c
564
if (i > ITER)
regress/sys/sys/tree/rb/rbt-test.c
565
i = ITER - 1;
regress/sys/sys/tree/rb/rbt-test.c
577
for (i = 0; i < ITER + 1; i++) {
regress/sys/sys/tree/rb/rbt-test.c
597
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rbt-test.c
607
if (i < ITER)
regress/sys/sys/tree/rb/rbt-test.c
610
assert(ins->key == ITER + 5);
regress/sys/sys/tree/rb/rbt-test.c
623
mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0);
regress/sys/sys/tree/rb/rbt-test.c
631
i = ITER + 5;
regress/sys/sys/tree/rb/rbt-test.c
634
if (i > ITER)
regress/sys/sys/tree/rb/rbt-test.c
635
i = ITER - 1;
regress/sys/sys/tree/rb/rbt-test.c
663
for(i = 1; i < ITER; i++) {
regress/sys/sys/tree/rb/rbt-test.c
705
tmp = &(nodes[ITER]);
regress/sys/sys/tree/rb/rbt-test.c
708
tmp->key = ITER;
regress/sys/sys/tree/rb/rbt-test.c
712
for(i = ITER - 1; i >= 0; i--) {
regress/sys/sys/tree/rb/rbt-test.c
750
mix_operations(perm, ITER, nodes, ITER, ITER / 2, ITER / 2, 1);
regress/sys/sys/tree/rb/rbt-test.c
758
for (i = 0; i < ITER / 2 + 1; i++) {
regress/sys/sys/tree/rb/rbt-test.c
772
mix_operations(perm, ITER, nodes, ITER, ITER / 5, 4 * (ITER / 5), 1);
regress/sys/sys/tree/rb/rbt-test.c
780
for (i = 0; i < ITER / 5 + 1; i++) {
regress/sys/sys/tree/rb/rbt-test.c
794
mix_operations(perm, ITER, nodes, ITER, ITER / 10, 9 * (ITER / 10), 1);
regress/sys/sys/tree/rb/rbt-test.c
802
for (i = 0; i < ITER / 10 + 1; i++) {
regress/sys/sys/tree/rb/rbt-test.c
816
mix_operations(perm, ITER, nodes,
regress/sys/sys/tree/rb/rbt-test.c
817
ITER, 5 * (ITER / 100),
regress/sys/sys/tree/rb/rbt-test.c
818
95 * (ITER / 100), 1);
regress/sys/sys/tree/rb/rbt-test.c
826
for (i = 0; i < 5 * (ITER / 100) + 1; i++) {
regress/sys/sys/tree/rb/rbt-test.c
83
int ITER=150000;
regress/sys/sys/tree/rb/rbt-test.c
840
mix_operations(perm, ITER, nodes, ITER,
regress/sys/sys/tree/rb/rbt-test.c
841
2 * (ITER / 100),
regress/sys/sys/tree/rb/rbt-test.c
842
98 * (ITER / 100), 1);
regress/sys/sys/tree/rb/rbt-test.c
850
for (i = 0; i < 2 * (ITER / 100) + 1; i++) {
regress/sys/sys/tree/rb/rbt-test.c
957
tmp->key = ITER + 5;
regress/sys/sys/tree/splay/splay-test.c
66
for (i = 0; i < ITER; i++) {
regress/sys/sys/tree/splay/splay-test.c
96
for (i = 0; i < ITER - 1; i++) {
usr.sbin/amd/amd/mapc.c
497
ITER(m, mnt_map, &map_list_head)
usr.sbin/amd/amd/mapc.c
694
ITER(m, mnt_map, &map_list_head)
usr.sbin/amd/amd/mntfs.c
138
ITER(mf, mntfs, &mfhead) {
usr.sbin/amd/amd/nfs_ops.c
116
ITER(fp, fh_cache, &fh_head) {
usr.sbin/amd/amd/nfs_ops.c
172
ITER(fp, fh_cache, &fh_head) {
usr.sbin/amd/amd/nfs_ops.c
211
ITER(fp, fh_cache, &fh_head) {
usr.sbin/amd/amd/rpc_fwd.c
187
ITER(p, rpc_forward, &rpc_head) {
usr.sbin/amd/amd/rpc_fwd.c
98
ITER(p2, rpc_forward, &rpc_head) {
usr.sbin/amd/amd/srvr_nfs.c
153
ITER(fs, fserver, &nfs_srvr_list)
usr.sbin/amd/amd/srvr_nfs.c
272
ITER(fs, fserver, &nfs_srvr_list) {
usr.sbin/amd/amd/srvr_nfs.c
621
ITER(fs, fserver, &nfs_srvr_list) {
usr.sbin/amd/amd/srvr_nfs.c
95
ITER(fs, fserver, &nfs_srvr_list) {