This is an archive of the discontinued LLVM Phabricator instance.

Differential D145331

[test] Remove occurences of br undef in test/Analysis tests
Needs ReviewPublic

Authored by kritgpt on Mar 5 2023, 1:50 PM.

Details

Reviewers
nlopes
Summary

This patch removes br undef as suggested by https://discourse.llvm.org/t/please-dont-use-br-undef-in-tests-aka-please-avoid-test-cases-with-ub/63115. Script used: https://gist.github.com/kritgpt/69bfc7ef78e1784716c693d531a58adf.

Diff Detail

Unit TestsFailed

TimeTest
70 msx64 debian > LLVM.Analysis/CostModel/AMDGPU::control-flow.ll
50 msx64 debian > LLVM.Analysis/CostModel/SystemZ::intrinsic-cost-crash.ll
60,030 msx64 debian > MLIR.Examples/standalone::test.toy

Event Timeline

kritgpt created this revision.Mar 5 2023, 1:50 PM
Herald added a project: Restricted Project. · View Herald TranscriptMar 5 2023, 1:50 PM
Herald added subscribers: kmitropoulou, kosarev, kerbowa and 3 others. · View Herald Transcript
kritgpt requested review of this revision.Mar 5 2023, 1:50 PM
Herald added a project: Restricted Project. · View Herald TranscriptMar 5 2023, 1:50 PM
Herald added a subscriber: llvm-commits. · View Herald Transcript
kritgpt added a reviewer: nlopes.Mar 5 2023, 1:51 PM
nlopes added inline comments.Mar 5 2023, 1:54 PM
llvm/test/Analysis/ValueTracking/shift-recurrence-knownbits.ll
130

extra whitespace there

nlopes added inline comments.Mar 5 2023, 1:56 PM
llvm/test/Analysis/ValueTracking/shift-recurrence-knownbits.ll
9

these tests that have an impact on the test output should be separated from the other that induce no change

Harbormaster completed remote builds in B217452: Diff 502471.Mar 5 2023, 2:55 PM
Groverkss added a subscriber: Groverkss.Mar 7 2023, 10:28 AM
Groverkss added inline comments.
llvm/test/Analysis/CostModel/AMDGPU/control-flow.ll
8

Why was this removed?

llvm/test/Analysis/CostModel/SystemZ/intrinsic-cost-crash.ll
29

The function arguments were not changed here.

Revision Contents

PathSize
llvm/
test/
Analysis/
BasicAA/
8 lines
4 lines
BlockFrequencyInfo/
6 lines
BranchProbabilityInfo/
12 lines
44 lines
36 lines
CostModel/
AMDGPU/
6 lines
SystemZ/
2 lines
CycleInfo/
100 lines
Delinearization/
4 lines
12 lines
DependenceAnalysis/
10 lines
8 lines
DivergenceAnalysis/
AMDGPU/
8 lines
Dominators/
14 lines
14 lines
MemorySSA/
23 lines
4 lines
4 lines
4 lines
4 lines
26 lines
4 lines
4 lines
21 lines
6 lines
4 lines
4 lines
6 lines
4 lines
8 lines
PhiValues/
64 lines
30 lines
PostDominators/
4 lines
6 lines
4 lines
4 lines
ScalarEvolution/
4 lines
10 lines
4 lines
48 lines
4 lines
24 lines
4 lines
60 lines
68 lines
16 lines
8 lines
8 lines
8 lines
6 lines
4 lines
36 lines
ValueTracking/
4 lines
35 lines

Diff 502471

llvm/test/Analysis/BasicAA/phi-values-usage.ll

Show All 14 Lines
declare void @otherfn(ptr) declare void @otherfn(ptr)
declare i32 @__gxx_personality_v0(...) declare i32 @__gxx_personality_v0(...)
declare void @llvm.lifetime.end.p0(i64, ptr nocapture) declare void @llvm.lifetime.end.p0(i64, ptr nocapture)
@c = external global ptr, align 1 @c = external global ptr, align 1
; This function is one where if we didn't free basicaa after memcpyopt then the ; This function is one where if we didn't free basicaa after memcpyopt then the
; usage of basicaa in instcombine would cause a segfault due to stale phi-values ; usage of basicaa in instcombine would cause a segfault due to stale phi-values
; results being used. ; results being used.
define void @fn(ptr %this, ptr %ptr) personality ptr @__gxx_personality_v0 { define void @fn(ptr %this, ptr %ptr, i1 %replace_undef_0) personality ptr @__gxx_personality_v0 {
entry: entry:
%arr = alloca [4 x i8], align 8 %arr = alloca [4 x i8], align 8
br i1 undef, label %then, label %if br i1 %replace_undef_0, label %then, label %if
if: if:
br label %then br label %then
then: then:
%phi = phi ptr [ %ptr, %if ], [ null, %entry ] %phi = phi ptr [ %ptr, %if ], [ null, %entry ]
store i8 1, ptr %arr, align 8 store i8 1, ptr %arr, align 8
%load = load i64, ptr %phi, align 8 %load = load i64, ptr %phi, align 8
Show All 10 Lines landingpad { ptr, i32 }
catch ptr null catch ptr null
call void @otherfn(ptr nonnull %arr) call void @otherfn(ptr nonnull %arr)
unreachable unreachable
} }
; When running instcombine after memdep, the basicaa used by instcombine uses ; When running instcombine after memdep, the basicaa used by instcombine uses
; the phivalues that memdep used. This would then cause a segfault due to ; the phivalues that memdep used. This would then cause a segfault due to
; instcombine deleting a phi whose values had been cached. ; instcombine deleting a phi whose values had been cached.
define void @fn2() { define void @fn2( i1 %replace_undef_0) {
entry: entry:
%a = alloca i8, align 1 %a = alloca i8, align 1
%0 = load ptr, ptr @c, align 1 %0 = load ptr, ptr @c, align 1
br label %for.cond br label %for.cond
for.cond: ; preds = %for.body, %entry for.cond: ; preds = %for.body, %entry
%d.0 = phi ptr [ %0, %entry ], [ null, %for.body ] %d.0 = phi ptr [ %0, %entry ], [ null, %for.body ]
br i1 undef, label %for.body, label %for.cond.cleanup br i1 %replace_undef_0, label %for.body, label %for.cond.cleanup
for.body: ; preds = %for.cond for.body: ; preds = %for.cond
store volatile i8 undef, ptr %a, align 1 store volatile i8 undef, ptr %a, align 1
br label %for.cond br label %for.cond
for.cond.cleanup: ; preds = %for.cond for.cond.cleanup: ; preds = %for.cond
call void @llvm.lifetime.end.p0(i64 1, ptr %a) call void @llvm.lifetime.end.p0(i64 1, ptr %a)
%1 = load ptr, ptr %d.0, align 1 %1 = load ptr, ptr %d.0, align 1
store ptr %1, ptr @c, align 1 store ptr %1, ptr @c, align 1
ret void ret void
} }

llvm/test/Analysis/BasicAA/underlying-value.ll

; RUN: opt -aa-pipeline=basic-aa -passes=licm -S < %s ; RUN: opt -aa-pipeline=basic-aa -passes=licm -S < %s
; PR9931 ; PR9931
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64" target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64"
define void @func_20() nounwind { define void @func_20( i1 %replace_undef_0) nounwind {
entry: entry:
br label %for.cond br label %for.cond
for.cond: ; preds = %for.cond2, %entry for.cond: ; preds = %for.cond2, %entry
br i1 undef, label %for.cond2, label %for.end22 br i1 %replace_undef_0, label %for.cond2, label %for.end22
for.cond2: ; preds = %for.body5, %for.cond for.cond2: ; preds = %for.body5, %for.cond
br i1 false, label %for.body5, label %for.cond br i1 false, label %for.body5, label %for.cond
for.body5: ; preds = %for.cond2 for.body5: ; preds = %for.cond2
%tmp7 = load i64, ptr undef, align 8 %tmp7 = load i64, ptr undef, align 8
%arrayidx9 = getelementptr inbounds [2 x i64], ptr undef, i32 0, i64 undef %arrayidx9 = getelementptr inbounds [2 x i64], ptr undef, i32 0, i64 undef
%tmp10 = load i64, ptr %arrayidx9, align 8 %tmp10 = load i64, ptr %arrayidx9, align 8
br label %for.cond2 br label %for.cond2
for.end22: ; preds = %for.cond for.end22: ; preds = %for.cond
ret void ret void
} }

llvm/test/Analysis/BlockFrequencyInfo/irreducible_loop_crash.ll

; RUN: opt < %s -passes='print<block-freq>' -disable-output ; RUN: opt < %s -passes='print<block-freq>' -disable-output
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-unknown-linux-gnu" target triple = "x86_64-unknown-linux-gnu"
define void @fn1(i32* %f) { define void @fn1(i32* %f, i1 %replace_undef_0, i1 %replace_undef_1) {
entry: entry:
%tobool7 = icmp eq i32 undef, 0 %tobool7 = icmp eq i32 undef, 0
br i1 undef, label %if.end.12, label %for.body.5 br i1 %replace_undef_0, label %if.end.12, label %for.body.5
for.inc: for.inc:
store i32 undef, i32* %f, align 4 store i32 undef, i32* %f, align 4
br label %for.body.5 br label %for.body.5
for.body.5: ; preds = %for.cond.4.preheader for.body.5: ; preds = %for.cond.4.preheader
br i1 %tobool7, label %for.inc.9, label %for.inc br i1 %tobool7, label %for.inc.9, label %for.inc
for.inc.9: ; preds = %for.body.5 for.inc.9: ; preds = %for.body.5
br i1 %tobool7, label %for.inc.9.1, label %for.inc br i1 %tobool7, label %for.inc.9.1, label %for.inc
if.end.12: ; preds = %if.end.12, %for.body if.end.12: ; preds = %if.end.12, %for.body
br i1 undef, label %for.end.17, label %for.inc br i1 %replace_undef_1, label %for.end.17, label %for.inc
for.end.17: ; preds = %entry for.end.17: ; preds = %entry
ret void ret void
for.inc.9.1: ; preds = %for.inc.9 for.inc.9.1: ; preds = %for.inc.9
br i1 %tobool7, label %for.inc.9.2, label %for.inc br i1 %tobool7, label %for.inc.9.2, label %for.inc
for.inc.9.2: ; preds = %for.inc.9.1 for.inc.9.2: ; preds = %for.inc.9.1
▲ Show 20 Lines • Show All 125 Lines • Show Last 20 Lines

llvm/test/Analysis/BranchProbabilityInfo/deopt-invoke.ll

; RUN: opt < %s -passes='print<branch-prob>' -disable-output 2>&1 | FileCheck %s ; RUN: opt < %s -passes='print<branch-prob>' -disable-output 2>&1 | FileCheck %s
declare ptr @"personality_function"() #1 declare ptr @"personality_function"() #1
declare void @foo(i32) declare void @foo(i32)
declare void @bar() declare void @bar()
declare void @llvm.experimental.deoptimize.isVoid(...) declare void @llvm.experimental.deoptimize.isVoid(...)
declare void @cold() cold declare void @cold() cold
; Even though the likeliness of 'invoke' to throw an exception is assessed as low ; Even though the likeliness of 'invoke' to throw an exception is assessed as low
; all other paths are even less likely. Check that hot paths leads to excepion handler. ; all other paths are even less likely. Check that hot paths leads to excepion handler.
define void @test1(i32 %0) personality ptr @"personality_function" !prof !1 { define void @test1(i32 %0, i1 %replace_undef_0) personality ptr @"personality_function" !prof !1 {
;CHECK: edge entry -> unreached probability is 0x00000001 / 0x80000000 = 0.00% ;CHECK: edge entry -> unreached probability is 0x00000001 / 0x80000000 = 0.00%
;CHECK: edge entry -> invoke probability is 0x7fffffff / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge entry -> invoke probability is 0x7fffffff / 0x80000000 = 100.00% [HOT edge]
;CHECK: edge invoke -> invoke.cont.unreached probability is 0x00000000 / 0x80000000 = 0.00% ;CHECK: edge invoke -> invoke.cont.unreached probability is 0x00000000 / 0x80000000 = 0.00%
;CHECK: edge invoke -> land.pad probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge invoke -> land.pad probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
;CHECK: edge land.pad -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge land.pad -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
entry: entry:
br i1 undef, label %unreached, label %invoke, !prof !2 br i1 %replace_undef_0, label %unreached, label %invoke, !prof !2
invoke: invoke:
invoke void @foo(i32 %0) invoke void @foo(i32 %0)
to label %invoke.cont.unreached unwind label %land.pad to label %invoke.cont.unreached unwind label %land.pad
invoke.cont.unreached: invoke.cont.unreached:
call void (...) @llvm.experimental.deoptimize.isVoid(i32 10) [ "deopt"() ] call void (...) @llvm.experimental.deoptimize.isVoid(i32 10) [ "deopt"() ]
ret void ret void
unreached: unreached:
unreachable unreachable
land.pad: land.pad:
%v20 = landingpad { ptr, i32 } %v20 = landingpad { ptr, i32 }
cleanup cleanup
%v21 = load ptr addrspace(1), ptr addrspace(256) inttoptr (i64 8 to ptr addrspace(256)), align 8 %v21 = load ptr addrspace(1), ptr addrspace(256) inttoptr (i64 8 to ptr addrspace(256)), align 8
br label %exit br label %exit
exit: exit:
call void @bar() call void @bar()
ret void ret void
} }
define void @test2(i32 %0) personality ptr @"personality_function" { define void @test2(i32 %0, i1 %replace_undef_0) personality ptr @"personality_function" {
;CHECK: edge entry -> unreached probability is 0x00000000 / 0x80000000 = 0.00% ;CHECK: edge entry -> unreached probability is 0x00000000 / 0x80000000 = 0.00%
;CHECK: edge entry -> invoke probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge entry -> invoke probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
;CHECK: edge invoke -> invoke.cont.cold probability is 0x7fff8000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge invoke -> invoke.cont.cold probability is 0x7fff8000 / 0x80000000 = 100.00% [HOT edge]
;CHECK: edge invoke -> land.pad probability is 0x00008000 / 0x80000000 = 0.00% ;CHECK: edge invoke -> land.pad probability is 0x00008000 / 0x80000000 = 0.00%
;CHECK: edge land.pad -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge land.pad -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
entry: entry:
br i1 undef, label %unreached, label %invoke br i1 %replace_undef_0, label %unreached, label %invoke
invoke: invoke:
invoke void @foo(i32 %0) invoke void @foo(i32 %0)
to label %invoke.cont.cold unwind label %land.pad to label %invoke.cont.cold unwind label %land.pad
invoke.cont.cold: invoke.cont.cold:
call void @cold() call void @cold()
ret void ret void
unreached: unreached:
unreachable unreachable
land.pad: land.pad:
%v20 = landingpad { ptr, i32 } %v20 = landingpad { ptr, i32 }
cleanup cleanup
%v21 = load ptr addrspace(1), ptr addrspace(256) inttoptr (i64 8 to ptr addrspace(256)), align 8 %v21 = load ptr addrspace(1), ptr addrspace(256) inttoptr (i64 8 to ptr addrspace(256)), align 8
br label %exit br label %exit
exit: exit:
call void @bar() call void @bar()
ret void ret void
} }
define void @test3(i32 %0) personality ptr @"personality_function" { define void @test3(i32 %0, i1 %replace_undef_0) personality ptr @"personality_function" {
;CHECK: edge entry -> unreached probability is 0x00000000 / 0x80000000 = 0.00% ;CHECK: edge entry -> unreached probability is 0x00000000 / 0x80000000 = 0.00%
;CHECK: edge entry -> invoke probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge entry -> invoke probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
;CHECK: edge invoke -> invoke.cont.cold probability is 0x7fff8000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge invoke -> invoke.cont.cold probability is 0x7fff8000 / 0x80000000 = 100.00% [HOT edge]
;CHECK: edge invoke -> land.pad probability is 0x00008000 / 0x80000000 = 0.00% ;CHECK: edge invoke -> land.pad probability is 0x00008000 / 0x80000000 = 0.00%
;CHECK: edge land.pad -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge land.pad -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
entry: entry:
br i1 undef, label %unreached, label %invoke br i1 %replace_undef_0, label %unreached, label %invoke
invoke: invoke:
invoke void @foo(i32 %0) invoke void @foo(i32 %0)
to label %invoke.cont.cold unwind label %land.pad to label %invoke.cont.cold unwind label %land.pad
invoke.cont.cold: invoke.cont.cold:
call void @cold() call void @cold()
ret void ret void
unreached: unreached:
Show All 20 Lines

llvm/test/Analysis/BranchProbabilityInfo/loop.ll

Show First 20 Lines • Show All 517 Lines • ▼ Show 20 Linesexit:
ret void ret void
} }
declare i32 @InvokeCall() declare i32 @InvokeCall()
declare void @cold() cold declare void @cold() cold
; If loop has single exit and it leads to 'cold' block then edge leading to loop enter ; If loop has single exit and it leads to 'cold' block then edge leading to loop enter
; should be considered 'cold' as well. ; should be considered 'cold' as well.
define void @test13() { define void @test13( i1 %replace_undef_0, i1 %replace_undef_1) {
; CHECK: edge entry -> loop probability is 0x078780e3 / 0x80000000 = 5.88% ; CHECK: edge entry -> loop probability is 0x078780e3 / 0x80000000 = 5.88%
; CHECK: edge entry -> exit probability is 0x78787f1d / 0x80000000 = 94.12% [HOT edge] ; CHECK: edge entry -> exit probability is 0x78787f1d / 0x80000000 = 94.12% [HOT edge]
; CHECK: edge loop -> loop probability is 0x7fbe1203 / 0x80000000 = 99.80% [HOT edge] ; CHECK: edge loop -> loop probability is 0x7fbe1203 / 0x80000000 = 99.80% [HOT edge]
; CHECK: edge loop -> cold probability is 0x0041edfd / 0x80000000 = 0.20% ; CHECK: edge loop -> cold probability is 0x0041edfd / 0x80000000 = 0.20%
; CHECK: edge cold -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ; CHECK: edge cold -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
entry: entry:
br i1 undef, label %loop, label %exit br i1 %replace_undef_0, label %loop, label %exit
loop: loop:
%i.0 = phi i32 [ 0, %entry ], [ %inc, %loop ] %i.0 = phi i32 [ 0, %entry ], [ %inc, %loop ]
%inc = add nsw i32 %i.0, 1 %inc = add nsw i32 %i.0, 1
br i1 undef, label %loop, label %cold br i1 %replace_undef_1, label %loop, label %cold
cold: cold:
call void @cold() call void @cold()
br label %exit br label %exit
exit: exit:
ret void ret void
} }
; This is the same case as test13 but with additional loop 'preheader' block. ; This is the same case as test13 but with additional loop 'preheader' block.
define void @test14() { define void @test14( i1 %replace_undef_0, i1 %replace_undef_1) {
; CHECK: edge entry -> preheader probability is 0x078780e3 / 0x80000000 = 5.88% ; CHECK: edge entry -> preheader probability is 0x078780e3 / 0x80000000 = 5.88%
; CHECK: edge entry -> exit probability is 0x78787f1d / 0x80000000 = 94.12% [HOT edge] ; CHECK: edge entry -> exit probability is 0x78787f1d / 0x80000000 = 94.12% [HOT edge]
; CHECK: edge preheader -> loop probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ; CHECK: edge preheader -> loop probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
; CHECK: edge loop -> loop probability is 0x7fbe1203 / 0x80000000 = 99.80% [HOT edge] ; CHECK: edge loop -> loop probability is 0x7fbe1203 / 0x80000000 = 99.80% [HOT edge]
; CHECK: edge loop -> cold probability is 0x0041edfd / 0x80000000 = 0.20% ; CHECK: edge loop -> cold probability is 0x0041edfd / 0x80000000 = 0.20%
; CHECK: edge cold -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ; CHECK: edge cold -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
entry: entry:
br i1 undef, label %preheader, label %exit br i1 %replace_undef_0, label %preheader, label %exit
preheader: preheader:
br label %loop br label %loop
loop: loop:
%i.0 = phi i32 [ 0, %preheader ], [ %inc, %loop ] %i.0 = phi i32 [ 0, %preheader ], [ %inc, %loop ]
%inc = add nsw i32 %i.0, 1 %inc = add nsw i32 %i.0, 1
br i1 undef, label %loop, label %cold br i1 %replace_undef_1, label %loop, label %cold
cold: cold:
call void @cold() call void @cold()
br label %exit br label %exit
exit: exit:
ret void ret void
} }
; If loop has multiple low probability exits then edge leading to loop enter ; If loop has multiple low probability exits then edge leading to loop enter
; should be considered low probable as well. ; should be considered low probable as well.
define void @test15() { define void @test15( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
; CHECK: edge entry -> loop probability is 0x078780e3 / 0x80000000 = 5.88% ; CHECK: edge entry -> loop probability is 0x078780e3 / 0x80000000 = 5.88%
; CHECK: edge entry -> exit probability is 0x78787f1d / 0x80000000 = 94.12% [HOT edge] ; CHECK: edge entry -> exit probability is 0x78787f1d / 0x80000000 = 94.12% [HOT edge]
; CHECK: edge loop -> cont probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ; CHECK: edge loop -> cont probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
; CHECK: edge loop -> unreached probability is 0x00000000 / 0x80000000 = 0.00% ; CHECK: edge loop -> unreached probability is 0x00000000 / 0x80000000 = 0.00%
; CHECK: edge cont -> loop probability is 0x7fbe1203 / 0x80000000 = 99.80% [HOT edge] ; CHECK: edge cont -> loop probability is 0x7fbe1203 / 0x80000000 = 99.80% [HOT edge]
; CHECK: edge cont -> cold probability is 0x0041edfd / 0x80000000 = 0.20% ; CHECK: edge cont -> cold probability is 0x0041edfd / 0x80000000 = 0.20%
; CHECK: edge cold -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ; CHECK: edge cold -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
entry: entry:
br i1 undef, label %loop, label %exit br i1 %replace_undef_0, label %loop, label %exit
loop: loop:
%i.0 = phi i32 [ 0, %entry ], [ %inc, %cont ] %i.0 = phi i32 [ 0, %entry ], [ %inc, %cont ]
%inc = add nsw i32 %i.0, 1 %inc = add nsw i32 %i.0, 1
br i1 undef, label %cont, label %unreached br i1 %replace_undef_1, label %cont, label %unreached
cont: cont:
br i1 undef, label %loop, label %cold br i1 %replace_undef_2, label %loop, label %cold
unreached: unreached:
unreachable unreachable
cold: cold:
call void @cold() call void @cold()
br label %exit br label %exit
exit: exit:
ret void ret void
} }
; This is the same case as test15 but with additional loop 'preheader' block. ; This is the same case as test15 but with additional loop 'preheader' block.
define void @test16() { define void @test16( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
; CHECK: edge entry -> preheader probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ; CHECK: edge entry -> preheader probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
; CHECK: edge preheader -> loop probability is 0x078780e3 / 0x80000000 = 5.88% ; CHECK: edge preheader -> loop probability is 0x078780e3 / 0x80000000 = 5.88%
; CHECK: edge preheader -> exit probability is 0x78787f1d / 0x80000000 = 94.12% [HOT edge] ; CHECK: edge preheader -> exit probability is 0x78787f1d / 0x80000000 = 94.12% [HOT edge]
; CHECK: edge loop -> cont probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ; CHECK: edge loop -> cont probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
; CHECK: edge loop -> unreached probability is 0x00000000 / 0x80000000 = 0.00% ; CHECK: edge loop -> unreached probability is 0x00000000 / 0x80000000 = 0.00%
; CHECK: edge cont -> loop probability is 0x7fbe1203 / 0x80000000 = 99.80% [HOT edge] ; CHECK: edge cont -> loop probability is 0x7fbe1203 / 0x80000000 = 99.80% [HOT edge]
; CHECK: edge cont -> cold probability is 0x0041edfd / 0x80000000 = 0.20% ; CHECK: edge cont -> cold probability is 0x0041edfd / 0x80000000 = 0.20%
; CHECK: edge cold -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ; CHECK: edge cold -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
entry: entry:
br label %preheader br label %preheader
preheader: preheader:
br i1 undef, label %loop, label %exit br i1 %replace_undef_0, label %loop, label %exit
loop: loop:
%i.0 = phi i32 [ 0, %preheader ], [ %inc, %cont ] %i.0 = phi i32 [ 0, %preheader ], [ %inc, %cont ]
%inc = add nsw i32 %i.0, 1 %inc = add nsw i32 %i.0, 1
br i1 undef, label %cont, label %unreached br i1 %replace_undef_1, label %cont, label %unreached
cont: cont:
br i1 undef, label %loop, label %cold br i1 %replace_undef_2, label %loop, label %cold
unreached: unreached:
unreachable unreachable
cold: cold:
call void @cold() call void @cold()
br label %exit br label %exit
exit: exit:
ret void ret void
} }
declare void @abort() noreturn declare void @abort() noreturn
; Check that 'preheader' has 50/50 probability since there is one 'normal' exit. ; Check that 'preheader' has 50/50 probability since there is one 'normal' exit.
; Check that exit to 'cold' and 'noreturn' has lower probability than 'normal' exit. ; Check that exit to 'cold' and 'noreturn' has lower probability than 'normal' exit.
define void @test17() { define void @test17( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2, i1 %replace_undef_3) {
; CHECK: edge entry -> preheader probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ; CHECK: edge entry -> preheader probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
; CHECK: edge preheader -> loop probability is 0x40000000 / 0x80000000 = 50.00% ; CHECK: edge preheader -> loop probability is 0x40000000 / 0x80000000 = 50.00%
; CHECK: edge preheader -> exit probability is 0x40000000 / 0x80000000 = 50.00% ; CHECK: edge preheader -> exit probability is 0x40000000 / 0x80000000 = 50.00%
; CHECK: edge loop -> cont probability is 0x7ffff800 / 0x80000000 = 100.00% [HOT edge] ; CHECK: edge loop -> cont probability is 0x7ffff800 / 0x80000000 = 100.00% [HOT edge]
; CHECK: edge loop -> noreturn probability is 0x00000800 / 0x80000000 = 0.00% ; CHECK: edge loop -> noreturn probability is 0x00000800 / 0x80000000 = 0.00%
; CHECK: edge cont -> cont2 probability is 0x7fbe1203 / 0x80000000 = 99.80% [HOT edge] ; CHECK: edge cont -> cont2 probability is 0x7fbe1203 / 0x80000000 = 99.80% [HOT edge]
; CHECK: edge cont -> cold probability is 0x0041edfd / 0x80000000 = 0.20% ; CHECK: edge cont -> cold probability is 0x0041edfd / 0x80000000 = 0.20%
; CHECK: edge cont2 -> loop probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge] ; CHECK: edge cont2 -> loop probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
; CHECK: edge cont2 -> exit probability is 0x04000000 / 0x80000000 = 3.12% ; CHECK: edge cont2 -> exit probability is 0x04000000 / 0x80000000 = 3.12%
; CHECK: edge cold -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ; CHECK: edge cold -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
entry: entry:
br label %preheader br label %preheader
preheader: preheader:
br i1 undef, label %loop, label %exit br i1 %replace_undef_0, label %loop, label %exit
loop: loop:
%i.0 = phi i32 [ 0, %preheader ], [ %inc, %cont2 ] %i.0 = phi i32 [ 0, %preheader ], [ %inc, %cont2 ]
%inc = add nsw i32 %i.0, 1 %inc = add nsw i32 %i.0, 1
br i1 undef, label %cont, label %noreturn br i1 %replace_undef_1, label %cont, label %noreturn
cont: cont:
br i1 undef, label %cont2, label %cold br i1 %replace_undef_2, label %cont2, label %cold
cont2: cont2:
br i1 undef, label %loop, label %exit br i1 %replace_undef_3, label %loop, label %exit
noreturn: noreturn:
call void @abort() call void @abort()
unreachable unreachable
cold: cold:
call void @cold() call void @cold()
br label %exit br label %exit
exit: exit:
ret void ret void
} }
; This is case with two loops where one nested into another. Nested loop has ; This is case with two loops where one nested into another. Nested loop has
; low probable exit what encreases robability to take exit in the top level loop. ; low probable exit what encreases robability to take exit in the top level loop.
define void @test18() { define void @test18( i1 %replace_undef_0, i1 %replace_undef_1) {
; CHECK: edge entry -> top.loop probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ; CHECK: edge entry -> top.loop probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
; CHECK: edge top.loop -> loop probability is 0x546cd4b7 / 0x80000000 = 65.96% ; CHECK: edge top.loop -> loop probability is 0x546cd4b7 / 0x80000000 = 65.96%
; CHECK: edge top.loop -> exit probability is 0x2b932b49 / 0x80000000 = 34.04% ; CHECK: edge top.loop -> exit probability is 0x2b932b49 / 0x80000000 = 34.04%
; CHECK: edge loop -> loop probability is 0x7fbe1203 / 0x80000000 = 99.80% [HOT edge] ; CHECK: edge loop -> loop probability is 0x7fbe1203 / 0x80000000 = 99.80% [HOT edge]
; CHECK: edge loop -> cold probability is 0x0041edfd / 0x80000000 = 0.20% ; CHECK: edge loop -> cold probability is 0x0041edfd / 0x80000000 = 0.20%
; CHECK: edge cold -> top.loop probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ; CHECK: edge cold -> top.loop probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
entry: entry:
br label %top.loop br label %top.loop
top.loop: top.loop:
%j.0 = phi i32 [ 0, %entry ], [ %j.inc, %cold ] %j.0 = phi i32 [ 0, %entry ], [ %j.inc, %cold ]
br i1 undef, label %loop, label %exit br i1 %replace_undef_0, label %loop, label %exit
loop: loop:
%i.0 = phi i32 [ %j.0, %top.loop ], [ %inc, %loop ] %i.0 = phi i32 [ %j.0, %top.loop ], [ %inc, %loop ]
%inc = add nsw i32 %i.0, 1 %inc = add nsw i32 %i.0, 1
br i1 undef, label %loop, label %cold br i1 %replace_undef_1, label %loop, label %cold
cold: cold:
call void @cold() call void @cold()
%j.inc = add nsw i32 %j.0, 1 %j.inc = add nsw i32 %j.0, 1
br label %top.loop br label %top.loop
exit: exit:
ret void ret void
} }

llvm/test/Analysis/BranchProbabilityInfo/unreachable.ll

; RUN: opt < %s -passes='print<branch-prob>' -disable-output 2>&1 | FileCheck %s ; RUN: opt < %s -passes='print<branch-prob>' -disable-output 2>&1 | FileCheck %s
declare void @bar() cold declare void @bar() cold
; Both 'l1' and 'r1' has one edge leading to 'cold' and another one to ; Both 'l1' and 'r1' has one edge leading to 'cold' and another one to
; 'unreachable' blocks. Check that 'cold' paths are preferred. Also ensure both ; 'unreachable' blocks. Check that 'cold' paths are preferred. Also ensure both
; paths from 'entry' block are equal. ; paths from 'entry' block are equal.
define void @test1(i32 %0) { define void @test1(i32 %0, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
;CHECK: edge entry -> l1 probability is 0x40000000 / 0x80000000 = 50.00% ;CHECK: edge entry -> l1 probability is 0x40000000 / 0x80000000 = 50.00%
;CHECK: edge entry -> r1 probability is 0x40000000 / 0x80000000 = 50.00% ;CHECK: edge entry -> r1 probability is 0x40000000 / 0x80000000 = 50.00%
;CHECK: edge l1 -> cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge l1 -> cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
;CHECK: edge l1 -> unreached probability is 0x00000000 / 0x80000000 = 0.00% ;CHECK: edge l1 -> unreached probability is 0x00000000 / 0x80000000 = 0.00%
;CHECK: edge r1 -> unreached probability is 0x00000000 / 0x80000000 = 0.00% ;CHECK: edge r1 -> unreached probability is 0x00000000 / 0x80000000 = 0.00%
;CHECK: edge r1 -> cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge r1 -> cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
entry: entry:
br i1 undef, label %l1, label %r1 br i1 %replace_undef_0, label %l1, label %r1
l1: l1:
br i1 undef, label %cold, label %unreached br i1 %replace_undef_1, label %cold, label %unreached
r1: r1:
br i1 undef, label %unreached, label %cold br i1 %replace_undef_2, label %unreached, label %cold
unreached: unreached:
unreachable unreachable
cold: cold:
call void @bar() call void @bar()
ret void ret void
} }
; Both edges of 'l1' leads to 'cold' blocks while one edge of 'r1' leads to ; Both edges of 'l1' leads to 'cold' blocks while one edge of 'r1' leads to
; 'unreachable' block. Check that 'l1' has 50/50 while 'r1' has 0/100 ; 'unreachable' block. Check that 'l1' has 50/50 while 'r1' has 0/100
; distributuion. Also ensure both paths from 'entry' block are equal. ; distributuion. Also ensure both paths from 'entry' block are equal.
define void @test2(i32 %0) { define void @test2(i32 %0, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
;CHECK: edge entry -> l1 probability is 0x40000000 / 0x80000000 = 50.00% ;CHECK: edge entry -> l1 probability is 0x40000000 / 0x80000000 = 50.00%
;CHECK: edge entry -> r1 probability is 0x40000000 / 0x80000000 = 50.00% ;CHECK: edge entry -> r1 probability is 0x40000000 / 0x80000000 = 50.00%
;CHECK: edge l1 -> cold probability is 0x40000000 / 0x80000000 = 50.00% ;CHECK: edge l1 -> cold probability is 0x40000000 / 0x80000000 = 50.00%
;CHECK: edge l1 -> cold2 probability is 0x40000000 / 0x80000000 = 50.00% ;CHECK: edge l1 -> cold2 probability is 0x40000000 / 0x80000000 = 50.00%
;CHECK: edge r1 -> unreached probability is 0x00000000 / 0x80000000 = 0.00% ;CHECK: edge r1 -> unreached probability is 0x00000000 / 0x80000000 = 0.00%
;CHECK: edge r1 -> cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge r1 -> cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
entry: entry:
br i1 undef, label %l1, label %r1 br i1 %replace_undef_0, label %l1, label %r1
l1: l1:
br i1 undef, label %cold, label %cold2 br i1 %replace_undef_1, label %cold, label %cold2
r1: r1:
br i1 undef, label %unreached, label %cold br i1 %replace_undef_2, label %unreached, label %cold
unreached: unreached:
unreachable unreachable
cold: cold:
call void @bar() call void @bar()
ret void ret void
cold2: cold2:
call void @bar() call void @bar()
ret void ret void
} }
; Both edges of 'r1' leads to 'unreachable' blocks while one edge of 'l1' leads to ; Both edges of 'r1' leads to 'unreachable' blocks while one edge of 'l1' leads to
; 'cold' block. Ensure that path leading to 'cold' block is preferred. ; 'cold' block. Ensure that path leading to 'cold' block is preferred.
define void @test3(i32 %0) { define void @test3(i32 %0, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
;CHECK: edge entry -> l1 probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge entry -> l1 probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
;CHECK: edge entry -> r1 probability is 0x00000000 / 0x80000000 = 0.00% ;CHECK: edge entry -> r1 probability is 0x00000000 / 0x80000000 = 0.00%
;CHECK: edge l1 -> cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge l1 -> cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
;CHECK: edge l1 -> unreached probability is 0x00000000 / 0x80000000 = 0.00% ;CHECK: edge l1 -> unreached probability is 0x00000000 / 0x80000000 = 0.00%
;CHECK: edge r1 -> unreached probability is 0x40000000 / 0x80000000 = 50.00% ;CHECK: edge r1 -> unreached probability is 0x40000000 / 0x80000000 = 50.00%
;CHECK: edge r1 -> unreached2 probability is 0x40000000 / 0x80000000 = 50.00% ;CHECK: edge r1 -> unreached2 probability is 0x40000000 / 0x80000000 = 50.00%
entry: entry:
br i1 undef, label %l1, label %r1 br i1 %replace_undef_0, label %l1, label %r1
l1: l1:
br i1 undef, label %cold, label %unreached br i1 %replace_undef_1, label %cold, label %unreached
r1: r1:
br i1 undef, label %unreached, label %unreached2 br i1 %replace_undef_2, label %unreached, label %unreached2
unreached: unreached:
unreachable unreachable
unreached2: unreached2:
unreachable unreachable
cold: cold:
call void @bar() call void @bar()
ret void ret void
} }
; Left edge of 'entry' leads to 'cold' block while right edge is 'normal' continuation. ; Left edge of 'entry' leads to 'cold' block while right edge is 'normal' continuation.
; Check that we able to propagate 'cold' weight to 'entry' block. Also ensure ; Check that we able to propagate 'cold' weight to 'entry' block. Also ensure
; both edges from 'l1' are equally likely. ; both edges from 'l1' are equally likely.
define void @test4(i32 %0) { define void @test4(i32 %0, i1 %replace_undef_0, i1 %replace_undef_1) {
;CHECK: edge entry -> l1 probability is 0x078780e3 / 0x80000000 = 5.88% ;CHECK: edge entry -> l1 probability is 0x078780e3 / 0x80000000 = 5.88%
;CHECK: edge entry -> r1 probability is 0x78787f1d / 0x80000000 = 94.12% [HOT edge] ;CHECK: edge entry -> r1 probability is 0x78787f1d / 0x80000000 = 94.12% [HOT edge]
;CHECK: edge l1 -> l2 probability is 0x40000000 / 0x80000000 = 50.00% ;CHECK: edge l1 -> l2 probability is 0x40000000 / 0x80000000 = 50.00%
;CHECK: edge l1 -> r2 probability is 0x40000000 / 0x80000000 = 50.00% ;CHECK: edge l1 -> r2 probability is 0x40000000 / 0x80000000 = 50.00%
;CHECK: edge l2 -> to.cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge l2 -> to.cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
;CHECK: edge r2 -> to.cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge r2 -> to.cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
;CHECK: edge to.cold -> cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge to.cold -> cold probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
entry: entry:
br i1 undef, label %l1, label %r1 br i1 %replace_undef_0, label %l1, label %r1
l1: l1:
br i1 undef, label %l2, label %r2 br i1 %replace_undef_1, label %l2, label %r2
l2: l2:
br label %to.cold br label %to.cold
r2: r2:
br label %to.cold br label %to.cold
to.cold: to.cold:
br label %cold br label %cold
r1: r1:
ret void ret void
cold: cold:
call void @bar() call void @bar()
ret void ret void
} }
; Check that most likely path from 'entry' to 'l2' through 'r1' is preferred. ; Check that most likely path from 'entry' to 'l2' through 'r1' is preferred.
define void @test5(i32 %0) { define void @test5(i32 %0, i1 %replace_undef_0, i1 %replace_undef_1) {
;CHECK: edge entry -> cold probability is 0x078780e3 / 0x80000000 = 5.88% ;CHECK: edge entry -> cold probability is 0x078780e3 / 0x80000000 = 5.88%
;CHECK: edge entry -> r1 probability is 0x78787f1d / 0x80000000 = 94.12% [HOT edge] ;CHECK: edge entry -> r1 probability is 0x78787f1d / 0x80000000 = 94.12% [HOT edge]
;CHECK: edge cold -> l2 probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge cold -> l2 probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
;CHECK: edge r1 -> l2 probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge] ;CHECK: edge r1 -> l2 probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
;CHECK: edge r1 -> unreached probability is 0x00000000 / 0x80000000 = 0.00% ;CHECK: edge r1 -> unreached probability is 0x00000000 / 0x80000000 = 0.00%
entry: entry:
br i1 undef, label %cold, label %r1 br i1 %replace_undef_0, label %cold, label %r1
cold: cold:
call void @bar() call void @bar()
br label %l2 br label %l2
r1: r1:
br i1 undef, label %l2, label %unreached br i1 %replace_undef_1, label %l2, label %unreached
l2: l2:
ret void ret void
unreached: unreached:
unreachable unreachable
} }

