22
33// Test that control-flow cycles are not simplified infinitely.
44
5- // CHECK-LABEL: @cycle_2_blocks
6- // CHECK-NEXT: cf.br ^bb1
7- // CHECK-NEXT: ^bb1:
8- // CHECK-NEXT: cf.br ^bb1
5+ // CHECK-LABEL: @cycle_2_blocks
6+ // CHECK: cf.br ^bb1
7+ // CHECK: ^bb1:
8+ // CHECK: cf.br ^bb1
99func.func @cycle_2_blocks () {
1010 cf.br ^bb1
1111 ^bb1 :
@@ -14,9 +14,9 @@ func.func @cycle_2_blocks() {
1414 cf.br ^bb1
1515}
1616
17- // CHECK-LABEL: @no_cycle_2_blocks
18- // CHECK-NEXT: %c1_i32 = arith.constant 1 : i32
19- // CHECK-NEXT: return %c1_i32 : i32
17+ // CHECK-LABEL: @no_cycle_2_blocks
18+ // CHECK: %[[VAL_0:.*]] = arith.constant 1 : i32
19+ // CHECK: return %[[VAL_0]] : i32
2020func.func @no_cycle_2_blocks () -> i32 {
2121 cf.br ^bb1
2222 ^bb1 :
@@ -28,10 +28,10 @@ func.func @no_cycle_2_blocks() -> i32 {
2828 return %ret : i32
2929}
3030
31- // CHECK-LABEL: @cycle_4_blocks
32- // CHECK-NEXT: cf.br ^bb1
33- // CHECK-NEXT: ^bb1:
34- // CHECK-NEXT: cf.br ^bb1
31+ // CHECK-LABEL: @cycle_4_blocks
32+ // CHECK: cf.br ^bb1
33+ // CHECK: ^bb1:
34+ // CHECK: cf.br ^bb1
3535func.func @cycle_4_blocks () {
3636 cf.br ^bb1
3737 ^bb1 :
@@ -44,9 +44,9 @@ func.func @cycle_4_blocks() {
4444 cf.br ^bb1
4545}
4646
47- // CHECK-LABEL: @no_cycle_4_blocks
48- // CHECK-NEXT: %c1_i32 = arith.constant 1 : i32
49- // CHECK-NEXT: return %c1_i32 : i32
47+ // CHECK-LABEL: @no_cycle_4_blocks
48+ // CHECK: %[[VAL_0:.*]] = arith.constant 1 : i32
49+ // CHECK: return %[[VAL_0]] : i32
5050func.func @no_cycle_4_blocks () -> i32 {
5151 cf.br ^bb1
5252 ^bb1 :
@@ -62,10 +62,10 @@ func.func @no_cycle_4_blocks() -> i32 {
6262 return %ret : i32
6363}
6464
65- // CHECK-LABEL: @delayed_3_cycle
66- // CHECK-NEXT: cf.br ^bb1
67- // CHECK-NEXT: ^bb1:
68- // CHECK-NEXT: cf.br ^bb1
65+ // CHECK-LABEL: @delayed_3_cycle
66+ // CHECK: cf.br ^bb1
67+ // CHECK: ^bb1:
68+ // CHECK: cf.br ^bb1
6969func.func @delayed_3_cycle () {
7070 cf.br ^bb1
7171 ^bb1 :
0 commit comments