splice.c 46.1 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11
/*
 * "splice": joining two ropes together by interweaving their strands.
 *
 * This is the "extended pipe" functionality, where a pipe is used as
 * an arbitrary in-memory buffer. Think of a pipe as a small kernel
 * buffer that you can use to transfer data from one end to the other.
 *
 * The traditional unix read/write is extended with a "splice()" operation
 * that transfers data buffers to or from a pipe buffer.
 *
 * Named by Larry McVoy, original implementation from Linus, extended by
12 13
 * Jens to support splicing to files, network, direct splicing, etc and
 * fixing lots of bugs.
14
 *
15
 * Copyright (C) 2005-2006 Jens Axboe <axboe@kernel.dk>
16 17
 * Copyright (C) 2005-2006 Linus Torvalds <torvalds@osdl.org>
 * Copyright (C) 2006 Ingo Molnar <mingo@elte.hu>
18 19 20 21 22
 *
 */
#include <linux/fs.h>
#include <linux/file.h>
#include <linux/pagemap.h>
23
#include <linux/splice.h>
K
KAMEZAWA Hiroyuki 已提交
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>
34
#include <linux/compat.h>
35
#include "internal.h"
36

37 38 39 40 41 42
/*
 * Attempt to steal a page from a pipe buffer. This should perhaps go into
 * a vm helper function, it's already simplified quite a bit by the
 * addition of remove_mapping(). If success is returned, the caller may
 * attempt to reuse this page for another destination.
 */
43
static int page_cache_pipe_buf_steal(struct pipe_inode_info *pipe,
44 45 46
				     struct pipe_buffer *buf)
{
	struct page *page = buf->page;
47
	struct address_space *mapping;
48

49 50
	lock_page(page);

51 52 53
	mapping = page_mapping(page);
	if (mapping) {
		WARN_ON(!PageUptodate(page));
54

55 56 57 58 59 60 61 62 63
		/*
		 * At least for ext2 with nobh option, we need to wait on
		 * writeback completing on this page, since we'll remove it
		 * from the pagecache.  Otherwise truncate wont wait on the
		 * page, allowing the disk blocks to be reused by someone else
		 * before we actually wrote our data to them. fs corruption
		 * ensues.
		 */
		wait_on_page_writeback(page);
64

65 66
		if (page_has_private(page) &&
		    !try_to_release_page(page, GFP_KERNEL))
67
			goto out_unlock;
68

69 70 71 72 73 74 75 76
		/*
		 * If we succeeded in removing the mapping, set LRU flag
		 * and return good.
		 */
		if (remove_mapping(mapping, page)) {
			buf->flags |= PIPE_BUF_FLAG_LRU;
			return 0;
		}
77
	}
78

79 80 81 82
	/*
	 * Raced with truncate or failed to remove page from current
	 * address space, unlock and return failure.
	 */
83
out_unlock:
84 85
	unlock_page(page);
	return 1;
86 87
}

88
static void page_cache_pipe_buf_release(struct pipe_inode_info *pipe,
89 90 91
					struct pipe_buffer *buf)
{
	page_cache_release(buf->page);
J
Jens Axboe 已提交
92
	buf->flags &= ~PIPE_BUF_FLAG_LRU;
93 94
}

95 96 97 98
/*
 * Check whether the contents of buf is OK to access. Since the content
 * is a page cache page, IO may be in flight.
 */
99 100
static int page_cache_pipe_buf_confirm(struct pipe_inode_info *pipe,
				       struct pipe_buffer *buf)
101 102
{
	struct page *page = buf->page;
103
	int err;
104 105

	if (!PageUptodate(page)) {
106 107 108 109
		lock_page(page);

		/*
		 * Page got truncated/unhashed. This will cause a 0-byte
I
Ingo Molnar 已提交
110
		 * splice, if this is the first page.
111 112 113 114 115
		 */
		if (!page->mapping) {
			err = -ENODATA;
			goto error;
		}
116

117
		/*
I
Ingo Molnar 已提交
118
		 * Uh oh, read-error from disk.
119 120 121 122 123 124 125
		 */
		if (!PageUptodate(page)) {
			err = -EIO;
			goto error;
		}

		/*
126
		 * Page is ok afterall, we are done.
127
		 */
128 129 130
		unlock_page(page);
	}

131
	return 0;
132 133
error:
	unlock_page(page);
134
	return err;
135 136
}

137
const struct pipe_buf_operations page_cache_pipe_buf_ops = {
138
	.can_merge = 0,
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,
143 144
};

145 146 147
static int user_page_pipe_buf_steal(struct pipe_inode_info *pipe,
				    struct pipe_buffer *buf)
{
148 149 150
	if (!(buf->flags & PIPE_BUF_FLAG_GIFT))
		return 1;

J
Jens Axboe 已提交
151
	buf->flags |= PIPE_BUF_FLAG_LRU;
152
	return generic_pipe_buf_steal(pipe, buf);
153 154
}

155
static const struct pipe_buf_operations user_page_pipe_buf_ops = {
156
	.can_merge = 0,
157
	.confirm = generic_pipe_buf_confirm,
158 159
	.release = page_cache_pipe_buf_release,
	.steal = user_page_pipe_buf_steal,
160
	.get = generic_pipe_buf_get,
161 162
};

N
Namhyung Kim 已提交
163 164 165 166 167 168 169 170
static void wakeup_pipe_readers(struct pipe_inode_info *pipe)
{
	smp_mb();
	if (waitqueue_active(&pipe->wait))
		wake_up_interruptible(&pipe->wait);
	kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
}

171 172 173 174 175 176
/**
 * splice_to_pipe - fill passed data into a pipe
 * @pipe:	pipe to fill
 * @spd:	data to fill
 *
 * Description:
R
Randy Dunlap 已提交
177
 *    @spd contains a map of pages and len/offset tuples, along with
178 179 180
 *    the struct pipe_buf_operations associated with these pages. This
 *    function will link that data to the pipe.
 *
181
 */
182 183
ssize_t splice_to_pipe(struct pipe_inode_info *pipe,
		       struct splice_pipe_desc *spd)
184
{
185
	unsigned int spd_pages = spd->nr_pages;
186
	int ret, do_wakeup, page_nr;
187 188 189

	ret = 0;
	do_wakeup = 0;
190
	page_nr = 0;
191

192
	pipe_lock(pipe);
193 194

	for (;;) {
195
		if (!pipe->readers) {
196 197 198 199 200 201
			send_sig(SIGPIPE, current, 0);
			if (!ret)
				ret = -EPIPE;
			break;
		}

202 203
		if (pipe->nrbufs < pipe->buffers) {
			int newbuf = (pipe->curbuf + pipe->nrbufs) & (pipe->buffers - 1);
204
			struct pipe_buffer *buf = pipe->bufs + newbuf;
205

206 207 208
			buf->page = spd->pages[page_nr];
			buf->offset = spd->partial[page_nr].offset;
			buf->len = spd->partial[page_nr].len;
209
			buf->private = spd->partial[page_nr].private;
210
			buf->ops = spd->ops;
211 212 213
			if (spd->flags & SPLICE_F_GIFT)
				buf->flags |= PIPE_BUF_FLAG_GIFT;

214
			pipe->nrbufs++;
215 216 217
			page_nr++;
			ret += buf->len;

A
Al Viro 已提交
218
			if (pipe->files)
219
				do_wakeup = 1;
220

221
			if (!--spd->nr_pages)
222
				break;
223
			if (pipe->nrbufs < pipe->buffers)
224 225 226 227 228
				continue;

			break;
		}

229
		if (spd->flags & SPLICE_F_NONBLOCK) {
230 231 232 233 234
			if (!ret)
				ret = -EAGAIN;
			break;
		}

235 236 237 238 239 240 241
		if (signal_pending(current)) {
			if (!ret)
				ret = -ERESTARTSYS;
			break;
		}

		if (do_wakeup) {
242
			smp_mb();
243 244 245
			if (waitqueue_active(&pipe->wait))
				wake_up_interruptible_sync(&pipe->wait);
			kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
246 247 248
			do_wakeup = 0;
		}

249 250 251
		pipe->waiting_writers++;
		pipe_wait(pipe);
		pipe->waiting_writers--;
252 253
	}

254
	pipe_unlock(pipe);
255

N
Namhyung Kim 已提交
256 257
	if (do_wakeup)
		wakeup_pipe_readers(pipe);
258

259
	while (page_nr < spd_pages)
260
		spd->spd_release(spd, page_nr++);
261 262 263 264

	return ret;
}

265
void spd_release_page(struct splice_pipe_desc *spd, unsigned int i)
266 267 268 269
{
	page_cache_release(spd->pages[i]);
}

