1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
|
; RUN: opt %loadPolly -polly-codegen -S < %s | FileCheck %s
;
; The entry of this scop's simple region (entry.split => for.end) has an trivial
; PHI node that is used in a different of the scop region. LCSSA may create such
; PHI nodes. This is a breakdown of this case in the function 'mp_unexp_sub' of
; pifft from LLVM's test-suite.
;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
define void @test(i64 %n, float* noalias nonnull %A, float %a) {
entry:
br label %entry.split
; CHECK-LABEL: polly.start:
; CHECK: store float %a, float* %b.phiops
entry.split:
%b = phi float [ %a, %entry ]
%cmp2 = icmp slt i64 %n, 5
br i1 %cmp2, label %for.cond, label %for.end
for.cond: ; preds = %for.inc, %entry
%i.0 = phi i64 [ 0, %entry.split ], [ %add, %for.inc ]
%cmp = icmp slt i64 %i.0, %n
br i1 %cmp, label %for.body, label %for.end
for.body: ; preds = %for.cond
%arrayidx = getelementptr inbounds float, float* %A, i64 %i.0
store float %b, float* %arrayidx, align 4
br label %for.inc
for.inc: ; preds = %for.body
%add = add nuw nsw i64 %i.0, 1
br label %for.cond
for.end: ; preds = %for.cond
ret void
}
|
