2 * SPDX-License-Identifier: BSD-4-Clause
4 * Copyright (c) 1996 John S. Dyson
5 * Copyright (c) 2012 Giovanni Trematerra
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice immediately at the beginning of the file, without modification,
13 * this list of conditions, and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. Absolutely no warranty of function or purpose is made by the author
19 * 4. Modifications may be freely made to this file if the above conditions
24 * This file contains a high-performance replacement for the socket-based
25 * pipes scheme originally used in FreeBSD/4.4Lite. It does not support
26 * all features of sockets, but does do everything that pipes normally
31 * This code has two modes of operation, a small write mode and a large
32 * write mode. The small write mode acts like conventional pipes with
33 * a kernel buffer. If the buffer is less than PIPE_MINDIRECT, then the
34 * "normal" pipe buffering is done. If the buffer is between PIPE_MINDIRECT
35 * and PIPE_SIZE in size, the sending process pins the underlying pages in
36 * memory, and the receiving process copies directly from these pinned pages
37 * in the sending process.
39 * If the sending process receives a signal, it is possible that it will
40 * go away, and certainly its address space can change, because control
41 * is returned back to the user-mode side. In that case, the pipe code
42 * arranges to copy the buffer supplied by the user process, to a pageable
43 * kernel buffer, and the receiving process will grab the data from the
44 * pageable kernel buffer. Since signals don't happen all that often,
45 * the copy operation is normally eliminated.
47 * The constant PIPE_MINDIRECT is chosen to make sure that buffering will
48 * happen for small transfers so that the system will not spend all of
49 * its time context switching.
51 * In order to limit the resource use of pipes, two sysctls exist:
53 * kern.ipc.maxpipekva - This is a hard limit on the amount of pageable
54 * address space available to us in pipe_map. This value is normally
55 * autotuned, but may also be loader tuned.
57 * kern.ipc.pipekva - This read-only sysctl tracks the current amount of
58 * memory in use by pipes.
60 * Based on how large pipekva is relative to maxpipekva, the following
64 * New pipes are given 16K of memory backing, pipes may dynamically
65 * grow to as large as 64K where needed.
67 * New pipes are given 4K (or PAGE_SIZE) of memory backing,
68 * existing pipes may NOT grow.
70 * New pipes are given 4K (or PAGE_SIZE) of memory backing,
71 * existing pipes will be shrunk down to 4K whenever possible.
73 * Resizing may be disabled by setting kern.ipc.piperesizeallowed=0. If
74 * that is set, the only resize that will occur is the 0 -> SMALL_PIPE_SIZE
75 * resize which MUST occur for reverse-direction pipes when they are
78 * Additional information about the current state of pipes may be obtained
79 * from kern.ipc.pipes, kern.ipc.pipefragretry, kern.ipc.pipeallocfail,
80 * and kern.ipc.piperesizefail.
82 * Locking rules: There are two locks present here: A mutex, used via
83 * PIPE_LOCK, and a flag, used via pipelock(). All locking is done via
84 * the flag, as mutexes can not persist over uiomove. The mutex
85 * exists only to guard access to the flag, and is not in itself a
86 * locking mechanism. Also note that there is only a single mutex for
87 * both directions of a pipe.
89 * As pipelock() may have to sleep before it can acquire the flag, it
90 * is important to reread all data after a call to pipelock(); everything
91 * in the structure may have changed.
94 #include <sys/cdefs.h>
95 __FBSDID("$FreeBSD$");
97 #include <sys/param.h>
98 #include <sys/systm.h>
100 #include <sys/fcntl.h>
101 #include <sys/file.h>
102 #include <sys/filedesc.h>
103 #include <sys/filio.h>
104 #include <sys/kernel.h>
105 #include <sys/lock.h>
106 #include <sys/mutex.h>
107 #include <sys/ttycom.h>
108 #include <sys/stat.h>
109 #include <sys/malloc.h>
110 #include <sys/poll.h>
111 #include <sys/selinfo.h>
112 #include <sys/signalvar.h>
113 #include <sys/syscallsubr.h>
114 #include <sys/sysctl.h>
115 #include <sys/sysproto.h>
116 #include <sys/pipe.h>
117 #include <sys/proc.h>
118 #include <sys/vnode.h>
120 #include <sys/user.h>
121 #include <sys/event.h>
123 #include <security/mac/mac_framework.h>
126 #include <vm/vm_param.h>
127 #include <vm/vm_object.h>
128 #include <vm/vm_kern.h>
129 #include <vm/vm_extern.h>
131 #include <vm/vm_map.h>
132 #include <vm/vm_page.h>
136 * Use this define if you want to disable *fancy* VM things. Expect an
137 * approx 30% decrease in transfer rate. This could be useful for
140 /* #define PIPE_NODIRECT */
142 #define PIPE_PEER(pipe) \
143 (((pipe)->pipe_type & PIPE_TYPE_NAMED) ? (pipe) : ((pipe)->pipe_peer))
146 * interfaces to the outside world
148 static fo_rdwr_t pipe_read;
149 static fo_rdwr_t pipe_write;
150 static fo_truncate_t pipe_truncate;
151 static fo_ioctl_t pipe_ioctl;
152 static fo_poll_t pipe_poll;
153 static fo_kqfilter_t pipe_kqfilter;
154 static fo_stat_t pipe_stat;
155 static fo_close_t pipe_close;
156 static fo_chmod_t pipe_chmod;
157 static fo_chown_t pipe_chown;
158 static fo_fill_kinfo_t pipe_fill_kinfo;
160 struct fileops pipeops = {
161 .fo_read = pipe_read,
162 .fo_write = pipe_write,
163 .fo_truncate = pipe_truncate,
164 .fo_ioctl = pipe_ioctl,
165 .fo_poll = pipe_poll,
166 .fo_kqfilter = pipe_kqfilter,
167 .fo_stat = pipe_stat,
168 .fo_close = pipe_close,
169 .fo_chmod = pipe_chmod,
170 .fo_chown = pipe_chown,
171 .fo_sendfile = invfo_sendfile,
172 .fo_fill_kinfo = pipe_fill_kinfo,
173 .fo_flags = DFLAG_PASSABLE
176 static void filt_pipedetach(struct knote *kn);
177 static void filt_pipedetach_notsup(struct knote *kn);
178 static int filt_pipenotsup(struct knote *kn, long hint);
179 static int filt_piperead(struct knote *kn, long hint);
180 static int filt_pipewrite(struct knote *kn, long hint);
182 static struct filterops pipe_nfiltops = {
184 .f_detach = filt_pipedetach_notsup,
185 .f_event = filt_pipenotsup
187 static struct filterops pipe_rfiltops = {
189 .f_detach = filt_pipedetach,
190 .f_event = filt_piperead
192 static struct filterops pipe_wfiltops = {
194 .f_detach = filt_pipedetach,
195 .f_event = filt_pipewrite
199 * Default pipe buffer size(s), this can be kind-of large now because pipe
200 * space is pageable. The pipe code will try to maintain locality of
201 * reference for performance reasons, so small amounts of outstanding I/O
202 * will not wipe the cache.
204 #define MINPIPESIZE (PIPE_SIZE/3)
205 #define MAXPIPESIZE (2*PIPE_SIZE/3)
207 static long amountpipekva;
208 static int pipefragretry;
209 static int pipeallocfail;
210 static int piperesizefail;
211 static int piperesizeallowed = 1;
212 static long pipe_mindirect = PIPE_MINDIRECT;
214 SYSCTL_LONG(_kern_ipc, OID_AUTO, maxpipekva, CTLFLAG_RDTUN | CTLFLAG_NOFETCH,
215 &maxpipekva, 0, "Pipe KVA limit");
216 SYSCTL_LONG(_kern_ipc, OID_AUTO, pipekva, CTLFLAG_RD,
217 &amountpipekva, 0, "Pipe KVA usage");
218 SYSCTL_INT(_kern_ipc, OID_AUTO, pipefragretry, CTLFLAG_RD,
219 &pipefragretry, 0, "Pipe allocation retries due to fragmentation");
220 SYSCTL_INT(_kern_ipc, OID_AUTO, pipeallocfail, CTLFLAG_RD,
221 &pipeallocfail, 0, "Pipe allocation failures");
222 SYSCTL_INT(_kern_ipc, OID_AUTO, piperesizefail, CTLFLAG_RD,
223 &piperesizefail, 0, "Pipe resize failures");
224 SYSCTL_INT(_kern_ipc, OID_AUTO, piperesizeallowed, CTLFLAG_RW,
225 &piperesizeallowed, 0, "Pipe resizing allowed");
227 static void pipeinit(void *dummy __unused);
228 static void pipeclose(struct pipe *cpipe);
229 static void pipe_free_kmem(struct pipe *cpipe);
230 static int pipe_create(struct pipe *pipe, bool backing);
231 static int pipe_paircreate(struct thread *td, struct pipepair **p_pp);
232 static __inline int pipelock(struct pipe *cpipe, int catch);
233 static __inline void pipeunlock(struct pipe *cpipe);
234 static void pipe_timestamp(struct timespec *tsp);
235 #ifndef PIPE_NODIRECT
236 static int pipe_build_write_buffer(struct pipe *wpipe, struct uio *uio);
237 static void pipe_destroy_write_buffer(struct pipe *wpipe);
238 static int pipe_direct_write(struct pipe *wpipe, struct uio *uio);
239 static void pipe_clone_write_buffer(struct pipe *wpipe);
241 static int pipespace(struct pipe *cpipe, int size);
242 static int pipespace_new(struct pipe *cpipe, int size);
244 static int pipe_zone_ctor(void *mem, int size, void *arg, int flags);
245 static int pipe_zone_init(void *mem, int size, int flags);
246 static void pipe_zone_fini(void *mem, int size);
248 static uma_zone_t pipe_zone;
249 static struct unrhdr64 pipeino_unr;
250 static dev_t pipedev_ino;
252 SYSINIT(vfs, SI_SUB_VFS, SI_ORDER_ANY, pipeinit, NULL);
255 pipeinit(void *dummy __unused)
258 pipe_zone = uma_zcreate("pipe", sizeof(struct pipepair),
259 pipe_zone_ctor, NULL, pipe_zone_init, pipe_zone_fini,
261 KASSERT(pipe_zone != NULL, ("pipe_zone not initialized"));
262 new_unrhdr64(&pipeino_unr, 1);
263 pipedev_ino = devfs_alloc_cdp_inode();
264 KASSERT(pipedev_ino > 0, ("pipe dev inode not initialized"));
268 sysctl_handle_pipe_mindirect(SYSCTL_HANDLER_ARGS)
271 long tmp_pipe_mindirect = pipe_mindirect;
273 error = sysctl_handle_long(oidp, &tmp_pipe_mindirect, arg2, req);
274 if (error != 0 || req->newptr == NULL)
278 * Don't allow pipe_mindirect to be set so low that we violate
279 * atomicity requirements.
281 if (tmp_pipe_mindirect <= PIPE_BUF)
283 pipe_mindirect = tmp_pipe_mindirect;
286 SYSCTL_OID(_kern_ipc, OID_AUTO, pipe_mindirect, CTLTYPE_LONG | CTLFLAG_RW,
287 &pipe_mindirect, 0, sysctl_handle_pipe_mindirect, "L",
288 "Minimum write size triggering VM optimization");
291 pipe_zone_ctor(void *mem, int size, void *arg, int flags)
294 struct pipe *rpipe, *wpipe;
296 KASSERT(size == sizeof(*pp), ("pipe_zone_ctor: wrong size"));
298 pp = (struct pipepair *)mem;
301 * We zero both pipe endpoints to make sure all the kmem pointers
302 * are NULL, flag fields are zero'd, etc. We timestamp both
303 * endpoints with the same time.
305 rpipe = &pp->pp_rpipe;
306 bzero(rpipe, sizeof(*rpipe));
307 pipe_timestamp(&rpipe->pipe_ctime);
308 rpipe->pipe_atime = rpipe->pipe_mtime = rpipe->pipe_ctime;
310 wpipe = &pp->pp_wpipe;
311 bzero(wpipe, sizeof(*wpipe));
312 wpipe->pipe_ctime = rpipe->pipe_ctime;
313 wpipe->pipe_atime = wpipe->pipe_mtime = rpipe->pipe_ctime;
315 rpipe->pipe_peer = wpipe;
316 rpipe->pipe_pair = pp;
317 wpipe->pipe_peer = rpipe;
318 wpipe->pipe_pair = pp;
321 * Mark both endpoints as present; they will later get free'd
322 * one at a time. When both are free'd, then the whole pair
325 rpipe->pipe_present = PIPE_ACTIVE;
326 wpipe->pipe_present = PIPE_ACTIVE;
329 * Eventually, the MAC Framework may initialize the label
330 * in ctor or init, but for now we do it elswhere to avoid
331 * blocking in ctor or init.
339 pipe_zone_init(void *mem, int size, int flags)
343 KASSERT(size == sizeof(*pp), ("pipe_zone_init: wrong size"));
345 pp = (struct pipepair *)mem;
347 mtx_init(&pp->pp_mtx, "pipe mutex", NULL, MTX_DEF | MTX_NEW);
352 pipe_zone_fini(void *mem, int size)
356 KASSERT(size == sizeof(*pp), ("pipe_zone_fini: wrong size"));
358 pp = (struct pipepair *)mem;
360 mtx_destroy(&pp->pp_mtx);
364 pipe_paircreate(struct thread *td, struct pipepair **p_pp)
367 struct pipe *rpipe, *wpipe;
370 *p_pp = pp = uma_zalloc(pipe_zone, M_WAITOK);
373 * The MAC label is shared between the connected endpoints. As a
374 * result mac_pipe_init() and mac_pipe_create() are called once
375 * for the pair, and not on the endpoints.
378 mac_pipe_create(td->td_ucred, pp);
380 rpipe = &pp->pp_rpipe;
381 wpipe = &pp->pp_wpipe;
383 knlist_init_mtx(&rpipe->pipe_sel.si_note, PIPE_MTX(rpipe));
384 knlist_init_mtx(&wpipe->pipe_sel.si_note, PIPE_MTX(wpipe));
387 * Only the forward direction pipe is backed by big buffer by
390 error = pipe_create(rpipe, true);
393 error = pipe_create(wpipe, false);
396 * This cleanup leaves the pipe inode number for rpipe
397 * still allocated, but never used. We do not free
398 * inode numbers for opened pipes, which is required
399 * for correctness because numbers must be unique.
400 * But also it avoids any memory use by the unr
401 * allocator, so stashing away the transient inode
402 * number is reasonable.
404 pipe_free_kmem(rpipe);
408 rpipe->pipe_state |= PIPE_DIRECTOK;
409 wpipe->pipe_state |= PIPE_DIRECTOK;
413 knlist_destroy(&rpipe->pipe_sel.si_note);
414 knlist_destroy(&wpipe->pipe_sel.si_note);
416 mac_pipe_destroy(pp);
422 pipe_named_ctor(struct pipe **ppipe, struct thread *td)
427 error = pipe_paircreate(td, &pp);
430 pp->pp_rpipe.pipe_type |= PIPE_TYPE_NAMED;
431 *ppipe = &pp->pp_rpipe;
436 pipe_dtor(struct pipe *dpipe)
440 peer = (dpipe->pipe_type & PIPE_TYPE_NAMED) != 0 ? dpipe->pipe_peer : NULL;
441 funsetown(&dpipe->pipe_sigio);
444 funsetown(&peer->pipe_sigio);
452 * This used to be vfs_timestamp but the higher precision is unnecessary and
453 * can very negatively affect performance in virtualized environments (e.g., on
454 * vms running on amd64 when using the rdtscp instruction).
457 pipe_timestamp(struct timespec *tsp)
464 * The pipe system call for the DTYPE_PIPE type of pipes. If we fail, let
465 * the zone pick up the pieces via pipeclose().
468 kern_pipe(struct thread *td, int fildes[2], int flags, struct filecaps *fcaps1,
469 struct filecaps *fcaps2)
471 struct file *rf, *wf;
472 struct pipe *rpipe, *wpipe;
474 int fd, fflags, error;
476 error = pipe_paircreate(td, &pp);
479 rpipe = &pp->pp_rpipe;
480 wpipe = &pp->pp_wpipe;
481 error = falloc_caps(td, &rf, &fd, flags, fcaps1);
487 /* An extra reference on `rf' has been held for us by falloc_caps(). */
490 fflags = FREAD | FWRITE;
491 if ((flags & O_NONBLOCK) != 0)
495 * Warning: once we've gotten past allocation of the fd for the
496 * read-side, we can only drop the read side via fdrop() in order
497 * to avoid races against processes which manage to dup() the read
498 * side while we are blocked trying to allocate the write side.
500 finit(rf, fflags, DTYPE_PIPE, rpipe, &pipeops);
501 error = falloc_caps(td, &wf, &fd, flags, fcaps2);
503 fdclose(td, rf, fildes[0]);
505 /* rpipe has been closed by fdrop(). */
509 /* An extra reference on `wf' has been held for us by falloc_caps(). */
510 finit(wf, fflags, DTYPE_PIPE, wpipe, &pipeops);
518 #ifdef COMPAT_FREEBSD10
521 freebsd10_pipe(struct thread *td, struct freebsd10_pipe_args *uap __unused)
526 error = kern_pipe(td, fildes, 0, NULL, NULL);
530 td->td_retval[0] = fildes[0];
531 td->td_retval[1] = fildes[1];
538 sys_pipe2(struct thread *td, struct pipe2_args *uap)
540 int error, fildes[2];
542 if (uap->flags & ~(O_CLOEXEC | O_NONBLOCK))
544 error = kern_pipe(td, fildes, uap->flags, NULL, NULL);
547 error = copyout(fildes, uap->fildes, 2 * sizeof(int));
549 (void)kern_close(td, fildes[0]);
550 (void)kern_close(td, fildes[1]);
556 * Allocate kva for pipe circular buffer, the space is pageable
557 * This routine will 'realloc' the size of a pipe safely, if it fails
558 * it will retain the old buffer.
559 * If it fails it will return ENOMEM.
562 pipespace_new(struct pipe *cpipe, int size)
565 int error, cnt, firstseg;
566 static int curfail = 0;
567 static struct timeval lastfail;
569 KASSERT(!mtx_owned(PIPE_MTX(cpipe)), ("pipespace: pipe mutex locked"));
570 KASSERT(!(cpipe->pipe_state & PIPE_DIRECTW),
571 ("pipespace: resize of direct writes not allowed"));
573 cnt = cpipe->pipe_buffer.cnt;
577 size = round_page(size);
578 buffer = (caddr_t) vm_map_min(pipe_map);
580 error = vm_map_find(pipe_map, NULL, 0, (vm_offset_t *)&buffer, size, 0,
581 VMFS_ANY_SPACE, VM_PROT_RW, VM_PROT_RW, 0);
582 if (error != KERN_SUCCESS) {
583 if (cpipe->pipe_buffer.buffer == NULL &&
584 size > SMALL_PIPE_SIZE) {
585 size = SMALL_PIPE_SIZE;
589 if (cpipe->pipe_buffer.buffer == NULL) {
591 if (ppsratecheck(&lastfail, &curfail, 1))
592 printf("kern.ipc.maxpipekva exceeded; see tuning(7)\n");
599 /* copy data, then free old resources if we're resizing */
601 if (cpipe->pipe_buffer.in <= cpipe->pipe_buffer.out) {
602 firstseg = cpipe->pipe_buffer.size - cpipe->pipe_buffer.out;
603 bcopy(&cpipe->pipe_buffer.buffer[cpipe->pipe_buffer.out],
605 if ((cnt - firstseg) > 0)
606 bcopy(cpipe->pipe_buffer.buffer, &buffer[firstseg],
607 cpipe->pipe_buffer.in);
609 bcopy(&cpipe->pipe_buffer.buffer[cpipe->pipe_buffer.out],
613 pipe_free_kmem(cpipe);
614 cpipe->pipe_buffer.buffer = buffer;
615 cpipe->pipe_buffer.size = size;
616 cpipe->pipe_buffer.in = cnt;
617 cpipe->pipe_buffer.out = 0;
618 cpipe->pipe_buffer.cnt = cnt;
619 atomic_add_long(&amountpipekva, cpipe->pipe_buffer.size);
624 * Wrapper for pipespace_new() that performs locking assertions.
627 pipespace(struct pipe *cpipe, int size)
630 KASSERT(cpipe->pipe_state & PIPE_LOCKFL,
631 ("Unlocked pipe passed to pipespace"));
632 return (pipespace_new(cpipe, size));
636 * lock a pipe for I/O, blocking other access
639 pipelock(struct pipe *cpipe, int catch)
643 PIPE_LOCK_ASSERT(cpipe, MA_OWNED);
648 while (cpipe->pipe_state & PIPE_LOCKFL) {
649 KASSERT(cpipe->pipe_waiters >= 0,
650 ("%s: bad waiter count %d", __func__,
651 cpipe->pipe_waiters));
652 cpipe->pipe_waiters++;
653 error = msleep(cpipe, PIPE_MTX(cpipe),
655 cpipe->pipe_waiters--;
659 cpipe->pipe_state |= PIPE_LOCKFL;
664 * unlock a pipe I/O lock
667 pipeunlock(struct pipe *cpipe)
670 PIPE_LOCK_ASSERT(cpipe, MA_OWNED);
671 KASSERT(cpipe->pipe_state & PIPE_LOCKFL,
672 ("Unlocked pipe passed to pipeunlock"));
673 KASSERT(cpipe->pipe_waiters >= 0,
674 ("%s: bad waiter count %d", __func__,
675 cpipe->pipe_waiters));
676 cpipe->pipe_state &= ~PIPE_LOCKFL;
677 if (cpipe->pipe_waiters > 0) {
683 pipeselwakeup(struct pipe *cpipe)
686 PIPE_LOCK_ASSERT(cpipe, MA_OWNED);
687 if (cpipe->pipe_state & PIPE_SEL) {
688 selwakeuppri(&cpipe->pipe_sel, PSOCK);
689 if (!SEL_WAITING(&cpipe->pipe_sel))
690 cpipe->pipe_state &= ~PIPE_SEL;
692 if ((cpipe->pipe_state & PIPE_ASYNC) && cpipe->pipe_sigio)
693 pgsigio(&cpipe->pipe_sigio, SIGIO, 0);
694 KNOTE_LOCKED(&cpipe->pipe_sel.si_note, 0);
698 * Initialize and allocate VM and memory for pipe. The structure
699 * will start out zero'd from the ctor, so we just manage the kmem.
702 pipe_create(struct pipe *pipe, bool large_backing)
706 error = pipespace_new(pipe, !large_backing || amountpipekva >
707 maxpipekva / 2 ? SMALL_PIPE_SIZE : PIPE_SIZE);
709 pipe->pipe_ino = alloc_unr64(&pipeino_unr);
715 pipe_read(struct file *fp, struct uio *uio, struct ucred *active_cred,
716 int flags, struct thread *td)
726 error = pipelock(rpipe, 1);
731 error = mac_pipe_check_read(active_cred, rpipe->pipe_pair);
735 if (amountpipekva > (3 * maxpipekva) / 4) {
736 if ((rpipe->pipe_state & PIPE_DIRECTW) == 0 &&
737 rpipe->pipe_buffer.size > SMALL_PIPE_SIZE &&
738 rpipe->pipe_buffer.cnt <= SMALL_PIPE_SIZE &&
739 piperesizeallowed == 1) {
741 pipespace(rpipe, SMALL_PIPE_SIZE);
746 while (uio->uio_resid) {
748 * normal pipe buffer receive
750 if (rpipe->pipe_buffer.cnt > 0) {
751 size = rpipe->pipe_buffer.size - rpipe->pipe_buffer.out;
752 if (size > rpipe->pipe_buffer.cnt)
753 size = rpipe->pipe_buffer.cnt;
754 if (size > uio->uio_resid)
755 size = uio->uio_resid;
759 &rpipe->pipe_buffer.buffer[rpipe->pipe_buffer.out],
765 rpipe->pipe_buffer.out += size;
766 if (rpipe->pipe_buffer.out >= rpipe->pipe_buffer.size)
767 rpipe->pipe_buffer.out = 0;
769 rpipe->pipe_buffer.cnt -= size;
772 * If there is no more to read in the pipe, reset
773 * its pointers to the beginning. This improves
776 if (rpipe->pipe_buffer.cnt == 0) {
777 rpipe->pipe_buffer.in = 0;
778 rpipe->pipe_buffer.out = 0;
781 #ifndef PIPE_NODIRECT
783 * Direct copy, bypassing a kernel buffer.
785 } else if ((size = rpipe->pipe_pages.cnt) != 0) {
786 if (size > uio->uio_resid)
787 size = (u_int) uio->uio_resid;
789 error = uiomove_fromphys(rpipe->pipe_pages.ms,
790 rpipe->pipe_pages.pos, size, uio);
795 rpipe->pipe_pages.pos += size;
796 rpipe->pipe_pages.cnt -= size;
797 if (rpipe->pipe_pages.cnt == 0) {
798 rpipe->pipe_state &= ~PIPE_WANTW;
804 * detect EOF condition
805 * read returns 0 on EOF, no need to set error
807 if (rpipe->pipe_state & PIPE_EOF)
811 * If the "write-side" has been blocked, wake it up now.
813 if (rpipe->pipe_state & PIPE_WANTW) {
814 rpipe->pipe_state &= ~PIPE_WANTW;
819 * Break if some data was read.
825 * Unlock the pipe buffer for our remaining processing.
826 * We will either break out with an error or we will
827 * sleep and relock to loop.
832 * Handle non-blocking mode operation or
833 * wait for more data.
835 if (fp->f_flag & FNONBLOCK) {
838 rpipe->pipe_state |= PIPE_WANTR;
839 if ((error = msleep(rpipe, PIPE_MTX(rpipe),
842 error = pipelock(rpipe, 1);
853 /* XXX: should probably do this before getting any locks. */
855 pipe_timestamp(&rpipe->pipe_atime);
860 * PIPE_WANT processing only makes sense if pipe_busy is 0.
862 if ((rpipe->pipe_busy == 0) && (rpipe->pipe_state & PIPE_WANT)) {
863 rpipe->pipe_state &= ~(PIPE_WANT|PIPE_WANTW);
865 } else if (rpipe->pipe_buffer.cnt < MINPIPESIZE) {
867 * Handle write blocking hysteresis.
869 if (rpipe->pipe_state & PIPE_WANTW) {
870 rpipe->pipe_state &= ~PIPE_WANTW;
876 * Only wake up writers if there was actually something read.
877 * Otherwise, when calling read(2) at EOF, a spurious wakeup occurs.
880 rpipe->pipe_buffer.size - rpipe->pipe_buffer.cnt >= PIPE_BUF)
881 pipeselwakeup(rpipe);
885 td->td_ru.ru_msgrcv++;
889 #ifndef PIPE_NODIRECT
891 * Map the sending processes' buffer into kernel space and wire it.
892 * This is similar to a physical write operation.
895 pipe_build_write_buffer(struct pipe *wpipe, struct uio *uio)
900 PIPE_LOCK_ASSERT(wpipe, MA_OWNED);
901 KASSERT((wpipe->pipe_state & PIPE_DIRECTW) == 0,
902 ("%s: PIPE_DIRECTW set on %p", __func__, wpipe));
903 KASSERT(wpipe->pipe_pages.cnt == 0,
904 ("%s: pipe map for %p contains residual data", __func__, wpipe));
906 if (uio->uio_iov->iov_len > wpipe->pipe_buffer.size)
907 size = wpipe->pipe_buffer.size;
909 size = uio->uio_iov->iov_len;
911 wpipe->pipe_state |= PIPE_DIRECTW;
913 i = vm_fault_quick_hold_pages(&curproc->p_vmspace->vm_map,
914 (vm_offset_t)uio->uio_iov->iov_base, size, VM_PROT_READ,
915 wpipe->pipe_pages.ms, PIPENPAGES);
918 wpipe->pipe_state &= ~PIPE_DIRECTW;
922 wpipe->pipe_pages.npages = i;
923 wpipe->pipe_pages.pos =
924 ((vm_offset_t) uio->uio_iov->iov_base) & PAGE_MASK;
925 wpipe->pipe_pages.cnt = size;
927 uio->uio_iov->iov_len -= size;
928 uio->uio_iov->iov_base = (char *)uio->uio_iov->iov_base + size;
929 if (uio->uio_iov->iov_len == 0)
931 uio->uio_resid -= size;
932 uio->uio_offset += size;
937 * Unwire the process buffer.
940 pipe_destroy_write_buffer(struct pipe *wpipe)
943 PIPE_LOCK_ASSERT(wpipe, MA_OWNED);
944 KASSERT((wpipe->pipe_state & PIPE_DIRECTW) != 0,
945 ("%s: PIPE_DIRECTW not set on %p", __func__, wpipe));
946 KASSERT(wpipe->pipe_pages.cnt == 0,
947 ("%s: pipe map for %p contains residual data", __func__, wpipe));
949 wpipe->pipe_state &= ~PIPE_DIRECTW;
950 vm_page_unhold_pages(wpipe->pipe_pages.ms, wpipe->pipe_pages.npages);
951 wpipe->pipe_pages.npages = 0;
955 * In the case of a signal, the writing process might go away. This
956 * code copies the data into the circular buffer so that the source
957 * pages can be freed without loss of data.
960 pipe_clone_write_buffer(struct pipe *wpipe)
967 PIPE_LOCK_ASSERT(wpipe, MA_OWNED);
968 KASSERT((wpipe->pipe_state & PIPE_DIRECTW) != 0,
969 ("%s: PIPE_DIRECTW not set on %p", __func__, wpipe));
971 size = wpipe->pipe_pages.cnt;
972 pos = wpipe->pipe_pages.pos;
973 wpipe->pipe_pages.cnt = 0;
975 wpipe->pipe_buffer.in = size;
976 wpipe->pipe_buffer.out = 0;
977 wpipe->pipe_buffer.cnt = size;
980 iov.iov_base = wpipe->pipe_buffer.buffer;
985 uio.uio_resid = size;
986 uio.uio_segflg = UIO_SYSSPACE;
987 uio.uio_rw = UIO_READ;
988 uio.uio_td = curthread;
989 uiomove_fromphys(wpipe->pipe_pages.ms, pos, size, &uio);
991 pipe_destroy_write_buffer(wpipe);
995 * This implements the pipe buffer write mechanism. Note that only
996 * a direct write OR a normal pipe write can be pending at any given time.
997 * If there are any characters in the pipe buffer, the direct write will
998 * be deferred until the receiving process grabs all of the bytes from
999 * the pipe buffer. Then the direct mapping write is set-up.
1002 pipe_direct_write(struct pipe *wpipe, struct uio *uio)
1007 PIPE_LOCK_ASSERT(wpipe, MA_OWNED);
1008 if ((wpipe->pipe_state & PIPE_EOF) != 0) {
1012 if (wpipe->pipe_state & PIPE_DIRECTW) {
1013 if (wpipe->pipe_state & PIPE_WANTR) {
1014 wpipe->pipe_state &= ~PIPE_WANTR;
1017 pipeselwakeup(wpipe);
1018 wpipe->pipe_state |= PIPE_WANTW;
1020 error = msleep(wpipe, PIPE_MTX(wpipe),
1021 PRIBIO | PCATCH, "pipdww", 0);
1027 if (wpipe->pipe_buffer.cnt > 0) {
1028 if (wpipe->pipe_state & PIPE_WANTR) {
1029 wpipe->pipe_state &= ~PIPE_WANTR;
1032 pipeselwakeup(wpipe);
1033 wpipe->pipe_state |= PIPE_WANTW;
1035 error = msleep(wpipe, PIPE_MTX(wpipe),
1036 PRIBIO | PCATCH, "pipdwc", 0);
1043 error = pipe_build_write_buffer(wpipe, uio);
1048 while (wpipe->pipe_pages.cnt != 0 &&
1049 (wpipe->pipe_state & PIPE_EOF) == 0) {
1050 if (wpipe->pipe_state & PIPE_WANTR) {
1051 wpipe->pipe_state &= ~PIPE_WANTR;
1054 pipeselwakeup(wpipe);
1055 wpipe->pipe_state |= PIPE_WANTW;
1057 error = msleep(wpipe, PIPE_MTX(wpipe), PRIBIO | PCATCH,
1064 if ((wpipe->pipe_state & PIPE_EOF) != 0) {
1065 wpipe->pipe_pages.cnt = 0;
1066 pipe_destroy_write_buffer(wpipe);
1067 pipeselwakeup(wpipe);
1069 } else if (error == EINTR || error == ERESTART) {
1070 pipe_clone_write_buffer(wpipe);
1072 pipe_destroy_write_buffer(wpipe);
1074 KASSERT((wpipe->pipe_state & PIPE_DIRECTW) == 0,
1075 ("pipe %p leaked PIPE_DIRECTW", wpipe));
1085 pipe_write(struct file *fp, struct uio *uio, struct ucred *active_cred,
1086 int flags, struct thread *td)
1088 struct pipe *wpipe, *rpipe;
1090 int desiredsize, error;
1093 wpipe = PIPE_PEER(rpipe);
1095 error = pipelock(wpipe, 1);
1101 * detect loss of pipe read side, issue SIGPIPE if lost.
1103 if (wpipe->pipe_present != PIPE_ACTIVE ||
1104 (wpipe->pipe_state & PIPE_EOF)) {
1110 error = mac_pipe_check_write(active_cred, wpipe->pipe_pair);
1119 /* Choose a larger size if it's advantageous */
1120 desiredsize = max(SMALL_PIPE_SIZE, wpipe->pipe_buffer.size);
1121 while (desiredsize < wpipe->pipe_buffer.cnt + uio->uio_resid) {
1122 if (piperesizeallowed != 1)
1124 if (amountpipekva > maxpipekva / 2)
1126 if (desiredsize == BIG_PIPE_SIZE)
1128 desiredsize = desiredsize * 2;
1131 /* Choose a smaller size if we're in a OOM situation */
1132 if (amountpipekva > (3 * maxpipekva) / 4 &&
1133 wpipe->pipe_buffer.size > SMALL_PIPE_SIZE &&
1134 wpipe->pipe_buffer.cnt <= SMALL_PIPE_SIZE &&
1135 piperesizeallowed == 1)
1136 desiredsize = SMALL_PIPE_SIZE;
1138 /* Resize if the above determined that a new size was necessary */
1139 if (desiredsize != wpipe->pipe_buffer.size &&
1140 (wpipe->pipe_state & PIPE_DIRECTW) == 0) {
1142 pipespace(wpipe, desiredsize);
1145 MPASS(wpipe->pipe_buffer.size != 0);
1147 orig_resid = uio->uio_resid;
1149 while (uio->uio_resid) {
1152 if (wpipe->pipe_state & PIPE_EOF) {
1156 #ifndef PIPE_NODIRECT
1158 * If the transfer is large, we can gain performance if
1159 * we do process-to-process copies directly.
1160 * If the write is non-blocking, we don't use the
1161 * direct write mechanism.
1163 * The direct write mechanism will detect the reader going
1166 if (uio->uio_segflg == UIO_USERSPACE &&
1167 uio->uio_iov->iov_len >= pipe_mindirect &&
1168 wpipe->pipe_buffer.size >= pipe_mindirect &&
1169 (fp->f_flag & FNONBLOCK) == 0) {
1170 error = pipe_direct_write(wpipe, uio);
1178 * Pipe buffered writes cannot be coincidental with
1179 * direct writes. We wait until the currently executing
1180 * direct write is completed before we start filling the
1181 * pipe buffer. We break out if a signal occurs or the
1184 if (wpipe->pipe_pages.cnt != 0) {
1185 if (wpipe->pipe_state & PIPE_WANTR) {
1186 wpipe->pipe_state &= ~PIPE_WANTR;
1189 pipeselwakeup(wpipe);
1190 wpipe->pipe_state |= PIPE_WANTW;
1192 error = msleep(wpipe, PIPE_MTX(rpipe), PRIBIO | PCATCH,
1200 space = wpipe->pipe_buffer.size - wpipe->pipe_buffer.cnt;
1202 /* Writes of size <= PIPE_BUF must be atomic. */
1203 if ((space < uio->uio_resid) && (orig_resid <= PIPE_BUF))
1207 int size; /* Transfer size */
1208 int segsize; /* first segment to transfer */
1211 * Transfer size is minimum of uio transfer
1212 * and free space in pipe buffer.
1214 if (space > uio->uio_resid)
1215 size = uio->uio_resid;
1219 * First segment to transfer is minimum of
1220 * transfer size and contiguous space in
1221 * pipe buffer. If first segment to transfer
1222 * is less than the transfer size, we've got
1223 * a wraparound in the buffer.
1225 segsize = wpipe->pipe_buffer.size -
1226 wpipe->pipe_buffer.in;
1230 /* Transfer first segment */
1233 error = uiomove(&wpipe->pipe_buffer.buffer[wpipe->pipe_buffer.in],
1237 if (error == 0 && segsize < size) {
1238 KASSERT(wpipe->pipe_buffer.in + segsize ==
1239 wpipe->pipe_buffer.size,
1240 ("Pipe buffer wraparound disappeared"));
1242 * Transfer remaining part now, to
1243 * support atomic writes. Wraparound
1249 &wpipe->pipe_buffer.buffer[0],
1250 size - segsize, uio);
1254 wpipe->pipe_buffer.in += size;
1255 if (wpipe->pipe_buffer.in >=
1256 wpipe->pipe_buffer.size) {
1257 KASSERT(wpipe->pipe_buffer.in ==
1259 wpipe->pipe_buffer.size,
1260 ("Expected wraparound bad"));
1261 wpipe->pipe_buffer.in = size - segsize;
1264 wpipe->pipe_buffer.cnt += size;
1265 KASSERT(wpipe->pipe_buffer.cnt <=
1266 wpipe->pipe_buffer.size,
1267 ("Pipe buffer overflow"));
1274 * If the "read-side" has been blocked, wake it up now.
1276 if (wpipe->pipe_state & PIPE_WANTR) {
1277 wpipe->pipe_state &= ~PIPE_WANTR;
1282 * don't block on non-blocking I/O
1284 if (fp->f_flag & FNONBLOCK) {
1290 * We have no more space and have something to offer,
1291 * wake up select/poll.
1293 pipeselwakeup(wpipe);
1295 wpipe->pipe_state |= PIPE_WANTW;
1297 error = msleep(wpipe, PIPE_MTX(rpipe),
1298 PRIBIO | PCATCH, "pipewr", 0);
1308 if ((wpipe->pipe_busy == 0) && (wpipe->pipe_state & PIPE_WANT)) {
1309 wpipe->pipe_state &= ~(PIPE_WANT | PIPE_WANTR);
1311 } else if (wpipe->pipe_buffer.cnt > 0) {
1313 * If we have put any characters in the buffer, we wake up
1316 if (wpipe->pipe_state & PIPE_WANTR) {
1317 wpipe->pipe_state &= ~PIPE_WANTR;
1323 * Don't return EPIPE if any byte was written.
1324 * EINTR and other interrupts are handled by generic I/O layer.
1325 * Do not pretend that I/O succeeded for obvious user error
1328 if (uio->uio_resid != orig_resid && error == EPIPE)
1332 pipe_timestamp(&wpipe->pipe_mtime);
1335 * We have something to offer,
1336 * wake up select/poll.
1338 if (wpipe->pipe_buffer.cnt)
1339 pipeselwakeup(wpipe);
1343 if (uio->uio_resid != orig_resid)
1344 td->td_ru.ru_msgsnd++;
1350 pipe_truncate(struct file *fp, off_t length, struct ucred *active_cred,
1357 if (cpipe->pipe_type & PIPE_TYPE_NAMED)
1358 error = vnops.fo_truncate(fp, length, active_cred, td);
1360 error = invfo_truncate(fp, length, active_cred, td);
1365 * we implement a very minimal set of ioctls for compatibility with sockets.
1368 pipe_ioctl(struct file *fp, u_long cmd, void *data, struct ucred *active_cred,
1371 struct pipe *mpipe = fp->f_data;
1377 error = mac_pipe_check_ioctl(active_cred, mpipe->pipe_pair, cmd, data);
1391 mpipe->pipe_state |= PIPE_ASYNC;
1393 mpipe->pipe_state &= ~PIPE_ASYNC;
1398 if (!(fp->f_flag & FREAD)) {
1403 if (mpipe->pipe_pages.cnt != 0)
1404 *(int *)data = mpipe->pipe_pages.cnt;
1406 *(int *)data = mpipe->pipe_buffer.cnt;
1411 error = fsetown(*(int *)data, &mpipe->pipe_sigio);
1415 *(int *)data = fgetown(&mpipe->pipe_sigio);
1418 /* This is deprecated, FIOSETOWN should be used instead. */
1421 error = fsetown(-(*(int *)data), &mpipe->pipe_sigio);
1424 /* This is deprecated, FIOGETOWN should be used instead. */
1426 *(int *)data = -fgetown(&mpipe->pipe_sigio);
1439 pipe_poll(struct file *fp, int events, struct ucred *active_cred,
1444 int levents, revents;
1451 wpipe = PIPE_PEER(rpipe);
1454 error = mac_pipe_check_poll(active_cred, rpipe->pipe_pair);
1458 if (fp->f_flag & FREAD && events & (POLLIN | POLLRDNORM))
1459 if (rpipe->pipe_pages.cnt > 0 || rpipe->pipe_buffer.cnt > 0)
1460 revents |= events & (POLLIN | POLLRDNORM);
1462 if (fp->f_flag & FWRITE && events & (POLLOUT | POLLWRNORM))
1463 if (wpipe->pipe_present != PIPE_ACTIVE ||
1464 (wpipe->pipe_state & PIPE_EOF) ||
1465 ((wpipe->pipe_state & PIPE_DIRECTW) == 0 &&
1466 ((wpipe->pipe_buffer.size - wpipe->pipe_buffer.cnt) >= PIPE_BUF ||
1467 wpipe->pipe_buffer.size == 0)))
1468 revents |= events & (POLLOUT | POLLWRNORM);
1471 (POLLIN | POLLINIGNEOF | POLLPRI | POLLRDNORM | POLLRDBAND);
1472 if (rpipe->pipe_type & PIPE_TYPE_NAMED && fp->f_flag & FREAD && levents &&
1473 fp->f_pipegen == rpipe->pipe_wgen)
1474 events |= POLLINIGNEOF;
1476 if ((events & POLLINIGNEOF) == 0) {
1477 if (rpipe->pipe_state & PIPE_EOF) {
1478 if (fp->f_flag & FREAD)
1479 revents |= (events & (POLLIN | POLLRDNORM));
1480 if (wpipe->pipe_present != PIPE_ACTIVE ||
1481 (wpipe->pipe_state & PIPE_EOF))
1488 * Add ourselves regardless of eventmask as we have to return
1489 * POLLHUP even if it was not asked for.
1491 if ((fp->f_flag & FREAD) != 0) {
1492 selrecord(td, &rpipe->pipe_sel);
1493 if (SEL_WAITING(&rpipe->pipe_sel))
1494 rpipe->pipe_state |= PIPE_SEL;
1497 if ((fp->f_flag & FWRITE) != 0 &&
1498 wpipe->pipe_present == PIPE_ACTIVE) {
1499 selrecord(td, &wpipe->pipe_sel);
1500 if (SEL_WAITING(&wpipe->pipe_sel))
1501 wpipe->pipe_state |= PIPE_SEL;
1513 * We shouldn't need locks here as we're doing a read and this should
1514 * be a natural race.
1517 pipe_stat(struct file *fp, struct stat *ub, struct ucred *active_cred,
1527 if (mac_pipe_check_stat_enabled()) {
1529 error = mac_pipe_check_stat(active_cred, pipe->pipe_pair);
1537 /* For named pipes ask the underlying filesystem. */
1538 if (pipe->pipe_type & PIPE_TYPE_NAMED) {
1539 return (vnops.fo_stat(fp, ub, active_cred, td));
1542 bzero(ub, sizeof(*ub));
1543 ub->st_mode = S_IFIFO;
1544 ub->st_blksize = PAGE_SIZE;
1545 if (pipe->pipe_pages.cnt != 0)
1546 ub->st_size = pipe->pipe_pages.cnt;
1548 ub->st_size = pipe->pipe_buffer.cnt;
1549 ub->st_blocks = howmany(ub->st_size, ub->st_blksize);
1550 ub->st_atim = pipe->pipe_atime;
1551 ub->st_mtim = pipe->pipe_mtime;
1552 ub->st_ctim = pipe->pipe_ctime;
1553 ub->st_uid = fp->f_cred->cr_uid;
1554 ub->st_gid = fp->f_cred->cr_gid;
1555 ub->st_dev = pipedev_ino;
1556 ub->st_ino = pipe->pipe_ino;
1558 * Left as 0: st_nlink, st_rdev, st_flags, st_gen.
1565 pipe_close(struct file *fp, struct thread *td)
1568 if (fp->f_vnode != NULL)
1569 return vnops.fo_close(fp, td);
1570 fp->f_ops = &badfileops;
1571 pipe_dtor(fp->f_data);
1577 pipe_chmod(struct file *fp, mode_t mode, struct ucred *active_cred, struct thread *td)
1583 if (cpipe->pipe_type & PIPE_TYPE_NAMED)
1584 error = vn_chmod(fp, mode, active_cred, td);
1586 error = invfo_chmod(fp, mode, active_cred, td);
1591 pipe_chown(struct file *fp, uid_t uid, gid_t gid, struct ucred *active_cred,
1598 if (cpipe->pipe_type & PIPE_TYPE_NAMED)
1599 error = vn_chown(fp, uid, gid, active_cred, td);
1601 error = invfo_chown(fp, uid, gid, active_cred, td);
1606 pipe_fill_kinfo(struct file *fp, struct kinfo_file *kif, struct filedesc *fdp)
1610 if (fp->f_type == DTYPE_FIFO)
1611 return (vn_fill_kinfo(fp, kif, fdp));
1612 kif->kf_type = KF_TYPE_PIPE;
1614 kif->kf_un.kf_pipe.kf_pipe_addr = (uintptr_t)pi;
1615 kif->kf_un.kf_pipe.kf_pipe_peer = (uintptr_t)pi->pipe_peer;
1616 kif->kf_un.kf_pipe.kf_pipe_buffer_cnt = pi->pipe_buffer.cnt;
1621 pipe_free_kmem(struct pipe *cpipe)
1624 KASSERT(!mtx_owned(PIPE_MTX(cpipe)),
1625 ("pipe_free_kmem: pipe mutex locked"));
1627 if (cpipe->pipe_buffer.buffer != NULL) {
1628 atomic_subtract_long(&amountpipekva, cpipe->pipe_buffer.size);
1629 vm_map_remove(pipe_map,
1630 (vm_offset_t)cpipe->pipe_buffer.buffer,
1631 (vm_offset_t)cpipe->pipe_buffer.buffer + cpipe->pipe_buffer.size);
1632 cpipe->pipe_buffer.buffer = NULL;
1634 #ifndef PIPE_NODIRECT
1636 cpipe->pipe_pages.cnt = 0;
1637 cpipe->pipe_pages.pos = 0;
1638 cpipe->pipe_pages.npages = 0;
1647 pipeclose(struct pipe *cpipe)
1649 struct pipepair *pp;
1652 KASSERT(cpipe != NULL, ("pipeclose: cpipe == NULL"));
1656 pp = cpipe->pipe_pair;
1659 * If the other side is blocked, wake it up saying that
1660 * we want to close it down.
1662 cpipe->pipe_state |= PIPE_EOF;
1663 while (cpipe->pipe_busy) {
1665 cpipe->pipe_state |= PIPE_WANT;
1667 msleep(cpipe, PIPE_MTX(cpipe), PRIBIO, "pipecl", 0);
1671 pipeselwakeup(cpipe);
1674 * Disconnect from peer, if any.
1676 ppipe = cpipe->pipe_peer;
1677 if (ppipe->pipe_present == PIPE_ACTIVE) {
1678 ppipe->pipe_state |= PIPE_EOF;
1680 pipeselwakeup(ppipe);
1684 * Mark this endpoint as free. Release kmem resources. We
1685 * don't mark this endpoint as unused until we've finished
1686 * doing that, or the pipe might disappear out from under
1690 pipe_free_kmem(cpipe);
1692 cpipe->pipe_present = PIPE_CLOSING;
1696 * knlist_clear() may sleep dropping the PIPE_MTX. Set the
1697 * PIPE_FINALIZED, that allows other end to free the
1698 * pipe_pair, only after the knotes are completely dismantled.
1700 knlist_clear(&cpipe->pipe_sel.si_note, 1);
1701 cpipe->pipe_present = PIPE_FINALIZED;
1702 seldrain(&cpipe->pipe_sel);
1703 knlist_destroy(&cpipe->pipe_sel.si_note);
1706 * If both endpoints are now closed, release the memory for the
1707 * pipe pair. If not, unlock.
1709 if (ppipe->pipe_present == PIPE_FINALIZED) {
1712 mac_pipe_destroy(pp);
1714 uma_zfree(pipe_zone, cpipe->pipe_pair);
1721 pipe_kqfilter(struct file *fp, struct knote *kn)
1726 * If a filter is requested that is not supported by this file
1727 * descriptor, don't return an error, but also don't ever generate an
1730 if ((kn->kn_filter == EVFILT_READ) && !(fp->f_flag & FREAD)) {
1731 kn->kn_fop = &pipe_nfiltops;
1734 if ((kn->kn_filter == EVFILT_WRITE) && !(fp->f_flag & FWRITE)) {
1735 kn->kn_fop = &pipe_nfiltops;
1740 switch (kn->kn_filter) {
1742 kn->kn_fop = &pipe_rfiltops;
1745 kn->kn_fop = &pipe_wfiltops;
1746 if (cpipe->pipe_peer->pipe_present != PIPE_ACTIVE) {
1747 /* other end of pipe has been closed */
1751 cpipe = PIPE_PEER(cpipe);
1758 kn->kn_hook = cpipe;
1759 knlist_add(&cpipe->pipe_sel.si_note, kn, 1);
1765 filt_pipedetach(struct knote *kn)
1767 struct pipe *cpipe = kn->kn_hook;
1770 knlist_remove(&cpipe->pipe_sel.si_note, kn, 1);
1776 filt_piperead(struct knote *kn, long hint)
1778 struct file *fp = kn->kn_fp;
1779 struct pipe *rpipe = kn->kn_hook;
1781 PIPE_LOCK_ASSERT(rpipe, MA_OWNED);
1782 kn->kn_data = rpipe->pipe_buffer.cnt;
1783 if (kn->kn_data == 0)
1784 kn->kn_data = rpipe->pipe_pages.cnt;
1786 if ((rpipe->pipe_state & PIPE_EOF) != 0 &&
1787 ((rpipe->pipe_type & PIPE_TYPE_NAMED) == 0 ||
1788 fp->f_pipegen != rpipe->pipe_wgen)) {
1789 kn->kn_flags |= EV_EOF;
1792 kn->kn_flags &= ~EV_EOF;
1793 return (kn->kn_data > 0);
1798 filt_pipewrite(struct knote *kn, long hint)
1800 struct pipe *wpipe = kn->kn_hook;
1803 * If this end of the pipe is closed, the knote was removed from the
1804 * knlist and the list lock (i.e., the pipe lock) is therefore not held.
1806 if (wpipe->pipe_present == PIPE_ACTIVE ||
1807 (wpipe->pipe_type & PIPE_TYPE_NAMED) != 0) {
1808 PIPE_LOCK_ASSERT(wpipe, MA_OWNED);
1810 if (wpipe->pipe_state & PIPE_DIRECTW) {
1812 } else if (wpipe->pipe_buffer.size > 0) {
1813 kn->kn_data = wpipe->pipe_buffer.size -
1814 wpipe->pipe_buffer.cnt;
1816 kn->kn_data = PIPE_BUF;
1820 if (wpipe->pipe_present != PIPE_ACTIVE ||
1821 (wpipe->pipe_state & PIPE_EOF)) {
1822 kn->kn_flags |= EV_EOF;
1825 kn->kn_flags &= ~EV_EOF;
1826 return (kn->kn_data >= PIPE_BUF);
1830 filt_pipedetach_notsup(struct knote *kn)
1836 filt_pipenotsup(struct knote *kn, long hint)