1 ; RUN: opt < %s -nary-reassociate -S | FileCheck %s
3 target datalayout = "e-i64:64-v16:16-v32:32-n16:32:64"
13 define void @left_reassociate(i32 %a, i32 %b, i32 %c) {
14 ; CHECK-LABEL: @left_reassociate(
16 ; CHECK: [[BASE:%[a-zA-Z0-9]+]] = add i32 %a, %c
17 call void @foo(i32 %1)
20 ; CHECK: add i32 [[BASE]], %b
21 call void @foo(i32 %3)
31 define void @right_reassociate(i32 %a, i32 %b, i32 %c) {
32 ; CHECK-LABEL: @right_reassociate(
34 ; CHECK: [[BASE:%[a-zA-Z0-9]+]] = add i32 %a, %c
35 call void @foo(i32 %1)
38 ; CHECK: add i32 [[BASE]], %b
39 call void @foo(i32 %3)
50 ; Do not rewrite t3 into t1 + b because t2 is used elsewhere and is likely free.
51 define void @no_reassociate(i32 %a, i32 %b, i32 %c) {
52 ; CHECK-LABEL: @no_reassociate(
54 ; CHECK: add i32 %a, %c
55 call void @foo(i32 %1)
57 ; CHECK: add i32 %a, %b
58 call void @foo(i32 %2)
60 ; CHECK: add i32 %2, %c
61 call void @foo(i32 %3)
72 ; No action because (a + c) does not dominate ((a + b) + c).
73 define void @conditional(i1 %p1, i1 %p2, i1 %p3, i32 %a, i32 %b, i32 %c) {
74 ; CHECK-LABEL: @conditional(
76 br i1 %p1, label %then1, label %branch1
80 ; CHECK: add i32 %a, %c
81 call void @foo(i32 %0)
85 br i1 %p2, label %then2, label %branch2
89 ; CHECK: add i32 %a, %c
90 call void @foo(i32 %1)
94 br i1 %p3, label %then3, label %return
98 ; CHECK: %2 = add i32 %a, %b
100 ; CHECK: add i32 %2, %c
101 call void @foo(i32 %3)
108 ; This test involves more conditional reassociation candidates. It exercises
109 ; the stack optimization in tryReassociatedAdd that pops the candidates that
110 ; do not dominate the current instruction.
125 ; NaryReassociate should match use1 with def3, and use2 with def1.
126 define void @conditional2(i32 %a, i32 %b, i32 %c, i1 %cond1, i1 %cond2, i1 %cond3) {
128 %def1 = add i32 %a, %b
129 br i1 %cond1, label %bb1, label %bb6
131 br i1 %cond2, label %bb2, label %bb3
133 %def2 = add i32 %a, %b
134 call void @foo(i32 %def2)
137 %def3 = add i32 %a, %b
138 br i1 %cond3, label %bb4, label %bb5
140 %def4 = add i32 %a, %b
141 call void @foo(i32 %def4)
146 ; CHECK: [[t1:%[0-9]+]] = add i32 %def3, %c
147 call void @foo(i32 %1) ; foo((a + c) + b);
148 ; CHECK-NEXT: call void @foo(i32 [[t1]])
153 ; CHECK: [[t2:%[0-9]+]] = add i32 %def1, %c
154 call void @foo(i32 %3) ; foo((a + c) + b);
155 ; CHECK-NEXT: call void @foo(i32 [[t2]])
160 ; foo(((a + d) + b) + c)
165 define void @quaternary(i32 %a, i32 %b, i32 %c, i32 %d) {
166 ; CHECK-LABEL: @quaternary(
169 call void @foo(i32 %2)
170 ; CHECK: call void @foo(i32 [[TMP1:%[a-zA-Z0-9]]])
174 ; CHECK: [[TMP2:%[a-zA-Z0-9]]] = add i32 [[TMP1]], %d
175 call void @foo(i32 %5)
176 ; CHECK: call void @foo(i32 [[TMP2]]
180 define void @iterative(i32 %a, i32 %b, i32 %c) {
182 %abc = add i32 %ab, %c
183 call void @foo(i32 %abc)
185 %ab2 = add i32 %ab, %b
186 %ab2c = add i32 %ab2, %c
187 ; CHECK: %ab2c = add i32 %abc, %b
188 call void @foo(i32 %ab2c)
189 ; CHECK-NEXT: call void @foo(i32 %ab2c)
191 %ab3 = add i32 %ab2, %b
192 %ab3c = add i32 %ab3, %c
193 ; CHECK-NEXT: %ab3c = add i32 %ab2c, %b
194 call void @foo(i32 %ab3c)
195 ; CHECK-NEXT: call void @foo(i32 %ab3c)