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

  /external/llvm/lib/MC/
MCFunction.cpp 40 Successors.push_back(MCBB);
44 return std::find(Successors.begin(), Successors.end(),
45 MCBB) != Successors.end();
  /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/include/llvm/MC/
MCFunction.h 41 /// \name Predecessors/Successors, to represent the CFG.
44 BasicBlockListTy Successors;
58 /// MC CFG access: Predecessors/Successors.
61 succ_const_iterator succ_begin() const { return Successors.begin(); }
62 succ_const_iterator succ_end() const { return Successors.end(); }
  /external/llvm/unittests/Support/
IntegersSubsetTest.cpp 118 unsigned Successors[3] = {0, 1, 2};
124 TheMapping.add(Int(10*i), Int(10*i + 9), Successors + i);
125 TheMapping.add(Int(111), Int(222), Successors);
135 EXPECT_EQ(CaseIt->first, Successors + i);
143 ImproperMapping.add(Int(10), Int(11), Successors + 0);
144 ImproperMapping.add(Int(11), Int(12), Successors + 1);
151 ProperMapping.add(Int(10), Int(11), Successors + 0);
152 ProperMapping.add(Int(12), Int(13), Successors + 1);
161 ToBeOptimized.add(Int(i * 10), Int(i * 10 + 1), Successors + i);
162 ToBeOptimized.add(Int(i * 10 + 2), Int(i * 10 + 9), Successors + i)
    [all...]
  /external/llvm/include/llvm/CodeGen/
MachineBasicBlock.h 69 /// Predecessors/Successors - Keep track of the predecessor / successor
72 std::vector<MachineBasicBlock *> Successors;
74 /// Weights - Keep track of the weights to the successors. This vector
75 /// has the same order as Successors, or it is empty if we don't use it
276 succ_iterator succ_begin() { return Successors.begin(); }
277 const_succ_iterator succ_begin() const { return Successors.begin(); }
278 succ_iterator succ_end() { return Successors.end(); }
279 const_succ_iterator succ_end() const { return Successors.end(); }
281 { return Successors.rbegin(); }
283 { 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/CodeGen/
MachineBasicBlock.cpp 320 // Print the successors of this block according to the CFG.
323 OS << " Successors according to CFG:";
388 // A block with no successors has no concerns with fall-through edges.
427 // successors is its layout successor, rewrite it to a fallthrough
439 // Walk through the successors and find the successor which is not
487 Weights.resize(Successors.size());
492 Successors.push_back(succ);
498 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
499 assert(I != Successors.end() && "Not a current successor!")
    [all...]
  /external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp 449 if (int successors = TI->getNumSuccessors()) {
450 for (int i = 0; i != successors; ++i) {
520 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
521 if (Successors) {
524 if (Successors == 1) {
543 for (int i = 0; i != Successors; ++i)
546 Edge += Successors;
617 // All edges with successors that aren't branches are "complex", because it
641 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
642 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI))
    [all...]
  /external/llvm/lib/Transforms/Scalar/
CodeGenPrepare.cpp 192 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB));
197 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
202 // Delete the dead blocks and any of their dead successors.
207 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB));
212 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
    [all...]
  /external/llvm/lib/Target/ARM/
ARMISelLowering.cpp     [all...]

Completed in 319 milliseconds