Lines Matching refs:tail
188 pr_emerg("%s: text:%px len:%d put:%d head:%px data:%px tail:%#lx end:%#lx dev:%s\n",
190 (unsigned long)skb->tail, (unsigned long)skb->end,
401 memset(skb, 0, offsetof(struct sk_buff, tail));
439 * MUST add room at tail (SKB_DATA_ALIGN(skb_shared_info))
452 memset(skb, 0, offsetof(struct sk_buff, tail));
513 memset(skb, 0, offsetof(struct sk_buff, tail));
615 * tail room of at least size bytes. The object has a reference count
662 * the tail pointer in struct sk_buff!
664 memset(skb, 0, offsetof(struct sk_buff, tail));
1440 C(tail);
1649 struct sk_buff *tail, *skb = skb_from_uarg(uarg);
1682 tail = skb_peek_tail(q);
1683 if (!tail || SKB_EXT_ERR(tail)->ee.ee_origin != SO_EE_ORIGIN_ZEROCOPY ||
1684 !skb_zerocopy_notify_extend(tail, lo, len)) {
1927 /* {transport,network,mac}_header and tail are relative to skb->head */
1984 /* Set the tail pointer and length */
2023 /* Set the tail pointer and length */
2063 * @ntail: room to add at tail
2137 skb->tail += off;
2285 * @newtailroom: new free bytes at tail
2317 /* Set the tail pointer and length */
2340 * __skb_pad - zero pad the tail of an skb
2364 ntail = skb->data_len + pad - (skb->end - skb->tail);
2389 * pskb_put - add data to the tail of a potentially fragmented buffer
2391 * @tail: tail fragment of the buffer to use
2395 * fragmented buffer. @tail must be the last fragment of @skb -- or
2401 void *pskb_put(struct sk_buff *skb, struct sk_buff *tail, int len)
2403 if (tail != skb) {
2407 return skb_put(tail, len);
2424 skb->tail += len;
2426 if (unlikely(skb->tail > skb->end))
2496 * Cut the length of a buffer down by removing data from the tail. If
2617 * __pskb_pull_tail - advance tail of skb header
2619 * @delta: number of bytes to advance tail
2622 * it expands header moving its tail forward and copying necessary
2628 * or value of new tail of skb in the case of success.
2634 /* Moves tail of skb head forward, copying data from fragmented part,
2643 /* If skb has not enough free space at tail, get new one
2645 * room at tail, reallocate without expansion only if skb is cloned.
2647 int i, k, eat = (skb->tail + delta) - skb->end;
2757 skb->tail += delta;
3690 * skb_dequeue_tail - remove from the tail of the queue
3693 * Remove the tail of the list. The list lock is taken so the function
3694 * may be used safely with other locking list functions. The tail item is
3797 * skb_queue_tail - queue a buffer at the list tail
3801 * Queue a buffer at the tail of the list. This function takes the
3952 * @tgt: buffer into which tail data gets added
4334 struct sk_buff *tail = NULL;
4364 if (!tail)
4367 tail->next = nskb;
4374 tail = nskb;
4401 skb->prev = tail;
4431 struct sk_buff *tail = NULL;
4607 tail->next = nskb;
4610 tail = nskb;
4734 segs->prev = tail;
4755 if (tail->len - doffset <= gso_size)
4756 skb_shinfo(tail)->gso_size = 0;
4757 else if (tail != segs)
4758 skb_shinfo(tail)->gso_segs = DIV_ROUND_UP(tail->len - doffset, gso_size);
4766 swap(tail->truesize, head_skb->truesize);
4767 swap(tail->destructor, head_skb->destructor);
4768 swap(tail->sk, head_skb->sk);
6584 * If packet has bytes in frags and enough tail room in skb->head,
6594 if (skb->data_len > skb->end - skb->tail ||