[src/trunk]: src/sys/kern MI implementation of allocsys()

[lukem <lukem%NetBSD.org@localhost>]

details:   https://anonhg.NetBSD.org/src/rev/7daafcd8e0d6
branches:  trunk
changeset: 473097:7daafcd8e0d6
user:      lukem <lukem%NetBSD.org@localhost>
date:      Thu May 20 05:59:52 1999 +0000

description:
MI implementation of allocsys()

diffstat:

 sys/kern/kern_allocsys.c |  197 +++++++++++++++++++++++++++++++++++++++++++++++
 1 files changed, 197 insertions(+), 0 deletions(-)

diffs (201 lines):

diff -r 4fe607a9e02b -r 7daafcd8e0d6 sys/kern/kern_allocsys.c
--- /dev/null   Thu Jan 01 00:00:00 1970 +0000
+++ b/sys/kern/kern_allocsys.c  Thu May 20 05:59:52 1999 +0000
@@ -0,0 +1,197 @@
+/*     $NetBSD: kern_allocsys.c,v 1.1 1999/05/20 05:59:52 lukem Exp $  */
+
+/*-
+ * Copyright (c) 1999 The NetBSD Foundation, Inc.
+ * All rights reserved.
+ *
+ * This code is derived from software contributed to The NetBSD Foundation
+ * by Luke Mewburn.
+ *
+ * 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 NetBSD
+ *     Foundation, Inc. and its contributors.
+ * 4. Neither the name of The NetBSD Foundation 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 NETBSD FOUNDATION, INC. 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 FOUNDATION 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.
+ */
+
+/*-
+ * Copyright (c) 1982, 1987, 1990 The Regents of the University of California.
+ * All rights reserved.
+ *
+ * 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.
+ *
+ */
+
+
+#include "opt_bufcache.h"
+#include "opt_sysv.h"
+
+#include <sys/param.h>
+#include <sys/systm.h>
+#include <sys/buf.h>
+#include <sys/callout.h>
+#ifdef SYSVMSG
+#include <sys/msg.h>
+#endif
+#ifdef SYSVSEM
+#include <sys/sem.h>
+#endif
+#ifdef SYSVSHM
+#include <sys/shm.h>
+#endif
+
+#include <vm/vm.h>
+#include <vm/vm_page.h>
+
+/*
+ * Declare these as initialized data so we can patch them.
+ */
+#ifndef        NBUF
+# define NBUF 0
+#endif
+
+#ifndef        BUFPAGES
+# define BUFPAGES 0
+#endif
+
+#ifdef BUFCACHE
+# if (BUFCACHE < 5) || (BUFCACHE > 95)
+#  error BUFCACHE is not between 5 and 95
+# endif
+#else
+# define BUFCACHE 0
+#endif
+
+int    nbuf = NBUF;
+int    nswbuf = 0;
+int    bufpages = BUFPAGES;    /* optional hardwired count */
+int    bufcache = BUFCACHE;    /* % of RAM to use for buffer cache */
+
+/*
+ * Allocate space for system data structures.  We are given
+ * a starting virtual address and we return a final virtual
+ * address; along the way we set each data structure pointer.
+ *
+ * We call allocsys() with 0 to find out how much space we want,
+ * allocate that much and fill it with zeroes, and then call
+ * allocsys() again with the correct base virtual address.
+ *
+ */
+
+caddr_t
+allocsys(v, mdcallback)
+       caddr_t v;
+       caddr_t (*mdcallback) __P((caddr_t));
+{
+
+       ALLOCSYS(v, callout, struct callout, ncallout);
+#ifdef SYSVSHM
+       ALLOCSYS(v, shmsegs, struct shmid_ds, shminfo.shmmni);
+#endif
+#ifdef SYSVSEM
+       ALLOCSYS(v, sema, struct semid_ds, seminfo.semmni);
+       ALLOCSYS(v, sem, struct sem, seminfo.semmns);
+       /* This is pretty disgusting! */
+       ALLOCSYS(v, semu, int, (seminfo.semmnu * seminfo.semusz) / sizeof(int));
+#endif
+#ifdef SYSVMSG
+       ALLOCSYS(v, msgpool, char, msginfo.msgmax);
+       ALLOCSYS(v, msgmaps, struct msgmap, msginfo.msgseg);
+       ALLOCSYS(v, msghdrs, struct msg, msginfo.msgtql);
+       ALLOCSYS(v, msqids, struct msqid_ds, msginfo.msgmni);
+#endif
+
+       /*
+        * Determine how many buffers to allocate.
+        * We allocate bufcache % of memory for buffer space.
+        */
+
+       if (bufpages == 0)
+               bufpages = physmem / CLSIZE * bufcache / 100;
+
+#ifdef DIAGNOSTIC
+       if (bufpages == 0)
+               panic("bufpages = 0\n");
+#endif
+
+       /* 
+        * Ensure a minimum of 16 buffers.
+        */
+       if (nbuf == 0) {
+               nbuf = bufpages;
+               if (nbuf < 16)
+                       nbuf = 16;
+       }
+
+#ifdef VM_MAX_KERNEL_BUF
+       /*
+        * XXX stopgap measure to prevent wasting too much KVM on
+        * the sparsely filled buffer cache.
+        */
+       if (nbuf * MAXBSIZE > VM_MAX_KERNEL_BUF)
+               nbuf = VM_MAX_KERNEL_BUF / MAXBSIZE;
+#endif
+
+       /*
+        * We allocate 1/2 as many swap buffer headers as file I/O buffers.
+        */
+       if (nswbuf == 0) {
+               nswbuf = (nbuf / 2) &~ 1;       /* force even */
+               if (nswbuf > 256)
+                       nswbuf = 256;           /* sanity */
+       }
+       ALLOCSYS(v, buf, struct buf, nbuf);
+
+       if (mdcallback != NULL)
+               v = mdcallback(v);
+
+       return (v);
+}