Searched refs:NCD (Results 1 – 5 of 5) sorted by relevance
99 MachineBasicBlock *NCD = Blocks.front(); in findNearestCommonDominator() local101 NCD = Base::findNearestCommonDominator(NCD, BB); in findNearestCommonDominator()104 if (isVirtualRoot(getNode(NCD))) in findNearestCommonDominator()108 return NCD; in findNearestCommonDominator()
733 const TreeNodePtr NCD = DT.getNode(NCDBlock); in InsertReachable() local734 assert(NCD); in InsertReachable()736 LLVM_DEBUG(dbgs() << "\t\tNCA == " << BlockNamePrinter(NCD) << "\n"); in InsertReachable()737 const unsigned NCDLevel = NCD->getLevel(); in InsertReachable()822 UpdateInsertion(DT, BUI, NCD, II); in InsertReachable()827 const TreeNodePtr NCD, InsertionInfo &II) { in UpdateInsertion()828 LLVM_DEBUG(dbgs() << "Updating NCD = " << BlockNamePrinter(NCD) << "\n"); in UpdateInsertion()832 << ") = " << BlockNamePrinter(NCD) << "\n"); in UpdateInsertion()833 TN->setIDom(NCD); in UpdateInsertion()927 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.
10360 University of Rostock and Mark Frost of NCD.
10134 06d7 Network Computing Devices (NCD)