param.h revision 28491
1/*- 2 * Copyright (c) 1990 The Regents of the University of California. 3 * All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * William Jolitz. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. All advertising materials mentioning features or use of this software 17 * must display the following acknowledgement: 18 * This product includes software developed by the University of 19 * California, Berkeley and its contributors. 20 * 4. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * from: @(#)param.h 5.8 (Berkeley) 6/28/91 37 * $Id: param.h,v 1.35 1997/08/21 05:07:56 fsmp Exp $ 38 */ 39 40#ifndef _MACHINE_PARAM_H_ 41#define _MACHINE_PARAM_H_ 42 43/* 44 * Machine dependent constants for Intel 386. 45 */ 46 47#define MACHINE "i386" 48#ifdef SMP 49#define NCPUS 2 50#else 51#define NCPUS 1 52#endif 53#define MID_MACHINE MID_I386 54 55 56#ifndef LOCORE 57 58/* 59 * Round p (pointer or byte index) up to a correctly-aligned value 60 * for all data types (int, long, ...). The result is unsigned int 61 * and must be cast to any desired pointer type. 62 */ 63#define ALIGNBYTES (sizeof(int) - 1) 64#define ALIGN(p) (((unsigned)(p) + ALIGNBYTES) & ~ALIGNBYTES) 65 66#define PAGE_SHIFT 12 /* LOG2(PAGE_SIZE) */ 67#define PAGE_SIZE (1<<PAGE_SHIFT) /* bytes/page */ 68#define PAGE_MASK (PAGE_SIZE-1) 69#define NPTEPG (PAGE_SIZE/(sizeof (pt_entry_t))) 70 71#define NPDEPG (PAGE_SIZE/(sizeof (pd_entry_t))) 72#define PDRSHIFT 22 /* LOG2(NBPDR) */ 73#define NBPDR (1<<PDRSHIFT) /* bytes/page dir */ 74#define PDRMASK (NBPDR-1) 75 76#define DEV_BSHIFT 9 /* log2(DEV_BSIZE) */ 77#define DEV_BSIZE (1<<DEV_BSHIFT) 78 79#define BLKDEV_IOSIZE 2048 80#define MAXPHYS (64 * 1024) /* max raw I/O transfer size */ 81 82#define IOPAGES 2 /* pages of i/o permission bitmap */ 83#define UPAGES 2 /* pages of u-area */ 84#define UPAGES_HOLE 2 /* pages of "hole" at top of user space where */ 85 /* the upages used to be. DO NOT CHANGE! */ 86 87/* 88 * Constants related to network buffer management. 89 * MCLBYTES must be no larger than CLBYTES (the software page size), and, 90 * on machines that exchange pages of input or output buffers with mbuf 91 * clusters (MAPPED_MBUFS), MCLBYTES must also be an integral multiple 92 * of the hardware page size. 93 */ 94#ifndef MSIZE 95#define MSIZE 128 /* size of an mbuf */ 96#endif /* MSIZE */ 97 98#ifndef MCLSHIFT 99#define MCLSHIFT 11 /* convert bytes to m_buf clusters */ 100#endif /* MCLSHIFT */ 101#define MCLBYTES (1 << MCLSHIFT) /* size of an m_buf cluster */ 102#define MCLOFSET (MCLBYTES - 1) /* offset within an m_buf cluster */ 103 104/* 105 * Some macros for units conversion 106 */ 107 108/* clicks to bytes */ 109#define ctob(x) ((x)<<PAGE_SHIFT) 110 111/* bytes to clicks */ 112#define btoc(x) (((unsigned)(x)+PAGE_MASK)>>PAGE_SHIFT) 113 114/* 115 * btodb() is messy and perhaps slow because `bytes' may be an off_t. We 116 * want to shift an unsigned type to avoid sign extension and we don't 117 * want to widen `bytes' unnecessarily. Assume that the result fits in 118 * a daddr_t. 119 */ 120#define btodb(bytes) /* calculates (bytes / DEV_BSIZE) */ \ 121 (sizeof (bytes) > sizeof(long) \ 122 ? (daddr_t)((unsigned long long)(bytes) >> DEV_BSHIFT) \ 123 : (daddr_t)((unsigned long)(bytes) >> DEV_BSHIFT)) 124 125#define dbtob(db) /* calculates (db * DEV_BSIZE) */ \ 126 ((off_t)(db) << DEV_BSHIFT) 127 128/* 129 * Mach derived conversion macros 130 */ 131#define trunc_page(x) ((unsigned)(x) & ~PAGE_MASK) 132#define round_page(x) ((((unsigned)(x)) + PAGE_MASK) & ~PAGE_MASK) 133#define trunc_4mpage(x) ((unsigned)(x) & ~PDRMASK) 134#define round_4mpage(x) ((((unsigned)(x)) + PDRMASK) & ~PDRMASK) 135 136#define atop(x) ((unsigned)(x) >> PAGE_SHIFT) 137#define ptoa(x) ((unsigned)(x) << PAGE_SHIFT) 138 139#define i386_btop(x) ((unsigned)(x) >> PAGE_SHIFT) 140#define i386_ptob(x) ((unsigned)(x) << PAGE_SHIFT) 141 142#endif /* !LOCORE */ 143 144 145#ifndef _SIMPLELOCK_H_ 146#define _SIMPLELOCK_H_ 147 148#ifdef LOCORE 149 150#ifdef SMP 151 152#define MPLOCKED lock ; 153 154/* 155 * Some handy macros to allow logical organization and 156 * convenient reassignment of various locks. 157 */ 158 159#define FPU_LOCK call _get_fpu_lock 160#define ALIGN_LOCK call _get_align_lock 161#define SYSCALL_LOCK call _get_syscall_lock 162#define ALTSYSCALL_LOCK call _get_altsyscall_lock 163 164/* 165 * Protects INTR() ISRs. 166 */ 167#define ISR_TRYLOCK \ 168 pushl $_mp_lock ; /* GIANT_LOCK */ \ 169 call _MPtrylock ; /* try to get lock */ \ 170 add $4, %esp 171 172#define ISR_RELLOCK \ 173 pushl $_mp_lock ; /* GIANT_LOCK */ \ 174 call _MPrellock ; \ 175 add $4, %esp 176 177/* 178 * Protects the IO APIC and apic_imen as a critical region. 179 */ 180#define IMASK_LOCK \ 181 pushl $_imen_lock ; /* address of lock */ \ 182 call _s_lock ; /* MP-safe */ \ 183 addl $4, %esp 184 185#define IMASK_UNLOCK \ 186 pushl $_imen_lock ; /* address of lock */ \ 187 call _s_unlock ; /* MP-safe */ \ 188 addl $4, %esp 189 190/* 191 * Protects spl updates as a critical region. 192 * Items within this 'region' include: 193 * cpl 194 * cil 195 * ipending 196 * ??? 197 */ 198#define CPL_LOCK \ 199 pushl $_cpl_lock ; /* address of lock */ \ 200 call _s_lock ; /* MP-safe */ \ 201 addl $4, %esp 202 203#define CPL_UNLOCK \ 204 pushl $_cpl_lock ; /* address of lock */ \ 205 call _s_unlock ; /* MP-safe */ \ 206 addl $4, %esp 207 208#else /* SMP */ 209 210#define MPLOCKED /* NOP */ 211 212#define FPU_LOCK /* NOP */ 213#define ALIGN_LOCK /* NOP */ 214#define SYSCALL_LOCK /* NOP */ 215#define ALTSYSCALL_LOCK /* NOP */ 216 217#endif /* SMP */ 218 219#else /* LOCORE */ 220 221#ifdef SMP 222 223/* 224 * Protects com/tty data as a critical region. 225 */ 226#define COM_LOCK() s_lock(&com_lock) 227#define COM_UNLOCK() s_unlock(&com_lock) 228 229#else /* SMP */ 230 231#define COM_LOCK() 232#define COM_UNLOCK() 233 234#endif /* SMP */ 235 236/* 237 * A simple spin lock. 238 * 239 * This structure only sets one bit of data, but is sized based on the 240 * minimum word size that can be operated on by the hardware test-and-set 241 * instruction. It is only needed for multiprocessors, as uniprocessors 242 * will always run to completion or a sleep. It is an error to hold one 243 * of these locks while a process is sleeping. 244 */ 245struct simplelock { 246 volatile int lock_data; 247}; 248 249/* functions in simplelock.s */ 250void s_lock_init __P((struct simplelock *)); 251void s_lock __P((struct simplelock *)); 252int s_lock_try __P((struct simplelock *)); 253void s_unlock __P((struct simplelock *)); 254 255/* global data in mp_machdep.c */ 256extern struct simplelock imen_lock; 257extern struct simplelock cpl_lock; 258extern struct simplelock fast_intr_lock; 259extern struct simplelock intr_lock; 260extern struct simplelock com_lock; 261 262#if !defined(SIMPLELOCK_DEBUG) && NCPUS > 1 263/* 264 * The simple-lock routines are the primitives out of which the lock 265 * package is built. The machine-dependent code must implement an 266 * atomic test_and_set operation that indivisibly sets the simple lock 267 * to non-zero and returns its old value. It also assumes that the 268 * setting of the lock to zero below is indivisible. Simple locks may 269 * only be used for exclusive locks. 270 */ 271 272#ifdef the_original_code 273 274static __inline void 275simple_lock_init(struct simplelock *lkp) 276{ 277 278 lkp->lock_data = 0; 279} 280 281static __inline void 282simple_lock(struct simplelock *lkp) 283{ 284 285 while (test_and_set(&lkp->lock_data)) 286 continue; 287} 288 289static __inline int 290simple_lock_try(struct simplelock *lkp) 291{ 292 293 return (!test_and_set(&lkp->lock_data)); 294} 295 296static __inline void 297simple_unlock(struct simplelock *lkp) 298{ 299 300 lkp->lock_data = 0; 301} 302 303#else /* the_original_code */ 304 305/* 306 * This set of defines turns on the real functions in i386/isa/apic_ipl.s. 307 * It has never actually been tested. 308 */ 309#define simple_lock_init(alp) s_lock_init(alp) 310#define simple_lock(alp) s_lock(alp) 311#define simple_lock_try(alp) s_lock_try(alp) 312#define simple_unlock(alp) s_unlock(alp) 313 314#endif /* the_original_code */ 315 316#endif /* NCPUS > 1 */ 317#endif /* LOCORE */ 318#endif /* !_SIMPLELOCK_H_ */ 319 320#endif /* !_MACHINE_PARAM_H_ */ 321