Lines Matching refs:i
44 int i = tree->depth - 1; in phpdbg_btree_find() local
51 if ((idx >> i) % 2 == 1) { in phpdbg_btree_find()
64 } while (i--); in phpdbg_btree_find()
71 int i = tree->depth - 1, last_superior_i = -1; in phpdbg_btree_find_closest() local
79 if ((idx >> i) % 2 == 0) { in phpdbg_btree_find_closest()
91 i = tree->depth - 1; in phpdbg_btree_find_closest()
94 CHOOSE_BRANCH((idx >> i) % 2 == 1 && branch->branches[1]); in phpdbg_btree_find_closest()
95 } while (--i > last_superior_i); in phpdbg_btree_find_closest()
99 while (i--) { in phpdbg_btree_find_closest()
108 last_superior_i = i; in phpdbg_btree_find_closest()
113 while (i--) { in phpdbg_btree_find_closest()
119 } while (i--); in phpdbg_btree_find_closest()
147 int i = tree->depth - 1; in phpdbg_btree_insert_or_update() local
154 branch = &(*branch)->branches[(idx >> i) % 2]; in phpdbg_btree_insert_or_update()
155 } while (i--); in phpdbg_btree_insert_or_update()
163 …phpdbg_btree_branch *memory = *branch = pemalloc((i + 2) * sizeof(phpdbg_btree_branch), tree->pers… in phpdbg_btree_insert_or_update()
165 (*branch)->branches[!((idx >> i) % 2)] = NULL; in phpdbg_btree_insert_or_update()
166 branch = &(*branch)->branches[(idx >> i) % 2]; in phpdbg_btree_insert_or_update()
168 } while (i--); in phpdbg_btree_insert_or_update()
182 int i = tree->depth; in phpdbg_btree_delete() local
191 i_last_dual_branch = i; in phpdbg_btree_delete()
192 last_dual_branch_branch = (idx >> i) % 2; in phpdbg_btree_delete()
194 branch = branch->branches[(idx >> i) % 2]; in phpdbg_btree_delete()
200 } while (i--); in phpdbg_btree_delete()
216 for (i = i_last_dual_branch; i--;) { in phpdbg_btree_delete()
217 …ranches[branch->branches[1] == ++original_branch] = last_dual_branch + i_last_dual_branch - i + 1); in phpdbg_btree_delete()
