gro: Allow tunnel stacking in the case of FOU/GUE
[linux/fpc-iii.git] / fs / pipe.c
blob5916c19dbb0247d872101c21252596a406b169d9
1 /*
2 * linux/fs/pipe.c
4 * Copyright (C) 1991, 1992, 1999 Linus Torvalds
5 */
7 #include <linux/mm.h>
8 #include <linux/file.h>
9 #include <linux/poll.h>
10 #include <linux/slab.h>
11 #include <linux/module.h>
12 #include <linux/init.h>
13 #include <linux/fs.h>
14 #include <linux/log2.h>
15 #include <linux/mount.h>
16 #include <linux/magic.h>
17 #include <linux/pipe_fs_i.h>
18 #include <linux/uio.h>
19 #include <linux/highmem.h>
20 #include <linux/pagemap.h>
21 #include <linux/audit.h>
22 #include <linux/syscalls.h>
23 #include <linux/fcntl.h>
25 #include <asm/uaccess.h>
26 #include <asm/ioctls.h>
28 #include "internal.h"
31 * The max size that a non-root user is allowed to grow the pipe. Can
32 * be set by root in /proc/sys/fs/pipe-max-size
34 unsigned int pipe_max_size = 1048576;
37 * Minimum pipe size, as required by POSIX
39 unsigned int pipe_min_size = PAGE_SIZE;
41 /* Maximum allocatable pages per user. Hard limit is unset by default, soft
42 * matches default values.
44 unsigned long pipe_user_pages_hard;
45 unsigned long pipe_user_pages_soft = PIPE_DEF_BUFFERS * INR_OPEN_CUR;
48 * We use a start+len construction, which provides full use of the
49 * allocated memory.
50 * -- Florian Coosmann (FGC)
52 * Reads with count = 0 should always return 0.
53 * -- Julian Bradfield 1999-06-07.
55 * FIFOs and Pipes now generate SIGIO for both readers and writers.
56 * -- Jeremy Elson <jelson@circlemud.org> 2001-08-16
58 * pipe_read & write cleanup
59 * -- Manfred Spraul <manfred@colorfullife.com> 2002-05-09
62 static void pipe_lock_nested(struct pipe_inode_info *pipe, int subclass)
64 if (pipe->files)
65 mutex_lock_nested(&pipe->mutex, subclass);
68 void pipe_lock(struct pipe_inode_info *pipe)
71 * pipe_lock() nests non-pipe inode locks (for writing to a file)
73 pipe_lock_nested(pipe, I_MUTEX_PARENT);
75 EXPORT_SYMBOL(pipe_lock);
77 void pipe_unlock(struct pipe_inode_info *pipe)
79 if (pipe->files)
80 mutex_unlock(&pipe->mutex);
82 EXPORT_SYMBOL(pipe_unlock);
84 static inline void __pipe_lock(struct pipe_inode_info *pipe)
86 mutex_lock_nested(&pipe->mutex, I_MUTEX_PARENT);
89 static inline void __pipe_unlock(struct pipe_inode_info *pipe)
91 mutex_unlock(&pipe->mutex);
94 void pipe_double_lock(struct pipe_inode_info *pipe1,
95 struct pipe_inode_info *pipe2)
97 BUG_ON(pipe1 == pipe2);
99 if (pipe1 < pipe2) {
100 pipe_lock_nested(pipe1, I_MUTEX_PARENT);
101 pipe_lock_nested(pipe2, I_MUTEX_CHILD);
102 } else {
103 pipe_lock_nested(pipe2, I_MUTEX_PARENT);
104 pipe_lock_nested(pipe1, I_MUTEX_CHILD);
108 /* Drop the inode semaphore and wait for a pipe event, atomically */
109 void pipe_wait(struct pipe_inode_info *pipe)
111 DEFINE_WAIT(wait);
114 * Pipes are system-local resources, so sleeping on them
115 * is considered a noninteractive wait:
117 prepare_to_wait(&pipe->wait, &wait, TASK_INTERRUPTIBLE);
118 pipe_unlock(pipe);
119 schedule();
120 finish_wait(&pipe->wait, &wait);
121 pipe_lock(pipe);
124 static void anon_pipe_buf_release(struct pipe_inode_info *pipe,
125 struct pipe_buffer *buf)
127 struct page *page = buf->page;
130 * If nobody else uses this page, and we don't already have a
131 * temporary page, let's keep track of it as a one-deep
132 * allocation cache. (Otherwise just release our reference to it)
134 if (page_count(page) == 1 && !pipe->tmp_page)
135 pipe->tmp_page = page;
136 else
137 page_cache_release(page);
141 * generic_pipe_buf_steal - attempt to take ownership of a &pipe_buffer
142 * @pipe: the pipe that the buffer belongs to
143 * @buf: the buffer to attempt to steal
145 * Description:
146 * This function attempts to steal the &struct page attached to
147 * @buf. If successful, this function returns 0 and returns with
148 * the page locked. The caller may then reuse the page for whatever
149 * he wishes; the typical use is insertion into a different file
150 * page cache.
152 int generic_pipe_buf_steal(struct pipe_inode_info *pipe,
153 struct pipe_buffer *buf)
155 struct page *page = buf->page;
158 * A reference of one is golden, that means that the owner of this
159 * page is the only one holding a reference to it. lock the page
160 * and return OK.
162 if (page_count(page) == 1) {
163 lock_page(page);
164 return 0;
167 return 1;
169 EXPORT_SYMBOL(generic_pipe_buf_steal);
172 * generic_pipe_buf_get - get a reference to a &struct pipe_buffer
173 * @pipe: the pipe that the buffer belongs to
174 * @buf: the buffer to get a reference to
176 * Description:
177 * This function grabs an extra reference to @buf. It's used in
178 * in the tee() system call, when we duplicate the buffers in one
179 * pipe into another.
181 void generic_pipe_buf_get(struct pipe_inode_info *pipe, struct pipe_buffer *buf)
183 page_cache_get(buf->page);
185 EXPORT_SYMBOL(generic_pipe_buf_get);
188 * generic_pipe_buf_confirm - verify contents of the pipe buffer
189 * @info: the pipe that the buffer belongs to
190 * @buf: the buffer to confirm
192 * Description:
193 * This function does nothing, because the generic pipe code uses
194 * pages that are always good when inserted into the pipe.
196 int generic_pipe_buf_confirm(struct pipe_inode_info *info,
197 struct pipe_buffer *buf)
199 return 0;
201 EXPORT_SYMBOL(generic_pipe_buf_confirm);
204 * generic_pipe_buf_release - put a reference to a &struct pipe_buffer
205 * @pipe: the pipe that the buffer belongs to
206 * @buf: the buffer to put a reference to
208 * Description:
209 * This function releases a reference to @buf.
211 void generic_pipe_buf_release(struct pipe_inode_info *pipe,
212 struct pipe_buffer *buf)
214 page_cache_release(buf->page);
216 EXPORT_SYMBOL(generic_pipe_buf_release);
218 static const struct pipe_buf_operations anon_pipe_buf_ops = {
219 .can_merge = 1,
220 .confirm = generic_pipe_buf_confirm,
221 .release = anon_pipe_buf_release,
222 .steal = generic_pipe_buf_steal,
223 .get = generic_pipe_buf_get,
226 static const struct pipe_buf_operations packet_pipe_buf_ops = {
227 .can_merge = 0,
228 .confirm = generic_pipe_buf_confirm,
229 .release = anon_pipe_buf_release,
230 .steal = generic_pipe_buf_steal,
231 .get = generic_pipe_buf_get,
234 static ssize_t
235 pipe_read(struct kiocb *iocb, struct iov_iter *to)
237 size_t total_len = iov_iter_count(to);
238 struct file *filp = iocb->ki_filp;
239 struct pipe_inode_info *pipe = filp->private_data;
240 int do_wakeup;
241 ssize_t ret;
243 /* Null read succeeds. */
244 if (unlikely(total_len == 0))
245 return 0;
247 do_wakeup = 0;
248 ret = 0;
249 __pipe_lock(pipe);
250 for (;;) {
251 int bufs = pipe->nrbufs;
252 if (bufs) {
253 int curbuf = pipe->curbuf;
254 struct pipe_buffer *buf = pipe->bufs + curbuf;
255 const struct pipe_buf_operations *ops = buf->ops;
256 size_t chars = buf->len;
257 size_t written;
258 int error;
260 if (chars > total_len)
261 chars = total_len;
263 error = ops->confirm(pipe, buf);
264 if (error) {
265 if (!ret)
266 ret = error;
267 break;
270 written = copy_page_to_iter(buf->page, buf->offset, chars, to);
271 if (unlikely(written < chars)) {
272 if (!ret)
273 ret = -EFAULT;
274 break;
276 ret += chars;
277 buf->offset += chars;
278 buf->len -= chars;
280 /* Was it a packet buffer? Clean up and exit */
281 if (buf->flags & PIPE_BUF_FLAG_PACKET) {
282 total_len = chars;
283 buf->len = 0;
286 if (!buf->len) {
287 buf->ops = NULL;
288 ops->release(pipe, buf);
289 curbuf = (curbuf + 1) & (pipe->buffers - 1);
290 pipe->curbuf = curbuf;
291 pipe->nrbufs = --bufs;
292 do_wakeup = 1;
294 total_len -= chars;
295 if (!total_len)
296 break; /* common path: read succeeded */
298 if (bufs) /* More to do? */
299 continue;
300 if (!pipe->writers)
301 break;
302 if (!pipe->waiting_writers) {
303 /* syscall merging: Usually we must not sleep
304 * if O_NONBLOCK is set, or if we got some data.
305 * But if a writer sleeps in kernel space, then
306 * we can wait for that data without violating POSIX.
308 if (ret)
309 break;
310 if (filp->f_flags & O_NONBLOCK) {
311 ret = -EAGAIN;
312 break;
315 if (signal_pending(current)) {
316 if (!ret)
317 ret = -ERESTARTSYS;
318 break;
320 if (do_wakeup) {
321 wake_up_interruptible_sync_poll(&pipe->wait, POLLOUT | POLLWRNORM);
322 kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
324 pipe_wait(pipe);
326 __pipe_unlock(pipe);
328 /* Signal writers asynchronously that there is more room. */
329 if (do_wakeup) {
330 wake_up_interruptible_sync_poll(&pipe->wait, POLLOUT | POLLWRNORM);
331 kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
333 if (ret > 0)
334 file_accessed(filp);
335 return ret;
338 static inline int is_packetized(struct file *file)
340 return (file->f_flags & O_DIRECT) != 0;
343 static ssize_t
344 pipe_write(struct kiocb *iocb, struct iov_iter *from)
346 struct file *filp = iocb->ki_filp;
347 struct pipe_inode_info *pipe = filp->private_data;
348 ssize_t ret = 0;
349 int do_wakeup = 0;
350 size_t total_len = iov_iter_count(from);
351 ssize_t chars;
353 /* Null write succeeds. */
354 if (unlikely(total_len == 0))
355 return 0;
357 __pipe_lock(pipe);
359 if (!pipe->readers) {
360 send_sig(SIGPIPE, current, 0);
361 ret = -EPIPE;
362 goto out;
365 /* We try to merge small writes */
366 chars = total_len & (PAGE_SIZE-1); /* size of the last buffer */
367 if (pipe->nrbufs && chars != 0) {
368 int lastbuf = (pipe->curbuf + pipe->nrbufs - 1) &
369 (pipe->buffers - 1);
370 struct pipe_buffer *buf = pipe->bufs + lastbuf;
371 const struct pipe_buf_operations *ops = buf->ops;
372 int offset = buf->offset + buf->len;
374 if (ops->can_merge && offset + chars <= PAGE_SIZE) {
375 int error = ops->confirm(pipe, buf);
376 if (error)
377 goto out;
379 ret = copy_page_from_iter(buf->page, offset, chars, from);
380 if (unlikely(ret < chars)) {
381 error = -EFAULT;
382 goto out;
384 do_wakeup = 1;
385 buf->len += chars;
386 ret = chars;
387 if (!iov_iter_count(from))
388 goto out;
392 for (;;) {
393 int bufs;
395 if (!pipe->readers) {
396 send_sig(SIGPIPE, current, 0);
397 if (!ret)
398 ret = -EPIPE;
399 break;
401 bufs = pipe->nrbufs;
402 if (bufs < pipe->buffers) {
403 int newbuf = (pipe->curbuf + bufs) & (pipe->buffers-1);
404 struct pipe_buffer *buf = pipe->bufs + newbuf;
405 struct page *page = pipe->tmp_page;
406 int copied;
408 if (!page) {
409 page = alloc_page(GFP_HIGHUSER);
410 if (unlikely(!page)) {
411 ret = ret ? : -ENOMEM;
412 break;
414 pipe->tmp_page = page;
416 /* Always wake up, even if the copy fails. Otherwise
417 * we lock up (O_NONBLOCK-)readers that sleep due to
418 * syscall merging.
419 * FIXME! Is this really true?
421 do_wakeup = 1;
422 copied = copy_page_from_iter(page, 0, PAGE_SIZE, from);
423 if (unlikely(copied < PAGE_SIZE && iov_iter_count(from))) {
424 if (!ret)
425 ret = -EFAULT;
426 break;
428 ret += copied;
430 /* Insert it into the buffer array */
431 buf->page = page;
432 buf->ops = &anon_pipe_buf_ops;
433 buf->offset = 0;
434 buf->len = copied;
435 buf->flags = 0;
436 if (is_packetized(filp)) {
437 buf->ops = &packet_pipe_buf_ops;
438 buf->flags = PIPE_BUF_FLAG_PACKET;
440 pipe->nrbufs = ++bufs;
441 pipe->tmp_page = NULL;
443 if (!iov_iter_count(from))
444 break;
446 if (bufs < pipe->buffers)
447 continue;
448 if (filp->f_flags & O_NONBLOCK) {
449 if (!ret)
450 ret = -EAGAIN;
451 break;
453 if (signal_pending(current)) {
454 if (!ret)
455 ret = -ERESTARTSYS;
456 break;
458 if (do_wakeup) {
459 wake_up_interruptible_sync_poll(&pipe->wait, POLLIN | POLLRDNORM);
460 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
461 do_wakeup = 0;
463 pipe->waiting_writers++;
464 pipe_wait(pipe);
465 pipe->waiting_writers--;
467 out:
468 __pipe_unlock(pipe);
469 if (do_wakeup) {
470 wake_up_interruptible_sync_poll(&pipe->wait, POLLIN | POLLRDNORM);
471 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
473 if (ret > 0 && sb_start_write_trylock(file_inode(filp)->i_sb)) {
474 int err = file_update_time(filp);
475 if (err)
476 ret = err;
477 sb_end_write(file_inode(filp)->i_sb);
479 return ret;
482 static long pipe_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
484 struct pipe_inode_info *pipe = filp->private_data;
485 int count, buf, nrbufs;
487 switch (cmd) {
488 case FIONREAD:
489 __pipe_lock(pipe);
490 count = 0;
491 buf = pipe->curbuf;
492 nrbufs = pipe->nrbufs;
493 while (--nrbufs >= 0) {
494 count += pipe->bufs[buf].len;
495 buf = (buf+1) & (pipe->buffers - 1);
497 __pipe_unlock(pipe);
499 return put_user(count, (int __user *)arg);
500 default:
501 return -ENOIOCTLCMD;
505 /* No kernel lock held - fine */
506 static unsigned int
507 pipe_poll(struct file *filp, poll_table *wait)
509 unsigned int mask;
510 struct pipe_inode_info *pipe = filp->private_data;
511 int nrbufs;
513 poll_wait(filp, &pipe->wait, wait);
515 /* Reading only -- no need for acquiring the semaphore. */
516 nrbufs = pipe->nrbufs;
517 mask = 0;
518 if (filp->f_mode & FMODE_READ) {
519 mask = (nrbufs > 0) ? POLLIN | POLLRDNORM : 0;
520 if (!pipe->writers && filp->f_version != pipe->w_counter)
521 mask |= POLLHUP;
524 if (filp->f_mode & FMODE_WRITE) {
525 mask |= (nrbufs < pipe->buffers) ? POLLOUT | POLLWRNORM : 0;
527 * Most Unices do not set POLLERR for FIFOs but on Linux they
528 * behave exactly like pipes for poll().
530 if (!pipe->readers)
531 mask |= POLLERR;
534 return mask;
537 static void put_pipe_info(struct inode *inode, struct pipe_inode_info *pipe)
539 int kill = 0;
541 spin_lock(&inode->i_lock);
542 if (!--pipe->files) {
543 inode->i_pipe = NULL;
544 kill = 1;
546 spin_unlock(&inode->i_lock);
548 if (kill)
549 free_pipe_info(pipe);
552 static int
553 pipe_release(struct inode *inode, struct file *file)
555 struct pipe_inode_info *pipe = file->private_data;
557 __pipe_lock(pipe);
558 if (file->f_mode & FMODE_READ)
559 pipe->readers--;
560 if (file->f_mode & FMODE_WRITE)
561 pipe->writers--;
563 if (pipe->readers || pipe->writers) {
564 wake_up_interruptible_sync_poll(&pipe->wait, POLLIN | POLLOUT | POLLRDNORM | POLLWRNORM | POLLERR | POLLHUP);
565 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
566 kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
568 __pipe_unlock(pipe);
570 put_pipe_info(inode, pipe);
571 return 0;
574 static int
575 pipe_fasync(int fd, struct file *filp, int on)
577 struct pipe_inode_info *pipe = filp->private_data;
578 int retval = 0;
580 __pipe_lock(pipe);
581 if (filp->f_mode & FMODE_READ)
582 retval = fasync_helper(fd, filp, on, &pipe->fasync_readers);
583 if ((filp->f_mode & FMODE_WRITE) && retval >= 0) {
584 retval = fasync_helper(fd, filp, on, &pipe->fasync_writers);
585 if (retval < 0 && (filp->f_mode & FMODE_READ))
586 /* this can happen only if on == T */
587 fasync_helper(-1, filp, 0, &pipe->fasync_readers);
589 __pipe_unlock(pipe);
590 return retval;
593 static void account_pipe_buffers(struct pipe_inode_info *pipe,
594 unsigned long old, unsigned long new)
596 atomic_long_add(new - old, &pipe->user->pipe_bufs);
599 static bool too_many_pipe_buffers_soft(struct user_struct *user)
601 return pipe_user_pages_soft &&
602 atomic_long_read(&user->pipe_bufs) >= pipe_user_pages_soft;
605 static bool too_many_pipe_buffers_hard(struct user_struct *user)
607 return pipe_user_pages_hard &&
608 atomic_long_read(&user->pipe_bufs) >= pipe_user_pages_hard;
611 struct pipe_inode_info *alloc_pipe_info(void)
613 struct pipe_inode_info *pipe;
615 pipe = kzalloc(sizeof(struct pipe_inode_info), GFP_KERNEL);
616 if (pipe) {
617 unsigned long pipe_bufs = PIPE_DEF_BUFFERS;
618 struct user_struct *user = get_current_user();
620 if (!too_many_pipe_buffers_hard(user)) {
621 if (too_many_pipe_buffers_soft(user))
622 pipe_bufs = 1;
623 pipe->bufs = kzalloc(sizeof(struct pipe_buffer) * pipe_bufs, GFP_KERNEL);
626 if (pipe->bufs) {
627 init_waitqueue_head(&pipe->wait);
628 pipe->r_counter = pipe->w_counter = 1;
629 pipe->buffers = pipe_bufs;
630 pipe->user = user;
631 account_pipe_buffers(pipe, 0, pipe_bufs);
632 mutex_init(&pipe->mutex);
633 return pipe;
635 free_uid(user);
636 kfree(pipe);
639 return NULL;
642 void free_pipe_info(struct pipe_inode_info *pipe)
644 int i;
646 account_pipe_buffers(pipe, pipe->buffers, 0);
647 free_uid(pipe->user);
648 for (i = 0; i < pipe->buffers; i++) {
649 struct pipe_buffer *buf = pipe->bufs + i;
650 if (buf->ops)
651 buf->ops->release(pipe, buf);
653 if (pipe->tmp_page)
654 __free_page(pipe->tmp_page);
655 kfree(pipe->bufs);
656 kfree(pipe);
659 static struct vfsmount *pipe_mnt __read_mostly;
662 * pipefs_dname() is called from d_path().
664 static char *pipefs_dname(struct dentry *dentry, char *buffer, int buflen)
666 return dynamic_dname(dentry, buffer, buflen, "pipe:[%lu]",
667 d_inode(dentry)->i_ino);
670 static const struct dentry_operations pipefs_dentry_operations = {
671 .d_dname = pipefs_dname,
674 static struct inode * get_pipe_inode(void)
676 struct inode *inode = new_inode_pseudo(pipe_mnt->mnt_sb);
677 struct pipe_inode_info *pipe;
679 if (!inode)
680 goto fail_inode;
682 inode->i_ino = get_next_ino();
684 pipe = alloc_pipe_info();
685 if (!pipe)
686 goto fail_iput;
688 inode->i_pipe = pipe;
689 pipe->files = 2;
690 pipe->readers = pipe->writers = 1;
691 inode->i_fop = &pipefifo_fops;
694 * Mark the inode dirty from the very beginning,
695 * that way it will never be moved to the dirty
696 * list because "mark_inode_dirty()" will think
697 * that it already _is_ on the dirty list.
699 inode->i_state = I_DIRTY;
700 inode->i_mode = S_IFIFO | S_IRUSR | S_IWUSR;
701 inode->i_uid = current_fsuid();
702 inode->i_gid = current_fsgid();
703 inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME;
705 return inode;
707 fail_iput:
708 iput(inode);
710 fail_inode:
711 return NULL;
714 int create_pipe_files(struct file **res, int flags)
716 int err;
717 struct inode *inode = get_pipe_inode();
718 struct file *f;
719 struct path path;
720 static struct qstr name = { .name = "" };
722 if (!inode)
723 return -ENFILE;
725 err = -ENOMEM;
726 path.dentry = d_alloc_pseudo(pipe_mnt->mnt_sb, &name);
727 if (!path.dentry)
728 goto err_inode;
729 path.mnt = mntget(pipe_mnt);
731 d_instantiate(path.dentry, inode);
733 err = -ENFILE;
734 f = alloc_file(&path, FMODE_WRITE, &pipefifo_fops);
735 if (IS_ERR(f))
736 goto err_dentry;
738 f->f_flags = O_WRONLY | (flags & (O_NONBLOCK | O_DIRECT));
739 f->private_data = inode->i_pipe;
741 res[0] = alloc_file(&path, FMODE_READ, &pipefifo_fops);
742 if (IS_ERR(res[0]))
743 goto err_file;
745 path_get(&path);
746 res[0]->private_data = inode->i_pipe;
747 res[0]->f_flags = O_RDONLY | (flags & O_NONBLOCK);
748 res[1] = f;
749 return 0;
751 err_file:
752 put_filp(f);
753 err_dentry:
754 free_pipe_info(inode->i_pipe);
755 path_put(&path);
756 return err;
758 err_inode:
759 free_pipe_info(inode->i_pipe);
760 iput(inode);
761 return err;
764 static int __do_pipe_flags(int *fd, struct file **files, int flags)
766 int error;
767 int fdw, fdr;
769 if (flags & ~(O_CLOEXEC | O_NONBLOCK | O_DIRECT))
770 return -EINVAL;
772 error = create_pipe_files(files, flags);
773 if (error)
774 return error;
776 error = get_unused_fd_flags(flags);
777 if (error < 0)
778 goto err_read_pipe;
779 fdr = error;
781 error = get_unused_fd_flags(flags);
782 if (error < 0)
783 goto err_fdr;
784 fdw = error;
786 audit_fd_pair(fdr, fdw);
787 fd[0] = fdr;
788 fd[1] = fdw;
789 return 0;
791 err_fdr:
792 put_unused_fd(fdr);
793 err_read_pipe:
794 fput(files[0]);
795 fput(files[1]);
796 return error;
799 int do_pipe_flags(int *fd, int flags)
801 struct file *files[2];
802 int error = __do_pipe_flags(fd, files, flags);
803 if (!error) {
804 fd_install(fd[0], files[0]);
805 fd_install(fd[1], files[1]);
807 return error;
811 * sys_pipe() is the normal C calling standard for creating
812 * a pipe. It's not the way Unix traditionally does this, though.
814 SYSCALL_DEFINE2(pipe2, int __user *, fildes, int, flags)
816 struct file *files[2];
817 int fd[2];
818 int error;
820 error = __do_pipe_flags(fd, files, flags);
821 if (!error) {
822 if (unlikely(copy_to_user(fildes, fd, sizeof(fd)))) {
823 fput(files[0]);
824 fput(files[1]);
825 put_unused_fd(fd[0]);
826 put_unused_fd(fd[1]);
827 error = -EFAULT;
828 } else {
829 fd_install(fd[0], files[0]);
830 fd_install(fd[1], files[1]);
833 return error;
836 SYSCALL_DEFINE1(pipe, int __user *, fildes)
838 return sys_pipe2(fildes, 0);
841 static int wait_for_partner(struct pipe_inode_info *pipe, unsigned int *cnt)
843 int cur = *cnt;
845 while (cur == *cnt) {
846 pipe_wait(pipe);
847 if (signal_pending(current))
848 break;
850 return cur == *cnt ? -ERESTARTSYS : 0;
853 static void wake_up_partner(struct pipe_inode_info *pipe)
855 wake_up_interruptible(&pipe->wait);
858 static int fifo_open(struct inode *inode, struct file *filp)
860 struct pipe_inode_info *pipe;
861 bool is_pipe = inode->i_sb->s_magic == PIPEFS_MAGIC;
862 int ret;
864 filp->f_version = 0;
866 spin_lock(&inode->i_lock);
867 if (inode->i_pipe) {
868 pipe = inode->i_pipe;
869 pipe->files++;
870 spin_unlock(&inode->i_lock);
871 } else {
872 spin_unlock(&inode->i_lock);
873 pipe = alloc_pipe_info();
874 if (!pipe)
875 return -ENOMEM;
876 pipe->files = 1;
877 spin_lock(&inode->i_lock);
878 if (unlikely(inode->i_pipe)) {
879 inode->i_pipe->files++;
880 spin_unlock(&inode->i_lock);
881 free_pipe_info(pipe);
882 pipe = inode->i_pipe;
883 } else {
884 inode->i_pipe = pipe;
885 spin_unlock(&inode->i_lock);
888 filp->private_data = pipe;
889 /* OK, we have a pipe and it's pinned down */
891 __pipe_lock(pipe);
893 /* We can only do regular read/write on fifos */
894 filp->f_mode &= (FMODE_READ | FMODE_WRITE);
896 switch (filp->f_mode) {
897 case FMODE_READ:
899 * O_RDONLY
900 * POSIX.1 says that O_NONBLOCK means return with the FIFO
901 * opened, even when there is no process writing the FIFO.
903 pipe->r_counter++;
904 if (pipe->readers++ == 0)
905 wake_up_partner(pipe);
907 if (!is_pipe && !pipe->writers) {
908 if ((filp->f_flags & O_NONBLOCK)) {
909 /* suppress POLLHUP until we have
910 * seen a writer */
911 filp->f_version = pipe->w_counter;
912 } else {
913 if (wait_for_partner(pipe, &pipe->w_counter))
914 goto err_rd;
917 break;
919 case FMODE_WRITE:
921 * O_WRONLY
922 * POSIX.1 says that O_NONBLOCK means return -1 with
923 * errno=ENXIO when there is no process reading the FIFO.
925 ret = -ENXIO;
926 if (!is_pipe && (filp->f_flags & O_NONBLOCK) && !pipe->readers)
927 goto err;
929 pipe->w_counter++;
930 if (!pipe->writers++)
931 wake_up_partner(pipe);
933 if (!is_pipe && !pipe->readers) {
934 if (wait_for_partner(pipe, &pipe->r_counter))
935 goto err_wr;
937 break;
939 case FMODE_READ | FMODE_WRITE:
941 * O_RDWR
942 * POSIX.1 leaves this case "undefined" when O_NONBLOCK is set.
943 * This implementation will NEVER block on a O_RDWR open, since
944 * the process can at least talk to itself.
947 pipe->readers++;
948 pipe->writers++;
949 pipe->r_counter++;
950 pipe->w_counter++;
951 if (pipe->readers == 1 || pipe->writers == 1)
952 wake_up_partner(pipe);
953 break;
955 default:
956 ret = -EINVAL;
957 goto err;
960 /* Ok! */
961 __pipe_unlock(pipe);
962 return 0;
964 err_rd:
965 if (!--pipe->readers)
966 wake_up_interruptible(&pipe->wait);
967 ret = -ERESTARTSYS;
968 goto err;
970 err_wr:
971 if (!--pipe->writers)
972 wake_up_interruptible(&pipe->wait);
973 ret = -ERESTARTSYS;
974 goto err;
976 err:
977 __pipe_unlock(pipe);
979 put_pipe_info(inode, pipe);
980 return ret;
983 const struct file_operations pipefifo_fops = {
984 .open = fifo_open,
985 .llseek = no_llseek,
986 .read_iter = pipe_read,
987 .write_iter = pipe_write,
988 .poll = pipe_poll,
989 .unlocked_ioctl = pipe_ioctl,
990 .release = pipe_release,
991 .fasync = pipe_fasync,
995 * Allocate a new array of pipe buffers and copy the info over. Returns the
996 * pipe size if successful, or return -ERROR on error.
998 static long pipe_set_size(struct pipe_inode_info *pipe, unsigned long nr_pages)
1000 struct pipe_buffer *bufs;
1003 * We can shrink the pipe, if arg >= pipe->nrbufs. Since we don't
1004 * expect a lot of shrink+grow operations, just free and allocate
1005 * again like we would do for growing. If the pipe currently
1006 * contains more buffers than arg, then return busy.
1008 if (nr_pages < pipe->nrbufs)
1009 return -EBUSY;
1011 bufs = kcalloc(nr_pages, sizeof(*bufs), GFP_KERNEL | __GFP_NOWARN);
1012 if (unlikely(!bufs))
1013 return -ENOMEM;
1016 * The pipe array wraps around, so just start the new one at zero
1017 * and adjust the indexes.
1019 if (pipe->nrbufs) {
1020 unsigned int tail;
1021 unsigned int head;
1023 tail = pipe->curbuf + pipe->nrbufs;
1024 if (tail < pipe->buffers)
1025 tail = 0;
1026 else
1027 tail &= (pipe->buffers - 1);
1029 head = pipe->nrbufs - tail;
1030 if (head)
1031 memcpy(bufs, pipe->bufs + pipe->curbuf, head * sizeof(struct pipe_buffer));
1032 if (tail)
1033 memcpy(bufs + head, pipe->bufs, tail * sizeof(struct pipe_buffer));
1036 account_pipe_buffers(pipe, pipe->buffers, nr_pages);
1037 pipe->curbuf = 0;
1038 kfree(pipe->bufs);
1039 pipe->bufs = bufs;
1040 pipe->buffers = nr_pages;
1041 return nr_pages * PAGE_SIZE;
1045 * Currently we rely on the pipe array holding a power-of-2 number
1046 * of pages.
1048 static inline unsigned int round_pipe_size(unsigned int size)
1050 unsigned long nr_pages;
1052 nr_pages = (size + PAGE_SIZE - 1) >> PAGE_SHIFT;
1053 return roundup_pow_of_two(nr_pages) << PAGE_SHIFT;
1057 * This should work even if CONFIG_PROC_FS isn't set, as proc_dointvec_minmax
1058 * will return an error.
1060 int pipe_proc_fn(struct ctl_table *table, int write, void __user *buf,
1061 size_t *lenp, loff_t *ppos)
1063 int ret;
1065 ret = proc_dointvec_minmax(table, write, buf, lenp, ppos);
1066 if (ret < 0 || !write)
1067 return ret;
1069 pipe_max_size = round_pipe_size(pipe_max_size);
1070 return ret;
1074 * After the inode slimming patch, i_pipe/i_bdev/i_cdev share the same
1075 * location, so checking ->i_pipe is not enough to verify that this is a
1076 * pipe.
1078 struct pipe_inode_info *get_pipe_info(struct file *file)
1080 return file->f_op == &pipefifo_fops ? file->private_data : NULL;
1083 long pipe_fcntl(struct file *file, unsigned int cmd, unsigned long arg)
1085 struct pipe_inode_info *pipe;
1086 long ret;
1088 pipe = get_pipe_info(file);
1089 if (!pipe)
1090 return -EBADF;
1092 __pipe_lock(pipe);
1094 switch (cmd) {
1095 case F_SETPIPE_SZ: {
1096 unsigned int size, nr_pages;
1098 size = round_pipe_size(arg);
1099 nr_pages = size >> PAGE_SHIFT;
1101 ret = -EINVAL;
1102 if (!nr_pages)
1103 goto out;
1105 if (!capable(CAP_SYS_RESOURCE) && size > pipe_max_size) {
1106 ret = -EPERM;
1107 goto out;
1108 } else if ((too_many_pipe_buffers_hard(pipe->user) ||
1109 too_many_pipe_buffers_soft(pipe->user)) &&
1110 !capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN)) {
1111 ret = -EPERM;
1112 goto out;
1114 ret = pipe_set_size(pipe, nr_pages);
1115 break;
1117 case F_GETPIPE_SZ:
1118 ret = pipe->buffers * PAGE_SIZE;
1119 break;
1120 default:
1121 ret = -EINVAL;
1122 break;
1125 out:
1126 __pipe_unlock(pipe);
1127 return ret;
1130 static const struct super_operations pipefs_ops = {
1131 .destroy_inode = free_inode_nonrcu,
1132 .statfs = simple_statfs,
1136 * pipefs should _never_ be mounted by userland - too much of security hassle,
1137 * no real gain from having the whole whorehouse mounted. So we don't need
1138 * any operations on the root directory. However, we need a non-trivial
1139 * d_name - pipe: will go nicely and kill the special-casing in procfs.
1141 static struct dentry *pipefs_mount(struct file_system_type *fs_type,
1142 int flags, const char *dev_name, void *data)
1144 return mount_pseudo(fs_type, "pipe:", &pipefs_ops,
1145 &pipefs_dentry_operations, PIPEFS_MAGIC);
1148 static struct file_system_type pipe_fs_type = {
1149 .name = "pipefs",
1150 .mount = pipefs_mount,
1151 .kill_sb = kill_anon_super,
1154 static int __init init_pipe_fs(void)
1156 int err = register_filesystem(&pipe_fs_type);
1158 if (!err) {
1159 pipe_mnt = kern_mount(&pipe_fs_type);
1160 if (IS_ERR(pipe_mnt)) {
1161 err = PTR_ERR(pipe_mnt);
1162 unregister_filesystem(&pipe_fs_type);
1165 return err;
1168 fs_initcall(init_pipe_fs);