| /external/autotest/client/site_tests/network_WiFiResume/ |
| network_WiFiResume.py | 14 def run_once(self, reachable=None, wifi_timeout=5, dev=None):
20 @param reachable: ip address (string) to try to ping as a network test
36 if network_is_up(reachable=reachable, dev=dev):
40 have_network = network_is_up(reachable=reachable, dev=dev)
43 have_network = network_is_up(reachable=reachable, dev=dev)
82 def network_is_up(reachable=None, dev=None):
83 if not reachable
[all...] |
| /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/gdbserver_tests/ |
| mcleak.stderr.exp | 2 expecting details 10 bytes reachable
3 10 bytes in 1 blocks are still reachable in loss record ... of ...
8 expecting details +10 bytes lost, +21 bytes reachable
9 expecting details +65 bytes reachable
11 expecting details +10 bytes reachable
12 expecting details -10 bytes reachable, +10 bytes lost
13 expecting details -10 bytes lost, +10 bytes reachable
14 expecting details 32 (+32) bytes lost, 33 (-32) bytes reachable
18 reachable: 64 bytes in 3 blocks
20 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 ...
11 21 (+21) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
15 65 (+65) bytes in 2 (+2) blocks are still reachable in loss record ... of ...
19 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
23 0 (-10) bytes in 0 (-1) blocks are still reachable in loss record ... of ...
35 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
43 33 (-32) bytes in 1 (-1) blocks are still reachable in loss record ... of ...
47 10 bytes in 1 blocks are still reachable in loss record ... of ...
51 21 bytes in 1 blocks are still reachable in loss record ... of ...
59 33 bytes in 1 blocks are still reachable in loss record ... of ..
[all...] |
| mchelp.stdoutB.exp | 31 [kinds kind1,kind2,...|reachable|possibleleak*|definiteleak]
37 definite indirect possible reachable all none
43 leak_check full reachable any limited 100
100 [kinds kind1,kind2,...|reachable|possibleleak*|definiteleak]
106 definite indirect possible reachable all none
112 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/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: 163 bytes in 8 blocks
13 of which reachable via heuristic:
19 Reachable blocks (those to which a pointer was found) are not shown.
27 still reachable: 48 (-115) bytes in 4 (-4) blocks
28 of which reachable via heuristic:
41 still reachable: 52 (+4) bytes in 3 (-1) blocks
42 of which reachable via heuristic:
53 still reachable: 55 (+3) bytes in 3 (+0) blocks
54 of which reachable via heuristic:
65 still reachable: 80 (+25) bytes in 4 (+1) block
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| CFGReachabilityAnalysis.h | 12 // is reachable within the CFG.
36 ReachableMap reachable; member in class:clang::CFGReverseBlockReachabilityAnalysis
|
| /external/selinux/policycoreutils/mcstrans/utils/ |
| valgrind-mcstransd | 3 #valgrind -v --leak-check=full --show-reachable=yes ../src/mcstransd
4 runcon -u system_u -r system_r -t setrans_t -l s15:c0.c1023 -- valgrind -v --leak-check=full --show-reachable=yes ../src/mcstransd
|
| /external/selinux/libselinux/src/ |
| get_context_list.c | 159 char ** reachable,
246 /* Check for a match in the reachable list. */
247 rc = find_partialcon(reachable, nreach, start);
397 char **reachable = NULL; local
416 /* Determine the set of reachable contexts for the user. */
417 rc = security_compute_user(fromcon, user, &reachable);
421 for (ptr = reachable; *ptr; ptr++)
443 rc = get_context_order(fp, fromcon, reachable, nreach, ordering,
457 rc = get_context_order(fp, fromcon, reachable, nreach, ordering,
477 co[i].con = reachable[i]
[all...] |
| /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:__anon6750::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/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);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/configuration/ |
| FlagManagerTest.java | 119 Set<String> reachable = Sets.newHashSet(); local
123 reachable.add(region);
127 unused.removeAll(reachable);
129 for (String region : reachable) {
|
| /external/dhcpcd-6.8.2/ |
| ipv6nd.h | 54 uint32_t reachable; member in struct:ra
|
| /external/sl4a/Common/src/com/googlecode/android_scripting/facade/wifi/ |
| HttpFacade.java | 193 boolean reachable = (returnVal == 0);
195 return reachable;
|
| /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...] |
