/* $OpenBSD: vaddrs.h,v 1.7 2005/04/17 18:47:51 miod Exp $ */ /* $NetBSD: vaddrs.h,v 1.8 1997/03/10 23:54:41 pk Exp $ */ /* * Copyright (c) 1996 * The President and Fellows of Harvard College. All rights reserved. * Copyright (c) 1992, 1993 * The Regents of the University of California. All rights reserved. * * This software was developed by the Computer Systems Engineering group * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and * contributed to Berkeley. * * All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Lawrence Berkeley Laboratory. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * This product includes software developed by Harvard University. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)vaddrs.h 8.1 (Berkeley) 6/11/93 */ /* * Special (fixed) virtual addresses on the SPARC. * * IO virtual space begins at 0xfe000000 (a segment boundary) and * continues up to the DVMA edge at 0xff000000. (The upper all-1s * byte is special since some of the hardware supplies this to pad * a 24-bit address space out to 32 bits. This is a legacy of the * IBM PC AT bus, actually, just so you know who to blame.) * * We reserve several pages at the base of our IO virtual space * for `oft-used' devices which must be present anyway in order to * configure. In particular, we want the counter-timer register and * the Zilog ZSCC serial port chips to be mapped at fixed VAs to make * microtime() and the zs hardware interrupt handlers faster. * * [sun4/sun4c:] * Ideally, we should map the interrupt enable register here as well, * but that would require allocating pmegs in locore.s, so instead we * use one of the two `wasted' pages at KERNBASE+_MAXNBPG (see locore.s). */ #ifndef IODEV_0 #define IODEV_0 IOSPACE_BASE #define _MAXNBPG 8192 /* fixed VAs, independent of actual NBPG */ #define _MAXNCPU 4 /* fixed VA allocation allows 4 CPUs */ /* [4m:] interrupt and counter registers take (1 + NCPU) pages. */ #define TIMERREG_VA (IODEV_0) #define COUNTERREG_VA ( TIMERREG_VA + _MAXNBPG*_MAXNCPU) /* [4m] */ #define ZS0_VA (COUNTERREG_VA + _MAXNBPG) #define ZS1_VA ( ZS0_VA + _MAXNBPG) #define AUXREG_VA ( ZS1_VA + _MAXNBPG) #define TMPMAP_VA ( AUXREG_VA + _MAXNBPG) #define MSGBUF_VA ( TMPMAP_VA + _MAXNBPG) #define INTRREG_VA ( MSGBUF_VA + _MAXNBPG) /* [4/4c] */ #define PI_INTR_VA ( MSGBUF_VA + _MAXNBPG) /* [4m] */ #define SI_INTR_VA ( PI_INTR_VA + _MAXNBPG*_MAXNCPU) /* [4m] */ #define IODEV_BASE ( SI_INTR_VA + _MAXNBPG) #define IODEV_END (IOSPACE_BASE + IOSPACE_LEN) #define DVMA_BASE 0xfff00000 #define DVMA_END 0xfffc0000 /* * The next constant defines the amount of reserved DVMA space on the * Sun4m. The amount of space *must* be a multiple of 16MB, and thus * (((u_int)0) - DVMA4M_BASE) must be divisible by 16*1024*1024! * Note that pagetables must be allocated at a cost of 1k per MB of DVMA * space, plus severe alignment restrictions. So don't make DVMA4M_BASE too * low (max space = 2G). * * Since DVMA space overlaps with normal kernel address space (notably * the device mappings and the PROM), we don't want to put any DVMA * mappings where any of this useful stuff is (i.e. if we dvma_malloc * a buffer, we want to still have a SRMMU mapping to it, and we can't * have that if its on top of kernel code). Thus the last two * constants define the actual DVMA addresses used. These can be anything * as long as they are within the bounds setup by the first 2 constants. * This is especially important on MP systems with cache coherency: to * avoid consistency problems, DVMA addresses must map to the same place * in both processor and IOMMU space. */ #define DVMA4M_BASE 0xfc000000 /* can change subject to above rule */ #define DVMA4M_END 0xfffff000 /* XXX is this enough? */ #define DVMA_D24_BASE 0xff000000 #define DVMA_D24_END 0xfffff000 #define M_SPACE_D24 0x0001 /* * Virtual address of the per cpu `cpu_softc' structure. */ #define CPUINFO_VA (KERNBASE+8192) #endif /* IODEV_0 */