Home
last modified time | relevance | path

Searched refs:Preds (Results 1 – 25 of 42) sorted by relevance

12

/external/llvm/lib/CodeGen/
DScheduleDAG.cpp68 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end(); in addPred()
122 Preds.push_back(D); in addPred()
136 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end(); in removePred()
147 Preds.erase(I); in removePred()
202 for (SUnit::const_pred_iterator I = SU->Preds.begin(), in setHeightDirty()
203 E = SU->Preds.end(); I != E; ++I) { in setHeightDirty()
243 for (SUnit::const_pred_iterator I = Cur->Preds.begin(), in ComputeDepth()
244 E = Cur->Preds.end(); I != E; ++I) { in ComputeDepth()
303 SUnit::pred_iterator BestI = Preds.begin(); in biasCriticalPath()
305 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E; in biasCriticalPath()
[all …]
DTailDuplication.cpp164 SmallSetVector<MachineBasicBlock*, 8> Preds(MBB->pred_begin(), in VerifyPHIs() local
170 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in VerifyPHIs()
171 PE = Preds.end(); PI != PE; ++PI) { in VerifyPHIs()
191 if (CheckExtra && !Preds.count(PHIBB)) { in VerifyPHIs()
676 SmallVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), in duplicateSimpleBB() local
679 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in duplicateSimpleBB()
680 PE = Preds.end(); PI != PE; ++PI) { in duplicateSimpleBB()
766 SmallSetVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), in TailDuplicate() local
768 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in TailDuplicate()
769 PE = Preds.end(); PI != PE; ++PI) { in TailDuplicate()
[all …]
DLatencyPriorityQueue.cpp58 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
DAggressiveAntiDepBreaker.cpp262 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in AntiDepEdges()
281 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep()
848 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
849 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
857 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
858 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
DCriticalAntiDepBreaker.cpp138 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep()
586 for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(), in BreakAntiDependencies()
587 PE = CriticalPathSU->Preds.end(); P != PE; ++P) in BreakAntiDependencies()
/external/llvm/include/llvm/Transforms/Utils/
DSSAUpdaterImpl.h53 BBInfo **Preds; // Array[NumPreds] of predecessor blocks. variable
58 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {} in BBInfo()
113 SmallVector<BlkT*, 10> Preds; in BuildBlockList() local
116 Preds.clear(); in BuildBlockList()
117 Traits::FindPredecessorBlocks(Info->BB, &Preds); in BuildBlockList()
118 Info->NumPreds = Preds.size(); in BuildBlockList()
120 Info->Preds = nullptr; in BuildBlockList()
122 Info->Preds = static_cast<BBInfo**> in BuildBlockList()
127 BlkT *Pred = Preds[p]; in BuildBlockList()
132 Info->Preds[p] = BBMapBucket.second; in BuildBlockList()
[all …]
DBasicBlockUtils.h158 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds,
174 void SplitLandingPadPredecessors(BasicBlock *OrigBB,ArrayRef<BasicBlock*> Preds,
/external/llvm/lib/Transforms/Utils/
DBasicBlockUtils.cpp308 ArrayRef<BasicBlock *> Preds, in UpdateAnalysisInformation() argument
322 i = Preds.begin(), e = Preds.end(); i != e; ++i) { in UpdateAnalysisInformation()
356 i = Preds.begin(), e = Preds.end(); i != e; ++i) { in UpdateAnalysisInformation()
384 ArrayRef<BasicBlock*> Preds, BranchInst *BI, in UpdatePHINodes() argument
388 SmallPtrSet<BasicBlock *, 16> PredSet(Preds.begin(), Preds.end()); in UpdatePHINodes()
396 InVal = PN->getIncomingValueForBlock(Preds[0]); in UpdatePHINodes()
432 PHINode::Create(PN->getType(), Preds.size(), PN->getName() + ".ph", BI); in UpdatePHINodes()
464 ArrayRef<BasicBlock*> Preds, in SplitBlockPredecessors() argument
474 for (unsigned i = 0, e = Preds.size(); i != e; ++i) { in SplitBlockPredecessors()
478 assert(!isa<IndirectBrInst>(Preds[i]->getTerminator()) && in SplitBlockPredecessors()
[all …]
DFlattenCFG.cpp137 SmallPtrSet<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in FlattenParallelAndOr() local
138 for (SmallPtrSetIterator<BasicBlock *> PI = Preds.begin(), PE = Preds.end(); in FlattenParallelAndOr()
155 if (UnCondBlock || !PP || (Preds.count(PP) == 0) || in FlattenParallelAndOr()
171 if (PP && Preds.count(PP)) { in FlattenParallelAndOr()
207 if (Preds.count(PS) == 0) { in FlattenParallelAndOr()
DBreakCriticalEdges.cpp92 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds, in createPHIsForSplitLoopExit() argument
113 PHINode::Create(PN->getType(), Preds.size(), "split", in createPHIsForSplitLoopExit()
116 for (unsigned i = 0, e = Preds.size(); i != e; ++i) in createPHIsForSplitLoopExit()
117 NewPN->addIncoming(V, Preds[i]); in createPHIsForSplitLoopExit()
DPromoteMemoryToRegister.cpp725 SmallVector<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in run() local
730 std::sort(Preds.begin(), Preds.end()); in run()
737 Preds.begin(), Preds.end(), SomePHI->getIncomingBlock(i)); in run()
738 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i) && in run()
742 Preds.erase(EntIt); in run()
754 for (unsigned pred = 0, e = Preds.size(); pred != e; ++pred) in run()
755 SomePHI->addIncoming(UndefVal, Preds[pred]); in run()
DLoopUnrollRuntime.cpp116 SmallVector<BasicBlock*, 4> Preds(pred_begin(Exit), pred_end(Exit)); in ConnectProlog() local
118 SplitBlockPredecessors(Exit, Preds, ".unr-lcssa", P); in ConnectProlog()
121 SplitLandingPadPredecessors(Exit, Preds, ".unr1-lcssa", ".unr2-lcssa", in ConnectProlog()
/external/llvm/lib/Target/PowerPC/
DPPCHazardRecognizers.cpp40 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) { in isLoadAfterStore()
41 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit()); in isLoadAfterStore()
45 if (!SU->Preds[i].isNormalMemory() && !SU->Preds[i].isBarrier()) in isLoadAfterStore()
49 if (SU->Preds[i].getSUnit() == CurGroup[j]) in isLoadAfterStore()
66 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) { in isBCTRAfterSet()
67 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit()); in isBCTRAfterSet()
71 if (SU->Preds[i].isCtrl()) in isBCTRAfterSet()
75 if (SU->Preds[i].getSUnit() == CurGroup[j]) in isBCTRAfterSet()
DPPCCTRLoops.cpp574 SmallVector<MachineBasicBlock *, 8> Preds; in verifyCTRBranch() local
610 if (!CheckPreds && Preds.empty()) in verifyCTRBranch()
625 Preds.push_back(*PI); in verifyCTRBranch()
629 MBB = Preds.pop_back_val(); in verifyCTRBranch()
634 } while (!Preds.empty()); in verifyCTRBranch()
/external/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp220 Preds.addNode(V, G); in addPredecessor()
375 if (N->Preds.empty()) { in trim()
381 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end(); in trim()
411 if (N->Preds.empty()) in trim()
419 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end(); in trim()
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h118 NodeGroup Preds; variable
181 unsigned pred_size() const { return Preds.size(); } in pred_size()
183 bool pred_empty() const { return Preds.empty(); } in pred_empty()
209 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
210 pred_iterator pred_end() { return Preds.end(); } in pred_end()
243 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); } in replacePredecessor()
/external/llvm/lib/CodeGen/SelectionDAG/
DResourcePriorityQueue.cpp74 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in numberRCValPredInSU()
159 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in numberCtrlPredInSU()
219 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
511 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in scheduledNode()
546 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU)); in scheduledNode()
DScheduleDAGRRList.cpp528 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in ReleasePredecessors()
810 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in UnscheduleNodeBottomUp()
1023 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
1104 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
1266 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp()
1841 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CalcNodeSethiUllmanNumber()
1943 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in HighRegPressure()
1993 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in RegPressureDiff()
2037 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in scheduledNode()
2119 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in unscheduledNode()
[all …]
DScheduleDAGFast.cpp163 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in ReleasePredecessors()
286 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
358 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
477 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp()
/external/clang/include/clang/Analysis/
DCFG.h474 AdjacentBlocks Preds; variable
494 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false), in CFGBlock()
533 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
534 pred_iterator pred_end() { return Preds.end(); } in pred_end()
535 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin()
536 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end()
538 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); } in pred_rbegin()
539 pred_reverse_iterator pred_rend() { return Preds.rend(); } in pred_rend()
540 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); } in pred_rbegin()
541 const_pred_reverse_iterator pred_rend() const { return Preds.rend(); } in pred_rend()
[all …]
/external/llvm/lib/Transforms/Scalar/
DStructurizeCFG.cpp468 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue]; in insertConditions() local
474 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); in insertConditions()
685 BBPredicates &Preds = Predicates[Node->getEntry()]; in dominatesPredicates() local
686 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); in dominatesPredicates()
697 BBPredicates &Preds = Predicates[Node->getEntry()]; in isPredictableTrue() local
704 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end(); in isPredictableTrue()
/external/llvm/include/llvm/CodeGen/
DScheduleDAG.h269 SmallVector<SDep, 4> Preds; // All sunit predecessors.
453 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i)
454 if (Preds[i].getSUnit() == N)
632 return Node->Preds[Operand].getSUnit();
646 return SUnitIterator(N, (unsigned)N->Preds.size());
659 return Node->Preds[Operand];
/external/llvm/lib/Target/Hexagon/
DHexagonMachineScheduler.cpp227 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in releaseTopNode()
428 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
513 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in SchedulingCost()
/external/llvm/lib/MC/MCAnalysis/
DMCObjectDisassembler.cpp162 BBInfoSetTy Preds; member
169 Succ.Preds.insert(this); in addSucc()
278 for (BBInfoSetTy::iterator PI = BBI->Preds.begin(), PE = BBI->Preds.end(); in buildCFG()
293 for (BBInfoSetTy::iterator PI = BBI->Preds.begin(), PE = BBI->Preds.end(); in buildCFG()
DMCModuleYAML.cpp110 std::vector<yaml::Hex64> Preds; member
202 IO.mapRequired("Preds", BB.Preds); in mapping()
347 BB.Preds.push_back((*PI)->getInsts()->getBeginAddr()); in dumpFunction()
420 for (AddrIt PI = BBI->Preds.begin(), PE = BBI->Preds.end(); PI != PE; in parse()

12