Home
last modified time | relevance | path

Searched refs:Preds (Results 1 – 25 of 38) 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.cpp639 SmallVector<BasicBlock*, 16> Preds(pred_begin(BB), pred_end(BB)); in run() local
644 std::sort(Preds.begin(), Preds.end()); in run()
651 std::lower_bound(Preds.begin(), Preds.end(), in run()
653 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i)&& in run()
657 Preds.erase(EntIt); in run()
669 for (unsigned pred = 0, e = Preds.size(); pred != e; ++pred) in run()
670 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()
121 Preds.push_back(D); in addPred()
135 for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end(); in removePred()
146 Preds.erase(I); in removePred()
201 for (SUnit::const_pred_iterator I = SU->Preds.begin(), in setHeightDirty()
202 E = SU->Preds.end(); I != E; ++I) { in setHeightDirty()
242 for (SUnit::const_pred_iterator I = Cur->Preds.begin(), in ComputeDepth()
243 E = Cur->Preds.end(); I != E; ++I) { in ComputeDepth()
302 SUnit::pred_iterator BestI = Preds.begin(); in biasCriticalPath()
305 I = llvm::next(BestI), E = Preds.end(); I != E; ++I) { in biasCriticalPath()
[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.cpp261 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in AntiDepEdges()
280 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep()
838 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
839 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
847 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
848 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
DCriticalAntiDepBreaker.cpp130 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep()
540 for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(), in BreakAntiDependencies()
541 PE = CriticalPathSU->Preds.end(); P != PE; ++P) in BreakAntiDependencies()
DMachineSSAUpdater.cpp285 SmallVectorImpl<MachineBasicBlock*> *Preds){ in FindPredecessorBlocks() argument
288 Preds->push_back(*PI); in FindPredecessorBlocks()
/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.h179 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds,
195 void SplitLandingPadPredecessors(BasicBlock *OrigBB,ArrayRef<BasicBlock*> Preds,
/external/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp215 Preds.addNode(V, G); in addPredecessor()
371 if (N->Preds.empty()) { in trim()
377 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end(); in trim()
407 if (N->Preds.empty()) in trim()
415 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()
205 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
206 pred_iterator pred_end() { return Preds.end(); } in pred_end()
239 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); } in replacePredecessor()
/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.cpp526 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in ReleasePredecessors()
808 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in UnscheduleNodeBottomUp()
1021 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
1102 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
1264 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp()
1847 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CalcNodeSethiUllmanNumber()
1949 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in HighRegPressure()
1999 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in RegPressureDiff()
2043 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in scheduledNode()
2125 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in unscheduledNode()
[all …]
DScheduleDAGFast.cpp162 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in ReleasePredecessors()
285 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
357 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
476 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp()
DScheduleDAGVLIW.cpp177 if (SUnits[i].Preds.empty()) { in listScheduleTopDown()
/external/clang/include/clang/Analysis/
DCFG.h366 AdjacentBlocks Preds; variable
386 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false), in CFGBlock()
425 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
426 pred_iterator pred_end() { return Preds.end(); } in pred_end()
427 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin()
428 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end()
430 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); } in pred_rbegin()
431 pred_reverse_iterator pred_rend() { return Preds.rend(); } in pred_rend()
432 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); } in pred_rbegin()
433 const_pred_reverse_iterator pred_rend() const { return Preds.rend(); } in pred_rend()
[all …]
/external/llvm/lib/Target/R600/
DAMDGPUStructurizeCFG.cpp472 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue]; in insertConditions() local
478 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); in insertConditions()
692 BBPredicates &Preds = Predicates[Node->getEntry()]; in dominatesPredicates() local
693 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); in dominatesPredicates()
705 BBPredicates &Preds = Predicates[Node->getEntry()]; in isPredictableTrue() local
712 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end(); in isPredictableTrue()
/external/llvm/include/llvm/CodeGen/
DScheduleDAG.h282 SmallVector<SDep, 4> Preds; // All sunit predecessors.
457 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i)
458 if (Preds[i].getSUnit() == N)
636 return Node->Preds[Operand].getSUnit();
650 return SUnitIterator(N, (unsigned)N->Preds.size());
663 return Node->Preds[Operand];
/external/llvm/lib/Target/Hexagon/
DHexagonMachineScheduler.cpp223 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in releaseTopNode()
424 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
511 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in SchedulingCost()
DHexagonHardwareLoops.cpp1438 MBBVector Preds(Header->pred_begin(), Header->pred_end()); in createPreheaderForLoop() local
1445 for (MBBVector::iterator I = Preds.begin(), E = Preds.end(); I != E; ++I) { in createPreheaderForLoop()
1528 for (MBBVector::iterator I = Preds.begin(), E = Preds.end(); I != E; ++I) { in createPreheaderForLoop()
/external/llvm/lib/Transforms/Instrumentation/
DGCOVProfiling.cpp115 const UniqueVector<BasicBlock *>&Preds,
592 const UniqueVector<BasicBlock *> &Preds, in buildEdgeLookupTable() argument
599 size_t TableSize = Succs.size() * Preds.size(); in buildEdgeLookupTable()
618 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) + in buildEdgeLookupTable()
619 (Preds.idFor(BB)-1)] = cast<Constant>(Counter); in buildEdgeLookupTable()

12