splice.c 38.9 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>
24
#include <linux/mm_inline.h>
25
#include <linux/swap.h>
26 27
#include <linux/writeback.h>
#include <linux/buffer_head.h>
J
Jeff Garzik 已提交
28
#include <linux/module.h>
29
#include <linux/syscalls.h>
30
#include <linux/uio.h>
31
#include <linux/security.h>
32

33 34 35 36 37 38
/*
 * 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.
 */
39
static int page_cache_pipe_buf_steal(struct pipe_inode_info *pipe,
40 41 42
				     struct pipe_buffer *buf)
{
	struct page *page = buf->page;
43
	struct address_space *mapping;
44

45 46
	lock_page(page);

47 48 49
	mapping = page_mapping(page);
	if (mapping) {
		WARN_ON(!PageUptodate(page));
50

51 52 53 54 55 56 57 58 59
		/*
		 * 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);
60

61 62
		if (PagePrivate(page) && !try_to_release_page(page, GFP_KERNEL))
			goto out_unlock;
63

64 65 66 67 68 69 70 71
		/*
		 * 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;
		}
72
	}
73

74 75 76 77
	/*
	 * Raced with truncate or failed to remove page from current
	 * address space, unlock and return failure.
	 */
78
out_unlock:
79 80
	unlock_page(page);
	return 1;
81 82
}

83
static void page_cache_pipe_buf_release(struct pipe_inode_info *pipe,
84 85 86
					struct pipe_buffer *buf)
{
	page_cache_release(buf->page);
J
Jens Axboe 已提交
87
	buf->flags &= ~PIPE_BUF_FLAG_LRU;
88 89
}

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

	if (!PageUptodate(page)) {
101 102 103 104
		lock_page(page);

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

112
		/*
I
Ingo Molnar 已提交
113
		 * Uh oh, read-error from disk.
114 115 116 117 118 119 120
		 */
		if (!PageUptodate(page)) {
			err = -EIO;
			goto error;
		}

		/*
121
		 * Page is ok afterall, we are done.
122
		 */
123 124 125
		unlock_page(page);
	}

126
	return 0;
127 128
error:
	unlock_page(page);
129
	return err;
130 131
}

132
static const struct pipe_buf_operations page_cache_pipe_buf_ops = {
133
	.can_merge = 0,
134 135
	.map = generic_pipe_buf_map,
	.unmap = generic_pipe_buf_unmap,
136
	.confirm = page_cache_pipe_buf_confirm,
137
	.release = page_cache_pipe_buf_release,
138
	.steal = page_cache_pipe_buf_steal,
139
	.get = generic_pipe_buf_get,
140 141
};

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

J
Jens Axboe 已提交
148
	buf->flags |= PIPE_BUF_FLAG_LRU;
149
	return generic_pipe_buf_steal(pipe, buf);
150 151
}

152
static const struct pipe_buf_operations user_page_pipe_buf_ops = {
153
	.can_merge = 0,
154 155
	.map = generic_pipe_buf_map,
	.unmap = generic_pipe_buf_unmap,
156
	.confirm = generic_pipe_buf_confirm,
157 158
	.release = page_cache_pipe_buf_release,
	.steal = user_page_pipe_buf_steal,
159
	.get = generic_pipe_buf_get,
160 161
};

162 163 164 165 166 167
/**
 * splice_to_pipe - fill passed data into a pipe
 * @pipe:	pipe to fill
 * @spd:	data to fill
 *
 * Description:
R
Randy Dunlap 已提交
168
 *    @spd contains a map of pages and len/offset tuples, along with
169 170 171
 *    the struct pipe_buf_operations associated with these pages. This
 *    function will link that data to the pipe.
 *
172
 */
173 174
ssize_t splice_to_pipe(struct pipe_inode_info *pipe,
		       struct splice_pipe_desc *spd)
175
{
176
	unsigned int spd_pages = spd->nr_pages;
177
	int ret, do_wakeup, page_nr;
178 179 180

	ret = 0;
	do_wakeup = 0;
181
	page_nr = 0;
182

183 184
	if (pipe->inode)
		mutex_lock(&pipe->inode->i_mutex);
185 186

	for (;;) {
187
		if (!pipe->readers) {
188 189 190 191 192 193
			send_sig(SIGPIPE, current, 0);
			if (!ret)
				ret = -EPIPE;
			break;
		}

194 195
		if (pipe->nrbufs < PIPE_BUFFERS) {
			int newbuf = (pipe->curbuf + pipe->nrbufs) & (PIPE_BUFFERS - 1);
196
			struct pipe_buffer *buf = pipe->bufs + newbuf;
197

198 199 200
			buf->page = spd->pages[page_nr];
			buf->offset = spd->partial[page_nr].offset;
			buf->len = spd->partial[page_nr].len;
201
			buf->private = spd->partial[page_nr].private;
202
			buf->ops = spd->ops;
203 204 205
			if (spd->flags & SPLICE_F_GIFT)
				buf->flags |= PIPE_BUF_FLAG_GIFT;

206
			pipe->nrbufs++;
207 208 209
			page_nr++;
			ret += buf->len;

210 211
			if (pipe->inode)
				do_wakeup = 1;
212

213
			if (!--spd->nr_pages)
214
				break;
215
			if (pipe->nrbufs < PIPE_BUFFERS)
216 217 218 219 220
				continue;

			break;
		}

221
		if (spd->flags & SPLICE_F_NONBLOCK) {
222 223 224 225 226
			if (!ret)
				ret = -EAGAIN;
			break;
		}

227 228 229 230 231 232 233
		if (signal_pending(current)) {
			if (!ret)
				ret = -ERESTARTSYS;
			break;
		}

		if (do_wakeup) {
234
			smp_mb();
235 236 237
			if (waitqueue_active(&pipe->wait))
				wake_up_interruptible_sync(&pipe->wait);
			kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
238 239 240
			do_wakeup = 0;
		}

241 242 243
		pipe->waiting_writers++;
		pipe_wait(pipe);
		pipe->waiting_writers--;
244 245
	}

246
	if (pipe->inode) {
247
		mutex_unlock(&pipe->inode->i_mutex);
248

249 250 251 252 253 254
		if (do_wakeup) {
			smp_mb();
			if (waitqueue_active(&pipe->wait))
				wake_up_interruptible(&pipe->wait);
			kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
		}
255 256
	}

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

	return ret;
}

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

