228 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 42; RUN: opt -passes='default<O3>,print<scalar-evolution>' -disable-output -S < %s 2>&1 | FileCheck %s3 4target datalayout = "e-m:m-p:40:64:64:32-i32:32-i16:16-i8:8-n32"5 6;7; This file contains phase ordering tests for scalar evolution.8; Test that the standard passes don't obfuscate the IR so scalar evolution can't9; recognize expressions.10 11; The loop body contains two increments by %div.12; Make sure that 2*%div is recognizable, and not expressed as a bit mask of %d.13define void @test1(i32 %d, ptr %p) nounwind uwtable ssp {14; CHECK-LABEL: 'test1'15; CHECK-NEXT: Classifying expressions for: @test116; CHECK-NEXT: %div1 = lshr i32 %d, 217; CHECK-NEXT: --> (%d /u 4) U: [0,1073741824) S: [0,1073741824)18; CHECK-NEXT: %i.03 = phi i32 [ 0, %entry ], [ %inc, %for.body ]19; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%for.body> U: [0,64) S: [0,64) Exits: 63 LoopDispositions: { %for.body: Computable }20; CHECK-NEXT: %p.addr.02 = phi ptr [ %p, %entry ], [ %add.ptr1, %for.body ]21; CHECK-NEXT: --> {%p,+,(8 * (%d /u 4))}<%for.body> U: full-set S: full-set Exits: ((504 * (%d /u 4)) + %p) LoopDispositions: { %for.body: Computable }22; CHECK-NEXT: %add.ptr = getelementptr inbounds nuw i32, ptr %p.addr.02, i32 %div123; CHECK-NEXT: --> {((4 * (%d /u 4))<nuw><nsw> + %p)<nuw>,+,(8 * (%d /u 4))}<%for.body> U: full-set S: full-set Exits: ((508 * (%d /u 4)) + %p) LoopDispositions: { %for.body: Computable }24; CHECK-NEXT: %add.ptr1 = getelementptr inbounds nuw i32, ptr %add.ptr, i32 %div125; CHECK-NEXT: --> {((8 * (%d /u 4)) + %p),+,(8 * (%d /u 4))}<%for.body> U: full-set S: full-set Exits: ((512 * (%d /u 4)) + %p) LoopDispositions: { %for.body: Computable }26; CHECK-NEXT: %inc = add nuw nsw i32 %i.03, 127; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%for.body> U: [1,65) S: [1,65) Exits: 64 LoopDispositions: { %for.body: Computable }28; CHECK-NEXT: Determining loop execution counts for: @test129; CHECK-NEXT: Loop %for.body: backedge-taken count is i32 6330; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is i32 6331; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is i32 6332; CHECK-NEXT: Loop %for.body: Trip multiple is 6433;34entry:35 %div = udiv i32 %d, 436 br label %for.cond37 38for.cond: ; preds = %for.inc, %entry39 %p.addr.0 = phi ptr [ %p, %entry ], [ %add.ptr1, %for.inc ]40 %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]41 %cmp = icmp ne i32 %i.0, 6442 br i1 %cmp, label %for.body, label %for.end43 44for.body: ; preds = %for.cond45 store i32 0, ptr %p.addr.0, align 446 %add.ptr = getelementptr inbounds i32, ptr %p.addr.0, i32 %div47 store i32 1, ptr %add.ptr, align 448 %add.ptr1 = getelementptr inbounds i32, ptr %add.ptr, i32 %div49 br label %for.inc50 51for.inc: ; preds = %for.body52 %inc = add i32 %i.0, 153 br label %for.cond54 55for.end: ; preds = %for.cond56 ret void57}58 59; Same thing as test1, but it is even more tempting to fold 2 * (%d /u 2)60define void @test1a(i32 %d, ptr %p) nounwind uwtable ssp {61; CHECK-LABEL: 'test1a'62; CHECK-NEXT: Classifying expressions for: @test1a63; CHECK-NEXT: %div1 = lshr i32 %d, 164; CHECK-NEXT: --> (%d /u 2) U: [0,-2147483648) S: [0,-2147483648)65; CHECK-NEXT: %i.03 = phi i32 [ 0, %entry ], [ %inc, %for.body ]66; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%for.body> U: [0,64) S: [0,64) Exits: 63 LoopDispositions: { %for.body: Computable }67; CHECK-NEXT: %p.addr.02 = phi ptr [ %p, %entry ], [ %add.ptr1, %for.body ]68; CHECK-NEXT: --> {%p,+,(8 * (%d /u 2))}<%for.body> U: full-set S: full-set Exits: ((504 * (%d /u 2)) + %p) LoopDispositions: { %for.body: Computable }69; CHECK-NEXT: %add.ptr = getelementptr inbounds nuw i32, ptr %p.addr.02, i32 %div170; CHECK-NEXT: --> {((4 * (%d /u 2))<nuw><nsw> + %p)<nuw>,+,(8 * (%d /u 2))}<%for.body> U: full-set S: full-set Exits: ((508 * (%d /u 2)) + %p) LoopDispositions: { %for.body: Computable }71; CHECK-NEXT: %add.ptr1 = getelementptr inbounds nuw i32, ptr %add.ptr, i32 %div172; CHECK-NEXT: --> {((8 * (%d /u 2)) + %p),+,(8 * (%d /u 2))}<%for.body> U: full-set S: full-set Exits: ((512 * (%d /u 2)) + %p) LoopDispositions: { %for.body: Computable }73; CHECK-NEXT: %inc = add nuw nsw i32 %i.03, 174; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%for.body> U: [1,65) S: [1,65) Exits: 64 LoopDispositions: { %for.body: Computable }75; CHECK-NEXT: Determining loop execution counts for: @test1a76; CHECK-NEXT: Loop %for.body: backedge-taken count is i32 6377; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is i32 6378; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is i32 6379; CHECK-NEXT: Loop %for.body: Trip multiple is 6480;81entry:82 %div = udiv i32 %d, 283 br label %for.cond84 85for.cond: ; preds = %for.inc, %entry86 %p.addr.0 = phi ptr [ %p, %entry ], [ %add.ptr1, %for.inc ]87 %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]88 %cmp = icmp ne i32 %i.0, 6489 br i1 %cmp, label %for.body, label %for.end90 91for.body: ; preds = %for.cond92 store i32 0, ptr %p.addr.0, align 493 %add.ptr = getelementptr inbounds i32, ptr %p.addr.0, i32 %div94 store i32 1, ptr %add.ptr, align 495 %add.ptr1 = getelementptr inbounds i32, ptr %add.ptr, i32 %div96 br label %for.inc97 98for.inc: ; preds = %for.body99 %inc = add i32 %i.0, 1100 br label %for.cond101 102for.end: ; preds = %for.cond103 ret void104}105 106@array = weak global [101 x i32] zeroinitializer, align 32 ; <ptr> [#uses=1]107 108 109define void @test_range_ref1a(i32 %x) {110; CHECK-LABEL: 'test_range_ref1a'111; CHECK-NEXT: Classifying expressions for: @test_range_ref1a112; CHECK-NEXT: %i.01.0 = phi i32 [ 100, %entry ], [ %tmp4, %bb ]113; CHECK-NEXT: --> {100,+,-1}<nsw><%bb> U: [0,101) S: [0,101) Exits: 0 LoopDispositions: { %bb: Computable }114; CHECK-NEXT: %tmp1 = getelementptr i32, ptr @array, i32 %i.01.0115; CHECK-NEXT: --> {(400 + @array)<nuw>,+,-4}<nw><%bb> U: [0,-3) S: [-2147483648,2147483645) Exits: @array LoopDispositions: { %bb: Computable }116; CHECK-NEXT: %tmp4 = add nsw i32 %i.01.0, -1117; CHECK-NEXT: --> {99,+,-1}<nsw><%bb> U: [-1,100) S: [-1,100) Exits: -1 LoopDispositions: { %bb: Computable }118; CHECK-NEXT: Determining loop execution counts for: @test_range_ref1a119; CHECK-NEXT: Loop %bb: backedge-taken count is i32 100120; CHECK-NEXT: Loop %bb: constant max backedge-taken count is i32 100121; CHECK-NEXT: Loop %bb: symbolic max backedge-taken count is i32 100122; CHECK-NEXT: Loop %bb: Trip multiple is 101123;124entry:125 br label %bb126 127bb: ; preds = %bb, %entry128 %i.01.0 = phi i32 [ 100, %entry ], [ %tmp4, %bb ] ; <i32> [#uses=2]129 %tmp1 = getelementptr [101 x i32], ptr @array, i32 0, i32 %i.01.0 ; <ptr> [#uses=1]130 store i32 %x, ptr %tmp1131 %tmp4 = add i32 %i.01.0, -1 ; <i32> [#uses=2]132 %tmp7 = icmp sgt i32 %tmp4, -1 ; <i1> [#uses=1]133 br i1 %tmp7, label %bb, label %return134 135return: ; preds = %bb136 ret void137}138 139define i32 @test_loop_idiom_recogize(i32 %x, i32 %y, ptr %lam, ptr %alp) nounwind {140; CHECK-LABEL: 'test_loop_idiom_recogize'141; CHECK-NEXT: Classifying expressions for: @test_loop_idiom_recogize142; CHECK-NEXT: %indvar = phi i32 [ 0, %bb1.thread ], [ %indvar.next, %bb1 ]143; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%bb1> U: [0,256) S: [0,256) Exits: 255 LoopDispositions: { %bb1: Computable }144; CHECK-NEXT: %i.0.reg2mem.0 = sub nuw nsw i32 255, %indvar145; CHECK-NEXT: --> {255,+,-1}<nsw><%bb1> U: [0,256) S: [0,256) Exits: 0 LoopDispositions: { %bb1: Computable }146; CHECK-NEXT: %0 = getelementptr i32, ptr %alp, i32 %i.0.reg2mem.0147; CHECK-NEXT: --> {(1020 + %alp),+,-4}<nw><%bb1> U: full-set S: full-set Exits: %alp LoopDispositions: { %bb1: Computable }148; CHECK-NEXT: %1 = load i32, ptr %0, align 4149; CHECK-NEXT: --> %1 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %bb1: Variant }150; CHECK-NEXT: %2 = getelementptr i32, ptr %lam, i32 %i.0.reg2mem.0151; CHECK-NEXT: --> {(1020 + %lam),+,-4}<nw><%bb1> U: full-set S: full-set Exits: %lam LoopDispositions: { %bb1: Computable }152; CHECK-NEXT: %indvar.next = add nuw nsw i32 %indvar, 1153; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%bb1> U: [1,257) S: [1,257) Exits: 256 LoopDispositions: { %bb1: Computable }154; CHECK-NEXT: %tmp10 = mul i32 %x, 255155; CHECK-NEXT: --> (255 * %x) U: full-set S: full-set156; CHECK-NEXT: %z.0.reg2mem.0 = add i32 %y, %x157; CHECK-NEXT: --> (%x + %y) U: full-set S: full-set158; CHECK-NEXT: %3 = add i32 %z.0.reg2mem.0, %tmp10159; CHECK-NEXT: --> ((256 * %x) + %y) U: full-set S: full-set160; CHECK-NEXT: Determining loop execution counts for: @test_loop_idiom_recogize161; CHECK-NEXT: Loop %bb1: backedge-taken count is i32 255162; CHECK-NEXT: Loop %bb1: constant max backedge-taken count is i32 255163; CHECK-NEXT: Loop %bb1: symbolic max backedge-taken count is i32 255164; CHECK-NEXT: Loop %bb1: Trip multiple is 256165;166bb1.thread:167 br label %bb1168 169bb1: ; preds = %bb1, %bb1.thread170 %indvar = phi i32 [ 0, %bb1.thread ], [ %indvar.next, %bb1 ] ; <i32> [#uses=4]171 %i.0.reg2mem.0 = sub i32 255, %indvar ; <i32> [#uses=2]172 %0 = getelementptr i32, ptr %alp, i32 %i.0.reg2mem.0 ; <ptr> [#uses=1]173 %1 = load i32, ptr %0, align 4 ; <i32> [#uses=1]174 %2 = getelementptr i32, ptr %lam, i32 %i.0.reg2mem.0 ; <ptr> [#uses=1]175 store i32 %1, ptr %2, align 4176 %3 = sub i32 254, %indvar ; <i32> [#uses=1]177 %4 = icmp slt i32 %3, 0 ; <i1> [#uses=1]178 %indvar.next = add i32 %indvar, 1 ; <i32> [#uses=1]179 br i1 %4, label %bb2, label %bb1180 181bb2: ; preds = %bb1182 %tmp10 = mul i32 %indvar, %x ; <i32> [#uses=1]183 %z.0.reg2mem.0 = add i32 %tmp10, %y ; <i32> [#uses=1]184 %5 = add i32 %z.0.reg2mem.0, %x ; <i32> [#uses=1]185 ret i32 %5186}187 188declare void @use(i1)189 190declare void @llvm.experimental.guard(i1, ...)191 192; This tests getRangeRef acts as intended with different idx size.193define void @test_range_ref1(i8 %t) {194; CHECK-LABEL: 'test_range_ref1'195; CHECK-NEXT: Classifying expressions for: @test_range_ref1196; CHECK-NEXT: %0 = zext i8 %t to i40197; CHECK-NEXT: --> (zext i8 %t to i40) U: [0,256) S: [0,256)198; CHECK-NEXT: %t.ptr = inttoptr i40 %0 to ptr199; CHECK-NEXT: --> %t.ptr U: [0,256) S: [0,256)200; CHECK-NEXT: %idx = phi ptr [ %t.ptr, %entry ], [ %snext, %loop ]201; CHECK-NEXT: --> {%t.ptr,+,1}<nuw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }202; CHECK-NEXT: %snext = getelementptr inbounds nuw i8, ptr %idx, i32 1203; CHECK-NEXT: --> {(1 + %t.ptr)<nuw><nsw>,+,1}<nw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }204; CHECK-NEXT: Determining loop execution counts for: @test_range_ref1205; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.206; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.207; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count.208;209 entry:210 %t.ptr = inttoptr i8 %t to ptr211 %p.42 = inttoptr i8 42 to ptr212 %cmp1 = icmp slt ptr %t.ptr, %p.42213 call void(i1, ...) @llvm.experimental.guard(i1 %cmp1) [ "deopt"() ]214 br label %loop215 216 loop:217 %idx = phi ptr [ %t.ptr, %entry ], [ %snext, %loop ]218 %snext = getelementptr inbounds i8, ptr %idx, i64 1219 %c = icmp slt ptr %idx, %p.42220 call void @use(i1 %c)221 %be = icmp slt ptr %snext, %p.42222 br i1 %be, label %loop, label %exit223 224 exit:225 ret void226}227 228