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