Home
last modified time | relevance | path

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

12

/external/tensorflow/tensorflow/compiler/mlir/tensorflow/tests/
Dside-effect-analysis-test.mlir23 // expected-remark@above {{Predecessors: {0}}}
35 // expected-remark@above {{Predecessors: {2}}}
39 // expected-remark@above {{Predecessors: {1}}}
43 // expected-remark@above {{Predecessors: {6}}}
47 // expected-remark@above {{Predecessors: {4,5,7}}}
51 // expected-remark@above {{Predecessors: {9}}}
83 // expected-remark@above {{Predecessors: {3}}}
87 // expected-remark@above {{Predecessors: {4}}}
91 // expected-remark@above {{Predecessors: {4}}}
95 // expected-remark@above {{Predecessors: {5,6}}}
[all …]
/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 …]
DInterval.cpp45 for (const BasicBlock *Predecessor : Predecessors) in print()
DIntervalPartition.cpp70 getBlockInterval(Successor)->Predecessors.push_back(Header); in updatePredecessors()
/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/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/lib/Support/
DDAGDeltaAlgorithm.cpp75 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anon168f7fa00111::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/lib/Support/
DDAGDeltaAlgorithm.cpp74 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anon848d24420111::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/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/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/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/lib/Transforms/IPO/
DSampleProfile.cpp167 BlockEdgeMap Predecessors; member in __anon0188c6bf0111::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/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
DSILowerI1Copies.cpp141 SmallVector<MachineBasicBlock *, 4> Predecessors; member in __anoned8a30be0111::PhiIncomingAnalysis
152 ArrayRef<MachineBasicBlock *> predecessors() const { return Predecessors; } in predecessors()
159 Predecessors.clear(); in analyze()
217 if (llvm::find(Predecessors, UnreachablePred) == Predecessors.end()) in analyze()
218 Predecessors.push_back(UnreachablePred); in analyze()
/external/llvm/test/CodeGen/X86/
D2010-05-12-FastAllocKills.ll7 ; Predecessors according to CFG: BB#4 BB#5
17 ; Predecessors according to CFG: BB#4 BB#5
/external/llvm/lib/Analysis/
DInterval.cpp49 for (const BasicBlock *Predecessor : Predecessors) in print()
DIntervalPartition.cpp61 getBlockInterval(Successor)->Predecessors.push_back(Header); in updatePredecessors()
/external/tensorflow/tensorflow/compiler/xla/service/graphcycles/
Dgraphcycles.h125 absl::Span<const int32_t> Predecessors(int32_t node) const;
/external/llvm/test/CodeGen/AArch64/
Darm64-csldst-mmo.ll15 ; CHECK: Predecessors:
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/
DSampleProfile.cpp402 BlockEdgeMap Predecessors; member in __anon64acc0210111::SampleProfileLoader
645 Predecessors.clear(); in clearFunctionData()
1288 NumTotalEdges = Predecessors[BB].size(); in propagateThroughEdges()
1289 for (auto *Pred : Predecessors[BB]) { in propagateThroughEdges()
1296 SingleEdge = std::make_pair(Predecessors[BB][0], BB); in propagateThroughEdges()
1378 for (auto *Pred : Predecessors[BB]) { in propagateThroughEdges()
1423 if (!Predecessors[B1].empty()) in buildEdges()
1428 Predecessors[B1].push_back(B2); in buildEdges()
/external/llvm/lib/CodeGen/
DMachineBasicBlock.cpp610 Predecessors.push_back(Pred); in addPredecessor()
614 pred_iterator I = std::find(Predecessors.begin(), Predecessors.end(), Pred); in removePredecessor()
615 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!"); in removePredecessor()
616 Predecessors.erase(I); in removePredecessor()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/X86/
DREADME-X86-64.txt111 Predecessors according to CFG: 0x203aec0 (#0)
116 Predecessors according to CFG: 0x203af10 (#1) 0x203af60 (#2)
/external/llvm/lib/Target/X86/
DREADME-X86-64.txt111 Predecessors according to CFG: 0x203aec0 (#0)
116 Predecessors according to CFG: 0x203af10 (#1) 0x203af60 (#2)
/external/clang/include/clang/Analysis/Analyses/
DThreadSafetyTIL.h1561 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

12