Lines Matching refs:down
82 #define DOWN(node) ((node)->down)
345 * Go as far right and then down as much as possible,
346 * as long as the rightmost node has a down pointer.
458 * the down pointer to this tree should point
476 * Follow the down pointer (possibly NULL).
493 * to have just the common suffix, and a down
595 * the not-in-common parts down to
862 * down pointer and search in the new tree.
917 * had no down pointer.
1040 * Attempted to follow a down pointer that was
1110 * node has a down pointer, then the real
1113 * Move down levels until the rightmost node
1114 * does not have a down pointer.
1294 * complete. The down node from this node might be all
1311 * This node now has no down pointer (either because it didn't
2172 printf("++ BEG down from ");
2177 printf("-- END down from ");
2316 * The predecessor is really down at least one level.
2317 * Go down and as far right as possible, and repeat
2318 * as long as the rightmost node has a down pointer.
2323 * here. See whether to go down, and if so
2423 * in the megatree is a successor to that node, down at
2581 * in the megatree is a successor to that node, down at