| /external/llvm/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 71 std::vector<MachineBasicBlock *> Predecessors;
270 pred_iterator pred_begin() { return Predecessors.begin(); }
271 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
272 pred_iterator pred_end() { return Predecessors.end(); }
273 const_pred_iterator pred_end() const { return Predecessors.end(); }
275 { return Predecessors.rbegin();}
277 { return Predecessors.rbegin();}
279 { return Predecessors.rend(); }
281 { return Predecessors.rend(); }
283 return (unsigned)Predecessors.size();
[all …]
|
| /external/clang/lib/Analysis/ |
| D | ThreadSafetyTIL.cpp | 57 unsigned Idx = Predecessors.size(); in addPredecessor()
58 Predecessors.reserveCheck(1, Arena); in addPredecessor()
59 Predecessors.push_back(Pred); in addPredecessor()
71 Predecessors.reserve(NumPreds, Arena); in reservePredecessors()
198 for (auto *Pred : Predecessors) in topologicalFinalSort()
212 for (auto *Pred : Predecessors) { in computeDominator()
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 75 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anon7ef96bbb0111::DAGDeltaAlgorithmImpl
83 assert(Predecessors.count(Node) && "Invalid node!"); in pred_begin()
84 return Predecessors[Node].begin(); in pred_begin()
87 assert(Predecessors.count(Node) && "Invalid node!"); in pred_end()
88 return Predecessors[Node].end(); in pred_end()
186 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
191 Predecessors[it->second].push_back(it->first); in DAGDeltaAlgorithmImpl()
|
| /external/llvm/include/llvm/Analysis/ |
| D | Interval.h | 66 std::vector<BasicBlock*> Predecessors; variable
115 return I->Predecessors.begin(); in pred_begin()
118 return I->Predecessors.end(); in pred_end()
|
| /external/llvm/lib/Analysis/ |
| D | Interval.cpp | 50 for (std::vector<BasicBlock*>::const_iterator I = Predecessors.begin(), in print()
51 E = Predecessors.end(); I != E; ++I) in print()
|
| D | IntervalPartition.cpp | 62 getBlockInterval(*I)->Predecessors.push_back(Header); in updatePredecessors()
|
| /external/v8/src/compiler/ |
| D | schedule.h | 101 typedef Inputs Predecessors; typedef
104 Predecessors predecessors() { return static_cast<Predecessors>(inputs()); } in predecessors()
113 BasicBlock::Predecessors predecessors = this->predecessors(); in PredecessorIndexOf()
114 for (BasicBlock::Predecessors::iterator i = predecessors.begin(); in PredecessorIndexOf()
|
| D | schedule.cc | 40 BasicBlock::Predecessors predecessors = block->predecessors(); in operator <<()
42 for (BasicBlock::Predecessors::iterator j = predecessors.begin(); in operator <<()
|
| D | instruction.cc | 438 BasicBlock::Predecessors predecessors = block->predecessors(); in operator <<()
439 for (BasicBlock::Predecessors::iterator iter = predecessors.begin(); in operator <<()
|
| D | scheduler.cc | 329 BasicBlock::Predecessors::iterator current_pred = in GenerateImmediateDominatorTree()
331 BasicBlock::Predecessors::iterator end = in GenerateImmediateDominatorTree()
|
| D | register-allocator.cc | 1268 BasicBlock::Predecessors predecessors = block->predecessors(); in ResolveControlFlow()
1269 for (BasicBlock::Predecessors::iterator i = predecessors.begin(); in ResolveControlFlow()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | SampleProfile.cpp | 157 BlockEdgeMap Predecessors; member in __anon71199e280111::SampleProfileLoader
450 for (auto *Pred : Predecessors[BB]) { in propagateThroughEdges()
542 if (!Predecessors[B1].empty()) in buildEdges()
547 Predecessors[B1].push_back(B2); in buildEdges()
|
| /external/llvm/test/CodeGen/X86/ |
| D | 2010-05-12-FastAllocKills.ll | 7 ; Predecessors according to CFG: BB#4 BB#5
17 ; Predecessors according to CFG: BB#4 BB#5
|
| /external/llvm/lib/CodeGen/ |
| D | MachineBasicBlock.cpp | 562 Predecessors.push_back(pred); in addPredecessor()
566 pred_iterator I = std::find(Predecessors.begin(), Predecessors.end(), pred); in removePredecessor()
567 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!"); in removePredecessor()
568 Predecessors.erase(I); in removePredecessor()
|
| D | README.txt | 40 Predecessors according to CFG: 0x8b0c5f0 (#3) 0x8b0a7c0 (#4)
|
| /external/llvm/lib/Target/X86/ |
| D | README-X86-64.txt | 111 Predecessors according to CFG: 0x203aec0 (#0)
116 Predecessors according to CFG: 0x203af10 (#1) 0x203af60 (#2)
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | ThreadSafetyTIL.h | 1561 size_t numPredecessors() const { return Predecessors.size(); } in numPredecessors()
1579 BlockArray &predecessors() { return Predecessors; } in predecessors()
1580 const BlockArray &predecessors() const { return Predecessors; } in predecessors()
1623 auto I = std::find(Predecessors.cbegin(), Predecessors.cend(), BB); in findPredecessorIndex()
1624 return std::distance(Predecessors.cbegin(), I); in findPredecessorIndex()
1673 BlockArray Predecessors; // Predecessor blocks in the CFG. variable
|
| /external/clang/test/CodeGenObjC/ |
| D | exceptions.m | 149 // finally.call-exit: Predecessors are the @try and @catch fallthroughs
|
| /external/clang/docs/ |
| D | InternalsManual.rst | 1428 Predecessors (0):
1435 Predecessors (1): B5
1440 Predecessors (1): B4
1446 Predecessors (1): B4
1451 Predecessors (2): B2 B3
1455 Predecessors (1): B1
|