File: tail-byval.ll

package info (click to toggle)
llvm-toolchain-20 1%3A20.1.6-1~exp1
  • links: PTS, VCS
  • area: main
  • in suites: experimental
  • size: 2,111,304 kB
  • sloc: cpp: 7,438,677; ansic: 1,393,822; asm: 1,012,926; python: 241,650; f90: 86,635; objc: 75,479; lisp: 42,144; pascal: 17,286; sh: 10,027; ml: 5,082; perl: 4,730; awk: 3,523; makefile: 3,349; javascript: 2,251; xml: 892; fortran: 672
file content (23 lines) | stat: -rw-r--r-- 749 bytes parent folder | download | duplicates (14) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
 
; RUN: opt -passes=dse -S < %s | FileCheck %s

; Don't eliminate stores to allocas before tail calls to functions that use
; byval. It's correct to mark calls like these as 'tail'. To implement this tail
; call, the backend should copy the bytes from the alloca into the argument area
; before clearing the stack.

target datalayout = "e-m:e-p:32:32-f64:32:64-f80:32-n8:16:32-S128"
target triple = "i386-unknown-linux-gnu"

declare void @g(ptr byval(i32) %p)

define void @f(ptr byval(i32) %x) {
entry:
  %p = alloca i32
  %v = load i32, ptr %x
  store i32 %v, ptr %p
  tail call void @g(ptr byval(i32) %p)
  ret void
}
; CHECK-LABEL: define void @f(ptr byval(i32) %x)
; CHECK:   store i32 %v, ptr %p
; CHECK:   tail call void @g(ptr byval(i32) %p)