| 1 |
38 |
julius |
; Subroutines for calling unbound dynamic functions from within GDB for HPPA.
|
| 2 |
|
|
; Subroutines for out of line prologues and epilogues on for the HPPA
|
| 3 |
|
|
; Copyright (C) 1994, 1995, 1996 Free Software Foundation, Inc.
|
| 4 |
|
|
|
| 5 |
|
|
; This file is part of GCC.
|
| 6 |
|
|
|
| 7 |
|
|
; GCC is free software; you can redistribute it and/or modify
|
| 8 |
|
|
; it under the terms of the GNU General Public License as published by
|
| 9 |
|
|
; the Free Software Foundation; either version 2, or (at your option)
|
| 10 |
|
|
; any later version.
|
| 11 |
|
|
|
| 12 |
|
|
; GCC is distributed in the hope that it will be useful,
|
| 13 |
|
|
; but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 14 |
|
|
; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| 15 |
|
|
; GNU General Public License for more details.
|
| 16 |
|
|
|
| 17 |
|
|
; In addition to the permissions in the GNU General Public License, the
|
| 18 |
|
|
; Free Software Foundation gives you unlimited permission to link the
|
| 19 |
|
|
; compiled version of this file into combinations with other programs,
|
| 20 |
|
|
; and to distribute those combinations without any restriction coming
|
| 21 |
|
|
; from the use of this file. (The General Public License restrictions
|
| 22 |
|
|
; do apply in other respects; for example, they cover modification of
|
| 23 |
|
|
; the file, and distribution when not linked into a combine
|
| 24 |
|
|
; executable.)
|
| 25 |
|
|
|
| 26 |
|
|
; You should have received a copy of the GNU General Public License
|
| 27 |
|
|
; along with GCC; see the file COPYING. If not, write to
|
| 28 |
|
|
; the Free Software Foundation, 51 Franklin Street, Fifth Floor,
|
| 29 |
|
|
; Boston, MA 02110-1301, USA.
|
| 30 |
|
|
|
| 31 |
|
|
#if !defined(__pro__) && !defined(__rtems__)
|
| 32 |
|
|
.SPACE $PRIVATE$
|
| 33 |
|
|
.SUBSPA $DATA$,QUAD=1,ALIGN=8,ACCESS=31
|
| 34 |
|
|
.SUBSPA $BSS$,QUAD=1,ALIGN=8,ACCESS=31,ZERO,SORT=82
|
| 35 |
|
|
.SPACE $TEXT$
|
| 36 |
|
|
.SUBSPA $LIT$,QUAD=0,ALIGN=8,ACCESS=44
|
| 37 |
|
|
.SUBSPA $CODE$,QUAD=0,ALIGN=8,ACCESS=44,CODE_ONLY
|
| 38 |
|
|
.SUBSPA $MILLICODE$,QUAD=0,ALIGN=8,ACCESS=44,SORT=8
|
| 39 |
|
|
#endif
|
| 40 |
|
|
.IMPORT $$dyncall,MILLICODE
|
| 41 |
|
|
#if !defined(__pro__) && !defined(__rtems__)
|
| 42 |
|
|
.SPACE $TEXT$
|
| 43 |
|
|
.SUBSPA $CODE$
|
| 44 |
|
|
#else
|
| 45 |
|
|
.text
|
| 46 |
|
|
#endif
|
| 47 |
|
|
|
| 48 |
|
|
; Simply call with the address of the desired import stub in %r22 and
|
| 49 |
|
|
; arguments in the normal place (%r26-%r23 and stack slots).
|
| 50 |
|
|
;
|
| 51 |
|
|
.align 4
|
| 52 |
|
|
.EXPORT __gcc_plt_call,ENTRY,PRIV_LEV=3,RTNVAL=GR
|
| 53 |
|
|
__gcc_plt_call
|
| 54 |
|
|
.PROC
|
| 55 |
|
|
.CALLINFO
|
| 56 |
|
|
.ENTRY
|
| 57 |
|
|
; Our return address comes in %r31, not %r2!
|
| 58 |
|
|
stw %r31,-8(%r30)
|
| 59 |
|
|
|
| 60 |
|
|
; An inline version of dyncall so we don't have to worry
|
| 61 |
|
|
; about long calls to millicode, PIC and other complexities.
|
| 62 |
|
|
bb,>=,n %r22,30,L$foo
|
| 63 |
|
|
depi 0,31,2,%r22
|
| 64 |
|
|
ldw 4(%r22),%r19
|
| 65 |
|
|
ldw 0(%r22),%r22
|
| 66 |
|
|
L$foo
|
| 67 |
|
|
ldsid (%r22),%r1
|
| 68 |
|
|
mtsp %r1,%sr0
|
| 69 |
|
|
ble 0(%sr0,%r22)
|
| 70 |
|
|
copy %r31,%r2
|
| 71 |
|
|
ldw -8(%r30),%r2
|
| 72 |
|
|
|
| 73 |
|
|
; We're going to be returning to a stack address, so we
|
| 74 |
|
|
; need to do an intra-space return.
|
| 75 |
|
|
ldsid (%rp),%r1
|
| 76 |
|
|
mtsp %r1,%sr0
|
| 77 |
|
|
be,n 0(%sr0,%rp)
|
| 78 |
|
|
.EXIT
|
| 79 |
|
|
.PROCEND
|
