plan 9 kernel history: overview | file list | diff list

1992/1008/port/pgrp.c (diff list | history)

1992/1008/sys/src/9/port/pgrp.c:1,2341992/1209/sys/src/9/port/pgrp.c:1,234 (short | long | prev | next)
1990/0227    
#include	"u.h" 
1992/0321    
#include	"../port/lib.h" 
1990/0227    
#include	"mem.h" 
#include	"dat.h" 
#include	"fns.h" 
1992/0111    
#include	"../port/error.h" 
1990/0227    
 
1992/0619    
static Ref pgrpid; 
static Ref mountid; 
1990/0227    
 
1992/0824    
struct 
{ 
	Lock; 
	Crypt	*free; 
} cryptalloc; 
 
/* 
 * crypt entries are allocated from a pool rather than allocated using malloc so 
 * the memory can be protected from reading by devproc. The base and top of the 
 * crypt arena is stored in palloc for devproc. 
 */ 
Crypt* 
newcrypt(void) 
{ 
	Crypt *c; 
 
	lock(&cryptalloc); 
	if(cryptalloc.free) { 
		c = cryptalloc.free; 
		cryptalloc.free = c->next; 
		unlock(&cryptalloc); 
		return c; 
	} 
 
1992/1008    
	cryptalloc.free = xalloc(sizeof(Crypt)*conf.nproc); 
1992/0824    
	if(cryptalloc.free == 0) 
		panic("newcrypt"); 
 
1992/1008    
	for(c = cryptalloc.free; c < cryptalloc.free+conf.nproc-1; c++) 
1992/0824    
		c->next = c+1; 
 
	palloc.cmembase = (ulong)cryptalloc.free; 
1992/1008    
	palloc.cmemtop = palloc.cmembase+(sizeof(Crypt)*conf.nproc); 
1992/0824    
	unlock(&cryptalloc); 
	return newcrypt(); 
} 
 
1990/0227    
void 
1992/0824    
freecrypt(Crypt *c) 
{ 
	lock(&cryptalloc); 
	c->next = cryptalloc.free; 
	cryptalloc.free = c; 
	unlock(&cryptalloc); 
} 
 
void 
1992/0428    
pgrpnote(ulong noteid, char *a, long n, int flag) 
1990/1110    
{ 
1992/0428    
	Proc *p, *ep; 
1990/1110    
	char buf[ERRLEN]; 
 
	if(n >= ERRLEN-1) 
1990/11211    
		error(Etoobig); 
1992/0428    
 
1991/0318    
	memmove(buf, a, n); 
1990/1110    
	buf[n] = 0; 
	p = proctab(0); 
1992/0428    
	ep = p+conf.nproc; 
	for(; p < ep; p++) { 
		if(p->state == Dead) 
			continue; 
		if(p->noteid == noteid && p->kp == 0) { 
1991/1216    
			qlock(&p->debug); 
1992/0824    
			if(p->pid == 0 || p->noteid != noteid){ 
1991/1216    
				qunlock(&p->debug); 
1990/1110    
				continue; 
			} 
1992/0824    
			if(!waserror()) { 
1991/0125    
				postnote(p, 0, buf, flag); 
				poperror(); 
1990/1110    
			} 
1991/1216    
			qunlock(&p->debug); 
1990/1110    
		} 
	} 
} 
 
Pgrp* 
1990/0227    
newpgrp(void) 
{ 
	Pgrp *p; 
 
1992/0824    
	p = smalloc(sizeof(Pgrp)); 
1992/0619    
	p->ref = 1; 
1992/0824    
	p->crypt = newcrypt(); 
1992/0619    
	p->pgrpid = incref(&pgrpid); 
	return p; 
1991/0705    
} 
 
