Lines Matching refs:i
59 nxt_uint_t i; in nxt_rbtree1_test() local
83 for (i = 0; i < n; i++) { in nxt_rbtree1_test()
86 keys[i] = key; in nxt_rbtree1_test()
87 nodes[i].key = key; in nxt_rbtree1_test()
95 for (i = 0; i < n; i++) { in nxt_rbtree1_test()
96 nxt_rbtree1_insert(&tree, &nodes[i]); in nxt_rbtree1_test()
99 for (i = 0; i < n; i++) { in nxt_rbtree1_test()
100 if (nxt_rbtree1_test_find(&tree, &nodes[i]) != &nodes[i]) { in nxt_rbtree1_test()
102 nodes[i].key); in nxt_rbtree1_test()
107 i = 0; in nxt_rbtree1_test()
112 if (keys[i] != node->key) { in nxt_rbtree1_test()
114 i, keys[i], node->key); in nxt_rbtree1_test()
118 i++; in nxt_rbtree1_test()
122 if (i != n) { in nxt_rbtree1_test()
123 nxt_log_alert(thr->log, "rbtree1 test failed: %ui", i); in nxt_rbtree1_test()
127 for (i = 0; i < n; i++) { in nxt_rbtree1_test()
128 nxt_rbtree1_delete(&tree, &nodes[i]); in nxt_rbtree1_test()
129 nxt_memset(&nodes[i], 0xA5, sizeof(nxt_rbtree1_node_t)); in nxt_rbtree1_test()
269 nxt_uint_t i, n; in nxt_rbtree1_mb_start() local
282 for (i = 0; i < NXT_RBT_NODES; i++) { in nxt_rbtree1_mb_start()
284 mb_nodes[n * i].key = key; in nxt_rbtree1_mb_start()
287 for (i = 0; i < NXT_RBT_NODES - 2; i++) { in nxt_rbtree1_mb_start()
288 nxt_rbtree1_insert(&mb_tree, &mb_nodes[n * i]); in nxt_rbtree1_mb_start()