Lines Matching refs:tree
33 void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth) { in phpdbg_btree_init() argument
34 tree->depth = depth; in phpdbg_btree_init()
35 tree->branch = NULL; in phpdbg_btree_init()
36 tree->count = 0; in phpdbg_btree_init()
39 phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find() argument
40 phpdbg_btree_branch *branch = tree->branch; in phpdbg_btree_find()
41 int i = tree->depth - 1; in phpdbg_btree_find()
66 phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find_closest() argument
67 phpdbg_btree_branch *branch = tree->branch; in phpdbg_btree_find_closest()
68 int i = tree->depth - 1, last_superior_i = -1; in phpdbg_btree_find_closest()
85 branch = tree->branch; in phpdbg_btree_find_closest()
86 i = tree->depth - 1; in phpdbg_btree_find_closest()
118 phpdbg_btree_position phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulon… in phpdbg_btree_find_between() argument
121 pos.tree = tree; in phpdbg_btree_find_between()
129 phpdbg_btree_result *result = phpdbg_btree_find_closest(pos->tree, pos->cur); in phpdbg_btree_next()
140 int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags) { in phpdbg_btree_insert_or_update() argument
141 int i = tree->depth - 1; in phpdbg_btree_insert_or_update()
142 phpdbg_btree_branch **branch = &tree->branch; in phpdbg_btree_insert_or_update()
163 tree->count++; in phpdbg_btree_insert_or_update()
175 int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_delete() argument
176 int i = tree->depth; in phpdbg_btree_delete()
177 phpdbg_btree_branch *branch = tree->branch; in phpdbg_btree_delete()
196 tree->count--; in phpdbg_btree_delete()
199 efree(tree->branch); in phpdbg_btree_delete()
200 tree->branch = NULL; in phpdbg_btree_delete()
