mirror of
https://github.com/llvm/llvm-project.git
synced 2025-04-23 23:06:06 +00:00
e1f056f692
Even as the NPM has been in use by Polly for a while now, the majority of the tests continue using the LPM passes. This patch ports the tests to use the NPM passes (for example, by replacing a flag such as -polly-detect with -passes=polly-detect following the NPM syntax for specifying passes) with some exceptions for some missing features in the new passes. Relanding #90632.
125 lines
3.5 KiB
LLVM
125 lines
3.5 KiB
LLVM
; RUN: opt %loadNPMPolly -polly-ignore-func=f.*,g.* '-passes=print<polly-function-scops>' -disable-output < %s 2>&1 | 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(ptr %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, ptr %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, ptr %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(ptr %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, ptr %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, ptr %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(ptr %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, ptr %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, ptr %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(ptr %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, ptr %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, ptr %sum
|
|
%cmp = icmp slt i32 %i1.0, 100
|
|
br i1 %cmp, label %for.cond, label %for.end
|
|
|
|
for.end: ; preds = %for.cond
|
|
ret void
|
|
}
|
|
|