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.9 2003/07/28 04:56:35 hmp Exp $
45 #include <sys/param.h>
46 #include <sys/systm.h>
47 #include <sys/kernel.h>
49 #include <sys/malloc.h>
51 #include <sys/resourcevar.h>
52 #include <sys/vnode.h>
57 #include <vm/vm_page.h>
58 #include <vm/vm_map.h>
70 int baseticks = ticks;
72 KASSERT(uio->uio_rw == UIO_READ || uio->uio_rw == UIO_WRITE,
74 KASSERT(uio->uio_segflg != UIO_USERSPACE || uio->uio_td == curthread,
78 save = curproc->p_flag & P_DEADLKTREAT;
79 curproc->p_flag |= P_DEADLKTREAT;
82 while (n > 0 && uio->uio_resid) {
93 switch (uio->uio_segflg) {
97 if (ticks - baseticks >= hogticks) {
101 if (uio->uio_rw == UIO_READ)
102 error = copyout(cp, iov->iov_base, cnt);
104 error = copyin(iov->iov_base, cp, cnt);
110 if (uio->uio_rw == UIO_READ)
111 bcopy((caddr_t)cp, iov->iov_base, cnt);
113 bcopy(iov->iov_base, (caddr_t)cp, cnt);
118 iov->iov_base += cnt;
120 uio->uio_resid -= cnt;
121 uio->uio_offset += cnt;
126 curproc->p_flag = (curproc->p_flag & ~P_DEADLKTREAT) | save;
131 uiomoveco(cp, n, uio, obj)
135 struct vm_object *obj;
140 int baseticks = ticks;
142 KASSERT(uio->uio_rw == UIO_READ || uio->uio_rw == UIO_WRITE,
143 ("uiomoveco: mode"));
144 KASSERT(uio->uio_segflg != UIO_USERSPACE || uio->uio_td == curthread,
147 while (n > 0 && uio->uio_resid) {
158 switch (uio->uio_segflg) {
162 if (ticks - baseticks >= hogticks) {
166 if (uio->uio_rw == UIO_READ) {
167 #ifdef ENABLE_VFS_IOOPT
168 if (vfs_ioopt && ((cnt & PAGE_MASK) == 0) &&
169 ((((intptr_t) iov->iov_base) & PAGE_MASK) == 0) &&
170 ((uio->uio_offset & PAGE_MASK) == 0) &&
171 ((((intptr_t) cp) & PAGE_MASK) == 0)) {
172 error = vm_uiomove(&curproc->p_vmspace->vm_map, obj,
173 uio->uio_offset, cnt,
174 (vm_offset_t) iov->iov_base, NULL);
178 error = copyout(cp, iov->iov_base, cnt);
181 error = copyin(iov->iov_base, cp, cnt);
188 if (uio->uio_rw == UIO_READ)
189 bcopy((caddr_t)cp, iov->iov_base, cnt);
191 bcopy(iov->iov_base, (caddr_t)cp, cnt);
196 iov->iov_base += cnt;
198 uio->uio_resid -= cnt;
199 uio->uio_offset += cnt;
206 #ifdef ENABLE_VFS_IOOPT
209 uioread(n, uio, obj, nread)
212 struct vm_object *obj;
219 int baseticks = ticks;
227 while (n > 0 && uio->uio_resid) {
238 if ((uio->uio_segflg == UIO_USERSPACE) &&
239 ((((intptr_t) iov->iov_base) & PAGE_MASK) == 0) &&
240 ((uio->uio_offset & PAGE_MASK) == 0) ) {
247 if (ticks - baseticks >= hogticks) {
251 error = vm_uiomove(&curproc->p_vmspace->vm_map, obj,
252 uio->uio_offset, cnt,
253 (vm_offset_t) iov->iov_base, &npagesmoved);
255 if (npagesmoved == 0)
258 tcnt = npagesmoved * PAGE_SIZE;
264 iov->iov_base += cnt;
266 uio->uio_resid -= cnt;
267 uio->uio_offset += cnt;
280 * Give next character to user as result of read.
290 if (uio->uio_iovcnt == 0 || uio->uio_resid == 0)
293 if (iov->iov_len == 0) {
298 switch (uio->uio_segflg) {
301 if (subyte(iov->iov_base, c) < 0)
310 if (suibyte(iov->iov_base, c) < 0)
323 #ifdef vax /* unused except by ct.c, other oddities XXX */
325 * Get next character written in by user from uio.
334 if (uio->uio_resid <= 0)
337 if (uio->uio_iovcnt <= 0)
340 if (iov->iov_len == 0) {
342 if (--uio->uio_iovcnt == 0)
346 switch (uio->uio_segflg) {
349 c = fubyte(iov->iov_base);
353 c = *(u_char *) iov->iov_base;
357 c = fuibyte(iov->iov_base);
371 * General routine to allocate a hash table.
374 hashinit(elements, type, hashmask)
376 struct malloc_type *type;
380 LIST_HEAD(generic, generic) *hashtbl;
384 panic("hashinit: bad elements");
385 for (hashsize = 1; hashsize <= elements; hashsize <<= 1)
388 hashtbl = malloc((u_long)hashsize * sizeof(*hashtbl), type, M_WAITOK);
389 for (i = 0; i < hashsize; i++)
390 LIST_INIT(&hashtbl[i]);
391 *hashmask = hashsize - 1;
395 static int primes[] = { 1, 13, 31, 61, 127, 251, 509, 761, 1021, 1531, 2039,
396 2557, 3067, 3583, 4093, 4603, 5119, 5623, 6143, 6653,
397 7159, 7673, 8191, 12281, 16381, 24571, 32749 };
398 #define NPRIMES (sizeof(primes) / sizeof(primes[0]))
401 * General routine to allocate a prime number sized hash table.
404 phashinit(elements, type, nentries)
406 struct malloc_type *type;
410 LIST_HEAD(generic, generic) *hashtbl;
414 panic("phashinit: bad elements");
415 for (i = 1, hashsize = primes[1]; hashsize <= elements;) {
419 hashsize = primes[i];
421 hashsize = primes[i - 1];
422 hashtbl = malloc((u_long)hashsize * sizeof(*hashtbl), type, M_WAITOK);
423 for (i = 0; i < hashsize; i++)
424 LIST_INIT(&hashtbl[i]);
425 *nentries = hashsize;
430 * Simple DDB stack trace funtionality.
437 printf("Stack backtrace:\n");
438 db_print_backtrace();
440 printf("Cannot print stack trace.\n");
441 printf("DDB kernel option is needed.\n");