Searched refs:NCD (Results 1 – 5 of 5) sorted by relevance
55 MachineBasicBlock *NCD = Blocks.front(); in findNearestCommonDominator() local57 NCD = PDT->findNearestCommonDominator(NCD, BB); in findNearestCommonDominator()60 if (PDT->isVirtualRoot(PDT->getNode(NCD))) in findNearestCommonDominator()64 return NCD; in findNearestCommonDominator()
752 const TreeNodePtr NCD = DT.getNode(NCDBlock); in InsertReachable() local753 assert(NCD); in InsertReachable()755 LLVM_DEBUG(dbgs() << "\t\tNCA == " << BlockNamePrinter(NCD) << "\n"); in InsertReachable()756 const unsigned NCDLevel = NCD->getLevel(); in InsertReachable()841 UpdateInsertion(DT, BUI, NCD, II); in InsertReachable()846 const TreeNodePtr NCD, InsertionInfo &II) { in UpdateInsertion()847 LLVM_DEBUG(dbgs() << "Updating NCD = " << BlockNamePrinter(NCD) << "\n"); in UpdateInsertion()851 << ") = " << BlockNamePrinter(NCD) << "\n"); in UpdateInsertion()852 TN->setIDom(NCD); in UpdateInsertion()946 const TreeNodePtr NCD = DT.getNode(NCDBlock); in DeleteEdge() local[all …]
19 # Next is a Pascal-style string with the NCD name. We want to capture that.
9238 for special NCD build.
10185 University of Rostock and Mark Frost of NCD.