File: addrec-is-loop-invariant.ll

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-6~deb11u1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 1,418,812 kB
  • sloc: cpp: 5,290,827; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,900; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,892; xml: 953; cs: 573; fortran: 539
file content (35 lines) | stat: -rw-r--r-- 849 bytes parent folder | download | duplicates (16) 
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
 
; RUN: llc -mtriple=armv8-eabi -verify-machineinstrs %s -o /dev/null

; This test ensures that Loop Strength Reduction will
; not create an Add Reccurence Expression if not all
; its operands are loop invariants.

define void @add_rec_expr() {
entry:
  br label %loop0

loop0:
  %c.0 = phi i32 [ 0, %entry ], [ %inc.0, %loop0 ]
  %inc.0 = add nuw i32 %c.0, 1
  br i1 undef, label %loop0, label %bb1

bb1:
  %mul.0 = mul i32 %c.0, %c.0
  %gelptr.0 = getelementptr inbounds i16, i16* undef, i32 %mul.0
  br label %loop1

loop1:
  %inc.1 = phi i32 [ %inc.2, %bb4 ], [ 0, %bb1 ]
  %mul.1 = mul i32 %inc.1, %c.0
  br label %bb3

bb3:
  %add.0 = add i32 undef, %mul.1
  %gelptr.1 = getelementptr inbounds i16, i16* %gelptr.0, i32 %add.0
  store i16 undef, i16* %gelptr.1, align 2
  br label %bb4

bb4:
  %inc.2 = add nuw i32 %inc.1, 1
  br label %loop1
}