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