268
static int
269 270 271
__generic_file_splice_read(struct file *in, loff_t *ppos,
			   struct pipe_inode_info *pipe, size_t len,
			   unsigned int flags)
272 273
{
	struct address_space *mapping = in->f_mapping;
F
Fengguang Wu 已提交
274
	unsigned int loff, nr_pages, req_pages;
275
	struct page *pages[PIPE_BUFFERS];
276
	struct partial_page partial[PIPE_BUFFERS];
277
	struct page *page;
278 279
	pgoff_t index, end_index;
	loff_t isize;
280
	int error, page_nr;
281 282 283 284 285
	struct splice_pipe_desc spd = {
		.pages = pages,
		.partial = partial,
		.flags = flags,
		.ops = &page_cache_pipe_buf_ops,
286
		.spd_release = spd_release_page,
287
	};
288

289
	index = *ppos >> PAGE_CACHE_SHIFT;
290
	loff = *ppos & ~PAGE_CACHE_MASK;
F
Fengguang Wu 已提交
291 292
	req_pages = (len + loff + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
	nr_pages = min(req_pages, (unsigned)PIPE_BUFFERS);
293

294 295 296 297
	/*
	 * Lookup the (hopefully) full range of pages we need.
	 */
	spd.nr_pages = find_get_pages_contig(mapping, index, nr_pages, pages);
298
	index += spd.nr_pages;
299

300 301
	/*
	 * If find_get_pages_contig() returned fewer pages than we needed,
302
	 * readahead/allocate the rest and fill in the holes.
303
	 */
304
	if (spd.nr_pages < nr_pages)
305 306
		page_cache_sync_readahead(mapping, &in->f_ra, in,
				index, req_pages - spd.nr_pages);
307

308
	error = 0;
309
	while (spd.nr_pages < nr_pages) {
310
		/*
311 312
		 * Page could be there, find_get_pages_contig() breaks on
		 * the first hole.
313
		 */
314 315 316
		page = find_get_page(mapping, index);
		if (!page) {
			/*
317
			 * page didn't exist, allocate one.
318 319 320 321 322 323
			 */
			page = page_cache_alloc_cold(mapping);
			if (!page)
				break;

			error = add_to_page_cache_lru(page, mapping, index,
H
Hugh Dickins 已提交
324
						mapping_gfp_mask(mapping));
325 326
			if (unlikely(error)) {
				page_cache_release(page);
327 328
				if (error == -EEXIST)
					continue;
329 330
				break;
			}
331 332 333 334 335
			/*
			 * add_to_page_cache() locks the page, unlock it
			 * to avoid convoluting the logic below even more.
			 */
			unlock_page(page);
336 337
		}

338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360
		pages[spd.nr_pages++] = page;
		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);
		page = pages[page_nr];

361
		if (PageReadahead(page))
362
			page_cache_async_readahead(mapping, &in->f_ra, in,
F
Fengguang Wu 已提交
363
					page, index, req_pages - page_nr);
364

365 366 367 368
		/*
		 * If the page isn't uptodate, we may need to start io on it
		 */
		if (!PageUptodate(page)) {
369 370 371 372
			/*
			 * If in nonblock mode then dont block on waiting
			 * for an in-flight io page
			 */
373
			if (flags & SPLICE_F_NONBLOCK) {
N
Nick Piggin 已提交
374
				if (!trylock_page(page)) {
375
					error = -EAGAIN;
376
					break;
377
				}
378 379
			} else
				lock_page(page);
380 381

			/*
382 383 384 385
			 * 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.
386 387 388
			 */
			if (!page->mapping) {
				unlock_page(page);
389 390 391 392 393 394 395 396 397
				page = find_or_create_page(mapping, index,
						mapping_gfp_mask(mapping));

				if (!page) {
					error = -ENOMEM;
					break;
				}
				page_cache_release(pages[page_nr]);
				pages[page_nr] = page;
398 399 400 401 402 403 404 405
			}
			/*
			 * page was already under io and is now done, great
			 */
			if (PageUptodate(page)) {
				unlock_page(page);
				goto fill_it;
			}
406

407 408 409 410
			/*
			 * need to read in the page
			 */
			error = mapping->a_ops->readpage(in, page);
411
			if (unlikely(error)) {
412 413 414 415 416 417
				/*
				 * 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.
				 */
418
				if (error == AOP_TRUNCATED_PAGE)
419 420
					error = 0;

421 422
				break;
			}
423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438
		}
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;
439 440

			/*
441
			 * max good bytes in this page
442
			 */
443 444
			plen = ((isize - 1) & ~PAGE_CACHE_MASK) + 1;
			if (plen <= loff)
445 446 447
				break;

			/*
448
			 * force quit after adding this page
449
			 */
450 451
			this_len = min(this_len, plen - loff);
			len = this_len;
452
		}
453

454 455
		partial[page_nr].offset = loff;
		partial[page_nr].len = this_len;
456
		len -= this_len;
457
		loff = 0;
458 459
		spd.nr_pages++;
		index++;
460 461
	}

462
	/*
463
	 * Release any pages at the end, if we quit early. 'page_nr' is how far
464 465 466 467
	 * we got, 'nr_pages' is how many pages are in the map.
	 */
	while (page_nr < nr_pages)
		page_cache_release(pages[page_nr++]);
