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