1 ; RUN: llc < %s -print-machineinstrs=expand-isel-pseudos -o /dev/null 2>&1 | FileCheck %s 2 3 ; Hexagon runs passes that renumber the basic blocks, causing this test 4 ; to fail. 5 ; XFAIL: hexagon 6 7 ; Bug: PR31899 8 ; XFAIL: avr 9 10 declare void @foo() 11 12 ; Make sure we have the correct weight attached to each successor. 13 define i32 @test2(i32 %x) nounwind uwtable readnone ssp { 14 ; CHECK-LABEL: Machine code for function test2: 15 entry: 16 %conv = sext i32 %x to i64 17 switch i64 %conv, label %return [ 18 i64 0, label %sw.bb 19 i64 1, label %sw.bb 20 i64 4, label %sw.bb 21 i64 5, label %sw.bb1 22 i64 15, label %sw.bb 23 ], !prof !0 24 ; CHECK: bb.0.entry: 25 ; CHECK: successors: %bb.1(0x75f8ebf2), %bb.4(0x0a07140e) 26 ; CHECK: bb.4.entry: 27 ; CHECK: successors: %bb.2(0x60606068), %bb.5(0x1f9f9f98) 28 ; CHECK: bb.5.entry: 29 ; CHECK: successors: %bb.1(0x3cf3cf4b), %bb.6(0x430c30b5) 30 ; CHECK: bb.6.entry: 31 ; CHECK: successors: %bb.1(0x2e8ba2d7), %bb.3(0x51745d29) 32 33 sw.bb: 34 ; this call will prevent simplifyCFG from optimizing the block away in ARM/AArch64. 35 tail call void @foo() 36 br label %return 37 38 sw.bb1: 39 br label %return 40 41 return: 42 %retval.0 = phi i32 [ 5, %sw.bb1 ], [ 1, %sw.bb ], [ 0, %entry ] 43 ret i32 %retval.0 44 } 45 46 !0 = !{!"branch_weights", i32 7, i32 6, i32 4, i32 4, i32 64, i21 1000} 47 48 49 declare void @g(i32) 50 define void @left_leaning_weight_balanced_tree(i32 %x) { 51 entry: 52 switch i32 %x, label %return [ 53 i32 0, label %bb0 54 i32 100, label %bb1 55 i32 200, label %bb2 56 i32 300, label %bb3 57 i32 400, label %bb4 58 i32 500, label %bb5 59 ], !prof !1 60 bb0: tail call void @g(i32 0) br label %return 61 bb1: tail call void @g(i32 1) br label %return 62 bb2: tail call void @g(i32 2) br label %return 63 bb3: tail call void @g(i32 3) br label %return 64 bb4: tail call void @g(i32 4) br label %return 65 bb5: tail call void @g(i32 5) br label %return 66 return: ret void 67 68 ; Check that we set branch weights on the pivot cmp instruction correctly. 69 ; Cases {0,10,20,30} go on the left with weight 13; cases {40,50} go on the 70 ; right with weight 20. 71 ; 72 ; CHECK-LABEL: Machine code for function left_leaning_weight_balanced_tree: 73 ; CHECK: bb.0.entry: 74 ; CHECK-NOT: Successors 75 ; CHECK: successors: %bb.8(0x32d2d2d3), %bb.9(0x4d2d2d2d) 76 } 77 78 !1 = !{!"branch_weights", 79 ; Default: 80 i32 1, 81 ; Case 0, 100, 200: 82 i32 10, i32 1, i32 1, 83 ; Case 300, 400, 500: 84 i32 1, i32 10, i32 10} 85
