53 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 52; RUN: opt -passes='print<scalar-evolution>' -disable-output %s 2>&1 | FileCheck %s3 4declare i1 @cond()5 6define void @test_push_constant_into_zext(ptr %dst, ptr %src, i32 %n, i64 %offset) {7; CHECK-LABEL: 'test_push_constant_into_zext'8; CHECK-NEXT: Classifying expressions for: @test_push_constant_into_zext9; CHECK-NEXT: %outer.ptr = phi ptr [ %src, %entry ], [ %ptr.iv.next, %inner.loop ]10; CHECK-NEXT: --> %outer.ptr U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer.loop: Variant, %inner.loop: Invariant }11; CHECK-NEXT: %c = call i1 @cond()12; CHECK-NEXT: --> %c U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer.loop: Variant, %inner.loop: Invariant }13; CHECK-NEXT: %iv = phi i32 [ 0, %outer.loop ], [ %iv.next, %inner.loop ]14; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%inner.loop> U: [0,2147483647) S: [0,2147483647) Exits: (-1 + (1 smax %n))<nsw> LoopDispositions: { %inner.loop: Computable, %outer.loop: Variant }15; CHECK-NEXT: %ptr.iv = phi ptr [ %src, %outer.loop ], [ %ptr.iv.next, %inner.loop ]16; CHECK-NEXT: --> {%src,+,%offset}<%inner.loop> U: full-set S: full-set Exits: (((zext i32 (-1 + (1 smax %n))<nsw> to i64) * %offset) + %src) LoopDispositions: { %inner.loop: Computable, %outer.loop: Variant }17; CHECK-NEXT: %l = load i8, ptr %outer.ptr, align 118; CHECK-NEXT: --> %l U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner.loop: Variant, %outer.loop: Variant }19; CHECK-NEXT: %ptr.iv.next = getelementptr i8, ptr %ptr.iv, i64 %offset20; CHECK-NEXT: --> {(%offset + %src),+,%offset}<%inner.loop> U: full-set S: full-set Exits: (((zext i32 (1 smax %n) to i64) * %offset) + %src) LoopDispositions: { %inner.loop: Computable, %outer.loop: Variant }21; CHECK-NEXT: %iv.next = add i32 %iv, 122; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%inner.loop> U: [1,-2147483648) S: [1,-2147483648) Exits: (1 smax %n) LoopDispositions: { %inner.loop: Computable, %outer.loop: Variant }23; CHECK-NEXT: Determining loop execution counts for: @test_push_constant_into_zext24; CHECK-NEXT: Loop %inner.loop: backedge-taken count is (-1 + (1 smax %n))<nsw>25; CHECK-NEXT: Loop %inner.loop: constant max backedge-taken count is i32 214748364626; CHECK-NEXT: Loop %inner.loop: symbolic max backedge-taken count is (-1 + (1 smax %n))<nsw>27; CHECK-NEXT: Loop %inner.loop: Trip multiple is 128; CHECK-NEXT: Loop %outer.loop: Unpredictable backedge-taken count.29; CHECK-NEXT: Loop %outer.loop: Unpredictable constant max backedge-taken count.30; CHECK-NEXT: Loop %outer.loop: Unpredictable symbolic max backedge-taken count.31;32entry:33 br label %outer.loop34 35outer.loop:36 %outer.ptr = phi ptr [ %src, %entry ], [ %ptr.iv.next, %inner.loop ]37 %c = call i1 @cond()38 br i1 %c, label %inner.loop, label %exit39 40inner.loop:41 %iv = phi i32 [ 0, %outer.loop ], [ %iv.next, %inner.loop ]42 %ptr.iv = phi ptr [ %src, %outer.loop ], [ %ptr.iv.next, %inner.loop ]43 %l = load i8, ptr %outer.ptr, align 144 %ptr.iv.next = getelementptr i8, ptr %ptr.iv, i64 %offset45 store i8 %l, ptr %dst, align 246 %iv.next = add i32 %iv, 147 %ec = icmp slt i32 %iv.next, %n48 br i1 %ec, label %inner.loop, label %outer.loop49 50exit:51 ret void52}53