270 271 272 273
/*
 * Check if we need to grow the arrays holding pages and partial page
 * descriptions.
 */
274
int splice_grow_spd(const struct pipe_inode_info *pipe, struct splice_pipe_desc *spd)
275
{
276 277 278 279
	unsigned int buffers = ACCESS_ONCE(pipe->buffers);

	spd->nr_pages_max = buffers;
	if (buffers <= PIPE_DEF_BUFFERS)
280 281
		return 0;

282 283
	spd->pages = kmalloc(buffers * sizeof(struct page *), GFP_KERNEL);
	spd->partial = kmalloc(buffers * sizeof(struct partial_page), GFP_KERNEL);
284 285 286 287 288 289 290 291 292

	if (spd->pages && spd->partial)
		return 0;

	kfree(spd->pages);
	kfree(spd->partial);
	return -ENOMEM;
}

293
void splice_shrink_spd(struct splice_pipe_desc *spd)
294
{
295
	if (spd->nr_pages_max <= PIPE_DEF_BUFFERS)
296 297 298 299 300 301
		return;

	kfree(spd->pages);
	kfree(spd->partial);
}

302
static int
303 304 305
__generic_file_splice_read(struct file *in, loff_t *ppos,
			   struct pipe_inode_info *pipe, size_t len,
			   unsigned int flags)
