2 * Copyright (c) 1982, 1986, 1991, 1993
3 * The Regents of the University of California. All rights reserved.
4 * (c) UNIX System Laboratories, Inc.
5 * All or some portions of this file are derived from material licensed
6 * to the University of California by American Telephone and Telegraph
7 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
8 * the permission of UNIX System Laboratories, Inc.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * @(#)kern_subr.c 8.3 (Berkeley) 1/21/94
39 * $FreeBSD: src/sys/kern/kern_subr.c,v 1.31.2.2 2002/04/21 08:09:37 bde Exp $
42 #include <sys/param.h>
43 #include <sys/systm.h>
44 #include <sys/kernel.h>
46 #include <sys/malloc.h>
48 #include <sys/resourcevar.h>
49 #include <sys/vnode.h>
52 #include <vm/vm_page.h>
53 #include <vm/vm_map.h>
59 register struct uio *uio;
61 register struct iovec *iov;
66 KASSERT(uio->uio_rw == UIO_READ || uio->uio_rw == UIO_WRITE,
68 KASSERT(uio->uio_segflg != UIO_USERSPACE || uio->uio_procp == curproc,
72 save = curproc->p_flag & P_DEADLKTREAT;
73 curproc->p_flag |= P_DEADLKTREAT;
76 while (n > 0 && uio->uio_resid) {
87 switch (uio->uio_segflg) {
91 if (ticks - switchticks >= hogticks)
93 if (uio->uio_rw == UIO_READ)
94 error = copyout(cp, iov->iov_base, cnt);
96 error = copyin(iov->iov_base, cp, cnt);
102 if (uio->uio_rw == UIO_READ)
103 bcopy((caddr_t)cp, iov->iov_base, cnt);
105 bcopy(iov->iov_base, (caddr_t)cp, cnt);
110 iov->iov_base += cnt;
112 uio->uio_resid -= cnt;
113 uio->uio_offset += cnt;
118 curproc->p_flag = (curproc->p_flag & ~P_DEADLKTREAT) | save;
123 uiomoveco(cp, n, uio, obj)
127 struct vm_object *obj;
133 KASSERT(uio->uio_rw == UIO_READ || uio->uio_rw == UIO_WRITE,
134 ("uiomoveco: mode"));
135 KASSERT(uio->uio_segflg != UIO_USERSPACE || uio->uio_procp == curproc,
138 while (n > 0 && uio->uio_resid) {
149 switch (uio->uio_segflg) {
153 if (ticks - switchticks >= hogticks)
155 if (uio->uio_rw == UIO_READ) {
156 #ifdef ENABLE_VFS_IOOPT
157 if (vfs_ioopt && ((cnt & PAGE_MASK) == 0) &&
158 ((((intptr_t) iov->iov_base) & PAGE_MASK) == 0) &&
159 ((uio->uio_offset & PAGE_MASK) == 0) &&
160 ((((intptr_t) cp) & PAGE_MASK) == 0)) {
161 error = vm_uiomove(&curproc->p_vmspace->vm_map, obj,
162 uio->uio_offset, cnt,
163 (vm_offset_t) iov->iov_base, NULL);
167 error = copyout(cp, iov->iov_base, cnt);
170 error = copyin(iov->iov_base, cp, cnt);
177 if (uio->uio_rw == UIO_READ)
178 bcopy((caddr_t)cp, iov->iov_base, cnt);
180 bcopy(iov->iov_base, (caddr_t)cp, cnt);
185 iov->iov_base += cnt;
187 uio->uio_resid -= cnt;
188 uio->uio_offset += cnt;
195 #ifdef ENABLE_VFS_IOOPT
198 uioread(n, uio, obj, nread)
201 struct vm_object *obj;
215 while (n > 0 && uio->uio_resid) {
226 if ((uio->uio_segflg == UIO_USERSPACE) &&
227 ((((intptr_t) iov->iov_base) & PAGE_MASK) == 0) &&
228 ((uio->uio_offset & PAGE_MASK) == 0) ) {
235 if (ticks - switchticks >= hogticks)
237 error = vm_uiomove(&curproc->p_vmspace->vm_map, obj,
238 uio->uio_offset, cnt,
239 (vm_offset_t) iov->iov_base, &npagesmoved);
241 if (npagesmoved == 0)
244 tcnt = npagesmoved * PAGE_SIZE;
250 iov->iov_base += cnt;
252 uio->uio_resid -= cnt;
253 uio->uio_offset += cnt;
266 * Give next character to user as result of read.
271 register struct uio *uio;
273 register struct iovec *iov;
276 if (uio->uio_iovcnt == 0 || uio->uio_resid == 0)
279 if (iov->iov_len == 0) {
284 switch (uio->uio_segflg) {
287 if (subyte(iov->iov_base, c) < 0)
296 if (suibyte(iov->iov_base, c) < 0)
309 #ifdef vax /* unused except by ct.c, other oddities XXX */
311 * Get next character written in by user from uio.
317 register struct iovec *iov;
320 if (uio->uio_resid <= 0)
323 if (uio->uio_iovcnt <= 0)
326 if (iov->iov_len == 0) {
328 if (--uio->uio_iovcnt == 0)
332 switch (uio->uio_segflg) {
335 c = fubyte(iov->iov_base);
339 c = *(u_char *) iov->iov_base;
343 c = fuibyte(iov->iov_base);
357 * General routine to allocate a hash table.
360 hashinit(elements, type, hashmask)
362 struct malloc_type *type;
366 LIST_HEAD(generic, generic) *hashtbl;
370 panic("hashinit: bad elements");
371 for (hashsize = 1; hashsize <= elements; hashsize <<= 1)
374 hashtbl = malloc((u_long)hashsize * sizeof(*hashtbl), type, M_WAITOK);
375 for (i = 0; i < hashsize; i++)
376 LIST_INIT(&hashtbl[i]);
377 *hashmask = hashsize - 1;
381 static int primes[] = { 1, 13, 31, 61, 127, 251, 509, 761, 1021, 1531, 2039,
382 2557, 3067, 3583, 4093, 4603, 5119, 5623, 6143, 6653,
383 7159, 7673, 8191, 12281, 16381, 24571, 32749 };
384 #define NPRIMES (sizeof(primes) / sizeof(primes[0]))
387 * General routine to allocate a prime number sized hash table.
390 phashinit(elements, type, nentries)
392 struct malloc_type *type;
396 LIST_HEAD(generic, generic) *hashtbl;
400 panic("phashinit: bad elements");
401 for (i = 1, hashsize = primes[1]; hashsize <= elements;) {
405 hashsize = primes[i];
407 hashsize = primes[i - 1];
408 hashtbl = malloc((u_long)hashsize * sizeof(*hashtbl), type, M_WAITOK);
409 for (i = 0; i < hashsize; i++)
410 LIST_INIT(&hashtbl[i]);
411 *nentries = hashsize;
423 p->p_priority = p->p_usrpri;
425 p->p_stats->p_ru.ru_nivcsw++;