File: tail-byval.ll

package info (click to toggle)
llvm-toolchain-15 1%3A15.0.6-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,554,644 kB
  • sloc: cpp: 5,922,452; ansic: 1,012,136; asm: 674,362; python: 191,568; objc: 73,855; f90: 42,327; lisp: 31,913; pascal: 11,973; javascript: 10,144; sh: 9,421; perl: 7,447; ml: 5,527; awk: 3,523; makefile: 2,520; xml: 885; cs: 573; fortran: 567
file content (23 lines) | stat: -rw-r--r-- 750 bytes parent folder | download | duplicates (7) 
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 -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(i32* byval(i32) %p)

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