1 /* $NetBSD: cpu.h,v 1.32 1999/01/19 10:02:40 pk 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 * @(#)cpu.h 8.4 (Berkeley) 1/5/94 45 */ 46 47 #ifndef _CPU_H_ 48 #define _CPU_H_ 49 50 /* 51 * CTL_MACHDEP definitions. 52 */ 53 #define CPU_MAXID 1 /* no valid machdep ids */ 54 55 #define CTL_MACHDEP_NAMES { \ 56 { 0, 0 }, \ 57 } 58 59 #ifdef _KERNEL 60 /* 61 * Exported definitions unique to SPARC cpu support. 62 */ 63 64 #include <machine/psl.h> 65 #include <sparc/sparc/intreg.h> 66 67 /* 68 * definitions of cpu-dependent requirements 69 * referenced in generic code 70 */ 71 #define cpu_swapin(p) /* nothing */ 72 #define cpu_swapout(p) /* nothing */ 73 #define cpu_wait(p) /* nothing */ 74 75 /* 76 * Arguments to hardclock, softclock and gatherstats encapsulate the 77 * previous machine state in an opaque clockframe. The ipl is here 78 * as well for strayintr (see locore.s:interrupt and intr.c:strayintr). 79 * Note that CLKF_INTR is valid only if CLKF_USERMODE is false. 80 */ 81 struct clockframe { 82 u_int psr; /* psr before interrupt, excluding PSR_ET */ 83 u_int pc; /* pc at interrupt */ 84 u_int npc; /* npc at interrupt */ 85 u_int ipl; /* actual interrupt priority level */ 86 u_int fp; /* %fp at interrupt */ 87 }; 88 typedef struct clockframe clockframe; 89 90 extern int eintstack[]; 91 92 #define CLKF_USERMODE(framep) (((framep)->psr & PSR_PS) == 0) 93 #define CLKF_BASEPRI(framep) (((framep)->psr & PSR_PIL) == 0) 94 #define CLKF_PC(framep) ((framep)->pc) 95 #if defined(MULTIPROCESSOR) 96 #define CLKF_INTR(framep) \ 97 ((framep)->fp > (u_int)cpuinfo.eintstack - INT_STACK_SIZE && \ 98 (framep)->fp < (u_int)cpuinfo.eintstack) 99 #else 100 #define CLKF_INTR(framep) ((framep)->fp < (u_int)eintstack) 101 #endif 102 103 /* 104 * Software interrupt request `register'. 105 */ 106 extern union sir { 107 int sir_any; 108 char sir_which[4]; 109 } sir; 110 111 #define SIR_NET 0 112 #define SIR_CLOCK 1 113 #define SIR_SERIAL 2 114 115 #if defined(SUN4M) 116 extern void raise __P((int, int)); 117 #if !(defined(SUN4) || defined(SUN4C)) 118 #define setsoftint() raise(0,1) 119 #else /* both defined */ 120 #define setsoftint() (cputyp == CPU_SUN4M ? raise(0,1) : ienab_bis(IE_L1)) 121 #endif /* !4,!4c */ 122 #else /* 4m not defined */ 123 #define setsoftint() ienab_bis(IE_L1) 124 #endif /* SUN4M */ 125 126 #define setsoftnet() (sir.sir_which[SIR_NET] = 1, setsoftint()) 127 #define setsoftclock() (sir.sir_which[SIR_CLOCK] = 1, setsoftint()) 128 #define setsoftserial() (sir.sir_which[SIR_SERIAL] = 1, setsoftint()) 129 130 extern int want_ast; 131 132 /* 133 * Preempt the current process if in interrupt from user mode, 134 * or after the current trap/syscall if in system mode. 135 */ 136 extern int want_resched; /* resched() was called */ 137 #define need_resched() (want_resched = 1, want_ast = 1) 138 139 /* 140 * Give a profiling tick to the current process when the user profiling 141 * buffer pages are invalid. On the sparc, request an ast to send us 142 * through trap(), marking the proc as needing a profiling tick. 143 */ 144 #define need_proftick(p) ((p)->p_flag |= P_OWEUPC, want_ast = 1) 145 146 /* 147 * Notify the current process (p) that it has a signal pending, 148 * process as soon as possible. 149 */ 150 #define signotify(p) (want_ast = 1) 151 152 /* Number of CPUs in the system */ 153 extern int ncpu; 154 155 /* 156 * Only one process may own the FPU state. 157 * 158 * XXX this must be per-cpu (eventually) 159 */ 160 extern struct proc *fpproc; /* FPU owner */ 161 extern int foundfpu; /* true => we have an FPU */ 162 163 /* 164 * Interrupt handler chains. Interrupt handlers should return 0 for 165 * ``not me'' or 1 (``I took care of it''). intr_establish() inserts a 166 * handler into the list. The handler is called with its (single) 167 * argument, or with a pointer to a clockframe if ih_arg is NULL. 168 */ 169 extern struct intrhand { 170 int (*ih_fun) __P((void *)); 171 void *ih_arg; 172 struct intrhand *ih_next; 173 } *intrhand[15]; 174 175 void intr_establish __P((int level, struct intrhand *)); 176 177 /* 178 * intr_fasttrap() is a lot like intr_establish, but is used for ``fast'' 179 * interrupt vectors (vectors that are not shared and are handled in the 180 * trap window). Such functions must be written in assembly. 181 */ 182 void intr_fasttrap __P((int level, void (*vec)(void))); 183 184 /* disksubr.c */ 185 struct dkbad; 186 int isbad __P((struct dkbad *bt, int, int, int)); 187 /* machdep.c */ 188 int ldcontrolb __P((caddr_t)); 189 void dumpconf __P((void)); 190 caddr_t reserve_dumppages __P((caddr_t)); 191 /* clock.c */ 192 struct timeval; 193 void lo_microtime __P((struct timeval *)); 194 int statintr __P((void *)); 195 int clockintr __P((void *));/* level 10 (clock) interrupt code */ 196 int statintr __P((void *)); /* level 14 (statclock) interrupt code */ 197 /* locore.s */ 198 struct fpstate; 199 void savefpstate __P((struct fpstate *)); 200 void loadfpstate __P((struct fpstate *)); 201 int probeget __P((caddr_t, int)); 202 void write_all_windows __P((void)); 203 void write_user_windows __P((void)); 204 void proc_trampoline __P((void)); 205 struct pcb; 206 void snapshot __P((struct pcb *)); 207 struct frame *getfp __P((void)); 208 int xldcontrolb __P((caddr_t, struct pcb *)); 209 void copywords __P((const void *, void *, size_t)); 210 void qcopy __P((const void *, void *, size_t)); 211 void qzero __P((void *, size_t)); 212 /* locore2.c */ 213 void remrunqueue __P((struct proc *)); 214 /* trap.c */ 215 void kill_user_windows __P((struct proc *)); 216 int rwindow_save __P((struct proc *)); 217 void child_return __P((void *)); 218 /* amd7930intr.s */ 219 void amd7930_trap __P((void)); 220 /* cons.c */ 221 int cnrom __P((void)); 222 /* zs.c */ 223 void zsconsole __P((struct tty *, int, int, void (**)(struct tty *, int))); 224 #ifdef KGDB 225 void zs_kgdb_init __P((void)); 226 #endif 227 /* fb.c */ 228 void fb_unblank __P((void)); 229 /* cache.c */ 230 void cache_flush __P((caddr_t, u_int)); 231 /* kgdb_stub.c */ 232 #ifdef KGDB 233 void kgdb_attach __P((int (*)(void *), void (*)(void *, int), void *)); 234 void kgdb_connect __P((int)); 235 void kgdb_panic __P((void)); 236 #endif 237 /* emul.c */ 238 struct trapframe; 239 int fixalign __P((struct proc *, struct trapframe *)); 240 int emulinstr __P((int, struct trapframe *)); 241 /* cpu.c */ 242 void mp_pause_cpus __P((void)); 243 void mp_resume_cpus __P((void)); 244 void mp_halt_cpus __P((void)); 245 246 /* 247 * 248 * The SPARC has a Trap Base Register (TBR) which holds the upper 20 bits 249 * of the trap vector table. The next eight bits are supplied by the 250 * hardware when the trap occurs, and the bottom four bits are always 251 * zero (so that we can shove up to 16 bytes of executable code---exactly 252 * four instructions---into each trap vector). 253 * 254 * The hardware allocates half the trap vectors to hardware and half to 255 * software. 256 * 257 * Traps have priorities assigned (lower number => higher priority). 258 */ 259 260 struct trapvec { 261 int tv_instr[4]; /* the four instructions */ 262 }; 263 extern struct trapvec *trapbase; /* the 256 vectors */ 264 265 extern void wzero __P((void *, u_int)); 266 extern void wcopy __P((const void *, void *, u_int)); 267 268 #endif /* _KERNEL */ 269 #endif /* _CPU_H_ */ 270