Lines Matching refs:path
111 unsigned int path;
119 /* Calculate the path from the root to the insertion point. This is a min
122 path = 0;
124 path = (path << 1) | (n & 1);
126 /* Now traverse the heap using the path we calculated in the previous step. */
130 if (path & 1)
134 path >>= 1;
156 unsigned int path;
163 /* Calculate the path from the min (the root) to the max, the left-most node
166 path = 0;
168 path = (path << 1) | (n & 1);
170 /* Now traverse the heap using the path we calculated in the previous step. */
173 if (path & 1)
177 path >>= 1;