Home
last modified time | relevance | path

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

12

/external/llvm/lib/Transforms/Utils/
DBasicBlockUtils.cpp320 ArrayRef<BasicBlock *> Preds, in UpdateAnalysisInformation() argument
334 i = Preds.begin(), e = Preds.end(); i != e; ++i) { in UpdateAnalysisInformation()
368 i = Preds.begin(), e = Preds.end(); i != e; ++i) { in UpdateAnalysisInformation()
396 ArrayRef<BasicBlock*> Preds, BranchInst *BI, in UpdatePHINodes() argument
407 InVal = PN->getIncomingValueForBlock(Preds[0]); in UpdatePHINodes()
408 for (unsigned i = 1, e = Preds.size(); i != e; ++i) in UpdatePHINodes()
409 if (InVal != PN->getIncomingValueForBlock(Preds[i])) { in UpdatePHINodes()
419 for (unsigned i = 0, e = Preds.size(); i != e; ++i) in UpdatePHINodes()
420 PN->removeIncomingValue(Preds[i], false); in UpdatePHINodes()
425 PHINode::Create(PN->getType(), Preds.size(), PN->getName() + ".ph", BI); in UpdatePHINodes()
[all …]
DBreakCriticalEdges.cpp125 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds, in createPHIsForSplitLoopExit() argument
146 PHINode::Create(PN->getType(), Preds.size(), "split", in createPHIsForSplitLoopExit()
149 for (unsigned i = 0, e = Preds.size(); i != e; ++i) in createPHIsForSplitLoopExit()
150 NewPN->addIncoming(V, Preds[i]); in createPHIsForSplitLoopExit()
355 SmallVector<BasicBlock *, 4> Preds; in SplitCriticalEdge() local
363 Preds.clear(); in SplitCriticalEdge()
366 Preds.push_back(P); in SplitCriticalEdge()
376 if (!Preds.empty() && HasPredOutsideOfLoop) { in SplitCriticalEdge()
379 SplitBlockPredecessors(Exit, Preds, "split", P); in SplitCriticalEdge()
381 createPHIsForSplitLoopExit(Preds, NewExitBB, Exit); in SplitCriticalEdge()
[all …]
DPromoteMemoryToRegister.cpp631 SmallVector<BasicBlock*, 16> Preds(pred_begin(BB), pred_end(BB)); in run() local
636 std::sort(Preds.begin(), Preds.end()); in run()
643 std::lower_bound(Preds.begin(), Preds.end(), in run()
645 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i)&& in run()
649 Preds.erase(EntIt); in run()
661 for (unsigned pred = 0, e = Preds.size(); pred != e; ++pred) in run()
662 SomePHI->addIncoming(UndefVal, Preds[pred]); in run()
DLoopUnrollRuntime.cpp115 SmallVector<BasicBlock*, 4> Preds(pred_begin(Exit), pred_end(Exit)); in ConnectProlog() local
117 SplitBlockPredecessors(Exit, Preds, ".unr-lcssa", P); in ConnectProlog()
120 SplitLandingPadPredecessors(Exit, Preds, ".unr1-lcssa", ".unr2-lcssa", in ConnectProlog()
DSSAUpdater.cpp281 SmallVectorImpl<BasicBlock*> *Preds) { in FindPredecessorBlocks() argument
287 Preds->push_back(SomePhi->getIncomingBlock(PI)); in FindPredecessorBlocks()
290 Preds->push_back(*PI); in FindPredecessorBlocks()
/external/llvm/lib/CodeGen/
DScheduleDAG.cpp67 for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end(); in addPred()
107 Preds.push_back(D); in addPred()
121 for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end(); in removePred()
138 Preds.erase(I); in removePred()
185 for (SUnit::const_pred_iterator I = SU->Preds.begin(), in setHeightDirty()
186 E = SU->Preds.end(); I != E; ++I) { in setHeightDirty()
226 for (SUnit::const_pred_iterator I = Cur->Preds.begin(), in ComputeDepth()
227 E = Cur->Preds.end(); I != E; ++I) { in ComputeDepth()
300 if (Preds.size() != 0) { in dumpAll()
302 for (SUnit::const_succ_iterator I = Preds.begin(), E = Preds.end(); in dumpAll()
[all …]
DTailDuplication.cpp150 SmallSetVector<MachineBasicBlock*, 8> Preds(MBB->pred_begin(), in VerifyPHIs() local
156 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in VerifyPHIs()
157 PE = Preds.end(); PI != PE; ++PI) { in VerifyPHIs()
177 if (CheckExtra && !Preds.count(PHIBB)) { in VerifyPHIs()
670 SmallVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), in duplicateSimpleBB() local
673 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in duplicateSimpleBB()
674 PE = Preds.end(); PI != PE; ++PI) { in duplicateSimpleBB()
759 SmallSetVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), in TailDuplicate() local
761 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in TailDuplicate()
762 PE = Preds.end(); PI != PE; ++PI) { in TailDuplicate()
[all …]
DLatencyPriorityQueue.cpp57 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
DAggressiveAntiDepBreaker.cpp278 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in AntiDepEdges()
297 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep()
855 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
856 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
864 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
865 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
DCriticalAntiDepBreaker.cpp146 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep()
546 for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(), in BreakAntiDependencies()
547 PE = CriticalPathSU->Preds.end(); P != PE; ++P) in BreakAntiDependencies()
DMachineSSAUpdater.cpp286 SmallVectorImpl<MachineBasicBlock*> *Preds){ in FindPredecessorBlocks() argument
289 Preds->push_back(*PI); in FindPredecessorBlocks()
DMachineScheduler.cpp485 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in releasePredecessors()
597 if (I->Preds.empty()) in releaseRoots()
907 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in releaseTopNode()
/external/llvm/include/llvm/Transforms/Utils/
DSSAUpdaterImpl.h51 BBInfo **Preds; // Array[NumPreds] of predecessor blocks. variable
56 NumPreds(0), Preds(0), PHITag(0) { } in BBInfo()
111 SmallVector<BlkT*, 10> Preds; in BuildBlockList() local
114 Preds.clear(); in BuildBlockList()
115 Traits::FindPredecessorBlocks(Info->BB, &Preds); in BuildBlockList()
116 Info->NumPreds = Preds.size(); in BuildBlockList()
118 Info->Preds = 0; in BuildBlockList()
120 Info->Preds = static_cast<BBInfo**> in BuildBlockList()
125 BlkT *Pred = Preds[p]; in BuildBlockList()
130 Info->Preds[p] = BBMapBucket.second; in BuildBlockList()
[all …]
DBasicBlockUtils.h178 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds,
194 void SplitLandingPadPredecessors(BasicBlock *OrigBB,ArrayRef<BasicBlock*> Preds,
/external/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp183 Preds.addNode(V, G); in addPredecessor()
353 if (N->Preds.empty()) { in TrimInternal()
359 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end(); in TrimInternal()
389 if (N->Preds.empty()) in TrimInternal()
397 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end(); in TrimInternal()
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h118 NodeGroup Preds; variable
178 unsigned pred_size() const { return Preds.size(); } in pred_size()
180 bool pred_empty() const { return Preds.empty(); } in pred_empty()
202 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
203 pred_iterator pred_end() { return Preds.end(); } in pred_end()
236 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); } in replacePredecessor()
/external/clang/include/clang/Analysis/
DCFG.h334 AdjacentBlocks Preds; variable
354 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false), in CFGBlock()
393 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
394 pred_iterator pred_end() { return Preds.end(); } in pred_end()
395 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin()
396 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end()
398 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); } in pred_rbegin()
399 pred_reverse_iterator pred_rend() { return Preds.rend(); } in pred_rend()
400 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); } in pred_rbegin()
401 const_pred_reverse_iterator pred_rend() const { return Preds.rend(); } in pred_rend()
[all …]
/external/llvm/lib/CodeGen/SelectionDAG/
DResourcePriorityQueue.cpp73 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in numberRCValPredInSU()
158 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in numberCtrlPredInSU()
218 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.cpp507 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in ReleasePredecessors()
787 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in UnscheduleNodeBottomUp()
1001 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
1080 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
1241 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp()
1815 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CalcNodeSethiUllmanNumber()
1917 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in HighRegPressure()
1967 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in RegPressureDiff()
2011 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in scheduledNode()
2093 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in unscheduledNode()
[all …]
DScheduleDAGFast.cpp157 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in ReleasePredecessors()
280 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
350 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
466 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp()
DScheduleDAGVLIW.cpp175 if (SUnits[i].Preds.empty()) { in listScheduleTopDown()
/external/llvm/include/llvm/CodeGen/
DScheduleDAG.h258 SmallVector<SDep, 4> Preds; // All sunit predecessors.
422 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i)
423 if (Preds[i].getSUnit() == N)
607 return Node->Preds[Operand].getSUnit();
621 return SUnitIterator(N, (unsigned)N->Preds.size());
634 return Node->Preds[Operand];
/external/llvm/lib/Target/Hexagon/
DHexagonMachineScheduler.cpp110 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in releasePredecessors()
322 if (I->Preds.empty()) in releaseRoots()
484 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in releaseTopNode()
683 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
770 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in SchedulingCost()
/external/llvm/lib/Transforms/Instrumentation/
DGCOVProfiling.cpp86 const UniqueVector<BasicBlock *> &Preds,
534 const UniqueVector<BasicBlock *> &Preds, in buildEdgeLookupTable() argument
543 Int64PtrTy, Succs.size() * Preds.size()); in buildEdgeLookupTable()
545 Constant **EdgeTable = new Constant*[Succs.size() * Preds.size()]; in buildEdgeLookupTable()
547 for (int i = 0, ie = Succs.size() * Preds.size(); i != ie; ++i) in buildEdgeLookupTable()
560 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) + in buildEdgeLookupTable()
561 (Preds.idFor(BB)-1)] = cast<Constant>(Counter); in buildEdgeLookupTable()
567 ArrayRef<Constant*> V(&EdgeTable[0], Succs.size() * Preds.size()); in buildEdgeLookupTable()
/external/llvm/lib/VMCore/
DVerifier.cpp731 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB)); in visitBasicBlock() local
733 std::sort(Preds.begin(), Preds.end()); in visitBasicBlock()
740 Assert1(PN->getNumIncomingValues() == Preds.size(), in visitBasicBlock()
765 Assert3(Values[i].first == Preds[i], in visitBasicBlock()
767 Values[i].first, Preds[i]); in visitBasicBlock()

12