| /llvm-project-15.0.7/llvm/unittests/ADT/ |
| H A D | TestGraph.h | 142 NodeSubset Reachable; in NodesReachableFrom() local
145 Reachable.AddNode(Idx); in NodesReachableFrom()
147 NodeSubset Previous(Reachable); in NodesReachableFrom()
152 Reachable = Reachable.Join(Nodes[i].second); in NodesReachableFrom()
155 if (Reachable == Previous) in NodesReachableFrom()
156 return Reachable; in NodesReachableFrom()
|
| /llvm-project-15.0.7/clang/lib/Analysis/ |
| H A D | ReachableCode.cpp | 319 if (!Reachable[Start->getBlockID()]) { in scanFromBlock()
321 Reachable[Start->getBlockID()] = true; in scanFromBlock()
363 if (!Reachable[blockID]) { in scanFromBlock()
364 Reachable.set(blockID); in scanFromBlock()
377 return scanFromBlock(Start, Reachable, &PP, true); in scanMaybeReachableFromBlock()
387 llvm::BitVector &Reachable; member in __anon26aee0cf0111::DeadCodeScan
400 Reachable(reachable), in DeadCodeScan()
419 if (Reachable[blockID] || Visited[blockID]) in enqueue()
436 if (!Reachable[blockID]) { in isDeadCodeRoot()
494 if (Reachable[Block->getBlockID()]) in scanBackwards()
[all …]
|
| H A D | ThreadSafety.cpp | 350 bool Reachable = false; member
2271 BlockInfo[CFGraph->getEntry().getBlockID()].Reachable = true; in runAnalysis()
2369 if (neverReturns(*PI) || !PrevBlockInfo->Reachable) in runAnalysis()
2373 CurrBlockInfo->Reachable = true; in runAnalysis()
2394 if (!CurrBlockInfo->Reachable) in runAnalysis()
2450 if (!Final->Reachable) in runAnalysis()
|
| H A D | Consumed.cpp | 1135 if (this->From && this->From == Other.From && !Other.Reachable) { in intersect()
1173 this->Reachable = false; in markUnreachable()
|
| /llvm-project-15.0.7/llvm/include/llvm/Transforms/Utils/ |
| H A D | SampleProfileInference.h | 125 df_iterator_default_set<const BasicBlockT *> Reachable;
126 for (auto *BB : depth_first_ext(&F, Reachable))
143 BlockIndex.reserve(Reachable.size());
144 BasicBlocks.reserve(Reachable.size());
146 if (Reachable.count(&BB) && InverseReachable.count(&BB)) {
230 assert(Reachable.contains(I.first));
234 assert(Reachable.contains(I.first.first) &&
235 Reachable.contains(I.first.second));
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | CFIFixup.cpp | 109 bool Reachable : 1; in runOnMachineFunction() member
115 BlockInfo[0].Reachable = true; in runOnMachineFunction()
145 SuccInfo.Reachable = true; in runOnMachineFunction()
180 if (!Info.Reachable) { in runOnMachineFunction()
189 assert((!PredInfo.Reachable || in runOnMachineFunction()
|
| H A D | UnreachableBlockElim.cpp | 98 df_iterator_default_set<MachineBasicBlock*> Reachable; in runOnMachineFunction() local
105 for (MachineBasicBlock *BB : depth_first_ext(&F, Reachable)) in runOnMachineFunction()
113 if (!Reachable.count(&BB)) { in runOnMachineFunction()
|
| H A D | PrologEpilogInserter.cpp | 1300 df_iterator_default_set<MachineBasicBlock*> Reachable; in replaceFrameIndices() local
1303 for (auto DFI = df_ext_begin(&MF, Reachable), DFE = df_ext_end(&MF, Reachable); in replaceFrameIndices()
1309 assert(Reachable.count(StackPred) && in replaceFrameIndices()
1320 if (Reachable.count(&BB)) in replaceFrameIndices()
|
| H A D | MachineVerifier.cpp | 3273 df_iterator_default_set<const MachineBasicBlock*> Reachable; in verifyStackFrame() local
3278 DFI = df_ext_begin(MF, Reachable), DFE = df_ext_end(MF, Reachable); in verifyStackFrame()
3286 assert(Reachable.count(StackPred) && in verifyStackFrame()
3323 if (Reachable.count(Pred) && in verifyStackFrame()
3338 if (Reachable.count(Succ) && in verifyStackFrame()
|
| /llvm-project-15.0.7/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()
|
| /llvm-project-15.0.7/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()
180 bool isReachable() const { return Reachable; } in isReachable()
|
| H A D | ReachableCode.h | 61 llvm::BitVector &Reachable);
|
| /llvm-project-15.0.7/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 __anon537f6e6b0111::ReachabilityGraph
146 Reachable[MBB].insert(Succ); in calculate()
160 if (Reachable[Pred].insert(Succ).second) { in calculate()
|
| /llvm-project-15.0.7/clang/lib/StaticAnalyzer/Core/ |
| H A D | WorkList.cpp | 142 llvm::DenseSet<LocIdentifier> Reachable; member in __anon24f49dde0311::UnexploredFirstStack
161 auto InsertInfo = Reachable.insert(LocId); in enqueue()
169 MaxReachableSize.updateMax(Reachable.size()); in enqueue()
|
| H A D | ProgramState.cpp | 651 llvm::iterator_range<region_iterator> Reachable, in scanReachableSymbols() argument
654 for (const MemRegion *R : Reachable) { in scanReachableSymbols()
|
| /llvm-project-15.0.7/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()
|
| /llvm-project-15.0.7/clang/lib/Sema/ |
| H A D | JumpDiagnostics.cpp | 776 llvm::BitVector Reachable(Scopes.size(), false); in VerifyIndirectOrAsmJumps() local
782 Reachable.reset(); in VerifyIndirectOrAsmJumps()
789 Reachable.set(Min); in VerifyIndirectOrAsmJumps()
813 if (Reachable.test(Scope)) { in VerifyIndirectOrAsmJumps()
817 Reachable.set(S); in VerifyIndirectOrAsmJumps()
|
| /llvm-project-15.0.7/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ProgramState.h | 406 bool scanReachableSymbols(llvm::iterator_range<region_iterator> Reachable,
411 scanReachableSymbols(llvm::iterator_range<region_iterator> Reachable) const;
893 llvm::iterator_range<region_iterator> Reachable) const { in scanReachableSymbols() argument
895 scanReachableSymbols(Reachable, cb); in scanReachableSymbols()
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | BlockFrequencyInfoImpl.h | 1518 SmallPtrSet<const BlockT *, 8> Reachable;
1521 Reachable.insert(Entry);
1529 if (Reachable.insert(DstBB).second)
1541 if (!HasSucc && Reachable.count(&BB)) {
1561 if (Reachable.count(&BB) && InverseReachable.count(&BB)) {
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | Local.cpp | 2252 SmallPtrSetImpl<BasicBlock *> &Reachable, in markAliveBlocks() argument
2257 Reachable.insert(BB); in markAliveBlocks()
2441 if (Reachable.insert(Successor).second) in markAliveBlocks()
2488 SmallPtrSet<BasicBlock *, 16> Reachable; in removeUnreachableBlocks() local
2489 bool Changed = markAliveBlocks(F, Reachable, DTU); in removeUnreachableBlocks()
2492 if (Reachable.size() == F.size()) in removeUnreachableBlocks()
2495 assert(Reachable.size() < F.size()); in removeUnreachableBlocks()
2501 if (Reachable.count(&BB)) in removeUnreachableBlocks()
|
| H A D | BasicBlockUtils.cpp | 125 df_iterator_default_set<BasicBlock*> Reachable; in EliminateUnreachableBlocks() local
128 for (BasicBlock *BB : depth_first_ext(&F, Reachable)) in EliminateUnreachableBlocks()
134 if (!Reachable.count(&BB)) in EliminateUnreachableBlocks()
|
| /llvm-project-15.0.7/llvm/test/Analysis/BranchProbabilityInfo/ |
| H A D | basic.ll | 499 ; Reachable probabilities keep their relation: 4/64/4/4 = 5.26% / 84.21% / 5.26% / 5.26%.
542 ; Reachable probabilities keep their relation: 64/4/4 = 88.89% / 5.56% / 5.56%.
584 ; Reachable probabilities keep their relation: 64/4/4 = 88.89% / 5.56% / 5.56%.
|
| /llvm-project-15.0.7/llvm/lib/IR/ |
| H A D | DebugInfo.cpp | 385 SmallPtrSetImpl<Metadata *> &Reachable, in isDILocationReachable() argument
390 if (isa<DILocation>(N) || Reachable.count(N)) in isDILocationReachable()
396 if (isDILocationReachable(Visited, Reachable, Op)) { in isDILocationReachable()
397 Reachable.insert(N); in isDILocationReachable()
|
| /llvm-project-15.0.7/llvm/test/Transforms/NewGVN/ |
| H A D | crash.ll | 194 ;; Reachable code.
|
| /llvm-project-15.0.7/llvm/test/Transforms/GVN/ |
| H A D | crash.ll | 194 ;; Reachable code.
|