| /openbsd/gnu/llvm/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | UnreachableCodeChecker.cpp | 42 CFGBlocksSet &reachable,
52 CFGBlocksSet reachable, visited; in checkEndAnalysis() local
80 reachable.insert(CB->getBlockID()); in checkEndAnalysis()
99 if (reachable.count(CB->getBlockID())) in checkEndAnalysis()
108 FindUnreachableEntryPoints(CB, reachable, visited); in checkEndAnalysis()
111 if (reachable.count(CB->getBlockID())) in checkEndAnalysis()
180 CFGBlocksSet &reachable, in FindUnreachableEntryPoints() argument
189 if (!reachable.count((*I)->getBlockID())) { in FindUnreachableEntryPoints()
192 reachable.insert(CB->getBlockID()); in FindUnreachableEntryPoints()
195 FindUnreachableEntryPoints(*I, reachable, visited); in FindUnreachableEntryPoints()
|
| H A D | AnalyzerStatsChecker.cpp | 46 llvm::SmallPtrSet<const CFGBlock*, 32> reachable; in checkEndAnalysis() local
65 reachable.insert(CB); in checkEndAnalysis()
79 if (!reachable.count(CB)) { in checkEndAnalysis()
|
| H A D | DeadStoresChecker.cpp | 70 llvm::BitVector reachable; member in __anone65385fe0111::ReachableCode
73 : cfg(cfg), reachable(cfg.getNumBlockIDs(), false) {} in ReachableCode()
78 return reachable[block->getBlockID()]; in isReachable()
92 llvm::BitVector::reference isReachable = reachable[block->getBlockID()]; in computeReachableBlocks()
|
| /openbsd/gnu/usr.bin/perl/dist/Net-Ping/t/ |
| H A D | 450_service.t | 75 is($p->ping("127.0.0.1"), 1, 'first port is reachable');
82 is($p->ping("127.0.0.1"), 1, 'second port is reachable');
114 is($p->ack(), '127.0.0.1', 'IP should be reachable');
137 is($p->ack(), '127.0.0.1', 'IP should be reachable');
157 is($p->ack(), '127.0.0.1', 'IP should be reachable');
|
| H A D | 250_ping_hires.t | 54 isnt($ret, 0, 'localhost should always be reachable');
|
| /openbsd/gnu/llvm/clang/lib/Analysis/ |
| H A D | CFGReachabilityAnalysis.cpp | 37 return reachable[DstBlockID][Src->getBlockID()]; in isReachable()
46 ReachableSet &DstReachability = reachable[Dst->getBlockID()]; in mapReachability()
|
| H A D | ReachableCode.cpp | 405 DeadCodeScan(llvm::BitVector &reachable, Preprocessor &PP, ASTContext &C) in DeadCodeScan() argument
406 : Visited(reachable.size()), in DeadCodeScan()
407 Reachable(reachable), in DeadCodeScan()
693 llvm::BitVector reachable(cfg->getNumBlockIDs()); in FindUnreachableCode() local
695 scanMaybeReachableFromBlock(&cfg->getEntry(), PP, reachable); in FindUnreachableCode()
703 numReachable += scanMaybeReachableFromBlock(B, PP, reachable); in FindUnreachableCode()
712 if (reachable[block->getBlockID()]) in FindUnreachableCode()
715 DeadCodeScan DS(reachable, PP, AC.getASTContext()); in FindUnreachableCode()
|
| /openbsd/gnu/llvm/clang/docs/analyzer/developer-docs/ |
| H A D | InitializerLists.rst | 67 turns out to be reachable. This requires no work on checker side, but it sounds
141 > a region turns out to be reachable. This requires no work on checker side,
160 reachable from here exists another region of type T". Or even multiple regions
161 with different identifiers. This wouldn't specify how the memory is reachable,
184 this to be in the store: we are modeling reachable storage as storage. But if
192 > that meant "here is a memory region and somewhere reachable from here exists
203 region. Region contents are mutable: today the abstract storage is reachable
205 reachable, something that isn't even abstract. So the parent region for the
210 > For std::initializer_list this reachable region would the region for the
248 reachable symbols and regions) that cannot work without checker support.
[all …]
|
| /openbsd/gnu/gcc/gcc/ |
| H A D | cgraphunit.c | 440 if (node->reachable && !flag_unit_at_a_time) in cgraph_reset_node()
448 node->reachable = 0; in cgraph_reset_node()
1120 gcc_assert (!node->analyzed && node->reachable); in cgraph_finalize_compilation_unit()
1126 if (!edge->callee->reachable) in cgraph_finalize_compilation_unit()
1160 if (!node->reachable && DECL_SAVED_TREE (decl)) in cgraph_finalize_compilation_unit()
1205 || (e && node->reachable)) in cgraph_mark_functions_to_output()
1307 gcc_assert (node->reachable); in cgraph_expand_all_functions()
1440 if (node->reachable in cgraph_function_and_variable_visibility()
1790 new_version->reachable = true; in cgraph_copy_node_for_versioning()
1898 first_clone->reachable = 1; in save_inline_function_body()
|
| H A D | cgraph.c | 538 node->needed = node->reachable = false; in cgraph_remove_node()
619 if (!node->reachable && node->local.finalized) in cgraph_mark_reachable_node()
622 node->reachable = 1; in cgraph_mark_reachable_node()
723 else if (node->reachable) in dump_cgraph_node()
|
| H A D | cgraph.h | 158 unsigned reachable : 1; member
|
| /openbsd/gnu/llvm/compiler-rt/lib/lsan/ |
| H A D | lsan_flags.inc | 27 // Flags controlling the root set of reachable memory.
37 "Root set: mark as reachable all allocations made from dynamic "
|
| /openbsd/usr.sbin/dvmrpd/ |
| H A D | kroute.c | 230 u_int8_t reachable; in if_change() local
243 if ((reachable = (flags & IFF_UP) && in if_change()
247 kif->k.nh_reachable = reachable; in if_change()
|
| /openbsd/gnu/llvm/clang/include/clang/Analysis/Analyses/ |
| H A D | CFGReachabilityAnalysis.h | 36 ReachableMap reachable; variable
|
| /openbsd/regress/lib/libcrypto/ocsp/ |
| H A D | Makefile | 20 echo server $s not reachable; echo SKIPPED; fi
|
| /openbsd/gnu/llvm/lld/docs/ |
| H A D | Partitions.rst | 42 into partitions according to which sections of the program are reachable from
44 a program. Any sections that are only reachable from a loadable partition's
46 assigned to the main partition, including sections only reachable from
|
| /openbsd/sys/netinet6/ |
| H A D | nd6.h | 55 u_int32_t reachable; /* [N] Reachable Time */ member
|
| /openbsd/regress/usr.sbin/bgpd/integrationtests/ |
| H A D | lladdr.rdomain1.ok | 13 N = BGP Nexthop reachable via this route
|
| H A D | lladdr.rdomain2.ok | 13 N = BGP Nexthop reachable via this route
|
| /openbsd/lib/libcrypto/x509/ |
| H A D | x509_policy.c | 91 int reachable; member
822 sk_X509_POLICY_NODE_value(level->nodes, i)->reachable = 1; in has_explicit_policy()
828 if (!node->reachable) in has_explicit_policy()
856 parent->reachable = 1; in has_explicit_policy()
|
| /openbsd/regress/usr.sbin/acme-client/ |
| H A D | Makefile | 25 @echo This tests needs a domain reachable from letsencrypt.org.
|
| /openbsd/gnu/llvm/llvm/docs/HistoricalNotes/ |
| H A D | 2003-06-25-Reoptimizer1.txt | 34 region and mark reachable edges.
37 region IGNORING back edges, and mark the edges which are reachable in
38 1) and also in 2) (i.e., must be reachable from both the start BB and
|
| /openbsd/usr.sbin/ripd/ |
| H A D | kroute.c | 658 u_int8_t reachable; in if_change() local
670 if ((reachable = (flags & IFF_UP) && in if_change()
674 kif->k.nh_reachable = reachable; in if_change()
675 type = reachable ? IMSG_NETWORK_ADD : IMSG_NETWORK_DEL; in if_change()
683 if (reachable) in if_change()
|
| /openbsd/gnu/usr.bin/perl/cpan/Test-Harness/t/ |
| H A D | parse.t | 1010 my %reachable = ( INIT => 1 );
1017 $reachable{$_}++
1023 is_deeply [ sort keys %reachable ], [@states], "all states reachable";
|
| /openbsd/usr.sbin/eigrpd/ |
| H A D | kroute.c | 832 uint8_t reachable; in if_change() local
839 reachable = (kif->flags & IFF_UP) && in if_change()
842 if (reachable == kif->nh_reachable) in if_change()
845 kif->nh_reachable = reachable; in if_change()
861 if (reachable) in if_change()
|