HomeSort by relevance Sort by last modified time
    Searched defs:Reachable (Results 1 - 8 of 8) 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...]
PrologEpilogInserter.cpp 734 SmallPtrSet<MachineBasicBlock*, 8> Reachable;
736 // Iterate over the reachable blocks in DFS order.
738 DFI = df_ext_begin(&Fn, Reachable), DFE = df_ext_end(&Fn, Reachable);
744 assert(Reachable.count(StackPred) &&
755 if (Reachable.count(BB))
    [all...]
MachineVerifier.cpp 100 // Is this MBB reachable from the MF entry point?
101 bool reachable; member in struct:__anon23549::MachineVerifier::BBInfo
126 BBInfo() : reachable(false) {}
438 if (!MInfo.reachable) {
439 MInfo.reachable = true;
    [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...]
ThreadSafety.cpp     [all...]
  /external/llvm/lib/Transforms/Scalar/
SimplifyCFGPass.cpp 116 SmallPtrSet<BasicBlock*, 128> &Reachable) {
120 Reachable.insert(BB);
183 if (Reachable.insert(*SI))
189 /// removeUnreachableBlocksFromFn - Remove blocks that are not reachable, even
193 SmallPtrSet<BasicBlock*, 128> Reachable;
194 bool Changed = markAliveBlocks(F.begin(), Reachable);
197 if (Reachable.size() == F.size())
200 assert(Reachable.size() < F.size());
201 NumSimpl += F.size()-Reachable.size();
203 // Loop over all of the basic blocks that are not reachable, dropping all o
    [all...]
  /external/valgrind/main/memcheck/
mc_include.h 253 Reachable =0, // Definitely reachable from root-set.
254 Possible =1, // Possibly reachable from root-set; involves at
256 IndirectLeak =2, // Leaked, but reachable from another leaked block
259 // (At best, only reachable from itself via a cycle.)
461 /* In leak check, show reachable-but-not-freed blocks? default: NO */
  /external/llvm/lib/Transforms/Utils/
Local.cpp     [all...]

Completed in 346 milliseconds