HomeSort by relevance Sort by last modified time
    Searched defs:Reachable (Results 1 - 4 of 4) 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/clang/lib/Analysis/
ReachableCode.cpp 11 // determining reachable blocks within a CFG.
31 llvm::BitVector &Reachable;
40 DeadCodeScan(llvm::BitVector &reachable)
41 : Visited(reachable.size()),
42 Reachable(reachable) {}
59 if (Reachable[blockID] || Visited[blockID])
76 if (!Reachable[blockID]) {
128 // It is possible that this block has been marked reachable after
130 if (Reachable[Block->getBlockID()]
    [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 244 Reachable =0, // Definitely reachable from root-set.
245 Possible =1, // Possibly reachable from root-set; involves at
247 IndirectLeak =2, // Leaked, but reachable from another leaked block
250 // (At best, only reachable from itself via a cycle.)
440 /* In leak check, show reachable-but-not-freed blocks? default: NO */

Completed in 141 milliseconds