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