468
	in->f_ra.prev_pos = (loff_t)index << PAGE_CACHE_SHIFT;
469

470
	if (spd.nr_pages)
471
		return splice_to_pipe(pipe, &spd);
472

473
	return error;
474 475
}

476 477 478
/**
 * generic_file_splice_read - splice data from file to a pipe
 * @in:		file to splice from
479
 * @ppos:	position in @in
480 481 482 483
 * @pipe:	pipe to splice to
 * @len:	number of bytes to splice
 * @flags:	splice modifier flags
 *
484 485 486 487 488
 * 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.
 *
489
 */
490 491 492
ssize_t generic_file_splice_read(struct file *in, loff_t *ppos,
				 struct pipe_inode_info *pipe, size_t len,
				 unsigned int flags)
493
{
494
	loff_t isize, left;
495
	int ret;
496 497 498 499 500 501 502 503

	isize = i_size_read(in->f_mapping->host);
	if (unlikely(*ppos >= isize))
		return 0;

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

505 506
	ret = __generic_file_splice_read(in, ppos, pipe, len, flags);
	if (ret > 0)
507
		*ppos += ret;
508 509 510 511

	return ret;
}

512 513
EXPORT_SYMBOL(generic_file_splice_read);

514
/*
515
 * Send 'sd->len' bytes to socket from 'sd->file' at position 'sd->pos'
J
Jens Axboe 已提交
516
 * using sendpage(). Return the number of bytes sent.
517
 */
518
static int pipe_to_sendpage(struct pipe_inode_info *pipe,
519 520
			    struct pipe_buffer *buf, struct splice_desc *sd)
{
521
	struct file *file = sd->u.file;
522
	loff_t pos = sd->pos;
523
	int ret, more;
524

525
	ret = buf->ops->confirm(pipe, buf);
526 527
	if (!ret) {
		more = (sd->flags & SPLICE_F_MORE) || sd->len < sd->total_len;
528

529 530 531
		ret = file->f_op->sendpage(file, buf->page, buf->offset,
					   sd->len, &pos, more);
	}
532

J
Jens Axboe 已提交
533
	return ret;
534 535 536 537 538 539 540 541 542 543 544 545 546 547 548
}

/*
 * This is a little more tricky than the file -> pipe splicing. There are
 * basically three cases:
 *
 *	- Destination page already exists in the address space and there
 *	  are users of it. For that case we have no other option that
 *	  copying the data. Tough luck.
 *	- Destination page already exists in the address space, but there
 *	  are no users of it. Make sure it's uptodate, then drop it. Fall
 *	  through to last case.
 *	- Destination page does not exist, we can add the pipe page to
 *	  the page cache and avoid the copy.
 *
549 550 551 552 553 554
 * If asked to move pages to the output file (SPLICE_F_MOVE is set in
 * sd->flags), we attempt to migrate pages from the pipe to the output
 * file address space page cache. This is possible if no one else has
 * the pipe page referenced outside of the pipe and page cache. If
 * SPLICE_F_MOVE isn't set, or we cannot move the page, we simply create
 * a new page in the output file page cache and fill/dirty that.
555
 */
556
static int pipe_to_file(struct pipe_inode_info *pipe, struct pipe_buffer *buf,
557 558
			struct splice_desc *sd)
{
559
	struct file *file = sd->u.file;
560
	struct address_space *mapping = file->f_mapping;
J
Jens Axboe 已提交
561
	unsigned int offset, this_len;
562
	struct page *page;
563
	void *fsdata;
564
	int ret;
565 566

	/*
567
	 * make sure the data in this buffer is uptodate
568
	 */
569
	ret = buf->ops->confirm(pipe, buf);
570 571
	if (unlikely(ret))
		return ret;
572 573 574

	offset = sd->pos & ~PAGE_CACHE_MASK;

J
Jens Axboe 已提交
575 576 577 578
	this_len = sd->len;
	if (this_len + offset > PAGE_CACHE_SIZE)
		this_len = PAGE_CACHE_SIZE - offset;

579 580 581 582
	ret = pagecache_write_begin(file, mapping, sd->pos, this_len,
				AOP_FLAG_UNINTERRUPTIBLE, &page, &fsdata);
	if (unlikely(ret))
		goto out;
583

584
	if (buf->page != page) {
585 586 587
		/*
		 * Careful, ->map() uses KM_USER0!
		 */
588
		char *src = buf->ops->map(pipe, buf, 1);
589
		char *dst = kmap_atomic(page, KM_USER1);
590

J
Jens Axboe 已提交
591
		memcpy(dst + offset, src + buf->offset, this_len);
592
		flush_dcache_page(page);
593
		kunmap_atomic(dst, KM_USER1);
594
		buf->ops->unmap(pipe, buf, src);
595
	}
596 597
	ret = pagecache_write_end(file, mapping, sd->pos, this_len, this_len,
				page, fsdata);
598 599 600 601
out:
	return ret;
}

602 603 604 605 606 607 608 609 610 611 612 613
/**
 * __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.
 *
614
 */
J
Jens Axboe 已提交
615 616
ssize_t __splice_from_pipe(struct pipe_inode_info *pipe, struct splice_desc *sd,
			   splice_actor *actor)
