| /llvm-project-15.0.7/llvm/test/Transforms/SimplifyCFG/X86/ |
| H A D | critedge-assume.ll | 1 …mbine -simplifycfg -simplifycfg-require-and-preserve-domtree=1 -thinlto-bc -verify-assumption-cache 4 ; Test that the simplifycfg pass correctly updates the assumption cache 6 ; edge. To do that, we set up a pass pipeline such that (1) an assumption 8 ; assumption cache is verified after simplifycfg has run. To satisfy 1, we 10 ; ThinLTOBitcodeWriter pass to write bitcode (that pass uses the assumption 13 ; wipe out the bad assumption cache before it is verified.
|
| /llvm-project-15.0.7/llvm/test/Transforms/GVN/ |
| H A D | phi.ll | 45 %assumption = icmp eq i64 %a, 0 46 call void @llvm.assume(i1 %assumption) 139 %assumption = icmp eq i64 %a, 0 140 call void @llvm.assume(i1 %assumption) 163 %assumption = icmp eq i64 %a, 0 164 call void @llvm.assume(i1 %assumption) 190 %assumption = icmp eq i64 %a, 0 191 call void @llvm.assume(i1 %assumption)
|
| /llvm-project-15.0.7/polly/test/ScopInfo/ |
| H A D | user_provided_non_dominating_assumptions.ll | 5 ; CHECK-NEXT: remark: <unknown>:0:0: Use user assumption: [i, N, M] -> { : N <= i or (N > i and N … 6 ; CHECK-NEXT: remark: <unknown>:0:0: Inbounds assumption: [i, N, M] -> { : N <= i or (N > i and… 36 ; YAML: - String: 'Use user assumption: ' 44 ; YAML: - String: 'Inbounds assumption: [i, N, M] -> { : N <= i or (N > i and M <=…
|
| H A D | unsigned-condition.ll | 10 ; The assumed context is the universe because the "signed-unsigned assumption" 13 ; assumption will hold.
|
| H A D | user_provided_assumptions.ll | 5 ; CHECK-NEXT: remark: <unknown>:0:0: Use user assumption: [M, N] -> { : N <= 2147483647 - M } 6 ; CHECK-NEXT: remark: <unknown>:0:0: Use user assumption: [M, N] -> { : -2147483648 - M <= N <= 21… 7 ; CHECK-NEXT: remark: <unknown>:0:0: Use user assumption: [M, N, Debug] -> { : Debug = 0 and 0 < M… 8 ; CHECK-NEXT: remark: <unknown>:0:0: Use user assumption: [M, N, Debug] -> { : Debug = 0 and 0 < M…
|
| H A D | wraping_signed_expr_2.ll | 9 ; we will add the assumption that i+1 won't overflow only to the former.
|
| H A D | pr38218.ll | 4 ; assumption and made Polly crash (llvm.org/PR38219).
|
| H A D | inter-error-bb-dependence.ll | 50 ; CHECK-NEXT: Low complexity assumption: { : false }
|
| H A D | user_provided_assumptions-in-bb-unsigned.ll | 5 ; REMARK-NEXT: remark: <unknown>:0:0: Use user assumption: [n] -> { : n <= 100 }
|
| H A D | pwaff-complexity-bailout.ll | 4 ; CHECK: Low complexity assumption: { : false }
|
| /llvm-project-15.0.7/llvm/test/Transforms/CodeGenPrepare/X86/ |
| H A D | remove-assume-block.ll | 9 define void @simple(i64 %addr, i1 %assumption) { 14 tail call void @llvm.assume(i1 %assumption)
|
| /llvm-project-15.0.7/llvm/test/CodeGen/X86/ |
| H A D | late-remat-update-2.mir | 8 # updated after register coalescing, and it will break some assumption in 17 # achieve the test goal. But note that the assumption only holds when we use
|
| /llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/objc/ |
| H A D | assert-equals.rst | 10 strings that have equal values. This assumption is not guarantted by the
|
| /llvm-project-15.0.7/llvm/test/Transforms/Inline/ |
| H A D | inline-indirect.ll | 2 ; This test used to trigger an assertion in the assumption cache when
|
| H A D | partial-inline-act.ll | 2 ; This testcase tests the assumption cache
|
| /llvm-project-15.0.7/compiler-rt/test/fuzzer/ |
| H A D | fuzzer-alignment-assumption.test | 4 CHECK: AlignmentAssumptionTest.cpp:23:48: runtime error: assumption of 32768 byte alignment for po…
|
| /llvm-project-15.0.7/llvm/test/Analysis/CostModel/AArch64/ |
| H A D | cost-scalable-vector-gep.ll | 4 ; scalable vector does not produce a 'assumption that TypeSize is not scalable'
|
| /llvm-project-15.0.7/llvm/test/Transforms/CodeExtractor/ |
| H A D | extract-assume.ll | 3 ; Make sure this compiles. Check that function assumption cache is refreshed
|
| /llvm-project-15.0.7/llvm/test/Transforms/BDCE/ |
| H A D | invalidate-assumptions.ll | 7 ; that incorrect assumption and we can miscompile: 55 ; assumption-killing algorithm stops at the call. Ie, it does not remove
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ |
| H A D | gep-can-replace-gep-idx-with-zero-typesize.ll | 6 ; 'assumption that TypeSize is not scalable' warning when the source element type
|
| /llvm-project-15.0.7/llvm/test/CodeGen/WebAssembly/ |
| H A D | PR40172.ll | 7 ; comparison, invalidating FastISel's assumption.
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/ |
| H A D | infiniteloop.ll | 11 ; induction variable. This is not a valid assumption:
|
| /llvm-project-15.0.7/llvm/test/Transforms/GVNSink/ |
| H A D | assumption.ll | 4 ; This crashed because the cached assumption was replaced and the replacement
|
| /llvm-project-15.0.7/llvm/test/Analysis/ScalarEvolution/ |
| H A D | scev-canonical-mode.ll | 1 ; PR26529: Check the assumption of IndVarSimplify to do SCEV expansion in literal mode
|
| /llvm-project-15.0.7/openmp/docs/remarks/ |
| H A D | OMP133.rst | 40 The remark suggests marking the function with the assumption that it contains no
|