1 /* 2 * Copyright (C) 2014 The Android Open Source Project 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * * Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * * Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in 12 * the documentation and/or other materials provided with the 13 * distribution. 14 * 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 16 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 17 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 18 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 19 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 21 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS 22 * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED 23 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 24 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 25 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26 * SUCH DAMAGE. 27 */ 28 /* 29 * Copyright (c) 2001-2002 Opsycon AB (www.opsycon.se / www.opsycon.com) 30 * 31 * Redistribution and use in source and binary forms, with or without 32 * modification, are permitted provided that the following conditions 33 * are met: 34 * 1. Redistributions of source code must retain the above copyright 35 * notice, this list of conditions and the following disclaimer. 36 * 2. Redistributions in binary form must reproduce the above copyright 37 * notice, this list of conditions and the following disclaimer in the 38 * documentation and/or other materials provided with the distribution. 39 * 3. Neither the name of Opsycon AB nor the names of its contributors 40 * may be used to endorse or promote products derived from this software 41 * without specific prior written permission. 42 * 43 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS 44 * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 45 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 46 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY 47 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 48 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 49 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 50 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 51 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 52 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 53 * SUCH DAMAGE. 54 * 55 */ 56 /*- 57 * Copyright (c) 1991, 1993, 1995, 58 * The Regents of the University of California. All rights reserved. 59 * 60 * This code is derived from software contributed to Berkeley by 61 * Havard Eidnes. 62 * 63 * Redistribution and use in source and binary forms, with or without 64 * modification, are permitted provided that the following conditions 65 * are met: 66 * 1. Redistributions of source code must retain the above copyright 67 * notice, this list of conditions and the following disclaimer. 68 * 2. Redistributions in binary form must reproduce the above copyright 69 * notice, this list of conditions and the following disclaimer in the 70 * documentation and/or other materials provided with the distribution. 71 * 3. Neither the name of the University nor the names of its contributors 72 * may be used to endorse or promote products derived from this software 73 * without specific prior written permission. 74 * 75 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 76 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 77 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 78 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 79 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 80 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 81 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 82 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 83 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 84 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 85 * SUCH DAMAGE. 86 */ 87 /* 88 * Copyright (c) 1992, 1993 89 * The Regents of the University of California. All rights reserved. 90 * 91 * This code is derived from software contributed to Berkeley by 92 * Ralph Campbell. 93 * 94 * Redistribution and use in source and binary forms, with or without 95 * modification, are permitted provided that the following conditions 96 * are met: 97 * 1. Redistributions of source code must retain the above copyright 98 * notice, this list of conditions and the following disclaimer. 99 * 2. Redistributions in binary form must reproduce the above copyright 100 * notice, this list of conditions and the following disclaimer in the 101 * documentation and/or other materials provided with the distribution. 102 * 3. Neither the name of the University nor the names of its contributors 103 * may be used to endorse or promote products derived from this software 104 * without specific prior written permission. 105 * 106 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 107 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 108 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 109 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 110 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 111 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 112 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 113 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 114 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 115 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 116 * SUCH DAMAGE. 117 * 118 * @(#)signal.h 8.1 (Berkeley) 6/10/93 119 */ 120 121 #include <private/bionic_asm.h> 122 #include <machine/setjmp.h> 123 124 /* jmpbuf is declared to users as an array of longs, which is only 125 * 4-byte aligned in 32-bit builds. The Mips jmpbuf begins with a 126 * dynamically-sized 0- or 4-byte unused filler so that double-prec FP regs 127 * are saved to 8-byte-aligned mem cells. 128 * All the following jmpbuf offsets are from the rounded-DOWN base addr. 129 */ 130 131 /* Fields of same size on all MIPS abis: */ 132 /* field: byte offset: size: */ 133 /* dynam filler (0*4) 0-4 bytes of rounddown filler, DON'T TOUCH!! 134 often overlays user storage!! */ 135 #define SC_MAGIC_OFFSET (1*4) /* 4 bytes, identify jmpbuf, first actual field */ 136 #define SC_FLAG_OFFSET (2*4) /* 4 bytes, savesigs flag */ 137 #define SC_FPSR_OFFSET (3*4) /* 4 bytes, floating point control/status reg */ 138 /* following fields are 8-byte aligned */ 139 #define SC_MASK_OFFSET (4*4) /* 16 bytes, mips32/mips64 version of sigset_t */ 140 #define SC_SPARE_OFFSET (8*4) /* 8 bytes, reserved for future uses */ 141 142 /* Registers that are 4-byte on mips32 o32, and 8-byte on mips64 n64 abi */ 143 #define SC_REGS_OFFSET (10*4) /* SC_REGS_BYTES */ 144 #define SC_REGS_SAVED 12 /*regs*/ /* ra,s0-s8,gp,sp */ 145 #define SC_REGS_BYTES (SC_REGS_SAVED*REGSZ) 146 #define SC_REGS SC_REGS_OFFSET 147 148 /* Double floating pt registers are 8-bytes on all abis, 149 * but the number of saved fp regs varies for o32/n32 versus n64 abis: 150 */ 151 152 #ifdef __LP64__ 153 #define SC_FPREGS_SAVED 8 /* all fp regs f24,f25,f26,f27,f28,f29,f30,f31 */ 154 #else 155 #define SC_FPREGS_SAVED 6 /* even fp regs f20,f22,f24,f26,f28,f30 */ 156 #endif 157 158 #define SC_FPREGS_OFFSET (SC_REGS_OFFSET + SC_REGS_BYTES) /* SC_FPREGS_BYTES */ 159 #define SC_FPREGS_BYTES (SC_FPREGS_SAVED*REGSZ_FP) 160 #define SC_FPREGS SC_FPREGS_OFFSET 161 162 #define SC_TOTAL_BYTES (SC_FPREGS_OFFSET + SC_FPREGS_BYTES) 163 #define SC_TOTAL_LONGS (SC_TOTAL_BYTES/REGSZ) 164 165 #if SC_TOTAL_LONGS > _JBLEN 166 #error _JBLEN is too small 167 #endif 168 169 /* 170 * 171 * GPOFF and FRAMESIZE must be the same for all setjmp/longjmp routines 172 * 173 */ 174 175 FRAMESZ= MKFSIZ(2,6) 176 A1OFF= FRAMESZ-4*REGSZ 177 A0OFF= FRAMESZ-3*REGSZ 178 GPOFF= FRAMESZ-2*REGSZ 179 RAOFF= FRAMESZ-1*REGSZ 180 181 NON_LEAF(sigsetjmp, FRAMESZ, ra) 182 .mask 0x80000000, RAOFF 183 PTR_SUBU sp, FRAMESZ # allocate stack frame 184 SETUP_GP64(GPOFF, sigsetjmp) 185 SAVE_GP(GPOFF) 186 .set reorder 187 188 setjmp_common: 189 #ifndef __LP64__ 190 li t0, ~7 191 and a0, t0 # round jmpbuf addr DOWN to 8-byte boundary 192 #endif 193 sw a1, SC_FLAG_OFFSET(a0) # save savesigs flag 194 beqz a1, 1f # do saving of signal mask? 195 196 REG_S ra, RAOFF(sp) # spill state 197 REG_S a0, A0OFF(sp) 198 # call sigprocmask(int how ignored, sigset_t* null, sigset_t* SC_MASK(a0)): 199 LA a2, SC_MASK_OFFSET(a0) # gets current signal mask 200 li a0, 0 # how; ignored when new mask is null 201 li a1, 0 # null new mask 202 jal sigprocmask # get current signal mask 203 REG_L a0, A0OFF(sp) 204 REG_L ra, RAOFF(sp) 205 1: 206 li v0, 0xACEDBADE # sigcontext magic number 207 sw v0, SC_MAGIC_OFFSET(a0) 208 # callee-saved long-sized regs: 209 REG_S ra, SC_REGS+0*REGSZ(a0) 210 REG_S s0, SC_REGS+1*REGSZ(a0) 211 REG_S s1, SC_REGS+2*REGSZ(a0) 212 REG_S s2, SC_REGS+3*REGSZ(a0) 213 REG_S s3, SC_REGS+4*REGSZ(a0) 214 REG_S s4, SC_REGS+5*REGSZ(a0) 215 REG_S s5, SC_REGS+6*REGSZ(a0) 216 REG_S s6, SC_REGS+7*REGSZ(a0) 217 REG_S s7, SC_REGS+8*REGSZ(a0) 218 REG_S s8, SC_REGS+9*REGSZ(a0) 219 REG_L v0, GPOFF(sp) 220 REG_S v0, SC_REGS+10*REGSZ(a0) # save gp 221 PTR_ADDU v0, sp, FRAMESZ 222 REG_S v0, SC_REGS+11*REGSZ(a0) # save orig sp 223 224 cfc1 v0, $31 225 226 #ifdef __LP64__ 227 # callee-saved fp regs on mips n64 ABI are $f24..$f31 228 s.d $f24, SC_FPREGS+0*REGSZ_FP(a0) 229 s.d $f25, SC_FPREGS+1*REGSZ_FP(a0) 230 s.d $f26, SC_FPREGS+2*REGSZ_FP(a0) 231 s.d $f27, SC_FPREGS+3*REGSZ_FP(a0) 232 s.d $f28, SC_FPREGS+4*REGSZ_FP(a0) 233 s.d $f29, SC_FPREGS+5*REGSZ_FP(a0) 234 s.d $f30, SC_FPREGS+6*REGSZ_FP(a0) 235 s.d $f31, SC_FPREGS+7*REGSZ_FP(a0) 236 #else 237 # callee-saved fp regs on mips o32 ABI are 238 # the even-numbered double fp regs $f20,$f22,...$f30 239 s.d $f20, SC_FPREGS+0*REGSZ_FP(a0) 240 s.d $f22, SC_FPREGS+1*REGSZ_FP(a0) 241 s.d $f24, SC_FPREGS+2*REGSZ_FP(a0) 242 s.d $f26, SC_FPREGS+3*REGSZ_FP(a0) 243 s.d $f28, SC_FPREGS+4*REGSZ_FP(a0) 244 s.d $f30, SC_FPREGS+5*REGSZ_FP(a0) 245 #endif 246 sw v0, SC_FPSR_OFFSET(a0) 247 move v0, zero 248 RESTORE_GP64 249 PTR_ADDU sp, FRAMESZ 250 j ra 251 END(sigsetjmp) 252 253 254 # Alternate entry points: 255 256 NON_LEAF(setjmp, FRAMESZ, ra) 257 .mask 0x80000000, RAOFF 258 PTR_SUBU sp, FRAMESZ 259 SETUP_GP64(GPOFF, setjmp) # can't share sigsetjmp's gp code 260 SAVE_GP(GPOFF) 261 .set reorder 262 263 li a1, 1 # save/restore signals state 264 b setjmp_common # tail call 265 END(setjmp) 266 267 268 NON_LEAF(_setjmp, FRAMESZ, ra) 269 .mask 0x80000000, RAOFF 270 PTR_SUBU sp, FRAMESZ 271 SETUP_GP64(GPOFF, _setjmp) # can't share sigsetjmp's gp code 272 SAVE_GP(GPOFF) 273 .set reorder 274 275 li a1, 0 # don't save/restore signals 276 b setjmp_common # tail call 277 END(_setjmp) 278 279 280 NON_LEAF(siglongjmp, FRAMESZ, ra) 281 .mask 0x80000000, RAOFF 282 PTR_SUBU sp, FRAMESZ 283 SETUP_GP64(GPOFF, siglongjmp) 284 SAVE_GP(GPOFF) 285 .set reorder 286 287 #ifndef __LP64__ 288 li t0, ~7 289 and a0, t0 # round jmpbuf addr DOWN to 8-byte boundary 290 #endif 291 lw v0, SC_MAGIC_OFFSET(a0) 292 li t0, 0xACEDBADE 293 bne v0, t0, longjmp_botch # jump if error 294 295 lw t0, SC_FLAG_OFFSET(a0) # get savesigs flag 296 beqz t0, 1f # restore signal mask? 297 298 REG_S a1, A1OFF(sp) # temp spill 299 REG_S a0, A0OFF(sp) 300 # call sigprocmask(int how SIG_SETMASK, sigset_t* SC_MASK(a0), sigset_t* null): 301 LA a1, SC_MASK_OFFSET(a0) # signals being restored 302 li a0, 3 # mips SIG_SETMASK 303 li a2, 0 # null 304 jal sigprocmask # restore signal mask 305 REG_L a0, A0OFF(sp) 306 REG_L a1, A1OFF(sp) 307 1: 308 # callee-saved long-sized regs: 309 REG_L ra, SC_REGS+0*REGSZ(a0) 310 REG_L s0, SC_REGS+1*REGSZ(a0) 311 REG_L s1, SC_REGS+2*REGSZ(a0) 312 REG_L s2, SC_REGS+3*REGSZ(a0) 313 REG_L s3, SC_REGS+4*REGSZ(a0) 314 REG_L s4, SC_REGS+5*REGSZ(a0) 315 REG_L s5, SC_REGS+6*REGSZ(a0) 316 REG_L s6, SC_REGS+7*REGSZ(a0) 317 REG_L s7, SC_REGS+8*REGSZ(a0) 318 REG_L s8, SC_REGS+9*REGSZ(a0) 319 REG_L gp, SC_REGS+10*REGSZ(a0) 320 REG_L sp, SC_REGS+11*REGSZ(a0) 321 322 lw v0, SC_FPSR_OFFSET(a0) 323 ctc1 v0, $31 # restore old fr mode before fp values 324 #ifdef __LP64__ 325 # callee-saved fp regs on mips n64 ABI are $f24..$f31 326 l.d $f24, SC_FPREGS+0*REGSZ_FP(a0) 327 l.d $f25, SC_FPREGS+1*REGSZ_FP(a0) 328 l.d $f26, SC_FPREGS+2*REGSZ_FP(a0) 329 l.d $f27, SC_FPREGS+3*REGSZ_FP(a0) 330 l.d $f28, SC_FPREGS+4*REGSZ_FP(a0) 331 l.d $f29, SC_FPREGS+5*REGSZ_FP(a0) 332 l.d $f30, SC_FPREGS+6*REGSZ_FP(a0) 333 l.d $f31, SC_FPREGS+7*REGSZ_FP(a0) 334 #else 335 # callee-saved fp regs on mips o32 ABI are 336 # the even-numbered double fp regs $f20,$f22,...$f30 337 l.d $f20, SC_FPREGS+0*REGSZ_FP(a0) 338 l.d $f22, SC_FPREGS+1*REGSZ_FP(a0) 339 l.d $f24, SC_FPREGS+2*REGSZ_FP(a0) 340 l.d $f26, SC_FPREGS+3*REGSZ_FP(a0) 341 l.d $f28, SC_FPREGS+4*REGSZ_FP(a0) 342 l.d $f30, SC_FPREGS+5*REGSZ_FP(a0) 343 #endif 344 bne a1, zero, 1f 345 li a1, 1 # never return 0! 346 1: 347 move v0, a1 348 j ra # return to setjmp call site 349 350 longjmp_botch: 351 jal longjmperror 352 jal abort 353 END(siglongjmp) 354 355 ALIAS_SYMBOL(longjmp, siglongjmp) 356 ALIAS_SYMBOL(_longjmp, siglongjmp) 357
