Searched refs:DomTreeNodes (Results 1 – 6 of 6) sorted by relevance
190 DomTreeNodeMapType DomTreeNodes; variable214 for (typename DomTreeNodeMapType::iterator I = this->DomTreeNodes.begin(), in reset()215 E = DomTreeNodes.end(); I != E; ++I) in reset()217 DomTreeNodes.clear(); in reset()296 const DomTreeNodeMapType &OtherDomTreeNodes = Other.DomTreeNodes; in compare()297 if (DomTreeNodes.size() != OtherDomTreeNodes.size()) in compare()301 I = this->DomTreeNodes.begin(), in compare()302 E = this->DomTreeNodes.end(); I != E; ++I) { in compare()324 typename DomTreeNodeMapType::const_iterator I = DomTreeNodes.find(BB); in getNode()325 return I != DomTreeNodes.end() ? I->second : 0; in getNode()[all …]
254 DT.DomTreeNodes[Root] = DT.RootNode = in Calculate()261 DomTreeNodeBase<typename GraphT::NodeType> *BBNode = DT.DomTreeNodes[W]; in Calculate()266 assert(ImmDom || DT.DomTreeNodes[NULL]); in Calculate()276 DT.DomTreeNodes[W] = IDomNode->addChild(C); in Calculate()
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()
270 DomTreeNodeMapType DomTreeNodes;284 DomTreeNodes(std::move(Arg.DomTreeNodes)),294 DomTreeNodes = std::move(RHS.DomTreeNodes);327 const DomTreeNodeMapType &OtherDomTreeNodes = Other.DomTreeNodes;328 if (DomTreeNodes.size() != OtherDomTreeNodes.size())331 for (const auto &DomTreeNode : DomTreeNodes) {355 auto I = DomTreeNodes.find(BB);356 if (I != DomTreeNodes.end())599 return (DomTreeNodes[BB] = IDomNode->addChild(613 DomTreeNodeBase<NodeT> *NewNode = (DomTreeNodes[BB] =[all …]
180 assert(IDom || DT.DomTreeNodes[nullptr]); in getNodeForBlock()185 return (DT.DomTreeNodes[BB] = IDomNode->addChild( in getNodeForBlock()579 DT.RootNode = (DT.DomTreeNodes[Root] = in CalculateFromScratch()595 if (DT.DomTreeNodes[W]) continue; // Haven't calculated this node yet? in attachNewSubtree()604 DT.DomTreeNodes[W] = IDomNode->addChild( in attachNewSubtree()655 (DT.DomTreeNodes[From] = VirtualRoot->addChild( in InsertEdge()1144 DT.DomTreeNodes.erase(TN->getBlock()); in EraseNode()1197 if (DT.DomTreeNodes.size() <= 100) { in ApplyUpdates()1198 if (NumLegalized > DT.DomTreeNodes.size()) in ApplyUpdates()1200 } else if (NumLegalized > DT.DomTreeNodes.size() / 40) in ApplyUpdates()[all …]