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

12

/freebsd-10.0-release/contrib/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp320 ArrayRef<BasicBlock *> Preds,
334 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
368 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
396 ArrayRef<BasicBlock*> Preds, BranchInst *BI,
407 InVal = PN->getIncomingValueForBlock(Preds[0]);
408 for (unsigned i = 1, e = Preds.size(); i != e; ++i)
409 if (InVal != PN->getIncomingValueForBlock(Preds[i])) {
419 for (unsigned i = 0, e = Preds
319 UpdateAnalysisInformation(BasicBlock *OldBB, BasicBlock *NewBB, ArrayRef<BasicBlock *> Preds, Pass *P, bool &HasLoopExit) argument
395 UpdatePHINodes(BasicBlock *OrigBB, BasicBlock *NewBB, ArrayRef<BasicBlock*> Preds, BranchInst *BI, Pass *P, bool HasLoopExit) argument
454 SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds, const char *Suffix, Pass *P) argument
507 SplitLandingPadPredecessors(BasicBlock *OrigBB, ArrayRef<BasicBlock*> Preds, const char *Suffix1, const char *Suffix2, Pass *P, SmallVectorImpl<BasicBlock*> &NewBBs) argument
[all...]
H A DBreakCriticalEdges.cpp122 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB
125 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds, argument
146 PHINode::Create(PN->getType(), Preds.size(), "split",
149 for (unsigned i = 0, e = Preds.size(); i != e; ++i)
150 NewPN->addIncoming(V, Preds[i]);
355 SmallVector<BasicBlock *, 4> Preds; local
363 Preds.clear();
366 Preds.push_back(P);
372 // the edges. The Preds.empty() check is needed because a block
376 if (!Preds
[all...]
H A DLoopUnrollRuntime.cpp115 SmallVector<BasicBlock*, 4> Preds(pred_begin(Exit), pred_end(Exit));
117 SplitBlockPredecessors(Exit, Preds, ".unr-lcssa", P);
120 SplitLandingPadPredecessors(Exit, Preds, ".unr1-lcssa", ".unr2-lcssa",
H A DPromoteMemoryToRegister.cpp639 SmallVector<BasicBlock*, 16> Preds(pred_begin(BB), pred_end(BB));
644 std::sort(Preds.begin(), Preds.end());
647 // them from the Preds list.
649 // Do a log(n) search of the Preds list for the entry we want.
651 std::lower_bound(Preds.begin(), Preds.end(),
653 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i)&&
657 Preds.erase(EntIt);
669 for (unsigned pred = 0, e = Preds
[all...]
H A DSSAUpdater.cpp278 /// FindPredecessorBlocks - Put the predecessors of Info->BB into the Preds
279 /// vector, set Info->NumPreds, and allocate space in Info->Preds.
281 SmallVectorImpl<BasicBlock*> *Preds) {
287 Preds->push_back(SomePhi->getIncomingBlock(PI));
290 Preds->push_back(*PI);
280 FindPredecessorBlocks(BasicBlock *BB, SmallVectorImpl<BasicBlock*> *Preds) argument
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DScheduleDAG.cpp67 for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end();
121 Preds.push_back(D);
135 for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end();
146 Preds.erase(I);
201 for (SUnit::const_pred_iterator I = SU->Preds.begin(),
202 E = SU->Preds.end(); I != E; ++I) {
242 for (SUnit::const_pred_iterator I = Cur->Preds.begin(),
243 E = Cur->Preds
[all...]
H A DLatencyPriorityQueue.cpp57 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
H A DTailDuplication.cpp150 SmallSetVector<MachineBasicBlock*, 8> Preds(MBB->pred_begin(),
156 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
157 PE = Preds.end(); PI != PE; ++PI) {
177 if (CheckExtra && !Preds.count(PHIBB)) {
670 SmallVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(),
673 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
674 PE = Preds.end(); PI != PE; ++PI) {
759 SmallSetVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(),
761 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
762 PE = Preds
[all...]
H A DAggressiveAntiDepBreaker.cpp261 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
280 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
838 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
839 PE = PathSU->Preds.end(); P != PE; ++P) {
847 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
848 PE = PathSU->Preds.end(); P != PE; ++P) {
H A DCriticalAntiDepBreaker.cpp130 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
540 for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(),
541 PE = CriticalPathSU->Preds.end(); P != PE; ++P)
H A DMachineSSAUpdater.cpp282 /// FindPredecessorBlocks - Put the predecessors of BB into the Preds
285 SmallVectorImpl<MachineBasicBlock*> *Preds){
288 Preds->push_back(*PI);
284 FindPredecessorBlocks(MachineBasicBlock *BB, SmallVectorImpl<MachineBasicBlock*> *Preds) argument
/freebsd-10.0-release/contrib/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdaterImpl.h51 BBInfo **Preds; // Array[NumPreds] of predecessor blocks. member in class:llvm::SSAUpdaterImpl::BBInfo
56 NumPreds(0), Preds(0), PHITag(0) { }
111 SmallVector<BlkT*, 10> Preds; local
114 Preds.clear();
115 Traits::FindPredecessorBlocks(Info->BB, &Preds);
116 Info->NumPreds = Preds.size();
118 Info->Preds = 0;
120 Info->Preds = static_cast<BBInfo**>
125 BlkT *Pred = Preds[p];
130 Info->Preds[
[all...]
H A DBasicBlockUtils.h170 /// Preds array, which has NumPreds elements in it. The new block is given a
179 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds,
184 /// new basic blocks gets the predecessors listed in Preds. The other basic
195 void SplitLandingPadPredecessors(BasicBlock *OrigBB,ArrayRef<BasicBlock*> Preds,
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp215 Preds.addNode(V, G);
371 if (N->Preds.empty()) {
377 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end();
407 if (N->Preds.empty())
415 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end();
/freebsd-10.0-release/contrib/llvm/tools/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); }
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp73 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
158 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
218 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.cpp526 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
808 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
1021 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
1102 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
1264 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds
[all...]
H A DScheduleDAGFast.cpp162 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
285 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
357 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
476 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
H A DScheduleDAGVLIW.cpp177 if (SUnits[i].Preds.empty()) {
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCFG.h366 AdjacentBlocks Preds;
386 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false),
425 pred_iterator pred_begin() { return Preds.begin(); }
426 pred_iterator pred_end() { return Preds.end(); }
427 const_pred_iterator pred_begin() const { return Preds.begin(); }
428 const_pred_iterator pred_end() const { return Preds.end(); }
430 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); }
431 pred_reverse_iterator pred_rend() { return Preds.rend(); }
432 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); }
433 const_pred_reverse_iterator pred_rend() const { return Preds
[all...]
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h281 // Preds/Succs - The SUnits before/after us in the graph.
282 SmallVector<SDep, 4> Preds; // All sunit predecessors. member in class:llvm::SUnit
458 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i)
459 if (Preds[i].getSUnit() == N)
637 return Node->Preds[Operand].getSUnit();
651 return SUnitIterator(N, (unsigned)N->Preds.size());
664 return Node->Preds[Operand];
/freebsd-10.0-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp223 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end();
424 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
511 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
/freebsd-10.0-release/contrib/llvm/lib/Target/R600/
H A DAMDGPUStructurizeCFG.cpp474 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue]; local
480 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
694 BBPredicates &Preds = Predicates[Node->getEntry()]; local
695 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
707 BBPredicates &Preds = Predicates[Node->getEntry()]; local
714 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end();
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp117 const UniqueVector<BasicBlock *>&Preds,
600 const UniqueVector<BasicBlock *> &Preds,
607 size_t TableSize = Succs.size() * Preds.size();
626 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
627 (Preds.idFor(BB)-1)] = cast<Constant>(Counter);
597 buildEdgeLookupTable( Function *F, GlobalVariable *Counters, const UniqueVector<BasicBlock *> &Preds, const UniqueVector<BasicBlock *> &Succs) argument
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
H A DProfileInfo.h163 BType *const *Preds, unsigned NumPreds);

Completed in 371 milliseconds

12