sys_pipe.c revision 30164
1/*
2 * Copyright (c) 1996 John S. Dyson
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice immediately at the beginning of the file, without modification,
10 *    this list of conditions, and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 *    notice, this list of conditions and the following disclaimer in the
13 *    documentation and/or other materials provided with the distribution.
14 * 3. Absolutely no warranty of function or purpose is made by the author
15 *    John S. Dyson.
16 * 4. Modifications may be freely made to this file if the above conditions
17 *    are met.
18 *
19 * $Id: sys_pipe.c,v 1.33 1997/09/14 02:43:25 peter Exp $
20 */
21
22/*
23 * This file contains a high-performance replacement for the socket-based
24 * pipes scheme originally used in FreeBSD/4.4Lite.  It does not support
25 * all features of sockets, but does do everything that pipes normally
26 * do.
27 */
28
29/*
30 * This code has two modes of operation, a small write mode and a large
31 * write mode.  The small write mode acts like conventional pipes with
32 * a kernel buffer.  If the buffer is less than PIPE_MINDIRECT, then the
33 * "normal" pipe buffering is done.  If the buffer is between PIPE_MINDIRECT
34 * and PIPE_SIZE in size, it is fully mapped and wired into the kernel, and
35 * the receiving process can copy it directly from the pages in the sending
36 * process.
37 *
38 * If the sending process receives a signal, it is possible that it will
39 * go away, and certainly its address space can change, because control
40 * is returned back to the user-mode side.  In that case, the pipe code
41 * arranges to copy the buffer supplied by the user process, to a pageable
42 * kernel buffer, and the receiving process will grab the data from the
43 * pageable kernel buffer.  Since signals don't happen all that often,
44 * the copy operation is normally eliminated.
45 *
46 * The constant PIPE_MINDIRECT is chosen to make sure that buffering will
47 * happen for small transfers so that the system will not spend all of
48 * its time context switching.  PIPE_SIZE is constrained by the
49 * amount of kernel virtual memory.
50 */
51
52#include <sys/param.h>
53#include <sys/systm.h>
54#include <sys/proc.h>
55#include <sys/fcntl.h>
56#include <sys/file.h>
57#include <sys/filedesc.h>
58#include <sys/filio.h>
59#include <sys/ttycom.h>
60#include <sys/stat.h>
61#include <sys/poll.h>
62#include <sys/signalvar.h>
63#include <sys/sysproto.h>
64#include <sys/pipe.h>
65
66#include <vm/vm.h>
67#include <vm/vm_prot.h>
68#include <vm/vm_param.h>
69#include <sys/lock.h>
70#include <vm/vm_object.h>
71#include <vm/vm_kern.h>
72#include <vm/vm_extern.h>
73#include <vm/pmap.h>
74#include <vm/vm_map.h>
75#include <vm/vm_page.h>
76#include <vm/vm_zone.h>
77
78/*
79 * Use this define if you want to disable *fancy* VM things.  Expect an
80 * approx 30% decrease in transfer rate.  This could be useful for
81 * NetBSD or OpenBSD.
82 */
83/* #define PIPE_NODIRECT */
84
85/*
86 * interfaces to the outside world
87 */
88static int pipe_read __P((struct file *fp, struct uio *uio,
89		struct ucred *cred));
90static int pipe_write __P((struct file *fp, struct uio *uio,
91		struct ucred *cred));
92static int pipe_close __P((struct file *fp, struct proc *p));
93static int pipe_poll __P((struct file *fp, int events, struct ucred *cred,
94		struct proc *p));
95static int pipe_ioctl __P((struct file *fp, int cmd, caddr_t data, struct proc *p));
96
97static struct fileops pipeops =
98    { pipe_read, pipe_write, pipe_ioctl, pipe_poll, pipe_close };
99
100/*
101 * Default pipe buffer size(s), this can be kind-of large now because pipe
102 * space is pageable.  The pipe code will try to maintain locality of
103 * reference for performance reasons, so small amounts of outstanding I/O
104 * will not wipe the cache.
105 */
106#define MINPIPESIZE (PIPE_SIZE/3)
107#define MAXPIPESIZE (2*PIPE_SIZE/3)
108
109/*
110 * Maximum amount of kva for pipes -- this is kind-of a soft limit, but
111 * is there so that on large systems, we don't exhaust it.
112 */
113#define MAXPIPEKVA (8*1024*1024)
114
115/*
116 * Limit for direct transfers, we cannot, of course limit
117 * the amount of kva for pipes in general though.
118 */
119#define LIMITPIPEKVA (16*1024*1024)
120
121/*
122 * Limit the number of "big" pipes
123 */
124#define LIMITBIGPIPES	32
125int nbigpipe;
126
127static int amountpipekva;
128
129static void pipeclose __P((struct pipe *cpipe));
130static void pipeinit __P((struct pipe *cpipe));
131static __inline int pipelock __P((struct pipe *cpipe, int catch));
132static __inline void pipeunlock __P((struct pipe *cpipe));
133static __inline void pipeselwakeup __P((struct pipe *cpipe));
134#ifndef PIPE_NODIRECT
135static int pipe_build_write_buffer __P((struct pipe *wpipe, struct uio *uio));
136static void pipe_destroy_write_buffer __P((struct pipe *wpipe));
137static int pipe_direct_write __P((struct pipe *wpipe, struct uio *uio));
138static void pipe_clone_write_buffer __P((struct pipe *wpipe));
139#endif
140static void pipespace __P((struct pipe *cpipe));
141
142vm_zone_t pipe_zone;
143
144/*
145 * The pipe system call for the DTYPE_PIPE type of pipes
146 */
147
148/* ARGSUSED */
149int
150pipe(p, uap, retval)
151	struct proc *p;
152	struct pipe_args /* {
153		int	dummy;
154	} */ *uap;
155	int retval[];
156{
157	register struct filedesc *fdp = p->p_fd;
158	struct file *rf, *wf;
159	struct pipe *rpipe, *wpipe;
160	int fd, error;
161
162	if (pipe_zone == NULL)
163		pipe_zone = zinit("PIPE", sizeof (struct pipe), 0, 0, 4);
164
165	rpipe = zalloc( pipe_zone);
166	pipeinit(rpipe);
167	rpipe->pipe_state |= PIPE_DIRECTOK;
168	wpipe = zalloc( pipe_zone);
169	pipeinit(wpipe);
170	wpipe->pipe_state |= PIPE_DIRECTOK;
171
172	error = falloc(p, &rf, &fd);
173	if (error)
174		goto free2;
175	retval[0] = fd;
176	rf->f_flag = FREAD | FWRITE;
177	rf->f_type = DTYPE_PIPE;
178	rf->f_ops = &pipeops;
179	rf->f_data = (caddr_t)rpipe;
180	error = falloc(p, &wf, &fd);
181	if (error)
182		goto free3;
183	wf->f_flag = FREAD | FWRITE;
184	wf->f_type = DTYPE_PIPE;
185	wf->f_ops = &pipeops;
186	wf->f_data = (caddr_t)wpipe;
187	retval[1] = fd;
188
189	rpipe->pipe_peer = wpipe;
190	wpipe->pipe_peer = rpipe;
191
192	return (0);
193free3:
194	ffree(rf);
195	fdp->fd_ofiles[retval[0]] = 0;
196free2:
197	(void)pipeclose(wpipe);
198	(void)pipeclose(rpipe);
199	return (error);
200}
201
202/*
203 * Allocate kva for pipe circular buffer, the space is pageable
204 */
205static void
206pipespace(cpipe)
207	struct pipe *cpipe;
208{
209	int npages, error;
210
211	npages = round_page(cpipe->pipe_buffer.size)/PAGE_SIZE;
212	/*
213	 * Create an object, I don't like the idea of paging to/from
214	 * kernel_object.
215	 * XXX -- minor change needed here for NetBSD/OpenBSD VM systems.
216	 */
217	cpipe->pipe_buffer.object = vm_object_allocate(OBJT_DEFAULT, npages);
218	cpipe->pipe_buffer.buffer = (caddr_t) vm_map_min(kernel_map);
219
220	/*
221	 * Insert the object into the kernel map, and allocate kva for it.
222	 * The map entry is, by default, pageable.
223	 * XXX -- minor change needed here for NetBSD/OpenBSD VM systems.
224	 */
225	error = vm_map_find(kernel_map, cpipe->pipe_buffer.object, 0,
226		(vm_offset_t *) &cpipe->pipe_buffer.buffer,
227		cpipe->pipe_buffer.size, 1,
228		VM_PROT_ALL, VM_PROT_ALL, 0);
229
230	if (error != KERN_SUCCESS)
231		panic("pipeinit: cannot allocate pipe -- out of kvm -- code = %d", error);
232	amountpipekva += cpipe->pipe_buffer.size;
233}
234
235/*
236 * initialize and allocate VM and memory for pipe
237 */
238static void
239pipeinit(cpipe)
240	struct pipe *cpipe;
241{
242	int s;
243
244	cpipe->pipe_buffer.in = 0;
245	cpipe->pipe_buffer.out = 0;
246	cpipe->pipe_buffer.cnt = 0;
247	cpipe->pipe_buffer.size = PIPE_SIZE;
248
249	/* Buffer kva gets dynamically allocated */
250	cpipe->pipe_buffer.buffer = NULL;
251	/* cpipe->pipe_buffer.object = invalid */
252
253	cpipe->pipe_state = 0;
254	cpipe->pipe_peer = NULL;
255	cpipe->pipe_busy = 0;
256	gettime(&cpipe->pipe_ctime);
257	cpipe->pipe_atime = cpipe->pipe_ctime;
258	cpipe->pipe_mtime = cpipe->pipe_ctime;
259	bzero(&cpipe->pipe_sel, sizeof cpipe->pipe_sel);
260	cpipe->pipe_pgid = NO_PID;
261
262#ifndef PIPE_NODIRECT
263	/*
264	 * pipe data structure initializations to support direct pipe I/O
265	 */
266	cpipe->pipe_map.cnt = 0;
267	cpipe->pipe_map.kva = 0;
268	cpipe->pipe_map.pos = 0;
269	cpipe->pipe_map.npages = 0;
270	/* cpipe->pipe_map.ms[] = invalid */
271#endif
272}
273
274
275/*
276 * lock a pipe for I/O, blocking other access
277 */
278static __inline int
279pipelock(cpipe, catch)
280	struct pipe *cpipe;
281	int catch;
282{
283	int error;
284	while (cpipe->pipe_state & PIPE_LOCK) {
285		cpipe->pipe_state |= PIPE_LWANT;
286		if (error = tsleep( cpipe,
287			catch?(PRIBIO|PCATCH):PRIBIO, "pipelk", 0)) {
288			return error;
289		}
290	}
291	cpipe->pipe_state |= PIPE_LOCK;
292	return 0;
293}
294
295/*
296 * unlock a pipe I/O lock
297 */
298static __inline void
299pipeunlock(cpipe)
300	struct pipe *cpipe;
301{
302	cpipe->pipe_state &= ~PIPE_LOCK;
303	if (cpipe->pipe_state & PIPE_LWANT) {
304		cpipe->pipe_state &= ~PIPE_LWANT;
305		wakeup(cpipe);
306	}
307}
308
309static __inline void
310pipeselwakeup(cpipe)
311	struct pipe *cpipe;
312{
313	struct proc *p;
314
315	if (cpipe->pipe_state & PIPE_SEL) {
316		cpipe->pipe_state &= ~PIPE_SEL;
317		selwakeup(&cpipe->pipe_sel);
318	}
319	if (cpipe->pipe_state & PIPE_ASYNC) {
320		if (cpipe->pipe_pgid < 0)
321			gsignal(-cpipe->pipe_pgid, SIGIO);
322		else if ((p = pfind(cpipe->pipe_pgid)) != NULL)
323			psignal(p, SIGIO);
324	}
325}
326
327/* ARGSUSED */
328static int
329pipe_read(fp, uio, cred)
330	struct file *fp;
331	struct uio *uio;
332	struct ucred *cred;
333{
334
335	struct pipe *rpipe = (struct pipe *) fp->f_data;
336	int error = 0;
337	int nread = 0;
338	u_int size;
339
340	++rpipe->pipe_busy;
341	while (uio->uio_resid) {
342		/*
343		 * normal pipe buffer receive
344		 */
345		if (rpipe->pipe_buffer.cnt > 0) {
346			size = rpipe->pipe_buffer.size - rpipe->pipe_buffer.out;
347			if (size > rpipe->pipe_buffer.cnt)
348				size = rpipe->pipe_buffer.cnt;
349			if (size > (u_int) uio->uio_resid)
350				size = (u_int) uio->uio_resid;
351			if ((error = pipelock(rpipe,1)) == 0) {
352				error = uiomove( &rpipe->pipe_buffer.buffer[rpipe->pipe_buffer.out],
353					size, uio);
354				pipeunlock(rpipe);
355			}
356			if (error) {
357				break;
358			}
359			rpipe->pipe_buffer.out += size;
360			if (rpipe->pipe_buffer.out >= rpipe->pipe_buffer.size)
361				rpipe->pipe_buffer.out = 0;
362
363			rpipe->pipe_buffer.cnt -= size;
364			nread += size;
365#ifndef PIPE_NODIRECT
366		/*
367		 * Direct copy, bypassing a kernel buffer.
368		 */
369		} else if ((size = rpipe->pipe_map.cnt) &&
370			(rpipe->pipe_state & PIPE_DIRECTW)) {
371			caddr_t va;
372			if (size > (u_int) uio->uio_resid)
373				size = (u_int) uio->uio_resid;
374			if ((error = pipelock(rpipe,1)) == 0) {
375				va = (caddr_t) rpipe->pipe_map.kva + rpipe->pipe_map.pos;
376				error = uiomove(va, size, uio);
377				pipeunlock(rpipe);
378			}
379			if (error)
380				break;
381			nread += size;
382			rpipe->pipe_map.pos += size;
383			rpipe->pipe_map.cnt -= size;
384			if (rpipe->pipe_map.cnt == 0) {
385				rpipe->pipe_state &= ~PIPE_DIRECTW;
386				wakeup(rpipe);
387			}
388#endif
389		} else {
390			/*
391			 * detect EOF condition
392			 */
393			if (rpipe->pipe_state & PIPE_EOF) {
394				/* XXX error = ? */
395				break;
396			}
397			/*
398			 * If the "write-side" has been blocked, wake it up now.
399			 */
400			if (rpipe->pipe_state & PIPE_WANTW) {
401				rpipe->pipe_state &= ~PIPE_WANTW;
402				wakeup(rpipe);
403			}
404			if (nread > 0)
405				break;
406
407			if (fp->f_flag & FNONBLOCK) {
408				error = EAGAIN;
409				break;
410			}
411
412			/*
413			 * If there is no more to read in the pipe, reset
414			 * its pointers to the beginning.  This improves
415			 * cache hit stats.
416			 */
417
418			if ((error = pipelock(rpipe,1)) == 0) {
419				if (rpipe->pipe_buffer.cnt == 0) {
420					rpipe->pipe_buffer.in = 0;
421					rpipe->pipe_buffer.out = 0;
422				}
423				pipeunlock(rpipe);
424			} else {
425				break;
426			}
427
428			if (rpipe->pipe_state & PIPE_WANTW) {
429				rpipe->pipe_state &= ~PIPE_WANTW;
430				wakeup(rpipe);
431			}
432
433			rpipe->pipe_state |= PIPE_WANTR;
434			if (error = tsleep(rpipe, PRIBIO|PCATCH, "piperd", 0)) {
435				break;
436			}
437		}
438	}
439
440	if (error == 0)
441		gettime(&rpipe->pipe_atime);
442
443	--rpipe->pipe_busy;
444	if ((rpipe->pipe_busy == 0) && (rpipe->pipe_state & PIPE_WANT)) {
445		rpipe->pipe_state &= ~(PIPE_WANT|PIPE_WANTW);
446		wakeup(rpipe);
447	} else if (rpipe->pipe_buffer.cnt < MINPIPESIZE) {
448		/*
449		 * If there is no more to read in the pipe, reset
450		 * its pointers to the beginning.  This improves
451		 * cache hit stats.
452		 */
453		if (rpipe->pipe_buffer.cnt == 0) {
454			if ((error == 0) && (error = pipelock(rpipe,1)) == 0) {
455				rpipe->pipe_buffer.in = 0;
456				rpipe->pipe_buffer.out = 0;
457				pipeunlock(rpipe);
458			}
459		}
460
461		/*
462		 * If the "write-side" has been blocked, wake it up now.
463		 */
464		if (rpipe->pipe_state & PIPE_WANTW) {
465			rpipe->pipe_state &= ~PIPE_WANTW;
466			wakeup(rpipe);
467		}
468	}
469
470	if ((rpipe->pipe_buffer.size - rpipe->pipe_buffer.cnt) >= PIPE_BUF)
471		pipeselwakeup(rpipe);
472
473	return error;
474}
475
476#ifndef PIPE_NODIRECT
477/*
478 * Map the sending processes' buffer into kernel space and wire it.
479 * This is similar to a physical write operation.
480 */
481static int
482pipe_build_write_buffer(wpipe, uio)
483	struct pipe *wpipe;
484	struct uio *uio;
485{
486	u_int size;
487	int i;
488	vm_offset_t addr, endaddr, paddr;
489
490	size = (u_int) uio->uio_iov->iov_len;
491	if (size > wpipe->pipe_buffer.size)
492		size = wpipe->pipe_buffer.size;
493
494	endaddr = round_page(uio->uio_iov->iov_base + size);
495	for(i = 0, addr = trunc_page(uio->uio_iov->iov_base);
496		addr < endaddr;
497		addr += PAGE_SIZE, i+=1) {
498
499		vm_page_t m;
500
501		vm_fault_quick( (caddr_t) addr, VM_PROT_READ);
502		paddr = pmap_kextract(addr);
503		if (!paddr) {
504			int j;
505			for(j=0;j<i;j++)
506				vm_page_unwire(wpipe->pipe_map.ms[j]);
507			return EFAULT;
508		}
509
510		m = PHYS_TO_VM_PAGE(paddr);
511		vm_page_wire(m);
512		wpipe->pipe_map.ms[i] = m;
513	}
514
515/*
516 * set up the control block
517 */
518	wpipe->pipe_map.npages = i;
519	wpipe->pipe_map.pos = ((vm_offset_t) uio->uio_iov->iov_base) & PAGE_MASK;
520	wpipe->pipe_map.cnt = size;
521
522/*
523 * and map the buffer
524 */
525	if (wpipe->pipe_map.kva == 0) {
526		/*
527		 * We need to allocate space for an extra page because the
528		 * address range might (will) span pages at times.
529		 */
530		wpipe->pipe_map.kva = kmem_alloc_pageable(kernel_map,
531			wpipe->pipe_buffer.size + PAGE_SIZE);
532		amountpipekva += wpipe->pipe_buffer.size + PAGE_SIZE;
533	}
534	pmap_qenter(wpipe->pipe_map.kva, wpipe->pipe_map.ms,
535		wpipe->pipe_map.npages);
536
537/*
538 * and update the uio data
539 */
540
541	uio->uio_iov->iov_len -= size;
542	uio->uio_iov->iov_base += size;
543	if (uio->uio_iov->iov_len == 0)
544		uio->uio_iov++;
545	uio->uio_resid -= size;
546	uio->uio_offset += size;
547	return 0;
548}
549
550/*
551 * unmap and unwire the process buffer
552 */
553static void
554pipe_destroy_write_buffer(wpipe)
555struct pipe *wpipe;
556{
557	int i;
558	if (wpipe->pipe_map.kva) {
559		pmap_qremove(wpipe->pipe_map.kva, wpipe->pipe_map.npages);
560
561		if (amountpipekva > MAXPIPEKVA) {
562			vm_offset_t kva = wpipe->pipe_map.kva;
563			wpipe->pipe_map.kva = 0;
564			kmem_free(kernel_map, kva,
565				wpipe->pipe_buffer.size + PAGE_SIZE);
566			amountpipekva -= wpipe->pipe_buffer.size + PAGE_SIZE;
567		}
568	}
569	for (i=0;i<wpipe->pipe_map.npages;i++)
570		vm_page_unwire(wpipe->pipe_map.ms[i]);
571}
572
573/*
574 * In the case of a signal, the writing process might go away.  This
575 * code copies the data into the circular buffer so that the source
576 * pages can be freed without loss of data.
577 */
578static void
579pipe_clone_write_buffer(wpipe)
580struct pipe *wpipe;
581{
582	int size;
583	int pos;
584
585	size = wpipe->pipe_map.cnt;
586	pos = wpipe->pipe_map.pos;
587	bcopy((caddr_t) wpipe->pipe_map.kva+pos,
588			(caddr_t) wpipe->pipe_buffer.buffer,
589			size);
590
591	wpipe->pipe_buffer.in = size;
592	wpipe->pipe_buffer.out = 0;
593	wpipe->pipe_buffer.cnt = size;
594	wpipe->pipe_state &= ~PIPE_DIRECTW;
595
596	pipe_destroy_write_buffer(wpipe);
597}
598
599/*
600 * This implements the pipe buffer write mechanism.  Note that only
601 * a direct write OR a normal pipe write can be pending at any given time.
602 * If there are any characters in the pipe buffer, the direct write will
603 * be deferred until the receiving process grabs all of the bytes from
604 * the pipe buffer.  Then the direct mapping write is set-up.
605 */
606static int
607pipe_direct_write(wpipe, uio)
608	struct pipe *wpipe;
609	struct uio *uio;
610{
611	int error;
612retry:
613	while (wpipe->pipe_state & PIPE_DIRECTW) {
614		if ( wpipe->pipe_state & PIPE_WANTR) {
615			wpipe->pipe_state &= ~PIPE_WANTR;
616			wakeup(wpipe);
617		}
618		wpipe->pipe_state |= PIPE_WANTW;
619		error = tsleep(wpipe,
620				PRIBIO|PCATCH, "pipdww", 0);
621		if (error)
622			goto error1;
623		if (wpipe->pipe_state & PIPE_EOF) {
624			error = EPIPE;
625			goto error1;
626		}
627	}
628	wpipe->pipe_map.cnt = 0;	/* transfer not ready yet */
629	if (wpipe->pipe_buffer.cnt > 0) {
630		if ( wpipe->pipe_state & PIPE_WANTR) {
631			wpipe->pipe_state &= ~PIPE_WANTR;
632			wakeup(wpipe);
633		}
634
635		wpipe->pipe_state |= PIPE_WANTW;
636		error = tsleep(wpipe,
637				PRIBIO|PCATCH, "pipdwc", 0);
638		if (error)
639			goto error1;
640		if (wpipe->pipe_state & PIPE_EOF) {
641			error = EPIPE;
642			goto error1;
643		}
644		goto retry;
645	}
646
647	wpipe->pipe_state |= PIPE_DIRECTW;
648
649	error = pipe_build_write_buffer(wpipe, uio);
650	if (error) {
651		wpipe->pipe_state &= ~PIPE_DIRECTW;
652		goto error1;
653	}
654
655	error = 0;
656	while (!error && (wpipe->pipe_state & PIPE_DIRECTW)) {
657		if (wpipe->pipe_state & PIPE_EOF) {
658			pipelock(wpipe, 0);
659			pipe_destroy_write_buffer(wpipe);
660			pipeunlock(wpipe);
661			pipeselwakeup(wpipe);
662			error = EPIPE;
663			goto error1;
664		}
665		if (wpipe->pipe_state & PIPE_WANTR) {
666			wpipe->pipe_state &= ~PIPE_WANTR;
667			wakeup(wpipe);
668		}
669		pipeselwakeup(wpipe);
670		error = tsleep(wpipe, PRIBIO|PCATCH, "pipdwt", 0);
671	}
672
673	pipelock(wpipe,0);
674	if (wpipe->pipe_state & PIPE_DIRECTW) {
675		/*
676		 * this bit of trickery substitutes a kernel buffer for
677		 * the process that might be going away.
678		 */
679		pipe_clone_write_buffer(wpipe);
680	} else {
681		pipe_destroy_write_buffer(wpipe);
682	}
683	pipeunlock(wpipe);
684	return error;
685
686error1:
687	wakeup(wpipe);
688	return error;
689}
690#endif
691
692static int
693pipe_write(fp, uio, cred)
694	struct file *fp;
695	struct uio *uio;
696	struct ucred *cred;
697{
698	int error = 0;
699	int orig_resid;
700
701	struct pipe *wpipe, *rpipe;
702
703	rpipe = (struct pipe *) fp->f_data;
704	wpipe = rpipe->pipe_peer;
705
706	/*
707	 * detect loss of pipe read side, issue SIGPIPE if lost.
708	 */
709	if ((wpipe == NULL) || (wpipe->pipe_state & PIPE_EOF)) {
710		return EPIPE;
711	}
712
713	/*
714	 * If it is advantageous to resize the pipe buffer, do
715	 * so.
716	 */
717	if ((uio->uio_resid > PIPE_SIZE) &&
718		(nbigpipe < LIMITBIGPIPES) &&
719		(wpipe->pipe_state & PIPE_DIRECTW) == 0 &&
720		(wpipe->pipe_buffer.size <= PIPE_SIZE) &&
721		(wpipe->pipe_buffer.cnt == 0)) {
722
723		if (wpipe->pipe_buffer.buffer) {
724			amountpipekva -= wpipe->pipe_buffer.size;
725			kmem_free(kernel_map,
726				(vm_offset_t)wpipe->pipe_buffer.buffer,
727				wpipe->pipe_buffer.size);
728		}
729
730#ifndef PIPE_NODIRECT
731		if (wpipe->pipe_map.kva) {
732			amountpipekva -= wpipe->pipe_buffer.size + PAGE_SIZE;
733			kmem_free(kernel_map,
734				wpipe->pipe_map.kva,
735				wpipe->pipe_buffer.size + PAGE_SIZE);
736		}
737#endif
738
739		wpipe->pipe_buffer.in = 0;
740		wpipe->pipe_buffer.out = 0;
741		wpipe->pipe_buffer.cnt = 0;
742		wpipe->pipe_buffer.size = BIG_PIPE_SIZE;
743		wpipe->pipe_buffer.buffer = NULL;
744		++nbigpipe;
745
746#ifndef PIPE_NODIRECT
747		wpipe->pipe_map.cnt = 0;
748		wpipe->pipe_map.kva = 0;
749		wpipe->pipe_map.pos = 0;
750		wpipe->pipe_map.npages = 0;
751#endif
752
753	}
754
755
756	if( wpipe->pipe_buffer.buffer == NULL) {
757		if ((error = pipelock(wpipe,1)) == 0) {
758			pipespace(wpipe);
759			pipeunlock(wpipe);
760		} else {
761			return error;
762		}
763	}
764
765	++wpipe->pipe_busy;
766	orig_resid = uio->uio_resid;
767	while (uio->uio_resid) {
768		int space;
769#ifndef PIPE_NODIRECT
770		/*
771		 * If the transfer is large, we can gain performance if
772		 * we do process-to-process copies directly.
773		 * If the write is non-blocking, we don't use the
774		 * direct write mechanism.
775		 */
776		if ((uio->uio_iov->iov_len >= PIPE_MINDIRECT) &&
777		    (fp->f_flag & FNONBLOCK) == 0 &&
778			(wpipe->pipe_map.kva || (amountpipekva < LIMITPIPEKVA)) &&
779			(uio->uio_iov->iov_len >= PIPE_MINDIRECT)) {
780			error = pipe_direct_write( wpipe, uio);
781			if (error) {
782				break;
783			}
784			continue;
785		}
786#endif
787
788		/*
789		 * Pipe buffered writes cannot be coincidental with
790		 * direct writes.  We wait until the currently executing
791		 * direct write is completed before we start filling the
792		 * pipe buffer.
793		 */
794	retrywrite:
795		while (wpipe->pipe_state & PIPE_DIRECTW) {
796			if (wpipe->pipe_state & PIPE_WANTR) {
797				wpipe->pipe_state &= ~PIPE_WANTR;
798				wakeup(wpipe);
799			}
800			error = tsleep(wpipe,
801					PRIBIO|PCATCH, "pipbww", 0);
802			if (error)
803				break;
804		}
805
806		space = wpipe->pipe_buffer.size - wpipe->pipe_buffer.cnt;
807
808		/* Writes of size <= PIPE_BUF must be atomic. */
809		/* XXX perhaps they need to be contiguous to be atomic? */
810		if ((space < uio->uio_resid) && (orig_resid <= PIPE_BUF))
811			space = 0;
812
813		if (space > 0 && (wpipe->pipe_buffer.cnt < PIPE_SIZE)) {
814			/*
815			 * This set the maximum transfer as a segment of
816			 * the buffer.
817			 */
818			int size = wpipe->pipe_buffer.size - wpipe->pipe_buffer.in;
819			/*
820			 * space is the size left in the buffer
821			 */
822			if (size > space)
823				size = space;
824			/*
825			 * now limit it to the size of the uio transfer
826			 */
827			if (size > uio->uio_resid)
828				size = uio->uio_resid;
829			if ((error = pipelock(wpipe,1)) == 0) {
830				/*
831				 * It is possible for a direct write to
832				 * slip in on us... handle it here...
833				 */
834				if (wpipe->pipe_state & PIPE_DIRECTW) {
835					pipeunlock(wpipe);
836					goto retrywrite;
837				}
838				error = uiomove( &wpipe->pipe_buffer.buffer[wpipe->pipe_buffer.in],
839					size, uio);
840				pipeunlock(wpipe);
841			}
842			if (error)
843				break;
844
845			wpipe->pipe_buffer.in += size;
846			if (wpipe->pipe_buffer.in >= wpipe->pipe_buffer.size)
847				wpipe->pipe_buffer.in = 0;
848
849			wpipe->pipe_buffer.cnt += size;
850		} else {
851			/*
852			 * If the "read-side" has been blocked, wake it up now.
853			 */
854			if (wpipe->pipe_state & PIPE_WANTR) {
855				wpipe->pipe_state &= ~PIPE_WANTR;
856				wakeup(wpipe);
857			}
858
859			/*
860			 * don't block on non-blocking I/O
861			 */
862			if (fp->f_flag & FNONBLOCK) {
863				error = EAGAIN;
864				break;
865			}
866
867			/*
868			 * We have no more space and have something to offer,
869			 * wake up select/poll.
870			 */
871			pipeselwakeup(wpipe);
872
873			wpipe->pipe_state |= PIPE_WANTW;
874			if (error = tsleep(wpipe, (PRIBIO+1)|PCATCH, "pipewr", 0)) {
875				break;
876			}
877			/*
878			 * If read side wants to go away, we just issue a signal
879			 * to ourselves.
880			 */
881			if (wpipe->pipe_state & PIPE_EOF) {
882				error = EPIPE;
883				break;
884			}
885		}
886	}
887
888	--wpipe->pipe_busy;
889	if ((wpipe->pipe_busy == 0) &&
890		(wpipe->pipe_state & PIPE_WANT)) {
891		wpipe->pipe_state &= ~(PIPE_WANT|PIPE_WANTR);
892		wakeup(wpipe);
893	} else if (wpipe->pipe_buffer.cnt > 0) {
894		/*
895		 * If we have put any characters in the buffer, we wake up
896		 * the reader.
897		 */
898		if (wpipe->pipe_state & PIPE_WANTR) {
899			wpipe->pipe_state &= ~PIPE_WANTR;
900			wakeup(wpipe);
901		}
902	}
903
904	/*
905	 * Don't return EPIPE if I/O was successful
906	 */
907	if ((wpipe->pipe_buffer.cnt == 0) &&
908		(uio->uio_resid == 0) &&
909		(error == EPIPE))
910		error = 0;
911
912	if (error == 0)
913		gettime(&wpipe->pipe_mtime);
914
915	/*
916	 * We have something to offer,
917	 * wake up select/poll.
918	 */
919	if (wpipe->pipe_buffer.cnt)
920		pipeselwakeup(wpipe);
921
922	return error;
923}
924
925/*
926 * we implement a very minimal set of ioctls for compatibility with sockets.
927 */
928int
929pipe_ioctl(fp, cmd, data, p)
930	struct file *fp;
931	int cmd;
932	register caddr_t data;
933	struct proc *p;
934{
935	register struct pipe *mpipe = (struct pipe *)fp->f_data;
936
937	switch (cmd) {
938
939	case FIONBIO:
940		return (0);
941
942	case FIOASYNC:
943		if (*(int *)data) {
944			mpipe->pipe_state |= PIPE_ASYNC;
945		} else {
946			mpipe->pipe_state &= ~PIPE_ASYNC;
947		}
948		return (0);
949
950	case FIONREAD:
951		if (mpipe->pipe_state & PIPE_DIRECTW)
952			*(int *)data = mpipe->pipe_map.cnt;
953		else
954			*(int *)data = mpipe->pipe_buffer.cnt;
955		return (0);
956
957	case TIOCSPGRP:
958		mpipe->pipe_pgid = *(int *)data;
959		return (0);
960
961	case TIOCGPGRP:
962		*(int *)data = mpipe->pipe_pgid;
963		return (0);
964
965	}
966	return (ENOTTY);
967}
968
969int
970pipe_poll(fp, events, cred, p)
971	struct file *fp;
972	int events;
973	struct ucred *cred;
974	struct proc *p;
975{
976	register struct pipe *rpipe = (struct pipe *)fp->f_data;
977	struct pipe *wpipe;
978	int revents = 0;
979
980	wpipe = rpipe->pipe_peer;
981	if (events & (POLLIN | POLLRDNORM))
982		if ((rpipe->pipe_state & PIPE_DIRECTW) ||
983		    (rpipe->pipe_buffer.cnt > 0) ||
984		    (rpipe->pipe_state & PIPE_EOF))
985			revents |= events & (POLLIN | POLLRDNORM);
986
987	if (events & (POLLOUT | POLLWRNORM))
988		if (wpipe == NULL || (wpipe->pipe_state & PIPE_EOF) ||
989		    ((wpipe->pipe_state & PIPE_DIRECTW) == 0) &&
990		     (wpipe->pipe_buffer.size - wpipe->pipe_buffer.cnt) >= PIPE_BUF)
991			revents |= events & (POLLOUT | POLLWRNORM);
992
993	if ((rpipe->pipe_state & PIPE_EOF) ||
994	    (wpipe == NULL) ||
995	    (wpipe->pipe_state & PIPE_EOF))
996		revents |= POLLHUP;
997
998	if (revents == 0) {
999		if (events & (POLLIN | POLLRDNORM)) {
1000			selrecord(p, &rpipe->pipe_sel);
1001			rpipe->pipe_state |= PIPE_SEL;
1002		}
1003
1004		if (events & (POLLOUT | POLLWRNORM)) {
1005			selrecord(p, &wpipe->pipe_sel);
1006			wpipe->pipe_state |= PIPE_SEL;
1007		}
1008	}
1009
1010	return (revents);
1011}
1012
1013int
1014pipe_stat(pipe, ub)
1015	register struct pipe *pipe;
1016	register struct stat *ub;
1017{
1018	bzero((caddr_t)ub, sizeof (*ub));
1019	ub->st_mode = S_IFIFO;
1020	ub->st_blksize = pipe->pipe_buffer.size;
1021	ub->st_size = pipe->pipe_buffer.cnt;
1022	ub->st_blocks = (ub->st_size + ub->st_blksize - 1) / ub->st_blksize;
1023	TIMEVAL_TO_TIMESPEC(&pipe->pipe_atime, &ub->st_atimespec);
1024	TIMEVAL_TO_TIMESPEC(&pipe->pipe_mtime, &ub->st_mtimespec);
1025	TIMEVAL_TO_TIMESPEC(&pipe->pipe_ctime, &ub->st_ctimespec);
1026	/*
1027	 * Left as 0: st_dev, st_ino, st_nlink, st_uid, st_gid, st_rdev,
1028	 * st_flags, st_gen.
1029	 * XXX (st_dev, st_ino) should be unique.
1030	 */
1031	return 0;
1032}
1033
1034/* ARGSUSED */
1035static int
1036pipe_close(fp, p)
1037	struct file *fp;
1038	struct proc *p;
1039{
1040	struct pipe *cpipe = (struct pipe *)fp->f_data;
1041
1042	pipeclose(cpipe);
1043	fp->f_data = NULL;
1044	return 0;
1045}
1046
1047/*
1048 * shutdown the pipe
1049 */
1050static void
1051pipeclose(cpipe)
1052	struct pipe *cpipe;
1053{
1054	struct pipe *ppipe;
1055	if (cpipe) {
1056
1057		pipeselwakeup(cpipe);
1058
1059		/*
1060		 * If the other side is blocked, wake it up saying that
1061		 * we want to close it down.
1062		 */
1063		while (cpipe->pipe_busy) {
1064			wakeup(cpipe);
1065			cpipe->pipe_state |= PIPE_WANT|PIPE_EOF;
1066			tsleep(cpipe, PRIBIO, "pipecl", 0);
1067		}
1068
1069		/*
1070		 * Disconnect from peer
1071		 */
1072		if (ppipe = cpipe->pipe_peer) {
1073			pipeselwakeup(ppipe);
1074
1075			ppipe->pipe_state |= PIPE_EOF;
1076			wakeup(ppipe);
1077			ppipe->pipe_peer = NULL;
1078		}
1079
1080		/*
1081		 * free resources
1082		 */
1083		if (cpipe->pipe_buffer.buffer) {
1084			if (cpipe->pipe_buffer.size > PIPE_SIZE)
1085				--nbigpipe;
1086			amountpipekva -= cpipe->pipe_buffer.size;
1087			kmem_free(kernel_map,
1088				(vm_offset_t)cpipe->pipe_buffer.buffer,
1089				cpipe->pipe_buffer.size);
1090		}
1091#ifndef PIPE_NODIRECT
1092		if (cpipe->pipe_map.kva) {
1093			amountpipekva -= cpipe->pipe_buffer.size + PAGE_SIZE;
1094			kmem_free(kernel_map,
1095				cpipe->pipe_map.kva,
1096				cpipe->pipe_buffer.size + PAGE_SIZE);
1097		}
1098#endif
1099		zfree(pipe_zone, cpipe);
1100	}
1101}
1102