qp                136 kern/kern_synch.c 	struct slpque *qp;
qp                162 kern/kern_synch.c 	qp = &slpque[LOOKUP(ident)];
qp                163 kern/kern_synch.c 	if (qp->sq_head == 0)
qp                164 kern/kern_synch.c 		qp->sq_head = p;
qp                166 kern/kern_synch.c 		*qp->sq_tailp = p;
qp                167 kern/kern_synch.c 	*(qp->sq_tailp = &p->p_forw) = NULL;
qp                299 kern/kern_synch.c 	struct slpque *qp;
qp                303 kern/kern_synch.c 		hp = &(qp = &slpque[LOOKUP(p->p_wchan)])->sq_head;
qp                307 kern/kern_synch.c 		if (qp->sq_tailp == &p->p_forw)
qp                308 kern/kern_synch.c 			qp->sq_tailp = hp;
qp                319 kern/kern_synch.c 	struct slpque *qp;
qp                324 kern/kern_synch.c 	qp = &slpque[LOOKUP(ident)];
qp                326 kern/kern_synch.c 	for (q = &qp->sq_head; (p = *q) != NULL; ) {
qp                337 kern/kern_synch.c 			if (qp->sq_tailp == &p->p_forw)
qp                338 kern/kern_synch.c 				qp->sq_tailp = q;
qp               1434 kern/tty.c     	struct clist *qp;
qp               1477 kern/tty.c     		qp = &tp->t_rawq;
qp               1485 kern/tty.c     			if (qp->c_cc < m)
qp               1490 kern/tty.c     			if (qp->c_cc <= 0)
qp               1492 kern/tty.c     			if (qp->c_cc >= m)
qp               1499 kern/tty.c     			} else if (qp->c_cc > last_cc) {
qp               1504 kern/tty.c     			if (qp->c_cc > 0)
qp               1510 kern/tty.c     		last_cc = qp->c_cc;
qp               1514 kern/tty.c     	} else if ((qp = &tp->t_canq)->c_cc <= 0) {
qp               1556 kern/tty.c     	while ((c = getc(qp)) >= 0) {