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