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

  /external/clang/include/clang/Analysis/Analyses/
ReachableCode.h 47 /// ScanReachableFromBlock - Mark all blocks reachable from Start.
48 /// Returns the total number of blocks that were marked reachable.
50 llvm::BitVector &Reachable);
  /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/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/unittests/ADT/
SCCIteratorTest.cpp 135 /// NodesReachableFrom - Return the set of all nodes reachable from the given
140 NodeSubset Reachable;
142 // The initial node is reachable.
143 Reachable.AddNode(Idx);
145 NodeSubset Previous(Reachable);
147 // Add in all nodes which are children of a reachable node.
150 Reachable = Reachable.Join(Nodes[i].second);
152 // If nothing changed then we have found all reachable nodes.
153 if (Reachable == Previous
    [all...]
  /external/clang/lib/Sema/
JumpDiagnostics.cpp 574 // For each target scope, make sure it's trivially reachable from
582 llvm::BitVector Reachable(Scopes.size(), false);
588 Reachable.reset();
595 Reachable.set(Min);
613 // we've marked reachable. For well-formed code this amortizes
619 if (Reachable.test(Scope)) {
620 // If we find something reachable, mark all the scopes we just
621 // walked through as reachable.
623 Reachable.set(S);
629 // gotten shallower than the shallowest reachable scope
    [all...]
  /external/valgrind/main/memcheck/
mc_leakcheck.c 84 // - still reachable: cases 1, 2
119 // Also, --show-reachable is a bad name because it also turns on the showing
169 // are mentioned elsewhere (if --show-reachable=yes is given!))
193 // reachable, depending on whether interior-pointers were required to
195 // - At this point we know for every block if it's reachable or not.
225 // prior node is a block which is reachable from the root-set via
228 // reachable from the root-set via a path including at least one
622 // - Unreached --> Reachable
623 // - Possible --> Reachable
625 is_prior_definite && ex->state != Reachable) {
    [all...]
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 */
mc_errors.c 397 case Reachable: loss = "still reachable"; break;
409 case Reachable: loss = "Leak_StillReachable"; break;
    [all...]

Completed in 429 milliseconds