Home
last modified time | relevance | path

Searched refs:Reachable (Results 1 – 9 of 9) sorted by relevance

/external/clang/lib/Analysis/
DReachableCode.cpp31 llvm::BitVector &Reachable; member in __anone93000450111::DeadCodeScan
42 Reachable(reachable) {} in DeadCodeScan()
59 if (Reachable[blockID] || Visited[blockID]) in enqueue()
76 if (!Reachable[blockID]) { in isDeadCodeRoot()
130 if (Reachable[Block->getBlockID()]) in scanBackwards()
148 count += clang::reachable_code::ScanReachableFromBlock(Block, Reachable); in scanBackwards()
154 count += clang::reachable_code::ScanReachableFromBlock(Block, Reachable); in scanBackwards()
171 if (Reachable[block->getBlockID()]) in scanBackwards()
174 count += clang::reachable_code::ScanReachableFromBlock(block, Reachable); in scanBackwards()
258 llvm::BitVector &Reachable) { in ScanReachableFromBlock() argument
[all …]
/external/llvm/lib/Transforms/Scalar/
DSimplifyCFGPass.cpp110 SmallPtrSet<BasicBlock*, 128> &Reachable) { in MarkAliveBlocks() argument
118 if (!Reachable.insert(BB)) in MarkAliveBlocks()
177 SmallPtrSet<BasicBlock*, 128> Reachable; in RemoveUnreachableBlocksFromFn() local
178 bool Changed = MarkAliveBlocks(F.begin(), Reachable); in RemoveUnreachableBlocksFromFn()
181 if (Reachable.size() == F.size()) in RemoveUnreachableBlocksFromFn()
184 assert(Reachable.size() < F.size()); in RemoveUnreachableBlocksFromFn()
185 NumSimpl += F.size()-Reachable.size(); in RemoveUnreachableBlocksFromFn()
190 if (Reachable.count(BB)) in RemoveUnreachableBlocksFromFn()
194 if (Reachable.count(*SI)) in RemoveUnreachableBlocksFromFn()
200 if (!Reachable.count(I)) in RemoveUnreachableBlocksFromFn()
/external/llvm/lib/CodeGen/
DUnreachableBlockElim.cpp66 SmallPtrSet<BasicBlock*, 8> Reachable; in runOnFunction() local
70 df_ext_begin(&F, Reachable), E = df_ext_end(&F, Reachable); I != E; ++I) in runOnFunction()
77 if (!Reachable.count(I)) { in runOnFunction()
124 SmallPtrSet<MachineBasicBlock*, 8> Reachable; in runOnMachineFunction() local
133 I = df_ext_begin(&F, Reachable), E = df_ext_end(&F, Reachable); in runOnMachineFunction()
144 if (!Reachable.count(BB)) { in runOnMachineFunction()
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp140 NodeSubset Reachable; in NodesReachableFrom() local
143 Reachable.AddNode(Idx); in NodesReachableFrom()
145 NodeSubset Previous(Reachable); in NodesReachableFrom()
150 Reachable = Reachable.Join(Nodes[i].second); in NodesReachableFrom()
153 if (Reachable == Previous) in NodesReachableFrom()
154 return Reachable; in NodesReachableFrom()
/external/clang/include/clang/Analysis/Analyses/
DReachableCode.h50 llvm::BitVector &Reachable);
/external/clang/lib/Sema/
DJumpDiagnostics.cpp582 llvm::BitVector Reachable(Scopes.size(), false); in VerifyIndirectJumps() local
588 Reachable.reset(); in VerifyIndirectJumps()
595 Reachable.set(Min); in VerifyIndirectJumps()
619 if (Reachable.test(Scope)) { in VerifyIndirectJumps()
623 Reachable.set(S); in VerifyIndirectJumps()
/external/valgrind/main/memcheck/
Dmc_leakcheck.c625 is_prior_definite && ex->state != Reachable) { in lc_push_without_clique_if_a_chunk_ptr()
628 ex->state = Reachable; in lc_push_without_clique_if_a_chunk_ptr()
973 if ((Reachable == lr->key.state && !MC_(clo_show_reachable)) || in print_results()
996 } else if (Reachable == lr->key.state) { in print_results()
Dmc_include.h244 Reachable =0, // Definitely reachable from root-set. enumerator
Dmc_errors.c397 case Reachable: loss = "still reachable"; break; in str_leak_lossmode()
409 case Reachable: loss = "Leak_StillReachable"; break; in xml_leak_kind()