Lines Matching full:spd
3069 * at the end of the spd in case we error'ed out in filling the pipe.
3071 static void sock_spd_release(struct splice_pipe_desc *spd, unsigned int i) in sock_spd_release() argument
3073 put_page(spd->pages[i]); in sock_spd_release()
3095 static bool spd_can_coalesce(const struct splice_pipe_desc *spd, in spd_can_coalesce() argument
3099 return spd->nr_pages && in spd_can_coalesce()
3100 spd->pages[spd->nr_pages - 1] == page && in spd_can_coalesce()
3101 (spd->partial[spd->nr_pages - 1].offset + in spd_can_coalesce()
3102 spd->partial[spd->nr_pages - 1].len == offset); in spd_can_coalesce()
3106 * Fill page/offset/length into spd, if it can hold more pages.
3108 static bool spd_fill_page(struct splice_pipe_desc *spd, struct page *page, in spd_fill_page() argument
3112 if (unlikely(spd->nr_pages == MAX_SKB_FRAGS)) in spd_fill_page()
3120 if (spd_can_coalesce(spd, page, offset)) { in spd_fill_page()
3121 spd->partial[spd->nr_pages - 1].len += *len; in spd_fill_page()
3125 spd->pages[spd->nr_pages] = page; in spd_fill_page()
3126 spd->partial[spd->nr_pages].len = *len; in spd_fill_page()
3127 spd->partial[spd->nr_pages].offset = offset; in spd_fill_page()
3128 spd->nr_pages++; in spd_fill_page()
3136 struct splice_pipe_desc *spd, bool linear, in __splice_segment() argument
3156 if (spd_fill_page(spd, page, &flen, poff, linear, sk)) in __splice_segment()
3169 * Map linear and fragment data from the skb to spd. It reports true if the
3174 struct splice_pipe_desc *spd, struct sock *sk) in __skb_splice_bits() argument
3187 offset, len, spd, in __skb_splice_bits()
3206 offset, len, spd, false, sk)) in __skb_splice_bits()
3219 if (__skb_splice_bits(iter, pipe, offset, len, spd, sk)) in __skb_splice_bits()
3236 struct splice_pipe_desc spd = { in skb_splice_bits() local
3245 __skb_splice_bits(skb, pipe, &offset, &tlen, &spd, sk); in skb_splice_bits()
3247 if (spd.nr_pages) in skb_splice_bits()
3248 ret = splice_to_pipe(pipe, &spd); in skb_splice_bits()