| /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/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 | 311 bool Reachable; // Is this block reachable?
322 : EntryContext(EmptyCtx), ExitContext(EmptyCtx), Reachable(false)
[all...] |
| Consumed.cpp | [all...] |
| CFG.cpp | 262 /// distance - Calculates distance from this to L. L must be reachable from this
270 && "L iterator is not reachable from F iterator.");
634 /// Add a reachable successor to a block, with the alternate variant that is
[all...] |
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 133 /// NodesReachableFrom - Return the set of all nodes reachable from the given
138 NodeSubset Reachable;
140 // The initial node is reachable.
141 Reachable.AddNode(Idx);
143 NodeSubset Previous(Reachable);
145 // Add in all nodes which are children of a reachable node.
148 Reachable = Reachable.Join(Nodes[i].second);
150 // If nothing changed then we have found all reachable nodes.
151 if (Reachable == Previous
[all...] |
| /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.
67 for (BasicBlock *BB : depth_first_ext(&F, Reachable))
68 (void)BB/* Mark all reachable blocks */;
74 if (!Reachable.count(&*I)) {
119 SmallPtrSet<MachineBasicBlock*, 8> Reachable;
126 // Mark all reachable blocks.
127 for (MachineBasicBlock *BB : depth_first_ext(&F, Reachable))
128 (void)BB/* Mark all reachable blocks */
[all...] |
| PrologEpilogInserter.cpp | 816 SmallPtrSet<MachineBasicBlock*, 8> Reachable;
818 // Iterate over the reachable blocks in DFS order.
819 for (auto DFI = df_ext_begin(&Fn, Reachable), DFE = df_ext_end(&Fn, Reachable);
825 assert(Reachable.count(StackPred) &&
836 if (Reachable.count(&BB))
[all...] |
| MachineVerifier.cpp | 99 // Is this MBB reachable from the MF entry point?
100 bool reachable; member in struct:__anon17328::MachineVerifier::BBInfo
125 BBInfo() : reachable(false) {}
460 if (!MInfo.reachable) {
461 MInfo.reachable = true;
[all...] |
| /external/valgrind/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.
77 still reachable: 40,000 bytes in 1 blocks
79 Reachable blocks (those to which a pointer was found) are not shown
[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: 163 bytes in 8 blocks
13 of which reachable via heuristic:
19 Reachable blocks (those to which a pointer was found) are not shown.
27 still reachable: 48 (-115) bytes in 4 (-4) blocks
28 of which reachable via heuristic:
41 still reachable: 52 (+4) bytes in 3 (-1) blocks
42 of which reachable via heuristic:
53 still reachable: 55 (+3) bytes in 3 (+0) blocks
54 of which reachable via heuristic:
65 still reachable: 80 (+25) bytes in 4 (+1) block
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | [all...] |
| /external/clang/lib/Sema/ |
| JumpDiagnostics.cpp | 634 // For each target scope, make sure it's trivially reachable from
642 llvm::BitVector Reachable(Scopes.size(), false);
648 Reachable.reset();
655 Reachable.set(Min);
673 // we've marked reachable. For well-formed code this amortizes
679 if (Reachable.test(Scope)) {
680 // If we find something reachable, mark all the scopes we just
681 // walked through as reachable.
683 Reachable.set(S);
689 // gotten shallower than the shallowest reachable scope
[all...] |
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyPEI.cpp | 832 SmallPtrSet<MachineBasicBlock*, 8> Reachable;
834 // Iterate over the reachable blocks in DFS order.
835 for (auto DFI = df_ext_begin(&Fn, Reachable), DFE = df_ext_end(&Fn, Reachable);
841 assert(Reachable.count(StackPred) &&
[all...] |
| /external/valgrind/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_errors.c | 235 case Reachable: loss = "still reachable"; break;
247 case Reachable: loss = "Leak_StillReachable"; break;
253 "reachable,possible,indirect,definite";
274 case Reachable: return "reachable";
[all...] |
| mc_include.h | 371 Reachable =0, // Definitely reachable from root-set.
372 Possible =1, // Possibly reachable from root-set; involves at
374 IndirectLeak =2, // Leaked, but reachable from another leaked block
377 // (At best, only reachable from itself via a cycle.)
620 // std::string as reachable.
623 // reachable, when the first 8 bytes contains the block size - 8.
628 // reachable. Such interior pointers are used for arrays whose elements
632 // as reachable.
|
| mc_main.c | [all...] |
| /external/selinux/sepolgen/src/sepolgen/ |
| yacc.py | 801 Reachable = { }
803 Reachable[s] = 0
805 mark_reachable_from( Productions[0].prod[0], Reachable )
808 if not Reachable[s]:
811 def mark_reachable_from(s, Reachable):
813 Mark all symbols that are reachable from symbol s.
815 if Reachable[s]:
818 Reachable[s] = 1
821 mark_reachable_from(r, Reachable)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/sepolgen/ |
| yacc.py | 801 Reachable = { }
803 Reachable[s] = 0
805 mark_reachable_from( Productions[0].prod[0], Reachable )
808 if not Reachable[s]:
811 def mark_reachable_from(s, Reachable):
813 Mark all symbols that are reachable from symbol s.
815 if Reachable[s]:
818 Reachable[s] = 1
821 mark_reachable_from(r, Reachable)
[all...] |
