4 * Copyright (C) 1991, 1992, 1999 Linus Torvalds
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>
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>
24 #include <linux/memcontrol.h>
26 #include <asm/uaccess.h>
27 #include <asm/ioctls.h>
32 * The max size that a non-root user is allowed to grow the pipe. Can
33 * be set by root in /proc/sys/fs/pipe-max-size
35 unsigned int pipe_max_size = 1048576;
38 * Minimum pipe size, as required by POSIX
40 unsigned int pipe_min_size = PAGE_SIZE;
42 /* Maximum allocatable pages per user. Hard limit is unset by default, soft
43 * matches default values.
45 unsigned long pipe_user_pages_hard;
46 unsigned long pipe_user_pages_soft = PIPE_DEF_BUFFERS * INR_OPEN_CUR;
49 * We use a start+len construction, which provides full use of the
51 * -- Florian Coosmann (FGC)
53 * Reads with count = 0 should always return 0.
54 * -- Julian Bradfield 1999-06-07.
56 * FIFOs and Pipes now generate SIGIO for both readers and writers.
57 * -- Jeremy Elson <jelson@circlemud.org> 2001-08-16
59 * pipe_read & write cleanup
60 * -- Manfred Spraul <manfred@colorfullife.com> 2002-05-09
63 static void pipe_lock_nested(struct pipe_inode_info *pipe, int subclass)
66 mutex_lock_nested(&pipe->mutex, subclass);
69 void pipe_lock(struct pipe_inode_info *pipe)
72 * pipe_lock() nests non-pipe inode locks (for writing to a file)
74 pipe_lock_nested(pipe, I_MUTEX_PARENT);
76 EXPORT_SYMBOL(pipe_lock);
78 void pipe_unlock(struct pipe_inode_info *pipe)
81 mutex_unlock(&pipe->mutex);
83 EXPORT_SYMBOL(pipe_unlock);
85 static inline void __pipe_lock(struct pipe_inode_info *pipe)
87 mutex_lock_nested(&pipe->mutex, I_MUTEX_PARENT);
90 static inline void __pipe_unlock(struct pipe_inode_info *pipe)
92 mutex_unlock(&pipe->mutex);
95 void pipe_double_lock(struct pipe_inode_info *pipe1,
96 struct pipe_inode_info *pipe2)
98 BUG_ON(pipe1 == pipe2);
101 pipe_lock_nested(pipe1, I_MUTEX_PARENT);
102 pipe_lock_nested(pipe2, I_MUTEX_CHILD);
104 pipe_lock_nested(pipe2, I_MUTEX_PARENT);
105 pipe_lock_nested(pipe1, I_MUTEX_CHILD);
109 /* Drop the inode semaphore and wait for a pipe event, atomically */
110 void pipe_wait(struct pipe_inode_info *pipe)
115 * Pipes are system-local resources, so sleeping on them
116 * is considered a noninteractive wait:
118 prepare_to_wait(&pipe->wait, &wait, TASK_INTERRUPTIBLE);
121 finish_wait(&pipe->wait, &wait);
125 static void anon_pipe_buf_release(struct pipe_inode_info *pipe,
126 struct pipe_buffer *buf)
128 struct page *page = buf->page;
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)
135 if (page_count(page) == 1 && !pipe->tmp_page)
136 pipe->tmp_page = page;
141 static int anon_pipe_buf_steal(struct pipe_inode_info *pipe,
142 struct pipe_buffer *buf)
144 struct page *page = buf->page;
146 if (page_count(page) == 1) {
147 if (memcg_kmem_enabled())
148 memcg_kmem_uncharge(page, 0);
149 __SetPageLocked(page);
156 * generic_pipe_buf_steal - attempt to take ownership of a &pipe_buffer
157 * @pipe: the pipe that the buffer belongs to
158 * @buf: the buffer to attempt to steal
161 * This function attempts to steal the &struct page attached to
162 * @buf. If successful, this function returns 0 and returns with
163 * the page locked. The caller may then reuse the page for whatever
164 * he wishes; the typical use is insertion into a different file
167 int generic_pipe_buf_steal(struct pipe_inode_info *pipe,
168 struct pipe_buffer *buf)
170 struct page *page = buf->page;
173 * A reference of one is golden, that means that the owner of this
174 * page is the only one holding a reference to it. lock the page
177 if (page_count(page) == 1) {
184 EXPORT_SYMBOL(generic_pipe_buf_steal);
187 * generic_pipe_buf_get - get a reference to a &struct pipe_buffer
188 * @pipe: the pipe that the buffer belongs to
189 * @buf: the buffer to get a reference to
192 * This function grabs an extra reference to @buf. It's used in
193 * in the tee() system call, when we duplicate the buffers in one
196 void generic_pipe_buf_get(struct pipe_inode_info *pipe, struct pipe_buffer *buf)
200 EXPORT_SYMBOL(generic_pipe_buf_get);
203 * generic_pipe_buf_confirm - verify contents of the pipe buffer
204 * @info: the pipe that the buffer belongs to
205 * @buf: the buffer to confirm
208 * This function does nothing, because the generic pipe code uses
209 * pages that are always good when inserted into the pipe.
211 int generic_pipe_buf_confirm(struct pipe_inode_info *info,
212 struct pipe_buffer *buf)
216 EXPORT_SYMBOL(generic_pipe_buf_confirm);
219 * generic_pipe_buf_release - put a reference to a &struct pipe_buffer
220 * @pipe: the pipe that the buffer belongs to
221 * @buf: the buffer to put a reference to
224 * This function releases a reference to @buf.
226 void generic_pipe_buf_release(struct pipe_inode_info *pipe,
227 struct pipe_buffer *buf)
231 EXPORT_SYMBOL(generic_pipe_buf_release);
233 static const struct pipe_buf_operations anon_pipe_buf_ops = {
235 .confirm = generic_pipe_buf_confirm,
236 .release = anon_pipe_buf_release,
237 .steal = anon_pipe_buf_steal,
238 .get = generic_pipe_buf_get,
241 static const struct pipe_buf_operations packet_pipe_buf_ops = {
243 .confirm = generic_pipe_buf_confirm,
244 .release = anon_pipe_buf_release,
245 .steal = anon_pipe_buf_steal,
246 .get = generic_pipe_buf_get,
250 pipe_read(struct kiocb *iocb, struct iov_iter *to)
252 size_t total_len = iov_iter_count(to);
253 struct file *filp = iocb->ki_filp;
254 struct pipe_inode_info *pipe = filp->private_data;
258 /* Null read succeeds. */
259 if (unlikely(total_len == 0))
266 int bufs = pipe->nrbufs;
268 int curbuf = pipe->curbuf;
269 struct pipe_buffer *buf = pipe->bufs + curbuf;
270 const struct pipe_buf_operations *ops = buf->ops;
271 size_t chars = buf->len;
275 if (chars > total_len)
278 error = ops->confirm(pipe, buf);
285 written = copy_page_to_iter(buf->page, buf->offset, chars, to);
286 if (unlikely(written < chars)) {
292 buf->offset += chars;
295 /* Was it a packet buffer? Clean up and exit */
296 if (buf->flags & PIPE_BUF_FLAG_PACKET) {
302 pipe_buf_release(pipe, buf);
303 curbuf = (curbuf + 1) & (pipe->buffers - 1);
304 pipe->curbuf = curbuf;
305 pipe->nrbufs = --bufs;
310 break; /* common path: read succeeded */
312 if (bufs) /* More to do? */
316 if (!pipe->waiting_writers) {
317 /* syscall merging: Usually we must not sleep
318 * if O_NONBLOCK is set, or if we got some data.
319 * But if a writer sleeps in kernel space, then
320 * we can wait for that data without violating POSIX.
324 if (filp->f_flags & O_NONBLOCK) {
329 if (signal_pending(current)) {
335 wake_up_interruptible_sync_poll(&pipe->wait, POLLOUT | POLLWRNORM);
336 kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
342 /* Signal writers asynchronously that there is more room. */
344 wake_up_interruptible_sync_poll(&pipe->wait, POLLOUT | POLLWRNORM);
345 kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
352 static inline int is_packetized(struct file *file)
354 return (file->f_flags & O_DIRECT) != 0;
358 pipe_write(struct kiocb *iocb, struct iov_iter *from)
360 struct file *filp = iocb->ki_filp;
361 struct pipe_inode_info *pipe = filp->private_data;
364 size_t total_len = iov_iter_count(from);
367 /* Null write succeeds. */
368 if (unlikely(total_len == 0))
373 if (!pipe->readers) {
374 send_sig(SIGPIPE, current, 0);
379 /* We try to merge small writes */
380 chars = total_len & (PAGE_SIZE-1); /* size of the last buffer */
381 if (pipe->nrbufs && chars != 0) {
382 int lastbuf = (pipe->curbuf + pipe->nrbufs - 1) &
384 struct pipe_buffer *buf = pipe->bufs + lastbuf;
385 const struct pipe_buf_operations *ops = buf->ops;
386 int offset = buf->offset + buf->len;
388 if (ops->can_merge && offset + chars <= PAGE_SIZE) {
389 ret = ops->confirm(pipe, buf);
393 ret = copy_page_from_iter(buf->page, offset, chars, from);
394 if (unlikely(ret < chars)) {
400 if (!iov_iter_count(from))
408 if (!pipe->readers) {
409 send_sig(SIGPIPE, current, 0);
415 if (bufs < pipe->buffers) {
416 int newbuf = (pipe->curbuf + bufs) & (pipe->buffers-1);
417 struct pipe_buffer *buf = pipe->bufs + newbuf;
418 struct page *page = pipe->tmp_page;
422 page = alloc_page(GFP_HIGHUSER | __GFP_ACCOUNT);
423 if (unlikely(!page)) {
424 ret = ret ? : -ENOMEM;
427 pipe->tmp_page = page;
429 /* Always wake up, even if the copy fails. Otherwise
430 * we lock up (O_NONBLOCK-)readers that sleep due to
432 * FIXME! Is this really true?
435 copied = copy_page_from_iter(page, 0, PAGE_SIZE, from);
436 if (unlikely(copied < PAGE_SIZE && iov_iter_count(from))) {
443 /* Insert it into the buffer array */
445 buf->ops = &anon_pipe_buf_ops;
449 if (is_packetized(filp)) {
450 buf->ops = &packet_pipe_buf_ops;
451 buf->flags = PIPE_BUF_FLAG_PACKET;
453 pipe->nrbufs = ++bufs;
454 pipe->tmp_page = NULL;
456 if (!iov_iter_count(from))
459 if (bufs < pipe->buffers)
461 if (filp->f_flags & O_NONBLOCK) {
466 if (signal_pending(current)) {
472 wake_up_interruptible_sync_poll(&pipe->wait, POLLIN | POLLRDNORM);
473 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
476 pipe->waiting_writers++;
478 pipe->waiting_writers--;
483 wake_up_interruptible_sync_poll(&pipe->wait, POLLIN | POLLRDNORM);
484 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
486 if (ret > 0 && sb_start_write_trylock(file_inode(filp)->i_sb)) {
487 int err = file_update_time(filp);
490 sb_end_write(file_inode(filp)->i_sb);
495 static long pipe_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
497 struct pipe_inode_info *pipe = filp->private_data;
498 int count, buf, nrbufs;
505 nrbufs = pipe->nrbufs;
506 while (--nrbufs >= 0) {
507 count += pipe->bufs[buf].len;
508 buf = (buf+1) & (pipe->buffers - 1);
512 return put_user(count, (int __user *)arg);
518 /* No kernel lock held - fine */
520 pipe_poll(struct file *filp, poll_table *wait)
523 struct pipe_inode_info *pipe = filp->private_data;
526 poll_wait(filp, &pipe->wait, wait);
528 /* Reading only -- no need for acquiring the semaphore. */
529 nrbufs = pipe->nrbufs;
531 if (filp->f_mode & FMODE_READ) {
532 mask = (nrbufs > 0) ? POLLIN | POLLRDNORM : 0;
533 if (!pipe->writers && filp->f_version != pipe->w_counter)
537 if (filp->f_mode & FMODE_WRITE) {
538 mask |= (nrbufs < pipe->buffers) ? POLLOUT | POLLWRNORM : 0;
540 * Most Unices do not set POLLERR for FIFOs but on Linux they
541 * behave exactly like pipes for poll().
550 static void put_pipe_info(struct inode *inode, struct pipe_inode_info *pipe)
554 spin_lock(&inode->i_lock);
555 if (!--pipe->files) {
556 inode->i_pipe = NULL;
559 spin_unlock(&inode->i_lock);
562 free_pipe_info(pipe);
566 pipe_release(struct inode *inode, struct file *file)
568 struct pipe_inode_info *pipe = file->private_data;
571 if (file->f_mode & FMODE_READ)
573 if (file->f_mode & FMODE_WRITE)
576 if (pipe->readers || pipe->writers) {
577 wake_up_interruptible_sync_poll(&pipe->wait, POLLIN | POLLOUT | POLLRDNORM | POLLWRNORM | POLLERR | POLLHUP);
578 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
579 kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
583 put_pipe_info(inode, pipe);
588 pipe_fasync(int fd, struct file *filp, int on)
590 struct pipe_inode_info *pipe = filp->private_data;
594 if (filp->f_mode & FMODE_READ)
595 retval = fasync_helper(fd, filp, on, &pipe->fasync_readers);
596 if ((filp->f_mode & FMODE_WRITE) && retval >= 0) {
597 retval = fasync_helper(fd, filp, on, &pipe->fasync_writers);
598 if (retval < 0 && (filp->f_mode & FMODE_READ))
599 /* this can happen only if on == T */
600 fasync_helper(-1, filp, 0, &pipe->fasync_readers);
606 static void account_pipe_buffers(struct pipe_inode_info *pipe,
607 unsigned long old, unsigned long new)
609 atomic_long_add(new - old, &pipe->user->pipe_bufs);
612 static bool too_many_pipe_buffers_soft(struct user_struct *user)
614 return pipe_user_pages_soft &&
615 atomic_long_read(&user->pipe_bufs) >= pipe_user_pages_soft;
618 static bool too_many_pipe_buffers_hard(struct user_struct *user)
620 return pipe_user_pages_hard &&
621 atomic_long_read(&user->pipe_bufs) >= pipe_user_pages_hard;
624 struct pipe_inode_info *alloc_pipe_info(void)
626 struct pipe_inode_info *pipe;
628 pipe = kzalloc(sizeof(struct pipe_inode_info), GFP_KERNEL_ACCOUNT);
630 unsigned long pipe_bufs = PIPE_DEF_BUFFERS;
631 struct user_struct *user = get_current_user();
633 if (!too_many_pipe_buffers_hard(user)) {
634 if (too_many_pipe_buffers_soft(user))
636 pipe->bufs = kcalloc(pipe_bufs,
637 sizeof(struct pipe_buffer),
642 init_waitqueue_head(&pipe->wait);
643 pipe->r_counter = pipe->w_counter = 1;
644 pipe->buffers = pipe_bufs;
646 account_pipe_buffers(pipe, 0, pipe_bufs);
647 mutex_init(&pipe->mutex);
657 void free_pipe_info(struct pipe_inode_info *pipe)
661 account_pipe_buffers(pipe, pipe->buffers, 0);
662 free_uid(pipe->user);
663 for (i = 0; i < pipe->buffers; i++) {
664 struct pipe_buffer *buf = pipe->bufs + i;
666 pipe_buf_release(pipe, buf);
669 __free_page(pipe->tmp_page);
674 static struct vfsmount *pipe_mnt __read_mostly;
677 * pipefs_dname() is called from d_path().
679 static char *pipefs_dname(struct dentry *dentry, char *buffer, int buflen)
681 return dynamic_dname(dentry, buffer, buflen, "pipe:[%lu]",
682 d_inode(dentry)->i_ino);
685 static const struct dentry_operations pipefs_dentry_operations = {
686 .d_dname = pipefs_dname,
689 static struct inode * get_pipe_inode(void)
691 struct inode *inode = new_inode_pseudo(pipe_mnt->mnt_sb);
692 struct pipe_inode_info *pipe;
697 inode->i_ino = get_next_ino();
699 pipe = alloc_pipe_info();
703 inode->i_pipe = pipe;
705 pipe->readers = pipe->writers = 1;
706 inode->i_fop = &pipefifo_fops;
709 * Mark the inode dirty from the very beginning,
710 * that way it will never be moved to the dirty
711 * list because "mark_inode_dirty()" will think
712 * that it already _is_ on the dirty list.
714 inode->i_state = I_DIRTY;
715 inode->i_mode = S_IFIFO | S_IRUSR | S_IWUSR;
716 inode->i_uid = current_fsuid();
717 inode->i_gid = current_fsgid();
718 inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME;
729 int create_pipe_files(struct file **res, int flags)
732 struct inode *inode = get_pipe_inode();
735 static struct qstr name = { .name = "" };
741 path.dentry = d_alloc_pseudo(pipe_mnt->mnt_sb, &name);
744 path.mnt = mntget(pipe_mnt);
746 d_instantiate(path.dentry, inode);
748 f = alloc_file(&path, FMODE_WRITE, &pipefifo_fops);
754 f->f_flags = O_WRONLY | (flags & (O_NONBLOCK | O_DIRECT));
755 f->private_data = inode->i_pipe;
757 res[0] = alloc_file(&path, FMODE_READ, &pipefifo_fops);
758 if (IS_ERR(res[0])) {
759 err = PTR_ERR(res[0]);
764 res[0]->private_data = inode->i_pipe;
765 res[0]->f_flags = O_RDONLY | (flags & O_NONBLOCK);
772 free_pipe_info(inode->i_pipe);
777 free_pipe_info(inode->i_pipe);
782 static int __do_pipe_flags(int *fd, struct file **files, int flags)
787 if (flags & ~(O_CLOEXEC | O_NONBLOCK | O_DIRECT))
790 error = create_pipe_files(files, flags);
794 error = get_unused_fd_flags(flags);
799 error = get_unused_fd_flags(flags);
804 audit_fd_pair(fdr, fdw);
817 int do_pipe_flags(int *fd, int flags)
819 struct file *files[2];
820 int error = __do_pipe_flags(fd, files, flags);
822 fd_install(fd[0], files[0]);
823 fd_install(fd[1], files[1]);
829 * sys_pipe() is the normal C calling standard for creating
830 * a pipe. It's not the way Unix traditionally does this, though.
832 SYSCALL_DEFINE2(pipe2, int __user *, fildes, int, flags)
834 struct file *files[2];
838 error = __do_pipe_flags(fd, files, flags);
840 if (unlikely(copy_to_user(fildes, fd, sizeof(fd)))) {
843 put_unused_fd(fd[0]);
844 put_unused_fd(fd[1]);
847 fd_install(fd[0], files[0]);
848 fd_install(fd[1], files[1]);
854 SYSCALL_DEFINE1(pipe, int __user *, fildes)
856 return sys_pipe2(fildes, 0);
859 static int wait_for_partner(struct pipe_inode_info *pipe, unsigned int *cnt)
863 while (cur == *cnt) {
865 if (signal_pending(current))
868 return cur == *cnt ? -ERESTARTSYS : 0;
871 static void wake_up_partner(struct pipe_inode_info *pipe)
873 wake_up_interruptible(&pipe->wait);
876 static int fifo_open(struct inode *inode, struct file *filp)
878 struct pipe_inode_info *pipe;
879 bool is_pipe = inode->i_sb->s_magic == PIPEFS_MAGIC;
884 spin_lock(&inode->i_lock);
886 pipe = inode->i_pipe;
888 spin_unlock(&inode->i_lock);
890 spin_unlock(&inode->i_lock);
891 pipe = alloc_pipe_info();
895 spin_lock(&inode->i_lock);
896 if (unlikely(inode->i_pipe)) {
897 inode->i_pipe->files++;
898 spin_unlock(&inode->i_lock);
899 free_pipe_info(pipe);
900 pipe = inode->i_pipe;
902 inode->i_pipe = pipe;
903 spin_unlock(&inode->i_lock);
906 filp->private_data = pipe;
907 /* OK, we have a pipe and it's pinned down */
911 /* We can only do regular read/write on fifos */
912 filp->f_mode &= (FMODE_READ | FMODE_WRITE);
914 switch (filp->f_mode) {
918 * POSIX.1 says that O_NONBLOCK means return with the FIFO
919 * opened, even when there is no process writing the FIFO.
922 if (pipe->readers++ == 0)
923 wake_up_partner(pipe);
925 if (!is_pipe && !pipe->writers) {
926 if ((filp->f_flags & O_NONBLOCK)) {
927 /* suppress POLLHUP until we have
929 filp->f_version = pipe->w_counter;
931 if (wait_for_partner(pipe, &pipe->w_counter))
940 * POSIX.1 says that O_NONBLOCK means return -1 with
941 * errno=ENXIO when there is no process reading the FIFO.
944 if (!is_pipe && (filp->f_flags & O_NONBLOCK) && !pipe->readers)
948 if (!pipe->writers++)
949 wake_up_partner(pipe);
951 if (!is_pipe && !pipe->readers) {
952 if (wait_for_partner(pipe, &pipe->r_counter))
957 case FMODE_READ | FMODE_WRITE:
960 * POSIX.1 leaves this case "undefined" when O_NONBLOCK is set.
961 * This implementation will NEVER block on a O_RDWR open, since
962 * the process can at least talk to itself.
969 if (pipe->readers == 1 || pipe->writers == 1)
970 wake_up_partner(pipe);
983 if (!--pipe->readers)
984 wake_up_interruptible(&pipe->wait);
989 if (!--pipe->writers)
990 wake_up_interruptible(&pipe->wait);
997 put_pipe_info(inode, pipe);
1001 const struct file_operations pipefifo_fops = {
1003 .llseek = no_llseek,
1004 .read_iter = pipe_read,
1005 .write_iter = pipe_write,
1007 .unlocked_ioctl = pipe_ioctl,
1008 .release = pipe_release,
1009 .fasync = pipe_fasync,
1013 * Allocate a new array of pipe buffers and copy the info over. Returns the
1014 * pipe size if successful, or return -ERROR on error.
1016 static long pipe_set_size(struct pipe_inode_info *pipe, unsigned long nr_pages)
1018 struct pipe_buffer *bufs;
1021 * We can shrink the pipe, if arg >= pipe->nrbufs. Since we don't
1022 * expect a lot of shrink+grow operations, just free and allocate
1023 * again like we would do for growing. If the pipe currently
1024 * contains more buffers than arg, then return busy.
1026 if (nr_pages < pipe->nrbufs)
1029 bufs = kcalloc(nr_pages, sizeof(*bufs),
1030 GFP_KERNEL_ACCOUNT | __GFP_NOWARN);
1031 if (unlikely(!bufs))
1035 * The pipe array wraps around, so just start the new one at zero
1036 * and adjust the indexes.
1042 tail = pipe->curbuf + pipe->nrbufs;
1043 if (tail < pipe->buffers)
1046 tail &= (pipe->buffers - 1);
1048 head = pipe->nrbufs - tail;
1050 memcpy(bufs, pipe->bufs + pipe->curbuf, head * sizeof(struct pipe_buffer));
1052 memcpy(bufs + head, pipe->bufs, tail * sizeof(struct pipe_buffer));
1055 account_pipe_buffers(pipe, pipe->buffers, nr_pages);
1059 pipe->buffers = nr_pages;
1060 return nr_pages * PAGE_SIZE;
1064 * Currently we rely on the pipe array holding a power-of-2 number
1067 static inline unsigned int round_pipe_size(unsigned int size)
1069 unsigned long nr_pages;
1071 nr_pages = (size + PAGE_SIZE - 1) >> PAGE_SHIFT;
1072 return roundup_pow_of_two(nr_pages) << PAGE_SHIFT;
1076 * This should work even if CONFIG_PROC_FS isn't set, as proc_dointvec_minmax
1077 * will return an error.
1079 int pipe_proc_fn(struct ctl_table *table, int write, void __user *buf,
1080 size_t *lenp, loff_t *ppos)
1084 ret = proc_dointvec_minmax(table, write, buf, lenp, ppos);
1085 if (ret < 0 || !write)
1088 pipe_max_size = round_pipe_size(pipe_max_size);
1093 * After the inode slimming patch, i_pipe/i_bdev/i_cdev share the same
1094 * location, so checking ->i_pipe is not enough to verify that this is a
1097 struct pipe_inode_info *get_pipe_info(struct file *file)
1099 return file->f_op == &pipefifo_fops ? file->private_data : NULL;
1102 long pipe_fcntl(struct file *file, unsigned int cmd, unsigned long arg)
1104 struct pipe_inode_info *pipe;
1107 pipe = get_pipe_info(file);
1114 case F_SETPIPE_SZ: {
1115 unsigned int size, nr_pages;
1117 size = round_pipe_size(arg);
1118 nr_pages = size >> PAGE_SHIFT;
1124 if (!capable(CAP_SYS_RESOURCE) && size > pipe_max_size) {
1127 } else if ((too_many_pipe_buffers_hard(pipe->user) ||
1128 too_many_pipe_buffers_soft(pipe->user)) &&
1129 !capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN)) {
1133 ret = pipe_set_size(pipe, nr_pages);
1137 ret = pipe->buffers * PAGE_SIZE;
1145 __pipe_unlock(pipe);
1149 static const struct super_operations pipefs_ops = {
1150 .destroy_inode = free_inode_nonrcu,
1151 .statfs = simple_statfs,
1155 * pipefs should _never_ be mounted by userland - too much of security hassle,
1156 * no real gain from having the whole whorehouse mounted. So we don't need
1157 * any operations on the root directory. However, we need a non-trivial
1158 * d_name - pipe: will go nicely and kill the special-casing in procfs.
1160 static struct dentry *pipefs_mount(struct file_system_type *fs_type,
1161 int flags, const char *dev_name, void *data)
1163 return mount_pseudo(fs_type, "pipe:", &pipefs_ops,
1164 &pipefs_dentry_operations, PIPEFS_MAGIC);
1167 static struct file_system_type pipe_fs_type = {
1169 .mount = pipefs_mount,
1170 .kill_sb = kill_anon_super,
1173 static int __init init_pipe_fs(void)
1175 int err = register_filesystem(&pipe_fs_type);
1178 pipe_mnt = kern_mount(&pipe_fs_type);
1179 if (IS_ERR(pipe_mnt)) {
1180 err = PTR_ERR(pipe_mnt);
1181 unregister_filesystem(&pipe_fs_type);
1187 fs_initcall(init_pipe_fs);