144 lines · plain
1; RUN: llc -lsr-filter-same-scaled-reg=false < %s -o - -mtriple=x86_64-apple-macosx | FileCheck %s2; Test case for the recoloring of broken hints.3; This is tricky to have something reasonably small to kick this optimization since4; 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.c8 9target datalayout = "e-m:o-i64:64-f80:128-n8:16:32:64-S128"10target triple = "x86_64-apple-macosx10.9.0"11 12%struct._list = type { ptr, ptr }13 14@ncol = external global i32, align 415@nrow = external global i32, align 416 17declare noalias ptr @copy_data()18 19declare noalias ptr @malloc(i64)20 21declare i32 @get_value()22 23declare i32 @in_wanted(ptr nocapture readonly)24 25declare noalias ptr @make_data()26 27; CHECK-LABEL: make_list:28; Function prologue.29; CHECK: pushq30; CHECK: subq ${{[0-9]+}}, %rsp31; 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 _malloc35; 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.40; CHECK: .p2align41; Now check that %data is used in an address computation.42; CHECK: leaq ([[ARG1]]43define ptr @make_list(ptr nocapture readonly %data, ptr nocapture %value, ptr nocapture %all) {44entry:45 %call = tail call ptr @malloc(i64 16)46 %next = getelementptr inbounds i8, ptr %call, i64 847 %.pre78 = load i32, ptr @ncol, align 448 br label %for.cond1.preheader49 50for.cond1.preheader: ; preds = %for.inc32, %entry51 %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, 054 br i1 %cmp270, label %for.inc32, label %for.body355 56for.body3: ; preds = %if.end31, %for.cond1.preheader57 %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 462 %tobool14.i = icmp eq i32 %tmp5, 063 br i1 %tobool14.i, label %while.cond.i, label %while.body.lr.ph.i64 65while.body.lr.ph.i: ; preds = %for.body366 %tmp6 = sext i32 %tmp5 to i6467 br label %while.body.i68 69while.body.i: ; preds = %while.body.i, %while.body.lr.ph.i70 %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, -172 %tmp9 = trunc i64 %indvars.iv.next.i to i3273 %tobool.i = icmp eq i32 %tmp9, 074 br i1 %tobool.i, label %while.cond.i, label %while.body.i75 76while.cond.i: ; preds = %land.rhs.i, %while.body.i, %for.body377 %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, -179 %tmp10 = trunc i64 %indvars.iv.i64 to i3280 %tobool.i66 = icmp eq i32 %tmp10, 081 br i1 %tobool.i66, label %if.else, label %land.rhs.i82 83land.rhs.i: ; preds = %while.cond.i84 %arrayidx.i67 = getelementptr inbounds i32, ptr %call4, i64 %indvars.iv.next.i6585 %tmp11 = load i32, ptr %arrayidx.i67, align 486 %arrayidx2.i68 = getelementptr inbounds i32, ptr %data, i64 %indvars.iv.next.i6587 %tmp12 = load i32, ptr %arrayidx2.i68, align 488 %cmp.i69 = icmp eq i32 %tmp11, %tmp1289 br i1 %cmp.i69, label %while.cond.i, label %equal_data.exit90 91equal_data.exit: ; preds = %land.rhs.i92 %cmp3.i = icmp slt i32 %tmp10, 193 br i1 %cmp3.i, label %if.else, label %if.then94 95if.then: ; preds = %equal_data.exit96 %next7 = getelementptr inbounds %struct._list, ptr %current.173, i64 0, i32 197 %tmp14 = load ptr, ptr %next7, align 898 %next12 = getelementptr inbounds %struct._list, ptr %tmp14, i64 0, i32 199 store ptr null, ptr %next12, align 8100 %tmp15 = load ptr, ptr %next7, align 8101 %tmp16 = load i32, ptr %value, align 4102 %cmp14 = icmp eq i32 %tmp16, 1103 %.tmp16 = select i1 %cmp14, i32 0, i32 %tmp16104 %tmp18 = load i32, ptr %all, align 4105 %tmp19 = or i32 %tmp18, %.tmp16106 %tmp20 = icmp eq i32 %tmp19, 0107 br i1 %tmp20, label %if.then19, label %if.end31108 109if.then19: ; preds = %if.then110 %call21 = tail call i32 @in_wanted(ptr %call4)111 br label %if.end31112 113if.else: ; preds = %equal_data.exit, %while.cond.i114 %cmp26 = icmp eq i32 %col.071, 0115 %.row.172 = select i1 %cmp26, i32 0, i32 %row.172116 %sub30 = add nsw i32 %tmp5, -1117 br label %if.end31118 119if.end31: ; preds = %if.else, %if.then19, %if.then120 %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, 1124 %tmp25 = load i32, ptr @ncol, align 4125 %cmp2 = icmp eq i32 %inc, %tmp25126 br i1 %cmp2, label %for.cond1.for.inc32_crit_edge, label %for.body3127 128for.cond1.for.inc32_crit_edge: ; preds = %if.end31129 %.pre79 = load i32, ptr @nrow, align 4130 br label %for.inc32131 132for.inc32: ; preds = %for.cond1.for.inc32_crit_edge, %for.cond1.preheader133 %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, 1137 %cmp = icmp eq i32 %inc33, %tmp26138 br i1 %cmp, label %for.end34, label %for.cond1.preheader139 140for.end34: ; preds = %for.inc32141 %.pre = load ptr, ptr %next, align 8142 ret ptr %.pre143}144