llvm/test/Analysis/CostModel/AMDGPU/control-flow.ll

; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py ; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
; RUN: opt -passes="print<cost-model>" 2>&1 -disable-output -mtriple=amdgcn-unknown-amdhsa < %s | FileCheck --check-prefixes=ALL %s ; RUN: opt -passes="print<cost-model>" 2>&1 -disable-output -mtriple=amdgcn-unknown-amdhsa < %s | FileCheck --check-prefixes=ALL %s
; RUN: opt -passes="print<cost-model>" -cost-kind=code-size 2>&1 -disable-output -mtriple=amdgcn-unknown-amdhsa < %s | FileCheck --check-prefixes=ALL-SIZE %s ; RUN: opt -passes="print<cost-model>" -cost-kind=code-size 2>&1 -disable-output -mtriple=amdgcn-unknown-amdhsa < %s | FileCheck --check-prefixes=ALL-SIZE %s
; END. ; END.
define amdgpu_kernel void @test_br_cost(ptr addrspace(1) %vaddr, i32 %b) #0 { define amdgpu_kernel void @test_br_cost(ptr addrspace(1) %vaddr, i32 %b, i1 %replace_undef_0) #0 {
; ALL-LABEL: 'test_br_cost' ; ALL-LABEL: 'test_br_cost'
; ALL-NEXT: Cost Model: Found an estimated cost of 7 for instruction: br i1 undef, label %bb1, label %bb2
GroverkssUnsubmitted
Not Done
ReplyInline Actions

Why was this removed?

Groverkss: Why was this removed?
; ALL-NEXT: Cost Model: Found an estimated cost of 4 for instruction: br label %bb2 ; ALL-NEXT: Cost Model: Found an estimated cost of 4 for instruction: br label %bb2
; ALL-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %phi = phi i32 [ %b, %bb0 ], [ undef, %bb1 ] ; ALL-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %phi = phi i32 [ %b, %bb0 ], [ undef, %bb1 ]
; ALL-NEXT: Cost Model: Found an estimated cost of 10 for instruction: ret void ; ALL-NEXT: Cost Model: Found an estimated cost of 10 for instruction: ret void
; ;
; ALL-SIZE-LABEL: 'test_br_cost' ; ALL-SIZE-LABEL: 'test_br_cost'
; ALL-SIZE-NEXT: Cost Model: Found an estimated cost of 5 for instruction: br i1 undef, label %bb1, label %bb2
; ALL-SIZE-NEXT: Cost Model: Found an estimated cost of 1 for instruction: br label %bb2 ; ALL-SIZE-NEXT: Cost Model: Found an estimated cost of 1 for instruction: br label %bb2
; ALL-SIZE-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %phi = phi i32 [ %b, %bb0 ], [ undef, %bb1 ] ; ALL-SIZE-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %phi = phi i32 [ %b, %bb0 ], [ undef, %bb1 ]
; ALL-SIZE-NEXT: Cost Model: Found an estimated cost of 1 for instruction: ret void ; ALL-SIZE-NEXT: Cost Model: Found an estimated cost of 1 for instruction: ret void
; ;
bb0: bb0:
br i1 undef, label %bb1, label %bb2 br i1 %replace_undef_0, label %bb1, label %bb2
bb1: bb1:
br label %bb2 br label %bb2
bb2: bb2:
%phi = phi i32 [ %b, %bb0 ], [ undef, %bb1 ] %phi = phi i32 [ %b, %bb0 ], [ undef, %bb1 ]
ret void ret void
} }
Show All 35 Lines

llvm/test/Analysis/CostModel/SystemZ/intrinsic-cost-crash.ll

Show All 20 Lines
%"class.llvm::TypedTrackingMDRef.308.1760.9988.10472.10956.11440.11924.12408.12892.13376.13860.15312.15796.16280.17732.19184.21120.25960.26928.29348.29832.30316.30800.31284.31768.32252.32736.33704.36608.38060.41640" = type { %"class.llvm::TrackingMDRef.307.1759.9987.10471.10955.11439.11923.12407.12891.13375.13859.15311.15795.16279.17731.19183.21119.25959.26927.29347.29831.30315.30799.31283.31767.32251.32735.33703.36607.38059.41639" } %"class.llvm::TypedTrackingMDRef.308.1760.9988.10472.10956.11440.11924.12408.12892.13376.13860.15312.15796.16280.17732.19184.21120.25960.26928.29348.29832.30316.30800.31284.31768.32252.32736.33704.36608.38060.41640" = type { %"class.llvm::TrackingMDRef.307.1759.9987.10471.10955.11439.11923.12407.12891.13375.13859.15311.15795.16279.17731.19183.21119.25959.26927.29347.29831.30315.30799.31283.31767.32251.32735.33703.36607.38059.41639" }
%"class.llvm::TrackingMDRef.307.1759.9987.10471.10955.11439.11923.12407.12891.13375.13859.15311.15795.16279.17731.19183.21119.25959.26927.29347.29831.30315.30799.31283.31767.32251.32735.33703.36607.38059.41639" = type { ptr } %"class.llvm::TrackingMDRef.307.1759.9987.10471.10955.11439.11923.12407.12891.13375.13859.15311.15795.16279.17731.19183.21119.25959.26927.29347.29831.30315.30799.31283.31767.32251.32735.33703.36607.38059.41639" = type { ptr }
%"class.llvm::Metadata.306.1758.9986.10470.10954.11438.11922.12406.12890.13374.13858.15310.15794.16278.17730.19182.21118.25958.26926.29346.29830.30314.30798.31282.31766.32250.32734.33702.36606.38058.41638" = type { i8, i8, i16, i32 } %"class.llvm::Metadata.306.1758.9986.10470.10954.11438.11922.12406.12890.13374.13858.15310.15794.16278.17730.19182.21118.25958.26926.29346.29830.30314.30798.31282.31766.32250.32734.33702.36606.38058.41638" = type { i8, i8, i16, i32 }
; Function Attrs: argmemonly nounwind ; Function Attrs: argmemonly nounwind
declare void @llvm.lifetime.end(i64, ptr nocapture) #0 declare void @llvm.lifetime.end(i64, ptr nocapture) #0
; Function Attrs: nounwind ssp uwtable ; Function Attrs: nounwind ssp uwtable
define hidden void @fun(ptr %N) #1 align 2 { define hidden void @fun(ptr %N) #1 align 2 {
GroverkssUnsubmitted
Not Done
ReplyInline Actions

The function arguments were not changed here.

Groverkss: The function arguments were not changed here.
; CHECK: define ; CHECK: define
entry: entry:
%NumOperands.i = getelementptr inbounds %"class.llvm::SDNode.310.1762.9990.10474.10958.11442.11926.12410.12894.13378.13862.15314.15798.16282.17734.19186.21122.25962.26930.29350.29834.30318.30802.31286.31770.32254.32738.33706.36610.38062.41642", ptr %N, i64 0, i32 8 %NumOperands.i = getelementptr inbounds %"class.llvm::SDNode.310.1762.9990.10474.10958.11442.11926.12410.12894.13378.13862.15314.15798.16282.17734.19186.21122.25962.26930.29350.29834.30318.30802.31286.31770.32254.32738.33706.36610.38062.41642", ptr %N, i64 0, i32 8
%0 = load i16, ptr %NumOperands.i, align 8, !tbaa !1 %0 = load i16, ptr %NumOperands.i, align 8, !tbaa !1
br i1 undef, label %for.cond.cleanup, label %for.body.lr.ph br i1 %replace_undef_0, label %for.cond.cleanup, label %for.body.lr.ph
for.body.lr.ph: ; preds = %entry for.body.lr.ph: ; preds = %entry
%wide.trip.count192 = zext i16 %0 to i64 %wide.trip.count192 = zext i16 %0 to i64
br label %for.body br label %for.body
for.cond.cleanup: ; preds = %for.body, %entry for.cond.cleanup: ; preds = %for.body, %entry
ret void ret void
Show All 24 Lines

llvm/test/Analysis/CycleInfo/basic.ll

; RUN: opt < %s -disable-output -passes='print<cycles>' 2>&1 | FileCheck %s -check-prefix=CHECK ; RUN: opt < %s -disable-output -passes='print<cycles>' 2>&1 | FileCheck %s -check-prefix=CHECK
define void @empty() { define void @empty() {
; CHECK-LABEL: CycleInfo for function: empty ; CHECK-LABEL: CycleInfo for function: empty
; CHECK-NOT: depth ; CHECK-NOT: depth
ret void ret void
} }
define void @simple() { define void @simple( i1 %replace_undef_0) {
; CHECK-LABEL: CycleInfo for function: simple ; CHECK-LABEL: CycleInfo for function: simple
; CHECK: depth=1: entries(loop) ; CHECK: depth=1: entries(loop)
entry: entry:
br label %loop br label %loop
loop: loop:
br i1 undef, label %loop, label %exit br i1 %replace_undef_0, label %loop, label %exit
exit: exit:
ret void ret void
} }
define void @two_latches() { define void @two_latches( i1 %replace_undef_0, i1 %replace_undef_1) {
; CHECK-LABEL: CycleInfo for function: two_latches ; CHECK-LABEL: CycleInfo for function: two_latches
; CHECK: depth=1: entries(loop) loop_next ; CHECK: depth=1: entries(loop) loop_next
entry: entry:
br label %loop br label %loop
loop: loop:
br i1 undef, label %loop, label %loop_next br i1 %replace_undef_0, label %loop, label %loop_next
loop_next: loop_next:
br i1 undef, label %exit, label %loop br i1 %replace_undef_1, label %exit, label %loop
exit: exit:
ret void ret void
} }
define void @nested_simple() { define void @nested_simple( i1 %replace_undef_0, i1 %replace_undef_1) {
; CHECK-LABEL: CycleInfo for function: nested_simple ; CHECK-LABEL: CycleInfo for function: nested_simple
; CHECK: depth=1: entries(outer_header) outer_latch inner ; CHECK: depth=1: entries(outer_header) outer_latch inner
; CHECK: depth=2: entries(inner) ; CHECK: depth=2: entries(inner)
entry: entry:
br label %outer_header br label %outer_header
outer_header: outer_header:
br label %inner br label %inner
inner: inner:
br i1 undef, label %inner, label %outer_latch br i1 %replace_undef_0, label %inner, label %outer_latch
outer_latch: outer_latch:
br i1 undef, label %outer_header, label %exit br i1 %replace_undef_1, label %outer_header, label %exit
exit: exit:
ret void ret void
} }
define void @nested_outer_latch_in_inner_loop() { define void @nested_outer_latch_in_inner_loop( i1 %replace_undef_0, i1 %replace_undef_1) {
; CHECK-LABEL: CycleInfo for function: nested_outer_latch_in_inner_loop ; CHECK-LABEL: CycleInfo for function: nested_outer_latch_in_inner_loop
; CHECK: depth=1: entries(outer_header) inner_header inner_latch ; CHECK: depth=1: entries(outer_header) inner_header inner_latch
; CHECK: depth=2: entries(inner_header) inner_latch ; CHECK: depth=2: entries(inner_header) inner_latch
entry: entry:
br label %outer_header br label %outer_header
outer_header: outer_header:
br label %inner_header br label %inner_header
inner_header: inner_header:
br i1 undef, label %inner_latch, label %outer_header br i1 %replace_undef_0, label %inner_latch, label %outer_header
inner_latch: inner_latch:
br i1 undef, label %exit, label %inner_header br i1 %replace_undef_1, label %exit, label %inner_header
exit: exit:
ret void ret void
} }
define void @sibling_loops() { define void @sibling_loops( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
; CHECK-LABEL: CycleInfo for function: sibling_loops ; CHECK-LABEL: CycleInfo for function: sibling_loops
; CHECK-DAG: depth=1: entries(left) ; CHECK-DAG: depth=1: entries(left)
; CHECK-DAG: depth=1: entries(right) ; CHECK-DAG: depth=1: entries(right)
entry: entry:
br i1 undef, label %left, label %right br i1 %replace_undef_0, label %left, label %right
left: left:
br i1 undef, label %left, label %exit br i1 %replace_undef_1, label %left, label %exit
right: right:
br i1 undef, label %right, label %exit br i1 %replace_undef_2, label %right, label %exit
exit: exit:
ret void ret void
} }
define void @serial_loops() { define void @serial_loops( i1 %replace_undef_0, i1 %replace_undef_1) {
; CHECK-LABEL: CycleInfo for function: serial_loops ; CHECK-LABEL: CycleInfo for function: serial_loops
; CHECK-DAG: depth=1: entries(second) ; CHECK-DAG: depth=1: entries(second)
; CHECK-DAG: depth=1: entries(first) ; CHECK-DAG: depth=1: entries(first)
entry: entry:
br label %first br label %first
first: first:
br i1 undef, label %first, label %second br i1 %replace_undef_0, label %first, label %second
second: second:
br i1 undef, label %second, label %exit br i1 %replace_undef_1, label %second, label %exit
exit: exit:
ret void ret void
} }
define void @nested_sibling_loops() { define void @nested_sibling_loops( i1 %replace_undef_0) {
; CHECK-LABEL: CycleInfo for function: nested_sibling_loops ; CHECK-LABEL: CycleInfo for function: nested_sibling_loops
; CHECK: depth=1: entries(outer_header) left right ; CHECK: depth=1: entries(outer_header) left right
; CHECK-DAG: depth=2: entries(right) ; CHECK-DAG: depth=2: entries(right)
; CHECK-DAG: depth=2: entries(left) ; CHECK-DAG: depth=2: entries(left)
entry: entry:
br label %outer_header br label %outer_header
outer_header: outer_header:
br i1 undef, label %left, label %right br i1 %replace_undef_0, label %left, label %right
left: left:
switch i32 undef, label %exit [ i32 0, label %left switch i32 undef, label %exit [ i32 0, label %left
i32 1, label %outer_header ] i32 1, label %outer_header ]
right: right:
switch i32 undef, label %outer_header [ i32 0, label %exit switch i32 undef, label %outer_header [ i32 0, label %exit
i32 1, label %right ] i32 1, label %right ]
exit: exit:
ret void ret void
} }
define void @deeper_nest() { define void @deeper_nest( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
; CHECK-LABEL: CycleInfo for function: deeper_nest ; CHECK-LABEL: CycleInfo for function: deeper_nest
; CHECK: depth=1: entries(outer_header) outer_latch middle_header inner_header inner_latch ; CHECK: depth=1: entries(outer_header) outer_latch middle_header inner_header inner_latch
; CHECK: depth=2: entries(middle_header) inner_header inner_latch ; CHECK: depth=2: entries(middle_header) inner_header inner_latch
; CHECK: depth=3: entries(inner_header) inner_latch ; CHECK: depth=3: entries(inner_header) inner_latch
entry: entry:
br label %outer_header br label %outer_header
outer_header: outer_header:
br label %middle_header br label %middle_header
middle_header: middle_header:
br label %inner_header br label %inner_header
inner_header: inner_header:
br i1 undef, label %middle_header, label %inner_latch br i1 %replace_undef_0, label %middle_header, label %inner_latch
inner_latch: inner_latch:
br i1 undef, label %inner_header, label %outer_latch br i1 %replace_undef_1, label %inner_header, label %outer_latch
outer_latch: outer_latch:
br i1 undef, label %outer_header, label %exit br i1 %replace_undef_2, label %outer_header, label %exit
exit: exit:
ret void ret void
} }
define void @irreducible_basic() { define void @irreducible_basic( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
; CHECK-LABEL: CycleInfo for function: irreducible_basic ; CHECK-LABEL: CycleInfo for function: irreducible_basic
; CHECK: depth=1: entries(right left) ; CHECK: depth=1: entries(right left)
entry: entry:
br i1 undef, label %left, label %right br i1 %replace_undef_0, label %left, label %right
left: left:
br i1 undef, label %right, label %exit br i1 %replace_undef_1, label %right, label %exit
right: right:
br i1 undef, label %left, label %exit br i1 %replace_undef_2, label %left, label %exit
exit: exit:
ret void ret void
} }
define void @irreducible_mess() { define void @irreducible_mess( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
; CHECK-LABEL: CycleInfo for function: irreducible_mess ; CHECK-LABEL: CycleInfo for function: irreducible_mess
; CHECK: depth=1: entries(B A) D C ; CHECK: depth=1: entries(B A) D C
; CHECK: depth=2: entries(D C A) ; CHECK: depth=2: entries(D C A)
; CHECK: depth=3: entries(C A) ; CHECK: depth=3: entries(C A)
entry: entry:
br i1 undef, label %A, label %B br i1 %replace_undef_0, label %A, label %B
A: A:
br i1 undef, label %C, label %D br i1 %replace_undef_1, label %C, label %D
B: B:
br i1 undef, label %C, label %D br i1 %replace_undef_2, label %C, label %D
C: C:
switch i32 undef, label %A [ i32 0, label %D switch i32 undef, label %A [ i32 0, label %D
i32 1, label %exit ] i32 1, label %exit ]
D: D:
switch i32 undef, label %B [ i32 0, label %C switch i32 undef, label %B [ i32 0, label %C
i32 1, label %exit ] i32 1, label %exit ]
exit: exit:
ret void ret void
} }
define void @irreducible_into_simple_cycle() { define void @irreducible_into_simple_cycle( i1 %replace_undef_0, i1 %replace_undef_1) {
; CHECK-LABEL: CycleInfo for function: irreducible_into_simple_cycle ; CHECK-LABEL: CycleInfo for function: irreducible_into_simple_cycle
; CHECK: depth=1: entries(F C A) E D B ; CHECK: depth=1: entries(F C A) E D B
entry: entry:
switch i32 undef, label %A [ i32 0, label %C switch i32 undef, label %A [ i32 0, label %C
i32 1, label %F ] i32 1, label %F ]
A: A:
br label %B br label %B
B: B:
br label %C br label %C
C: C:
br label %D br label %D
D: D:
br i1 undef, label %E, label %exit br i1 %replace_undef_0, label %E, label %exit
E: E:
br label %F br label %F
F: F:
br i1 undef, label %A, label %exit br i1 %replace_undef_1, label %A, label %exit
exit: exit:
ret void ret void
} }
define void @irreducible_mountain_bug() { define void @irreducible_mountain_bug( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2, i1 %replace_undef_3, i1 %replace_undef_4, i1 %replace_undef_5, i1 %replace_undef_6, i1 %replace_undef_7, i1 %replace_undef_8, i1 %replace_undef_9, i1 %replace_undef_10, i1 %replace_undef_11, i1 %replace_undef_12, i1 %replace_undef_13) {
; CHECK-LABEL: CycleInfo for function: irreducible_mountain_bug ; CHECK-LABEL: CycleInfo for function: irreducible_mountain_bug
; CHECK: depth=1: entries(while.cond) ; CHECK: depth=1: entries(while.cond)
; CHECK: depth=2: entries(cond.end61 cond.true49) while.body63 while.cond47 ; CHECK: depth=2: entries(cond.end61 cond.true49) while.body63 while.cond47
; CHECK: depth=3: entries(while.body63 cond.true49) while.cond47 ; CHECK: depth=3: entries(while.body63 cond.true49) while.cond47
entry: entry:
br i1 undef, label %if.end, label %if.then br i1 %replace_undef_0, label %if.end, label %if.then
if.end: if.end:
br i1 undef, label %if.then7, label %if.else br i1 %replace_undef_1, label %if.then7, label %if.else
if.then7: if.then7:
br label %if.end16 br label %if.end16
if.else: if.else:
br label %if.end16 br label %if.end16
if.end16: if.end16:
br i1 undef, label %while.cond.preheader, label %if.then39 br i1 %replace_undef_2, label %while.cond.preheader, label %if.then39
while.cond.preheader: while.cond.preheader:
br label %while.cond br label %while.cond
while.cond: while.cond:
br i1 undef, label %cond.true49, label %lor.rhs br i1 %replace_undef_3, label %cond.true49, label %lor.rhs
cond.true49: cond.true49:
br i1 undef, label %if.then69, label %while.body63 br i1 %replace_undef_4, label %if.then69, label %while.body63
while.body63: while.body63:
br i1 undef, label %exit, label %while.cond47 br i1 %replace_undef_5, label %exit, label %while.cond47
while.cond47: while.cond47:
br i1 undef, label %cond.true49, label %cond.end61 br i1 %replace_undef_6, label %cond.true49, label %cond.end61
cond.end61: cond.end61:
br i1 undef, label %while.body63, label %while.cond br i1 %replace_undef_7, label %while.body63, label %while.cond
if.then69: if.then69:
br i1 undef, label %exit, label %while.cond br i1 %replace_undef_8, label %exit, label %while.cond
lor.rhs: lor.rhs:
br i1 undef, label %cond.end61, label %while.end76 br i1 %replace_undef_9, label %cond.end61, label %while.end76
while.end76: while.end76:
br label %exit br label %exit
if.then39: if.then39:
br i1 undef, label %exit, label %if.end.i145 br i1 %replace_undef_10, label %exit, label %if.end.i145
if.end.i145: if.end.i145:
br i1 undef, label %exit, label %if.end8.i149 br i1 %replace_undef_11, label %exit, label %if.end8.i149
if.end8.i149: if.end8.i149:
br label %exit br label %exit
if.then: if.then:
br i1 undef, label %exit, label %if.end.i br i1 %replace_undef_12, label %exit, label %if.end.i
if.end.i: if.end.i:
br i1 undef, label %exit, label %if.end8.i br i1 %replace_undef_13, label %exit, label %if.end8.i
if.end8.i: if.end8.i:
br label %exit br label %exit
exit: exit:
ret void ret void
} }

llvm/test/Analysis/Delinearization/type_mismatch.ll

; RUN: opt < %s -passes='print<delinearization>' -disable-output ; RUN: opt < %s -passes='print<delinearization>' -disable-output
; REQUIRES: asserts ; REQUIRES: asserts
; Test that SCEV divide code doesn't crash when attempting to create a SCEV ; Test that SCEV divide code doesn't crash when attempting to create a SCEV
; with operands of different types. In this case, the visitAddRecExpr ; with operands of different types. In this case, the visitAddRecExpr
; function tries to create an AddRec where the start and step are different ; function tries to create an AddRec where the start and step are different
; types. ; types.
target datalayout = "e-m:e-p:32:32-i64:64-a:0-v32:32-n16:32" target datalayout = "e-m:e-p:32:32-i64:64-a:0-v32:32-n16:32"
define fastcc void @test() { define fastcc void @test( i1 %replace_undef_0) {
entry: entry:
%0 = load i16, ptr undef, align 2 %0 = load i16, ptr undef, align 2
%conv21 = zext i16 %0 to i32 %conv21 = zext i16 %0 to i32
br label %for.cond7.preheader br label %for.cond7.preheader
for.cond7.preheader: for.cond7.preheader:
%p1.022 = phi ptr [ undef, %entry ], [ %add.ptr, %for.end ] %p1.022 = phi ptr [ undef, %entry ], [ %add.ptr, %for.end ]
br label %for.body11 br label %for.body11
for.body11: for.body11:
%arrayidx.phi = phi ptr [ %p1.022, %for.cond7.preheader ], [ undef, %for.body11 ] %arrayidx.phi = phi ptr [ %p1.022, %for.cond7.preheader ], [ undef, %for.body11 ]
store i8 undef, ptr %arrayidx.phi, align 1 store i8 undef, ptr %arrayidx.phi, align 1
br i1 undef, label %for.body11, label %for.end br i1 %replace_undef_0, label %for.body11, label %for.end
for.end: for.end:
%add.ptr = getelementptr inbounds i8, ptr %p1.022, i32 %conv21 %add.ptr = getelementptr inbounds i8, ptr %p1.022, i32 %conv21
br label %for.cond7.preheader br label %for.cond7.preheader
} }

llvm/test/Analysis/Delinearization/undef.ll

; RUN: opt < %s -passes='print<delinearization>' -disable-output ; RUN: opt < %s -passes='print<delinearization>' -disable-output
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-unknown-linux-gnu" target triple = "x86_64-unknown-linux-gnu"
define void @foo(ptr %Ey) { define void @foo(ptr %Ey, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2, i1 %replace_undef_3, i1 %replace_undef_4) {
entry: entry:
br i1 undef, label %for.cond55.preheader, label %for.end324 br i1 %replace_undef_0, label %for.cond55.preheader, label %for.end324
for.cond55.preheader: for.cond55.preheader:
%iz.069 = phi i64 [ %inc323, %for.inc322 ], [ 0, %entry ] %iz.069 = phi i64 [ %inc323, %for.inc322 ], [ 0, %entry ]
br i1 undef, label %for.cond58.preheader, label %for.inc322 br i1 %replace_undef_1, label %for.cond58.preheader, label %for.inc322
for.cond58.preheader: for.cond58.preheader:
%iy.067 = phi i64 [ %inc320, %for.end ], [ 0, %for.cond55.preheader ] %iy.067 = phi i64 [ %inc320, %for.end ], [ 0, %for.cond55.preheader ]
br i1 undef, label %for.body60, label %for.end br i1 %replace_undef_2, label %for.body60, label %for.end
for.body60: for.body60:
%ix.062 = phi i64 [ %inc, %for.body60 ], [ 0, %for.cond58.preheader ] %ix.062 = phi i64 [ %inc, %for.body60 ], [ 0, %for.cond58.preheader ]
%0 = mul i64 %iz.069, undef %0 = mul i64 %iz.069, undef
%tmp5 = add i64 %iy.067, %0 %tmp5 = add i64 %iy.067, %0
%tmp6 = mul i64 %tmp5, undef %tmp6 = mul i64 %tmp5, undef
%arrayidx69.sum = add i64 undef, %tmp6 %arrayidx69.sum = add i64 undef, %tmp6
%arrayidx70 = getelementptr inbounds double, ptr %Ey, i64 %arrayidx69.sum %arrayidx70 = getelementptr inbounds double, ptr %Ey, i64 %arrayidx69.sum
%1 = load double, ptr %arrayidx70, align 8 %1 = load double, ptr %arrayidx70, align 8
%inc = add nsw i64 %ix.062, 1 %inc = add nsw i64 %ix.062, 1
br i1 false, label %for.body60, label %for.end br i1 false, label %for.body60, label %for.end
for.end: for.end:
%inc320 = add nsw i64 %iy.067, 1 %inc320 = add nsw i64 %iy.067, 1
br i1 undef, label %for.cond58.preheader, label %for.inc322 br i1 %replace_undef_3, label %for.cond58.preheader, label %for.inc322
for.inc322: for.inc322:
%inc323 = add nsw i64 %iz.069, 1 %inc323 = add nsw i64 %iz.069, 1
br i1 undef, label %for.cond55.preheader, label %for.end324 br i1 %replace_undef_4, label %for.cond55.preheader, label %for.end324
for.end324: for.end324:
ret void ret void
} }

llvm/test/Analysis/DependenceAnalysis/MIVCheckConst.ll

Show All 23 Lines
%15 = type { [256 x %0], [256 x %0] } %15 = type { [256 x %0], [256 x %0] }
%16 = type { [128 x %0], [128 x %0] } %16 = type { [128 x %0], [128 x %0] }
%17 = type { [32 x %0], [32 x i32], [32 x i32], [32 x i32], [32 x i32], [2 x [8 x [32 x %0]]], [512 x %0], [512 x %0], [58 x i16] } %17 = type { [32 x %0], [32 x i32], [32 x i32], [32 x i32], [32 x i32], [2 x [8 x [32 x %0]]], [512 x %0], [512 x %0], [58 x i16] }
%18 = type { [512 x i8] } %18 = type { [512 x i8] }
%19 = type { [2048 x %0], [2560 x i16], %20, [512 x i32], [256 x i32], [512 x i8] } %19 = type { [2048 x %0], [2560 x i16], %20, [512 x i32], [256 x i32], [512 x i8] }
%20 = type { [768 x i32] } %20 = type { [768 x i32] }
%21 = type { [416 x i32] } %21 = type { [416 x i32] }
define void @test(ptr %A) #0 align 2 { define void @test(ptr %A, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2, i1 %replace_undef_3) #0 align 2 {
entry: entry:
%v1 = load i32, ptr undef, align 4 %v1 = load i32, ptr undef, align 4
br label %bb13 br label %bb13
bb13: bb13:
%v2 = phi i32 [ undef, %entry ], [ %v39, %bb38 ] %v2 = phi i32 [ undef, %entry ], [ %v39, %bb38 ]
br i1 undef, label %bb15, label %bb38 br i1 %replace_undef_0, label %bb15, label %bb38
bb15: bb15:
%v3 = mul nsw i32 %v2, undef %v3 = mul nsw i32 %v2, undef
br label %bb17 br label %bb17
bb17: bb17:
br i1 undef, label %bb21, label %bb37 br i1 %replace_undef_1, label %bb21, label %bb37
bb21: bb21:
%v22 = add nsw i32 undef, 1 %v22 = add nsw i32 undef, 1
%v23 = add i32 %v22, %v3 %v23 = add i32 %v22, %v3
%v24 = mul nsw i32 %v23, %v1 %v24 = mul nsw i32 %v23, %v1
%v25 = getelementptr inbounds %1, ptr %A, i32 0, i32 7, i32 1, i32 %v24 %v25 = getelementptr inbounds %1, ptr %A, i32 0, i32 7, i32 1, i32 %v24
%v27 = load <32 x i32>, ptr %v25, align 256 %v27 = load <32 x i32>, ptr %v25, align 256
%v28 = add i32 undef, %v3 %v28 = add i32 undef, %v3
%v29 = mul nsw i32 %v28, 32 %v29 = mul nsw i32 %v28, 32
%v30 = getelementptr inbounds %1, ptr %A, i32 0, i32 7, i32 14, i32 %v29 %v30 = getelementptr inbounds %1, ptr %A, i32 0, i32 7, i32 14, i32 %v29
%v32 = load <32 x i32>, ptr %v30, align 128 %v32 = load <32 x i32>, ptr %v30, align 128
br i1 undef, label %bb21, label %bb37 br i1 %replace_undef_2, label %bb21, label %bb37
bb37: bb37:
br i1 undef, label %bb17, label %bb38 br i1 %replace_undef_3, label %bb17, label %bb38
bb38: bb38:
%v39 = add nsw i32 %v2, 1 %v39 = add nsw i32 %v2, 1
br label %bb13 br label %bb13
bb40: bb40:
ret void ret void
} }
attributes #0 = { "less-precise-fpmad"="false" "frame-pointer"="all" "no-infs-fp-math"="false" "no-nans-fp-math"="false" "stack-protector-buffer-size"="8" "unsafe-fp-math"="false" "use-soft-float"="false" } attributes #0 = { "less-precise-fpmad"="false" "frame-pointer"="all" "no-infs-fp-math"="false" "no-nans-fp-math"="false" "stack-protector-buffer-size"="8" "unsafe-fp-math"="false" "use-soft-float"="false" }

llvm/test/Analysis/DependenceAnalysis/NonAffineExpr.ll

