5c02808131
The `opt -analyze` option only works with the legacy pass manager and might be removed in the future, as explained in llvm.org/PR53733. This patch introduced -polly-print-* passes that print what the pass would print with the `-analyze` option and replaces all uses of `-analyze` in the regression tests. There are two exceptions: `CodeGen\single_loop_param_less_equal.ll` and `CodeGen\loop_with_condition_nested.ll` use `-analyze on the `-loops` pass which is not part of Polly. Reviewed By: aeubanks Differential Revision: https://reviews.llvm.org/D120782
125 lines
3.5 KiB
LLVM
125 lines
3.5 KiB
LLVM
; RUN: opt %loadPolly -polly-ignore-func=f.*,g.* -polly-print-scops -disable-output < %s | FileCheck %s
|
|
;
|
|
; Check that the flag `-polly-ignore-func` works with regexes.
|
|
;
|
|
; CHECK: Function: h
|
|
; CHECK-NEXT: Region: %for.cond---%for.end
|
|
;
|
|
; CHECK-NOT: Function:
|
|
;
|
|
; void f1(int* sum) {
|
|
; for (int i = 0; i <= 100; i++)
|
|
; sum += i * 3;
|
|
; }
|
|
; void f2(int* sum) {
|
|
; for (int i = 0; i <= 100; i++)
|
|
; sum += i * 3;
|
|
; }
|
|
; void g1(int* sum) {
|
|
; for (int i = 0; i <= 100; i++)
|
|
; sum += i * 3;
|
|
; }
|
|
; void h(int* sum) {
|
|
; for (int i = 0; i <= 100; i++)
|
|
; sum += i * 3;
|
|
; }
|
|
target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
|
|
|
|
define void @f1(i32* %sum) {
|
|
entry:
|
|
br label %entry.split1
|
|
|
|
entry.split1: ; preds = %entry
|
|
br label %entry.split
|
|
|
|
entry.split: ; preds = %entry.split1
|
|
br label %for.cond
|
|
|
|
for.cond: ; preds = %for.cond, %entry.split
|
|
%i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ]
|
|
%sum.reload = load i32, i32* %sum
|
|
%mul = mul nsw i32 %i1.0, 3
|
|
%add = add nsw i32 %sum.reload, %mul
|
|
%inc = add nsw i32 %i1.0, 1
|
|
store i32 %add, i32* %sum
|
|
%cmp = icmp slt i32 %i1.0, 100
|
|
br i1 %cmp, label %for.cond, label %for.end
|
|
|
|
for.end: ; preds = %for.cond
|
|
ret void
|
|
}
|
|
|
|
|
|
define void @f2(i32* %sum) {
|
|
entry:
|
|
br label %entry.split1
|
|
|
|
entry.split1: ; preds = %entry
|
|
br label %entry.split
|
|
|
|
entry.split: ; preds = %entry.split1
|
|
br label %for.cond
|
|
|
|
for.cond: ; preds = %for.cond, %entry.split
|
|
%i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ]
|
|
%sum.reload = load i32, i32* %sum
|
|
%mul = mul nsw i32 %i1.0, 3
|
|
%add = add nsw i32 %sum.reload, %mul
|
|
%inc = add nsw i32 %i1.0, 1
|
|
store i32 %add, i32* %sum
|
|
%cmp = icmp slt i32 %i1.0, 100
|
|
br i1 %cmp, label %for.cond, label %for.end
|
|
|
|
for.end: ; preds = %for.cond
|
|
ret void
|
|
}
|
|
|
|
define void @g1(i32* %sum) {
|
|
entry:
|
|
br label %entry.split1
|
|
|
|
entry.split1: ; preds = %entry
|
|
br label %entry.split
|
|
|
|
entry.split: ; preds = %entry.split1
|
|
br label %for.cond
|
|
|
|
for.cond: ; preds = %for.cond, %entry.split
|
|
%i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ]
|
|
%sum.reload = load i32, i32* %sum
|
|
%mul = mul nsw i32 %i1.0, 3
|
|
%add = add nsw i32 %sum.reload, %mul
|
|
%inc = add nsw i32 %i1.0, 1
|
|
store i32 %add, i32* %sum
|
|
%cmp = icmp slt i32 %i1.0, 100
|
|
br i1 %cmp, label %for.cond, label %for.end
|
|
|
|
for.end: ; preds = %for.cond
|
|
ret void
|
|
}
|
|
|
|
define void @h(i32* %sum) {
|
|
entry:
|
|
br label %entry.split1
|
|
|
|
entry.split1: ; preds = %entry
|
|
br label %entry.split
|
|
|
|
entry.split: ; preds = %entry.split1
|
|
br label %for.cond
|
|
|
|
for.cond: ; preds = %for.cond, %entry.split
|
|
%i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ]
|
|
%sum.reload = load i32, i32* %sum
|
|
%mul = mul nsw i32 %i1.0, 3
|
|
%add = add nsw i32 %sum.reload, %mul
|
|
%inc = add nsw i32 %i1.0, 1
|
|
store i32 %add, i32* %sum
|
|
%cmp = icmp slt i32 %i1.0, 100
|
|
br i1 %cmp, label %for.cond, label %for.end
|
|
|
|
for.end: ; preds = %for.cond
|
|
ret void
|
|
}
|
|
|