617 618 619 620 621 622 623
{
	int ret, do_wakeup, err;

	ret = 0;
	do_wakeup = 0;

	for (;;) {
624 625
		if (pipe->nrbufs) {
			struct pipe_buffer *buf = pipe->bufs + pipe->curbuf;
626
			const struct pipe_buf_operations *ops = buf->ops;
627

J
Jens Axboe 已提交
628 629 630
			sd->len = buf->len;
			if (sd->len > sd->total_len)
				sd->len = sd->total_len;
631

J
Jens Axboe 已提交
632
			err = actor(pipe, buf, sd);
J
Jens Axboe 已提交
633
			if (err <= 0) {
634 635 636 637 638 639
				if (!ret && err != -ENODATA)
					ret = err;

				break;
			}

J
Jens Axboe 已提交
640 641 642 643
			ret += err;
			buf->offset += err;
			buf->len -= err;

J
Jens Axboe 已提交
644 645 646 647
			sd->len -= err;
			sd->pos += err;
			sd->total_len -= err;
			if (sd->len)
J
Jens Axboe 已提交
648
				continue;
I
Ingo Molnar 已提交
649

650 651
			if (!buf->len) {
				buf->ops = NULL;
652
				ops->release(pipe, buf);
653 654 655 656
				pipe->curbuf = (pipe->curbuf + 1) & (PIPE_BUFFERS - 1);
				pipe->nrbufs--;
				if (pipe->inode)
					do_wakeup = 1;
657 658
			}

J
Jens Axboe 已提交
659
			if (!sd->total_len)
660 661 662
				break;
		}

663
		if (pipe->nrbufs)
664
			continue;
665
		if (!pipe->writers)
666
			break;
667
		if (!pipe->waiting_writers) {
668 669 670 671
			if (ret)
				break;
		}

J
Jens Axboe 已提交
672
		if (sd->flags & SPLICE_F_NONBLOCK) {
673 674 675 676 677
			if (!ret)
				ret = -EAGAIN;
			break;
		}

678 679 680 681 682 683 684
		if (signal_pending(current)) {
			if (!ret)
				ret = -ERESTARTSYS;
			break;
		}

		if (do_wakeup) {
685
			smp_mb();
686 687 688
			if (waitqueue_active(&pipe->wait))
				wake_up_interruptible_sync(&pipe->wait);
			kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
689 690 691
			do_wakeup = 0;
		}

692
		pipe_wait(pipe);
693 694 695
	}

	if (do_wakeup) {
696
		smp_mb();
697 698 699
		if (waitqueue_active(&pipe->wait))
			wake_up_interruptible(&pipe->wait);
		kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
700 701 702 703
	}

	return ret;
}
M
Mark Fasheh 已提交
704
EXPORT_SYMBOL(__splice_from_pipe);
705

706 707 708 709 710 711 712 713 714 715 716 717 718 719
/**
 * 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:
 *    See __splice_from_pipe. This function locks the input and output inodes,
 *    otherwise it's identical to __splice_from_pipe().
 *
 */
720 721 722 723 724 725
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;
	struct inode *inode = out->f_mapping->host;
J
Jens Axboe 已提交
726 727 728 729
	struct splice_desc sd = {
		.total_len = len,
		.flags = flags,
		.pos = *ppos,
730
		.u.file = out,
J
Jens Axboe 已提交
731
	};
732 733 734 735 736 737 738 739

	/*
	 * The actor worker might be calling ->prepare_write and
	 * ->commit_write. Most of the time, these expect i_mutex to
	 * be held. Since this may result in an ABBA deadlock with
	 * pipe->inode, we have to order lock acquiry here.
	 */
	inode_double_lock(inode, pipe->inode);
J
Jens Axboe 已提交
740
	ret = __splice_from_pipe(pipe, &sd, actor);
741 742 743 744 745 746 747 748 749
	inode_double_unlock(inode, pipe->inode);

	return ret;
}

/**
 * generic_file_splice_write_nolock - generic_file_splice_write without mutexes
 * @pipe:	pipe info
 * @out:	file to write to
750
 * @ppos:	position in @out
751 752 753
 * @len:	number of bytes to splice
 * @flags:	splice modifier flags
 *
754 755 756 757
 * Description:
 *    Will either move or copy pages (determined by @flags options) from
 *    the given pipe inode to the given file. The caller is responsible
 *    for acquiring i_mutex on both inodes.
758 759 760 761 762 763 764 765
 *
 */
