1 ; RUN: opt -O3 -S -analyze -scalar-evolution < %s | FileCheck %s
3 target datalayout = "e-m:m-p:40:64:64:32-i32:32-i16:16-i8:8-n32"
6 ; This file contains phase ordering tests for scalar evolution.
7 ; Test that the standard passes don't obfuscate the IR so scalar evolution can't
8 ; recognize expressions.
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.
13 ; CHECK: --> {%p,+,(8 * (%d /u 4))}
14 define void @test1(i32 %d, i32* %p) nounwind uwtable ssp {
19 for.cond: ; preds = %for.inc, %entry
20 %p.addr.0 = phi i32* [ %p, %entry ], [ %add.ptr1, %for.inc ]
21 %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
22 %cmp = icmp ne i32 %i.0, 64
23 br i1 %cmp, label %for.body, label %for.end
25 for.body: ; preds = %for.cond
26 store i32 0, i32* %p.addr.0, align 4
27 %add.ptr = getelementptr inbounds i32, i32* %p.addr.0, i32 %div
28 store i32 1, i32* %add.ptr, align 4
29 %add.ptr1 = getelementptr inbounds i32, i32* %add.ptr, i32 %div
32 for.inc: ; preds = %for.body
33 %inc = add i32 %i.0, 1
36 for.end: ; preds = %for.cond
41 ; Same thing as test1, but it is even more tempting to fold 2 * (%d /u 2)
42 ; CHECK: --> {%p,+,(8 * (%d /u 2))}
43 define void @test1a(i32 %d, i32* %p) nounwind uwtable ssp {
48 for.cond: ; preds = %for.inc, %entry
49 %p.addr.0 = phi i32* [ %p, %entry ], [ %add.ptr1, %for.inc ]
50 %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
51 %cmp = icmp ne i32 %i.0, 64
52 br i1 %cmp, label %for.body, label %for.end
54 for.body: ; preds = %for.cond
55 store i32 0, i32* %p.addr.0, align 4
56 %add.ptr = getelementptr inbounds i32, i32* %p.addr.0, i32 %div
57 store i32 1, i32* %add.ptr, align 4
58 %add.ptr1 = getelementptr inbounds i32, i32* %add.ptr, i32 %div
61 for.inc: ; preds = %for.body
62 %inc = add i32 %i.0, 1
65 for.end: ; preds = %for.cond