splice.c 36.2 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 23 24
 *
 */
#include <linux/fs.h>
#include <linux/file.h>
#include <linux/pagemap.h>
#include <linux/pipe_fs_i.h>
#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

32 33 34 35 36 37
struct partial_page {
	unsigned int offset;
	unsigned int len;
};

/*
38
 * Passed to splice_to_pipe
39 40 41 42 43 44
 */
struct splice_pipe_desc {
	struct page **pages;		/* page map */
	struct partial_page *partial;	/* pages[] may not be contig */
	int nr_pages;			/* number of pages in map */
	unsigned int flags;		/* splice flags */
45
	const struct pipe_buf_operations *ops;/* ops associated with output pipe */
46 47
};

48 49 50 51 52 53
/*
 * 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.
 */
54
static int page_cache_pipe_buf_steal(struct pipe_inode_info *pipe,
55 56 57
				     struct pipe_buffer *buf)
{
	struct page *page = buf->page;
58
	struct address_space *mapping;
59

60 61
	lock_page(page);

62 63 64
	mapping = page_mapping(page);
	if (mapping) {
		WARN_ON(!PageUptodate(page));
65

66 67 68 69 70 71 72 73 74
		/*
		 * 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);
75

76
		if (PagePrivate(page))
77
			try_to_release_page(page, GFP_KERNEL);
78

79 80 81 82 83 84 85 86
		/*
		 * 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;
		}
87
	}
88

89 90 91 92 93 94
	/*
	 * Raced with truncate or failed to remove page from current
	 * address space, unlock and return failure.
	 */
	unlock_page(page);
	return 1;
95 96
}

97
static void page_cache_pipe_buf_release(struct pipe_inode_info *pipe,
98 99 100
					struct pipe_buffer *buf)
{
	page_cache_release(buf->page);
J
Jens Axboe 已提交
101
	buf->flags &= ~PIPE_BUF_FLAG_LRU;
102 103
}

104
static int page_cache_pipe_buf_pin(struct pipe_inode_info *pipe,
105
				   struct pipe_buffer *buf)
106 107
{
	struct page *page = buf->page;
108
	int err;
109 110

	if (!PageUptodate(page)) {
111 112 113 114
		lock_page(page);

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

122
		/*
I
Ingo Molnar 已提交
123
		 * Uh oh, read-error from disk.
124 125 126 127 128 129 130
		 */
		if (!PageUptodate(page)) {
			err = -EIO;
			goto error;
		}

		/*
131
		 * Page is ok afterall, we are done.
132
		 */
133 134 135
		unlock_page(page);
	}

136
	return 0;
137 138
error:
	unlock_page(page);
139
	return err;
140 141
}

142
static const struct pipe_buf_operations page_cache_pipe_buf_ops = {
143
	.can_merge = 0,
144 145 146
	.map = generic_pipe_buf_map,
	.unmap = generic_pipe_buf_unmap,
	.pin = page_cache_pipe_buf_pin,
147
	.release = page_cache_pipe_buf_release,
148
	.steal = page_cache_pipe_buf_steal,
149
	.get = generic_pipe_buf_get,
150 151
};

152 153 154
static int user_page_pipe_buf_steal(struct pipe_inode_info *pipe,
				    struct pipe_buffer *buf)
{
155 156 157
	if (!(buf->flags & PIPE_BUF_FLAG_GIFT))
		return 1;

J
Jens Axboe 已提交
158
	buf->flags |= PIPE_BUF_FLAG_LRU;
159
	return generic_pipe_buf_steal(pipe, buf);
160 161
}

162
static const struct pipe_buf_operations user_page_pipe_buf_ops = {
163
	.can_merge = 0,
164 165 166
	.map = generic_pipe_buf_map,
	.unmap = generic_pipe_buf_unmap,
	.pin = generic_pipe_buf_pin,
167 168
	.release = page_cache_pipe_buf_release,
	.steal = user_page_pipe_buf_steal,
169
	.get = generic_pipe_buf_get,
170 171
};

172 173 174 175
/*
 * Pipe output worker. This sets up our pipe format with the page cache
 * pipe buffer operations. Otherwise very similar to the regular pipe_writev().
 */
176 177
static ssize_t splice_to_pipe(struct pipe_inode_info *pipe,
			      struct splice_pipe_desc *spd)
178
{
179
	unsigned int spd_pages = spd->nr_pages;
180
	int ret, do_wakeup, page_nr;
181 182 183

	ret = 0;
	do_wakeup = 0;
184
	page_nr = 0;
185

186 187
	if (pipe->inode)
		mutex_lock(&pipe->inode->i_mutex);
188 189

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

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

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

208
			pipe->nrbufs++;
209 210 211
			page_nr++;
			ret += buf->len;

212 213
			if (pipe->inode)
				do_wakeup = 1;
214

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

			break;
		}

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

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

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

243 244 245
		pipe->waiting_writers++;
		pipe_wait(pipe);
		pipe->waiting_writers--;
246 247
	}

