Home
last modified time | relevance | path

Searched refs:Predecessors (Results 1 – 25 of 68) sorted by relevance

123

/external/tensorflow/tensorflow/compiler/mlir/tensorflow/tests/
Dside-effect-analysis-test.mlir24 // expected-remark@above {{Predecessors: {0}}}
36 // expected-remark@above {{Predecessors: {2}}}
40 // expected-remark@above {{Predecessors: {1}}}
44 // expected-remark@above {{Predecessors: {6}}}
48 // expected-remark@above {{Predecessors: {4,5,7}}}
52 // expected-remark@above {{Predecessors: {9}}}
56 // expected-remark@above {{Predecessors: {11}}}
85 // expected-remark@above {{Predecessors: {3}}}
89 // expected-remark@above {{Predecessors: {4}}}
93 // expected-remark@above {{Predecessors: {4}}}
[all …]
/external/llvm-project/llvm/test/CodeGen/AArch64/
Dmisched-fusion-arith-logic.mir21 ; CHECK: Predecessors:
24 ; CHECK: Predecessors:
43 ; CHECK: Predecessors:
46 ; CHECK: Predecessors:
65 ; CHECK: Predecessors:
68 ; CHECK: Predecessors:
107 ; CHECK: Predecessors:
110 ; CHECK: Predecessors:
/external/llvm-project/lld/test/ELF/
Dverdef-dependency.s18 # DSO-NEXT: Predecessors: []
27 # DSO-NEXT: Predecessors: []
36 # DSO-NEXT: Predecessors: []
45 # DSO-NEXT: Predecessors: []
Dverdef.s36 # DSO-NEXT: Predecessors: []
45 # DSO-NEXT: Predecessors: []
54 # DSO-NEXT: Predecessors: []
63 # DSO-NEXT: Predecessors: []
/external/llvm/include/llvm/CodeGen/
DMachineBasicBlock.h93 std::vector<MachineBasicBlock *> Predecessors;
237 pred_iterator pred_begin() { return Predecessors.begin(); }
238 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
239 pred_iterator pred_end() { return Predecessors.end(); }
240 const_pred_iterator pred_end() const { return Predecessors.end(); }
242 { return Predecessors.rbegin();}
244 { return Predecessors.rbegin();}
246 { return Predecessors.rend(); }
248 { return Predecessors.rend(); }
250 return (unsigned)Predecessors.size();
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DMustExecute.cpp161 SmallPtrSetImpl<const BasicBlock *> &Predecessors) { in collectTransitivePredecessors() argument
162 assert(Predecessors.empty() && "Garbage in predecessors set?"); in collectTransitivePredecessors()
168 Predecessors.insert(Pred); in collectTransitivePredecessors()
184 if (Predecessors.insert(PredPred).second) in collectTransitivePredecessors()
200 SmallPtrSet<const BasicBlock *, 4> Predecessors; in allLoopPathsLeadToBlock() local
201 collectTransitivePredecessors(CurLoop, BB, Predecessors); in allLoopPathsLeadToBlock()
210 for (auto *Pred : Predecessors) { in allLoopPathsLeadToBlock()
222 Succ != BB && !Predecessors.count(Succ)) in allLoopPathsLeadToBlock()
284 SmallPtrSet<const BasicBlock *, 4> Predecessors; in doesNotWriteMemoryBefore() local
285 collectTransitivePredecessors(CurLoop, BB, Predecessors); in doesNotWriteMemoryBefore()
[all …]
/external/llvm-project/clang/lib/Analysis/
DThreadSafetyTIL.cpp59 unsigned Idx = Predecessors.size(); in addPredecessor()
60 Predecessors.reserveCheck(1, Arena); in addPredecessor()
61 Predecessors.push_back(Pred); in addPredecessor()
72 Predecessors.reserve(NumPreds, Arena); in reservePredecessors()
197 for (auto *Pred : Predecessors) in topologicalFinalSort()
211 for (auto *Pred : Predecessors) { in computeDominator()
/external/clang/lib/Analysis/
DThreadSafetyTIL.cpp57 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/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/
DVPlanVerifier.cpp74 const auto &Predecessors = VPB->getPredecessors(); in verifyBlocksInRegion() local
78 assert(!hasDuplicates(Predecessors) && in verifyBlocksInRegion()
81 for (const VPBlockBase *Pred : Predecessors) { in verifyBlocksInRegion()
DVPlan.h357 SmallVector<VPBlockBase *, 1> Predecessors; variable
377 Predecessors.push_back(Predecessor); in appendPredecessor()
382 auto Pos = std::find(Predecessors.begin(), Predecessors.end(), Predecessor); in removePredecessor()
384 Predecessors.erase(Pos); in removePredecessor()
438 const VPBlocksTy &getPredecessors() const { return Predecessors; } in getPredecessors()
439 VPBlocksTy &getPredecessors() { return Predecessors; } in getPredecessors()
450 return (Predecessors.size() == 1 ? *Predecessors.begin() : nullptr); in getSinglePredecessor()
454 size_t getNumPredecessors() const { return Predecessors.size(); } in getNumPredecessors()
537 assert(Predecessors.empty() && "Block predecessors already set."); in setPredecessors()
543 void clearPredecessors() { Predecessors.clear(); } in clearPredecessors()
/external/llvm-project/llvm/lib/Transforms/Vectorize/
DVPlanVerifier.cpp73 const auto &Predecessors = VPB->getPredecessors(); in verifyBlocksInRegion() local
77 assert(!hasDuplicates(Predecessors) && in verifyBlocksInRegion()
80 for (const VPBlockBase *Pred : Predecessors) { in verifyBlocksInRegion()
DVPlan.h387 SmallVector<VPBlockBase *, 1> Predecessors; variable
411 Predecessors.push_back(Predecessor); in appendPredecessor()
416 auto Pos = std::find(Predecessors.begin(), Predecessors.end(), Predecessor); in removePredecessor()
418 Predecessors.erase(Pos); in removePredecessor()
480 const VPBlocksTy &getPredecessors() const { return Predecessors; } in getPredecessors()
481 VPBlocksTy &getPredecessors() { return Predecessors; } in getPredecessors()
492 return (Predecessors.size() == 1 ? *Predecessors.begin() : nullptr); in getSinglePredecessor()
496 size_t getNumPredecessors() const { return Predecessors.size(); } in getNumPredecessors()
579 assert(Predecessors.empty() && "Block predecessors already set."); in setPredecessors()
585 void clearPredecessors() { Predecessors.clear(); } in clearPredecessors()
/external/llvm/include/llvm/Analysis/
DInterval.h66 std::vector<BasicBlock*> Predecessors; variable
117 return I->Predecessors.begin(); in pred_begin()
120 return I->Predecessors.end(); in pred_end()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
DDAGDeltaAlgorithm.cpp74 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anonf7cf2f1d0111::DAGDeltaAlgorithmImpl
82 assert(Predecessors.count(Node) && "Invalid node!"); in pred_begin()
83 return Predecessors[Node].begin(); in pred_begin()
86 assert(Predecessors.count(Node) && "Invalid node!"); in pred_end()
87 return Predecessors[Node].end(); in pred_end()
185 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
190 Predecessors[it->second].push_back(it->first); in DAGDeltaAlgorithmImpl()
/external/llvm-project/llvm/lib/Support/
DDAGDeltaAlgorithm.cpp74 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anon443717890111::DAGDeltaAlgorithmImpl
82 assert(Predecessors.count(Node) && "Invalid node!"); in pred_begin()
83 return Predecessors[Node].begin(); in pred_begin()
86 assert(Predecessors.count(Node) && "Invalid node!"); in pred_end()
87 return Predecessors[Node].end(); in pred_end()
185 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
190 Predecessors[it->second].push_back(it->first); in DAGDeltaAlgorithmImpl()
/external/llvm/lib/Support/
DDAGDeltaAlgorithm.cpp75 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/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DMachineBasicBlock.h89 std::vector<MachineBasicBlock *> Predecessors;
264 pred_iterator pred_begin() { return Predecessors.begin(); }
265 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
266 pred_iterator pred_end() { return Predecessors.end(); }
267 const_pred_iterator pred_end() const { return Predecessors.end(); }
269 { return Predecessors.rbegin();}
271 { return Predecessors.rbegin();}
273 { return Predecessors.rend(); }
275 { return Predecessors.rend(); }
277 return (unsigned)Predecessors.size();
[all …]
/external/llvm-project/llvm/include/llvm/Analysis/
DInterval.h63 std::vector<BasicBlock*> Predecessors; variable
113 return I->Predecessors.begin(); in pred_begin()
116 return I->Predecessors.end(); in pred_end()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DInterval.h63 std::vector<BasicBlock*> Predecessors; variable
113 return I->Predecessors.begin(); in pred_begin()
116 return I->Predecessors.end(); in pred_end()
/external/llvm-project/llvm/lib/Analysis/
DMustExecute.cpp163 SmallPtrSetImpl<const BasicBlock *> &Predecessors) { in collectTransitivePredecessors() argument
164 assert(Predecessors.empty() && "Garbage in predecessors set?"); in collectTransitivePredecessors()
170 Predecessors.insert(Pred); in collectTransitivePredecessors()
186 if (Predecessors.insert(PredPred).second) in collectTransitivePredecessors()
202 SmallPtrSet<const BasicBlock *, 4> Predecessors; in allLoopPathsLeadToBlock() local
203 collectTransitivePredecessors(CurLoop, BB, Predecessors); in allLoopPathsLeadToBlock()
212 for (auto *Pred : Predecessors) { in allLoopPathsLeadToBlock()
224 Succ != BB && !Predecessors.count(Succ)) in allLoopPathsLeadToBlock()
286 SmallPtrSet<const BasicBlock *, 4> Predecessors; in doesNotWriteMemoryBefore() local
287 collectTransitivePredecessors(CurLoop, BB, Predecessors); in doesNotWriteMemoryBefore()
[all …]
/external/llvm-project/llvm/include/llvm/CodeGen/
DMachineBasicBlock.h119 std::vector<MachineBasicBlock *> Predecessors;
310 pred_iterator pred_begin() { return Predecessors.begin(); }
311 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
312 pred_iterator pred_end() { return Predecessors.end(); }
313 const_pred_iterator pred_end() const { return Predecessors.end(); }
315 { return Predecessors.rbegin();}
317 { return Predecessors.rbegin();}
319 { return Predecessors.rend(); }
321 { return Predecessors.rend(); }
323 return (unsigned)Predecessors.size();
[all …]
/external/llvm-project/llvm/lib/Transforms/Utils/
DFixIrreducible.cpp170 SetVector<BasicBlock *> Predecessors; in createNaturalLoopInternal() local
173 Predecessors.insert(P); in createNaturalLoopInternal()
179 for (auto P : Predecessors) { in createNaturalLoopInternal()
189 CreateControlFlowHub(&DTU, GuardBlocks, Predecessors, Headers, "irr"); in createNaturalLoopInternal()
/external/llvm-project/llvm/test/tools/llvm-readobj/ELF/
Dversioninfo.test152 # LLVM-NEXT: Predecessors: []
162 # LLVM-NEXT: Predecessors: []
172 # LLVM-NEXT: Predecessors: []
182 # LLVM-NEXT: Predecessors: []
194 # LLVM-NEXT: Predecessors: []
203 # LLVM-NEXT: Predecessors: [VERSION1, VERSION3]
/external/llvm/lib/Transforms/IPO/
DSampleProfile.cpp167 BlockEdgeMap Predecessors; member in __anon7eca00fa0111::SampleProfileLoader
395 Predecessors.clear(); in clearFunctionData()
820 NumTotalEdges = Predecessors[BB].size(); in propagateThroughEdges()
821 for (auto *Pred : Predecessors[BB]) { in propagateThroughEdges()
828 SingleEdge = std::make_pair(Predecessors[BB][0], BB); in propagateThroughEdges()
926 if (!Predecessors[B1].empty()) in buildEdges()
931 Predecessors[B1].push_back(B2); in buildEdges()
/external/llvm/lib/Analysis/
DInterval.cpp49 for (const BasicBlock *Predecessor : Predecessors) in print()

123