mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-07-22 09:29:31 +00:00
7c9c6ed761
Essentially the same as the GEP change in r230786.
A similar migration script can be used to update test cases, though a few more
test case improvements/changes were required this time around: (r229269-r229278)
import fileinput
import sys
import re
pat = re.compile(r"((?:=|:|^)\s*load (?:atomic )?(?:volatile )?(.*?))(| addrspace\(\d+\) *)\*($| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$)")
for line in sys.stdin:
sys.stdout.write(re.sub(pat, r"\1, \2\3*\4", line))
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7649
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@230794 91177308-0d34-0410-b5e6-96231b3b80d8
98 lines
2.6 KiB
LLVM
98 lines
2.6 KiB
LLVM
; RUN: llc -verify-machineinstrs < %s -mtriple=aarch64-none-linux-gnu -aarch64-load-store-opt=0 | FileCheck %s
|
|
|
|
declare void @callee_stack0()
|
|
declare void @callee_stack8([8 x i32], i64)
|
|
declare void @callee_stack16([8 x i32], i64, i64)
|
|
|
|
define void @caller_to0_from0() nounwind {
|
|
; CHECK-LABEL: caller_to0_from0:
|
|
; CHECK-NEXT: // BB
|
|
tail call void @callee_stack0()
|
|
ret void
|
|
; CHECK-NEXT: b callee_stack0
|
|
}
|
|
|
|
define void @caller_to0_from8([8 x i32], i64) nounwind{
|
|
; CHECK-LABEL: caller_to0_from8:
|
|
; CHECK-NEXT: // BB
|
|
|
|
tail call void @callee_stack0()
|
|
ret void
|
|
; CHECK-NEXT: b callee_stack0
|
|
}
|
|
|
|
define void @caller_to8_from0() {
|
|
; CHECK-LABEL: caller_to8_from0:
|
|
|
|
; Caller isn't going to clean up any extra stack we allocate, so it
|
|
; can't be a tail call.
|
|
tail call void @callee_stack8([8 x i32] undef, i64 42)
|
|
ret void
|
|
; CHECK: bl callee_stack8
|
|
}
|
|
|
|
define void @caller_to8_from8([8 x i32], i64 %a) {
|
|
; CHECK-LABEL: caller_to8_from8:
|
|
; CHECK-NOT: sub sp, sp,
|
|
|
|
; This should reuse our stack area for the 42
|
|
tail call void @callee_stack8([8 x i32] undef, i64 42)
|
|
ret void
|
|
; CHECK: str {{x[0-9]+}}, [sp]
|
|
; CHECK-NEXT: b callee_stack8
|
|
}
|
|
|
|
define void @caller_to16_from8([8 x i32], i64 %a) {
|
|
; CHECK-LABEL: caller_to16_from8:
|
|
|
|
; Shouldn't be a tail call: we can't use SP+8 because our caller might
|
|
; have something there. This may sound obvious but implementation does
|
|
; some funky aligning.
|
|
tail call void @callee_stack16([8 x i32] undef, i64 undef, i64 undef)
|
|
; CHECK: bl callee_stack16
|
|
ret void
|
|
}
|
|
|
|
define void @caller_to8_from24([8 x i32], i64 %a, i64 %b, i64 %c) {
|
|
; CHECK-LABEL: caller_to8_from24:
|
|
; CHECK-NOT: sub sp, sp
|
|
|
|
; Reuse our area, putting "42" at incoming sp
|
|
tail call void @callee_stack8([8 x i32] undef, i64 42)
|
|
ret void
|
|
; CHECK: str {{x[0-9]+}}, [sp]
|
|
; CHECK-NEXT: b callee_stack8
|
|
}
|
|
|
|
define void @caller_to16_from16([8 x i32], i64 %a, i64 %b) {
|
|
; CHECK-LABEL: caller_to16_from16:
|
|
; CHECK-NOT: sub sp, sp,
|
|
|
|
; Here we want to make sure that both loads happen before the stores:
|
|
; otherwise either %a or %b will be wrongly clobbered.
|
|
tail call void @callee_stack16([8 x i32] undef, i64 %b, i64 %a)
|
|
ret void
|
|
|
|
; CHECK: ldr [[VAL0:x[0-9]+]],
|
|
; CHECK: ldr [[VAL1:x[0-9]+]],
|
|
; CHECK: str [[VAL1]],
|
|
; CHECK: str [[VAL0]],
|
|
|
|
; CHECK-NOT: add sp, sp,
|
|
; CHECK: b callee_stack16
|
|
}
|
|
|
|
@func = global void(i32)* null
|
|
|
|
define void @indirect_tail() {
|
|
; CHECK-LABEL: indirect_tail:
|
|
; CHECK-NOT: sub sp, sp
|
|
|
|
%fptr = load void(i32)*, void(i32)** @func
|
|
tail call void %fptr(i32 42)
|
|
ret void
|
|
; CHECK: ldr [[FPTR:x[1-9]+]], [{{x[0-9]+}}, {{#?}}:lo12:func]
|
|
; CHECK: movz w0, #{{42|0x2a}}
|
|
; CHECK: br [[FPTR]]
|
|
}
|