sys_generic.c revision 1.100.2.7 1 1.100.2.7 ad /* $NetBSD: sys_generic.c,v 1.100.2.7 2007/06/09 23:58:06 ad Exp $ */
2 1.100.2.6 ad
3 1.100.2.6 ad /*-
4 1.100.2.6 ad * Copyright (c) 2007 The NetBSD Foundation, Inc.
5 1.100.2.6 ad * All rights reserved.
6 1.100.2.6 ad *
7 1.100.2.6 ad * This code is derived from software contributed to The NetBSD Foundation
8 1.100.2.6 ad * by Andrew Doran.
9 1.100.2.6 ad *
10 1.100.2.6 ad * Redistribution and use in source and binary forms, with or without
11 1.100.2.6 ad * modification, are permitted provided that the following conditions
12 1.100.2.6 ad * are met:
13 1.100.2.6 ad * 1. Redistributions of source code must retain the above copyright
14 1.100.2.6 ad * notice, this list of conditions and the following disclaimer.
15 1.100.2.6 ad * 2. Redistributions in binary form must reproduce the above copyright
16 1.100.2.6 ad * notice, this list of conditions and the following disclaimer in the
17 1.100.2.6 ad * documentation and/or other materials provided with the distribution.
18 1.100.2.6 ad * 3. All advertising materials mentioning features or use of this software
19 1.100.2.6 ad * must display the following acknowledgement:
20 1.100.2.6 ad * This product includes software developed by the NetBSD
21 1.100.2.6 ad * Foundation, Inc. and its contributors.
22 1.100.2.6 ad * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.100.2.6 ad * contributors may be used to endorse or promote products derived
24 1.100.2.6 ad * from this software without specific prior written permission.
25 1.100.2.6 ad *
26 1.100.2.6 ad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.100.2.6 ad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.100.2.6 ad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.100.2.6 ad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.100.2.6 ad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.100.2.6 ad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.100.2.6 ad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.100.2.6 ad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.100.2.6 ad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.100.2.6 ad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.100.2.6 ad * POSSIBILITY OF SUCH DAMAGE.
37 1.100.2.6 ad */
38 1.15 cgd
39 1.15 cgd /*
40 1.15 cgd * Copyright (c) 1982, 1986, 1989, 1993
41 1.15 cgd * The Regents of the University of California. All rights reserved.
42 1.15 cgd * (c) UNIX System Laboratories, Inc.
43 1.15 cgd * All or some portions of this file are derived from material licensed
44 1.15 cgd * to the University of California by American Telephone and Telegraph
45 1.15 cgd * Co. or Unix System Laboratories, Inc. and are reproduced herein with
46 1.15 cgd * the permission of UNIX System Laboratories, Inc.
47 1.15 cgd *
48 1.15 cgd * Redistribution and use in source and binary forms, with or without
49 1.15 cgd * modification, are permitted provided that the following conditions
50 1.15 cgd * are met:
51 1.15 cgd * 1. Redistributions of source code must retain the above copyright
52 1.15 cgd * notice, this list of conditions and the following disclaimer.
53 1.15 cgd * 2. Redistributions in binary form must reproduce the above copyright
54 1.15 cgd * notice, this list of conditions and the following disclaimer in the
55 1.15 cgd * documentation and/or other materials provided with the distribution.
56 1.77 agc * 3. Neither the name of the University nor the names of its contributors
57 1.15 cgd * may be used to endorse or promote products derived from this software
58 1.15 cgd * without specific prior written permission.
59 1.15 cgd *
60 1.15 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
61 1.15 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
62 1.15 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
63 1.15 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
64 1.15 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
65 1.15 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
66 1.15 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
67 1.15 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
68 1.15 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
69 1.15 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
70 1.15 cgd * SUCH DAMAGE.
71 1.15 cgd *
72 1.36 fvdl * @(#)sys_generic.c 8.9 (Berkeley) 2/14/95
73 1.15 cgd */
74 1.59 lukem
75 1.100.2.3 ad /*
76 1.100.2.3 ad * System calls relating to files.
77 1.100.2.3 ad */
78 1.100.2.3 ad
79 1.59 lukem #include <sys/cdefs.h>
80 1.100.2.7 ad __KERNEL_RCSID(0, "$NetBSD: sys_generic.c,v 1.100.2.7 2007/06/09 23:58:06 ad Exp $");
81 1.37 thorpej
82 1.37 thorpej #include "opt_ktrace.h"
83 1.15 cgd
84 1.15 cgd #include <sys/param.h>
85 1.15 cgd #include <sys/systm.h>
86 1.15 cgd #include <sys/filedesc.h>
87 1.15 cgd #include <sys/ioctl.h>
88 1.15 cgd #include <sys/file.h>
89 1.15 cgd #include <sys/proc.h>
90 1.15 cgd #include <sys/socketvar.h>
91 1.22 christos #include <sys/signalvar.h>
92 1.15 cgd #include <sys/uio.h>
93 1.15 cgd #include <sys/kernel.h>
94 1.15 cgd #include <sys/stat.h>
95 1.100.2.1 ad #include <sys/kmem.h>
96 1.28 mycroft #include <sys/poll.h>
97 1.100.2.6 ad #include <sys/mount.h>
98 1.100.2.6 ad #include <sys/syscallargs.h>
99 1.15 cgd #ifdef KTRACE
100 1.15 cgd #include <sys/ktrace.h>
101 1.15 cgd #endif
102 1.15 cgd
103 1.85 yamt #include <uvm/uvm_extern.h>
104 1.85 yamt
105 1.100.2.6 ad /* Flags for lwp::l_selflag. */
106 1.100.2.6 ad #define SEL_RESET 0 /* awoken, interrupted, or not yet polling */
107 1.100.2.6 ad #define SEL_SCANNING 1 /* polling descriptors */
108 1.100.2.6 ad #define SEL_BLOCKING 2 /* about to block on select_cv */
109 1.100.2.6 ad
110 1.100.2.6 ad static int selscan(lwp_t *, fd_mask *, fd_mask *, int, register_t *);
111 1.100.2.6 ad static int pollscan(lwp_t *, struct pollfd *, int, register_t *);
112 1.100.2.6 ad static void selclear(void);
113 1.100.2.6 ad
114 1.100.2.6 ad /* Global state for select()/poll(). */
115 1.100.2.6 ad kmutex_t select_lock;
116 1.100.2.6 ad kcondvar_t select_cv;
117 1.100.2.6 ad int nselcoll;
118 1.82 matt
119 1.15 cgd /*
120 1.15 cgd * Read system call.
121 1.15 cgd */
122 1.15 cgd /* ARGSUSED */
123 1.22 christos int
124 1.100.2.6 ad sys_read(lwp_t *l, void *v, register_t *retval)
125 1.20 thorpej {
126 1.47 augustss struct sys_read_args /* {
127 1.53 lukem syscallarg(int) fd;
128 1.53 lukem syscallarg(void *) buf;
129 1.53 lukem syscallarg(size_t) nbyte;
130 1.20 thorpej } */ *uap = v;
131 1.53 lukem int fd;
132 1.53 lukem struct file *fp;
133 1.100.2.6 ad proc_t *p;
134 1.53 lukem struct filedesc *fdp;
135 1.39 thorpej
136 1.53 lukem fd = SCARG(uap, fd);
137 1.69 thorpej p = l->l_proc;
138 1.53 lukem fdp = p->p_fd;
139 1.56 thorpej
140 1.56 thorpej if ((fp = fd_getfile(fdp, fd)) == NULL)
141 1.56 thorpej return (EBADF);
142 1.56 thorpej
143 1.70 pk if ((fp->f_flag & FREAD) == 0) {
144 1.100.2.1 ad mutex_exit(&fp->f_lock);
145 1.39 thorpej return (EBADF);
146 1.70 pk }
147 1.39 thorpej
148 1.45 thorpej FILE_USE(fp);
149 1.45 thorpej
150 1.45 thorpej /* dofileread() will unuse the descriptor for us */
151 1.84 christos return (dofileread(l, fd, fp, SCARG(uap, buf), SCARG(uap, nbyte),
152 1.39 thorpej &fp->f_offset, FOF_UPDATE_OFFSET, retval));
153 1.39 thorpej }
154 1.39 thorpej
155 1.39 thorpej int
156 1.100.2.6 ad dofileread(lwp_t *l, int fd, struct file *fp, void *buf, size_t nbyte,
157 1.53 lukem off_t *offset, int flags, register_t *retval)
158 1.53 lukem {
159 1.84 christos struct iovec aiov;
160 1.84 christos struct uio auio;
161 1.100.2.6 ad proc_t *p;
162 1.85 yamt struct vmspace *vm;
163 1.84 christos size_t cnt;
164 1.84 christos int error;
165 1.15 cgd #ifdef KTRACE
166 1.100.2.7 ad struct iovec ktriov;
167 1.15 cgd #endif
168 1.84 christos p = l->l_proc;
169 1.85 yamt
170 1.85 yamt error = proc_vmspace_getref(p, &vm);
171 1.85 yamt if (error) {
172 1.85 yamt goto out;
173 1.85 yamt }
174 1.15 cgd
175 1.100 christos aiov.iov_base = (void *)buf;
176 1.39 thorpej aiov.iov_len = nbyte;
177 1.15 cgd auio.uio_iov = &aiov;
178 1.15 cgd auio.uio_iovcnt = 1;
179 1.39 thorpej auio.uio_resid = nbyte;
180 1.15 cgd auio.uio_rw = UIO_READ;
181 1.85 yamt auio.uio_vmspace = vm;
182 1.40 thorpej
183 1.40 thorpej /*
184 1.40 thorpej * Reads return ssize_t because -1 is returned on error. Therefore
185 1.40 thorpej * we must restrict the length to SSIZE_MAX to avoid garbage return
186 1.40 thorpej * values.
187 1.40 thorpej */
188 1.45 thorpej if (auio.uio_resid > SSIZE_MAX) {
189 1.45 thorpej error = EINVAL;
190 1.45 thorpej goto out;
191 1.45 thorpej }
192 1.40 thorpej
193 1.15 cgd #ifdef KTRACE
194 1.100.2.7 ad /* In case we are tracing, save a copy of iovec */
195 1.100.2.7 ad ktriov = aiov;
196 1.15 cgd #endif
197 1.38 thorpej cnt = auio.uio_resid;
198 1.39 thorpej error = (*fp->f_ops->fo_read)(fp, offset, &auio, fp->f_cred, flags);
199 1.22 christos if (error)
200 1.15 cgd if (auio.uio_resid != cnt && (error == ERESTART ||
201 1.15 cgd error == EINTR || error == EWOULDBLOCK))
202 1.15 cgd error = 0;
203 1.15 cgd cnt -= auio.uio_resid;
204 1.15 cgd #ifdef KTRACE
205 1.15 cgd if (KTRPOINT(p, KTR_GENIO) && error == 0)
206 1.84 christos ktrgenio(l, fd, UIO_READ, &ktriov, cnt, error);
207 1.15 cgd #endif
208 1.15 cgd *retval = cnt;
209 1.45 thorpej out:
210 1.84 christos FILE_UNUSE(fp, l);
211 1.85 yamt uvmspace_free(vm);
212 1.15 cgd return (error);
213 1.15 cgd }
214 1.15 cgd
215 1.15 cgd /*
216 1.15 cgd * Scatter read system call.
217 1.15 cgd */
218 1.22 christos int
219 1.100.2.6 ad sys_readv(lwp_t *l, void *v, register_t *retval)
220 1.20 thorpej {
221 1.47 augustss struct sys_readv_args /* {
222 1.53 lukem syscallarg(int) fd;
223 1.53 lukem syscallarg(const struct iovec *) iovp;
224 1.53 lukem syscallarg(int) iovcnt;
225 1.20 thorpej } */ *uap = v;
226 1.53 lukem struct filedesc *fdp;
227 1.84 christos struct file *fp;
228 1.100.2.6 ad proc_t *p;
229 1.84 christos int fd;
230 1.39 thorpej
231 1.53 lukem fd = SCARG(uap, fd);
232 1.69 thorpej p = l->l_proc;
233 1.53 lukem fdp = p->p_fd;
234 1.56 thorpej
235 1.56 thorpej if ((fp = fd_getfile(fdp, fd)) == NULL)
236 1.56 thorpej return (EBADF);
237 1.56 thorpej
238 1.70 pk if ((fp->f_flag & FREAD) == 0) {
239 1.100.2.1 ad mutex_exit(&fp->f_lock);
240 1.39 thorpej return (EBADF);
241 1.70 pk }
242 1.39 thorpej
243 1.45 thorpej FILE_USE(fp);
244 1.45 thorpej
245 1.45 thorpej /* dofilereadv() will unuse the descriptor for us */
246 1.84 christos return (dofilereadv(l, fd, fp, SCARG(uap, iovp), SCARG(uap, iovcnt),
247 1.39 thorpej &fp->f_offset, FOF_UPDATE_OFFSET, retval));
248 1.39 thorpej }
249 1.39 thorpej
250 1.39 thorpej int
251 1.100.2.6 ad dofilereadv(lwp_t *l, int fd, struct file *fp, const struct iovec *iovp,
252 1.53 lukem int iovcnt, off_t *offset, int flags, register_t *retval)
253 1.53 lukem {
254 1.100.2.6 ad proc_t *p;
255 1.53 lukem struct uio auio;
256 1.53 lukem struct iovec *iov, *needfree, aiov[UIO_SMALLIOV];
257 1.85 yamt struct vmspace *vm;
258 1.64 thorpej int i, error;
259 1.64 thorpej size_t cnt;
260 1.53 lukem u_int iovlen;
261 1.15 cgd #ifdef KTRACE
262 1.53 lukem struct iovec *ktriov;
263 1.15 cgd #endif
264 1.15 cgd
265 1.84 christos p = l->l_proc;
266 1.85 yamt error = proc_vmspace_getref(p, &vm);
267 1.85 yamt if (error) {
268 1.85 yamt goto out;
269 1.85 yamt }
270 1.85 yamt
271 1.53 lukem #ifdef KTRACE
272 1.53 lukem ktriov = NULL;
273 1.53 lukem #endif
274 1.15 cgd /* note: can't use iovlen until iovcnt is validated */
275 1.42 perry iovlen = iovcnt * sizeof(struct iovec);
276 1.34 mycroft if ((u_int)iovcnt > UIO_SMALLIOV) {
277 1.45 thorpej if ((u_int)iovcnt > IOV_MAX) {
278 1.45 thorpej error = EINVAL;
279 1.45 thorpej goto out;
280 1.45 thorpej }
281 1.100.2.1 ad iov = kmem_alloc(iovlen, KM_SLEEP);
282 1.15 cgd needfree = iov;
283 1.41 kleink } else if ((u_int)iovcnt > 0) {
284 1.15 cgd iov = aiov;
285 1.15 cgd needfree = NULL;
286 1.45 thorpej } else {
287 1.45 thorpej error = EINVAL;
288 1.45 thorpej goto out;
289 1.45 thorpej }
290 1.41 kleink
291 1.15 cgd auio.uio_iov = iov;
292 1.34 mycroft auio.uio_iovcnt = iovcnt;
293 1.15 cgd auio.uio_rw = UIO_READ;
294 1.85 yamt auio.uio_vmspace = vm;
295 1.39 thorpej error = copyin(iovp, iov, iovlen);
296 1.22 christos if (error)
297 1.15 cgd goto done;
298 1.15 cgd auio.uio_resid = 0;
299 1.34 mycroft for (i = 0; i < iovcnt; i++) {
300 1.15 cgd auio.uio_resid += iov->iov_len;
301 1.40 thorpej /*
302 1.40 thorpej * Reads return ssize_t because -1 is returned on error.
303 1.40 thorpej * Therefore we must restrict the length to SSIZE_MAX to
304 1.40 thorpej * avoid garbage return values.
305 1.40 thorpej */
306 1.40 thorpej if (iov->iov_len > SSIZE_MAX || auio.uio_resid > SSIZE_MAX) {
307 1.15 cgd error = EINVAL;
308 1.15 cgd goto done;
309 1.15 cgd }
310 1.15 cgd iov++;
311 1.15 cgd }
312 1.15 cgd #ifdef KTRACE
313 1.15 cgd /*
314 1.15 cgd * if tracing, save a copy of iovec
315 1.15 cgd */
316 1.15 cgd if (KTRPOINT(p, KTR_GENIO)) {
317 1.100.2.1 ad ktriov = kmem_alloc(iovlen, KM_SLEEP);
318 1.100 christos memcpy((void *)ktriov, (void *)auio.uio_iov, iovlen);
319 1.15 cgd }
320 1.15 cgd #endif
321 1.15 cgd cnt = auio.uio_resid;
322 1.39 thorpej error = (*fp->f_ops->fo_read)(fp, offset, &auio, fp->f_cred, flags);
323 1.22 christos if (error)
324 1.15 cgd if (auio.uio_resid != cnt && (error == ERESTART ||
325 1.15 cgd error == EINTR || error == EWOULDBLOCK))
326 1.15 cgd error = 0;
327 1.15 cgd cnt -= auio.uio_resid;
328 1.15 cgd #ifdef KTRACE
329 1.58 itohy if (ktriov != NULL) {
330 1.78 drochner if (KTRPOINT(p, KTR_GENIO) && (error == 0))
331 1.84 christos ktrgenio(l, fd, UIO_READ, ktriov, cnt, error);
332 1.100.2.1 ad kmem_free(ktriov, iovlen);
333 1.15 cgd }
334 1.15 cgd #endif
335 1.15 cgd *retval = cnt;
336 1.45 thorpej done:
337 1.15 cgd if (needfree)
338 1.100.2.1 ad kmem_free(needfree, iovlen);
339 1.45 thorpej out:
340 1.84 christos FILE_UNUSE(fp, l);
341 1.85 yamt uvmspace_free(vm);
342 1.15 cgd return (error);
343 1.15 cgd }
344 1.15 cgd
345 1.15 cgd /*
346 1.15 cgd * Write system call
347 1.15 cgd */
348 1.22 christos int
349 1.100.2.6 ad sys_write(lwp_t *l, void *v, register_t *retval)
350 1.20 thorpej {
351 1.47 augustss struct sys_write_args /* {
352 1.53 lukem syscallarg(int) fd;
353 1.53 lukem syscallarg(const void *) buf;
354 1.53 lukem syscallarg(size_t) nbyte;
355 1.20 thorpej } */ *uap = v;
356 1.53 lukem int fd;
357 1.53 lukem struct file *fp;
358 1.100.2.6 ad proc_t *p;
359 1.53 lukem struct filedesc *fdp;
360 1.39 thorpej
361 1.53 lukem fd = SCARG(uap, fd);
362 1.69 thorpej p = l->l_proc;
363 1.53 lukem fdp = p->p_fd;
364 1.56 thorpej
365 1.56 thorpej if ((fp = fd_getfile(fdp, fd)) == NULL)
366 1.56 thorpej return (EBADF);
367 1.56 thorpej
368 1.70 pk if ((fp->f_flag & FWRITE) == 0) {
369 1.100.2.1 ad mutex_exit(&fp->f_lock);
370 1.39 thorpej return (EBADF);
371 1.70 pk }
372 1.39 thorpej
373 1.45 thorpej FILE_USE(fp);
374 1.45 thorpej
375 1.45 thorpej /* dofilewrite() will unuse the descriptor for us */
376 1.84 christos return (dofilewrite(l, fd, fp, SCARG(uap, buf), SCARG(uap, nbyte),
377 1.39 thorpej &fp->f_offset, FOF_UPDATE_OFFSET, retval));
378 1.39 thorpej }
379 1.39 thorpej
380 1.39 thorpej int
381 1.100.2.6 ad dofilewrite(lwp_t *l, int fd, struct file *fp, const void *buf,
382 1.53 lukem size_t nbyte, off_t *offset, int flags, register_t *retval)
383 1.53 lukem {
384 1.84 christos struct iovec aiov;
385 1.84 christos struct uio auio;
386 1.100.2.6 ad proc_t *p;
387 1.85 yamt struct vmspace *vm;
388 1.84 christos size_t cnt;
389 1.84 christos int error;
390 1.15 cgd #ifdef KTRACE
391 1.100.2.7 ad struct iovec ktriov;
392 1.15 cgd #endif
393 1.15 cgd
394 1.84 christos p = l->l_proc;
395 1.85 yamt error = proc_vmspace_getref(p, &vm);
396 1.85 yamt if (error) {
397 1.85 yamt goto out;
398 1.85 yamt }
399 1.83 christos aiov.iov_base = __UNCONST(buf); /* XXXUNCONST kills const */
400 1.39 thorpej aiov.iov_len = nbyte;
401 1.15 cgd auio.uio_iov = &aiov;
402 1.15 cgd auio.uio_iovcnt = 1;
403 1.39 thorpej auio.uio_resid = nbyte;
404 1.15 cgd auio.uio_rw = UIO_WRITE;
405 1.85 yamt auio.uio_vmspace = vm;
406 1.40 thorpej
407 1.40 thorpej /*
408 1.40 thorpej * Writes return ssize_t because -1 is returned on error. Therefore
409 1.40 thorpej * we must restrict the length to SSIZE_MAX to avoid garbage return
410 1.40 thorpej * values.
411 1.40 thorpej */
412 1.45 thorpej if (auio.uio_resid > SSIZE_MAX) {
413 1.45 thorpej error = EINVAL;
414 1.45 thorpej goto out;
415 1.45 thorpej }
416 1.40 thorpej
417 1.15 cgd #ifdef KTRACE
418 1.100.2.7 ad /* In case we are tracing, save a copy of iovec */
419 1.100.2.7 ad ktriov = aiov;
420 1.15 cgd #endif
421 1.38 thorpej cnt = auio.uio_resid;
422 1.39 thorpej error = (*fp->f_ops->fo_write)(fp, offset, &auio, fp->f_cred, flags);
423 1.22 christos if (error) {
424 1.15 cgd if (auio.uio_resid != cnt && (error == ERESTART ||
425 1.15 cgd error == EINTR || error == EWOULDBLOCK))
426 1.15 cgd error = 0;
427 1.98 ad if (error == EPIPE) {
428 1.98 ad mutex_enter(&proclist_mutex);
429 1.15 cgd psignal(p, SIGPIPE);
430 1.98 ad mutex_exit(&proclist_mutex);
431 1.98 ad }
432 1.15 cgd }
433 1.15 cgd cnt -= auio.uio_resid;
434 1.15 cgd #ifdef KTRACE
435 1.15 cgd if (KTRPOINT(p, KTR_GENIO) && error == 0)
436 1.84 christos ktrgenio(l, fd, UIO_WRITE, &ktriov, cnt, error);
437 1.15 cgd #endif
438 1.15 cgd *retval = cnt;
439 1.45 thorpej out:
440 1.84 christos FILE_UNUSE(fp, l);
441 1.85 yamt uvmspace_free(vm);
442 1.15 cgd return (error);
443 1.15 cgd }
444 1.15 cgd
445 1.15 cgd /*
446 1.15 cgd * Gather write system call
447 1.15 cgd */
448 1.22 christos int
449 1.100.2.6 ad sys_writev(lwp_t *l, void *v, register_t *retval)
450 1.20 thorpej {
451 1.47 augustss struct sys_writev_args /* {
452 1.53 lukem syscallarg(int) fd;
453 1.53 lukem syscallarg(const struct iovec *) iovp;
454 1.53 lukem syscallarg(int) iovcnt;
455 1.20 thorpej } */ *uap = v;
456 1.53 lukem int fd;
457 1.53 lukem struct file *fp;
458 1.100.2.6 ad proc_t *p;
459 1.53 lukem struct filedesc *fdp;
460 1.39 thorpej
461 1.53 lukem fd = SCARG(uap, fd);
462 1.69 thorpej p = l->l_proc;
463 1.53 lukem fdp = p->p_fd;
464 1.56 thorpej
465 1.56 thorpej if ((fp = fd_getfile(fdp, fd)) == NULL)
466 1.56 thorpej return (EBADF);
467 1.56 thorpej
468 1.70 pk if ((fp->f_flag & FWRITE) == 0) {
469 1.100.2.1 ad mutex_exit(&fp->f_lock);
470 1.39 thorpej return (EBADF);
471 1.70 pk }
472 1.39 thorpej
473 1.45 thorpej FILE_USE(fp);
474 1.45 thorpej
475 1.45 thorpej /* dofilewritev() will unuse the descriptor for us */
476 1.84 christos return (dofilewritev(l, fd, fp, SCARG(uap, iovp), SCARG(uap, iovcnt),
477 1.39 thorpej &fp->f_offset, FOF_UPDATE_OFFSET, retval));
478 1.39 thorpej }
479 1.39 thorpej
480 1.39 thorpej int
481 1.100.2.6 ad dofilewritev(lwp_t *l, int fd, struct file *fp, const struct iovec *iovp,
482 1.53 lukem int iovcnt, off_t *offset, int flags, register_t *retval)
483 1.53 lukem {
484 1.100.2.6 ad proc_t *p;
485 1.53 lukem struct uio auio;
486 1.53 lukem struct iovec *iov, *needfree, aiov[UIO_SMALLIOV];
487 1.85 yamt struct vmspace *vm;
488 1.64 thorpej int i, error;
489 1.64 thorpej size_t cnt;
490 1.53 lukem u_int iovlen;
491 1.15 cgd #ifdef KTRACE
492 1.53 lukem struct iovec *ktriov;
493 1.15 cgd #endif
494 1.15 cgd
495 1.84 christos p = l->l_proc;
496 1.85 yamt error = proc_vmspace_getref(p, &vm);
497 1.85 yamt if (error) {
498 1.85 yamt goto out;
499 1.85 yamt }
500 1.53 lukem #ifdef KTRACE
501 1.53 lukem ktriov = NULL;
502 1.53 lukem #endif
503 1.15 cgd /* note: can't use iovlen until iovcnt is validated */
504 1.42 perry iovlen = iovcnt * sizeof(struct iovec);
505 1.34 mycroft if ((u_int)iovcnt > UIO_SMALLIOV) {
506 1.62 jdolecek if ((u_int)iovcnt > IOV_MAX) {
507 1.62 jdolecek error = EINVAL;
508 1.62 jdolecek goto out;
509 1.62 jdolecek }
510 1.100.2.1 ad iov = kmem_alloc(iovlen, KM_SLEEP);
511 1.15 cgd needfree = iov;
512 1.41 kleink } else if ((u_int)iovcnt > 0) {
513 1.15 cgd iov = aiov;
514 1.15 cgd needfree = NULL;
515 1.45 thorpej } else {
516 1.45 thorpej error = EINVAL;
517 1.45 thorpej goto out;
518 1.45 thorpej }
519 1.41 kleink
520 1.15 cgd auio.uio_iov = iov;
521 1.34 mycroft auio.uio_iovcnt = iovcnt;
522 1.15 cgd auio.uio_rw = UIO_WRITE;
523 1.85 yamt auio.uio_vmspace = vm;
524 1.39 thorpej error = copyin(iovp, iov, iovlen);
525 1.22 christos if (error)
526 1.15 cgd goto done;
527 1.15 cgd auio.uio_resid = 0;
528 1.34 mycroft for (i = 0; i < iovcnt; i++) {
529 1.15 cgd auio.uio_resid += iov->iov_len;
530 1.40 thorpej /*
531 1.40 thorpej * Writes return ssize_t because -1 is returned on error.
532 1.40 thorpej * Therefore we must restrict the length to SSIZE_MAX to
533 1.40 thorpej * avoid garbage return values.
534 1.40 thorpej */
535 1.40 thorpej if (iov->iov_len > SSIZE_MAX || auio.uio_resid > SSIZE_MAX) {
536 1.15 cgd error = EINVAL;
537 1.15 cgd goto done;
538 1.15 cgd }
539 1.15 cgd iov++;
540 1.15 cgd }
541 1.15 cgd #ifdef KTRACE
542 1.15 cgd /*
543 1.15 cgd * if tracing, save a copy of iovec
544 1.15 cgd */
545 1.15 cgd if (KTRPOINT(p, KTR_GENIO)) {
546 1.100.2.1 ad ktriov = kmem_alloc(iovlen, KM_SLEEP);
547 1.100 christos memcpy((void *)ktriov, (void *)auio.uio_iov, iovlen);
548 1.15 cgd }
549 1.15 cgd #endif
550 1.15 cgd cnt = auio.uio_resid;
551 1.39 thorpej error = (*fp->f_ops->fo_write)(fp, offset, &auio, fp->f_cred, flags);
552 1.22 christos if (error) {
553 1.15 cgd if (auio.uio_resid != cnt && (error == ERESTART ||
554 1.15 cgd error == EINTR || error == EWOULDBLOCK))
555 1.15 cgd error = 0;
556 1.98 ad if (error == EPIPE) {
557 1.98 ad mutex_enter(&proclist_mutex);
558 1.15 cgd psignal(p, SIGPIPE);
559 1.98 ad mutex_exit(&proclist_mutex);
560 1.98 ad }
561 1.15 cgd }
562 1.15 cgd cnt -= auio.uio_resid;
563 1.15 cgd #ifdef KTRACE
564 1.78 drochner if (ktriov != NULL) {
565 1.78 drochner if (KTRPOINT(p, KTR_GENIO) && (error == 0))
566 1.84 christos ktrgenio(l, fd, UIO_WRITE, ktriov, cnt, error);
567 1.100.2.1 ad kmem_free(ktriov, iovlen);
568 1.15 cgd }
569 1.15 cgd #endif
570 1.15 cgd *retval = cnt;
571 1.45 thorpej done:
572 1.15 cgd if (needfree)
573 1.100.2.1 ad kmem_free(needfree, iovlen);
574 1.45 thorpej out:
575 1.84 christos FILE_UNUSE(fp, l);
576 1.85 yamt uvmspace_free(vm);
577 1.15 cgd return (error);
578 1.15 cgd }
579 1.15 cgd
580 1.15 cgd /*
581 1.15 cgd * Ioctl system call
582 1.15 cgd */
583 1.15 cgd /* ARGSUSED */
584 1.22 christos int
585 1.100.2.6 ad sys_ioctl(lwp_t *l, void *v, register_t *retval)
586 1.20 thorpej {
587 1.47 augustss struct sys_ioctl_args /* {
588 1.53 lukem syscallarg(int) fd;
589 1.53 lukem syscallarg(u_long) com;
590 1.100 christos syscallarg(void *) data;
591 1.20 thorpej } */ *uap = v;
592 1.53 lukem struct file *fp;
593 1.100.2.6 ad proc_t *p;
594 1.53 lukem struct filedesc *fdp;
595 1.53 lukem u_long com;
596 1.53 lukem int error;
597 1.53 lukem u_int size;
598 1.100 christos void *data, *memp;
599 1.53 lukem #define STK_PARAMS 128
600 1.53 lukem u_long stkbuf[STK_PARAMS/sizeof(u_long)];
601 1.15 cgd
602 1.53 lukem error = 0;
603 1.69 thorpej p = l->l_proc;
604 1.15 cgd fdp = p->p_fd;
605 1.56 thorpej
606 1.56 thorpej if ((fp = fd_getfile(fdp, SCARG(uap, fd))) == NULL)
607 1.15 cgd return (EBADF);
608 1.15 cgd
609 1.45 thorpej FILE_USE(fp);
610 1.45 thorpej
611 1.45 thorpej if ((fp->f_flag & (FREAD | FWRITE)) == 0) {
612 1.45 thorpej error = EBADF;
613 1.65 scw com = 0;
614 1.45 thorpej goto out;
615 1.45 thorpej }
616 1.15 cgd
617 1.16 cgd switch (com = SCARG(uap, com)) {
618 1.15 cgd case FIONCLEX:
619 1.100.2.5 ad rw_enter(&fdp->fd_lock, RW_WRITER);
620 1.16 cgd fdp->fd_ofileflags[SCARG(uap, fd)] &= ~UF_EXCLOSE;
621 1.100.2.5 ad rw_exit(&fdp->fd_lock);
622 1.45 thorpej goto out;
623 1.45 thorpej
624 1.15 cgd case FIOCLEX:
625 1.100.2.5 ad rw_enter(&fdp->fd_lock, RW_WRITER);
626 1.16 cgd fdp->fd_ofileflags[SCARG(uap, fd)] |= UF_EXCLOSE;
627 1.100.2.5 ad rw_exit(&fdp->fd_lock);
628 1.45 thorpej goto out;
629 1.15 cgd }
630 1.15 cgd
631 1.15 cgd /*
632 1.15 cgd * Interpret high order word to find amount of data to be
633 1.15 cgd * copied to/from the user's address space.
634 1.15 cgd */
635 1.15 cgd size = IOCPARM_LEN(com);
636 1.45 thorpej if (size > IOCPARM_MAX) {
637 1.45 thorpej error = ENOTTY;
638 1.45 thorpej goto out;
639 1.45 thorpej }
640 1.15 cgd memp = NULL;
641 1.42 perry if (size > sizeof(stkbuf)) {
642 1.100.2.1 ad memp = kmem_alloc(size, KM_SLEEP);
643 1.15 cgd data = memp;
644 1.15 cgd } else
645 1.100 christos data = (void *)stkbuf;
646 1.15 cgd if (com&IOC_IN) {
647 1.15 cgd if (size) {
648 1.31 cgd error = copyin(SCARG(uap, data), data, size);
649 1.15 cgd if (error) {
650 1.15 cgd if (memp)
651 1.100.2.1 ad kmem_free(memp, size);
652 1.45 thorpej goto out;
653 1.15 cgd }
654 1.73 dsl #ifdef KTRACE
655 1.73 dsl if (KTRPOINT(p, KTR_GENIO)) {
656 1.73 dsl struct iovec iov;
657 1.73 dsl iov.iov_base = SCARG(uap, data);
658 1.73 dsl iov.iov_len = size;
659 1.84 christos ktrgenio(l, SCARG(uap, fd), UIO_WRITE, &iov,
660 1.73 dsl size, 0);
661 1.73 dsl }
662 1.73 dsl #endif
663 1.15 cgd } else
664 1.100 christos *(void **)data = SCARG(uap, data);
665 1.15 cgd } else if ((com&IOC_OUT) && size)
666 1.15 cgd /*
667 1.15 cgd * Zero the buffer so the user always
668 1.15 cgd * gets back something deterministic.
669 1.15 cgd */
670 1.44 perry memset(data, 0, size);
671 1.15 cgd else if (com&IOC_VOID)
672 1.100 christos *(void **)data = SCARG(uap, data);
673 1.15 cgd
674 1.15 cgd switch (com) {
675 1.15 cgd
676 1.15 cgd case FIONBIO:
677 1.100.2.5 ad mutex_enter(&fp->f_lock);
678 1.79 jdolecek if (*(int *)data != 0)
679 1.15 cgd fp->f_flag |= FNONBLOCK;
680 1.15 cgd else
681 1.15 cgd fp->f_flag &= ~FNONBLOCK;
682 1.100.2.5 ad mutex_exit(&fp->f_lock);
683 1.84 christos error = (*fp->f_ops->fo_ioctl)(fp, FIONBIO, data, l);
684 1.15 cgd break;
685 1.15 cgd
686 1.15 cgd case FIOASYNC:
687 1.100.2.5 ad mutex_enter(&fp->f_lock);
688 1.79 jdolecek if (*(int *)data != 0)
689 1.15 cgd fp->f_flag |= FASYNC;
690 1.15 cgd else
691 1.15 cgd fp->f_flag &= ~FASYNC;
692 1.100.2.5 ad mutex_exit(&fp->f_lock);
693 1.84 christos error = (*fp->f_ops->fo_ioctl)(fp, FIOASYNC, data, l);
694 1.15 cgd break;
695 1.15 cgd
696 1.15 cgd default:
697 1.84 christos error = (*fp->f_ops->fo_ioctl)(fp, com, data, l);
698 1.15 cgd /*
699 1.15 cgd * Copy any data to user, size was
700 1.15 cgd * already set and checked above.
701 1.15 cgd */
702 1.73 dsl if (error == 0 && (com&IOC_OUT) && size) {
703 1.31 cgd error = copyout(data, SCARG(uap, data), size);
704 1.73 dsl #ifdef KTRACE
705 1.73 dsl if (KTRPOINT(p, KTR_GENIO)) {
706 1.73 dsl struct iovec iov;
707 1.73 dsl iov.iov_base = SCARG(uap, data);
708 1.73 dsl iov.iov_len = size;
709 1.84 christos ktrgenio(l, SCARG(uap, fd), UIO_READ, &iov,
710 1.73 dsl size, error);
711 1.73 dsl }
712 1.73 dsl #endif
713 1.73 dsl }
714 1.15 cgd break;
715 1.15 cgd }
716 1.15 cgd if (memp)
717 1.100.2.1 ad kmem_free(memp, size);
718 1.45 thorpej out:
719 1.84 christos FILE_UNUSE(fp, l);
720 1.61 atatat switch (error) {
721 1.61 atatat case -1:
722 1.61 atatat printf("sys_ioctl: _IO%s%s('%c', %lu, %lu) returned -1: "
723 1.61 atatat "pid=%d comm=%s\n",
724 1.61 atatat (com & IOC_IN) ? "W" : "", (com & IOC_OUT) ? "R" : "",
725 1.61 atatat (char)IOCGROUP(com), (com & 0xff), IOCPARM_LEN(com),
726 1.61 atatat p->p_pid, p->p_comm);
727 1.61 atatat /* FALLTHROUGH */
728 1.61 atatat case EPASSTHROUGH:
729 1.61 atatat error = ENOTTY;
730 1.61 atatat /* FALLTHROUGH */
731 1.61 atatat default:
732 1.61 atatat return (error);
733 1.61 atatat }
734 1.15 cgd }
735 1.15 cgd
736 1.15 cgd /*
737 1.15 cgd * Select system call.
738 1.15 cgd */
739 1.22 christos int
740 1.100.2.6 ad sys_pselect(lwp_t *l, void *v, register_t *retval)
741 1.82 matt {
742 1.82 matt struct sys_pselect_args /* {
743 1.82 matt syscallarg(int) nd;
744 1.82 matt syscallarg(fd_set *) in;
745 1.82 matt syscallarg(fd_set *) ou;
746 1.82 matt syscallarg(fd_set *) ex;
747 1.82 matt syscallarg(const struct timespec *) ts;
748 1.82 matt syscallarg(sigset_t *) mask;
749 1.82 matt } */ * const uap = v;
750 1.82 matt struct timespec ats;
751 1.82 matt struct timeval atv, *tv = NULL;
752 1.82 matt sigset_t amask, *mask = NULL;
753 1.82 matt int error;
754 1.82 matt
755 1.82 matt if (SCARG(uap, ts)) {
756 1.82 matt error = copyin(SCARG(uap, ts), &ats, sizeof(ats));
757 1.82 matt if (error)
758 1.82 matt return error;
759 1.82 matt atv.tv_sec = ats.tv_sec;
760 1.82 matt atv.tv_usec = ats.tv_nsec / 1000;
761 1.82 matt tv = &atv;
762 1.82 matt }
763 1.82 matt if (SCARG(uap, mask) != NULL) {
764 1.82 matt error = copyin(SCARG(uap, mask), &amask, sizeof(amask));
765 1.82 matt if (error)
766 1.82 matt return error;
767 1.82 matt mask = &amask;
768 1.82 matt }
769 1.82 matt
770 1.82 matt return selcommon(l, retval, SCARG(uap, nd), SCARG(uap, in),
771 1.82 matt SCARG(uap, ou), SCARG(uap, ex), tv, mask);
772 1.82 matt }
773 1.82 matt
774 1.91 kardel int
775 1.90 christos inittimeleft(struct timeval *tv, struct timeval *sleeptv)
776 1.90 christos {
777 1.90 christos if (itimerfix(tv))
778 1.90 christos return -1;
779 1.90 christos getmicrouptime(sleeptv);
780 1.90 christos return 0;
781 1.90 christos }
782 1.90 christos
783 1.91 kardel int
784 1.90 christos gettimeleft(struct timeval *tv, struct timeval *sleeptv)
785 1.90 christos {
786 1.90 christos /*
787 1.90 christos * We have to recalculate the timeout on every retry.
788 1.90 christos */
789 1.90 christos struct timeval slepttv;
790 1.90 christos /*
791 1.90 christos * reduce tv by elapsed time
792 1.90 christos * based on monotonic time scale
793 1.90 christos */
794 1.90 christos getmicrouptime(&slepttv);
795 1.90 christos timeradd(tv, sleeptv, tv);
796 1.90 christos timersub(tv, &slepttv, tv);
797 1.90 christos *sleeptv = slepttv;
798 1.90 christos return tvtohz(tv);
799 1.90 christos }
800 1.90 christos
801 1.82 matt int
802 1.100.2.6 ad sys_select(lwp_t *l, void *v, register_t *retval)
803 1.20 thorpej {
804 1.47 augustss struct sys_select_args /* {
805 1.53 lukem syscallarg(int) nd;
806 1.53 lukem syscallarg(fd_set *) in;
807 1.53 lukem syscallarg(fd_set *) ou;
808 1.53 lukem syscallarg(fd_set *) ex;
809 1.53 lukem syscallarg(struct timeval *) tv;
810 1.82 matt } */ * const uap = v;
811 1.82 matt struct timeval atv, *tv = NULL;
812 1.82 matt int error;
813 1.82 matt
814 1.82 matt if (SCARG(uap, tv)) {
815 1.100 christos error = copyin(SCARG(uap, tv), (void *)&atv,
816 1.82 matt sizeof(atv));
817 1.82 matt if (error)
818 1.82 matt return error;
819 1.82 matt tv = &atv;
820 1.82 matt }
821 1.82 matt
822 1.82 matt return selcommon(l, retval, SCARG(uap, nd), SCARG(uap, in),
823 1.82 matt SCARG(uap, ou), SCARG(uap, ex), tv, NULL);
824 1.82 matt }
825 1.82 matt
826 1.82 matt int
827 1.100.2.6 ad selcommon(lwp_t *l, register_t *retval, int nd, fd_set *u_in,
828 1.100.2.4 ad fd_set *u_ou, fd_set *u_ex, struct timeval *tv, sigset_t *mask)
829 1.82 matt {
830 1.86 kardel char smallbits[howmany(FD_SETSIZE, NFDBITS) *
831 1.86 kardel sizeof(fd_mask) * 6];
832 1.100.2.6 ad proc_t * const p = l->l_proc;
833 1.100 christos char *bits;
834 1.100.2.3 ad int ncoll, error, timo;
835 1.53 lukem size_t ni;
836 1.82 matt sigset_t oldmask;
837 1.89 christos struct timeval sleeptv;
838 1.15 cgd
839 1.53 lukem error = 0;
840 1.82 matt if (nd < 0)
841 1.35 thorpej return (EINVAL);
842 1.82 matt if (nd > p->p_fd->fd_nfiles) {
843 1.16 cgd /* forgiving; slightly wrong */
844 1.82 matt nd = p->p_fd->fd_nfiles;
845 1.16 cgd }
846 1.82 matt ni = howmany(nd, NFDBITS) * sizeof(fd_mask);
847 1.100.2.2 ad if (ni * 6 > sizeof(smallbits))
848 1.100.2.2 ad bits = kmem_alloc(ni * 6, KM_SLEEP);
849 1.100.2.2 ad else
850 1.26 cgd bits = smallbits;
851 1.15 cgd
852 1.53 lukem #define getbits(name, x) \
853 1.82 matt if (u_ ## name) { \
854 1.82 matt error = copyin(u_ ## name, bits + ni * x, ni); \
855 1.53 lukem if (error) \
856 1.53 lukem goto done; \
857 1.53 lukem } else \
858 1.44 perry memset(bits + ni * x, 0, ni);
859 1.15 cgd getbits(in, 0);
860 1.15 cgd getbits(ou, 1);
861 1.15 cgd getbits(ex, 2);
862 1.15 cgd #undef getbits
863 1.15 cgd
864 1.65 scw timo = 0;
865 1.90 christos if (tv && inittimeleft(tv, &sleeptv) == -1) {
866 1.90 christos error = EINVAL;
867 1.90 christos goto done;
868 1.65 scw }
869 1.89 christos
870 1.98 ad if (mask) {
871 1.98 ad sigminusset(&sigcantmask, mask);
872 1.98 ad mutex_enter(&p->p_smutex);
873 1.98 ad oldmask = l->l_sigmask;
874 1.98 ad l->l_sigmask = *mask;
875 1.98 ad mutex_exit(&p->p_smutex);
876 1.98 ad } else
877 1.98 ad oldmask = l->l_sigmask; /* XXXgcc */
878 1.65 scw
879 1.100.2.3 ad mutex_enter(&select_lock);
880 1.100.2.6 ad SLIST_INIT(&l->l_selwait);
881 1.100.2.3 ad for (;;) {
882 1.100.2.6 ad l->l_selflag = SEL_SCANNING;
883 1.100.2.3 ad ncoll = nselcoll;
884 1.100.2.3 ad mutex_exit(&select_lock);
885 1.100.2.3 ad
886 1.100.2.3 ad error = selscan(l, (fd_mask *)(bits + ni * 0),
887 1.100.2.3 ad (fd_mask *)(bits + ni * 3), nd, retval);
888 1.100.2.3 ad
889 1.100.2.3 ad mutex_enter(&select_lock);
890 1.100.2.3 ad if (error || *retval)
891 1.100.2.3 ad break;
892 1.100.2.3 ad if (tv && (timo = gettimeleft(tv, &sleeptv)) <= 0)
893 1.100.2.3 ad break;
894 1.100.2.6 ad if (l->l_selflag != SEL_SCANNING || ncoll != nselcoll)
895 1.100.2.3 ad continue;
896 1.100.2.6 ad l->l_selflag = SEL_BLOCKING;
897 1.100.2.3 ad error = cv_timedwait_sig(&select_cv, &select_lock, timo);
898 1.100.2.3 ad if (error != 0)
899 1.100.2.3 ad break;
900 1.100.2.3 ad }
901 1.100.2.3 ad selclear();
902 1.100.2.3 ad mutex_exit(&select_lock);
903 1.100.2.3 ad
904 1.98 ad if (mask) {
905 1.98 ad mutex_enter(&p->p_smutex);
906 1.98 ad l->l_sigmask = oldmask;
907 1.98 ad mutex_exit(&p->p_smutex);
908 1.98 ad }
909 1.100.2.3 ad
910 1.97 ad done:
911 1.15 cgd /* select is not restarted after signals... */
912 1.15 cgd if (error == ERESTART)
913 1.15 cgd error = EINTR;
914 1.15 cgd if (error == EWOULDBLOCK)
915 1.15 cgd error = 0;
916 1.100.2.4 ad if (error == 0 && u_in != NULL)
917 1.100.2.4 ad error = copyout(bits + ni * 3, u_in, ni);
918 1.100.2.4 ad if (error == 0 && u_ou != NULL)
919 1.100.2.4 ad error = copyout(bits + ni * 4, u_ou, ni);
920 1.100.2.4 ad if (error == 0 && u_ex != NULL)
921 1.100.2.4 ad error = copyout(bits + ni * 5, u_ex, ni);
922 1.100.2.2 ad if (bits != smallbits)
923 1.100.2.2 ad kmem_free(bits, ni * 6);
924 1.15 cgd return (error);
925 1.15 cgd }
926 1.15 cgd
927 1.22 christos int
928 1.100.2.6 ad selscan(lwp_t *l, fd_mask *ibitp, fd_mask *obitp, int nfd,
929 1.53 lukem register_t *retval)
930 1.53 lukem {
931 1.63 jdolecek static const int flag[3] = { POLLRDNORM | POLLHUP | POLLERR,
932 1.28 mycroft POLLWRNORM | POLLHUP | POLLERR,
933 1.28 mycroft POLLRDBAND };
934 1.100.2.6 ad proc_t *p = l->l_proc;
935 1.84 christos struct filedesc *fdp;
936 1.84 christos int msk, i, j, fd, n;
937 1.84 christos fd_mask ibits, obits;
938 1.84 christos struct file *fp;
939 1.15 cgd
940 1.53 lukem fdp = p->p_fd;
941 1.53 lukem n = 0;
942 1.15 cgd for (msk = 0; msk < 3; msk++) {
943 1.15 cgd for (i = 0; i < nfd; i += NFDBITS) {
944 1.25 mycroft ibits = *ibitp++;
945 1.25 mycroft obits = 0;
946 1.25 mycroft while ((j = ffs(ibits)) && (fd = i + --j) < nfd) {
947 1.25 mycroft ibits &= ~(1 << j);
948 1.56 thorpej if ((fp = fd_getfile(fdp, fd)) == NULL)
949 1.15 cgd return (EBADF);
950 1.45 thorpej FILE_USE(fp);
951 1.84 christos if ((*fp->f_ops->fo_poll)(fp, flag[msk], l)) {
952 1.25 mycroft obits |= (1 << j);
953 1.15 cgd n++;
954 1.15 cgd }
955 1.84 christos FILE_UNUSE(fp, l);
956 1.15 cgd }
957 1.25 mycroft *obitp++ = obits;
958 1.15 cgd }
959 1.15 cgd }
960 1.15 cgd *retval = n;
961 1.15 cgd return (0);
962 1.15 cgd }
963 1.15 cgd
964 1.28 mycroft /*
965 1.28 mycroft * Poll system call.
966 1.28 mycroft */
967 1.28 mycroft int
968 1.100.2.6 ad sys_poll(lwp_t *l, void *v, register_t *retval)
969 1.28 mycroft {
970 1.47 augustss struct sys_poll_args /* {
971 1.53 lukem syscallarg(struct pollfd *) fds;
972 1.53 lukem syscallarg(u_int) nfds;
973 1.53 lukem syscallarg(int) timeout;
974 1.82 matt } */ * const uap = v;
975 1.82 matt struct timeval atv, *tv = NULL;
976 1.82 matt
977 1.82 matt if (SCARG(uap, timeout) != INFTIM) {
978 1.82 matt atv.tv_sec = SCARG(uap, timeout) / 1000;
979 1.82 matt atv.tv_usec = (SCARG(uap, timeout) % 1000) * 1000;
980 1.82 matt tv = &atv;
981 1.82 matt }
982 1.82 matt
983 1.82 matt return pollcommon(l, retval, SCARG(uap, fds), SCARG(uap, nfds),
984 1.82 matt tv, NULL);
985 1.82 matt }
986 1.82 matt
987 1.82 matt /*
988 1.82 matt * Poll system call.
989 1.82 matt */
990 1.82 matt int
991 1.100.2.6 ad sys_pollts(lwp_t *l, void *v, register_t *retval)
992 1.82 matt {
993 1.82 matt struct sys_pollts_args /* {
994 1.82 matt syscallarg(struct pollfd *) fds;
995 1.82 matt syscallarg(u_int) nfds;
996 1.82 matt syscallarg(const struct timespec *) ts;
997 1.82 matt syscallarg(const sigset_t *) mask;
998 1.82 matt } */ * const uap = v;
999 1.82 matt struct timespec ats;
1000 1.82 matt struct timeval atv, *tv = NULL;
1001 1.82 matt sigset_t amask, *mask = NULL;
1002 1.82 matt int error;
1003 1.82 matt
1004 1.82 matt if (SCARG(uap, ts)) {
1005 1.82 matt error = copyin(SCARG(uap, ts), &ats, sizeof(ats));
1006 1.82 matt if (error)
1007 1.82 matt return error;
1008 1.82 matt atv.tv_sec = ats.tv_sec;
1009 1.82 matt atv.tv_usec = ats.tv_nsec / 1000;
1010 1.82 matt tv = &atv;
1011 1.82 matt }
1012 1.82 matt if (SCARG(uap, mask)) {
1013 1.82 matt error = copyin(SCARG(uap, mask), &amask, sizeof(amask));
1014 1.82 matt if (error)
1015 1.82 matt return error;
1016 1.82 matt mask = &amask;
1017 1.82 matt }
1018 1.82 matt
1019 1.82 matt return pollcommon(l, retval, SCARG(uap, fds), SCARG(uap, nfds),
1020 1.82 matt tv, mask);
1021 1.82 matt }
1022 1.82 matt
1023 1.82 matt int
1024 1.100.2.6 ad pollcommon(lwp_t *l, register_t *retval,
1025 1.82 matt struct pollfd *u_fds, u_int nfds,
1026 1.82 matt struct timeval *tv, sigset_t *mask)
1027 1.82 matt {
1028 1.86 kardel char smallbits[32 * sizeof(struct pollfd)];
1029 1.100.2.6 ad proc_t * const p = l->l_proc;
1030 1.100 christos void * bits;
1031 1.82 matt sigset_t oldmask;
1032 1.100.2.3 ad int ncoll, error, timo;
1033 1.53 lukem size_t ni;
1034 1.89 christos struct timeval sleeptv;
1035 1.28 mycroft
1036 1.82 matt if (nfds > p->p_fd->fd_nfiles) {
1037 1.28 mycroft /* forgiving; slightly wrong */
1038 1.82 matt nfds = p->p_fd->fd_nfiles;
1039 1.28 mycroft }
1040 1.82 matt ni = nfds * sizeof(struct pollfd);
1041 1.28 mycroft if (ni > sizeof(smallbits))
1042 1.100.2.1 ad bits = kmem_alloc(ni, KM_SLEEP);
1043 1.28 mycroft else
1044 1.28 mycroft bits = smallbits;
1045 1.28 mycroft
1046 1.82 matt error = copyin(u_fds, bits, ni);
1047 1.28 mycroft if (error)
1048 1.28 mycroft goto done;
1049 1.28 mycroft
1050 1.65 scw timo = 0;
1051 1.90 christos if (tv && inittimeleft(tv, &sleeptv) == -1) {
1052 1.90 christos error = EINVAL;
1053 1.90 christos goto done;
1054 1.65 scw }
1055 1.89 christos
1056 1.98 ad if (mask) {
1057 1.98 ad sigminusset(&sigcantmask, mask);
1058 1.98 ad mutex_enter(&p->p_smutex);
1059 1.98 ad oldmask = l->l_sigmask;
1060 1.98 ad l->l_sigmask = *mask;
1061 1.98 ad mutex_exit(&p->p_smutex);
1062 1.98 ad } else
1063 1.98 ad oldmask = l->l_sigmask; /* XXXgcc */
1064 1.65 scw
1065 1.100.2.3 ad mutex_enter(&select_lock);
1066 1.100.2.6 ad SLIST_INIT(&l->l_selwait);
1067 1.100.2.3 ad for (;;) {
1068 1.100.2.3 ad ncoll = nselcoll;
1069 1.100.2.6 ad l->l_selflag = SEL_SCANNING;
1070 1.100.2.3 ad mutex_exit(&select_lock);
1071 1.100.2.3 ad
1072 1.100.2.3 ad error = pollscan(l, (struct pollfd *)bits, nfds, retval);
1073 1.100.2.3 ad
1074 1.100.2.3 ad mutex_enter(&select_lock);
1075 1.100.2.3 ad if (error || *retval)
1076 1.100.2.3 ad break;
1077 1.100.2.3 ad if (tv && (timo = gettimeleft(tv, &sleeptv)) <= 0)
1078 1.100.2.3 ad break;
1079 1.100.2.6 ad if (l->l_selflag != SEL_SCANNING || nselcoll != ncoll)
1080 1.100.2.3 ad continue;
1081 1.100.2.6 ad l->l_selflag = SEL_BLOCKING;
1082 1.100.2.3 ad error = cv_timedwait_sig(&select_cv, &select_lock, timo);
1083 1.100.2.3 ad if (error != 0)
1084 1.100.2.3 ad break;
1085 1.100.2.3 ad }
1086 1.100.2.3 ad selclear();
1087 1.100.2.3 ad mutex_exit(&select_lock);
1088 1.100.2.3 ad
1089 1.98 ad if (mask) {
1090 1.98 ad mutex_enter(&p->p_smutex);
1091 1.98 ad l->l_sigmask = oldmask;
1092 1.98 ad mutex_exit(&p->p_smutex);
1093 1.98 ad }
1094 1.97 ad done:
1095 1.28 mycroft /* poll is not restarted after signals... */
1096 1.28 mycroft if (error == ERESTART)
1097 1.28 mycroft error = EINTR;
1098 1.28 mycroft if (error == EWOULDBLOCK)
1099 1.28 mycroft error = 0;
1100 1.100.2.4 ad if (error == 0)
1101 1.82 matt error = copyout(bits, u_fds, ni);
1102 1.100.2.2 ad if (bits != smallbits)
1103 1.100.2.1 ad kmem_free(bits, ni);
1104 1.28 mycroft return (error);
1105 1.28 mycroft }
1106 1.28 mycroft
1107 1.28 mycroft int
1108 1.100.2.6 ad pollscan(lwp_t *l, struct pollfd *fds, int nfd, register_t *retval)
1109 1.53 lukem {
1110 1.100.2.6 ad proc_t *p = l->l_proc;
1111 1.53 lukem struct filedesc *fdp;
1112 1.53 lukem int i, n;
1113 1.53 lukem struct file *fp;
1114 1.28 mycroft
1115 1.53 lukem fdp = p->p_fd;
1116 1.54 lukem n = 0;
1117 1.28 mycroft for (i = 0; i < nfd; i++, fds++) {
1118 1.60 christos if (fds->fd >= fdp->fd_nfiles) {
1119 1.28 mycroft fds->revents = POLLNVAL;
1120 1.28 mycroft n++;
1121 1.60 christos } else if (fds->fd < 0) {
1122 1.60 christos fds->revents = 0;
1123 1.28 mycroft } else {
1124 1.56 thorpej if ((fp = fd_getfile(fdp, fds->fd)) == NULL) {
1125 1.32 mrg fds->revents = POLLNVAL;
1126 1.28 mycroft n++;
1127 1.32 mrg } else {
1128 1.45 thorpej FILE_USE(fp);
1129 1.32 mrg fds->revents = (*fp->f_ops->fo_poll)(fp,
1130 1.84 christos fds->events | POLLERR | POLLHUP, l);
1131 1.32 mrg if (fds->revents != 0)
1132 1.32 mrg n++;
1133 1.84 christos FILE_UNUSE(fp, l);
1134 1.32 mrg }
1135 1.28 mycroft }
1136 1.28 mycroft }
1137 1.28 mycroft *retval = n;
1138 1.28 mycroft return (0);
1139 1.28 mycroft }
1140 1.28 mycroft
1141 1.15 cgd /*ARGSUSED*/
1142 1.22 christos int
1143 1.100.2.6 ad seltrue(dev_t dev, int events, lwp_t *l)
1144 1.15 cgd {
1145 1.15 cgd
1146 1.28 mycroft return (events & (POLLIN | POLLOUT | POLLRDNORM | POLLWRNORM));
1147 1.15 cgd }
1148 1.15 cgd
1149 1.15 cgd /*
1150 1.15 cgd * Record a select request.
1151 1.15 cgd */
1152 1.15 cgd void
1153 1.100.2.6 ad selrecord(lwp_t *selector, struct selinfo *sip)
1154 1.15 cgd {
1155 1.98 ad
1156 1.100.2.3 ad mutex_enter(&select_lock);
1157 1.100.2.3 ad if (sip->sel_lwp == NULL) {
1158 1.100.2.6 ad /* First named waiter, although there may be more. */
1159 1.100.2.3 ad sip->sel_lwp = selector;
1160 1.100.2.6 ad SLIST_INSERT_HEAD(&selector->l_selwait, sip, sel_chain);
1161 1.100.2.3 ad } else if (sip->sel_lwp != selector) {
1162 1.100.2.6 ad /* Multiple waiters. */
1163 1.100.2.3 ad sip->sel_collision = true;
1164 1.69 thorpej }
1165 1.100.2.3 ad mutex_exit(&select_lock);
1166 1.15 cgd }
1167 1.15 cgd
1168 1.15 cgd /*
1169 1.15 cgd * Do a wakeup when a selectable event occurs.
1170 1.15 cgd */
1171 1.15 cgd void
1172 1.100.2.3 ad selwakeup(struct selinfo *sip)
1173 1.15 cgd {
1174 1.100.2.6 ad lwp_t *l;
1175 1.15 cgd
1176 1.100.2.3 ad mutex_enter(&select_lock);
1177 1.73 dsl if (sip->sel_collision) {
1178 1.100.2.3 ad /* Multiple waiters - just notify everybody. */
1179 1.15 cgd nselcoll++;
1180 1.100.2.3 ad sip->sel_collision = false;
1181 1.100.2.3 ad cv_broadcast(&select_cv);
1182 1.100.2.3 ad } else if (sip->sel_lwp != NULL) {
1183 1.100.2.3 ad /* Only one LWP waiting. */
1184 1.100.2.3 ad l = sip->sel_lwp;
1185 1.100.2.6 ad if (l->l_selflag == SEL_BLOCKING) {
1186 1.100.2.3 ad /*
1187 1.100.2.6 ad * If it's sleeping, wake it up. If not, it's
1188 1.100.2.6 ad * already awake but hasn't yet removed itself
1189 1.100.2.6 ad * from the selector. We reset the state below
1190 1.100.2.6 ad * so that we only attempt to do this once.
1191 1.100.2.3 ad */
1192 1.100.2.3 ad lwp_lock(l);
1193 1.100.2.3 ad if (l->l_wchan == &select_cv) {
1194 1.100.2.3 ad /* lwp_unsleep() releases the LWP lock. */
1195 1.100.2.3 ad lwp_unsleep(l);
1196 1.100.2.3 ad } else
1197 1.100.2.3 ad lwp_unlock(l);
1198 1.100.2.6 ad } else {
1199 1.100.2.6 ad /*
1200 1.100.2.6 ad * Not yet asleep. Reset its state below so that
1201 1.100.2.6 ad * it will go around again.
1202 1.100.2.6 ad */
1203 1.100.2.3 ad }
1204 1.100.2.6 ad l->l_selflag = SEL_RESET;
1205 1.15 cgd }
1206 1.100.2.3 ad mutex_exit(&select_lock);
1207 1.100.2.3 ad }
1208 1.98 ad
1209 1.100.2.3 ad void
1210 1.100.2.3 ad selnotify(struct selinfo *sip, long knhint)
1211 1.100.2.3 ad {
1212 1.98 ad
1213 1.100.2.3 ad selwakeup(sip);
1214 1.100.2.3 ad KNOTE(&sip->sel_klist, knhint);
1215 1.100.2.3 ad }
1216 1.100.2.3 ad
1217 1.100.2.3 ad /*
1218 1.100.2.3 ad * Remove an LWP from all objects that it is waiting for.
1219 1.100.2.3 ad */
1220 1.100.2.3 ad static void
1221 1.100.2.3 ad selclear(void)
1222 1.100.2.3 ad {
1223 1.100.2.3 ad struct selinfo *sip;
1224 1.100.2.6 ad lwp_t *l = curlwp;
1225 1.100.2.3 ad
1226 1.100.2.3 ad KASSERT(mutex_owned(&select_lock));
1227 1.100.2.3 ad
1228 1.100.2.6 ad SLIST_FOREACH(sip, &l->l_selwait, sel_chain) {
1229 1.100.2.3 ad KASSERT(sip->sel_lwp == l);
1230 1.100.2.3 ad sip->sel_lwp = NULL;
1231 1.15 cgd }
1232 1.100.2.3 ad }
1233 1.100.2.3 ad
1234 1.100.2.3 ad /*
1235 1.100.2.3 ad * Initialize the select/poll system calls.
1236 1.100.2.3 ad */
1237 1.100.2.3 ad void
1238 1.100.2.3 ad selsysinit(void)
1239 1.100.2.3 ad {
1240 1.100.2.3 ad
1241 1.100.2.3 ad mutex_init(&select_lock, MUTEX_DRIVER, IPL_VM);
1242 1.100.2.3 ad cv_init(&select_cv, "select");
1243 1.15 cgd }
1244