HomeSort by relevance Sort by last modified time
    Searched refs:Predecessors (Results 1 - 25 of 30) sorted by null

1 2

  /external/swiftshader/third_party/LLVM/lib/Analysis/
Interval.cpp 30 // There is a loop in this interval iff one of the predecessors of the header
49 OS << "Interval Predecessors:\n";
50 for (std::vector<BasicBlock*>::const_iterator I = Predecessors.begin(),
51 E = Predecessors.end(); I != E; ++I)
IntervalPartition.cpp 62 getBlockInterval(*I)->Predecessors.push_back(Header);
82 // predecessors for each block.
110 // predecessors for each block.
  /external/llvm/lib/Analysis/
Interval.cpp 30 // There is a loop in this interval iff one of the predecessors of the header
48 OS << "Interval Predecessors:\n";
49 for (const BasicBlock *Predecessor : Predecessors)
IntervalPartition.cpp 61 getBlockInterval(Successor)->Predecessors.push_back(Header);
81 // predecessors for each block.
109 // predecessors for each block.
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/
Interval.cpp 28 // There is a loop in this interval iff one of the predecessors of the header
45 OS << "Interval Predecessors:\n";
46 for (const BasicBlock *Predecessor : Predecessors)
IntervalPartition.cpp 66 getBlockInterval(Successor)->Predecessors.push_back(Header);
85 // predecessors for each block.
111 // predecessors for each block.
  /external/llvm/include/llvm/Analysis/