ssize_t
generic_file_splice_write_nolock(struct pipe_inode_info *pipe, struct file *out,
				 loff_t *ppos, size_t len, unsigned int flags)
{
	struct address_space *mapping = out->f_mapping;
	struct inode *inode = mapping->host;
J
Jens Axboe 已提交
766 767 768 769
	struct splice_desc sd = {
		.total_len = len,
		.flags = flags,
		.pos = *ppos,
770
		.u.file = out,
J
Jens Axboe 已提交
771
	};
772 773 774
	ssize_t ret;
	int err;

775
	err = file_remove_suid(out);
776 777 778
	if (unlikely(err))
		return err;

J
Jens Axboe 已提交
779
	ret = __splice_from_pipe(pipe, &sd, pipe_to_file);
780
	if (ret > 0) {
781 782
		unsigned long nr_pages;

783
		*ppos += ret;
784
		nr_pages = (ret + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
785 786 787 788 789 790 791 792 793 794 795 796

		/*
		 * If file or inode is SYNC and we actually wrote some data,
		 * sync it.
		 */
		if (unlikely((out->f_flags & O_SYNC) || IS_SYNC(inode))) {
			err = generic_osync_inode(inode, mapping,
						  OSYNC_METADATA|OSYNC_DATA);

			if (err)
				ret = err;
		}
797
		balance_dirty_pages_ratelimited_nr(mapping, nr_pages);
798 799 800 801 802 803 804
	}

	return ret;
}

EXPORT_SYMBOL(generic_file_splice_write_nolock);

805 806
/**
 * generic_file_splice_write - splice data from a pipe to a file
807
 * @pipe:	pipe info
808
 * @out:	file to write to
809
 * @ppos:	position in @out
810 811 812
 * @len:	number of bytes to splice
 * @flags:	splice modifier flags
 *
813 814 815
 * Description:
 *    Will either move or copy pages (determined by @flags options) from
 *    the given pipe inode to the given file.
816 817
 *
 */
818 819
ssize_t
generic_file_splice_write(struct pipe_inode_info *pipe, struct file *out,
820
			  loff_t *ppos, size_t len, unsigned int flags)
821
{
822
	struct address_space *mapping = out->f_mapping;
823
	struct inode *inode = mapping->host;
824 825 826 827 828 829
	struct splice_desc sd = {
		.total_len = len,
		.flags = flags,
		.pos = *ppos,
		.u.file = out,
	};
830 831
	ssize_t ret;

832
	inode_double_lock(inode, pipe->inode);
833
	ret = file_remove_suid(out);
834 835 836
	if (likely(!ret))
		ret = __splice_from_pipe(pipe, &sd, pipe_to_file);
	inode_double_unlock(inode, pipe->inode);
J
Jens Axboe 已提交
837
	if (ret > 0) {
838 839
		unsigned long nr_pages;

J
Jens Axboe 已提交
840
		*ppos += ret;
841
		nr_pages = (ret + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
J
Jens Axboe 已提交
842 843 844 845 846 847

		/*
		 * If file or inode is SYNC and we actually wrote some data,
		 * sync it.
		 */
		if (unlikely((out->f_flags & O_SYNC) || IS_SYNC(inode))) {
848 849
			int err;

J
Jens Axboe 已提交
850 851 852 853
			mutex_lock(&inode->i_mutex);
			err = generic_osync_inode(inode, mapping,
						  OSYNC_METADATA|OSYNC_DATA);
			mutex_unlock(&inode->i_mutex);
854

J
Jens Axboe 已提交
855 856 857
			if (err)
				ret = err;
		}
858
		balance_dirty_pages_ratelimited_nr(mapping, nr_pages);
859 860 861
	}

	return ret;
862 863
}

864 865
EXPORT_SYMBOL(generic_file_splice_write);

866 867
/**
 * generic_splice_sendpage - splice data from a pipe to a socket
868
 * @pipe:	pipe to splice from
869
 * @out:	socket to write to
870
 * @ppos:	position in @out
871 872 873
 * @len:	number of bytes to splice
 * @flags:	splice modifier flags
 *
874 875 876
 * Description:
 *    Will send @len bytes from the pipe to a network socket. No data copying
 *    is involved.
877 878
 *
 */
879
ssize_t generic_splice_sendpage(struct pipe_inode_info *pipe, struct file *out,
880
				loff_t *ppos, size_t len, unsigned int flags)
881
{
882
	return splice_from_pipe(pipe, out, ppos, len, flags, pipe_to_sendpage);
883 884
}

885
EXPORT_SYMBOL(generic_splice_sendpage);
J
Jeff Garzik 已提交
886

887 888 889
/*
 * Attempt to initiate a splice from pipe to file.
 */
890
static long do_splice_from(struct pipe_inode_info *pipe, struct file *out,
891
			   loff_t *ppos, size_t len, unsigned int flags)
892 893 894
{
	int ret;

895
	if (unlikely(!out->f_op || !out->f_op->splice_write))
896 897
		return -EINVAL;

898
	if (unlikely(!(out->f_mode & FMODE_WRITE)))
899 900
		return -EBADF;

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

904
	ret = rw_verify_area(WRITE, out, ppos, len);
905 906 907
	if (unlikely(ret < 0))
		return ret;

908
	return out->f_op->splice_write(pipe, out, ppos, len, flags);
909 910
}

911 912 913
/*
 * Attempt to initiate a splice from a file to a pipe.
 */
914 915 916
static long do_splice_to(struct file *in, loff_t *ppos,
			 struct pipe_inode_info *pipe, size_t len,
			 unsigned int flags)
917 918 919
{
	int ret;

920
	if (unlikely(!in->f_op || !in->f_op->splice_read))
921 922
		return -EINVAL;

923
	if (unlikely(!(in->f_mode & FMODE_READ)))
924 925
		return -EBADF;

926
	ret = rw_verify_area(READ, in, ppos, len);
927 928 929
	if (unlikely(ret < 0))
		return ret;

930
	return in->f_op->splice_read(in, ppos, pipe, len, flags);
931 932
}

933 934 935 936 937 938 939 940 941
/**
 * 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 已提交
942
 *    pipe is cached in the process, and reused during the lifetime of
943 944
 *    that process.
 *
J
Jens Axboe 已提交
945 946 947
 */
ssize_t splice_direct_to_actor(struct file *in, struct splice_desc *sd,
			       splice_direct_actor *actor)
948 949 950 951
{
	struct pipe_inode_info *pipe;
	long ret, bytes;
	umode_t i_mode;
J
Jens Axboe 已提交
952 953
	size_t len;
	int i, flags;
954 955 956 957 958 959

	/*
	 * 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!
	 */
960
	i_mode = in->f_path.dentry->d_inode->i_mode;
961 962 963 964 965 966 967 968
	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;
969
	if (unlikely(!pipe)) {
970 971 972 973 974 975
		pipe = alloc_pipe_info(NULL);
		if (!pipe)
			return -ENOMEM;

		/*
		 * We don't have an immediate reader, but we'll read the stuff
976
		 * out of the pipe right after the splice_to_pipe(). So set
977 978 979 980 981 982 983 984
		 * PIPE_READERS appropriately.
		 */
		pipe->readers = 1;

		current->splice_pipe = pipe;
	}

	/*
I
Ingo Molnar 已提交
985
	 * Do the splice.
986 987 988
	 */
	ret = 0;
	bytes = 0;
J
Jens Axboe 已提交
989 990 991 992 993 994 995
	len = sd->total_len;
	flags = sd->flags;

	/*
	 * Don't block on output, we have to drain the direct pipe.
	 */
	sd->flags &= ~SPLICE_F_NONBLOCK;
996 997

	while (len) {
998
		size_t read_len;
999
		loff_t pos = sd->pos, prev_pos = pos;
1000

1001
		ret = do_splice_to(in, &pos, pipe, len, flags);
1002
		if (unlikely(ret <= 0))
1003 1004 1005
			goto out_release;

		read_len = ret;
J
Jens Axboe 已提交
1006
		sd->total_len = read_len;
1007 1008 1009 1010 1011 1012

		/*
		 * 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 已提交
1013
		ret = actor(pipe, sd);
1014 1015
		if (unlikely(ret <= 0)) {
			sd->pos = prev_pos;
1016
			goto out_release;
1017
		}
1018 1019 1020

		bytes += ret;
		len -= ret;
1021
		sd->pos = pos;
1022

1023 1024
		if (ret < read_len) {
			sd->pos = prev_pos + ret;
1025
			goto out_release;
1026
		}
1027 1028
	}

1029
done:
1030
	pipe->nrbufs = pipe->curbuf = 0;
1031
	file_accessed(in);
1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047
	return bytes;

out_release:
	/*
	 * If we did an incomplete transfer we must release
	 * the pipe buffers in question:
	 */
	for (i = 0; i < PIPE_BUFFERS; i++) {
		struct pipe_buffer *buf = pipe->bufs + i;

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

1048 1049
	if (!bytes)
		bytes = ret;
J
Jens Axboe 已提交
1050

1051
	goto done;
J
Jens Axboe 已提交
1052 1053 1054 1055 1056 1057
}
EXPORT_SYMBOL(splice_direct_to_actor);

static int direct_splice_actor(struct pipe_inode_info *pipe,
			       struct splice_desc *sd)
{
1058
	struct file *file = sd->u.file;
J
Jens Axboe 已提交
1059 1060 1061 1062

	return do_splice_from(pipe, file, &sd->pos, sd->total_len, sd->flags);
}

1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077
/**
 * do_splice_direct - splices data directly between two files
 * @in:		file to splice from
 * @ppos:	input file offset
 * @out:	file to splice to
 * @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 已提交
1078 1079 1080 1081 1082 1083 1084 1085
long do_splice_direct(struct file *in, loff_t *ppos, struct file *out,
		      size_t len, unsigned int flags)
{
	struct splice_desc sd = {
		.len		= len,
		.total_len	= len,
		.flags		= flags,
		.pos		= *ppos,
1086
		.u.file		= out,
J
Jens Axboe 已提交
1087
	};
1088
	long ret;
J
Jens Axboe 已提交
1089 1090

	ret = splice_direct_to_actor(in, &sd, direct_splice_actor);
1091
	if (ret > 0)
1092
		*ppos = sd.pos;
1093

J
Jens Axboe 已提交
1094
	return ret;
1095 1096
}

1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109
/*
 * After the inode slimming patch, i_pipe/i_bdev/i_cdev share the same
 * location, so checking ->i_pipe is not enough to verify that this is a
 * pipe.
 */
static inline struct pipe_inode_info *pipe_info(struct inode *inode)
{
	if (S_ISFIFO(inode->i_mode))
		return inode->i_pipe;

	return NULL;
}

1110 1111 1112
/*
 * Determine where to splice to/from.
 */
1113 1114 1115
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)
1116
{
1117
	struct pipe_inode_info *pipe;
1118
	loff_t offset, *off;
J
Jens Axboe 已提交
1119
	long ret;
1120

1121
	pipe = pipe_info(in->f_path.dentry->d_inode);
1122 1123 1124
	if (pipe) {
		if (off_in)
			return -ESPIPE;
1125 1126 1127
		if (off_out) {
			if (out->f_op->llseek == no_llseek)
				return -EINVAL;
1128
			if (copy_from_user(&offset, off_out, sizeof(loff_t)))
1129
				return -EFAULT;
1130 1131 1132
			off = &offset;
		} else
			off = &out->f_pos;
1133

J
Jens Axboe 已提交
1134 1135 1136 1137 1138 1139
		ret = do_splice_from(pipe, out, off, len, flags);

		if (off_out && copy_to_user(off_out, off, sizeof(loff_t)))
			ret = -EFAULT;

		return ret;
1140
	}
1141

1142
	pipe = pipe_info(out->f_path.dentry->d_inode);
1143 1144 1145
	if (pipe) {
		if (off_out)
			return -ESPIPE;
1146 1147 1148
		if (off_in) {
			if (in->f_op->llseek == no_llseek)
				return -EINVAL;
1149
			if (copy_from_user(&offset, off_in, sizeof(loff_t)))
1150
				return -EFAULT;
1151 1152 1153
			off = &offset;
		} else
			off = &in->f_pos;
1154

J
Jens Axboe 已提交
1155 1156 1157 1158 1159 1160
		ret = do_splice_to(in, off, pipe, len, flags);

		if (off_in && copy_to_user(off_in, off, sizeof(loff_t)))
			ret = -EFAULT;

		return ret;
1161
	}
1162 1163 1164 1165

	return -EINVAL;
}

1166 1167 1168 1169 1170 1171 1172 1173 1174
/*
 * 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,
1175
				struct partial_page *partial, int aligned)
1176 1177 1178 1179 1180
{
	int buffers = 0, error = 0;

	while (nr_vecs) {
		unsigned long off, npages;
1181
		struct iovec entry;
1182 1183 1184 1185
		void __user *base;
		size_t len;
		int i;

1186
		error = -EFAULT;
N
Nick Piggin 已提交
1187
		if (copy_from_user(&entry, iov, sizeof(entry)))
1188 1189
			break;

1190 1191 1192
		base = entry.iov_base;
		len = entry.iov_len;

1193 1194 1195
		/*
		 * Sanity check this iovec. 0 read succeeds.
		 */
1196
		error = 0;
1197 1198 1199
		if (unlikely(!len))
			break;
		error = -EFAULT;
1200
		if (!access_ok(VERIFY_READ, base, len))
1201 1202 1203 1204 1205 1206 1207
			break;

		/*
		 * Get this base offset and number of pages, then map
		 * in the user pages.
		 */
		off = (unsigned long) base & ~PAGE_MASK;
1208 1209 1210 1211 1212 1213 1214 1215 1216

		/*
		 * 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;

1217 1218 1219 1220
		npages = (off + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
		if (npages > PIPE_BUFFERS - buffers)
			npages = PIPE_BUFFERS - buffers;

N
Nick Piggin 已提交
1221 1222
		error = get_user_pages_fast((unsigned long)base, npages,
					0, &pages[buffers]);
1223 1224 1225 1226 1227 1228 1229 1230

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

		/*
		 * Fill this contiguous range into the partial page map.
		 */
		for (i = 0; i < error; i++) {
1231
			const int plen = min_t(size_t, len, PAGE_SIZE - off);
1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266

			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.
		 */
		if (error < npages || buffers == PIPE_BUFFERS)
			break;

		nr_vecs--;
		iov++;
	}

	if (buffers)
		return buffers;

	return error;
}

1267 1268 1269 1270 1271 1272
static int pipe_to_user(struct pipe_inode_info *pipe, struct pipe_buffer *buf,
			struct splice_desc *sd)
{
	char *src;
	int ret;

1273
	ret = buf->ops->confirm(pipe, buf);
1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300
	if (unlikely(ret))
		return ret;

	/*
	 * See if we can use the atomic maps, by prefaulting in the
	 * pages and doing an atomic copy
	 */
	if (!fault_in_pages_writeable(sd->u.userptr, sd->len)) {
		src = buf->ops->map(pipe, buf, 1);
		ret = __copy_to_user_inatomic(sd->u.userptr, src + buf->offset,
							sd->len);
		buf->ops->unmap(pipe, buf, src);
		if (!ret) {
			ret = sd->len;
			goto out;
		}
	}

	/*
	 * No dice, use slow non-atomic map and copy
 	 */
	src = buf->ops->map(pipe, buf, 0);

	ret = sd->len;
	if (copy_to_user(sd->u.userptr, src + buf->offset, sd->len))
		ret = -EFAULT;

1301
	buf->ops->unmap(pipe, buf, src);
1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352
out:
	if (ret > 0)
		sd->u.userptr += ret;
	return ret;
}

/*
 * For lack of a better implementation, implement vmsplice() to userspace
 * as a simple copy of the pipes pages to the user iov.
 */
static long vmsplice_to_user(struct file *file, const struct iovec __user *iov,
			     unsigned long nr_segs, unsigned int flags)
{
	struct pipe_inode_info *pipe;
	struct splice_desc sd;
	ssize_t size;
	int error;
	long ret;

	pipe = pipe_info(file->f_path.dentry->d_inode);
	if (!pipe)
		return -EBADF;

	if (pipe->inode)
		mutex_lock(&pipe->inode->i_mutex);

	error = ret = 0;
	while (nr_segs) {
		void __user *base;
		size_t len;

		/*
		 * Get user address base and length for this iovec.
		 */
		error = get_user(base, &iov->iov_base);
		if (unlikely(error))
			break;
		error = get_user(len, &iov->iov_len);
		if (unlikely(error))
			break;

		/*
		 * Sanity check this iovec. 0 read succeeds.
		 */
		if (unlikely(!len))
			break;
		if (unlikely(!base)) {
			error = -EFAULT;
			break;
		}

1353 1354 1355 1356 1357
		if (unlikely(!access_ok(VERIFY_WRITE, base, len))) {
			error = -EFAULT;
			break;
		}

1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389
		sd.len = 0;
		sd.total_len = len;
		sd.flags = flags;
		sd.u.userptr = base;
		sd.pos = 0;

		size = __splice_from_pipe(pipe, &sd, pipe_to_user);
		if (size < 0) {
			if (!ret)
				ret = size;

			break;
		}

		ret += size;

		if (size < len)
			break;

		nr_segs--;
		iov++;
	}

	if (pipe->inode)
		mutex_unlock(&pipe->inode->i_mutex);

	if (!ret)
		ret = error;

	return ret;
}

1390 1391 1392 1393 1394
/*
 * 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.
 */
1395 1396
static long vmsplice_to_pipe(struct file *file, const struct iovec __user *iov,
			     unsigned long nr_segs, unsigned int flags)
1397
{
1398
	struct pipe_inode_info *pipe;
1399 1400 1401 1402 1403 1404 1405
	struct page *pages[PIPE_BUFFERS];
	struct partial_page partial[PIPE_BUFFERS];
	struct splice_pipe_desc spd = {
		.pages = pages,
		.partial = partial,
		.flags = flags,
		.ops = &user_page_pipe_buf_ops,
1406
		.spd_release = spd_release_page,
1407 1408
	};

1409
	pipe = pipe_info(file->f_path.dentry->d_inode);
1410
	if (!pipe)
1411 1412
		return -EBADF;

1413 1414
	spd.nr_pages = get_iovec_page_array(iov, nr_segs, pages, partial,
					    flags & SPLICE_F_GIFT);
1415 1416 1417
	if (spd.nr_pages <= 0)
		return spd.nr_pages;

1418
	return splice_to_pipe(pipe, &spd);
1419 1420
}

1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436
/*
 * 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().
 *
 */
1437 1438 1439 1440 1441 1442 1443
asmlinkage long sys_vmsplice(int fd, const struct iovec __user *iov,
			     unsigned long nr_segs, unsigned int flags)
{
	struct file *file;
	long error;
	int fput;

1444 1445 1446 1447 1448
	if (unlikely(nr_segs > UIO_MAXIOV))
		return -EINVAL;
	else if (unlikely(!nr_segs))
		return 0;

1449 1450 1451 1452
	error = -EBADF;
	file = fget_light(fd, &fput);
	if (file) {
		if (file->f_mode & FMODE_WRITE)
1453 1454 1455
			error = vmsplice_to_pipe(file, iov, nr_segs, flags);
		else if (file->f_mode & FMODE_READ)
			error = vmsplice_to_user(file, iov, nr_segs, flags);
1456 1457 1458 1459 1460 1461 1462

		fput_light(file, fput);
	}

	return error;
}

1463 1464 1465
asmlinkage long sys_splice(int fd_in, loff_t __user *off_in,
			   int fd_out, loff_t __user *off_out,
			   size_t len, unsigned int flags)
1466 1467 1468 1469 1470 1471 1472 1473 1474
{
	long error;
	struct file *in, *out;
	int fput_in, fput_out;

	if (unlikely(!len))
		return 0;

	error = -EBADF;
1475
	in = fget_light(fd_in, &fput_in);
1476 1477
	if (in) {
		if (in->f_mode & FMODE_READ) {
1478
			out = fget_light(fd_out, &fput_out);
1479 1480
			if (out) {
				if (out->f_mode & FMODE_WRITE)
1481 1482 1483
					error = do_splice(in, off_in,
							  out, off_out,
							  len, flags);
1484 1485 1486 1487 1488 1489 1490 1491 1492
				fput_light(out, fput_out);
			}
		}

		fput_light(in, fput_in);
	}

	return error;
}
1493

1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572
/*
 * Make sure there's data to read. Wait for input if we can, otherwise
 * return an appropriate error.
 */
static int link_ipipe_prep(struct pipe_inode_info *pipe, unsigned int flags)
{
	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;
	mutex_lock(&pipe->inode->i_mutex);

	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);
	}

	mutex_unlock(&pipe->inode->i_mutex);
	return ret;
}

