mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-25 20:23:11 +01:00
06ea53fefe
Summary: Make LIT tests unsensitive to analysis output order. Authored By: etiotto llvm-svn: 368450
78 lines
2.6 KiB
LLVM
78 lines
2.6 KiB
LLVM
; RUN: opt < %s -passes='print<loop-cache-cost>' -disable-output 2>&1 | FileCheck %s
|
|
|
|
target datalayout = "e-m:e-i64:64-n32:64"
|
|
target triple = "powerpc64le-unknown-linux-gnu"
|
|
|
|
; void foo(long n, long m, long o, int A[n][m][o]) {
|
|
; for (long i = 0; i < n; i++)
|
|
; for (long j = 0; j < m; j++)
|
|
; for (long k = 0; k < o; k++)
|
|
; A[2*i+3][3*j-4][2*k+7] = 1;
|
|
; }
|
|
|
|
; CHECK-DAG: Loop 'for.i' has cost = 1000000
|
|
; CHECK-DAG: Loop 'for.j' has cost = 1000000
|
|
; CHECK-DAG: Loop 'for.k' has cost = 60000
|
|
|
|
define void @foo(i64 %n, i64 %m, i64 %o, i32* %A) {
|
|
entry:
|
|
%cmp32 = icmp sgt i64 %n, 0
|
|
%cmp230 = icmp sgt i64 %m, 0
|
|
%cmp528 = icmp sgt i64 %o, 0
|
|
br i1 %cmp32, label %for.cond1.preheader.lr.ph, label %for.end
|
|
|
|
for.cond1.preheader.lr.ph: ; preds = %entry
|
|
br i1 %cmp230, label %for.i.preheader, label %for.end
|
|
|
|
for.i.preheader: ; preds = %for.cond1.preheader.lr.ph
|
|
br i1 %cmp528, label %for.i.preheader.split, label %for.end
|
|
|
|
for.i.preheader.split: ; preds = %for.i.preheader
|
|
br label %for.i
|
|
|
|
for.i: ; preds = %for.inci, %for.i.preheader.split
|
|
%i = phi i64 [ %inci, %for.inci ], [ 0, %for.i.preheader.split ]
|
|
%mul8 = shl i64 %i, 1
|
|
%add9 = add nsw i64 %mul8, 3
|
|
%0 = mul i64 %add9, %m
|
|
%sub = add i64 %0, -4
|
|
br label %for.j
|
|
|
|
for.j: ; preds = %for.incj, %for.i
|
|
%j = phi i64 [ %incj, %for.incj ], [ 0, %for.i ]
|
|
%mul7 = mul nsw i64 %j, 3
|
|
%tmp = add i64 %sub, %mul7
|
|
%tmp27 = mul i64 %tmp, %o
|
|
br label %for.k
|
|
|
|
for.k: ; preds = %for.k, %for.j.us
|
|
%k = phi i64 [ 0, %for.j ], [ %inck, %for.k ]
|
|
|
|
%mul = mul nsw i64 %k, 2
|
|
%arrayidx.sum = add i64 %mul, 7
|
|
%arrayidx10.sum = add i64 %arrayidx.sum, %tmp27
|
|
%arrayidx11 = getelementptr inbounds i32, i32* %A, i64 %arrayidx10.sum
|
|
store i32 1, i32* %arrayidx11, align 4
|
|
|
|
%inck = add nsw i64 %k, 1
|
|
%exitcond.us = icmp eq i64 %inck, %o
|
|
br i1 %exitcond.us, label %for.incj, label %for.k
|
|
|
|
for.incj: ; preds = %for.k
|
|
%incj = add nsw i64 %j, 1
|
|
%exitcond54.us = icmp eq i64 %incj, %m
|
|
br i1 %exitcond54.us, label %for.inci, label %for.j
|
|
|
|
for.inci: ; preds = %for.incj
|
|
%inci = add nsw i64 %i, 1
|
|
%exitcond55.us = icmp eq i64 %inci, %n
|
|
br i1 %exitcond55.us, label %for.end.loopexit, label %for.i
|
|
|
|
for.end.loopexit: ; preds = %for.inci
|
|
br label %for.end
|
|
|
|
for.end: ; preds = %for.end.loopexit, %for.cond1.preheader.lr.ph, %entry
|
|
ret void
|
|
}
|
|
|