1; RUN: opt < %s -passes='print<loop-cache-cost>' -disable-output 2>&1 | FileCheck %s 2 3target datalayout = "e-m:e-i64:64-n32:64" 4target triple = "powerpc64le-unknown-linux-gnu" 5 6; Check delinearization in loop cache analysis can handle fixed-size arrays. 7; The IR is copied from llvm/test/Analysis/DependenceAnalysis/SimpleSIVNoValidityCheckFixedSize.ll 8 9; CHECK: Loop 'for.body' has cost = 4186116 10; CHECK-NEXT: Loop 'for.body4' has cost = 130944 11 12;; #define N 1024 13;; #define M 2048 14;; void t1(int a[N][M]) { 15;; for (int i = 0; i < N-1; ++i) 16;; for (int j = 2; j < M; ++j) 17;; a[i][j] = a[i+1][j-2]; 18;; } 19 20define void @t1(ptr %a) { 21entry: 22 br label %for.body 23 24for.body: ; preds = %entry, %for.inc11 25 %indvars.iv4 = phi i64 [ 0, %entry ], [ %indvars.iv.next5, %for.inc11 ] 26 br label %for.body4 27 28for.body4: ; preds = %for.body, %for.body4 29 %indvars.iv = phi i64 [ 2, %for.body ], [ %indvars.iv.next, %for.body4 ] 30 %0 = add nuw nsw i64 %indvars.iv4, 1 31 %1 = add nsw i64 %indvars.iv, -2 32 %arrayidx6 = getelementptr inbounds [2048 x i32], ptr %a, i64 %0, i64 %1 33 %2 = load i32, ptr %arrayidx6, align 4 34 %a_gep = getelementptr inbounds [2048 x i32], ptr %a, i64 0 35 %arrayidx10 = getelementptr inbounds [2048 x i32], ptr %a_gep, i64 %indvars.iv4, i64 %indvars.iv 36 store i32 %2, ptr %arrayidx10, align 4 37 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 38 %exitcond = icmp ne i64 %indvars.iv.next, 2048 39 br i1 %exitcond, label %for.body4, label %for.inc11 40 41for.inc11: ; preds = %for.body4 42 %indvars.iv.next5 = add nuw nsw i64 %indvars.iv4, 1 43 %exitcond7 = icmp ne i64 %indvars.iv.next5, 1023 44 br i1 %exitcond7, label %for.body, label %for.end13 45 46for.end13: ; preds = %for.inc11 47 ret void 48} 49 50 51; CHECK: Loop 'for.body' has cost = 4186116 52; CHECK-NEXT: Loop 'for.body4' has cost = 130944 53 54define void @t2(ptr %a) { 55entry: 56 br label %for.body 57 58for.body: ; preds = %entry, %for.inc11 59 %indvars.iv4 = phi i64 [ 0, %entry ], [ %indvars.iv.next5, %for.inc11 ] 60 br label %for.body4 61 62for.body4: ; preds = %for.body, %for.body4 63 %indvars.iv = phi i64 [ 2, %for.body ], [ %indvars.iv.next, %for.body4 ] 64 %0 = add nuw nsw i64 %indvars.iv4, 1 65 %1 = add nsw i64 %indvars.iv, -2 66 %arrayidx6 = getelementptr inbounds [2048 x i32], ptr %a, i64 %0, i64 %1 67 %2 = load i32, ptr %arrayidx6, align 4 68 %call = call ptr @func_with_returned_arg(ptr returned %a) 69 %arrayidx10 = getelementptr inbounds [2048 x i32], ptr %call, i64 %indvars.iv4, i64 %indvars.iv 70 store i32 %2, ptr %arrayidx10, align 4 71 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 72 %exitcond = icmp ne i64 %indvars.iv.next, 2048 73 br i1 %exitcond, label %for.body4, label %for.inc11 74 75for.inc11: ; preds = %for.body4 76 %indvars.iv.next5 = add nuw nsw i64 %indvars.iv4, 1 77 %exitcond7 = icmp ne i64 %indvars.iv.next5, 1023 78 br i1 %exitcond7, label %for.body, label %for.end13 79 80for.end13: ; preds = %for.inc11 81 ret void 82} 83 84declare ptr @func_with_returned_arg(ptr returned %arg) 85 86; CHECK: Loop 'for.body' has cost = 2112128815104000000 87; CHECK-NEXT: Loop 'for.body4' has cost = 16762927104000000 88; CHECK-NEXT: Loop 'for.body8' has cost = 130960368000000 89; CHECK-NEXT: Loop 'for.body12' has cost = 1047682944000 90; CHECK-NEXT: Loop 'for.body16' has cost = 32772096000 91 92;; #define N 128 93;; #define M 2048 94;; void t3(int a[][N][N][N][M]) { 95;; for (int i1 = 0; i1 < N-1; ++i1) 96;; for (int i2 = 2; i2 < N; ++i2) 97;; for (int i3 = 0; i3 < N; ++i3) 98;; for (int i4 = 3; i4 < N; ++i4) 99;; for (int i5 = 0; i5 < M-2; ++i5) 100;; a[i1][i2][i3][i4][i5] = a[i1+1][i2-2][i3][i4-3][i5+2]; 101;; } 102 103define void @t3(ptr %a) { 104entry: 105 br label %for.body 106 107for.body: ; preds = %entry, %for.inc46 108 %indvars.iv18 = phi i64 [ 0, %entry ], [ %indvars.iv.next19, %for.inc46 ] 109 br label %for.body4 110 111for.body4: ; preds = %for.body, %for.inc43 112 %indvars.iv14 = phi i64 [ 2, %for.body ], [ %indvars.iv.next15, %for.inc43 ] 113 br label %for.body8 114 115for.body8: ; preds = %for.body4, %for.inc40 116 %indvars.iv11 = phi i64 [ 0, %for.body4 ], [ %indvars.iv.next12, %for.inc40 ] 117 br label %for.body12 118 119for.body12: ; preds = %for.body8, %for.inc37 120 %indvars.iv7 = phi i64 [ 3, %for.body8 ], [ %indvars.iv.next8, %for.inc37 ] 121 br label %for.body16 122 123for.body16: ; preds = %for.body12, %for.body16 124 %indvars.iv = phi i64 [ 0, %for.body12 ], [ %indvars.iv.next, %for.body16 ] 125 %0 = add nuw nsw i64 %indvars.iv18, 1 126 %1 = add nsw i64 %indvars.iv14, -2 127 %2 = add nsw i64 %indvars.iv7, -3 128 %3 = add nuw nsw i64 %indvars.iv, 2 129 %arrayidx26 = getelementptr inbounds [128 x [128 x [128 x [2048 x i32]]]], ptr %a, i64 %0, i64 %1, i64 %indvars.iv11, i64 %2, i64 %3 130 %4 = load i32, ptr %arrayidx26, align 4 131 %arrayidx36 = getelementptr inbounds [128 x [128 x [128 x [2048 x i32]]]], ptr %a, i64 %indvars.iv18, i64 %indvars.iv14, i64 %indvars.iv11, i64 %indvars.iv7, i64 %indvars.iv 132 store i32 %4, ptr %arrayidx36, align 4 133 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 134 %exitcond = icmp ne i64 %indvars.iv.next, 2046 135 br i1 %exitcond, label %for.body16, label %for.inc37 136 137for.inc37: ; preds = %for.body16 138 %indvars.iv.next8 = add nuw nsw i64 %indvars.iv7, 1 139 %exitcond10 = icmp ne i64 %indvars.iv.next8, 128 140 br i1 %exitcond10, label %for.body12, label %for.inc40 141 142for.inc40: ; preds = %for.inc37 143 %indvars.iv.next12 = add nuw nsw i64 %indvars.iv11, 1 144 %exitcond13 = icmp ne i64 %indvars.iv.next12, 128 145 br i1 %exitcond13, label %for.body8, label %for.inc43 146 147for.inc43: ; preds = %for.inc40 148 %indvars.iv.next15 = add nuw nsw i64 %indvars.iv14, 1 149 %exitcond17 = icmp ne i64 %indvars.iv.next15, 128 150 br i1 %exitcond17, label %for.body4, label %for.inc46 151 152for.inc46: ; preds = %for.inc43 153 %indvars.iv.next19 = add nuw nsw i64 %indvars.iv18, 1 154 %exitcond21 = icmp ne i64 %indvars.iv.next19, 127 155 br i1 %exitcond21, label %for.body, label %for.end48 156 157for.end48: ; preds = %for.inc46 158 ret void 159} 160