j->next = (job*) NULL;
j->next = NULL;
job_add(entry *e, user *u) {	job *j;	/* if already on queue, keep going */	for (j = jhead; j != NULL; j = j->next)		if (j->e == e && j->u == u)			return;	/* build a job queue element */	if ((j = (job*)malloc(sizeof(job))) == NULL)		return;	j->next = (job*) NULL;	j->e = e;	j->u = u;	/* add it to the tail */	if (jhead == NULL)		jhead = j;	else		jtail->next = j;	jtail = j;}