248
	if (pipe->inode) {
249
		mutex_unlock(&pipe->inode->i_mutex);
250

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

259
	while (page_nr < spd_pages)
260
		page_cache_release(spd->pages[page_nr++]);
261 262 263 264

	return ret;
}

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

285
	index = *ppos >> PAGE_CACHE_SHIFT;
286 287
	loff = *ppos & ~PAGE_CACHE_MASK;
	nr_pages = (len + loff + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
288 289 290 291 292

	if (nr_pages > PIPE_BUFFERS)
		nr_pages = PIPE_BUFFERS;

	/*
293 294
	 * Don't try to 2nd guess the read-ahead logic, call into
	 * page_cache_readahead() like the page cache reads would do.
295
	 */
296
	page_cache_readahead(mapping, &in->f_ra, in, index, nr_pages);
297 298

	/*
I
Ingo Molnar 已提交
299
	 * Now fill in the holes:
300
	 */
301
	error = 0;
302

303 304 305 306
	/*
	 * Lookup the (hopefully) full range of pages we need.
	 */
	spd.nr_pages = find_get_pages_contig(mapping, index, nr_pages, pages);
307

308 309 310 311 312 313
	/*
	 * If find_get_pages_contig() returned fewer pages than we needed,
	 * allocate the rest.
	 */
	index += spd.nr_pages;
	while (spd.nr_pages < nr_pages) {
314
		/*
315 316
		 * Page could be there, find_get_pages_contig() breaks on
		 * the first hole.
317
		 */
318 319
		page = find_get_page(mapping, index);
		if (!page) {
320 321 322 323 324 325
			/*
			 * Make sure the read-ahead engine is notified
			 * about this failure.
			 */
			handle_ra_miss(mapping, &in->f_ra, index);

326
			/*
327
			 * page didn't exist, allocate one.
328 329 330 331 332 333
			 */
			page = page_cache_alloc_cold(mapping);
			if (!page)
				break;

			error = add_to_page_cache_lru(page, mapping, index,
334
					      GFP_KERNEL);
335 336
			if (unlikely(error)) {
				page_cache_release(page);
337 338
				if (error == -EEXIST)
					continue;
339 340
				break;
			}
341 342 343 344 345
			/*
			 * add_to_page_cache() locks the page, unlock it
			 * to avoid convoluting the logic below even more.
			 */
			unlock_page(page);
346 347
		}

348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370
		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];

371 372 373 374
		/*
		 * If the page isn't uptodate, we may need to start io on it
		 */
		if (!PageUptodate(page)) {
375 376 377 378
			/*
			 * If in nonblock mode then dont block on waiting
			 * for an in-flight io page
			 */
379 380 381 382 383
			if (flags & SPLICE_F_NONBLOCK) {
				if (TestSetPageLocked(page))
					break;
			} else
				lock_page(page);
384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400

			/*
			 * page was truncated, stop here. if this isn't the
			 * first page, we'll just complete what we already
			 * added
			 */
			if (!page->mapping) {
				unlock_page(page);
				break;
			}
			/*
			 * page was already under io and is now done, great
			 */
			if (PageUptodate(page)) {
				unlock_page(page);
				goto fill_it;
			}
401

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

416 417
				break;
			}
418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433
		}
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;
434 435

			/*
436
			 * max good bytes in this page
437
			 */
438 439
			plen = ((isize - 1) & ~PAGE_CACHE_MASK) + 1;
			if (plen <= loff)
440 441 442
				break;

			/*
443
			 * force quit after adding this page
444
			 */
445 446
			this_len = min(this_len, plen - loff);
			len = this_len;
447
		}
448

449 450
		partial[page_nr].offset = loff;
		partial[page_nr].len = this_len;
451
		len -= this_len;
