/* $NetBSD: init_main.c,v 1.132 1998/09/08 23:57:58 thorpej Exp $ */ /* * Copyright (c) 1995 Christopher G. Demetriou. All rights reserved. * Copyright (c) 1982, 1986, 1989, 1991, 1992, 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. * * @(#)init_main.c 8.16 (Berkeley) 5/14/95 */ #include "fs_nfs.h" #include "opt_nfsserver.h" #include "opt_uvm.h" #include "rnd.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #ifdef REAL_CLISTS #include #endif #include #include #include #include #include #ifdef SYSVSHM #include #endif #ifdef SYSVSEM #include #endif #ifdef SYSVMSG #include #endif #include #include #include #if NRND > 0 #include #endif #include #include #include #include #include #include #if defined(UVM) #include #endif #include #include char copyright[] = "\ Copyright (c) 1996, 1997, 1998 The NetBSD Foundation, Inc. All rights reserved. Copyright (c) 1982, 1986, 1989, 1991, 1993 The Regents of the University of California. All rights reserved. "; /* Components of the first process -- 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; int cmask = CMASK; extern struct user *proc0paddr; struct vnode *rootvp, *swapdev_vp; int boothowto; struct timeval boottime; struct timeval runtime; static void check_console __P((struct proc *p)); static void start_init __P((struct proc *)); static void start_pagedaemon __P((struct proc *)); static void start_reaper __P((struct proc *)); void main __P((void)); extern char sigcode[], esigcode[]; #ifdef SYSCALL_DEBUG extern char *syscallnames[]; #endif struct emul emul_netbsd = { "netbsd", NULL, sendsig, SYS_syscall, SYS_MAXSYSCALL, sysent, #ifdef SYSCALL_DEBUG syscallnames, #else NULL, #endif 0, copyargs, setregs, sigcode, esigcode, }; /* * 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. */ void main() { struct proc *p, *p2; struct pdevinit *pdev; int i, s, error; extern struct pdevinit pdevinit[]; extern void roundrobin __P((void *)); extern void schedcpu __P((void *)); extern void disk_init __P((void)); #if defined(NFSSERVER) || defined(NFS) extern void nfs_init __P((void)); #endif /* * Initialize the current process pointer (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); #if defined(UVM) uvm_init(); #else vm_mem_init(); kmeminit(); #if defined(MACHINE_NEW_NONCONTIG) vm_page_physrehash(); #endif #endif /* UVM */ /* * Initialize mbuf's. Do this now because we might attempt to * allocate mbufs or mbuf clusters during autoconfiguration. */ mbinit(); /* Initialize sockets. */ soinit(); disk_init(); /* must come before autoconfiguration */ tty_init(); /* initialise tty list */ #if NRND > 0 rnd_init(); #endif config_init(); /* init autoconfiguration data structures */ cpu_startup(); /* * Initialize process and pgrp structures. */ procinit(); /* * Create process 0 (the swapper). */ LIST_INSERT_HEAD(&allproc, p, p_list); p->p_pgrp = &pgrp0; LIST_INSERT_HEAD(PGRPHASH(0), &pgrp0, pg_hash); LIST_INIT(&pgrp0.pg_members); LIST_INSERT_HEAD(&pgrp0.pg_members, p, p_pglist); pgrp0.pg_session = &session0; session0.s_count = 1; session0.s_sid = p->p_pid; session0.s_leader = p; p->p_flag = P_INMEM | P_SYSTEM; p->p_stat = SRUN; p->p_nice = NZERO; p->p_emul = &emul_netbsd; memcpy(p->p_comm, "swapper", sizeof("swapper")); /* Create 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. */ finit(); p->p_fd = &filedesc0.fd_fd; fdinit1(&filedesc0); /* Create the limits structures. */ 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_NOFILE].rlim_cur = NOFILE; limit0.pl_rlimit[RLIMIT_NPROC].rlim_cur = MAXUPRC; #if defined(UVM) i = ptoa(uvmexp.free); #else i = ptoa(cnt.v_free_count); #endif limit0.pl_rlimit[RLIMIT_RSS].rlim_max = i; limit0.pl_rlimit[RLIMIT_MEMLOCK].rlim_max = i; limit0.pl_rlimit[RLIMIT_MEMLOCK].rlim_cur = i / 3; limit0.p_refcnt = 1; /* * Initialize proc0's vmspace, which uses the kernel pmap. * All kernel processes (which never have user space mappings) * share proc0's vmspace, and thus, the kernel pmap. */ #if defined(UVM) uvmspace_init(&vmspace0, pmap_kernel(), round_page(VM_MIN_ADDRESS), trunc_page(VM_MAX_ADDRESS), TRUE); #else vmspace_init(&vmspace0, pmap_kernel(), round_page(VM_MIN_ADDRESS), trunc_page(VM_MAX_ADDRESS), TRUE); #endif p->p_vmspace = &vmspace0; 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; /* * Charge root for one process. */ (void)chgproccnt(0, 1); rqinit(); /* Configure virtual memory system, set vm rlimits. */ #if defined(UVM) uvm_init_limits(p); #else vm_init_limits(p); #endif /* Initialize the file systems. */ #if defined(NFSSERVER) || defined(NFS) nfs_init(); /* initialize server/shared data */ #endif vfsinit(); /* Start real time and statistics clocks. */ initclocks(); #ifdef REAL_CLISTS /* Initialize clists. */ clist_init(); #endif #ifdef SYSVSHM /* Initialize System V style shared memory. */ shminit(); #endif #ifdef SYSVSEM /* Initialize System V style semaphores. */ seminit(); #endif #ifdef SYSVMSG /* Initialize System V style message queues. */ msginit(); #endif /* Attach pseudo-devices. */ for (pdev = pdevinit; pdev->pdev_attach != NULL; pdev++) (*pdev->pdev_attach)(pdev->pdev_count); /* * Initialize protocols. Block reception of incoming packets * until everything is ready. */ s = splimp(); ifinit(); domaininit(); splx(s); #ifdef GPROF /* Initialize kernel profiling. */ kmstartup(); #endif /* Kick off timeout driven events by calling first time. */ roundrobin(NULL); schedcpu(NULL); /* Determine the root and dump devices. */ cpu_rootconf(); cpu_dumpconf(); /* Mount the root file system. */ do { domountroothook(); if ((error = vfs_mountroot())) { printf("cannot mount root, error = %d\n", error); boothowto |= RB_ASKNAME; setroot(root_device, (rootdev != NODEV) ? DISKPART(rootdev) : 0, NULL); } } while (error != 0); mountroothook_destroy(); mountlist.cqh_first->mnt_flag |= MNT_ROOTFS; mountlist.cqh_first->mnt_op->vfs_refcount++; /* * Get the vnode for '/'. Set filedesc0.fd_fd.fd_cdir to * reference it. */ if (VFS_ROOT(mountlist.cqh_first, &rootvnode)) panic("cannot find root vnode"); filedesc0.fd_fd.fd_cdir = rootvnode; VREF(filedesc0.fd_fd.fd_cdir); VOP_UNLOCK(rootvnode, 0); filedesc0.fd_fd.fd_rdir = NULL; #if defined(UVM) uvm_swap_init(); #else swapinit(); #endif /* * Now can look at time, having had a chance to verify the time * from the file system. Reset p->p_rtime as it may have been * munched in mi_switch() after the time got set. */ p->p_stats->p_start = runtime = mono_time = boottime = time; p->p_rtime.tv_sec = p->p_rtime.tv_usec = 0; /* Initialize signal state for process 0. */ siginit(p); /* Create process 1 (init(8)). */ if (fork1(p, 0, NULL, &p2)) panic("fork init"); cpu_set_kpc(p2, start_init); /* Create process 2 (the pageout daemon). */ if (fork1(p, FORK_SHAREVM, NULL, &p2)) panic("fork pager"); cpu_set_kpc(p2, start_pagedaemon); /* Create process 3 (the process reaper). */ if (fork1(p, FORK_SHAREVM, NULL, &p2)) panic("fork reaper"); cpu_set_kpc(p2, start_reaper); /* The scheduler is an infinite loop. */ #if defined(UVM) uvm_scheduler(); #else scheduler(); #endif /* NOTREACHED */ } static void check_console(p) struct proc *p; { struct nameidata nd; int error; NDINIT(&nd, LOOKUP, FOLLOW, UIO_SYSSPACE, "/dev/console", p); error = namei(&nd); if (error == 0) vrele(nd.ni_vp); else if (error == ENOENT) printf("warning: no /dev/console\n"); else printf("warning: lookup /dev/console: error %d\n", error); } /* * List of paths to try when searching for "init". */ static char *initpaths[] = { "/sbin/init", "/sbin/oinit", "/sbin/init.bak", NULL, }; /* * Start the initial user process; try exec'ing each pathname in "initpaths". * The program is invoked with one argument containing the boot flags. */ static void start_init(p) struct proc *p; { vaddr_t addr; struct sys_execve_args /* { syscallarg(const char *) path; syscallarg(char * const *) argp; syscallarg(char * const *) envp; } */ args; int options, i, error; register_t retval[2]; char flags[4], *flagsp; char **pathp, *path, *ucp, **uap, *arg0, *arg1 = NULL; /* * Now in process 1. */ initproc = p; /* * This is not the right way to do this. We really should * hand-craft a descriptor onto /dev/console to hand to init, * but that's a _lot_ more work, and the benefit from this easy * hack makes up for the "good is the enemy of the best" effect. */ check_console(p); /* * Need just enough stack to hold the faked-up "execve()" arguments. */ addr = USRSTACK - PAGE_SIZE; #if defined(UVM) if (uvm_map(&p->p_vmspace->vm_map, &addr, PAGE_SIZE, NULL, UVM_UNKNOWN_OFFSET, UVM_MAPFLAG(UVM_PROT_ALL, UVM_PROT_ALL, UVM_INH_COPY, UVM_ADV_NORMAL, UVM_FLAG_FIXED|UVM_FLAG_OVERLAY|UVM_FLAG_COPYONW)) != KERN_SUCCESS) panic("init: couldn't allocate argument space"); #else if (vm_allocate(&p->p_vmspace->vm_map, &addr, (vsize_t)PAGE_SIZE, FALSE) != 0) panic("init: couldn't allocate argument space"); #endif p->p_vmspace->vm_maxsaddr = (caddr_t)addr; for (pathp = &initpaths[0]; (path = *pathp) != NULL; pathp++) { ucp = (char *)(addr + PAGE_SIZE); /* * Construct the boot flag argument. */ flagsp = flags; *flagsp++ = '-'; options = 0; if (boothowto & RB_SINGLE) { *flagsp++ = 's'; options = 1; } #ifdef notyet if (boothowto & RB_FASTBOOT) { *flagsp++ = 'f'; options = 1; } #endif /* * Move out the flags (arg 1), if necessary. */ if (options != 0) { *flagsp++ = '\0'; i = flagsp - flags; #ifdef DEBUG printf("init: copying out flags `%s' %d\n", flags, i); #endif (void)copyout((caddr_t)flags, (caddr_t)(ucp -= i), i); arg1 = ucp; } /* * Move out the file name (also arg 0). */ i = strlen(path) + 1; #ifdef DEBUG printf("init: copying out path `%s' %d\n", path, i); #endif (void)copyout((caddr_t)path, (caddr_t)(ucp -= i), i); arg0 = ucp; /* * Move out the arg pointers. */ uap = (char **)((long)ucp & ~ALIGNBYTES); (void)suword((caddr_t)--uap, 0); /* terminator */ if (options != 0) (void)suword((caddr_t)--uap, (long)arg1); (void)suword((caddr_t)--uap, (long)arg0); /* * Point at the arguments. */ SCARG(&args, path) = arg0; SCARG(&args, argp) = uap; SCARG(&args, envp) = NULL; /* * Now try to exec the program. If can't for any reason * other than it doesn't exist, complain. */ error = sys_execve(p, &args, retval); if (error == 0 || error == EJUSTRETURN) return; if (error != ENOENT) printf("exec %s: error %d\n", path, error); } printf("init: not found\n"); panic("no init"); } static void start_pagedaemon(p) struct proc *p; { /* * Now in process 2. */ p->p_flag |= P_INMEM | P_SYSTEM; /* XXX */ memcpy(curproc->p_comm, "pagedaemon", sizeof("pagedaemon")); #if defined(UVM) uvm_pageout(); #else vm_pageout(); #endif /* NOTREACHED */ } static void start_reaper(p) struct proc *p; { /* * Now in process 3. */ p->p_flag |= P_INMEM | P_SYSTEM; /* XXX */ memcpy(curproc->p_comm, "reaper", sizeof("reaper")); reaper(); /* NOTREACHED */ }