1 # NOTE: Assertions have been autogenerated by utils/update_mir_test_checks.py UTC_ARGS: --version 5
2 # RUN: llc -verify-machineinstrs -mtriple aarch64-none-linux-gnu -run-pass early-tailduplication -o - %s | FileCheck %s
4 # These tests used to hit verification failure due to register class
5 # mismatches after tail dupilication (and the SSA form updates).
7 # In test1 we have a simple case when the COPY already is duplicated, but
8 # TailDuplication will try to eliminate the PHI in bb.2 by adding a new PHI in
9 # bb.4. The presence of a PHI node in bb.4, which happens to assign to a
10 # fpr32 register, was enough to mess up the result. The PHI node was reused
11 # and the use of %2 in the CBNZW was changed into using %3 instead. But the
12 # register class of %3 is not correct for CBNZW.
13 # The fix involves adding a COPY instruction that moves the value to
14 # a register of correct regclass.
17 tracksRegLiveness: true
19 ; CHECK-LABEL: name: test1
21 ; CHECK-NEXT: successors: %bb.4(0x80000000)
23 ; CHECK-NEXT: $x0 = COPY undef $x0, implicit-def %0
27 ; CHECK-NEXT: successors: %bb.4(0x80000000)
29 ; CHECK-NEXT: $x0 = COPY undef $x0, implicit-def %1
33 ; CHECK-NEXT: successors: %bb.3(0x80000000)
38 ; CHECK-NEXT: successors: %bb.5(0x80000000)
40 ; CHECK-NEXT: [[PHI:%[0-9]+]]:fpr32 = PHI %0, %bb.0, %1, %bb.1
41 ; CHECK-NEXT: [[COPY:%[0-9]+]]:gpr32 = COPY [[PHI]]
42 ; CHECK-NEXT: $x0 = COPY undef $x0, implicit [[PHI]]
43 ; CHECK-NEXT: CBNZW [[COPY]], %bb.5
47 $x0 = COPY undef $x0, implicit-def %0:gpr32
51 $x0 = COPY undef $x0, implicit-def %1:gpr32
54 %2:gpr32 = PHI %1, %bb.1, %0, %bb.0
61 %3:fpr32 = PHI %2, %bb.2
62 $x0 = COPY undef $x0, implicit %3:fpr32
69 # In test2 there are two PHIs already present, one with the wanted register
70 # class. No idea if this is a common scenario in reality (hand written mir
72 # FIXME: Can we pick the best PHI directly instead of getting a COPY from the
73 # one with wrong register class?
76 tracksRegLiveness: true
78 ; CHECK-LABEL: name: test2
80 ; CHECK-NEXT: successors: %bb.4(0x80000000)
82 ; CHECK-NEXT: $x0 = COPY undef $x0, implicit-def %0
86 ; CHECK-NEXT: successors: %bb.4(0x80000000)
88 ; CHECK-NEXT: $x0 = COPY undef $x0, implicit-def %1
92 ; CHECK-NEXT: successors: %bb.3(0x80000000)
97 ; CHECK-NEXT: successors: %bb.5(0x80000000)
99 ; CHECK-NEXT: [[PHI:%[0-9]+]]:fpr32 = PHI %0, %bb.0, %1, %bb.1
100 ; CHECK-NEXT: [[PHI1:%[0-9]+]]:gpr32 = PHI %0, %bb.0, %1, %bb.1
101 ; CHECK-NEXT: [[COPY:%[0-9]+]]:gpr32 = COPY [[PHI]]
102 ; CHECK-NEXT: CBNZW [[COPY]], %bb.5
105 ; CHECK-NEXT: $x0 = COPY undef $x0, implicit [[PHI]]
107 $x0 = COPY undef $x0, implicit-def %0:gpr32
111 $x0 = COPY undef $x0, implicit-def %1:gpr32
114 %2:gpr32 = PHI %1, %bb.1, %0, %bb.0
121 %3:fpr32 = PHI %2, %bb.2
122 %4:gpr32 = PHI %2, %bb.2
126 $x0 = COPY undef $x0, implicit %3:fpr32
129 # In test3 we have multiple uses, and in multiple BBs. This test is to show
130 # that we get one COPY instruction inserted for each BB where there is a use.
133 tracksRegLiveness: true
135 ; CHECK-LABEL: name: test3
137 ; CHECK-NEXT: successors: %bb.4(0x80000000)
139 ; CHECK-NEXT: $x0 = COPY undef $x0, implicit-def %0
140 ; CHECK-NEXT: B %bb.4
143 ; CHECK-NEXT: successors: %bb.4(0x80000000)
145 ; CHECK-NEXT: $x0 = COPY undef $x0, implicit-def %1
146 ; CHECK-NEXT: B %bb.4
149 ; CHECK-NEXT: successors: %bb.3(0x80000000)
151 ; CHECK-NEXT: B %bb.3
154 ; CHECK-NEXT: successors: %bb.5(0x80000000)
156 ; CHECK-NEXT: [[PHI:%[0-9]+]]:fpr32 = PHI %0, %bb.0, %1, %bb.1
157 ; CHECK-NEXT: $x0 = COPY undef $x0, implicit [[PHI]]
160 ; CHECK-NEXT: successors: %bb.6(0x80000000)
162 ; CHECK-NEXT: [[COPY:%[0-9]+]]:gpr32 = COPY [[PHI]]
163 ; CHECK-NEXT: CBNZW [[COPY]], %bb.6
166 ; CHECK-NEXT: successors: %bb.7(0x80000000)
168 ; CHECK-NEXT: [[COPY1:%[0-9]+]]:gpr32 = COPY [[PHI]]
169 ; CHECK-NEXT: CBNZW [[COPY1]], %bb.7
173 $x0 = COPY undef $x0, implicit-def %0:gpr32
177 $x0 = COPY undef $x0, implicit-def %1:gpr32
180 %2:gpr32 = PHI %1, %bb.1, %0, %bb.0
187 %3:fpr32 = PHI %2, %bb.2
188 $x0 = COPY undef $x0, implicit %3:fpr32
199 # In test4 we do not need to insert a COPY.
200 # The register class can be constrained instead.
203 tracksRegLiveness: true
205 ; CHECK-LABEL: name: test4
207 ; CHECK-NEXT: successors: %bb.4(0x80000000)
209 ; CHECK-NEXT: $x0 = COPY undef $x0, implicit-def %0
210 ; CHECK-NEXT: B %bb.4
213 ; CHECK-NEXT: successors: %bb.4(0x80000000)
215 ; CHECK-NEXT: $x0 = COPY undef $x0, implicit-def %1
216 ; CHECK-NEXT: B %bb.4
219 ; CHECK-NEXT: successors: %bb.3(0x80000000)
221 ; CHECK-NEXT: B %bb.3
224 ; CHECK-NEXT: successors: %bb.5(0x80000000)
226 ; CHECK-NEXT: [[PHI:%[0-9]+]]:gpr32common = PHI %0, %bb.0, %1, %bb.1
227 ; CHECK-NEXT: CBNZW [[PHI]], %bb.5
231 $x0 = COPY undef $x0, implicit-def %0:gpr32
235 $x0 = COPY undef $x0, implicit-def %1:gpr32
238 %2:gpr32 = PHI %1, %bb.1, %0, %bb.0
245 %3:gpr32sp = PHI %2, %bb.2
252 # In test5 we do not need to insert a COPY.
253 # The register class can be constrained instead.
256 tracksRegLiveness: true
258 ; CHECK-LABEL: name: test5
260 ; CHECK-NEXT: successors: %bb.4(0x80000000)
262 ; CHECK-NEXT: $x0 = COPY undef $x0, implicit-def %0
263 ; CHECK-NEXT: B %bb.4
266 ; CHECK-NEXT: successors: %bb.4(0x80000000)
268 ; CHECK-NEXT: $x0 = COPY undef $x0, implicit-def %1
269 ; CHECK-NEXT: B %bb.4
272 ; CHECK-NEXT: successors: %bb.3(0x80000000)
274 ; CHECK-NEXT: B %bb.3
277 ; CHECK-NEXT: successors: %bb.5(0x80000000)
279 ; CHECK-NEXT: [[PHI:%[0-9]+]]:gpr32common = PHI %0, %bb.0, %1, %bb.1
280 ; CHECK-NEXT: CBNZW [[PHI]], %bb.5
284 $x0 = COPY undef $x0, implicit-def %0:gpr32common
288 $x0 = COPY undef $x0, implicit-def %1:gpr32common
291 %2:gpr32common = PHI %1, %bb.1, %0, %bb.0
298 %3:gpr32 = PHI %2, %bb.2