452
		loff = 0;
453 454
		spd.nr_pages++;
		index++;
455 456
	}

457
	/*
458
	 * Release any pages at the end, if we quit early. 'page_nr' is how far
459 460 461 462 463
	 * we got, 'nr_pages' is how many pages are in the map.
	 */
	while (page_nr < nr_pages)
		page_cache_release(pages[page_nr++]);

464
	if (spd.nr_pages)
465
		return splice_to_pipe(pipe, &spd);
466

467
	return error;
468 469
}

470 471 472 473 474 475 476 477 478
/**
 * generic_file_splice_read - splice data from file to a pipe
 * @in:		file to splice from
 * @pipe:	pipe to splice to
 * @len:	number of bytes to splice
 * @flags:	splice modifier flags
 *
 * Will read pages from given file and fill them into a pipe.
 */
479 480 481
ssize_t generic_file_splice_read(struct file *in, loff_t *ppos,
				 struct pipe_inode_info *pipe, size_t len,
				 unsigned int flags)
482 483 484
{
	ssize_t spliced;
	int ret;
485 486 487 488 489 490 491 492 493
	loff_t isize, left;

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

	left = isize - *ppos;
	if (unlikely(left < len))
		len = left;
494 495 496 497

	ret = 0;
	spliced = 0;
	while (len) {
498
		ret = __generic_file_splice_read(in, ppos, pipe, len, flags);
499

500
		if (ret < 0)
501
			break;
502 503 504 505 506 507 508 509
		else if (!ret) {
			if (spliced)
				break;
			if (flags & SPLICE_F_NONBLOCK) {
				ret = -EAGAIN;
				break;
			}
		}
510

511
		*ppos += ret;
512 513 514 515 516 517 518 519 520 521
		len -= ret;
		spliced += ret;
	}

	if (spliced)
		return spliced;

	return ret;
}

522 523
EXPORT_SYMBOL(generic_file_splice_read);

524
/*
525
 * Send 'sd->len' bytes to socket from 'sd->file' at position 'sd->pos'
J
Jens Axboe 已提交
526
 * using sendpage(). Return the number of bytes sent.
527
 */
528
static int pipe_to_sendpage(struct pipe_inode_info *pipe,
529 530 531 532
			    struct pipe_buffer *buf, struct splice_desc *sd)
{
	struct file *file = sd->file;
	loff_t pos = sd->pos;
533
	int ret, more;
534

535
	ret = buf->ops->pin(pipe, buf);
536 537
	if (!ret) {
		more = (sd->flags & SPLICE_F_MORE) || sd->len < sd->total_len;
538

539 540 541
		ret = file->f_op->sendpage(file, buf->page, buf->offset,
					   sd->len, &pos, more);
	}
542

J
Jens Axboe 已提交
543
	return ret;
544 545 546 547 548 549 550 551 552 553 554 555 556 557 558
}

/*
 * 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.
 *
559 560 561 562 563 564
 * 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.
565
 */
566
static int pipe_to_file(struct pipe_inode_info *pipe, struct pipe_buffer *buf,
567 568 569 570
			struct splice_desc *sd)
{
	struct file *file = sd->file;
	struct address_space *mapping = file->f_mapping;
J
Jens Axboe 已提交
571
	unsigned int offset, this_len;
572 573
	struct page *page;
	pgoff_t index;
574
	int ret;
575 576

	/*
577
	 * make sure the data in this buffer is uptodate
578
	 */
579
	ret = buf->ops->pin(pipe, buf);
580 581
	if (unlikely(ret))
		return ret;
582 583 584 585

