/*
- * Copyright (c) 1982, 1986, 1989 Regents of the University of California.
- * All rights reserved. The Berkeley software License Agreement
- * specifies the terms and conditions for redistribution.
+ * Copyright (c) 1982, 1986, 1989, 1991 Regents of the University of California.
+ * All rights reserved.
*
- * @(#)init_main.c 7.29 (Berkeley) 6/22/90
+ * 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.
+ *
+ * @(#)init_main.c 7.41 (Berkeley) 5/15/91
*/
#include "param.h"
-#include "systm.h"
-#include "user.h"
+#include "filedesc.h"
#include "kernel.h"
#include "mount.h"
#include "map.h"
#include "proc.h"
+#include "resourcevar.h"
+#include "signalvar.h"
+#include "systm.h"
#include "vnode.h"
#include "seg.h"
#include "conf.h"
#include "buf.h"
-#include "vm.h"
-#include "cmap.h"
-#include "text.h"
#include "clist.h"
#include "malloc.h"
#include "protosw.h"
#include "reboot.h"
-#include "../ufs/quota.h"
+#include "user.h"
+
+#include "ufs/quota.h"
-#include "machine/pte.h"
-#include "machine/reg.h"
#include "machine/cpu.h"
+#include "vm/vm.h"
+
+char copyright[] =
+"Copyright (c) 1982,1986,1989,1991 The Regents of the University of California.\nAll rights reserved.\n\n";
+
+/*
+ * Components of process 0;
+ * never freed.
+ */
+struct session session0;
+struct pgrp pgrp0;
+struct proc proc0;
+struct pcred cred0;
+struct filedesc0 filedesc0;
+struct plimit limit0;
+struct vmspace vmspace0;
+struct proc *curproc = &proc0;
+struct proc *initproc, *pageproc;
+
int cmask = CMASK;
+extern struct user *proc0paddr;
extern int (*mountroot)();
+
+struct vnode *rootvp, *swapdev_vp;
+int boothowto;
+
/*
- * Initialization code.
- * Called from cold start routine as
- * soon as a stack and segmentation
- * have been established.
- * Functions:
- * clear and free user core
- * turn on clock
- * hand craft 0th process
- * call all initialization routines
- * fork - process 0 to schedule
- * - process 1 execute bootstrap
- * - process 2 to page out
+ * System startup; initialize the world, create process 0,
+ * mount root filesystem, and fork to create init and pagedaemon.
+ * Most of the hard work is done in the lower-level initialization
+ * routines including startup(), which does memory initialization
+ * and autoconfiguration.
*/
-main(firstaddr)
- int firstaddr;
+main()
{
register int i;
register struct proc *p;
- register struct pgrp *pg;
- int s;
+ register struct filedesc0 *fdp;
+ int s, rval[2];
- rqinit();
- startup(firstaddr);
+ /*
+ * Initialize curproc before any possible traps/probes
+ * to simplify trap processing.
+ */
+ p = &proc0;
+ curproc = p;
+ /*
+ * Attempt to find console and initialize
+ * in case of early panic or other messages.
+ */
+ consinit();
+ printf(copyright);
+
+ vm_mem_init();
+ kmeminit();
+ cpu_startup();
/*
* set up system process 0 (swapper)
*/
- p = &proc[0];
- bcopy("swapper", p->p_comm, sizeof ("swapper"));
- p->p_p0br = u.u_pcb.pcb_p0br;
- p->p_szpt = 1;
- p->p_addr = uaddr(p);
+ p = &proc0;
+ curproc = p;
+
+ allproc = p;
+ p->p_prev = &allproc;
+ p->p_pgrp = &pgrp0;
+ pgrphash[0] = &pgrp0;
+ pgrp0.pg_mem = p;
+ pgrp0.pg_session = &session0;
+ session0.s_count = 1;
+ session0.s_leader = p;
+
+ p->p_flag = SLOAD|SSYS;
p->p_stat = SRUN;
- p->p_flag |= SLOAD|SSYS;
p->p_nice = NZERO;
- setredzone(p->p_addr, (caddr_t)&u);
- u.u_procp = p;
- MALLOC(pgrphash[0], struct pgrp *, sizeof (struct pgrp),
- M_PGRP, M_NOWAIT);
- if ((pg = pgrphash[0]) == NULL)
- panic("no space to craft zero'th process group");
- pg->pg_id = 0;
- pg->pg_hforw = 0;
- pg->pg_mem = p;
- pg->pg_jobc = 0;
- p->p_pgrp = pg;
- p->p_pgrpnxt = 0;
- MALLOC(pg->pg_session, struct session *, sizeof (struct session),
- M_SESSION, M_NOWAIT);
- if (pg->pg_session == NULL)
- panic("no space to craft zero'th session");
- pg->pg_session->s_count = 1;
- pg->pg_session->s_leader = NULL;
- pg->pg_session->s_ttyvp = NULL;
- pg->pg_session->s_ttyp = NULL;
-#ifdef KTRACE
- p->p_tracep = NULL;
- p->p_traceflag = 0;
-#endif
+ bcopy("swapper", p->p_comm, sizeof ("swapper"));
+
/*
- * These assume that the u. area is always mapped
- * to the same virtual address. Otherwise must be
- * handled when copying the u. area in newproc().
+ * Setup credentials
+ */
+ cred0.p_refcnt = 1;
+ p->p_cred = &cred0;
+ p->p_ucred = crget();
+ p->p_ucred->cr_ngroups = 1; /* group 0 */
+
+ /*
+ * Create the file descriptor table for process 0.
+ */
+ fdp = &filedesc0;
+ p->p_fd = &fdp->fd_fd;
+ fdp->fd_fd.fd_refcnt = 1;
+ fdp->fd_fd.fd_cmask = cmask;
+ fdp->fd_fd.fd_ofiles = fdp->fd_dfiles;
+ fdp->fd_fd.fd_ofileflags = fdp->fd_dfileflags;
+ fdp->fd_fd.fd_nfiles = NDFILE;
+
+ /*
+ * Set initial limits
*/
- ndinit(&u.u_nd);
+ p->p_limit = &limit0;
+ for (i = 0; i < sizeof(p->p_rlimit)/sizeof(p->p_rlimit[0]); i++)
+ limit0.pl_rlimit[i].rlim_cur =
+ limit0.pl_rlimit[i].rlim_max = RLIM_INFINITY;
+ limit0.pl_rlimit[RLIMIT_OFILE].rlim_cur = NOFILE;
+ limit0.pl_rlimit[RLIMIT_NPROC].rlim_cur = MAXUPRC;
+ limit0.p_refcnt = 1;
+
+ /*
+ * Allocate a prototype map so we have something to fork
+ */
+ p->p_vmspace = &vmspace0;
+ vmspace0.vm_refcnt = 1;
+ pmap_pinit(&vmspace0.vm_pmap);
+ vm_map_init(&p->p_vmspace->vm_map, round_page(VM_MIN_ADDRESS),
+ trunc_page(VM_MAX_ADDRESS), TRUE);
+ vmspace0.vm_map.pmap = &vmspace0.vm_pmap;
+ p->p_addr = proc0paddr; /* XXX */
+
+ /*
+ * We continue to place resource usage info
+ * and signal actions in the user struct so they're pageable.
+ */
+ p->p_stats = &p->p_addr->u_stats;
+ p->p_sigacts = &p->p_addr->u_sigacts;
+
+ rqinit();
- u.u_cmask = cmask;
- u.u_lastfile = -1;
- for (i = 0; i < sizeof(u.u_rlimit)/sizeof(u.u_rlimit[0]); i++)
- u.u_rlimit[i].rlim_cur = u.u_rlimit[i].rlim_max =
- RLIM_INFINITY;
/*
* configure virtual memory system,
* set vm rlimits
*/
- vminit();
+ vm_init_limits(p);
/*
* Initialize the file systems.
*
- * Get vnodes for swapdev, argdev, and rootdev.
+ * Get vnodes for swapdev and rootdev.
*/
vfsinit();
- if (bdevvp(swapdev, &swapdev_vp) ||
- bdevvp(argdev, &argdev_vp) ||
- bdevvp(rootdev, &rootvp))
+ if (bdevvp(swapdev, &swapdev_vp) || bdevvp(rootdev, &rootvp))
panic("can't setup bdevvp's");
- /*
- * Setup credentials
- */
- u.u_cred = crget();
- u.u_cred->cr_ngroups = 1;
-
startrtclock();
#if defined(vax)
#include "kg.h"
ifinit();
domaininit();
splx(s);
- pqinit();
- xinit();
- swapinit();
+
#ifdef GPROF
kmstartup();
#endif
-/* kick off timeout driven events by calling first time */
+ /* kick off timeout driven events by calling first time */
roundrobin();
schedcpu();
- schedpaging();
+ enablertclock(); /* enable realtime clock interrupts */
-/* set up the root file system */
+ /*
+ * Set up the root file system and vnode.
+ */
if ((*mountroot)())
panic("cannot mount root");
/*
* Get vnode for '/'.
- * Setup rootdir and u.u_cdir to point to it.
+ * Setup rootdir and fdp->fd_fd.fd_cdir to point to it.
*/
if (VFS_ROOT(rootfs, &rootdir))
panic("cannot find root vnode");
- u.u_cdir = rootdir;
- VREF(u.u_cdir);
+ fdp->fd_fd.fd_cdir = rootdir;
+ VREF(fdp->fd_fd.fd_cdir);
VOP_UNLOCK(rootdir);
- u.u_rdir = NULL;
- boottime = u.u_start = time;
- u.u_dmap = zdmap;
- u.u_smap = zdmap;
-
- enablertclock(); /* enable realtime clock interrupts */
- /*
- * make init process
- */
+ fdp->fd_fd.fd_rdir = NULL;
+ swapinit();
- siginit(&proc[0]);
- proc[0].p_szpt = CLSIZE;
- if (newproc(0)) {
- expand(clrnd((int)btoc(szicode)), 0);
- (void) swpexpand(u.u_dsize, (segsz_t)0, &u.u_dmap, &u.u_smap);
- (void) copyout((caddr_t)icode, (caddr_t)0, (unsigned)szicode);
- /*
- * Return goes to loc. 0 of user init
- * code just copied out.
- */
- return;
- }
/*
- * make page-out daemon (process 2)
- * the daemon has ctopt(nswbuf*CLSIZE*KLMAX) pages of page
- * table so that it can map dirty pages into
- * its address space during asychronous pushes.
+ * Now can look at time, having had a chance
+ * to verify the time from the file system.
*/
- proc[0].p_szpt = clrnd(ctopt(nswbuf*CLSIZE*KLMAX + HIGHPAGES));
- if (newproc(0)) {
- proc[2].p_flag |= SLOAD|SSYS;
- proc[2].p_dsize = u.u_dsize = nswbuf*CLSIZE*KLMAX;
- bcopy("pagedaemon", proc[2].p_comm, sizeof ("pagedaemon"));
- pageout();
- /*NOTREACHED*/
- }
+ boottime = p->p_stats->p_start = time;
/*
- * enter scheduling loop
+ * make init process
*/
- proc[0].p_szpt = 1;
- sched();
-}
-
-/*
- * Initialize hash links for buffers.
- */
-bhinit()
-{
- register int i;
- register struct bufhd *bp;
+ siginit(p);
+ if (fork(p, (void *) NULL, rval))
+ panic("fork init");
+ if (rval[1]) {
+ static char initflags[] = "-sf";
+ char *ip = initflags + 1;
+ vm_offset_t addr = 0;
+ extern int icode[]; /* user init code */
+ extern int szicode; /* size of icode */
- for (bp = bufhash, i = 0; i < BUFHSZ; i++, bp++)
- bp->b_forw = bp->b_back = (struct buf *)bp;
-}
+ /*
+ * Now in process 1. Set init flags into icode,
+ * get a minimal address space, copy out "icode",
+ * and return to it to do an exec of init.
+ */
+ p = curproc;
+ initproc = p;
+ if (boothowto&RB_SINGLE)
+ *ip++ = 's';
+#ifdef notyet
+ if (boothowto&RB_FASTBOOT)
+ *ip++ = 'f';
+#endif
+ *ip++ = '\0';
-/*
- * Initialize the buffer I/O system by freeing
- * all buffers and setting all device buffer lists to empty.
- */
-binit()
-{
- register struct buf *bp, *dp;
- register int i;
- int base, residual;
+ if (vm_allocate(&p->p_vmspace->vm_map, &addr,
+ round_page(szicode + sizeof(initflags)), FALSE) != 0 ||
+ addr != 0)
+ panic("init: couldn't allocate at zero");
- for (dp = bfreelist; dp < &bfreelist[BQUEUES]; dp++) {
- dp->b_forw = dp->b_back = dp->av_forw = dp->av_back = dp;
- dp->b_flags = B_HEAD;
- }
- base = bufpages / nbuf;
- residual = bufpages % nbuf;
- for (i = 0; i < nbuf; i++) {
- bp = &buf[i];
- bp->b_dev = NODEV;
- bp->b_bcount = 0;
- bp->b_rcred = NOCRED;
- bp->b_wcred = NOCRED;
- bp->b_dirtyoff = 0;
- bp->b_dirtyend = 0;
- bp->b_un.b_addr = buffers + i * MAXBSIZE;
- if (i < residual)
- bp->b_bufsize = (base + 1) * CLBYTES;
- else
- bp->b_bufsize = base * CLBYTES;
- binshash(bp, &bfreelist[BQ_AGE]);
- bp->b_flags = B_BUSY|B_INVAL;
- brelse(bp);
+ /* need just enough stack to exec from */
+ addr = trunc_page(USRSTACK - PAGE_SIZE);
+ if (vm_allocate(&p->p_vmspace->vm_map, &addr,
+ PAGE_SIZE, FALSE) != KERN_SUCCESS)
+ panic("vm_allocate init stack");
+ p->p_vmspace->vm_maxsaddr = (caddr_t)addr;
+ (void) copyout((caddr_t)icode, (caddr_t)0, (unsigned)szicode);
+ (void) copyout(initflags, (caddr_t)szicode, sizeof(initflags));
+ return; /* returns to icode */
}
-}
-
-/*
- * Set up swap devices.
- * Initialize linked list of free swap
- * headers. These do not actually point
- * to buffers, but rather to pages that
- * are being swapped in and out.
- */
-swapinit()
-{
- register int i;
- register struct buf *sp = swbuf;
- struct swdevt *swp;
- int error;
/*
- * Count swap devices, and adjust total swap space available.
- * Some of this space will not be available until a swapon()
- * system is issued, usually when the system goes multi-user.
+ * Start up pageout daemon (process 2).
*/
- nswdev = 0;
- nswap = 0;
- for (swp = swdevt; swp->sw_dev; swp++) {
- nswdev++;
- if (swp->sw_nblks > nswap)
- nswap = swp->sw_nblks;
- }
- if (nswdev == 0)
- panic("swapinit");
- if (nswdev > 1)
- nswap = ((nswap + dmmax - 1) / dmmax) * dmmax;
- nswap *= nswdev;
- /*
- * If there are multiple swap areas,
- * allow more paging operations per second.
- */
- if (nswdev > 1)
- maxpgio = (maxpgio * (2 * nswdev - 1)) / 2;
- if (bdevvp(swdevt[0].sw_dev, &swdevt[0].sw_vp))
- panic("swapvp");
- if (error = swfree(0)) {
- printf("swfree errno %d\n", error); /* XXX */
- panic("swapinit swfree 0");
+ if (fork(p, (void *) NULL, rval))
+ panic("fork pager");
+ if (rval[1]) {
+ /*
+ * Now in process 2.
+ */
+ p = curproc;
+ pageproc = p;
+ p->p_flag |= SLOAD|SSYS; /* XXX */
+ bcopy("pagedaemon", curproc->p_comm, sizeof ("pagedaemon"));
+ vm_pageout();
+ /*NOTREACHED*/
}
/*
- * Now set up swap buffer headers.
+ * enter scheduling loop
*/
- bswlist.av_forw = sp;
- for (i=0; i<nswbuf-1; i++, sp++)
- sp->av_forw = sp+1;
- sp->av_forw = NULL;
-}
-
-/*
- * Initialize clist by freeing all character blocks, then count
- * number of character devices. (Once-only routine)
- */
-cinit()
-{
- register int ccp;
- register struct cblock *cp;
-
- ccp = (int)cfree;
- ccp = (ccp+CROUND) & ~CROUND;
- for(cp=(struct cblock *)ccp; cp < &cfree[nclist-1]; cp++) {
- cp->c_next = cfreelist;
- cfreelist = cp;
- cfreecount += CBSIZE;
- }
+ sched();
}