Lines Matching refs:tail
105 pr_emerg("%s: text:%px len:%d put:%d head:%px data:%px tail:%#lx end:%#lx dev:%s\n",
107 (unsigned long)skb->tail, (unsigned long)skb->end,
176 * tail room of at least size bytes. The object has a reference count
223 * the tail pointer in struct sk_buff!
225 memset(skb, 0, offsetof(struct sk_buff, tail));
233 skb->end = skb->tail + size;
279 skb->end = skb->tail + size;
307 * MUST add room at tail (SKB_DATA_ALIGN(skb_shared_info))
320 memset(skb, 0, offsetof(struct sk_buff, tail));
1006 C(tail);
1206 struct sk_buff *tail, *skb = skb_from_uarg(uarg);
1237 tail = skb_peek_tail(q);
1238 if (!tail || SKB_EXT_ERR(tail)->ee.ee_origin != SO_EE_ORIGIN_ZEROCOPY ||
1239 !skb_zerocopy_notify_extend(tail, lo, len)) {
1472 /* {transport,network,mac}_header and tail are relative to skb->head */
1535 /* Set the tail pointer and length */
1574 /* Set the tail pointer and length */
1614 * @ntail: room to add at tail
1688 skb->tail += off;
1738 * @newtailroom: new free bytes at tail
1775 /* Set the tail pointer and length */
1798 * __skb_pad - zero pad the tail of an skb
1822 ntail = skb->data_len + pad - (skb->end - skb->tail);
1847 * pskb_put - add data to the tail of a potentially fragmented buffer
1849 * @tail: tail fragment of the buffer to use
1853 * fragmented buffer. @tail must be the last fragment of @skb -- or
1859 void *pskb_put(struct sk_buff *skb, struct sk_buff *tail, int len)
1861 if (tail != skb) {
1865 return skb_put(tail, len);
1882 skb->tail += len;
1884 if (unlikely(skb->tail > skb->end))
1930 * Cut the length of a buffer down by removing data from the tail. If
2051 * __pskb_pull_tail - advance tail of skb header
2053 * @delta: number of bytes to advance tail
2056 * it expands header moving its tail forward and copying necessary
2062 * or value of new tail of skb in the case of success.
2068 /* Moves tail of skb head forward, copying data from fragmented part,
2077 /* If skb has not enough free space at tail, get new one
2079 * room at tail, reallocate without expansion only if skb is cloned.
2081 int i, k, eat = (skb->tail + delta) - skb->end;
2191 skb->tail += delta;
3079 * skb_dequeue_tail - remove from the tail of the queue
3082 * Remove the tail of the list. The list lock is taken so the function
3083 * may be used safely with other locking list functions. The tail item is
3162 * skb_queue_tail - queue a buffer at the list tail
3166 * Queue a buffer at the tail of the list. This function takes the
3327 * @tgt: buffer into which tail data gets added
3693 struct sk_buff *tail = NULL;
3723 if (!tail)
3726 tail->next = nskb;
3733 tail = nskb;
3758 skb->prev = tail;
3811 struct sk_buff *tail = NULL;
3986 tail->next = nskb;
3989 tail = nskb;
4113 segs->prev = tail;
4134 if (tail->len - doffset <= gso_size)
4135 skb_shinfo(tail)->gso_size = 0;
4136 else if (tail != segs)
4137 skb_shinfo(tail)->gso_segs = DIV_ROUND_UP(tail->len - doffset, gso_size);
4145 swap(tail->truesize, head_skb->truesize);
4146 swap(tail->destructor, head_skb->destructor);
4147 swap(tail->sk, head_skb->sk);
6204 * If packet has bytes in frags and enough tail room in skb->head,
6214 if (skb->data_len > skb->end - skb->tail ||