| plan 9 kernel history: overview | file list | diff list |
1990/0614/port/sysproc.c (diff list | history)
| 1990/0614/sys/src/9/port/sysproc.c:1,522 – 1990/0619/sys/src/9/port/sysproc.c:1,520 (short | long | prev | next) | ||
| 1990/0227 | #include "u.h" #include "lib.h" #include "mem.h" #include "dat.h" #include "fns.h" #include "ureg.h" #include "errno.h" | |
| 1990/0330 | #include <a.out.h> | |
| 1990/0227 | int shargs(char*, int, char**); long sysr1(ulong *arg) { print("[%d] r1 = %d\n", u->p->pid, arg[0]); return 0; } long sysfork(ulong *arg) { Proc *p; Seg *s; Page *np, *op; ulong usp, upa, pid; Chan *c; Orig *o; | |
| 1990/0614 | KMap *k; | |
| 1990/0227 | int n, on, i; int lastvar; /* used to compute stack address */ /* * Kernel stack */ p = newproc(); p->upage = newpage(1, 0, USERADDR|(p->pid&0xFFFF)); | |
| 1990/0614 | k = kmap(p->upage); upa = VA(k); | |
| 1990/0227 | /* * Save time: only copy u-> data and useful stack */ memcpy((void*)upa, u, sizeof(User)); n = USERADDR+BY2PG - (ulong)&lastvar; n = (n+32) & ~(BY2WD-1); /* be safe & word align */ | |
| 1990/0614 | memcpy((void*)(upa+BY2PG-n), (void*)(USERADDR+BY2PG-n), n); | |
| 1990/0227 | ((User *)upa)->p = p; | |
| 1990/0614 | kunmap(k); | |
| 1990/0227 | /* * User stack */ p->seg[SSEG] = u->p->seg[SSEG]; s = &p->seg[SSEG]; s->proc = p; on = (s->maxva-s->minva)>>PGSHIFT; | |
| 1990/0614 | usp = ((Ureg*)UREGADDR)->usp; | |
| 1990/0227 | if(usp >= USTKTOP) panic("fork bad usp %lux", usp); if(usp < u->p->seg[SSEG].minva) s->minva = u->p->seg[SSEG].minva; else s->minva = usp & ~(BY2PG-1); usp = s->minva & (BY2PG-1); /* just low bits */ s->maxva = USTKTOP; n = (s->maxva-s->minva)>>PGSHIFT; s->o = neworig(s->minva, n, OWRPERM, 0); lock(s->o); /* * Only part of last stack page */ for(i=0; i<n; i++){ op = u->p->seg[SSEG].o->pte[i+(on-n)].page; if(op){ np = newpage(1, s->o, op->va); | |
| 1990/0614 | k = kmap(np); | |
| 1990/0227 | p->seg[SSEG].o->pte[i].page = np; if(i == 0){ /* only part of last stack page */ | |
| 1990/0614 | memset((void*)VA(k), 0, usp); memcpy((void*)(VA(k)+usp), (void*)(op->va+usp), BY2PG-usp); | |
| 1990/0227 | }else /* all of higher pages */ | |
| 1990/0614 | memcpy((void*)VA(k), (void*)op->va, BY2PG); kunmap(k); | |
| 1990/0227 | } } unlock(s->o); /* * Duplicate segments */ for(s=&u->p->seg[0], n=0; n<NSEG; n++, s++){ if(n == SSEG) /* already done */ continue; if(s->o == 0) continue; p->seg[n] = *s; p->seg[n].proc = p; o = s->o; lock(o); o->nproc++; if(s->mod) forkmod(s, &p->seg[n], p); unlock(o); } /* * Refs */ incref(u->dot); for(n=0; n<=u->maxfd; n++) if(c = u->fd[n]) /* assign = */ incref(c); /* | |
| 1990/03081 | * Committed. Link into hierarchy */ lock(&p->kidlock); lock(&u->p->kidlock); if(u->p->kid == 0){ p->sib = p; u->p->kid = p; }else{ p->sib = u->p->kid->sib; u->p->kid->sib = p; } unlock(&u->p->kidlock); unlock(&p->kidlock); /* | |
| 1990/0227 | * Sched */ if(setlabel(&p->sched)){ u->p = p; p->state = Running; p->mach = m; m->proc = p; spllo(); return 0; } | |
| 1990/03081 | p->pop = u->p; | |
| 1990/0227 | p->parent = u->p; p->parentpid = u->p->pid; p->pgrp = u->p->pgrp; incref(p->pgrp); | |
| 1990/0324 | u->p->nchild++; | |
| 1990/0227 | pid = p->pid; memset(p->time, 0, sizeof(p->time)); p->time[TReal] = MACHP(0)->ticks; memcpy(p->text, u->p->text, NAMELEN); ready(p); flushmmu(); return pid; } long sysexec(ulong *arg) { Proc *p; Seg *s; ulong l, t, d, b, v; int i; Chan *tc; Orig *o; char **argv, **argp; char *a, *charp, *file; char *progarg[sizeof(Exec)/2+1], elem[NAMELEN]; ulong ssize, spage, nargs, nbytes, n; ulong *sp; int indir; Exec exec; char line[sizeof(Exec)]; p = u->p; validaddr(arg[0], 1, 0); file = (char*)arg[0]; indir = 0; Header: tc = namec(file, Aopen, OEXEC, 0); if(waserror()){ close(tc); nexterror(); } if(!indir) strcpy(elem, u->elem); n = (*devtab[tc->type].read)(tc, &exec, sizeof(Exec)); if(n < 2) Err: error(0, Ebadexec); if(n==sizeof(Exec) && exec.magic==V_MAGIC){ if((exec.text&KZERO) || (ulong)exec.entry < UTZERO+sizeof(Exec) || (ulong)exec.entry >= UTZERO+sizeof(Exec)+exec.text) goto Err; goto Binary; } /* * Process #! /bin/sh args ... */ memcpy(line, &exec, sizeof(Exec)); if(indir || line[0]!='#' || line[1]!='!') goto Err; n = shargs(line, n, progarg); if(n == 0) goto Err; indir = 1; /* * First arg becomes complete file name */ progarg[n++] = file; progarg[n] = 0; validaddr(arg[1], BY2WD, 1); arg[1] += BY2WD; file = progarg[0]; progarg[0] = elem; close(tc); poperror(); goto Header; Binary: t = (UTZERO+sizeof(Exec)+exec.text+(BY2PG-1)) & ~(BY2PG-1); /* * Last partial page of data goes into BSS. */ d = (t + exec.data) & ~(BY2PG-1); b = (t + exec.data + exec.bss + (BY2PG-1)) & ~(BY2PG-1); if((t|d|b) & KZERO) error(0, Ebadexec); /* * Args: pass 1: count */ nbytes = 0; nargs = 0; if(indir){ argp = progarg; while(*argp){ a = *argp++; nbytes += strlen(a) + 1; nargs++; } } evenaddr(arg[1]); argp = (char**)arg[1]; validaddr((ulong)argp, BY2WD, 0); while(*argp){ a = *argp++; if(((ulong)argp&(BY2PG-1)) < BY2WD) validaddr((ulong)argp, BY2WD, 0); validaddr((ulong)a, 1, 0); nbytes += (vmemchr(a, 0, 0xFFFFFFFF) - a) + 1; nargs++; } ssize = BY2WD*(nargs+1) + ((nbytes+(BY2WD-1)) & ~(BY2WD-1)); spage = (ssize+(BY2PG-1)) >> PGSHIFT; /* * Build the stack segment, putting it in kernel virtual for the moment */ s = &p->seg[ESEG]; s->proc = p; s->o = neworig(TSTKTOP-(spage<<PGSHIFT), spage, OWRPERM, 0); s->minva = s->o->va; s->maxva = TSTKTOP; /* * Args: pass 2: assemble; the pages will be faulted in */ argv = (char**)(TSTKTOP - ssize); charp = (char*)(TSTKTOP - nbytes); if(indir) argp = progarg; else argp = (char**)arg[1]; for(i=0; i<nargs; i++){ if(indir && *argp==0){ indir = 0; argp = (char**)arg[1]; } *argv++ = charp + (USTKTOP-TSTKTOP); n = strlen(*argp) + 1; memcpy(charp, *argp++, n); charp += n; } memcpy(p->text, elem, NAMELEN); /* * Committed. Free old memory */ freesegs(ESEG); /* * Text. Shared. */ s = &p->seg[TSEG]; s->proc = p; o = lookorig(UTZERO, (t-UTZERO)>>PGSHIFT, OCACHED, tc); if(o == 0){ o = neworig(UTZERO, (t-UTZERO)>>PGSHIFT, OCACHED, tc); o->minca = 0; o->maxca = sizeof(Exec)+exec.text; } s->o = o; s->minva = UTZERO; s->maxva = t; s->mod = 0; /* * Data. Shared. */ s = &p->seg[DSEG]; s->proc = p; o = lookorig(t, (d-t)>>PGSHIFT, OWRPERM|OPURE|OCACHED, tc); if(o == 0){ o = neworig(t, (d-t)>>PGSHIFT, OWRPERM|OPURE|OCACHED, tc); o->minca = p->seg[TSEG].o->maxca; o->maxca = o->minca + (exec.data & ~(BY2PG-1)); } s->o = o; s->minva = t; s->maxva = d; s->mod = 0; /* * BSS. Created afresh, starting with last page of data. * BUG: should pick up the last page of data, which should be cached in the * data segment. */ s = &p->seg[BSEG]; s->proc = p; o = neworig(d, (b-d)>>PGSHIFT, OWRPERM, tc); o->minca = p->seg[DSEG].o->maxca; o->maxca = o->minca + (exec.data & (BY2PG-1)); s->o = o; s->minva = d; s->maxva = b; s->mod = 0; close(tc); /* * Move the stack */ s = &p->seg[SSEG]; *s = p->seg[ESEG]; p->seg[ESEG].o = 0; o = s->o; o->va += (USTKTOP-TSTKTOP); s->minva = o->va; s->maxva = USTKTOP; lock(o); for(i=0; i<o->npte; i++) o->pte[i].page->va += (USTKTOP-TSTKTOP); unlock(o); flushmmu(); ((Ureg*)UREGADDR)->pc = exec.entry - 4; sp = (ulong*)(USTKTOP - ssize); *--sp = nargs; | |
| 1990/0614 | ((Ureg*)UREGADDR)->usp = (ulong)sp; | |
| 1990/0227 | lock(&p->debug); u->nnote = 0; u->notify = 0; u->notified = 0; unlock(&p->debug); return 0; } int shargs(char *s, int n, char **ap) { int i; s += 2, n -= 2; /* skip #! */ for(i=0; s[i]!='\n'; i++) if(i == n-1) return 0; s[i] = 0; *ap = 0; i = 0; for(;;){ while(*s==' ' || *s=='\t') s++; if(*s == 0) break; i++; *ap++ = s; *ap = 0; while(*s && *s!=' ' && *s!='\t') s++; if(*s == 0) break; else *s++ = 0; } return i; } int return0(void *a) { return 0; } long syssleep(ulong *arg) { | |