Searched defs:Preds (Results 1 - 14 of 14) sorted by relevance

/external/llvm/lib/Transforms/Utils/
H A DBreakCriticalEdges.cpp90 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB
93 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds, argument
114 PHINode::Create(PN->getType(), Preds.size(), "split",
117 for (unsigned i = 0, e = Preds.size(); i != e; ++i)
118 NewPN->addIncoming(V, Preds[i]);
323 SmallVector<BasicBlock *, 4> Preds; local
331 Preds.clear();
334 Preds.push_back(P);
340 // the edges. The Preds.empty() check is needed because a block
344 if (!Preds
[all...]
H A DBasicBlockUtils.cpp305 ArrayRef<BasicBlock *> Preds,
319 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
353 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
381 ArrayRef<BasicBlock*> Preds, BranchInst *BI,
392 InVal = PN->getIncomingValueForBlock(Preds[0]);
393 for (unsigned i = 1, e = Preds.size(); i != e; ++i)
394 if (InVal != PN->getIncomingValueForBlock(Preds[i])) {
404 for (unsigned i = 0, e = Preds
304 UpdateAnalysisInformation(BasicBlock *OldBB, BasicBlock *NewBB, ArrayRef<BasicBlock *> Preds, Pass *P, bool &HasLoopExit) argument
380 UpdatePHINodes(BasicBlock *OrigBB, BasicBlock *NewBB, ArrayRef<BasicBlock*> Preds, BranchInst *BI, Pass *P, bool HasLoopExit) argument
439 SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds, const char *Suffix, Pass *P) argument
492 SplitLandingPadPredecessors(BasicBlock *OrigBB, ArrayRef<BasicBlock*> Preds, const char *Suffix1, const char *Suffix2, Pass *P, SmallVectorImpl<BasicBlock*> &NewBBs) argument
[all...]
H A DSSAUpdater.cpp241 /// FindPredecessorBlocks - Put the predecessors of Info->BB into the Preds
242 /// vector, set Info->NumPreds, and allocate space in Info->Preds.
244 SmallVectorImpl<BasicBlock*> *Preds) {
250 Preds->push_back(SomePhi->getIncomingBlock(PI));
253 Preds->push_back(*PI);
243 FindPredecessorBlocks(BasicBlock *BB, SmallVectorImpl<BasicBlock*> *Preds) argument
/external/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...]
/external/llvm/lib/MC/
H A DMCObjectDisassembler.cpp103 BBInfoSetTy Preds; member in struct:__anon22217::BBInfo
107 Succ.Preds.insert(this);
197 for (BBInfoSetTy::iterator PI = BBI->Preds.begin(), PE = BBI->Preds.end();
211 for (BBInfoSetTy::iterator PI = BBI->Preds.begin(), PE = BBI->Preds.end();
/external/llvm/lib/Target/PowerPC/
H A DPPCCTRLoops.cpp548 SmallVector<MachineBasicBlock *, 8> Preds; local
584 if (!CheckPreds && Preds.empty())
599 Preds.push_back(*PI);
603 MBB = Preds.pop_back_val();
608 } while (!Preds.empty());
/external/llvm/lib/CodeGen/
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
H A DMachineVerifier.cpp124 BlockSet Preds, Succs; member in struct:__anon22109::MachineVerifier::BBInfo
469 MInfo.Preds.insert(I->pred_begin(), I->pred_end());
470 if (MInfo.Preds.size() != I->pred_size())
520 if (!MBBInfoMap[*I].Preds.count(MBB)) {
/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/include/llvm/CodeGen/
H A DScheduleDAG.h262 // Preds/Succs - The SUnits before/after us in the graph.
263 SmallVector<SDep, 4> Preds; // All sunit predecessors. member in class:llvm::SUnit
439 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i)
440 if (Preds[i].getSUnit() == N)
618 return Node->Preds[Operand].getSUnit();
632 return SUnitIterator(N, (unsigned)N->Preds.size());
645 return Node->Preds[Operand];
/external/llvm/lib/Analysis/
H A DProfileInfo.cpp443 BasicBlock *const *Preds,
459 const BasicBlock * Pred = Preds[pred];
441 splitBlock(const BasicBlock *BB, const BasicBlock* NewBB, BasicBlock *const *Preds, unsigned NumPreds) argument
/external/llvm/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp118 const UniqueVector<BasicBlock *>&Preds,
622 const UniqueVector<BasicBlock *> &Preds,
629 size_t TableSize = Succs.size() * Preds.size();
648 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
649 (Preds.idFor(BB)-1)] = cast<Constant>(Counter);
619 buildEdgeLookupTable( Function *F, GlobalVariable *Counters, const UniqueVector<BasicBlock *> &Preds, const UniqueVector<BasicBlock *> &Succs) argument
/external/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp464 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue]; local
470 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
680 BBPredicates &Preds = Predicates[Node->getEntry()]; local
681 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
692 BBPredicates &Preds = Predicates[Node->getEntry()]; local
699 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end();
/external/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp671 SmallVector<BasicBlock *, 2> Preds; member in class:__anon22558::BBState
759 edge_iterator pred_begin() { return Preds.begin(); }
760 edge_iterator pred_end() { return Preds.end(); }
765 void addPred(BasicBlock *Pred) { Preds.push_back(Pred); }

Completed in 432 milliseconds