1 /* 2 * Copyright (c) 1982, 1986, 1989 Regents of the University of California. 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms are permitted 6 * provided that the above copyright notice and this paragraph are 7 * duplicated in all such forms and that any documentation, 8 * advertising materials, and other materials related to such 9 * distribution and use acknowledge that the software was developed 10 * by the University of California, Berkeley. The name of the 11 * University may not be used to endorse or promote products derived 12 * from this software without specific prior written permission. 13 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR 14 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED 15 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. 16 * 17 * @(#)init_main.c 7.19 (Berkeley) 10/29/89 18 */ 19 20 #include "param.h" 21 #include "systm.h" 22 #include "user.h" 23 #include "kernel.h" 24 #include "mount.h" 25 #include "map.h" 26 #include "proc.h" 27 #include "vnode.h" 28 #include "seg.h" 29 #include "conf.h" 30 #include "buf.h" 31 #include "vm.h" 32 #include "cmap.h" 33 #include "text.h" 34 #include "clist.h" 35 #include "malloc.h" 36 #include "protosw.h" 37 #include "reboot.h" 38 #include "../ufs/quota.h" 39 40 #include "machine/pte.h" 41 #include "machine/reg.h" 42 #include "machine/cpu.h" 43 44 int cmask = CMASK; 45 extern int (*mountroot)(); 46 /* 47 * Initialization code. 48 * Called from cold start routine as 49 * soon as a stack and segmentation 50 * have been established. 51 * Functions: 52 * clear and free user core 53 * turn on clock 54 * hand craft 0th process 55 * call all initialization routines 56 * fork - process 0 to schedule 57 * - process 1 execute bootstrap 58 * - process 2 to page out 59 */ 60 main(firstaddr) 61 int firstaddr; 62 { 63 register int i; 64 register struct proc *p; 65 register struct pgrp *pg; 66 int s; 67 68 rqinit(); 69 #include "loop.h" 70 startup(firstaddr); 71 72 /* 73 * set up system process 0 (swapper) 74 */ 75 p = &proc[0]; 76 p->p_p0br = u.u_pcb.pcb_p0br; 77 p->p_szpt = 1; 78 p->p_addr = uaddr(p); 79 p->p_stat = SRUN; 80 p->p_flag |= SLOAD|SSYS; 81 p->p_nice = NZERO; 82 setredzone(p->p_addr, (caddr_t)&u); 83 u.u_procp = p; 84 MALLOC(pgrphash[0], struct pgrp *, sizeof (struct pgrp), 85 M_PGRP, M_NOWAIT); 86 if ((pg = pgrphash[0]) == NULL) 87 panic("no space to craft zero'th process group"); 88 pg->pg_id = 0; 89 pg->pg_hforw = 0; 90 pg->pg_mem = p; 91 pg->pg_jobc = 0; 92 p->p_pgrp = pg; 93 p->p_pgrpnxt = 0; 94 MALLOC(pg->pg_session, struct session *, sizeof (struct session), 95 M_SESSION, M_NOWAIT); 96 if (pg->pg_session == NULL) 97 panic("no space to craft zero'th session"); 98 pg->pg_session->s_count = 1; 99 pg->pg_session->s_leader = 0; 100 #ifdef KTRACE 101 p->p_tracep = NULL; 102 p->p_traceflag = 0; 103 #endif 104 /* 105 * These assume that the u. area is always mapped 106 * to the same virtual address. Otherwise must be 107 * handled when copying the u. area in newproc(). 108 */ 109 ndinit(&u.u_nd); 110 u.u_ap = u.u_arg; 111 112 u.u_cmask = cmask; 113 u.u_lastfile = -1; 114 for (i = 0; i < sizeof(u.u_rlimit)/sizeof(u.u_rlimit[0]); i++) 115 u.u_rlimit[i].rlim_cur = u.u_rlimit[i].rlim_max = 116 RLIM_INFINITY; 117 /* 118 * configure virtual memory system, 119 * set vm rlimits 120 */ 121 vminit(); 122 123 /* 124 * Initialize the file systems. 125 * 126 * Get vnodes for swapdev, argdev, and rootdev. 127 */ 128 vfsinit(); 129 if (bdevvp(swapdev, &swapdev_vp) || 130 bdevvp(argdev, &argdev_vp) || 131 bdevvp(rootdev, &rootvp)) 132 panic("can't setup bdevvp's"); 133 134 /* 135 * Setup credentials 136 */ 137 u.u_cred = crget(); 138 u.u_ngroups = 1; 139 140 #if defined(QUOTA) 141 qtinit(); 142 p->p_quota = u.u_quota = getquota(0, 0, Q_NDQ); 143 #endif 144 startrtclock(); 145 #if defined(vax) 146 #include "kg.h" 147 #if NKG > 0 148 startkgclock(); 149 #endif 150 #endif 151 152 /* 153 * Initialize tables, protocols, and set up well-known inodes. 154 */ 155 mbinit(); 156 cinit(); 157 #include "sl.h" 158 #if NSL > 0 159 slattach(); /* XXX */ 160 #endif 161 #if NLOOP > 0 162 loattach(); /* XXX */ 163 #endif 164 /* 165 * Block reception of incoming packets 166 * until protocols have been initialized. 167 */ 168 s = splimp(); 169 ifinit(); 170 domaininit(); 171 splx(s); 172 pqinit(); 173 xinit(); 174 swapinit(); 175 #ifdef GPROF 176 kmstartup(); 177 #endif 178 179 /* kick off timeout driven events by calling first time */ 180 roundrobin(); 181 schedcpu(); 182 schedpaging(); 183 184 /* set up the root file system */ 185 if ((*mountroot)()) 186 panic("cannot mount root"); 187 /* 188 * Get vnode for '/'. 189 * Setup rootdir and u.u_cdir to point to it. 190 */ 191 if (VFS_ROOT(rootfs, &rootdir)) 192 panic("cannot find root vnode"); 193 u.u_cdir = rootdir; 194 VREF(u.u_cdir); 195 VOP_UNLOCK(rootdir); 196 u.u_rdir = NULL; 197 boottime = time; 198 199 u.u_dmap = zdmap; 200 u.u_smap = zdmap; 201 202 enablertclock(); /* enable realtime clock interrupts */ 203 /* 204 * make init process 205 */ 206 207 siginit(&proc[0]); 208 proc[0].p_szpt = CLSIZE; 209 if (newproc(0)) { 210 expand(clrnd((int)btoc(szicode)), 0); 211 (void) swpexpand(u.u_dsize, (size_t)0, &u.u_dmap, &u.u_smap); 212 (void) copyout((caddr_t)icode, (caddr_t)0, (unsigned)szicode); 213 /* 214 * Return goes to loc. 0 of user init 215 * code just copied out. 216 */ 217 return; 218 } 219 /* 220 * make page-out daemon (process 2) 221 * the daemon has ctopt(nswbuf*CLSIZE*KLMAX) pages of page 222 * table so that it can map dirty pages into 223 * its address space during asychronous pushes. 224 */ 225 proc[0].p_szpt = clrnd(ctopt(nswbuf*CLSIZE*KLMAX + UPAGES)); 226 if (newproc(0)) { 227 proc[2].p_flag |= SLOAD|SSYS; 228 proc[2].p_dsize = u.u_dsize = nswbuf*CLSIZE*KLMAX; 229 pageout(); 230 /*NOTREACHED*/ 231 } 232 233 /* 234 * enter scheduling loop 235 */ 236 proc[0].p_szpt = 1; 237 sched(); 238 } 239 240 /* 241 * Initialize hash links for buffers. 242 */ 243 bhinit() 244 { 245 register int i; 246 register struct bufhd *bp; 247 248 for (bp = bufhash, i = 0; i < BUFHSZ; i++, bp++) 249 bp->b_forw = bp->b_back = (struct buf *)bp; 250 } 251 252 /* 253 * Initialize the buffer I/O system by freeing 254 * all buffers and setting all device buffer lists to empty. 255 */ 256 binit() 257 { 258 register struct buf *bp, *dp; 259 register int i; 260 int base, residual; 261 262 for (dp = bfreelist; dp < &bfreelist[BQUEUES]; dp++) { 263 dp->b_forw = dp->b_back = dp->av_forw = dp->av_back = dp; 264 dp->b_flags = B_HEAD; 265 } 266 base = bufpages / nbuf; 267 residual = bufpages % nbuf; 268 for (i = 0; i < nbuf; i++) { 269 bp = &buf[i]; 270 bp->b_dev = NODEV; 271 bp->b_bcount = 0; 272 bp->b_rcred = NOCRED; 273 bp->b_wcred = NOCRED; 274 bp->b_dirtyoff = 0; 275 bp->b_dirtyend = 0; 276 bp->b_un.b_addr = buffers + i * MAXBSIZE; 277 if (i < residual) 278 bp->b_bufsize = (base + 1) * CLBYTES; 279 else 280 bp->b_bufsize = base * CLBYTES; 281 binshash(bp, &bfreelist[BQ_AGE]); 282 bp->b_flags = B_BUSY|B_INVAL; 283 brelse(bp); 284 } 285 } 286 287 /* 288 * Set up swap devices. 289 * Initialize linked list of free swap 290 * headers. These do not actually point 291 * to buffers, but rather to pages that 292 * are being swapped in and out. 293 */ 294 swapinit() 295 { 296 register int i; 297 register struct buf *sp = swbuf; 298 struct swdevt *swp; 299 int error; 300 301 /* 302 * Count swap devices, and adjust total swap space available. 303 * Some of this space will not be available until a swapon() 304 * system is issued, usually when the system goes multi-user. 305 */ 306 nswdev = 0; 307 nswap = 0; 308 for (swp = swdevt; swp->sw_dev; swp++) { 309 nswdev++; 310 if (swp->sw_nblks > nswap) 311 nswap = swp->sw_nblks; 312 } 313 if (nswdev == 0) 314 panic("swapinit"); 315 if (nswdev > 1) 316 nswap = ((nswap + dmmax - 1) / dmmax) * dmmax; 317 nswap *= nswdev; 318 /* 319 * If there are multiple swap areas, 320 * allow more paging operations per second. 321 */ 322 if (nswdev > 1) 323 maxpgio = (maxpgio * (2 * nswdev - 1)) / 2; 324 if (bdevvp(swdevt[0].sw_dev, &swdevt[0].sw_vp)) 325 panic("swapvp"); 326 if (error = swfree(0)) { 327 printf("swfree errno %d\n", error); /* XXX */ 328 panic("swapinit swfree 0"); 329 } 330 331 /* 332 * Now set up swap buffer headers. 333 */ 334 bswlist.av_forw = sp; 335 for (i=0; i<nswbuf-1; i++, sp++) 336 sp->av_forw = sp+1; 337 sp->av_forw = NULL; 338 } 339 340 /* 341 * Initialize clist by freeing all character blocks, then count 342 * number of character devices. (Once-only routine) 343 */ 344 cinit() 345 { 346 register int ccp; 347 register struct cblock *cp; 348 349 ccp = (int)cfree; 350 ccp = (ccp+CROUND) & ~CROUND; 351 for(cp=(struct cblock *)ccp; cp < &cfree[nclist-1]; cp++) { 352 cp->c_next = cfreelist; 353 cfreelist = cp; 354 cfreecount += CBSIZE; 355 } 356 } 357