Home
last modified time | relevance | path

Searched full:reachable (Results 1 – 25 of 443) sorted by relevance

12345678910>>...18

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DPhiValues.cpp33 // The goal here is to find all of the non-phi values reachable from this phi,
34 // and to do the same for all of the phis reachable from this phi, as doing so
38 // * All phis in a strongly connected component will have the same reachable
40 // reachable values, but finding out that isn't really necessary (it would
43 // never completes a component before the components reachable from it have
45 // everything we need to collect the values reachable from that component.
46 // * We collect both the non-phi values reachable from each SCC, as that's what
47 // we're ultimately interested in, and all of the reachable values, i.e.
83 // Collect the reachable values for this component. The phis of this in processPhi()
86 ConstValueSet &Reachable = ReachableMap[RootDepthNumber]; in processPhi() local
[all …]
H A DCFG.cpp154 // Normally any block in a loop is reachable from any other block in a loop, in isReachableImpl()
194 // reachable from all other blocks. That implies we can't simply jump to in isReachableImpl()
210 // All blocks in a single loop are reachable from all other blocks. From in isReachableImpl()
292 // reachable, so we only need to determine reachability between whole in isPotentiallyReachable()
301 // If A comes before B, then B is definitively reachable from A. in isPotentiallyReachable()
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DReachableCode.cpp10 // determining reachable blocks within a CFG.
128 // well be reachable via a different control flow, thus it's not dead. in isDeadReturn()
318 llvm::BitVector &Reachable, in scanFromBlock() argument
326 // The entry block may have already been marked reachable in scanFromBlock()
328 if (!Reachable[Start->getBlockID()]) { in scanFromBlock()
330 Reachable[Start->getBlockID()] = true; in scanFromBlock()
335 // Find the reachable blocks from 'Start'. in scanFromBlock()
339 // There are cases where we want to treat all successors as reachable. in scanFromBlock()
344 // Look at the successors and mark then reachable. in scanFromBlock()
372 if (!Reachable[blockID]) { in scanFromBlock()
[all …]
H A DCFGReachabilityAnalysis.cpp11 // is reachable within the CFG.
37 return reachable[DstBlockID][Src->getBlockID()]; in isReachable()
46 ReachableSet &DstReachability = reachable[Dst->getBlockID()]; in mapReachability()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h165 // Find all forwards reachable blocks which the inference algorithm will be in apply()
167 df_iterator_default_set<const BasicBlockT *> Reachable; in apply() local
168 for (auto *BB : depth_first_ext(&F, Reachable)) in apply()
169 (void)BB /* Mark all reachable blocks */; in apply()
171 // Find all backwards reachable blocks which the inference algorithm will be in apply()
182 // Keep a stable order for reachable blocks in apply()
185 BlockIndex.reserve(Reachable.size()); in apply()
186 BasicBlocks.reserve(Reachable.size()); in apply()
188 if (Reachable.count(&BB) && InverseReachable.count(&BB)) { in apply()
229 assert(Reachable in apply()
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/HipStdPar/
H A DHipStdPar.cpp14 // reachable from it, constitute code that the user expects the accelerator
15 // to execute. Thus, we identify the set of all functions reachable from
23 // **NOTE**: The above does not handle indirectly reachable functions i.e.
143 const SmallPtrSet<const Function *, N>& Reachable, Module &M) { in removeUnreachableFunctions() argument
146 return !Reachable.contains(F); in removeUnreachableFunctions()
153 return !F.isIntrinsic() && !Reachable.contains(&F); in removeUnreachableFunctions()
196 SmallPtrSet<const Function *, 32> Reachable; in run() local
201 Reachable.insert(CGN.first); in run()
213 if (Reachable.contains(N.second->getFunction())) in run()
220 Reachable.insert(N.second->getFunction()); in run()
[all …]
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp42 CFGBlocksSet &reachable,
52 CFGBlocksSet reachable, visited; in checkEndAnalysis() local
79 reachable.insert(CB->getBlockID()); in checkEndAnalysis()
97 if (reachable.count(CB->getBlockID())) in checkEndAnalysis()
106 FindUnreachableEntryPoints(CB, reachable, visited); in checkEndAnalysis()
109 if (reachable.count(CB->getBlockID())) in checkEndAnalysis()
180 CFGBlocksSet &reachable, in FindUnreachableEntryPoints() argument
188 if (!reachable.count(PredBlock->getBlockID())) { in FindUnreachableEntryPoints()
189 // If we find an unreachable predecessor, mark this block as reachable so in FindUnreachableEntryPoints()
191 reachable.insert(CB->getBlockID()); in FindUnreachableEntryPoints()
[all …]
H A DAnalyzerStatsChecker.cpp47 llvm::SmallPtrSet<const CFGBlock*, 32> reachable; in checkEndAnalysis() local
65 reachable.insert(CB); in checkEndAnalysis()
79 if (!reachable.count(CB)) { in checkEndAnalysis()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DEHUtils.h16 /// Compute a list of blocks that are only reachable via EH paths.
19 // A block can be unknown if its not reachable from anywhere in computeEHOnlyBlocks()
20 // EH if its only reachable from start blocks via some path through EH pads in computeEHOnlyBlocks()
21 // NonEH if it's reachable from Non EH blocks as well. in computeEHOnlyBlocks()
H A DPhiValues.h81 /// Non-phi values reachable from each component.
84 /// All values reachable from each component.
106 /// Process a phi so that its entries in the depth and reachable maps are
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp10 // job is to delete LLVM basic blocks that are not reachable from the entry
98 df_iterator_default_set<MachineBasicBlock*> Reachable; in runOnMachineFunction() local
108 // Mark all reachable blocks. in runOnMachineFunction()
109 for (MachineBasicBlock *BB : depth_first_ext(&F, Reachable)) in runOnMachineFunction()
110 (void)BB/* Mark all reachable blocks */; in runOnMachineFunction()
117 if (!Reachable.count(&BB)) { in runOnMachineFunction()
H A DCFIFixup.cpp37 // reachable from the entry along a path that does not execute the prologue. If
136 bool Reachable : 1; in runOnMachineFunction()
142 BlockInfo[0].Reachable = true; in runOnMachineFunction()
166 SuccInfo.Reachable = true; in runOnMachineFunction()
195 if (!Info.Reachable) { in runOnMachineFunction()
204 assert((!PredInfo.Reachable || in runOnMachineFunction()
109 bool Reachable : 1; runOnMachineFunction() member
H A DBreakFalseDeps.cpp295 df_iterator_default_set<MachineBasicBlock *> Reachable; in runOnMachineFunction() local
296 for (MachineBasicBlock *MBB : depth_first_ext(&mf, Reachable)) in runOnMachineFunction()
297 (void)MBB /* Mark all reachable blocks */; in runOnMachineFunction()
301 if (Reachable.count(&MBB)) in runOnMachineFunction()
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DConsumed.h148 bool Reachable = true;
156 : Reachable(Other.Reachable), From(Other.From), VarMap(Other.VarMap) {} in ConsumedStateMap()
183 /// Return true if this block is reachable.
184 bool isReachable() const { return Reachable; } in isReachable()
H A DReachableCode.h56 /// ScanReachableFromBlock - Mark all blocks reachable from Start.
57 /// Returns the total number of blocks that were marked reachable.
59 llvm::BitVector &Reachable);
H A DCFGReachabilityAnalysis.h11 // is reachable within the CFG.
36 ReachableMap reachable; variable
/freebsd/contrib/llvm-project/lld/docs/
H A DPartitions.rst42 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
/freebsd/contrib/llvm-project/compiler-rt/lib/lsan/
H A Dlsan_common.cpp186 // On Linux, treats all chunks allocated from ld-linux.so as reachable, which
196 // being reachable from the static TLS, and the dynamic TLS being reachable from
209 // it as reachable, as we can't properly report its allocation stack anyway. in SuppressInvalid()
293 // There are two usage modes for this function: finding reachable chunks
394 // Mark as reachable and add to frontier. in ProcessThreadRegistry()
395 LOG_POINTERS("Treating pointer %p from ThreadContext as reachable\n", ptr); in ProcessThreadRegistry()
426 // If unable to get SP, consider the entire stack to be reachable unless in ProcessThreads()
450 // Again, consider the entire stack range to be reachable. in ProcessThreads()
523 // Add pointers reachable from ThreadContexts in ProcessThreads()
588 // which are reachable from it as indirectly leaked.
[all …]
H A Dlsan_flags.inc27 // Flags controlling the root set of reachable memory.
37 "Root set: mark as reachable all allocations made from dynamic "
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp31 // Worklist classes for exploration of reachable states.
142 llvm::DenseSet<LocIdentifier> Reachable; member in __anond1e6f8ae0311::UnexploredFirstStack
161 auto InsertInfo = Reachable.insert(LocId); in enqueue()
169 MaxReachableSize.updateMax(Reachable.size()); in enqueue()
/freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/DXILWriter/
H A DDXILValueEnumerator.h245 /// Reorder the reachable metadata.
271 /// Enumerate reachable metadata in (almost) post-order.
273 /// Enumerate all the metadata reachable from MD. We want to minimize the
279 /// post-order. Distinct subgraphs reachable only from a single uniqued node
/freebsd/contrib/llvm-project/llvm/lib/Bitcode/Writer/
H A DValueEnumerator.h242 /// Reorder the reachable metadata.
268 /// Enumerate reachable metadata in (almost) post-order.
270 /// Enumerate all the metadata reachable from MD. We want to minimize the
276 /// post-order. Distinct subgraphs reachable only from a single uniqued node
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h489 // the non-trivial roots are reverse-reachable from other non-trivial roots,
513 // root from the set of roots, as it is reverse-reachable from the other in RemoveRedundantRoots()
660 // Determines if some existing root becomes reverse-reachable after the
780 "Unreachable successor found at reachable insertion"); in InsertReachable()
851 // Collect discovered edges to already reachable nodes. in InsertUnreachable()
853 // Discover and connect nodes that became reachable with the insertion. in InsertUnreachable()
870 // Connects nodes that become reachable with an insertion.
876 assert(!DT.getNode(Root) && "Root must not be reachable"); in ComputeUnreachableDominators()
937 // To remains reachable after deletion. in DeleteEdge()
948 // Handles deletions that leave destination nodes reachable.
[all …]
/freebsd/contrib/llvm-project/clang/lib/Tooling/Syntax/
H A DTree.cpp114 auto Reachable = [](Node *From, Node *N) { in replaceChildRangeLowLevel() local
122 assert(Reachable(FirstChild, Begin) && "`Begin` is not reachable."); in replaceChildRangeLowLevel()
123 assert(Reachable(Begin, End) && "`End` is not after `Begin`."); in replaceChildRangeLowLevel()
258 "Last child is reachable by advancing from the first child."); in assertInvariants()
/freebsd/sys/netinet6/
H A Dnd6_rtr.c456 ndi->reachable = ND_COMPUTE_RTIME(ndi->basereachable); in nd6_ra_input()
915 bool reachable = ND6_IS_LLINFO_PROBREACH(ln); in is_dr_reachable() local
917 return reachable; in is_dr_reachable()
923 * 1) Routers that are reachable or probably reachable should be preferred.
924 * If we have more than one (probably) reachable router, prefer ones
926 * 2) When no routers on the list are known to be reachable or
927 * probably reachable, routers SHOULD be selected in a round-robin
969 * Search for a (probably) reachable router from the list. in defrouter_select_fib()
970 * We just pick up the first reachable one (if any), assuming that in defrouter_select_fib()
1000 * If none of the default routers was found to be reachable, in defrouter_select_fib()
[all …]

12345678910>>...18