; RUN: opt < %s -disable-output "-passes=print<da>" -aa-pipeline=basic-aa 2>&1 ; RUN: opt < %s -disable-output "-passes=print<da>" -aa-pipeline=basic-aa 2>&1
; ;
; CHECK: da analyze - consistent input [S S]! ; CHECK: da analyze - consistent input [S S]!
; CHECK: da analyze - confused! ; CHECK: da analyze - confused!
; CHECK: da analyze - input [* *]! ; CHECK: da analyze - input [* *]!
; ;
target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-a:0:32-n8:16:32-S64" target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-a:0:32-n8:16:32-S64"
target triple = "thumbv7--linux-gnueabi" target triple = "thumbv7--linux-gnueabi"
define void @f(ptr %a, i32 %n) align 2 { define void @f(ptr %a, i32 %n, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) align 2 {
for.preheader: for.preheader:
%t.0 = ashr exact i32 %n, 3 %t.0 = ashr exact i32 %n, 3
br label %for.body.1 br label %for.body.1
for.body.1: for.body.1:
%i.1 = phi i32 [ %t.5, %for.inc ], [ 0, %for.preheader ] %i.1 = phi i32 [ %t.5, %for.inc ], [ 0, %for.preheader ]
%i.2 = phi i32 [ %i.5, %for.inc ], [ %t.0, %for.preheader ] %i.2 = phi i32 [ %i.5, %for.inc ], [ %t.0, %for.preheader ]
br i1 undef, label %for.inc, label %for.body.2 br i1 %replace_undef_0, label %for.inc, label %for.body.2
for.body.2: for.body.2:
%i.3 = phi i32 [ %t.1, %for.body.2 ], [ %i.1, %for.body.1 ] %i.3 = phi i32 [ %t.1, %for.body.2 ], [ %i.1, %for.body.1 ]
%t.1 = add i32 %i.3, 1 %t.1 = add i32 %i.3, 1
%t.2 = load ptr, ptr %a, align 4 %t.2 = load ptr, ptr %a, align 4
%t.3 = getelementptr inbounds i32, ptr %t.2, i32 %i.3 %t.3 = getelementptr inbounds i32, ptr %t.2, i32 %i.3
%t.4 = load i32, ptr %t.3, align 4 %t.4 = load i32, ptr %t.3, align 4
br i1 undef, label %for.inc, label %for.body.2 br i1 %replace_undef_1, label %for.inc, label %for.body.2
for.inc: for.inc:
%i.4 = phi i32 [ %i.2, %for.body.1 ], [ %i.2, %for.body.2 ] %i.4 = phi i32 [ %i.2, %for.body.1 ], [ %i.2, %for.body.2 ]
%t.5 = add i32 %i.1, %i.4 %t.5 = add i32 %i.1, %i.4
%i.5 = add i32 %i.2, -1 %i.5 = add i32 %i.2, -1
br i1 undef, label %for.exit, label %for.body.1 br i1 %replace_undef_2, label %for.exit, label %for.body.1
for.exit: for.exit:
ret void ret void
} }

llvm/test/Analysis/DivergenceAnalysis/AMDGPU/join-at-loop-heart.ll

; RUN: opt -mtriple amdgcn-unknown-amdhsa -passes='print<divergence>' -disable-output %s 2>&1 | FileCheck %s ; RUN: opt -mtriple amdgcn-unknown-amdhsa -passes='print<divergence>' -disable-output %s 2>&1 | FileCheck %s
; RUN: opt -mtriple amdgcn-unknown-amdhsa -passes='print<uniformity>' -disable-output %s 2>&1 | FileCheck %s ; RUN: opt -mtriple amdgcn-unknown-amdhsa -passes='print<uniformity>' -disable-output %s 2>&1 | FileCheck %s
; CHECK: DIVERGENT: %phi.h = phi i32 [ 0, %entry ], [ %inc, %C ], [ %inc, %D ], [ %inc, %E ] ; CHECK: DIVERGENT: %phi.h = phi i32 [ 0, %entry ], [ %inc, %C ], [ %inc, %D ], [ %inc, %E ]
; CHECK: DIVERGENT: %tid = call i32 @llvm.amdgcn.workitem.id.x() ; CHECK: DIVERGENT: %tid = call i32 @llvm.amdgcn.workitem.id.x()
; CHECK: DIVERGENT: %div.cond = icmp slt i32 %tid, 0 ; CHECK: DIVERGENT: %div.cond = icmp slt i32 %tid, 0
; CHECK: DIVERGENT: %inc = add i32 %phi.h, 1 ; CHECK: DIVERGENT: %inc = add i32 %phi.h, 1
; CHECK: DIVERGENT: br i1 %div.cond, label %C, label %D ; CHECK: DIVERGENT: br i1 %div.cond, label %C, label %D
define void @nested_loop_extension() { define void @nested_loop_extension( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
entry: entry:
%anchor = call token @llvm.experimental.convergence.anchor() %anchor = call token @llvm.experimental.convergence.anchor()
br label %A br label %A
A: A:
%phi.h = phi i32 [ 0, %entry ], [ %inc, %C ], [ %inc, %D ], [ %inc, %E ] %phi.h = phi i32 [ 0, %entry ], [ %inc, %C ], [ %inc, %D ], [ %inc, %E ]
br label %B br label %B
B: B:
%tid = call i32 @llvm.amdgcn.workitem.id.x() %tid = call i32 @llvm.amdgcn.workitem.id.x()
%div.cond = icmp slt i32 %tid, 0 %div.cond = icmp slt i32 %tid, 0
%inc = add i32 %phi.h, 1 %inc = add i32 %phi.h, 1
br i1 %div.cond, label %C, label %D br i1 %div.cond, label %C, label %D
C: C:
br i1 undef, label %A, label %E br i1 %replace_undef_0, label %A, label %E
D: D:
br i1 undef, label %A, label %E br i1 %replace_undef_1, label %A, label %E
E: E:
%b = call token @llvm.experimental.convergence.loop() [ "convergencectrl"(token %anchor) ] %b = call token @llvm.experimental.convergence.loop() [ "convergencectrl"(token %anchor) ]
br i1 undef, label %A, label %F br i1 %replace_undef_2, label %A, label %F
F: F:
ret void ret void
} }
declare i32 @llvm.amdgcn.workitem.id.x() #0 declare i32 @llvm.amdgcn.workitem.id.x() #0
declare token @llvm.experimental.convergence.anchor() declare token @llvm.experimental.convergence.anchor()
declare token @llvm.experimental.convergence.loop() declare token @llvm.experimental.convergence.loop()
attributes #0 = { nounwind readnone } attributes #0 = { nounwind readnone }

llvm/test/Analysis/Dominators/basic.ll

; RUN: opt < %s -disable-output -passes='print<domtree>' 2>&1 | FileCheck %s ; RUN: opt < %s -disable-output -passes='print<domtree>' 2>&1 | FileCheck %s
define void @test1() { define void @test1( i1 %replace_undef_0, i1 %replace_undef_1) {
; CHECK-LABEL: DominatorTree for function: test1 ; CHECK-LABEL: DominatorTree for function: test1
; CHECK: [1] %entry ; CHECK: [1] %entry
; CHECK-NEXT: [2] %a ; CHECK-NEXT: [2] %a
; CHECK-NEXT: [2] %c ; CHECK-NEXT: [2] %c
; CHECK-NEXT: [3] %d ; CHECK-NEXT: [3] %d
; CHECK-NEXT: [3] %e ; CHECK-NEXT: [3] %e
; CHECK-NEXT: [2] %b ; CHECK-NEXT: [2] %b
entry: entry:
br i1 undef, label %a, label %b br i1 %replace_undef_0, label %a, label %b
a: a:
br label %c br label %c
b: b:
br label %c br label %c
c: c:
br i1 undef, label %d, label %e br i1 %replace_undef_1, label %d, label %e
d: d:
ret void ret void
e: e:
ret void ret void
} }
define void @test2() { define void @test2( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
; CHECK-LABEL: DominatorTree for function: test2 ; CHECK-LABEL: DominatorTree for function: test2
; CHECK: [1] %entry ; CHECK: [1] %entry
; CHECK-NEXT: [2] %a ; CHECK-NEXT: [2] %a
; CHECK-NEXT: [3] %b ; CHECK-NEXT: [3] %b
; CHECK-NEXT: [4] %c ; CHECK-NEXT: [4] %c
; CHECK-NEXT: [5] %d ; CHECK-NEXT: [5] %d
; CHECK-NEXT: [5] %ret ; CHECK-NEXT: [5] %ret
entry: entry:
br label %a br label %a
a: a:
br label %b br label %b
b: b:
br i1 undef, label %a, label %c br i1 %replace_undef_0, label %a, label %c
c: c:
br i1 undef, label %d, label %ret br i1 %replace_undef_1, label %d, label %ret
d: d:
br i1 undef, label %a, label %ret br i1 %replace_undef_2, label %a, label %ret
ret: ret:
ret void ret void
} }

llvm/test/Analysis/Dominators/print-dot-dom.ll

