q                  72 common/gcc-millicode/qdivrem.c 	digit *u, *v, *q;
q                  97 common/gcc-millicode/qdivrem.c 	q = &qspace[0];
q                 160 common/gcc-millicode/qdivrem.c 		q[i] = 0;
q                 161 common/gcc-millicode/qdivrem.c 	q += 4 - m;
q                 239 common/gcc-millicode/qdivrem.c 		q[j] = (digit)qhat;
q                  34 kern/include/queue.h void         *q_peek(struct queue *q);
q                  19 kern/lib/queue.c q_grow(struct queue *q, int targetsize)
q                  21 kern/lib/queue.c 	void **olddata = q->data;
q                  22 kern/lib/queue.c 	int onr = q->nextread;
q                  23 kern/lib/queue.c 	int onw = q->nextwrite;
q                  24 kern/lib/queue.c 	int osize = q->size;
q                  31 kern/lib/queue.c 	nsize = q->size;
q                  41 kern/lib/queue.c 	q->size = nsize;
q                  42 kern/lib/queue.c 	q->data = ndata;
q                  43 kern/lib/queue.c 	q->nextread = q->nextwrite = 0;
q                  46 kern/lib/queue.c 		result = q_addtail(q, olddata[i]);
q                  56 kern/lib/queue.c 	struct queue *q = kmalloc(sizeof(struct queue));
q                  57 kern/lib/queue.c 	if (q==NULL) {
q                  60 kern/lib/queue.c 	q->size = size;
q                  61 kern/lib/queue.c 	q->data = kmalloc(size * sizeof(void *));
q                  62 kern/lib/queue.c 	if (q->data==NULL) {
q                  63 kern/lib/queue.c 		kfree(q);
q                  66 kern/lib/queue.c 	q->nextread = q->nextwrite = 0;
q                  67 kern/lib/queue.c 	return q;
q                  71 kern/lib/queue.c q_preallocate(struct queue *q, int size)
q                  75 kern/lib/queue.c 	KASSERT(q->size > 0);
q                  77 kern/lib/queue.c 	if (size > q->size) {
q                  78 kern/lib/queue.c 		result = q_grow(q, size);
q                  85 kern/lib/queue.c q_empty(struct queue *q)
q                  87 kern/lib/queue.c 	return q->nextwrite == q->nextread;
q                  91 kern/lib/queue.c q_addtail(struct queue *q, void *ptr)
q                  95 kern/lib/queue.c 	KASSERT(q->size > 0);
q                  97 kern/lib/queue.c 	nextnext = (q->nextwrite+1) % q->size;
q                  98 kern/lib/queue.c 	if (nextnext==q->nextread) {
q                  99 kern/lib/queue.c 		result = q_grow(q, q->size+1);
q                 103 kern/lib/queue.c 		nextnext = (q->nextwrite+1) % q->size;
q                 105 kern/lib/queue.c 	q->data[q->nextwrite] = ptr;
q                 106 kern/lib/queue.c 	q->nextwrite = nextnext;
q                 111 kern/lib/queue.c q_remhead(struct queue *q)
q                 115 kern/lib/queue.c 	KASSERT(q->size > 0);
q                 117 kern/lib/queue.c 	KASSERT(!q_empty(q));
q                 118 kern/lib/queue.c 	ret = q->data[q->nextread];
q                 119 kern/lib/queue.c 	q->nextread = (q->nextread+1)%q->size;
q                 124 kern/lib/queue.c q_destroy(struct queue *q)
q                 126 kern/lib/queue.c 	KASSERT(q_empty(q));
q                 127 kern/lib/queue.c 	kfree(q->data);
q                 128 kern/lib/queue.c 	kfree(q);
q                 133 kern/lib/queue.c q_getstart(struct queue *q)
q                 135 kern/lib/queue.c 	return q->nextread;
q                 139 kern/lib/queue.c q_getend(struct queue *q)
q                 141 kern/lib/queue.c 	return q->nextwrite;
q                 145 kern/lib/queue.c q_getsize(struct queue *q)
q                 147 kern/lib/queue.c 	return q->size;
q                 151 kern/lib/queue.c q_getguy(struct queue *q, int index)
q                 156 kern/lib/queue.c 	KASSERT(index>=0 && index<q->size);
q                 157 kern/lib/queue.c 	return q->data[index];
q                 161 kern/lib/queue.c q_peek(struct queue *q)
q                 165 kern/lib/queue.c 	KASSERT(q);
q                 166 kern/lib/queue.c 	KASSERT(q->size > 0);
q                 168 kern/lib/queue.c 	if (q_empty(q)) {
q                 171 kern/lib/queue.c 	  ret = q->data[q->nextread];