/external/valgrind/main/gdbserver_tests/ |
H A D | mcleak.stderr.exp | 4 expecting details 10 bytes reachable 5 10 bytes in 1 blocks are still reachable in loss record ... of ... 11 expecting details +10 bytes lost, +21 bytes reachable 12 expecting details +65 bytes reachable 14 expecting details +10 bytes reachable 15 expecting details -10 bytes reachable, +10 bytes lost 16 expecting details -10 bytes lost, +10 bytes reachable 17 expecting details 32 (+32) bytes lost, 33 (-32) bytes reachable 21 reachable: 64 bytes in 3 blocks 23 10 bytes in 1 blocks are still reachable i [all...] |
H A D | mcleak.stderrB.exp | 3 10 bytes in 1 blocks are still reachable in loss record ... of ... 13 21 (+21) bytes in 1 (+1) blocks are still reachable in loss record ... of ... 18 65 (+65) bytes in 2 (+2) blocks are still reachable in loss record ... of ... 23 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ... 28 0 (-10) bytes in 0 (-1) blocks are still reachable in loss record ... of ... 43 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ... 53 33 (-32) bytes in 1 (-1) blocks are still reachable in loss record ... of ... 58 10 bytes in 1 blocks are still reachable in loss record ... of ... 63 21 bytes in 1 blocks are still reachable in loss record ... of ... 73 33 bytes in 1 blocks are still reachable i [all...] |
H A D | mchelp.stdoutB.exp | 28 [kinds kind1,kind2,...|reachable|possibleleak*|definiteleak] 33 where kind is one of definite indirect possible reachable all none 38 leak_check full reachable any limited 100 87 [kinds kind1,kind2,...|reachable|possibleleak*|definiteleak] 92 where kind is one of definite indirect possible reachable all none 97 leak_check full reachable any limited 100
|
H A D | mcblocklistsearch.stderrB.exp | 15 16 bytes in 1 blocks are still reachable in loss record ... of ... 20 16 bytes in 1 blocks are still reachable in loss record ... of ... 25 16 bytes in 1 blocks are still reachable in loss record ... of ...
|
/external/valgrind/main/memcheck/tests/ |
H A D | error_counts.c | 11 int* reachable __attribute__((unused)); local 49 reachable = malloc(99);
|
H A D | leak-delta.stderr.exp | 1 expecting details 10 bytes reachable 2 10 bytes in 1 blocks are still reachable in loss record ... of ... 8 expecting details +10 bytes lost, +21 bytes reachable 14 21 (+21) bytes in 1 (+1) blocks are still reachable in loss record ... of ... 19 expecting details +65 bytes reachable 20 65 (+65) bytes in 2 (+2) blocks are still reachable in loss record ... of ... 26 expecting details +10 bytes reachable 27 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ... 32 expecting details -10 bytes reachable, +10 bytes lost 33 0 (-10) bytes in 0 (-1) blocks are still reachable i [all...] |
H A D | leak_cpp_interior.stderr.exp | 12 still reachable: 111 bytes in 7 blocks 13 of which reachable via heuristic: 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 heuristic
|
/external/chromium_org/base/third_party/valgrind/ |
H A D | memcheck.h | 201 /* Return number of leaked, dubious, reachable and suppressed bytes found by 203 #define VALGRIND_COUNT_LEAKS(leaked, dubious, reachable, suppressed) \ 219 reachable = _qzz_reachable; \ 223 /* Return number of leaked, dubious, reachable and suppressed bytes found by 225 #define VALGRIND_COUNT_LEAK_BLOCKS(leaked, dubious, reachable, suppressed) \ 241 reachable = _qzz_reachable; \
|
/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/clang/lib/StaticAnalyzer/Checkers/ |
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 | AnalyzerStatsChecker.cpp | 46 llvm::SmallPtrSet<const CFGBlock*, 256> reachable; local 65 reachable.insert(CB); 79 if (!reachable.count(CB)) {
|
H A D | DeadStoresChecker.cpp | 69 llvm::BitVector reachable; member in class:__anon18174::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/valgrind/main/memcheck/ |
H A D | memcheck.h | 212 /* Return number of leaked, dubious, reachable and suppressed bytes found by 214 #define VALGRIND_COUNT_LEAKS(leaked, dubious, reachable, suppressed) \ 230 reachable = _qzz_reachable; \ 234 /* Return number of leaked, dubious, reachable and suppressed bytes found by 236 #define VALGRIND_COUNT_LEAK_BLOCKS(leaked, dubious, reachable, suppressed) \ 252 reachable = _qzz_reachable; \
|
/external/clang/lib/Analysis/ |
H A D | CFGReachabilityAnalysis.cpp | 12 // is reachable within the CFG. 37 return reachable[DstBlockID][Src->getBlockID()]; 46 ReachableSet &DstReachability = reachable[Dst->getBlockID()];
|
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/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/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/openfst/src/include/fst/ |
H A D | fstlib.h | 138 #include <fst/label-reachable.h> 142 #include <fst/state-reachable.h>
|
H A D | lookahead-matcher.h | 28 #include <fst/label-reachable.h> 643 LabelReachable<A> reachable(data->First() ? 645 reachable.Relabel(fst, relabel_input); 658 LabelReachable<A> reachable(data->First() ? 660 reachable.RelabelPairs(pairs, avoid_collisions); 680 LabelReachable<A> reachable(data->First()); 681 reachable.Relabel(mfst, true); 684 reachable.RelabelPairs(&pairs, true); 688 LabelReachable<A> reachable(data->Second()); 689 reachable [all...] |
H A D | label-reachable.h | 35 #include <fst/state-reachable.h> 41 // Stores shareable data for label reachable class copies. 119 // required to ensure a compact representation of the reachable 139 // returned. The optional template argument controls how reachable arc 178 LabelReachable(const LabelReachable<A, S> &reachable) : argument 181 data_(reachable.data_), 182 accumulator_(new S(*reachable.accumulator_)), 185 error_(reachable.error_) { 552 // arcs with reachable labels.
|
H A D | state-reachable.h | 1 // state-reachable.h 35 // Computes the (final) states reachable from a given state in an FST. 155 StateReachable(const StateReachable<A> &reachable) { argument 156 FSTERROR() << "Copy constructor for state reachable class "
|
/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/Support/ |
H A D | regengine.inc | 846 - step - map set of states reachable before char to set reachable after 852 states bef, /* states reachable before */ 854 states aft) /* states already known reachable after */
|
/external/chromium_org/third_party/cython/src/Cython/Includes/cpython/ |
H A D | ref.pxd | 32 # global variables. This means that any object that is reachable
|
/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:__anon25778::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)
|