Searched refs:FirstChild (Results 1 – 8 of 8) sorted by relevance
70 this->FirstChild = Child; in appendChildLowLevel()90 if (this->FirstChild) { in prependChildLowLevel()91 Child->NextSibling = this->FirstChild; in prependChildLowLevel()92 this->FirstChild->PreviousSibling = Child; in prependChildLowLevel()96 this->FirstChild = Child; in prependChildLowLevel()121 assert(Reachable(FirstChild, Begin) && "`Begin` is not reachable."); in replaceChildRangeLowLevel()151 auto *&NewFirst = BeforeBegin ? BeforeBegin->NextSibling : FirstChild; in replaceChildRangeLowLevel()
143 SuffixTreeNode *FirstChild = J->second; in setLeafNodes() local149 ChildrenMap[CurrInternalNode] = {FirstChild, LastChild}; in setLeafNodes()155 auto [FirstChild, LastChild] = I->second; in setLeafNodes()160 CurrNode->setRightLeafIdx(FirstChild->getRightLeafIdx()); in setLeafNodes()
179 Node *getFirstChild() { return FirstChild; } in getFirstChild()180 const Node *getFirstChild() const { return FirstChild; } in getFirstChild()246 Node *FirstChild = nullptr; variable
468 BOOLEAN FirstChild; in TrLinkOpChildren() local544 FirstChild = TRUE; in TrLinkOpChildren()572 if (FirstChild) in TrLinkOpChildren()574 FirstChild = FALSE; in TrLinkOpChildren()
188 BOOLEAN FirstChild; in TrCreateOp() local238 FirstChild = TRUE; in TrCreateOp()259 if (FirstChild) in TrCreateOp()261 FirstChild = FALSE; in TrCreateOp()
34 bool FirstChild = true; variable71 bool WasFirstChild = FirstChild; in AddChild()78 FirstChild = true; in AddChild()99 if (FirstChild) { in AddChild()105 FirstChild = false; in AddChild()
45 bool FirstChild = true; variable99 FirstChild = true; in AddChild()115 if (FirstChild) { in AddChild()121 FirstChild = false; in AddChild()
138 auto FirstChild = llvm::partition(CandidateLoops, [&](Loop *L) { in INITIALIZE_PASS_DEPENDENCY() local141 SmallVector<Loop *, 8> ChildLoops(FirstChild, CandidateLoops.end()); in INITIALIZE_PASS_DEPENDENCY()142 CandidateLoops.erase(FirstChild, CandidateLoops.end()); in INITIALIZE_PASS_DEPENDENCY()