Lines Matching refs:i
42 int i = tree->depth - 1; in phpdbg_btree_find() local
49 if ((idx >> i) % 2 == 1) { in phpdbg_btree_find()
62 } while (i--); in phpdbg_btree_find()
69 int i = tree->depth - 1, last_superior_i = -1; in phpdbg_btree_find_closest() local
77 if ((idx >> i) % 2 == 0) { in phpdbg_btree_find_closest()
89 i = tree->depth - 1; in phpdbg_btree_find_closest()
92 CHOOSE_BRANCH((idx >> i) % 2 == 1 && branch->branches[1]); in phpdbg_btree_find_closest()
93 } while (--i > last_superior_i); in phpdbg_btree_find_closest()
97 while (i--) { in phpdbg_btree_find_closest()
106 last_superior_i = i; in phpdbg_btree_find_closest()
111 while (i--) { in phpdbg_btree_find_closest()
117 } while (i--); in phpdbg_btree_find_closest()
145 int i = tree->depth - 1; in phpdbg_btree_insert_or_update() local
152 branch = &(*branch)->branches[(idx >> i) % 2]; in phpdbg_btree_insert_or_update()
153 } while (i--); in phpdbg_btree_insert_or_update()
161 …phpdbg_btree_branch *memory = *branch = pemalloc((i + 2) * sizeof(phpdbg_btree_branch), tree->pers… in phpdbg_btree_insert_or_update()
163 (*branch)->branches[!((idx >> i) % 2)] = NULL; in phpdbg_btree_insert_or_update()
164 branch = &(*branch)->branches[(idx >> i) % 2]; in phpdbg_btree_insert_or_update()
166 } while (i--); in phpdbg_btree_insert_or_update()
180 int i = tree->depth; in phpdbg_btree_delete() local
189 i_last_dual_branch = i; in phpdbg_btree_delete()
190 last_dual_branch_branch = (idx >> i) % 2; in phpdbg_btree_delete()
192 branch = branch->branches[(idx >> i) % 2]; in phpdbg_btree_delete()
198 } while (i--); in phpdbg_btree_delete()
214 for (i = i_last_dual_branch; i--;) { in phpdbg_btree_delete()
215 …ranches[branch->branches[1] == ++original_branch] = last_dual_branch + i_last_dual_branch - i + 1); in phpdbg_btree_delete()
