1; REQUIRES: asserts 2; RUN: opt < %s -passes=loop-vectorize,dce,instcombine -mcpu=core-axv2 -force-vector-interleave=1 -debug-only=loop-vectorize -S < %s 2>&1 | FileCheck %s 3 4target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" 5 6; Make sure we ignore the costs of the redundant reduction casts 7; char reduction_i8(char *a, char *b, int n) { 8; char sum = 0; 9; for (int i = 0; i < n; ++i) 10; sum += (a[i] + b[i]); 11; return sum; 12; } 13; 14 15; CHECK-LABEL: reduction_i8 16; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = phi 17; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = phi 18; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = getelementptr 19; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = load 20; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = zext i8 %{{.*}} to i32 21; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = getelementptr 22; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = load 23; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = zext i8 %{{.*}} to i32 24; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = and i32 %{{.*}}, 255 25; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = add 26; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = add 27; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = add 28; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = trunc 29; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: %{{.*}} = icmp 30; CHECK: LV: Found an estimated cost of {{[0-9]+}} for VF 1 For instruction: br 31; CHECK: Cost of 1 for VF 2: induction instruction %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 32; CHECK: Cost of 1 for VF 2: induction instruction %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %for.body.preheader ] 33; CHECK: Cost of 1 for VF 2: exit condition instruction %exitcond = icmp eq i32 %lftr.wideiv, %n 34; CHECK: Cost of 0 for VF 2: exit condition instruction %lftr.wideiv = trunc i64 %indvars.iv.next to i32 35; CHECK: Cost of 0 for VF 2: EMIT vp<%3> = CANONICAL-INDUCTION ir<0>, vp<%index.next> 36; CHECK: Cost of 1 for VF 2: WIDEN-REDUCTION-PHI ir<%sum.013> = phi ir<0>, vp<%8> 37; CHECK: Cost of 0 for VF 2: vp<%4> = SCALAR-STEPS vp<%3>, ir<1> 38; CHECK: Cost of 0 for VF 2: CLONE ir<%arrayidx> = getelementptr inbounds ir<%a>, vp<%4> 39; CHECK: Cost of 0 for VF 2: vp<%5> = vector-pointer ir<%arrayidx> 40; CHECK: Cost of 1 for VF 2: WIDEN ir<%0> = load vp<%5> 41; CHECK: Cost of 0 for VF 2: WIDEN-CAST ir<%conv> = zext ir<%0> to i32 42; CHECK: Cost of 0 for VF 2: CLONE ir<%arrayidx2> = getelementptr inbounds ir<%b>, vp<%4> 43; CHECK: Cost of 0 for VF 2: vp<%6> = vector-pointer ir<%arrayidx2> 44; CHECK: Cost of 1 for VF 2: WIDEN ir<%1> = load vp<%6> 45; CHECK: Cost of 0 for VF 2: WIDEN-CAST ir<%conv3> = zext ir<%1> to i32 46; CHECK: Cost of 0 for VF 2: WIDEN ir<%conv4> = and ir<%sum.013>, ir<255> 47; CHECK: Cost of 1 for VF 2: WIDEN ir<%add> = add ir<%conv>, ir<%conv4> 48; CHECK: Cost of 1 for VF 2: WIDEN ir<%add5> = add ir<%add>, ir<%conv3> 49; CHECK: Cost of 0 for VF 2: WIDEN-CAST vp<%7> = trunc ir<%add5> to i8 50; CHECK: Cost of 0 for VF 2: WIDEN-CAST vp<%8> = zext vp<%7> to i32 51; CHECK: Cost of 0 for VF 2: EMIT vp<%index.next> = add nuw vp<%3>, vp<%0> 52; CHECK: Cost of 0 for VF 2: EMIT branch-on-count vp<%index.next>, vp<%1> 53; 54define i8 @reduction_i8(ptr nocapture readonly %a, ptr nocapture readonly %b, i32 %n) { 55entry: 56 %cmp.12 = icmp sgt i32 %n, 0 57 br i1 %cmp.12, label %for.body.preheader, label %for.cond.cleanup 58 59for.body.preheader: 60 br label %for.body 61 62for.cond.for.cond.cleanup_crit_edge: 63 %add5.lcssa = phi i32 [ %add5, %for.body ] 64 %conv6 = trunc i32 %add5.lcssa to i8 65 br label %for.cond.cleanup 66 67for.cond.cleanup: 68 %sum.0.lcssa = phi i8 [ %conv6, %for.cond.for.cond.cleanup_crit_edge ], [ 0, %entry ] 69 ret i8 %sum.0.lcssa 70 71for.body: 72 %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %for.body.preheader ] 73 %sum.013 = phi i32 [ %add5, %for.body ], [ 0, %for.body.preheader ] 74 %arrayidx = getelementptr inbounds i8, ptr %a, i64 %indvars.iv 75 %0 = load i8, ptr %arrayidx, align 1 76 %conv = zext i8 %0 to i32 77 %arrayidx2 = getelementptr inbounds i8, ptr %b, i64 %indvars.iv 78 %1 = load i8, ptr %arrayidx2, align 1 79 %conv3 = zext i8 %1 to i32 80 %conv4 = and i32 %sum.013, 255 81 %add = add nuw nsw i32 %conv, %conv4 82 %add5 = add nuw nsw i32 %add, %conv3 83 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 84 %lftr.wideiv = trunc i64 %indvars.iv.next to i32 85 %exitcond = icmp eq i32 %lftr.wideiv, %n 86 br i1 %exitcond, label %for.cond.for.cond.cleanup_crit_edge, label %for.body 87} 88