; RUN: opt %s -passes=dot-dom -disable-output ; RUN: opt %s -passes=dot-dom -disable-output
; RUN: FileCheck %s -input-file=dom.test1.dot -check-prefix=TEST1 ; RUN: FileCheck %s -input-file=dom.test1.dot -check-prefix=TEST1
; RUN: FileCheck %s -input-file=dom.test2.dot -check-prefix=TEST2 ; RUN: FileCheck %s -input-file=dom.test2.dot -check-prefix=TEST2
define void @test1() { define void @test1( i1 %replace_undef_0, i1 %replace_undef_1) {
; TEST1: digraph "Dominator tree for 'test1' function" ; TEST1: digraph "Dominator tree for 'test1' function"
; TEST1-NEXT: label="Dominator tree for 'test1' function" ; TEST1-NEXT: label="Dominator tree for 'test1' function"
; TEST1: Node0x[[EntryID:.*]] [shape=record,label="{entry: ; TEST1: Node0x[[EntryID:.*]] [shape=record,label="{entry:
; TEST1-NEXT: Node0x[[EntryID]] -> Node0x[[A_ID:.*]]; ; TEST1-NEXT: Node0x[[EntryID]] -> Node0x[[A_ID:.*]];
; TEST1-NEXT: Node0x[[EntryID]] -> Node0x[[C_ID:.*]]; ; TEST1-NEXT: Node0x[[EntryID]] -> Node0x[[C_ID:.*]];
; TEST1-NEXT: Node0x[[EntryID]] -> Node0x[[B_ID:.*]]; ; TEST1-NEXT: Node0x[[EntryID]] -> Node0x[[B_ID:.*]];
; TEST1-NEXT: Node0x[[A_ID]] [shape=record,label="{a: ; TEST1-NEXT: Node0x[[A_ID]] [shape=record,label="{a:
; TEST1-NEXT: Node0x[[C_ID]] [shape=record,label="{c: ; TEST1-NEXT: Node0x[[C_ID]] [shape=record,label="{c:
; TEST1-NEXT: Node0x[[C_ID]] -> Node0x[[D_ID:.*]]; ; TEST1-NEXT: Node0x[[C_ID]] -> Node0x[[D_ID:.*]];
; TEST1-NEXT: Node0x[[C_ID]] -> Node0x[[E_ID:.*]]; ; TEST1-NEXT: Node0x[[C_ID]] -> Node0x[[E_ID:.*]];
; TEST1-NEXT: Node0x[[D_ID]] [shape=record,label="{d: ; TEST1-NEXT: Node0x[[D_ID]] [shape=record,label="{d:
; TEST1-NEXT: Node0x[[E_ID]] [shape=record,label="{e: ; TEST1-NEXT: Node0x[[E_ID]] [shape=record,label="{e:
; TEST1-NEXT: Node0x[[B_ID]] [shape=record,label="{b: ; TEST1-NEXT: Node0x[[B_ID]] [shape=record,label="{b:
entry: entry:
br i1 undef, label %a, label %b br i1 %replace_undef_0, label %a, label %b
a: a:
br label %c br label %c
b: b:
br label %c br label %c
c: c:
br i1 undef, label %d, label %e br i1 %replace_undef_1, label %d, label %e
d: d:
ret void ret void
e: e:
ret void ret void
} }
define void @test2() { define void @test2( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
; TEST2: digraph "Dominator tree for 'test2' function" ; TEST2: digraph "Dominator tree for 'test2' function"
; TEST2-NEXT: label="Dominator tree for 'test2' function" ; TEST2-NEXT: label="Dominator tree for 'test2' function"
; TEST2: Node0x[[EntryID:.*]] [shape=record,label="{entry: ; TEST2: Node0x[[EntryID:.*]] [shape=record,label="{entry:
; TEST2-NEXT: Node0x[[EntryID]] -> Node0x[[A_ID:.*]]; ; TEST2-NEXT: Node0x[[EntryID]] -> Node0x[[A_ID:.*]];
; TEST2-NEXT: Node0x[[A_ID]] [shape=record,label="{a: ; TEST2-NEXT: Node0x[[A_ID]] [shape=record,label="{a:
; TEST2-NEXT: Node0x[[A_ID]] -> Node0x[[B_ID:.*]]; ; TEST2-NEXT: Node0x[[A_ID]] -> Node0x[[B_ID:.*]];
; TEST2-NEXT: Node0x[[B_ID]] [shape=record,label="{b: ; TEST2-NEXT: Node0x[[B_ID]] [shape=record,label="{b:
; TEST2-NEXT: Node0x[[B_ID]] -> Node0x[[C_ID:.*]]; ; TEST2-NEXT: Node0x[[B_ID]] -> Node0x[[C_ID:.*]];
; TEST2-NEXT: Node0x[[C_ID]] [shape=record,label="{c: ; TEST2-NEXT: Node0x[[C_ID]] [shape=record,label="{c:
; TEST2-NEXT: Node0x[[C_ID]] -> Node0x[[D_ID:.*]]; ; TEST2-NEXT: Node0x[[C_ID]] -> Node0x[[D_ID:.*]];
; TEST2-NEXT: Node0x[[C_ID]] -> Node0x[[E_ID:.*]]; ; TEST2-NEXT: Node0x[[C_ID]] -> Node0x[[E_ID:.*]];
; TEST2-NEXT: Node0x[[D_ID]] [shape=record,label="{d: ; TEST2-NEXT: Node0x[[D_ID]] [shape=record,label="{d:
; TEST2-NEXT: Node0x[[E_ID]] [shape=record,label="{e: ; TEST2-NEXT: Node0x[[E_ID]] [shape=record,label="{e:
entry: entry:
br label %a br label %a
a: a:
br label %b br label %b
b: b:
br i1 undef, label %a, label %c br i1 %replace_undef_0, label %a, label %c
c: c:
br i1 undef, label %d, label %e br i1 %replace_undef_1, label %d, label %e
d: d:
br i1 undef, label %a, label %e br i1 %replace_undef_2, label %a, label %e
e: e:
ret void ret void
} }

llvm/test/Analysis/MemorySSA/cyclicphi.ll

; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s ; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s
%struct.hoge = type { i32, %struct.widget } %struct.hoge = type { i32, %struct.widget }
%struct.widget = type { i64 } %struct.widget = type { i64 }
define hidden void @quux(ptr %f) align 2 { define hidden void @quux(ptr %f, i1 %replace_undef_0) align 2 {
%tmp = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1, i32 0 %tmp = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1, i32 0
%tmp24 = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1 %tmp24 = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1
br label %bb26 br label %bb26
bb26: ; preds = %bb77, %0 bb26: ; preds = %bb77, %0
; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2}) ; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2})
; CHECK-NEXT: br i1 undef, label %bb68, label %bb77 br i1 %replace_undef_0, label %bb68, label %bb77
br i1 undef, label %bb68, label %bb77
bb68: ; preds = %bb26 bb68: ; preds = %bb26
; CHECK: MemoryUse(liveOnEntry) ; CHECK: MemoryUse(liveOnEntry)
; CHECK-NEXT: %tmp69 = load i64, ptr null, align 8 ; CHECK-NEXT: %tmp69 = load i64, ptr null, align 8
%tmp69 = load i64, ptr null, align 8 %tmp69 = load i64, ptr null, align 8
; CHECK: 1 = MemoryDef(3) ; CHECK: 1 = MemoryDef(3)
; CHECK-NEXT: store i64 %tmp69, ptr %tmp, align 8 ; CHECK-NEXT: store i64 %tmp69, ptr %tmp, align 8
store i64 %tmp69, ptr %tmp, align 8 store i64 %tmp69, ptr %tmp, align 8
br label %bb77 br label %bb77
bb77: ; preds = %bb68, %bb26 bb77: ; preds = %bb68, %bb26
; CHECK: 2 = MemoryPhi({bb26,3},{bb68,1}) ; CHECK: 2 = MemoryPhi({bb26,3},{bb68,1})
; CHECK: MemoryUse(2) ; CHECK: MemoryUse(2)
; CHECK-NEXT: %tmp78 = load ptr, ptr %tmp24, align 8 ; CHECK-NEXT: %tmp78 = load ptr, ptr %tmp24, align 8
%tmp78 = load ptr, ptr %tmp24, align 8 %tmp78 = load ptr, ptr %tmp24, align 8
%tmp79 = getelementptr inbounds i64, ptr %tmp78, i64 undef %tmp79 = getelementptr inbounds i64, ptr %tmp78, i64 undef
br label %bb26 br label %bb26
} }
define hidden void @quux_no_null_opt(ptr %f) align 2 #0 { define hidden void @quux_no_null_opt(ptr %f, i1 %replace_undef_0) align 2 #0 {
; CHECK-LABEL: quux_no_null_opt( ; CHECK-LABEL: quux_no_null_opt(
%tmp = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1, i32 0 %tmp = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1, i32 0
%tmp24 = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1 %tmp24 = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1
br label %bb26 br label %bb26
bb26: ; preds = %bb77, %0 bb26: ; preds = %bb77, %0
; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2}) ; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2})
; CHECK-NEXT: br i1 undef, label %bb68, label %bb77 br i1 %replace_undef_0, label %bb68, label %bb77
br i1 undef, label %bb68, label %bb77
bb68: ; preds = %bb26 bb68: ; preds = %bb26
; CHECK: MemoryUse(3) ; CHECK: MemoryUse(3)
; CHECK-NEXT: %tmp69 = load i64, ptr null, align 8 ; CHECK-NEXT: %tmp69 = load i64, ptr null, align 8
%tmp69 = load i64, ptr null, align 8 %tmp69 = load i64, ptr null, align 8
; CHECK: 1 = MemoryDef(3) ; CHECK: 1 = MemoryDef(3)
; CHECK-NEXT: store i64 %tmp69, ptr %tmp, align 8 ; CHECK-NEXT: store i64 %tmp69, ptr %tmp, align 8
store i64 %tmp69, ptr %tmp, align 8 store i64 %tmp69, ptr %tmp, align 8
br label %bb77 br label %bb77
bb77: ; preds = %bb68, %bb26 bb77: ; preds = %bb68, %bb26
; CHECK: 2 = MemoryPhi({bb26,3},{bb68,1}) ; CHECK: 2 = MemoryPhi({bb26,3},{bb68,1})
; CHECK: MemoryUse(2) ; CHECK: MemoryUse(2)
; CHECK-NEXT: %tmp78 = load ptr, ptr %tmp24, align 8 ; CHECK-NEXT: %tmp78 = load ptr, ptr %tmp24, align 8
%tmp78 = load ptr, ptr %tmp24, align 8 %tmp78 = load ptr, ptr %tmp24, align 8
%tmp79 = getelementptr inbounds i64, ptr %tmp78, i64 undef %tmp79 = getelementptr inbounds i64, ptr %tmp78, i64 undef
br label %bb26 br label %bb26
} }
; CHECK-LABEL: define void @quux_skip ; CHECK-LABEL: define void @quux_skip
define void @quux_skip(ptr noalias %f, ptr noalias %g) align 2 { define void @quux_skip(ptr noalias %f, ptr noalias %g, i1 %replace_undef_0) align 2 {
%tmp = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1, i32 0 %tmp = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1, i32 0
%tmp24 = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1 %tmp24 = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1
br label %bb26 br label %bb26
bb26: ; preds = %bb77, %0 bb26: ; preds = %bb77, %0
; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2}) ; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2})
; CHECK-NEXT: br i1 undef, label %bb68, label %bb77 br i1 %replace_undef_0, label %bb68, label %bb77
br i1 undef, label %bb68, label %bb77
bb68: ; preds = %bb26 bb68: ; preds = %bb26
; CHECK: MemoryUse(3) ; CHECK: MemoryUse(3)
; CHECK-NEXT: %tmp69 = load i64, ptr %g, align 8 ; CHECK-NEXT: %tmp69 = load i64, ptr %g, align 8
%tmp69 = load i64, ptr %g, align 8 %tmp69 = load i64, ptr %g, align 8
; CHECK: 1 = MemoryDef(3) ; CHECK: 1 = MemoryDef(3)
; CHECK-NEXT: store i64 %tmp69, ptr %g, align 8 ; CHECK-NEXT: store i64 %tmp69, ptr %g, align 8
store i64 %tmp69, ptr %g, align 8 store i64 %tmp69, ptr %g, align 8
br label %bb77 br label %bb77
bb77: ; preds = %bb68, %bb26 bb77: ; preds = %bb68, %bb26
; CHECK: 2 = MemoryPhi({bb26,3},{bb68,1}) ; CHECK: 2 = MemoryPhi({bb26,3},{bb68,1})
; CHECK: MemoryUse(liveOnEntry) ; CHECK: MemoryUse(liveOnEntry)
; CHECK-NEXT: %tmp78 = load ptr, ptr %tmp24, align 8 ; CHECK-NEXT: %tmp78 = load ptr, ptr %tmp24, align 8
%tmp78 = load ptr, ptr %tmp24, align 8 %tmp78 = load ptr, ptr %tmp24, align 8
br label %bb26 br label %bb26
} }
; CHECK-LABEL: define void @quux_dominated ; CHECK-LABEL: define void @quux_dominated
define void @quux_dominated(ptr noalias %f, ptr noalias %g) align 2 { define void @quux_dominated(ptr noalias %f, ptr noalias %g, i1 %replace_undef_0) align 2 {
%tmp = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1, i32 0 %tmp = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1, i32 0
%tmp24 = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1 %tmp24 = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1
br label %bb26 br label %bb26
bb26: ; preds = %bb77, %0 bb26: ; preds = %bb77, %0
; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2}) ; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2})
; CHECK: MemoryUse(3) ; CHECK: MemoryUse(3)
; CHECK-NEXT: load ptr, ptr %tmp24, align 8 ; CHECK-NEXT: load ptr, ptr %tmp24, align 8
load ptr, ptr %tmp24, align 8 load ptr, ptr %tmp24, align 8
br i1 undef, label %bb68, label %bb77 br i1 %replace_undef_0, label %bb68, label %bb77
bb68: ; preds = %bb26 bb68: ; preds = %bb26
; CHECK: MemoryUse(3) ; CHECK: MemoryUse(3)
; CHECK-NEXT: %tmp69 = load i64, ptr %g, align 8 ; CHECK-NEXT: %tmp69 = load i64, ptr %g, align 8
%tmp69 = load i64, ptr %g, align 8 %tmp69 = load i64, ptr %g, align 8
; CHECK: 1 = MemoryDef(3) ; CHECK: 1 = MemoryDef(3)
; CHECK-NEXT: store i64 %tmp69, ptr %g, align 8 ; CHECK-NEXT: store i64 %tmp69, ptr %g, align 8
store i64 %tmp69, ptr %g, align 8 store i64 %tmp69, ptr %g, align 8
br label %bb77 br label %bb77
bb77: ; preds = %bb68, %bb26 bb77: ; preds = %bb68, %bb26
; CHECK: 4 = MemoryPhi({bb26,3},{bb68,1}) ; CHECK: 4 = MemoryPhi({bb26,3},{bb68,1})
; CHECK: 2 = MemoryDef(4) ; CHECK: 2 = MemoryDef(4)
; CHECK-NEXT: store ptr null, ptr %tmp24, align 8 ; CHECK-NEXT: store ptr null, ptr %tmp24, align 8
store ptr null, ptr %tmp24, align 8 store ptr null, ptr %tmp24, align 8
br label %bb26 br label %bb26
} }
; CHECK-LABEL: define void @quux_nodominate ; CHECK-LABEL: define void @quux_nodominate
define void @quux_nodominate(ptr noalias %f, ptr noalias %g) align 2 { define void @quux_nodominate(ptr noalias %f, ptr noalias %g, i1 %replace_undef_0) align 2 {
%tmp = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1, i32 0 %tmp = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1, i32 0
%tmp24 = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1 %tmp24 = getelementptr inbounds %struct.hoge, ptr %f, i64 0, i32 1
br label %bb26 br label %bb26
bb26: ; preds = %bb77, %0 bb26: ; preds = %bb77, %0
; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2}) ; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2})
; CHECK: MemoryUse(liveOnEntry) ; CHECK: MemoryUse(liveOnEntry)
; CHECK-NEXT: load ptr, ptr %tmp24, align 8 ; CHECK-NEXT: load ptr, ptr %tmp24, align 8
load ptr, ptr %tmp24, align 8 load ptr, ptr %tmp24, align 8
br i1 undef, label %bb68, label %bb77 br i1 %replace_undef_0, label %bb68, label %bb77
bb68: ; preds = %bb26 bb68: ; preds = %bb26
; CHECK: MemoryUse(3) ; CHECK: MemoryUse(3)
; CHECK-NEXT: %tmp69 = load i64, ptr %g, align 8 ; CHECK-NEXT: %tmp69 = load i64, ptr %g, align 8
%tmp69 = load i64, ptr %g, align 8 %tmp69 = load i64, ptr %g, align 8
; CHECK: 1 = MemoryDef(3) ; CHECK: 1 = MemoryDef(3)
; CHECK-NEXT: store i64 %tmp69, ptr %g, align 8 ; CHECK-NEXT: store i64 %tmp69, ptr %g, align 8
store i64 %tmp69, ptr %g, align 8 store i64 %tmp69, ptr %g, align 8
Show All 9 Lines

llvm/test/Analysis/MemorySSA/debugvalue.ll

; RUN: opt -disable-basic-aa -passes=loop-rotate -verify-memoryssa -S %s | FileCheck %s ; RUN: opt -disable-basic-aa -passes=loop-rotate -verify-memoryssa -S %s | FileCheck %s
; REQUIRES: asserts ; REQUIRES: asserts
; CHECK-LABEL: @f_w4_i2 ; CHECK-LABEL: @f_w4_i2
define void @f_w4_i2() { define void @f_w4_i2( i1 %replace_undef_0) {
entry: entry:
br label %for.cond br label %for.cond
for.cond: ; preds = %for.body, %entry for.cond: ; preds = %for.body, %entry
%i.0 = phi i16 [ 0, %entry ], [ %inc, %for.body ] %i.0 = phi i16 [ 0, %entry ], [ %inc, %for.body ]
call void @llvm.dbg.value(metadata i16 %i.0, metadata !32, metadata !DIExpression()), !dbg !31 call void @llvm.dbg.value(metadata i16 %i.0, metadata !32, metadata !DIExpression()), !dbg !31
br i1 undef, label %for.body, label %for.cond.cleanup br i1 %replace_undef_0, label %for.body, label %for.cond.cleanup
for.cond.cleanup: ; preds = %for.cond for.cond.cleanup: ; preds = %for.cond
ret void ret void
for.body: ; preds = %for.cond for.body: ; preds = %for.cond
store i32 undef, ptr undef, align 1 store i32 undef, ptr undef, align 1
%inc = add i16 %i.0, 1 %inc = add i16 %i.0, 1
call void @llvm.dbg.value(metadata i16 %inc, metadata !32, metadata !DIExpression()), !dbg !31 call void @llvm.dbg.value(metadata i16 %inc, metadata !32, metadata !DIExpression()), !dbg !31
Show All 24 Lines

llvm/test/Analysis/MemorySSA/debugvalue2.ll

; RUN: opt -passes='print<memoryssa>' -disable-output %s 2>&1 | FileCheck %s ; RUN: opt -passes='print<memoryssa>' -disable-output %s 2>&1 | FileCheck %s
; Note that the test crashes the MemorySSA verification when doing loop-rotate, ; Note that the test crashes the MemorySSA verification when doing loop-rotate,
; if debuginfo is modelled in MemorySSA, due to the fact that MemorySSA is not ; if debuginfo is modelled in MemorySSA, due to the fact that MemorySSA is not
; updated when adding/removing debuginfo intrinsics. ; updated when adding/removing debuginfo intrinsics.
target triple = "x86_64-unknown-linux-gnu" target triple = "x86_64-unknown-linux-gnu"
; CHECK-LABEL: @overflow_iter_var ; CHECK-LABEL: @overflow_iter_var
; CHECK-NOT: MemoryDef ; CHECK-NOT: MemoryDef
define void @overflow_iter_var() !dbg !11 { define void @overflow_iter_var( i1 %replace_undef_0) !dbg !11 {
entry: entry:
call void @llvm.dbg.value(metadata i16 0, metadata !16, metadata !DIExpression()), !dbg !18 call void @llvm.dbg.value(metadata i16 0, metadata !16, metadata !DIExpression()), !dbg !18
br label %for.cond br label %for.cond
for.cond: ; preds = %for.body, %entry for.cond: ; preds = %for.body, %entry
call void @llvm.dbg.value(metadata i16 0, metadata !16, metadata !DIExpression()), !dbg !18 call void @llvm.dbg.value(metadata i16 0, metadata !16, metadata !DIExpression()), !dbg !18
call void @llvm.dbg.value(metadata i16 undef, metadata !20, metadata !DIExpression()), !dbg !21 call void @llvm.dbg.value(metadata i16 undef, metadata !20, metadata !DIExpression()), !dbg !21
br i1 undef, label %for.end, label %for.body br i1 %replace_undef_0, label %for.end, label %for.body
for.body: ; preds = %for.cond for.body: ; preds = %for.cond
%0 = load i16, ptr undef, align 1 %0 = load i16, ptr undef, align 1
br label %for.cond br label %for.cond
for.end: ; preds = %for.cond for.end: ; preds = %for.cond
ret void ret void
} }
Show All 27 Lines

llvm/test/Analysis/MemorySSA/forward-unreachable.ll

; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s ; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s
target datalayout = "e-m:e-i8:8:32-i16:16:32-i64:64-i128:128-n32:64-S128" target datalayout = "e-m:e-i8:8:32-i16:16:32-i64:64-i128:128-n32:64-S128"
define void @test() { define void @test( i1 %replace_undef_0) {
entry: entry:
br i1 undef, label %split1, label %split2 br i1 %replace_undef_0, label %split1, label %split2
split1: split1:
store i16 undef, ptr undef, align 2 store i16 undef, ptr undef, align 2
br label %merge br label %merge
split2: split2:
br label %merge br label %merge
forwardunreachable: forwardunreachable:
br label %merge br label %merge
Show All 9 Lines

llvm/test/Analysis/MemorySSA/function-clobber.ll

Show All 23 Lines; CHECK-NEXT: %2 = load i32
%3 = add i32 %2, %1 %3 = add i32 %2, %1
ret i32 %3 ret i32 %3
} }
declare void @readEverything() readonly declare void @readEverything() readonly
declare void @clobberEverything() declare void @clobberEverything()
; CHECK-LABEL: define void @bar ; CHECK-LABEL: define void @bar
define void @bar() { define void @bar( i1 %replace_undef_0) {
; CHECK: 1 = MemoryDef(liveOnEntry) ; CHECK: 1 = MemoryDef(liveOnEntry)
; CHECK-NEXT: call void @clobberEverything() ; CHECK-NEXT: call void @clobberEverything()
call void @clobberEverything() call void @clobberEverything()
br i1 undef, label %if.end, label %if.then br i1 %replace_undef_0, label %if.end, label %if.then
if.then: if.then:
; CHECK: MemoryUse(1) ; CHECK: MemoryUse(1)
; CHECK-NEXT: call void @readEverything() ; CHECK-NEXT: call void @readEverything()
call void @readEverything() call void @readEverything()
; CHECK: 2 = MemoryDef(1) ; CHECK: 2 = MemoryDef(1)
; CHECK-NEXT: call void @clobberEverything() ; CHECK-NEXT: call void @clobberEverything()
call void @clobberEverything() call void @clobberEverything()
Show All 9 Lines

llvm/test/Analysis/MemorySSA/invariant-groups.ll

Show First 20 Lines • Show All 189 Lines • ▼ Show 20 Lines; CHECK-NEXT: %2 = load
%2 = load i32, ptr %0, align 4, !invariant.group !0 %2 = load i32, ptr %0, align 4, !invariant.group !0
br i1 %a, label %Ret, label %Loop.Body br i1 %a, label %Ret, label %Loop.Body
Ret: Ret:
ret i32 %2 ret i32 %2
} }
; CHECK-LABEL: define {{.*}} @loop2( ; CHECK-LABEL: define {{.*}} @loop2(
define i8 @loop2(ptr %p) { define i8 @loop2(ptr %p, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
entry: entry:
; CHECK: 1 = MemoryDef(liveOnEntry) ; CHECK: 1 = MemoryDef(liveOnEntry)
; CHECK-NEXT: store i8 ; CHECK-NEXT: store i8
store i8 4, ptr %p, !invariant.group !0 store i8 4, ptr %p, !invariant.group !0
; CHECK: 2 = MemoryDef(1) ; CHECK: 2 = MemoryDef(1)
; CHECK-NEXT: call void @clobber ; CHECK-NEXT: call void @clobber
call void @clobber8(ptr %p) call void @clobber8(ptr %p)
; CHECK: 3 = MemoryDef(2) ; CHECK: 3 = MemoryDef(2)
; CHECK-NEXT: %after = call ptr @llvm.launder.invariant.group.p0(ptr %p) ; CHECK-NEXT: %after = call ptr @llvm.launder.invariant.group.p0(ptr %p)
%after = call ptr @llvm.launder.invariant.group.p0(ptr %p) %after = call ptr @llvm.launder.invariant.group.p0(ptr %p)
br i1 undef, label %Loop.Body, label %Loop.End br i1 %replace_undef_0, label %Loop.Body, label %Loop.End
Loop.Body: Loop.Body:
; CHECK: MemoryUse(6) ; CHECK: MemoryUse(6)
; CHECK-NEXT: %0 = load i8 ; CHECK-NEXT: %0 = load i8
%0 = load i8, ptr %after, !invariant.group !0 %0 = load i8, ptr %after, !invariant.group !0
; CHECK: MemoryUse(6) {{.*}} clobbered by 1 ; CHECK: MemoryUse(6) {{.*}} clobbered by 1
; CHECK-NEXT: %1 = load i8 ; CHECK-NEXT: %1 = load i8
%1 = load i8, ptr %p, !invariant.group !0 %1 = load i8, ptr %p, !invariant.group !0
; CHECK: 4 = MemoryDef(6) ; CHECK: 4 = MemoryDef(6)
store i8 4, ptr %after, !invariant.group !0 store i8 4, ptr %after, !invariant.group !0
br i1 undef, label %Loop.End, label %Loop.Body br i1 %replace_undef_1, label %Loop.End, label %Loop.Body
Loop.End: Loop.End:
; CHECK: MemoryUse(5) ; CHECK: MemoryUse(5)
; CHECK-NEXT: %2 = load ; CHECK-NEXT: %2 = load
%2 = load i8, ptr %after, align 4, !invariant.group !0 %2 = load i8, ptr %after, align 4, !invariant.group !0
; CHECK: MemoryUse(5) {{.*}} clobbered by 1 ; CHECK: MemoryUse(5) {{.*}} clobbered by 1
; CHECK-NEXT: %3 = load ; CHECK-NEXT: %3 = load
%3 = load i8, ptr %p, align 4, !invariant.group !0 %3 = load i8, ptr %p, align 4, !invariant.group !0
br i1 undef, label %Ret, label %Loop.Body br i1 %replace_undef_2, label %Ret, label %Loop.Body
Ret: Ret:
ret i8 %3 ret i8 %3
} }
; CHECK-LABEL: define {{.*}} @loop3( ; CHECK-LABEL: define {{.*}} @loop3(
define i8 @loop3(ptr %p) { define i8 @loop3(ptr %p, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2, i1 %replace_undef_3) {
entry: entry:
; CHECK: 1 = MemoryDef(liveOnEntry) ; CHECK: 1 = MemoryDef(liveOnEntry)
; CHECK-NEXT: store i8 ; CHECK-NEXT: store i8
store i8 4, ptr %p, !invariant.group !0 store i8 4, ptr %p, !invariant.group !0
; CHECK: 2 = MemoryDef(1) ; CHECK: 2 = MemoryDef(1)
; CHECK-NEXT: call void @clobber ; CHECK-NEXT: call void @clobber
call void @clobber8(ptr %p) call void @clobber8(ptr %p)
; CHECK: 3 = MemoryDef(2) ; CHECK: 3 = MemoryDef(2)
; CHECK-NEXT: %after = call ptr @llvm.launder.invariant.group.p0(ptr %p) ; CHECK-NEXT: %after = call ptr @llvm.launder.invariant.group.p0(ptr %p)
%after = call ptr @llvm.launder.invariant.group.p0(ptr %p) %after = call ptr @llvm.launder.invariant.group.p0(ptr %p)
br i1 undef, label %Loop.Body, label %Loop.End br i1 %replace_undef_0, label %Loop.Body, label %Loop.End
Loop.Body: Loop.Body:
; CHECK: MemoryUse(8) ; CHECK: MemoryUse(8)
; CHECK-NEXT: %0 = load i8 ; CHECK-NEXT: %0 = load i8
%0 = load i8, ptr %after, !invariant.group !0 %0 = load i8, ptr %after, !invariant.group !0
; CHECK: 4 = MemoryDef(8) ; CHECK: 4 = MemoryDef(8)
; CHECK-NEXT: call void @clobber8 ; CHECK-NEXT: call void @clobber8
call void @clobber8(ptr %after) call void @clobber8(ptr %after)
; CHECK: MemoryUse(4) {{.*}} clobbered by 8 ; CHECK: MemoryUse(4) {{.*}} clobbered by 8
; CHECK-NEXT: %1 = load i8 ; CHECK-NEXT: %1 = load i8
%1 = load i8, ptr %after, !invariant.group !0 %1 = load i8, ptr %after, !invariant.group !0
br i1 undef, label %Loop.next, label %Loop.Body br i1 %replace_undef_1, label %Loop.next, label %Loop.Body
Loop.next: Loop.next:
; CHECK: 5 = MemoryDef(4) ; CHECK: 5 = MemoryDef(4)
; CHECK-NEXT: call void @clobber8 ; CHECK-NEXT: call void @clobber8
call void @clobber8(ptr %after) call void @clobber8(ptr %after)
; CHECK: MemoryUse(5) {{.*}} clobbered by 8 ; CHECK: MemoryUse(5) {{.*}} clobbered by 8
; CHECK-NEXT: %2 = load i8 ; CHECK-NEXT: %2 = load i8
%2 = load i8, ptr %after, !invariant.group !0 %2 = load i8, ptr %after, !invariant.group !0
br i1 undef, label %Loop.End, label %Loop.Body br i1 %replace_undef_2, label %Loop.End, label %Loop.Body
Loop.End: Loop.End:
; CHECK: MemoryUse(7) ; CHECK: MemoryUse(7)
; CHECK-NEXT: %3 = load ; CHECK-NEXT: %3 = load
%3 = load i8, ptr %after, align 4, !invariant.group !0 %3 = load i8, ptr %after, align 4, !invariant.group !0
; CHECK: 6 = MemoryDef(7) ; CHECK: 6 = MemoryDef(7)
; CHECK-NEXT: call void @clobber8 ; CHECK-NEXT: call void @clobber8
call void @clobber8(ptr %after) call void @clobber8(ptr %after)
; CHECK: MemoryUse(6) {{.*}} clobbered by 7 ; CHECK: MemoryUse(6) {{.*}} clobbered by 7
; CHECK-NEXT: %4 = load ; CHECK-NEXT: %4 = load
%4 = load i8, ptr %after, align 4, !invariant.group !0 %4 = load i8, ptr %after, align 4, !invariant.group !0
br i1 undef, label %Ret, label %Loop.Body br i1 %replace_undef_3, label %Ret, label %Loop.Body
Ret: Ret:
ret i8 %3 ret i8 %3
} }
; CHECK-LABEL: define {{.*}} @loop4( ; CHECK-LABEL: define {{.*}} @loop4(
define i8 @loop4(ptr %p) { define i8 @loop4(ptr %p, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
entry: entry:
; CHECK: 1 = MemoryDef(liveOnEntry) ; CHECK: 1 = MemoryDef(liveOnEntry)
; CHECK-NEXT: store i8 ; CHECK-NEXT: store i8
store i8 4, ptr %p, !invariant.group !0 store i8 4, ptr %p, !invariant.group !0
; CHECK: 2 = MemoryDef(1) ; CHECK: 2 = MemoryDef(1)
; CHECK-NEXT: call void @clobber ; CHECK-NEXT: call void @clobber
call void @clobber8(ptr %p) call void @clobber8(ptr %p)
; CHECK: 3 = MemoryDef(2) ; CHECK: 3 = MemoryDef(2)
; CHECK-NEXT: %after = call ptr @llvm.launder.invariant.group.p0(ptr %p) ; CHECK-NEXT: %after = call ptr @llvm.launder.invariant.group.p0(ptr %p)
%after = call ptr @llvm.launder.invariant.group.p0(ptr %p) %after = call ptr @llvm.launder.invariant.group.p0(ptr %p)
br i1 undef, label %Loop.Pre, label %Loop.End br i1 %replace_undef_0, label %Loop.Pre, label %Loop.End
Loop.Pre: Loop.Pre:
; CHECK: MemoryUse(2) ; CHECK: MemoryUse(2)
; CHECK-NEXT: %0 = load i8 ; CHECK-NEXT: %0 = load i8
%0 = load i8, ptr %after, !invariant.group !0 %0 = load i8, ptr %after, !invariant.group !0
br label %Loop.Body br label %Loop.Body
Loop.Body: Loop.Body:
; CHECK: MemoryUse(6) ; CHECK: MemoryUse(6)
; CHECK-NEXT: %1 = load i8 ; CHECK-NEXT: %1 = load i8
%1 = load i8, ptr %after, !invariant.group !0 %1 = load i8, ptr %after, !invariant.group !0
; CHECK: MemoryUse(6) {{.*}} clobbered by 1 ; CHECK: MemoryUse(6) {{.*}} clobbered by 1
; CHECK-NEXT: %2 = load i8 ; CHECK-NEXT: %2 = load i8
%2 = load i8, ptr %p, !invariant.group !0 %2 = load i8, ptr %p, !invariant.group !0
; CHECK: 4 = MemoryDef(6) ; CHECK: 4 = MemoryDef(6)
store i8 4, ptr %after, !invariant.group !0 store i8 4, ptr %after, !invariant.group !0
br i1 undef, label %Loop.End, label %Loop.Body br i1 %replace_undef_1, label %Loop.End, label %Loop.Body
Loop.End: Loop.End:
; CHECK: MemoryUse(5) ; CHECK: MemoryUse(5)
; CHECK-NEXT: %3 = load ; CHECK-NEXT: %3 = load
%3 = load i8, ptr %after, align 4, !invariant.group !0 %3 = load i8, ptr %after, align 4, !invariant.group !0
; CHECK: MemoryUse(5) {{.*}} clobbered by 1 ; CHECK: MemoryUse(5) {{.*}} clobbered by 1
; CHECK-NEXT: %4 = load ; CHECK-NEXT: %4 = load
%4 = load i8, ptr %p, align 4, !invariant.group !0 %4 = load i8, ptr %p, align 4, !invariant.group !0
br i1 undef, label %Ret, label %Loop.Body br i1 %replace_undef_2, label %Ret, label %Loop.Body
Ret: Ret:
ret i8 %3 ret i8 %3
} }
; In the future we would like to CSE barriers if there is no clobber between. ; In the future we would like to CSE barriers if there is no clobber between.
; CHECK-LABEL: define {{.*}} @optimizable( ; CHECK-LABEL: define {{.*}} @optimizable(
define i8 @optimizable() { define i8 @optimizable() {
▲ Show 20 Lines • Show All 64 Lines • Show Last 20 Lines

llvm/test/Analysis/MemorySSA/loop-rotate-disablebasicaa.ll

; RUN: opt -passes='print<memoryssa>' -disable-output %s 2>&1 | FileCheck %s ; RUN: opt -passes='print<memoryssa>' -disable-output %s 2>&1 | FileCheck %s
; Note: if @foo is modelled as a MemoryDef, this test will assert with -loop-rotate, due to MemorySSA not ; Note: if @foo is modelled as a MemoryDef, this test will assert with -loop-rotate, due to MemorySSA not
; being preserved when moving instructions that may not read from or write to memory. ; being preserved when moving instructions that may not read from or write to memory.
; CHECK-LABEL: @main ; CHECK-LABEL: @main
; CHECK-NOT: MemoryDef ; CHECK-NOT: MemoryDef
define void @main() { define void @main( i1 %replace_undef_0) {
entry: entry:
br label %for.cond120 br label %for.cond120
for.cond120: ; preds = %for.body127, %entry for.cond120: ; preds = %for.body127, %entry
call void @foo() call void @foo()
br i1 undef, label %for.body127, label %for.cond.cleanup126 br i1 %replace_undef_0, label %for.body127, label %for.cond.cleanup126
for.cond.cleanup126: ; preds = %for.cond120 for.cond.cleanup126: ; preds = %for.cond120
unreachable unreachable
for.body127: ; preds = %for.cond120 for.body127: ; preds = %for.cond120
%0 = load ptr, ptr undef, align 1 %0 = load ptr, ptr undef, align 1
br label %for.cond120 br label %for.cond120
} }
declare void @foo() readnone declare void @foo() readnone

llvm/test/Analysis/MemorySSA/loop-rotate-valuemap.ll

; RUN: opt -passes=loop-rotate %s -S | FileCheck %s ; RUN: opt -passes=loop-rotate %s -S | FileCheck %s
; REQUIRES: asserts ; REQUIRES: asserts
; Check that loop rotate keeps proper mapping between cloned instructions, ; Check that loop rotate keeps proper mapping between cloned instructions,
; otherwise, MemorySSA will assert. ; otherwise, MemorySSA will assert.
; CHECK-LABEL: @f ; CHECK-LABEL: @f
define void @f() { define void @f( i1 %replace_undef_0) {
entry: entry:
br label %for.body16 br label %for.body16
for.cond.cleanup15: ; preds = %for.body16 for.cond.cleanup15: ; preds = %for.body16
ret void ret void
for.body16: ; preds = %for.body16.for.body16_crit_edge, %entry for.body16: ; preds = %for.body16.for.body16_crit_edge, %entry
%call.i = tail call float @expf(float 0.000000e+00) #1 %call.i = tail call float @expf(float 0.000000e+00) #1
%0 = load ptr, ptr undef, align 8 %0 = load ptr, ptr undef, align 8
br i1 undef, label %for.cond.cleanup15, label %for.body16.for.body16_crit_edge br i1 %replace_undef_0, label %for.cond.cleanup15, label %for.body16.for.body16_crit_edge
for.body16.for.body16_crit_edge: ; preds = %for.body16 for.body16.for.body16_crit_edge: ; preds = %for.body16
%.pre = load float, ptr undef, align 8 %.pre = load float, ptr undef, align 8
br label %for.body16 br label %for.body16
} }
declare float @expf(float) declare float @expf(float)

llvm/test/Analysis/MemorySSA/phi-translation.ll

Show First 20 Lines • Show All 67 Lines • ▼ Show 20 Lines
; NOLIMIT-NEXT: load i8, ptr %local ; NOLIMIT-NEXT: load i8, ptr %local
; LIMIT: MemoryUse(6) ; LIMIT: MemoryUse(6)
; LIMIT-NEXT: load i8, ptr %local ; LIMIT-NEXT: load i8, ptr %local
load i8, ptr %local load i8, ptr %local
ret void ret void
} }
; CHECK-LABEL: define void @cross_phi ; CHECK-LABEL: define void @cross_phi
define void @cross_phi(ptr noalias %p1, ptr noalias %p2) { define void @cross_phi(ptr noalias %p1, ptr noalias %p2, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
; CHECK: 1 = MemoryDef(liveOnEntry) ; CHECK: 1 = MemoryDef(liveOnEntry)
; CHECK-NEXT: store i8 0, ptr %p1 ; CHECK-NEXT: store i8 0, ptr %p1
store i8 0, ptr %p1 store i8 0, ptr %p1
; NOLIMIT: MemoryUse(1) ; NOLIMIT: MemoryUse(1)
; NOLIMIT-NEXT: load i8, ptr %p1 ; NOLIMIT-NEXT: load i8, ptr %p1
; LIMIT: MemoryUse(1) ; LIMIT: MemoryUse(1)
; LIMIT-NEXT: load i8, ptr %p1 ; LIMIT-NEXT: load i8, ptr %p1
load i8, ptr %p1 load i8, ptr %p1
br i1 undef, label %a, label %b br i1 %replace_undef_0, label %a, label %b
a: a:
; CHECK: 2 = MemoryDef(1) ; CHECK: 2 = MemoryDef(1)
; CHECK-NEXT: store i8 0, ptr %p2 ; CHECK-NEXT: store i8 0, ptr %p2
store i8 0, ptr %p2 store i8 0, ptr %p2
br i1 undef, label %c, label %d br i1 %replace_undef_1, label %c, label %d
b: b:
; CHECK: 3 = MemoryDef(1) ; CHECK: 3 = MemoryDef(1)
; CHECK-NEXT: store i8 1, ptr %p2 ; CHECK-NEXT: store i8 1, ptr %p2
store i8 1, ptr %p2 store i8 1, ptr %p2
br i1 undef, label %c, label %d br i1 %replace_undef_2, label %c, label %d
c: c:
; CHECK: 6 = MemoryPhi({a,2},{b,3}) ; CHECK: 6 = MemoryPhi({a,2},{b,3})
; CHECK: 4 = MemoryDef(6) ; CHECK: 4 = MemoryDef(6)
; CHECK-NEXT: store i8 2, ptr %p2 ; CHECK-NEXT: store i8 2, ptr %p2
store i8 2, ptr %p2 store i8 2, ptr %p2
br label %e br label %e
Show All 10 Lines
; NOLIMIT-NEXT: load i8, ptr %p1 ; NOLIMIT-NEXT: load i8, ptr %p1
; LIMIT: MemoryUse(8) ; LIMIT: MemoryUse(8)
; LIMIT-NEXT: load i8, ptr %p1 ; LIMIT-NEXT: load i8, ptr %p1
load i8, ptr %p1 load i8, ptr %p1
ret void ret void
} }
; CHECK-LABEL: define void @looped ; CHECK-LABEL: define void @looped
define void @looped(ptr noalias %p1, ptr noalias %p2) { define void @looped(ptr noalias %p1, ptr noalias %p2, i1 %replace_undef_0, i1 %replace_undef_1) {
; CHECK: 1 = MemoryDef(liveOnEntry) ; CHECK: 1 = MemoryDef(liveOnEntry)
; CHECK-NEXT: store i8 0, ptr %p1 ; CHECK-NEXT: store i8 0, ptr %p1
store i8 0, ptr %p1 store i8 0, ptr %p1
br label %loop.1 br label %loop.1
loop.1: loop.1:
; CHECK: 6 = MemoryPhi({%0,1},{loop.3,4}) ; CHECK: 6 = MemoryPhi({%0,1},{loop.3,4})
; CHECK: 2 = MemoryDef(6) ; CHECK: 2 = MemoryDef(6)
; CHECK-NEXT: store i8 0, ptr %p2 ; CHECK-NEXT: store i8 0, ptr %p2
store i8 0, ptr %p2 store i8 0, ptr %p2
br i1 undef, label %loop.2, label %loop.3 br i1 %replace_undef_0, label %loop.2, label %loop.3
loop.2: loop.2:
; CHECK: 5 = MemoryPhi({loop.1,2},{loop.3,4}) ; CHECK: 5 = MemoryPhi({loop.1,2},{loop.3,4})
; CHECK: 3 = MemoryDef(5) ; CHECK: 3 = MemoryDef(5)
; CHECK-NEXT: store i8 1, ptr %p2 ; CHECK-NEXT: store i8 1, ptr %p2
store i8 1, ptr %p2 store i8 1, ptr %p2
br label %loop.3 br label %loop.3
loop.3: loop.3:
; CHECK: 7 = MemoryPhi({loop.1,2},{loop.2,3}) ; CHECK: 7 = MemoryPhi({loop.1,2},{loop.2,3})
; CHECK: 4 = MemoryDef(7) ; CHECK: 4 = MemoryDef(7)
; CHECK-NEXT: store i8 2, ptr %p2 ; CHECK-NEXT: store i8 2, ptr %p2
store i8 2, ptr %p2 store i8 2, ptr %p2
; NOLIMIT: MemoryUse(1) ; NOLIMIT: MemoryUse(1)
; NOLIMIT-NEXT: load i8, ptr %p1 ; NOLIMIT-NEXT: load i8, ptr %p1
; LIMIT: MemoryUse(4) ; LIMIT: MemoryUse(4)
; LIMIT-NEXT: load i8, ptr %p1 ; LIMIT-NEXT: load i8, ptr %p1
load i8, ptr %p1 load i8, ptr %p1
br i1 undef, label %loop.2, label %loop.1 br i1 %replace_undef_1, label %loop.2, label %loop.1
} }
; CHECK-LABEL: define void @looped_visitedonlyonce ; CHECK-LABEL: define void @looped_visitedonlyonce
define void @looped_visitedonlyonce(ptr noalias %p1, ptr noalias %p2) { define void @looped_visitedonlyonce(ptr noalias %p1, ptr noalias %p2, i1 %replace_undef_0, i1 %replace_undef_1) {
br label %while.cond br label %while.cond
while.cond: while.cond:
; CHECK: 5 = MemoryPhi({%0,liveOnEntry},{if.end,3}) ; CHECK: 5 = MemoryPhi({%0,liveOnEntry},{if.end,3})
; CHECK-NEXT: br i1 undef, label %if.then, label %if.end br i1 %replace_undef_0, label %if.then, label %if.end
br i1 undef, label %if.then, label %if.end
if.then: if.then:
; CHECK: 1 = MemoryDef(5) ; CHECK: 1 = MemoryDef(5)
; CHECK-NEXT: store i8 0, ptr %p1 ; CHECK-NEXT: store i8 0, ptr %p1
store i8 0, ptr %p1 store i8 0, ptr %p1
br i1 undef, label %if.end, label %if.then2 br i1 %replace_undef_1, label %if.end, label %if.then2
if.then2: if.then2:
; CHECK: 2 = MemoryDef(1) ; CHECK: 2 = MemoryDef(1)
; CHECK-NEXT: store i8 1, ptr %p2 ; CHECK-NEXT: store i8 1, ptr %p2
store i8 1, ptr %p2 store i8 1, ptr %p2
br label %if.end br label %if.end
if.end: if.end:
▲ Show 20 Lines • Show All 412 Lines • Show Last 20 Lines

llvm/test/Analysis/MemorySSA/pr28880.ll

; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s ; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s
; This testcase is reduced from SingleSource/Benchmarks/Misc/fbench.c ; This testcase is reduced from SingleSource/Benchmarks/Misc/fbench.c
; It is testing to make sure that the MemorySSA use optimizer ; It is testing to make sure that the MemorySSA use optimizer
; comes up with right answers when dealing with multiple MemoryLocations ; comes up with right answers when dealing with multiple MemoryLocations
; over different blocks. See PR28880 for more details. ; over different blocks. See PR28880 for more details.
@global = external hidden unnamed_addr global double, align 8 @global = external hidden unnamed_addr global double, align 8
@global.1 = external hidden unnamed_addr global double, align 8 @global.1 = external hidden unnamed_addr global double, align 8
; Function Attrs: nounwind ssp uwtable ; Function Attrs: nounwind ssp uwtable
define hidden fastcc void @hoge() unnamed_addr #0 { define hidden fastcc void @hoge( i1 %replace_undef_0, i1 %replace_undef_1) unnamed_addr #0 {
bb: bb:
br i1 undef, label %bb1, label %bb2 br i1 %replace_undef_0, label %bb1, label %bb2
bb1: ; preds = %bb bb1: ; preds = %bb
; These accesses should not conflict. ; These accesses should not conflict.
; CHECK: 1 = MemoryDef(liveOnEntry) ; CHECK: 1 = MemoryDef(liveOnEntry)
; 1 = MemoryDef(liveOnEntry) ; 1 = MemoryDef(liveOnEntry)
; CHECK-NEXT: store double undef, ptr @global, align 8 ; CHECK-NEXT: store double undef, ptr @global, align 8
store double undef, ptr @global, align 8 store double undef, ptr @global, align 8
; CHECK: MemoryUse(liveOnEntry) ; CHECK: MemoryUse(liveOnEntry)
; MemoryUse(liveOnEntry) ; MemoryUse(liveOnEntry)
; CHECK-NEXT: %tmp = load double, ptr @global.1, align 8 ; CHECK-NEXT: %tmp = load double, ptr @global.1, align 8
%tmp = load double, ptr @global.1, align 8 %tmp = load double, ptr @global.1, align 8
unreachable unreachable
bb2: ; preds = %bb bb2: ; preds = %bb
br label %bb3 br label %bb3
bb3: ; preds = %bb2 bb3: ; preds = %bb2
br i1 undef, label %bb4, label %bb6 br i1 %replace_undef_1, label %bb4, label %bb6
bb4: ; preds = %bb3 bb4: ; preds = %bb3
; These accesses should conflict. ; These accesses should conflict.
; CHECK: 2 = MemoryDef(liveOnEntry) ; CHECK: 2 = MemoryDef(liveOnEntry)
; 2 = MemoryDef(liveOnEntry) ; 2 = MemoryDef(liveOnEntry)
; CHECK-NEXT: store double 0.000000e+00, ptr @global.1, align 8 ; CHECK-NEXT: store double 0.000000e+00, ptr @global.1, align 8
store double 0.000000e+00, ptr @global.1, align 8 store double 0.000000e+00, ptr @global.1, align 8
; CHECK: MemoryUse(2) ; CHECK: MemoryUse(2)
Show All 11 Lines

llvm/test/Analysis/MemorySSA/pr40749_2.ll

; RUN: opt -S -passes=licm,simple-loop-unswitch -verify-memoryssa %s | FileCheck %s ; RUN: opt -S -passes=licm,simple-loop-unswitch -verify-memoryssa %s | FileCheck %s
; REQUIRES: asserts ; REQUIRES: asserts
target datalayout = "E-m:e-i1:8:16-i8:8:16-i64:64-f128:64-v128:64-a:8:16-n32:64" target datalayout = "E-m:e-i1:8:16-i8:8:16-i64:64-f128:64-v128:64-a:8:16-n32:64"
target triple = "s390x-ibm-linux" target triple = "s390x-ibm-linux"
@g_92 = external dso_local local_unnamed_addr global i16, align 2 @g_92 = external dso_local local_unnamed_addr global i16, align 2
@g_993 = external dso_local local_unnamed_addr global i32, align 4 @g_993 = external dso_local local_unnamed_addr global i32, align 4
; CHECK-LABEL: @ff6 ; CHECK-LABEL: @ff6
define dso_local fastcc void @ff6(i16 %arg1) unnamed_addr #0 { define dso_local fastcc void @ff6(i16 %arg1, i1 %replace_undef_0) unnamed_addr #0 {
bb: bb:
%tmp6.i = icmp sgt i16 %arg1, 0 %tmp6.i = icmp sgt i16 %arg1, 0
br label %bb10 br label %bb10
bb10: ; preds = %bb81.loopexit, %bb bb10: ; preds = %bb81.loopexit, %bb
%tmp17 = load i16, ptr @g_92, align 2 %tmp17 = load i16, ptr @g_92, align 2
%tmp18 = add i16 %tmp17, 1 %tmp18 = add i16 %tmp17, 1
store i16 %tmp18, ptr @g_92, align 2 store i16 %tmp18, ptr @g_92, align 2
Show All 26 Lines
bb42: ; preds = %bb27 bb42: ; preds = %bb27
br label %bb19 br label %bb19
bb67: ; preds = %bb27 bb67: ; preds = %bb27
br label %bb75 br label %bb75
bb75: ; preds = %bb67, %bb67.us.loopexit bb75: ; preds = %bb67, %bb67.us.loopexit
br i1 undef, label %bb24.preheader, label %bb84.loopexit br i1 %replace_undef_0, label %bb24.preheader, label %bb84.loopexit
bb81.loopexit: ; preds = %bb61.us bb81.loopexit: ; preds = %bb61.us
br label %bb10 br label %bb10
bb84.loopexit: ; preds = %bb75 bb84.loopexit: ; preds = %bb75
ret void ret void
} }
attributes #0 = { "target-features"="+transactional-execution,+vector" } attributes #0 = { "target-features"="+transactional-execution,+vector" }

llvm/test/Analysis/MemorySSA/pr43641.ll

; RUN: opt -passes=simple-loop-unswitch -enable-nontrivial-unswitch -verify-memoryssa -S < %s | FileCheck %s ; RUN: opt -passes=simple-loop-unswitch -enable-nontrivial-unswitch -verify-memoryssa -S < %s | FileCheck %s
; REQUIRES: asserts ; REQUIRES: asserts
; CHECK-LABEL: @c ; CHECK-LABEL: @c
define dso_local void @c(i32 signext %d) local_unnamed_addr { define dso_local void @c(i32 signext %d, i1 %replace_undef_0) local_unnamed_addr {
entry: entry:
br i1 undef, label %while.end, label %while.body.lr.ph br i1 %replace_undef_0, label %while.end, label %while.body.lr.ph
while.body.lr.ph: ; preds = %entry while.body.lr.ph: ; preds = %entry
%tobool1 = icmp ne i32 %d, 0 %tobool1 = icmp ne i32 %d, 0
br label %while.body br label %while.body
while.body: ; preds = %while.body, %while.body.lr.ph while.body: ; preds = %while.body, %while.body.lr.ph
%call = tail call signext i32 @e() %call = tail call signext i32 @e()
%0 = and i1 %tobool1, undef %0 = and i1 %tobool1, undef
br i1 %0, label %while.body, label %while.end br i1 %0, label %while.body, label %while.end
while.end: ; preds = %while.body, %entry while.end: ; preds = %while.body, %entry
ret void ret void
} }
declare signext i32 @e(...) local_unnamed_addr declare signext i32 @e(...) local_unnamed_addr

llvm/test/Analysis/MemorySSA/renamephis.ll

; RUN: opt -passes=licm -verify-memoryssa -S %s | FileCheck %s ; RUN: opt -passes=licm -verify-memoryssa -S %s | FileCheck %s
; REQUIRES: asserts ; REQUIRES: asserts
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-unknown-linux-gnu" target triple = "x86_64-unknown-linux-gnu"
@0 = external global { { ptr, i32, i32 }, ptr, i8, i8 } @0 = external global { { ptr, i32, i32 }, ptr, i8, i8 }
declare void @g() declare void @g()
; Function Attrs: argmemonly nounwind willreturn ; Function Attrs: argmemonly nounwind willreturn
declare void @llvm.lifetime.end.p0(i64 immarg, ptr nocapture) #0 declare void @llvm.lifetime.end.p0(i64 immarg, ptr nocapture) #0
; CHECK-LABEL: @f ; CHECK-LABEL: @f
define void @f() align 2 { define void @f( i1 %replace_undef_0, i1 %replace_undef_1) align 2 {
entry: entry:
%P = alloca ptr, align 8 %P = alloca ptr, align 8
br label %cond.end.i.i.i.i br label %cond.end.i.i.i.i
cond.end.i.i.i.i: ; preds = %cont20, %entry cond.end.i.i.i.i: ; preds = %cont20, %entry
br i1 undef, label %cont20, label %if.end br i1 %replace_undef_0, label %cont20, label %if.end
cont20: ; preds = %cond.end.i.i.i.i, %cond.end.i.i.i.i, %cond.end.i.i.i.i cont20: ; preds = %cond.end.i.i.i.i, %cond.end.i.i.i.i, %cond.end.i.i.i.i
store ptr undef, ptr %P, align 8 store ptr undef, ptr %P, align 8
br label %cond.end.i.i.i.i br label %cond.end.i.i.i.i
if.end: ; preds = %cond.end.i.i.i.i if.end: ; preds = %cond.end.i.i.i.i
br i1 undef, label %cond.exit, label %handler.type_mismatch2.i br i1 %replace_undef_1, label %cond.exit, label %handler.type_mismatch2.i
handler.type_mismatch2.i: ; preds = %if.end handler.type_mismatch2.i: ; preds = %if.end
tail call void @g() tail call void @g()
unreachable unreachable
cond.exit: ; preds = %if.end cond.exit: ; preds = %if.end
switch i8 undef, label %block.exit [ switch i8 undef, label %block.exit [
i8 81, label %sw.bb94 i8 81, label %sw.bb94
Show All 16 Lines

llvm/test/Analysis/MemorySSA/unreachable.ll

; RUN: opt -passes=licm -verify-memoryssa %s -S | FileCheck %s ; RUN: opt -passes=licm -verify-memoryssa %s -S | FileCheck %s
; REQUIRES: asserts ; REQUIRES: asserts
; Ensure verification doesn't fail with unreachable blocks. ; Ensure verification doesn't fail with unreachable blocks.
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-grtev4-linux-gnu" target triple = "x86_64-grtev4-linux-gnu"
declare dso_local void @f() declare dso_local void @f()
; CHECK-LABEL: @foo ; CHECK-LABEL: @foo
define dso_local void @foo() { define dso_local void @foo( i1 %replace_undef_0) {
entry: entry:
br i1 undef, label %if.then, label %if.end br i1 %replace_undef_0, label %if.then, label %if.end
if.then: ; preds = %entry if.then: ; preds = %entry
br label %try.cont br label %try.cont
if.end: ; preds = %entry if.end: ; preds = %entry
; 1 = MemoryDef(liveOnEntry) ; 1 = MemoryDef(liveOnEntry)
call void @f() call void @f()
br label %try.cont br label %try.cont
Show All 10 Lines

llvm/test/Analysis/MemorySSA/update_unroll.ll

; RUN: opt -verify-memoryssa -passes='loop-mssa(loop-rotate)' -S %s | FileCheck %s ; RUN: opt -verify-memoryssa -passes='loop-mssa(loop-rotate)' -S %s | FileCheck %s
; REQUIRES: asserts ; REQUIRES: asserts
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-grtev4-linux-gnu" target triple = "x86_64-grtev4-linux-gnu"
; Check verification passes after loop rotate, when adding phis in blocks ; Check verification passes after loop rotate, when adding phis in blocks
; receiving incoming edges and adding phis in IDF blocks. ; receiving incoming edges and adding phis in IDF blocks.
; CHECK-LABEL: @f ; CHECK-LABEL: @f
define void @f() align 32 { define void @f( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) align 32 {
entry: entry:
br label %while.cond.outer br label %while.cond.outer
while.cond80.while.cond.loopexit_crit_edge: ; preds = %if.else99 while.cond80.while.cond.loopexit_crit_edge: ; preds = %if.else99
br label %while.cond.outer br label %while.cond.outer
while.cond.outer: ; preds = %while.cond80.while.cond.loopexit_crit_edge, %entry while.cond.outer: ; preds = %while.cond80.while.cond.loopexit_crit_edge, %entry
br i1 undef, label %while.cond.outer.return.loopexit2_crit_edge, label %while.body.lr.ph br i1 %replace_undef_0, label %while.cond.outer.return.loopexit2_crit_edge, label %while.body.lr.ph
while.body.lr.ph: ; preds = %while.cond.outer while.body.lr.ph: ; preds = %while.cond.outer
br label %while.body br label %while.body
while.body: ; preds = %while.body.lr.ph while.body: ; preds = %while.body.lr.ph
br i1 undef, label %if.then42, label %if.end61 br i1 %replace_undef_1, label %if.then42, label %if.end61
if.then42: ; preds = %while.body if.then42: ; preds = %while.body
br label %return.loopexit2 br label %return.loopexit2
if.end61: ; preds = %while.body if.end61: ; preds = %while.body
br label %while.body82 br label %while.body82
while.body82: ; preds = %if.end61 while.body82: ; preds = %if.end61
br i1 undef, label %return.loopexit, label %if.else99 br i1 %replace_undef_2, label %return.loopexit, label %if.else99
if.else99: ; preds = %while.body82 if.else99: ; preds = %while.body82
store i32 0, ptr inttoptr (i64 44 to ptr), align 4 store i32 0, ptr inttoptr (i64 44 to ptr), align 4
br label %while.cond80.while.cond.loopexit_crit_edge br label %while.cond80.while.cond.loopexit_crit_edge
return.loopexit: ; preds = %while.body82 return.loopexit: ; preds = %while.body82
br label %return br label %return
Show All 10 Lines

llvm/test/Analysis/PhiValues/basic.ll

; RUN: opt < %s -passes='print<phi-values>' -disable-output 2>&1 | FileCheck %s ; RUN: opt < %s -passes='print<phi-values>' -disable-output 2>&1 | FileCheck %s
@X = common global i32 0 @X = common global i32 0
; CHECK-LABEL: PHI Values for function: simple ; CHECK-LABEL: PHI Values for function: simple
define void @simple(ptr %ptr) { define void @simple(ptr %ptr, i1 %replace_undef_0) {
entry: entry:
br i1 undef, label %if, label %else br i1 %replace_undef_0, label %if, label %else
if: if:
br label %end br label %end
else: else:
br label %end br label %end
end: end:
; CHECK: PHI %phi1 has values: ; CHECK: PHI %phi1 has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
; CHECK-DAG: i32 1 ; CHECK-DAG: i32 1
%phi1 = phi i32 [ 0, %if ], [ 1, %else ] %phi1 = phi i32 [ 0, %if ], [ 1, %else ]
; CHECK: PHI %phi2 has values: ; CHECK: PHI %phi2 has values:
; CHECK-DAG: @X ; CHECK-DAG: @X
; CHECK-DAG: %ptr ; CHECK-DAG: %ptr
%phi2 = phi ptr [ @X, %if ], [ %ptr, %else ] %phi2 = phi ptr [ @X, %if ], [ %ptr, %else ]
ret void ret void
} }
; CHECK-LABEL: PHI Values for function: chain ; CHECK-LABEL: PHI Values for function: chain
define void @chain() { define void @chain( i1 %replace_undef_0, i1 %replace_undef_1) {
entry: entry:
br i1 undef, label %if1, label %else1 br i1 %replace_undef_0, label %if1, label %else1
if1: if1:
br label %middle br label %middle
else1: else1:
br label %middle br label %middle
middle: middle:
; CHECK: PHI %phi1 has values: ; CHECK: PHI %phi1 has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
; CHECK-DAG: i32 1 ; CHECK-DAG: i32 1
%phi1 = phi i32 [ 0, %if1 ], [ 1, %else1 ] %phi1 = phi i32 [ 0, %if1 ], [ 1, %else1 ]
br i1 undef, label %if2, label %else2 br i1 %replace_undef_1, label %if2, label %else2
if2: if2:
br label %end br label %end
else2: else2:
br label %end br label %end
end: end:
Show All 13 Lines
unreachable: unreachable:
; CHECK: PHI %phi has values: ; CHECK: PHI %phi has values:
; CHECK-DAG: NONE ; CHECK-DAG: NONE
%phi = phi i32 [ %phi, %unreachable ] %phi = phi i32 [ %phi, %unreachable ]
br label %unreachable br label %unreachable
} }
; CHECK-LABEL: PHI Values for function: simple_loop ; CHECK-LABEL: PHI Values for function: simple_loop
define void @simple_loop() { define void @simple_loop( i1 %replace_undef_0) {
entry: entry:
br label %loop br label %loop
loop: loop:
; CHECK: PHI %phi has values: ; CHECK: PHI %phi has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
%phi = phi i32 [ 0, %entry ], [ %phi, %loop ] %phi = phi i32 [ 0, %entry ], [ %phi, %loop ]
br i1 undef, label %loop, label %end br i1 %replace_undef_0, label %loop, label %end
end: end:
ret void ret void
} }
; CHECK-LABEL: PHI Values for function: complex_loop ; CHECK-LABEL: PHI Values for function: complex_loop
define void @complex_loop() { define void @complex_loop( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
entry: entry:
br i1 undef, label %loop, label %end br i1 %replace_undef_0, label %loop, label %end
loop: loop:
; CHECK: PHI %phi1 has values: ; CHECK: PHI %phi1 has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
; CHECK-DAG: i32 1 ; CHECK-DAG: i32 1
%phi1 = phi i32 [ 0, %entry ], [ %phi2, %then ] %phi1 = phi i32 [ 0, %entry ], [ %phi2, %then ]
br i1 undef, label %if, label %else br i1 %replace_undef_1, label %if, label %else
if: if:
br label %then br label %then
else: else:
br label %then br label %then
then: then:
; CHECK: PHI %phi2 has values: ; CHECK: PHI %phi2 has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
; CHECK-DAG: i32 1 ; CHECK-DAG: i32 1
%phi2 = phi i32 [ %phi1, %if ], [ 1, %else ] %phi2 = phi i32 [ %phi1, %if ], [ 1, %else ]
br i1 undef, label %loop, label %end br i1 %replace_undef_2, label %loop, label %end
end: end:
; CHECK: PHI %phi3 has values: ; CHECK: PHI %phi3 has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
; CHECK-DAG: i32 1 ; CHECK-DAG: i32 1
; CHECK-DAG: i32 2 ; CHECK-DAG: i32 2
%phi3 = phi i32 [ 2, %entry ], [ %phi2, %then ] %phi3 = phi i32 [ 2, %entry ], [ %phi2, %then ]
ret void ret void
} }
; CHECK-LABEL: PHI Values for function: strange_loop ; CHECK-LABEL: PHI Values for function: strange_loop
define void @strange_loop() { define void @strange_loop( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2, i1 %replace_undef_3) {
entry: entry:
br i1 undef, label %ifelse, label %inloop br i1 %replace_undef_0, label %ifelse, label %inloop
loop: loop:
; CHECK: PHI %phi1 has values: ; CHECK: PHI %phi1 has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
; CHECK-DAG: i32 1 ; CHECK-DAG: i32 1
; CHECK-DAG: i32 2 ; CHECK-DAG: i32 2
; CHECK-DAG: i32 3 ; CHECK-DAG: i32 3
%phi1 = phi i32 [ %phi3, %if ], [ 0, %else ], [ %phi2, %inloop ] %phi1 = phi i32 [ %phi3, %if ], [ 0, %else ], [ %phi2, %inloop ]
br i1 undef, label %inloop, label %end br i1 %replace_undef_1, label %inloop, label %end
inloop: inloop:
; CHECK: PHI %phi2 has values: ; CHECK: PHI %phi2 has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
; CHECK-DAG: i32 1 ; CHECK-DAG: i32 1
; CHECK-DAG: i32 2 ; CHECK-DAG: i32 2
; CHECK-DAG: i32 3 ; CHECK-DAG: i32 3
%phi2 = phi i32 [ %phi1, %loop ], [ 1, %entry ] %phi2 = phi i32 [ %phi1, %loop ], [ 1, %entry ]
br i1 undef, label %ifelse, label %loop br i1 %replace_undef_2, label %ifelse, label %loop
ifelse: ifelse:
; CHECK: PHI %phi3 has values: ; CHECK: PHI %phi3 has values:
; CHECK-DAG: i32 2 ; CHECK-DAG: i32 2
; CHECK-DAG: i32 3 ; CHECK-DAG: i32 3
%phi3 = phi i32 [ 2, %entry ], [ 3, %inloop ] %phi3 = phi i32 [ 2, %entry ], [ 3, %inloop ]
br i1 undef, label %if, label %else br i1 %replace_undef_3, label %if, label %else
if: if:
br label %loop br label %loop
else: else:
br label %loop br label %loop
end: end:
ret void ret void
} }
; CHECK-LABEL: PHI Values for function: mutual_loops ; CHECK-LABEL: PHI Values for function: mutual_loops
define void @mutual_loops() { define void @mutual_loops( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2, i1 %replace_undef_3, i1 %replace_undef_4, i1 %replace_undef_5, i1 %replace_undef_6) {
entry: entry:
br i1 undef, label %loop1, label %loop2 br i1 %replace_undef_0, label %loop1, label %loop2
loop1: loop1:
; CHECK: PHI %phi1 has values: ; CHECK: PHI %phi1 has values:
; CHECK-DAG: 0 ; CHECK-DAG: 0
; CHECK-DAG: 1 ; CHECK-DAG: 1
; CHECK-DAG: 2 ; CHECK-DAG: 2
; CHECK-DAG: 3 ; CHECK-DAG: 3
; CHECK-DAG: 4 ; CHECK-DAG: 4
%phi1 = phi i32 [ 0, %entry ], [ %phi2, %loop1.then ], [ %phi3, %loop2.if ] %phi1 = phi i32 [ 0, %entry ], [ %phi2, %loop1.then ], [ %phi3, %loop2.if ]
br i1 undef, label %loop1.if, label %loop1.else br i1 %replace_undef_1, label %loop1.if, label %loop1.else
loop1.if: loop1.if:
br i1 undef, label %loop1.then, label %loop2 br i1 %replace_undef_2, label %loop1.then, label %loop2
loop1.else: loop1.else:
br label %loop1.then br label %loop1.then
loop1.then: loop1.then:
; CHECK: PHI %phi2 has values: ; CHECK: PHI %phi2 has values:
; CHECK-DAG: 0 ; CHECK-DAG: 0
; CHECK-DAG: 1 ; CHECK-DAG: 1
; CHECK-DAG: 2 ; CHECK-DAG: 2
; CHECK-DAG: 3 ; CHECK-DAG: 3
; CHECK-DAG: 4 ; CHECK-DAG: 4
%phi2 = phi i32 [ 1, %loop1.if ], [ %phi1, %loop1.else ] %phi2 = phi i32 [ 1, %loop1.if ], [ %phi1, %loop1.else ]
br i1 undef, label %loop1, label %end br i1 %replace_undef_3, label %loop1, label %end
loop2: loop2:
; CHECK: PHI %phi3 has values: ; CHECK: PHI %phi3 has values:
; CHECK-DAG: 2 ; CHECK-DAG: 2
; CHECK-DAG: 3 ; CHECK-DAG: 3
; CHECK-DAG: 4 ; CHECK-DAG: 4
%phi3 = phi i32 [ 2, %entry ], [ %phi4, %loop2.then ], [ 3, %loop1.if ] %phi3 = phi i32 [ 2, %entry ], [ %phi4, %loop2.then ], [ 3, %loop1.if ]
br i1 undef, label %loop2.if, label %loop2.else br i1 %replace_undef_4, label %loop2.if, label %loop2.else
loop2.if: loop2.if:
br i1 undef, label %loop2.then, label %loop1 br i1 %replace_undef_5, label %loop2.then, label %loop1
loop2.else: loop2.else:
br label %loop2.then br label %loop2.then
loop2.then: loop2.then:
; CHECK: PHI %phi4 has values: ; CHECK: PHI %phi4 has values:
; CHECK-DAG: 2 ; CHECK-DAG: 2
; CHECK-DAG: 3 ; CHECK-DAG: 3
; CHECK-DAG: 4 ; CHECK-DAG: 4
%phi4 = phi i32 [ 4, %loop2.if ], [ %phi3, %loop2.else ] %phi4 = phi i32 [ 4, %loop2.if ], [ %phi3, %loop2.else ]
br i1 undef, label %loop2, label %end br i1 %replace_undef_6, label %loop2, label %end
end: end:
; CHECK: PHI %phi5 has values: ; CHECK: PHI %phi5 has values:
; CHECK-DAG: 0 ; CHECK-DAG: 0
; CHECK-DAG: 1 ; CHECK-DAG: 1
; CHECK-DAG: 2 ; CHECK-DAG: 2
; CHECK-DAG: 3 ; CHECK-DAG: 3
; CHECK-DAG: 4 ; CHECK-DAG: 4
%phi5 = phi i32 [ %phi2, %loop1.then ], [ %phi4, %loop2.then ] %phi5 = phi i32 [ %phi2, %loop1.then ], [ %phi4, %loop2.then ]
ret void ret void
} }
; CHECK-LABEL: PHI Values for function: nested_loops_several_values ; CHECK-LABEL: PHI Values for function: nested_loops_several_values
define void @nested_loops_several_values() { define void @nested_loops_several_values( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
entry: entry:
br label %loop1 br label %loop1
loop1: loop1:
; CHECK: PHI %phi1 has values: ; CHECK: PHI %phi1 has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
; CHECK-DAG: %add ; CHECK-DAG: %add
%phi1 = phi i32 [ 0, %entry ], [ %phi2, %loop2 ] %phi1 = phi i32 [ 0, %entry ], [ %phi2, %loop2 ]
br i1 undef, label %loop2, label %end br i1 %replace_undef_0, label %loop2, label %end
loop2: loop2:
; CHECK: PHI %phi2 has values: ; CHECK: PHI %phi2 has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
; CHECK-DAG: %add ; CHECK-DAG: %add
%phi2 = phi i32 [ %phi1, %loop1 ], [ %phi3, %loop3 ] %phi2 = phi i32 [ %phi1, %loop1 ], [ %phi3, %loop3 ]
br i1 undef, label %loop3, label %loop1 br i1 %replace_undef_1, label %loop3, label %loop1
loop3: loop3:
; CHECK: PHI %phi3 has values: ; CHECK: PHI %phi3 has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
; CHECK-DAG: %add ; CHECK-DAG: %add
%phi3 = phi i32 [ %add, %loop3 ], [ %phi2, %loop2 ] %phi3 = phi i32 [ %add, %loop3 ], [ %phi2, %loop2 ]
%add = add i32 %phi3, 1 %add = add i32 %phi3, 1
br i1 undef, label %loop3, label %loop2 br i1 %replace_undef_2, label %loop3, label %loop2
end: end:
ret void ret void
} }
; CHECK-LABEL: PHI Values for function: nested_loops_one_value ; CHECK-LABEL: PHI Values for function: nested_loops_one_value
define void @nested_loops_one_value() { define void @nested_loops_one_value( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
entry: entry:
br label %loop1 br label %loop1
loop1: loop1:
; CHECK: PHI %phi1 has values: ; CHECK: PHI %phi1 has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
%phi1 = phi i32 [ 0, %entry ], [ %phi2, %loop2 ] %phi1 = phi i32 [ 0, %entry ], [ %phi2, %loop2 ]
br i1 undef, label %loop2, label %end br i1 %replace_undef_0, label %loop2, label %end
loop2: loop2:
; CHECK: PHI %phi2 has values: ; CHECK: PHI %phi2 has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
%phi2 = phi i32 [ %phi1, %loop1 ], [ %phi3, %loop3 ] %phi2 = phi i32 [ %phi1, %loop1 ], [ %phi3, %loop3 ]
br i1 undef, label %loop3, label %loop1 br i1 %replace_undef_1, label %loop3, label %loop1
loop3: loop3:
; CHECK: PHI %phi3 has values: ; CHECK: PHI %phi3 has values:
; CHECK-DAG: i32 0 ; CHECK-DAG: i32 0
%phi3 = phi i32 [ 0, %loop3 ], [ %phi2, %loop2 ] %phi3 = phi i32 [ 0, %loop3 ], [ %phi2, %loop2 ]
br i1 undef, label %loop3, label %loop2 br i1 %replace_undef_2, label %loop3, label %loop2
end: end:
ret void ret void
} }

llvm/test/Analysis/PhiValues/long_phi_chain.ll

; RUN: opt < %s -passes='print<phi-values>' -disable-output 2>&1 | FileCheck %s ; RUN: opt < %s -passes='print<phi-values>' -disable-output 2>&1 | FileCheck %s
; This test uses a long chain of phis that take themselves as an operand, which causes ; This test uses a long chain of phis that take themselves as an operand, which causes
; phi values analysis to segfault if it's not careful about that kind of thing. ; phi values analysis to segfault if it's not careful about that kind of thing.
; CHECK-LABEL: PHI Values for function: fn ; CHECK-LABEL: PHI Values for function: fn
define void @fn(ptr %arg) { define void @fn(ptr %arg, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2, i1 %replace_undef_3, i1 %replace_undef_4, i1 %replace_undef_5, i1 %replace_undef_6, i1 %replace_undef_7, i1 %replace_undef_8, i1 %replace_undef_9, i1 %replace_undef_10, i1 %replace_undef_11, i1 %replace_undef_12, i1 %replace_undef_13) {
entry: entry:
br label %while1.cond br label %while1.cond
while1.cond: while1.cond:
; CHECK: PHI %phi1 has values: ; CHECK: PHI %phi1 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi1 = phi ptr [ %arg, %entry ], [ %phi2, %while1.then ] %phi1 = phi ptr [ %arg, %entry ], [ %phi2, %while1.then ]
br i1 undef, label %while1.end, label %while1.body br i1 %replace_undef_0, label %while1.end, label %while1.body
while1.body: while1.body:
br i1 undef, label %while1.then, label %while1.if br i1 %replace_undef_1, label %while1.then, label %while1.if
while1.if: while1.if:
br label %while1.then br label %while1.then
while1.then: while1.then:
; CHECK: PHI %phi2 has values: ; CHECK: PHI %phi2 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi2 = phi ptr [ %arg, %while1.if ], [ %phi1, %while1.body ] %phi2 = phi ptr [ %arg, %while1.if ], [ %phi1, %while1.body ]
br label %while1.cond br label %while1.cond
while1.end: while1.end:
br label %while2.cond1 br label %while2.cond1
while2.cond1: while2.cond1:
; CHECK: PHI %phi3 has values: ; CHECK: PHI %phi3 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi3 = phi ptr [ %phi1, %while1.end ], [ %phi5, %while2.then ] %phi3 = phi ptr [ %phi1, %while1.end ], [ %phi5, %while2.then ]
br i1 undef, label %while2.end, label %while2.body1 br i1 %replace_undef_2, label %while2.end, label %while2.body1
while2.body1: while2.body1:
br i1 undef, label %while2.cond2, label %while2.then br i1 %replace_undef_3, label %while2.cond2, label %while2.then
while2.cond2: while2.cond2:
; CHECK: PHI %phi4 has values: ; CHECK: PHI %phi4 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi4 = phi ptr [ %phi3, %while2.body1 ], [ %phi4, %while2.if ] %phi4 = phi ptr [ %phi3, %while2.body1 ], [ %phi4, %while2.if ]
br i1 undef, label %while2.then, label %while2.if br i1 %replace_undef_4, label %while2.then, label %while2.if
while2.if: while2.if:
br label %while2.cond2 br label %while2.cond2
while2.then: while2.then:
; CHECK: PHI %phi5 has values: ; CHECK: PHI %phi5 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi5 = phi ptr [ %phi3, %while2.body1 ], [ %phi4, %while2.cond2 ] %phi5 = phi ptr [ %phi3, %while2.body1 ], [ %phi4, %while2.cond2 ]
br label %while2.cond1 br label %while2.cond1
while2.end: while2.end:
br label %while3.cond1 br label %while3.cond1
while3.cond1: while3.cond1:
; CHECK: PHI %phi6 has values: ; CHECK: PHI %phi6 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi6 = phi ptr [ %phi3, %while2.end ], [ %phi7, %while3.cond2 ] %phi6 = phi ptr [ %phi3, %while2.end ], [ %phi7, %while3.cond2 ]
br i1 undef, label %while3.end, label %while3.cond2 br i1 %replace_undef_5, label %while3.end, label %while3.cond2
while3.cond2: while3.cond2:
; CHECK: PHI %phi7 has values: ; CHECK: PHI %phi7 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi7 = phi ptr [ %phi6, %while3.cond1 ], [ %phi7, %while3.body ] %phi7 = phi ptr [ %phi6, %while3.cond1 ], [ %phi7, %while3.body ]
br i1 undef, label %while3.cond1, label %while3.body br i1 %replace_undef_6, label %while3.cond1, label %while3.body
while3.body: while3.body:
br label %while3.cond2 br label %while3.cond2
while3.end: while3.end:
br label %while4.cond1 br label %while4.cond1
while4.cond1: while4.cond1:
; CHECK: PHI %phi8 has values: ; CHECK: PHI %phi8 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi8 = phi ptr [ %phi6, %while3.end ], [ %phi10, %while4.then ] %phi8 = phi ptr [ %phi6, %while3.end ], [ %phi10, %while4.then ]
br i1 undef, label %while4.end, label %while4.if br i1 %replace_undef_7, label %while4.end, label %while4.if
while4.if: while4.if:
br i1 undef, label %while4.cond2, label %while4.then br i1 %replace_undef_8, label %while4.cond2, label %while4.then
while4.cond2: while4.cond2:
; CHECK: PHI %phi9 has values: ; CHECK: PHI %phi9 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi9 = phi ptr [ %phi8, %while4.if ], [ %phi9, %while4.body ] %phi9 = phi ptr [ %phi8, %while4.if ], [ %phi9, %while4.body ]
br i1 undef, label %while4.then, label %while4.body br i1 %replace_undef_9, label %while4.then, label %while4.body
while4.body: while4.body:
br label %while4.cond2 br label %while4.cond2
while4.then: while4.then:
; CHECK: PHI %phi10 has values: ; CHECK: PHI %phi10 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi10 = phi ptr [ %phi8, %while4.if ], [ %phi9, %while4.cond2 ] %phi10 = phi ptr [ %phi8, %while4.if ], [ %phi9, %while4.cond2 ]
br label %while4.cond1 br label %while4.cond1
while4.end: while4.end:
br label %while5.cond br label %while5.cond
while5.cond: while5.cond:
; CHECK: PHI %phi11 has values: ; CHECK: PHI %phi11 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi11 = phi ptr [ %phi8, %while4.end ], [ %phi13, %while5.then ] %phi11 = phi ptr [ %phi8, %while4.end ], [ %phi13, %while5.then ]
br i1 undef, label %while5.end, label %while5.body1 br i1 %replace_undef_10, label %while5.end, label %while5.body1
while5.body1: while5.body1:
br i1 undef, label %while5.if, label %while5.then br i1 %replace_undef_11, label %while5.if, label %while5.then
while5.if: while5.if:
; CHECK: PHI %phi12 has values: ; CHECK: PHI %phi12 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi12 = phi ptr [ %phi11, %while5.body1 ], [ %phi12, %while5.body2 ] %phi12 = phi ptr [ %phi11, %while5.body1 ], [ %phi12, %while5.body2 ]
br i1 undef, label %while5.then, label %while5.body2 br i1 %replace_undef_12, label %while5.then, label %while5.body2
while5.body2: while5.body2:
br label %while5.if br label %while5.if
while5.then: while5.then:
; CHECK: PHI %phi13 has values: ; CHECK: PHI %phi13 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi13 = phi ptr [ %phi11, %while5.body1 ], [ %phi12, %while5.if ] %phi13 = phi ptr [ %phi11, %while5.body1 ], [ %phi12, %while5.if ]
br label %while5.cond br label %while5.cond
while5.end: while5.end:
br label %while6.cond1 br label %while6.cond1
while6.cond1: while6.cond1:
; CHECK: PHI %phi14 has values: ; CHECK: PHI %phi14 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi14 = phi ptr [ %phi11, %while5.end ], [ %phi14, %while6.cond1 ] %phi14 = phi ptr [ %phi11, %while5.end ], [ %phi14, %while6.cond1 ]
br i1 undef, label %while6.cond2, label %while6.cond1 br i1 %replace_undef_13, label %while6.cond2, label %while6.cond1
while6.cond2: while6.cond2:
; CHECK: PHI %phi15 has values: ; CHECK: PHI %phi15 has values:
; CHECK: ptr %arg ; CHECK: ptr %arg
%phi15 = phi ptr [ %phi14, %while6.cond1 ], [ %phi15, %while6.cond2 ] %phi15 = phi ptr [ %phi14, %while6.cond1 ], [ %phi15, %while6.cond2 ]
br label %while6.cond2 br label %while6.cond2
} }

llvm/test/Analysis/PostDominators/pr6047_a.ll

; RUN: opt < %s -passes='print<postdomtree>' 2>&1 | FileCheck %s ; RUN: opt < %s -passes='print<postdomtree>' 2>&1 | FileCheck %s
define internal void @f() { define internal void @f( i1 %replace_undef_0) {
entry: entry:
br i1 undef, label %bb35, label %bb3.i br i1 %replace_undef_0, label %bb35, label %bb3.i
bb3.i: bb3.i:
br label %bb3.i br label %bb3.i
bb35.loopexit3: bb35.loopexit3:
br label %bb35 br label %bb35
bb35: bb35:
Show All 9 Lines

llvm/test/Analysis/PostDominators/pr6047_b.ll

; RUN: opt < %s -passes='print<postdomtree>' 2>&1 | FileCheck %s ; RUN: opt < %s -passes='print<postdomtree>' 2>&1 | FileCheck %s
define internal void @f() { define internal void @f( i1 %replace_undef_0, i1 %replace_undef_1) {
entry: entry:
br i1 undef, label %a, label %bb3.i br i1 %replace_undef_0, label %a, label %bb3.i
a: a:
br i1 undef, label %bb35, label %bb3.i br i1 %replace_undef_1, label %bb35, label %bb3.i
bb3.i: bb3.i:
br label %bb3.i br label %bb3.i
bb35.loopexit3: bb35.loopexit3:
br label %bb35 br label %bb35
Show All 10 Lines

llvm/test/Analysis/PostDominators/pr6047_c.ll

; RUN: opt < %s -passes='print<postdomtree>' 2>&1 | FileCheck %s ; RUN: opt < %s -passes='print<postdomtree>' 2>&1 | FileCheck %s
define internal void @f() { define internal void @f( i1 %replace_undef_0) {
entry: entry:
br i1 undef, label %bb35, label %bb3.i br i1 %replace_undef_0, label %bb35, label %bb3.i
bb3.i: bb3.i:
br label %bb3.i br label %bb3.i
bb: bb:
br label %bb35 br label %bb35
bb.i: bb.i:
▲ Show 20 Lines • Show All 185 Lines • Show Last 20 Lines

llvm/test/Analysis/PostDominators/pr6047_d.ll

; RUN: opt < %s -passes='print<postdomtree>' 2>&1 | FileCheck %s ; RUN: opt < %s -passes='print<postdomtree>' 2>&1 | FileCheck %s
define internal void @f() { define internal void @f( i1 %replace_undef_0) {
entry: entry:
br i1 1, label %a, label %b br i1 1, label %a, label %b
a: a:
br label %c br label %c
b: b:
br label %c br label %c
c: c:
br i1 undef, label %bb35, label %bb3.i br i1 %replace_undef_0, label %bb35, label %bb3.i
bb3.i: bb3.i:
br label %bb3.i br label %bb3.i
bb35.loopexit3: bb35.loopexit3:
br label %bb35 br label %bb35
bb35: bb35:
Show All 11 Lines

llvm/test/Analysis/ScalarEvolution/2011-04-26-FoldAddRec.ll

; RUN: opt < %s -passes='print<iv-users>' ; RUN: opt < %s -passes='print<iv-users>'
; PR9633: Tests that SCEV handles the mul.i2 recurrence being folded to ; PR9633: Tests that SCEV handles the mul.i2 recurrence being folded to
; constant zero. ; constant zero.
define signext i8 @func_14(i8 signext %p_18) nounwind readnone ssp { define signext i8 @func_14(i8 signext %p_18, i1 %replace_undef_0) nounwind readnone ssp {
entry: entry:
br label %for.inc br label %for.inc
for.inc: for.inc:
%p_17.addr.012 = phi i32 [ 0, %entry ], [ %add, %for.inc ] %p_17.addr.012 = phi i32 [ 0, %entry ], [ %add, %for.inc ]
%add = add nsw i32 %p_17.addr.012, 1 %add = add nsw i32 %p_17.addr.012, 1
br i1 false, label %for.inc, label %for.cond br i1 false, label %for.inc, label %for.cond
for.cond: for.cond:
%tobool.i = icmp ult i32 %add, 8192 %tobool.i = icmp ult i32 %add, 8192
%shl.i = select i1 %tobool.i, i32 13, i32 0 %shl.i = select i1 %tobool.i, i32 13, i32 0
%shl.left.i = shl i32 %add, %shl.i %shl.left.i = shl i32 %add, %shl.i
%conv.i4 = trunc i32 %shl.left.i to i8 %conv.i4 = trunc i32 %shl.left.i to i8
br i1 undef, label %for.inc9, label %if.then br i1 %replace_undef_0, label %for.inc9, label %if.then
for.inc9: for.inc9:
%p_18.addr.011 = phi i8 [ %add12, %for.inc9 ], [ %p_18, %for.cond ] %p_18.addr.011 = phi i8 [ %add12, %for.inc9 ], [ %p_18, %for.cond ]
%add12 = add i8 %p_18.addr.011, 1 %add12 = add i8 %p_18.addr.011, 1
%mul.i2 = mul i8 %add12, %conv.i4 %mul.i2 = mul i8 %add12, %conv.i4
%mul.i2.lobit = lshr i8 %mul.i2, 7 %mul.i2.lobit = lshr i8 %mul.i2, 7
%lor.ext.shr.i = select i1 undef, i8 %mul.i2.lobit, i8 %mul.i2 %lor.ext.shr.i = select i1 undef, i8 %mul.i2.lobit, i8 %mul.i2
%tobool = icmp eq i8 %lor.ext.shr.i, 0 %tobool = icmp eq i8 %lor.ext.shr.i, 0
br i1 %tobool, label %for.inc9, label %if.then br i1 %tobool, label %for.inc9, label %if.then
if.then: if.then:
ret i8 0 ret i8 0
} }

llvm/test/Analysis/ScalarEvolution/SolveQuadraticEquation.ll

Show All 30 Lines
} }
; CHECK: Determining loop execution counts for: @test1 ; CHECK: Determining loop execution counts for: @test1
; CHECK-NEXT: backedge-taken count is 100 ; CHECK-NEXT: backedge-taken count is 100
; PR10383 ; PR10383
; These next two used to crash. ; These next two used to crash.
define void @test2(i1 %cmp, i64 %n) { define void @test2(i1 %cmp, i64 %n, i1 %replace_undef_0) {
entry: entry:
br label %for.body1 br label %for.body1
for.body1: for.body1:
%a0.08 = phi i64 [ 0, %entry ], [ %inc512, %for.body1 ] %a0.08 = phi i64 [ 0, %entry ], [ %inc512, %for.body1 ]
%inc512 = add i64 %a0.08, 1 %inc512 = add i64 %a0.08, 1
br i1 %cmp, label %preheader, label %for.body1 br i1 %cmp, label %preheader, label %for.body1
preheader: preheader:
br label %for.body2 br label %for.body2
for.body2: for.body2:
%indvar = phi i64 [ 0, %preheader ], [ %indvar.next, %for.body2 ] %indvar = phi i64 [ 0, %preheader ], [ %indvar.next, %for.body2 ]
%tmp111 = add i64 %n, %indvar %tmp111 = add i64 %n, %indvar
%tmp114 = mul i64 %a0.08, %indvar %tmp114 = mul i64 %a0.08, %indvar
%mul542 = mul i64 %tmp114, %tmp111 %mul542 = mul i64 %tmp114, %tmp111
%indvar.next = add i64 %indvar, 1 %indvar.next = add i64 %indvar, 1
br i1 undef, label %end, label %for.body2 br i1 %replace_undef_0, label %end, label %for.body2
end: end:
ret void ret void
} }
; CHECK: Determining loop execution counts for: @test2 ; CHECK: Determining loop execution counts for: @test2
define i32 @test3() { define i32 @test3( i1 %replace_undef_0, i1 %replace_undef_1) {
if.then466: if.then466:
br i1 undef, label %for.cond539.preheader, label %for.inc479 br i1 %replace_undef_0, label %for.cond539.preheader, label %for.inc479
for.inc479: for.inc479:
%a2.07 = phi i32 [ %add495, %for.inc479 ], [ 0, %if.then466 ] %a2.07 = phi i32 [ %add495, %for.inc479 ], [ 0, %if.then466 ]
%j.36 = phi i32 [ %inc497, %for.inc479 ], [ undef, %if.then466 ] %j.36 = phi i32 [ %inc497, %for.inc479 ], [ undef, %if.then466 ]
%mul484 = mul nsw i32 %j.36, %j.36 %mul484 = mul nsw i32 %j.36, %j.36
%mul491 = mul i32 %j.36, %j.36 %mul491 = mul i32 %j.36, %j.36
%mul493 = mul i32 %mul491, %mul484 %mul493 = mul i32 %mul491, %mul484
%add495 = add nsw i32 %mul493, %a2.07 %add495 = add nsw i32 %mul493, %a2.07
%inc497 = add nsw i32 %j.36, 1 %inc497 = add nsw i32 %j.36, 1
br i1 undef, label %for.cond539.preheader, label %for.inc479 br i1 %replace_undef_1, label %for.cond539.preheader, label %for.inc479
for.cond539.preheader: for.cond539.preheader:
unreachable unreachable
} }
; CHECK: Determining loop execution counts for: @test3 ; CHECK: Determining loop execution counts for: @test3
; PR13489 ; PR13489
; We used to crash on this too. ; We used to crash on this too.
Show All 18 Lines

llvm/test/Analysis/ScalarEvolution/avoid-infinite-recursion-0.ll

; RUN: opt < %s -passes='print<scalar-evolution>' ; RUN: opt < %s -passes='print<scalar-evolution>'
; PR4537 ; PR4537
; ModuleID = 'b.bc' ; ModuleID = 'b.bc'
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128" target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128"
target triple = "x86_64-unknown-linux-gnu" target triple = "x86_64-unknown-linux-gnu"
define i32 @test() { define i32 @test( i1 %replace_undef_0) {
entry: entry:
%0 = load ptr, ptr undef, align 8 ; <ptr> [#uses=1] %0 = load ptr, ptr undef, align 8 ; <ptr> [#uses=1]
%1 = ptrtoint ptr %0 to i64 ; <i64> [#uses=1] %1 = ptrtoint ptr %0 to i64 ; <i64> [#uses=1]
%2 = sub i64 undef, %1 ; <i64> [#uses=1] %2 = sub i64 undef, %1 ; <i64> [#uses=1]
%3 = lshr i64 %2, 3 ; <i64> [#uses=1] %3 = lshr i64 %2, 3 ; <i64> [#uses=1]
%4 = trunc i64 %3 to i32 ; <i32> [#uses=2] %4 = trunc i64 %3 to i32 ; <i32> [#uses=2]
br i1 undef, label %bb10, label %bb4.i br i1 %replace_undef_0, label %bb10, label %bb4.i
bb4.i: ; preds = %bb4.i, %entry bb4.i: ; preds = %bb4.i, %entry
%i.0.i6 = phi i32 [ %8, %bb4.i ], [ 0, %entry ] ; <i32> [#uses=2] %i.0.i6 = phi i32 [ %8, %bb4.i ], [ 0, %entry ] ; <i32> [#uses=2]
%5 = sub i32 %4, %i.0.i6 ; <i32> [#uses=1] %5 = sub i32 %4, %i.0.i6 ; <i32> [#uses=1]
%6 = sext i32 %5 to i64 ; <i64> [#uses=1] %6 = sext i32 %5 to i64 ; <i64> [#uses=1]
%7 = udiv i64 undef, %6 ; <i64> [#uses=1] %7 = udiv i64 undef, %6 ; <i64> [#uses=1]
%8 = add i32 %i.0.i6, 1 ; <i32> [#uses=2] %8 = add i32 %i.0.i6, 1 ; <i32> [#uses=2]
%phitmp = icmp eq i64 %7, 0 ; <i1> [#uses=1] %phitmp = icmp eq i64 %7, 0 ; <i1> [#uses=1]
%.not.i = icmp sge i32 %8, %4 ; <i1> [#uses=1] %.not.i = icmp sge i32 %8, %4 ; <i1> [#uses=1]
%or.cond.i = or i1 %phitmp, %.not.i ; <i1> [#uses=1] %or.cond.i = or i1 %phitmp, %.not.i ; <i1> [#uses=1]
br i1 %or.cond.i, label %bb10, label %bb4.i br i1 %or.cond.i, label %bb10, label %bb4.i
bb10: ; preds = %bb4.i, %entry bb10: ; preds = %bb4.i, %entry
unreachable unreachable
} }

llvm/test/Analysis/ScalarEvolution/avoid-infinite-recursion-1.ll

Show First 20 Lines • Show All 201 Lines • ▼ Show 20 Linesmodule asm ".previous"
%struct.vpollinfo = type <{ %struct.mtx, %struct.selinfo, i16, i16, i8, i8, i8, i8 }> %struct.vpollinfo = type <{ %struct.mtx, %struct.selinfo, i16, i16, i8, i8, i8, i8 }>
%struct.witness = type opaque %struct.witness = type opaque
%struct.workhead = type <{ ptr }> %struct.workhead = type <{ ptr }>
%struct.worklist = type opaque %struct.worklist = type opaque
%union.anon = type <{ [16 x i8] }> %union.anon = type <{ [16 x i8] }>
%union.pager_info = type <{ [4 x i8] }> %union.pager_info = type <{ [4 x i8] }>
%union.sigval = type <{ [8 x i8] }> %union.sigval = type <{ [8 x i8] }>
define i32 @vlrureclaim(ptr %mp) nounwind { define i32 @vlrureclaim(ptr %mp, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2, i1 %replace_undef_3, i1 %replace_undef_4, i1 %replace_undef_5, i1 %replace_undef_6, i1 %replace_undef_7, i1 %replace_undef_8, i1 %replace_undef_9, i1 %replace_undef_10, i1 %replace_undef_11, i1 %replace_undef_12, i1 %replace_undef_13, i1 %replace_undef_14, i1 %replace_undef_15, i1 %replace_undef_16, i1 %replace_undef_17, i1 %replace_undef_18, i1 %replace_undef_19, i1 %replace_undef_20, i1 %replace_undef_21, i1 %replace_undef_22) nounwind {
entry: entry:
br i1 undef, label %if.then11, label %do.end br i1 %replace_undef_0, label %if.then11, label %do.end
if.then11: ; preds = %entry if.then11: ; preds = %entry
br label %do.end br label %do.end
do.end: ; preds = %if.then11, %entry do.end: ; preds = %if.then11, %entry
br label %while.cond.outer br label %while.cond.outer
while.cond.outer: ; preds = %while.cond.outer.backedge, %do.end while.cond.outer: ; preds = %while.cond.outer.backedge, %do.end
%count.0.ph = phi i32 [ undef, %do.end ], [ undef, %while.cond.outer.backedge ] ; <i32> [#uses=1] %count.0.ph = phi i32 [ undef, %do.end ], [ undef, %while.cond.outer.backedge ] ; <i32> [#uses=1]
br label %while.cond br label %while.cond
while.cond: ; preds = %next_iter, %while.cond.outer while.cond: ; preds = %next_iter, %while.cond.outer
%count.0 = phi i32 [ %dec, %next_iter ], [ %count.0.ph, %while.cond.outer ] ; <i32> [#uses=2] %count.0 = phi i32 [ %dec, %next_iter ], [ %count.0.ph, %while.cond.outer ] ; <i32> [#uses=2]
%cmp21 = icmp eq i32 %count.0, 0 ; <i1> [#uses=1] %cmp21 = icmp eq i32 %count.0, 0 ; <i1> [#uses=1]
br i1 %cmp21, label %do.body288.loopexit4, label %while.body br i1 %cmp21, label %do.body288.loopexit4, label %while.body
while.body: ; preds = %while.cond while.body: ; preds = %while.cond
br label %while.cond27 br label %while.cond27
while.cond27: ; preds = %while.body36, %while.body while.cond27: ; preds = %while.body36, %while.body
br i1 undef, label %do.body288.loopexit, label %land.rhs br i1 %replace_undef_1, label %do.body288.loopexit, label %land.rhs
land.rhs: ; preds = %while.cond27 land.rhs: ; preds = %while.cond27
br i1 undef, label %while.body36, label %while.end br i1 %replace_undef_2, label %while.body36, label %while.end
while.body36: ; preds = %land.rhs while.body36: ; preds = %land.rhs
br label %while.cond27 br label %while.cond27
while.end: ; preds = %land.rhs while.end: ; preds = %land.rhs
br i1 undef, label %do.body288.loopexit4, label %do.body46 br i1 %replace_undef_3, label %do.body288.loopexit4, label %do.body46
do.body46: ; preds = %while.end do.body46: ; preds = %while.end
br i1 undef, label %if.else64, label %if.then53 br i1 %replace_undef_4, label %if.else64, label %if.then53
if.then53: ; preds = %do.body46 if.then53: ; preds = %do.body46
br label %if.end72 br label %if.end72
if.else64: ; preds = %do.body46 if.else64: ; preds = %do.body46
br label %if.end72 br label %if.end72
if.end72: ; preds = %if.else64, %if.then53 if.end72: ; preds = %if.else64, %if.then53
%dec = add i32 %count.0, -1 ; <i32> [#uses=2] %dec = add i32 %count.0, -1 ; <i32> [#uses=2]
br i1 undef, label %next_iter, label %if.end111 br i1 %replace_undef_5, label %next_iter, label %if.end111
if.end111: ; preds = %if.end72 if.end111: ; preds = %if.end72
br i1 undef, label %lor.lhs.false, label %do.body145 br i1 %replace_undef_6, label %lor.lhs.false, label %do.body145
lor.lhs.false: ; preds = %if.end111 lor.lhs.false: ; preds = %if.end111
br i1 undef, label %lor.lhs.false122, label %do.body145 br i1 %replace_undef_7, label %lor.lhs.false122, label %do.body145
lor.lhs.false122: ; preds = %lor.lhs.false lor.lhs.false122: ; preds = %lor.lhs.false
br i1 undef, label %lor.lhs.false128, label %do.body145 br i1 %replace_undef_8, label %lor.lhs.false128, label %do.body145
lor.lhs.false128: ; preds = %lor.lhs.false122 lor.lhs.false128: ; preds = %lor.lhs.false122
br i1 undef, label %do.body162, label %land.lhs.true br i1 %replace_undef_9, label %do.body162, label %land.lhs.true
land.lhs.true: ; preds = %lor.lhs.false128 land.lhs.true: ; preds = %lor.lhs.false128
br i1 undef, label %do.body145, label %do.body162 br i1 %replace_undef_10, label %do.body145, label %do.body162
do.body145: ; preds = %land.lhs.true, %lor.lhs.false122, %lor.lhs.false, %if.end111 do.body145: ; preds = %land.lhs.true, %lor.lhs.false122, %lor.lhs.false, %if.end111
br i1 undef, label %if.then156, label %next_iter br i1 %replace_undef_11, label %if.then156, label %next_iter
if.then156: ; preds = %do.body145 if.then156: ; preds = %do.body145
br label %next_iter br label %next_iter
do.body162: ; preds = %land.lhs.true, %lor.lhs.false128 do.body162: ; preds = %land.lhs.true, %lor.lhs.false128
br i1 undef, label %if.then173, label %do.end177 br i1 %replace_undef_12, label %if.then173, label %do.end177
if.then173: ; preds = %do.body162 if.then173: ; preds = %do.body162
br label %do.end177 br label %do.end177
do.end177: ; preds = %if.then173, %do.body162 do.end177: ; preds = %if.then173, %do.body162
br i1 undef, label %do.body185, label %if.then182 br i1 %replace_undef_13, label %do.body185, label %if.then182
if.then182: ; preds = %do.end177 if.then182: ; preds = %do.end177
br label %next_iter_mntunlocked br label %next_iter_mntunlocked
do.body185: ; preds = %do.end177 do.body185: ; preds = %do.end177
br i1 undef, label %if.then196, label %do.end202 br i1 %replace_undef_14, label %if.then196, label %do.end202
if.then196: ; preds = %do.body185 if.then196: ; preds = %do.body185
br label %do.end202 br label %do.end202
do.end202: ; preds = %if.then196, %do.body185 do.end202: ; preds = %if.then196, %do.body185
br i1 undef, label %lor.lhs.false207, label %if.then231 br i1 %replace_undef_15, label %lor.lhs.false207, label %if.then231
lor.lhs.false207: ; preds = %do.end202 lor.lhs.false207: ; preds = %do.end202
br i1 undef, label %lor.lhs.false214, label %if.then231 br i1 %replace_undef_16, label %lor.lhs.false214, label %if.then231
lor.lhs.false214: ; preds = %lor.lhs.false207 lor.lhs.false214: ; preds = %lor.lhs.false207
br i1 undef, label %do.end236, label %land.lhs.true221 br i1 %replace_undef_17, label %do.end236, label %land.lhs.true221
land.lhs.true221: ; preds = %lor.lhs.false214 land.lhs.true221: ; preds = %lor.lhs.false214
br i1 undef, label %if.then231, label %do.end236 br i1 %replace_undef_18, label %if.then231, label %do.end236
if.then231: ; preds = %land.lhs.true221, %lor.lhs.false207, %do.end202 if.then231: ; preds = %land.lhs.true221, %lor.lhs.false207, %do.end202
br label %next_iter_mntunlocked br label %next_iter_mntunlocked
do.end236: ; preds = %land.lhs.true221, %lor.lhs.false214 do.end236: ; preds = %land.lhs.true221, %lor.lhs.false214
br label %next_iter_mntunlocked br label %next_iter_mntunlocked
next_iter_mntunlocked: ; preds = %do.end236, %if.then231, %if.then182 next_iter_mntunlocked: ; preds = %do.end236, %if.then231, %if.then182
br i1 undef, label %yield, label %do.body269 br i1 %replace_undef_19, label %yield, label %do.body269
next_iter: ; preds = %if.then156, %do.body145, %if.end72 next_iter: ; preds = %if.then156, %do.body145, %if.end72
%rem2482 = and i32 %dec, 255 ; <i32> [#uses=1] %rem2482 = and i32 %dec, 255 ; <i32> [#uses=1]
%cmp249 = icmp eq i32 %rem2482, 0 ; <i1> [#uses=1] %cmp249 = icmp eq i32 %rem2482, 0 ; <i1> [#uses=1]
br i1 %cmp249, label %do.body253, label %while.cond br i1 %cmp249, label %do.body253, label %while.cond
do.body253: ; preds = %next_iter do.body253: ; preds = %next_iter
br i1 undef, label %if.then264, label %yield br i1 %replace_undef_20, label %if.then264, label %yield
if.then264: ; preds = %do.body253 if.then264: ; preds = %do.body253
br label %yield br label %yield
yield: ; preds = %if.then264, %do.body253, %next_iter_mntunlocked yield: ; preds = %if.then264, %do.body253, %next_iter_mntunlocked
br label %do.body269 br label %do.body269
do.body269: ; preds = %yield, %next_iter_mntunlocked do.body269: ; preds = %yield, %next_iter_mntunlocked
br i1 undef, label %if.then280, label %while.cond.outer.backedge br i1 %replace_undef_21, label %if.then280, label %while.cond.outer.backedge
if.then280: ; preds = %do.body269 if.then280: ; preds = %do.body269
br label %while.cond.outer.backedge br label %while.cond.outer.backedge
while.cond.outer.backedge: ; preds = %if.then280, %do.body269 while.cond.outer.backedge: ; preds = %if.then280, %do.body269
br label %while.cond.outer br label %while.cond.outer
do.body288.loopexit: ; preds = %while.cond27 do.body288.loopexit: ; preds = %while.cond27
br label %do.body288 br label %do.body288
do.body288.loopexit4: ; preds = %while.end, %while.cond do.body288.loopexit4: ; preds = %while.end, %while.cond
br label %do.body288 br label %do.body288
do.body288: ; preds = %do.body288.loopexit4, %do.body288.loopexit do.body288: ; preds = %do.body288.loopexit4, %do.body288.loopexit
br i1 undef, label %if.then299, label %do.end303 br i1 %replace_undef_22, label %if.then299, label %do.end303
if.then299: ; preds = %do.body288 if.then299: ; preds = %do.body288
br label %do.end303 br label %do.end303
do.end303: ; preds = %if.then299, %do.body288 do.end303: ; preds = %if.then299, %do.body288
ret i32 undef ret i32 undef
} }

llvm/test/Analysis/ScalarEvolution/different-loops-recs.ll

Show First 20 Lines • Show All 255 Lines • ▼ Show 20 Lines
exit: exit:
ret void ret void
} }
; Another mix of previous use cases that demonstrates that incorrect picking of ; Another mix of previous use cases that demonstrates that incorrect picking of
; a loop for a recurrence may cause a crash of SCEV analysis. ; a loop for a recurrence may cause a crash of SCEV analysis.
define void @test_04() { define void @test_04( i1 %replace_undef_0) {
; CHECK-LABEL: Classifying expressions for: @test_04 ; CHECK-LABEL: Classifying expressions for: @test_04
; CHECK: %tmp = phi i64 [ 2, %bb ], [ %tmp4, %bb3 ] ; CHECK: %tmp = phi i64 [ 2, %bb ], [ %tmp4, %bb3 ]
; CHECK-NEXT: --> {2,+,1}<nuw><nsw><%loop1> ; CHECK-NEXT: --> {2,+,1}<nuw><nsw><%loop1>
; CHECK: %tmp2 = trunc i64 %tmp to i32 ; CHECK: %tmp2 = trunc i64 %tmp to i32
; CHECK-NEXT: --> {2,+,1}<%loop1> ; CHECK-NEXT: --> {2,+,1}<%loop1>
; CHECK: %tmp4 = add nuw nsw i64 %tmp, 1 ; CHECK: %tmp4 = add nuw nsw i64 %tmp, 1
; CHECK-NEXT: --> {3,+,1}<nuw><%loop1> ; CHECK-NEXT: --> {3,+,1}<nuw><%loop1>
Show All 12 Lines
; CHECK-NEXT: --> {3,+,1}<nuw><nsw><%loop2> ; CHECK-NEXT: --> {3,+,1}<nuw><nsw><%loop2>
bb: bb:
br label %loop1 br label %loop1
loop1: loop1:
%tmp = phi i64 [ 2, %bb ], [ %tmp4, %bb3 ] %tmp = phi i64 [ 2, %bb ], [ %tmp4, %bb3 ]
%tmp2 = trunc i64 %tmp to i32 %tmp2 = trunc i64 %tmp to i32
br i1 undef, label %loop2, label %bb3 br i1 %replace_undef_0, label %loop2, label %bb3
bb3: bb3:
%tmp4 = add nuw nsw i64 %tmp, 1 %tmp4 = add nuw nsw i64 %tmp, 1
br label %loop1 br label %loop1
bb5: bb5:
ret void ret void
▲ Show 20 Lines • Show All 331 Lines • Show Last 20 Lines

llvm/test/Analysis/ScalarEvolution/expander-replace-congruent-ivs.ll

; RUN: opt -S -passes=indvars < %s | FileCheck %s ; RUN: opt -S -passes=indvars < %s | FileCheck %s
target datalayout = "e-m:o-i64:64-f80:128-n8:16:32:64-S128" target datalayout = "e-m:o-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-apple-macosx10.11.0" target triple = "x86_64-apple-macosx10.11.0"
; SCEVExpander would try to RAUW %val_2 with %c.lcssa, breaking "def ; SCEVExpander would try to RAUW %val_2 with %c.lcssa, breaking "def
; dominates uses". ; dominates uses".
define void @pr27232(i32 %val) { define void @pr27232(i32 %val, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
; CHECK-LABEL: @pr27232( ; CHECK-LABEL: @pr27232(
entry: entry:
br i1 undef, label %loop_0.cond, label %for.body.us br i1 %replace_undef_0, label %loop_0.cond, label %for.body.us
for.body.us: for.body.us:
br label %loop_0.cond br label %loop_0.cond
loop_0.cond: loop_0.cond:
%val_2 = phi i32 [ %val, %for.body.us ], [ undef, %entry ] %val_2 = phi i32 [ %val, %for.body.us ], [ undef, %entry ]
br i1 true, label %loop_0.ph, label %loop_1.ph br i1 true, label %loop_0.ph, label %loop_1.ph
loop_0.ph: loop_0.ph:
br label %loop_0 br label %loop_0
loop_1.exit: loop_1.exit:
br label %loop_1.ph br label %loop_1.ph
loop_1.ph: loop_1.ph:
%c.lcssa = phi i32 [ 0, %loop_0.cond ], [ %val_2, %loop_1.exit ] %c.lcssa = phi i32 [ 0, %loop_0.cond ], [ %val_2, %loop_1.exit ]
br label %loop_1 br label %loop_1
loop_0: loop_0:
br i1 undef, label %loop_0, label %loop_1.exit br i1 %replace_undef_1, label %loop_0, label %loop_1.exit
loop_1: loop_1:
%d.1 = phi i32 [ %c.lcssa, %loop_1 ], [ %val_2, %loop_1.ph ] %d.1 = phi i32 [ %c.lcssa, %loop_1 ], [ %val_2, %loop_1.ph ]
%t.1 = phi i32 [ %val_2, %loop_1 ], [ %c.lcssa, %loop_1.ph ] %t.1 = phi i32 [ %val_2, %loop_1 ], [ %c.lcssa, %loop_1.ph ]
br i1 undef, label %leave, label %loop_1 br i1 %replace_undef_2, label %leave, label %loop_1
leave: leave:
ret void ret void
} }
; @ReplaceArg_0 and @ReplaceArg_1 used to trigger a failed cast<> ; @ReplaceArg_0 and @ReplaceArg_1 used to trigger a failed cast<>
; assertion in SCEVExpander. ; assertion in SCEVExpander.
define void @ReplaceArg_0(i32 %val) { define void @ReplaceArg_0(i32 %val, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
; CHECK-LABEL: @ReplaceArg_0( ; CHECK-LABEL: @ReplaceArg_0(
entry: entry:
br i1 undef, label %loop_0.cond, label %for.body.us br i1 %replace_undef_0, label %loop_0.cond, label %for.body.us
for.body.us: for.body.us:
br label %loop_0.cond br label %loop_0.cond
loop_0.cond: loop_0.cond:
br i1 true, label %loop_0.ph, label %loop_1.ph br i1 true, label %loop_0.ph, label %loop_1.ph
loop_0.ph: loop_0.ph:
br label %loop_0 br label %loop_0
loop_1.exit: loop_1.exit:
br label %loop_1.ph br label %loop_1.ph
loop_1.ph: loop_1.ph:
%c.lcssa = phi i32 [ 0, %loop_0.cond ], [ %val, %loop_1.exit ] %c.lcssa = phi i32 [ 0, %loop_0.cond ], [ %val, %loop_1.exit ]
br label %loop_1 br label %loop_1
loop_0: loop_0:
br i1 undef, label %loop_0, label %loop_1.exit br i1 %replace_undef_1, label %loop_0, label %loop_1.exit
loop_1: loop_1:
%d.1 = phi i32 [ %c.lcssa, %loop_1 ], [ %val, %loop_1.ph ] %d.1 = phi i32 [ %c.lcssa, %loop_1 ], [ %val, %loop_1.ph ]
%t.1 = phi i32 [ %val, %loop_1 ], [ %c.lcssa, %loop_1.ph ] %t.1 = phi i32 [ %val, %loop_1 ], [ %c.lcssa, %loop_1.ph ]
br i1 undef, label %leave, label %loop_1 br i1 %replace_undef_2, label %leave, label %loop_1
leave: leave:
ret void ret void
} }
define void @ReplaceArg_1(i32 %val) { define void @ReplaceArg_1(i32 %val, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
; CHECK-LABEL: @ReplaceArg_1( ; CHECK-LABEL: @ReplaceArg_1(
entry: entry:
br i1 undef, label %loop_0.cond, label %for.body.us br i1 %replace_undef_0, label %loop_0.cond, label %for.body.us
for.body.us: for.body.us:
br label %loop_0.cond br label %loop_0.cond
loop_0.cond: loop_0.cond:
br i1 true, label %loop_0.ph, label %loop_1.ph br i1 true, label %loop_0.ph, label %loop_1.ph
loop_0.ph: loop_0.ph:
br label %loop_0 br label %loop_0
loop_1.exit: loop_1.exit:
br label %loop_1.ph br label %loop_1.ph
loop_1.ph: loop_1.ph:
%c.lcssa = phi i32 [ 0, %loop_0.cond ], [ %val, %loop_1.exit ] %c.lcssa = phi i32 [ 0, %loop_0.cond ], [ %val, %loop_1.exit ]
br label %loop_1 br label %loop_1
loop_0: loop_0:
br i1 undef, label %loop_0, label %loop_1.exit br i1 %replace_undef_1, label %loop_0, label %loop_1.exit
loop_1: loop_1:
%t.1 = phi i32 [ %val, %loop_1 ], [ %c.lcssa, %loop_1.ph ] %t.1 = phi i32 [ %val, %loop_1 ], [ %c.lcssa, %loop_1.ph ]
%d.1 = phi i32 [ %c.lcssa, %loop_1 ], [ %val, %loop_1.ph ] %d.1 = phi i32 [ %c.lcssa, %loop_1 ], [ %val, %loop_1.ph ]
br i1 undef, label %leave, label %loop_1 br i1 %replace_undef_2, label %leave, label %loop_1
leave: leave:
ret void ret void
} }

llvm/test/Analysis/ScalarEvolution/how-far-to-zero.ll

; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" 2>&1 | FileCheck %s ; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" 2>&1 | FileCheck %s
; PR13228 ; PR13228
define void @f() nounwind uwtable readnone { define void @f( i1 %replace_undef_0) nounwind uwtable readnone {
entry: entry:
br label %for.cond br label %for.cond
for.cond: ; preds = %for.cond, %entry for.cond: ; preds = %for.cond, %entry
%c.0 = phi i8 [ 1, %entry ], [ 0, %for.cond ] %c.0 = phi i8 [ 1, %entry ], [ 0, %for.cond ]
%i.0 = phi i8 [ 0, %entry ], [ %inc, %for.cond ] %i.0 = phi i8 [ 0, %entry ], [ %inc, %for.cond ]
%lnot = icmp eq i8 %i.0, 0 %lnot = icmp eq i8 %i.0, 0
%inc = add i8 %i.0, 1 %inc = add i8 %i.0, 1
br i1 %lnot, label %for.cond, label %while.cond br i1 %lnot, label %for.cond, label %while.cond
while.cond: ; preds = %while.body, %for.cond while.cond: ; preds = %while.body, %for.cond
%b.2 = phi i8 [ %add, %while.body ], [ 0, %for.cond ] %b.2 = phi i8 [ %add, %while.body ], [ 0, %for.cond ]
br i1 undef, label %while.end, label %while.body br i1 %replace_undef_0, label %while.end, label %while.body
while.body: ; preds = %while.cond while.body: ; preds = %while.cond
%add = add i8 %b.2, %c.0 %add = add i8 %b.2, %c.0
%tobool7 = icmp eq i8 %add, 0 %tobool7 = icmp eq i8 %add, 0
br i1 %tobool7, label %while.end, label %while.cond br i1 %tobool7, label %while.end, label %while.cond
while.end: ; preds = %while.body, %while.cond while.end: ; preds = %while.body, %while.cond
ret void ret void
} }
;CHECK: Loop %while.cond: <multiple exits> Unpredictable backedge-taken count. ;CHECK: Loop %while.cond: <multiple exits> Unpredictable backedge-taken count.

llvm/test/Analysis/ScalarEvolution/overflow-intrinsics-trip-count.ll

; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py ; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" -scalar-evolution-classify-expressions=0 2>&1 | FileCheck %s ; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" -scalar-evolution-classify-expressions=0 2>&1 | FileCheck %s
declare { i16, i1 } @llvm.sadd.with.overflow.i16(i16, i16) nounwind readnone declare { i16, i1 } @llvm.sadd.with.overflow.i16(i16, i16) nounwind readnone
declare { i16, i1 } @llvm.uadd.with.overflow.i16(i16, i16) nounwind readnone declare { i16, i1 } @llvm.uadd.with.overflow.i16(i16, i16) nounwind readnone
declare { i16, i1 } @llvm.ssub.with.overflow.i16(i16, i16) nounwind readnone declare { i16, i1 } @llvm.ssub.with.overflow.i16(i16, i16) nounwind readnone
declare { i16, i1 } @llvm.usub.with.overflow.i16(i16, i16) nounwind readnone declare { i16, i1 } @llvm.usub.with.overflow.i16(i16, i16) nounwind readnone
declare { i16, i1 } @llvm.smul.with.overflow.i16(i16, i16) nounwind readnone declare { i16, i1 } @llvm.smul.with.overflow.i16(i16, i16) nounwind readnone
declare { i16, i1 } @llvm.umul.with.overflow.i16(i16, i16) nounwind readnone declare { i16, i1 } @llvm.umul.with.overflow.i16(i16, i16) nounwind readnone
define void @uadd_exhaustive() { define void @uadd_exhaustive( i1 %replace_undef_0) {
; CHECK-LABEL: 'uadd_exhaustive' ; CHECK-LABEL: 'uadd_exhaustive'
; CHECK-NEXT: Determining loop execution counts for: @uadd_exhaustive ; CHECK-NEXT: Determining loop execution counts for: @uadd_exhaustive
; CHECK-NEXT: Loop %for.body: backedge-taken count is 35 ; CHECK-NEXT: Loop %for.body: backedge-taken count is 35
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 35 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 35
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 35 ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 35
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 35 ; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 35
; CHECK-NEXT: Predicates: ; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 36 ; CHECK: Loop %for.body: Trip multiple is 36
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ 65500, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ 65500, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.uadd.with.overflow.i16(i16 %indvars.iv, i16 1) %0 = call { i16, i1 } @llvm.uadd.with.overflow.i16(i16 %indvars.iv, i16 1)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
br i1 %ov, label %for.end, label %for.body br i1 %ov, label %for.end, label %for.body
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @sadd_exhaustive() { define void @sadd_exhaustive( i1 %replace_undef_0) {
; CHECK-LABEL: 'sadd_exhaustive' ; CHECK-LABEL: 'sadd_exhaustive'
; CHECK-NEXT: Determining loop execution counts for: @sadd_exhaustive ; CHECK-NEXT: Determining loop execution counts for: @sadd_exhaustive
; CHECK-NEXT: Loop %for.body: backedge-taken count is 67 ; CHECK-NEXT: Loop %for.body: backedge-taken count is 67
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 67 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 67
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 67 ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 67
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 67 ; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 67
; CHECK-NEXT: Predicates: ; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 68 ; CHECK: Loop %for.body: Trip multiple is 68
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ 32700, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ 32700, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1) %0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
br i1 %ov, label %for.end, label %for.body br i1 %ov, label %for.end, label %for.body
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @usub_exhaustive() { define void @usub_exhaustive( i1 %replace_undef_0) {
; CHECK-LABEL: 'usub_exhaustive' ; CHECK-LABEL: 'usub_exhaustive'
; CHECK-NEXT: Determining loop execution counts for: @usub_exhaustive ; CHECK-NEXT: Determining loop execution counts for: @usub_exhaustive
; CHECK-NEXT: Loop %for.body: backedge-taken count is 50 ; CHECK-NEXT: Loop %for.body: backedge-taken count is 50
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 50 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 50
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 50 ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 50
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 50 ; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 50
; CHECK-NEXT: Predicates: ; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 51 ; CHECK: Loop %for.body: Trip multiple is 51
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ 50, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ 50, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.usub.with.overflow.i16(i16 %indvars.iv, i16 1) %0 = call { i16, i1 } @llvm.usub.with.overflow.i16(i16 %indvars.iv, i16 1)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
br i1 %ov, label %for.end, label %for.body br i1 %ov, label %for.end, label %for.body
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @ssub_exhaustive() { define void @ssub_exhaustive( i1 %replace_undef_0) {
; CHECK-LABEL: 'ssub_exhaustive' ; CHECK-LABEL: 'ssub_exhaustive'
; CHECK-NEXT: Determining loop execution counts for: @ssub_exhaustive ; CHECK-NEXT: Determining loop execution counts for: @ssub_exhaustive
; CHECK-NEXT: Loop %for.body: backedge-taken count is 68 ; CHECK-NEXT: Loop %for.body: backedge-taken count is 68
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 68 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 68
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 68 ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 68
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 68 ; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 68
; CHECK-NEXT: Predicates: ; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 69 ; CHECK: Loop %for.body: Trip multiple is 69
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ -32700, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ -32700, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.ssub.with.overflow.i16(i16 %indvars.iv, i16 1) %0 = call { i16, i1 } @llvm.ssub.with.overflow.i16(i16 %indvars.iv, i16 1)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
br i1 %ov, label %for.end, label %for.body br i1 %ov, label %for.end, label %for.body
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @smul_exhaustive() { define void @smul_exhaustive( i1 %replace_undef_0) {
; CHECK-LABEL: 'smul_exhaustive' ; CHECK-LABEL: 'smul_exhaustive'
; CHECK-NEXT: Determining loop execution counts for: @smul_exhaustive ; CHECK-NEXT: Determining loop execution counts for: @smul_exhaustive
; CHECK-NEXT: Loop %for.body: backedge-taken count is 14 ; CHECK-NEXT: Loop %for.body: backedge-taken count is 14
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 14 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 14
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 14 ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 14
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 14 ; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 14
; CHECK-NEXT: Predicates: ; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 15 ; CHECK: Loop %for.body: Trip multiple is 15
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ 1, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ 1, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.smul.with.overflow.i16(i16 %indvars.iv, i16 2) %0 = call { i16, i1 } @llvm.smul.with.overflow.i16(i16 %indvars.iv, i16 2)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
br i1 %ov, label %for.end, label %for.body br i1 %ov, label %for.end, label %for.body
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @umul_exhaustive() { define void @umul_exhaustive( i1 %replace_undef_0) {
; CHECK-LABEL: 'umul_exhaustive' ; CHECK-LABEL: 'umul_exhaustive'
; CHECK-NEXT: Determining loop execution counts for: @umul_exhaustive ; CHECK-NEXT: Determining loop execution counts for: @umul_exhaustive
; CHECK-NEXT: Loop %for.body: backedge-taken count is 15 ; CHECK-NEXT: Loop %for.body: backedge-taken count is 15
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 15 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 15
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 15 ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 15
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 15 ; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 15
; CHECK-NEXT: Predicates: ; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 16 ; CHECK: Loop %for.body: Trip multiple is 16
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ 1, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ 1, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.umul.with.overflow.i16(i16 %indvars.iv, i16 2) %0 = call { i16, i1 } @llvm.umul.with.overflow.i16(i16 %indvars.iv, i16 2)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
br i1 %ov, label %for.end, label %for.body br i1 %ov, label %for.end, label %for.body
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @uadd_symbolic_start(i16 %start) { define void @uadd_symbolic_start(i16 %start, i1 %replace_undef_0) {
; CHECK-LABEL: 'uadd_symbolic_start' ; CHECK-LABEL: 'uadd_symbolic_start'
; CHECK-NEXT: Determining loop execution counts for: @uadd_symbolic_start ; CHECK-NEXT: Determining loop execution counts for: @uadd_symbolic_start
; CHECK-NEXT: Loop %for.body: backedge-taken count is (-1 + (-1 * %start)) ; CHECK-NEXT: Loop %for.body: backedge-taken count is (-1 + (-1 * %start))
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (-1 * %start)) ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (-1 * %start))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (-1 * %start)) ; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (-1 * %start))
; CHECK-NEXT: Predicates: ; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1 ; CHECK: Loop %for.body: Trip multiple is 1
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.uadd.with.overflow.i16(i16 %indvars.iv, i16 1) %0 = call { i16, i1 } @llvm.uadd.with.overflow.i16(i16 %indvars.iv, i16 1)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
br i1 %ov, label %for.end, label %for.body br i1 %ov, label %for.end, label %for.body
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @sadd_symbolic_start(i16 %start) { define void @sadd_symbolic_start(i16 %start, i1 %replace_undef_0) {
; CHECK-LABEL: 'sadd_symbolic_start' ; CHECK-LABEL: 'sadd_symbolic_start'
; CHECK-NEXT: Determining loop execution counts for: @sadd_symbolic_start ; CHECK-NEXT: Determining loop execution counts for: @sadd_symbolic_start
; CHECK-NEXT: Loop %for.body: backedge-taken count is (32767 + (-1 * %start)) ; CHECK-NEXT: Loop %for.body: backedge-taken count is (32767 + (-1 * %start))
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (32767 + (-1 * %start)) ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (32767 + (-1 * %start))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (32767 + (-1 * %start)) ; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (32767 + (-1 * %start))
; CHECK-NEXT: Predicates: ; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1 ; CHECK: Loop %for.body: Trip multiple is 1
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1) %0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
br i1 %ov, label %for.end, label %for.body br i1 %ov, label %for.end, label %for.body
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @sadd_symbolic_start2(i16 %start) { define void @sadd_symbolic_start2(i16 %start, i1 %replace_undef_0) {
; CHECK-LABEL: 'sadd_symbolic_start2' ; CHECK-LABEL: 'sadd_symbolic_start2'
; CHECK-NEXT: Determining loop execution counts for: @sadd_symbolic_start2 ; CHECK-NEXT: Determining loop execution counts for: @sadd_symbolic_start2
; CHECK-NEXT: Loop %for.body: Unpredictable backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %for.body: Unpredictable constant max backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Unpredictable predicated backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable predicated backedge-taken count.
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1) %0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
%not = xor i1 true, %ov %not = xor i1 true, %ov
br i1 %not, label %for.body, label %for.end br i1 %not, label %for.body, label %for.end
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @sadd_symbolic_swapped(i16 %start) { define void @sadd_symbolic_swapped(i16 %start, i1 %replace_undef_0) {
; CHECK-LABEL: 'sadd_symbolic_swapped' ; CHECK-LABEL: 'sadd_symbolic_swapped'
; CHECK-NEXT: Determining loop execution counts for: @sadd_symbolic_swapped ; CHECK-NEXT: Determining loop execution counts for: @sadd_symbolic_swapped
; CHECK-NEXT: Loop %for.body: Unpredictable backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %for.body: Unpredictable constant max backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Unpredictable predicated backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable predicated backedge-taken count.
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1) %0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
br i1 %ov, label %for.body, label %for.end br i1 %ov, label %for.body, label %for.end
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @usub_symbolic_start(i16 %start) { define void @usub_symbolic_start(i16 %start, i1 %replace_undef_0) {
; CHECK-LABEL: 'usub_symbolic_start' ; CHECK-LABEL: 'usub_symbolic_start'
; CHECK-NEXT: Determining loop execution counts for: @usub_symbolic_start ; CHECK-NEXT: Determining loop execution counts for: @usub_symbolic_start
; CHECK-NEXT: Loop %for.body: backedge-taken count is %start ; CHECK-NEXT: Loop %for.body: backedge-taken count is %start
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is %start ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is %start
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is %start ; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is %start
; CHECK-NEXT: Predicates: ; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1 ; CHECK: Loop %for.body: Trip multiple is 1
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.usub.with.overflow.i16(i16 %indvars.iv, i16 1) %0 = call { i16, i1 } @llvm.usub.with.overflow.i16(i16 %indvars.iv, i16 1)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
br i1 %ov, label %for.end, label %for.body br i1 %ov, label %for.end, label %for.body
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @ssub_symbolic_start(i16 %start) { define void @ssub_symbolic_start(i16 %start, i1 %replace_undef_0) {
; CHECK-LABEL: 'ssub_symbolic_start' ; CHECK-LABEL: 'ssub_symbolic_start'
; CHECK-NEXT: Determining loop execution counts for: @ssub_symbolic_start ; CHECK-NEXT: Determining loop execution counts for: @ssub_symbolic_start
; CHECK-NEXT: Loop %for.body: backedge-taken count is (-32768 + %start) ; CHECK-NEXT: Loop %for.body: backedge-taken count is (-32768 + %start)
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-32768 + %start) ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-32768 + %start)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-32768 + %start) ; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-32768 + %start)
; CHECK-NEXT: Predicates: ; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1 ; CHECK: Loop %for.body: Trip multiple is 1
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.ssub.with.overflow.i16(i16 %indvars.iv, i16 1) %0 = call { i16, i1 } @llvm.ssub.with.overflow.i16(i16 %indvars.iv, i16 1)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
br i1 %ov, label %for.end, label %for.body br i1 %ov, label %for.end, label %for.body
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @smul_symbolic_start(i16 %start) { define void @smul_symbolic_start(i16 %start, i1 %replace_undef_0) {
; CHECK-LABEL: 'smul_symbolic_start' ; CHECK-LABEL: 'smul_symbolic_start'
; CHECK-NEXT: Determining loop execution counts for: @smul_symbolic_start ; CHECK-NEXT: Determining loop execution counts for: @smul_symbolic_start
; CHECK-NEXT: Loop %for.body: Unpredictable backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %for.body: Unpredictable constant max backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Unpredictable predicated backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable predicated backedge-taken count.
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.smul.with.overflow.i16(i16 %indvars.iv, i16 2) %0 = call { i16, i1 } @llvm.smul.with.overflow.i16(i16 %indvars.iv, i16 2)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
br i1 %ov, label %for.end, label %for.body br i1 %ov, label %for.end, label %for.body
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @umul_symbolic_start(i16 %start) { define void @umul_symbolic_start(i16 %start, i1 %replace_undef_0) {
; CHECK-LABEL: 'umul_symbolic_start' ; CHECK-LABEL: 'umul_symbolic_start'
; CHECK-NEXT: Determining loop execution counts for: @umul_symbolic_start ; CHECK-NEXT: Determining loop execution counts for: @umul_symbolic_start
; CHECK-NEXT: Loop %for.body: Unpredictable backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %for.body: Unpredictable constant max backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Unpredictable predicated backedge-taken count. ; CHECK-NEXT: Loop %for.body: Unpredictable predicated backedge-taken count.
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.umul.with.overflow.i16(i16 %indvars.iv, i16 2) %0 = call { i16, i1 } @llvm.umul.with.overflow.i16(i16 %indvars.iv, i16 2)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
%ov = extractvalue { i16, i1 } %0, 1 %ov = extractvalue { i16, i1 } %0, 1
br i1 %ov, label %for.end, label %for.body br i1 %ov, label %for.end, label %for.body
for.end: ; preds = %for.body, %entry for.end: ; preds = %for.body, %entry
ret void ret void
} }
define void @sadd_symbolic_non_latch(i16 %start) { define void @sadd_symbolic_non_latch(i16 %start, i1 %replace_undef_0) {
; CHECK-LABEL: 'sadd_symbolic_non_latch' ; CHECK-LABEL: 'sadd_symbolic_non_latch'
; CHECK-NEXT: Determining loop execution counts for: @sadd_symbolic_non_latch ; CHECK-NEXT: Determining loop execution counts for: @sadd_symbolic_non_latch
; CHECK-NEXT: Loop %for.body: <multiple exits> backedge-taken count is ((230 + (-1 * %start)) umin (32767 + (-1 * %start))) ; CHECK-NEXT: Loop %for.body: <multiple exits> backedge-taken count is ((230 + (-1 * %start)) umin (32767 + (-1 * %start)))
; CHECK-NEXT: exit count for for.body: (32767 + (-1 * %start)) ; CHECK-NEXT: exit count for for.body: (32767 + (-1 * %start))
; CHECK-NEXT: exit count for for.latch: (230 + (-1 * %start)) ; CHECK-NEXT: exit count for for.latch: (230 + (-1 * %start))
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1 ; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is ((230 + (-1 * %start)) umin (32767 + (-1 * %start))) ; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is ((230 + (-1 * %start)) umin (32767 + (-1 * %start)))
; CHECK-NEXT: symbolic max exit count for for.body: (32767 + (-1 * %start)) ; CHECK-NEXT: symbolic max exit count for for.body: (32767 + (-1 * %start))
; CHECK-NEXT: symbolic max exit count for for.latch: (230 + (-1 * %start)) ; CHECK-NEXT: symbolic max exit count for for.latch: (230 + (-1 * %start))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((230 + (-1 * %start)) umin (32767 + (-1 * %start))) ; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((230 + (-1 * %start)) umin (32767 + (-1 * %start)))
; CHECK-NEXT: Predicates: ; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1 ; CHECK: Loop %for.body: Trip multiple is 1
; ;
entry: entry:
br i1 undef, label %for.end, label %for.body.preheader br i1 %replace_undef_0, label %for.end, label %for.body.preheader
for.body.preheader: ; preds = %entry for.body.preheader: ; preds = %entry
br label %for.body br label %for.body
for.body: ; preds = %for.body.preheader, %for.body for.body: ; preds = %for.body.preheader, %for.body
%indvars.iv = phi i16 [ %math, %for.latch ], [ %start, %for.body.preheader ] %indvars.iv = phi i16 [ %math, %for.latch ], [ %start, %for.body.preheader ]
%0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1) %0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1)
%math = extractvalue { i16, i1 } %0, 0 %math = extractvalue { i16, i1 } %0, 0
Show All 10 Lines

llvm/test/Analysis/ScalarEvolution/pointer-sign-bits.ll

; RUN: opt < %s -passes='print<scalar-evolution>' ; RUN: opt < %s -passes='print<scalar-evolution>'
target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:32:32" target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:32:32"
%JavaObject = type { ptr, ptr } %JavaObject = type { ptr, ptr }
define void @JnJVM_antlr_CSharpCodeGenerator_genBitSet__Lantlr_collections_impl_BitSet_2I(ptr, ptr, i32) { define void @JnJVM_antlr_CSharpCodeGenerator_genBitSet__Lantlr_collections_impl_BitSet_2I(ptr, ptr, i32, i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2, i1 %replace_undef_3, i1 %replace_undef_4, i1 %replace_undef_5, i1 %replace_undef_6, i1 %replace_undef_7, i1 %replace_undef_8, i1 %replace_undef_9, i1 %replace_undef_10, i1 %replace_undef_11, i1 %replace_undef_12, i1 %replace_undef_13, i1 %replace_undef_14, i1 %replace_undef_15, i1 %replace_undef_16, i1 %replace_undef_17, i1 %replace_undef_18, i1 %replace_undef_19, i1 %replace_undef_20, i1 %replace_undef_21, i1 %replace_undef_22, i1 %replace_undef_23, i1 %replace_undef_24, i1 %replace_undef_25, i1 %replace_undef_26, i1 %replace_undef_27, i1 %replace_undef_28, i1 %replace_undef_29, i1 %replace_undef_30, i1 %replace_undef_31, i1 %replace_undef_32) {
start: start:
br i1 undef, label %"stack overflow", label %"no stack overflow" br i1 %replace_undef_0, label %"stack overflow", label %"no stack overflow"
"GOTO or IF*2": ; preds = %"true verifyAndComputePtr89", %verifyNullCont84 "GOTO or IF*2": ; preds = %"true verifyAndComputePtr89", %verifyNullCont84
unreachable unreachable
"GOTO or IF*5": ; preds = %"true verifyAndComputePtr127", %"GOTO or IF*6" "GOTO or IF*5": ; preds = %"true verifyAndComputePtr127", %"GOTO or IF*6"
unreachable unreachable
"GOTO or IF*6": ; preds = %"true verifyAndComputePtr131.GOTO or IF*6_crit_edge", %"true verifyAndComputePtr89" "GOTO or IF*6": ; preds = %"true verifyAndComputePtr131.GOTO or IF*6_crit_edge", %"true verifyAndComputePtr89"
%indvar = phi i32 [ %indvar.next, %"true verifyAndComputePtr131.GOTO or IF*6_crit_edge" ], [ 0, %"true verifyAndComputePtr89" ] ; <i32> [#uses=2] %indvar = phi i32 [ %indvar.next, %"true verifyAndComputePtr131.GOTO or IF*6_crit_edge" ], [ 0, %"true verifyAndComputePtr89" ] ; <i32> [#uses=2]
%.0.in = add i32 %indvar, 0 ; <i32> [#uses=1] %.0.in = add i32 %indvar, 0 ; <i32> [#uses=1]
%.0 = add i32 %.0.in, 1 ; <i32> [#uses=1] %.0 = add i32 %.0.in, 1 ; <i32> [#uses=1]
%3 = icmp slt i32 %.0, %4 ; <i1> [#uses=1] %3 = icmp slt i32 %.0, %4 ; <i1> [#uses=1]
br i1 %3, label %verifyNullCont126, label %"GOTO or IF*5" br i1 %3, label %verifyNullCont126, label %"GOTO or IF*5"
end: ; preds = %"no exception block35" end: ; preds = %"no exception block35"
ret void ret void
"stack overflow": ; preds = %start "stack overflow": ; preds = %start
ret void ret void
"no stack overflow": ; preds = %start "no stack overflow": ; preds = %start
br i1 undef, label %verifyNullCont, label %"no stack overflow.end_crit_edge" br i1 %replace_undef_1, label %verifyNullCont, label %"no stack overflow.end_crit_edge"
"no stack overflow.end_crit_edge": ; preds = %"no stack overflow" "no stack overflow.end_crit_edge": ; preds = %"no stack overflow"
ret void ret void
verifyNullCont: ; preds = %"no stack overflow" verifyNullCont: ; preds = %"no stack overflow"
br i1 undef, label %verifyNullCont9, label %verifyNullCont.end_crit_edge br i1 %replace_undef_2, label %verifyNullCont9, label %verifyNullCont.end_crit_edge
verifyNullCont.end_crit_edge: ; preds = %verifyNullCont verifyNullCont.end_crit_edge: ; preds = %verifyNullCont
ret void ret void
verifyNullCont9: ; preds = %verifyNullCont verifyNullCont9: ; preds = %verifyNullCont
br i1 undef, label %verifyNullCont12, label %verifyNullCont9.end_crit_edge br i1 %replace_undef_3, label %verifyNullCont12, label %verifyNullCont9.end_crit_edge
verifyNullCont9.end_crit_edge: ; preds = %verifyNullCont9 verifyNullCont9.end_crit_edge: ; preds = %verifyNullCont9
ret void ret void
verifyNullCont12: ; preds = %verifyNullCont9 verifyNullCont12: ; preds = %verifyNullCont9
br i1 undef, label %"no exception block13", label %verifyNullCont12.end_crit_edge br i1 %replace_undef_4, label %"no exception block13", label %verifyNullCont12.end_crit_edge
verifyNullCont12.end_crit_edge: ; preds = %verifyNullCont12 verifyNullCont12.end_crit_edge: ; preds = %verifyNullCont12
ret void ret void
"no exception block13": ; preds = %verifyNullCont12 "no exception block13": ; preds = %verifyNullCont12
br i1 undef, label %verifyNullExit14, label %verifyNullCont15 br i1 %replace_undef_5, label %verifyNullExit14, label %verifyNullCont15
verifyNullExit14: ; preds = %"no exception block13" verifyNullExit14: ; preds = %"no exception block13"
ret void ret void
verifyNullCont15: ; preds = %"no exception block13" verifyNullCont15: ; preds = %"no exception block13"
br i1 undef, label %"no exception block16", label %verifyNullCont15.end_crit_edge br i1 %replace_undef_6, label %"no exception block16", label %verifyNullCont15.end_crit_edge
verifyNullCont15.end_crit_edge: ; preds = %verifyNullCont15 verifyNullCont15.end_crit_edge: ; preds = %verifyNullCont15
ret void ret void
"no exception block16": ; preds = %verifyNullCont15 "no exception block16": ; preds = %verifyNullCont15
br i1 undef, label %verifyNullExit17, label %verifyNullCont18 br i1 %replace_undef_7, label %verifyNullExit17, label %verifyNullCont18
verifyNullExit17: ; preds = %"no exception block16" verifyNullExit17: ; preds = %"no exception block16"
ret void ret void
verifyNullCont18: ; preds = %"no exception block16" verifyNullCont18: ; preds = %"no exception block16"
br i1 undef, label %"no exception block19", label %verifyNullCont18.end_crit_edge br i1 %replace_undef_8, label %"no exception block19", label %verifyNullCont18.end_crit_edge
verifyNullCont18.end_crit_edge: ; preds = %verifyNullCont18 verifyNullCont18.end_crit_edge: ; preds = %verifyNullCont18
ret void ret void
"no exception block19": ; preds = %verifyNullCont18 "no exception block19": ; preds = %verifyNullCont18
br i1 undef, label %verifyNullExit20, label %verifyNullCont21 br i1 %replace_undef_9, label %verifyNullExit20, label %verifyNullCont21
verifyNullExit20: ; preds = %"no exception block19" verifyNullExit20: ; preds = %"no exception block19"
ret void ret void
verifyNullCont21: ; preds = %"no exception block19" verifyNullCont21: ; preds = %"no exception block19"
br i1 undef, label %verifyNullCont24, label %verifyNullCont21.end_crit_edge br i1 %replace_undef_10, label %verifyNullCont24, label %verifyNullCont21.end_crit_edge
verifyNullCont21.end_crit_edge: ; preds = %verifyNullCont21 verifyNullCont21.end_crit_edge: ; preds = %verifyNullCont21
ret void ret void
verifyNullCont24: ; preds = %verifyNullCont21 verifyNullCont24: ; preds = %verifyNullCont21
br i1 undef, label %verifyNullCont27, label %verifyNullCont24.end_crit_edge br i1 %replace_undef_11, label %verifyNullCont27, label %verifyNullCont24.end_crit_edge
verifyNullCont24.end_crit_edge: ; preds = %verifyNullCont24 verifyNullCont24.end_crit_edge: ; preds = %verifyNullCont24
ret void ret void
verifyNullCont27: ; preds = %verifyNullCont24 verifyNullCont27: ; preds = %verifyNullCont24
br i1 undef, label %verifyNullCont32, label %verifyNullCont27.end_crit_edge br i1 %replace_undef_12, label %verifyNullCont32, label %verifyNullCont27.end_crit_edge
verifyNullCont27.end_crit_edge: ; preds = %verifyNullCont27 verifyNullCont27.end_crit_edge: ; preds = %verifyNullCont27
ret void ret void
verifyNullCont32: ; preds = %verifyNullCont27 verifyNullCont32: ; preds = %verifyNullCont27
br i1 undef, label %verifyNullExit33, label %verifyNullCont34 br i1 %replace_undef_13, label %verifyNullExit33, label %verifyNullCont34
verifyNullExit33: ; preds = %verifyNullCont32 verifyNullExit33: ; preds = %verifyNullCont32
ret void ret void
verifyNullCont34: ; preds = %verifyNullCont32 verifyNullCont34: ; preds = %verifyNullCont32
br i1 undef, label %"no exception block35", label %verifyNullCont34.end_crit_edge br i1 %replace_undef_14, label %"no exception block35", label %verifyNullCont34.end_crit_edge
verifyNullCont34.end_crit_edge: ; preds = %verifyNullCont34 verifyNullCont34.end_crit_edge: ; preds = %verifyNullCont34
ret void ret void
"no exception block35": ; preds = %verifyNullCont34 "no exception block35": ; preds = %verifyNullCont34
br i1 undef, label %end, label %verifyNullCont60 br i1 %replace_undef_15, label %end, label %verifyNullCont60
verifyNullCont60: ; preds = %"no exception block35" verifyNullCont60: ; preds = %"no exception block35"
br i1 undef, label %verifyNullCont63, label %verifyNullCont60.end_crit_edge br i1 %replace_undef_16, label %verifyNullCont63, label %verifyNullCont60.end_crit_edge
verifyNullCont60.end_crit_edge: ; preds = %verifyNullCont60 verifyNullCont60.end_crit_edge: ; preds = %verifyNullCont60
ret void ret void
verifyNullCont63: ; preds = %verifyNullCont60 verifyNullCont63: ; preds = %verifyNullCont60
br i1 undef, label %"no exception block64", label %verifyNullCont63.end_crit_edge br i1 %replace_undef_17, label %"no exception block64", label %verifyNullCont63.end_crit_edge
verifyNullCont63.end_crit_edge: ; preds = %verifyNullCont63 verifyNullCont63.end_crit_edge: ; preds = %verifyNullCont63
ret void ret void
"no exception block64": ; preds = %verifyNullCont63 "no exception block64": ; preds = %verifyNullCont63
br i1 undef, label %verifyNullExit65, label %verifyNullCont66 br i1 %replace_undef_18, label %verifyNullExit65, label %verifyNullCont66
verifyNullExit65: ; preds = %"no exception block64" verifyNullExit65: ; preds = %"no exception block64"
ret void ret void
verifyNullCont66: ; preds = %"no exception block64" verifyNullCont66: ; preds = %"no exception block64"
br i1 undef, label %"no exception block67", label %verifyNullCont66.end_crit_edge br i1 %replace_undef_19, label %"no exception block67", label %verifyNullCont66.end_crit_edge
verifyNullCont66.end_crit_edge: ; preds = %verifyNullCont66 verifyNullCont66.end_crit_edge: ; preds = %verifyNullCont66
ret void ret void
"no exception block67": ; preds = %verifyNullCont66 "no exception block67": ; preds = %verifyNullCont66
br i1 undef, label %verifyNullExit68, label %verifyNullCont69 br i1 %replace_undef_20, label %verifyNullExit68, label %verifyNullCont69
verifyNullExit68: ; preds = %"no exception block67" verifyNullExit68: ; preds = %"no exception block67"
ret void ret void
verifyNullCont69: ; preds = %"no exception block67" verifyNullCont69: ; preds = %"no exception block67"
br i1 undef, label %"no exception block70", label %verifyNullCont69.end_crit_edge br i1 %replace_undef_21, label %"no exception block70", label %verifyNullCont69.end_crit_edge
verifyNullCont69.end_crit_edge: ; preds = %verifyNullCont69 verifyNullCont69.end_crit_edge: ; preds = %verifyNullCont69
ret void ret void
"no exception block70": ; preds = %verifyNullCont69 "no exception block70": ; preds = %verifyNullCont69
br i1 undef, label %verifyNullExit71, label %verifyNullCont72 br i1 %replace_undef_22, label %verifyNullExit71, label %verifyNullCont72
verifyNullExit71: ; preds = %"no exception block70" verifyNullExit71: ; preds = %"no exception block70"
ret void ret void
verifyNullCont72: ; preds = %"no exception block70" verifyNullCont72: ; preds = %"no exception block70"
br i1 undef, label %verifyNullCont75, label %verifyNullCont72.end_crit_edge br i1 %replace_undef_23, label %verifyNullCont75, label %verifyNullCont72.end_crit_edge
verifyNullCont72.end_crit_edge: ; preds = %verifyNullCont72 verifyNullCont72.end_crit_edge: ; preds = %verifyNullCont72
ret void ret void
verifyNullCont75: ; preds = %verifyNullCont72 verifyNullCont75: ; preds = %verifyNullCont72
br i1 undef, label %verifyNullCont78, label %verifyNullCont75.end_crit_edge br i1 %replace_undef_24, label %verifyNullCont78, label %verifyNullCont75.end_crit_edge
verifyNullCont75.end_crit_edge: ; preds = %verifyNullCont75 verifyNullCont75.end_crit_edge: ; preds = %verifyNullCont75
ret void ret void
verifyNullCont78: ; preds = %verifyNullCont75 verifyNullCont78: ; preds = %verifyNullCont75
br i1 undef, label %"verifyNullCont78.GOTO or IF*4_crit_edge", label %verifyNullCont78.end_crit_edge br i1 %replace_undef_25, label %"verifyNullCont78.GOTO or IF*4_crit_edge", label %verifyNullCont78.end_crit_edge
"verifyNullCont78.GOTO or IF*4_crit_edge": ; preds = %verifyNullCont78 "verifyNullCont78.GOTO or IF*4_crit_edge": ; preds = %verifyNullCont78
br i1 undef, label %verifyNullExit80, label %verifyNullCont81 br i1 %replace_undef_26, label %verifyNullExit80, label %verifyNullCont81
verifyNullCont78.end_crit_edge: ; preds = %verifyNullCont78 verifyNullCont78.end_crit_edge: ; preds = %verifyNullCont78
ret void ret void
verifyNullExit80: ; preds = %"verifyNullCont78.GOTO or IF*4_crit_edge" verifyNullExit80: ; preds = %"verifyNullCont78.GOTO or IF*4_crit_edge"
ret void ret void
verifyNullCont81: ; preds = %"verifyNullCont78.GOTO or IF*4_crit_edge" verifyNullCont81: ; preds = %"verifyNullCont78.GOTO or IF*4_crit_edge"
%4 = ptrtoint ptr undef to i32 ; <i32> [#uses=2] %4 = ptrtoint ptr undef to i32 ; <i32> [#uses=2]
%5 = icmp slt i32 0, %4 ; <i1> [#uses=1] %5 = icmp slt i32 0, %4 ; <i1> [#uses=1]
br i1 %5, label %verifyNullCont84, label %verifyNullCont172 br i1 %5, label %verifyNullCont84, label %verifyNullCont172
verifyNullCont84: ; preds = %verifyNullCont81 verifyNullCont84: ; preds = %verifyNullCont81
br i1 undef, label %"GOTO or IF*2", label %verifyNullCont86 br i1 %replace_undef_27, label %"GOTO or IF*2", label %verifyNullCont86
verifyNullCont86: ; preds = %verifyNullCont84 verifyNullCont86: ; preds = %verifyNullCont84
br i1 undef, label %"true verifyAndComputePtr", label %"false verifyAndComputePtr" br i1 %replace_undef_28, label %"true verifyAndComputePtr", label %"false verifyAndComputePtr"
"true verifyAndComputePtr": ; preds = %verifyNullCont86 "true verifyAndComputePtr": ; preds = %verifyNullCont86
br i1 undef, label %"true verifyAndComputePtr89", label %"false verifyAndComputePtr90" br i1 %replace_undef_29, label %"true verifyAndComputePtr89", label %"false verifyAndComputePtr90"
"false verifyAndComputePtr": ; preds = %verifyNullCont86 "false verifyAndComputePtr": ; preds = %verifyNullCont86
ret void ret void
"true verifyAndComputePtr89": ; preds = %"true verifyAndComputePtr" "true verifyAndComputePtr89": ; preds = %"true verifyAndComputePtr"
br i1 undef, label %"GOTO or IF*6", label %"GOTO or IF*2" br i1 %replace_undef_30, label %"GOTO or IF*6", label %"GOTO or IF*2"
"false verifyAndComputePtr90": ; preds = %"true verifyAndComputePtr" "false verifyAndComputePtr90": ; preds = %"true verifyAndComputePtr"
ret void ret void
verifyNullCont126: ; preds = %"GOTO or IF*6" verifyNullCont126: ; preds = %"GOTO or IF*6"
br i1 undef, label %"true verifyAndComputePtr127", label %"false verifyAndComputePtr128" br i1 %replace_undef_31, label %"true verifyAndComputePtr127", label %"false verifyAndComputePtr128"
"true verifyAndComputePtr127": ; preds = %verifyNullCont126 "true verifyAndComputePtr127": ; preds = %verifyNullCont126
br i1 undef, label %"true verifyAndComputePtr131.GOTO or IF*6_crit_edge", label %"GOTO or IF*5" br i1 %replace_undef_32, label %"true verifyAndComputePtr131.GOTO or IF*6_crit_edge", label %"GOTO or IF*5"
"false verifyAndComputePtr128": ; preds = %verifyNullCont126 "false verifyAndComputePtr128": ; preds = %verifyNullCont126
ret void ret void
"true verifyAndComputePtr131.GOTO or IF*6_crit_edge": ; preds = %"true verifyAndComputePtr127" "true verifyAndComputePtr131.GOTO or IF*6_crit_edge": ; preds = %"true verifyAndComputePtr127"
%indvar.next = add i32 %indvar, 1 ; <i32> [#uses=1] %indvar.next = add i32 %indvar, 1 ; <i32> [#uses=1]
br label %"GOTO or IF*6" br label %"GOTO or IF*6"
verifyNullCont172: ; preds = %verifyNullCont81 verifyNullCont172: ; preds = %verifyNullCont81
unreachable unreachable
} }

llvm/test/Analysis/ScalarEvolution/pr22674.ll

; RUN: opt -loop-reduce -S %s ; RUN: opt -loop-reduce -S %s
target datalayout = "e-m:e-p:32:32-i64:64-f80:128-n8:16:32:64-S128" target datalayout = "e-m:e-p:32:32-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnux32" target triple = "x86_64-pc-linux-gnux32"
%"class.llvm::AttributeSetNode.230.2029.3828.6141.6912.7683.8454.9482.9996.10253.18506" = type { %"class.llvm::FoldingSetImpl::Node.1.1801.3600.5913.6684.7455.8226.9254.9768.10025.18505", i32 } %"class.llvm::AttributeSetNode.230.2029.3828.6141.6912.7683.8454.9482.9996.10253.18506" = type { %"class.llvm::FoldingSetImpl::Node.1.1801.3600.5913.6684.7455.8226.9254.9768.10025.18505", i32 }
%"class.llvm::FoldingSetImpl::Node.1.1801.3600.5913.6684.7455.8226.9254.9768.10025.18505" = type { ptr } %"class.llvm::FoldingSetImpl::Node.1.1801.3600.5913.6684.7455.8226.9254.9768.10025.18505" = type { ptr }
%"struct.std::pair.241.2040.3839.6152.6923.7694.8465.9493.10007.10264.18507" = type { i32, ptr } %"struct.std::pair.241.2040.3839.6152.6923.7694.8465.9493.10007.10264.18507" = type { i32, ptr }
%"class.llvm::Attribute.222.2021.3820.6133.6904.7675.8446.9474.9988.10245.18509" = type { ptr } %"class.llvm::Attribute.222.2021.3820.6133.6904.7675.8446.9474.9988.10245.18509" = type { ptr }
%"class.llvm::AttributeImpl.2.1802.3601.5914.6685.7456.8227.9255.9769.10026.18508" = type <{ ptr, %"class.llvm::FoldingSetImpl::Node.1.1801.3600.5913.6684.7455.8226.9254.9768.10025.18505", i8, [3 x i8] }> %"class.llvm::AttributeImpl.2.1802.3601.5914.6685.7456.8227.9255.9769.10026.18508" = type <{ ptr, %"class.llvm::FoldingSetImpl::Node.1.1801.3600.5913.6684.7455.8226.9254.9768.10025.18505", i8, [3 x i8] }>
; Function Attrs: nounwind uwtable ; Function Attrs: nounwind uwtable
define void @_ZNK4llvm11AttrBuilder13hasAttributesENS_12AttributeSetEy() #0 align 2 { define void @_ZNK4llvm11AttrBuilder13hasAttributesENS_12AttributeSetEy( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2, i1 %replace_undef_3, i1 %replace_undef_4, i1 %replace_undef_5, i1 %replace_undef_6) #0 align 2 {
entry: entry:
br i1 undef, label %cond.false, label %_ZNK4llvm12AttributeSet11getNumSlotsEv.exit br i1 %replace_undef_0, label %cond.false, label %_ZNK4llvm12AttributeSet11getNumSlotsEv.exit
_ZNK4llvm12AttributeSet11getNumSlotsEv.exit: ; preds = %entry _ZNK4llvm12AttributeSet11getNumSlotsEv.exit: ; preds = %entry
br i1 undef, label %cond.false, label %for.body.lr.ph.for.body.lr.ph.split_crit_edge br i1 %replace_undef_1, label %cond.false, label %for.body.lr.ph.for.body.lr.ph.split_crit_edge
for.body.lr.ph.for.body.lr.ph.split_crit_edge: ; preds = %_ZNK4llvm12AttributeSet11getNumSlotsEv.exit for.body.lr.ph.for.body.lr.ph.split_crit_edge: ; preds = %_ZNK4llvm12AttributeSet11getNumSlotsEv.exit
br label %land.lhs.true.i br label %land.lhs.true.i
land.lhs.true.i: ; preds = %for.inc, %for.body.lr.ph.for.body.lr.ph.split_crit_edge land.lhs.true.i: ; preds = %for.inc, %for.body.lr.ph.for.body.lr.ph.split_crit_edge
%I.099 = phi i32 [ 0, %for.body.lr.ph.for.body.lr.ph.split_crit_edge ], [ %inc, %for.inc ] %I.099 = phi i32 [ 0, %for.body.lr.ph.for.body.lr.ph.split_crit_edge ], [ %inc, %for.inc ]
%cmp.i = icmp ugt i32 undef, %I.099 %cmp.i = icmp ugt i32 undef, %I.099
br i1 %cmp.i, label %_ZNK4llvm12AttributeSet12getSlotIndexEj.exit, label %cond.false.i.split br i1 %cmp.i, label %_ZNK4llvm12AttributeSet12getSlotIndexEj.exit, label %cond.false.i.split
cond.false.i.split: ; preds = %land.lhs.true.i cond.false.i.split: ; preds = %land.lhs.true.i
unreachable unreachable
_ZNK4llvm12AttributeSet12getSlotIndexEj.exit: ; preds = %land.lhs.true.i _ZNK4llvm12AttributeSet12getSlotIndexEj.exit: ; preds = %land.lhs.true.i
br i1 undef, label %for.end, label %for.inc br i1 %replace_undef_2, label %for.end, label %for.inc
for.inc: ; preds = %_ZNK4llvm12AttributeSet12getSlotIndexEj.exit for.inc: ; preds = %_ZNK4llvm12AttributeSet12getSlotIndexEj.exit
%inc = add i32 %I.099, 1 %inc = add i32 %I.099, 1
br i1 undef, label %cond.false, label %land.lhs.true.i br i1 %replace_undef_3, label %cond.false, label %land.lhs.true.i
for.end: ; preds = %_ZNK4llvm12AttributeSet12getSlotIndexEj.exit for.end: ; preds = %_ZNK4llvm12AttributeSet12getSlotIndexEj.exit
%I.099.lcssa129 = phi i32 [ %I.099, %_ZNK4llvm12AttributeSet12getSlotIndexEj.exit ] %I.099.lcssa129 = phi i32 [ %I.099, %_ZNK4llvm12AttributeSet12getSlotIndexEj.exit ]
br i1 undef, label %cond.false, label %_ZNK4llvm12AttributeSet3endEj.exit br i1 %replace_undef_4, label %cond.false, label %_ZNK4llvm12AttributeSet3endEj.exit
cond.false: ; preds = %for.end, %for.inc, %_ZNK4llvm12AttributeSet11getNumSlotsEv.exit, %entry cond.false: ; preds = %for.end, %for.inc, %_ZNK4llvm12AttributeSet11getNumSlotsEv.exit, %entry
unreachable unreachable
_ZNK4llvm12AttributeSet3endEj.exit: ; preds = %for.end _ZNK4llvm12AttributeSet3endEj.exit: ; preds = %for.end
%second.i.i.i = getelementptr inbounds %"struct.std::pair.241.2040.3839.6152.6923.7694.8465.9493.10007.10264.18507", ptr undef, i32 %I.099.lcssa129, i32 1 %second.i.i.i = getelementptr inbounds %"struct.std::pair.241.2040.3839.6152.6923.7694.8465.9493.10007.10264.18507", ptr undef, i32 %I.099.lcssa129, i32 1
%0 = load ptr, ptr %second.i.i.i, align 4, !tbaa !2 %0 = load ptr, ptr %second.i.i.i, align 4, !tbaa !2
%NumAttrs.i.i.i = getelementptr inbounds %"class.llvm::AttributeSetNode.230.2029.3828.6141.6912.7683.8454.9482.9996.10253.18506", ptr %0, i32 0, i32 1 %NumAttrs.i.i.i = getelementptr inbounds %"class.llvm::AttributeSetNode.230.2029.3828.6141.6912.7683.8454.9482.9996.10253.18506", ptr %0, i32 0, i32 1
%1 = load i32, ptr %NumAttrs.i.i.i, align 4, !tbaa !8 %1 = load i32, ptr %NumAttrs.i.i.i, align 4, !tbaa !8
%add.ptr.i.i.i55 = getelementptr inbounds %"class.llvm::Attribute.222.2021.3820.6133.6904.7675.8446.9474.9988.10245.18509", ptr undef, i32 %1 %add.ptr.i.i.i55 = getelementptr inbounds %"class.llvm::Attribute.222.2021.3820.6133.6904.7675.8446.9474.9988.10245.18509", ptr undef, i32 %1
br i1 undef, label %return, label %for.body11 br i1 %replace_undef_5, label %return, label %for.body11
for.cond9: ; preds = %_ZNK4llvm9Attribute13getKindAsEnumEv.exit for.cond9: ; preds = %_ZNK4llvm9Attribute13getKindAsEnumEv.exit
%cmp10 = icmp eq ptr %incdec.ptr, %add.ptr.i.i.i55 %cmp10 = icmp eq ptr %incdec.ptr, %add.ptr.i.i.i55
br i1 %cmp10, label %return, label %for.body11 br i1 %cmp10, label %return, label %for.body11
for.body11: ; preds = %for.cond9, %_ZNK4llvm12AttributeSet3endEj.exit for.body11: ; preds = %for.cond9, %_ZNK4llvm12AttributeSet3endEj.exit
%I5.096 = phi ptr [ %incdec.ptr, %for.cond9 ], [ undef, %_ZNK4llvm12AttributeSet3endEj.exit ] %I5.096 = phi ptr [ %incdec.ptr, %for.cond9 ], [ undef, %_ZNK4llvm12AttributeSet3endEj.exit ]
%2 = load i32, ptr %I5.096, align 4, !tbaa !10 %2 = load i32, ptr %I5.096, align 4, !tbaa !10
%tobool.i59 = icmp eq i32 %2, 0 %tobool.i59 = icmp eq i32 %2, 0
br i1 %tobool.i59, label %cond.false21, label %_ZNK4llvm9Attribute15isEnumAttributeEv.exit br i1 %tobool.i59, label %cond.false21, label %_ZNK4llvm9Attribute15isEnumAttributeEv.exit
_ZNK4llvm9Attribute15isEnumAttributeEv.exit: ; preds = %for.body11 _ZNK4llvm9Attribute15isEnumAttributeEv.exit: ; preds = %for.body11
switch i8 undef, label %cond.false21 [ switch i8 undef, label %cond.false21 [
i8 0, label %_ZNK4llvm9Attribute13getKindAsEnumEv.exit i8 0, label %_ZNK4llvm9Attribute13getKindAsEnumEv.exit
i8 1, label %_ZNK4llvm9Attribute13getKindAsEnumEv.exit i8 1, label %_ZNK4llvm9Attribute13getKindAsEnumEv.exit
i8 2, label %_ZNK4llvm9Attribute15getKindAsStringEv.exit i8 2, label %_ZNK4llvm9Attribute15getKindAsStringEv.exit
] ]
_ZNK4llvm9Attribute13getKindAsEnumEv.exit: ; preds = %_ZNK4llvm9Attribute15isEnumAttributeEv.exit, %_ZNK4llvm9Attribute15isEnumAttributeEv.exit _ZNK4llvm9Attribute13getKindAsEnumEv.exit: ; preds = %_ZNK4llvm9Attribute15isEnumAttributeEv.exit, %_ZNK4llvm9Attribute15isEnumAttributeEv.exit
%incdec.ptr = getelementptr inbounds %"class.llvm::Attribute.222.2021.3820.6133.6904.7675.8446.9474.9988.10245.18509", ptr %I5.096, i32 1 %incdec.ptr = getelementptr inbounds %"class.llvm::Attribute.222.2021.3820.6133.6904.7675.8446.9474.9988.10245.18509", ptr %I5.096, i32 1
br i1 undef, label %for.cond9, label %return br i1 %replace_undef_6, label %for.cond9, label %return
cond.false21: ; preds = %_ZNK4llvm9Attribute15isEnumAttributeEv.exit, %for.body11 cond.false21: ; preds = %_ZNK4llvm9Attribute15isEnumAttributeEv.exit, %for.body11
unreachable unreachable
_ZNK4llvm9Attribute15getKindAsStringEv.exit: ; preds = %_ZNK4llvm9Attribute15isEnumAttributeEv.exit _ZNK4llvm9Attribute15getKindAsStringEv.exit: ; preds = %_ZNK4llvm9Attribute15isEnumAttributeEv.exit
unreachable unreachable
return: ; preds = %_ZNK4llvm9Attribute13getKindAsEnumEv.exit, %for.cond9, %_ZNK4llvm12AttributeSet3endEj.exit return: ; preds = %_ZNK4llvm9Attribute13getKindAsEnumEv.exit, %for.cond9, %_ZNK4llvm12AttributeSet3endEj.exit
Show All 19 Lines

llvm/test/Analysis/ScalarEvolution/pr22856.ll

; RUN: opt -loop-reduce -verify < %s ; RUN: opt -loop-reduce -verify < %s
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64--linux-gnu" target triple = "x86_64--linux-gnu"
define void @unbounded() { define void @unbounded( i1 %replace_undef_0, i1 %replace_undef_1, i1 %replace_undef_2) {
block_A: block_A:
%0 = sext i32 undef to i64 %0 = sext i32 undef to i64
br i1 undef, label %block_F, label %block_G br i1 %replace_undef_0, label %block_F, label %block_G
block_C: ; preds = %block_F block_C: ; preds = %block_F
br i1 undef, label %block_D, label %block_E br i1 %replace_undef_1, label %block_D, label %block_E
block_D: ; preds = %block_D, %block_C block_D: ; preds = %block_D, %block_C
br i1 undef, label %block_E, label %block_D br i1 %replace_undef_2, label %block_E, label %block_D
block_E: ; preds = %block_D, %block_C block_E: ; preds = %block_D, %block_C
%iv2 = phi i64 [ %4, %block_D ], [ %4, %block_C ] %iv2 = phi i64 [ %4, %block_D ], [ %4, %block_C ]
%1 = add nsw i32 %iv1, 1 %1 = add nsw i32 %iv1, 1
%2 = icmp eq i32 %1, undef %2 = icmp eq i32 %1, undef
br i1 %2, label %block_G, label %block_F br i1 %2, label %block_G, label %block_F
block_F: ; preds = %block_E, %block_A block_F: ; preds = %block_E, %block_A
Show All 9 Lines

llvm/test/Analysis/ScalarEvolution/pr25369.ll

; RUN: opt -disable-output "-passes=print<scalar-evolution>" < %s 2>&1 | FileCheck %s ; RUN: opt -disable-output "-passes=print<scalar-evolution>" < %s 2>&1 | FileCheck %s
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-unknown-linux-gnu" target triple = "x86_64-unknown-linux-gnu"
define void @hoge1() { define void @hoge1( i1 %replace_undef_0) {
; CHECK-LABEL: Classifying expressions for: @hoge1 ; CHECK-LABEL: Classifying expressions for: @hoge1
bb: bb:
br i1 undef, label %bb4, label %bb2 br i1 %replace_undef_0, label %bb4, label %bb2
bb2: ; preds = %bb2, %bb bb2: ; preds = %bb2, %bb
br i1 false, label %bb4, label %bb2 br i1 false, label %bb4, label %bb2
bb3: ; preds = %bb4 bb3: ; preds = %bb4
%tmp = add i32 %tmp10, -1 %tmp = add i32 %tmp10, -1
br label %bb13 br label %bb13
Show All 17 Linesbb13: ; preds = %bb13, %bb3
%tmp16 = trunc i64 %tmp15 to i32 %tmp16 = trunc i64 %tmp15 to i32
%tmp17 = icmp eq i32 %tmp16, %tmp %tmp17 = icmp eq i32 %tmp16, %tmp
br i1 %tmp17, label %bb18, label %bb13 br i1 %tmp17, label %bb18, label %bb13
bb18: ; preds = %bb13 bb18: ; preds = %bb13
ret void ret void
} }
define void @hoge2() { define void @hoge2( i1 %replace_undef_0) {
; CHECK-LABEL: Classifying expressions for: @hoge2 ; CHECK-LABEL: Classifying expressions for: @hoge2
bb: bb:
br i1 undef, label %bb4, label %bb2 br i1 %replace_undef_0, label %bb4, label %bb2
bb2: ; preds = %bb2, %bb bb2: ; preds = %bb2, %bb
br i1 false, label %bb4, label %bb2 br i1 false, label %bb4, label %bb2
bb3: ; preds = %bb4 bb3: ; preds = %bb4
%tmp = add i32 %tmp10, -1 %tmp = add i32 %tmp10, -1
br label %bb13 br label %bb13
Show All 24 Lines

llvm/test/Analysis/ScalarEvolution/scev-aa.ll

Show First 20 Lines • Show All 217 Lines • ▼ Show 20 Lines
; CHECK: MayAlias: double* %addr1, double* %data ; CHECK: MayAlias: double* %addr1, double* %data
; CHECK: NoAlias: double* %addr2, double* %data ; CHECK: NoAlias: double* %addr2, double* %data
; CHECK: MayAlias: double* %addr1, double* %addr2 ; CHECK: MayAlias: double* %addr1, double* %addr2
; In this case, checking %addr1 and %add2 involves two addrecs in two ; In this case, checking %addr1 and %add2 involves two addrecs in two
; different loops where neither dominates the other. This used to crash ; different loops where neither dominates the other. This used to crash
; because we expected the arguments to an AddExpr to have a strict ; because we expected the arguments to an AddExpr to have a strict
; dominance order. ; dominance order.
define void @test_no_dom(ptr %data) { define void @test_no_dom(ptr %data, i1 %replace_undef_0) {
entry: entry:
load double, ptr %data load double, ptr %data
br label %for.body br label %for.body
for.body: for.body:
%indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.latch ] %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.latch ]
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
br i1 undef, label %subloop1, label %subloop2 br i1 %replace_undef_0, label %subloop1, label %subloop2
subloop1: subloop1:
%iv1 = phi i32 [0, %for.body], [%iv1.next, %subloop1] %iv1 = phi i32 [0, %for.body], [%iv1.next, %subloop1]
%iv1.next = add i32 %iv1, 1 %iv1.next = add i32 %iv1, 1
%addr1 = getelementptr double, ptr %data, i32 %iv1 %addr1 = getelementptr double, ptr %data, i32 %iv1
store double 0.0, ptr %addr1 store double 0.0, ptr %addr1
%cmp1 = icmp slt i32 %iv1, 200 %cmp1 = icmp slt i32 %iv1, 200
br i1 %cmp1, label %subloop1, label %for.latch br i1 %cmp1, label %subloop1, label %for.latch
Show All 18 Lines
; CHECK-LABEL: Function: test_no_dom2: 3 pointers, 2 call sites ; CHECK-LABEL: Function: test_no_dom2: 3 pointers, 2 call sites
; CHECK: MayAlias: double* %addr1, double* %data ; CHECK: MayAlias: double* %addr1, double* %data
; CHECK: MayAlias: double* %addr2, double* %data ; CHECK: MayAlias: double* %addr2, double* %data
; CHECK: MayAlias: double* %addr1, double* %addr2 ; CHECK: MayAlias: double* %addr1, double* %addr2
; In this case, checking %addr1 and %add2 involves two addrecs in two ; In this case, checking %addr1 and %add2 involves two addrecs in two
; different loops where neither dominates the other. This is analogous ; different loops where neither dominates the other. This is analogous
; to test_no_dom, but involves SCEVUnknown as opposed to SCEVAddRecExpr. ; to test_no_dom, but involves SCEVUnknown as opposed to SCEVAddRecExpr.
define void @test_no_dom2(ptr %data) { define void @test_no_dom2(ptr %data, i1 %replace_undef_0) {
entry: entry:
load double, ptr %data load double, ptr %data
br label %for.body br label %for.body
for.body: for.body:
%indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.latch ] %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.latch ]
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
br i1 undef, label %subloop1, label %subloop2 br i1 %replace_undef_0, label %subloop1, label %subloop2
subloop1: subloop1:
%iv1 = phi i32 [0, %for.body], [%iv1.next, %subloop1] %iv1 = phi i32 [0, %for.body], [%iv1.next, %subloop1]
%iv1.next = add i32 %iv1, 1 %iv1.next = add i32 %iv1, 1
%addr1 = call ptr @get_addr(i32 %iv1) %addr1 = call ptr @get_addr(i32 %iv1)
store double 0.0, ptr %addr1 store double 0.0, ptr %addr1
%cmp1 = icmp slt i32 %iv1, 200 %cmp1 = icmp slt i32 %iv1, 200
br i1 %cmp1, label %subloop1, label %for.latch br i1 %cmp1, label %subloop1, label %for.latch
▲ Show 20 Lines • Show All 57 Lines • Show Last 20 Lines

llvm/test/Analysis/ScalarEvolution/scev-canonical-mode.ll

; PR26529: Check the assumption of IndVarSimplify to do SCEV expansion in literal mode ; PR26529: Check the assumption of IndVarSimplify to do SCEV expansion in literal mode
; instead of CanonicalMode is properly maintained in SCEVExpander::expand. ; instead of CanonicalMode is properly maintained in SCEVExpander::expand.
; RUN: opt -passes=indvars < %s ; RUN: opt -passes=indvars < %s
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-unknown-linux-gnu" target triple = "x86_64-unknown-linux-gnu"
; Function Attrs: norecurse nounwind uwtable ; Function Attrs: norecurse nounwind uwtable
define void @ehF() #0 { define void @ehF( i1 %replace_undef_0, i1 %replace_undef_1) #0 {
entry: entry:
br i1 undef, label %if.then.i, label %hup.exit br i1 %replace_undef_0, label %if.then.i, label %hup.exit
if.then.i: ; preds = %entry if.then.i: ; preds = %entry
br i1 undef, label %for.body.lr.ph.i, label %hup.exit br i1 %replace_undef_1, label %for.body.lr.ph.i, label %hup.exit
for.body.lr.ph.i: ; preds = %if.then.i for.body.lr.ph.i: ; preds = %if.then.i
br label %for.body.i br label %for.body.i
for.body.i: ; preds = %for.body.i, %for.body.lr.ph.i for.body.i: ; preds = %for.body.i, %for.body.lr.ph.i
%i.03.i = phi i32 [ 0, %for.body.lr.ph.i ], [ %inc.i, %for.body.i ] %i.03.i = phi i32 [ 0, %for.body.lr.ph.i ], [ %inc.i, %for.body.i ]
%k.02.i = phi i32 [ 1, %for.body.lr.ph.i ], [ %inc5.i, %for.body.i ] %k.02.i = phi i32 [ 1, %for.body.lr.ph.i ], [ %inc5.i, %for.body.i ]
%inc.i = add nsw i32 %i.03.i, 1 %inc.i = add nsw i32 %i.03.i, 1
Show All 10 Lines

llvm/test/Analysis/ScalarEvolution/scev-invalid.ll

Show All 9 Lines
; SCEVUnknkown (as a CallbackVH). ; SCEVUnknkown (as a CallbackVH).
; ;
; forgetMemoizedResults should invalidate the backedge taken count expression. ; forgetMemoizedResults should invalidate the backedge taken count expression.
; CHECK: @test ; CHECK: @test
; CHECK-NOT: phi ; CHECK-NOT: phi
; CHECK-NOT: icmp ; CHECK-NOT: icmp
; CHECK: ret void ; CHECK: ret void
define void @test() { define void @test( i1 %replace_undef_0) {
entry: entry:
%xor1 = xor i32 0, 1 %xor1 = xor i32 0, 1
br label %b17 br label %b17
b17: b17:
br i1 undef, label %b22, label %b18 br i1 %replace_undef_0, label %b22, label %b18
b18: b18:
%phi1 = phi i32 [ %add1, %b18 ], [ %xor1, %b17 ] %phi1 = phi i32 [ %add1, %b18 ], [ %xor1, %b17 ]
%add1 = add nsw i32 %phi1, -1 %add1 = add nsw i32 %phi1, -1
%cmp1 = icmp sgt i32 %add1, 0 %cmp1 = icmp sgt i32 %add1, 0
br i1 %cmp1, label %b18, label %b22 br i1 %cmp1, label %b18, label %b22
b22: b22:
ret void ret void
} }

llvm/test/Analysis/ScalarEvolution/shift-recurrences.ll

; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py ; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
; RUN: opt -disable-output "-passes=print<scalar-evolution>" < %s 2>&1 | FileCheck %s ; RUN: opt -disable-output "-passes=print<scalar-evolution>" < %s 2>&1 | FileCheck %s
define void @test_lshr() { define void @test_lshr( i1 %replace_undef_0) {
; CHECK-LABEL: 'test_lshr' ; CHECK-LABEL: 'test_lshr'
; CHECK-NEXT: Classifying expressions for: @test_lshr ; CHECK-NEXT: Classifying expressions for: @test_lshr
; CHECK-NEXT: %iv.lshr = phi i64 [ 1023, %entry ], [ %iv.lshr.next, %loop ] ; CHECK-NEXT: %iv.lshr = phi i64 [ 1023, %entry ], [ %iv.lshr.next, %loop ]
; CHECK-NEXT: --> %iv.lshr U: [0,1024) S: [0,1024) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> %iv.lshr U: [0,1024) S: [0,1024) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: %iv.lshr.next = lshr i64 %iv.lshr, 1 ; CHECK-NEXT: %iv.lshr.next = lshr i64 %iv.lshr, 1
; CHECK-NEXT: --> (%iv.lshr /u 2) U: [0,512) S: [0,512) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> (%iv.lshr /u 2) U: [0,512) S: [0,512) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: Determining loop execution counts for: @test_lshr ; CHECK-NEXT: Determining loop execution counts for: @test_lshr
; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.lshr = phi i64 [1023, %entry], [%iv.lshr.next, %loop] %iv.lshr = phi i64 [1023, %entry], [%iv.lshr.next, %loop]
%iv.lshr.next = lshr i64 %iv.lshr, 1 %iv.lshr.next = lshr i64 %iv.lshr, 1
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
ret void ret void
} }
; Deliberate overflow doesn't change range ; Deliberate overflow doesn't change range
define void @test_lshr2() { define void @test_lshr2( i1 %replace_undef_0) {
; CHECK-LABEL: 'test_lshr2' ; CHECK-LABEL: 'test_lshr2'
; CHECK-NEXT: Classifying expressions for: @test_lshr2 ; CHECK-NEXT: Classifying expressions for: @test_lshr2
; CHECK-NEXT: %iv.lshr = phi i64 [ 1023, %entry ], [ %iv.lshr.next, %loop ] ; CHECK-NEXT: %iv.lshr = phi i64 [ 1023, %entry ], [ %iv.lshr.next, %loop ]
; CHECK-NEXT: --> %iv.lshr U: [0,1024) S: [0,1024) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> %iv.lshr U: [0,1024) S: [0,1024) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: %iv.lshr.next = lshr i64 %iv.lshr, 4 ; CHECK-NEXT: %iv.lshr.next = lshr i64 %iv.lshr, 4
; CHECK-NEXT: --> (%iv.lshr /u 16) U: [0,64) S: [0,64) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> (%iv.lshr /u 16) U: [0,64) S: [0,64) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: Determining loop execution counts for: @test_lshr2 ; CHECK-NEXT: Determining loop execution counts for: @test_lshr2
; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.lshr = phi i64 [1023, %entry], [%iv.lshr.next, %loop] %iv.lshr = phi i64 [1023, %entry], [%iv.lshr.next, %loop]
%iv.lshr.next = lshr i64 %iv.lshr, 4 %iv.lshr.next = lshr i64 %iv.lshr, 4
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
ret void ret void
} }
define void @test_ashr_zeros() { define void @test_ashr_zeros( i1 %replace_undef_0) {
; CHECK-LABEL: 'test_ashr_zeros' ; CHECK-LABEL: 'test_ashr_zeros'
; CHECK-NEXT: Classifying expressions for: @test_ashr_zeros ; CHECK-NEXT: Classifying expressions for: @test_ashr_zeros
; CHECK-NEXT: %iv.ashr = phi i64 [ 1023, %entry ], [ %iv.ashr.next, %loop ] ; CHECK-NEXT: %iv.ashr = phi i64 [ 1023, %entry ], [ %iv.ashr.next, %loop ]
; CHECK-NEXT: --> %iv.ashr U: [0,1024) S: [0,1024) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> %iv.ashr U: [0,1024) S: [0,1024) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: %iv.ashr.next = ashr i64 %iv.ashr, 1 ; CHECK-NEXT: %iv.ashr.next = ashr i64 %iv.ashr, 1
; CHECK-NEXT: --> %iv.ashr.next U: [0,512) S: [0,512) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> %iv.ashr.next U: [0,512) S: [0,512) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: Determining loop execution counts for: @test_ashr_zeros ; CHECK-NEXT: Determining loop execution counts for: @test_ashr_zeros
; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.ashr = phi i64 [1023, %entry], [%iv.ashr.next, %loop] %iv.ashr = phi i64 [1023, %entry], [%iv.ashr.next, %loop]
%iv.ashr.next = ashr i64 %iv.ashr, 1 %iv.ashr.next = ashr i64 %iv.ashr, 1
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
ret void ret void
} }
define void @test_ashr_ones() { define void @test_ashr_ones( i1 %replace_undef_0) {
; CHECK-LABEL: 'test_ashr_ones' ; CHECK-LABEL: 'test_ashr_ones'
; CHECK-NEXT: Classifying expressions for: @test_ashr_ones ; CHECK-NEXT: Classifying expressions for: @test_ashr_ones
; CHECK-NEXT: %iv.ashr = phi i64 [ -1023, %entry ], [ %iv.ashr.next, %loop ] ; CHECK-NEXT: %iv.ashr = phi i64 [ -1023, %entry ], [ %iv.ashr.next, %loop ]
; CHECK-NEXT: --> %iv.ashr U: [-1023,0) S: [-1023,0) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> %iv.ashr U: [-1023,0) S: [-1023,0) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: %iv.ashr.next = ashr i64 %iv.ashr, 1 ; CHECK-NEXT: %iv.ashr.next = ashr i64 %iv.ashr, 1
; CHECK-NEXT: --> %iv.ashr.next U: [-512,0) S: [-512,0) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> %iv.ashr.next U: [-512,0) S: [-512,0) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: Determining loop execution counts for: @test_ashr_ones ; CHECK-NEXT: Determining loop execution counts for: @test_ashr_ones
; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.ashr = phi i64 [-1023, %entry], [%iv.ashr.next, %loop] %iv.ashr = phi i64 [-1023, %entry], [%iv.ashr.next, %loop]
%iv.ashr.next = ashr i64 %iv.ashr, 1 %iv.ashr.next = ashr i64 %iv.ashr, 1
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
ret void ret void
} }
; Same as previous, but swapped operands to phi ; Same as previous, but swapped operands to phi
define void @test_ashr_ones2() { define void @test_ashr_ones2( i1 %replace_undef_0) {
; CHECK-LABEL: 'test_ashr_ones2' ; CHECK-LABEL: 'test_ashr_ones2'
; CHECK-NEXT: Classifying expressions for: @test_ashr_ones2 ; CHECK-NEXT: Classifying expressions for: @test_ashr_ones2
; CHECK-NEXT: %iv.ashr = phi i64 [ %iv.ashr.next, %loop ], [ -1023, %entry ] ; CHECK-NEXT: %iv.ashr = phi i64 [ %iv.ashr.next, %loop ], [ -1023, %entry ]
; CHECK-NEXT: --> %iv.ashr U: [-1023,0) S: [-1023,0) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> %iv.ashr U: [-1023,0) S: [-1023,0) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: %iv.ashr.next = ashr i64 %iv.ashr, 1 ; CHECK-NEXT: %iv.ashr.next = ashr i64 %iv.ashr, 1
; CHECK-NEXT: --> %iv.ashr.next U: [-512,0) S: [-512,0) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> %iv.ashr.next U: [-512,0) S: [-512,0) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: Determining loop execution counts for: @test_ashr_ones2 ; CHECK-NEXT: Determining loop execution counts for: @test_ashr_ones2
; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.ashr = phi i64 [%iv.ashr.next, %loop], [-1023, %entry] %iv.ashr = phi i64 [%iv.ashr.next, %loop], [-1023, %entry]
%iv.ashr.next = ashr i64 %iv.ashr, 1 %iv.ashr.next = ashr i64 %iv.ashr, 1
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
ret void ret void
} }
; negative case for when start is unknown ; negative case for when start is unknown
define void @test_ashr_unknown(i64 %start) { define void @test_ashr_unknown(i64 %start, i1 %replace_undef_0) {
; CHECK-LABEL: 'test_ashr_unknown' ; CHECK-LABEL: 'test_ashr_unknown'
; CHECK-NEXT: Classifying expressions for: @test_ashr_unknown ; CHECK-NEXT: Classifying expressions for: @test_ashr_unknown
; CHECK-NEXT: %iv.ashr = phi i64 [ %start, %entry ], [ %iv.ashr.next, %loop ] ; CHECK-NEXT: %iv.ashr = phi i64 [ %start, %entry ], [ %iv.ashr.next, %loop ]
; CHECK-NEXT: --> %iv.ashr U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> %iv.ashr U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: %iv.ashr.next = ashr i64 %iv.ashr, 1 ; CHECK-NEXT: %iv.ashr.next = ashr i64 %iv.ashr, 1
; CHECK-NEXT: --> %iv.ashr.next U: [-4611686018427387904,4611686018427387904) S: [-4611686018427387904,4611686018427387904) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> %iv.ashr.next U: [-4611686018427387904,4611686018427387904) S: [-4611686018427387904,4611686018427387904) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: Determining loop execution counts for: @test_ashr_unknown ; CHECK-NEXT: Determining loop execution counts for: @test_ashr_unknown
; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.ashr = phi i64 [%start, %entry], [%iv.ashr.next, %loop] %iv.ashr = phi i64 [%start, %entry], [%iv.ashr.next, %loop]
%iv.ashr.next = ashr i64 %iv.ashr, 1 %iv.ashr.next = ashr i64 %iv.ashr, 1
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
ret void ret void
} }
; Negative case where we don't have a (shift) recurrence because the operands ; Negative case where we don't have a (shift) recurrence because the operands
; of the ashr are swapped. (This does end up being a divide recurrence.) ; of the ashr are swapped. (This does end up being a divide recurrence.)
define void @test_ashr_wrong_op(i64 %start) { define void @test_ashr_wrong_op(i64 %start, i1 %replace_undef_0) {
; CHECK-LABEL: 'test_ashr_wrong_op' ; CHECK-LABEL: 'test_ashr_wrong_op'
; CHECK-NEXT: Classifying expressions for: @test_ashr_wrong_op ; CHECK-NEXT: Classifying expressions for: @test_ashr_wrong_op
; CHECK-NEXT: %iv.ashr = phi i64 [ %start, %entry ], [ %iv.ashr.next, %loop ] ; CHECK-NEXT: %iv.ashr = phi i64 [ %start, %entry ], [ %iv.ashr.next, %loop ]
; CHECK-NEXT: --> %iv.ashr U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> %iv.ashr U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: %iv.ashr.next = ashr i64 1, %iv.ashr ; CHECK-NEXT: %iv.ashr.next = ashr i64 1, %iv.ashr
; CHECK-NEXT: --> %iv.ashr.next U: [-2,2) S: [-2,2) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> %iv.ashr.next U: [-2,2) S: [-2,2) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: Determining loop execution counts for: @test_ashr_wrong_op ; CHECK-NEXT: Determining loop execution counts for: @test_ashr_wrong_op
; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.ashr = phi i64 [%start, %entry], [%iv.ashr.next, %loop] %iv.ashr = phi i64 [%start, %entry], [%iv.ashr.next, %loop]
%iv.ashr.next = ashr i64 1, %iv.ashr %iv.ashr.next = ashr i64 1, %iv.ashr
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
ret void ret void
} }
define void @test_shl() { define void @test_shl( i1 %replace_undef_0) {
; CHECK-LABEL: 'test_shl' ; CHECK-LABEL: 'test_shl'
; CHECK-NEXT: Classifying expressions for: @test_shl ; CHECK-NEXT: Classifying expressions for: @test_shl
; CHECK-NEXT: %iv.shl = phi i64 [ 8, %entry ], [ %iv.shl.next, %loop ] ; CHECK-NEXT: %iv.shl = phi i64 [ 8, %entry ], [ %iv.shl.next, %loop ]
; CHECK-NEXT: --> %iv.shl U: [0,-7) S: [-9223372036854775808,9223372036854775793) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> %iv.shl U: [0,-7) S: [-9223372036854775808,9223372036854775793) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: %iv.shl.next = shl i64 %iv.shl, 1 ; CHECK-NEXT: %iv.shl.next = shl i64 %iv.shl, 1
; CHECK-NEXT: --> (2 * %iv.shl) U: [0,-15) S: [-9223372036854775808,9223372036854775793) Exits: <<Unknown>> LoopDispositions: { %loop: Variant } ; CHECK-NEXT: --> (2 * %iv.shl) U: [0,-15) S: [-9223372036854775808,9223372036854775793) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: Determining loop execution counts for: @test_shl ; CHECK-NEXT: Determining loop execution counts for: @test_shl
; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count. ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.shl = phi i64 [8, %entry], [%iv.shl.next, %loop] %iv.shl = phi i64 [8, %entry], [%iv.shl.next, %loop]
%iv.shl.next = shl i64 %iv.shl, 1 %iv.shl.next = shl i64 %iv.shl, 1
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
ret void ret void
} }
; use trip count to refine ; use trip count to refine
define void @test_shl2() { define void @test_shl2() {
; CHECK-LABEL: 'test_shl2' ; CHECK-LABEL: 'test_shl2'
; CHECK-NEXT: Classifying expressions for: @test_shl2 ; CHECK-NEXT: Classifying expressions for: @test_shl2
▲ Show 20 Lines • Show All 218 Lines • ▼ Show 20 Lines
unreachable_nonloop: unreachable_nonloop:
%p_58.addr.1 = phi i32 [ undef, %unreachable1 ], [ %sub2629, %unreachable2 ] %p_58.addr.1 = phi i32 [ undef, %unreachable1 ], [ %sub2629, %unreachable2 ]
%sub2629 = sub i32 %p_58.addr.1, 1 %sub2629 = sub i32 %p_58.addr.1, 1
unreachable unreachable
} }
; Corner case where phi is not in loop header because binop is in unreachable ; Corner case where phi is not in loop header because binop is in unreachable
; code (which loopinfo ignores, but simple recurrence matching does not). ; code (which loopinfo ignores, but simple recurrence matching does not).
define void @unreachable_binop() { define void @unreachable_binop( i1 %replace_undef_0) {
; CHECK-LABEL: 'unreachable_binop' ; CHECK-LABEL: 'unreachable_binop'
; CHECK-NEXT: Classifying expressions for: @unreachable_binop ; CHECK-NEXT: Classifying expressions for: @unreachable_binop
; CHECK-NEXT: %p_58.addr.1 = phi i32 [ undef, %header ], [ %sub2629, %unreachable ] ; CHECK-NEXT: %p_58.addr.1 = phi i32 [ undef, %header ], [ %sub2629, %unreachable ]
; CHECK-NEXT: --> %p_58.addr.1 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %header: Variant } ; CHECK-NEXT: --> %p_58.addr.1 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %header: Variant }
; CHECK-NEXT: %sub2629 = sub i32 %p_58.addr.1, 1 ; CHECK-NEXT: %sub2629 = sub i32 %p_58.addr.1, 1
; CHECK-NEXT: --> poison U: full-set S: full-set ; CHECK-NEXT: --> poison U: full-set S: full-set
; CHECK-NEXT: Determining loop execution counts for: @unreachable_binop ; CHECK-NEXT: Determining loop execution counts for: @unreachable_binop
; CHECK-NEXT: Loop %header: Unpredictable backedge-taken count. ; CHECK-NEXT: Loop %header: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %header: Unpredictable constant max backedge-taken count. ; CHECK-NEXT: Loop %header: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %header: Unpredictable symbolic max backedge-taken count. ; CHECK-NEXT: Loop %header: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %header: Unpredictable predicated backedge-taken count. ; CHECK-NEXT: Loop %header: Unpredictable predicated backedge-taken count.
; ;
entry: entry:
br label %header br label %header
header: header:
br label %for.cond2295 br label %for.cond2295
for.cond2295: for.cond2295:
%p_58.addr.1 = phi i32 [ undef, %header ], [ %sub2629, %unreachable ] %p_58.addr.1 = phi i32 [ undef, %header ], [ %sub2629, %unreachable ]
br i1 undef, label %if.then2321, label %header br i1 %replace_undef_0, label %if.then2321, label %header
if.then2321: if.then2321:
ret void ret void
unreachable: unreachable:
%sub2629 = sub i32 %p_58.addr.1, 1 %sub2629 = sub i32 %p_58.addr.1, 1
br label %for.cond2295 br label %for.cond2295
} }
▲ Show 20 Lines • Show All 418 Lines • Show Last 20 Lines

llvm/test/Analysis/ValueTracking/memory-dereferenceable.ll

Show First 20 Lines • Show All 281 Lines • ▼ Show 20 Linesdefine void @infer_noalias2(ptr dereferenceable(8) noalias readonly %p) nosync {
call void @mayfree() call void @mayfree()
%v = load i32, ptr %p %v = load i32, ptr %p
ret void ret void
} }
; Just check that we don't crash. ; Just check that we don't crash.
; CHECK-LABEL: 'opaque_type_crasher' ; CHECK-LABEL: 'opaque_type_crasher'
define void @opaque_type_crasher(ptr dereferenceable(16) %a) { define void @opaque_type_crasher(ptr dereferenceable(16) %a, i1 %replace_undef_0) {
entry: entry:
%ptr8 = getelementptr inbounds i8, ptr %a, i32 8 %ptr8 = getelementptr inbounds i8, ptr %a, i32 8
br i1 undef, label %if.then, label %if.end br i1 %replace_undef_0, label %if.then, label %if.end
if.then: if.then:
%res = load i32, ptr %ptr8, align 4 %res = load i32, ptr %ptr8, align 4
br label %if.end br label %if.end
if.end: if.end:
ret void ret void
} }
Show All 12 Lines

llvm/test/Analysis/ValueTracking/shift-recurrence-knownbits.ll

; NOTE: Assertions have been autogenerated by utils/update_test_checks.py ; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -passes=instcombine -S | FileCheck %s ; RUN: opt < %s -passes=instcombine -S | FileCheck %s
define i64 @test_lshr() { define i64 @test_lshr( i1 %replace_undef_0) {
; CHECK-LABEL: @test_lshr( ; CHECK-LABEL: @test_lshr(
; CHECK-NEXT: entry: ; CHECK-NEXT: entry:
; CHECK-NEXT: br label [[LOOP:%.*]] ; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop: ; CHECK: loop:
; CHECK-NEXT: br i1 undef, label [[EXIT:%.*]], label [[LOOP]]
nlopesUnsubmitted
Not Done
ReplyInline Actions

these tests that have an impact on the test output should be separated from the other that induce no change

nlopes: these tests that have an impact on the test output should be separated from the other that…
; CHECK: exit: ; CHECK: exit:
; CHECK-NEXT: ret i64 1023 ; CHECK-NEXT: ret i64 1023
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.lshr = phi i64 [1023, %entry], [%iv.lshr.next, %loop] %iv.lshr = phi i64 [1023, %entry], [%iv.lshr.next, %loop]
%iv.lshr.next = lshr i64 %iv.lshr, 1 %iv.lshr.next = lshr i64 %iv.lshr, 1
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
%res = or i64 %iv.lshr, 1023 %res = or i64 %iv.lshr, 1023
ret i64 %res ret i64 %res
} }
define i64 @test_ashr_zeros() { define i64 @test_ashr_zeros( i1 %replace_undef_0) {
; CHECK-LABEL: @test_ashr_zeros( ; CHECK-LABEL: @test_ashr_zeros(
; CHECK-NEXT: entry: ; CHECK-NEXT: entry:
; CHECK-NEXT: br label [[LOOP:%.*]] ; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop: ; CHECK: loop:
; CHECK-NEXT: br i1 undef, label [[EXIT:%.*]], label [[LOOP]]
; CHECK: exit: ; CHECK: exit:
; CHECK-NEXT: ret i64 1023 ; CHECK-NEXT: ret i64 1023
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.ashr = phi i64 [1023, %entry], [%iv.ashr.next, %loop] %iv.ashr = phi i64 [1023, %entry], [%iv.ashr.next, %loop]
%iv.ashr.next = ashr i64 %iv.ashr, 1 %iv.ashr.next = ashr i64 %iv.ashr, 1
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
%res = or i64 %iv.ashr, 1023 %res = or i64 %iv.ashr, 1023
ret i64 %res ret i64 %res
} }
define i64 @test_ashr_ones() { define i64 @test_ashr_ones( i1 %replace_undef_0) {
; CHECK-LABEL: @test_ashr_ones( ; CHECK-LABEL: @test_ashr_ones(
; CHECK-NEXT: entry: ; CHECK-NEXT: entry:
; CHECK-NEXT: br label [[LOOP:%.*]] ; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop: ; CHECK: loop:
; CHECK-NEXT: br i1 undef, label [[EXIT:%.*]], label [[LOOP]]
; CHECK: exit: ; CHECK: exit:
; CHECK-NEXT: ret i64 -1 ; CHECK-NEXT: ret i64 -1
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.ashr = phi i64 [-1023, %entry], [%iv.ashr.next, %loop] %iv.ashr = phi i64 [-1023, %entry], [%iv.ashr.next, %loop]
%iv.ashr.next = ashr i64 %iv.ashr, 1 %iv.ashr.next = ashr i64 %iv.ashr, 1
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
%res = or i64 %iv.ashr, 1023 %res = or i64 %iv.ashr, 1023
ret i64 %res ret i64 %res
} }
; Same as previous, but swapped operands to phi ; Same as previous, but swapped operands to phi
define i64 @test_ashr_ones2() { define i64 @test_ashr_ones2( i1 %replace_undef_0) {
; CHECK-LABEL: @test_ashr_ones2( ; CHECK-LABEL: @test_ashr_ones2(
; CHECK-NEXT: entry: ; CHECK-NEXT: entry:
; CHECK-NEXT: br label [[LOOP:%.*]] ; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop: ; CHECK: loop:
; CHECK-NEXT: br i1 undef, label [[EXIT:%.*]], label [[LOOP]]
; CHECK: exit: ; CHECK: exit:
; CHECK-NEXT: ret i64 -1 ; CHECK-NEXT: ret i64 -1
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.ashr = phi i64 [%iv.ashr.next, %loop], [-1023, %entry] %iv.ashr = phi i64 [%iv.ashr.next, %loop], [-1023, %entry]
%iv.ashr.next = ashr i64 %iv.ashr, 1 %iv.ashr.next = ashr i64 %iv.ashr, 1
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
%res = or i64 %iv.ashr, 1023 %res = or i64 %iv.ashr, 1023
ret i64 %res ret i64 %res
} }
; negative case for when start is unknown ; negative case for when start is unknown
define i64 @test_ashr_unknown(i64 %start) { define i64 @test_ashr_unknown(i64 %start, i1 %replace_undef_0) {
; CHECK-LABEL: @test_ashr_unknown( ; CHECK-LABEL: @test_ashr_unknown(
; CHECK-NEXT: entry: ; CHECK-NEXT: entry:
; CHECK-NEXT: br label [[LOOP:%.*]] ; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop: ; CHECK: loop:
; CHECK-NEXT: [[IV_ASHR:%.*]] = phi i64 [ [[START:%.*]], [[ENTRY:%.*]] ], [ [[IV_ASHR_NEXT:%.*]], [[LOOP]] ] ; CHECK-NEXT: [[IV_ASHR:%.*]] = phi i64 [ [[START:%.*]], [[ENTRY:%.*]] ], [ [[IV_ASHR_NEXT:%.*]], [[LOOP]] ]
; CHECK-NEXT: [[IV_ASHR_NEXT]] = ashr i64 [[IV_ASHR]], 1 ; CHECK-NEXT: [[IV_ASHR_NEXT]] = ashr i64 [[IV_ASHR]], 1
; CHECK-NEXT: br i1 undef, label [[EXIT:%.*]], label [[LOOP]]
; CHECK: exit: ; CHECK: exit:
; CHECK-NEXT: [[RES:%.*]] = or i64 [[IV_ASHR]], 1023 ; CHECK-NEXT: [[RES:%.*]] = or i64 [[IV_ASHR]], 1023
; CHECK-NEXT: ret i64 [[RES]] ; CHECK-NEXT: ret i64 [[RES]]
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.ashr = phi i64 [%start, %entry], [%iv.ashr.next, %loop] %iv.ashr = phi i64 [%start, %entry], [%iv.ashr.next, %loop]
%iv.ashr.next = ashr i64 %iv.ashr, 1 %iv.ashr.next = ashr i64 %iv.ashr, 1
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
%res = or i64 %iv.ashr, 1023 %res = or i64 %iv.ashr, 1023
ret i64 %res ret i64 %res
} }
; Negative case where we don't have a (shift) recurrence because the operands ; Negative case where we don't have a (shift) recurrence because the operands
; of the ashr are swapped. (This does end up being a divide recurrence.) ; of the ashr are swapped. (This does end up being a divide recurrence.)
define i64 @test_ashr_wrong_op(i64 %start) { define i64 @test_ashr_wrong_op(i64 %start, i1 %replace_undef_0) {
; CHECK-LABEL: @test_ashr_wrong_op( ; CHECK-LABEL: @test_ashr_wrong_op(
; CHECK-NEXT: entry: ; CHECK-NEXT: entry:
; CHECK-NEXT: br label [[LOOP:%.*]] ; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop: ; CHECK: loop:
; CHECK-NEXT: [[IV_ASHR:%.*]] = phi i64 [ [[START:%.*]], [[ENTRY:%.*]] ], [ [[IV_ASHR_NEXT:%.*]], [[LOOP]] ] ; CHECK-NEXT: [[IV_ASHR:%.*]] = phi i64 [ [[START:%.*]], [[ENTRY:%.*]] ], [ [[IV_ASHR_NEXT:%.*]], [[LOOP]] ]
; CHECK-NEXT: [[IV_ASHR_NEXT]] = lshr i64 1, [[IV_ASHR]] ; CHECK-NEXT: [[IV_ASHR_NEXT]] = lshr i64 1, [[IV_ASHR]]
; CHECK-NEXT: br i1 undef, label [[EXIT:%.*]], label [[LOOP]]
; CHECK: exit: ; CHECK: exit:
; CHECK-NEXT: [[RES:%.*]] = or i64 [[IV_ASHR]], 1023 ; CHECK-NEXT: [[RES:%.*]] = or i64 [[IV_ASHR]], 1023
; CHECK-NEXT: ret i64 [[RES]] ; CHECK-NEXT: ret i64 [[RES]]
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.ashr = phi i64 [%start, %entry], [%iv.ashr.next, %loop] %iv.ashr = phi i64 [%start, %entry], [%iv.ashr.next, %loop]
%iv.ashr.next = ashr i64 1, %iv.ashr %iv.ashr.next = ashr i64 1, %iv.ashr
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
%res = or i64 %iv.ashr, 1023 %res = or i64 %iv.ashr, 1023
ret i64 %res ret i64 %res
} }
define i64 @test_shl() { define i64 @test_shl( i1 %replace_undef_0) {
nlopesUnsubmitted
Not Done
ReplyInline Actions

extra whitespace there

nlopes: extra whitespace there
; CHECK-LABEL: @test_shl( ; CHECK-LABEL: @test_shl(
; CHECK-NEXT: entry: ; CHECK-NEXT: entry:
; CHECK-NEXT: br label [[LOOP:%.*]] ; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop: ; CHECK: loop:
; CHECK-NEXT: br i1 undef, label [[EXIT:%.*]], label [[LOOP]]
; CHECK: exit: ; CHECK: exit:
; CHECK-NEXT: ret i64 0 ; CHECK-NEXT: ret i64 0
; ;
entry: entry:
br label %loop br label %loop
loop: loop:
%iv.shl = phi i64 [8, %entry], [%iv.shl.next, %loop] %iv.shl = phi i64 [8, %entry], [%iv.shl.next, %loop]
%iv.shl.next = shl i64 %iv.shl, 1 %iv.shl.next = shl i64 %iv.shl, 1
br i1 undef, label %exit, label %loop br i1 %replace_undef_0, label %exit, label %loop
exit: exit:
%res = and i64 %iv.shl, 7 %res = and i64 %iv.shl, 7
ret i64 %res ret i64 %res
} }