brintos

brintos / llvm-project-archived public Read only

0
0
Text · 10.5 KiB · 05712fd Raw
326 lines · plain
1; RUN: llc < %s -O0 -asm-verbose=false -verify-machineinstrs -disable-block-placement -wasm-disable-explicit-locals -wasm-keep-registers | FileCheck %s2 3; Test irreducible CFG handling.4 5target triple = "wasm32-unknown-unknown"6 7; A simple loop with two entries.8 9; CHECK-LABEL: test0:10; CHECK: f64.load11; CHECK: i32.const $[[REG:[^,]+]]=12; CHECK: br_table  $[[REG]],13define void @test0(ptr %arg, i32 %arg1, i32 %arg2, i32 %arg3) {14bb:15  %tmp = icmp eq i32 %arg2, 016  br i1 %tmp, label %bb6, label %bb317 18bb3:                                              ; preds = %bb19  %tmp4 = getelementptr double, ptr %arg, i32 %arg320  %tmp5 = load double, ptr %tmp4, align 421  br label %bb1322 23bb6:                                              ; preds = %bb13, %bb24  %tmp7 = phi i32 [ %tmp18, %bb13 ], [ 0, %bb ]25  %tmp8 = icmp slt i32 %tmp7, %arg126  br i1 %tmp8, label %bb9, label %bb1927 28bb9:                                              ; preds = %bb629  %tmp10 = getelementptr double, ptr %arg, i32 %tmp730  %tmp11 = load double, ptr %tmp10, align 431  %tmp12 = fmul double %tmp11, 2.300000e+0032  store double %tmp12, ptr %tmp10, align 433  br label %bb1334 35bb13:                                             ; preds = %bb9, %bb336  %tmp14 = phi double [ %tmp5, %bb3 ], [ %tmp12, %bb9 ]37  %tmp15 = phi i32 [ undef, %bb3 ], [ %tmp7, %bb9 ]38  %tmp16 = getelementptr double, ptr %arg, i32 %tmp1539  %tmp17 = fadd double %tmp14, 1.300000e+0040  store double %tmp17, ptr %tmp16, align 441  %tmp18 = add nsw i32 %tmp15, 142  br label %bb643 44bb19:                                             ; preds = %bb645  ret void46}47 48; A simple loop with two entries and an inner natural loop.49 50; CHECK-LABEL: test1:51; CHECK: f64.load52; CHECK: i32.const $[[REG:[^,]+]]=53; CHECK: br_table  $[[REG]],54define void @test1(ptr %arg, i32 %arg1, i32 %arg2, i32 %arg3) {55bb:56  %tmp = icmp eq i32 %arg2, 057  br i1 %tmp, label %bb6, label %bb358 59bb3:                                              ; preds = %bb60  %tmp4 = getelementptr double, ptr %arg, i32 %arg361  %tmp5 = load double, ptr %tmp4, align 462  br label %bb1363 64bb6:                                              ; preds = %bb13, %bb65  %tmp7 = phi i32 [ %tmp18, %bb13 ], [ 0, %bb ]66  %tmp8 = icmp slt i32 %tmp7, %arg167  br i1 %tmp8, label %bb9, label %bb1968 69bb9:                                              ; preds = %bb670  %tmp10 = getelementptr double, ptr %arg, i32 %tmp771  %tmp11 = load double, ptr %tmp10, align 472  %tmp12 = fmul double %tmp11, 2.300000e+0073  store double %tmp12, ptr %tmp10, align 474  br label %bb1075 76bb10:                                             ; preds = %bb10, %bb977  %p = phi i32 [ 0, %bb9 ], [ %pn, %bb10 ]78  %pn = add i32 %p, 179  %c = icmp slt i32 %pn, 25680  br i1 %c, label %bb10, label %bb1381 82bb13:                                             ; preds = %bb10, %bb383  %tmp14 = phi double [ %tmp5, %bb3 ], [ %tmp12, %bb10 ]84  %tmp15 = phi i32 [ undef, %bb3 ], [ %tmp7, %bb10 ]85  %tmp16 = getelementptr double, ptr %arg, i32 %tmp1586  %tmp17 = fadd double %tmp14, 1.300000e+0087  store double %tmp17, ptr %tmp16, align 488  %tmp18 = add nsw i32 %tmp15, 189  br label %bb690 91bb19:                                             ; preds = %bb692  ret void93}94 95; A simple loop 2 blocks that are both entries: A1 and A2.96; Even though A1 and A2 both have 3 predecessors (A0, A1, and A2), not 6 but97; only 4 new routing blocks to the dispatch block should be generated.98 99; CHECK-LABEL: test2:100; CHECK: br_if101; CHECK: i32.const $[[REG:[^,]+]]=102; CHECK: i32.const $[[REG]]=103; CHECK: br_table  $[[REG]],104; CHECK: i32.const $[[REG]]=105; CHECK: i32.const $[[REG]]=106; CHECK-NOT: i32.const $[[REG]]=107define i32 @test2(i32) {108entry:109  br label %A0110 111A0:                                               ; preds = %entry112  %a0a = tail call i32 @test2(i32 1)113  %a0b = icmp eq i32 %a0a, 0114  br i1 %a0b, label %A1, label %A2115 116A1:                                               ; preds = %A2, %A1, %A0117  %a1a = tail call i32 @test2(i32 2)118  %a1b = icmp eq i32 %a1a, 0119  br i1 %a1b, label %A1, label %A2120 121A2:                                               ; preds = %A2, %A1, %A0122  %a2a = tail call i32 @test2(i32 3)123  %a2b = icmp eq i32 %a2a, 0124  br i1 %a2b, label %A1, label %A2125}126 127; An interesting loop with inner loop and if-else structure too.128 129; CHECK-LABEL: test3:130; CHECK: br_if131define void @test3(i32 %ws) {132entry:133  %ws.addr = alloca i32, align 4134  store volatile i32 %ws, ptr %ws.addr, align 4135  %0 = load volatile i32, ptr %ws.addr, align 4136  %tobool = icmp ne i32 %0, 0137  br i1 %tobool, label %if.then, label %if.end138 139if.then:                                          ; preds = %entry140  br label %wynn141 142if.end:                                           ; preds = %entry143  %1 = load volatile i32, ptr %ws.addr, align 4144  %tobool1 = icmp ne i32 %1, 0145  br i1 %tobool1, label %if.end9, label %if.then2146 147if.then2:                                         ; preds = %if.end148  br label %for.cond149 150for.cond:                                         ; preds = %wynn, %if.then7, %if.then2151  %2 = load volatile i32, ptr %ws.addr, align 4152  %tobool3 = icmp ne i32 %2, 0153  br i1 %tobool3, label %if.then4, label %if.end5154 155if.then4:                                         ; preds = %for.cond156  br label %if.end5157 158if.end5:                                          ; preds = %if.then4, %for.cond159  %3 = load volatile i32, ptr %ws.addr, align 4160  %tobool6 = icmp ne i32 %3, 0161  br i1 %tobool6, label %if.then7, label %if.end8162 163if.then7:                                         ; preds = %if.end5164  br label %for.cond165 166if.end8:                                          ; preds = %if.end5167  br label %wynn168 169wynn:                                             ; preds = %if.end8, %if.then170  br label %for.cond171 172if.end9:                                          ; preds = %if.end173  ret void174}175 176; Multi-level irreducibility, after reducing in the main scope we must then177; reduce in the inner loop that we just created.178; CHECK: br_table179; CHECK: br_table180define void @pi_next() {181entry:182  br i1 undef, label %sw.bb5, label %return183 184sw.bb5:                                           ; preds = %entry185  br i1 undef, label %if.then.i49, label %if.else.i52186 187if.then.i49:                                      ; preds = %sw.bb5188  br label %for.inc197.i189 190if.else.i52:                                      ; preds = %sw.bb5191  br label %for.cond57.i192 193for.cond57.i:                                     ; preds = %for.inc205.i, %if.else.i52194  store i32 0, ptr undef, align 4195  br label %for.cond65.i196 197for.cond65.i:                                     ; preds = %for.inc201.i, %for.cond57.i198  br i1 undef, label %for.body70.i, label %for.inc205.i199 200for.body70.i:                                     ; preds = %for.cond65.i201  br label %for.cond76.i202 203for.cond76.i:                                     ; preds = %for.inc197.i, %for.body70.i204  %0 = phi i32 [ %inc199.i, %for.inc197.i ], [ 0, %for.body70.i ]205  %cmp81.i = icmp slt i32 %0, 0206  br i1 %cmp81.i, label %for.body82.i, label %for.inc201.i207 208for.body82.i:                                     ; preds = %for.cond76.i209  br label %for.inc197.i210 211for.inc197.i:                                     ; preds = %for.body82.i, %if.then.i49212  %inc199.i = add nsw i32 undef, 1213  br label %for.cond76.i214 215for.inc201.i:                                     ; preds = %for.cond76.i216  br label %for.cond65.i217 218for.inc205.i:                                     ; preds = %for.cond65.i219  br label %for.cond57.i220 221return:                                           ; preds = %entry222  ret void223}224 225; A more complx case of irreducible control flow, two interacting loops.226; CHECK: ps_hints_apply227; CHECK: br_table228define void @ps_hints_apply() {229entry:230  br label %psh231 232psh:                                              ; preds = %entry233  br i1 undef, label %for.cond, label %for.body234 235for.body:                                         ; preds = %psh236  br label %do.body237 238do.body:                                          ; preds = %do.cond, %for.body239  %cmp118 = icmp eq ptr undef, undef240  br i1 %cmp118, label %Skip, label %do.cond241 242do.cond:                                          ; preds = %do.body243  br label %do.body244 245for.cond:                                         ; preds = %Skip, %psh246  br label %for.body39247 248for.body39:                                       ; preds = %for.cond249  br i1 undef, label %Skip, label %do.body45250 251do.body45:                                        ; preds = %for.body39252  unreachable253 254Skip:                                             ; preds = %for.body39, %do.body255  br label %for.cond256}257 258; A simple sequence of loops with blocks in between, that should not be259; misinterpreted as irreducible control flow.260; CHECK: fannkuch_worker261; CHECK-NOT: br_table262define i32 @fannkuch_worker(ptr %_arg) {263for.cond:264  br label %do.body265 266do.body:                                          ; preds = %do.cond, %for.cond267  br label %for.cond1268 269for.cond1:                                        ; preds = %for.cond1, %do.body270  br i1 true, label %for.cond1, label %for.end271 272for.end:                                          ; preds = %for.cond1273  br label %do.cond274 275do.cond:                                          ; preds = %for.end276  br i1 true, label %do.body, label %do.end277 278do.end:                                           ; preds = %do.cond279  br label %for.cond2280 281for.cond2:                                        ; preds = %for.end6, %do.end282  br label %for.cond3283 284for.cond3:                                        ; preds = %for.cond3, %for.cond2285  br i1 true, label %for.cond3, label %for.end6286 287for.end6:                                         ; preds = %for.cond3288  br label %for.cond2289 290return:                                           ; No predecessors!291  ret i32 1292}293 294; Test an interesting pattern of nested irreducibility.295 296; CHECK: func_2:297; CHECK: br_table298define void @func_2() {299entry:300  br i1 undef, label %lbl_937, label %if.else787301 302lbl_937:                                          ; preds = %for.body978, %entry303  br label %if.end965304 305if.else787:                                       ; preds = %entry306  br label %if.end965307 308if.end965:                                        ; preds = %if.else787, %lbl_937309  br label %for.cond967310 311for.cond967:                                      ; preds = %for.end1035, %if.end965312  br label %for.cond975313 314for.cond975:                                      ; preds = %if.end984, %for.cond967315  br i1 undef, label %for.body978, label %for.end1035316 317for.body978:                                      ; preds = %for.cond975318  br i1 undef, label %lbl_937, label %if.end984319 320if.end984:                                        ; preds = %for.body978321  br label %for.cond975322 323for.end1035:                                      ; preds = %for.cond975324  br label %for.cond967325}326