| /external/llvm/include/llvm/Transforms/Utils/ |
| H A D | SSAUpdaterImpl.h | 51 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/Transforms/Utils/ |
| H A D | BreakCriticalEdges.cpp | 122 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB
125 static void CreatePHIsForSplitLoopExit(SmallVectorImpl<BasicBlock *> &Preds, argument
143 PHINode *NewPN = PHINode::Create(PN->getType(), Preds.size(), "split",
145 for (unsigned i = 0, e = Preds.size(); i != e; ++i)
146 NewPN->addIncoming(V, Preds[i]);
352 SmallVector<BasicBlock *, 4> Preds; local
360 Preds.clear();
363 Preds.push_back(P);
369 // the edges. The Preds.empty() check is needed because a block
373 if (!Preds
[all...] |
| H A D | BasicBlockUtils.cpp | 320 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 D | SSAUpdater.cpp | 275 /// FindPredecessorBlocks - Put the predecessors of Info->BB into the Preds
276 /// vector, set Info->NumPreds, and allocate space in Info->Preds.
278 SmallVectorImpl<BasicBlock*> *Preds) {
284 Preds->push_back(SomePhi->getIncomingBlock(PI));
287 Preds->push_back(*PI);
277 FindPredecessorBlocks(BasicBlock *BB, SmallVectorImpl<BasicBlock*> *Preds) argument
|
| /external/llvm/lib/CodeGen/ |
| H A D | MachineSSAUpdater.cpp | 288 /// FindPredecessorBlocks - Put the predecessors of BB into the Preds
291 SmallVectorImpl<MachineBasicBlock*> *Preds){
294 Preds->push_back(*PI);
290 FindPredecessorBlocks(MachineBasicBlock *BB, SmallVectorImpl<MachineBasicBlock*> *Preds) argument
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ExplodedGraph.h | 112 /// Preds - The predecessors of this node.
113 NodeGroup Preds; member in class:clang::ento::ExplodedNode
170 unsigned pred_size() const { return Preds.size(); }
172 bool pred_empty() const { return Preds.empty(); }
194 pred_iterator pred_begin() { return Preds.begin(); }
195 pred_iterator pred_end() { return Preds.end(); }
228 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); }
|
| /external/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleDAG.h | 237 // Preds/Succs - The SUnits before/after us in the graph.
238 SmallVector<SDep, 4> Preds; // All sunit predecessors. member in class:llvm::SUnit
399 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i)
400 if (Preds[i].getSUnit() == N)
590 return Node->Preds[Operand].getSUnit();
604 return SUnitIterator(N, (unsigned)N->Preds.size());
617 return Node->Preds[Operand];
|
| /external/llvm/lib/Analysis/ |
| H A D | ProfileInfo.cpp | 443 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 D | GCOVProfiling.cpp | 86 const UniqueVector<BasicBlock *> &Preds,
527 const UniqueVector<BasicBlock *> &Preds,
536 Int64PtrTy, Succs.size() * Preds.size());
538 Constant **EdgeTable = new Constant*[Succs.size() * Preds.size()];
540 for (int i = 0, ie = Succs.size() * Preds.size(); i != ie; ++i)
553 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
554 (Preds.idFor(BB)-1)] = cast<Constant>(Counter);
560 ArrayRef<Constant*> V(&EdgeTable[0], Succs.size() * Preds.size());
524 buildEdgeLookupTable( Function *F, GlobalVariable *Counters, const UniqueVector<BasicBlock *> &Preds, const UniqueVector<BasicBlock *> &Succs) argument
|