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

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-11
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,418,840 kB
  • sloc: cpp: 5,290,826; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,898; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,913; xml: 953; cs: 573; fortran: 539
file content (32 lines) | stat: -rw-r--r-- 767 bytes parent folder | download | duplicates (15) 
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 [[REG:%.*]], i64* %res.phiops
; CHECK: [[REG]] = 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
}