| /cts/apps/CtsVerifier/src/com/android/cts/verifier/nfc/hce/ |
| CommandApdu.java | 10 public CommandApdu(String apdu, boolean reachable) {
12 mReachable = reachable;
33 boolean reachable = source.readInt() != 0 ? true : false;
34 return new CommandApdu(apdu, reachable);
|
| HceUtils.java | 68 public static final CommandApdu buildCommandApdu(String apdu, boolean reachable) {
69 return new CommandApdu(apdu, reachable);
72 public static final CommandApdu buildSelectApdu(String aid, boolean reachable) {
77 return new CommandApdu(sb.toString(), reachable);
|
| /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 ...
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 in loss record ... of ..
[all...] |
| 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
|
| 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/ |
| 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...] |
| leak_cpp_interior.stderr.exp | 12 still reachable: 111 bytes in 7 blocks
13 of which reachable via heuristic:
18 Reachable blocks (those to which a pointer was found) are not shown.
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 heuristi
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| CFGReachabilityAnalysis.h | 12 // is reachable within the CFG.
36 ReachableMap reachable; member in class:clang::CFGReverseBlockReachabilityAnalysis
|
| /external/chromium_org/base/third_party/valgrind/ |
| 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/lib/StaticAnalyzer/Checkers/ |
| 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.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 | 69 llvm::BitVector reachable; member in class:__anon1879::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/ |
| 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/ |
| 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.
104 // well be reachable via a different control flow, thus it's not dead.
268 llvm::BitVector &Reachable,
276 // The entry block may have already been marked reachable
278 if (!Reachable[Start->getBlockID()]) {
280 Reachable[Start->getBlockID()] = true;
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.
322 if (!Reachable[blockID])
[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/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/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.
|
| /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...] |