	index = sd->pos >> PAGE_CACHE_SHIFT;
	offset = sd->pos & ~PAGE_CACHE_MASK;

J
Jens Axboe 已提交
586 587 588 589
	this_len = sd->len;
	if (this_len + offset > PAGE_CACHE_SIZE)
		this_len = PAGE_CACHE_SIZE - offset;

N
Nick Piggin 已提交
590 591 592 593 594 595 596 597
find_page:
	page = find_lock_page(mapping, index);
	if (!page) {
		ret = -ENOMEM;
		page = page_cache_alloc_cold(mapping);
		if (unlikely(!page))
			goto out_ret;

598
		/*
N
Nick Piggin 已提交
599
		 * This will also lock the page
600
		 */
N
Nick Piggin 已提交
601 602 603 604 605
		ret = add_to_page_cache_lru(page, mapping, index,
					    GFP_KERNEL);
		if (unlikely(ret))
			goto out;
	}
606

J
Jens Axboe 已提交
607
	ret = mapping->a_ops->prepare_write(file, page, offset, offset+this_len);
608 609 610 611 612
	if (unlikely(ret)) {
		loff_t isize = i_size_read(mapping->host);

		if (ret != AOP_TRUNCATED_PAGE)
			unlock_page(page);
613
		page_cache_release(page);
614 615 616 617 618 619 620 621 622 623
		if (ret == AOP_TRUNCATED_PAGE)
			goto find_page;

		/*
		 * prepare_write() may have instantiated a few blocks
		 * outside i_size.  Trim these off again.
		 */
		if (sd->pos + this_len > isize)
			vmtruncate(mapping->host, isize);

624
		goto out_ret;
625
	}
626

627
	if (buf->page != page) {
628 629 630
		/*
		 * Careful, ->map() uses KM_USER0!
		 */
631
		char *src = buf->ops->map(pipe, buf, 1);
632
		char *dst = kmap_atomic(page, KM_USER1);
633

J
Jens Axboe 已提交
634
		memcpy(dst + offset, src + buf->offset, this_len);
635
		flush_dcache_page(page);
636
		kunmap_atomic(dst, KM_USER1);
637
		buf->ops->unmap(pipe, buf, src);
638
	}
639

J
Jens Axboe 已提交
640
	ret = mapping->a_ops->commit_write(file, page, offset, offset+this_len);
641 642 643 644 645 646 647
	if (ret) {
		if (ret == AOP_TRUNCATED_PAGE) {
			page_cache_release(page);
			goto find_page;
		}
		if (ret < 0)
			goto out;
648
		/*
649 650
		 * Partial write has happened, so 'ret' already initialized by
		 * number of bytes written, Where is nothing we have to do here.
651
		 */
652
	} else
653
		ret = this_len;
654 655 656 657 658
	/*
	 * Return the number of bytes written and mark page as
	 * accessed, we are now done!
	 */
	mark_page_accessed(page);
659
out:
660
	page_cache_release(page);
661
	unlock_page(page);
662
out_ret:
663 664 665
	return ret;
}

666 667 668 669 670
/*
 * Pipe input worker. Most of this logic works like a regular pipe, the
 * key here is the 'actor' worker passed in that actually moves the data
 * to the wanted destination. See pipe_to_file/pipe_to_sendpage above.
 */
J
Jens Axboe 已提交
671 672
ssize_t __splice_from_pipe(struct pipe_inode_info *pipe, struct splice_desc *sd,
			   splice_actor *actor)
673 674 675 676 677 678 679
{
	int ret, do_wakeup, err;

	ret = 0;
	do_wakeup = 0;

	for (;;) {
680 681
		if (pipe->nrbufs) {
			struct pipe_buffer *buf = pipe->bufs + pipe->curbuf;
682
			const struct pipe_buf_operations *ops = buf->ops;
683

J
Jens Axboe 已提交
684 685 686
			sd->len = buf->len;
			if (sd->len > sd->total_len)
				sd->len = sd->total_len;
687

J
Jens Axboe 已提交
688
			err = actor(pipe, buf, sd);
J
Jens Axboe 已提交
689
			if (err <= 0) {
690 691 692 693 694 695
				if (!ret && err != -ENODATA)
					ret = err;

				break;
			}

J
Jens Axboe 已提交
696 697 698 699
			ret += err;
			buf->offset += err;
			buf->len -= err;

J
Jens Axboe 已提交
700 701 702 703
			sd->len -= err;
			sd->pos += err;
			sd->total_len -= err;
			if (sd->len)
J
Jens Axboe 已提交
704
				continue;
I
Ingo Molnar 已提交
705

706 707
			if (!buf->len) {
				buf->ops = NULL;
708
				ops->release(pipe, buf);
709 710 711 712
				pipe->curbuf = (pipe->curbuf + 1) & (PIPE_BUFFERS - 1);
				pipe->nrbufs--;
				if (pipe->inode)
					do_wakeup = 1;
713 714
			}

J
Jens Axboe 已提交
715
			if (!sd->total_len)
716 717 718
				break;
		}

719
		if (pipe->nrbufs)
720
			continue;
721
		if (!pipe->writers)
722
			break;
723
		if (!pipe->waiting_writers) {
724 725 726 727
			if (ret)
				break;
		}

J
Jens Axboe 已提交
728
		if (sd->flags & SPLICE_F_NONBLOCK) {
729 730 731 732 733
			if (!ret)
				ret = -EAGAIN;
			break;
		}

734 735 736 737 738 739 740
		if (signal_pending(current)) {
			if (!ret)
				ret = -ERESTARTSYS;
			break;
		}

		if (do_wakeup) {
741
			smp_mb();
742 743 744
			if (waitqueue_active(&pipe->wait))
				wake_up_interruptible_sync(&pipe->wait);
			kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
745 746 747
			do_wakeup = 0;
		}

748
		pipe_wait(pipe);
749 750 751
	}

	if (do_wakeup) {
752
		smp_mb();
753 754 755
		if (waitqueue_active(&pipe->wait))
			wake_up_interruptible(&pipe->wait);
		kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
756 757 758 759
	}

	return ret;
}
M
Mark Fasheh 已提交
760
EXPORT_SYMBOL(__splice_from_pipe);
761

