| /freebsd/contrib/llvm-project/llvm/lib/Transforms/HipStdPar/ |
| H A D | HipStdPar.cpp | 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()
226 if (std::empty(Reachable)) in run()
229 removeUnreachableFunctions(Reachable, M); in run()
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | ReachableCode.cpp | 318 llvm::BitVector &Reachable, in scanFromBlock() argument
328 if (!Reachable[Start->getBlockID()]) { in scanFromBlock()
330 Reachable[Start->getBlockID()] = true; in scanFromBlock()
372 if (!Reachable[blockID]) { in scanFromBlock()
373 Reachable.set(blockID); in scanFromBlock()
385 llvm::BitVector &Reachable) { in scanMaybeReachableFromBlock() argument
386 return scanFromBlock(Start, Reachable, &PP, true); in scanMaybeReachableFromBlock()
396 llvm::BitVector &Reachable; member in __anon5ae95f9f0111::DeadCodeScan
409 Reachable(reachable), in DeadCodeScan()
428 if (Reachable[blockID] || Visited[blockID]) in enqueue()
[all …]
|
| H A D | CFG.cpp | 6041 bool Reachable = true; in print_block() local
6043 Reachable = false; in print_block()
6048 if (!Reachable) in print_block()
6079 bool Reachable = true; in print_block() local
6081 Reachable = false; in print_block()
6087 if (!Reachable) in print_block()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | SampleProfileInference.h | 167 df_iterator_default_set<const BasicBlockT *> Reachable; in apply() local
168 for (auto *BB : depth_first_ext(&F, Reachable)) 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.contains(I.first)); in apply()
233 assert(Reachable.contains(I.first.first) && in apply()
234 Reachable.contains(I.first.second)); in apply()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | CFIFixup.cpp | 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 D | UnreachableBlockElim.cpp | 98 df_iterator_default_set<MachineBasicBlock*> Reachable; in runOnMachineFunction() local
109 for (MachineBasicBlock *BB : depth_first_ext(&F, Reachable)) in runOnMachineFunction()
117 if (!Reachable.count(&BB)) { in runOnMachineFunction()
|
| H A D | BreakFalseDeps.cpp | 295 df_iterator_default_set<MachineBasicBlock *> Reachable; in runOnMachineFunction() local
296 for (MachineBasicBlock *MBB : depth_first_ext(&mf, Reachable)) in runOnMachineFunction()
301 if (Reachable.count(&MBB)) in runOnMachineFunction()
|
| H A D | MachineVerifier.cpp | 3806 df_iterator_default_set<const MachineBasicBlock*> Reachable; in verifyStackFrame() local
3811 DFI = df_ext_begin(MF, Reachable), DFE = df_ext_end(MF, Reachable); in verifyStackFrame()
3819 assert(Reachable.count(StackPred) && in verifyStackFrame()
3871 if (Reachable.count(Pred) && in verifyStackFrame()
3886 if (Reachable.count(Succ) && in verifyStackFrame()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | PhiValues.cpp | 86 ConstValueSet &Reachable = ReachableMap[RootDepthNumber]; in processPhi() local
89 Reachable.insert(ComponentPhi); in processPhi()
101 Reachable.insert(It->second.begin(), It->second.end()); in processPhi()
104 Reachable.insert(Op); in processPhi()
119 for (const Value *V : Reachable) in processPhi()
|
| /freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
| H A D | Consumed.h | 148 bool Reachable = true;
156 : Reachable(Other.Reachable), From(Other.From), VarMap(Other.VarMap) {} in ConsumedStateMap()
184 bool isReachable() const { return Reachable; } in isReachable()
|
| H A D | ReachableCode.h | 59 llvm::BitVector &Reachable);
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyFixIrreducibleControlFlow.cpp | 103 auto I = Reachable.find(From); in canReach()
104 if (I == Reachable.end()) in canReach()
134 DenseMap<MachineBasicBlock *, BlockSet> Reachable; member in __anon5f812d3b0111::ReachabilityGraph
146 Reachable[MBB].insert(Succ); in calculate()
160 if (Reachable[Pred].insert(Succ).second) { in calculate()
|
| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | WorkList.cpp | 142 llvm::DenseSet<LocIdentifier> Reachable; member in __anond1e6f8ae0311::UnexploredFirstStack
161 auto InsertInfo = Reachable.insert(LocId); in enqueue()
169 MaxReachableSize.updateMax(Reachable.size()); in enqueue()
|
| H A D | ProgramState.cpp | 677 llvm::iterator_range<region_iterator> Reachable, in scanReachableSymbols() argument
680 for (const MemRegion *R : Reachable) { in scanReachableSymbols()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| H A D | BlockCoverageInference.cpp | 237 BlockSet &Reachable) const { in getReachableAvoiding()
242 Reachable.insert(Range.begin(), Range.end()); in getReachableAvoiding()
245 Reachable.insert(Range.begin(), Range.end()); in getReachableAvoiding()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Instrumentation/ |
| H A D | BlockCoverageInference.h | 76 bool IsForward, BlockSet &Reachable) const;
|
| /freebsd/contrib/llvm-project/clang/lib/Tooling/Syntax/ |
| H A D | Tree.cpp | 114 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()
|
| /freebsd/contrib/llvm-project/clang/lib/Sema/ |
| H A D | JumpDiagnostics.cpp | 792 llvm::BitVector Reachable(Scopes.size(), false); in VerifyIndirectJumps() local
794 Reachable.reset(); in VerifyIndirectJumps()
801 Reachable.set(Min); in VerifyIndirectJumps()
823 if (Reachable.test(Scope)) { in VerifyIndirectJumps()
827 Reachable.set(S); in VerifyIndirectJumps()
|
| H A D | SemaLookup.cpp | 1701 Sema::AcceptableKind::Reachable); in hasReachableDefaultArgument()
1762 Sema::AcceptableKind::Reachable); in hasReachableExplicitSpecialization()
1796 Sema::AcceptableKind::Reachable); in hasReachableMemberSpecialization()
1889 assert(Kind == Sema::AcceptableKind::Reachable && in isAcceptableSlow()
2073 Sema::AcceptableKind::Reachable); in hasReachableDeclarationSlow()
2112 return isAcceptableSlow(SemaRef, D, Sema::AcceptableKind::Reachable); in isReachable()
|
| /freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ProgramState.h | 408 bool scanReachableSymbols(llvm::iterator_range<region_iterator> Reachable,
413 scanReachableSymbols(llvm::iterator_range<region_iterator> Reachable) const;
883 llvm::iterator_range<region_iterator> Reachable) const { in scanReachableSymbols() argument
885 scanReachableSymbols(Reachable, cb); in scanReachableSymbols()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | BlockFrequencyInfoImpl.h | 1511 SmallPtrSet<const BlockT *, 8> Reachable;
1514 Reachable.insert(Entry);
1522 if (Reachable.insert(DstBB).second)
1533 if (!HasSucc && Reachable.count(&BB)) {
1553 if (Reachable.count(&BB) && InverseReachable.count(&BB)) {
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | AttributorAttributes.cpp | 3373 enum class Reachable { enum
3385 Reachable Result = Reachable::No;
3477 if (RQI->Result == RQITy::Reachable::No && in updateImpl()
3487 bool rememberResult(Attributor &A, typename RQITy::Reachable Result, in rememberResult()
3499 if (Result == RQITy::Reachable::Yes || !UsedExclusionSet) { in rememberResult()
3510 if (IsTemporaryRQI && Result != RQITy::Reachable::Yes && UsedExclusionSet) { in rememberResult()
3515 assert(RQIPtr->Result == RQITy::Reachable::No && "Already reachable?"); in rememberResult()
3522 if (Result == RQITy::Reachable::No && IsTemporaryRQI) in rememberResult()
3524 return Result == RQITy::Reachable::Yes; in rememberResult()
3533 typename RQITy::Reachable &Result) { in checkQueryCache()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | Local.cpp | 2973 SmallPtrSetImpl<BasicBlock *> &Reachable, in markAliveBlocks() argument
2978 Reachable.insert(BB); in markAliveBlocks()
3164 if (Reachable.insert(Successor).second) in markAliveBlocks()
3210 SmallPtrSet<BasicBlock *, 16> Reachable; in removeUnreachableBlocks() local
3211 bool Changed = markAliveBlocks(F, Reachable, DTU); in removeUnreachableBlocks()
3214 if (Reachable.size() == F.size()) in removeUnreachableBlocks()
3217 assert(Reachable.size() < F.size()); in removeUnreachableBlocks()
3223 if (Reachable.count(&BB)) in removeUnreachableBlocks()
|
| H A D | BasicBlockUtils.cpp | 127 df_iterator_default_set<BasicBlock*> Reachable; in EliminateUnreachableBlocks() local
130 for (BasicBlock *BB : depth_first_ext(&F, Reachable)) in EliminateUnreachableBlocks()
136 if (!Reachable.count(&BB)) in EliminateUnreachableBlocks()
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | DebugInfo.cpp | 434 SmallPtrSetImpl<Metadata *> &Reachable, in isDILocationReachable() argument
439 if (isa<DILocation>(N) || Reachable.count(N)) in isDILocationReachable()
445 if (isDILocationReachable(Visited, Reachable, Op)) { in isDILocationReachable()
448 Reachable.insert(N); in isDILocationReachable()
451 return Reachable.count(N); in isDILocationReachable()
|