| /* |
| * Copyright (C) 2014 The Android Open Source Project |
| * All rights reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * * Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * * 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. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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 |
| * COPYRIGHT OWNER 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. |
| */ |
| /* |
| * Copyright (c) 2001-2002 Opsycon AB (www.opsycon.se / www.opsycon.com) |
| * |
| * 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. Neither the name of Opsycon AB 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 AUTHOR ``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 AUTHOR 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. |
| * |
| */ |
| /*- |
| * Copyright (c) 1991, 1993, 1995, |
| * The Regents of the University of California. All rights reserved. |
| * |
| * This code is derived from software contributed to Berkeley by |
| * Havard Eidnes. |
| * |
| * 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. 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. |
| */ |
| /* |
| * Copyright (c) 1992, 1993 |
| * The Regents of the University of California. All rights reserved. |
| * |
| * This code is derived from software contributed to Berkeley by |
| * Ralph Campbell. |
| * |
| * 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. 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. |
| * |
| * @(#)signal.h 8.1 (Berkeley) 6/10/93 |
| */ |
| |
| #include <private/bionic_asm.h> |
| #include <machine/setjmp.h> |
| |
| /* jmpbuf is declared to users as an array of longs, which is only |
| * 4-byte aligned in 32-bit builds. The Mips jmpbuf begins with a |
| * dynamically-sized 0- or 4-byte unused filler so that double-prec FP regs |
| * are saved to 8-byte-aligned mem cells. |
| * All the following jmpbuf offsets are from the rounded-DOWN base addr. |
| */ |
| |
| /* Fields of same size on all MIPS abis: */ |
| /* field: byte offset: size: */ |
| /* dynam filler (0*4) 0-4 bytes of rounddown filler, DON'T TOUCH!! |
| often overlays user storage!! */ |
| #define SC_FPSR_OFFSET (1*4) /* 4 bytes, floating point control/status reg */ |
| /* following fields are 8-byte aligned */ |
| #define SC_FLAG_OFFSET (2*4) /* 8 bytes, cookie and savesigs flag, first actual field */ |
| #define SC_MASK_OFFSET (4*4) /* 16 bytes, mips32/mips64 version of sigset_t */ |
| #define SC_CKSUM_OFFSET (8*4) /* 8 bytes, used for checksum */ |
| |
| /* Registers that are 4-byte on mips32 o32, and 8-byte on mips64 n64 abi */ |
| #define SC_REGS_OFFSET (10*4) /* SC_REGS_BYTES */ |
| #define SC_REGS_SAVED 12 /*regs*/ /* ra,s0-s8,gp,sp */ |
| #define SC_REGS_BYTES (SC_REGS_SAVED*REGSZ) |
| #define SC_REGS SC_REGS_OFFSET |
| |
| /* Double floating pt registers are 8-bytes on all abis, |
| * but the number of saved fp regs varies for o32/n32 versus n64 abis: |
| */ |
| |
| #ifdef __LP64__ |
| #define SC_FPREGS_SAVED 8 /* all fp regs f24,f25,f26,f27,f28,f29,f30,f31 */ |
| #else |
| #define SC_FPREGS_SAVED 6 /* even fp regs f20,f22,f24,f26,f28,f30 */ |
| #endif |
| |
| #define SC_FPREGS_OFFSET (SC_REGS_OFFSET + SC_REGS_BYTES) /* SC_FPREGS_BYTES */ |
| #define SC_FPREGS_BYTES (SC_FPREGS_SAVED*REGSZ_FP) |
| #define SC_FPREGS SC_FPREGS_OFFSET |
| |
| #define SC_TOTAL_BYTES (SC_FPREGS_OFFSET + SC_FPREGS_BYTES) |
| #define SC_TOTAL_LONGS (SC_TOTAL_BYTES/REGSZ) |
| |
| #if SC_TOTAL_LONGS > _JBLEN |
| #error _JBLEN is too small |
| #endif |
| |
| #define USE_CHECKSUM 1 |
| |
| .macro m_mangle_reg_and_store reg, cookie, temp, offset |
| xor \temp, \reg, \cookie |
| REG_S \temp, \offset |
| .endm |
| |
| .macro m_unmangle_reg_and_load reg, cookie, temp, offset |
| REG_L \temp, \offset |
| xor \reg, \temp, \cookie |
| .endm |
| |
| .macro m_calculate_checksum dst, src, scratch |
| REG_L \dst, REGSZ(\src) |
| #ifdef __LP64__ |
| /* 64 bit: checksum offset is 4 (actual _JBLEN is 25) */ |
| .irp i,2,3,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24 |
| #else |
| /* 32 bit: checksum offset is 8 (actual _JBLEN is 34) */ |
| .irp i,2,3,4,5,6,7,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33 |
| #endif |
| REG_L \scratch, \i*REGSZ(\src) |
| xor \dst, \dst, \scratch |
| .endr |
| .endm |
| |
| /* |
| * |
| * GPOFF and FRAMESIZE must be the same for all setjmp/longjmp routines |
| * |
| */ |
| |
| FRAMESZ= MKFSIZ(2,6) |
| A1OFF= FRAMESZ-4*REGSZ |
| A0OFF= FRAMESZ-3*REGSZ |
| GPOFF= FRAMESZ-2*REGSZ |
| RAOFF= FRAMESZ-1*REGSZ |
| |
| NON_LEAF(sigsetjmp, FRAMESZ, ra) |
| .mask 0x80000000, RAOFF |
| PTR_SUBU sp, FRAMESZ # allocate stack frame |
| SETUP_GP64(GPOFF, sigsetjmp) |
| SAVE_GP(GPOFF) |
| .set reorder |
| |
| setjmp_common: |
| #ifndef __LP64__ |
| li t0, ~7 |
| and a0, t0 # round jmpbuf addr DOWN to 8-byte boundary |
| #endif |
| REG_S ra, RAOFF(sp) # spill state |
| REG_S a0, A0OFF(sp) |
| |
| # get the cookie and store it along with the signal flag. |
| move a0, a1 |
| jal __bionic_setjmp_cookie_get |
| REG_L a0, A0OFF(sp) |
| |
| REG_S v0, SC_FLAG_OFFSET(a0) # save cookie and savesigs flag |
| andi t0, v0, 1 # extract savesigs flag |
| |
| beqz t0, 1f # do saving of signal mask? |
| |
| # call sigprocmask(int how ignored, sigset_t* null, sigset_t* SC_MASK(a0)): |
| LA a2, SC_MASK_OFFSET(a0) # gets current signal mask |
| li a0, 0 # how; ignored when new mask is null |
| li a1, 0 # null new mask |
| jal sigprocmask # get current signal mask |
| REG_L a0, A0OFF(sp) |
| 1: |
| REG_L gp, GPOFF(sp) # restore spills |
| REG_L ra, RAOFF(sp) |
| REG_L t0, SC_FLAG_OFFSET(a0) # move cookie to temp reg |
| |
| # callee-saved long-sized regs: |
| PTR_ADDU v1, sp, FRAMESZ # save orig sp |
| |
| # m_mangle_reg_and_store reg, cookie, temp, offset |
| m_mangle_reg_and_store ra, t0, t1, SC_REGS+0*REGSZ(a0) |
| m_mangle_reg_and_store s0, t0, t2, SC_REGS+1*REGSZ(a0) |
| m_mangle_reg_and_store s1, t0, t3, SC_REGS+2*REGSZ(a0) |
| m_mangle_reg_and_store s2, t0, t1, SC_REGS+3*REGSZ(a0) |
| m_mangle_reg_and_store s3, t0, t2, SC_REGS+4*REGSZ(a0) |
| m_mangle_reg_and_store s4, t0, t3, SC_REGS+5*REGSZ(a0) |
| m_mangle_reg_and_store s5, t0, t1, SC_REGS+6*REGSZ(a0) |
| m_mangle_reg_and_store s6, t0, t2, SC_REGS+7*REGSZ(a0) |
| m_mangle_reg_and_store s7, t0, t3, SC_REGS+8*REGSZ(a0) |
| m_mangle_reg_and_store s8, t0, t1, SC_REGS+9*REGSZ(a0) |
| m_mangle_reg_and_store gp, t0, t2, SC_REGS+10*REGSZ(a0) |
| m_mangle_reg_and_store v1, t0, t3, SC_REGS+11*REGSZ(a0) |
| |
| cfc1 v0, $31 |
| |
| #ifdef __LP64__ |
| # callee-saved fp regs on mips n64 ABI are $f24..$f31 |
| s.d $f24, SC_FPREGS+0*REGSZ_FP(a0) |
| s.d $f25, SC_FPREGS+1*REGSZ_FP(a0) |
| s.d $f26, SC_FPREGS+2*REGSZ_FP(a0) |
| s.d $f27, SC_FPREGS+3*REGSZ_FP(a0) |
| s.d $f28, SC_FPREGS+4*REGSZ_FP(a0) |
| s.d $f29, SC_FPREGS+5*REGSZ_FP(a0) |
| s.d $f30, SC_FPREGS+6*REGSZ_FP(a0) |
| s.d $f31, SC_FPREGS+7*REGSZ_FP(a0) |
| #else |
| # callee-saved fp regs on mips o32 ABI are |
| # the even-numbered double fp regs $f20,$f22,...$f30 |
| s.d $f20, SC_FPREGS+0*REGSZ_FP(a0) |
| s.d $f22, SC_FPREGS+1*REGSZ_FP(a0) |
| s.d $f24, SC_FPREGS+2*REGSZ_FP(a0) |
| s.d $f26, SC_FPREGS+3*REGSZ_FP(a0) |
| s.d $f28, SC_FPREGS+4*REGSZ_FP(a0) |
| s.d $f30, SC_FPREGS+5*REGSZ_FP(a0) |
| #endif |
| sw v0, SC_FPSR_OFFSET(a0) |
| #if USE_CHECKSUM |
| m_calculate_checksum t0, a0, t1 |
| REG_S t0, SC_CKSUM_OFFSET(a0) |
| #endif |
| move v0, zero |
| RESTORE_GP64 |
| PTR_ADDU sp, FRAMESZ |
| j ra |
| END(sigsetjmp) |
| |
| |
| # Alternate entry points: |
| |
| NON_LEAF(setjmp, FRAMESZ, ra) |
| .mask 0x80000000, RAOFF |
| PTR_SUBU sp, FRAMESZ |
| SETUP_GP64(GPOFF, setjmp) # can't share sigsetjmp's gp code |
| SAVE_GP(GPOFF) |
| .set reorder |
| |
| li a1, 1 # save/restore signals state |
| b setjmp_common # tail call |
| END(setjmp) |
| |
| |
| NON_LEAF(_setjmp, FRAMESZ, ra) |
| .mask 0x80000000, RAOFF |
| PTR_SUBU sp, FRAMESZ |
| SETUP_GP64(GPOFF, _setjmp) # can't share sigsetjmp's gp code |
| SAVE_GP(GPOFF) |
| .set reorder |
| |
| li a1, 0 # don't save/restore signals |
| b setjmp_common # tail call |
| END(_setjmp) |
| |
| |
| NON_LEAF(siglongjmp, FRAMESZ, ra) |
| .mask 0x80000000, RAOFF |
| PTR_SUBU sp, FRAMESZ |
| SETUP_GP64(GPOFF, siglongjmp) |
| SAVE_GP(GPOFF) |
| .set reorder |
| |
| #ifndef __LP64__ |
| li t0, ~7 |
| and a0, t0 # round jmpbuf addr DOWN to 8-byte boundary |
| #endif |
| |
| move s1, a1 # temp spill |
| move s0, a0 |
| |
| #if USE_CHECKSUM |
| m_calculate_checksum t0, s0, s2 |
| REG_L s2, SC_CKSUM_OFFSET(s0) |
| beq t0, s2, 0f |
| nop |
| jal __bionic_setjmp_checksum_mismatch |
| nop |
| 0: |
| #endif |
| |
| # extract savesigs flag |
| REG_L s2, SC_FLAG_OFFSET(s0) |
| andi t0, s2, 1 |
| beqz t0, 1f # restore signal mask? |
| |
| # call sigprocmask(int how SIG_SETMASK, sigset_t* SC_MASK(a0), sigset_t* null): |
| LA a1, SC_MASK_OFFSET(s0) # signals being restored |
| li a0, 3 # mips SIG_SETMASK |
| li a2, 0 # null |
| jal sigprocmask # restore signal mask |
| 1: |
| move t0, s2 # get cookie to temp reg |
| move a1, s1 |
| move a0, s0 |
| |
| # callee-saved long-sized regs: |
| |
| # m_unmangle_reg_and_load reg, cookie, temp, offset |
| # don't restore gp yet, old value is needed for cookie_check call |
| m_unmangle_reg_and_load ra, t0, t1, SC_REGS+0*REGSZ(a0) |
| m_unmangle_reg_and_load s0, t0, t2, SC_REGS+1*REGSZ(a0) |
| m_unmangle_reg_and_load s1, t0, t3, SC_REGS+2*REGSZ(a0) |
| m_unmangle_reg_and_load s2, t0, t1, SC_REGS+3*REGSZ(a0) |
| m_unmangle_reg_and_load s3, t0, t2, SC_REGS+4*REGSZ(a0) |
| m_unmangle_reg_and_load s4, t0, t3, SC_REGS+5*REGSZ(a0) |
| m_unmangle_reg_and_load s5, t0, t1, SC_REGS+6*REGSZ(a0) |
| m_unmangle_reg_and_load s6, t0, t2, SC_REGS+7*REGSZ(a0) |
| m_unmangle_reg_and_load s7, t0, t3, SC_REGS+8*REGSZ(a0) |
| m_unmangle_reg_and_load s8, t0, t1, SC_REGS+9*REGSZ(a0) |
| m_unmangle_reg_and_load v1, t0, t2, SC_REGS+10*REGSZ(a0) |
| m_unmangle_reg_and_load sp, t0, t3, SC_REGS+11*REGSZ(a0) |
| |
| lw v0, SC_FPSR_OFFSET(a0) |
| ctc1 v0, $31 # restore old fr mode before fp values |
| #ifdef __LP64__ |
| # callee-saved fp regs on mips n64 ABI are $f24..$f31 |
| l.d $f24, SC_FPREGS+0*REGSZ_FP(a0) |
| l.d $f25, SC_FPREGS+1*REGSZ_FP(a0) |
| l.d $f26, SC_FPREGS+2*REGSZ_FP(a0) |
| l.d $f27, SC_FPREGS+3*REGSZ_FP(a0) |
| l.d $f28, SC_FPREGS+4*REGSZ_FP(a0) |
| l.d $f29, SC_FPREGS+5*REGSZ_FP(a0) |
| l.d $f30, SC_FPREGS+6*REGSZ_FP(a0) |
| l.d $f31, SC_FPREGS+7*REGSZ_FP(a0) |
| #else |
| # callee-saved fp regs on mips o32 ABI are |
| # the even-numbered double fp regs $f20,$f22,...$f30 |
| l.d $f20, SC_FPREGS+0*REGSZ_FP(a0) |
| l.d $f22, SC_FPREGS+1*REGSZ_FP(a0) |
| l.d $f24, SC_FPREGS+2*REGSZ_FP(a0) |
| l.d $f26, SC_FPREGS+3*REGSZ_FP(a0) |
| l.d $f28, SC_FPREGS+4*REGSZ_FP(a0) |
| l.d $f30, SC_FPREGS+5*REGSZ_FP(a0) |
| #endif |
| |
| # check cookie |
| PTR_SUBU sp, FRAMESZ |
| REG_S v1, GPOFF(sp) |
| REG_S ra, RAOFF(sp) |
| REG_S a1, A1OFF(sp) |
| move a0, t0 |
| jal __bionic_setjmp_cookie_check |
| REG_L gp, GPOFF(sp) |
| REG_L ra, RAOFF(sp) |
| REG_L a1, A1OFF(sp) |
| PTR_ADDU sp, FRAMESZ |
| |
| sltiu t0, a1, 1 # never return 0! |
| xor v0, a1, t0 |
| j ra # return to setjmp call site |
| END(siglongjmp) |
| |
| ALIAS_SYMBOL(longjmp, siglongjmp) |
| ALIAS_SYMBOL(_longjmp, siglongjmp) |
