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