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

  /external/llvm/include/llvm/Analysis/
Interval.h 57 /// Successors - List of BasicBlocks that are reachable directly from nodes in
61 std::vector<BasicBlock*> Successors;
64 /// as one of their successors.
79 for (unsigned i = 0; i < Successors.size(); ++i)
80 if (Successors[i] == BB) return true;
83 //return find(Successors.begin(), Successors.end(), BB) != Successors.end();
105 return I->Successors.begin();
108 return I->Successors.end()
    [all...]
  /external/llvm/lib/Support/
DAGDeltaAlgorithm.cpp 76 std::map<change_ty, std::vector<change_ty> > Successors;
101 assert(Successors.count(Node) && "Invalid node!");
102 return Successors[Node].begin();
105 assert(Successors.count(Node) && "Invalid node!");
106 return Successors[Node].end();
187 Successors.insert(std::make_pair(*it, std::vector<change_ty>()));
192 Successors[it->first].push_back(it->second);
  /external/llvm/include/llvm/CodeGen/
MachineBasicBlock.h 92 std::vector<MachineBasicBlock *> Successors;
94 /// Keep track of the probabilities to the successors. This vector has the
95 /// same order as Successors, or it is empty if we don't use it (disable
310 succ_iterator succ_begin() { return Successors.begin(); }
311 const_succ_iterator succ_begin() const { return Successors.begin(); }
312 succ_iterator succ_end() { return Successors.end(); }
313 const_succ_iterator succ_end() const { return Successors.end(); }
315 { return Successors.rbegin(); }
317 { return Successors.rbegin(); }
319 { return Successors.rend();
333 inline iterator_range<succ_iterator> successors() { function in class:llvm::MachineBasicBlock
336 inline iterator_range<const_succ_iterator> successors() const { function in class:llvm::MachineBasicBlock
    [all...]
  /external/llvm/lib/CodeGen/
MachineBlockPlacement.cpp 334 /// \brief Mark a chain's successors as having one fewer preds.
337 /// quickly walk the successors of each block in the chain and mark them as
338 /// having one fewer active predecessor. It also adds any successors of this
344 // Walk all the blocks in this chain, marking their successors as having
347 // Add any successors for which this is the only un-placed in-loop
351 for (MachineBasicBlock *Succ : MBB->successors()) {
369 /// This looks across all successors of a particular block and attempts to
371 /// successors which also pass the block filter. It will attempt to avoid
402 SmallVector<MachineBasicBlock *, 4> Successors;
403 for (MachineBasicBlock *Succ : BB->successors()) {
    [all...]
  /external/llvm/lib/Transforms/IPO/
SampleProfile.cpp 187 /// \brief Successors for each basic block in the CFG.
188 BlockEdgeMap Successors;
389 Successors.clear();
    [all...]
  /external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp 523 if (int successors = TI->getNumSuccessors()) {
524 for (int i = 0; i != successors; ++i) {
610 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
611 if (Successors) {
612 if (Successors == 1) {
634 for (int i = 0; i != Successors; ++i)
638 Edge += Successors;
708 // All edges with successors that aren't branches are "complex", because it
732 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
733 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI))
    [all...]

Completed in 613 milliseconds