@@ -171,23 +171,23 @@ define void @knownbits_on_priv_to_flat(ptr addrspace(5) %ptr) {
171
171
define void @recursive_phis (i1 %cond , ptr addrspace (5 ) %ptr ) {
172
172
; OPT-LABEL: define void @recursive_phis(
173
173
; OPT-SAME: i1 [[COND:%.*]], ptr addrspace(5) [[PTR:%.*]]) {
174
- ; OPT-NEXT: entry :
174
+ ; OPT-NEXT: [[ENTRY:.*]] :
175
175
; OPT-NEXT: [[ALLOCA:%.*]] = alloca i8, align 1, addrspace(5)
176
- ; OPT-NEXT: br i1 [[COND]], label [[THEN:% .*]], label [[ELSE:% .*]]
177
- ; OPT: then :
176
+ ; OPT-NEXT: br i1 [[COND]], label % [[THEN:.*]], label % [[ELSE:.*]]
177
+ ; OPT: [[THEN]] :
178
178
; OPT-NEXT: [[PTR_INT:%.*]] = ptrtoint ptr addrspace(5) [[PTR]] to i32
179
179
; OPT-NEXT: [[PTR_OR:%.*]] = and i32 [[PTR_INT]], 65535
180
180
; OPT-NEXT: [[KB_PTR:%.*]] = inttoptr i32 [[PTR_OR]] to ptr addrspace(5)
181
- ; OPT-NEXT: br label [[FINALLY:% .*]]
182
- ; OPT: else :
183
- ; OPT-NEXT: [[OTHER_PHI:%.*]] = phi ptr addrspace(5) [ [[ALLOCA]], [[ENTRY:%.* ]] ], [ [[PHI_PTR:%.*]], [[FINALLY]] ]
184
- ; OPT-NEXT: br label [[FINALLY]]
185
- ; OPT: finally :
186
- ; OPT-NEXT: [[PHI_PTR]] = phi ptr addrspace(5) [ [[KB_PTR]], [[THEN]] ], [ [[OTHER_PHI]], [[ELSE]] ]
181
+ ; OPT-NEXT: br label % [[FINALLY:.*]]
182
+ ; OPT: [[ELSE]] :
183
+ ; OPT-NEXT: [[OTHER_PHI:%.*]] = phi ptr addrspace(5) [ [[ALLOCA]], % [[ENTRY]] ], [ [[PHI_PTR:%.*]], % [[FINALLY]] ]
184
+ ; OPT-NEXT: br label % [[FINALLY]]
185
+ ; OPT: [[FINALLY]] :
186
+ ; OPT-NEXT: [[PHI_PTR]] = phi ptr addrspace(5) [ [[KB_PTR]], % [[THEN]] ], [ [[OTHER_PHI]], % [[ELSE]] ]
187
187
; OPT-NEXT: [[TMP0:%.*]] = call ptr @llvm.amdgcn.addrspacecast.nonnull.p0.p5(ptr addrspace(5) [[PHI_PTR]])
188
188
; OPT-NEXT: store volatile i32 7, ptr [[TMP0]], align 4
189
- ; OPT-NEXT: br i1 [[COND]], label [[ELSE]], label [[END:% .*]]
190
- ; OPT: end :
189
+ ; OPT-NEXT: br i1 [[COND]], label % [[ELSE]], label % [[END:.*]]
190
+ ; OPT: [[END]] :
191
191
; OPT-NEXT: ret void
192
192
;
193
193
; DAGISEL-ASM-LABEL: recursive_phis:
0 commit comments