| /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 | [all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SimplifyCFGPass.cpp | 116 SmallPtrSet<BasicBlock*, 128> &Reachable) {
120 Reachable.insert(BB);
183 if (Reachable.insert(*SI))
189 /// removeUnreachableBlocksFromFn - Remove blocks that are not reachable, even
193 SmallPtrSet<BasicBlock*, 128> Reachable;
194 bool Changed = markAliveBlocks(F.begin(), Reachable);
197 if (Reachable.size() == F.size())
200 assert(Reachable.size() < F.size());
201 NumSimpl += F.size()-Reachable.size();
203 // 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...] |
| PrologEpilogInserter.cpp | 734 SmallPtrSet<MachineBasicBlock*, 8> Reachable;
736 // Iterate over the reachable blocks in DFS order.
738 DFI = df_ext_begin(&Fn, Reachable), DFE = df_ext_end(&Fn, Reachable);
744 assert(Reachable.count(StackPred) &&
755 if (Reachable.count(BB))
[all...] |
| MachineVerifier.cpp | 100 // Is this MBB reachable from the MF entry point?
101 bool reachable; member in struct:__anon24497::MachineVerifier::BBInfo
126 BBInfo() : reachable(false) {}
438 if (!MInfo.reachable) {
439 MInfo.reachable = true;
[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 | 599 // For each target scope, make sure it's trivially reachable from
607 llvm::BitVector Reachable(Scopes.size(), false);
613 Reachable.reset();
620 Reachable.set(Min);
638 // we've marked reachable. For well-formed code this amortizes
644 if (Reachable.test(Scope)) {
645 // If we find something reachable, mark all the scopes we just
646 // walked through as reachable.
648 Reachable.set(S);
654 // 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...] |
| /external/chromium_org/chrome/browser/resources/file_manager/foreground/js/ |
| file_transfer_controller.js | 10 * since DataTransfer object is in protected state. Reachable from other
|
