| /freebsd/contrib/llvm-project/llvm/lib/Transforms/HipStdPar/ |
| H A D | HipStdPar.cpp | 140 const SmallPtrSet<const Function *, N>& Reachable, Module &M) { in removeUnreachableFunctions() argument
143 return !Reachable.contains(F); in removeUnreachableFunctions()
150 return !F.isIntrinsic() && !Reachable.contains(&F); in removeUnreachableFunctions()
193 SmallPtrSet<const Function *, 32> Reachable; in run() local
198 Reachable.insert(CGN.first); in run()
210 if (Reachable.contains(N.second->getFunction())) in run()
217 Reachable.insert(N.second->getFunction()); in run()
223 if (std::empty(Reachable)) in run()
226 removeUnreachableFunctions(Reachable, M); in run()
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | ReachableCode.cpp | 317 llvm::BitVector &Reachable, in scanFromBlock() argument
327 if (!Reachable[Start->getBlockID()]) { in scanFromBlock()
329 Reachable[Start->getBlockID()] = true; in scanFromBlock()
371 if (!Reachable[blockID]) { in scanFromBlock()
372 Reachable.set(blockID); in scanFromBlock()
384 llvm::BitVector &Reachable) { in scanMaybeReachableFromBlock() argument
385 return scanFromBlock(Start, Reachable, &PP, true); in scanMaybeReachableFromBlock()
395 llvm::BitVector &Reachable; member in __anon5ae95f9f0111::DeadCodeScan
408 Reachable(reachable), in DeadCodeScan()
427 if (Reachable[blockID] || Visited[blockID]) in enqueue()
[all …]
|
| H A D | ThreadSafety.cpp | 360 bool Reachable = false; member
2470 Initial.Reachable = true; in runAnalysis()
2620 if (neverReturns(*PI) || !PrevBlockInfo->Reachable) in runAnalysis()
2624 CurrBlockInfo->Reachable = true; in runAnalysis()
2645 if (!CurrBlockInfo->Reachable) in runAnalysis()
2721 if (!Final.Reachable) in runAnalysis()
|
| /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 | 130 bool Reachable : 1; member
135 : Reachable(false), StrongNoFrameOnEntry(false), HasFrameOnEntry(false), in BlockFlags()
148 BlockInfo[0].Reachable = true; in computeBlockInfo()
172 SuccInfo.Reachable = true; in computeBlockInfo()
252 if (!Info.Reachable) in fixupBlock()
271 assert((!PredInfo.Reachable || in fixupBlock()
|
| H A D | UnreachableBlockElim.cpp | 138 df_iterator_default_set<MachineBasicBlock *> Reachable; in run() local
142 for (MachineBasicBlock *BB : depth_first_ext(&F, Reachable)) in run()
150 if (!Reachable.count(&BB)) { in run()
|
| H A D | BreakFalseDeps.cpp | 294 df_iterator_default_set<MachineBasicBlock *> Reachable; in runOnMachineFunction() local
295 for (MachineBasicBlock *MBB : depth_first_ext(&mf, Reachable)) in runOnMachineFunction()
300 if (Reachable.count(&MBB)) in runOnMachineFunction()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | PhiValues.cpp | 88 ConstValueSet &Reachable = ReachableMap[RootDepthNumber]; in processPhi() local
91 Reachable.insert(ComponentPhi); in processPhi()
103 Reachable.insert_range(It->second); in processPhi()
106 Reachable.insert(Op); in processPhi()
121 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(Range); in getReachableAvoiding()
245 Reachable.insert_range(Range); 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 | 113 auto Reachable = [](Node *From, Node *N) { in replaceChildRangeLowLevel() local
121 assert(Reachable(FirstChild, Begin) && "`Begin` is not reachable."); in replaceChildRangeLowLevel()
122 assert(Reachable(Begin, End) && "`End` is not after `Begin`."); in replaceChildRangeLowLevel()
|
| /freebsd/contrib/llvm-project/clang/lib/Sema/ |
| H A D | JumpDiagnostics.cpp | 808 llvm::BitVector Reachable(Scopes.size(), false); in VerifyIndirectJumps() local
810 Reachable.reset(); in VerifyIndirectJumps()
817 Reachable.set(Min); in VerifyIndirectJumps()
839 if (Reachable.test(Scope)) { in VerifyIndirectJumps()
843 Reachable.set(S); in VerifyIndirectJumps()
|
| /freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ProgramState.h | 411 bool scanReachableSymbols(llvm::iterator_range<region_iterator> Reachable,
416 scanReachableSymbols(llvm::iterator_range<region_iterator> Reachable) const;
876 llvm::iterator_range<region_iterator> Reachable) const { in scanReachableSymbols() argument
878 scanReachableSymbols(Reachable, cb); in scanReachableSymbols()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | BlockFrequencyInfoImpl.h | 1505 SmallPtrSet<const BlockT *, 8> Reachable;
1508 Reachable.insert(Entry);
1516 if (Reachable.insert(DstBB).second)
1527 if (!HasSucc && Reachable.count(&BB)) {
1547 if (Reachable.count(&BB) && InverseReachable.count(&BB)) {
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | AttributorAttributes.cpp | 3415 enum class Reachable { enum
3427 Reachable Result = Reachable::No;
3519 if (RQI->Result == RQITy::Reachable::No && in updateImpl()
3529 bool rememberResult(Attributor &A, typename RQITy::Reachable Result, in rememberResult()
3541 if (Result == RQITy::Reachable::Yes || !UsedExclusionSet) { in rememberResult()
3552 if (IsTemporaryRQI && Result != RQITy::Reachable::Yes && UsedExclusionSet) { in rememberResult()
3557 assert(RQIPtr->Result == RQITy::Reachable::No && "Already reachable?"); in rememberResult()
3564 if (Result == RQITy::Reachable::No && IsTemporaryRQI) in rememberResult()
3566 return Result == RQITy::Reachable::Yes; in rememberResult()
3575 typename RQITy::Reachable &Result) { in checkQueryCache()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 158 for (auto &[MBB, Reachable] : ReachableMap) { in analyze()
168 Reachable = true; in analyze()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | Local.cpp | 3013 SmallPtrSetImpl<BasicBlock *> &Reachable, in markAliveBlocks() argument
3018 Reachable.insert(BB); in markAliveBlocks()
3205 if (Reachable.insert(Successor).second) in markAliveBlocks()
3251 SmallPtrSet<BasicBlock *, 16> Reachable; in removeUnreachableBlocks() local
3252 bool Changed = markAliveBlocks(F, Reachable, DTU); in removeUnreachableBlocks()
3255 if (Reachable.size() == F.size()) in removeUnreachableBlocks()
3258 assert(Reachable.size() < F.size()); in removeUnreachableBlocks()
3264 if (Reachable.count(&BB)) in removeUnreachableBlocks()
|
| H A D | BasicBlockUtils.cpp | 126 df_iterator_default_set<BasicBlock*> Reachable; in EliminateUnreachableBlocks() local
129 for (BasicBlock *BB : depth_first_ext(&F, Reachable)) in EliminateUnreachableBlocks()
135 if (!Reachable.count(&BB)) in EliminateUnreachableBlocks()
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | DebugInfo.cpp | 461 SmallPtrSetImpl<Metadata *> &Reachable, in isDILocationReachable() argument
466 if (isa<DILocation>(N) || Reachable.count(N)) in isDILocationReachable()
472 if (isDILocationReachable(Visited, Reachable, Op)) { in isDILocationReachable()
475 Reachable.insert(N); in isDILocationReachable()
478 return Reachable.count(N); in isDILocationReachable()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/ |
| H A D | SPIRVUtils.cpp | 693 std::unordered_set<BasicBlock *> Reachable = getReachableFrom(&Start); in partialOrderVisit() local
711 if (Reachable.count(*It) == 0) { in partialOrderVisit()
|