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

  /external/llvm/lib/MC/MCAnalysis/
MCModuleYAML.cpp 111 std::vector<yaml::Hex64> Succs;
203 IO.mapRequired("Succs", BB.Succs);
351 BB.Succs.push_back((*SI)->getInsts()->getBeginAddr());
427 for (AddrIt SI = BBI->Succs.begin(), SE = BBI->Succs.end(); SI != SE;
MCObjectDisassembler.cpp 161 BBInfoSetTy Succs;
168 Succs.insert(&Succ);
239 // Compute succs/preds.
275 for (BBInfoSetTy::iterator SI = BBI->Succs.begin(), SE = BBI->Succs.end();
283 // Set preds/succs.
289 for (BBInfoSetTy::iterator SI = BBI->Succs.begin(), SE = BBI->Succs.end();
309 // - if there is, split it (new one, fallthrough, move succs, etc..)
312 // - look at the last instruction in the atom, add succs to worklis
    [all...]
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 120 /// Succs - The successors of this node.
121 NodeGroup Succs;
127 : Location(loc), State(state), Succs(IsSink) {
180 unsigned succ_size() const { return Succs.size(); }
182 bool succ_empty() const { return Succs.empty(); }
185 bool isSink() const { return Succs.getFlag(); }
219 succ_iterator succ_begin() { return Succs.begin(); }
220 succ_iterator succ_end() { return Succs.end(); }
242 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); }
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 268 // Preds/Succs - The SUnits before/after us in the graph.
270 SmallVector<SDep, 4> Succs; // All sunit successors.
282 unsigned NumSuccsLeft; // # of succs not scheduled.
284 unsigned WeakSuccsLeft; // # of weak succs not scheduled.
461 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
462 if (Succs[i].getSUnit() == N)
  /external/llvm/lib/CodeGen/
MachineVerifier.cpp 124 BlockSet Preds, Succs;
480 MInfo.Succs.insert(MBB.succ_begin(), MBB.succ_end());
481 if (MInfo.Succs.size() != MBB.succ_size())
539 if (!MBBInfoMap[*I].Succs.count(MBB)) {
    [all...]
  /external/clang/include/clang/Analysis/
CFG.h 475 AdjacentBlocks Succs;
494 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false),
543 succ_iterator succ_begin() { return Succs.begin(); }
544 succ_iterator succ_end() { return Succs.end(); }
545 const_succ_iterator succ_begin() const { return Succs.begin(); }
546 const_succ_iterator succ_end() const { return Succs.end(); }
548 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); }
549 succ_reverse_iterator succ_rend() { return Succs.rend(); }
550 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); }
551 const_succ_reverse_iterator succ_rend() const { return Succs.rend();
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGISel.cpp     [all...]
  /external/llvm/lib/Transforms/ObjCARC/
ObjCARCOpts.cpp 587 SmallVector<BasicBlock *, 2> Succs;
678 edge_iterator succ_begin() const { return Succs.begin(); }
679 edge_iterator succ_end() const { return Succs.end(); }
681 void addSucc(BasicBlock *Succ) { Succs.push_back(Succ); }
684 bool isExit() const { return Succs.empty(); }
    [all...]
  /external/llvm/lib/Transforms/Utils/
SimplifyCFG.cpp     [all...]

Completed in 394 milliseconds