Lines Matching refs:i
28 nxt_uint_t i; in nxt_rbtree_test() local
55 for (i = 0; i < n; i++) { in nxt_rbtree_test()
58 keys[i] = key; in nxt_rbtree_test()
59 items[i].key = key; in nxt_rbtree_test()
67 for (i = 0; i < n; i++) { in nxt_rbtree_test()
68 nxt_rbtree_insert(&tree, &items[i].node); in nxt_rbtree_test()
71 for (i = 0; i < n; i++) { in nxt_rbtree_test()
72 node = nxt_rbtree_find(&tree, &items[i].node); in nxt_rbtree_test()
74 if (node != (nxt_rbtree_node_t *) &items[i].node) { in nxt_rbtree_test()
76 items[i].key); in nxt_rbtree_test()
81 i = 0; in nxt_rbtree_test()
88 if (keys[i] != item->key) { in nxt_rbtree_test()
90 i, keys[i], item->key); in nxt_rbtree_test()
94 i++; in nxt_rbtree_test()
98 if (i != n) { in nxt_rbtree_test()
99 nxt_log_alert(thr->log, "rbtree test failed: %ui", i); in nxt_rbtree_test()
103 for (i = 0; i < n; i++) { in nxt_rbtree_test()
104 nxt_rbtree_delete(&tree, &items[i].node); in nxt_rbtree_test()
105 nxt_memset(&items[i], 0xA5, sizeof(nxt_rbtree_test_t)); in nxt_rbtree_test()
207 nxt_uint_t i, n; in nxt_rbtree_mb_start() local
220 for (i = 0; i < NXT_RBT_NODES; i++) { in nxt_rbtree_mb_start()
222 mb_nodes[n * i].key = key; in nxt_rbtree_mb_start()
225 for (i = 0; i < NXT_RBT_NODES - 2; i++) { in nxt_rbtree_mb_start()
226 nxt_rbtree_insert(&mb_tree, &mb_nodes[n * i].node); in nxt_rbtree_mb_start()