Searched refs:DomTreeNodes (Results 1 – 6 of 6) sorted by relevance
244 DomTreeNodeMapType DomTreeNodes;258 DomTreeNodes(std::move(Arg.DomTreeNodes)),268 DomTreeNodes = std::move(RHS.DomTreeNodes);301 const DomTreeNodeMapType &OtherDomTreeNodes = Other.DomTreeNodes;302 if (DomTreeNodes.size() != OtherDomTreeNodes.size())305 for (const auto &DomTreeNode : DomTreeNodes) {329 auto I = DomTreeNodes.find(BB);330 if (I != DomTreeNodes.end())573 return (DomTreeNodes[BB] = IDomNode->addChild(587 DomTreeNodeBase<NodeT> *NewNode = (DomTreeNodes[BB] =[all …]
183 assert(IDom || DT.DomTreeNodes[nullptr]); in getNodeForBlock()188 return (DT.DomTreeNodes[BB] = IDomNode->addChild( in getNodeForBlock()588 DT.RootNode = (DT.DomTreeNodes[Root] = in CalculateFromScratch()604 if (DT.DomTreeNodes[W]) continue; // Haven't calculated this node yet? in attachNewSubtree()613 DT.DomTreeNodes[W] = IDomNode->addChild( in attachNewSubtree()665 (DT.DomTreeNodes[From] = VirtualRoot->addChild( in InsertEdge()1148 DT.DomTreeNodes.erase(TN->getBlock()); in EraseNode()1210 if (DT.DomTreeNodes.size() <= 100) { in ApplyUpdates()1211 if (NumLegalized > DT.DomTreeNodes.size()) in ApplyUpdates()1213 } else if (NumLegalized > DT.DomTreeNodes.size() / 40) in ApplyUpdates()[all …]
208 DomTreeNodes.clear(); in wipe()218 DomTreeNodeMapType DomTreeNodes; variable242 DomTreeNodes.clear(); in reset()323 DomTreeNodes(std::move(Arg.DomTreeNodes)), in DominatorTreeBase()333 DomTreeNodes = std::move(RHS.DomTreeNodes);348 const DomTreeNodeMapType &OtherDomTreeNodes = Other.DomTreeNodes; in compare()349 if (DomTreeNodes.size() != OtherDomTreeNodes.size()) in compare()352 for (const auto &DomTreeNode : this->DomTreeNodes) { in compare()376 auto I = DomTreeNodes.find(BB); in getNode()377 if (I != DomTreeNodes.end()) in getNode()[all …]
254 (DT.DomTreeNodes[Root] = in Calculate()263 if (DT.DomTreeNodes[W]) in Calculate()268 assert(ImmDom || DT.DomTreeNodes[nullptr]); in Calculate()276 DT.DomTreeNodes[W] = IDomNode->addChild( in Calculate()
253 DomTreeNodeMapType DomTreeNodes;267 DomTreeNodes(std::move(Arg.DomTreeNodes)),277 DomTreeNodes = std::move(RHS.DomTreeNodes);326 const DomTreeNodeMapType &OtherDomTreeNodes = Other.DomTreeNodes;327 if (DomTreeNodes.size() != OtherDomTreeNodes.size())330 for (const auto &DomTreeNode : DomTreeNodes) {352 auto I = DomTreeNodes.find(BB);353 if (I != DomTreeNodes.end())641 auto &OldNode = DomTreeNodes[OldRoot];642 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot]));[all …]
140 assert(IDom || DT.DomTreeNodes[nullptr]); in getNodeForBlock()607 if (DT.DomTreeNodes[W]) continue; // Haven't calculated this node yet? in attachNewSubtree()1144 DT.DomTreeNodes.erase(TN->getBlock()); in EraseNode()1187 if (DT.DomTreeNodes.size() <= 100) { in ApplyUpdates()1188 if (BUI.NumLegalized > DT.DomTreeNodes.size()) in ApplyUpdates()1190 } else if (BUI.NumLegalized > DT.DomTreeNodes.size() / 40) in ApplyUpdates()1269 for (auto &NodeToTN : DT.DomTreeNodes) { in verifyReachability()1302 for (auto &NodeToTN : DT.DomTreeNodes) { in VerifyLevels()1357 for (const auto &NodeToTN : DT.DomTreeNodes) { in VerifyDFSNumbers()1470 for (auto &NodeToTN : DT.DomTreeNodes) { in verifyParentProperty()[all …]