Lines Matching defs:parent
69 /// from a normal union-find data structure. We steal two bits from the parent
82 Node(unsigned v) : value(v), rank(0) { parent.setPointer(this); }
86 PointerIntPair<Node*, 2> parent;
415 Node *Parent = parent.getPointer();
416 Node *Grandparent = Parent->parent.getPointer();
418 while (Parent != Grandparent) {
419 N->parent.setPointer(Grandparent);
421 Parent = Parent->parent.getPointer();
422 Grandparent = Parent->parent.getPointer();
425 return Parent;
433 if (Node->parent.getInt() & Node::kRegisterIsolatedFlag)
443 Node2->parent.setPointer(Node1->getLeader());
445 Node1->parent.setPointer(Node2->getLeader());
447 Node2->parent.setPointer(Node1->getLeader());
454 Node->parent.setInt(Node->parent.getInt() | Node::kRegisterIsolatedFlag);
462 if (DestNode->parent.getInt() & Node::kPHIIsolatedFlag)
476 Node->parent.setInt(Node->parent.getInt() | Node::kPHIIsolatedFlag);
563 // until we find a parent that dominates the current instruction.
616 // until we find a parent that dominates the current instruction.
