File: alloca.ll

package info (click to toggle)
llvm-toolchain-14 1%3A14.0.6-12
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,496,180 kB
  • sloc: cpp: 5,593,972; ansic: 986,872; asm: 585,869; python: 184,223; objc: 72,530; lisp: 31,119; f90: 27,793; javascript: 9,780; pascal: 9,762; sh: 9,482; perl: 7,468; ml: 5,432; awk: 3,523; makefile: 2,538; xml: 953; cs: 573; fortran: 567
file content (34 lines) | stat: -rw-r--r-- 720 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
33
34
 
; RUN: opt < %s -loop-rotate -S | FileCheck %s
; RUN: opt < %s -loop-rotate -verify-memoryssa -S | FileCheck %s

; Test alloca in -loop-rotate.

; We expect a different value for %ptr each iteration (according to the
; definition of alloca). I.e. each @use must be paired with an alloca.

; CHECK: call void @use(i8* %
; CHECK: %ptr = alloca i8

@e = global i16 10

declare void @use(i8*)

define void @test() {
entry:
  %end = load i16, i16* @e
  br label %loop

loop:
  %n.phi = phi i16 [ %n, %loop.fin ], [ 0, %entry ]
  %ptr = alloca i8
  %cond = icmp eq i16 %n.phi, %end
  br i1 %cond, label %exit, label %loop.fin

loop.fin:
  %n = add i16 %n.phi, 1
  call void @use(i8* %ptr)
  br label %loop

exit:
  ret void
}