2fe8fb192f
There is important information about booting non-ack images in docs/UPDATING. ack/aout-format images can't be built any more, and booting clang/ELF-format ones is a little different. Updating to the new boot monitor is recommended. Changes in this commit: . drop boot monitor -> allowing dropping ack support . facility to copy ELF boot files to /boot so that old boot monitor can still boot fairly easily, see UPDATING . no more ack-format libraries -> single-case libraries . some cleanup of OBJECT_FMT, COMPILER_TYPE, etc cases . drop several ack toolchain commands, but not all support commands (e.g. aal is gone but acksize is not yet). . a few libc files moved to netbsd libc dir . new /bin/date as minix date used code in libc/ . test compile fix . harmonize includes . /usr/lib is no longer special: without ack, /usr/lib plays no kind of special bootstrapping role any more and bootstrapping is done exclusively through packages, so releases depend even less on the state of the machine making them now. . rename nbsd_lib* to lib* . reduce mtree
169 lines
6.1 KiB
ArmAsm
169 lines
6.1 KiB
ArmAsm
/* $NetBSD: compat___sigtramp1.S,v 1.1 2005/10/16 04:41:34 christos Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1996-2002 Eduardo Horvath
|
|
* Copyright (c) 1996 Paul Kranenburg
|
|
* Copyright (c) 1996
|
|
* The President and Fellows of Harvard College. All rights reserved.
|
|
* Copyright (c) 1992, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This software was developed by the Computer Systems Engineering group
|
|
* at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
|
|
* contributed to Berkeley.
|
|
*
|
|
* All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Lawrence Berkeley Laboratory.
|
|
* This product includes software developed by Harvard University.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by Harvard University.
|
|
* This product includes software developed by Paul Kranenburg.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "SYS.h"
|
|
|
|
#define _LOCORE
|
|
#include <machine/frame.h>
|
|
#include <machine/fsr.h>
|
|
#include <machine/ctlreg.h>
|
|
#include <machine/psl.h>
|
|
|
|
.register %g2,#ignore
|
|
.register %g3,#ignore
|
|
|
|
/*
|
|
* When this code is run, the stack looks like:
|
|
* [%sp] 128 bytes to which registers can be dumped
|
|
* [%sp + 128] signal number (goes in %o0)
|
|
* [%sp + 128 + 4] signal code (goes in %o1)
|
|
* [%sp + 128 + 8] first word of saved state (sigcontext)
|
|
* .
|
|
* .
|
|
* .
|
|
* [%sp + NNN] last word of saved state
|
|
* (followed by previous stack contents or top of signal stack).
|
|
* The address of the function to call is in %g1; the old %g1 and %o0
|
|
* have already been saved in the sigcontext. We are running in a clean
|
|
* window, all previous windows now being saved to the stack.
|
|
*
|
|
* Note that [%sp + 128 + 8] == %sp + 128 + 16. The copy at %sp+128+8
|
|
* will eventually be removed, with a hole left in its place, if things
|
|
* work out.
|
|
*/
|
|
ENTRY_NOPROFILE(__sigtramp_sigcontext_1)
|
|
/*
|
|
* XXX the `save' and `restore' below are unnecessary: should
|
|
* replace with simple arithmetic on %sp
|
|
*
|
|
* Make room on the stack for 64 %f registers + %fsr. This comes
|
|
* out to 64*4+8 or 264 bytes, but this must be aligned to a multiple
|
|
* of 64, or 320 bytes.
|
|
*/
|
|
save %sp, -CC64FSZ - 320, %sp
|
|
mov %g2, %l2 /* save globals in %l registers */
|
|
mov %g3, %l3
|
|
mov %g4, %l4
|
|
mov %g5, %l5
|
|
mov %g6, %l6
|
|
mov %g7, %l7
|
|
/*
|
|
* Saving the fpu registers is expensive, so do it iff it is
|
|
* enabled and dirty.
|
|
*/
|
|
rd %fprs, %l0
|
|
btst FPRS_DL|FPRS_DU, %l0 /* All clean? */
|
|
bz,pt %icc, 2f
|
|
btst FPRS_DL, %l0 /* test dl */
|
|
bz,pt %icc, 1f
|
|
btst FPRS_DU, %l0 /* test du */
|
|
|
|
/* fpu is enabled, oh well */
|
|
stx %fsr, [%sp + CC64FSZ + BIAS + 0]
|
|
add %sp, BIAS+CC64FSZ+BLOCK_SIZE, %l0 /* Generate a pointer so */
|
|
andn %l0, BLOCK_ALIGN, %l0 /* we can do a block store */
|
|
stda %f0, [%l0] ASI_BLK_P
|
|
inc BLOCK_SIZE, %l0
|
|
stda %f16, [%l0] ASI_BLK_P
|
|
1:
|
|
bz,pt %icc, 2f
|
|
add %sp, BIAS+CC64FSZ+BLOCK_SIZE, %l0 /* Generate a pointer so */
|
|
andn %l0, BLOCK_ALIGN, %l0 /* we can do a block store */
|
|
add %l0, 2*BLOCK_SIZE, %l0 /* and skip what we already stored */
|
|
stda %f32, [%l0] ASI_BLK_P
|
|
inc BLOCK_SIZE, %l0
|
|
stda %f48, [%l0] ASI_BLK_P
|
|
2:
|
|
membar #Sync
|
|
rd %y, %l1 /* in any case, save %y */
|
|
lduw [%fp + BIAS + 128], %o0 /* sig */
|
|
lduw [%fp + BIAS + 128 + 4], %o1 /* code */
|
|
call %g1 /* call handler */
|
|
add %fp, BIAS + 128 + 8, %o2 /* scp */
|
|
|
|
/*
|
|
* Now that the handler has returned, re-establish all the state
|
|
* we just saved above, then do a sigreturn.
|
|
*/
|
|
btst 3, %l0 /* All clean? */
|
|
bz,pt %icc, 2f
|
|
btst 1, %l0 /* test dl */
|
|
bz,pt %icc, 1f
|
|
btst 2, %l0 /* test du */
|
|
|
|
ldx [%sp + CC64FSZ + BIAS + 0], %fsr
|
|
add %sp, BIAS+CC64FSZ+BLOCK_SIZE, %l0 /* Generate a pointer so */
|
|
andn %l0, BLOCK_ALIGN, %l0 /* we can do a block load */
|
|
ldda [%l0] ASI_BLK_P, %f0
|
|
inc BLOCK_SIZE, %l0
|
|
ldda [%l0] ASI_BLK_P, %f16
|
|
1:
|
|
bz,pt %icc, 2f
|
|
wr %l1, %g0, %y /* in any case, restore %y */
|
|
add %sp, BIAS+CC64FSZ+BLOCK_SIZE, %l0 /* Generate a pointer so */
|
|
andn %l0, BLOCK_ALIGN, %l0 /* we can do a block load */
|
|
inc 2*BLOCK_SIZE, %l0 /* and skip what we already loaded */
|
|
ldda [%l0] ASI_BLK_P, %f32
|
|
inc BLOCK_SIZE, %l0
|
|
ldda [%l0] ASI_BLK_P, %f48
|
|
2:
|
|
mov %l2, %g2
|
|
mov %l3, %g3
|
|
mov %l4, %g4
|
|
mov %l5, %g5
|
|
mov %l6, %g6
|
|
mov %l7, %g7
|
|
membar #Sync
|
|
|
|
/* get registers back and set syscall # */
|
|
restore %g0, SYS_compat_16___sigreturn14, %g1
|
|
add %sp, BIAS + 128 + 8, %o0 /* compute scp */
|
|
t ST_SYSCALL /* call sigreturn */
|
|
mov SYS_exit, %g1 /* exit with errno */
|
|
t ST_SYSCALL /* if sigreturn fails */
|