762 763 764 765 766 767
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 已提交
768 769 770 771 772 773
	struct splice_desc sd = {
		.total_len = len,
		.flags = flags,
		.pos = *ppos,
		.file = out,
	};
774 775 776 777 778 779 780 781

	/*
	 * 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 已提交
782
	ret = __splice_from_pipe(pipe, &sd, actor);
783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805
	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
 * @len:	number of bytes to splice
 * @flags:	splice modifier flags
 *
 * 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.
 *
 */
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 已提交
806 807 808 809 810 811
	struct splice_desc sd = {
		.total_len = len,
		.flags = flags,
		.pos = *ppos,
		.file = out,
	};
812 813 814
	ssize_t ret;
	int err;

815
	err = remove_suid(out->f_path.dentry);
816 817 818
	if (unlikely(err))
		return err;

J
Jens Axboe 已提交
819
	ret = __splice_from_pipe(pipe, &sd, pipe_to_file);
820
	if (ret > 0) {
821 822
		unsigned long nr_pages;

823
		*ppos += ret;
824
		nr_pages = (ret + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
825 826 827 828 829 830 831 832 833 834 835 836

		/*
		 * 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;
		}
837
		balance_dirty_pages_ratelimited_nr(mapping, nr_pages);
838 839 840 841 842 843 844
	}

	return ret;
}

EXPORT_SYMBOL(generic_file_splice_write_nolock);

845 846
/**
 * generic_file_splice_write - splice data from a pipe to a file
847
 * @pipe:	pipe info
848 849 850 851 852 853 854 855
 * @out:	file to write to
 * @len:	number of bytes to splice
 * @flags:	splice modifier flags
 *
 * Will either move or copy pages (determined by @flags options) from
 * the given pipe inode to the given file.
 *
 */
856 857
ssize_t
generic_file_splice_write(struct pipe_inode_info *pipe, struct file *out,
858
			  loff_t *ppos, size_t len, unsigned int flags)
859
{
860
	struct address_space *mapping = out->f_mapping;
861
	struct inode *inode = mapping->host;
862
	ssize_t ret;
863 864
	int err;

865
	err = should_remove_suid(out->f_path.dentry);
866 867
	if (unlikely(err)) {
		mutex_lock(&inode->i_mutex);
868
		err = __remove_suid(out->f_path.dentry, err);
869 870 871 872
		mutex_unlock(&inode->i_mutex);
		if (err)
			return err;
	}
873

874
	ret = splice_from_pipe(pipe, out, ppos, len, flags, pipe_to_file);
J
Jens Axboe 已提交
875
	if (ret > 0) {
876 877
		unsigned long nr_pages;

J
Jens Axboe 已提交
878
		*ppos += ret;
879
		nr_pages = (ret + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
J
Jens Axboe 已提交
880 881 882 883 884 885 886 887 888 889

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

J
Jens Axboe 已提交
891 892 893
			if (err)
				ret = err;
		}
894
		balance_dirty_pages_ratelimited_nr(mapping, nr_pages);
895 896 897
	}

	return ret;
898 899
}

900 901
EXPORT_SYMBOL(generic_file_splice_write);

902 903 904 905 906 907 908 909 910 911 912
/**
 * generic_splice_sendpage - splice data from a pipe to a socket
 * @inode:	pipe inode
 * @out:	socket to write to
 * @len:	number of bytes to splice
 * @flags:	splice modifier flags
 *
 * Will send @len bytes from the pipe to a network socket. No data copying
 * is involved.
 *
 */
913
ssize_t generic_splice_sendpage(struct pipe_inode_info *pipe, struct file *out,
914
				loff_t *ppos, size_t len, unsigned int flags)
915
{
916
	return splice_from_pipe(pipe, out, ppos, len, flags, pipe_to_sendpage);
917 918
}

919
EXPORT_SYMBOL(generic_splice_sendpage);
J
Jeff Garzik 已提交
920

921 922 923
/*
 * Attempt to initiate a splice from pipe to file.
 */
924
static long do_splice_from(struct pipe_inode_info *pipe, struct file *out,
925
			   loff_t *ppos, size_t len, unsigned int flags)
926 927 928
{
	int ret;

929
	if (unlikely(!out->f_op || !out->f_op->splice_write))
930 931
		return -EINVAL;

932
	if (unlikely(!(out->f_mode & FMODE_WRITE)))
933 934
		return -EBADF;

935
	ret = rw_verify_area(WRITE, out, ppos, len);
936 937 938
	if (unlikely(ret < 0))
		return ret;

939
	return out->f_op->splice_write(pipe, out, ppos, len, flags);
940 941
}

942 943 944
/*
 * Attempt to initiate a splice from a file to a pipe.
 */
945 946 947
static long do_splice_to(struct file *in, loff_t *ppos,
			 struct pipe_inode_info *pipe, size_t len,
			 unsigned int flags)
948 949 950
{
	int ret;

951
	if (unlikely(!in->f_op || !in->f_op->splice_read))
952 953
		return -EINVAL;

954
	if (unlikely(!(in->f_mode & FMODE_READ)))
955 956
		return -EBADF;

957
	ret = rw_verify_area(READ, in, ppos, len);
958 959 960
	if (unlikely(ret < 0))
		return ret;

961
	return in->f_op->splice_read(in, ppos, pipe, len, flags);
962 963
}

J
Jens Axboe 已提交
964 965 966 967 968
/*
 * Splices from an input file to an actor, using a 'direct' pipe.
 */
ssize_t splice_direct_to_actor(struct file *in, struct splice_desc *sd,
			       splice_direct_actor *actor)
969 970 971 972
{
	struct pipe_inode_info *pipe;
	long ret, bytes;
	umode_t i_mode;
J
Jens Axboe 已提交
973 974
	size_t len;
	int i, flags;
975 976 977 978 979 980

	/*
	 * 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!
	 */
981
	i_mode = in->f_path.dentry->d_inode->i_mode;
982 983 984 985 986 987 988 989
	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;
990
	if (unlikely(!pipe)) {
991 992 993 994 995 996
		pipe = alloc_pipe_info(NULL);
		if (!pipe)
			return -ENOMEM;

		/*
		 * We don't have an immediate reader, but we'll read the stuff
997
		 * out of the pipe right after the splice_to_pipe(). So set
998 999 1000 1001 1002 1003 1004 1005
		 * PIPE_READERS appropriately.
		 */
		pipe->readers = 1;

		current->splice_pipe = pipe;
	}

	/*
I
Ingo Molnar 已提交
1006
	 * Do the splice.
1007 1008 1009
	 */
	ret = 0;
	bytes = 0;
J
Jens Axboe 已提交
1010 1011 1012 1013 1014 1015 1016
	len = sd->total_len;
	flags = sd->flags;

	/*
	 * Don't block on output, we have to drain the direct pipe.
	 */
	sd->flags &= ~SPLICE_F_NONBLOCK;
1017 1018 1019 1020 1021 1022 1023 1024 1025

	while (len) {
		size_t read_len, max_read_len;

		/*
		 * Do at most PIPE_BUFFERS pages worth of transfer:
		 */
		max_read_len = min(len, (size_t)(PIPE_BUFFERS*PAGE_SIZE));

J
Jens Axboe 已提交
1026
		ret = do_splice_to(in, &sd->pos, pipe, max_read_len, flags);
1027 1028 1029 1030
		if (unlikely(ret < 0))
			goto out_release;

		read_len = ret;
J
Jens Axboe 已提交
1031
		sd->total_len = read_len;
1032 1033 1034 1035 1036 1037

		/*
		 * 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 已提交
1038
		ret = actor(pipe, sd);
1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082
		if (unlikely(ret < 0))
			goto out_release;

		bytes += ret;
		len -= ret;

		/*
		 * In nonblocking mode, if we got back a short read then
		 * that was due to either an IO error or due to the
		 * pagecache entry not being there. In the IO error case
		 * the _next_ splice attempt will produce a clean IO error
		 * return value (not a short read), so in both cases it's
		 * correct to break out of the loop here:
		 */
		if ((flags & SPLICE_F_NONBLOCK) && (read_len < max_read_len))
			break;
	}

	pipe->nrbufs = pipe->curbuf = 0;

	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;
		}
	}
	pipe->nrbufs = pipe->curbuf = 0;

	/*
	 * If we transferred some data, return the number of bytes:
	 */
	if (bytes > 0)
		return bytes;

	return ret;
J
Jens Axboe 已提交
1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109

}
EXPORT_SYMBOL(splice_direct_to_actor);