306 307
{
	struct address_space *mapping = in->f_mapping;
F
Fengguang Wu 已提交
308
	unsigned int loff, nr_pages, req_pages;
309 310
	struct page *pages[PIPE_DEF_BUFFERS];
	struct partial_page partial[PIPE_DEF_BUFFERS];
311
	struct page *page;
312 313
	pgoff_t index, end_index;
	loff_t isize;
314
	int error, page_nr;
315 316 317
	struct splice_pipe_desc spd = {
		.pages = pages,
		.partial = partial,
318
		.nr_pages_max = PIPE_DEF_BUFFERS,
319 320
		.flags = flags,
		.ops = &page_cache_pipe_buf_ops,
321
		.spd_release = spd_release_page,
322
	};
323

324 325 326
	if (splice_grow_spd(pipe, &spd))
		return -ENOMEM;

327
	index = *ppos >> PAGE_CACHE_SHIFT;
328
	loff = *ppos & ~PAGE_CACHE_MASK;
F
Fengguang Wu 已提交
329
	req_pages = (len + loff + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
330
	nr_pages = min(req_pages, spd.nr_pages_max);
331

332 333 334
	/*
	 * Lookup the (hopefully) full range of pages we need.
	 */
335
	spd.nr_pages = find_get_pages_contig(mapping, index, nr_pages, spd.pages);
336
	index += spd.nr_pages;
337

338 339
	/*
	 * If find_get_pages_contig() returned fewer pages than we needed,
340
	 * readahead/allocate the rest and fill in the holes.
341
	 */
342
	if (spd.nr_pages < nr_pages)
343 344
		page_cache_sync_readahead(mapping, &in->f_ra, in,
				index, req_pages - spd.nr_pages);
345

346
	error = 0;
347
	while (spd.nr_pages < nr_pages) {
348
		/*
349 350
		 * Page could be there, find_get_pages_contig() breaks on
		 * the first hole.
351
		 */
352 353 354
		page = find_get_page(mapping, index);
		if (!page) {
			/*
355
			 * page didn't exist, allocate one.
356 357 358 359 360 361
			 */
			page = page_cache_alloc_cold(mapping);
			if (!page)
				break;

			error = add_to_page_cache_lru(page, mapping, index,
362
					GFP_KERNEL & mapping_gfp_mask(mapping));
363 364
			if (unlikely(error)) {
				page_cache_release(page);
365 366
				if (error == -EEXIST)
					continue;
367 368
				break;
			}
369 370 371 372 373
			/*
			 * add_to_page_cache() locks the page, unlock it
			 * to avoid convoluting the logic below even more.
			 */
			unlock_page(page);
374 375
		}

376
		spd.pages[spd.nr_pages++] = page;
377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396
		index++;
	}

	/*
	 * Now loop over the map and see if we need to start IO on any
	 * pages, fill in the partial map, etc.
	 */
	index = *ppos >> PAGE_CACHE_SHIFT;
	nr_pages = spd.nr_pages;
	spd.nr_pages = 0;
	for (page_nr = 0; page_nr < nr_pages; page_nr++) {
		unsigned int this_len;

		if (!len)
			break;

		/*
		 * this_len is the max we'll use from this page
		 */
		this_len = min_t(unsigned long, len, PAGE_CACHE_SIZE - loff);
397
		page = spd.pages[page_nr];
398

399
		if (PageReadahead(page))
400
			page_cache_async_readahead(mapping, &in->f_ra, in,
F
Fengguang Wu 已提交
401
					page, index, req_pages - page_nr);
402

403 404 405 406
		/*
		 * If the page isn't uptodate, we may need to start io on it
		 */
		if (!PageUptodate(page)) {
407
			lock_page(page);
408 409

			/*
410 411 412 413
			 * Page was truncated, or invalidated by the
			 * filesystem.  Redo the find/create, but this time the
			 * page is kept locked, so there's no chance of another
			 * race with truncate/invalidate.
414 415 416
			 */
			if (!page->mapping) {
				unlock_page(page);
417 418 419 420 421 422 423
				page = find_or_create_page(mapping, index,
						mapping_gfp_mask(mapping));

				if (!page) {
					error = -ENOMEM;
					break;
				}
424 425
				page_cache_release(spd.pages[page_nr]);
				spd.pages[page_nr] = page;
426 427 428 429 430 431 432 433
			}
			/*
			 * page was already under io and is now done, great
			 */
			if (PageUptodate(page)) {
				unlock_page(page);
				goto fill_it;
			}
434

435 436 437 438
			/*
			 * need to read in the page
			 */
			error = mapping->a_ops->readpage(in, page);
439
			if (unlikely(error)) {
440 441 442 443 444 445
				/*
				 * We really should re-lookup the page here,
				 * but it complicates things a lot. Instead
				 * lets just do what we already stored, and
				 * we'll get it the next time we are called.
				 */
446
				if (error == AOP_TRUNCATED_PAGE)
447 448
					error = 0;

449 450
				break;
			}
451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466
		}
fill_it:
		/*
		 * i_size must be checked after PageUptodate.
		 */
		isize = i_size_read(mapping->host);
		end_index = (isize - 1) >> PAGE_CACHE_SHIFT;
		if (unlikely(!isize || index > end_index))
			break;

		/*
		 * if this is the last page, see if we need to shrink
		 * the length and stop
		 */
		if (end_index == index) {
			unsigned int plen;
467 468

			/*
469
			 * max good bytes in this page
470
			 */
471 472
			plen = ((isize - 1) & ~PAGE_CACHE_MASK) + 1;
			if (plen <= loff)
473 474 475
				break;

			/*
476
			 * force quit after adding this page
477
			 */
478 479
			this_len = min(this_len, plen - loff);
			len = this_len;
480
		}
481

482 483
		spd.partial[page_nr].offset = loff;
		spd.partial[page_nr].len = this_len;
484
		len -= this_len;
485
		loff = 0;
486 487
		spd.nr_pages++;
		index++;
488 489
	}

490
	/*
491
	 * Release any pages at the end, if we quit early. 'page_nr' is how far
492 493 494
	 * we got, 'nr_pages' is how many pages are in the map.
	 */
	while (page_nr < nr_pages)
495
		page_cache_release(spd.pages[page_nr++]);
496
	in->f_ra.prev_pos = (loff_t)index << PAGE_CACHE_SHIFT;
497

498
	if (spd.nr_pages)
499
		error = splice_to_pipe(pipe, &spd);
500

501
	splice_shrink_spd(&spd);
502
	return error;
503 504
}

505 506 507
/**
 * generic_file_splice_read - splice data from file to a pipe
 * @in:		file to splice from
508
 * @ppos:	position in @in
509 510 511 512
 * @pipe:	pipe to splice to
 * @len:	number of bytes to splice
 * @flags:	splice modifier flags
 *
513 514 515 516 517
 * Description:
 *    Will read pages from given file and fill them into a pipe. Can be
 *    used as long as the address_space operations for the source implements
 *    a readpage() hook.
 *
518
 */
519 520 521
ssize_t generic_file_splice_read(struct file *in, loff_t *ppos,
				 struct pipe_inode_info *pipe, size_t len,
				 unsigned int flags)
522
{
523
	loff_t isize, left;
524
	int ret;
525

526 527 528
	if (IS_DAX(in->f_mapping->host))
		return default_file_splice_read(in, ppos, pipe, len, flags);

529 530 531 532 533 534 535
	isize = i_size_read(in->f_mapping->host);
	if (unlikely(*ppos >= isize))
		return 0;

	left = isize - *ppos;
	if (unlikely(left < len))
		len = left;
536

537
	ret = __generic_file_splice_read(in, ppos, pipe, len, flags);
538
	if (ret > 0) {
539
		*ppos += ret;
540 541
		file_accessed(in);
	}
542 543 544

	return ret;
}
545 546
EXPORT_SYMBOL(generic_file_splice_read);

547 548 549 550 551 552 553 554
static const struct pipe_buf_operations default_pipe_buf_ops = {
	.can_merge = 0,
	.confirm = generic_pipe_buf_confirm,
	.release = generic_pipe_buf_release,
	.steal = generic_pipe_buf_steal,
	.get = generic_pipe_buf_get,
};

M
Miklos Szeredi 已提交
555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570
static int generic_pipe_buf_nosteal(struct pipe_inode_info *pipe,
				    struct pipe_buffer *buf)
{
	return 1;
}

/* Pipe buffer operations for a socket and similar. */
const struct pipe_buf_operations nosteal_pipe_buf_ops = {
	.can_merge = 0,
	.confirm = generic_pipe_buf_confirm,
	.release = generic_pipe_buf_release,
	.steal = generic_pipe_buf_nosteal,
	.get = generic_pipe_buf_get,
};
EXPORT_SYMBOL(nosteal_pipe_buf_ops);

571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586
static ssize_t kernel_readv(struct file *file, const struct iovec *vec,
			    unsigned long vlen, loff_t offset)
{
	mm_segment_t old_fs;
	loff_t pos = offset;
	ssize_t res;

	old_fs = get_fs();
	set_fs(get_ds());
	/* The cast to a user pointer is valid due to the set_fs() */
	res = vfs_readv(file, (const struct iovec __user *)vec, vlen, &pos);
	set_fs(old_fs);

	return res;
}

587
ssize_t kernel_write(struct file *file, const char *buf, size_t count,
588
			    loff_t pos)
589 590 591 592 593 594 595
{
	mm_segment_t old_fs;
	ssize_t res;

	old_fs = get_fs();
	set_fs(get_ds());
	/* The cast to a user pointer is valid due to the set_fs() */
596
	res = vfs_write(file, (__force const char __user *)buf, count, &pos);
597 598 599 600
	set_fs(old_fs);

	return res;
}
601
EXPORT_SYMBOL(kernel_write);
602

603 604 605 606 607 608 609
ssize_t default_file_splice_read(struct file *in, loff_t *ppos,
				 struct pipe_inode_info *pipe, size_t len,
				 unsigned int flags)
{
	unsigned int nr_pages;
	unsigned int nr_freed;
	size_t offset;
610 611 612
	struct page *pages[PIPE_DEF_BUFFERS];
	struct partial_page partial[PIPE_DEF_BUFFERS];
	struct iovec *vec, __vec[PIPE_DEF_BUFFERS];
613 614 615 616 617 618 619
	ssize_t res;
	size_t this_len;
	int error;
	int i;
	struct splice_pipe_desc spd = {
		.pages = pages,
		.partial = partial,
620
		.nr_pages_max = PIPE_DEF_BUFFERS,
621 622 623 624 625
		.flags = flags,
		.ops = &default_pipe_buf_ops,
		.spd_release = spd_release_page,
	};

626 627 628 629 630
	if (splice_grow_spd(pipe, &spd))
		return -ENOMEM;

	res = -ENOMEM;
	vec = __vec;
631 632
	if (spd.nr_pages_max > PIPE_DEF_BUFFERS) {
		vec = kmalloc(spd.nr_pages_max * sizeof(struct iovec), GFP_KERNEL);
633 634 635 636
		if (!vec)
			goto shrink_ret;
	}

637 638 639
	offset = *ppos & ~PAGE_CACHE_MASK;
	nr_pages = (len + offset + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;

640
	for (i = 0; i < nr_pages && i < spd.nr_pages_max && len; i++) {
641 642
		struct page *page;

643
		page = alloc_page(GFP_USER);
644 645 646 647 648
		error = -ENOMEM;
		if (!page)
			goto err;

		this_len = min_t(size_t, len, PAGE_CACHE_SIZE - offset);
649
		vec[i].iov_base = (void __user *) page_address(page);
650
		vec[i].iov_len = this_len;
651
		spd.pages[i] = page;
652 653 654 655 656 657
		spd.nr_pages++;
		len -= this_len;
		offset = 0;
	}

	res = kernel_readv(in, vec, spd.nr_pages, *ppos);
A
Andrew Morton 已提交
658 659
	if (res < 0) {
		error = res;
660
		goto err;
A
Andrew Morton 已提交
661
	}
662 663 664 665 666 667 668 669

	error = 0;
	if (!res)
		goto err;

	nr_freed = 0;
	for (i = 0; i < spd.nr_pages; i++) {
		this_len = min_t(size_t, vec[i].iov_len, res);
670 671
		spd.partial[i].offset = 0;
		spd.partial[i].len = this_len;
672
		if (!this_len) {
673 674
			__free_page(spd.pages[i]);
			spd.pages[i] = NULL;
675 676 677 678 679 680 681 682 683 684
			nr_freed++;
		}
		res -= this_len;
	}
	spd.nr_pages -= nr_freed;

	res = splice_to_pipe(pipe, &spd);
	if (res > 0)
		*ppos += res;

685 686 687
shrink_ret:
	if (vec != __vec)
		kfree(vec);
688
	splice_shrink_spd(&spd);
689 690 691
	return res;

err:
692
	for (i = 0; i < spd.nr_pages; i++)
693
		__free_page(spd.pages[i]);
694

695 696
	res = error;
	goto shrink_ret;
697 698 699
}
EXPORT_SYMBOL(default_file_splice_read);

700
/*
701
 * Send 'sd->len' bytes to socket from 'sd->file' at position 'sd->pos'
J
Jens Axboe 已提交
702
 * using sendpage(). Return the number of bytes sent.
703
 */
704
static int pipe_to_sendpage(struct pipe_inode_info *pipe,
705 706
			    struct pipe_buffer *buf, struct splice_desc *sd)
{
707
	struct file *file = sd->u.file;
708
	loff_t pos = sd->pos;
709
	int more;
710

A
Al Viro 已提交
711
	if (!likely(file->f_op->sendpage))
712 713
		return -EINVAL;

714
	more = (sd->flags & SPLICE_F_MORE) ? MSG_MORE : 0;
715 716

	if (sd->len < sd->total_len && pipe->nrbufs > 1)
717
		more |= MSG_SENDPAGE_NOTLAST;
718

719 720
	return file->f_op->sendpage(file, buf->page, buf->offset,
				    sd->len, &pos, more);
721 722
}

723 724 725 726 727 728 729 730
static void wakeup_pipe_writers(struct pipe_inode_info *pipe)
{
	smp_mb();
	if (waitqueue_active(&pipe->wait))
		wake_up_interruptible(&pipe->wait);
	kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
}

731
/**
732
 * splice_from_pipe_feed - feed available data from a pipe to a file
733 734 735 736 737
 * @pipe:	pipe to splice from
 * @sd:		information to @actor
 * @actor:	handler that splices the data
 *
 * Description:
738 739 740 741 742 743 744
 *    This function loops over the pipe and calls @actor to do the
 *    actual moving of a single struct pipe_buffer to the desired
 *    destination.  It returns when there's no more buffers left in
 *    the pipe or if the requested number of bytes (@sd->total_len)
 *    have been copied.  It returns a positive number (one) if the
 *    pipe needs to be filled with more data, zero if the required
 *    number of bytes have been copied and -errno on error.
745
 *
746 747 748 749
 *    This, together with splice_from_pipe_{begin,end,next}, may be
 *    used to implement the functionality of __splice_from_pipe() when
 *    locking is required around copying the pipe buffers to the
 *    destination.
750
 */
A
Al Viro 已提交
751
static int splice_from_pipe_feed(struct pipe_inode_info *pipe, struct splice_desc *sd,
752
			  splice_actor *actor)
753
{
754
	int ret;
755

756 757 758
	while (pipe->nrbufs) {
		struct pipe_buffer *buf = pipe->bufs + pipe->curbuf;
		const struct pipe_buf_operations *ops = buf->ops;
759

760 761 762
		sd->len = buf->len;
		if (sd->len > sd->total_len)
			sd->len = sd->total_len;
763

764 765
		ret = buf->ops->confirm(pipe, buf);
		if (unlikely(ret)) {
766 767 768 769
			if (ret == -ENODATA)
				ret = 0;
			return ret;
		}
770 771 772 773 774

		ret = actor(pipe, buf, sd);
		if (ret <= 0)
			return ret;

775 776 777 778 779 780 781 782 783 784 785
		buf->offset += ret;
		buf->len -= ret;

		sd->num_spliced += ret;
		sd->len -= ret;
		sd->pos += ret;
		sd->total_len -= ret;

		if (!buf->len) {
			buf->ops = NULL;
			ops->release(pipe, buf);
786
			pipe->curbuf = (pipe->curbuf + 1) & (pipe->buffers - 1);
787
			pipe->nrbufs--;
A
Al Viro 已提交
788
			if (pipe->files)
789 790
				sd->need_wakeup = true;
		}
791

792 793 794
		if (!sd->total_len)
			return 0;
	}
795

796 797
	return 1;
}
798

799 800 801 802 803 804 805 806 807 808
/**
 * splice_from_pipe_next - wait for some data to splice from
 * @pipe:	pipe to splice from
 * @sd:		information about the splice operation
 *
 * Description:
 *    This function will wait for some data and return a positive
 *    value (one) if pipe buffers are available.  It will return zero
 *    or -errno if no more data needs to be spliced.
 */
A
Al Viro 已提交
809
static int splice_from_pipe_next(struct pipe_inode_info *pipe, struct splice_desc *sd)
810 811 812 813
{
	while (!pipe->nrbufs) {
		if (!pipe->writers)
			return 0;
J
Jens Axboe 已提交
814

815 816
		if (!pipe->waiting_writers && sd->num_spliced)
			return 0;
I
Ingo Molnar 已提交
817

818 819
		if (sd->flags & SPLICE_F_NONBLOCK)
			return -EAGAIN;
820

821 822
		if (signal_pending(current))
			return -ERESTARTSYS;
823

824 825 826
		if (sd->need_wakeup) {
			wakeup_pipe_writers(pipe);
			sd->need_wakeup = false;
827 828
		}

829 830
		pipe_wait(pipe);
	}
831

832 833
	return 1;
}
834

835 836
/**
 * splice_from_pipe_begin - start splicing from pipe
837
 * @sd:		information about the splice operation
838 839 840 841 842 843
 *
 * Description:
 *    This function should be called before a loop containing
 *    splice_from_pipe_next() and splice_from_pipe_feed() to
 *    initialize the necessary fields of @sd.
 */
A
Al Viro 已提交
844
static void splice_from_pipe_begin(struct splice_desc *sd)
845 846 847 848
{
	sd->num_spliced = 0;
	sd->need_wakeup = false;
}
849

850 851 852 853 854 855 856 857 858 859
/**
 * splice_from_pipe_end - finish splicing from pipe
 * @pipe:	pipe to splice from
 * @sd:		information about the splice operation
 *
 * Description:
 *    This function will wake up pipe writers if necessary.  It should
 *    be called after a loop containing splice_from_pipe_next() and
 *    splice_from_pipe_feed().
 */
A
Al Viro 已提交
860
static void splice_from_pipe_end(struct pipe_inode_info *pipe, struct splice_desc *sd)
861 862 863 864
{
	if (sd->need_wakeup)
		wakeup_pipe_writers(pipe);
}
865

866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882
/**
 * __splice_from_pipe - splice data from a pipe to given actor
 * @pipe:	pipe to splice from
 * @sd:		information to @actor
 * @actor:	handler that splices the data
 *
 * Description:
 *    This function does little more than loop over the pipe and call
 *    @actor to do the actual moving of a single struct pipe_buffer to
 *    the desired destination. See pipe_to_file, pipe_to_sendpage, or
 *    pipe_to_user.
 *
 */
ssize_t __splice_from_pipe(struct pipe_inode_info *pipe, struct splice_desc *sd,
			   splice_actor *actor)
{
	int ret;
883

884 885 886 887 888 889 890 891 892
	splice_from_pipe_begin(sd);
	do {
		ret = splice_from_pipe_next(pipe, sd);
		if (ret > 0)
			ret = splice_from_pipe_feed(pipe, sd, actor);
	} while (ret > 0);
	splice_from_pipe_end(pipe, sd);

	return sd->num_spliced ? sd->num_spliced : ret;
893
}
M
Mark Fasheh 已提交
894
EXPORT_SYMBOL(__splice_from_pipe);
895

896 897 898 899 900 901 902 903 904 905
/**
 * splice_from_pipe - splice data from a pipe to a file
 * @pipe:	pipe to splice from
 * @out:	file to splice to
 * @ppos:	position in @out
 * @len:	how many bytes to splice
 * @flags:	splice modifier flags
 * @actor:	handler that splices the data
 *
 * Description:
906
 *    See __splice_from_pipe. This function locks the pipe inode,
907 908 909
 *    otherwise it's identical to __splice_from_pipe().
 *
 */
910 911 912 913 914
ssize_t splice_from_pipe(struct pipe_inode_info *pipe, struct file *out,
			 loff_t *ppos, size_t len, unsigned int flags,
			 splice_actor *actor)
{
	ssize_t ret;
J
Jens Axboe 已提交
915 916 917 918
	struct splice_desc sd = {
		.total_len = len,
		.flags = flags,
		.pos = *ppos,
919
		.u.file = out,
J
Jens Axboe 已提交
920
	};
921

922
	pipe_lock(pipe);
J
Jens Axboe 已提交
923
	ret = __splice_from_pipe(pipe, &sd, actor);
924
	pipe_unlock(pipe);
925 926 927 928

	return ret;
}

A
Al Viro 已提交
929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008
/**
 * iter_file_splice_write - splice data from a pipe to a file
 * @pipe:	pipe info
 * @out:	file to write to
 * @ppos:	position in @out
 * @len:	number of bytes to splice
 * @flags:	splice modifier flags
 *
 * Description:
 *    Will either move or copy pages (determined by @flags options) from
 *    the given pipe inode to the given file.
 *    This one is ->write_iter-based.
 *
 */
ssize_t
iter_file_splice_write(struct pipe_inode_info *pipe, struct file *out,
			  loff_t *ppos, size_t len, unsigned int flags)
{
	struct splice_desc sd = {
		.total_len = len,
		.flags = flags,
		.pos = *ppos,
		.u.file = out,
	};
	int nbufs = pipe->buffers;
	struct bio_vec *array = kcalloc(nbufs, sizeof(struct bio_vec),
					GFP_KERNEL);
	ssize_t ret;

	if (unlikely(!array))
		return -ENOMEM;

	pipe_lock(pipe);

	splice_from_pipe_begin(&sd);
	while (sd.total_len) {
		struct iov_iter from;
		size_t left;
		int n, idx;

		ret = splice_from_pipe_next(pipe, &sd);
		if (ret <= 0)
			break;

		if (unlikely(nbufs < pipe->buffers)) {
			kfree(array);
			nbufs = pipe->buffers;
			array = kcalloc(nbufs, sizeof(struct bio_vec),
					GFP_KERNEL);
			if (!array) {
				ret = -ENOMEM;
				break;
			}
		}

		/* build the vector */
		left = sd.total_len;
		for (n = 0, idx = pipe->curbuf; left && n < pipe->nrbufs; n++, idx++) {
			struct pipe_buffer *buf = pipe->bufs + idx;
			size_t this_len = buf->len;

			if (this_len > left)
				this_len = left;

			if (idx == pipe->buffers - 1)
				idx = -1;

			ret = buf->ops->confirm(pipe, buf);
			if (unlikely(ret)) {
				if (ret == -ENODATA)
					ret = 0;
				goto done;
			}

			array[n].bv_page = buf->page;
			array[n].bv_len = this_len;
			array[n].bv_offset = buf->offset;
			left -= this_len;
		}

A
Al Viro 已提交
1009 1010
		iov_iter_bvec(&from, ITER_BVEC | WRITE, array, n,
			      sd.total_len - left);
1011
		ret = vfs_iter_write(out, &from, &sd.pos);
A
Al Viro 已提交
1012 1013 1014 1015 1016
		if (ret <= 0)
			break;

		sd.num_spliced += ret;
		sd.total_len -= ret;
1017
		*ppos = sd.pos;
A
Al Viro 已提交
1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052

		/* dismiss the fully eaten buffers, adjust the partial one */
		while (ret) {
			struct pipe_buffer *buf = pipe->bufs + pipe->curbuf;
			if (ret >= buf->len) {
				const struct pipe_buf_operations *ops = buf->ops;
				ret -= buf->len;
				buf->len = 0;
				buf->ops = NULL;
				ops->release(pipe, buf);
				pipe->curbuf = (pipe->curbuf + 1) & (pipe->buffers - 1);
				pipe->nrbufs--;
				if (pipe->files)
					sd.need_wakeup = true;
			} else {
				buf->offset += ret;
				buf->len -= ret;
				ret = 0;
			}
		}
	}
done:
	kfree(array);
	splice_from_pipe_end(pipe, &sd);

	pipe_unlock(pipe);

	if (sd.num_spliced)
		ret = sd.num_spliced;

	return ret;
}

EXPORT_SYMBOL(iter_file_splice_write);

1053 1054
static int write_pipe_buf(struct pipe_inode_info *pipe, struct pipe_buffer *buf,
			  struct splice_desc *sd)
1055
{
1056 1057
	int ret;
	void *data;
1058
	loff_t tmp = sd->pos;
1059

A
Al Viro 已提交
1060
	data = kmap(buf->page);
1061
	ret = __kernel_write(sd->u.file, data + buf->offset, sd->len, &tmp);
A
Al Viro 已提交
1062
	kunmap(buf->page);
1063 1064

	return ret;
1065 1066 1067 1068 1069 1070
}

static ssize_t default_file_splice_write(struct pipe_inode_info *pipe,
					 struct file *out, loff_t *ppos,
					 size_t len, unsigned int flags)
{
1071
	ssize_t ret;
1072

1073 1074 1075
	ret = splice_from_pipe(pipe, out, ppos, len, flags, write_pipe_buf);
	if (ret > 0)
		*ppos += ret;
1076

1077
	return ret;
1078 1079
}

1080 1081
/**
 * generic_splice_sendpage - splice data from a pipe to a socket
1082
 * @pipe:	pipe to splice from
1083
 * @out:	socket to write to
1084
 * @ppos:	position in @out
1085 1086 1087
 * @len:	number of bytes to splice
 * @flags:	splice modifier flags
 *
1088 1089 1090
 * Description:
 *    Will send @len bytes from the pipe to a network socket. No data copying
 *    is involved.
1091 1092
 *
 */
1093
ssize_t generic_splice_sendpage(struct pipe_inode_info *pipe, struct file *out,
1094
				loff_t *ppos, size_t len, unsigned int flags)
1095
{
1096
	return splice_from_pipe(pipe, out, ppos, len, flags, pipe_to_sendpage);
1097 1098
}

1099
EXPORT_SYMBOL(generic_splice_sendpage);
J
Jeff Garzik 已提交
1100

1101 1102 1103
/*
 * Attempt to initiate a splice from pipe to file.
 */
1104
static long do_splice_from(struct pipe_inode_info *pipe, struct file *out,
1105
			   loff_t *ppos, size_t len, unsigned int flags)
1106
{
1107 1108
	ssize_t (*splice_write)(struct pipe_inode_info *, struct file *,
				loff_t *, size_t, unsigned int);
1109

A
Al Viro 已提交
1110
	if (out->f_op->splice_write)
1111 1112
		splice_write = out->f_op->splice_write;
	else
1113 1114
		splice_write = default_file_splice_write;

1115
	return splice_write(pipe, out, ppos, len, flags);
1116 1117
}

1118 1119 1120
/*
 * Attempt to initiate a splice from a file to a pipe.
 */
1121 1122 1123
static long do_splice_to(struct file *in, loff_t *ppos,
			 struct pipe_inode_info *pipe, size_t len,
			 unsigned int flags)
1124
{
1125 1126
	ssize_t (*splice_read)(struct file *, loff_t *,
			       struct pipe_inode_info *, size_t, unsigned int);
1127 1128
	int ret;

1129
	if (unlikely(!(in->f_mode & FMODE_READ)))
1130 1131
		return -EBADF;

1132
	ret = rw_verify_area(READ, in, ppos, len);
1133 1134 1135
	if (unlikely(ret < 0))
		return ret;

A
Al Viro 已提交
1136
	if (in->f_op->splice_read)
1137 1138
		splice_read = in->f_op->splice_read;
	else
1139 1140 1141
		splice_read = default_file_splice_read;

	return splice_read(in, ppos, pipe, len, flags);
1142 1143
}

1144 1145 1146 1147 1148 1149 1150 1151 1152
/**
 * splice_direct_to_actor - splices data directly between two non-pipes
 * @in:		file to splice from
 * @sd:		actor information on where to splice to
 * @actor:	handles the data splicing
 *
 * Description:
 *    This is a special case helper to splice directly between two
 *    points, without requiring an explicit pipe. Internally an allocated
R
Randy Dunlap 已提交
1153
 *    pipe is cached in the process, and reused during the lifetime of
1154 1155
 *    that process.
 *
J
Jens Axboe 已提交
1156 1157 1158
 */
ssize_t splice_direct_to_actor(struct file *in, struct splice_desc *sd,
			       splice_direct_actor *actor)
1159 1160 1161 1162
{
	struct pipe_inode_info *pipe;
	long ret, bytes;
	umode_t i_mode;
J
Jens Axboe 已提交
1163
	size_t len;
1164
	int i, flags, more;
1165 1166 1167 1168 1169 1170

	/*
	 * We require the input being a regular file, as we don't want to
	 * randomly drop data for eg socket -> socket splicing. Use the
	 * piped splicing for that!
	 */
A
Al Viro 已提交
1171
	i_mode = file_inode(in)->i_mode;
1172 1173 1174 1175 1176 1177 1178 1179
	if (unlikely(!S_ISREG(i_mode) && !S_ISBLK(i_mode)))
		return -EINVAL;

	/*
	 * neither in nor out is a pipe, setup an internal pipe attached to
	 * 'out' and transfer the wanted data from 'in' to 'out' through that
	 */
	pipe = current->splice_pipe;
1180
	if (unlikely(!pipe)) {
A
Al Viro 已提交
1181
		pipe = alloc_pipe_info();
1182 1183 1184 1185 1186
		if (!pipe)
			return -ENOMEM;

		/*
		 * We don't have an immediate reader, but we'll read the stuff
1187
		 * out of the pipe right after the splice_to_pipe(). So set
1188 1189 1190 1191 1192 1193 1194 1195
		 * PIPE_READERS appropriately.
		 */
		pipe->readers = 1;

		current->splice_pipe = pipe;
	}

	/*
I
Ingo Molnar 已提交
1196
	 * Do the splice.
1197 1198 1199
	 */
	ret = 0;
	bytes = 0;
J
Jens Axboe 已提交
1200 1201 1202 1203 1204 1205 1206
	len = sd->total_len;
	flags = sd->flags;

	/*
	 * Don't block on output, we have to drain the direct pipe.
	 */
	sd->flags &= ~SPLICE_F_NONBLOCK;
1207
	more = sd->flags & SPLICE_F_MORE;
1208 1209

	while (len) {
1210
		size_t read_len;
1211
		loff_t pos = sd->pos, prev_pos = pos;
1212

1213
		ret = do_splice_to(in, &pos, pipe, len, flags);
1214
		if (unlikely(ret <= 0))
1215 1216 1217
			goto out_release;

		read_len = ret;
J
Jens Axboe 已提交
1218
		sd->total_len = read_len;
1219

1220 1221 1222 1223 1224 1225 1226 1227 1228
		/*
		 * If more data is pending, set SPLICE_F_MORE
		 * If this is the last data and SPLICE_F_MORE was not set
		 * initially, clears it.
		 */
		if (read_len < len)
			sd->flags |= SPLICE_F_MORE;
		else if (!more)
			sd->flags &= ~SPLICE_F_MORE;
1229 1230 1231 1232 1233
		/*
		 * NOTE: nonblocking mode only applies to the input. We
		 * must not do the output in nonblocking mode as then we
		 * could get stuck data in the internal pipe:
		 */
J
Jens Axboe 已提交
1234
		ret = actor(pipe, sd);
1235 1236
		if (unlikely(ret <= 0)) {
			sd->pos = prev_pos;
1237
			goto out_release;
1238
		}
1239 1240 1241

		bytes += ret;
		len -= ret;
1242
		sd->pos = pos;
1243

1244 1245
		if (ret < read_len) {
			sd->pos = prev_pos + ret;
1246
			goto out_release;
1247
		}
1248 1249
	}

1250
done:
1251
	pipe->nrbufs = pipe->curbuf = 0;
1252
	file_accessed(in);
1253 1254 1255 1256 1257 1258 1259
	return bytes;

out_release:
	/*
	 * If we did an incomplete transfer we must release
	 * the pipe buffers in question:
	 */
1260
	for (i = 0; i < pipe->buffers; i++) {
1261 1262 1263 1264 1265 1266 1267 1268
		struct pipe_buffer *buf = pipe->bufs + i;

		if (buf->ops) {
			buf->ops->release(pipe, buf);
			buf->ops = NULL;
		}
	}

1269 1270
	if (!bytes)
		bytes = ret;
J
Jens Axboe 已提交
1271

1272
	goto done;
J
Jens Axboe 已提交
1273 1274 1275 1276 1277 1278
}
EXPORT_SYMBOL(splice_direct_to_actor);

static int direct_splice_actor(struct pipe_inode_info *pipe,
			       struct splice_desc *sd)
{
1279
	struct file *file = sd->u.file;
J
Jens Axboe 已提交
1280

1281
	return do_splice_from(pipe, file, sd->opos, sd->total_len,
1282
			      sd->flags);
J
Jens Axboe 已提交
1283 1284
}

1285 1286 1287 1288 1289
/**
 * do_splice_direct - splices data directly between two files
 * @in:		file to splice from
 * @ppos:	input file offset
 * @out:	file to splice to
1290
 * @opos:	output file offset
1291 1292 1293 1294 1295 1296 1297 1298 1299 1300
 * @len:	number of bytes to splice
 * @flags:	splice modifier flags
 *
 * Description:
 *    For use by do_sendfile(). splice can easily emulate sendfile, but
 *    doing it in the application would incur an extra system call
 *    (splice in + splice out, as compared to just sendfile()). So this helper
 *    can splice directly through a process-private pipe.
 *
 */
J
Jens Axboe 已提交
1301
long do_splice_direct(struct file *in, loff_t *ppos, struct file *out,
1302
		      loff_t *opos, size_t len, unsigned int flags)
J
Jens Axboe 已提交
1303 1304 1305 1306 1307 1308
{
	struct splice_desc sd = {
		.len		= len,
		.total_len	= len,
		.flags		= flags,
		.pos		= *ppos,
1309
		.u.file		= out,
1310
		.opos		= opos,
J
Jens Axboe 已提交
1311
	};
1312
	long ret;
J
Jens Axboe 已提交
1313

1314 1315 1316 1317 1318 1319 1320 1321 1322 1323
	if (unlikely(!(out->f_mode & FMODE_WRITE)))
		return -EBADF;

	if (unlikely(out->f_flags & O_APPEND))
		return -EINVAL;

	ret = rw_verify_area(WRITE, out, opos, len);
	if (unlikely(ret < 0))
		return ret;

J
Jens Axboe 已提交
1324
	ret = splice_direct_to_actor(in, &sd, direct_splice_actor);
1325
	if (ret > 0)
1326
		*ppos = sd.pos;
1327

J
Jens Axboe 已提交
1328
	return ret;
1329
}
1330
EXPORT_SYMBOL(do_splice_direct);
1331

1332 1333 1334
static int splice_pipe_to_pipe(struct pipe_inode_info *ipipe,
			       struct pipe_inode_info *opipe,
			       size_t len, unsigned int flags);
1335

1336 1337 1338
/*
 * Determine where to splice to/from.
 */
1339 1340 1341
static long do_splice(struct file *in, loff_t __user *off_in,
		      struct file *out, loff_t __user *off_out,
		      size_t len, unsigned int flags)
1342
{
1343 1344
	struct pipe_inode_info *ipipe;
	struct pipe_inode_info *opipe;
1345
	loff_t offset;
J
Jens Axboe 已提交
1346
	long ret;
1347

1348 1349
	ipipe = get_pipe_info(in);
	opipe = get_pipe_info(out);
1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368

	if (ipipe && opipe) {
		if (off_in || off_out)
			return -ESPIPE;

		if (!(in->f_mode & FMODE_READ))
			return -EBADF;

		if (!(out->f_mode & FMODE_WRITE))
			return -EBADF;

		/* Splicing to self would be fun, but... */
		if (ipipe == opipe)
			return -EINVAL;

		return splice_pipe_to_pipe(ipipe, opipe, len, flags);
	}

	if (ipipe) {
1369 1370
		if (off_in)
			return -ESPIPE;
1371
		if (off_out) {
1372
			if (!(out->f_mode & FMODE_PWRITE))
1373
				return -EINVAL;
1374
			if (copy_from_user(&offset, off_out, sizeof(loff_t)))
1375
				return -EFAULT;
1376 1377 1378
		} else {
			offset = out->f_pos;
		}
1379

1380 1381 1382 1383 1384 1385 1386 1387 1388 1389
		if (unlikely(!(out->f_mode & FMODE_WRITE)))
			return -EBADF;

		if (unlikely(out->f_flags & O_APPEND))
			return -EINVAL;

		ret = rw_verify_area(WRITE, out, &offset, len);
		if (unlikely(ret < 0))
			return ret;

1390
		file_start_write(out);
1391
		ret = do_splice_from(ipipe, out, &offset, len, flags);
1392
		file_end_write(out);
J
Jens Axboe 已提交
1393

1394 1395 1396
		if (!off_out)
			out->f_pos = offset;
		else if (copy_to_user(off_out, &offset, sizeof(loff_t)))
J
Jens Axboe 已提交
1397 1398 1399
			ret = -EFAULT;

		return ret;
1400
	}
1401

1402
	if (opipe) {
1403 1404
		if (off_out)
			return -ESPIPE;
1405
		if (off_in) {
1406
			if (!(in->f_mode & FMODE_PREAD))
1407
				return -EINVAL;
1408
			if (copy_from_user(&offset, off_in, sizeof(loff_t)))
1409
				return -EFAULT;
1410 1411 1412
		} else {
			offset = in->f_pos;
		}
1413

1414
		ret = do_splice_to(in, &offset, opipe, len, flags);
J
Jens Axboe 已提交
1415

1416 1417 1418
		if (!off_in)
			in->f_pos = offset;
		else if (copy_to_user(off_in, &offset, sizeof(loff_t)))
J
Jens Axboe 已提交
1419 1420 1421
			ret = -EFAULT;

		return ret;
1422
	}
1423 1424 1425 1426

	return -EINVAL;
}

1427 1428 1429 1430 1431 1432 1433 1434 1435
/*
 * Map an iov into an array of pages and offset/length tupples. With the
 * partial_page structure, we can map several non-contiguous ranges into
 * our ones pages[] map instead of splitting that operation into pieces.
 * Could easily be exported as a generic helper for other users, in which
 * case one would probably want to add a 'max_nr_pages' parameter as well.
 */
static int get_iovec_page_array(const struct iovec __user *iov,
				unsigned int nr_vecs, struct page **pages,
1436
				struct partial_page *partial, bool aligned,
1437
				unsigned int pipe_buffers)
1438 1439 1440 1441 1442
{
	int buffers = 0, error = 0;

	while (nr_vecs) {
		unsigned long off, npages;
1443
		struct iovec entry;
1444 1445 1446 1447
		void __user *base;
		size_t len;
		int i;

1448
		error = -EFAULT;
N
Nick Piggin 已提交
1449
		if (copy_from_user(&entry, iov, sizeof(entry)))
1450 1451
			break;

1452 1453 1454
		base = entry.iov_base;
		len = entry.iov_len;

1455 1456 1457
		/*
		 * Sanity check this iovec. 0 read succeeds.
		 */
1458
		error = 0;
1459 1460 1461
		if (unlikely(!len))
			break;
		error = -EFAULT;
1462
		if (!access_ok(VERIFY_READ, base, len))
1463 1464 1465 1466 1467 1468 1469
			break;

		/*
		 * Get this base offset and number of pages, then map
		 * in the user pages.
		 */
		off = (unsigned long) base & ~PAGE_MASK;
1470 1471 1472 1473 1474 1475 1476 1477 1478

		/*
		 * If asked for alignment, the offset must be zero and the
		 * length a multiple of the PAGE_SIZE.
		 */
		error = -EINVAL;
		if (aligned && (off || len & ~PAGE_MASK))
			break;

1479
		npages = (off + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
1480 1481
		if (npages > pipe_buffers - buffers)
			npages = pipe_buffers - buffers;
1482

N
Nick Piggin 已提交
1483 1484
		error = get_user_pages_fast((unsigned long)base, npages,
					0, &pages[buffers]);
1485 1486 1487 1488 1489 1490 1491 1492

		if (unlikely(error <= 0))
			break;

		/*
		 * Fill this contiguous range into the partial page map.
		 */
		for (i = 0; i < error; i++) {
1493
			const int plen = min_t(size_t, len, PAGE_SIZE - off);
1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515

			partial[buffers].offset = off;
			partial[buffers].len = plen;

			off = 0;
			len -= plen;
			buffers++;
		}

		/*
		 * We didn't complete this iov, stop here since it probably
		 * means we have to move some of this into a pipe to
		 * be able to continue.
		 */
		if (len)
			break;

		/*
		 * Don't continue if we mapped fewer pages than we asked for,
		 * or if we mapped the max number of pages that we have
		 * room for.
		 */
1516
		if (error < npages || buffers == pipe_buffers)
1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528
			break;

		nr_vecs--;
		iov++;
	}

	if (buffers)
		return buffers;

	return error;
}

1529 1530 1531
static int pipe_to_user(struct pipe_inode_info *pipe, struct pipe_buffer *buf,
			struct splice_desc *sd)
{
1532 1533
	int n = copy_page_to_iter(buf->page, buf->offset, sd->len, sd->u.data);
	return n == sd->len ? n : -EFAULT;
1534 1535 1536 1537 1538 1539
}

/*
 * For lack of a better implementation, implement vmsplice() to userspace
 * as a simple copy of the pipes pages to the user iov.
 */
1540
static long vmsplice_to_user(struct file *file, const struct iovec __user *uiov,
1541 1542 1543 1544 1545
			     unsigned long nr_segs, unsigned int flags)
{
	struct pipe_inode_info *pipe;
	struct splice_desc sd;
	long ret;
1546 1547 1548
	struct iovec iovstack[UIO_FASTIOV];
	struct iovec *iov = iovstack;
	struct iov_iter iter;
1549

1550
	pipe = get_pipe_info(file);
1551 1552 1553
	if (!pipe)
		return -EBADF;

1554 1555 1556 1557
	ret = import_iovec(READ, uiov, nr_segs,
			   ARRAY_SIZE(iovstack), &iov, &iter);
	if (ret < 0)
		return ret;
1558

1559
	sd.total_len = iov_iter_count(&iter);
1560 1561 1562 1563
	sd.len = 0;
	sd.flags = flags;
	sd.u.data = &iter;
	sd.pos = 0;
1564

1565 1566 1567 1568 1569
	if (sd.total_len) {
		pipe_lock(pipe);
		ret = __splice_from_pipe(pipe, &sd, pipe_to_user);
		pipe_unlock(pipe);
	}
1570

1571
	kfree(iov);
1572 1573 1574
	return ret;
}

1575 1576 1577 1578 1579
/*
 * vmsplice splices a user address range into a pipe. It can be thought of
 * as splice-from-memory, where the regular splice is splice-from-file (or
 * to file). In both cases the output is a pipe, naturally.
 */
1580 1581
static long vmsplice_to_pipe(struct file *file, const struct iovec __user *iov,
			     unsigned long nr_segs, unsigned int flags)
1582
{
1583
	struct pipe_inode_info *pipe;
1584 1585
	struct page *pages[PIPE_DEF_BUFFERS];
	struct partial_page partial[PIPE_DEF_BUFFERS];
1586 1587 1588
	struct splice_pipe_desc spd = {
		.pages = pages,
		.partial = partial,
1589
		.nr_pages_max = PIPE_DEF_BUFFERS,
1590 1591
		.flags = flags,
		.ops = &user_page_pipe_buf_ops,
1592
		.spd_release = spd_release_page,
1593
	};
1594
	long ret;
1595

1596
	pipe = get_pipe_info(file);
1597
	if (!pipe)
1598 1599
		return -EBADF;

1600 1601 1602 1603
	if (splice_grow_spd(pipe, &spd))
		return -ENOMEM;

	spd.nr_pages = get_iovec_page_array(iov, nr_segs, spd.pages,
1604
					    spd.partial, false,
1605
					    spd.nr_pages_max);
1606
	if (spd.nr_pages <= 0)
1607 1608 1609
		ret = spd.nr_pages;
	else
		ret = splice_to_pipe(pipe, &spd);
1610

1611
	splice_shrink_spd(&spd);
1612
	return ret;
1613 1614
}

1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630
/*
 * Note that vmsplice only really supports true splicing _from_ user memory
 * to a pipe, not the other way around. Splicing from user memory is a simple
 * operation that can be supported without any funky alignment restrictions
 * or nasty vm tricks. We simply map in the user memory and fill them into
 * a pipe. The reverse isn't quite as easy, though. There are two possible
 * solutions for that:
 *
 *	- memcpy() the data internally, at which point we might as well just
 *	  do a regular read() on the buffer anyway.
 *	- Lots of nasty vm tricks, that are neither fast nor flexible (it
 *	  has restriction limitations on both ends of the pipe).
 *
 * Currently we punt and implement it as a normal copy, see pipe_to_user().
 *
 */
1631 1632
SYSCALL_DEFINE4(vmsplice, int, fd, const struct iovec __user *, iov,
		unsigned long, nr_segs, unsigned int, flags)
1633
{
1634
	struct fd f;
1635 1636
	long error;

1637 1638 1639 1640 1641
	if (unlikely(nr_segs > UIO_MAXIOV))
		return -EINVAL;
	else if (unlikely(!nr_segs))
		return 0;

1642
	error = -EBADF;
1643 1644 1645 1646 1647 1648 1649 1650
	f = fdget(fd);
	if (f.file) {
		if (f.file->f_mode & FMODE_WRITE)
			error = vmsplice_to_pipe(f.file, iov, nr_segs, flags);
		else if (f.file->f_mode & FMODE_READ)
			error = vmsplice_to_user(f.file, iov, nr_segs, flags);

		fdput(f);
1651 1652 1653 1654 1655
	}

	return error;
}

1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676
#ifdef CONFIG_COMPAT
COMPAT_SYSCALL_DEFINE4(vmsplice, int, fd, const struct compat_iovec __user *, iov32,
		    unsigned int, nr_segs, unsigned int, flags)
{
	unsigned i;
	struct iovec __user *iov;
	if (nr_segs > UIO_MAXIOV)
		return -EINVAL;
	iov = compat_alloc_user_space(nr_segs * sizeof(struct iovec));
	for (i = 0; i < nr_segs; i++) {
		struct compat_iovec v;
		if (get_user(v.iov_base, &iov32[i].iov_base) ||
		    get_user(v.iov_len, &iov32[i].iov_len) ||
		    put_user(compat_ptr(v.iov_base), &iov[i].iov_base) ||
		    put_user(v.iov_len, &iov[i].iov_len))
			return -EFAULT;
	}
	return sys_vmsplice(fd, iov, nr_segs, flags);
}
#endif

1677 1678 1679
SYSCALL_DEFINE6(splice, int, fd_in, loff_t __user *, off_in,
		int, fd_out, loff_t __user *, off_out,
		size_t, len, unsigned int, flags)
1680
{
1681
	struct fd in, out;
1682 1683 1684 1685 1686 1687
	long error;

	if (unlikely(!len))
		return 0;

	error = -EBADF;
1688 1689 1690 1691 1692 1693 1694 1695
	in = fdget(fd_in);
	if (in.file) {
		if (in.file->f_mode & FMODE_READ) {
			out = fdget(fd_out);
			if (out.file) {
				if (out.file->f_mode & FMODE_WRITE)
					error = do_splice(in.file, off_in,
							  out.file, off_out,
1696
							  len, flags);
1697
				fdput(out);
1698 1699
			}
		}
1700
		fdput(in);
1701 1702 1703
	}
	return error;
}
1704

1705 1706 1707 1708
/*
 * Make sure there's data to read. Wait for input if we can, otherwise
 * return an appropriate error.
 */
1709
static int ipipe_prep(struct pipe_inode_info *pipe, unsigned int flags)
1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720
{
	int ret;

	/*
	 * Check ->nrbufs without the inode lock first. This function
	 * is speculative anyways, so missing one is ok.
	 */
	if (pipe->nrbufs)
		return 0;

	ret = 0;
1721
	pipe_lock(pipe);
1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738

	while (!pipe->nrbufs) {
		if (signal_pending(current)) {
			ret = -ERESTARTSYS;
			break;
		}
		if (!pipe->writers)
			break;
		if (!pipe->waiting_writers) {
			if (flags & SPLICE_F_NONBLOCK) {
				ret = -EAGAIN;
				break;
			}
		}
		pipe_wait(pipe);
	}

1739
	pipe_unlock(pipe);
1740 1741 1742 1743 1744 1745 1746
	return ret;
}

/*
 * Make sure there's writeable room. Wait for room if we can, otherwise
 * return an appropriate error.
 */
1747
static int opipe_prep(struct pipe_inode_info *pipe, unsigned int flags)
1748 1749 1750 1751 1752 1753 1754
{
	int ret;

	/*
	 * Check ->nrbufs without the inode lock first. This function
	 * is speculative anyways, so missing one is ok.
	 */
1755
	if (pipe->nrbufs < pipe->buffers)
1756 1757 1758
		return 0;

	ret = 0;
1759
	pipe_lock(pipe);
1760

1761
	while (pipe->nrbufs >= pipe->buffers) {
1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779
		if (!pipe->readers) {
			send_sig(SIGPIPE, current, 0);
			ret = -EPIPE;
			break;
		}
		if (flags & SPLICE_F_NONBLOCK) {
			ret = -EAGAIN;
			break;
		}
		if (signal_pending(current)) {
			ret = -ERESTARTSYS;
			break;
		}
		pipe->waiting_writers++;
		pipe_wait(pipe);
		pipe->waiting_writers--;
	}

1780
	pipe_unlock(pipe);
1781 1782 1783
	return ret;
}

1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826
/*
 * Splice contents of ipipe to opipe.
 */
static int splice_pipe_to_pipe(struct pipe_inode_info *ipipe,
			       struct pipe_inode_info *opipe,
			       size_t len, unsigned int flags)
{
	struct pipe_buffer *ibuf, *obuf;
	int ret = 0, nbuf;
	bool input_wakeup = false;


retry:
	ret = ipipe_prep(ipipe, flags);
	if (ret)
		return ret;

	ret = opipe_prep(opipe, flags);
	if (ret)
		return ret;

	/*
	 * Potential ABBA deadlock, work around it by ordering lock
	 * grabbing by pipe info address. Otherwise two different processes
	 * could deadlock (one doing tee from A -> B, the other from B -> A).
	 */
	pipe_double_lock(ipipe, opipe);

	do {
		if (!opipe->readers) {
			send_sig(SIGPIPE, current, 0);
			if (!ret)
				ret = -EPIPE;
			break;
		}

		if (!ipipe->nrbufs && !ipipe->writers)
			break;

		/*
		 * Cannot make any progress, because either the input
		 * pipe is empty or the output pipe is full.
		 */
1827
		if (!ipipe->nrbufs || opipe->nrbufs >= opipe->buffers) {
1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847
			/* Already processed some buffers, break */
			if (ret)
				break;

			if (flags & SPLICE_F_NONBLOCK) {
				ret = -EAGAIN;
				break;
			}

			/*
			 * We raced with another reader/writer and haven't
			 * managed to process any buffers.  A zero return
			 * value means EOF, so retry instead.
			 */
			pipe_unlock(ipipe);
			pipe_unlock(opipe);
			goto retry;
		}

		ibuf = ipipe->bufs + ipipe->curbuf;
1848
		nbuf = (opipe->curbuf + opipe->nrbufs) & (opipe->buffers - 1);
1849 1850 1851 1852 1853 1854 1855 1856 1857
		obuf = opipe->bufs + nbuf;

		if (len >= ibuf->len) {
			/*
			 * Simply move the whole buffer from ipipe to opipe
			 */
			*obuf = *ibuf;
			ibuf->ops = NULL;
			opipe->nrbufs++;
1858
			ipipe->curbuf = (ipipe->curbuf + 1) & (ipipe->buffers - 1);
1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889
			ipipe->nrbufs--;
			input_wakeup = true;
		} else {
			/*
			 * Get a reference to this pipe buffer,
			 * so we can copy the contents over.
			 */
			ibuf->ops->get(ipipe, ibuf);
			*obuf = *ibuf;

			/*
			 * Don't inherit the gift flag, we need to
			 * prevent multiple steals of this page.
			 */
			obuf->flags &= ~PIPE_BUF_FLAG_GIFT;

			obuf->len = len;
			opipe->nrbufs++;
			ibuf->offset += obuf->len;
			ibuf->len -= obuf->len;
		}
		ret += obuf->len;
		len -= obuf->len;
	} while (len);

	pipe_unlock(ipipe);
	pipe_unlock(opipe);

	/*
	 * If we put data in the output pipe, wakeup any potential readers.
	 */
N
Namhyung Kim 已提交
1890 1891 1892
	if (ret > 0)
		wakeup_pipe_readers(opipe);

1893 1894 1895 1896 1897 1898
	if (input_wakeup)
		wakeup_pipe_writers(ipipe);

	return ret;
}

1899 1900 1901 1902 1903 1904 1905 1906
/*
 * Link contents of ipipe to opipe.
 */
static int link_pipe(struct pipe_inode_info *ipipe,
		     struct pipe_inode_info *opipe,
		     size_t len, unsigned int flags)
{
	struct pipe_buffer *ibuf, *obuf;
1907
	int ret = 0, i = 0, nbuf;
1908 1909 1910

	/*
	 * Potential ABBA deadlock, work around it by ordering lock
1911
	 * grabbing by pipe info address. Otherwise two different processes
1912 1913
	 * could deadlock (one doing tee from A -> B, the other from B -> A).
	 */
1914
	pipe_double_lock(ipipe, opipe);
1915

1916
	do {
1917 1918 1919 1920 1921 1922 1923
		if (!opipe->readers) {
			send_sig(SIGPIPE, current, 0);
			if (!ret)
				ret = -EPIPE;
			break;
		}

1924 1925 1926 1927
		/*
		 * If we have iterated all input buffers or ran out of
		 * output room, break.
		 */
1928
		if (i >= ipipe->nrbufs || opipe->nrbufs >= opipe->buffers)
1929
			break;
1930

1931 1932
		ibuf = ipipe->bufs + ((ipipe->curbuf + i) & (ipipe->buffers-1));
		nbuf = (opipe->curbuf + opipe->nrbufs) & (opipe->buffers - 1);
1933 1934

		/*
1935 1936
		 * Get a reference to this pipe buffer,
		 * so we can copy the contents over.
1937
		 */
1938 1939 1940 1941 1942
		ibuf->ops->get(ipipe, ibuf);

		obuf = opipe->bufs + nbuf;
		*obuf = *ibuf;

1943
		/*
1944 1945
		 * Don't inherit the gift flag, we need to
		 * prevent multiple steals of this page.
1946
		 */
1947
		obuf->flags &= ~PIPE_BUF_FLAG_GIFT;
1948

1949 1950
		if (obuf->len > len)
			obuf->len = len;
1951

1952 1953 1954 1955 1956
		opipe->nrbufs++;
		ret += obuf->len;
		len -= obuf->len;
		i++;
	} while (len);
1957

1958 1959 1960 1961 1962 1963 1964
	/*
	 * return EAGAIN if we have the potential of some data in the
	 * future, otherwise just return 0
	 */
	if (!ret && ipipe->waiting_writers && (flags & SPLICE_F_NONBLOCK))
		ret = -EAGAIN;

1965 1966
	pipe_unlock(ipipe);
	pipe_unlock(opipe);
1967

1968 1969 1970
	/*
	 * If we put data in the output pipe, wakeup any potential readers.
	 */
N
Namhyung Kim 已提交
1971 1972
	if (ret > 0)
		wakeup_pipe_readers(opipe);
1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985

	return ret;
}

/*
 * This is a tee(1) implementation that works on pipes. It doesn't copy
 * any data, it simply references the 'in' pages on the 'out' pipe.
 * The 'flags' used are the SPLICE_F_* variants, currently the only
 * applicable one is SPLICE_F_NONBLOCK.
 */
static long do_tee(struct file *in, struct file *out, size_t len,
		   unsigned int flags)
{
1986 1987
	struct pipe_inode_info *ipipe = get_pipe_info(in);
	struct pipe_inode_info *opipe = get_pipe_info(out);
1988
	int ret = -EINVAL;
1989 1990

	/*
1991 1992
	 * Duplicate the contents of ipipe to opipe without actually
	 * copying the data.
1993
	 */
1994 1995 1996 1997 1998
	if (ipipe && opipe && ipipe != opipe) {
		/*
		 * Keep going, unless we encounter an error. The ipipe/opipe
		 * ordering doesn't really matter.
		 */
1999
		ret = ipipe_prep(ipipe, flags);
2000
		if (!ret) {
2001
			ret = opipe_prep(opipe, flags);
2002
			if (!ret)
2003 2004 2005
				ret = link_pipe(ipipe, opipe, len, flags);
		}
	}
2006

2007
	return ret;
2008 2009
}

2010
SYSCALL_DEFINE4(tee, int, fdin, int, fdout, size_t, len, unsigned int, flags)
2011
{
2012 2013
	struct fd in;
	int error;
2014 2015 2016 2017 2018

	if (unlikely(!len))
		return 0;

	error = -EBADF;
2019 2020 2021 2022 2023 2024 2025 2026 2027
	in = fdget(fdin);
	if (in.file) {
		if (in.file->f_mode & FMODE_READ) {
			struct fd out = fdget(fdout);
			if (out.file) {
				if (out.file->f_mode & FMODE_WRITE)
					error = do_tee(in.file, out.file,
							len, flags);
				fdput(out);
2028 2029
			}
		}
2030
 		fdput(in);
2031 2032 2033 2034
 	}

	return error;
}