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.
40 lines
1.1 KiB
LLVM
40 lines
1.1 KiB
LLVM
; RUN: opt %loadNPMPolly -passes=polly-codegen -S < %s | FileCheck %s
|
|
;
|
|
; Check for the correct written value of a scalar phi write whose value is
|
|
; defined within the loop, but its effective value is its last definition when
|
|
; leaving the loop (in this test it is the value 2 for %i.inc). This can be
|
|
; either computed:
|
|
; - Using SCEVExpander:
|
|
; In this case the Loop passed to the expander must NOT be the loop
|
|
; - Overwriting the same alloca in each iteration s.t. the last value will
|
|
; retain in %i.inc.s2a
|
|
; The first is currently generated by Polly and tested here.
|
|
|
|
; CHECK: polly.stmt.next:
|
|
; CHECK-NEXT: store i32 2, ptr %phi.phiops
|
|
; CHECK-NEXT: br label %polly.stmt.join
|
|
|
|
define i32 @func() {
|
|
entry:
|
|
br label %start
|
|
|
|
start:
|
|
br i1 true, label %loop, label %join
|
|
|
|
loop:
|
|
%i = phi i32 [ 0, %start ], [ %i.inc, %loop ]
|
|
%i.inc = add nsw i32 %i, 1
|
|
%cond = icmp slt i32 %i.inc, 2
|
|
br i1 %cond, label %loop, label %next
|
|
|
|
next:
|
|
br label %join
|
|
|
|
join:
|
|
%phi = phi i32 [%i.inc, %next], [0, %start]
|
|
br label %return
|
|
|
|
return:
|
|
ret i32 %phi
|
|
}
|