static int direct_splice_actor(struct pipe_inode_info *pipe,
			       struct splice_desc *sd)
{
	struct file *file = sd->file;

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

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,
		.file		= out,
	};
	size_t ret;

	ret = splice_direct_to_actor(in, &sd, direct_splice_actor);
	*ppos = sd.pos;
	return ret;
1110 1111
}

1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124
/*
 * 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;
}

1125 1126 1127
/*
 * Determine where to splice to/from.
 */
1128 1129 1130
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)
1131
{
1132
	struct pipe_inode_info *pipe;
1133
	loff_t offset, *off;
J
Jens Axboe 已提交
1134
	long ret;
1135

1136
	pipe = pipe_info(in->f_path.dentry->d_inode);
1137 1138 1139
	if (pipe) {
		if (off_in)
			return -ESPIPE;
1140 1141 1142
		if (off_out) {
			if (out->f_op->llseek == no_llseek)
				return -EINVAL;
1143
			if (copy_from_user(&offset, off_out, sizeof(loff_t)))
1144
				return -EFAULT;
1145 1146 1147
			off = &offset;
		} else
			off = &out->f_pos;
1148

J
Jens Axboe 已提交
1149 1150 1151 1152 1153 1154
		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;
1155
	}
1156

1157
	pipe = pipe_info(out->f_path.dentry->d_inode);
1158 1159 1160
	if (pipe) {
		if (off_out)
			return -ESPIPE;
1161 1162 1163
		if (off_in) {
			if (in->f_op->llseek == no_llseek)
				return -EINVAL;
1164
			if (copy_from_user(&offset, off_in, sizeof(loff_t)))
1165
				return -EFAULT;
1166 1167 1168
			off = &offset;
		} else
			off = &in->f_pos;
1169

J
Jens Axboe 已提交
1170 1171 1172 1173 1174 1175
		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;
1176
	}
1177 1178 1179 1180

	return -EINVAL;
}

