File: dynamic_alloca_test.ll

package info (click to toggle)
llvm 2.6-9.1
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 57,604 kB
  • ctags: 44,336
  • sloc: cpp: 344,766; sh: 12,407; ansic: 10,617; ada: 3,070; ml: 2,505; perl: 2,496; makefile: 1,426; pascal: 1,163; exp: 389; asm: 307; python: 298; objc: 260; lisp: 182; csh: 117; xml: 38; f90: 36; tcl: 20
file content (35 lines) | stat: -rw-r--r-- 1,100 bytes parent folder | download
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
; Test that functions with dynamic allocas get inlined in a case where
; naively inlining it would result in a miscompilation.
; Functions with dynamic allocas can only be inlined into functions that
; already have dynamic allocas.

; RUN: llvm-as < %s | opt -inline | llvm-dis | \
; RUN:   grep llvm.stacksave
; RUN: llvm-as < %s | opt -inline | llvm-dis | not grep callee


declare void @ext(i32*)

define internal void @callee(i32 %N) {
        %P = alloca i32, i32 %N         ; <i32*> [#uses=1]
        call void @ext( i32* %P )
        ret void
}

define void @foo(i32 %N) {
; <label>:0
        %P = alloca i32, i32 %N         ; <i32*> [#uses=1]
        call void @ext( i32* %P )
        br label %Loop

Loop:           ; preds = %Loop, %0
        %count = phi i32 [ 0, %0 ], [ %next, %Loop ]            ; <i32> [#uses=2]
        %next = add i32 %count, 1               ; <i32> [#uses=1]
        call void @callee( i32 %N )
        %cond = icmp eq i32 %count, 100000              ; <i1> [#uses=1]
        br i1 %cond, label %out, label %Loop

out:            ; preds = %Loop
        ret void
}