Searched refs:reachable (Results 1 - 25 of 41) sorted by relevance

12

/external/autotest/client/site_tests/network_WiFiResume/
H A Dnetwork_WiFiResume.py14 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...]
/external/valgrind/gdbserver_tests/
H A Dmcleak.stderr.exp2 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 i
[all...]
H A Dmcleak.stderrB.exp3 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 i
[all...]
H A Dmchelp.stdoutB.exp31 [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
H A Dmcblocklistsearch.stderrB.exp15 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/
H A Derror_counts.c11 int* reachable __attribute__((unused)); local
49 reachable = malloc(99);
H A Dleak-delta.stderr.exp1 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 Dleak_cpp_interior.stderr.exp12 still reachable: 163 bytes in 8 blocks
13 of which reachable via heuristic:
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) blocks
66 of which reachable vi
[all...]
/external/selinux/policycoreutils/mcstrans/utils/
H A Dvalgrind-mcstransd3 #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/clang/include/clang/Analysis/Analyses/
H A DCFGReachabilityAnalysis.h12 // is reachable within the CFG.
36 ReachableMap reachable; member in class:clang::CFGReverseBlockReachabilityAnalysis
/external/selinux/libselinux/src/
H A Dget_context_list.c159 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[
157 get_context_order(FILE * fp, char * fromcon, char ** reachable, unsigned int nreach, unsigned int *ordering, unsigned int *nordered) argument
[all...]
/external/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp46 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 DAnalyzerStatsChecker.cpp46 llvm::SmallPtrSet<const CFGBlock*, 256> reachable; local
65 reachable.insert(CB);
79 if (!reachable.count(CB)) {
H A DDeadStoresChecker.cpp69 llvm::BitVector reachable; member in class:__anon1648::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/
H A Dmemcheck.h212 /* 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 DCFGReachabilityAnalysis.cpp12 // is reachable within the CFG.
37 return reachable[DstBlockID][Src->getBlockID()];
46 ReachableSet &DstReachability = reachable[Dst->getBlockID()];
H A DReachableCode.cpp11 // 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 Dstate.c407 | 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/dhcpcd-6.8.2/
H A Dipv6nd.h54 uint32_t reachable; member in struct:ra
/external/sl4a/Common/src/com/googlecode/android_scripting/facade/wifi/
H A DHttpFacade.java193 boolean reachable = (returnVal == 0);
195 return reachable;
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DSsaBasicBlock.java100 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 Dregengine.inc846 - 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/llvm/lib/CodeGen/
H A DMachineVerifier.cpp99 // Is this MBB reachable from the MF entry point?
100 bool reachable; member in struct:__anon12246::MachineVerifier::BBInfo
125 BBInfo() : reachable(false) {}
460 if (!MInfo.reachable) {
461 MInfo.reachable = true;
1237 if (!MInfo.reachable)
1313 if (PrInfo.reachable && !PrInfo.isLiveOut(Reg))
1337 if (!MInfo.reachable)
/external/iproute2/doc/
H A Dip-tunnels.tex122 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/
H A Dipntable.c486 unsigned long long reachable = rta_getattr_u64(tpb[NDTPA_REACHABLE_TIME]); local
487 fprintf(fp, "reachable %llu ", reachable);

Completed in 1624 milliseconds

12