1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1980, 1986, 1989, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
* (c) UNIX System Laboratories, Inc.
|
|
|
|
* All or some portions of this file are derived from material licensed
|
|
|
|
* to the University of California by American Telephone and Telegraph
|
|
|
|
* Co. or Unix System Laboratories, Inc. and are reproduced herein with
|
|
|
|
* the permission of UNIX System Laboratories, Inc.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* @(#)param.c 8.2 (Berkeley) 1/21/94
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
* $Id: param.c,v 1.4 1994/09/13 14:46:24 dfr Exp $
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/vnode.h>
|
|
|
|
#include <sys/file.h>
|
|
|
|
#include <sys/callout.h>
|
|
|
|
#include <sys/clist.h>
|
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
|
|
|
|
#include <ufs/ufs/quota.h>
|
|
|
|
|
|
|
|
#ifdef SYSVSHM
|
|
|
|
#include <machine/vmparam.h>
|
|
|
|
#include <sys/shm.h>
|
|
|
|
#endif
|
1994-09-13 14:47:38 +00:00
|
|
|
#ifdef SYSVSEM
|
|
|
|
#include "sys/sem.h"
|
|
|
|
#endif
|
|
|
|
#ifdef SYSVMSG
|
|
|
|
#include "sys/msg.h"
|
|
|
|
#endif
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* System parameter formulae.
|
|
|
|
*
|
|
|
|
* This file is copied into each directory where we compile
|
|
|
|
* the kernel; it should be modified there to suit local taste
|
|
|
|
* if necessary.
|
|
|
|
*
|
|
|
|
* Compiled with -DHZ=xx -DTIMEZONE=x -DDST=x -DMAXUSERS=xx
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef HZ
|
|
|
|
#define HZ 100
|
|
|
|
#endif
|
|
|
|
int hz = HZ;
|
|
|
|
int tick = 1000000 / HZ;
|
|
|
|
int tickadj = 30000 / (60 * HZ); /* can adjust 30ms in 60s */
|
|
|
|
struct timezone tz = { TIMEZONE, DST };
|
|
|
|
#define NPROC (20 + 16 * MAXUSERS)
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
int maxproc = NPROC; /* maximum # of processes */
|
|
|
|
int maxfiles = 256; /* open files per process limit */
|
|
|
|
int ncallout = 16 + NPROC; /* maximum # of timer events */
|
1994-05-24 10:09:53 +00:00
|
|
|
int nmbclusters = NMBCLUSTERS;
|
|
|
|
int fscale = FSCALE; /* kernel uses `FSCALE', user uses `fscale' */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Values in support of System V compatible shared memory. XXX
|
|
|
|
*/
|
|
|
|
#ifdef SYSVSHM
|
|
|
|
#define SHMMAX (SHMMAXPGS*NBPG)
|
|
|
|
#define SHMMIN 1
|
|
|
|
#define SHMMNI 32 /* <= SHMMMNI in shm.h */
|
|
|
|
#define SHMSEG 8
|
|
|
|
#define SHMALL (SHMMAXPGS/CLSIZE)
|
|
|
|
|
|
|
|
struct shminfo shminfo = {
|
|
|
|
SHMMAX,
|
|
|
|
SHMMIN,
|
|
|
|
SHMMNI,
|
|
|
|
SHMSEG,
|
|
|
|
SHMALL
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
1994-09-13 14:47:38 +00:00
|
|
|
/*
|
|
|
|
* Values in support of System V compatible semaphores.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifdef SYSVSEM
|
|
|
|
|
|
|
|
struct seminfo seminfo = {
|
|
|
|
SEMMAP, /* # of entries in semaphore map */
|
|
|
|
SEMMNI, /* # of semaphore identifiers */
|
|
|
|
SEMMNS, /* # of semaphores in system */
|
|
|
|
SEMMNU, /* # of undo structures in system */
|
|
|
|
SEMMSL, /* max # of semaphores per id */
|
|
|
|
SEMOPM, /* max # of operations per semop call */
|
|
|
|
SEMUME, /* max # of undo entries per process */
|
|
|
|
SEMUSZ, /* size in bytes of undo structure */
|
|
|
|
SEMVMX, /* semaphore maximum value */
|
|
|
|
SEMAEM /* adjust on exit max value */
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Values in support of System V compatible messages.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifdef SYSVMSG
|
|
|
|
|
|
|
|
struct msginfo msginfo = {
|
|
|
|
MSGMAX, /* max chars in a message */
|
|
|
|
MSGMNI, /* # of message queue identifiers */
|
|
|
|
MSGMNB, /* max chars in a queue */
|
|
|
|
MSGTQL, /* max messages in system */
|
|
|
|
MSGSSZ, /* size of a message segment */
|
|
|
|
/* (must be small power of 2 greater than 4) */
|
|
|
|
MSGSEG /* number of message segments */
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* These are initialized at bootstrap time
|
|
|
|
* to values dependent on memory size
|
|
|
|
*/
|
|
|
|
int nbuf, nswbuf;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* These have to be allocated somewhere; allocating
|
|
|
|
* them here forces loader errors if this file is omitted
|
|
|
|
* (if they've been externed everywhere else; hah!).
|
|
|
|
*/
|
|
|
|
struct callout *callout;
|
|
|
|
struct cblock *cfree;
|
|
|
|
struct buf *buf, *swbuf;
|
|
|
|
char *buffers;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Proc/pgrp hashing.
|
|
|
|
* Here so that hash table sizes can depend on MAXUSERS/NPROC.
|
|
|
|
* Hash size must be a power of two.
|
|
|
|
* NOW omission of this file will cause loader errors!
|
|
|
|
*/
|
|
|
|
|
|
|
|
#if NPROC > 1024
|
|
|
|
#define PIDHSZ 512
|
|
|
|
#else
|
|
|
|
#if NPROC > 512
|
|
|
|
#define PIDHSZ 256
|
|
|
|
#else
|
|
|
|
#if NPROC > 256
|
|
|
|
#define PIDHSZ 128
|
|
|
|
#else
|
|
|
|
#define PIDHSZ 64
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
struct proc *pidhash[PIDHSZ];
|
|
|
|
struct pgrp *pgrphash[PIDHSZ];
|
|
|
|
int pidhashmask = PIDHSZ - 1;
|