pcb.h revision 1.11 1 /* $NetBSD: pcb.h,v 1.11 2003/11/25 05:14:58 cdi 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. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
27 *
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * SUCH DAMAGE.
39 *
40 * @(#)pcb.h 8.1 (Berkeley) 6/11/93
41 */
42
43 /*
44 * Copyright (c) 1996-2002 Eduardo Horvath. All rights reserved.
45 *
46 * This software was developed by the Computer Systems Engineering group
47 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
48 * contributed to Berkeley.
49 *
50 * All advertising materials mentioning features or use of this software
51 * must display the following acknowledgement:
52 * This product includes software developed by the University of
53 * California, Lawrence Berkeley Laboratory.
54 *
55 * Redistribution and use in source and binary forms, with or without
56 * modification, are permitted provided that the following conditions
57 * are met:
58 * 1. Redistributions of source code must retain the above copyright
59 * notice, this list of conditions and the following disclaimer.
60 * 2. Redistributions in binary form must reproduce the above copyright
61 * notice, this list of conditions and the following disclaimer in the
62 * documentation and/or other materials provided with the distribution.
63 * 3. All advertising materials mentioning features or use of this software
64 * must display the following acknowledgement:
65 * This product includes software developed by the University of
66 * California, Berkeley and its contributors.
67 * 4. Neither the name of the University nor the names of its contributors
68 * may be used to endorse or promote products derived from this software
69 * without specific prior written permission.
70 *
71 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
72 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
73 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
74 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
75 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
76 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
77 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
78 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
79 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
80 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
81 * SUCH DAMAGE.
82 *
83 * @(#)pcb.h 8.1 (Berkeley) 6/11/93
84 */
85
86 #include <machine/reg.h>
87
88 #ifdef notyet
89 #define PCB_MAXWIN 32 /* architectural limit */
90 #else
91 #define PCB_MAXWIN 8 /* worried about u area sizes ... */
92 #endif
93
94 /*
95 * SPARC Process Control Block.
96 *
97 * pcb_uw is positive if there are any user windows that are
98 * are currently in the CPU windows rather than on the user
99 * stack. Whenever we are running in the kernel with traps
100 * enabled, we decrement pcb_uw for each ``push'' of a CPU
101 * register window into the stack, and we increment it for
102 * each ``pull'' from the stack into the CPU. (If traps are
103 * disabled, or if we are in user mode, pcb_uw is junk.)
104 *
105 * To ease computing pcb_uw on traps from user mode, we keep track
106 * of the log base 2 of the single bit that is set in %wim.
107 *
108 * If an overflow occurs while the associated user stack pages
109 * are invalid (paged out), we have to store the registers
110 * in a page that is locked in core while the process runs,
111 * i.e., right here in the pcb. We also need the stack pointer
112 * for the last such window (but only the last, as the others
113 * are in each window) and the count of windows saved. We
114 * cheat by having a whole window structure for that one %sp.
115 * Thus, to save window pcb_rw[i] to memory, we write it at
116 * pcb_rw[i + 1].rw_in[6].
117 *
118 * pcb_nsaved has three `kinds' of values. If 0, it means no
119 * registers are in the PCB (though if pcb_uw is positive,
120 * there may be the next time you look). If positive, it means
121 * there are no user registers in the CPU, but there are some
122 * saved in pcb_rw[]. As a special case, traps that needed
123 * assistance to pull user registers from the stack also store
124 * the registers in pcb_rw[], and set pcb_nsaved to -1. This
125 * special state is normally short-term: it can only last until the
126 * trap returns, and it can never persist across entry to user code.
127 */
128 /*
129 * v9 addendum:
130 *
131 * Window handling between v8 and v9 has changed somewhat. There
132 * is no %wim. Instead, we have a %cwp, %cansave, %canrestore,
133 * %cleanwin, and %otherwin. By definition:
134 *
135 * %cansave + %canrestore + %otherwin = NWINDOWS - 2
136 *
137 * In addition, %cleanwin >= %canrestore since restorable windows
138 * are considered clean. This means that by storing %canrestore
139 * and %otherwin, we should be able to compute the values of all
140 * the other registers.
141 *
142 * The only other register we need to save is %cwp because it cannot
143 * be trivially computed from the other registers. The %cwp is
144 * stored in the %tstate register, but if the machine was in a register
145 * window spill/fill handler, the value of that %cwp may be off by
146 * as much as 2 register windows. We will also store %cwp. [We will
147 * try to steal pcb_uw or pcb_nsaved for this purpose eventually.]
148 *
149 * To calculate what registers are in the pcb, start with pcb_cwp
150 * and proceed to (pcb_cwp - pcb_canrestore) % NWINDOWS. These should
151 * be saved to their appropriate register windows. The client routine
152 * (trap handler) is responsible for saving pcb_cwp + 1 [%o1-%o7] in
153 * the trap frame or on the stack.
154 *
155 *
156 * Even more addendum:
157 *
158 * With the new system for keeping track of register windows we don't
159 * care about anything other than pcb_uw which keeps track of how many
160 * full windows we have. As soon as a flush traps, we dump all user
161 * windows to the pcb, handle the fault, then restore all user windows.
162 *
163 * XXX we are using pcb_nsaved as the counter. pcb_uw is still a mask.
164 * change this as soon as the new scheme is debugged.
165 */
166 struct pcb {
167 u_int64_t pcb_sp; /* sp (%o6) when switch() was called */
168 u_int64_t pcb_pc; /* pc (%o7) when switch() was called */
169 caddr_t pcb_onfault; /* for copyin/out */
170 short pcb_pstate; /* %pstate when switch() was called -- may be useful if we support multiple memory models */
171 char pcb_nsaved; /* number of windows saved in pcb */
172
173 /* The rest is probably not needed except for pcb_rw */
174 char pcb_cwp; /* %cwp when switch() was called */
175 char pcb_pil; /* %pil when switch() was called -- prolly not needed */
176
177 const char *lastcall; /* DEBUG -- name of last system call */
178 /* the following MUST be aligned on a 64-bit boundary */
179 struct rwindow64 pcb_rw[PCB_MAXWIN]; /* saved windows */
180 };
181
182 /*
183 * The pcb is augmented with machine-dependent additional data for
184 * core dumps. Note that the trapframe here is a copy of the one
185 * from the top of the kernel stack (included here so that the kernel
186 * stack itself need not be dumped).
187 */
188 struct md_coredump32 {
189 struct trapframe32 md_tf;
190 struct fpstate32 md_fpstate;
191 };
192
193 struct md_coredump {
194 struct trapframe64 md_tf;
195 struct fpstate64 md_fpstate;
196 };
197
198 #ifndef _KERNEL
199 /* Let gdb compile. We need fancier macros to make these make sense. */
200 #define pcb_psr pcb_pstate
201 #define pcb_wim pcb_cwp
202 #endif /* _KERNEL */
203