| /external/clang/include/clang/Analysis/Analyses/ |
| ReachableCode.h | 59 /// ScanReachableFromBlock - Mark all blocks reachable from Start.
60 /// Returns the total number of blocks that were marked reachable.
62 llvm::BitVector &Reachable);
|
| Consumed.h | 139 bool Reachable;
145 ConsumedStateMap() : Reachable(true), From(nullptr) {}
147 : Reachable(Other.Reachable), From(Other.From), VarMap(Other.VarMap),
171 /// \brief Return true if this block is reachable.
172 bool isReachable() const { return Reachable; }
|
| /external/llvm/lib/CodeGen/ |
| UnreachableBlockElim.cpp | 11 // job is to delete LLVM basic blocks that are not reachable from the entry
64 SmallPtrSet<BasicBlock*, 8> Reachable;
66 // Mark all reachable blocks.
68 df_ext_begin(&F, Reachable), E = df_ext_end(&F, Reachable); I != E; ++I)
69 /* Mark all reachable blocks */;
75 if (!Reachable.count(I)) {
120 SmallPtrSet<MachineBasicBlock*, 8> Reachable;
127 // Mark all reachable blocks.
129 I = df_ext_begin(&F, Reachable), E = df_ext_end(&F, Reachable)
[all...] |
| PrologEpilogInserter.cpp | 710 SmallPtrSet<MachineBasicBlock*, 8> Reachable;
712 // Iterate over the reachable blocks in DFS order.
714 DFI = df_ext_begin(&Fn, Reachable), DFE = df_ext_end(&Fn, Reachable);
720 assert(Reachable.count(StackPred) &&
731 if (Reachable.count(BB))
[all...] |
| MachineVerifier.cpp | 100 // Is this MBB reachable from the MF entry point?
101 bool reachable; member in struct:__anon30389::MachineVerifier::BBInfo
126 BBInfo() : reachable(false) {}
446 if (!MInfo.reachable) {
447 MInfo.reachable = true;
[all...] |
| /external/clang/lib/Analysis/ |
| ReachableCode.cpp | 11 // determining reachable blocks within a CFG.
104 // well be reachable via a different control flow, thus it's not dead.
268 llvm::BitVector &Reachable,
276 // The entry block may have already been marked reachable
278 if (!Reachable[Start->getBlockID()]) {
280 Reachable[Start->getBlockID()] = true;
285 // Find the reachable blocks from 'Start'.
289 // There are cases where we want to treat all successors as reachable.
294 // Look at the successors and mark then reachable.
322 if (!Reachable[blockID])
[all...] |
| ThreadSafety.cpp | 905 bool Reachable; // Is this block reachable?
916 : EntryContext(EmptyCtx), ExitContext(EmptyCtx), Reachable(false)
[all...] |
| Consumed.cpp | [all...] |
| CFG.cpp | 190 /// distance - Calculates distance from this to L. L must be reachable from this
198 && "L iterator is not reachable from F iterator.");
492 /// Add a reachable successor to a block, with the alternate variant that is
[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/valgrind/main/memcheck/tests/ |
| leak-segv-jmp.stderr.exp | 9 still reachable: 41,000 bytes in 2 blocks
11 Reachable blocks (those to which a pointer was found) are not shown.
24 still reachable: 40,000 bytes in 1 blocks
26 Reachable blocks (those to which a pointer was found) are not shown.
40 still reachable: 40,000 bytes in 1 blocks
42 Reachable blocks (those to which a pointer was found) are not shown.
56 still reachable: 40,000 bytes in 1 blocks
58 Reachable blocks (those to which a pointer was found) are not shown.
66 still reachable: 40,000 bytes in 1 blocks
72 reachable: 40000 bytes in 1 block
[all...] |
| lks.stderr.exp | 8 still reachable: 64 bytes in 4 blocks
14 reachable: 64 bytes in 4 blocks
55 still reachable: 64 bytes in 4 blocks
57 Reachable blocks (those to which a pointer was found) are not shown.
|
| leak_cpp_interior.stderr.exp | 12 still reachable: 111 bytes in 7 blocks
13 of which reachable via heuristic:
18 Reachable blocks (those to which a pointer was found) are not shown.
26 still reachable: 48 (-63) bytes in 4 (-3) blocks
27 of which reachable via heuristic:
39 still reachable: 31 (-17) bytes in 3 (-1) blocks
40 of which reachable via heuristic:
51 still reachable: 80 (+49) bytes in 4 (+1) blocks
52 of which reachable via heuristic:
61 block at 0x........ considered reachable by ptr 0x........ using newarray heuristi
[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
171 // are mentioned elsewhere (if --show-reachable=yes or indirect is given
196 // reachable, depending on whether interior-pointers were required to
198 // - At this point we know for every block if it's reachable or not.
228 // prior node is a block which is reachable from the root-set via
231 // reachable from the root-set via a path including at least one
432 // Heuristic with which this block was considered reachable.
433 // LchNone if state != Reachable or no heuristic needed to
434 // consider it reachable
[all...] |
| mc_include.h | 268 Reachable =0, // Definitely reachable from root-set.
269 Possible =1, // Possibly reachable from root-set; involves at
271 IndirectLeak =2, // Leaked, but reachable from another leaked block
274 // (At best, only reachable from itself via a cycle.)
284 (R2S(Reachable) | R2S(Possible) | R2S(IndirectLeak) | R2S(Unreached))
512 // std::string as reachable.
515 // reachable. Such interior pointers are used for arrays whose elements
519 // as reachable.
|
| mc_errors.c | 224 case Reachable: loss = "still reachable"; break;
236 case Reachable: loss = "Leak_StillReachable"; break;
243 return VG_(parse_enum_set)("reachable,possible,indirect,definite",
250 case Reachable: return "reachable";
[all...] |
| mc_main.c | [all...] |
| /external/chromium_org/ui/file_manager/file_manager/foreground/js/ |
| file_transfer_controller.js | 10 * since DataTransfer object is in protected state. Reachable from other
[all...] |
