Lines Matching refs:pathp
471 } path[sizeof(void *) << 4], *pathp; \
475 for (pathp = path; pathp->node != NULL; pathp++) { \
476 int cmp = pathp->cmp = a_cmp(node, pathp->node); \
479 pathp[1].node = rbtn_left_get(a_type, a_field, \
480 pathp->node); \
482 pathp[1].node = rbtn_right_get(a_type, a_field, \
483 pathp->node); \
486 pathp->node = node; \
488 for (pathp--; (uintptr_t)pathp >= (uintptr_t)path; pathp--) { \
489 a_type *cnode = pathp->node; \
490 if (pathp->cmp < 0) { \
491 a_type *left = pathp[1].node; \
507 a_type *right = pathp[1].node; \
530 pathp->node = cnode; \
541 } *pathp, *nodep, path[sizeof(void *) << 4]; \
545 for (pathp = path; pathp->node != NULL; pathp++) { \
546 int cmp = pathp->cmp = a_cmp(node, pathp->node); \
548 pathp[1].node = rbtn_left_get(a_type, a_field, \
549 pathp->node); \
551 pathp[1].node = rbtn_right_get(a_type, a_field, \
552 pathp->node); \
555 pathp->cmp = 1; \
556 nodep = pathp; \
557 for (pathp++; pathp->node != NULL; pathp++) { \
558 pathp->cmp = -1; \
559 pathp[1].node = rbtn_left_get(a_type, a_field, \
560 pathp->node); \
567 pathp--; \
568 if (pathp->node != node) { \
570 bool tred = rbtn_red_get(a_type, a_field, pathp->node); \
571 rbtn_color_set(a_type, a_field, pathp->node, \
573 rbtn_left_set(a_type, a_field, pathp->node, \
579 rbtn_right_set(a_type, a_field, pathp->node, \
584 nodep->node = pathp->node; \
585 pathp->node = node; \
605 if (pathp == path) { \
608 if (pathp[-1].cmp < 0) { \
609 rbtn_left_set(a_type, a_field, pathp[-1].node, \
612 rbtn_right_set(a_type, a_field, pathp[-1].node, \
617 } else if (pathp == path) { \
623 if (rbtn_red_get(a_type, a_field, pathp->node)) { \
625 assert(pathp[-1].cmp < 0); \
626 rbtn_left_set(a_type, a_field, pathp[-1].node, NULL); \
631 pathp->node = NULL; \
632 for (pathp--; (uintptr_t)pathp >= (uintptr_t)path; pathp--) { \
633 assert(pathp->cmp != 0); \
634 if (pathp->cmp < 0) { \
635 rbtn_left_set(a_type, a_field, pathp->node, \
636 pathp[1].node); \
637 if (rbtn_red_get(a_type, a_field, pathp->node)) { \
639 pathp->node); \
655 rbtn_black_set(a_type, a_field, pathp->node); \
657 rbtn_right_set(a_type, a_field, pathp->node, tnode);\
658 rbtn_rotate_left(a_type, a_field, pathp->node, \
668 rbtn_rotate_left(a_type, a_field, pathp->node, \
673 assert((uintptr_t)pathp > (uintptr_t)path); \
674 if (pathp[-1].cmp < 0) { \
675 rbtn_left_set(a_type, a_field, pathp[-1].node, \
678 rbtn_right_set(a_type, a_field, pathp[-1].node, \
684 pathp->node); \
698 rbtn_right_set(a_type, a_field, pathp->node, tnode);\
699 rbtn_rotate_left(a_type, a_field, pathp->node, \
704 if (pathp == path) { \
708 if (pathp[-1].cmp < 0) { \
710 pathp[-1].node, tnode); \
713 pathp[-1].node, tnode); \
725 rbtn_red_set(a_type, a_field, pathp->node); \
726 rbtn_rotate_left(a_type, a_field, pathp->node, \
728 pathp->node = tnode; \
733 rbtn_right_set(a_type, a_field, pathp->node, \
734 pathp[1].node); \
735 left = rbtn_left_get(a_type, a_field, pathp->node); \
754 rbtn_rotate_right(a_type, a_field, pathp->node, \
756 rbtn_rotate_right(a_type, a_field, pathp->node, \
771 rbtn_rotate_right(a_type, a_field, pathp->node, \
777 if (pathp == path) { \
781 if (pathp[-1].cmp < 0) { \
782 rbtn_left_set(a_type, a_field, pathp[-1].node, \
785 rbtn_right_set(a_type, a_field, pathp[-1].node, \
790 } else if (rbtn_red_get(a_type, a_field, pathp->node)) { \
801 rbtn_black_set(a_type, a_field, pathp->node); \
804 rbtn_rotate_right(a_type, a_field, pathp->node, \
808 assert((uintptr_t)pathp > (uintptr_t)path); \
809 if (pathp[-1].cmp < 0) { \
810 rbtn_left_set(a_type, a_field, pathp[-1].node, \
813 rbtn_right_set(a_type, a_field, pathp[-1].node, \
825 rbtn_black_set(a_type, a_field, pathp->node); \
841 rbtn_rotate_right(a_type, a_field, pathp->node, \
846 if (pathp == path) { \
850 if (pathp[-1].cmp < 0) { \
852 pathp[-1].node, tnode); \
855 pathp[-1].node, tnode); \