Lines Matching refs:q
55 struct pktq_prec *q; in BCMFASTPATH() local
67 q = &pq->q[prec]; in BCMFASTPATH()
69 if (q->head) in BCMFASTPATH()
70 PKTSETLINK(q->tail, p); in BCMFASTPATH()
72 q->head = p; in BCMFASTPATH()
74 q->tail = p; in BCMFASTPATH()
75 q->n_pkts++; in BCMFASTPATH()
103 dq = &dspq->q; in BCMFASTPATH()
104 sq = &sspq->q; in BCMFASTPATH()
133 struct pktq_prec *q; in BCMFASTPATH() local
143 q = &spq->q; in BCMFASTPATH()
145 if (q->head) in BCMFASTPATH()
146 PKTSETLINK(q->tail, p); in BCMFASTPATH()
148 q->head = p; in BCMFASTPATH()
150 q->tail = p; in BCMFASTPATH()
151 q->n_pkts++; in BCMFASTPATH()
163 struct pktq_prec *q; in BCMPOSTTRAPFASTPATH() local
175 q = &pq->q[prec]; in BCMPOSTTRAPFASTPATH()
177 if (q->head == NULL) in BCMPOSTTRAPFASTPATH()
178 q->tail = p; in BCMPOSTTRAPFASTPATH()
180 PKTSETLINK(p, q->head); in BCMPOSTTRAPFASTPATH()
181 q->head = p; in BCMPOSTTRAPFASTPATH()
182 q->n_pkts++; in BCMPOSTTRAPFASTPATH()
199 struct pktq_prec *q; in BCMFASTPATH() local
209 q = &spq->q; in BCMFASTPATH()
211 if (q->head == NULL) in BCMFASTPATH()
212 q->tail = p; in BCMFASTPATH()
214 PKTSETLINK(p, q->head); in BCMFASTPATH()
215 q->head = p; in BCMFASTPATH()
216 q->n_pkts++; in BCMFASTPATH()
228 struct pktq_prec *q; in BCMFASTPATH() local
237 q = &pq->q[prec]; in BCMFASTPATH()
239 if ((p = q->head) == NULL) in BCMFASTPATH()
242 if ((q->head = PKTLINK(p)) == NULL) in BCMFASTPATH()
243 q->tail = NULL; in BCMFASTPATH()
245 q->n_pkts--; in BCMFASTPATH()
250 q->dequeue_count++; in BCMFASTPATH()
266 struct pktq_prec *q; in BCMFASTPATH() local
273 q = &spq->q; in BCMFASTPATH()
275 if ((p = q->head) == NULL) in BCMFASTPATH()
278 if ((q->head = PKTLINK(p)) == NULL) in BCMFASTPATH()
279 q->tail = NULL; in BCMFASTPATH()
281 q->n_pkts--; in BCMFASTPATH()
284 q->dequeue_count++; in BCMFASTPATH()
300 struct pktq_prec *q; in BCMFASTPATH() local
307 q = &spq->q; in BCMFASTPATH()
309 if ((p = q->head) == NULL) in BCMFASTPATH()
314 if ((q->head = (void*)PKTLINK(p)) == NULL) in BCMFASTPATH()
315 q->tail = NULL; in BCMFASTPATH()
317 q->n_pkts--; in BCMFASTPATH()
320 q->dequeue_count++; in BCMFASTPATH()
336 struct pktq_prec *q; in BCMFASTPATH() local
345 q = &pq->q[prec]; in BCMFASTPATH()
347 if ((p = q->head) == NULL) in BCMFASTPATH()
350 for (prev = NULL; p != q->tail; p = PKTLINK(p)) in BCMFASTPATH()
356 q->head = NULL; in BCMFASTPATH()
358 q->tail = prev; in BCMFASTPATH()
359 q->n_pkts--; in BCMFASTPATH()
364 q->dequeue_count++; in BCMFASTPATH()
377 struct pktq_prec *q; in BCMFASTPATH() local
384 q = &spq->q; in BCMFASTPATH()
386 if ((p = q->head) == NULL) in BCMFASTPATH()
389 for (prev = NULL; p != q->tail; p = PKTLINK(p)) in BCMFASTPATH()
395 q->head = NULL; in BCMFASTPATH()
397 q->tail = prev; in BCMFASTPATH()
398 q->n_pkts--; in BCMFASTPATH()
401 q->dequeue_count++; in BCMFASTPATH()
425 if (pq->q[prec].head) in pktq_peek_tail()
431 p = pq->q[prec].tail; in pktq_peek_tail()
447 struct pktq_prec *q; in BCMFASTPATH() local
454 list_q = &list->q; in BCMFASTPATH()
466 q = &pq->q[prec]; in BCMFASTPATH()
468 if (q->head) in BCMFASTPATH()
469 PKTSETLINK(q->tail, list_q->head); in BCMFASTPATH()
471 q->head = list_q->head; in BCMFASTPATH()
473 q->tail = list_q->tail; in BCMFASTPATH()
474 q->n_pkts += list_q->n_pkts; in BCMFASTPATH()
500 struct pktq_prec *q; in BCMFASTPATH() local
507 list_q = &list->q; in BCMFASTPATH()
517 q = &spq->q; in BCMFASTPATH()
519 if (q->head) in BCMFASTPATH()
520 PKTSETLINK(q->tail, list_q->head); in BCMFASTPATH()
522 q->head = list_q->head; in BCMFASTPATH()
524 q->tail = list_q->tail; in BCMFASTPATH()
525 q->n_pkts += list_q->n_pkts; in BCMFASTPATH()
547 struct pktq_prec *q; in BCMFASTPATH() local
554 list_q = &list->q; in BCMFASTPATH()
566 q = &pq->q[prec]; in BCMFASTPATH()
569 PKTSETLINK(list_q->tail, q->head); in BCMFASTPATH()
571 q->head = list_q->head; in BCMFASTPATH()
576 if (q->tail == NULL) { in BCMFASTPATH()
577 q->tail = list_q->tail; in BCMFASTPATH()
580 q->n_pkts += list_q->n_pkts; in BCMFASTPATH()
606 struct pktq_prec *q; in BCMFASTPATH() local
613 list_q = &list->q; in BCMFASTPATH()
623 q = &spq->q; in BCMFASTPATH()
626 PKTSETLINK(list_q->tail, q->head); in BCMFASTPATH()
628 q->head = list_q->head; in BCMFASTPATH()
633 if (q->tail == NULL) { in BCMFASTPATH()
634 q->tail = list_q->tail; in BCMFASTPATH()
637 q->n_pkts += list_q->n_pkts; in BCMFASTPATH()
656 struct pktq_prec *q; in BCMFASTPATH() local
665 q = &pq->q[prec]; in BCMFASTPATH()
673 q->n_pkts--; in BCMFASTPATH()
678 q->dequeue_count++; in BCMFASTPATH()
694 struct pktq_prec *q; in BCMFASTPATH() local
703 q = &pq->q[prec]; in BCMFASTPATH()
704 p = q->head; in BCMFASTPATH()
718 if ((q->head = PKTLINK(p)) == NULL) { in BCMFASTPATH()
719 q->tail = NULL; in BCMFASTPATH()
723 if (q->tail == p) { in BCMFASTPATH()
724 q->tail = prev; in BCMFASTPATH()
728 q->n_pkts--; in BCMFASTPATH()
733 q->dequeue_count++; in BCMFASTPATH()
749 struct pktq_prec *q; in BCMFASTPATH() local
762 q = &pq->q[prec]; in BCMFASTPATH()
764 if (q->head == pktbuf) { in BCMFASTPATH()
765 if ((q->head = PKTLINK(pktbuf)) == NULL) in BCMFASTPATH()
766 q->tail = NULL; in BCMFASTPATH()
768 for (p = q->head; p && PKTLINK(p) != pktbuf; p = PKTLINK(p)) in BCMFASTPATH()
774 if (q->tail == pktbuf) in BCMFASTPATH()
775 q->tail = p; in BCMFASTPATH()
778 q->n_pkts--; in BCMFASTPATH()
782 q->dequeue_count++; in BCMFASTPATH()
801 struct pktq_prec *q; in _pktq_pfilter() local
809 q = &pq->q[prec]; in _pktq_pfilter()
811 wq = *q; in _pktq_pfilter()
813 q->head = NULL; in _pktq_pfilter()
814 q->tail = NULL; in _pktq_pfilter()
815 q->n_pkts = 0; in _pktq_pfilter()
818 q->dequeue_count += wq.n_pkts; in _pktq_pfilter()
913 struct pktq_prec *q; in spktq_filter() local
920 q = &spq->q; in spktq_filter()
923 if (q->n_pkts == 0) { in spktq_filter()
928 wq = *q; in spktq_filter()
930 q->head = NULL; in spktq_filter()
931 q->tail = NULL; in spktq_filter()
932 q->n_pkts = 0; in spktq_filter()
935 q->dequeue_count += wq.n_pkts; in spktq_filter()
992 bzero(pq, OFFSETOF(struct pktq, q) + (sizeof(struct pktq_prec) * num_prec)); in pktq_init()
1002 pq->q[prec].max_pkts = pq->max_pkts; in pktq_init()
1015 spq->q.max_pkts = (uint16)max_pkts; in spktq_init()
1028 spq->q.head = head; in spktq_init_list()
1029 spq->q.tail = tail; in spktq_init_list()
1030 spq->q.max_pkts = (uint16)max_pkts; in spktq_init_list()
1031 spq->q.n_pkts = n_pkts; in spktq_init_list()
1032 spq->q.stall_count = 0; in spktq_init_list()
1033 spq->q.dequeue_count = 0; in spktq_init_list()
1068 pq->q[prec].max_pkts = (uint16)max_pkts; in pktq_set_max_plen()
1078 struct pktq_prec *q; in BCMFASTPATH() local
1089 while ((prec = pq->hi_prec) > 0 && pq->q[prec].head == NULL) in BCMFASTPATH()
1092 q = &pq->q[prec]; in BCMFASTPATH()
1094 if ((p = q->head) == NULL) in BCMFASTPATH()
1097 if ((q->head = PKTLINK(p)) == NULL) in BCMFASTPATH()
1098 q->tail = NULL; in BCMFASTPATH()
1100 q->n_pkts--; in BCMFASTPATH()
1105 q->dequeue_count++; in BCMFASTPATH()
1124 struct pktq_prec *q; in BCMFASTPATH() local
1136 if (pq->q[prec].head) in BCMFASTPATH()
1139 q = &pq->q[prec]; in BCMFASTPATH()
1141 if ((p = q->head) == NULL) in BCMFASTPATH()
1144 for (prev = NULL; p != q->tail; p = PKTLINK(p)) in BCMFASTPATH()
1150 q->head = NULL; in BCMFASTPATH()
1152 q->tail = prev; in BCMFASTPATH()
1153 q->n_pkts--; in BCMFASTPATH()
1158 q->dequeue_count++; in BCMFASTPATH()
1187 while ((prec = pq->hi_prec) > 0 && pq->q[prec].head == NULL) in pktq_peek()
1193 p = pq->q[prec].head; in pktq_peek()
1212 if (spq->q.n_pkts == 0) in spktq_peek()
1215 p = spq->q.head; in spktq_peek()
1332 len += pq->q[prec].n_pkts; in pktq_mlen()
1345 struct pktq_prec *q; in BCMFASTPATH() local
1356 while ((prec = pq->hi_prec) > 0 && pq->q[prec].head == NULL) in BCMFASTPATH()
1359 while ((prec_bmp & (1 << prec)) == 0 || pq->q[prec].head == NULL) in BCMFASTPATH()
1363 q = &pq->q[prec]; in BCMFASTPATH()
1365 if ((p = q->head) == NULL) in BCMFASTPATH()
1382 struct pktq_prec *q; in BCMPOSTTRAPFASTPATH() local
1393 while ((prec = pq->hi_prec) > 0 && pq->q[prec].head == NULL) in BCMPOSTTRAPFASTPATH()
1396 while ((pq->q[prec].head == NULL) || ((prec_bmp & (1 << prec)) == 0)) in BCMPOSTTRAPFASTPATH()
1400 q = &pq->q[prec]; in BCMPOSTTRAPFASTPATH()
1402 if ((p = q->head) == NULL) in BCMPOSTTRAPFASTPATH()
1405 if ((q->head = PKTLINK(p)) == NULL) in BCMPOSTTRAPFASTPATH()
1406 q->tail = NULL; in BCMPOSTTRAPFASTPATH()
1408 q->n_pkts--; in BCMPOSTTRAPFASTPATH()
1411 if (q->n_pkts == 0) { in BCMPOSTTRAPFASTPATH()
1412 q->head = NULL; in BCMPOSTTRAPFASTPATH()
1413 q->tail = NULL; in BCMPOSTTRAPFASTPATH()
1417 q->dequeue_count++; in BCMPOSTTRAPFASTPATH()
1447 ret = pq->q[prec].max_pkts - pq->q[prec].n_pkts; in pktqprec_avail_pkts()
1467 ret = pq->q[prec].n_pkts >= pq->q[prec].max_pkts; in BCMFASTPATH()
1503 ret = spq->q.max_pkts - spq->q.n_pkts; in spktq_avail()
1539 ret = spq->q.n_pkts >= spq->q.max_pkts; in spktq_full()