| /external/clang/include/clang/Analysis/Analyses/ |
| CFGReachabilityAnalysis.h | 12 // is reachable within the CFG.
36 ReachableMap reachable; member in class:clang::CFGReverseBlockReachabilityAnalysis
|
| /external/valgrind/main/memcheck/tests/ |
| error_counts.c | 11 int* reachable __attribute__((unused)); local
49 reachable = malloc(99);
|
| /external/chromium_org/net/base/ |
| network_change_notifier_mac.cc | 17 bool reachable = flags & kSCNetworkFlagsReachable; local
19 return reachable && !connection_required;
24 bool reachable = CalculateReachability(flags); local
25 if (reachable) {
143 // seems to be reachable if any network connection is available.
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| AnalyzerStatsChecker.cpp | 46 llvm::SmallPtrSet<const CFGBlock*, 256> reachable; local
65 reachable.insert(CB);
79 if (!reachable.count(CB)) {
|
| UnreachableCodeChecker.cpp | 46 CFGBlocksSet &reachable,
56 CFGBlocksSet reachable, visited; local
81 reachable.insert(CB->getBlockID());
100 if (reachable.count(CB->getBlockID()))
109 FindUnreachableEntryPoints(CB, reachable, visited);
112 if (reachable.count(CB->getBlockID()))
172 CFGBlocksSet &reachable,
178 if (!reachable.count((*I)->getBlockID())) {
179 // If we find an unreachable predecessor, mark this block as reachable so
181 reachable.insert(CB->getBlockID())
[all...] |
| DeadStoresChecker.cpp | 69 llvm::BitVector reachable; member in class:__anon17900::ReachableCode
72 : cfg(cfg), reachable(cfg.getNumBlockIDs(), false) {}
77 return reachable[block->getBlockID()];
92 llvm::BitVector::reference isReachable = reachable[block->getBlockID()];
168 // Compute reachable blocks within the CFG for trivial cases
|
| /external/bison/src/ |
| state.c | 407 | Record S and all states reachable from S in REACHABLE. |
411 state_record_reachable_states (state *s, bitset reachable)
413 if (bitset_test (reachable, s->number))
415 bitset_set (reachable, s->number);
420 state_record_reachable_states (s->transitions->states[i], reachable);
428 bitset reachable = bitset_create (nstates, BITSET_FIXED); local
429 state_record_reachable_states (states[0], reachable);
434 if (bitset_test (reachable, states[i]->number))
448 bitset_free (reachable);
[all...] |
| /external/iproute2/ip/ |
| ipntable.c | 486 __u64 reachable = rta_getattr_u64(tpb[NDTPA_REACHABLE_TIME]); local
487 fprintf(fp, "reachable %llu ", reachable);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| DependencyGraph.java | 161 List<ViewData> reachable = new ArrayList<ViewData>(); local
169 findBackwards(view, visiting, reachable, vertical, view);
173 Set<INode> dependents = new HashSet<INode>(reachable.size());
175 for (ViewData v : reachable) {
183 Set<ViewData> visiting, List<ViewData> reachable,
186 reachable.add(view);
206 findBackwards(from, visiting, reachable, vertical, start);
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaBasicBlock.java | 99 private int reachable = -1; field in class:SsaBasicBlock
846 * Returns true if this block was last calculated to be reachable.
849 * @return {@code true} if reachable
852 if (reachable == -1) {
855 return (reachable == 1);
864 reachable = reach;
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaBasicBlock.java | 100 private int reachable = -1; field in class:SsaBasicBlock
847 * Returns true if this block was last calculated to be reachable.
850 * @return {@code true} if reachable
853 if (reachable == -1) {
856 return (reachable == 1);
865 reachable = reach;
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineVerifier.cpp | 100 // Is this MBB reachable from the MF entry point?
101 bool reachable; member in struct:__anon23570::MachineVerifier::BBInfo
126 BBInfo() : reachable(false) {}
438 if (!MInfo.reachable) {
439 MInfo.reachable = true;
[all...] |
| /external/chromium_org/v8/src/ |
| hydrogen.cc | 372 // Mark blocks that dominate all subsequent reachable blocks inside their
379 // dominator_candidate block is guaranteed to dominate all blocks reachable
490 // the BitVector "reachable()" for every block that can be reached
493 // returns the number of reachable blocks.
508 const BitVector* reachable() const { return &reachable_; } function in class:v8::internal::BASE_EMBEDDED
610 ASSERT(!dominator_analyzer.reachable()->Contains(block->block_id()));
811 // branch. However, we must pretend that the "then" branch is reachable,
[all...] |
| /external/v8/src/ |
| hydrogen.cc | 320 // Mark blocks that dominate all subsequent reachable blocks inside their
327 // dominator_candidate block is guaranteed to dominate all blocks reachable
438 // the BitVector "reachable()" for every block that can be reached
441 // returns the number of reachable blocks.
456 const BitVector* reachable() const { return &reachable_; } function in class:v8::internal::BASE_EMBEDDED
554 ASSERT(!dominator_analyzer.reachable()->Contains(block->block_id()));
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.osgi_3.6.1.R36x_v20100806.jar | |
| org.eclipse.osgi_3.6.2.R36x_v20101103.jar | |
| /prebuilts/tools/common/eclipse/ |
| org.eclipse.osgi_3.6.2.R36x_v20110210.jar | |
| /prebuilts/tools/common/m2/internal/org/apache/ant/ant/1.8.0/ |
| ant-1.8.0.jar | |
| /prebuilts/sdk/tools/lib/ |
| dx.jar | |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/ |
| ant.jar | |
| /prebuilts/tools/common/ant/ |
| ant.jar | |
| /prebuilts/tools/common/m2/internal/com/google/code/findbugs/findbugs/2.0.1/ |
| findbugs-2.0.1.jar | |
