| /src/tests/usr.bin/xlint/lint1/ |
| msg_193.c | 27 extern void reachable(void);
35 reachable();
36 reachable();
42 reachable();
44 reachable();
45 reachable();
47 reachable();
54 reachable();
55 reachable();
58 reachable();
[all...] |
| /src/external/mpl/bind/dist/bin/tests/system/isctest/ |
| name.py | 40 - reachable - non-empty authoritative nodes in zone
42 - ents - reachable empty non-terminals
74 self.reachable_dnames = self.dnames.intersection(self.reachable)
75 self.reachable_wildcards = self.wildcards.intersection(self.reachable)
82 self.reachable.union(self.ents)
97 Generally reachable, reachable delegations, and occluded.
103 reachable = set(self.zone)
104 # assume everything is reachable until proven otherwise
110 if name in reachable
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| CFGReachabilityAnalysis.h | 11 // is reachable within the CFG.
36 ReachableMap reachable; member in class:clang::CFGReverseBlockReachabilityAnalysis
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| UnreachableCodeChecker.cpp | 41 CFGBlocksSet &reachable,
51 CFGBlocksSet reachable, visited; local
79 reachable.insert(CB->getBlockID());
98 if (reachable.count(CB->getBlockID()))
107 FindUnreachableEntryPoints(CB, reachable, visited);
110 if (reachable.count(CB->getBlockID()))
179 CFGBlocksSet &reachable,
188 if (!reachable.count((*I)->getBlockID())) {
189 // If we find an unreachable predecessor, mark this block as reachable so
191 reachable.insert(CB->getBlockID())
[all...] |
| AnalyzerStatsChecker.cpp | 45 llvm::SmallPtrSet<const CFGBlock*, 32> reachable; local
64 reachable.insert(CB);
78 if (!reachable.count(CB)) {
|
| DeadStoresChecker.cpp | 70 llvm::BitVector reachable; member in class:__anon3323::ReachableCode
73 : cfg(cfg), reachable(cfg.getNumBlockIDs(), false) {}
78 return reachable[block->getBlockID()];
92 llvm::BitVector::reference isReachable = reachable[block->getBlockID()];
200 // Compute reachable blocks within the CFG for trivial cases
|
| /src/sys/compat/netinet6/ |
| nd6.h | 38 u_int32_t reachable; /* Reachable Time */ member in struct:nd_ifinfo90
56 u_int32_t reachable; /* Reachable Time */ member in struct:in6_ondireq::__anon2414
|
| /src/usr.bin/make/unit-tests/ |
| unexport.mk | 12 # was not reachable though. At that point, backslash-newline has already
|
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| CFGReachabilityAnalysis.cpp | 11 // is reachable within the CFG.
37 return reachable[DstBlockID][Src->getBlockID()];
46 ReachableSet &DstReachability = reachable[Dst->getBlockID()];
|
| ReachableCode.cpp | 10 // determining reachable blocks within a CFG.
127 // well be reachable via a different control flow, thus it's not dead.
310 llvm::BitVector &Reachable,
318 // The entry block may have already been marked reachable
320 if (!Reachable[Start->getBlockID()]) {
322 Reachable[Start->getBlockID()] = true;
327 // Find the reachable blocks from 'Start'.
331 // There are cases where we want to treat all successors as reachable.
336 // Look at the successors and mark then reachable.
364 if (!Reachable[blockID])
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| ipa.cc | 86 We enqueue nodes at two occasions: when we find them reachable or when we find
89 reachable. */
93 hash_set<symtab_node *> *reachable)
99 only if it became reachable now. */
100 if (node->aux == (void *)2 && !reachable->contains (node))
132 hash_set<symtab_node *> *reachable)
159 reachable->add (body);
160 reachable->add (node);
162 enqueue_node (node, first, reachable);
167 all its potential targets as reachable to permit later inlining i
316 hash_set<symtab_node *> reachable; local
[all...] |
| domwalk.cc | 207 /* Return TRUE if BB is reachable, false otherwise. */
213 is reachable. */
219 reachable. */
220 bool reachable = false;
223 reachable = bb == ENTRY_BLOCK_PTR_FOR_FN (fun);
228 reachable |= (e->flags & EDGE_EXECUTABLE);
231 return reachable;
|
| omp-oacc-neuter-broadcast.cc | 1447 dfs_broadcast_reachable_1 (basic_block bb, sbitmap reachable)
1462 bitmap_set_bit (reachable, dest->index);
1464 dfs_broadcast_reachable_1 (dest, reachable);
1680 sbitmap *reachable local
1684 bitmap_vector_clear (reachable, last_basic_block_for_fn (cfun));
1699 dfs_broadcast_reachable_1 (bb, reachable[bb->index]);
1713 EXECUTE_IF_SET_IN_BITMAP (reachable[i], 0, j, bi)
1718 bitmap_ior (reachable[i], reachable[i], inverted[i]);
1750 EXECUTE_IF_SET_IN_BITMAP (reachable[blkno], 0, j, bi
[all...] |
| tree-ssa-loop-unswitch.cc | 91 will be reachable in the unswitch version.
860 /* Evaluate reachable blocks in LOOP and call VISIT on them, aborting the
872 auto_vec<basic_block, 10> reachable (loop->num_nodes);
877 reachable.safe_push (loop->header);
914 /* Note that for the moment we do not account reachable conditions
930 reachable.safe_push (dest);
936 while (!reachable.is_empty ())
937 reachable.pop ()->flags &= ~reachable_flag;
1032 /* Check predicates of reachable blocks. */
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ipa.cc | 84 We enqueue nodes at two occasions: when we find them reachable or when we find
87 reachable. */
91 hash_set<symtab_node *> *reachable)
97 only if it became reachable now. */
98 if (node->aux == (void *)2 && !reachable->contains (node))
130 hash_set<symtab_node *> *reachable)
157 reachable->add (body);
158 reachable->add (node);
160 enqueue_node (node, first, reachable);
165 all its potential targets as reachable to permit later inlining i
315 hash_set<symtab_node *> reachable; local
[all...] |
| domwalk.cc | 206 /* Return TRUE if BB is reachable, false otherwise. */
212 is reachable. */
218 reachable. */
219 bool reachable = false;
222 reachable = bb == ENTRY_BLOCK_PTR_FOR_FN (fun);
227 reachable |= (e->flags & EDGE_EXECUTABLE);
230 return reachable;
|
| omp-oacc-neuter-broadcast.cc | 1447 dfs_broadcast_reachable_1 (basic_block bb, sbitmap reachable)
1462 bitmap_set_bit (reachable, dest->index);
1464 dfs_broadcast_reachable_1 (dest, reachable);
1680 sbitmap *reachable local
1684 bitmap_vector_clear (reachable, last_basic_block_for_fn (cfun));
1699 dfs_broadcast_reachable_1 (bb, reachable[bb->index]);
1713 EXECUTE_IF_SET_IN_BITMAP (reachable[i], 0, j, bi)
1718 bitmap_ior (reachable[i], reachable[i], inverted[i]);
1750 EXECUTE_IF_SET_IN_BITMAP (reachable[blkno], 0, j, bi
[all...] |
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/rt/ |
| minfo.d | 247 auto reachable = cast(size_t*) malloc(flagbytes);
249 .free(reachable);
255 clearFlags(reachable);
265 if (!bts(reachable, *impidx))
315 bool findDeps(size_t idx, size_t* reachable)
332 // initialize reachable by flagging source module
333 clearFlags(reachable);
334 bts(reachable, idx);
349 if (!bts(reachable, midx))
425 // First, determine what modules are reachable
[all...] |
| /src/external/bsd/dhcpcd/dist/src/ |
| ipv6nd.h | 64 uint32_t reachable; member in struct:ra
|
| ipv6nd.c | 536 .reachable = REACHABLE_TIME,
568 ipv6nd_neighbour(struct dhcpcd_ctx *ctx, struct in6_addr *addr, bool reachable)
580 if (rap == NULL || rap->expired || rap->isreachable == reachable)
583 rap->isreachable = reachable;
585 reachable ? "reachable again" : "unreachable");
587 /* See if we can install a reachable default router. */
592 if (reachable)
595 /* If we have no reachable default routers, try and solicit one. */
1038 * reachable timers back to default values before applyin
[all...] |
| /src/usr.sbin/ypserv/ypinit/ |
| ypinit.sh | 74 slave YP server, \`master_server' must be an existing, reachable YP server.
|
| /src/sys/netinet6/ |
| nd6.h | 65 uint32_t reachable; /* Reachable Time */ member in struct:nd_kifinfo
|
| nd6.c | 177 nd->reachable = ND_COMPUTE_RTIME(nd->basereachable);
406 return ndi->reachable;
1229 ifndi->reachable = ND_COMPUTE_RTIME(OND.basereachable);
1255 ifndi->reachable = ND_COMPUTE_RTIME(ND.basereachable);
1547 * Since reachable time rarely changes by router
1553 ndi->reachable = ND_COMPUTE_RTIME(ndi->basereachable);
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| 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 */
|
| /src/external/mpl/bind/dist/bin/tests/system/nsec3_answer/ |
| tests_nsec3.py | 78 sorted(ZONE.reachable - ZONE.get_names_with_type(dns.rdatatype.CNAME))
165 assume(qname not in ZONE.reachable)
|
