forked from OSchip/llvm-project
127 lines
3.5 KiB
LLVM
127 lines
3.5 KiB
LLVM
; REQUIRES: asserts
|
|
; RUN: opt < %s -basicaa -loop-interchange -verify-dom-info -S -debug 2>&1 | FileCheck %s
|
|
|
|
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
|
|
target triple = "x86_64-unknown-linux-gnu"
|
|
|
|
@A = common global [100 x [100 x i32]] zeroinitializer
|
|
|
|
declare void @foo(i64 %a)
|
|
declare void @bar(i64 %a) readnone
|
|
|
|
;;--------------------------------------Test case 01------------------------------------
|
|
;; Not safe to interchange, because the called function `foo` is not marked as
|
|
;; readnone, so it could introduce dependences.
|
|
;;
|
|
;; for(int i=0;i<N;i++) {
|
|
;; for(int j=1;j<N;j++) {
|
|
;; foo(i);
|
|
;; A[j][i] = A[j][i]+k;
|
|
;; }
|
|
;; }
|
|
|
|
; CHECK: Not interchanging loops. Cannot prove legality.
|
|
|
|
define void @interchange_01(i32 %k, i32 %N) {
|
|
entry:
|
|
%cmp21 = icmp sgt i32 %N, 0
|
|
br i1 %cmp21, label %for1.ph, label %exit
|
|
|
|
for1.ph:
|
|
%cmp219 = icmp sgt i32 %N, 1
|
|
%0 = add i32 %N, -1
|
|
br label %for1.header
|
|
|
|
for1.header:
|
|
%indvars.iv23 = phi i64 [ 0, %for1.ph ], [ %indvars.iv.next24, %for1.inc10 ]
|
|
br i1 %cmp219, label %for2.ph, label %for1.inc10
|
|
|
|
for2.ph:
|
|
br label %for2
|
|
|
|
for2:
|
|
%indvars.iv = phi i64 [ %indvars.iv.next, %for2 ], [ 1, %for2.ph ]
|
|
call void @foo(i64 %indvars.iv23)
|
|
%arrayidx5 = getelementptr inbounds [100 x [100 x i32]], [100 x [100 x i32]]* @A, i64 0, i64 %indvars.iv, i64 %indvars.iv23
|
|
%1 = load i32, i32* %arrayidx5
|
|
%add = add nsw i32 %1, %k
|
|
store i32 %add, i32* %arrayidx5
|
|
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
|
|
%lftr.wideiv = trunc i64 %indvars.iv to i32
|
|
%exitcond = icmp eq i32 %lftr.wideiv, %0
|
|
br i1 %exitcond, label %for2.loopexit , label %for2
|
|
|
|
for2.loopexit:
|
|
br label %for1.inc10
|
|
|
|
for1.inc10:
|
|
%indvars.iv.next24 = add nuw nsw i64 %indvars.iv23, 1
|
|
%lftr.wideiv25 = trunc i64 %indvars.iv23 to i32
|
|
%exitcond26 = icmp eq i32 %lftr.wideiv25, %0
|
|
br i1 %exitcond26, label %for1.loopexit, label %for1.header
|
|
|
|
for1.loopexit:
|
|
br label %exit
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
;;--------------------------------------Test case 02------------------------------------
|
|
;; Safe to interchange, because the called function `bar` is marked as readnone,
|
|
;; so it cannot introduce dependences.
|
|
;;
|
|
;; for(int i=0;i<N;i++) {
|
|
;; for(int j=1;j<N;j++) {
|
|
;; bar(i);
|
|
;; A[j][i] = A[j][i]+k;
|
|
;; }
|
|
;; }
|
|
|
|
; CHECK: Not interchanging loops. Cannot prove legality.
|
|
|
|
define void @interchange_02(i32 %k, i32 %N) {
|
|
entry:
|
|
%cmp21 = icmp sgt i32 %N, 0
|
|
br i1 %cmp21, label %for1.ph, label %exit
|
|
|
|
for1.ph:
|
|
%cmp219 = icmp sgt i32 %N, 1
|
|
%0 = add i32 %N, -1
|
|
br label %for1.header
|
|
|
|
for1.header:
|
|
%indvars.iv23 = phi i64 [ 0, %for1.ph ], [ %indvars.iv.next24, %for1.inc10 ]
|
|
br i1 %cmp219, label %for2.ph, label %for1.inc10
|
|
|
|
for2.ph:
|
|
br label %for2
|
|
|
|
for2:
|
|
%indvars.iv = phi i64 [ %indvars.iv.next, %for2 ], [ 1, %for2.ph ]
|
|
call void @bar(i64 %indvars.iv23)
|
|
%arrayidx5 = getelementptr inbounds [100 x [100 x i32]], [100 x [100 x i32]]* @A, i64 0, i64 %indvars.iv, i64 %indvars.iv23
|
|
%1 = load i32, i32* %arrayidx5
|
|
%add = add nsw i32 %1, %k
|
|
store i32 %add, i32* %arrayidx5
|
|
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
|
|
%lftr.wideiv = trunc i64 %indvars.iv to i32
|
|
%exitcond = icmp eq i32 %lftr.wideiv, %0
|
|
br i1 %exitcond, label %for2.loopexit , label %for2
|
|
|
|
for2.loopexit:
|
|
br label %for1.inc10
|
|
|
|
for1.inc10:
|
|
%indvars.iv.next24 = add nuw nsw i64 %indvars.iv23, 1
|
|
%lftr.wideiv25 = trunc i64 %indvars.iv23 to i32
|
|
%exitcond26 = icmp eq i32 %lftr.wideiv25, %0
|
|
br i1 %exitcond26, label %for1.loopexit, label %for1.header
|
|
|
|
for1.loopexit:
|
|
br label %exit
|
|
|
|
exit:
|
|
ret void
|
|
}
|