void 
1990/0227    
closepgrp(Pgrp *p) 
{ 
1991/1011    
	Mhead **h, **e, *f, *next; 
	 
1990/0227    
	if(decref(p) == 0){ 
1991/0212    
		qlock(&p->debug); 
1990/1110    
		p->pgrpid = -1; 
1991/1011    
 
		e = &p->mnthash[MNTHASH]; 
		for(h = p->mnthash; h < e; h++) { 
			for(f = *h; f; f = next) { 
				close(f->from); 
				mountfree(f->mount); 
				next = f->hash; 
1992/0619    
				free(f); 
1990/0227    
			} 
1991/1011    
		} 
1991/0212    
		qunlock(&p->debug); 
1992/0824    
		freecrypt(p->crypt); 
1992/0619    
		free(p); 
1990/0227    
	} 
} 
 
1991/0705    
void 
1991/0514    
pgrpcpy(Pgrp *to, Pgrp *from) 
{ 
1991/1113    
	Mhead **h, **e, *f, **tom, **l, *mh; 
1991/1011    
	Mount *n, *m, **link; 
1991/0514    
 
1991/1011    
	rlock(&from->ns); 
 
1991/1127    
	*to->crypt = *from->crypt; 
1991/1011    
	e = &from->mnthash[MNTHASH]; 
1991/1113    
	tom = to->mnthash; 
1991/1011    
	for(h = from->mnthash; h < e; h++) { 
1991/1113    
		l = tom++; 
1991/1011    
		for(f = *h; f; f = f->hash) { 
1992/0619    
			mh = smalloc(sizeof(Mhead)); 
1991/1011    
			mh->from = f->from; 
			incref(mh->from); 
			*l = mh; 
1991/1113    
			l = &mh->hash; 
1991/1011    
			link = &mh->mount; 
			for(m = f->mount; m; m = m->next) { 
				n = newmount(mh, m->to); 
				*link = n; 
				link = &n->next;	 
			} 
1991/0514    
		} 
1991/1011    
	} 
	runlock(&from->ns); 
} 
1991/0514    
 
1992/0824    
Fgrp* 
dupfgrp(Fgrp *f) 
{ 
	Fgrp *new; 
	Chan *c; 
	int i; 
 
	new = smalloc(sizeof(Fgrp)); 
	new->ref = 1; 
 
	lock(f); 
	new->maxfd = f->maxfd; 
	for(i = 0; i <= f->maxfd; i++) { 
		if(c = f->fd[i]){ 
			incref(c); 
			new->fd[i] = c; 
		} 
	} 
	unlock(f); 
 
	return new; 
} 
 
1991/1011    
void 
1992/0824    
closefgrp(Fgrp *f) 
{ 
	int i; 
	Chan *c; 
 
	if(decref(f) == 0) { 
		for(i = 0; i <= f->maxfd; i++) 
			if(c = f->fd[i]) 
				close(c); 
 
		free(f); 
	} 
} 
 
 
Mount* 
newmount(Mhead *mh, Chan *to) 
{ 
	Mount *m; 
 
	m = smalloc(sizeof(Mount)); 
	m->to = to; 
	m->head = mh; 
	incref(to); 
	m->mountid = incref(&mountid); 
	return m; 
} 
 
void 
1991/1011    
mountfree(Mount *m) 
{ 
	Mount *f; 
 
1992/0705    
	while(m) { 
		f = m->next; 
		close(m->to); 
		free(m); 
		m = f; 
	} 
1992/0824    
} 
 
void 
resrcwait(char *reason) 
{ 
	char *p; 
 
	p = u->p->psstate; 
	if(reason) { 
		u->p->psstate = reason; 
		print("%s\n", reason); 
	} 
	if(u == 0) 
		panic("resrcwait"); 
 
	tsleep(&u->p->sleep, return0, 0, 1000); 
1992/1209    
	tsleep(&u->p->sleep, return0, 0, 300); 
1992/0824    
	u->p->psstate = p; 
1990/0227    
} 


source code copyright © 1990-2005 Lucent Technologies; see license
Plan 9 distribution
comments to russ cox (rsc@swtch.com)