Lines Matching defs:head
127 struct sk_buff *head;
850 /* remove one skb from head of slot queue */
854 struct sk_buff *skb = flow->head;
857 flow->head = skb->next;
868 if (!flow->head)
869 flow->head = skb;
1169 if (flow->head == flow->tail)
1192 for (skb_check = flow->head;
1268 * Since we want to drop ACK closest to the head of the queue,
1300 flow->head = elig_ack->next;
1918 if (flow->head) {
1952 struct list_head *head;
2039 head = &b->decaying_flows;
2040 if (!first_flow || list_empty(head)) {
2041 head = &b->new_flows;
2042 if (list_empty(head)) {
2043 head = &b->old_flows;
2044 if (unlikely(list_empty(head))) {
2045 head = &b->decaying_flows;
2046 if (unlikely(list_empty(head)))
2051 flow = list_first_entry(head, struct cake_flow, flowchain);
2067 if (flow->head) {
2164 !flow->head)
3001 if (flow->head) {
3003 skb = flow->head;