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 323 BasicBlock *Successor = *I;
325 for (BasicBlock::iterator II = Successor->begin();
  /external/llvm/include/llvm/Support/
IntegersSubsetMapping.h 1 //===- IntegersSubsetMapping.h - Mapping subset ==> Successor ---*- C++ -*-===//
14 /// If user which to add another subset for successor that is already
321 SuccessorClass *Successor = OldItems.begin()->second;
331 add(R, Successor);
335 Successor = j->second;
339 add(R, Successor);
407 /// Removes all clusters for given successor.
416 /// Find successor that satisfies given value.
539 /// Builds the finalized case objects ignoring successor values, as though
540 /// all ranges belongs to the same 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;
509 // * Block 8 is visited because we've visited its only successor.
541 // When visiting the first successor of a block, mark all NULL
  /external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp 114 // Produce a table of pointers to counters, by predecessor and successor
255 void addEdge(GCOVBlock &Successor) {
256 OutEdges.push_back(&Successor);

Completed in 84 milliseconds