/external/clang/include/clang/Analysis/Analyses/ |
H A D | CFGReachabilityAnalysis.h | 12 // is reachable within the CFG. 36 ReachableMap reachable; member in class:clang::CFGReverseBlockReachabilityAnalysis
|
/external/valgrind/main/memcheck/tests/ |
H A D | error_counts.c | 11 int* reachable __attribute__((unused)); local 49 reachable = malloc(99);
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
H A D | AnalyzerStatsChecker.cpp | 46 llvm::SmallPtrSet<const CFGBlock*, 256> reachable; local 65 reachable.insert(CB); 79 if (!reachable.count(CB)) {
|
H A D | UnreachableCodeChecker.cpp | 46 CFGBlocksSet &reachable, 56 CFGBlocksSet reachable, visited; local 84 reachable.insert(CB->getBlockID()); 103 if (reachable.count(CB->getBlockID())) 112 FindUnreachableEntryPoints(CB, reachable, visited); 115 if (reachable.count(CB->getBlockID())) 175 CFGBlocksSet &reachable, 184 if (!reachable.count((*I)->getBlockID())) { 185 // If we find an unreachable predecessor, mark this block as reachable so 187 reachable 174 FindUnreachableEntryPoints(const CFGBlock *CB, CFGBlocksSet &reachable, CFGBlocksSet &visited) argument [all...] |
H A D | DeadStoresChecker.cpp | 69 llvm::BitVector reachable; member in class:__anon17373::ReachableCode 72 : cfg(cfg), reachable(cfg.getNumBlockIDs(), false) {} 77 return reachable[block->getBlockID()]; 91 llvm::BitVector::reference isReachable = reachable[block->getBlockID()]; 169 // Compute reachable blocks within the CFG for trivial cases
|
/external/chromium_org/net/base/ |
H A D | 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/bison/src/ |
H A D | state.c | 407 | Record S and all states reachable from S in REACHABLE. | 411 state_record_reachable_states (state *s, bitset reachable) argument 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);
|
/external/iproute2/ip/ |
H A D | ipntable.c | 486 __u64 reachable = rta_getattr_u64(tpb[NDTPA_REACHABLE_TIME]); local 487 fprintf(fp, "reachable %llu ", reachable);
|
/external/clang/lib/Analysis/ |
H A D | ReachableCode.cpp | 11 // determining reachable blocks within a CFG. 104 // well be reachable via a different control flow, thus it's not dead. 276 // The entry block may have already been marked reachable 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. 356 DeadCodeScan(llvm::BitVector &reachable, Preprocessor &PP) argument 357 : Visited(reachable.size()), 358 Reachable(reachable), 451 // It is possible that this block has been marked reachable afte [all...] |
/external/dexmaker/src/dx/java/com/android/dx/ssa/ |
H A D | 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;
|
/external/llvm/lib/CodeGen/ |
H A D | MachineVerifier.cpp | 100 // Is this MBB reachable from the MF entry point? 101 bool reachable; member in struct:__anon24942::MachineVerifier::BBInfo 126 BBInfo() : reachable(false) {} 446 if (!MInfo.reachable) { 447 MInfo.reachable = true; 1162 if (!MInfo.reachable) 1238 if (PrInfo.reachable && !PrInfo.isLiveOut(Reg)) 1262 if (!MInfo.reachable)
|
/external/chromium_org/v8/src/ |
H A D | hydrogen.cc | 397 // Mark blocks that dominate all subsequent reachable blocks inside their 404 // dominator_candidate block is guaranteed to dominate all blocks reachable 515 // the BitVector "reachable()" for every block that can be reached 518 // returns the number of reachable blocks. 533 const BitVector* reachable() const { return &reachable_; } function in class:v8::internal::BASE_EMBEDDED 636 ASSERT(!dominator_analyzer.reachable()->Contains(block->block_id())); 906 // branch. However, we must pretend that the "then" branch is reachable, 4335 // made blocks unreachable that were previously reachable. 7755 // reachable for deopt, and is only used to capture the state. If the simulate 7756 // becomes reachable b [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.osgi_3.6.1.R36x_v20100806.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.osgi_3.6.2.R36x_v20101103.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
/external/owasp/sanitizer/tools/findbugs/lib/ |
H A D | ant.jar | META-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/tools/ org/apache/tools/ant/ ... |
H A D | findbugs.jar | META-INF/ META-INF/MANIFEST.MF default.xsl edu/ edu/umd/ edu/umd/cs/ edu/ ... |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/ |
H A D | ant.jar | META-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/tools/ org/apache/tools/ant/ ... |
/external/jarjar/lib/ |
H A D | apache-ant-1.9.4.jar | META-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/tools/ org/apache/tools/ant/ ... |