Lines Matching refs:this_node
70 struct bt_node_t *this_node = root->bt_node; in bt_insert() local
75 while (this_node != NULL) in bt_insert()
77 last_node = this_node; in bt_insert()
78 if (smaller(root, insert_node, this_node)) in bt_insert()
79 this_node = this_node->left; in bt_insert()
81 this_node = this_node->right; in bt_insert()
110 struct bt_node_t *this_node = root->bt_node; in bt_query() local
118 while (this_node != NULL && !equal(root, this_node, &tmp_node)) in bt_query()
120 if (smaller(root, &tmp_node, this_node)) in bt_query()
121 this_node = this_node->left; in bt_query()
123 this_node = this_node->right; in bt_query()
126 if (this_node != NULL && equal(root, this_node, &tmp_node)) in bt_query()
128 *ret_addr = (uint64_t)this_node; in bt_query()
139 static struct bt_node_t *bt_get_minimum(struct bt_node_t *this_node) in bt_get_minimum() argument
141 while (this_node->left != NULL) in bt_get_minimum()
142 this_node = this_node->left; in bt_get_minimum()
143 return this_node; in bt_get_minimum()
163 struct bt_node_t *this_node = (struct bt_node_t *)tmp_addr; in bt_delete() local
165 if (this_node->left == NULL || this_node->right == NULL) in bt_delete()
166 to_delete = this_node; in bt_delete()
169 to_delete = bt_get_minimum(this_node->right); in bt_delete()
171 root->release(this_node->value); in bt_delete()
172 this_node->value = to_delete->value; in bt_delete()