1: /*
   2:  * Copyright (c) 1982, 1986 Regents of the University of California.
   3:  * All rights reserved.  The Berkeley software License Agreement
   4:  * specifies the terms and conditions for redistribution.
   5:  *
   6:  *	@(#)init_main.c	7.1 (Berkeley) 6/5/86
   7:  */
   8: 
   9: #include "../machine/pte.h"
  10: 
  11: #include "param.h"
  12: #include "systm.h"
  13: #include "dir.h"
  14: #include "user.h"
  15: #include "kernel.h"
  16: #include "fs.h"
  17: #include "mount.h"
  18: #include "map.h"
  19: #include "proc.h"
  20: #include "inode.h"
  21: #include "seg.h"
  22: #include "conf.h"
  23: #include "buf.h"
  24: #include "vm.h"
  25: #include "cmap.h"
  26: #include "text.h"
  27: #include "clist.h"
  28: #include "protosw.h"
  29: #include "quota.h"
  30: #include "../machine/reg.h"
  31: #include "../machine/cpu.h"
  32: 
  33: int cmask = CMASK;
  34: /*
  35:  * Initialization code.
  36:  * Called from cold start routine as
  37:  * soon as a stack and segmentation
  38:  * have been established.
  39:  * Functions:
  40:  *	clear and free user core
  41:  *	turn on clock
  42:  *	hand craft 0th process
  43:  *	call all initialization routines
  44:  *	fork - process 0 to schedule
  45:  *	     - process 1 execute bootstrap
  46:  *	     - process 2 to page out
  47:  */
  48: main(firstaddr)
  49:     int firstaddr;
  50: {
  51:     register int i;
  52:     register struct proc *p;
  53:     struct fs *fs;
  54:     int s;
  55: 
  56:     rqinit();
  57: #include "loop.h"
  58:     startup(firstaddr);
  59: 
  60:     /*
  61: 	 * set up system process 0 (swapper)
  62: 	 */
  63:     p = &proc[0];
  64:     p->p_p0br = u.u_pcb.pcb_p0br;
  65:     p->p_szpt = 1;
  66:     p->p_addr = uaddr(p);
  67:     p->p_stat = SRUN;
  68:     p->p_flag |= SLOAD|SSYS;
  69:     p->p_nice = NZERO;
  70:     setredzone(p->p_addr, (caddr_t)&u);
  71:     u.u_procp = p;
  72: #ifdef vax
  73:     /*
  74: 	 * These assume that the u. area is always mapped
  75: 	 * to the same virtual address. Otherwise must be
  76: 	 * handled when copying the u. area in newproc().
  77: 	 */
  78:     u.u_nd.ni_iov = &u.u_nd.ni_iovec;
  79:     u.u_ap = u.u_arg;
  80: #endif
  81:     u.u_nd.ni_iovcnt = 1;
  82:     u.u_cmask = cmask;
  83:     u.u_lastfile = -1;
  84:     for (i = 1; i < NGROUPS; i++)
  85:         u.u_groups[i] = NOGROUP;
  86:     for (i = 0; i < sizeof(u.u_rlimit)/sizeof(u.u_rlimit[0]); i++)
  87:         u.u_rlimit[i].rlim_cur = u.u_rlimit[i].rlim_max =
  88:             RLIM_INFINITY;
  89:     /*
  90: 	 * configure virtual memory system,
  91: 	 * set vm rlimits
  92: 	 */
  93:     vminit();
  94: 
  95: #if defined(QUOTA)
  96:     qtinit();
  97:     p->p_quota = u.u_quota = getquota(0, 0, Q_NDQ);
  98: #endif
  99:     startrtclock();
 100: #include "kg.h"
 101: #if NKG > 0
 102:     startkgclock();
 103: #endif
 104: 
 105:     /*
 106: 	 * Initialize tables, protocols, and set up well-known inodes.
 107: 	 */
 108:     mbinit();
 109:     cinit();
 110: #include "sl.h"
 111: #if NSL > 0
 112:     slattach();         /* XXX */
 113: #endif
 114: #if NLOOP > 0
 115:     loattach();         /* XXX */
 116: #endif
 117:     /*
 118: 	 * Block reception of incoming packets
 119: 	 * until protocols have been initialized.
 120: 	 */
 121:     s = splimp();
 122:     ifinit();
 123:     domaininit();
 124:     splx(s);
 125:     pqinit();
 126:     xinit();
 127:     ihinit();
 128:     bhinit();
 129:     binit();
 130:     bswinit();
 131:     nchinit();
 132: #ifdef GPROF
 133:     kmstartup();
 134: #endif
 135: 
 136:     fs = mountfs(rootdev, 0, (struct inode *)0);
 137:     if (fs == 0)
 138:         panic("iinit");
 139:     bcopy("/", fs->fs_fsmnt, 2);
 140: 
 141:     inittodr(fs->fs_time);
 142:     boottime = time;
 143: 
 144: /* kick off timeout driven events by calling first time */
 145:     roundrobin();
 146:     schedcpu();
 147:     schedpaging();
 148: 
 149: /* set up the root file system */
 150:     rootdir = iget(rootdev, fs, (ino_t)ROOTINO);
 151:     iunlock(rootdir);
 152:     u.u_cdir = iget(rootdev, fs, (ino_t)ROOTINO);
 153:     iunlock(u.u_cdir);
 154:     u.u_rdir = NULL;
 155: 
 156:     u.u_dmap = zdmap;
 157:     u.u_smap = zdmap;
 158: 
 159:     /*
 160: 	 * make init process
 161: 	 */
 162: 
 163:     proc[0].p_szpt = CLSIZE;
 164:     if (newproc(0)) {
 165:         expand(clrnd((int)btoc(szicode)), 0);
 166:         (void) swpexpand(u.u_dsize, (size_t)0, &u.u_dmap, &u.u_smap);
 167:         (void) copyout((caddr_t)icode, (caddr_t)0, (unsigned)szicode);
 168:         /*
 169: 		 * Return goes to loc. 0 of user init
 170: 		 * code just copied out.
 171: 		 */
 172:         return;
 173:     }
 174:     /*
 175: 	 * make page-out daemon (process 2)
 176: 	 * the daemon has ctopt(nswbuf*CLSIZE*KLMAX) pages of page
 177: 	 * table so that it can map dirty pages into
 178: 	 * its address space during asychronous pushes.
 179: 	 */
 180:     proc[0].p_szpt = clrnd(ctopt(nswbuf*CLSIZE*KLMAX + UPAGES));
 181:     if (newproc(0)) {
 182:         proc[2].p_flag |= SLOAD|SSYS;
 183:         proc[2].p_dsize = u.u_dsize = nswbuf*CLSIZE*KLMAX;
 184:         pageout();
 185:         /*NOTREACHED*/
 186:     }
 187: 
 188:     /*
 189: 	 * enter scheduling loop
 190: 	 */
 191:     proc[0].p_szpt = 1;
 192:     sched();
 193: }
 194: 
 195: /*
 196:  * Initialize hash links for buffers.
 197:  */
 198: bhinit()
 199: {
 200:     register int i;
 201:     register struct bufhd *bp;
 202: 
 203:     for (bp = bufhash, i = 0; i < BUFHSZ; i++, bp++)
 204:         bp->b_forw = bp->b_back = (struct buf *)bp;
 205: }
 206: 
 207: /*
 208:  * Initialize the buffer I/O system by freeing
 209:  * all buffers and setting all device buffer lists to empty.
 210:  */
 211: binit()
 212: {
 213:     register struct buf *bp, *dp;
 214:     register int i;
 215:     struct swdevt *swp;
 216:     int base, residual;
 217: 
 218:     for (dp = bfreelist; dp < &bfreelist[BQUEUES]; dp++) {
 219:         dp->b_forw = dp->b_back = dp->av_forw = dp->av_back = dp;
 220:         dp->b_flags = B_HEAD;
 221:     }
 222:     base = bufpages / nbuf;
 223:     residual = bufpages % nbuf;
 224:     for (i = 0; i < nbuf; i++) {
 225:         bp = &buf[i];
 226:         bp->b_dev = NODEV;
 227:         bp->b_bcount = 0;
 228:         bp->b_un.b_addr = buffers + i * MAXBSIZE;
 229:         if (i < residual)
 230:             bp->b_bufsize = (base + 1) * CLBYTES;
 231:         else
 232:             bp->b_bufsize = base * CLBYTES;
 233:         binshash(bp, &bfreelist[BQ_AGE]);
 234:         bp->b_flags = B_BUSY|B_INVAL;
 235:         brelse(bp);
 236:     }
 237:     /*
 238: 	 * Count swap devices, and adjust total swap space available.
 239: 	 * Some of this space will not be available until a vswapon()
 240: 	 * system is issued, usually when the system goes multi-user.
 241: 	 */
 242:     nswdev = 0;
 243:     nswap = 0;
 244:     for (swp = swdevt; swp->sw_dev; swp++) {
 245:         nswdev++;
 246:         if (swp->sw_nblks > nswap)
 247:             nswap = swp->sw_nblks;
 248:     }
 249:     if (nswdev == 0)
 250:         panic("binit");
 251:     if (nswdev > 1)
 252:         nswap = ((nswap + dmmax - 1) / dmmax) * dmmax;
 253:     nswap *= nswdev;
 254:     /*
 255: 	 * If there are multiple swap areas,
 256: 	 * allow more paging operations per second.
 257: 	 */
 258:     if (nswdev > 1)
 259:         maxpgio = (maxpgio * (2 * nswdev - 1)) / 2;
 260:     swfree(0);
 261: }
 262: 
 263: /*
 264:  * Initialize linked list of free swap
 265:  * headers. These do not actually point
 266:  * to buffers, but rather to pages that
 267:  * are being swapped in and out.
 268:  */
 269: bswinit()
 270: {
 271:     register int i;
 272:     register struct buf *sp = swbuf;
 273: 
 274:     bswlist.av_forw = sp;
 275:     for (i=0; i<nswbuf-1; i++, sp++)
 276:         sp->av_forw = sp+1;
 277:     sp->av_forw = NULL;
 278: }
 279: 
 280: /*
 281:  * Initialize clist by freeing all character blocks, then count
 282:  * number of character devices. (Once-only routine)
 283:  */
 284: cinit()
 285: {
 286:     register int ccp;
 287:     register struct cblock *cp;
 288: 
 289:     ccp = (int)cfree;
 290:     ccp = (ccp+CROUND) & ~CROUND;
 291:     for(cp=(struct cblock *)ccp; cp < &cfree[nclist-1]; cp++) {
 292:         cp->c_next = cfreelist;
 293:         cfreelist = cp;
 294:         cfreecount += CBSIZE;
 295:     }
 296: }

Defined functions

bhinit defined in line 198; used 1 times
binit defined in line 211; used 1 times
bswinit defined in line 269; used 1 times
cinit defined in line 284; used 1 times
main defined in line 48; never used

Defined variables

cmask defined in line 33; used 1 times
  • in line 82
Last modified: 1986-06-05
Generated: 2016-12-26
Generated by src2html V0.67
page hit count: 1113
Valid CSS Valid XHTML 1.0 Strict