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

/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DCFGReachabilityAnalysis.h11 // is reachable within the CFG.
36 ReachableMap reachable; member in class:clang::CFGReverseBlockReachabilityAnalysis
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp41 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
178 FindUnreachableEntryPoints(const CFGBlock *CB, CFGBlocksSet &reachable, CFGBlocksSet &visited) argument
[all...]
H A DAnalyzerStatsChecker.cpp45 llvm::SmallPtrSet<const CFGBlock*, 32> reachable; local
64 reachable.insert(CB);
78 if (!reachable.count(CB)) {
H A DDeadStoresChecker.cpp69 llvm::BitVector reachable; member in class:__anon768::ReachableCode
72 : cfg(cfg), reachable(cfg.getNumBlockIDs(), false) {}
77 return reachable[block->getBlockID()];
91 llvm::BitVector::reference isReachable = reachable[block->getBlockID()];
199 // Compute reachable blocks within the CFG for trivial cases
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp11 // is reachable within the CFG.
37 return reachable[DstBlockID][Src->getBlockID()];
46 ReachableSet &DstReachability = reachable[Dst->getBlockID()];
H A DReachableCode.cpp10 // determining reachable blocks within a CFG.
127 // well be reachable via a different control flow, thus it's not dead.
318 // The entry block may have already been marked reachable
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.
399 DeadCodeScan(llvm::BitVector &reachable, Preprocessor &PP, ASTContext &C) argument
400 : Visited(reachable.size()),
401 Reachable(reachable),
493 // It is possible that this block has been marked reachable afte
[all...]
/freebsd-11-stable/contrib/gcc/
H A Dcgraphunit.c100 In cgraph_finalize_compilation_unit the reachable functions are
101 analyzed. During analysis the call-graph edges from reachable
103 reachable. References to functions and variables are discovered too
110 to change function from !reachable to reachable and thus
113 Finally the call-graph is topologically sorted and all reachable functions
119 optimization and re-discovering reachable functions.
138 construction the edge destinations are not marked as reachable and it
240 /* Constructors and destructors are reachable from the runtime by
440 if (node->reachable
[all...]
H A Dcgraph.h156 /* Set when function is reachable by call from other function
157 that is either reachable or needed. */
158 unsigned reachable : 1;
H A Dcgraph.c538 node->needed = node->reachable = false;
614 /* Notify finalize_compilation_unit that given node is reachable. */
619 if (!node->reachable && node->local.finalized)
622 node->reachable = 1;
630 /* Likewise indicate that a node is needed, i.e. reachable via some
723 else if (node->reachable)
724 fprintf (f, " reachable");
922 /* Notify finalize_compilation_unit that given node is reachable
H A Dipa-inline.c909 if (node->analyzed && (node->needed || node->reachable))
1174 /* Because inlining might remove no-longer reachable nodes, we need to
1201 if (node->analyzed && (node->needed || node->reachable))
1209 && (node->needed || node->reachable)
H A Dexcept.c674 /* Remove all regions whose labels are not reachable from insns. */
680 bool *reachable;
685 reachable = xcalloc (cfun->eh->last_region_number + 1, sizeof(bool));
706 reachable[uid_region_num[INSN_UID (insn)]] = true;
711 if (r && r->region_number == i && !reachable[i])
718 is reachable. */
719 if (r->outer && reachable[r->outer->region_number])
732 /* TRY regions are reachable if any of its CATCH regions
733 are reachable. */
736 if (reachable[
673 bool *reachable; local
[all...]
/freebsd-11-stable/contrib/llvm-project/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 */
/freebsd-11-stable/sys/netinet6/
H A Dnd6.h68 u_int32_t reachable; /* Reachable Time */ member in struct:nd_ifinfo
188 u_int32_t reachable; /* Reachable Time */ member in struct:in6_ondireq::__anon8206
H A Dnd6.c266 nd->reachable = ND_COMPUTE_RTIME(nd->basereachable);
706 delay = (long)ND_IFINFO(ifp)->reachable * hz;
1652 ND.reachable = ND_IFINFO(ifp)->reachable;
1681 ND_IFINFO(ifp)->reachable =
2158 * Since reachable time rarely changes by router
2164 nd6if->reachable = ND_COMPUTE_RTIME(nd6if->basereachable);
H A Dnd6_rtr.c303 ndi->reachable = ND_COMPUTE_RTIME(ndi->basereachable);
727 * 1) Routers that are reachable or probably reachable should be preferred.
728 * If we have more than one (probably) reachable router, prefer ones
730 * 2) When no routers on the list are known to be reachable or
731 * probably reachable, routers SHOULD be selected in a round-robin
772 * Search for a (probably) reachable router from the list.
773 * We just pick up the first reachable one (if any), assuming that
806 * If none of the default routers was found to be reachable,
809 * (reachable) route
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineVerifier.cpp132 // Is this MBB reachable from the MF entry point?
133 bool reachable = false; member in struct:__anon1773::MachineVerifier::BBInfo
569 if (!MInfo.reachable) {
570 MInfo.reachable = true;
2138 if (!MInfo.reachable)
2243 if (MInfo.reachable) {
2246 if (!MO0.isUndef() && PrInfo.reachable &&
2253 if (MInfo.reachable) {
/freebsd-11-stable/usr.sbin/ndp/
H A Dndp.c995 printf(", reachable=%ds", ND.reachable);
1207 printf(" (reachable)\n");
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DAttributor.cpp2326 // TODO: Return the number of reachable queries.
2327 return "reachable";
2343 void trackStatistics() const override { STATS_DECLTRACK_FN_ATTR(reachable); } variable

Completed in 274 milliseconds