/external/valgrind/main/gdbserver_tests/ |
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 in loss record ... of .. [all...] |
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 ...
|
mchelp.stdoutB.exp | 24 leak_check [full*|summary] [reachable|possibleleak*|definiteleak] 61 leak_check [full*|summary] [reachable|possibleleak*|definiteleak]
|
/external/valgrind/main/memcheck/tests/ |
error_counts.c | 11 int* reachable __attribute__((unused)); local 49 reachable = malloc(99);
|
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 in loss record ... of .. [all...] |
/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/ |
memcheck.h | 209 /* Return number of leaked, dubious, reachable and suppressed bytes found by 211 #define VALGRIND_COUNT_LEAKS(leaked, dubious, reachable, suppressed) \ 227 reachable = _qzz_reachable; \ 231 /* Return number of leaked, dubious, reachable and suppressed bytes found by 233 #define VALGRIND_COUNT_LEAK_BLOCKS(leaked, dubious, reachable, suppressed) \ 249 reachable = _qzz_reachable; \
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
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...] |
AnalyzerStatsChecker.cpp | 46 llvm::SmallPtrSet<const CFGBlock*, 256> reachable; local 65 reachable.insert(CB); 79 if (!reachable.count(CB)) {
|
DeadStoresChecker.cpp | 70 llvm::BitVector reachable; member in class:__anon5976::ReachableCode 73 : cfg(cfg), reachable(cfg.getNumBlockIDs(), false) {} 78 return reachable[block->getBlockID()]; 93 llvm::BitVector::reference isReachable = reachable[block->getBlockID()]; 164 // Compute reachable blocks within the CFG for trivial cases
|
/external/clang/lib/Analysis/ |
CFGReachabilityAnalysis.cpp | 12 // is reachable within the CFG. 37 return reachable[DstBlockID][Src->getBlockID()]; 46 ReachableSet &DstReachability = reachable[Dst->getBlockID()];
|
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...] |
/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...] |
/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);
|
/external/openfst/src/include/fst/ |
fstlib.h | 138 #include <fst/label-reachable.h> 142 #include <fst/state-reachable.h>
|
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.Relabel(mfst, false) [all...] |
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) : 181 data_(reachable.data_), 182 accumulator_(new S(*reachable.accumulator_)), 185 error_(reachable.error_) { 552 // arcs with reachable labels.
|
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) { 156 FSTERROR() << "Copy constructor for state reachable class "
|
/dalvik/dx/src/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/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 | 99 // Is this MBB reachable from the MF entry point? 100 bool reachable; member in struct:__anon11448::MachineVerifier::BBInfo 125 BBInfo() : reachable(false) {} 436 if (!MInfo.reachable) { 437 MInfo.reachable = true; [all...] |
/external/iproute2/doc/ |
ip-tunnels.tex | 122 but address of peering host, which is directly reachable 133 kinds and gateway is required to be directly reachable via this tunnel, 220 reachable over device \verb|tunl0|. With IPv6 the situation is much simpler: 223 Internet is {\em really reachable} via \verb|sit0|! Excellent, the command
|
/external/iproute2/ip/ |
ipntable.c | 486 __u64 reachable = *(__u64 *)RTA_DATA(tpb[NDTPA_REACHABLE_TIME]); local 487 fprintf(fp, "reachable %llu ", reachable);
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/messages/languages/ |
en.stg | 292 [fatal] rule <ruleName> has non-LL(*) decision due to recursive rule invocations reachable from alts <alts; separator=",">. Resolve by left-factoring or using syntactic predicates or using backtrack=true option.
|
/external/v8/test/mjsunit/ |
debug-setbreakpoint.js | 213 // The tricky part is that the script function must be strongly reachable at the
|