HID: usbhid: fix out-of-bounds bug
[linux/fpc-iii.git] / fs / pipe.c
blobe3ba6c3a1743024d365b31c0deb7af5c66ec088a
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>
24 #include <linux/aio.h>
26 #include <asm/uaccess.h>
27 #include <asm/ioctls.h>
29 #include "internal.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
50 * allocated memory.
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)
65 if (pipe->files)
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)
80 if (pipe->files)
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);
100 if (pipe1 < pipe2) {
101 pipe_lock_nested(pipe1, I_MUTEX_PARENT);
102 pipe_lock_nested(pipe2, I_MUTEX_CHILD);
103 } else {
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)
112 DEFINE_WAIT(wait);
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);
119 pipe_unlock(pipe);
120 schedule();
121 finish_wait(&pipe->wait, &wait);
122 pipe_lock(pipe);
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;
137 else
138 page_cache_release(page);
142 * generic_pipe_buf_steal - attempt to take ownership of a &pipe_buffer
143 * @pipe: the pipe that the buffer belongs to
144 * @buf: the buffer to attempt to steal
146 * Description:
147 * This function attempts to steal the &struct page attached to
148 * @buf. If successful, this function returns 0 and returns with
149 * the page locked. The caller may then reuse the page for whatever
150 * he wishes; the typical use is insertion into a different file
151 * page cache.
153 int generic_pipe_buf_steal(struct pipe_inode_info *pipe,
154 struct pipe_buffer *buf)
156 struct page *page = buf->page;
159 * A reference of one is golden, that means that the owner of this
160 * page is the only one holding a reference to it. lock the page
161 * and return OK.
163 if (page_count(page) == 1) {
164 lock_page(page);
165 return 0;
168 return 1;
170 EXPORT_SYMBOL(generic_pipe_buf_steal);
173 * generic_pipe_buf_get - get a reference to a &struct pipe_buffer
174 * @pipe: the pipe that the buffer belongs to
175 * @buf: the buffer to get a reference to
177 * Description:
178 * This function grabs an extra reference to @buf. It's used in
179 * in the tee() system call, when we duplicate the buffers in one
180 * pipe into another.
182 void generic_pipe_buf_get(struct pipe_inode_info *pipe, struct pipe_buffer *buf)
184 page_cache_get(buf->page);
186 EXPORT_SYMBOL(generic_pipe_buf_get);
189 * generic_pipe_buf_confirm - verify contents of the pipe buffer
190 * @info: the pipe that the buffer belongs to
191 * @buf: the buffer to confirm
193 * Description:
194 * This function does nothing, because the generic pipe code uses
195 * pages that are always good when inserted into the pipe.
197 int generic_pipe_buf_confirm(struct pipe_inode_info *info,
198 struct pipe_buffer *buf)
200 return 0;
202 EXPORT_SYMBOL(generic_pipe_buf_confirm);
205 * generic_pipe_buf_release - put a reference to a &struct pipe_buffer
206 * @pipe: the pipe that the buffer belongs to
207 * @buf: the buffer to put a reference to
209 * Description:
210 * This function releases a reference to @buf.
212 void generic_pipe_buf_release(struct pipe_inode_info *pipe,
213 struct pipe_buffer *buf)
215 page_cache_release(buf->page);
217 EXPORT_SYMBOL(generic_pipe_buf_release);
219 static const struct pipe_buf_operations anon_pipe_buf_ops = {
220 .can_merge = 1,
221 .confirm = generic_pipe_buf_confirm,
222 .release = anon_pipe_buf_release,
223 .steal = generic_pipe_buf_steal,
224 .get = generic_pipe_buf_get,
227 static const struct pipe_buf_operations packet_pipe_buf_ops = {
228 .can_merge = 0,
229 .confirm = generic_pipe_buf_confirm,
230 .release = anon_pipe_buf_release,
231 .steal = generic_pipe_buf_steal,
232 .get = generic_pipe_buf_get,
235 static ssize_t
236 pipe_read(struct kiocb *iocb, struct iov_iter *to)
238 size_t total_len = iov_iter_count(to);
239 struct file *filp = iocb->ki_filp;
240 struct pipe_inode_info *pipe = filp->private_data;
241 int do_wakeup;
242 ssize_t ret;
244 /* Null read succeeds. */
245 if (unlikely(total_len == 0))
246 return 0;
248 do_wakeup = 0;
249 ret = 0;
250 __pipe_lock(pipe);
251 for (;;) {
252 int bufs = pipe->nrbufs;
253 if (bufs) {
254 int curbuf = pipe->curbuf;
255 struct pipe_buffer *buf = pipe->bufs + curbuf;
256 const struct pipe_buf_operations *ops = buf->ops;
257 size_t chars = buf->len;
258 size_t written;
259 int error;
261 if (chars > total_len)
262 chars = total_len;
264 error = ops->confirm(pipe, buf);
265 if (error) {
266 if (!ret)
267 ret = error;
268 break;
271 written = copy_page_to_iter(buf->page, buf->offset, chars, to);
272 if (unlikely(written < chars)) {
273 if (!ret)
274 ret = -EFAULT;
275 break;
277 ret += chars;
278 buf->offset += chars;
279 buf->len -= chars;
281 /* Was it a packet buffer? Clean up and exit */
282 if (buf->flags & PIPE_BUF_FLAG_PACKET) {
283 total_len = chars;
284 buf->len = 0;
287 if (!buf->len) {
288 buf->ops = NULL;
289 ops->release(pipe, buf);
290 curbuf = (curbuf + 1) & (pipe->buffers - 1);
291 pipe->curbuf = curbuf;
292 pipe->nrbufs = --bufs;
293 do_wakeup = 1;
295 total_len -= chars;
296 if (!total_len)
297 break; /* common path: read succeeded */
299 if (bufs) /* More to do? */
300 continue;
301 if (!pipe->writers)
302 break;
303 if (!pipe->waiting_writers) {
304 /* syscall merging: Usually we must not sleep
305 * if O_NONBLOCK is set, or if we got some data.
306 * But if a writer sleeps in kernel space, then
307 * we can wait for that data without violating POSIX.
309 if (ret)
310 break;
311 if (filp->f_flags & O_NONBLOCK) {
312 ret = -EAGAIN;
313 break;
316 if (signal_pending(current)) {
317 if (!ret)
318 ret = -ERESTARTSYS;
319 break;
321 if (do_wakeup) {
322 wake_up_interruptible_sync_poll(&pipe->wait, POLLOUT | POLLWRNORM);
323 kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
325 pipe_wait(pipe);
327 __pipe_unlock(pipe);
329 /* Signal writers asynchronously that there is more room. */
330 if (do_wakeup) {
331 wake_up_interruptible_sync_poll(&pipe->wait, POLLOUT | POLLWRNORM);
332 kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
334 if (ret > 0)
335 file_accessed(filp);
336 return ret;
339 static inline int is_packetized(struct file *file)
341 return (file->f_flags & O_DIRECT) != 0;
344 static ssize_t
345 pipe_write(struct kiocb *iocb, struct iov_iter *from)
347 struct file *filp = iocb->ki_filp;
348 struct pipe_inode_info *pipe = filp->private_data;
349 ssize_t ret = 0;
350 int do_wakeup = 0;
351 size_t total_len = iov_iter_count(from);
352 ssize_t chars;
354 /* Null write succeeds. */
355 if (unlikely(total_len == 0))
356 return 0;
358 __pipe_lock(pipe);
360 if (!pipe->readers) {
361 send_sig(SIGPIPE, current, 0);
362 ret = -EPIPE;
363 goto out;
366 /* We try to merge small writes */
367 chars = total_len & (PAGE_SIZE-1); /* size of the last buffer */
368 if (pipe->nrbufs && chars != 0) {
369 int lastbuf = (pipe->curbuf + pipe->nrbufs - 1) &
370 (pipe->buffers - 1);
371 struct pipe_buffer *buf = pipe->bufs + lastbuf;
372 const struct pipe_buf_operations *ops = buf->ops;
373 int offset = buf->offset + buf->len;
375 if (ops->can_merge && offset + chars <= PAGE_SIZE) {
376 int error = ops->confirm(pipe, buf);
377 if (error)
378 goto out;
380 ret = copy_page_from_iter(buf->page, offset, chars, from);
381 if (unlikely(ret < chars)) {
382 error = -EFAULT;
383 goto out;
385 do_wakeup = 1;
386 buf->len += chars;
387 ret = chars;
388 if (!iov_iter_count(from))
389 goto out;
393 for (;;) {
394 int bufs;
396 if (!pipe->readers) {
397 send_sig(SIGPIPE, current, 0);
398 if (!ret)
399 ret = -EPIPE;
400 break;
402 bufs = pipe->nrbufs;
403 if (bufs < pipe->buffers) {
404 int newbuf = (pipe->curbuf + bufs) & (pipe->buffers-1);
405 struct pipe_buffer *buf = pipe->bufs + newbuf;
406 struct page *page = pipe->tmp_page;
407 int copied;
409 if (!page) {
410 page = alloc_page(GFP_HIGHUSER);
411 if (unlikely(!page)) {
412 ret = ret ? : -ENOMEM;
413 break;
415 pipe->tmp_page = page;
417 /* Always wake up, even if the copy fails. Otherwise
418 * we lock up (O_NONBLOCK-)readers that sleep due to
419 * syscall merging.
420 * FIXME! Is this really true?
422 do_wakeup = 1;
423 copied = copy_page_from_iter(page, 0, PAGE_SIZE, from);
424 if (unlikely(copied < PAGE_SIZE && iov_iter_count(from))) {
425 if (!ret)
426 ret = -EFAULT;
427 break;
429 ret += copied;
431 /* Insert it into the buffer array */
432 buf->page = page;
433 buf->ops = &anon_pipe_buf_ops;
434 buf->offset = 0;
435 buf->len = copied;
436 buf->flags = 0;
437 if (is_packetized(filp)) {
438 buf->ops = &packet_pipe_buf_ops;
439 buf->flags = PIPE_BUF_FLAG_PACKET;
441 pipe->nrbufs = ++bufs;
442 pipe->tmp_page = NULL;
444 if (!iov_iter_count(from))
445 break;
447 if (bufs < pipe->buffers)
448 continue;
449 if (filp->f_flags & O_NONBLOCK) {
450 if (!ret)
451 ret = -EAGAIN;
452 break;
454 if (signal_pending(current)) {
455 if (!ret)
456 ret = -ERESTARTSYS;
457 break;
459 if (do_wakeup) {
460 wake_up_interruptible_sync_poll(&pipe->wait, POLLIN | POLLRDNORM);
461 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
462 do_wakeup = 0;
464 pipe->waiting_writers++;
465 pipe_wait(pipe);
466 pipe->waiting_writers--;
468 out:
469 __pipe_unlock(pipe);
470 if (do_wakeup) {
471 wake_up_interruptible_sync_poll(&pipe->wait, POLLIN | POLLRDNORM);
472 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
474 if (ret > 0 && sb_start_write_trylock(file_inode(filp)->i_sb)) {
475 int err = file_update_time(filp);
476 if (err)
477 ret = err;
478 sb_end_write(file_inode(filp)->i_sb);
480 return ret;
483 static long pipe_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
485 struct pipe_inode_info *pipe = filp->private_data;
486 int count, buf, nrbufs;
488 switch (cmd) {
489 case FIONREAD:
490 __pipe_lock(pipe);
491 count = 0;
492 buf = pipe->curbuf;
493 nrbufs = pipe->nrbufs;
494 while (--nrbufs >= 0) {
495 count += pipe->bufs[buf].len;
496 buf = (buf+1) & (pipe->buffers - 1);
498 __pipe_unlock(pipe);
500 return put_user(count, (int __user *)arg);
501 default:
502 return -ENOIOCTLCMD;
506 /* No kernel lock held - fine */
507 static unsigned int
508 pipe_poll(struct file *filp, poll_table *wait)
510 unsigned int mask;
511 struct pipe_inode_info *pipe = filp->private_data;
512 int nrbufs;
514 poll_wait(filp, &pipe->wait, wait);
516 /* Reading only -- no need for acquiring the semaphore. */
517 nrbufs = pipe->nrbufs;
518 mask = 0;
519 if (filp->f_mode & FMODE_READ) {
520 mask = (nrbufs > 0) ? POLLIN | POLLRDNORM : 0;
521 if (!pipe->writers && filp->f_version != pipe->w_counter)
522 mask |= POLLHUP;
525 if (filp->f_mode & FMODE_WRITE) {
526 mask |= (nrbufs < pipe->buffers) ? POLLOUT | POLLWRNORM : 0;
528 * Most Unices do not set POLLERR for FIFOs but on Linux they
529 * behave exactly like pipes for poll().
531 if (!pipe->readers)
532 mask |= POLLERR;
535 return mask;
538 static void put_pipe_info(struct inode *inode, struct pipe_inode_info *pipe)
540 int kill = 0;
542 spin_lock(&inode->i_lock);
543 if (!--pipe->files) {
544 inode->i_pipe = NULL;
545 kill = 1;
547 spin_unlock(&inode->i_lock);
549 if (kill)
550 free_pipe_info(pipe);
553 static int
554 pipe_release(struct inode *inode, struct file *file)
556 struct pipe_inode_info *pipe = file->private_data;
558 __pipe_lock(pipe);
559 if (file->f_mode & FMODE_READ)
560 pipe->readers--;
561 if (file->f_mode & FMODE_WRITE)
562 pipe->writers--;
564 if (pipe->readers || pipe->writers) {
565 wake_up_interruptible_sync_poll(&pipe->wait, POLLIN | POLLOUT | POLLRDNORM | POLLWRNORM | POLLERR | POLLHUP);
566 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
567 kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
569 __pipe_unlock(pipe);
571 put_pipe_info(inode, pipe);
572 return 0;
575 static int
576 pipe_fasync(int fd, struct file *filp, int on)
578 struct pipe_inode_info *pipe = filp->private_data;
579 int retval = 0;
581 __pipe_lock(pipe);
582 if (filp->f_mode & FMODE_READ)
583 retval = fasync_helper(fd, filp, on, &pipe->fasync_readers);
584 if ((filp->f_mode & FMODE_WRITE) && retval >= 0) {
585 retval = fasync_helper(fd, filp, on, &pipe->fasync_writers);
586 if (retval < 0 && (filp->f_mode & FMODE_READ))
587 /* this can happen only if on == T */
588 fasync_helper(-1, filp, 0, &pipe->fasync_readers);
590 __pipe_unlock(pipe);
591 return retval;
594 static void account_pipe_buffers(struct pipe_inode_info *pipe,
595 unsigned long old, unsigned long new)
597 atomic_long_add(new - old, &pipe->user->pipe_bufs);
600 static bool too_many_pipe_buffers_soft(struct user_struct *user)
602 return pipe_user_pages_soft &&
603 atomic_long_read(&user->pipe_bufs) >= pipe_user_pages_soft;
606 static bool too_many_pipe_buffers_hard(struct user_struct *user)
608 return pipe_user_pages_hard &&
609 atomic_long_read(&user->pipe_bufs) >= pipe_user_pages_hard;
612 struct pipe_inode_info *alloc_pipe_info(void)
614 struct pipe_inode_info *pipe;
616 pipe = kzalloc(sizeof(struct pipe_inode_info), GFP_KERNEL);
617 if (pipe) {
618 unsigned long pipe_bufs = PIPE_DEF_BUFFERS;
619 struct user_struct *user = get_current_user();
621 if (!too_many_pipe_buffers_hard(user)) {
622 if (too_many_pipe_buffers_soft(user))
623 pipe_bufs = 1;
624 pipe->bufs = kzalloc(sizeof(struct pipe_buffer) * pipe_bufs, GFP_KERNEL);
627 if (pipe->bufs) {
628 init_waitqueue_head(&pipe->wait);
629 pipe->r_counter = pipe->w_counter = 1;
630 pipe->buffers = pipe_bufs;
631 pipe->user = user;
632 account_pipe_buffers(pipe, 0, pipe_bufs);
633 mutex_init(&pipe->mutex);
634 return pipe;
636 free_uid(user);
637 kfree(pipe);
640 return NULL;
643 void free_pipe_info(struct pipe_inode_info *pipe)
645 int i;
647 account_pipe_buffers(pipe, pipe->buffers, 0);
648 free_uid(pipe->user);
649 for (i = 0; i < pipe->buffers; i++) {
650 struct pipe_buffer *buf = pipe->bufs + i;
651 if (buf->ops)
652 buf->ops->release(pipe, buf);
654 if (pipe->tmp_page)
655 __free_page(pipe->tmp_page);
656 kfree(pipe->bufs);
657 kfree(pipe);
660 static struct vfsmount *pipe_mnt __read_mostly;
663 * pipefs_dname() is called from d_path().
665 static char *pipefs_dname(struct dentry *dentry, char *buffer, int buflen)
667 return dynamic_dname(dentry, buffer, buflen, "pipe:[%lu]",
668 dentry->d_inode->i_ino);
671 static const struct dentry_operations pipefs_dentry_operations = {
672 .d_dname = pipefs_dname,
675 static struct inode * get_pipe_inode(void)
677 struct inode *inode = new_inode_pseudo(pipe_mnt->mnt_sb);
678 struct pipe_inode_info *pipe;
680 if (!inode)
681 goto fail_inode;
683 inode->i_ino = get_next_ino();
685 pipe = alloc_pipe_info();
686 if (!pipe)
687 goto fail_iput;
689 inode->i_pipe = pipe;
690 pipe->files = 2;
691 pipe->readers = pipe->writers = 1;
692 inode->i_fop = &pipefifo_fops;
695 * Mark the inode dirty from the very beginning,
696 * that way it will never be moved to the dirty
697 * list because "mark_inode_dirty()" will think
698 * that it already _is_ on the dirty list.
700 inode->i_state = I_DIRTY;
701 inode->i_mode = S_IFIFO | S_IRUSR | S_IWUSR;
702 inode->i_uid = current_fsuid();
703 inode->i_gid = current_fsgid();
704 inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME;
706 return inode;
708 fail_iput:
709 iput(inode);
711 fail_inode:
712 return NULL;
715 int create_pipe_files(struct file **res, int flags)
717 int err;
718 struct inode *inode = get_pipe_inode();
719 struct file *f;
720 struct path path;
721 static struct qstr name = { .name = "" };
723 if (!inode)
724 return -ENFILE;
726 err = -ENOMEM;
727 path.dentry = d_alloc_pseudo(pipe_mnt->mnt_sb, &name);
728 if (!path.dentry)
729 goto err_inode;
730 path.mnt = mntget(pipe_mnt);
732 d_instantiate(path.dentry, inode);
734 err = -ENFILE;
735 f = alloc_file(&path, FMODE_WRITE, &pipefifo_fops);
736 if (IS_ERR(f))
737 goto err_dentry;
739 f->f_flags = O_WRONLY | (flags & (O_NONBLOCK | O_DIRECT));
740 f->private_data = inode->i_pipe;
742 res[0] = alloc_file(&path, FMODE_READ, &pipefifo_fops);
743 if (IS_ERR(res[0]))
744 goto err_file;
746 path_get(&path);
747 res[0]->private_data = inode->i_pipe;
748 res[0]->f_flags = O_RDONLY | (flags & O_NONBLOCK);
749 res[1] = f;
750 return 0;
752 err_file:
753 put_filp(f);
754 err_dentry:
755 free_pipe_info(inode->i_pipe);
756 path_put(&path);
757 return err;
759 err_inode:
760 free_pipe_info(inode->i_pipe);
761 iput(inode);
762 return err;
765 static int __do_pipe_flags(int *fd, struct file **files, int flags)
767 int error;
768 int fdw, fdr;
770 if (flags & ~(O_CLOEXEC | O_NONBLOCK | O_DIRECT))
771 return -EINVAL;
773 error = create_pipe_files(files, flags);
774 if (error)
775 return error;
777 error = get_unused_fd_flags(flags);
778 if (error < 0)
779 goto err_read_pipe;
780 fdr = error;
782 error = get_unused_fd_flags(flags);
783 if (error < 0)
784 goto err_fdr;
785 fdw = error;
787 audit_fd_pair(fdr, fdw);
788 fd[0] = fdr;
789 fd[1] = fdw;
790 return 0;
792 err_fdr:
793 put_unused_fd(fdr);
794 err_read_pipe:
795 fput(files[0]);
796 fput(files[1]);
797 return error;
800 int do_pipe_flags(int *fd, int flags)
802 struct file *files[2];
803 int error = __do_pipe_flags(fd, files, flags);
804 if (!error) {
805 fd_install(fd[0], files[0]);
806 fd_install(fd[1], files[1]);
808 return error;
812 * sys_pipe() is the normal C calling standard for creating
813 * a pipe. It's not the way Unix traditionally does this, though.
815 SYSCALL_DEFINE2(pipe2, int __user *, fildes, int, flags)
817 struct file *files[2];
818 int fd[2];
819 int error;
821 error = __do_pipe_flags(fd, files, flags);
822 if (!error) {
823 if (unlikely(copy_to_user(fildes, fd, sizeof(fd)))) {
824 fput(files[0]);
825 fput(files[1]);
826 put_unused_fd(fd[0]);
827 put_unused_fd(fd[1]);
828 error = -EFAULT;
829 } else {
830 fd_install(fd[0], files[0]);
831 fd_install(fd[1], files[1]);
834 return error;
837 SYSCALL_DEFINE1(pipe, int __user *, fildes)
839 return sys_pipe2(fildes, 0);
842 static int wait_for_partner(struct pipe_inode_info *pipe, unsigned int *cnt)
844 int cur = *cnt;
846 while (cur == *cnt) {
847 pipe_wait(pipe);
848 if (signal_pending(current))
849 break;
851 return cur == *cnt ? -ERESTARTSYS : 0;
854 static void wake_up_partner(struct pipe_inode_info *pipe)
856 wake_up_interruptible(&pipe->wait);
859 static int fifo_open(struct inode *inode, struct file *filp)
861 struct pipe_inode_info *pipe;
862 bool is_pipe = inode->i_sb->s_magic == PIPEFS_MAGIC;
863 int ret;
865 filp->f_version = 0;
867 spin_lock(&inode->i_lock);
868 if (inode->i_pipe) {
869 pipe = inode->i_pipe;
870 pipe->files++;
871 spin_unlock(&inode->i_lock);
872 } else {
873 spin_unlock(&inode->i_lock);
874 pipe = alloc_pipe_info();
875 if (!pipe)
876 return -ENOMEM;
877 pipe->files = 1;
878 spin_lock(&inode->i_lock);
879 if (unlikely(inode->i_pipe)) {
880 inode->i_pipe->files++;
881 spin_unlock(&inode->i_lock);
882 free_pipe_info(pipe);
883 pipe = inode->i_pipe;
884 } else {
885 inode->i_pipe = pipe;
886 spin_unlock(&inode->i_lock);
889 filp->private_data = pipe;
890 /* OK, we have a pipe and it's pinned down */
892 __pipe_lock(pipe);
894 /* We can only do regular read/write on fifos */
895 filp->f_mode &= (FMODE_READ | FMODE_WRITE);
897 switch (filp->f_mode) {
898 case FMODE_READ:
900 * O_RDONLY
901 * POSIX.1 says that O_NONBLOCK means return with the FIFO
902 * opened, even when there is no process writing the FIFO.
904 pipe->r_counter++;
905 if (pipe->readers++ == 0)
906 wake_up_partner(pipe);
908 if (!is_pipe && !pipe->writers) {
909 if ((filp->f_flags & O_NONBLOCK)) {
910 /* suppress POLLHUP until we have
911 * seen a writer */
912 filp->f_version = pipe->w_counter;
913 } else {
914 if (wait_for_partner(pipe, &pipe->w_counter))
915 goto err_rd;
918 break;
920 case FMODE_WRITE:
922 * O_WRONLY
923 * POSIX.1 says that O_NONBLOCK means return -1 with
924 * errno=ENXIO when there is no process reading the FIFO.
926 ret = -ENXIO;
927 if (!is_pipe && (filp->f_flags & O_NONBLOCK) && !pipe->readers)
928 goto err;
930 pipe->w_counter++;
931 if (!pipe->writers++)
932 wake_up_partner(pipe);
934 if (!is_pipe && !pipe->readers) {
935 if (wait_for_partner(pipe, &pipe->r_counter))
936 goto err_wr;
938 break;
940 case FMODE_READ | FMODE_WRITE:
942 * O_RDWR
943 * POSIX.1 leaves this case "undefined" when O_NONBLOCK is set.
944 * This implementation will NEVER block on a O_RDWR open, since
945 * the process can at least talk to itself.
948 pipe->readers++;
949 pipe->writers++;
950 pipe->r_counter++;
951 pipe->w_counter++;
952 if (pipe->readers == 1 || pipe->writers == 1)
953 wake_up_partner(pipe);
954 break;
956 default:
957 ret = -EINVAL;
958 goto err;
961 /* Ok! */
962 __pipe_unlock(pipe);
963 return 0;
965 err_rd:
966 if (!--pipe->readers)
967 wake_up_interruptible(&pipe->wait);
968 ret = -ERESTARTSYS;
969 goto err;
971 err_wr:
972 if (!--pipe->writers)
973 wake_up_interruptible(&pipe->wait);
974 ret = -ERESTARTSYS;
975 goto err;
977 err:
978 __pipe_unlock(pipe);
980 put_pipe_info(inode, pipe);
981 return ret;
984 const struct file_operations pipefifo_fops = {
985 .open = fifo_open,
986 .llseek = no_llseek,
987 .read = new_sync_read,
988 .read_iter = pipe_read,
989 .write = new_sync_write,
990 .write_iter = pipe_write,
991 .poll = pipe_poll,
992 .unlocked_ioctl = pipe_ioctl,
993 .release = pipe_release,
994 .fasync = pipe_fasync,
998 * Allocate a new array of pipe buffers and copy the info over. Returns the
999 * pipe size if successful, or return -ERROR on error.
1001 static long pipe_set_size(struct pipe_inode_info *pipe, unsigned long nr_pages)
1003 struct pipe_buffer *bufs;
1006 * We can shrink the pipe, if arg >= pipe->nrbufs. Since we don't
1007 * expect a lot of shrink+grow operations, just free and allocate
1008 * again like we would do for growing. If the pipe currently
1009 * contains more buffers than arg, then return busy.
1011 if (nr_pages < pipe->nrbufs)
1012 return -EBUSY;
1014 bufs = kcalloc(nr_pages, sizeof(*bufs), GFP_KERNEL | __GFP_NOWARN);
1015 if (unlikely(!bufs))
1016 return -ENOMEM;
1019 * The pipe array wraps around, so just start the new one at zero
1020 * and adjust the indexes.
1022 if (pipe->nrbufs) {
1023 unsigned int tail;
1024 unsigned int head;
1026 tail = pipe->curbuf + pipe->nrbufs;
1027 if (tail < pipe->buffers)
1028 tail = 0;
1029 else
1030 tail &= (pipe->buffers - 1);
1032 head = pipe->nrbufs - tail;
1033 if (head)
1034 memcpy(bufs, pipe->bufs + pipe->curbuf, head * sizeof(struct pipe_buffer));
1035 if (tail)
1036 memcpy(bufs + head, pipe->bufs, tail * sizeof(struct pipe_buffer));
1039 account_pipe_buffers(pipe, pipe->buffers, nr_pages);
1040 pipe->curbuf = 0;
1041 kfree(pipe->bufs);
1042 pipe->bufs = bufs;
1043 pipe->buffers = nr_pages;
1044 return nr_pages * PAGE_SIZE;
1048 * Currently we rely on the pipe array holding a power-of-2 number
1049 * of pages.
1051 static inline unsigned int round_pipe_size(unsigned int size)
1053 unsigned long nr_pages;
1055 nr_pages = (size + PAGE_SIZE - 1) >> PAGE_SHIFT;
1056 return roundup_pow_of_two(nr_pages) << PAGE_SHIFT;
1060 * This should work even if CONFIG_PROC_FS isn't set, as proc_dointvec_minmax
1061 * will return an error.
1063 int pipe_proc_fn(struct ctl_table *table, int write, void __user *buf,
1064 size_t *lenp, loff_t *ppos)
1066 int ret;
1068 ret = proc_dointvec_minmax(table, write, buf, lenp, ppos);
1069 if (ret < 0 || !write)
1070 return ret;
1072 pipe_max_size = round_pipe_size(pipe_max_size);
1073 return ret;
1077 * After the inode slimming patch, i_pipe/i_bdev/i_cdev share the same
1078 * location, so checking ->i_pipe is not enough to verify that this is a
1079 * pipe.
1081 struct pipe_inode_info *get_pipe_info(struct file *file)
1083 return file->f_op == &pipefifo_fops ? file->private_data : NULL;
1086 long pipe_fcntl(struct file *file, unsigned int cmd, unsigned long arg)
1088 struct pipe_inode_info *pipe;
1089 long ret;
1091 pipe = get_pipe_info(file);
1092 if (!pipe)
1093 return -EBADF;
1095 __pipe_lock(pipe);
1097 switch (cmd) {
1098 case F_SETPIPE_SZ: {
1099 unsigned int size, nr_pages;
1101 size = round_pipe_size(arg);
1102 nr_pages = size >> PAGE_SHIFT;
1104 ret = -EINVAL;
1105 if (!nr_pages)
1106 goto out;
1108 if (!capable(CAP_SYS_RESOURCE) && size > pipe_max_size) {
1109 ret = -EPERM;
1110 goto out;
1111 } else if ((too_many_pipe_buffers_hard(pipe->user) ||
1112 too_many_pipe_buffers_soft(pipe->user)) &&
1113 !capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN)) {
1114 ret = -EPERM;
1115 goto out;
1117 ret = pipe_set_size(pipe, nr_pages);
1118 break;
1120 case F_GETPIPE_SZ:
1121 ret = pipe->buffers * PAGE_SIZE;
1122 break;
1123 default:
1124 ret = -EINVAL;
1125 break;
1128 out:
1129 __pipe_unlock(pipe);
1130 return ret;
1133 static const struct super_operations pipefs_ops = {
1134 .destroy_inode = free_inode_nonrcu,
1135 .statfs = simple_statfs,
1139 * pipefs should _never_ be mounted by userland - too much of security hassle,
1140 * no real gain from having the whole whorehouse mounted. So we don't need
1141 * any operations on the root directory. However, we need a non-trivial
1142 * d_name - pipe: will go nicely and kill the special-casing in procfs.
1144 static struct dentry *pipefs_mount(struct file_system_type *fs_type,
1145 int flags, const char *dev_name, void *data)
1147 return mount_pseudo(fs_type, "pipe:", &pipefs_ops,
1148 &pipefs_dentry_operations, PIPEFS_MAGIC);
1151 static struct file_system_type pipe_fs_type = {
1152 .name = "pipefs",
1153 .mount = pipefs_mount,
1154 .kill_sb = kill_anon_super,
1157 static int __init init_pipe_fs(void)
1159 int err = register_filesystem(&pipe_fs_type);
1161 if (!err) {
1162 pipe_mnt = kern_mount(&pipe_fs_type);
1163 if (IS_ERR(pipe_mnt)) {
1164 err = PTR_ERR(pipe_mnt);
1165 unregister_filesystem(&pipe_fs_type);
1168 return err;
1171 fs_initcall(init_pipe_fs);