HomeSort by relevance Sort by last modified time
    Searched defs:Successors (Results 1 - 4 of 4) 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...]
  /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/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
306 succ_iterator succ_begin() { return Successors.begin(); }
307 const_succ_iterator succ_begin() const { return Successors.begin(); }
308 succ_iterator succ_end() { return Successors.end(); }
309 const_succ_iterator succ_end() const { return Successors.end(); }
311 { return Successors.rbegin(); }
313 { return Successors.rbegin();
    [all...]
  /external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp 391 if (int successors = TI->getNumSuccessors()) {
392 for (int i = 0; i != successors; ++i) {
458 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
459 if (Successors) {
462 if (Successors == 1) {
484 for (int i = 0; i != Successors; ++i)
487 Edge += Successors;
522 // All edges with successors that aren't branches are "complex", because it
546 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
547 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI))
    [all...]

Completed in 464 milliseconds