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

  /external/llvm/lib/IR/
BasicBlock.cpp 327 BasicBlock *Successor = *I;
329 for (BasicBlock::iterator II = Successor->begin();
  /external/llvm/include/llvm/Analysis/
BlockFrequencyInfoImpl.h 214 ExitMap Exits; ///< Successor edges (and weights).
321 /// successor/target node).
343 /// This class collates the successor edge weights for later processing.
349 WeightList Weights; ///< Individual successor weights.
391 /// successor edge.
529 /// latter only has successor information.
691 /// - Each successor is categorized as \a Weight::Local, a local edge
693 /// loop header, or \a Weight::Exit, any successor outside the loop.
694 /// The weight, the successor, and its category are stored in \a
695 /// Distribution. There can be multiple edges to each successor
    [all...]
  /external/clang/lib/Analysis/
UninitializedValues.cpp 230 const CFGBlock *Successor = *I;
231 if (!Successor || enqueuedBlocks[Successor->getBlockID()])
233 worklist.push_back(Successor);
234 enqueuedBlocks[Successor->getBlockID()] = true;
507 // * Block 8 is visited because we've visited its only successor.
557 // When visiting the first successor of a block, mark all NULL
  /external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp 117 // Produce a table of pointers to counters, by predecessor and successor
254 void addEdge(GCOVBlock &Successor) {
255 OutEdges.push_back(&Successor);
501 // single successor, so split the entry block to make sure of that.
    [all...]

Completed in 610 milliseconds