Interval.h 34 /// in the interval has all of its predecessors in the interval (except for the
63 /// Predecessors - List of BasicBlocks that have this Interval's header block
66 std::vector<BasicBlock*> Predecessors;
117 return I->Predecessors.begin();
120 return I->Predecessors.end();
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
Interval.h 34 /// in the interval has all of its predecessors in the interval (except for the
62 /// Predecessors - List of BasicBlocks that have this Interval's header block
64 std::vector<BasicBlock*> Predecessors;
114 return I->Predecessors.begin();
117 return I->Predecessors.end();
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Vectorize/
VPlanVerifier.cpp 73 // Check block's predecessors.
74 const auto &Predecessors = VPB->getPredecessors();
78 assert(!hasDuplicates(Predecessors) &&
81 for (const VPBlockBase *Pred : Predecessors) {
103 assert(!Entry->getNumPredecessors() && "Region entry has predecessors.");
VPlan.h 338 SmallVector<VPBlockBase *, 1> Predecessors;
355 Predecessors.push_back(Predecessor);
358 /// Remove \p Predecessor from the predecessors of this block.
360 auto Pos = std::find(Predecessors.begin(), Predecessors.end(), Predecessor);
362 Predecessors.erase(Pos);
416 const VPBlocksTy &getPredecessors() const { return Predecessors; }
417 VPBlocksTy &getPredecessors() { return Predecessors; }
428 return (Predecessors.size() == 1 ? *Predecessors.begin() : nullptr)
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/Analysis/
Interval.h 34 /// in the interval has all of its predecessors in the interval (except for the
66 /// Predecessors - List of BasicBlocks that have this Interval's header block
69 std::vector<BasicBlock*> Predecessors;
118 return I->Predecessors.begin();
121 return I->Predecessors.end();
  /external/tensorflow/tensorflow/compiler/jit/graphcycles/
graphcycles.h 121 std::unordered_set<int32> Predecessors(int32 node);
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
MachineBasicBlock.h 69 /// Predecessors/Successors - Keep track of the predecessor / successor
71 std::vector<MachineBasicBlock *> Predecessors;
167 pred_iterator pred_begin() { return Predecessors.begin(); }
168 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
169 pred_iterator pred_end() { return Predecessors.end(); }
170 const_pred_iterator pred_end() const { return Predecessors.end(); }
172 { return Predecessors.rbegin();}
174 { return Predecessors.rbegin();}
176 { return Predecessors.rend(); }
178 { return Predecessors.rend();
    [all...]
  /external/clang/lib/Analysis/
ThreadSafetyTIL.cpp 57 unsigned Idx = Predecessors.size();
58 Predecessors.reserveCheck(1, Arena);
59 Predecessors.push_back(Pred);
71 Predecessors.reserve(NumPreds, Arena);
182 // following back-edges. The dominator is serialized before any predecessors,
198 for (auto *Pred : Predecessors)
207 // its predecessors have already computed their dominators. This is achieved
212 for (auto *Pred : Predecessors) {
  /external/llvm/include/llvm/CodeGen/
MachineBasicBlock.h 93 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()
270 inline iterator_range<pred_iterator> predecessors() { function in class:llvm::MachineBasicBlock
273 inline iterator_range<const_pred_iterator> predecessors() const { function in class:llvm::MachineBasicBlock
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/
MachineBasicBlock.h 90 std::vector<MachineBasicBlock *> Predecessors;
254 pred_iterator pred_begin() { return Predecessors.begin(); }
255 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
256 pred_iterator pred_end() { return Predecessors.end(); }
257 const_pred_iterator pred_end() const { return Predecessors.end(); }
259 { return Predecessors.rbegin();}
261 { return Predecessors.rbegin();}
263 { return Predecessors.rend(); }
265 { return Predecessors.rend(); }
267 return (unsigned)Predecessors.size()
287 inline iterator_range<pred_iterator> predecessors() { function in class:llvm::MachineBasicBlock
290 inline iterator_range<const_pred_iterator> predecessors() const { function in class:llvm::MachineBasicBlock
    [all...]
  /external/llvm/lib/Support/
DAGDeltaAlgorithm.cpp 75 std::map<change_ty, std::vector<change_ty> > Predecessors;
83 assert(Predecessors.count(Node) && "Invalid node!");
84 return Predecessors[Node].begin();
87 assert(Predecessors.count(Node) && "Invalid node!");
88 return Predecessors[Node].end();
186 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>()));
191 Predecessors[it->second].push_back(it->first);
  /external/swiftshader/third_party/LLVM/lib/Support/
DAGDeltaAlgorithm.cpp 76 std::map<change_ty, std::vector<change_ty> > Predecessors;
84 assert(Predecessors.count(Node) && "Invalid node!");
85 return Predecessors[Node].begin();
88 assert(Predecessors.count(Node) && "Invalid node!");
89 return Predecessors[Node].end();
192 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>()));
197 Predecessors[it->second].push_back(it->first);
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Support/
DAGDeltaAlgorithm.cpp 75 std::map<change_ty, std::vector<change_ty> > Predecessors;
83 assert(Predecessors.count(Node) && "Invalid node!");
84 return Predecessors[Node].begin();
87 assert(Predecessors.count(Node) && "Invalid node!");
88 return Predecessors[Node].end();
186 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>()));
191 Predecessors[it->second].push_back(it->first);
  /external/llvm/lib/Transforms/IPO/
SampleProfile.cpp 166 /// \brief Predecessors for each basic block in the CFG.
167 BlockEdgeMap Predecessors;
395 Predecessors.clear();
820 NumTotalEdges = Predecessors[BB].size();
821 for (auto *Pred : Predecessors[BB]) {
828 SingleEdge = std::make_pair(Predecessors[BB][0], BB);
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/IPO/
SampleProfile.cpp 268 /// Predecessors for each basic block in the CFG.
269 BlockEdgeMap Predecessors;
472 Predecessors.clear();
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
MachineBasicBlock.cpp 234 OS << " Predecessors according to CFG:";
291 assert(!B && "UpdateTerminators requires analyzable predecessors!");
400 Predecessors.push_back(pred);
404 pred_iterator I = std::find(Predecessors.begin(), Predecessors.end(), pred);
405 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!");
406 Predecessors.erase(I);
616 // If all the other predecessors of "Succ" are dominated by "Succ" itself
  /external/llvm/lib/CodeGen/
MachineBasicBlock.cpp 289 OS << " Predecessors according to CFG:";
415 assert(!B && "UpdateTerminators requires analyzable predecessors!");
610 Predecessors.push_back(Pred);
614 pred_iterator I = std::find(Predecessors.begin(), Predecessors.end(), Pred);
615 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!");
616 Predecessors.erase(I);
891 "PHI sources should be live out of their predecessors.");
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
MachineBasicBlock.cpp 335 OS << "; predecessors: ";
531 assert(!B && "UpdateTerminators requires analyzable predecessors!");
753 Predecessors.push_back(Pred);
757 pred_iterator I = find(Predecessors, Pred);
758 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!");
759 Predecessors.erase(I);
807 return is_contained(predecessors(), MBB);
    [all...]
  /external/clang/include/clang/Analysis/Analyses/
ThreadSafetyTIL.h 1579 BlockArray &predecessors() { return Predecessors; } function in class:clang::threadSafety::BasicBlock
1580 const BlockArray &predecessors() const { return Predecessors; } function in class:clang::threadSafety::BasicBlock
    [all...]

Completed in 1031 milliseconds

1 2