65 lines · plain
1; RUN: opt -passes='default<O3>,print<scalar-evolution>' -S < %s 2>&1 | FileCheck %s2;3; This file contains phase ordering tests for scalar evolution.4; Test that the standard passes don't obfuscate the IR so scalar evolution can't5; recognize expressions.6 7; CHECK: test18; The loop body contains two increments by %div.9; Make sure that 2*%div is recognizable, and not expressed as a bit mask of %d.10; CHECK: --> {%p,+,(8 * (%d /u 4))}11define void @test1(i64 %d, ptr %p) nounwind uwtable ssp {12entry:13 %div = udiv i64 %d, 414 br label %for.cond15 16for.cond: ; preds = %for.inc, %entry17 %p.addr.0 = phi ptr [ %p, %entry ], [ %add.ptr1, %for.inc ]18 %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]19 %cmp = icmp ne i32 %i.0, 6420 br i1 %cmp, label %for.body, label %for.end21 22for.body: ; preds = %for.cond23 store i32 0, ptr %p.addr.0, align 424 %add.ptr = getelementptr inbounds i32, ptr %p.addr.0, i64 %div25 store i32 1, ptr %add.ptr, align 426 %add.ptr1 = getelementptr inbounds i32, ptr %add.ptr, i64 %div27 br label %for.inc28 29for.inc: ; preds = %for.body30 %inc = add i32 %i.0, 131 br label %for.cond32 33for.end: ; preds = %for.cond34 ret void35}36 37; CHECK: test1a38; Same thing as test1, but it is even more tempting to fold 2 * (%d /u 2)39; CHECK: --> {%p,+,(8 * (%d /u 2))}40define void @test1a(i64 %d, ptr %p) nounwind uwtable ssp {41entry:42 %div = udiv i64 %d, 243 br label %for.cond44 45for.cond: ; preds = %for.inc, %entry46 %p.addr.0 = phi ptr [ %p, %entry ], [ %add.ptr1, %for.inc ]47 %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]48 %cmp = icmp ne i32 %i.0, 6449 br i1 %cmp, label %for.body, label %for.end50 51for.body: ; preds = %for.cond52 store i32 0, ptr %p.addr.0, align 453 %add.ptr = getelementptr inbounds i32, ptr %p.addr.0, i64 %div54 store i32 1, ptr %add.ptr, align 455 %add.ptr1 = getelementptr inbounds i32, ptr %add.ptr, i64 %div56 br label %for.inc57 58for.inc: ; preds = %for.body59 %inc = add i32 %i.0, 160 br label %for.cond61 62for.end: ; preds = %for.cond63 ret void64}65