Lines Matching refs:parent
123 nodes[0].parent = &nodes[1];
206 prev = node->parent;
209 for (node = prev; node->root == 0; node = node->parent) {
390 cur->parent = &nodes[1];
391 nodes[1].parent = prev;
409 for (cur = nodes[1].parent; cur->root == 0; cur = cur->parent) {
534 nodes[0].parent = prev;
536 x->parent = &nodes[0];
539 prev = x->parent;
540 nodes[0].parent = prev;
541 x->parent = &nodes[0];
570 ipf_rdx_node_t *parent;
584 parent = found->parent;
593 * Remove from the dupkey list. Here, "parent" is
597 parent = node->parent;
598 parent->dupkey = node->dupkey;
599 node->dupkey->parent = parent;
606 * any children must have their parent updated.
609 node->parent = found->parent;
612 found->right->parent = node;
613 found->left->parent = node;
614 if (parent->left == found)
615 parent->left = node;
617 parent->right= node;
631 cur = parent->parent;
632 if (parent != found + 1) {
633 if ((found + 1)->parent->right == found + 1)
634 (found + 1)->parent->right = parent;
636 (found + 1)->parent->left = parent;
637 if (cur->right == parent) {
638 if (parent->left == found) {
639 cur->right = parent->right;
640 } else if (parent->left != parent - 1) {
641 cur->right = parent->left;
643 cur->right = parent - 1;
645 cur->right->parent = cur;
647 if (parent->right == found) {
648 cur->left = parent->left;
649 } else if (parent->right != parent - 1) {
650 cur->left = parent->right;
652 cur->left = parent - 1;
654 cur->left->parent = cur;
656 parent->left = (found + 1)->left;
657 if ((found + 1)->right != parent)
658 parent->right = (found + 1)->right;
659 parent->left->parent = parent;
660 parent->right->parent = parent;
661 parent->parent = (found + 1)->parent;
663 parent->bitmask = prev->bitmask;
664 parent->offset = prev->offset;
665 parent->index = prev->index;
670 cur = parent->parent;
671 if (cur->left == parent) {
672 if (parent->left == found) {
673 cur->left = parent->right;
674 parent->right->parent = cur;
676 cur->left = parent->left;
677 parent->left->parent = cur;
680 if (parent->right != found) {
681 cur->right = parent->right;
682 parent->right->parent = cur;
684 cur->right = parent->left;
685 prev->left->parent = cur;
694 for (cur = parent; cur->root == 0; cur = cur->parent) {
716 for (pmask = &parent->masks; (m = *pmask) != NULL; ) {
722 ipf_rx_attach_mask(parent->right, m);
723 } else if (parent->left != found) {
724 ipf_rx_attach_mask(parent->left, m);
758 while ((node->parent->right == node) && (node->root == 0))
759 node = node->parent;
761 for (node = node->parent->right; node->index >= 0; )
807 node[0].parent = node + 1;
808 node[1].parent = node + 1;
809 node[2].parent = node + 1;
1122 GNAME(node[0].parent), GNAME(node[1].parent),
1143 printf("P %9.9s", GNAME(node[0].parent));
1144 printf("/%-9.9s ", GNAME(node[1].parent));
1190 rnh->nodes[0].index, GNAME(rnh->nodes[0].parent),
1194 rnh->nodes[1].index, GNAME(rnh->nodes[1].parent),
1198 rnh->nodes[2].index, GNAME(rnh->nodes[2].parent),
1372 stp->nodes[0].parent = &stp->nodes[0];
1373 stp->nodes[1].parent = &stp->nodes[1];
1421 if (rn->right->parent != rn)
1423 if (rn->left->parent != rn)
1425 if (rn->parent->left != rn && rn->parent->right != rn)