73 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 -stats 2>&13; RUN: FileCheck --input-file=%t --check-prefix=REMARKS %s4 5; Triply nested loop, should be able to do interchange three times6; to get the ideal access pattern.7; void f(int e[restrict 10][10][10], int f[restrict 10][10][10]) {8; for (int a = 0; a < 10; a++) {9; for (int b = 0; b < 10; b++) {10; for (int c = 0; c < 10; c++) {11; f[c][b][a] = e[c][b][a];12; }13; }14; }15; }16 17; REMARKS: --- !Analysis18; REMARKS-NEXT: Pass: loop-interchange19; REMARKS-NEXT: Name: Dependence20; REMARKS-NEXT: Function: pr43326-triply-nested21; REMARKS-NEXT: Args:22; REMARKS-NEXT: - String: Computed dependence info, invoking the transform.23; REMARKS-NEXT: ...24 25; REMARKS: --- !Passed26; REMARKS-NEXT: Pass: loop-interchange27; REMARKS-NEXT: Name: Interchanged28; REMARKS-NEXT: Function: pr43326-triply-nested29; REMARKS: --- !Passed30; REMARKS-NEXT: Pass: loop-interchange31; REMARKS-NEXT: Name: Interchanged32; REMARKS-NEXT: Function: pr43326-triply-nested33; REMARKS: --- !Passed34; REMARKS-NEXT: Pass: loop-interchange35; REMARKS-NEXT: Name: Interchanged36; REMARKS-NEXT: Function: pr43326-triply-nested37 38define void @pr43326-triply-nested(ptr noalias %e, ptr noalias %f) {39entry:40 br label %for.outermost.header41 42for.outermost.header: ; preds = %entry, %for.outermost.latch43 %indvars.outermost = phi i64 [ 0, %entry ], [ %indvars.outermost.next, %for.outermost.latch ]44 br label %for.middle.header45 46for.cond.cleanup: ; preds = %for.outermost.latch47 ret void48 49for.middle.header: ; preds = %for.outermost.header, %for.middle.latch50 %indvars.middle = phi i64 [ 0, %for.outermost.header ], [ %indvars.middle.next, %for.middle.latch ]51 br label %for.innermost52 53for.outermost.latch: ; preds = %for.middle.latch54 %indvars.outermost.next = add nuw nsw i64 %indvars.outermost, 155 %exitcond.outermost = icmp ne i64 %indvars.outermost.next, 1056 br i1 %exitcond.outermost, label %for.outermost.header, label %for.cond.cleanup57 58for.middle.latch: ; preds = %for.innermost59 %indvars.middle.next = add nuw nsw i64 %indvars.middle, 160 %exitcond.middle = icmp ne i64 %indvars.middle.next, 1061 br i1 %exitcond.middle, label %for.middle.header, label %for.outermost.latch62 63for.innermost: ; preds = %for.middle.header, %for.innermost64 %indvars.innermost = phi i64 [ 0, %for.middle.header ], [ %indvars.innermost.next, %for.innermost ]65 %arrayidx12 = getelementptr inbounds [10 x [10 x i32]], ptr %e, i64 %indvars.innermost, i64 %indvars.middle, i64 %indvars.outermost66 %0 = load i32, ptr %arrayidx1267 %arrayidx18 = getelementptr inbounds [10 x [10 x i32]], ptr %f, i64 %indvars.innermost, i64 %indvars.middle, i64 %indvars.outermost68 store i32 %0, ptr %arrayidx1869 %indvars.innermost.next = add nuw nsw i64 %indvars.innermost, 170 %exitcond.innermost = icmp ne i64 %indvars.innermost.next, 1071 br i1 %exitcond.innermost, label %for.innermost, label %for.middle.latch72}73