53 	struct dn_queue q;		/* Standard queue */  member
76 rr_append(struct rr_queue *q, struct rr_si *si)  in rr_append()  argument
78 	q->status = 1;		/* mark as in-rr_list */  in rr_append()
79 	q->credit = q->quantum;	/* initialize credit */  in rr_append()
83 		si->head = q;  in rr_append()
85 		si->tail->qnext = q;  in rr_append()
86 	si->tail = q;		/* advance the tail pointer */  in rr_append()
87 	q->qnext = si->head;	/* make it circular */  in rr_append()
111 remove_queue_q(struct rr_queue *q, struct rr_si *si)  in remove_queue_q()  argument
115 	if (q->status != 1)  in remove_queue_q()
117 	if (q == si->head) {  in remove_queue_q()
123 		if (prev->qnext != q)  in remove_queue_q()
125 		prev->qnext = q->qnext;  in remove_queue_q()
126 		if (q == si->tail)  in remove_queue_q()
128 		q->status = 0;  in remove_queue_q()
145 rr_enqueue(struct dn_sch_inst *_si, struct dn_queue *q, struct mbuf *m)  in rr_enqueue()  argument
150 	if (m != q->mq.head) {  in rr_enqueue()
151 		if (dn_enqueue(q, m, 0)) /* packet was dropped */  in rr_enqueue()
153 		if (m != q->mq.head)  in rr_enqueue()
159 	rrq = (struct rr_queue *)q;  in rr_enqueue()
179 		struct mbuf *m = rrq->q.mq.head;  in rr_dequeue()
194 			return dn_dequeue(&rrq->q);  in rr_dequeue()
250 	struct rr_queue *q = (struct rr_queue *)_q;  in rr_new_queue()  local
254 	q->quantum = _q->fs->fs.par[0] * _q->fs->fs.par[1];  in rr_new_queue()
255 	ND("called, q->quantum %d", q->quantum);  in rr_new_queue()
256 	q->credit = q->quantum;  in rr_new_queue()
257 	q->status = 0;  in rr_new_queue()
261 		rr_append(q, (struct rr_si *)(_q->_si + 1));  in rr_new_queue()
269 	struct rr_queue *q = (struct rr_queue *)_q;  in rr_free_queue()  local
272 	if (q->status == 1) {  in rr_free_queue()
274 		remove_queue_q(q, si);  in rr_free_queue()