Home
last modified time | relevance | path

Searched refs:CurrNode (Results 1 – 2 of 2) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DSuffixTree.cpp92 SuffixTreeNode *CurrNode = Root; in setSuffixIndices() local
96 ToVisit.push_back({CurrNode, CurrNodeLen}); in setSuffixIndices()
98 std::tie(CurrNode, CurrNodeLen) = ToVisit.pop_back_val(); in setSuffixIndices()
100 CurrNode->setConcatLen(CurrNodeLen); in setSuffixIndices()
101 if (auto *InternalNode = dyn_cast<SuffixTreeInternalNode>(CurrNode)) in setSuffixIndices()
109 if (auto *LeafNode = dyn_cast<SuffixTreeLeafNode>(CurrNode)) in setSuffixIndices()
131 SuffixTreeNode *CurrNode = ToVisit.pop_back_val(); in setLeafNodes() local
132 if (auto *CurrInternalNode = dyn_cast<SuffixTreeInternalNode>(CurrNode)) { in setLeafNodes()
142 ToVisit.push_back(CurrNode); in setLeafNodes()
160 CurrNode->setRightLeafIdx(FirstChild->getRightLeafIdx()); in setLeafNodes()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineOutliner.cpp681 [](const MachineInstr &MI, const HashNode *CurrNode) -> const HashNode * { in getMatchedEntries() argument
685 auto It = CurrNode->Successors.find(StableHash); in getMatchedEntries()
686 return (It == CurrNode->Successors.end()) ? nullptr : It->second.get(); in getMatchedEntries()
693 const HashNode *CurrNode = getStableHashAndFollow(*MI, RootNode); in getMatchedEntries() local
694 if (!CurrNode) in getMatchedEntries()
704 CurrNode = getStableHashAndFollow(*MJ, CurrNode); in getMatchedEntries()
705 if (!CurrNode) in getMatchedEntries()
709 if (auto Count = CurrNode->Terminals) in getMatchedEntries()