1181 1182 1183 1184 1185 1186 1187 1188 1189
/*
 * 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,
1190
				struct partial_page *partial, int aligned)
1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229
{
	int buffers = 0, error = 0;

	/*
	 * It's ok to take the mmap_sem for reading, even
	 * across a "get_user()".
	 */
	down_read(&current->mm->mmap_sem);

	while (nr_vecs) {
		unsigned long off, npages;
		void __user *base;
		size_t len;
		int i;

		/*
		 * 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;
		error = -EFAULT;
		if (unlikely(!base))
			break;

		/*
		 * Get this base offset and number of pages, then map
		 * in the user pages.
		 */
		off = (unsigned long) base & ~PAGE_MASK;
1230 1231 1232 1233 1234 1235 1236 1237 1238

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

1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253
		npages = (off + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
		if (npages > PIPE_BUFFERS - buffers)
			npages = PIPE_BUFFERS - buffers;

		error = get_user_pages(current, current->mm,
				       (unsigned long) base, npages, 0, 0,
				       &pages[buffers], NULL);

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

		/*
		 * Fill this contiguous range into the partial page map.
		 */
		for (i = 0; i < error; i++) {
1254
			const int plen = min_t(size_t, len, PAGE_SIZE - off);
1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 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 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314

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

	up_read(&current->mm->mmap_sem);

	if (buffers)
		return buffers;

	return error;
}

/*
 * 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.
 *
 * Note that vmsplice only supports 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).
 *
 * Alas, it isn't here.
 *
 */
static long do_vmsplice(struct file *file, const struct iovec __user *iov,
			unsigned long nr_segs, unsigned int flags)
{
1315
	struct pipe_inode_info *pipe;
1316 1317 1318 1319 1320 1321 1322 1323 1324
	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,
	};

1325
	pipe = pipe_info(file->f_path.dentry->d_inode);
1326
	if (!pipe)
1327 1328 1329 1330 1331 1332
		return -EBADF;
	if (unlikely(nr_segs > UIO_MAXIOV))
		return -EINVAL;
	else if (unlikely(!nr_segs))
		return 0;

1333 1334
	spd.nr_pages = get_iovec_page_array(iov, nr_segs, pages, partial,
					    flags & SPLICE_F_GIFT);
1335 1336 1337
	if (spd.nr_pages <= 0)
		return spd.nr_pages;

1338
	return splice_to_pipe(pipe, &spd);
1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359
}

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;

	error = -EBADF;
	file = fget_light(fd, &fput);
	if (file) {
		if (file->f_mode & FMODE_WRITE)
			error = do_vmsplice(file, iov, nr_segs, flags);

		fput_light(file, fput);
	}

	return error;
}

