95 lines · plain
1; RUN: opt < %s -passes=loop-interchange -cache-line-size=64 -pass-remarks-missed='loop-interchange' -pass-remarks-output=%t -S \2; RUN: -verify-dom-info -verify-loop-info -verify-loop-lcssa -loop-interchange-profitabilities=ignore -stats 2>&13; RUN: FileCheck --input-file=%t --check-prefix=REMARKS %s4 5@a = global i32 06@b = global i8 07@c = global i32 08@d = global i32 09@e = global [1 x [1 x i32]] zeroinitializer10 11; REMARKS: --- !Analysis12; REMARKS-NEXT: Pass: loop-interchange13; REMARKS-NEXT: Name: Dependence14; REMARKS-NEXT: Function: pr4332615; REMARKS-NEXT: Args:16; REMARKS-NEXT: - String: Computed dependence info, invoking the transform.17; REMARKS-NEXT: ...18 19; REMARKS: --- !Passed20; REMARKS-NEXT: Pass: loop-interchange21; REMARKS-NEXT: Name: Interchanged22; REMARKS-NEXT: Function: pr4332623 24define void @pr43326() {25entry:26 %0 = load i32, ptr @a27 %tobool.not2 = icmp eq i32 %0, 028 br i1 %tobool.not2, label %for.end14, label %outer.preheader29 30outer.preheader: ; preds = %entry31 %d.promoted = load i32, ptr @d32 %a.promoted = load i32, ptr @a33 br label %outer.header34 35outer.header: ; preds = %outer.preheader, %for.inc1236 %inc1312 = phi i32 [ %a.promoted, %outer.preheader ], [ %inc13, %for.inc12 ]37 %xor.lcssa.lcssa11 = phi i32 [ %d.promoted, %outer.preheader ], [ %xor.lcssa.lcssa, %for.inc12 ]38 br label %inner1.header39 40inner1.header: ; preds = %outer.header, %for.inc1041 %xor.lcssa9 = phi i32 [ %xor.lcssa.lcssa11, %outer.header ], [ %xor.lcssa, %for.inc10 ]42 %j = phi i8 [ 0, %outer.header ], [ %j.next, %for.inc10 ]43 %idxprom8 = sext i8 %j to i6444 br label %inner2.header45 46inner2.header: ; preds = %inner1.header, %for.inc47 %xor5 = phi i32 [ %xor.lcssa9, %inner1.header ], [ %xor, %for.inc ]48 %k = phi i32 [ 0, %inner1.header ], [ %k.next, %for.inc ]49 %idxprom = sext i32 %k to i6450 %arrayidx9 = getelementptr inbounds [1 x [1 x i32]], ptr @e, i64 0, i64 %idxprom, i64 %idxprom851 %1 = load i32, ptr %arrayidx952 %xor = xor i32 %xor5, %153 br label %for.inc54 55for.inc: ; preds = %inner2.header56 %k.next = add nsw i32 %k, 157 %cmp5 = icmp slt i32 %k.next, 4258 br i1 %cmp5, label %inner2.header, label %for.end59 60for.end: ; preds = %for.inc61 %xor.lcssa = phi i32 [ %xor, %for.inc ]62 %inc.lcssa = phi i32 [ %k.next, %for.inc ]63 br label %for.inc1064 65for.inc10: ; preds = %for.end66 %j.next = add i8 %j, -167 %cmp = icmp sgt i8 %j.next, -1068 br i1 %cmp, label %inner1.header, label %for.end1169 70for.end11: ; preds = %for.inc1071 %xor.lcssa.lcssa = phi i32 [ %xor.lcssa, %for.inc10 ]72 %dec.lcssa = phi i8 [ %j.next, %for.inc10 ]73 %inc.lcssa.lcssa = phi i32 [ %inc.lcssa, %for.inc10 ]74 br label %for.inc1275 76for.inc12: ; preds = %for.end1177 %inc13 = add nsw i32 %inc1312, 178 %tobool.not = icmp slt i32 %inc13, 4279 br i1 %tobool.not, label %outer.header, label %for.cond.for.end14_crit_edge80 81for.cond.for.end14_crit_edge: ; preds = %for.inc1282 %inc13.lcssa = phi i32 [ %inc13, %for.inc12 ]83 %inc.lcssa.lcssa.lcssa = phi i32 [ %inc.lcssa.lcssa, %for.inc12 ]84 %xor.lcssa.lcssa.lcssa = phi i32 [ %xor.lcssa.lcssa, %for.inc12 ]85 %dec.lcssa.lcssa = phi i8 [ %dec.lcssa, %for.inc12 ]86 store i8 %dec.lcssa.lcssa, ptr @b87 store i32 %xor.lcssa.lcssa.lcssa, ptr @d88 store i32 %inc.lcssa.lcssa.lcssa, ptr @c89 store i32 %inc13.lcssa, ptr @a90 br label %for.end1491 92for.end14: ; preds = %for.cond.for.end14_crit_edge, %entry93 ret void94}95