Searched refs:Preds (Results 1 - 25 of 41) sorted by relevance

12

/external/llvm/lib/CodeGen/
H A DScheduleDAG.cpp68 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end();
122 Preds.push_back(D);
136 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end();
147 Preds.erase(I);
202 for (SUnit::const_pred_iterator I = SU->Preds.begin(),
203 E = SU->Preds.end(); I != E; ++I) {
243 for (SUnit::const_pred_iterator I = Cur->Preds.begin(),
244 E = Cur->Preds
[all...]
H A DLatencyPriorityQueue.cpp58 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
H A DTailDuplication.cpp164 SmallSetVector<MachineBasicBlock*, 8> Preds(MBB->pred_begin(),
170 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
171 PE = Preds.end(); PI != PE; ++PI) {
191 if (CheckExtra && !Preds.count(PHIBB)) {
676 SmallVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(),
679 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
680 PE = Preds.end(); PI != PE; ++PI) {
766 SmallSetVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(),
768 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
769 PE = Preds
[all...]
H A DAggressiveAntiDepBreaker.cpp262 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
281 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
848 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
849 PE = PathSU->Preds.end(); P != PE; ++P) {
857 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
858 PE = PathSU->Preds.end(); P != PE; ++P) {
/external/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdaterImpl.h53 BBInfo **Preds; // Array[NumPreds] of predecessor blocks. member in class:llvm::SSAUpdaterImpl::BBInfo
58 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
113 SmallVector<BlkT*, 10> Preds; local
116 Preds.clear();
117 Traits::FindPredecessorBlocks(Info->BB, &Preds);
118 Info->NumPreds = Preds.size();
120 Info->Preds = nullptr;
122 Info->Preds = static_cast<BBInfo**>
127 BlkT *Pred = Preds[p];
132 Info->Preds[
[all...]
H A DBasicBlockUtils.h149 /// Preds array, which has NumPreds elements in it. The new block is given a
158 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds,
163 /// new basic blocks gets the predecessors listed in Preds. The other basic
174 void SplitLandingPadPredecessors(BasicBlock *OrigBB,ArrayRef<BasicBlock*> Preds,
/external/llvm/lib/Target/PowerPC/
H A DPPCHazardRecognizers.cpp40 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) {
41 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit());
45 if (!SU->Preds[i].isNormalMemory() && !SU->Preds[i].isBarrier())
49 if (SU->Preds[i].getSUnit() == CurGroup[j])
66 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) {
67 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit());
71 if (SU->Preds[i].isCtrl())
75 if (SU->Preds[i].getSUnit() == CurGroup[j])
H A DPPCCTRLoops.cpp574 SmallVector<MachineBasicBlock *, 8> Preds; local
610 if (!CheckPreds && Preds.empty())
625 Preds.push_back(*PI);
629 MBB = Preds.pop_back_val();
634 } while (!Preds.empty());
/external/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp308 ArrayRef<BasicBlock *> Preds,
322 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
356 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
384 ArrayRef<BasicBlock*> Preds, BranchInst *BI,
388 SmallPtrSet<BasicBlock *, 16> PredSet(Preds.begin(), Preds.end());
396 InVal = PN->getIncomingValueForBlock(Preds[0]);
432 PHINode::Create(PN->getType(), Preds
307 UpdateAnalysisInformation(BasicBlock *OldBB, BasicBlock *NewBB, ArrayRef<BasicBlock *> Preds, Pass *P, bool &HasLoopExit) argument
383 UpdatePHINodes(BasicBlock *OrigBB, BasicBlock *NewBB, ArrayRef<BasicBlock*> Preds, BranchInst *BI, Pass *P, bool HasLoopExit) argument
463 SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds, const char *Suffix, Pass *P) argument
516 SplitLandingPadPredecessors(BasicBlock *OrigBB, ArrayRef<BasicBlock*> Preds, const char *Suffix1, const char *Suffix2, Pass *P, SmallVectorImpl<BasicBlock*> &NewBBs) argument
[all...]
H A DFlattenCFG.cpp137 SmallPtrSet<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB));
138 for (SmallPtrSetIterator<BasicBlock *> PI = Preds.begin(), PE = Preds.end();
155 if (UnCondBlock || !PP || (Preds.count(PP) == 0) ||
171 if (PP && Preds.count(PP)) {
207 if (Preds.count(PS) == 0) {
H A DBreakCriticalEdges.cpp89 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB
92 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds, argument
113 PHINode::Create(PN->getType(), Preds.size(), "split",
116 for (unsigned i = 0, e = Preds.size(); i != e; ++i)
117 NewPN->addIncoming(V, Preds[i]);
H A DLoopUnrollRuntime.cpp116 SmallVector<BasicBlock*, 4> Preds(pred_begin(Exit), pred_end(Exit));
118 SplitBlockPredecessors(Exit, Preds, ".unr-lcssa", P);
121 SplitLandingPadPredecessors(Exit, Preds, ".unr1-lcssa", ".unr2-lcssa",
H A DPromoteMemoryToRegister.cpp725 SmallVector<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB));
730 std::sort(Preds.begin(), Preds.end());
733 // them from the Preds list.
735 // Do a log(n) search of the Preds list for the entry we want.
737 Preds.begin(), Preds.end(), SomePHI->getIncomingBlock(i));
738 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i) &&
742 Preds.erase(EntIt);
754 for (unsigned pred = 0, e = Preds
[all...]
H A DSSAUpdater.cpp240 /// FindPredecessorBlocks - Put the predecessors of Info->BB into the Preds
241 /// vector, set Info->NumPreds, and allocate space in Info->Preds.
243 SmallVectorImpl<BasicBlock*> *Preds) {
249 Preds->push_back(SomePhi->getIncomingBlock(PI));
252 Preds->push_back(*PI);
242 FindPredecessorBlocks(BasicBlock *BB, SmallVectorImpl<BasicBlock*> *Preds) argument
/external/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp220 Preds.addNode(V, G);
375 if (N->Preds.empty()) {
381 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end();
411 if (N->Preds.empty())
419 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end();
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h117 /// Preds - The predecessors of this node.
118 NodeGroup Preds; member in class:clang::ento::ExplodedNode
181 unsigned pred_size() const { return Preds.size(); }
183 bool pred_empty() const { return Preds.empty(); }
209 pred_iterator pred_begin() { return Preds.begin(); }
210 pred_iterator pred_end() { return Preds.end(); }
243 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); }
/external/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp74 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
159 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
219 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
511 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
546 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU));
H A DScheduleDAGRRList.cpp528 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
810 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
1023 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
1104 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
1266 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds
[all...]
H A DScheduleDAGFast.cpp163 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
286 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
358 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
477 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
/external/clang/include/clang/Analysis/
H A DCFG.h474 AdjacentBlocks Preds; member in class:clang::CFGBlock::ElementList
494 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false),
533 pred_iterator pred_begin() { return Preds.begin(); }
534 pred_iterator pred_end() { return Preds.end(); }
535 const_pred_iterator pred_begin() const { return Preds.begin(); }
536 const_pred_iterator pred_end() const { return Preds.end(); }
538 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); }
539 pred_reverse_iterator pred_rend() { return Preds.rend(); }
540 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); }
541 const_pred_reverse_iterator pred_rend() const { return Preds
[all...]
/external/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h268 // Preds/Succs - The SUnits before/after us in the graph.
269 SmallVector<SDep, 4> Preds; // All sunit predecessors. variable
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/MC/MCAnalysis/
H A DMCObjectDisassembler.cpp162 BBInfoSetTy Preds; member in struct:__anon25875::BBInfo
169 Succ.Preds.insert(this);
278 for (BBInfoSetTy::iterator PI = BBI->Preds.begin(), PE = BBI->Preds.end();
293 for (BBInfoSetTy::iterator PI = BBI->Preds.begin(), PE = BBI->Preds.end();
H A DMCModuleYAML.cpp110 std::vector<yaml::Hex64> Preds; member in struct:llvm::MCModuleYAML::BasicBlock
202 IO.mapRequired("Preds", BB.Preds);
347 BB.Preds.push_back((*PI)->getInsts()->getBeginAddr());
420 for (AddrIt PI = BBI->Preds.begin(), PE = BBI->Preds.end(); PI != PE;
/external/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp227 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end();
428 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
513 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
/external/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp468 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue]; local
474 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
685 BBPredicates &Preds = Predicates[Node->getEntry()]; local
686 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
697 BBPredicates &Preds = Predicates[Node->getEntry()]; local
704 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end();

Completed in 330 milliseconds

12