|
|
1.1 root 1: /*-
2: * Copyright (c) 1982, 1988, 1991 The Regents of the University of California.
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, this list of conditions and the following disclaimer.
10: * 2. Redistributions in binary form must reproduce the above copyright
11: * notice, this list of conditions and the following disclaimer in the
12: * documentation and/or other materials provided with the distribution.
13: * 3. All advertising materials mentioning features or use of this software
14: * must display the following acknowledgement:
15: * This product includes software developed by the University of
16: * California, Berkeley and its contributors.
17: * 4. Neither the name of the University nor the names of its contributors
18: * may be used to endorse or promote products derived from this software
19: * without specific prior written permission.
20: *
21: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31: * SUCH DAMAGE.
32: *
33: * @(#)systm.h 7.17 (Berkeley) 5/25/91
1.1.1.2 ! root 34: *
! 35: * PATCHES MAGIC LEVEL PATCH THAT GOT US HERE
! 36: * -------------------- ----- ----------------------
! 37: * CURRENT PATCH LEVEL: 1 00061
! 38: * -------------------- ----- ----------------------
! 39: *
! 40: * 11 Dec 92 Williams Jolitz Fixed and tty handling
1.1 root 41: */
42:
43: extern char *panicstr; /* panic message */
44: extern char version[]; /* system version */
45: extern char copyright[]; /* system copyright */
46:
47: extern int nblkdev; /* number of entries in bdevsw */
48: extern int nchrdev; /* number of entries in cdevsw */
49: extern int nswdev; /* number of swap devices */
50: extern int nswap; /* size of swap space */
51:
52: extern int selwait; /* select timeout address */
53:
54: extern u_char curpri; /* priority of current process */
55:
56: extern int maxmem; /* max memory per process */
57: extern int physmem; /* physical memory */
58:
59: extern dev_t dumpdev; /* dump device */
60: extern long dumplo; /* offset into dumpdev */
61:
62: extern dev_t rootdev; /* root device */
63: extern struct vnode *rootvp; /* vnode equivalent to above */
64:
65: extern dev_t swapdev; /* swapping device */
66: extern struct vnode *swapdev_vp;/* vnode equivalent to above */
67:
68: extern struct sysent { /* system call table */
69: int sy_narg; /* number of arguments */
70: int (*sy_call)(); /* implementing function */
71: } sysent[];
72:
73: extern int boothowto; /* reboot flags, from console subsystem */
74: #ifdef KADB
75: extern char *bootesym; /* end of symbol info from boot */
76: #endif
77:
78: /* casts to keep lint happy */
79: #define insque(q,p) _insque((caddr_t)q,(caddr_t)p)
80: #define remque(q) _remque((caddr_t)q)
81:
82: /*
83: * General function declarations.
84: */
85: int nullop __P((void));
86: int enodev __P((void));
87: int enoioctl __P((void));
88: int enxio __P((void));
89: int eopnotsupp __P((void));
1.1.1.2 ! root 90: int selscan __P((struct proc *p, fd_set *ibits, fd_set *obits,
! 91: int nfd, int *retval));
1.1 root 92: int seltrue __P((dev_t dev, int which, struct proc *p));
1.1.1.2 ! root 93: void selwakeup __P((pid_t pid, int coll));
1.1 root 94:
95: void panic __P((char *));
96: void tablefull __P((char *));
97: void addlog __P((const char *, ...));
98: void log __P((int, const char *, ...));
99: void printf __P((const char *, ...));
100: int sprintf __P((char *buf, const char *, ...));
101: void ttyprintf __P((struct tty *, const char *, ...));
102:
103: void bcopy __P((void *from, void *to, u_int len));
104: void ovbcopy __P((void *from, void *to, u_int len));
105: void bzero __P((void *buf, u_int len));
106: int bcmp __P((void *str1, void *str2, u_int len));
107: int strlen __P((char *string));
108:
109: int copystr __P((void *kfaddr, void *kdaddr, u_int len, u_int *done));
110: int copyinstr __P((void *udaddr, void *kaddr, u_int len, u_int *done));
111: int copyoutstr __P((void *kaddr, void *udaddr, u_int len, u_int *done));
112: int copyin __P((void *udaddr, void *kaddr, u_int len));
113: int copyout __P((void *kaddr, void *udaddr, u_int len));
114:
115: int fubyte __P((void *base));
116: #ifdef notdef
117: int fuibyte __P((void *base));
118: #endif
119: int subyte __P((void *base, int byte));
120: int suibyte __P((void *base, int byte));
121: int fuword __P((void *base));
122: int fuiword __P((void *base));
123: int suword __P((void *base, int word));
124: int suiword __P((void *base, int word));
125:
126: int scanc __P((unsigned size, u_char *cp, u_char *table, int mask));
127: int skpc __P((int mask, int size, char *cp));
128: int locc __P((int mask, char *cp, unsigned size));
129: int ffs __P((long value));
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.