/*
 * Make sure there's writeable room. Wait for room if we can, otherwise
 * return an appropriate error.
 */
static int link_opipe_prep(struct pipe_inode_info *pipe, unsigned int flags)
{
	int ret;

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

	ret = 0;
	mutex_lock(&pipe->inode->i_mutex);

	while (pipe->nrbufs >= PIPE_BUFFERS) {
		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--;
	}

	mutex_unlock(&pipe->inode->i_mutex);
	return ret;
}

1573 1574 1575 1576 1577 1578 1579 1580
/*
 * 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;
1581
	int ret = 0, i = 0, nbuf;
1582 1583 1584 1585 1586 1587

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

1590
	do {
1591 1592 1593 1594 1595 1596 1597
		if (!opipe->readers) {
			send_sig(SIGPIPE, current, 0);
			if (!ret)
				ret = -EPIPE;
			break;
		}

1598 1599 1600 1601 1602 1603
		/*
		 * If we have iterated all input buffers or ran out of
		 * output room, break.
		 */
		if (i >= ipipe->nrbufs || opipe->nrbufs >= PIPE_BUFFERS)
			break;
1604

1605 1606
		ibuf = ipipe->bufs + ((ipipe->curbuf + i) & (PIPE_BUFFERS - 1));
		nbuf = (opipe->curbuf + opipe->nrbufs) & (PIPE_BUFFERS - 1);
