Home | History | Annotate | Line # | Download | only in include
reg.h revision 1.6 
      1 /*	$NetBSD: reg.h,v 1.6 2001/06/19 12:59:15 wiz 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 trapframe {
     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  * Register windows.  Each stack pointer (%o6 aka %sp) in each window
     68  * must ALWAYS point to some place at which it is safe to scribble on
     69  * 64 bytes.  (If not, your process gets mangled.)  Furthermore, each
     70  * stack pointer should be aligned on an 8-byte boundary (the kernel
     71  * as currently coded allows arbitrary alignment, but with a hefty
     72  * performance penalty).
     73  */
     74 struct rwindow {
     75 	int	rw_local[8];		/* %l0..%l7 */
     76 	int	rw_in[8];		/* %i0..%i7 */
     77 };
     78 
     79 /*
     80  * Clone trapframe for now; this seems to be the more useful
     81  * than the old struct reg above.
     82  */
     83 struct reg {
     84 	int	r_psr;		/* psr */
     85 	int	r_pc;		/* return pc */
     86 	int	r_npc;		/* return npc */
     87 	int	r_y;		/* %y register */
     88 	int	r_global[8];	/* global registers in trap's caller */
     89 	int	r_out[8];	/* output registers in trap's caller */
     90 };
     91 
     92 #include <machine/fsr.h>
     93 
     94 /*
     95  * FP coprocessor registers.
     96  *
     97  * FP_QSIZE is the maximum coprocessor instruction queue depth
     98  * of any implementation on which the kernel will run.  David Hough:
     99  * ``I'd suggest allowing 16 ... allowing an indeterminate variable
    100  * size would be even better''.  Of course, we cannot do that; we
    101  * need to malloc these.
    102  */
    103 #define	FP_QSIZE	16
    104 
    105 struct fp_qentry {
    106 	int	*fq_addr;		/* the instruction's address */
    107 	int	fq_instr;		/* the instruction itself */
    108 };
    109 struct fpstate {
    110 	u_int	fs_regs[32];		/* our view is 32 32-bit registers */
    111 	int	fs_fsr;			/* %fsr */
    112 	int	fs_qsize;		/* actual queue depth */
    113 	struct	fp_qentry fs_queue[FP_QSIZE];	/* queue contents */
    114 };
    115 
    116 /*
    117  * The actual FP registers are made accessible (c.f. ptrace(2)) through
    118  * a `struct fpreg'; <arch/sparc/sparc/process_machdep.c> relies on the
    119  * fact that `fpreg' is a prefix of `fpstate'.
    120  */
    121 struct fpreg {
    122 	u_int	fr_regs[32];		/* our view is 32 32-bit registers */
    123 	int	fr_fsr;			/* %fsr */
    124 };
    125 
    126 #endif /* _MACHINE_REG_H_ */
    127