2 * "splice": joining two ropes together by interweaving their strands.
4 * This is the "extended pipe" functionality, where a pipe is used as
5 * an arbitrary in-memory buffer. Think of a pipe as a small kernel
6 * buffer that you can use to transfer data from one end to the other.
8 * The traditional unix read/write is extended with a "splice()" operation
9 * that transfers data buffers to or from a pipe buffer.
11 * Named by Larry McVoy, original implementation from Linus, extended by
12 * Jens to support splicing to files, network, direct splicing, etc and
13 * fixing lots of bugs.
15 * Copyright (C) 2005-2006 Jens Axboe <axboe@kernel.dk>
16 * Copyright (C) 2005-2006 Linus Torvalds <torvalds@osdl.org>
17 * Copyright (C) 2006 Ingo Molnar <mingo@elte.hu>
21 #include <linux/file.h>
22 #include <linux/pagemap.h>
23 #include <linux/splice.h>
24 #include <linux/memcontrol.h>
25 #include <linux/mm_inline.h>
26 #include <linux/swap.h>
27 #include <linux/writeback.h>
28 #include <linux/export.h>
29 #include <linux/syscalls.h>
30 #include <linux/uio.h>
31 #include <linux/security.h>
32 #include <linux/gfp.h>
33 #include <linux/socket.h>
36 * Attempt to steal a page from a pipe buffer. This should perhaps go into
37 * a vm helper function, it's already simplified quite a bit by the
38 * addition of remove_mapping(). If success is returned, the caller may
39 * attempt to reuse this page for another destination.
41 static int page_cache_pipe_buf_steal(struct pipe_inode_info *pipe,
42 struct pipe_buffer *buf)
44 struct page *page = buf->page;
45 struct address_space *mapping;
49 mapping = page_mapping(page);
51 WARN_ON(!PageUptodate(page));
54 * At least for ext2 with nobh option, we need to wait on
55 * writeback completing on this page, since we'll remove it
56 * from the pagecache. Otherwise truncate wont wait on the
57 * page, allowing the disk blocks to be reused by someone else
58 * before we actually wrote our data to them. fs corruption
61 wait_on_page_writeback(page);
63 if (page_has_private(page) &&
64 !try_to_release_page(page, GFP_KERNEL))
68 * If we succeeded in removing the mapping, set LRU flag
71 if (remove_mapping(mapping, page)) {
72 buf->flags |= PIPE_BUF_FLAG_LRU;
78 * Raced with truncate or failed to remove page from current
79 * address space, unlock and return failure.
86 static void page_cache_pipe_buf_release(struct pipe_inode_info *pipe,
87 struct pipe_buffer *buf)
89 page_cache_release(buf->page);
90 buf->flags &= ~PIPE_BUF_FLAG_LRU;
94 * Check whether the contents of buf is OK to access. Since the content
95 * is a page cache page, IO may be in flight.
97 static int page_cache_pipe_buf_confirm(struct pipe_inode_info *pipe,
98 struct pipe_buffer *buf)
100 struct page *page = buf->page;
103 if (!PageUptodate(page)) {
107 * Page got truncated/unhashed. This will cause a 0-byte
108 * splice, if this is the first page.
110 if (!page->mapping) {
116 * Uh oh, read-error from disk.
118 if (!PageUptodate(page)) {
124 * Page is ok afterall, we are done.
135 const struct pipe_buf_operations page_cache_pipe_buf_ops = {
137 .map = generic_pipe_buf_map,
138 .unmap = generic_pipe_buf_unmap,
139 .confirm = page_cache_pipe_buf_confirm,
140 .release = page_cache_pipe_buf_release,
141 .steal = page_cache_pipe_buf_steal,
142 .get = generic_pipe_buf_get,
145 static int user_page_pipe_buf_steal(struct pipe_inode_info *pipe,
146 struct pipe_buffer *buf)
148 if (!(buf->flags & PIPE_BUF_FLAG_GIFT))
151 buf->flags |= PIPE_BUF_FLAG_LRU;
152 return generic_pipe_buf_steal(pipe, buf);
155 static const struct pipe_buf_operations user_page_pipe_buf_ops = {
157 .map = generic_pipe_buf_map,
158 .unmap = generic_pipe_buf_unmap,
159 .confirm = generic_pipe_buf_confirm,
160 .release = page_cache_pipe_buf_release,
161 .steal = user_page_pipe_buf_steal,
162 .get = generic_pipe_buf_get,
165 static void wakeup_pipe_readers(struct pipe_inode_info *pipe)
168 if (waitqueue_active(&pipe->wait))
169 wake_up_interruptible(&pipe->wait);
170 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
174 * splice_to_pipe - fill passed data into a pipe
175 * @pipe: pipe to fill
179 * @spd contains a map of pages and len/offset tuples, along with
180 * the struct pipe_buf_operations associated with these pages. This
181 * function will link that data to the pipe.
184 ssize_t splice_to_pipe(struct pipe_inode_info *pipe,
185 struct splice_pipe_desc *spd)
187 unsigned int spd_pages = spd->nr_pages;
188 int ret, do_wakeup, page_nr;
197 if (!pipe->readers) {
198 send_sig(SIGPIPE, current, 0);
204 if (pipe->nrbufs < pipe->buffers) {
205 int newbuf = (pipe->curbuf + pipe->nrbufs) & (pipe->buffers - 1);
206 struct pipe_buffer *buf = pipe->bufs + newbuf;
208 buf->page = spd->pages[page_nr];
209 buf->offset = spd->partial[page_nr].offset;
210 buf->len = spd->partial[page_nr].len;
211 buf->private = spd->partial[page_nr].private;
213 if (spd->flags & SPLICE_F_GIFT)
214 buf->flags |= PIPE_BUF_FLAG_GIFT;
223 if (!--spd->nr_pages)
225 if (pipe->nrbufs < pipe->buffers)
231 if (spd->flags & SPLICE_F_NONBLOCK) {
237 if (signal_pending(current)) {
245 if (waitqueue_active(&pipe->wait))
246 wake_up_interruptible_sync(&pipe->wait);
247 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
251 pipe->waiting_writers++;
253 pipe->waiting_writers--;
259 wakeup_pipe_readers(pipe);
261 while (page_nr < spd_pages)
262 spd->spd_release(spd, page_nr++);
267 void spd_release_page(struct splice_pipe_desc *spd, unsigned int i)
269 page_cache_release(spd->pages[i]);
273 * Check if we need to grow the arrays holding pages and partial page
276 int splice_grow_spd(const struct pipe_inode_info *pipe, struct splice_pipe_desc *spd)
278 unsigned int buffers = ACCESS_ONCE(pipe->buffers);
280 spd->nr_pages_max = buffers;
281 if (buffers <= PIPE_DEF_BUFFERS)
284 spd->pages = kmalloc(buffers * sizeof(struct page *), GFP_KERNEL);
285 spd->partial = kmalloc(buffers * sizeof(struct partial_page), GFP_KERNEL);
287 if (spd->pages && spd->partial)
295 void splice_shrink_spd(struct splice_pipe_desc *spd)
297 if (spd->nr_pages_max <= PIPE_DEF_BUFFERS)
305 __generic_file_splice_read(struct file *in, loff_t *ppos,
306 struct pipe_inode_info *pipe, size_t len,
309 struct address_space *mapping = in->f_mapping;
310 unsigned int loff, nr_pages, req_pages;
311 struct page *pages[PIPE_DEF_BUFFERS];
312 struct partial_page partial[PIPE_DEF_BUFFERS];
314 pgoff_t index, end_index;
317 struct splice_pipe_desc spd = {
320 .nr_pages_max = PIPE_DEF_BUFFERS,
322 .ops = &page_cache_pipe_buf_ops,
323 .spd_release = spd_release_page,
326 if (splice_grow_spd(pipe, &spd))
329 index = *ppos >> PAGE_CACHE_SHIFT;
330 loff = *ppos & ~PAGE_CACHE_MASK;
331 req_pages = (len + loff + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
332 nr_pages = min(req_pages, spd.nr_pages_max);
335 * Lookup the (hopefully) full range of pages we need.
337 spd.nr_pages = find_get_pages_contig(mapping, index, nr_pages, spd.pages);
338 index += spd.nr_pages;
341 * If find_get_pages_contig() returned fewer pages than we needed,
342 * readahead/allocate the rest and fill in the holes.
344 if (spd.nr_pages < nr_pages)
345 page_cache_sync_readahead(mapping, &in->f_ra, in,
346 index, req_pages - spd.nr_pages);
349 while (spd.nr_pages < nr_pages) {
351 * Page could be there, find_get_pages_contig() breaks on
354 page = find_get_page(mapping, index);
357 * page didn't exist, allocate one.
359 page = page_cache_alloc_cold(mapping);
363 error = add_to_page_cache_lru(page, mapping, index,
365 if (unlikely(error)) {
366 page_cache_release(page);
367 if (error == -EEXIST)
372 * add_to_page_cache() locks the page, unlock it
373 * to avoid convoluting the logic below even more.
378 spd.pages[spd.nr_pages++] = page;
383 * Now loop over the map and see if we need to start IO on any
384 * pages, fill in the partial map, etc.
386 index = *ppos >> PAGE_CACHE_SHIFT;
387 nr_pages = spd.nr_pages;
389 for (page_nr = 0; page_nr < nr_pages; page_nr++) {
390 unsigned int this_len;
396 * this_len is the max we'll use from this page
398 this_len = min_t(unsigned long, len, PAGE_CACHE_SIZE - loff);
399 page = spd.pages[page_nr];
401 if (PageReadahead(page))
402 page_cache_async_readahead(mapping, &in->f_ra, in,
403 page, index, req_pages - page_nr);
406 * If the page isn't uptodate, we may need to start io on it
408 if (!PageUptodate(page)) {
412 * Page was truncated, or invalidated by the
413 * filesystem. Redo the find/create, but this time the
414 * page is kept locked, so there's no chance of another
415 * race with truncate/invalidate.
417 if (!page->mapping) {
419 page = find_or_create_page(mapping, index,
420 mapping_gfp_mask(mapping));
426 page_cache_release(spd.pages[page_nr]);
427 spd.pages[page_nr] = page;
430 * page was already under io and is now done, great
432 if (PageUptodate(page)) {
438 * need to read in the page
440 error = mapping->a_ops->readpage(in, page);
441 if (unlikely(error)) {
443 * We really should re-lookup the page here,
444 * but it complicates things a lot. Instead
445 * lets just do what we already stored, and
446 * we'll get it the next time we are called.
448 if (error == AOP_TRUNCATED_PAGE)
456 * i_size must be checked after PageUptodate.
458 isize = i_size_read(mapping->host);
459 end_index = (isize - 1) >> PAGE_CACHE_SHIFT;
460 if (unlikely(!isize || index > end_index))
464 * if this is the last page, see if we need to shrink
465 * the length and stop
467 if (end_index == index) {
471 * max good bytes in this page
473 plen = ((isize - 1) & ~PAGE_CACHE_MASK) + 1;
478 * force quit after adding this page
480 this_len = min(this_len, plen - loff);
484 spd.partial[page_nr].offset = loff;
485 spd.partial[page_nr].len = this_len;
493 * Release any pages at the end, if we quit early. 'page_nr' is how far
494 * we got, 'nr_pages' is how many pages are in the map.
496 while (page_nr < nr_pages)
497 page_cache_release(spd.pages[page_nr++]);
498 in->f_ra.prev_pos = (loff_t)index << PAGE_CACHE_SHIFT;
501 error = splice_to_pipe(pipe, &spd);
503 splice_shrink_spd(&spd);
508 * generic_file_splice_read - splice data from file to a pipe
509 * @in: file to splice from
510 * @ppos: position in @in
511 * @pipe: pipe to splice to
512 * @len: number of bytes to splice
513 * @flags: splice modifier flags
516 * Will read pages from given file and fill them into a pipe. Can be
517 * used as long as the address_space operations for the source implements
521 ssize_t generic_file_splice_read(struct file *in, loff_t *ppos,
522 struct pipe_inode_info *pipe, size_t len,
528 isize = i_size_read(in->f_mapping->host);
529 if (unlikely(*ppos >= isize))
532 left = isize - *ppos;
533 if (unlikely(left < len))
536 ret = __generic_file_splice_read(in, ppos, pipe, len, flags);
544 EXPORT_SYMBOL(generic_file_splice_read);
546 static const struct pipe_buf_operations default_pipe_buf_ops = {
548 .map = generic_pipe_buf_map,
549 .unmap = generic_pipe_buf_unmap,
550 .confirm = generic_pipe_buf_confirm,
551 .release = generic_pipe_buf_release,
552 .steal = generic_pipe_buf_steal,
553 .get = generic_pipe_buf_get,
556 static ssize_t kernel_readv(struct file *file, const struct iovec *vec,
557 unsigned long vlen, loff_t offset)
565 /* The cast to a user pointer is valid due to the set_fs() */
566 res = vfs_readv(file, (const struct iovec __user *)vec, vlen, &pos);
572 ssize_t kernel_write(struct file *file, const char *buf, size_t count,
580 /* The cast to a user pointer is valid due to the set_fs() */
581 res = vfs_write(file, (__force const char __user *)buf, count, &pos);
586 EXPORT_SYMBOL(kernel_write);
588 ssize_t default_file_splice_read(struct file *in, loff_t *ppos,
589 struct pipe_inode_info *pipe, size_t len,
592 unsigned int nr_pages;
593 unsigned int nr_freed;
595 struct page *pages[PIPE_DEF_BUFFERS];
596 struct partial_page partial[PIPE_DEF_BUFFERS];
597 struct iovec *vec, __vec[PIPE_DEF_BUFFERS];
602 struct splice_pipe_desc spd = {
605 .nr_pages_max = PIPE_DEF_BUFFERS,
607 .ops = &default_pipe_buf_ops,
608 .spd_release = spd_release_page,
611 if (splice_grow_spd(pipe, &spd))
616 if (spd.nr_pages_max > PIPE_DEF_BUFFERS) {
617 vec = kmalloc(spd.nr_pages_max * sizeof(struct iovec), GFP_KERNEL);
622 offset = *ppos & ~PAGE_CACHE_MASK;
623 nr_pages = (len + offset + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
625 for (i = 0; i < nr_pages && i < spd.nr_pages_max && len; i++) {
628 page = alloc_page(GFP_USER);
633 this_len = min_t(size_t, len, PAGE_CACHE_SIZE - offset);
634 vec[i].iov_base = (void __user *) page_address(page);
635 vec[i].iov_len = this_len;
642 res = kernel_readv(in, vec, spd.nr_pages, *ppos);
653 for (i = 0; i < spd.nr_pages; i++) {
654 this_len = min_t(size_t, vec[i].iov_len, res);
655 spd.partial[i].offset = 0;
656 spd.partial[i].len = this_len;
658 __free_page(spd.pages[i]);
664 spd.nr_pages -= nr_freed;
666 res = splice_to_pipe(pipe, &spd);
673 splice_shrink_spd(&spd);
677 for (i = 0; i < spd.nr_pages; i++)
678 __free_page(spd.pages[i]);
683 EXPORT_SYMBOL(default_file_splice_read);
686 * Send 'sd->len' bytes to socket from 'sd->file' at position 'sd->pos'
687 * using sendpage(). Return the number of bytes sent.
689 static int pipe_to_sendpage(struct pipe_inode_info *pipe,
690 struct pipe_buffer *buf, struct splice_desc *sd)
692 struct file *file = sd->u.file;
693 loff_t pos = sd->pos;
696 if (!likely(file->f_op && file->f_op->sendpage))
699 more = (sd->flags & SPLICE_F_MORE) ? MSG_MORE : 0;
701 if (sd->len < sd->total_len && pipe->nrbufs > 1)
702 more |= MSG_SENDPAGE_NOTLAST;
704 return file->f_op->sendpage(file, buf->page, buf->offset,
705 sd->len, &pos, more);
709 * This is a little more tricky than the file -> pipe splicing. There are
710 * basically three cases:
712 * - Destination page already exists in the address space and there
713 * are users of it. For that case we have no other option that
714 * copying the data. Tough luck.
715 * - Destination page already exists in the address space, but there
716 * are no users of it. Make sure it's uptodate, then drop it. Fall
717 * through to last case.
718 * - Destination page does not exist, we can add the pipe page to
719 * the page cache and avoid the copy.
721 * If asked to move pages to the output file (SPLICE_F_MOVE is set in
722 * sd->flags), we attempt to migrate pages from the pipe to the output
723 * file address space page cache. This is possible if no one else has
724 * the pipe page referenced outside of the pipe and page cache. If
725 * SPLICE_F_MOVE isn't set, or we cannot move the page, we simply create
726 * a new page in the output file page cache and fill/dirty that.
728 int pipe_to_file(struct pipe_inode_info *pipe, struct pipe_buffer *buf,
729 struct splice_desc *sd)
731 struct file *file = sd->u.file;
732 struct address_space *mapping = file->f_mapping;
733 unsigned int offset, this_len;
738 offset = sd->pos & ~PAGE_CACHE_MASK;
741 if (this_len + offset > PAGE_CACHE_SIZE)
742 this_len = PAGE_CACHE_SIZE - offset;
744 ret = pagecache_write_begin(file, mapping, sd->pos, this_len,
745 AOP_FLAG_UNINTERRUPTIBLE, &page, &fsdata);
749 if (buf->page != page) {
750 char *src = buf->ops->map(pipe, buf, 1);
751 char *dst = kmap_atomic(page);
753 memcpy(dst + offset, src + buf->offset, this_len);
754 flush_dcache_page(page);
756 buf->ops->unmap(pipe, buf, src);
758 ret = pagecache_write_end(file, mapping, sd->pos, this_len, this_len,
763 EXPORT_SYMBOL(pipe_to_file);
765 static void wakeup_pipe_writers(struct pipe_inode_info *pipe)
768 if (waitqueue_active(&pipe->wait))
769 wake_up_interruptible(&pipe->wait);
770 kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
774 * splice_from_pipe_feed - feed available data from a pipe to a file
775 * @pipe: pipe to splice from
776 * @sd: information to @actor
777 * @actor: handler that splices the data
780 * This function loops over the pipe and calls @actor to do the
781 * actual moving of a single struct pipe_buffer to the desired
782 * destination. It returns when there's no more buffers left in
783 * the pipe or if the requested number of bytes (@sd->total_len)
784 * have been copied. It returns a positive number (one) if the
785 * pipe needs to be filled with more data, zero if the required
786 * number of bytes have been copied and -errno on error.
788 * This, together with splice_from_pipe_{begin,end,next}, may be
789 * used to implement the functionality of __splice_from_pipe() when
790 * locking is required around copying the pipe buffers to the
793 int splice_from_pipe_feed(struct pipe_inode_info *pipe, struct splice_desc *sd,
798 while (pipe->nrbufs) {
799 struct pipe_buffer *buf = pipe->bufs + pipe->curbuf;
800 const struct pipe_buf_operations *ops = buf->ops;
803 if (sd->len > sd->total_len)
804 sd->len = sd->total_len;
806 ret = buf->ops->confirm(pipe, buf);
813 ret = actor(pipe, buf, sd);
820 sd->num_spliced += ret;
823 sd->total_len -= ret;
827 ops->release(pipe, buf);
828 pipe->curbuf = (pipe->curbuf + 1) & (pipe->buffers - 1);
831 sd->need_wakeup = true;
840 EXPORT_SYMBOL(splice_from_pipe_feed);
843 * splice_from_pipe_next - wait for some data to splice from
844 * @pipe: pipe to splice from
845 * @sd: information about the splice operation
848 * This function will wait for some data and return a positive
849 * value (one) if pipe buffers are available. It will return zero
850 * or -errno if no more data needs to be spliced.
852 int splice_from_pipe_next(struct pipe_inode_info *pipe, struct splice_desc *sd)
854 while (!pipe->nrbufs) {
858 if (!pipe->waiting_writers && sd->num_spliced)
861 if (sd->flags & SPLICE_F_NONBLOCK)
864 if (signal_pending(current))
867 if (sd->need_wakeup) {
868 wakeup_pipe_writers(pipe);
869 sd->need_wakeup = false;
877 EXPORT_SYMBOL(splice_from_pipe_next);
880 * splice_from_pipe_begin - start splicing from pipe
881 * @sd: information about the splice operation
884 * This function should be called before a loop containing
885 * splice_from_pipe_next() and splice_from_pipe_feed() to
886 * initialize the necessary fields of @sd.
888 void splice_from_pipe_begin(struct splice_desc *sd)
891 sd->need_wakeup = false;
893 EXPORT_SYMBOL(splice_from_pipe_begin);
896 * splice_from_pipe_end - finish splicing from pipe
897 * @pipe: pipe to splice from
898 * @sd: information about the splice operation
901 * This function will wake up pipe writers if necessary. It should
902 * be called after a loop containing splice_from_pipe_next() and
903 * splice_from_pipe_feed().
905 void splice_from_pipe_end(struct pipe_inode_info *pipe, struct splice_desc *sd)
908 wakeup_pipe_writers(pipe);
910 EXPORT_SYMBOL(splice_from_pipe_end);
913 * __splice_from_pipe - splice data from a pipe to given actor
914 * @pipe: pipe to splice from
915 * @sd: information to @actor
916 * @actor: handler that splices the data
919 * This function does little more than loop over the pipe and call
920 * @actor to do the actual moving of a single struct pipe_buffer to
921 * the desired destination. See pipe_to_file, pipe_to_sendpage, or
925 ssize_t __splice_from_pipe(struct pipe_inode_info *pipe, struct splice_desc *sd,
930 splice_from_pipe_begin(sd);
932 ret = splice_from_pipe_next(pipe, sd);
934 ret = splice_from_pipe_feed(pipe, sd, actor);
936 splice_from_pipe_end(pipe, sd);
938 return sd->num_spliced ? sd->num_spliced : ret;
940 EXPORT_SYMBOL(__splice_from_pipe);
943 * splice_from_pipe - splice data from a pipe to a file
944 * @pipe: pipe to splice from
945 * @out: file to splice to
946 * @ppos: position in @out
947 * @len: how many bytes to splice
948 * @flags: splice modifier flags
949 * @actor: handler that splices the data
952 * See __splice_from_pipe. This function locks the pipe inode,
953 * otherwise it's identical to __splice_from_pipe().
956 ssize_t splice_from_pipe(struct pipe_inode_info *pipe, struct file *out,
957 loff_t *ppos, size_t len, unsigned int flags,
961 struct splice_desc sd = {
969 ret = __splice_from_pipe(pipe, &sd, actor);
976 * generic_file_splice_write - splice data from a pipe to a file
978 * @out: file to write to
979 * @ppos: position in @out
980 * @len: number of bytes to splice
981 * @flags: splice modifier flags
984 * Will either move or copy pages (determined by @flags options) from
985 * the given pipe inode to the given file.
989 generic_file_splice_write(struct pipe_inode_info *pipe, struct file *out,
990 loff_t *ppos, size_t len, unsigned int flags)
992 struct address_space *mapping = out->f_mapping;
993 struct inode *inode = mapping->host;
994 struct splice_desc sd = {
1002 sb_start_write(inode->i_sb);
1006 splice_from_pipe_begin(&sd);
1008 ret = splice_from_pipe_next(pipe, &sd);
1012 mutex_lock_nested(&inode->i_mutex, I_MUTEX_CHILD);
1013 ret = file_remove_suid(out);
1015 ret = file_update_time(out);
1017 ret = splice_from_pipe_feed(pipe, &sd,
1020 mutex_unlock(&inode->i_mutex);
1022 splice_from_pipe_end(pipe, &sd);
1027 ret = sd.num_spliced;
1032 err = generic_write_sync(out, *ppos, ret);
1037 balance_dirty_pages_ratelimited(mapping);
1039 sb_end_write(inode->i_sb);
1044 EXPORT_SYMBOL(generic_file_splice_write);
1046 static int write_pipe_buf(struct pipe_inode_info *pipe, struct pipe_buffer *buf,
1047 struct splice_desc *sd)
1052 data = buf->ops->map(pipe, buf, 0);
1053 ret = kernel_write(sd->u.file, data + buf->offset, sd->len, sd->pos);
1054 buf->ops->unmap(pipe, buf, data);
1059 static ssize_t default_file_splice_write(struct pipe_inode_info *pipe,
1060 struct file *out, loff_t *ppos,
1061 size_t len, unsigned int flags)
1065 ret = splice_from_pipe(pipe, out, ppos, len, flags, write_pipe_buf);
1073 * generic_splice_sendpage - splice data from a pipe to a socket
1074 * @pipe: pipe to splice from
1075 * @out: socket to write to
1076 * @ppos: position in @out
1077 * @len: number of bytes to splice
1078 * @flags: splice modifier flags
1081 * Will send @len bytes from the pipe to a network socket. No data copying
1085 ssize_t generic_splice_sendpage(struct pipe_inode_info *pipe, struct file *out,
1086 loff_t *ppos, size_t len, unsigned int flags)
1088 return splice_from_pipe(pipe, out, ppos, len, flags, pipe_to_sendpage);
1091 EXPORT_SYMBOL(generic_splice_sendpage);
1094 * Attempt to initiate a splice from pipe to file.
1096 static long do_splice_from(struct pipe_inode_info *pipe, struct file *out,
1097 loff_t *ppos, size_t len, unsigned int flags)
1099 ssize_t (*splice_write)(struct pipe_inode_info *, struct file *,
1100 loff_t *, size_t, unsigned int);
1103 if (unlikely(!(out->f_mode & FMODE_WRITE)))
1106 if (unlikely(out->f_flags & O_APPEND))
1109 ret = rw_verify_area(WRITE, out, ppos, len);
1110 if (unlikely(ret < 0))
1113 if (out->f_op && out->f_op->splice_write)
1114 splice_write = out->f_op->splice_write;
1116 splice_write = default_file_splice_write;
1118 return splice_write(pipe, out, ppos, len, flags);
1122 * Attempt to initiate a splice from a file to a pipe.
1124 static long do_splice_to(struct file *in, loff_t *ppos,
1125 struct pipe_inode_info *pipe, size_t len,
1128 ssize_t (*splice_read)(struct file *, loff_t *,
1129 struct pipe_inode_info *, size_t, unsigned int);
1132 if (unlikely(!(in->f_mode & FMODE_READ)))
1135 ret = rw_verify_area(READ, in, ppos, len);
1136 if (unlikely(ret < 0))
1139 if (in->f_op && in->f_op->splice_read)
1140 splice_read = in->f_op->splice_read;
1142 splice_read = default_file_splice_read;
1144 return splice_read(in, ppos, pipe, len, flags);
1148 * splice_direct_to_actor - splices data directly between two non-pipes
1149 * @in: file to splice from
1150 * @sd: actor information on where to splice to
1151 * @actor: handles the data splicing
1154 * This is a special case helper to splice directly between two
1155 * points, without requiring an explicit pipe. Internally an allocated
1156 * pipe is cached in the process, and reused during the lifetime of
1160 ssize_t splice_direct_to_actor(struct file *in, struct splice_desc *sd,
1161 splice_direct_actor *actor)
1163 struct pipe_inode_info *pipe;
1170 * We require the input being a regular file, as we don't want to
1171 * randomly drop data for eg socket -> socket splicing. Use the
1172 * piped splicing for that!
1174 i_mode = file_inode(in)->i_mode;
1175 if (unlikely(!S_ISREG(i_mode) && !S_ISBLK(i_mode)))
1179 * neither in nor out is a pipe, setup an internal pipe attached to
1180 * 'out' and transfer the wanted data from 'in' to 'out' through that
1182 pipe = current->splice_pipe;
1183 if (unlikely(!pipe)) {
1184 pipe = alloc_pipe_info(NULL);
1189 * We don't have an immediate reader, but we'll read the stuff
1190 * out of the pipe right after the splice_to_pipe(). So set
1191 * PIPE_READERS appropriately.
1195 current->splice_pipe = pipe;
1203 len = sd->total_len;
1207 * Don't block on output, we have to drain the direct pipe.
1209 sd->flags &= ~SPLICE_F_NONBLOCK;
1213 loff_t pos = sd->pos, prev_pos = pos;
1215 ret = do_splice_to(in, &pos, pipe, len, flags);
1216 if (unlikely(ret <= 0))
1220 sd->total_len = read_len;
1223 * NOTE: nonblocking mode only applies to the input. We
1224 * must not do the output in nonblocking mode as then we
1225 * could get stuck data in the internal pipe:
1227 ret = actor(pipe, sd);
1228 if (unlikely(ret <= 0)) {
1237 if (ret < read_len) {
1238 sd->pos = prev_pos + ret;
1244 pipe->nrbufs = pipe->curbuf = 0;
1250 * If we did an incomplete transfer we must release
1251 * the pipe buffers in question:
1253 for (i = 0; i < pipe->buffers; i++) {
1254 struct pipe_buffer *buf = pipe->bufs + i;
1257 buf->ops->release(pipe, buf);
1267 EXPORT_SYMBOL(splice_direct_to_actor);
1269 static int direct_splice_actor(struct pipe_inode_info *pipe,
1270 struct splice_desc *sd)
1272 struct file *file = sd->u.file;
1274 return do_splice_from(pipe, file, &file->f_pos, sd->total_len,
1279 * do_splice_direct - splices data directly between two files
1280 * @in: file to splice from
1281 * @ppos: input file offset
1282 * @out: file to splice to
1283 * @len: number of bytes to splice
1284 * @flags: splice modifier flags
1287 * For use by do_sendfile(). splice can easily emulate sendfile, but
1288 * doing it in the application would incur an extra system call
1289 * (splice in + splice out, as compared to just sendfile()). So this helper
1290 * can splice directly through a process-private pipe.
1293 long do_splice_direct(struct file *in, loff_t *ppos, struct file *out,
1294 size_t len, unsigned int flags)
1296 struct splice_desc sd = {
1305 ret = splice_direct_to_actor(in, &sd, direct_splice_actor);
1312 static int splice_pipe_to_pipe(struct pipe_inode_info *ipipe,
1313 struct pipe_inode_info *opipe,
1314 size_t len, unsigned int flags);
1317 * Determine where to splice to/from.
1319 static long do_splice(struct file *in, loff_t __user *off_in,
1320 struct file *out, loff_t __user *off_out,
1321 size_t len, unsigned int flags)
1323 struct pipe_inode_info *ipipe;
1324 struct pipe_inode_info *opipe;
1325 loff_t offset, *off;
1328 ipipe = get_pipe_info(in);
1329 opipe = get_pipe_info(out);
1331 if (ipipe && opipe) {
1332 if (off_in || off_out)
1335 if (!(in->f_mode & FMODE_READ))
1338 if (!(out->f_mode & FMODE_WRITE))
1341 /* Splicing to self would be fun, but... */
1345 return splice_pipe_to_pipe(ipipe, opipe, len, flags);
1352 if (!(out->f_mode & FMODE_PWRITE))
1354 if (copy_from_user(&offset, off_out, sizeof(loff_t)))
1360 ret = do_splice_from(ipipe, out, off, len, flags);
1362 if (off_out && copy_to_user(off_out, off, sizeof(loff_t)))
1372 if (!(in->f_mode & FMODE_PREAD))
1374 if (copy_from_user(&offset, off_in, sizeof(loff_t)))
1380 ret = do_splice_to(in, off, opipe, len, flags);
1382 if (off_in && copy_to_user(off_in, off, sizeof(loff_t)))
1392 * Map an iov into an array of pages and offset/length tupples. With the
1393 * partial_page structure, we can map several non-contiguous ranges into
1394 * our ones pages[] map instead of splitting that operation into pieces.
1395 * Could easily be exported as a generic helper for other users, in which
1396 * case one would probably want to add a 'max_nr_pages' parameter as well.
1398 static int get_iovec_page_array(const struct iovec __user *iov,
1399 unsigned int nr_vecs, struct page **pages,
1400 struct partial_page *partial, bool aligned,
1401 unsigned int pipe_buffers)
1403 int buffers = 0, error = 0;
1406 unsigned long off, npages;
1413 if (copy_from_user(&entry, iov, sizeof(entry)))
1416 base = entry.iov_base;
1417 len = entry.iov_len;
1420 * Sanity check this iovec. 0 read succeeds.
1426 if (!access_ok(VERIFY_READ, base, len))
1430 * Get this base offset and number of pages, then map
1431 * in the user pages.
1433 off = (unsigned long) base & ~PAGE_MASK;
1436 * If asked for alignment, the offset must be zero and the
1437 * length a multiple of the PAGE_SIZE.
1440 if (aligned && (off || len & ~PAGE_MASK))
1443 npages = (off + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
1444 if (npages > pipe_buffers - buffers)
1445 npages = pipe_buffers - buffers;
1447 error = get_user_pages_fast((unsigned long)base, npages,
1448 0, &pages[buffers]);
1450 if (unlikely(error <= 0))
1454 * Fill this contiguous range into the partial page map.
1456 for (i = 0; i < error; i++) {
1457 const int plen = min_t(size_t, len, PAGE_SIZE - off);
1459 partial[buffers].offset = off;
1460 partial[buffers].len = plen;
1468 * We didn't complete this iov, stop here since it probably
1469 * means we have to move some of this into a pipe to
1470 * be able to continue.
1476 * Don't continue if we mapped fewer pages than we asked for,
1477 * or if we mapped the max number of pages that we have
1480 if (error < npages || buffers == pipe_buffers)
1493 static int pipe_to_user(struct pipe_inode_info *pipe, struct pipe_buffer *buf,
1494 struct splice_desc *sd)
1500 * See if we can use the atomic maps, by prefaulting in the
1501 * pages and doing an atomic copy
1503 if (!fault_in_pages_writeable(sd->u.userptr, sd->len)) {
1504 src = buf->ops->map(pipe, buf, 1);
1505 ret = __copy_to_user_inatomic(sd->u.userptr, src + buf->offset,
1507 buf->ops->unmap(pipe, buf, src);
1515 * No dice, use slow non-atomic map and copy
1517 src = buf->ops->map(pipe, buf, 0);
1520 if (copy_to_user(sd->u.userptr, src + buf->offset, sd->len))
1523 buf->ops->unmap(pipe, buf, src);
1526 sd->u.userptr += ret;
1531 * For lack of a better implementation, implement vmsplice() to userspace
1532 * as a simple copy of the pipes pages to the user iov.
1534 static long vmsplice_to_user(struct file *file, const struct iovec __user *iov,
1535 unsigned long nr_segs, unsigned int flags)
1537 struct pipe_inode_info *pipe;
1538 struct splice_desc sd;
1543 pipe = get_pipe_info(file);
1555 * Get user address base and length for this iovec.
1557 error = get_user(base, &iov->iov_base);
1558 if (unlikely(error))
1560 error = get_user(len, &iov->iov_len);
1561 if (unlikely(error))
1565 * Sanity check this iovec. 0 read succeeds.
1569 if (unlikely(!base)) {
1574 if (unlikely(!access_ok(VERIFY_WRITE, base, len))) {
1582 sd.u.userptr = base;
1585 size = __splice_from_pipe(pipe, &sd, pipe_to_user);
1611 * vmsplice splices a user address range into a pipe. It can be thought of
1612 * as splice-from-memory, where the regular splice is splice-from-file (or
1613 * to file). In both cases the output is a pipe, naturally.
1615 static long vmsplice_to_pipe(struct file *file, const struct iovec __user *iov,
1616 unsigned long nr_segs, unsigned int flags)
1618 struct pipe_inode_info *pipe;
1619 struct page *pages[PIPE_DEF_BUFFERS];
1620 struct partial_page partial[PIPE_DEF_BUFFERS];
1621 struct splice_pipe_desc spd = {
1624 .nr_pages_max = PIPE_DEF_BUFFERS,
1626 .ops = &user_page_pipe_buf_ops,
1627 .spd_release = spd_release_page,
1631 pipe = get_pipe_info(file);
1635 if (splice_grow_spd(pipe, &spd))
1638 spd.nr_pages = get_iovec_page_array(iov, nr_segs, spd.pages,
1641 if (spd.nr_pages <= 0)
1644 ret = splice_to_pipe(pipe, &spd);
1646 splice_shrink_spd(&spd);
1651 * Note that vmsplice only really supports true splicing _from_ user memory
1652 * to a pipe, not the other way around. Splicing from user memory is a simple
1653 * operation that can be supported without any funky alignment restrictions
1654 * or nasty vm tricks. We simply map in the user memory and fill them into
1655 * a pipe. The reverse isn't quite as easy, though. There are two possible
1656 * solutions for that:
1658 * - memcpy() the data internally, at which point we might as well just
1659 * do a regular read() on the buffer anyway.
1660 * - Lots of nasty vm tricks, that are neither fast nor flexible (it
1661 * has restriction limitations on both ends of the pipe).
1663 * Currently we punt and implement it as a normal copy, see pipe_to_user().
1666 SYSCALL_DEFINE4(vmsplice, int, fd, const struct iovec __user *, iov,
1667 unsigned long, nr_segs, unsigned int, flags)
1672 if (unlikely(nr_segs > UIO_MAXIOV))
1674 else if (unlikely(!nr_segs))
1680 if (f.file->f_mode & FMODE_WRITE)
1681 error = vmsplice_to_pipe(f.file, iov, nr_segs, flags);
1682 else if (f.file->f_mode & FMODE_READ)
1683 error = vmsplice_to_user(f.file, iov, nr_segs, flags);
1691 SYSCALL_DEFINE6(splice, int, fd_in, loff_t __user *, off_in,
1692 int, fd_out, loff_t __user *, off_out,
1693 size_t, len, unsigned int, flags)
1704 if (in.file->f_mode & FMODE_READ) {
1705 out = fdget(fd_out);
1707 if (out.file->f_mode & FMODE_WRITE)
1708 error = do_splice(in.file, off_in,
1720 * Make sure there's data to read. Wait for input if we can, otherwise
1721 * return an appropriate error.
1723 static int ipipe_prep(struct pipe_inode_info *pipe, unsigned int flags)
1728 * Check ->nrbufs without the inode lock first. This function
1729 * is speculative anyways, so missing one is ok.
1737 while (!pipe->nrbufs) {
1738 if (signal_pending(current)) {
1744 if (!pipe->waiting_writers) {
1745 if (flags & SPLICE_F_NONBLOCK) {
1758 * Make sure there's writeable room. Wait for room if we can, otherwise
1759 * return an appropriate error.
1761 static int opipe_prep(struct pipe_inode_info *pipe, unsigned int flags)
1766 * Check ->nrbufs without the inode lock first. This function
1767 * is speculative anyways, so missing one is ok.
1769 if (pipe->nrbufs < pipe->buffers)
1775 while (pipe->nrbufs >= pipe->buffers) {
1776 if (!pipe->readers) {
1777 send_sig(SIGPIPE, current, 0);
1781 if (flags & SPLICE_F_NONBLOCK) {
1785 if (signal_pending(current)) {
1789 pipe->waiting_writers++;
1791 pipe->waiting_writers--;
1799 * Splice contents of ipipe to opipe.
1801 static int splice_pipe_to_pipe(struct pipe_inode_info *ipipe,
1802 struct pipe_inode_info *opipe,
1803 size_t len, unsigned int flags)
1805 struct pipe_buffer *ibuf, *obuf;
1807 bool input_wakeup = false;
1811 ret = ipipe_prep(ipipe, flags);
1815 ret = opipe_prep(opipe, flags);
1820 * Potential ABBA deadlock, work around it by ordering lock
1821 * grabbing by pipe info address. Otherwise two different processes
1822 * could deadlock (one doing tee from A -> B, the other from B -> A).
1824 pipe_double_lock(ipipe, opipe);
1827 if (!opipe->readers) {
1828 send_sig(SIGPIPE, current, 0);
1834 if (!ipipe->nrbufs && !ipipe->writers)
1838 * Cannot make any progress, because either the input
1839 * pipe is empty or the output pipe is full.
1841 if (!ipipe->nrbufs || opipe->nrbufs >= opipe->buffers) {
1842 /* Already processed some buffers, break */
1846 if (flags & SPLICE_F_NONBLOCK) {
1852 * We raced with another reader/writer and haven't
1853 * managed to process any buffers. A zero return
1854 * value means EOF, so retry instead.
1861 ibuf = ipipe->bufs + ipipe->curbuf;
1862 nbuf = (opipe->curbuf + opipe->nrbufs) & (opipe->buffers - 1);
1863 obuf = opipe->bufs + nbuf;
1865 if (len >= ibuf->len) {
1867 * Simply move the whole buffer from ipipe to opipe
1872 ipipe->curbuf = (ipipe->curbuf + 1) & (ipipe->buffers - 1);
1874 input_wakeup = true;
1877 * Get a reference to this pipe buffer,
1878 * so we can copy the contents over.
1880 ibuf->ops->get(ipipe, ibuf);
1884 * Don't inherit the gift flag, we need to
1885 * prevent multiple steals of this page.
1887 obuf->flags &= ~PIPE_BUF_FLAG_GIFT;
1891 ibuf->offset += obuf->len;
1892 ibuf->len -= obuf->len;
1902 * If we put data in the output pipe, wakeup any potential readers.
1905 wakeup_pipe_readers(opipe);
1908 wakeup_pipe_writers(ipipe);
1914 * Link contents of ipipe to opipe.
1916 static int link_pipe(struct pipe_inode_info *ipipe,
1917 struct pipe_inode_info *opipe,
1918 size_t len, unsigned int flags)
1920 struct pipe_buffer *ibuf, *obuf;
1921 int ret = 0, i = 0, nbuf;
1924 * Potential ABBA deadlock, work around it by ordering lock
1925 * grabbing by pipe info address. Otherwise two different processes
1926 * could deadlock (one doing tee from A -> B, the other from B -> A).
1928 pipe_double_lock(ipipe, opipe);
1931 if (!opipe->readers) {
1932 send_sig(SIGPIPE, current, 0);
1939 * If we have iterated all input buffers or ran out of
1940 * output room, break.
1942 if (i >= ipipe->nrbufs || opipe->nrbufs >= opipe->buffers)
1945 ibuf = ipipe->bufs + ((ipipe->curbuf + i) & (ipipe->buffers-1));
1946 nbuf = (opipe->curbuf + opipe->nrbufs) & (opipe->buffers - 1);
1949 * Get a reference to this pipe buffer,
1950 * so we can copy the contents over.
1952 ibuf->ops->get(ipipe, ibuf);
1954 obuf = opipe->bufs + nbuf;
1958 * Don't inherit the gift flag, we need to
1959 * prevent multiple steals of this page.
1961 obuf->flags &= ~PIPE_BUF_FLAG_GIFT;
1963 if (obuf->len > len)
1973 * return EAGAIN if we have the potential of some data in the
1974 * future, otherwise just return 0
1976 if (!ret && ipipe->waiting_writers && (flags & SPLICE_F_NONBLOCK))
1983 * If we put data in the output pipe, wakeup any potential readers.
1986 wakeup_pipe_readers(opipe);
1992 * This is a tee(1) implementation that works on pipes. It doesn't copy
1993 * any data, it simply references the 'in' pages on the 'out' pipe.
1994 * The 'flags' used are the SPLICE_F_* variants, currently the only
1995 * applicable one is SPLICE_F_NONBLOCK.
1997 static long do_tee(struct file *in, struct file *out, size_t len,
2000 struct pipe_inode_info *ipipe = get_pipe_info(in);
2001 struct pipe_inode_info *opipe = get_pipe_info(out);
2005 * Duplicate the contents of ipipe to opipe without actually
2008 if (ipipe && opipe && ipipe != opipe) {
2010 * Keep going, unless we encounter an error. The ipipe/opipe
2011 * ordering doesn't really matter.
2013 ret = ipipe_prep(ipipe, flags);
2015 ret = opipe_prep(opipe, flags);
2017 ret = link_pipe(ipipe, opipe, len, flags);
2024 SYSCALL_DEFINE4(tee, int, fdin, int, fdout, size_t, len, unsigned int, flags)
2035 if (in.file->f_mode & FMODE_READ) {
2036 struct fd out = fdget(fdout);
2038 if (out.file->f_mode & FMODE_WRITE)
2039 error = do_tee(in.file, out.file,