File: scalar-store-from-same-bb.ll

package info (click to toggle)
llvm-toolchain-3.9 1%3A3.9.1-9
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 441,144 kB
  • ctags: 428,836
  • sloc: cpp: 2,546,577; ansic: 538,318; asm: 119,677; objc: 103,316; python: 102,148; sh: 27,847; pascal: 5,626; ml: 5,510; perl: 5,293; lisp: 4,801; makefile: 2,177; xml: 686; cs: 362; php: 212; csh: 117
file content (32 lines) | stat: -rw-r--r-- 753 bytes parent folder | download | duplicates (4)
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
; RUN: opt %loadPolly \
; RUN: -polly-codegen -S < %s | FileCheck %s

; This test ensures that the expression N + 1 that is stored in the phi-node
; alloca, is directly computed and not incorrectly transfered through memory.

; CHECK: store i64 %2, i64* %res.phiops
; CHECK: %2 = add i64 %N, 1

define i64 @foo(float* %A, i64 %N) {
entry:
  br label %next

next:
  %cond = icmp eq i64 %N, 0
  br i1 %cond, label %loop, label %merge

loop:
  %indvar = phi i64 [0, %next], [%indvar.next, %loop]
  %indvar.next = add i64 %indvar, 1
  %sum = add i64 %N, 1
  store float 4.0, float* %A
  %cmp = icmp sle i64 %indvar.next, 100
  br i1 %cmp, label %loop, label %merge

merge:
  %res = phi i64 [%sum, %loop], [0, %next]
  br label %exit

exit:
  ret i64 %res
}