|
|
1.1 root 1: /*
2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * The contents of this file constitute Original Code as defined in and
7: * are subject to the Apple Public Source License Version 1.1 (the
8: * "License"). You may not use this file except in compliance with the
9: * License. Please obtain a copy of the License at
10: * http://www.apple.com/publicsource and read it before using this file.
11: *
12: * This Original Code and all software distributed under the License are
13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17: * License for the specific language governing rights and limitations
18: * under the License.
19: *
20: * @APPLE_LICENSE_HEADER_END@
21: */
22: /* Copyright (c) 1995, 1997 Apple Computer, Inc. All Rights Reserved */
23: /*
24: * Copyright (c) 1991, 1993
25: * The Regents of the University of California. All rights reserved.
26: *
27: * Redistribution and use in source and binary forms, with or without
28: * modification, are permitted provided that the following conditions
29: * are met:
30: * 1. Redistributions of source code must retain the above copyright
31: * notice, this list of conditions and the following disclaimer.
32: * 2. Redistributions in binary form must reproduce the above copyright
33: * notice, this list of conditions and the following disclaimer in the
34: * documentation and/or other materials provided with the distribution.
35: * 3. All advertising materials mentioning features or use of this software
36: * must display the following acknowledgement:
37: * This product includes software developed by the University of
38: * California, Berkeley and its contributors.
39: * 4. Neither the name of the University nor the names of its contributors
40: * may be used to endorse or promote products derived from this software
41: * without specific prior written permission.
42: *
43: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
44: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
45: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
46: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
47: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
48: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
49: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
50: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
51: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
52: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
53: * SUCH DAMAGE.
54: *
55: * @(#)resourcevar.h 8.4 (Berkeley) 1/9/95
56: */
57:
58: #ifndef _SYS_RESOURCEVAR_H_
59: #define _SYS_RESOURCEVAR_H_
60:
61: /*
62: * Kernel per-process accounting / statistics
63: * (not necessarily resident except when running).
64: */
65: struct pstats {
66: #define pstat_startzero p_ru
67: struct rusage p_ru; /* stats for this proc */
68: struct rusage p_cru; /* sum of stats for reaped children */
69:
70: struct uprof { /* profile arguments */
71: struct uprof *pr_next; /* multiple prof buffers allowed */
72: caddr_t pr_base; /* buffer base */
73: u_long pr_size; /* buffer size */
74: u_long pr_off; /* pc offset */
75: u_long pr_scale; /* pc scaling */
76: u_long pr_addr; /* temp storage for addr until AST */
77: u_long pr_ticks; /* temp storage for ticks until AST */
78: } p_prof;
79: #define pstat_endzero pstat_startcopy
80:
81: #define pstat_startcopy p_timer
82: struct itimerval p_timer[3]; /* virtual-time timers */
83: #define pstat_endcopy p_start
84: struct timeval p_start; /* starting time */
85: };
86:
87: /*
88: * Kernel shareable process resource limits. Because this structure
89: * is moderately large but changes infrequently, it is normally
90: * shared copy-on-write after forks. If a group of processes
91: * ("threads") share modifications, the PL_SHAREMOD flag is set,
92: * and a copy must be made for the child of a new fork that isn't
93: * sharing modifications to the limits.
94: */
95: struct plimit {
96: struct rlimit pl_rlimit[RLIM_NLIMITS];
97: #define PL_SHAREMOD 0x01 /* modifications are shared */
98: int p_lflags;
99: int p_refcnt; /* number of references */
100: };
101:
102: /* add user profiling from AST */
103: #define ADDUPROF(p) \
104: addupc_task(p, \
105: (p)->p_stats->p_prof.pr_addr, (p)->p_stats->p_prof.pr_ticks)
106:
107: #ifdef KERNEL
108: void addupc_intr __P((struct proc *p, u_long pc, u_int ticks));
109: void addupc_task __P((struct proc *p, u_long pc, u_int ticks));
110: void calcru __P((struct proc *p, struct timeval *up, struct timeval *sp,
111: struct timeval *ip));
112: struct plimit
113: *limcopy __P((struct plimit *lim));
114: void ruadd __P((struct rusage *ru, struct rusage *ru2));
115: #endif
116:
117: #endif /* !_SYS_RESOURCEVAR_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.