Loading...
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);
1/*
2 * linux/fs/pipe.c
3 *
4 * Copyright (C) 1991, 1992, 1999 Linus Torvalds
5 */
6
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
25#include <asm/uaccess.h>
26#include <asm/ioctls.h>
27
28/*
29 * The max size that a non-root user is allowed to grow the pipe. Can
30 * be set by root in /proc/sys/fs/pipe-max-size
31 */
32unsigned int pipe_max_size = 1048576;
33
34/*
35 * Minimum pipe size, as required by POSIX
36 */
37unsigned int pipe_min_size = PAGE_SIZE;
38
39/*
40 * We use a start+len construction, which provides full use of the
41 * allocated memory.
42 * -- Florian Coosmann (FGC)
43 *
44 * Reads with count = 0 should always return 0.
45 * -- Julian Bradfield 1999-06-07.
46 *
47 * FIFOs and Pipes now generate SIGIO for both readers and writers.
48 * -- Jeremy Elson <jelson@circlemud.org> 2001-08-16
49 *
50 * pipe_read & write cleanup
51 * -- Manfred Spraul <manfred@colorfullife.com> 2002-05-09
52 */
53
54static void pipe_lock_nested(struct pipe_inode_info *pipe, int subclass)
55{
56 if (pipe->inode)
57 mutex_lock_nested(&pipe->inode->i_mutex, subclass);
58}
59
60void pipe_lock(struct pipe_inode_info *pipe)
61{
62 /*
63 * pipe_lock() nests non-pipe inode locks (for writing to a file)
64 */
65 pipe_lock_nested(pipe, I_MUTEX_PARENT);
66}
67EXPORT_SYMBOL(pipe_lock);
68
69void pipe_unlock(struct pipe_inode_info *pipe)
70{
71 if (pipe->inode)
72 mutex_unlock(&pipe->inode->i_mutex);
73}
74EXPORT_SYMBOL(pipe_unlock);
75
76void pipe_double_lock(struct pipe_inode_info *pipe1,
77 struct pipe_inode_info *pipe2)
78{
79 BUG_ON(pipe1 == pipe2);
80
81 if (pipe1 < pipe2) {
82 pipe_lock_nested(pipe1, I_MUTEX_PARENT);
83 pipe_lock_nested(pipe2, I_MUTEX_CHILD);
84 } else {
85 pipe_lock_nested(pipe2, I_MUTEX_PARENT);
86 pipe_lock_nested(pipe1, I_MUTEX_CHILD);
87 }
88}
89
90/* Drop the inode semaphore and wait for a pipe event, atomically */
91void pipe_wait(struct pipe_inode_info *pipe)
92{
93 DEFINE_WAIT(wait);
94
95 /*
96 * Pipes are system-local resources, so sleeping on them
97 * is considered a noninteractive wait:
98 */
99 prepare_to_wait(&pipe->wait, &wait, TASK_INTERRUPTIBLE);
100 pipe_unlock(pipe);
101 schedule();
102 finish_wait(&pipe->wait, &wait);
103 pipe_lock(pipe);
104}
105
106static int
107pipe_iov_copy_from_user(void *to, struct iovec *iov, unsigned long len,
108 int atomic)
109{
110 unsigned long copy;
111
112 while (len > 0) {
113 while (!iov->iov_len)
114 iov++;
115 copy = min_t(unsigned long, len, iov->iov_len);
116
117 if (atomic) {
118 if (__copy_from_user_inatomic(to, iov->iov_base, copy))
119 return -EFAULT;
120 } else {
121 if (copy_from_user(to, iov->iov_base, copy))
122 return -EFAULT;
123 }
124 to += copy;
125 len -= copy;
126 iov->iov_base += copy;
127 iov->iov_len -= copy;
128 }
129 return 0;
130}
131
132static int
133pipe_iov_copy_to_user(struct iovec *iov, const void *from, unsigned long len,
134 int atomic)
135{
136 unsigned long copy;
137
138 while (len > 0) {
139 while (!iov->iov_len)
140 iov++;
141 copy = min_t(unsigned long, len, iov->iov_len);
142
143 if (atomic) {
144 if (__copy_to_user_inatomic(iov->iov_base, from, copy))
145 return -EFAULT;
146 } else {
147 if (copy_to_user(iov->iov_base, from, copy))
148 return -EFAULT;
149 }
150 from += copy;
151 len -= copy;
152 iov->iov_base += copy;
153 iov->iov_len -= copy;
154 }
155 return 0;
156}
157
158/*
159 * Attempt to pre-fault in the user memory, so we can use atomic copies.
160 * Returns the number of bytes not faulted in.
161 */
162static int iov_fault_in_pages_write(struct iovec *iov, unsigned long len)
163{
164 while (!iov->iov_len)
165 iov++;
166
167 while (len > 0) {
168 unsigned long this_len;
169
170 this_len = min_t(unsigned long, len, iov->iov_len);
171 if (fault_in_pages_writeable(iov->iov_base, this_len))
172 break;
173
174 len -= this_len;
175 iov++;
176 }
177
178 return len;
179}
180
181/*
182 * Pre-fault in the user memory, so we can use atomic copies.
183 */
184static void iov_fault_in_pages_read(struct iovec *iov, unsigned long len)
185{
186 while (!iov->iov_len)
187 iov++;
188
189 while (len > 0) {
190 unsigned long this_len;
191
192 this_len = min_t(unsigned long, len, iov->iov_len);
193 fault_in_pages_readable(iov->iov_base, this_len);
194 len -= this_len;
195 iov++;
196 }
197}
198
199static void anon_pipe_buf_release(struct pipe_inode_info *pipe,
200 struct pipe_buffer *buf)
201{
202 struct page *page = buf->page;
203
204 /*
205 * If nobody else uses this page, and we don't already have a
206 * temporary page, let's keep track of it as a one-deep
207 * allocation cache. (Otherwise just release our reference to it)
208 */
209 if (page_count(page) == 1 && !pipe->tmp_page)
210 pipe->tmp_page = page;
211 else
212 page_cache_release(page);
213}
214
215/**
216 * generic_pipe_buf_map - virtually map a pipe buffer
217 * @pipe: the pipe that the buffer belongs to
218 * @buf: the buffer that should be mapped
219 * @atomic: whether to use an atomic map
220 *
221 * Description:
222 * This function returns a kernel virtual address mapping for the
223 * pipe_buffer passed in @buf. If @atomic is set, an atomic map is provided
224 * and the caller has to be careful not to fault before calling
225 * the unmap function.
226 *
227 * Note that this function occupies KM_USER0 if @atomic != 0.
228 */
229void *generic_pipe_buf_map(struct pipe_inode_info *pipe,
230 struct pipe_buffer *buf, int atomic)
231{
232 if (atomic) {
233 buf->flags |= PIPE_BUF_FLAG_ATOMIC;
234 return kmap_atomic(buf->page);
235 }
236
237 return kmap(buf->page);
238}
239EXPORT_SYMBOL(generic_pipe_buf_map);
240
241/**
242 * generic_pipe_buf_unmap - unmap a previously mapped pipe buffer
243 * @pipe: the pipe that the buffer belongs to
244 * @buf: the buffer that should be unmapped
245 * @map_data: the data that the mapping function returned
246 *
247 * Description:
248 * This function undoes the mapping that ->map() provided.
249 */
250void generic_pipe_buf_unmap(struct pipe_inode_info *pipe,
251 struct pipe_buffer *buf, void *map_data)
252{
253 if (buf->flags & PIPE_BUF_FLAG_ATOMIC) {
254 buf->flags &= ~PIPE_BUF_FLAG_ATOMIC;
255 kunmap_atomic(map_data);
256 } else
257 kunmap(buf->page);
258}
259EXPORT_SYMBOL(generic_pipe_buf_unmap);
260
261/**
262 * generic_pipe_buf_steal - attempt to take ownership of a &pipe_buffer
263 * @pipe: the pipe that the buffer belongs to
264 * @buf: the buffer to attempt to steal
265 *
266 * Description:
267 * This function attempts to steal the &struct page attached to
268 * @buf. If successful, this function returns 0 and returns with
269 * the page locked. The caller may then reuse the page for whatever
270 * he wishes; the typical use is insertion into a different file
271 * page cache.
272 */
273int generic_pipe_buf_steal(struct pipe_inode_info *pipe,
274 struct pipe_buffer *buf)
275{
276 struct page *page = buf->page;
277
278 /*
279 * A reference of one is golden, that means that the owner of this
280 * page is the only one holding a reference to it. lock the page
281 * and return OK.
282 */
283 if (page_count(page) == 1) {
284 lock_page(page);
285 return 0;
286 }
287
288 return 1;
289}
290EXPORT_SYMBOL(generic_pipe_buf_steal);
291
292/**
293 * generic_pipe_buf_get - get a reference to a &struct pipe_buffer
294 * @pipe: the pipe that the buffer belongs to
295 * @buf: the buffer to get a reference to
296 *
297 * Description:
298 * This function grabs an extra reference to @buf. It's used in
299 * in the tee() system call, when we duplicate the buffers in one
300 * pipe into another.
301 */
302void generic_pipe_buf_get(struct pipe_inode_info *pipe, struct pipe_buffer *buf)
303{
304 page_cache_get(buf->page);
305}
306EXPORT_SYMBOL(generic_pipe_buf_get);
307
308/**
309 * generic_pipe_buf_confirm - verify contents of the pipe buffer
310 * @info: the pipe that the buffer belongs to
311 * @buf: the buffer to confirm
312 *
313 * Description:
314 * This function does nothing, because the generic pipe code uses
315 * pages that are always good when inserted into the pipe.
316 */
317int generic_pipe_buf_confirm(struct pipe_inode_info *info,
318 struct pipe_buffer *buf)
319{
320 return 0;
321}
322EXPORT_SYMBOL(generic_pipe_buf_confirm);
323
324/**
325 * generic_pipe_buf_release - put a reference to a &struct pipe_buffer
326 * @pipe: the pipe that the buffer belongs to
327 * @buf: the buffer to put a reference to
328 *
329 * Description:
330 * This function releases a reference to @buf.
331 */
332void generic_pipe_buf_release(struct pipe_inode_info *pipe,
333 struct pipe_buffer *buf)
334{
335 page_cache_release(buf->page);
336}
337EXPORT_SYMBOL(generic_pipe_buf_release);
338
339static const struct pipe_buf_operations anon_pipe_buf_ops = {
340 .can_merge = 1,
341 .map = generic_pipe_buf_map,
342 .unmap = generic_pipe_buf_unmap,
343 .confirm = generic_pipe_buf_confirm,
344 .release = anon_pipe_buf_release,
345 .steal = generic_pipe_buf_steal,
346 .get = generic_pipe_buf_get,
347};
348
349static const struct pipe_buf_operations packet_pipe_buf_ops = {
350 .can_merge = 0,
351 .map = generic_pipe_buf_map,
352 .unmap = generic_pipe_buf_unmap,
353 .confirm = generic_pipe_buf_confirm,
354 .release = anon_pipe_buf_release,
355 .steal = generic_pipe_buf_steal,
356 .get = generic_pipe_buf_get,
357};
358
359static ssize_t
360pipe_read(struct kiocb *iocb, const struct iovec *_iov,
361 unsigned long nr_segs, loff_t pos)
362{
363 struct file *filp = iocb->ki_filp;
364 struct inode *inode = filp->f_path.dentry->d_inode;
365 struct pipe_inode_info *pipe;
366 int do_wakeup;
367 ssize_t ret;
368 struct iovec *iov = (struct iovec *)_iov;
369 size_t total_len;
370
371 total_len = iov_length(iov, nr_segs);
372 /* Null read succeeds. */
373 if (unlikely(total_len == 0))
374 return 0;
375
376 do_wakeup = 0;
377 ret = 0;
378 mutex_lock(&inode->i_mutex);
379 pipe = inode->i_pipe;
380 for (;;) {
381 int bufs = pipe->nrbufs;
382 if (bufs) {
383 int curbuf = pipe->curbuf;
384 struct pipe_buffer *buf = pipe->bufs + curbuf;
385 const struct pipe_buf_operations *ops = buf->ops;
386 void *addr;
387 size_t chars = buf->len;
388 int error, atomic;
389
390 if (chars > total_len)
391 chars = total_len;
392
393 error = ops->confirm(pipe, buf);
394 if (error) {
395 if (!ret)
396 ret = error;
397 break;
398 }
399
400 atomic = !iov_fault_in_pages_write(iov, chars);
401redo:
402 addr = ops->map(pipe, buf, atomic);
403 error = pipe_iov_copy_to_user(iov, addr + buf->offset, chars, atomic);
404 ops->unmap(pipe, buf, addr);
405 if (unlikely(error)) {
406 /*
407 * Just retry with the slow path if we failed.
408 */
409 if (atomic) {
410 atomic = 0;
411 goto redo;
412 }
413 if (!ret)
414 ret = error;
415 break;
416 }
417 ret += chars;
418 buf->offset += chars;
419 buf->len -= chars;
420
421 /* Was it a packet buffer? Clean up and exit */
422 if (buf->flags & PIPE_BUF_FLAG_PACKET) {
423 total_len = chars;
424 buf->len = 0;
425 }
426
427 if (!buf->len) {
428 buf->ops = NULL;
429 ops->release(pipe, buf);
430 curbuf = (curbuf + 1) & (pipe->buffers - 1);
431 pipe->curbuf = curbuf;
432 pipe->nrbufs = --bufs;
433 do_wakeup = 1;
434 }
435 total_len -= chars;
436 if (!total_len)
437 break; /* common path: read succeeded */
438 }
439 if (bufs) /* More to do? */
440 continue;
441 if (!pipe->writers)
442 break;
443 if (!pipe->waiting_writers) {
444 /* syscall merging: Usually we must not sleep
445 * if O_NONBLOCK is set, or if we got some data.
446 * But if a writer sleeps in kernel space, then
447 * we can wait for that data without violating POSIX.
448 */
449 if (ret)
450 break;
451 if (filp->f_flags & O_NONBLOCK) {
452 ret = -EAGAIN;
453 break;
454 }
455 }
456 if (signal_pending(current)) {
457 if (!ret)
458 ret = -ERESTARTSYS;
459 break;
460 }
461 if (do_wakeup) {
462 wake_up_interruptible_sync_poll(&pipe->wait, POLLOUT | POLLWRNORM);
463 kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
464 }
465 pipe_wait(pipe);
466 }
467 mutex_unlock(&inode->i_mutex);
468
469 /* Signal writers asynchronously that there is more room. */
470 if (do_wakeup) {
471 wake_up_interruptible_sync_poll(&pipe->wait, POLLOUT | POLLWRNORM);
472 kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
473 }
474 if (ret > 0)
475 file_accessed(filp);
476 return ret;
477}
478
479static inline int is_packetized(struct file *file)
480{
481 return (file->f_flags & O_DIRECT) != 0;
482}
483
484static ssize_t
485pipe_write(struct kiocb *iocb, const struct iovec *_iov,
486 unsigned long nr_segs, loff_t ppos)
487{
488 struct file *filp = iocb->ki_filp;
489 struct inode *inode = filp->f_path.dentry->d_inode;
490 struct pipe_inode_info *pipe;
491 ssize_t ret;
492 int do_wakeup;
493 struct iovec *iov = (struct iovec *)_iov;
494 size_t total_len;
495 ssize_t chars;
496
497 total_len = iov_length(iov, nr_segs);
498 /* Null write succeeds. */
499 if (unlikely(total_len == 0))
500 return 0;
501
502 do_wakeup = 0;
503 ret = 0;
504 mutex_lock(&inode->i_mutex);
505 pipe = inode->i_pipe;
506
507 if (!pipe->readers) {
508 send_sig(SIGPIPE, current, 0);
509 ret = -EPIPE;
510 goto out;
511 }
512
513 /* We try to merge small writes */
514 chars = total_len & (PAGE_SIZE-1); /* size of the last buffer */
515 if (pipe->nrbufs && chars != 0) {
516 int lastbuf = (pipe->curbuf + pipe->nrbufs - 1) &
517 (pipe->buffers - 1);
518 struct pipe_buffer *buf = pipe->bufs + lastbuf;
519 const struct pipe_buf_operations *ops = buf->ops;
520 int offset = buf->offset + buf->len;
521
522 if (ops->can_merge && offset + chars <= PAGE_SIZE) {
523 int error, atomic = 1;
524 void *addr;
525
526 error = ops->confirm(pipe, buf);
527 if (error)
528 goto out;
529
530 iov_fault_in_pages_read(iov, chars);
531redo1:
532 addr = ops->map(pipe, buf, atomic);
533 error = pipe_iov_copy_from_user(offset + addr, iov,
534 chars, atomic);
535 ops->unmap(pipe, buf, addr);
536 ret = error;
537 do_wakeup = 1;
538 if (error) {
539 if (atomic) {
540 atomic = 0;
541 goto redo1;
542 }
543 goto out;
544 }
545 buf->len += chars;
546 total_len -= chars;
547 ret = chars;
548 if (!total_len)
549 goto out;
550 }
551 }
552
553 for (;;) {
554 int bufs;
555
556 if (!pipe->readers) {
557 send_sig(SIGPIPE, current, 0);
558 if (!ret)
559 ret = -EPIPE;
560 break;
561 }
562 bufs = pipe->nrbufs;
563 if (bufs < pipe->buffers) {
564 int newbuf = (pipe->curbuf + bufs) & (pipe->buffers-1);
565 struct pipe_buffer *buf = pipe->bufs + newbuf;
566 struct page *page = pipe->tmp_page;
567 char *src;
568 int error, atomic = 1;
569
570 if (!page) {
571 page = alloc_page(GFP_HIGHUSER);
572 if (unlikely(!page)) {
573 ret = ret ? : -ENOMEM;
574 break;
575 }
576 pipe->tmp_page = page;
577 }
578 /* Always wake up, even if the copy fails. Otherwise
579 * we lock up (O_NONBLOCK-)readers that sleep due to
580 * syscall merging.
581 * FIXME! Is this really true?
582 */
583 do_wakeup = 1;
584 chars = PAGE_SIZE;
585 if (chars > total_len)
586 chars = total_len;
587
588 iov_fault_in_pages_read(iov, chars);
589redo2:
590 if (atomic)
591 src = kmap_atomic(page);
592 else
593 src = kmap(page);
594
595 error = pipe_iov_copy_from_user(src, iov, chars,
596 atomic);
597 if (atomic)
598 kunmap_atomic(src);
599 else
600 kunmap(page);
601
602 if (unlikely(error)) {
603 if (atomic) {
604 atomic = 0;
605 goto redo2;
606 }
607 if (!ret)
608 ret = error;
609 break;
610 }
611 ret += chars;
612
613 /* Insert it into the buffer array */
614 buf->page = page;
615 buf->ops = &anon_pipe_buf_ops;
616 buf->offset = 0;
617 buf->len = chars;
618 buf->flags = 0;
619 if (is_packetized(filp)) {
620 buf->ops = &packet_pipe_buf_ops;
621 buf->flags = PIPE_BUF_FLAG_PACKET;
622 }
623 pipe->nrbufs = ++bufs;
624 pipe->tmp_page = NULL;
625
626 total_len -= chars;
627 if (!total_len)
628 break;
629 }
630 if (bufs < pipe->buffers)
631 continue;
632 if (filp->f_flags & O_NONBLOCK) {
633 if (!ret)
634 ret = -EAGAIN;
635 break;
636 }
637 if (signal_pending(current)) {
638 if (!ret)
639 ret = -ERESTARTSYS;
640 break;
641 }
642 if (do_wakeup) {
643 wake_up_interruptible_sync_poll(&pipe->wait, POLLIN | POLLRDNORM);
644 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
645 do_wakeup = 0;
646 }
647 pipe->waiting_writers++;
648 pipe_wait(pipe);
649 pipe->waiting_writers--;
650 }
651out:
652 mutex_unlock(&inode->i_mutex);
653 if (do_wakeup) {
654 wake_up_interruptible_sync_poll(&pipe->wait, POLLIN | POLLRDNORM);
655 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
656 }
657 if (ret > 0) {
658 int err = file_update_time(filp);
659 if (err)
660 ret = err;
661 }
662 return ret;
663}
664
665static ssize_t
666bad_pipe_r(struct file *filp, char __user *buf, size_t count, loff_t *ppos)
667{
668 return -EBADF;
669}
670
671static ssize_t
672bad_pipe_w(struct file *filp, const char __user *buf, size_t count,
673 loff_t *ppos)
674{
675 return -EBADF;
676}
677
678static long pipe_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
679{
680 struct inode *inode = filp->f_path.dentry->d_inode;
681 struct pipe_inode_info *pipe;
682 int count, buf, nrbufs;
683
684 switch (cmd) {
685 case FIONREAD:
686 mutex_lock(&inode->i_mutex);
687 pipe = inode->i_pipe;
688 count = 0;
689 buf = pipe->curbuf;
690 nrbufs = pipe->nrbufs;
691 while (--nrbufs >= 0) {
692 count += pipe->bufs[buf].len;
693 buf = (buf+1) & (pipe->buffers - 1);
694 }
695 mutex_unlock(&inode->i_mutex);
696
697 return put_user(count, (int __user *)arg);
698 default:
699 return -ENOIOCTLCMD;
700 }
701}
702
703/* No kernel lock held - fine */
704static unsigned int
705pipe_poll(struct file *filp, poll_table *wait)
706{
707 unsigned int mask;
708 struct inode *inode = filp->f_path.dentry->d_inode;
709 struct pipe_inode_info *pipe = inode->i_pipe;
710 int nrbufs;
711
712 poll_wait(filp, &pipe->wait, wait);
713
714 /* Reading only -- no need for acquiring the semaphore. */
715 nrbufs = pipe->nrbufs;
716 mask = 0;
717 if (filp->f_mode & FMODE_READ) {
718 mask = (nrbufs > 0) ? POLLIN | POLLRDNORM : 0;
719 if (!pipe->writers && filp->f_version != pipe->w_counter)
720 mask |= POLLHUP;
721 }
722
723 if (filp->f_mode & FMODE_WRITE) {
724 mask |= (nrbufs < pipe->buffers) ? POLLOUT | POLLWRNORM : 0;
725 /*
726 * Most Unices do not set POLLERR for FIFOs but on Linux they
727 * behave exactly like pipes for poll().
728 */
729 if (!pipe->readers)
730 mask |= POLLERR;
731 }
732
733 return mask;
734}
735
736static int
737pipe_release(struct inode *inode, int decr, int decw)
738{
739 struct pipe_inode_info *pipe;
740
741 mutex_lock(&inode->i_mutex);
742 pipe = inode->i_pipe;
743 pipe->readers -= decr;
744 pipe->writers -= decw;
745
746 if (!pipe->readers && !pipe->writers) {
747 free_pipe_info(inode);
748 } else {
749 wake_up_interruptible_sync_poll(&pipe->wait, POLLIN | POLLOUT | POLLRDNORM | POLLWRNORM | POLLERR | POLLHUP);
750 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
751 kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
752 }
753 mutex_unlock(&inode->i_mutex);
754
755 return 0;
756}
757
758static int
759pipe_read_fasync(int fd, struct file *filp, int on)
760{
761 struct inode *inode = filp->f_path.dentry->d_inode;
762 int retval;
763
764 mutex_lock(&inode->i_mutex);
765 retval = fasync_helper(fd, filp, on, &inode->i_pipe->fasync_readers);
766 mutex_unlock(&inode->i_mutex);
767
768 return retval;
769}
770
771
772static int
773pipe_write_fasync(int fd, struct file *filp, int on)
774{
775 struct inode *inode = filp->f_path.dentry->d_inode;
776 int retval;
777
778 mutex_lock(&inode->i_mutex);
779 retval = fasync_helper(fd, filp, on, &inode->i_pipe->fasync_writers);
780 mutex_unlock(&inode->i_mutex);
781
782 return retval;
783}
784
785
786static int
787pipe_rdwr_fasync(int fd, struct file *filp, int on)
788{
789 struct inode *inode = filp->f_path.dentry->d_inode;
790 struct pipe_inode_info *pipe = inode->i_pipe;
791 int retval;
792
793 mutex_lock(&inode->i_mutex);
794 retval = fasync_helper(fd, filp, on, &pipe->fasync_readers);
795 if (retval >= 0) {
796 retval = fasync_helper(fd, filp, on, &pipe->fasync_writers);
797 if (retval < 0) /* this can happen only if on == T */
798 fasync_helper(-1, filp, 0, &pipe->fasync_readers);
799 }
800 mutex_unlock(&inode->i_mutex);
801 return retval;
802}
803
804
805static int
806pipe_read_release(struct inode *inode, struct file *filp)
807{
808 return pipe_release(inode, 1, 0);
809}
810
811static int
812pipe_write_release(struct inode *inode, struct file *filp)
813{
814 return pipe_release(inode, 0, 1);
815}
816
817static int
818pipe_rdwr_release(struct inode *inode, struct file *filp)
819{
820 int decr, decw;
821
822 decr = (filp->f_mode & FMODE_READ) != 0;
823 decw = (filp->f_mode & FMODE_WRITE) != 0;
824 return pipe_release(inode, decr, decw);
825}
826
827static int
828pipe_read_open(struct inode *inode, struct file *filp)
829{
830 int ret = -ENOENT;
831
832 mutex_lock(&inode->i_mutex);
833
834 if (inode->i_pipe) {
835 ret = 0;
836 inode->i_pipe->readers++;
837 }
838
839 mutex_unlock(&inode->i_mutex);
840
841 return ret;
842}
843
844static int
845pipe_write_open(struct inode *inode, struct file *filp)
846{
847 int ret = -ENOENT;
848
849 mutex_lock(&inode->i_mutex);
850
851 if (inode->i_pipe) {
852 ret = 0;
853 inode->i_pipe->writers++;
854 }
855
856 mutex_unlock(&inode->i_mutex);
857
858 return ret;
859}
860
861static int
862pipe_rdwr_open(struct inode *inode, struct file *filp)
863{
864 int ret = -ENOENT;
865
866 mutex_lock(&inode->i_mutex);
867
868 if (inode->i_pipe) {
869 ret = 0;
870 if (filp->f_mode & FMODE_READ)
871 inode->i_pipe->readers++;
872 if (filp->f_mode & FMODE_WRITE)
873 inode->i_pipe->writers++;
874 }
875
876 mutex_unlock(&inode->i_mutex);
877
878 return ret;
879}
880
881/*
882 * The file_operations structs are not static because they
883 * are also used in linux/fs/fifo.c to do operations on FIFOs.
884 *
885 * Pipes reuse fifos' file_operations structs.
886 */
887const struct file_operations read_pipefifo_fops = {
888 .llseek = no_llseek,
889 .read = do_sync_read,
890 .aio_read = pipe_read,
891 .write = bad_pipe_w,
892 .poll = pipe_poll,
893 .unlocked_ioctl = pipe_ioctl,
894 .open = pipe_read_open,
895 .release = pipe_read_release,
896 .fasync = pipe_read_fasync,
897};
898
899const struct file_operations write_pipefifo_fops = {
900 .llseek = no_llseek,
901 .read = bad_pipe_r,
902 .write = do_sync_write,
903 .aio_write = pipe_write,
904 .poll = pipe_poll,
905 .unlocked_ioctl = pipe_ioctl,
906 .open = pipe_write_open,
907 .release = pipe_write_release,
908 .fasync = pipe_write_fasync,
909};
910
911const struct file_operations rdwr_pipefifo_fops = {
912 .llseek = no_llseek,
913 .read = do_sync_read,
914 .aio_read = pipe_read,
915 .write = do_sync_write,
916 .aio_write = pipe_write,
917 .poll = pipe_poll,
918 .unlocked_ioctl = pipe_ioctl,
919 .open = pipe_rdwr_open,
920 .release = pipe_rdwr_release,
921 .fasync = pipe_rdwr_fasync,
922};
923
924struct pipe_inode_info * alloc_pipe_info(struct inode *inode)
925{
926 struct pipe_inode_info *pipe;
927
928 pipe = kzalloc(sizeof(struct pipe_inode_info), GFP_KERNEL);
929 if (pipe) {
930 pipe->bufs = kzalloc(sizeof(struct pipe_buffer) * PIPE_DEF_BUFFERS, GFP_KERNEL);
931 if (pipe->bufs) {
932 init_waitqueue_head(&pipe->wait);
933 pipe->r_counter = pipe->w_counter = 1;
934 pipe->inode = inode;
935 pipe->buffers = PIPE_DEF_BUFFERS;
936 return pipe;
937 }
938 kfree(pipe);
939 }
940
941 return NULL;
942}
943
944void __free_pipe_info(struct pipe_inode_info *pipe)
945{
946 int i;
947
948 for (i = 0; i < pipe->buffers; i++) {
949 struct pipe_buffer *buf = pipe->bufs + i;
950 if (buf->ops)
951 buf->ops->release(pipe, buf);
952 }
953 if (pipe->tmp_page)
954 __free_page(pipe->tmp_page);
955 kfree(pipe->bufs);
956 kfree(pipe);
957}
958
959void free_pipe_info(struct inode *inode)
960{
961 __free_pipe_info(inode->i_pipe);
962 inode->i_pipe = NULL;
963}
964
965static struct vfsmount *pipe_mnt __read_mostly;
966
967/*
968 * pipefs_dname() is called from d_path().
969 */
970static char *pipefs_dname(struct dentry *dentry, char *buffer, int buflen)
971{
972 return dynamic_dname(dentry, buffer, buflen, "pipe:[%lu]",
973 dentry->d_inode->i_ino);
974}
975
976static const struct dentry_operations pipefs_dentry_operations = {
977 .d_dname = pipefs_dname,
978};
979
980static struct inode * get_pipe_inode(void)
981{
982 struct inode *inode = new_inode_pseudo(pipe_mnt->mnt_sb);
983 struct pipe_inode_info *pipe;
984
985 if (!inode)
986 goto fail_inode;
987
988 inode->i_ino = get_next_ino();
989
990 pipe = alloc_pipe_info(inode);
991 if (!pipe)
992 goto fail_iput;
993 inode->i_pipe = pipe;
994
995 pipe->readers = pipe->writers = 1;
996 inode->i_fop = &rdwr_pipefifo_fops;
997
998 /*
999 * Mark the inode dirty from the very beginning,
1000 * that way it will never be moved to the dirty
1001 * list because "mark_inode_dirty()" will think
1002 * that it already _is_ on the dirty list.
1003 */
1004 inode->i_state = I_DIRTY;
1005 inode->i_mode = S_IFIFO | S_IRUSR | S_IWUSR;
1006 inode->i_uid = current_fsuid();
1007 inode->i_gid = current_fsgid();
1008 inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME;
1009
1010 return inode;
1011
1012fail_iput:
1013 iput(inode);
1014
1015fail_inode:
1016 return NULL;
1017}
1018
1019struct file *create_write_pipe(int flags)
1020{
1021 int err;
1022 struct inode *inode;
1023 struct file *f;
1024 struct path path;
1025 struct qstr name = { .name = "" };
1026
1027 err = -ENFILE;
1028 inode = get_pipe_inode();
1029 if (!inode)
1030 goto err;
1031
1032 err = -ENOMEM;
1033 path.dentry = d_alloc_pseudo(pipe_mnt->mnt_sb, &name);
1034 if (!path.dentry)
1035 goto err_inode;
1036 path.mnt = mntget(pipe_mnt);
1037
1038 d_instantiate(path.dentry, inode);
1039
1040 err = -ENFILE;
1041 f = alloc_file(&path, FMODE_WRITE, &write_pipefifo_fops);
1042 if (!f)
1043 goto err_dentry;
1044 f->f_mapping = inode->i_mapping;
1045
1046 f->f_flags = O_WRONLY | (flags & (O_NONBLOCK | O_DIRECT));
1047 f->f_version = 0;
1048
1049 return f;
1050
1051 err_dentry:
1052 free_pipe_info(inode);
1053 path_put(&path);
1054 return ERR_PTR(err);
1055
1056 err_inode:
1057 free_pipe_info(inode);
1058 iput(inode);
1059 err:
1060 return ERR_PTR(err);
1061}
1062
1063void free_write_pipe(struct file *f)
1064{
1065 free_pipe_info(f->f_dentry->d_inode);
1066 path_put(&f->f_path);
1067 put_filp(f);
1068}
1069
1070struct file *create_read_pipe(struct file *wrf, int flags)
1071{
1072 /* Grab pipe from the writer */
1073 struct file *f = alloc_file(&wrf->f_path, FMODE_READ,
1074 &read_pipefifo_fops);
1075 if (!f)
1076 return ERR_PTR(-ENFILE);
1077
1078 path_get(&wrf->f_path);
1079 f->f_flags = O_RDONLY | (flags & O_NONBLOCK);
1080
1081 return f;
1082}
1083
1084int do_pipe_flags(int *fd, int flags)
1085{
1086 struct file *fw, *fr;
1087 int error;
1088 int fdw, fdr;
1089
1090 if (flags & ~(O_CLOEXEC | O_NONBLOCK | O_DIRECT))
1091 return -EINVAL;
1092
1093 fw = create_write_pipe(flags);
1094 if (IS_ERR(fw))
1095 return PTR_ERR(fw);
1096 fr = create_read_pipe(fw, flags);
1097 error = PTR_ERR(fr);
1098 if (IS_ERR(fr))
1099 goto err_write_pipe;
1100
1101 error = get_unused_fd_flags(flags);
1102 if (error < 0)
1103 goto err_read_pipe;
1104 fdr = error;
1105
1106 error = get_unused_fd_flags(flags);
1107 if (error < 0)
1108 goto err_fdr;
1109 fdw = error;
1110
1111 audit_fd_pair(fdr, fdw);
1112 fd_install(fdr, fr);
1113 fd_install(fdw, fw);
1114 fd[0] = fdr;
1115 fd[1] = fdw;
1116
1117 return 0;
1118
1119 err_fdr:
1120 put_unused_fd(fdr);
1121 err_read_pipe:
1122 path_put(&fr->f_path);
1123 put_filp(fr);
1124 err_write_pipe:
1125 free_write_pipe(fw);
1126 return error;
1127}
1128
1129/*
1130 * sys_pipe() is the normal C calling standard for creating
1131 * a pipe. It's not the way Unix traditionally does this, though.
1132 */
1133SYSCALL_DEFINE2(pipe2, int __user *, fildes, int, flags)
1134{
1135 int fd[2];
1136 int error;
1137
1138 error = do_pipe_flags(fd, flags);
1139 if (!error) {
1140 if (copy_to_user(fildes, fd, sizeof(fd))) {
1141 sys_close(fd[0]);
1142 sys_close(fd[1]);
1143 error = -EFAULT;
1144 }
1145 }
1146 return error;
1147}
1148
1149SYSCALL_DEFINE1(pipe, int __user *, fildes)
1150{
1151 return sys_pipe2(fildes, 0);
1152}
1153
1154/*
1155 * Allocate a new array of pipe buffers and copy the info over. Returns the
1156 * pipe size if successful, or return -ERROR on error.
1157 */
1158static long pipe_set_size(struct pipe_inode_info *pipe, unsigned long nr_pages)
1159{
1160 struct pipe_buffer *bufs;
1161
1162 /*
1163 * We can shrink the pipe, if arg >= pipe->nrbufs. Since we don't
1164 * expect a lot of shrink+grow operations, just free and allocate
1165 * again like we would do for growing. If the pipe currently
1166 * contains more buffers than arg, then return busy.
1167 */
1168 if (nr_pages < pipe->nrbufs)
1169 return -EBUSY;
1170
1171 bufs = kcalloc(nr_pages, sizeof(*bufs), GFP_KERNEL | __GFP_NOWARN);
1172 if (unlikely(!bufs))
1173 return -ENOMEM;
1174
1175 /*
1176 * The pipe array wraps around, so just start the new one at zero
1177 * and adjust the indexes.
1178 */
1179 if (pipe->nrbufs) {
1180 unsigned int tail;
1181 unsigned int head;
1182
1183 tail = pipe->curbuf + pipe->nrbufs;
1184 if (tail < pipe->buffers)
1185 tail = 0;
1186 else
1187 tail &= (pipe->buffers - 1);
1188
1189 head = pipe->nrbufs - tail;
1190 if (head)
1191 memcpy(bufs, pipe->bufs + pipe->curbuf, head * sizeof(struct pipe_buffer));
1192 if (tail)
1193 memcpy(bufs + head, pipe->bufs, tail * sizeof(struct pipe_buffer));
1194 }
1195
1196 pipe->curbuf = 0;
1197 kfree(pipe->bufs);
1198 pipe->bufs = bufs;
1199 pipe->buffers = nr_pages;
1200 return nr_pages * PAGE_SIZE;
1201}
1202
1203/*
1204 * Currently we rely on the pipe array holding a power-of-2 number
1205 * of pages.
1206 */
1207static inline unsigned int round_pipe_size(unsigned int size)
1208{
1209 unsigned long nr_pages;
1210
1211 nr_pages = (size + PAGE_SIZE - 1) >> PAGE_SHIFT;
1212 return roundup_pow_of_two(nr_pages) << PAGE_SHIFT;
1213}
1214
1215/*
1216 * This should work even if CONFIG_PROC_FS isn't set, as proc_dointvec_minmax
1217 * will return an error.
1218 */
1219int pipe_proc_fn(struct ctl_table *table, int write, void __user *buf,
1220 size_t *lenp, loff_t *ppos)
1221{
1222 int ret;
1223
1224 ret = proc_dointvec_minmax(table, write, buf, lenp, ppos);
1225 if (ret < 0 || !write)
1226 return ret;
1227
1228 pipe_max_size = round_pipe_size(pipe_max_size);
1229 return ret;
1230}
1231
1232/*
1233 * After the inode slimming patch, i_pipe/i_bdev/i_cdev share the same
1234 * location, so checking ->i_pipe is not enough to verify that this is a
1235 * pipe.
1236 */
1237struct pipe_inode_info *get_pipe_info(struct file *file)
1238{
1239 struct inode *i = file->f_path.dentry->d_inode;
1240
1241 return S_ISFIFO(i->i_mode) ? i->i_pipe : NULL;
1242}
1243
1244long pipe_fcntl(struct file *file, unsigned int cmd, unsigned long arg)
1245{
1246 struct pipe_inode_info *pipe;
1247 long ret;
1248
1249 pipe = get_pipe_info(file);
1250 if (!pipe)
1251 return -EBADF;
1252
1253 mutex_lock(&pipe->inode->i_mutex);
1254
1255 switch (cmd) {
1256 case F_SETPIPE_SZ: {
1257 unsigned int size, nr_pages;
1258
1259 size = round_pipe_size(arg);
1260 nr_pages = size >> PAGE_SHIFT;
1261
1262 ret = -EINVAL;
1263 if (!nr_pages)
1264 goto out;
1265
1266 if (!capable(CAP_SYS_RESOURCE) && size > pipe_max_size) {
1267 ret = -EPERM;
1268 goto out;
1269 }
1270 ret = pipe_set_size(pipe, nr_pages);
1271 break;
1272 }
1273 case F_GETPIPE_SZ:
1274 ret = pipe->buffers * PAGE_SIZE;
1275 break;
1276 default:
1277 ret = -EINVAL;
1278 break;
1279 }
1280
1281out:
1282 mutex_unlock(&pipe->inode->i_mutex);
1283 return ret;
1284}
1285
1286static const struct super_operations pipefs_ops = {
1287 .destroy_inode = free_inode_nonrcu,
1288 .statfs = simple_statfs,
1289};
1290
1291/*
1292 * pipefs should _never_ be mounted by userland - too much of security hassle,
1293 * no real gain from having the whole whorehouse mounted. So we don't need
1294 * any operations on the root directory. However, we need a non-trivial
1295 * d_name - pipe: will go nicely and kill the special-casing in procfs.
1296 */
1297static struct dentry *pipefs_mount(struct file_system_type *fs_type,
1298 int flags, const char *dev_name, void *data)
1299{
1300 return mount_pseudo(fs_type, "pipe:", &pipefs_ops,
1301 &pipefs_dentry_operations, PIPEFS_MAGIC);
1302}
1303
1304static struct file_system_type pipe_fs_type = {
1305 .name = "pipefs",
1306 .mount = pipefs_mount,
1307 .kill_sb = kill_anon_super,
1308};
1309
1310static int __init init_pipe_fs(void)
1311{
1312 int err = register_filesystem(&pipe_fs_type);
1313
1314 if (!err) {
1315 pipe_mnt = kern_mount(&pipe_fs_type);
1316 if (IS_ERR(pipe_mnt)) {
1317 err = PTR_ERR(pipe_mnt);
1318 unregister_filesystem(&pipe_fs_type);
1319 }
1320 }
1321 return err;
1322}
1323
1324fs_initcall(init_pipe_fs);