Lines Matching defs:qs
109 struct sk_buff_head qs[SFQ_DEPTH]; /* Slot queue */
207 int d = q->qs[x].qlen + SFQ_DEPTH;
225 if (n == p && q->max_depth == q->qs[x].qlen + 1)
240 d = q->qs[x].qlen;
259 skb = q->qs[x].prev;
261 __skb_unlink(skb, &q->qs[x]);
275 skb = q->qs[d].prev;
277 __skb_unlink(skb, &q->qs[d]);
317 if (q->qs[x].qlen >= q->limit)
321 __skb_queue_tail(&q->qs[x], skb);
323 if (q->qs[x].qlen == 1) { /* The flow is new */
355 return skb_peek(&q->qs[a]);
372 skb = __skb_dequeue(&q->qs[a]);
378 if (q->qs[a].qlen == 0) {
457 skb_queue_head_init(&q->qs[i]);
552 struct gnet_stats_queue qs = { .qlen = q->qs[idx].qlen };
555 if (gnet_stats_copy_queue(d, &qs) < 0)