1360 1361 1362
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)
1363 1364 1365 1366 1367 1368 1369 1370 1371
{
	long error;
	struct file *in, *out;
	int fput_in, fput_out;

	if (unlikely(!len))
		return 0;

	error = -EBADF;
1372
	in = fget_light(fd_in, &fput_in);
1373 1374
	if (in) {
		if (in->f_mode & FMODE_READ) {
1375
			out = fget_light(fd_out, &fput_out);
1376 1377
			if (out) {
				if (out->f_mode & FMODE_WRITE)
1378 1379 1380
					error = do_splice(in, off_in,
							  out, off_out,
							  len, flags);
1381 1382 1383 1384 1385 1386 1387 1388 1389
				fput_light(out, fput_out);
			}
		}

		fput_light(in, fput_in);
	}

	return error;
}
1390

1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469
/*
 * 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;
}

1470 1471 1472 1473 1474 1475 1476 1477
/*
 * 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;
1478
	int ret = 0, i = 0, nbuf;
1479 1480 1481 1482 1483 1484

	/*
	 * 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).
	 */
1485
	inode_double_lock(ipipe->inode, opipe->inode);
1486

1487
	do {
1488 1489 1490 1491 1492 1493 1494
		if (!opipe->readers) {
			send_sig(SIGPIPE, current, 0);
			if (!ret)
				ret = -EPIPE;
			break;
		}

1495 1496 1497 1498 1499 1500
		/*
		 * If we have iterated all input buffers or ran out of
		 * output room, break.
		 */
		if (i >= ipipe->nrbufs || opipe->nrbufs >= PIPE_BUFFERS)
			break;
1501

1502 1503
		ibuf = ipipe->bufs + ((ipipe->curbuf + i) & (PIPE_BUFFERS - 1));
		nbuf = (opipe->curbuf + opipe->nrbufs) & (PIPE_BUFFERS - 1);
1504 1505

		/*
1506 1507
		 * Get a reference to this pipe buffer,
		 * so we can copy the contents over.
1508
		 */
1509 1510 1511 1512 1513
		ibuf->ops->get(ipipe, ibuf);

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

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

1520 1521
		if (obuf->len > len)
			obuf->len = len;
1522

1523 1524 1525 1526 1527
		opipe->nrbufs++;
		ret += obuf->len;
		len -= obuf->len;
		i++;
	} while (len);
1528

1529
	inode_double_unlock(ipipe->inode, opipe->inode);
1530

1531 1532 1533 1534
	/*
	 * If we put data in the output pipe, wakeup any potential readers.
	 */
	if (ret > 0) {
1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552
		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)
{
1553 1554
	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);
1555
	int ret = -EINVAL;
1556 1557

	/*
1558 1559
	 * Duplicate the contents of ipipe to opipe without actually
	 * copying the data.
1560
	 */
1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575
	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);
			if (!ret) {
				ret = link_pipe(ipipe, opipe, len, flags);
				if (!ret && (flags & SPLICE_F_NONBLOCK))
					ret = -EAGAIN;
			}
		}
	}
1576

1577
	return ret;
1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605
}

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