HomeSort by relevance Sort by last modified time
    Searched refs:Reachable (Results 1 - 11 of 11) 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...]
ThreadSafety.cpp 917 bool Reachable; // Is this block reachable?
    [all...]
  /external/llvm/lib/Transforms/Scalar/
SimplifyCFGPass.cpp 117 SmallPtrSet<BasicBlock*, 128> &Reachable) {
121 Reachable.insert(BB);
184 if (Reachable.insert(*SI))
190 /// removeUnreachableBlocksFromFn - Remove blocks that are not reachable, even
194 SmallPtrSet<BasicBlock*, 128> Reachable;
195 bool Changed = markAliveBlocks(F.begin(), Reachable);
198 if (Reachable.size() == F.size())
201 assert(Reachable.size() < F.size());
202 NumSimpl += F.size()-Reachable.size();
204 // Loop over all of the basic blocks that are not reachable, dropping all o
    [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/llvm/lib/Transforms/Utils/
Local.cpp     [all...]
  /external/clang/lib/Sema/
JumpDiagnostics.cpp 594 // For each target scope, make sure it's trivially reachable from
602 llvm::BitVector Reachable(Scopes.size(), false);
608 Reachable.reset();
615 Reachable.set(Min);
633 // we've marked reachable. For well-formed code this amortizes
639 if (Reachable.test(Scope)) {
640 // If we find something reachable, mark all the scopes we just
641 // walked through as reachable.
643 Reachable.set(S);
649 // gotten shallower than the shallowest reachable scope
    [all...]
  /external/valgrind/main/memcheck/
mc_leakcheck.c 85 // - still reachable: cases 1, 2
120 // Also, --show-reachable is a bad name because it also turns on the showing
170 // are mentioned elsewhere (if --show-reachable=yes is given!))
194 // reachable, depending on whether interior-pointers were required to
196 // - At this point we know for every block if it's reachable or not.
226 // prior node is a block which is reachable from the root-set via
229 // reachable from the root-set via a path including at least one
584 // - Unreached --> Reachable
585 // - Possible --> Reachable
586 if (ptr == ch->data && is_prior_definite && ex->state != Reachable) {
    [all...]
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 */
mc_errors.c 396 case Reachable: loss = "still reachable"; break;
408 case Reachable: loss = "Leak_StillReachable"; break;
    [all...]

Completed in 793 milliseconds