Linux Audio

Check our new training course

Loading...
v6.2
   1// SPDX-License-Identifier: GPL-2.0
   2/*
   3 *  linux/fs/pipe.c
   4 *
   5 *  Copyright (C) 1991, 1992, 1999  Linus Torvalds
   6 */
   7
   8#include <linux/mm.h>
   9#include <linux/file.h>
  10#include <linux/poll.h>
  11#include <linux/slab.h>
  12#include <linux/module.h>
  13#include <linux/init.h>
  14#include <linux/fs.h>
  15#include <linux/log2.h>
  16#include <linux/mount.h>
  17#include <linux/pseudo_fs.h>
  18#include <linux/magic.h>
  19#include <linux/pipe_fs_i.h>
  20#include <linux/uio.h>
  21#include <linux/highmem.h>
  22#include <linux/pagemap.h>
  23#include <linux/audit.h>
  24#include <linux/syscalls.h>
  25#include <linux/fcntl.h>
  26#include <linux/memcontrol.h>
  27#include <linux/watch_queue.h>
  28#include <linux/sysctl.h>
  29
  30#include <linux/uaccess.h>
  31#include <asm/ioctls.h>
  32
  33#include "internal.h"
  34
  35/*
  36 * New pipe buffers will be restricted to this size while the user is exceeding
  37 * their pipe buffer quota. The general pipe use case needs at least two
  38 * buffers: one for data yet to be read, and one for new data. If this is less
  39 * than two, then a write to a non-empty pipe may block even if the pipe is not
  40 * full. This can occur with GNU make jobserver or similar uses of pipes as
  41 * semaphores: multiple processes may be waiting to write tokens back to the
  42 * pipe before reading tokens: https://lore.kernel.org/lkml/1628086770.5rn8p04n6j.none@localhost/.
  43 *
  44 * Users can reduce their pipe buffers with F_SETPIPE_SZ below this at their
  45 * own risk, namely: pipe writes to non-full pipes may block until the pipe is
  46 * emptied.
  47 */
  48#define PIPE_MIN_DEF_BUFFERS 2
  49
  50/*
  51 * The max size that a non-root user is allowed to grow the pipe. Can
  52 * be set by root in /proc/sys/fs/pipe-max-size
  53 */
  54static unsigned int pipe_max_size = 1048576;
  55
  56/* Maximum allocatable pages per user. Hard limit is unset by default, soft
  57 * matches default values.
  58 */
  59static unsigned long pipe_user_pages_hard;
  60static unsigned long pipe_user_pages_soft = PIPE_DEF_BUFFERS * INR_OPEN_CUR;
  61
  62/*
  63 * We use head and tail indices that aren't masked off, except at the point of
  64 * dereference, but rather they're allowed to wrap naturally.  This means there
  65 * isn't a dead spot in the buffer, but the ring has to be a power of two and
  66 * <= 2^31.
  67 * -- David Howells 2019-09-23.
  68 *
  69 * Reads with count = 0 should always return 0.
  70 * -- Julian Bradfield 1999-06-07.
  71 *
  72 * FIFOs and Pipes now generate SIGIO for both readers and writers.
  73 * -- Jeremy Elson <jelson@circlemud.org> 2001-08-16
  74 *
  75 * pipe_read & write cleanup
  76 * -- Manfred Spraul <manfred@colorfullife.com> 2002-05-09
  77 */
  78
  79static void pipe_lock_nested(struct pipe_inode_info *pipe, int subclass)
  80{
  81	if (pipe->files)
  82		mutex_lock_nested(&pipe->mutex, subclass);
  83}
  84
  85void pipe_lock(struct pipe_inode_info *pipe)
  86{
  87	/*
  88	 * pipe_lock() nests non-pipe inode locks (for writing to a file)
  89	 */
  90	pipe_lock_nested(pipe, I_MUTEX_PARENT);
  91}
  92EXPORT_SYMBOL(pipe_lock);
  93
  94void pipe_unlock(struct pipe_inode_info *pipe)
  95{
  96	if (pipe->files)
  97		mutex_unlock(&pipe->mutex);
  98}
  99EXPORT_SYMBOL(pipe_unlock);
 100
 101static inline void __pipe_lock(struct pipe_inode_info *pipe)
 102{
 103	mutex_lock_nested(&pipe->mutex, I_MUTEX_PARENT);
 104}
 105
 106static inline void __pipe_unlock(struct pipe_inode_info *pipe)
 107{
 108	mutex_unlock(&pipe->mutex);
 109}
 110
 111void pipe_double_lock(struct pipe_inode_info *pipe1,
 112		      struct pipe_inode_info *pipe2)
 113{
 114	BUG_ON(pipe1 == pipe2);
 115
 116	if (pipe1 < pipe2) {
 117		pipe_lock_nested(pipe1, I_MUTEX_PARENT);
 118		pipe_lock_nested(pipe2, I_MUTEX_CHILD);
 119	} else {
 120		pipe_lock_nested(pipe2, I_MUTEX_PARENT);
 121		pipe_lock_nested(pipe1, I_MUTEX_CHILD);
 122	}
 123}
 124
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 125static void anon_pipe_buf_release(struct pipe_inode_info *pipe,
 126				  struct pipe_buffer *buf)
 127{
 128	struct page *page = buf->page;
 129
 130	/*
 131	 * If nobody else uses this page, and we don't already have a
 132	 * temporary page, let's keep track of it as a one-deep
 133	 * allocation cache. (Otherwise just release our reference to it)
 134	 */
 135	if (page_count(page) == 1 && !pipe->tmp_page)
 136		pipe->tmp_page = page;
 137	else
 138		put_page(page);
 139}
 140
 141static bool anon_pipe_buf_try_steal(struct pipe_inode_info *pipe,
 142		struct pipe_buffer *buf)
 143{
 144	struct page *page = buf->page;
 145
 146	if (page_count(page) != 1)
 147		return false;
 148	memcg_kmem_uncharge_page(page, 0);
 149	__SetPageLocked(page);
 150	return true;
 
 151}
 152
 153/**
 154 * generic_pipe_buf_try_steal - attempt to take ownership of a &pipe_buffer
 155 * @pipe:	the pipe that the buffer belongs to
 156 * @buf:	the buffer to attempt to steal
 157 *
 158 * Description:
 159 *	This function attempts to steal the &struct page attached to
 160 *	@buf. If successful, this function returns 0 and returns with
 161 *	the page locked. The caller may then reuse the page for whatever
 162 *	he wishes; the typical use is insertion into a different file
 163 *	page cache.
 164 */
 165bool generic_pipe_buf_try_steal(struct pipe_inode_info *pipe,
 166		struct pipe_buffer *buf)
 167{
 168	struct page *page = buf->page;
 169
 170	/*
 171	 * A reference of one is golden, that means that the owner of this
 172	 * page is the only one holding a reference to it. lock the page
 173	 * and return OK.
 174	 */
 175	if (page_count(page) == 1) {
 176		lock_page(page);
 177		return true;
 178	}
 179	return false;
 
 180}
 181EXPORT_SYMBOL(generic_pipe_buf_try_steal);
 182
 183/**
 184 * generic_pipe_buf_get - get a reference to a &struct pipe_buffer
 185 * @pipe:	the pipe that the buffer belongs to
 186 * @buf:	the buffer to get a reference to
 187 *
 188 * Description:
 189 *	This function grabs an extra reference to @buf. It's used in
 190 *	the tee() system call, when we duplicate the buffers in one
 191 *	pipe into another.
 192 */
 193bool generic_pipe_buf_get(struct pipe_inode_info *pipe, struct pipe_buffer *buf)
 194{
 195	return try_get_page(buf->page);
 196}
 197EXPORT_SYMBOL(generic_pipe_buf_get);
 198
 199/**
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 200 * generic_pipe_buf_release - put a reference to a &struct pipe_buffer
 201 * @pipe:	the pipe that the buffer belongs to
 202 * @buf:	the buffer to put a reference to
 203 *
 204 * Description:
 205 *	This function releases a reference to @buf.
 206 */
 207void generic_pipe_buf_release(struct pipe_inode_info *pipe,
 208			      struct pipe_buffer *buf)
 209{
 210	put_page(buf->page);
 211}
 212EXPORT_SYMBOL(generic_pipe_buf_release);
 213
 
 214static const struct pipe_buf_operations anon_pipe_buf_ops = {
 215	.release	= anon_pipe_buf_release,
 216	.try_steal	= anon_pipe_buf_try_steal,
 217	.get		= generic_pipe_buf_get,
 
 218};
 219
 220/* Done while waiting without holding the pipe lock - thus the READ_ONCE() */
 221static inline bool pipe_readable(const struct pipe_inode_info *pipe)
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 222{
 223	unsigned int head = READ_ONCE(pipe->head);
 224	unsigned int tail = READ_ONCE(pipe->tail);
 225	unsigned int writers = READ_ONCE(pipe->writers);
 226
 227	return !pipe_empty(head, tail) || !writers;
 
 
 228}
 229
 230static ssize_t
 231pipe_read(struct kiocb *iocb, struct iov_iter *to)
 232{
 233	size_t total_len = iov_iter_count(to);
 234	struct file *filp = iocb->ki_filp;
 235	struct pipe_inode_info *pipe = filp->private_data;
 236	bool was_full, wake_next_reader = false;
 237	ssize_t ret;
 238
 239	/* Null read succeeds. */
 240	if (unlikely(total_len == 0))
 241		return 0;
 242
 
 243	ret = 0;
 244	__pipe_lock(pipe);
 245
 246	/*
 247	 * We only wake up writers if the pipe was full when we started
 248	 * reading in order to avoid unnecessary wakeups.
 249	 *
 250	 * But when we do wake up writers, we do so using a sync wakeup
 251	 * (WF_SYNC), because we want them to get going and generate more
 252	 * data for us.
 253	 */
 254	was_full = pipe_full(pipe->head, pipe->tail, pipe->max_usage);
 255	for (;;) {
 256		/* Read ->head with a barrier vs post_one_notification() */
 257		unsigned int head = smp_load_acquire(&pipe->head);
 258		unsigned int tail = pipe->tail;
 259		unsigned int mask = pipe->ring_size - 1;
 260
 261#ifdef CONFIG_WATCH_QUEUE
 262		if (pipe->note_loss) {
 263			struct watch_notification n;
 264
 265			if (total_len < 8) {
 266				if (ret == 0)
 267					ret = -ENOBUFS;
 268				break;
 269			}
 270
 271			n.type = WATCH_TYPE_META;
 272			n.subtype = WATCH_META_LOSS_NOTIFICATION;
 273			n.info = watch_sizeof(n);
 274			if (copy_to_iter(&n, sizeof(n), to) != sizeof(n)) {
 275				if (ret == 0)
 276					ret = -EFAULT;
 277				break;
 278			}
 279			ret += sizeof(n);
 280			total_len -= sizeof(n);
 281			pipe->note_loss = false;
 282		}
 283#endif
 284
 285		if (!pipe_empty(head, tail)) {
 286			struct pipe_buffer *buf = &pipe->bufs[tail & mask];
 287			size_t chars = buf->len;
 288			size_t written;
 289			int error;
 290
 291			if (chars > total_len) {
 292				if (buf->flags & PIPE_BUF_FLAG_WHOLE) {
 293					if (ret == 0)
 294						ret = -ENOBUFS;
 295					break;
 296				}
 297				chars = total_len;
 298			}
 299
 300			error = pipe_buf_confirm(pipe, buf);
 301			if (error) {
 302				if (!ret)
 303					ret = error;
 304				break;
 305			}
 306
 307			written = copy_page_to_iter(buf->page, buf->offset, chars, to);
 308			if (unlikely(written < chars)) {
 309				if (!ret)
 310					ret = -EFAULT;
 311				break;
 312			}
 313			ret += chars;
 314			buf->offset += chars;
 315			buf->len -= chars;
 316
 317			/* Was it a packet buffer? Clean up and exit */
 318			if (buf->flags & PIPE_BUF_FLAG_PACKET) {
 319				total_len = chars;
 320				buf->len = 0;
 321			}
 322
 323			if (!buf->len) {
 324				pipe_buf_release(pipe, buf);
 325				spin_lock_irq(&pipe->rd_wait.lock);
 326#ifdef CONFIG_WATCH_QUEUE
 327				if (buf->flags & PIPE_BUF_FLAG_LOSS)
 328					pipe->note_loss = true;
 329#endif
 330				tail++;
 331				pipe->tail = tail;
 332				spin_unlock_irq(&pipe->rd_wait.lock);
 333			}
 334			total_len -= chars;
 335			if (!total_len)
 336				break;	/* common path: read succeeded */
 337			if (!pipe_empty(head, tail))	/* More to do? */
 338				continue;
 339		}
 340
 
 341		if (!pipe->writers)
 342			break;
 343		if (ret)
 344			break;
 345		if (filp->f_flags & O_NONBLOCK) {
 346			ret = -EAGAIN;
 
 
 
 
 
 
 
 
 
 
 
 
 347			break;
 348		}
 349		__pipe_unlock(pipe);
 350
 351		/*
 352		 * We only get here if we didn't actually read anything.
 353		 *
 354		 * However, we could have seen (and removed) a zero-sized
 355		 * pipe buffer, and might have made space in the buffers
 356		 * that way.
 357		 *
 358		 * You can't make zero-sized pipe buffers by doing an empty
 359		 * write (not even in packet mode), but they can happen if
 360		 * the writer gets an EFAULT when trying to fill a buffer
 361		 * that already got allocated and inserted in the buffer
 362		 * array.
 363		 *
 364		 * So we still need to wake up any pending writers in the
 365		 * _very_ unlikely case that the pipe was full, but we got
 366		 * no data.
 367		 */
 368		if (unlikely(was_full))
 369			wake_up_interruptible_sync_poll(&pipe->wr_wait, EPOLLOUT | EPOLLWRNORM);
 370		kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
 371
 372		/*
 373		 * But because we didn't read anything, at this point we can
 374		 * just return directly with -ERESTARTSYS if we're interrupted,
 375		 * since we've done any required wakeups and there's no need
 376		 * to mark anything accessed. And we've dropped the lock.
 377		 */
 378		if (wait_event_interruptible_exclusive(pipe->rd_wait, pipe_readable(pipe)) < 0)
 379			return -ERESTARTSYS;
 380
 381		__pipe_lock(pipe);
 382		was_full = pipe_full(pipe->head, pipe->tail, pipe->max_usage);
 383		wake_next_reader = true;
 384	}
 385	if (pipe_empty(pipe->head, pipe->tail))
 386		wake_next_reader = false;
 387	__pipe_unlock(pipe);
 388
 389	if (was_full)
 390		wake_up_interruptible_sync_poll(&pipe->wr_wait, EPOLLOUT | EPOLLWRNORM);
 391	if (wake_next_reader)
 392		wake_up_interruptible_sync_poll(&pipe->rd_wait, EPOLLIN | EPOLLRDNORM);
 393	kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
 394	if (ret > 0)
 395		file_accessed(filp);
 396	return ret;
 397}
 398
 399static inline int is_packetized(struct file *file)
 400{
 401	return (file->f_flags & O_DIRECT) != 0;
 402}
 403
 404/* Done while waiting without holding the pipe lock - thus the READ_ONCE() */
 405static inline bool pipe_writable(const struct pipe_inode_info *pipe)
 406{
 407	unsigned int head = READ_ONCE(pipe->head);
 408	unsigned int tail = READ_ONCE(pipe->tail);
 409	unsigned int max_usage = READ_ONCE(pipe->max_usage);
 410
 411	return !pipe_full(head, tail, max_usage) ||
 412		!READ_ONCE(pipe->readers);
 413}
 414
 415static ssize_t
 416pipe_write(struct kiocb *iocb, struct iov_iter *from)
 417{
 418	struct file *filp = iocb->ki_filp;
 419	struct pipe_inode_info *pipe = filp->private_data;
 420	unsigned int head;
 421	ssize_t ret = 0;
 
 422	size_t total_len = iov_iter_count(from);
 423	ssize_t chars;
 424	bool was_empty = false;
 425	bool wake_next_writer = false;
 426
 427	/* Null write succeeds. */
 428	if (unlikely(total_len == 0))
 429		return 0;
 430
 431	__pipe_lock(pipe);
 432
 433	if (!pipe->readers) {
 434		send_sig(SIGPIPE, current, 0);
 435		ret = -EPIPE;
 436		goto out;
 437	}
 438
 439#ifdef CONFIG_WATCH_QUEUE
 440	if (pipe->watch_queue) {
 441		ret = -EXDEV;
 442		goto out;
 443	}
 444#endif
 445
 446	/*
 447	 * If it wasn't empty we try to merge new data into
 448	 * the last buffer.
 449	 *
 450	 * That naturally merges small writes, but it also
 451	 * page-aligns the rest of the writes for large writes
 452	 * spanning multiple pages.
 453	 */
 454	head = pipe->head;
 455	was_empty = pipe_empty(head, pipe->tail);
 456	chars = total_len & (PAGE_SIZE-1);
 457	if (chars && !was_empty) {
 458		unsigned int mask = pipe->ring_size - 1;
 459		struct pipe_buffer *buf = &pipe->bufs[(head - 1) & mask];
 460		int offset = buf->offset + buf->len;
 461
 462		if ((buf->flags & PIPE_BUF_FLAG_CAN_MERGE) &&
 463		    offset + chars <= PAGE_SIZE) {
 464			ret = pipe_buf_confirm(pipe, buf);
 465			if (ret)
 466				goto out;
 467
 468			ret = copy_page_from_iter(buf->page, offset, chars, from);
 469			if (unlikely(ret < chars)) {
 470				ret = -EFAULT;
 471				goto out;
 472			}
 473
 474			buf->len += ret;
 475			if (!iov_iter_count(from))
 476				goto out;
 477		}
 478	}
 479
 480	for (;;) {
 
 
 481		if (!pipe->readers) {
 482			send_sig(SIGPIPE, current, 0);
 483			if (!ret)
 484				ret = -EPIPE;
 485			break;
 486		}
 487
 488		head = pipe->head;
 489		if (!pipe_full(head, pipe->tail, pipe->max_usage)) {
 490			unsigned int mask = pipe->ring_size - 1;
 491			struct pipe_buffer *buf = &pipe->bufs[head & mask];
 492			struct page *page = pipe->tmp_page;
 493			int copied;
 494
 495			if (!page) {
 496				page = alloc_page(GFP_HIGHUSER | __GFP_ACCOUNT);
 497				if (unlikely(!page)) {
 498					ret = ret ? : -ENOMEM;
 499					break;
 500				}
 501				pipe->tmp_page = page;
 502			}
 503
 504			/* Allocate a slot in the ring in advance and attach an
 505			 * empty buffer.  If we fault or otherwise fail to use
 506			 * it, either the reader will consume it or it'll still
 507			 * be there for the next write.
 508			 */
 509			spin_lock_irq(&pipe->rd_wait.lock);
 510
 511			head = pipe->head;
 512			if (pipe_full(head, pipe->tail, pipe->max_usage)) {
 513				spin_unlock_irq(&pipe->rd_wait.lock);
 514				continue;
 515			}
 516
 517			pipe->head = head + 1;
 518			spin_unlock_irq(&pipe->rd_wait.lock);
 519
 520			/* Insert it into the buffer array */
 521			buf = &pipe->bufs[head & mask];
 522			buf->page = page;
 523			buf->ops = &anon_pipe_buf_ops;
 524			buf->offset = 0;
 525			buf->len = 0;
 526			if (is_packetized(filp))
 527				buf->flags = PIPE_BUF_FLAG_PACKET;
 528			else
 529				buf->flags = PIPE_BUF_FLAG_CAN_MERGE;
 530			pipe->tmp_page = NULL;
 531
 532			copied = copy_page_from_iter(page, 0, PAGE_SIZE, from);
 533			if (unlikely(copied < PAGE_SIZE && iov_iter_count(from))) {
 534				if (!ret)
 535					ret = -EFAULT;
 536				break;
 537			}
 538			ret += copied;
 
 
 
 
 539			buf->offset = 0;
 540			buf->len = copied;
 
 
 
 
 
 
 
 541
 542			if (!iov_iter_count(from))
 543				break;
 544		}
 545
 546		if (!pipe_full(head, pipe->tail, pipe->max_usage))
 547			continue;
 548
 549		/* Wait for buffer space to become available. */
 550		if (filp->f_flags & O_NONBLOCK) {
 551			if (!ret)
 552				ret = -EAGAIN;
 553			break;
 554		}
 555		if (signal_pending(current)) {
 556			if (!ret)
 557				ret = -ERESTARTSYS;
 558			break;
 559		}
 560
 561		/*
 562		 * We're going to release the pipe lock and wait for more
 563		 * space. We wake up any readers if necessary, and then
 564		 * after waiting we need to re-check whether the pipe
 565		 * become empty while we dropped the lock.
 566		 */
 567		__pipe_unlock(pipe);
 568		if (was_empty)
 569			wake_up_interruptible_sync_poll(&pipe->rd_wait, EPOLLIN | EPOLLRDNORM);
 570		kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
 571		wait_event_interruptible_exclusive(pipe->wr_wait, pipe_writable(pipe));
 572		__pipe_lock(pipe);
 573		was_empty = pipe_empty(pipe->head, pipe->tail);
 574		wake_next_writer = true;
 575	}
 576out:
 577	if (pipe_full(pipe->head, pipe->tail, pipe->max_usage))
 578		wake_next_writer = false;
 579	__pipe_unlock(pipe);
 580
 581	/*
 582	 * If we do do a wakeup event, we do a 'sync' wakeup, because we
 583	 * want the reader to start processing things asap, rather than
 584	 * leave the data pending.
 585	 *
 586	 * This is particularly important for small writes, because of
 587	 * how (for example) the GNU make jobserver uses small writes to
 588	 * wake up pending jobs
 589	 *
 590	 * Epoll nonsensically wants a wakeup whether the pipe
 591	 * was already empty or not.
 592	 */
 593	if (was_empty || pipe->poll_usage)
 594		wake_up_interruptible_sync_poll(&pipe->rd_wait, EPOLLIN | EPOLLRDNORM);
 595	kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
 596	if (wake_next_writer)
 597		wake_up_interruptible_sync_poll(&pipe->wr_wait, EPOLLOUT | EPOLLWRNORM);
 598	if (ret > 0 && sb_start_write_trylock(file_inode(filp)->i_sb)) {
 599		int err = file_update_time(filp);
 600		if (err)
 601			ret = err;
 602		sb_end_write(file_inode(filp)->i_sb);
 603	}
 604	return ret;
 605}
 606
 607static long pipe_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
 608{
 609	struct pipe_inode_info *pipe = filp->private_data;
 610	unsigned int count, head, tail, mask;
 611
 612	switch (cmd) {
 613	case FIONREAD:
 614		__pipe_lock(pipe);
 615		count = 0;
 616		head = pipe->head;
 617		tail = pipe->tail;
 618		mask = pipe->ring_size - 1;
 619
 620		while (tail != head) {
 621			count += pipe->bufs[tail & mask].len;
 622			tail++;
 623		}
 624		__pipe_unlock(pipe);
 625
 626		return put_user(count, (int __user *)arg);
 627
 628#ifdef CONFIG_WATCH_QUEUE
 629	case IOC_WATCH_QUEUE_SET_SIZE: {
 630		int ret;
 631		__pipe_lock(pipe);
 632		ret = watch_queue_set_size(pipe, arg);
 633		__pipe_unlock(pipe);
 634		return ret;
 635	}
 636
 637	case IOC_WATCH_QUEUE_SET_FILTER:
 638		return watch_queue_set_filter(
 639			pipe, (struct watch_notification_filter __user *)arg);
 640#endif
 641
 642	default:
 643		return -ENOIOCTLCMD;
 
 644	}
 645}
 646
 647/* No kernel lock held - fine */
 648static __poll_t
 649pipe_poll(struct file *filp, poll_table *wait)
 650{
 651	__poll_t mask;
 652	struct pipe_inode_info *pipe = filp->private_data;
 653	unsigned int head, tail;
 654
 655	/* Epoll has some historical nasty semantics, this enables them */
 656	WRITE_ONCE(pipe->poll_usage, true);
 657
 658	/*
 659	 * Reading pipe state only -- no need for acquiring the semaphore.
 660	 *
 661	 * But because this is racy, the code has to add the
 662	 * entry to the poll table _first_ ..
 663	 */
 664	if (filp->f_mode & FMODE_READ)
 665		poll_wait(filp, &pipe->rd_wait, wait);
 666	if (filp->f_mode & FMODE_WRITE)
 667		poll_wait(filp, &pipe->wr_wait, wait);
 668
 669	/*
 670	 * .. and only then can you do the racy tests. That way,
 671	 * if something changes and you got it wrong, the poll
 672	 * table entry will wake you up and fix it.
 673	 */
 674	head = READ_ONCE(pipe->head);
 675	tail = READ_ONCE(pipe->tail);
 676
 
 
 677	mask = 0;
 678	if (filp->f_mode & FMODE_READ) {
 679		if (!pipe_empty(head, tail))
 680			mask |= EPOLLIN | EPOLLRDNORM;
 681		if (!pipe->writers && filp->f_version != pipe->w_counter)
 682			mask |= EPOLLHUP;
 683	}
 684
 685	if (filp->f_mode & FMODE_WRITE) {
 686		if (!pipe_full(head, tail, pipe->max_usage))
 687			mask |= EPOLLOUT | EPOLLWRNORM;
 688		/*
 689		 * Most Unices do not set EPOLLERR for FIFOs but on Linux they
 690		 * behave exactly like pipes for poll().
 691		 */
 692		if (!pipe->readers)
 693			mask |= EPOLLERR;
 694	}
 695
 696	return mask;
 697}
 698
 699static void put_pipe_info(struct inode *inode, struct pipe_inode_info *pipe)
 700{
 701	int kill = 0;
 702
 703	spin_lock(&inode->i_lock);
 704	if (!--pipe->files) {
 705		inode->i_pipe = NULL;
 706		kill = 1;
 707	}
 708	spin_unlock(&inode->i_lock);
 709
 710	if (kill)
 711		free_pipe_info(pipe);
 712}
 713
 714static int
 715pipe_release(struct inode *inode, struct file *file)
 716{
 717	struct pipe_inode_info *pipe = file->private_data;
 718
 719	__pipe_lock(pipe);
 720	if (file->f_mode & FMODE_READ)
 721		pipe->readers--;
 722	if (file->f_mode & FMODE_WRITE)
 723		pipe->writers--;
 724
 725	/* Was that the last reader or writer, but not the other side? */
 726	if (!pipe->readers != !pipe->writers) {
 727		wake_up_interruptible_all(&pipe->rd_wait);
 728		wake_up_interruptible_all(&pipe->wr_wait);
 729		kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
 730		kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
 731	}
 732	__pipe_unlock(pipe);
 733
 734	put_pipe_info(inode, pipe);
 735	return 0;
 736}
 737
 738static int
 739pipe_fasync(int fd, struct file *filp, int on)
 740{
 741	struct pipe_inode_info *pipe = filp->private_data;
 742	int retval = 0;
 743
 744	__pipe_lock(pipe);
 745	if (filp->f_mode & FMODE_READ)
 746		retval = fasync_helper(fd, filp, on, &pipe->fasync_readers);
 747	if ((filp->f_mode & FMODE_WRITE) && retval >= 0) {
 748		retval = fasync_helper(fd, filp, on, &pipe->fasync_writers);
 749		if (retval < 0 && (filp->f_mode & FMODE_READ))
 750			/* this can happen only if on == T */
 751			fasync_helper(-1, filp, 0, &pipe->fasync_readers);
 752	}
 753	__pipe_unlock(pipe);
 754	return retval;
 755}
 756
 757unsigned long account_pipe_buffers(struct user_struct *user,
 758				   unsigned long old, unsigned long new)
 759{
 760	return atomic_long_add_return(new - old, &user->pipe_bufs);
 761}
 762
 763bool too_many_pipe_buffers_soft(unsigned long user_bufs)
 764{
 765	unsigned long soft_limit = READ_ONCE(pipe_user_pages_soft);
 766
 767	return soft_limit && user_bufs > soft_limit;
 768}
 769
 770bool too_many_pipe_buffers_hard(unsigned long user_bufs)
 771{
 772	unsigned long hard_limit = READ_ONCE(pipe_user_pages_hard);
 773
 774	return hard_limit && user_bufs > hard_limit;
 775}
 776
 777bool pipe_is_unprivileged_user(void)
 778{
 779	return !capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN);
 780}
 781
 782struct pipe_inode_info *alloc_pipe_info(void)
 783{
 784	struct pipe_inode_info *pipe;
 785	unsigned long pipe_bufs = PIPE_DEF_BUFFERS;
 786	struct user_struct *user = get_current_user();
 787	unsigned long user_bufs;
 788	unsigned int max_size = READ_ONCE(pipe_max_size);
 789
 790	pipe = kzalloc(sizeof(struct pipe_inode_info), GFP_KERNEL_ACCOUNT);
 791	if (pipe == NULL)
 792		goto out_free_uid;
 793
 794	if (pipe_bufs * PAGE_SIZE > max_size && !capable(CAP_SYS_RESOURCE))
 795		pipe_bufs = max_size >> PAGE_SHIFT;
 796
 797	user_bufs = account_pipe_buffers(user, 0, pipe_bufs);
 798
 799	if (too_many_pipe_buffers_soft(user_bufs) && pipe_is_unprivileged_user()) {
 800		user_bufs = account_pipe_buffers(user, pipe_bufs, PIPE_MIN_DEF_BUFFERS);
 801		pipe_bufs = PIPE_MIN_DEF_BUFFERS;
 802	}
 803
 804	if (too_many_pipe_buffers_hard(user_bufs) && pipe_is_unprivileged_user())
 805		goto out_revert_acct;
 806
 807	pipe->bufs = kcalloc(pipe_bufs, sizeof(struct pipe_buffer),
 808			     GFP_KERNEL_ACCOUNT);
 809
 810	if (pipe->bufs) {
 811		init_waitqueue_head(&pipe->rd_wait);
 812		init_waitqueue_head(&pipe->wr_wait);
 813		pipe->r_counter = pipe->w_counter = 1;
 814		pipe->max_usage = pipe_bufs;
 815		pipe->ring_size = pipe_bufs;
 816		pipe->nr_accounted = pipe_bufs;
 817		pipe->user = user;
 818		mutex_init(&pipe->mutex);
 819		return pipe;
 820	}
 821
 822out_revert_acct:
 823	(void) account_pipe_buffers(user, pipe_bufs, 0);
 824	kfree(pipe);
 825out_free_uid:
 826	free_uid(user);
 827	return NULL;
 828}
 829
 830void free_pipe_info(struct pipe_inode_info *pipe)
 831{
 832	unsigned int i;
 833
 834#ifdef CONFIG_WATCH_QUEUE
 835	if (pipe->watch_queue)
 836		watch_queue_clear(pipe->watch_queue);
 837#endif
 838
 839	(void) account_pipe_buffers(pipe->user, pipe->nr_accounted, 0);
 840	free_uid(pipe->user);
 841	for (i = 0; i < pipe->ring_size; i++) {
 842		struct pipe_buffer *buf = pipe->bufs + i;
 843		if (buf->ops)
 844			pipe_buf_release(pipe, buf);
 845	}
 846#ifdef CONFIG_WATCH_QUEUE
 847	if (pipe->watch_queue)
 848		put_watch_queue(pipe->watch_queue);
 849#endif
 850	if (pipe->tmp_page)
 851		__free_page(pipe->tmp_page);
 852	kfree(pipe->bufs);
 853	kfree(pipe);
 854}
 855
 856static struct vfsmount *pipe_mnt __read_mostly;
 857
 858/*
 859 * pipefs_dname() is called from d_path().
 860 */
 861static char *pipefs_dname(struct dentry *dentry, char *buffer, int buflen)
 862{
 863	return dynamic_dname(buffer, buflen, "pipe:[%lu]",
 864				d_inode(dentry)->i_ino);
 865}
 866
 867static const struct dentry_operations pipefs_dentry_operations = {
 868	.d_dname	= pipefs_dname,
 869};
 870
 871static struct inode * get_pipe_inode(void)
 872{
 873	struct inode *inode = new_inode_pseudo(pipe_mnt->mnt_sb);
 874	struct pipe_inode_info *pipe;
 875
 876	if (!inode)
 877		goto fail_inode;
 878
 879	inode->i_ino = get_next_ino();
 880
 881	pipe = alloc_pipe_info();
 882	if (!pipe)
 883		goto fail_iput;
 884
 885	inode->i_pipe = pipe;
 886	pipe->files = 2;
 887	pipe->readers = pipe->writers = 1;
 888	inode->i_fop = &pipefifo_fops;
 889
 890	/*
 891	 * Mark the inode dirty from the very beginning,
 892	 * that way it will never be moved to the dirty
 893	 * list because "mark_inode_dirty()" will think
 894	 * that it already _is_ on the dirty list.
 895	 */
 896	inode->i_state = I_DIRTY;
 897	inode->i_mode = S_IFIFO | S_IRUSR | S_IWUSR;
 898	inode->i_uid = current_fsuid();
 899	inode->i_gid = current_fsgid();
 900	inode->i_atime = inode->i_mtime = inode->i_ctime = current_time(inode);
 901
 902	return inode;
 903
 904fail_iput:
 905	iput(inode);
 906
 907fail_inode:
 908	return NULL;
 909}
 910
 911int create_pipe_files(struct file **res, int flags)
 912{
 913	struct inode *inode = get_pipe_inode();
 914	struct file *f;
 915	int error;
 916
 917	if (!inode)
 918		return -ENFILE;
 919
 920	if (flags & O_NOTIFICATION_PIPE) {
 921		error = watch_queue_init(inode->i_pipe);
 922		if (error) {
 923			free_pipe_info(inode->i_pipe);
 924			iput(inode);
 925			return error;
 926		}
 927	}
 928
 929	f = alloc_file_pseudo(inode, pipe_mnt, "",
 930				O_WRONLY | (flags & (O_NONBLOCK | O_DIRECT)),
 931				&pipefifo_fops);
 932	if (IS_ERR(f)) {
 933		free_pipe_info(inode->i_pipe);
 934		iput(inode);
 935		return PTR_ERR(f);
 936	}
 937
 938	f->private_data = inode->i_pipe;
 939
 940	res[0] = alloc_file_clone(f, O_RDONLY | (flags & O_NONBLOCK),
 941				  &pipefifo_fops);
 942	if (IS_ERR(res[0])) {
 943		put_pipe_info(inode, inode->i_pipe);
 944		fput(f);
 945		return PTR_ERR(res[0]);
 946	}
 947	res[0]->private_data = inode->i_pipe;
 948	res[1] = f;
 949	stream_open(inode, res[0]);
 950	stream_open(inode, res[1]);
 951	return 0;
 952}
 953
 954static int __do_pipe_flags(int *fd, struct file **files, int flags)
 955{
 956	int error;
 957	int fdw, fdr;
 958
 959	if (flags & ~(O_CLOEXEC | O_NONBLOCK | O_DIRECT | O_NOTIFICATION_PIPE))
 960		return -EINVAL;
 961
 962	error = create_pipe_files(files, flags);
 963	if (error)
 964		return error;
 965
 966	error = get_unused_fd_flags(flags);
 967	if (error < 0)
 968		goto err_read_pipe;
 969	fdr = error;
 970
 971	error = get_unused_fd_flags(flags);
 972	if (error < 0)
 973		goto err_fdr;
 974	fdw = error;
 975
 976	audit_fd_pair(fdr, fdw);
 977	fd[0] = fdr;
 978	fd[1] = fdw;
 979	return 0;
 980
 981 err_fdr:
 982	put_unused_fd(fdr);
 983 err_read_pipe:
 984	fput(files[0]);
 985	fput(files[1]);
 986	return error;
 987}
 988
 989int do_pipe_flags(int *fd, int flags)
 990{
 991	struct file *files[2];
 992	int error = __do_pipe_flags(fd, files, flags);
 993	if (!error) {
 994		fd_install(fd[0], files[0]);
 995		fd_install(fd[1], files[1]);
 996	}
 997	return error;
 998}
 999
