1 ; RUN: llc -lsr-filter-same-scaled-reg=false < %s -o - -mtriple=x86_64-apple-macosx | FileCheck %s
2 ; Test case for the recoloring of broken hints.
3 ; This is tricky to have something reasonably small to kick this optimization since
4 ; it requires that spliting and spilling occur.
5 ; The bottom line is that this test case is fragile.
6 ; This was reduced from the make_list function from the llvm-testsuite:
7 ; SingleSource/Benchmarks/McGill/chomp.c
9 target datalayout = "e-m:o-i64:64-f80:128-n8:16:32:64-S128"
10 target triple = "x86_64-apple-macosx10.9.0"
12 %struct._list = type { ptr, ptr }
14 @ncol = external global i32, align 4
15 @nrow = external global i32, align 4
17 declare noalias ptr @copy_data()
19 declare noalias ptr @malloc(i64)
21 declare i32 @get_value()
23 declare i32 @in_wanted(ptr nocapture readonly)
25 declare noalias ptr @make_data()
27 ; CHECK-LABEL: make_list:
30 ; CHECK: subq ${{[0-9]+}}, %rsp
31 ; Move the first argument (%data) into a temporary register.
32 ; It will not survive the call to malloc otherwise.
33 ; CHECK: movq %rdi, [[ARG1:%r[0-9a-z]+]]
34 ; CHECK: callq _malloc
35 ; Compute %data - 1 as used for load in land.rhs.i (via the variable %indvars.iv.next.i).
36 ; CHECK: addq $-4, [[ARG1]]
37 ; We use to produce a useless copy here and move %data in another temporary register.
38 ; CHECK-NOT: movq [[ARG1]]
39 ; End of the first basic block.
41 ; Now check that %data is used in an address computation.
42 ; CHECK: leaq ([[ARG1]]
43 define ptr @make_list(ptr nocapture readonly %data, ptr nocapture %value, ptr nocapture %all) {
45 %call = tail call ptr @malloc(i64 16)
46 %next = getelementptr inbounds i8, ptr %call, i64 8
47 %.pre78 = load i32, ptr @ncol, align 4
48 br label %for.cond1.preheader
50 for.cond1.preheader: ; preds = %for.inc32, %entry
51 %tmp4 = phi i32 [ %.pre78, %entry ], [ 0, %for.inc32 ]
52 %current.077 = phi ptr [ %call, %entry ], [ %current.1.lcssa, %for.inc32 ]
53 %cmp270 = icmp eq i32 %tmp4, 0
54 br i1 %cmp270, label %for.inc32, label %for.body3
56 for.body3: ; preds = %if.end31, %for.cond1.preheader
57 %current.173 = phi ptr [ %current.2, %if.end31 ], [ %current.077, %for.cond1.preheader ]
58 %row.172 = phi i32 [ %row.3, %if.end31 ], [ 0, %for.cond1.preheader ]
59 %col.071 = phi i32 [ %inc, %if.end31 ], [ 0, %for.cond1.preheader ]
60 %call4 = tail call ptr @make_data()
61 %tmp5 = load i32, ptr @ncol, align 4
62 %tobool14.i = icmp eq i32 %tmp5, 0
63 br i1 %tobool14.i, label %while.cond.i, label %while.body.lr.ph.i
65 while.body.lr.ph.i: ; preds = %for.body3
66 %tmp6 = sext i32 %tmp5 to i64
67 br label %while.body.i
69 while.body.i: ; preds = %while.body.i, %while.body.lr.ph.i
70 %indvars.iv.i = phi i64 [ %tmp6, %while.body.lr.ph.i ], [ %indvars.iv.next.i, %while.body.i ]
71 %indvars.iv.next.i = add nsw i64 %indvars.iv.i, -1
72 %tmp9 = trunc i64 %indvars.iv.next.i to i32
73 %tobool.i = icmp eq i32 %tmp9, 0
74 br i1 %tobool.i, label %while.cond.i, label %while.body.i
76 while.cond.i: ; preds = %land.rhs.i, %while.body.i, %for.body3
77 %indvars.iv.i64 = phi i64 [ %indvars.iv.next.i65, %land.rhs.i ], [ 0, %for.body3 ], [ %tmp6, %while.body.i ]
78 %indvars.iv.next.i65 = add nsw i64 %indvars.iv.i64, -1
79 %tmp10 = trunc i64 %indvars.iv.i64 to i32
80 %tobool.i66 = icmp eq i32 %tmp10, 0
81 br i1 %tobool.i66, label %if.else, label %land.rhs.i
83 land.rhs.i: ; preds = %while.cond.i
84 %arrayidx.i67 = getelementptr inbounds i32, ptr %call4, i64 %indvars.iv.next.i65
85 %tmp11 = load i32, ptr %arrayidx.i67, align 4
86 %arrayidx2.i68 = getelementptr inbounds i32, ptr %data, i64 %indvars.iv.next.i65
87 %tmp12 = load i32, ptr %arrayidx2.i68, align 4
88 %cmp.i69 = icmp eq i32 %tmp11, %tmp12
89 br i1 %cmp.i69, label %while.cond.i, label %equal_data.exit
91 equal_data.exit: ; preds = %land.rhs.i
92 %cmp3.i = icmp slt i32 %tmp10, 1
93 br i1 %cmp3.i, label %if.else, label %if.then
95 if.then: ; preds = %equal_data.exit
96 %next7 = getelementptr inbounds %struct._list, ptr %current.173, i64 0, i32 1
97 %tmp14 = load ptr, ptr %next7, align 8
98 %next12 = getelementptr inbounds %struct._list, ptr %tmp14, i64 0, i32 1
99 store ptr null, ptr %next12, align 8
100 %tmp15 = load ptr, ptr %next7, align 8
101 %tmp16 = load i32, ptr %value, align 4
102 %cmp14 = icmp eq i32 %tmp16, 1
103 %.tmp16 = select i1 %cmp14, i32 0, i32 %tmp16
104 %tmp18 = load i32, ptr %all, align 4
105 %tmp19 = or i32 %tmp18, %.tmp16
106 %tmp20 = icmp eq i32 %tmp19, 0
107 br i1 %tmp20, label %if.then19, label %if.end31
109 if.then19: ; preds = %if.then
110 %call21 = tail call i32 @in_wanted(ptr %call4)
113 if.else: ; preds = %equal_data.exit, %while.cond.i
114 %cmp26 = icmp eq i32 %col.071, 0
115 %.row.172 = select i1 %cmp26, i32 0, i32 %row.172
116 %sub30 = add nsw i32 %tmp5, -1
119 if.end31: ; preds = %if.else, %if.then19, %if.then
120 %col.1 = phi i32 [ %sub30, %if.else ], [ 0, %if.then ], [ 0, %if.then19 ]
121 %row.3 = phi i32 [ %.row.172, %if.else ], [ %row.172, %if.then ], [ 0, %if.then19 ]
122 %current.2 = phi ptr [ %current.173, %if.else ], [ %tmp15, %if.then ], [ %tmp15, %if.then19 ]
123 %inc = add nsw i32 %col.1, 1
124 %tmp25 = load i32, ptr @ncol, align 4
125 %cmp2 = icmp eq i32 %inc, %tmp25
126 br i1 %cmp2, label %for.cond1.for.inc32_crit_edge, label %for.body3
128 for.cond1.for.inc32_crit_edge: ; preds = %if.end31
129 %.pre79 = load i32, ptr @nrow, align 4
132 for.inc32: ; preds = %for.cond1.for.inc32_crit_edge, %for.cond1.preheader
133 %tmp26 = phi i32 [ %.pre79, %for.cond1.for.inc32_crit_edge ], [ 0, %for.cond1.preheader ]
134 %current.1.lcssa = phi ptr [ %current.2, %for.cond1.for.inc32_crit_edge ], [ %current.077, %for.cond1.preheader ]
135 %row.1.lcssa = phi i32 [ %row.3, %for.cond1.for.inc32_crit_edge ], [ 0, %for.cond1.preheader ]
136 %inc33 = add nsw i32 %row.1.lcssa, 1
137 %cmp = icmp eq i32 %inc33, %tmp26
138 br i1 %cmp, label %for.end34, label %for.cond1.preheader
140 for.end34: ; preds = %for.inc32
141 %.pre = load ptr, ptr %next, align 8