Searched refs:left (Results 1 – 7 of 7) sorted by last modified time
36 node->left = sentinel; in nxt_rbtree1_insert()115 node->left = sentinel; in nxt_rbtree1_insert_value()150 node->left = sentinel; in nxt_rbtree1_insert_timer_value()172 temp = node->left; in nxt_rbtree1_delete()190 node->left = NULL; in nxt_rbtree1_delete()220 subst->left = node->left; in nxt_rbtree1_delete()246 node->left = NULL; in nxt_rbtree1_delete()332 node->right = temp->left; in nxt_rbtree1_left_rotate()350 temp->left = node; in nxt_rbtree1_left_rotate()361 temp = node->left; in nxt_rbtree1_right_rotate()[all …]
16 nxt_rbtree1_node_t *left; member68 while (node->left != sentinel) { in nxt_rbtree1_min()69 node = node->left; in nxt_rbtree1_min()
36 if (node == parent->left) { in nxt_rbtree1_node_successor()164 nxt_prefetch(temp->left); in nxt_rbtree1_test_insert_value()167 p = (node->key < temp->key) ? &temp->left : &temp->right; in nxt_rbtree1_test_insert_value()178 node->left = sentinel; in nxt_rbtree1_test_insert_value()235 nxt_prefetch(next->left); in nxt_rbtree1_test_find()241 next = next->left; in nxt_rbtree1_test_find()
741 free_block = nxt_mem_zone_find_free_block(zone, block->node.left, in nxt_mem_zone_find_free_block()
846 node = node->left; in nxt_mp_find_block()
14 nxt_rbtree_node_t *left; member23 nxt_rbtree_node_t *left; member52 ((tree)->sentinel.left)70 while (node->left != nxt_rbtree_sentinel(tree)) { in nxt_rbtree_branch_min()71 node = node->left; in nxt_rbtree_branch_min()98 if (node == parent->left) { in nxt_rbtree_node_successor()
70 new_node->left = sentinel; in nxt_rbtree_insert()199 next = next->left; in nxt_rbtree_find()234 next = next->left; in nxt_rbtree_find_less_or_equal()302 child = node->left; in nxt_rbtree_delete()318 subst->left = node->left; in nxt_rbtree_delete()328 node->left = NULL; in nxt_rbtree_delete()456 child->left = node; in nxt_rbtree_left_rotate()469 child = node->left; in nxt_rbtree_right_rotate()497 link = (node == parent->left) ? &parent->left : &parent->right; in nxt_rbtree_parent_relink()510 for (node = *next; node->left != sentinel; node = node->left); in nxt_rbtree_destroy_next()[all …]