1607 1608

		/*
1609 1610
		 * Get a reference to this pipe buffer,
		 * so we can copy the contents over.
1611
		 */
1612 1613 1614 1615 1616
		ibuf->ops->get(ipipe, ibuf);

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

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

1623 1624
		if (obuf->len > len)
			obuf->len = len;
1625

1626 1627 1628 1629 1630
		opipe->nrbufs++;
		ret += obuf->len;
		len -= obuf->len;
		i++;
	} while (len);
1631

1632 1633 1634 1635 1636 1637 1638
	/*
	 * 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;

1639
	inode_double_unlock(ipipe->inode, opipe->inode);
1640

1641 1642 1643 1644
	/*
	 * If we put data in the output pipe, wakeup any potential readers.
	 */
	if (ret > 0) {
1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662
		smp_mb();
		if (waitqueue_active(&opipe->wait))
			wake_up_interruptible(&opipe->wait);
		kill_fasync(&opipe->fasync_readers, SIGIO, POLL_IN);
	}

	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)
{
1663 1664
	struct pipe_inode_info *ipipe = pipe_info(in->f_path.dentry->d_inode);
	struct pipe_inode_info *opipe = pipe_info(out->f_path.dentry->d_inode);
1665
	int ret = -EINVAL;
1666 1667

	/*
1668 1669
	 * Duplicate the contents of ipipe to opipe without actually
	 * copying the data.
1670
	 */
1671 1672 1673 1674 1675 1676 1677 1678
	if (ipipe && opipe && ipipe != opipe) {
		/*
		 * Keep going, unless we encounter an error. The ipipe/opipe
		 * ordering doesn't really matter.
		 */
		ret = link_ipipe_prep(ipipe, flags);
		if (!ret) {
			ret = link_opipe_prep(opipe, flags);
1679
			if (!ret)
1680 1681 1682
				ret = link_pipe(ipipe, opipe, len, flags);
		}
	}
1683

1684
	return ret;
1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712
}

asmlinkage long sys_tee(int fdin, int fdout, size_t len, unsigned int flags)
{
	struct file *in;
	int error, fput_in;

	if (unlikely(!len))
		return 0;

	error = -EBADF;
	in = fget_light(fdin, &fput_in);
	if (in) {
		if (in->f_mode & FMODE_READ) {
			int fput_out;
			struct file *out = fget_light(fdout, &fput_out);

			if (out) {
				if (out->f_mode & FMODE_WRITE)
					error = do_tee(in, out, len, flags);
				fput_light(out, fput_out);
			}
		}
 		fput_light(in, fput_in);
 	}

	return error;
}