Home
last modified time | relevance | path

Searched refs:reachable (Results 1 – 25 of 101) sorted by relevance

12345

/llvm-project-15.0.7/clang/test/CXX/module/module.interface/
H A Dp7.cpp10 struct reachable { struct
32 return reachable{}; in getReachable() argument
44 auto reachable = getReachable(); in test() local
45 int a = decltype(reachable)::sv; in test()
46 int b = decltype(reachable)::getValue(); in test()
47 int c = reachable.value; in test()
48 int d = reachable.get(); in test()
49 int e = decltype(reachable)::a; in test()
50 int f = reachable.templ_get(a); in test()
52 typename decltype(reachable)::using_type h; in test()
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/
H A Dreplace-lds-by-ptr-ignore-not-reachable-lds.ll5 ; LDS global @not-reachable-lds is used within non-kernel function @f0, but @f0 is *not*
6 ; reachable from kernel @k, hence pointer replacement does not take place.
9 ; CHECK: @not-reachable-lds = internal addrspace(3) global [4 x i32] undef, align 4
10 @not-reachable-lds = internal addrspace(3) global [4 x i32] undef, align 4
12 ; CHECK-NOT: @not-reachable-lds.ptr
16 ; CHECK: %gep = getelementptr inbounds [4 x i32], [4 x i32] addrspace(3)* @not-reachable-lds, i32…
19 %gep = getelementptr inbounds [4 x i32], [4 x i32] addrspace(3)* @not-reachable-lds, i32 0, i32 0
H A Dreplace-lds-by-ptr-ignore-small-lds.ll5 ; LDS global @small_lds is used within non-kernel function @f0, and @f0 is reachable
/llvm-project-15.0.7/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp41 CFGBlocksSet &reachable,
51 CFGBlocksSet reachable, visited; in checkEndAnalysis() local
79 reachable.insert(CB->getBlockID()); in checkEndAnalysis()
98 if (reachable.count(CB->getBlockID())) in checkEndAnalysis()
107 FindUnreachableEntryPoints(CB, reachable, visited); in checkEndAnalysis()
110 if (reachable.count(CB->getBlockID())) in checkEndAnalysis()
179 CFGBlocksSet &reachable, in FindUnreachableEntryPoints() argument
188 if (!reachable.count((*I)->getBlockID())) { in FindUnreachableEntryPoints()
191 reachable.insert(CB->getBlockID()); in FindUnreachableEntryPoints()
194 FindUnreachableEntryPoints(*I, reachable, visited); in FindUnreachableEntryPoints()
H A DAnalyzerStatsChecker.cpp45 llvm::SmallPtrSet<const CFGBlock*, 32> reachable; in checkEndAnalysis() local
64 reachable.insert(CB); in checkEndAnalysis()
78 if (!reachable.count(CB)) { in checkEndAnalysis()
H A DDeadStoresChecker.cpp70 llvm::BitVector reachable; member in __anon9ba7c1e10111::ReachableCode
73 : cfg(cfg), reachable(cfg.getNumBlockIDs(), false) {} in ReachableCode()
78 return reachable[block->getBlockID()]; in isReachable()
92 llvm::BitVector::reference isReachable = reachable[block->getBlockID()]; in computeReachableBlocks()
/llvm-project-15.0.7/mlir/lib/Dialect/Transform/Transforms/
H A DCheckUses.cpp38 llvm::SmallPtrSet<Block *, 4> &reachable = cache[block]; in getReachableImpl() local
46 if (reachable.insert(predecessor).second) in getReachableImpl()
50 return reachable; in getReachableImpl()
274 llvm::SmallPtrSet<Block *, 4> reachable(getReachable(from)); in isMaybeFreedOnPaths() local
275 llvm::set_intersect(reachable, sources); in isMaybeFreedOnPaths()
280 reachable.insert(from); in isMaybeFreedOnPaths()
285 for (Block *block : reachable) { in isMaybeFreedOnPaths()
/llvm-project-15.0.7/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp37 return reachable[DstBlockID][Src->getBlockID()]; in isReachable()
46 ReachableSet &DstReachability = reachable[Dst->getBlockID()]; in mapReachability()
H A DReachableCode.cpp398 DeadCodeScan(llvm::BitVector &reachable, Preprocessor &PP, ASTContext &C) in DeadCodeScan() argument
399 : Visited(reachable.size()), in DeadCodeScan()
400 Reachable(reachable), in DeadCodeScan()
686 llvm::BitVector reachable(cfg->getNumBlockIDs()); in FindUnreachableCode() local
688 scanMaybeReachableFromBlock(&cfg->getEntry(), PP, reachable); in FindUnreachableCode()
696 numReachable += scanMaybeReachableFromBlock(B, PP, reachable); in FindUnreachableCode()
705 if (reachable[block->getBlockID()]) in FindUnreachableCode()
708 DeadCodeScan DS(reachable, PP, AC.getASTContext()); in FindUnreachableCode()
/llvm-project-15.0.7/llvm/test/Analysis/LazyCallGraph/
H A Dalias.ll3 ; Aliased function should be reachable in CGSCC.
33 ; Internal alias is not reachable.
/llvm-project-15.0.7/bolt/test/X86/
H A Dsplit-func-jump-table-fragment-noparent.s3 # The fragment is only reachable through jump table.
40 # cold fragment is only reachable through jump table
H A Dsplit-func-icf.s3 # The fragment is only reachable through a jump table, so all functions must be
73 # cold fragment is only reachable through jump table
/llvm-project-15.0.7/clang/docs/analyzer/developer-docs/
H A DInitializerLists.rst67 turns out to be reachable. This requires no work on checker side, but it sounds
141 > a region turns out to be reachable. This requires no work on checker side,
160 reachable from here exists another region of type T". Or even multiple regions
161 with different identifiers. This wouldn't specify how the memory is reachable,
184 this to be in the store: we are modeling reachable storage as storage. But if
192 > that meant "here is a memory region and somewhere reachable from here exists
203 region. Region contents are mutable: today the abstract storage is reachable
205 reachable, something that isn't even abstract. So the parent region for the
210 > For std::initializer_list this reachable region would the region for the
248 reachable symbols and regions) that cannot work without checker support.
[all …]
/llvm-project-15.0.7/compiler-rt/lib/lsan/
H A Dlsan_flags.inc27 // Flags controlling the root set of reachable memory.
37 "Root set: mark as reachable all allocations made from dynamic "
/llvm-project-15.0.7/llvm/test/Transforms/GlobalDCE/
H A D2002-07-17-ConstantRef.ll6 ; Not dead, can be reachable via X
/llvm-project-15.0.7/clang/include/clang/Analysis/Analyses/
H A DCFGReachabilityAnalysis.h36 ReachableMap reachable; variable
/llvm-project-15.0.7/clang/test/Analysis/
H A Dobjc-method-coverage.m17 // CHECK: 100 AnalysisConsumer - The % of reachable basic blocks.
H A Dnull-deref-static.m23 // FIXME: Should be reachable.
/llvm-project-15.0.7/llvm/test/Transforms/LCSSA/
H A Dunreachable-use.ll4 ; LCSSA doesn't need to transform uses in blocks not reachable
/llvm-project-15.0.7/llvm/test/Analysis/RegionInfo/
H A Dunreachable_bb.ll3 ; We should not crash if there are some bbs that are not reachable.
/llvm-project-15.0.7/llvm/test/Transforms/InstCombine/
H A D2008-07-13-DivZero.ll6 ; call. If the callee never returns, we can't assume the div is reachable.
/llvm-project-15.0.7/llvm/test/Analysis/MemorySSA/
H A Dforward-unreachable.ll17 ; because it is reverse reachable, so the CFG still has it as a
/llvm-project-15.0.7/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
/llvm-project-15.0.7/mlir/lib/Transforms/Utils/
H A DRegionUtils.cpp82 llvm::df_iterator_default_set<Block *, 16> reachable; in eraseUnreachableBlocks() local
104 reachable.clear(); in eraseUnreachableBlocks()
105 for (Block *block : depth_first_ext(&region->front(), reachable)) in eraseUnreachableBlocks()
111 if (!reachable.count(&block)) { in eraseUnreachableBlocks()
/llvm-project-15.0.7/llvm/test/Transforms/CodeGenPrepare/X86/
H A Dmulti-extension.ll10 ; %or is reachable by both a sext and zext that are going to be promoted.

12345