HomeSort by relevance Sort by last modified time
    Searched refs:Successors (Results 1 - 8 of 8) sorted by null

  /external/llvm/include/llvm/Analysis/
Interval.h 52 : HeaderNode(I.HeaderNode), Nodes(I.Nodes), Successors(I.Successors) {}
60 /// Successors - List of BasicBlocks that are reachable directly from nodes in
64 std::vector<BasicBlock*> Successors;
67 /// as one of their successors.
82 for (unsigned i = 0; i < Successors.size(); ++i)
83 if (Successors[i] == BB) return true;
86 //return find(Successors.begin(), Successors.end(), BB) != Successors.end()
    [all...]
IntervalIterator.h 135 // their successors now.
147 // We ran out of successors for this interval... pop off the stack
173 // Check all of our successors to see if they are in the interval...
202 Int->Successors.push_back(NodeHeader);
209 Int->Successors.push_back(NodeHeader);
221 Int->Successors.erase(std::remove(Int->Successors.begin(),
222 Int->Successors.end(), NodeHeader),
223 Int->Successors.end());
227 // of its successors are as well
    [all...]
  /external/llvm/lib/Analysis/
Interval.cpp 54 OS << "Interval Successors:\n";
55 for (std::vector<BasicBlock*>::const_iterator I = Successors.begin(),
56 E = Successors.end(); I != E; ++I)
IntervalPartition.cpp 60 for (Interval::succ_iterator I = Int->Successors.begin(),
61 E = Int->Successors.end(); I != E; ++I)
  /external/llvm/lib/CodeGen/
MachineBasicBlock.cpp 250 // Print the successors of this block according to the CFG.
253 OS << " Successors according to CFG:";
283 // A block with no successors has no concerns with fall-through edges.
308 // successors is its layout successor, rewrite it to a fallthrough
346 Weights.resize(Successors.size());
351 Successors.push_back(succ);
357 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
358 assert(I != Successors.end() && "Not a current successor!");
366 Successors.erase(I)
    [all...]
  /external/llvm/include/llvm/CodeGen/
MachineBasicBlock.h 69 /// Predecessors/Successors - Keep track of the predecessor / successor
72 std::vector<MachineBasicBlock *> Successors;
75 /// Weights - Keep track of the weights to the successors. This vector
76 /// has the same order as Successors, or it is empty if we don't use it
183 succ_iterator succ_begin() { return Successors.begin(); }
184 const_succ_iterator succ_begin() const { return Successors.begin(); }
185 succ_iterator succ_end() { return Successors.end(); }
186 const_succ_iterator succ_end() const { return Successors.end(); }
188 { return Successors.rbegin(); }
190 { return Successors.rbegin();
    [all...]
  /external/llvm/lib/Support/
DAGDeltaAlgorithm.cpp 77 std::map<change_ty, std::vector<change_ty> > Successors;
102 assert(Successors.count(Node) && "Invalid node!");
103 return Successors[Node].begin();
106 assert(Successors.count(Node) && "Invalid node!");
107 return Successors[Node].end();
193 Successors.insert(std::make_pair(*it, std::vector<change_ty>()));
198 Successors[it->first].push_back(it->second);
  /external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp 395 if (int successors = TI->getNumSuccessors()) {
396 for (int i = 0; i != successors; ++i) {
462 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
463 if (Successors) {
466 if (Successors == 1) {
489 for (int i = 0; i != Successors; ++i)
492 Edge += Successors;
526 // All edges with successors that aren't branches are "complex", because it
550 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
551 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI))
    [all...]

Completed in 69 milliseconds