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 $
40 * $DragonFly: src/sys/kern/kern_subr.c,v 1.4 2003/06/23 23:36:11 dillon Exp $
43 #include <sys/param.h>
44 #include <sys/systm.h>
45 #include <sys/kernel.h>
47 #include <sys/malloc.h>
49 #include <sys/resourcevar.h>
50 #include <sys/vnode.h>
53 #include <vm/vm_page.h>
54 #include <vm/vm_map.h>
60 register struct uio *uio;
62 register struct iovec *iov;
66 int baseticks = ticks;
68 KASSERT(uio->uio_rw == UIO_READ || uio->uio_rw == UIO_WRITE,
70 KASSERT(uio->uio_segflg != UIO_USERSPACE || uio->uio_procp == curproc,
74 save = curproc->p_flag & P_DEADLKTREAT;
75 curproc->p_flag |= P_DEADLKTREAT;
78 while (n > 0 && uio->uio_resid) {
89 switch (uio->uio_segflg) {
93 if (ticks - baseticks >= hogticks) {
97 if (uio->uio_rw == UIO_READ)
98 error = copyout(cp, iov->iov_base, cnt);
100 error = copyin(iov->iov_base, cp, cnt);
106 if (uio->uio_rw == UIO_READ)
107 bcopy((caddr_t)cp, iov->iov_base, cnt);
109 bcopy(iov->iov_base, (caddr_t)cp, cnt);
114 iov->iov_base += cnt;
116 uio->uio_resid -= cnt;
117 uio->uio_offset += cnt;
122 curproc->p_flag = (curproc->p_flag & ~P_DEADLKTREAT) | save;
127 uiomoveco(cp, n, uio, obj)
131 struct vm_object *obj;
136 int baseticks = ticks;
138 KASSERT(uio->uio_rw == UIO_READ || uio->uio_rw == UIO_WRITE,
139 ("uiomoveco: mode"));
140 KASSERT(uio->uio_segflg != UIO_USERSPACE || uio->uio_procp == curproc,
143 while (n > 0 && uio->uio_resid) {
154 switch (uio->uio_segflg) {
158 if (ticks - baseticks >= hogticks) {
162 if (uio->uio_rw == UIO_READ) {
163 #ifdef ENABLE_VFS_IOOPT
164 if (vfs_ioopt && ((cnt & PAGE_MASK) == 0) &&
165 ((((intptr_t) iov->iov_base) & PAGE_MASK) == 0) &&
166 ((uio->uio_offset & PAGE_MASK) == 0) &&
167 ((((intptr_t) cp) & PAGE_MASK) == 0)) {
168 error = vm_uiomove(&curproc->p_vmspace->vm_map, obj,
169 uio->uio_offset, cnt,
170 (vm_offset_t) iov->iov_base, NULL);
174 error = copyout(cp, iov->iov_base, cnt);
177 error = copyin(iov->iov_base, cp, cnt);
184 if (uio->uio_rw == UIO_READ)
185 bcopy((caddr_t)cp, iov->iov_base, cnt);
187 bcopy(iov->iov_base, (caddr_t)cp, cnt);
192 iov->iov_base += cnt;
194 uio->uio_resid -= cnt;
195 uio->uio_offset += cnt;
202 #ifdef ENABLE_VFS_IOOPT
205 uioread(n, uio, obj, nread)
208 struct vm_object *obj;
222 while (n > 0 && uio->uio_resid) {
233 if ((uio->uio_segflg == UIO_USERSPACE) &&
234 ((((intptr_t) iov->iov_base) & PAGE_MASK) == 0) &&
235 ((uio->uio_offset & PAGE_MASK) == 0) ) {
242 if (ticks - mycpu->gd_switchticks >= hogticks)
244 error = vm_uiomove(&curproc->p_vmspace->vm_map, obj,
245 uio->uio_offset, cnt,
246 (vm_offset_t) iov->iov_base, &npagesmoved);
248 if (npagesmoved == 0)
251 tcnt = npagesmoved * PAGE_SIZE;
257 iov->iov_base += cnt;
259 uio->uio_resid -= cnt;
260 uio->uio_offset += cnt;
273 * Give next character to user as result of read.
278 register struct uio *uio;
280 register struct iovec *iov;
283 if (uio->uio_iovcnt == 0 || uio->uio_resid == 0)
286 if (iov->iov_len == 0) {
291 switch (uio->uio_segflg) {
294 if (subyte(iov->iov_base, c) < 0)
303 if (suibyte(iov->iov_base, c) < 0)
316 #ifdef vax /* unused except by ct.c, other oddities XXX */
318 * Get next character written in by user from uio.
324 register struct iovec *iov;
327 if (uio->uio_resid <= 0)
330 if (uio->uio_iovcnt <= 0)
333 if (iov->iov_len == 0) {
335 if (--uio->uio_iovcnt == 0)
339 switch (uio->uio_segflg) {
342 c = fubyte(iov->iov_base);
346 c = *(u_char *) iov->iov_base;
350 c = fuibyte(iov->iov_base);
364 * General routine to allocate a hash table.
367 hashinit(elements, type, hashmask)
369 struct malloc_type *type;
373 LIST_HEAD(generic, generic) *hashtbl;
377 panic("hashinit: bad elements");
378 for (hashsize = 1; hashsize <= elements; hashsize <<= 1)
381 hashtbl = malloc((u_long)hashsize * sizeof(*hashtbl), type, M_WAITOK);
382 for (i = 0; i < hashsize; i++)
383 LIST_INIT(&hashtbl[i]);
384 *hashmask = hashsize - 1;
388 static int primes[] = { 1, 13, 31, 61, 127, 251, 509, 761, 1021, 1531, 2039,
389 2557, 3067, 3583, 4093, 4603, 5119, 5623, 6143, 6653,
390 7159, 7673, 8191, 12281, 16381, 24571, 32749 };
391 #define NPRIMES (sizeof(primes) / sizeof(primes[0]))
394 * General routine to allocate a prime number sized hash table.
397 phashinit(elements, type, nentries)
399 struct malloc_type *type;
403 LIST_HEAD(generic, generic) *hashtbl;
407 panic("phashinit: bad elements");
408 for (i = 1, hashsize = primes[1]; hashsize <= elements;) {
412 hashsize = primes[i];
414 hashsize = primes[i - 1];
415 hashtbl = malloc((u_long)hashsize * sizeof(*hashtbl), type, M_WAITOK);
416 for (i = 0; i < hashsize; i++)
417 LIST_INIT(&hashtbl[i]);
418 *nentries = hashsize;
430 p->p_priority = p->p_usrpri;
432 p->p_stats->p_ru.ru_nivcsw++;