1000/*
1001 * sys_pipe() is the normal C calling standard for creating
1002 * a pipe. It's not the way Unix traditionally does this, though.
1003 */
1004static int do_pipe2(int __user *fildes, int flags)
1005{
1006	struct file *files[2];
1007	int fd[2];
1008	int error;
1009
1010	error = __do_pipe_flags(fd, files, flags);
1011	if (!error) {
1012		if (unlikely(copy_to_user(fildes, fd, sizeof(fd)))) {
1013			fput(files[0]);
1014			fput(files[1]);
1015			put_unused_fd(fd[0]);
1016			put_unused_fd(fd[1]);
1017			error = -EFAULT;
1018		} else {
1019			fd_install(fd[0], files[0]);
1020			fd_install(fd[1], files[1]);
1021		}
1022	}
1023	return error;
1024}
1025
1026SYSCALL_DEFINE2(pipe2, int __user *, fildes, int, flags)
1027{
1028	return do_pipe2(fildes, flags);
1029}
1030
1031SYSCALL_DEFINE1(pipe, int __user *, fildes)
1032{
1033	return do_pipe2(fildes, 0);
1034}
1035
1036/*
1037 * This is the stupid "wait for pipe to be readable or writable"
1038 * model.
1039 *
1040 * See pipe_read/write() for the proper kind of exclusive wait,
1041 * but that requires that we wake up any other readers/writers
1042 * if we then do not end up reading everything (ie the whole
1043 * "wake_next_reader/writer" logic in pipe_read/write()).
1044 */
1045void pipe_wait_readable(struct pipe_inode_info *pipe)
1046{
1047	pipe_unlock(pipe);
1048	wait_event_interruptible(pipe->rd_wait, pipe_readable(pipe));
1049	pipe_lock(pipe);
1050}
1051
1052void pipe_wait_writable(struct pipe_inode_info *pipe)
1053{
1054	pipe_unlock(pipe);
1055	wait_event_interruptible(pipe->wr_wait, pipe_writable(pipe));
1056	pipe_lock(pipe);
1057}
1058
1059/*
1060 * This depends on both the wait (here) and the wakeup (wake_up_partner)
1061 * holding the pipe lock, so "*cnt" is stable and we know a wakeup cannot
1062 * race with the count check and waitqueue prep.
1063 *
1064 * Normally in order to avoid races, you'd do the prepare_to_wait() first,
1065 * then check the condition you're waiting for, and only then sleep. But
1066 * because of the pipe lock, we can check the condition before being on
1067 * the wait queue.
1068 *
1069 * We use the 'rd_wait' waitqueue for pipe partner waiting.
1070 */
1071static int wait_for_partner(struct pipe_inode_info *pipe, unsigned int *cnt)
1072{
1073	DEFINE_WAIT(rdwait);
1074	int cur = *cnt;
1075
1076	while (cur == *cnt) {
1077		prepare_to_wait(&pipe->rd_wait, &rdwait, TASK_INTERRUPTIBLE);
1078		pipe_unlock(pipe);
1079		schedule();
1080		finish_wait(&pipe->rd_wait, &rdwait);
1081		pipe_lock(pipe);
1082		if (signal_pending(current))
1083			break;
1084	}
1085	return cur == *cnt ? -ERESTARTSYS : 0;
1086}
1087
1088static void wake_up_partner(struct pipe_inode_info *pipe)
1089{
1090	wake_up_interruptible_all(&pipe->rd_wait);
1091}
1092
1093static int fifo_open(struct inode *inode, struct file *filp)
1094{
1095	struct pipe_inode_info *pipe;
1096	bool is_pipe = inode->i_sb->s_magic == PIPEFS_MAGIC;
1097	int ret;
1098
1099	filp->f_version = 0;
1100
1101	spin_lock(&inode->i_lock);
1102	if (inode->i_pipe) {
1103		pipe = inode->i_pipe;
1104		pipe->files++;
1105		spin_unlock(&inode->i_lock);
1106	} else {
1107		spin_unlock(&inode->i_lock);
1108		pipe = alloc_pipe_info();
1109		if (!pipe)
1110			return -ENOMEM;
1111		pipe->files = 1;
1112		spin_lock(&inode->i_lock);
1113		if (unlikely(inode->i_pipe)) {
1114			inode->i_pipe->files++;
1115			spin_unlock(&inode->i_lock);
1116			free_pipe_info(pipe);
1117			pipe = inode->i_pipe;
1118		} else {
1119			inode->i_pipe = pipe;
1120			spin_unlock(&inode->i_lock);
1121		}
1122	}
1123	filp->private_data = pipe;
1124	/* OK, we have a pipe and it's pinned down */
1125
1126	__pipe_lock(pipe);
1127
1128	/* We can only do regular read/write on fifos */
1129	stream_open(inode, filp);
1130
1131	switch (filp->f_mode & (FMODE_READ | FMODE_WRITE)) {
1132	case FMODE_READ:
1133	/*
1134	 *  O_RDONLY
1135	 *  POSIX.1 says that O_NONBLOCK means return with the FIFO
1136	 *  opened, even when there is no process writing the FIFO.
1137	 */
1138		pipe->r_counter++;
1139		if (pipe->readers++ == 0)
1140			wake_up_partner(pipe);
1141
1142		if (!is_pipe && !pipe->writers) {
1143			if ((filp->f_flags & O_NONBLOCK)) {
1144				/* suppress EPOLLHUP until we have
1145				 * seen a writer */
1146				filp->f_version = pipe->w_counter;
1147			} else {
1148				if (wait_for_partner(pipe, &pipe->w_counter))
1149					goto err_rd;
1150			}
1151		}
1152		break;
1153
1154	case FMODE_WRITE:
1155	/*
1156	 *  O_WRONLY
1157	 *  POSIX.1 says that O_NONBLOCK means return -1 with
1158	 *  errno=ENXIO when there is no process reading the FIFO.
1159	 */
1160		ret = -ENXIO;
1161		if (!is_pipe && (filp->f_flags & O_NONBLOCK) && !pipe->readers)
1162			goto err;
1163
1164		pipe->w_counter++;
1165		if (!pipe->writers++)
1166			wake_up_partner(pipe);
1167
1168		if (!is_pipe && !pipe->readers) {
1169			if (wait_for_partner(pipe, &pipe->r_counter))
1170				goto err_wr;
1171		}
1172		break;
1173
1174	case FMODE_READ | FMODE_WRITE:
1175	/*
1176	 *  O_RDWR
1177	 *  POSIX.1 leaves this case "undefined" when O_NONBLOCK is set.
1178	 *  This implementation will NEVER block on a O_RDWR open, since
1179	 *  the process can at least talk to itself.
1180	 */
1181
1182		pipe->readers++;
1183		pipe->writers++;
1184		pipe->r_counter++;
1185		pipe->w_counter++;
1186		if (pipe->readers == 1 || pipe->writers == 1)
1187			wake_up_partner(pipe);
1188		break;
1189
1190	default:
1191		ret = -EINVAL;
1192		goto err;
1193	}
1194
1195	/* Ok! */
1196	__pipe_unlock(pipe);
1197	return 0;
1198
1199err_rd:
1200	if (!--pipe->readers)
1201		wake_up_interruptible(&pipe->wr_wait);
1202	ret = -ERESTARTSYS;
1203	goto err;
1204
1205err_wr:
1206	if (!--pipe->writers)
1207		wake_up_interruptible_all(&pipe->rd_wait);
1208	ret = -ERESTARTSYS;
1209	goto err;
1210
1211err:
1212	__pipe_unlock(pipe);
1213
1214	put_pipe_info(inode, pipe);
1215	return ret;
1216}
1217
1218const struct file_operations pipefifo_fops = {
1219	.open		= fifo_open,
1220	.llseek		= no_llseek,
1221	.read_iter	= pipe_read,
1222	.write_iter	= pipe_write,
1223	.poll		= pipe_poll,
1224	.unlocked_ioctl	= pipe_ioctl,
1225	.release	= pipe_release,
1226	.fasync		= pipe_fasync,
1227	.splice_write	= iter_file_splice_write,
1228};
1229
1230/*
1231 * Currently we rely on the pipe array holding a power-of-2 number
1232 * of pages. Returns 0 on error.
1233 */
1234unsigned int round_pipe_size(unsigned long size)
1235{
1236	if (size > (1U << 31))
1237		return 0;
1238
1239	/* Minimum pipe size, as required by POSIX */
1240	if (size < PAGE_SIZE)
1241		return PAGE_SIZE;
1242
1243	return roundup_pow_of_two(size);
1244}
1245
1246/*
1247 * Resize the pipe ring to a number of slots.
1248 *
1249 * Note the pipe can be reduced in capacity, but only if the current
1250 * occupancy doesn't exceed nr_slots; if it does, EBUSY will be
1251 * returned instead.
1252 */
1253int pipe_resize_ring(struct pipe_inode_info *pipe, unsigned int nr_slots)
1254{
1255	struct pipe_buffer *bufs;
1256	unsigned int head, tail, mask, n;
1257
1258	bufs = kcalloc(nr_slots, sizeof(*bufs),
1259		       GFP_KERNEL_ACCOUNT | __GFP_NOWARN);
1260	if (unlikely(!bufs))
1261		return -ENOMEM;
1262
1263	spin_lock_irq(&pipe->rd_wait.lock);
1264	mask = pipe->ring_size - 1;
1265	head = pipe->head;
1266	tail = pipe->tail;
1267
1268	n = pipe_occupancy(head, tail);
1269	if (nr_slots < n) {
1270		spin_unlock_irq(&pipe->rd_wait.lock);
1271		kfree(bufs);
1272		return -EBUSY;
1273	}
1274
1275	/*
1276	 * The pipe array wraps around, so just start the new one at zero
1277	 * and adjust the indices.
1278	 */
1279	if (n > 0) {
1280		unsigned int h = head & mask;
1281		unsigned int t = tail & mask;
1282		if (h > t) {
1283			memcpy(bufs, pipe->bufs + t,
1284			       n * sizeof(struct pipe_buffer));
1285		} else {
1286			unsigned int tsize = pipe->ring_size - t;
1287			if (h > 0)
1288				memcpy(bufs + tsize, pipe->bufs,
1289				       h * sizeof(struct pipe_buffer));
1290			memcpy(bufs, pipe->bufs + t,
1291			       tsize * sizeof(struct pipe_buffer));
1292		}
1293	}
1294
1295	head = n;
1296	tail = 0;
1297
1298	kfree(pipe->bufs);
1299	pipe->bufs = bufs;
1300	pipe->ring_size = nr_slots;
1301	if (pipe->max_usage > nr_slots)
1302		pipe->max_usage = nr_slots;
1303	pipe->tail = tail;
1304	pipe->head = head;
1305
1306	spin_unlock_irq(&pipe->rd_wait.lock);
1307
1308	/* This might have made more room for writers */
1309	wake_up_interruptible(&pipe->wr_wait);
1310	return 0;
1311}
1312
1313/*
1314 * Allocate a new array of pipe buffers and copy the info over. Returns the
1315 * pipe size if successful, or return -ERROR on error.
1316 */
1317static long pipe_set_size(struct pipe_inode_info *pipe, unsigned long arg)
1318{
 
 
1319	unsigned long user_bufs;
1320	unsigned int nr_slots, size;
1321	long ret = 0;
1322
1323#ifdef CONFIG_WATCH_QUEUE
1324	if (pipe->watch_queue)
1325		return -EBUSY;
1326#endif
1327
1328	size = round_pipe_size(arg);
1329	nr_slots = size >> PAGE_SHIFT;
1330
1331	if (!nr_slots)
1332		return -EINVAL;
1333
1334	/*
1335	 * If trying to increase the pipe capacity, check that an
1336	 * unprivileged user is not trying to exceed various limits
1337	 * (soft limit check here, hard limit check just below).
1338	 * Decreasing the pipe capacity is always permitted, even
1339	 * if the user is currently over a limit.
1340	 */
1341	if (nr_slots > pipe->max_usage &&
1342			size > pipe_max_size && !capable(CAP_SYS_RESOURCE))
1343		return -EPERM;
1344
1345	user_bufs = account_pipe_buffers(pipe->user, pipe->nr_accounted, nr_slots);
1346
1347	if (nr_slots > pipe->max_usage &&
1348			(too_many_pipe_buffers_hard(user_bufs) ||
1349			 too_many_pipe_buffers_soft(user_bufs)) &&
1350			pipe_is_unprivileged_user()) {
1351		ret = -EPERM;
1352		goto out_revert_acct;
1353	}
1354
1355	ret = pipe_resize_ring(pipe, nr_slots);
1356	if (ret < 0)
 
 
 
 
 
 
 
 
 
 
 
 
 
1357		goto out_revert_acct;
 
1358
1359	pipe->max_usage = nr_slots;
1360	pipe->nr_accounted = nr_slots;
1361	return pipe->max_usage * PAGE_SIZE;
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1362
1363out_revert_acct:
1364	(void) account_pipe_buffers(pipe->user, nr_slots, pipe->nr_accounted);
1365	return ret;
1366}
1367
1368/*
1369 * Note that i_pipe and i_cdev share the same location, so checking ->i_pipe is
1370 * not enough to verify that this is a pipe.
 
1371 */
1372struct pipe_inode_info *get_pipe_info(struct file *file, bool for_splice)
1373{
1374	struct pipe_inode_info *pipe = file->private_data;
1375
1376	if (file->f_op != &pipefifo_fops || !pipe)
1377		return NULL;
1378#ifdef CONFIG_WATCH_QUEUE
1379	if (for_splice && pipe->watch_queue)
1380		return NULL;
1381#endif
1382	return pipe;
1383}
1384
1385long pipe_fcntl(struct file *file, unsigned int cmd, unsigned long arg)
1386{
1387	struct pipe_inode_info *pipe;
1388	long ret;
1389
1390	pipe = get_pipe_info(file, false);
1391	if (!pipe)
1392		return -EBADF;
1393
1394	__pipe_lock(pipe);
1395
1396	switch (cmd) {
1397	case F_SETPIPE_SZ:
1398		ret = pipe_set_size(pipe, arg);
1399		break;
1400	case F_GETPIPE_SZ:
1401		ret = pipe->max_usage * PAGE_SIZE;
1402		break;
1403	default:
1404		ret = -EINVAL;
1405		break;
1406	}
1407
1408	__pipe_unlock(pipe);
1409	return ret;
1410}
1411
1412static const struct super_operations pipefs_ops = {
1413	.destroy_inode = free_inode_nonrcu,
1414	.statfs = simple_statfs,
1415};
1416
1417/*
1418 * pipefs should _never_ be mounted by userland - too much of security hassle,
1419 * no real gain from having the whole whorehouse mounted. So we don't need
1420 * any operations on the root directory. However, we need a non-trivial
1421 * d_name - pipe: will go nicely and kill the special-casing in procfs.
1422 */
1423
1424static int pipefs_init_fs_context(struct fs_context *fc)
1425{
1426	struct pseudo_fs_context *ctx = init_pseudo(fc, PIPEFS_MAGIC);
1427	if (!ctx)
1428		return -ENOMEM;
1429	ctx->ops = &pipefs_ops;
1430	ctx->dops = &pipefs_dentry_operations;
1431	return 0;
1432}
1433
1434static struct file_system_type pipe_fs_type = {
1435	.name		= "pipefs",
1436	.init_fs_context = pipefs_init_fs_context,
1437	.kill_sb	= kill_anon_super,
1438};
1439
1440#ifdef CONFIG_SYSCTL
1441static int do_proc_dopipe_max_size_conv(unsigned long *lvalp,
1442					unsigned int *valp,
1443					int write, void *data)
1444{
1445	if (write) {
1446		unsigned int val;
1447
1448		val = round_pipe_size(*lvalp);
1449		if (val == 0)
1450			return -EINVAL;
1451
1452		*valp = val;
1453	} else {
1454		unsigned int val = *valp;
1455		*lvalp = (unsigned long) val;
1456	}
1457
1458	return 0;
1459}
1460
1461static int proc_dopipe_max_size(struct ctl_table *table, int write,
1462				void *buffer, size_t *lenp, loff_t *ppos)
1463{
1464	return do_proc_douintvec(table, write, buffer, lenp, ppos,
1465				 do_proc_dopipe_max_size_conv, NULL);
1466}
1467
1468static struct ctl_table fs_pipe_sysctls[] = {
1469	{
1470		.procname	= "pipe-max-size",
1471		.data		= &pipe_max_size,
1472		.maxlen		= sizeof(pipe_max_size),
1473		.mode		= 0644,
1474		.proc_handler	= proc_dopipe_max_size,
1475	},
1476	{
1477		.procname	= "pipe-user-pages-hard",
1478		.data		= &pipe_user_pages_hard,
1479		.maxlen		= sizeof(pipe_user_pages_hard),
1480		.mode		= 0644,
1481		.proc_handler	= proc_doulongvec_minmax,
1482	},
1483	{
1484		.procname	= "pipe-user-pages-soft",
1485		.data		= &pipe_user_pages_soft,
1486		.maxlen		= sizeof(pipe_user_pages_soft),
1487		.mode		= 0644,
1488		.proc_handler	= proc_doulongvec_minmax,
1489	},
1490	{ }
1491};
1492#endif
1493
1494static int __init init_pipe_fs(void)
1495{
1496	int err = register_filesystem(&pipe_fs_type);
1497
1498	if (!err) {
1499		pipe_mnt = kern_mount(&pipe_fs_type);
1500		if (IS_ERR(pipe_mnt)) {
1501			err = PTR_ERR(pipe_mnt);
1502			unregister_filesystem(&pipe_fs_type);
1503		}
1504	}
1505#ifdef CONFIG_SYSCTL
1506	register_sysctl_init("fs", fs_pipe_sysctls);
1507#endif
1508	return err;
1509}
1510
1511fs_initcall(init_pipe_fs);
v5.4
   1// SPDX-License-Identifier: GPL-2.0
   2/*
   3 *  linux/fs/pipe.c
   4 *
   5 *  Copyright (C) 1991, 1992, 1999  Linus Torvalds
   6 */
   7
   8#include <linux/mm.h>
   9#include <linux/file.h>
  10#include <linux/poll.h>
  11#include <linux/slab.h>
  12#include <linux/module.h>
  13#include <linux/init.h>
  14#include <linux/fs.h>
  15#include <linux/log2.h>
  16#include <linux/mount.h>
  17#include <linux/pseudo_fs.h>
  18#include <linux/magic.h>
  19#include <linux/pipe_fs_i.h>
  20#include <linux/uio.h>
  21#include <linux/highmem.h>
  22#include <linux/pagemap.h>
  23#include <linux/audit.h>
  24#include <linux/syscalls.h>
  25#include <linux/fcntl.h>
  26#include <linux/memcontrol.h>
 
 
  27
  28#include <linux/uaccess.h>
  29#include <asm/ioctls.h>
  30
  31#include "internal.h"
  32
  33/*
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
  34 * The max size that a non-root user is allowed to grow the pipe. Can
  35 * be set by root in /proc/sys/fs/pipe-max-size
  36 */
  37unsigned int pipe_max_size = 1048576;
  38
  39/* Maximum allocatable pages per user. Hard limit is unset by default, soft
  40 * matches default values.
  41 */
  42unsigned long pipe_user_pages_hard;
  43unsigned long pipe_user_pages_soft = PIPE_DEF_BUFFERS * INR_OPEN_CUR;
  44
  45/*
  46 * We use a start+len construction, which provides full use of the 
  47 * allocated memory.
  48 * -- Florian Coosmann (FGC)
  49 * 
 
 
  50 * Reads with count = 0 should always return 0.
  51 * -- Julian Bradfield 1999-06-07.
  52 *
  53 * FIFOs and Pipes now generate SIGIO for both readers and writers.
  54 * -- Jeremy Elson <jelson@circlemud.org> 2001-08-16
  55 *
  56 * pipe_read & write cleanup
  57 * -- Manfred Spraul <manfred@colorfullife.com> 2002-05-09
  58 */
  59
  60static void pipe_lock_nested(struct pipe_inode_info *pipe, int subclass)
  61{
  62	if (pipe->files)
  63		mutex_lock_nested(&pipe->mutex, subclass);
  64}
  65
  66void pipe_lock(struct pipe_inode_info *pipe)
  67{
  68	/*
  69	 * pipe_lock() nests non-pipe inode locks (for writing to a file)
  70	 */
  71	pipe_lock_nested(pipe, I_MUTEX_PARENT);
  72}
  73EXPORT_SYMBOL(pipe_lock);
  74
  75void pipe_unlock(struct pipe_inode_info *pipe)
  76{
  77	if (pipe->files)
  78		mutex_unlock(&pipe->mutex);
  79}
  80EXPORT_SYMBOL(pipe_unlock);
  81
  82static inline void __pipe_lock(struct pipe_inode_info *pipe)
  83{
  84	mutex_lock_nested(&pipe->mutex, I_MUTEX_PARENT);
  85}
  86
  87static inline void __pipe_unlock(struct pipe_inode_info *pipe)
  88{
  89	mutex_unlock(&pipe->mutex);
  90}
  91
  92void pipe_double_lock(struct pipe_inode_info *pipe1,
  93		      struct pipe_inode_info *pipe2)
  94{
  95	BUG_ON(pipe1 == pipe2);
  96
  97	if (pipe1 < pipe2) {
  98		pipe_lock_nested(pipe1, I_MUTEX_PARENT);
  99		pipe_lock_nested(pipe2, I_MUTEX_CHILD);
 100	} else {
 101		pipe_lock_nested(pipe2, I_MUTEX_PARENT);
 102		pipe_lock_nested(pipe1, I_MUTEX_CHILD);
 103	}
 104}
 105
 106/* Drop the inode semaphore and wait for a pipe event, atomically */
 107void pipe_wait(struct pipe_inode_info *pipe)
 108{
 109	DEFINE_WAIT(wait);
 110
 111	/*
 112	 * Pipes are system-local resources, so sleeping on them
 113	 * is considered a noninteractive wait:
 114	 */
 115	prepare_to_wait(&pipe->wait, &wait, TASK_INTERRUPTIBLE);
 116	pipe_unlock(pipe);
 117	schedule();
 118	finish_wait(&pipe->wait, &wait);
 119	pipe_lock(pipe);
 120}
 121
 122static void anon_pipe_buf_release(struct pipe_inode_info *pipe,
 123				  struct pipe_buffer *buf)
 124{
 125	struct page *page = buf->page;
 126
 127	/*
 128	 * If nobody else uses this page, and we don't already have a
 129	 * temporary page, let's keep track of it as a one-deep
 130	 * allocation cache. (Otherwise just release our reference to it)
 131	 */
 132	if (page_count(page) == 1 && !pipe->tmp_page)
 133		pipe->tmp_page = page;
 134	else
 135		put_page(page);
 136}
 137
 138static int anon_pipe_buf_steal(struct pipe_inode_info *pipe,
 139			       struct pipe_buffer *buf)
 140{
 141	struct page *page = buf->page;
 142
 143	if (page_count(page) == 1) {
 144		memcg_kmem_uncharge(page, 0);
 145		__SetPageLocked(page);
 146		return 0;
 147	}
 148	return 1;
 149}
 150
 151/**
 152 * generic_pipe_buf_steal - attempt to take ownership of a &pipe_buffer
 153 * @pipe:	the pipe that the buffer belongs to
 154 * @buf:	the buffer to attempt to steal
 155 *
 156 * Description:
 157 *	This function attempts to steal the &struct page attached to
 158 *	@buf. If successful, this function returns 0 and returns with
 159 *	the page locked. The caller may then reuse the page for whatever
 160 *	he wishes; the typical use is insertion into a different file
 161 *	page cache.
 162 */
 163int generic_pipe_buf_steal(struct pipe_inode_info *pipe,
 164			   struct pipe_buffer *buf)
 165{
 166	struct page *page = buf->page;
 167
 168	/*
 169	 * A reference of one is golden, that means that the owner of this
 170	 * page is the only one holding a reference to it. lock the page
 171	 * and return OK.
 172	 */
 173	if (page_count(page) == 1) {
 174		lock_page(page);
 175		return 0;
 176	}
 177
 178	return 1;
 179}
 180EXPORT_SYMBOL(generic_pipe_buf_steal);
 181
 182/**
 183 * generic_pipe_buf_get - get a reference to a &struct pipe_buffer
 184 * @pipe:	the pipe that the buffer belongs to
 185 * @buf:	the buffer to get a reference to
 186 *
 187 * Description:
 188 *	This function grabs an extra reference to @buf. It's used in
 189 *	in the tee() system call, when we duplicate the buffers in one
 190 *	pipe into another.
 191 */
 192bool generic_pipe_buf_get(struct pipe_inode_info *pipe, struct pipe_buffer *buf)
 193{
 194	return try_get_page(buf->page);
 195}
 196EXPORT_SYMBOL(generic_pipe_buf_get);
 197
 198/**
 199 * generic_pipe_buf_confirm - verify contents of the pipe buffer
 200 * @info:	the pipe that the buffer belongs to
 201 * @buf:	the buffer to confirm
 202 *
 203 * Description:
 204 *	This function does nothing, because the generic pipe code uses
 205 *	pages that are always good when inserted into the pipe.
 206 */
 207int generic_pipe_buf_confirm(struct pipe_inode_info *info,
 208			     struct pipe_buffer *buf)
 209{
 210	return 0;
 211}
 212EXPORT_SYMBOL(generic_pipe_buf_confirm);
 213
 214/**
 215 * generic_pipe_buf_release - put a reference to a &struct pipe_buffer
 216 * @pipe:	the pipe that the buffer belongs to
 217 * @buf:	the buffer to put a reference to
 218 *
 219 * Description:
 220 *	This function releases a reference to @buf.
 221 */
 222void generic_pipe_buf_release(struct pipe_inode_info *pipe,
 223			      struct pipe_buffer *buf)
 224{
 225	put_page(buf->page);
 226}
 227EXPORT_SYMBOL(generic_pipe_buf_release);
 228
 229/* New data written to a pipe may be appended to a buffer with this type. */
 230static const struct pipe_buf_operations anon_pipe_buf_ops = {
 231	.confirm = generic_pipe_buf_confirm,
 232	.release = anon_pipe_buf_release,
 233	.steal = anon_pipe_buf_steal,
 234	.get = generic_pipe_buf_get,
 235};
 236
 237static const struct pipe_buf_operations anon_pipe_buf_nomerge_ops = {
 238	.confirm = generic_pipe_buf_confirm,
 239	.release = anon_pipe_buf_release,
 240	.steal = anon_pipe_buf_steal,
 241	.get = generic_pipe_buf_get,
 242};
 243
 244static const struct pipe_buf_operations packet_pipe_buf_ops = {
 245	.confirm = generic_pipe_buf_confirm,
 246	.release = anon_pipe_buf_release,
 247	.steal = anon_pipe_buf_steal,
 248	.get = generic_pipe_buf_get,
 249};
 250
 251/**
 252 * pipe_buf_mark_unmergeable - mark a &struct pipe_buffer as unmergeable
 253 * @buf:	the buffer to mark
 254 *
 255 * Description:
 256 *	This function ensures that no future writes will be merged into the
 257 *	given &struct pipe_buffer. This is necessary when multiple pipe buffers
 258 *	share the same backing page.
 259 */
 260void pipe_buf_mark_unmergeable(struct pipe_buffer *buf)
 261{
 262	if (buf->ops == &anon_pipe_buf_ops)
 263		buf->ops = &anon_pipe_buf_nomerge_ops;
 264}
 265
 266static bool pipe_buf_can_merge(struct pipe_buffer *buf)
 267{
 268	return buf->ops == &anon_pipe_buf_ops;
 269}
 270
 271static ssize_t
 272pipe_read(struct kiocb *iocb, struct iov_iter *to)
 273{
 274	size_t total_len = iov_iter_count(to);
 275	struct file *filp = iocb->ki_filp;
 276	struct pipe_inode_info *pipe = filp->private_data;
 277	int do_wakeup;
 278	ssize_t ret;
 279
 280	/* Null read succeeds. */
 281	if (unlikely(total_len == 0))
 282		return 0;
 283
 284	do_wakeup = 0;
 285	ret = 0;
 286	__pipe_lock(pipe);
 
 
 
 
 
 
 
 
 
 
 287	for (;;) {
 288		int bufs = pipe->nrbufs;
 289		if (bufs) {
 290			int curbuf = pipe->curbuf;
 291			struct pipe_buffer *buf = pipe->bufs + curbuf;
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 292			size_t chars = buf->len;
 293			size_t written;
 294			int error;
 295
 296			if (chars > total_len)
 
 
 
 
 
 297				chars = total_len;
 
 298
 299			error = pipe_buf_confirm(pipe, buf);
 300			if (error) {
 301				if (!ret)
 302					ret = error;
 303				break;
 304			}
 305
 306			written = copy_page_to_iter(buf->page, buf->offset, chars, to);
 307			if (unlikely(written < chars)) {
 308				if (!ret)
 309					ret = -EFAULT;
 310				break;
 311			}
 312			ret += chars;
 313			buf->offset += chars;
 314			buf->len -= chars;
 315
 316			/* Was it a packet buffer? Clean up and exit */
 317			if (buf->flags & PIPE_BUF_FLAG_PACKET) {
 318				total_len = chars;
 319				buf->len = 0;
 320			}
 321
 322			if (!buf->len) {
 323				pipe_buf_release(pipe, buf);
 324				curbuf = (curbuf + 1) & (pipe->buffers - 1);
 325				pipe->curbuf = curbuf;
 326				pipe->nrbufs = --bufs;
 327				do_wakeup = 1;
 
 
 
 
 328			}
 329			total_len -= chars;
 330			if (!total_len)
 331				break;	/* common path: read succeeded */
 
 
 332		}
 333		if (bufs)	/* More to do? */
 334			continue;
 335		if (!pipe->writers)
 336			break;
 337		if (!pipe->waiting_writers) {
 338			/* syscall merging: Usually we must not sleep
 339			 * if O_NONBLOCK is set, or if we got some data.
 340			 * But if a writer sleeps in kernel space, then
 341			 * we can wait for that data without violating POSIX.
 342			 */
 343			if (ret)
 344				break;
 345			if (filp->f_flags & O_NONBLOCK) {
 346				ret = -EAGAIN;
 347				break;
 348			}
 349		}
 350		if (signal_pending(current)) {
 351			if (!ret)
 352				ret = -ERESTARTSYS;
 353			break;
 354		}
 355		if (do_wakeup) {
 356			wake_up_interruptible_sync_poll(&pipe->wait, EPOLLOUT | EPOLLWRNORM);
 357 			kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
 358		}
 359		pipe_wait(pipe);
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 360	}
 
 
 361	__pipe_unlock(pipe);
 362
 363	/* Signal writers asynchronously that there is more room. */
 364	if (do_wakeup) {
 365		wake_up_interruptible_sync_poll(&pipe->wait, EPOLLOUT | EPOLLWRNORM);
 366		kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
 367	}
 368	if (ret > 0)
 369		file_accessed(filp);
 370	return ret;
 371}
 372
 373static inline int is_packetized(struct file *file)
 374{
 375	return (file->f_flags & O_DIRECT) != 0;
 376}
 377
 
 
 
 
 
 
 
 
 
 
 
 378static ssize_t
 379pipe_write(struct kiocb *iocb, struct iov_iter *from)
 380{
 381	struct file *filp = iocb->ki_filp;
 382	struct pipe_inode_info *pipe = filp->private_data;
 
 383	ssize_t ret = 0;
 384	int do_wakeup = 0;
 385	size_t total_len = iov_iter_count(from);
 386	ssize_t chars;
 
 
 387
 388	/* Null write succeeds. */
 389	if (unlikely(total_len == 0))
 390		return 0;
 391
 392	__pipe_lock(pipe);
 393
 394	if (!pipe->readers) {
 395		send_sig(SIGPIPE, current, 0);
 396		ret = -EPIPE;
 397		goto out;
 398	}
 399
 400	/* We try to merge small writes */
 401	chars = total_len & (PAGE_SIZE-1); /* size of the last buffer */
 402	if (pipe->nrbufs && chars != 0) {
 403		int lastbuf = (pipe->curbuf + pipe->nrbufs - 1) &
 404							(pipe->buffers - 1);
 405		struct pipe_buffer *buf = pipe->bufs + lastbuf;
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 406		int offset = buf->offset + buf->len;
 407
 408		if (pipe_buf_can_merge(buf) && offset + chars <= PAGE_SIZE) {
 
 409			ret = pipe_buf_confirm(pipe, buf);
 410			if (ret)
 411				goto out;
 412
 413			ret = copy_page_from_iter(buf->page, offset, chars, from);
 414			if (unlikely(ret < chars)) {
 415				ret = -EFAULT;
 416				goto out;
 417			}
 418			do_wakeup = 1;
 419			buf->len += ret;
 420			if (!iov_iter_count(from))
 421				goto out;
 422		}
 423	}
 424
 425	for (;;) {
 426		int bufs;
 427
 428		if (!pipe->readers) {
 429			send_sig(SIGPIPE, current, 0);
 430			if (!ret)
 431				ret = -EPIPE;
 432			break;
 433		}
 434		bufs = pipe->nrbufs;
 435		if (bufs < pipe->buffers) {
 436			int newbuf = (pipe->curbuf + bufs) & (pipe->buffers-1);
 437			struct pipe_buffer *buf = pipe->bufs + newbuf;
 
 438			struct page *page = pipe->tmp_page;
 439			int copied;
 440
 441			if (!page) {
 442				page = alloc_page(GFP_HIGHUSER | __GFP_ACCOUNT);
 443				if (unlikely(!page)) {
 444					ret = ret ? : -ENOMEM;
 445					break;
 446				}
 447				pipe->tmp_page = page;
 448			}
 449			/* Always wake up, even if the copy fails. Otherwise
 450			 * we lock up (O_NONBLOCK-)readers that sleep due to
 451			 * syscall merging.
 452			 * FIXME! Is this really true?
 
 453			 */
 454			do_wakeup = 1;
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 455			copied = copy_page_from_iter(page, 0, PAGE_SIZE, from);
 456			if (unlikely(copied < PAGE_SIZE && iov_iter_count(from))) {
 457				if (!ret)
 458					ret = -EFAULT;
 459				break;
 460			}
 461			ret += copied;
 462
 463			/* Insert it into the buffer array */
 464			buf->page = page;
 465			buf->ops = &anon_pipe_buf_ops;
 466			buf->offset = 0;
 467			buf->len = copied;
 468			buf->flags = 0;
 469			if (is_packetized(filp)) {
 470				buf->ops = &packet_pipe_buf_ops;
 471				buf->flags = PIPE_BUF_FLAG_PACKET;
 472			}
 473			pipe->nrbufs = ++bufs;
 474			pipe->tmp_page = NULL;
 475
 476			if (!iov_iter_count(from))
 477				break;
 478		}
 479		if (bufs < pipe->buffers)
 
 480			continue;
 
 
 481		if (filp->f_flags & O_NONBLOCK) {
 482			if (!ret)
 483				ret = -EAGAIN;
 484			break;
 485		}
 486		if (signal_pending(current)) {
 487			if (!ret)
 488				ret = -ERESTARTSYS;
 489			break;
 490		}
 491		if (do_wakeup) {
 492			wake_up_interruptible_sync_poll(&pipe->wait, EPOLLIN | EPOLLRDNORM);
 493			kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
 494			do_wakeup = 0;
 495		}
 496		pipe->waiting_writers++;
 497		pipe_wait(pipe);
 498		pipe->waiting_writers--;
 
 
 
 
 
 
 
 499	}
 500out:
 
 
 501	__pipe_unlock(pipe);
 502	if (do_wakeup) {
 503		wake_up_interruptible_sync_poll(&pipe->wait, EPOLLIN | EPOLLRDNORM);
 504		kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
 505	}
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 506	if (ret > 0 && sb_start_write_trylock(file_inode(filp)->i_sb)) {
 507		int err = file_update_time(filp);
 508		if (err)
 509			ret = err;
 510		sb_end_write(file_inode(filp)->i_sb);
 511	}
 512	return ret;
 513}
 514
 515static long pipe_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
 516{
 517	struct pipe_inode_info *pipe = filp->private_data;
 518	int count, buf, nrbufs;
 519
 520	switch (cmd) {
 521		case FIONREAD:
 522			__pipe_lock(pipe);
 523			count = 0;
 524			buf = pipe->curbuf;
 525			nrbufs = pipe->nrbufs;
 526			while (--nrbufs >= 0) {
 527				count += pipe->bufs[buf].len;
 528				buf = (buf+1) & (pipe->buffers - 1);
 529			}
 530			__pipe_unlock(pipe);
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 531
 532			return put_user(count, (int __user *)arg);
 533		default:
 534			return -ENOIOCTLCMD;
 535	}
 536}
 537
 538/* No kernel lock held - fine */
 539static __poll_t
 540pipe_poll(struct file *filp, poll_table *wait)
 541{
 542	__poll_t mask;
 543	struct pipe_inode_info *pipe = filp->private_data;
 544	int nrbufs;
 545
 546	poll_wait(filp, &pipe->wait, wait);
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 547
 548	/* Reading only -- no need for acquiring the semaphore.  */
 549	nrbufs = pipe->nrbufs;
 550	mask = 0;
 551	if (filp->f_mode & FMODE_READ) {
 552		mask = (nrbufs > 0) ? EPOLLIN | EPOLLRDNORM : 0;
 
 553		if (!pipe->writers && filp->f_version != pipe->w_counter)
 554			mask |= EPOLLHUP;
 555	}
 556
 557	if (filp->f_mode & FMODE_WRITE) {
 558		mask |= (nrbufs < pipe->buffers) ? EPOLLOUT | EPOLLWRNORM : 0;
 
 559		/*
 560		 * Most Unices do not set EPOLLERR for FIFOs but on Linux they
 561		 * behave exactly like pipes for poll().
 562		 */
 563		if (!pipe->readers)
 564			mask |= EPOLLERR;
 565	}
 566
 567	return mask;
 568}
 569
 570static void put_pipe_info(struct inode *inode, struct pipe_inode_info *pipe)
 571{
 572	int kill = 0;
 573
 574	spin_lock(&inode->i_lock);
 575	if (!--pipe->files) {
 576		inode->i_pipe = NULL;
 577		kill = 1;
 578	}
 579	spin_unlock(&inode->i_lock);
 580
 581	if (kill)
 582		free_pipe_info(pipe);
 583}
 584
 585static int
 586pipe_release(struct inode *inode, struct file *file)
 587{
 588	struct pipe_inode_info *pipe = file->private_data;
 589
 590	__pipe_lock(pipe);
 591	if (file->f_mode & FMODE_READ)
 592		pipe->readers--;
 593	if (file->f_mode & FMODE_WRITE)
 594		pipe->writers--;
 595
 596	if (pipe->readers || pipe->writers) {
 597		wake_up_interruptible_sync_poll(&pipe->wait, EPOLLIN | EPOLLOUT | EPOLLRDNORM | EPOLLWRNORM | EPOLLERR | EPOLLHUP);
 
 
 598		kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
 599		kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
 600	}
 601	__pipe_unlock(pipe);
 602
 603	put_pipe_info(inode, pipe);
 604	return 0;
 605}
 606
 607static int
 608pipe_fasync(int fd, struct file *filp, int on)
 609{
 610	struct pipe_inode_info *pipe = filp->private_data;
 611	int retval = 0;
 612
 613	__pipe_lock(pipe);
 614	if (filp->f_mode & FMODE_READ)
 615		retval = fasync_helper(fd, filp, on, &pipe->fasync_readers);
 616	if ((filp->f_mode & FMODE_WRITE) && retval >= 0) {
 617		retval = fasync_helper(fd, filp, on, &pipe->fasync_writers);
 618		if (retval < 0 && (filp->f_mode & FMODE_READ))
 619			/* this can happen only if on == T */
 620			fasync_helper(-1, filp, 0, &pipe->fasync_readers);
 621	}
 622	__pipe_unlock(pipe);
 623	return retval;
 624}
 625
 626static unsigned long account_pipe_buffers(struct user_struct *user,
 627                                 unsigned long old, unsigned long new)
 628{
 629	return atomic_long_add_return(new - old, &user->pipe_bufs);
 630}
 631
 632static bool too_many_pipe_buffers_soft(unsigned long user_bufs)
 633{
 634	unsigned long soft_limit = READ_ONCE(pipe_user_pages_soft);
 635
 636	return soft_limit && user_bufs > soft_limit;
 637}
 638
 639static bool too_many_pipe_buffers_hard(unsigned long user_bufs)
 640{
 641	unsigned long hard_limit = READ_ONCE(pipe_user_pages_hard);
 642
 643	return hard_limit && user_bufs > hard_limit;
 644}
 645
 646static bool is_unprivileged_user(void)
 647{
 648	return !capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN);
 649}
 650
 651struct pipe_inode_info *alloc_pipe_info(void)
 652{
 653	struct pipe_inode_info *pipe;
 654	unsigned long pipe_bufs = PIPE_DEF_BUFFERS;
 655	struct user_struct *user = get_current_user();
 656	unsigned long user_bufs;
 657	unsigned int max_size = READ_ONCE(pipe_max_size);
 658
 659	pipe = kzalloc(sizeof(struct pipe_inode_info), GFP_KERNEL_ACCOUNT);
 660	if (pipe == NULL)
 661		goto out_free_uid;
 662
 663	if (pipe_bufs * PAGE_SIZE > max_size && !capable(CAP_SYS_RESOURCE))
 664		pipe_bufs = max_size >> PAGE_SHIFT;
 665
 666	user_bufs = account_pipe_buffers(user, 0, pipe_bufs);
 667
 668	if (too_many_pipe_buffers_soft(user_bufs) && is_unprivileged_user()) {
 669		user_bufs = account_pipe_buffers(user, pipe_bufs, 1);
 670		pipe_bufs = 1;
 671	}
 672
 673	if (too_many_pipe_buffers_hard(user_bufs) && is_unprivileged_user())
 674		goto out_revert_acct;
 675
 676	pipe->bufs = kcalloc(pipe_bufs, sizeof(struct pipe_buffer),
 677			     GFP_KERNEL_ACCOUNT);
 678
 679	if (pipe->bufs) {
 680		init_waitqueue_head(&pipe->wait);
 
 681		pipe->r_counter = pipe->w_counter = 1;
 682		pipe->buffers = pipe_bufs;
 
 
 683		pipe->user = user;
 684		mutex_init(&pipe->mutex);
 685		return pipe;
 686	}
 687
 688out_revert_acct:
 689	(void) account_pipe_buffers(user, pipe_bufs, 0);
 690	kfree(pipe);
 691out_free_uid:
 692	free_uid(user);
 693	return NULL;
 694}
 695
 696void free_pipe_info(struct pipe_inode_info *pipe)
 697{
 698	int i;
 
 
 
 
 
 699
 700	(void) account_pipe_buffers(pipe->user, pipe->buffers, 0);
 701	free_uid(pipe->user);
 702	for (i = 0; i < pipe->buffers; i++) {
 703		struct pipe_buffer *buf = pipe->bufs + i;
 704		if (buf->ops)
 705			pipe_buf_release(pipe, buf);
 706	}
 
 
 
 
 707	if (pipe->tmp_page)
 708		__free_page(pipe->tmp_page);
 709	kfree(pipe->bufs);
 710	kfree(pipe);
 711}
 712
 713static struct vfsmount *pipe_mnt __read_mostly;
 714
 715/*
 716 * pipefs_dname() is called from d_path().
 717 */
 718static char *pipefs_dname(struct dentry *dentry, char *buffer, int buflen)
 719{
 720	return dynamic_dname(dentry, buffer, buflen, "pipe:[%lu]",
 721				d_inode(dentry)->i_ino);
 722}
 723
 724static const struct dentry_operations pipefs_dentry_operations = {
 725	.d_dname	= pipefs_dname,
 726};
 727
 728static struct inode * get_pipe_inode(void)
 729{
 730	struct inode *inode = new_inode_pseudo(pipe_mnt->mnt_sb);
 731	struct pipe_inode_info *pipe;
 732
 733	if (!inode)
 734		goto fail_inode;
 735
 736	inode->i_ino = get_next_ino();
 737
 738	pipe = alloc_pipe_info();
 739	if (!pipe)
 740		goto fail_iput;
 741
 742	inode->i_pipe = pipe;
 743	pipe->files = 2;
 744	pipe->readers = pipe->writers = 1;
 745	inode->i_fop = &pipefifo_fops;
 746
 747	/*
 748	 * Mark the inode dirty from the very beginning,
 749	 * that way it will never be moved to the dirty
 750	 * list because "mark_inode_dirty()" will think
 751	 * that it already _is_ on the dirty list.
 752	 */
 753	inode->i_state = I_DIRTY;
 754	inode->i_mode = S_IFIFO | S_IRUSR | S_IWUSR;
 755	inode->i_uid = current_fsuid();
 756	inode->i_gid = current_fsgid();
 757	inode->i_atime = inode->i_mtime = inode->i_ctime = current_time(inode);
 758
 759	return inode;
 760
 761fail_iput:
 762	iput(inode);
 763
 764fail_inode:
 765	return NULL;
 766}
 767
 768int create_pipe_files(struct file **res, int flags)
 769{
 770	struct inode *inode = get_pipe_inode();
 771	struct file *f;
 
 772
 773	if (!inode)
 774		return -ENFILE;
 775
 
 
 
 
 
 
 
 
 
 776	f = alloc_file_pseudo(inode, pipe_mnt, "",
 777				O_WRONLY | (flags & (O_NONBLOCK | O_DIRECT)),
 778				&pipefifo_fops);
 779	if (IS_ERR(f)) {
 780		free_pipe_info(inode->i_pipe);
 781		iput(inode);
 782		return PTR_ERR(f);
 783	}
 784
 785	f->private_data = inode->i_pipe;
 786
 787	res[0] = alloc_file_clone(f, O_RDONLY | (flags & O_NONBLOCK),
 788				  &pipefifo_fops);
 789	if (IS_ERR(res[0])) {
 790		put_pipe_info(inode, inode->i_pipe);
 791		fput(f);
 792		return PTR_ERR(res[0]);
 793	}
 794	res[0]->private_data = inode->i_pipe;
 795	res[1] = f;
 
 
 796	return 0;
 797}
 798
 799static int __do_pipe_flags(int *fd, struct file **files, int flags)
 800{
 801	int error;
 802	int fdw, fdr;
 803
 804	if (flags & ~(O_CLOEXEC | O_NONBLOCK | O_DIRECT))
 805		return -EINVAL;
 806
 807	error = create_pipe_files(files, flags);
 808	if (error)
 809		return error;
 810
 811	error = get_unused_fd_flags(flags);
 812	if (error < 0)
 813		goto err_read_pipe;
 814	fdr = error;
 815
 816	error = get_unused_fd_flags(flags);
 817	if (error < 0)
 818		goto err_fdr;
 819	fdw = error;
 820
 821	audit_fd_pair(fdr, fdw);
 822	fd[0] = fdr;
 823	fd[1] = fdw;
 824	return 0;
 825
 826 err_fdr:
 827	put_unused_fd(fdr);
 828 err_read_pipe:
 829	fput(files[0]);
 830	fput(files[1]);
 831	return error;
 832}
 833
 834int do_pipe_flags(int *fd, int flags)
 835{
 836	struct file *files[2];
 837	int error = __do_pipe_flags(fd, files, flags);
 838	if (!error) {
 839		fd_install(fd[0], files[0]);
 840		fd_install(fd[1], files[1]);
 841	}
 842	return error;
 843}
 844
 845/*
 846 * sys_pipe() is the normal C calling standard for creating
 847 * a pipe. It's not the way Unix traditionally does this, though.
 848 */
 849static int do_pipe2(int __user *fildes, int flags)
 850{
 851	struct file *files[2];
 852	int fd[2];
 853	int error;
 854
 855	error = __do_pipe_flags(fd, files, flags);
 856	if (!error) {
 857		if (unlikely(copy_to_user(fildes, fd, sizeof(fd)))) {
 858			fput(files[0]);
 859			fput(files[1]);
 860			put_unused_fd(fd[0]);
 861			put_unused_fd(fd[1]);
 862			error = -EFAULT;
 863		} else {
 864			fd_install(fd[0], files[0]);
 865			fd_install(fd[1], files[1]);
 866		}
 867	}
 868	return error;
 869}
 870
 871SYSCALL_DEFINE2(pipe2, int __user *, fildes, int, flags)
 872{
 873	return do_pipe2(fildes, flags);
 874}
 875
 876SYSCALL_DEFINE1(pipe, int __user *, fildes)
 877{
 878	return do_pipe2(fildes, 0);
 879}
 880
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 881static int wait_for_partner(struct pipe_inode_info *pipe, unsigned int *cnt)
 882{
 883	int cur = *cnt;	
 
 884
 885	while (cur == *cnt) {
 886		pipe_wait(pipe);
 
 
 
 
 887		if (signal_pending(current))
 888			break;
 889	}
 890	return cur == *cnt ? -ERESTARTSYS : 0;
 891}
 892
 893static void wake_up_partner(struct pipe_inode_info *pipe)
 894{
 895	wake_up_interruptible(&pipe->wait);
 896}
 897
 898static int fifo_open(struct inode *inode, struct file *filp)
 899{
 900	struct pipe_inode_info *pipe;
 901	bool is_pipe = inode->i_sb->s_magic == PIPEFS_MAGIC;
 902	int ret;
 903
 904	filp->f_version = 0;
 905
 906	spin_lock(&inode->i_lock);
 907	if (inode->i_pipe) {
 908		pipe = inode->i_pipe;
 909		pipe->files++;
 910		spin_unlock(&inode->i_lock);
 911	} else {
 912		spin_unlock(&inode->i_lock);
 913		pipe = alloc_pipe_info();
 914		if (!pipe)
 915			return -ENOMEM;
 916		pipe->files = 1;
 917		spin_lock(&inode->i_lock);
 918		if (unlikely(inode->i_pipe)) {
 919			inode->i_pipe->files++;
 920			spin_unlock(&inode->i_lock);
 921			free_pipe_info(pipe);
 922			pipe = inode->i_pipe;
 923		} else {
 924			inode->i_pipe = pipe;
 925			spin_unlock(&inode->i_lock);
 926		}
 927	}
 928	filp->private_data = pipe;
 929	/* OK, we have a pipe and it's pinned down */
 930
 931	__pipe_lock(pipe);
 932
 933	/* We can only do regular read/write on fifos */
 934	filp->f_mode &= (FMODE_READ | FMODE_WRITE);
 935
 936	switch (filp->f_mode) {
 937	case FMODE_READ:
 938	/*
 939	 *  O_RDONLY
 940	 *  POSIX.1 says that O_NONBLOCK means return with the FIFO
 941	 *  opened, even when there is no process writing the FIFO.
 942	 */
 943		pipe->r_counter++;
 944		if (pipe->readers++ == 0)
 945			wake_up_partner(pipe);
 946
 947		if (!is_pipe && !pipe->writers) {
 948			if ((filp->f_flags & O_NONBLOCK)) {
 949				/* suppress EPOLLHUP until we have
 950				 * seen a writer */
 951				filp->f_version = pipe->w_counter;
 952			} else {
 953				if (wait_for_partner(pipe, &pipe->w_counter))
 954					goto err_rd;
 955			}
 956		}
 957		break;
 958	
 959	case FMODE_WRITE:
 960	/*
 961	 *  O_WRONLY
 962	 *  POSIX.1 says that O_NONBLOCK means return -1 with
 963	 *  errno=ENXIO when there is no process reading the FIFO.
 964	 */
 965		ret = -ENXIO;
 966		if (!is_pipe && (filp->f_flags & O_NONBLOCK) && !pipe->readers)
 967			goto err;
 968
 969		pipe->w_counter++;
 970		if (!pipe->writers++)
 971			wake_up_partner(pipe);
 972
 973		if (!is_pipe && !pipe->readers) {
 974			if (wait_for_partner(pipe, &pipe->r_counter))
 975				goto err_wr;
 976		}
 977		break;
 978	
 979	case FMODE_READ | FMODE_WRITE:
 980	/*
 981	 *  O_RDWR
 982	 *  POSIX.1 leaves this case "undefined" when O_NONBLOCK is set.
 983	 *  This implementation will NEVER block on a O_RDWR open, since
 984	 *  the process can at least talk to itself.
 985	 */
 986
 987		pipe->readers++;
 988		pipe->writers++;
 989		pipe->r_counter++;
 990		pipe->w_counter++;
 991		if (pipe->readers == 1 || pipe->writers == 1)
 992			wake_up_partner(pipe);
 993		break;
 994
 995	default:
 996		ret = -EINVAL;
 997		goto err;
 998	}
 999
1000	/* Ok! */
1001	__pipe_unlock(pipe);
1002	return 0;
1003
1004err_rd:
1005	if (!--pipe->readers)
1006		wake_up_interruptible(&pipe->wait);
1007	ret = -ERESTARTSYS;
1008	goto err;
1009
1010err_wr:
1011	if (!--pipe->writers)
1012		wake_up_interruptible(&pipe->wait);
1013	ret = -ERESTARTSYS;
1014	goto err;
1015
1016err:
1017	__pipe_unlock(pipe);
1018
1019	put_pipe_info(inode, pipe);
1020	return ret;
1021}
1022
1023const struct file_operations pipefifo_fops = {
1024	.open		= fifo_open,
1025	.llseek		= no_llseek,
1026	.read_iter	= pipe_read,
1027	.write_iter	= pipe_write,
1028	.poll		= pipe_poll,
1029	.unlocked_ioctl	= pipe_ioctl,
1030	.release	= pipe_release,
1031	.fasync		= pipe_fasync,
 
1032};
1033
1034/*
1035 * Currently we rely on the pipe array holding a power-of-2 number
1036 * of pages. Returns 0 on error.
1037 */
1038unsigned int round_pipe_size(unsigned long size)
1039{
1040	if (size > (1U << 31))
1041		return 0;
1042
1043	/* Minimum pipe size, as required by POSIX */
1044	if (size < PAGE_SIZE)
1045		return PAGE_SIZE;
1046
1047	return roundup_pow_of_two(size);
1048}
1049
1050/*
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1051 * Allocate a new array of pipe buffers and copy the info over. Returns the
1052 * pipe size if successful, or return -ERROR on error.
1053 */
1054static long pipe_set_size(struct pipe_inode_info *pipe, unsigned long arg)
1055{
1056	struct pipe_buffer *bufs;
1057	unsigned int size, nr_pages;
1058	unsigned long user_bufs;
 
1059	long ret = 0;
1060
 
 
 
 
 
1061	size = round_pipe_size(arg);
1062	nr_pages = size >> PAGE_SHIFT;
1063
1064	if (!nr_pages)
1065		return -EINVAL;
1066
1067	/*
1068	 * If trying to increase the pipe capacity, check that an
1069	 * unprivileged user is not trying to exceed various limits
1070	 * (soft limit check here, hard limit check just below).
1071	 * Decreasing the pipe capacity is always permitted, even
1072	 * if the user is currently over a limit.
1073	 */
1074	if (nr_pages > pipe->buffers &&
1075			size > pipe_max_size && !capable(CAP_SYS_RESOURCE))
1076		return -EPERM;
1077
1078	user_bufs = account_pipe_buffers(pipe->user, pipe->buffers, nr_pages);
1079
1080	if (nr_pages > pipe->buffers &&
1081			(too_many_pipe_buffers_hard(user_bufs) ||
1082			 too_many_pipe_buffers_soft(user_bufs)) &&
1083			is_unprivileged_user()) {
1084		ret = -EPERM;
1085		goto out_revert_acct;
1086	}
1087
1088	/*
1089	 * We can shrink the pipe, if arg >= pipe->nrbufs. Since we don't
1090	 * expect a lot of shrink+grow operations, just free and allocate
1091	 * again like we would do for growing. If the pipe currently
1092	 * contains more buffers than arg, then return busy.
1093	 */
1094	if (nr_pages < pipe->nrbufs) {
1095		ret = -EBUSY;
1096		goto out_revert_acct;
1097	}
1098
1099	bufs = kcalloc(nr_pages, sizeof(*bufs),
1100		       GFP_KERNEL_ACCOUNT | __GFP_NOWARN);
1101	if (unlikely(!bufs)) {
1102		ret = -ENOMEM;
1103		goto out_revert_acct;
1104	}
1105
1106	/*
1107	 * The pipe array wraps around, so just start the new one at zero
1108	 * and adjust the indexes.
1109	 */
1110	if (pipe->nrbufs) {
1111		unsigned int tail;
1112		unsigned int head;
1113
1114		tail = pipe->curbuf + pipe->nrbufs;
1115		if (tail < pipe->buffers)
1116			tail = 0;
1117		else
1118			tail &= (pipe->buffers - 1);
1119
1120		head = pipe->nrbufs - tail;
1121		if (head)
1122			memcpy(bufs, pipe->bufs + pipe->curbuf, head * sizeof(struct pipe_buffer));
1123		if (tail)
1124			memcpy(bufs + head, pipe->bufs, tail * sizeof(struct pipe_buffer));
1125	}
1126
1127	pipe->curbuf = 0;
1128	kfree(pipe->bufs);
1129	pipe->bufs = bufs;
1130	pipe->buffers = nr_pages;
1131	return nr_pages * PAGE_SIZE;
1132
1133out_revert_acct:
1134	(void) account_pipe_buffers(pipe->user, nr_pages, pipe->buffers);
1135	return ret;
1136}
1137
1138/*
1139 * After the inode slimming patch, i_pipe/i_bdev/i_cdev share the same
1140 * location, so checking ->i_pipe is not enough to verify that this is a
1141 * pipe.
1142 */
1143struct pipe_inode_info *get_pipe_info(struct file *file)
1144{
1145	return file->f_op == &pipefifo_fops ? file->private_data : NULL;
 
 
 
 
 
 
 
 
1146}
1147
1148long pipe_fcntl(struct file *file, unsigned int cmd, unsigned long arg)
1149{
1150	struct pipe_inode_info *pipe;
1151	long ret;
1152
1153	pipe = get_pipe_info(file);
1154	if (!pipe)
1155		return -EBADF;
1156
1157	__pipe_lock(pipe);
1158
1159	switch (cmd) {
1160	case F_SETPIPE_SZ:
1161		ret = pipe_set_size(pipe, arg);
1162		break;
1163	case F_GETPIPE_SZ:
1164		ret = pipe->buffers * PAGE_SIZE;
1165		break;
1166	default:
1167		ret = -EINVAL;
1168		break;
1169	}
1170
1171	__pipe_unlock(pipe);
1172	return ret;
1173}
1174
1175static const struct super_operations pipefs_ops = {
1176	.destroy_inode = free_inode_nonrcu,
1177	.statfs = simple_statfs,
1178};
1179
1180/*
1181 * pipefs should _never_ be mounted by userland - too much of security hassle,
1182 * no real gain from having the whole whorehouse mounted. So we don't need
1183 * any operations on the root directory. However, we need a non-trivial
1184 * d_name - pipe: will go nicely and kill the special-casing in procfs.
1185 */
1186
1187static int pipefs_init_fs_context(struct fs_context *fc)
1188{
1189	struct pseudo_fs_context *ctx = init_pseudo(fc, PIPEFS_MAGIC);
1190	if (!ctx)
1191		return -ENOMEM;
1192	ctx->ops = &pipefs_ops;
1193	ctx->dops = &pipefs_dentry_operations;
1194	return 0;
1195}
1196
1197static struct file_system_type pipe_fs_type = {
1198	.name		= "pipefs",
1199	.init_fs_context = pipefs_init_fs_context,
1200	.kill_sb	= kill_anon_super,
1201};
1202
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1203static int __init init_pipe_fs(void)
1204{
1205	int err = register_filesystem(&pipe_fs_type);
1206
1207	if (!err) {
1208		pipe_mnt = kern_mount(&pipe_fs_type);
1209		if (IS_ERR(pipe_mnt)) {
1210			err = PTR_ERR(pipe_mnt);
1211			unregister_filesystem(&pipe_fs_type);
1212		}
1213	}
 
 
 
1214	return err;
1215}
1216
1217fs_initcall(init_pipe_fs);