2018-10-04 05:58:44 +08:00
|
|
|
# REQUIRES: ppc
|
|
|
|
|
2019-04-23 19:47:28 +08:00
|
|
|
# RUN: llvm-mc -filetype=obj -triple=powerpc64le-unknown-linux %s -o %t.o
|
|
|
|
# RUN: ld.lld -shared %t.o -o %t.so
|
|
|
|
# RUN: llvm-objdump -d --no-show-raw-insn -r %t.so | FileCheck %s
|
2018-10-04 05:58:44 +08:00
|
|
|
|
|
|
|
# For a recursive call that is interposable the linker calls the plt-stub rather
|
|
|
|
# then calling the function directly. Since the call is through a plt stub and
|
|
|
|
# might be interposed with a different definition at runtime, a toc-restore is
|
|
|
|
# required to follow the call.
|
|
|
|
|
|
|
|
# The decision to use a plt-stub for the recursive call is not one I feel
|
|
|
|
# strongly about either way. It was done because it matches what bfd and gold do
|
|
|
|
# for recursive calls as well as keeps the logic for recursive calls consistent
|
|
|
|
# with non-recursive calls.
|
|
|
|
|
2020-03-06 06:18:38 +08:00
|
|
|
# CHECK-LABEL: 0000000000010290 <recursive_func>:
|
2020-03-23 14:03:09 +08:00
|
|
|
# CHECK: 102b8: bl 0x102d8
|
2019-05-10 13:51:00 +08:00
|
|
|
# CHECK-NEXT: ld 2, 24(1)
|
|
|
|
|
2020-03-06 06:18:38 +08:00
|
|
|
# CHECK-LABEL: 00000000000102d8 <__plt_recursive_func>:
|
2018-10-04 05:58:44 +08:00
|
|
|
|
|
|
|
.abiversion 2
|
|
|
|
.section ".text"
|
|
|
|
.p2align 2
|
|
|
|
.global recursive_func
|
|
|
|
.type recursive_func, @function
|
|
|
|
recursive_func:
|
|
|
|
.Lrf_gep:
|
|
|
|
addis 2, 12, .TOC.-.Lrf_gep@ha
|
|
|
|
addi 2, 2, .TOC.-.Lrf_gep@l
|
|
|
|
.localentry recursive_func, .-recursive_func
|
|
|
|
cmpldi 3, 2
|
|
|
|
blt 0, .Lend
|
|
|
|
|
|
|
|
mflr 0
|
|
|
|
std 0, 16(1)
|
|
|
|
stdu 1, -32(1)
|
|
|
|
addi 5, 3, -1
|
|
|
|
mulld 4, 4, 3
|
|
|
|
mr 3, 5
|
|
|
|
bl recursive_func
|
|
|
|
nop
|
|
|
|
mr 4, 3
|
|
|
|
addi 1, 1, 32
|
|
|
|
ld 0, 16(1)
|
|
|
|
mtlr 0
|
|
|
|
|
|
|
|
.Lend:
|
|
|
|
extsw 3, 4
|
|
|
|
blr
|