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

  /external/llvm/lib/CodeGen/
UnreachableBlockElim.cpp 11 // job is to delete LLVM basic blocks that are not reachable from the entry
66 SmallPtrSet<BasicBlock*, 8> Reachable;
68 // Mark all reachable blocks.
70 df_ext_begin(&F, Reachable), E = df_ext_end(&F, Reachable); I != E; ++I)
71 /* Mark all reachable blocks */;
77 if (!Reachable.count(I)) {
124 SmallPtrSet<MachineBasicBlock*, 8> Reachable;
131 // Mark all reachable blocks.
133 I = df_ext_begin(&F, Reachable), E = df_ext_end(&F, Reachable)
    [all...]
  /external/llvm/lib/Transforms/Scalar/
SimplifyCFGPass.cpp 110 SmallPtrSet<BasicBlock*, 128> &Reachable) {
118 if (!Reachable.insert(BB))
173 /// RemoveUnreachableBlocksFromFn - Remove blocks that are not reachable, even
177 SmallPtrSet<BasicBlock*, 128> Reachable;
178 bool Changed = MarkAliveBlocks(F.begin(), Reachable);
181 if (Reachable.size() == F.size())
184 assert(Reachable.size() < F.size());
185 NumSimpl += F.size()-Reachable.size();
187 // Loop over all of the basic blocks that are not reachable, dropping all of
190 if (Reachable.count(BB)
    [all...]
  /external/valgrind/main/memcheck/
mc_include.h 238 Reachable =0, // Definitely reachable from root-set.
239 Possible =1, // Possibly reachable from root-set; involves at
241 IndirectLeak =2, // Leaked, but reachable from another leaked block
244 // (At best, only reachable from itself via a cycle.)
395 /* In leak check, show reachable-but-not-freed blocks? default: NO */

Completed in 276 milliseconds