1 ; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
2 ; RUN: opt < %s "-passes=print<scalar-evolution>" -disable-output 2>&1 | FileCheck %s
4 target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
5 target triple = "x86_64-unknown-linux-gnu"
7 define dso_local void @_Z4loopi(i32 %width) local_unnamed_addr #0 {
8 ; CHECK-LABEL: '_Z4loopi'
9 ; CHECK-NEXT: Classifying expressions for: @_Z4loopi
10 ; CHECK-NEXT: %storage = alloca [2 x i32], align 4
11 ; CHECK-NEXT: --> %storage U: [4,-11) S: [-9223372036854775808,9223372036854775805)
12 ; CHECK-NEXT: %0 = bitcast ptr %storage to ptr
13 ; CHECK-NEXT: --> %storage U: [4,-11) S: [-9223372036854775808,9223372036854775805)
14 ; CHECK-NEXT: %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.body ]
15 ; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%for.cond> U: [0,-2147483648) S: [0,-2147483648) Exits: %width LoopDispositions: { %for.cond: Computable }
16 ; CHECK-NEXT: %rem = sdiv i32 %i.0, 2
17 ; CHECK-NEXT: --> ({0,+,1}<nuw><nsw><%for.cond> /u 2) U: [0,1073741824) S: [0,1073741824) Exits: (%width /u 2) LoopDispositions: { %for.cond: Computable }
18 ; CHECK-NEXT: %idxprom = sext i32 %rem to i64
19 ; CHECK-NEXT: --> ({0,+,1}<nuw><nsw><%for.cond> /u 2) U: [0,2147483648) S: [0,2147483648) Exits: ((zext i32 %width to i64) /u 2) LoopDispositions: { %for.cond: Computable }
20 ; CHECK-NEXT: %arrayidx = getelementptr inbounds [2 x i32], ptr %storage, i64 0, i64 %idxprom
21 ; CHECK-NEXT: --> ((4 * ({0,+,1}<nuw><nsw><%for.cond> /u 2))<nuw><nsw> + %storage) U: [0,-3) S: [-9223372036854775808,9223372036854775805) Exits: ((4 * ((zext i32 %width to i64) /u 2))<nuw><nsw> + %storage) LoopDispositions: { %for.cond: Computable }
22 ; CHECK-NEXT: %1 = load i32, ptr %arrayidx, align 4
23 ; CHECK-NEXT: --> %1 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %for.cond: Variant }
24 ; CHECK-NEXT: %call = call i32 @_Z3adji(i32 %1)
25 ; CHECK-NEXT: --> %call U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %for.cond: Variant }
26 ; CHECK-NEXT: %2 = load i32, ptr %arrayidx, align 4
27 ; CHECK-NEXT: --> %2 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %for.cond: Variant }
28 ; CHECK-NEXT: %add = add nsw i32 %2, %call
29 ; CHECK-NEXT: --> (%2 + %call) U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %for.cond: Variant }
30 ; CHECK-NEXT: %inc = add nsw i32 %i.0, 1
31 ; CHECK-NEXT: --> {1,+,1}<nuw><%for.cond> U: [1,0) S: [1,0) Exits: (1 + %width) LoopDispositions: { %for.cond: Computable }
32 ; CHECK-NEXT: Determining loop execution counts for: @_Z4loopi
33 ; CHECK-NEXT: Loop %for.cond: backedge-taken count is %width
34 ; CHECK-NEXT: Loop %for.cond: constant max backedge-taken count is -1
35 ; CHECK-NEXT: Loop %for.cond: symbolic max backedge-taken count is %width
36 ; CHECK-NEXT: Loop %for.cond: Predicated backedge-taken count is %width
37 ; CHECK-NEXT: Predicates:
38 ; CHECK-NEXT: Loop %for.cond: Trip multiple is 1
41 %storage = alloca [2 x i32], align 4
42 %0 = bitcast ptr %storage to ptr
43 call void @llvm.lifetime.start.p0(i64 8, ptr %0) #4
44 call void @llvm.memset.p0.i64(ptr align 4 %0, i8 0, i64 8, i1 false)
48 %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.body ]
49 %cmp = icmp ne i32 %i.0, %width
50 br i1 %cmp, label %for.body, label %for.cond.cleanup
53 call void @llvm.lifetime.end.p0(i64 8, ptr %0) #4
57 %rem = sdiv i32 %i.0, 2
58 %idxprom = sext i32 %rem to i64
59 %arrayidx = getelementptr inbounds [2 x i32], ptr %storage, i64 0, i64 %idxprom
60 %1 = load i32, ptr %arrayidx, align 4
61 %call = call i32 @_Z3adji(i32 %1)
62 %2 = load i32, ptr %arrayidx, align 4
63 %add = add nsw i32 %2, %call
64 store i32 %add, ptr %arrayidx, align 4
65 %inc = add nsw i32 %i.0, 1
69 declare void @llvm.lifetime.start.p0(i64 immarg, ptr nocapture) #1
71 declare void @llvm.memset.p0.i64(ptr nocapture writeonly, i8, i64, i1 immarg) #2
73 declare dso_local i32 @_Z3adji(i32) local_unnamed_addr #3
75 declare void @llvm.lifetime.end.p0(i64 immarg, ptr nocapture) #1