reg.h revision 1.9
1 /* $NetBSD: reg.h,v 1.9 2002/05/14 02:34:15 eeh Exp $ */ 2 3 /* 4 * Copyright (c) 1996-2002 Eduardo Horvath. 5 * Copyright (c) 1992, 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * This software was developed by the Computer Systems Engineering group 9 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and 10 * contributed to Berkeley. 11 * 12 * All advertising materials mentioning features or use of this software 13 * must display the following acknowledgement: 14 * This product includes software developed by the University of 15 * California, Lawrence Berkeley Laboratory. 16 * 17 * Redistribution and use in source and binary forms, with or without 18 * modification, are permitted provided that the following conditions 19 * are met: 20 * 1. Redistributions of source code must retain the above copyright 21 * notice, this list of conditions and the following disclaimer. 22 * 2. Redistributions in binary form must reproduce the above copyright 23 * notice, this list of conditions and the following disclaimer in the 24 * documentation and/or other materials provided with the distribution. 25 * 3. All advertising materials mentioning features or use of this software 26 * must display the following acknowledgement: 27 * This product includes software developed by the University of 28 * California, Berkeley and its contributors. 29 * 4. Neither the name of the University nor the names of its contributors 30 * may be used to endorse or promote products derived from this software 31 * without specific prior written permission. 32 * 33 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 34 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 35 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 36 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 37 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 38 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 39 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 40 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 41 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 42 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 43 * SUCH DAMAGE. 44 * 45 * @(#)reg.h 8.1 (Berkeley) 6/11/93 46 */ 47 48 #ifndef _MACHINE_REG_H_ 49 #define _MACHINE_REG_H_ 50 51 /* 52 * Registers passed to trap/syscall/etc. 53 * This structure is known to occupy exactly 80 bytes (see locore.s). 54 * Note, tf_global[0] is not actually written (since g0 is always 0). 55 * (The slot tf_global[0] is used to send a copy of %wim to kernel gdb. 56 * This is known as `cheating'.) 57 */ 58 struct trapframe32 { 59 int tf_psr; /* psr */ 60 int tf_pc; /* return pc */ 61 int tf_npc; /* return npc */ 62 int tf_y; /* %y register */ 63 int tf_global[8]; /* global registers in trap's caller */ 64 int tf_out[8]; /* output registers in trap's caller */ 65 }; 66 67 /* 68 * The v9 trapframe is a bit more complex. Since we don't get a free 69 * register window with each trap we need some way to keep track of 70 * pending traps. 71 * (The slot tf_global[0] is used to store the %fp when this is used 72 * as a clockframe. This is known as `cheating'.) 73 */ 74 /* The 1.5 version had lots of extra goodies in it. */ 75 struct trapframe64_15 { 76 int64_t tf_tstate; /* tstate register */ 77 int64_t tf_pc; /* return pc */ 78 int64_t tf_npc; /* return npc */ 79 int64_t tf_fault; /* faulting addr -- need somewhere to save it */ 80 int64_t tf_kstack; /* kernel stack of prev tf */ 81 int tf_y; /* %y register -- 32-bits */ 82 short tf_tt; /* What type of trap this was */ 83 char tf_pil; /* What IRQ we're handling */ 84 char tf_oldpil; /* What our old SPL was */ 85 int64_t tf_global[8]; /* global registers in trap's caller */ 86 /* n.b. tf_global[0] is used for fp when this is a clockframe */ 87 int64_t tf_out[8]; /* output registers in trap's caller */ 88 int64_t tf_local[8]; /* local registers in trap's caller (for debug) */ 89 int64_t tf_in[8]; /* in registers in trap's caller (for debug) */ 90 }; 91 92 /* 93 * The following version does not have the locals or outs so is almost 94 * half the size of the 1.5 trapframe (160 bytes vs 304 bytes). 95 */ 96 struct trapframe64 { 97 int64_t tf_tstate; /* tstate register */ 98 int64_t tf_pc; /* return pc */ 99 int64_t tf_npc; /* return npc */ 100 /* XXX -- next two fields are unused and should be removed. */ 101 int64_t tf_fault; /* faulting addr -- need somewhere to save it */ 102 int64_t tf_kstack; /* kernel stack of prev tf */ 103 int tf_y; /* %y register -- 32-bits */ 104 short tf_tt; /* What type of trap this was */ 105 char tf_pil; /* What IRQ we're handling */ 106 char tf_oldpil; /* What our old SPL was */ 107 int64_t tf_global[8]; /* global registers in trap's caller */ 108 /* n.b. tf_global[0] is used for fp when this is a clockframe */ 109 int64_t tf_out[8]; /* output registers in trap's caller */ 110 #ifdef DEBUG 111 int64_t tf_local[8]; /* local registers in trap's caller (for debug) */ 112 int64_t tf_in[8]; /* in registers in trap's caller (for debug) */ 113 #endif 114 }; 115 116 /* 117 * Register windows. Each stack pointer (%o6 aka %sp) in each window 118 * must ALWAYS point to some place at which it is safe to scribble on 119 * 64 bytes. (If not, your process gets mangled.) Furthermore, each 120 * stack pointer should be aligned on an 8-byte boundary for v8 stacks 121 * or a 16-byte boundary (plus the BIAS) for v9 stacks (the kernel 122 * as currently coded allows arbitrary alignment, but with a hefty 123 * performance penalty). 124 */ 125 struct rwindow32 { 126 int rw_local[8]; /* %l0..%l7 */ 127 int rw_in[8]; /* %i0..%i7 */ 128 }; 129 130 /* Don't forget the BIAS!! */ 131 struct rwindow64 { 132 int64_t rw_local[8]; /* %l0..%l7 */ 133 int64_t rw_in[8]; /* %i0..%i7 */ 134 }; 135 136 /* 137 * Clone trapframe for now; this seems to be the more useful 138 * than the old struct reg above. 139 */ 140 struct reg32 { 141 int r_psr; /* psr */ 142 int r_pc; /* return pc */ 143 int r_npc; /* return npc */ 144 int r_y; /* %y register */ 145 int r_global[8]; /* global registers in trap's caller */ 146 int r_out[8]; /* output registers in trap's caller */ 147 }; 148 149 struct reg64 { 150 int64_t r_tstate; /* tstate register */ 151 int64_t r_pc; /* return pc */ 152 int64_t r_npc; /* return npc */ 153 int r_y; /* %y register -- 32-bits */ 154 int64_t r_global[8]; /* global registers in trap's caller */ 155 int64_t r_out[8]; /* output registers in trap's caller */ 156 }; 157 158 #include <machine/fsr.h> 159 160 /* 161 * FP coprocessor registers. 162 * 163 * FP_QSIZE is the maximum coprocessor instruction queue depth 164 * of any implementation on which the kernel will run. David Hough: 165 * ``I'd suggest allowing 16 ... allowing an indeterminate variable 166 * size would be even better''. Of course, we cannot do that; we 167 * need to malloc these. 168 * 169 * XXXX UltraSPARC processors don't implement a floating point queue. 170 */ 171 #define FP_QSIZE 16 172 #define ALIGNFPSTATE(f) ((struct fpstate64 *)(((long)(f))&(~BLOCK_ALIGN))) 173 174 struct fp_qentry { 175 int *fq_addr; /* the instruction's address */ 176 int fq_instr; /* the instruction itself */ 177 }; 178 179 struct fpstate64 { 180 u_int fs_regs[64]; /* our view is 64 32-bit registers */ 181 int64_t fs_fsr; /* %fsr */ 182 int fs_gsr; /* graphics state reg */ 183 int fs_qsize; /* actual queue depth */ 184 struct fp_qentry fs_queue[FP_QSIZE]; /* queue contents */ 185 }; 186 187 /* 188 * For 32-bit emulations. 189 */ 190 struct fpstate32 { 191 u_int fs_regs[32]; /* our view is 32 32-bit registers */ 192 int fs_fsr; /* %fsr */ 193 int fs_qsize; /* actual queue depth */ 194 struct fp_qentry fs_queue[FP_QSIZE]; /* queue contents */ 195 }; 196 197 /* 198 * The actual FP registers are made accessible (c.f. ptrace(2)) through 199 * a `struct fpreg'; <arch/sparc64/sparc64/process_machdep.c> relies on the 200 * fact that `fpreg' is a prefix of `fpstate'. 201 */ 202 struct fpreg64 { 203 u_int fr_regs[64]; /* our view is 64 32-bit registers */ 204 int64_t fr_fsr; /* %fsr */ 205 int fr_gsr; /* graphics state reg */ 206 }; 207 208 /* 209 * 32-bit fpreg used by 32-bit sparc CPUs 210 */ 211 struct fpreg32 { 212 u_int fr_regs[32]; /* our view is 32 32-bit registers */ 213 int fr_fsr; /* %fsr */ 214 }; 215 216 #if defined(__arch64__) 217 /* Here we gotta do naughty things to let gdb work on 32-bit binaries */ 218 #define reg reg64 219 #define fpreg fpreg64 220 #define fpstate fpstate64 221 #define trapframe trapframe64 222 #define rwindow rwindow64 223 #else 224 #define reg reg32 225 #define fpreg fpreg32 226 #define fpstate fpstate32 227 #define trapframe trapframe32 228 #define rwindow rwindow32 229 #endif 230 231 #endif /* _MACHINE_REG_H_ */ 232
Indexes created Mon Sep 29 21:09:56 GMT 2025