| | 1 | /* |
| | 2 | * Copyright (c) 2000-2002 Apple Computer, Inc. All rights reserved. |
| | 3 | * |
| | 4 | * @APPLE_OSREFERENCE_LICENSE_HEADER_START@ |
| | 5 | * |
| | 6 | * This file contains Original Code and/or Modifications of Original Code |
| | 7 | * as defined in and that are subject to the Apple Public Source License |
| | 8 | * Version 2.0 (the 'License'). You may not use this file except in |
| | 9 | * compliance with the License. The rights granted to you under the License |
| | 10 | * may not be used to create, or enable the creation or redistribution of, |
| | 11 | * unlawful or unlicensed copies of an Apple operating system, or to |
| | 12 | * circumvent, violate, or enable the circumvention or violation of, any |
| | 13 | * terms of an Apple operating system software license agreement. |
| | 14 | * |
| | 15 | * Please obtain a copy of the License at |
| | 16 | * http://www.opensource.apple.com/apsl/ and read it before using this file. |
| | 17 | * |
| | 18 | * The Original Code and all software distributed under the License are |
| | 19 | * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER |
| | 20 | * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, |
| | 21 | * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, |
| | 22 | * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. |
| | 23 | * Please see the License for the specific language governing rights and |
| | 24 | * limitations under the License. |
| | 25 | * |
| | 26 | * @APPLE_OSREFERENCE_LICENSE_HEADER_END@ |
| | 27 | */ |
| | 28 | /* Copyright (c) 1995, 1997 Apple Computer, Inc. All Rights Reserved */ |
| | 29 | /* |
| | 30 | * Copyright (c) 1991, 1993 |
| | 31 | * The Regents of the University of California. All rights reserved. |
| | 32 | * |
| | 33 | * Redistribution and use in source and binary forms, with or without |
| | 34 | * modification, are permitted provided that the following conditions |
| | 35 | * are met: |
| | 36 | * 1. Redistributions of source code must retain the above copyright |
| | 37 | * notice, this list of conditions and the following disclaimer. |
| | 38 | * 2. Redistributions in binary form must reproduce the above copyright |
| | 39 | * notice, this list of conditions and the following disclaimer in the |
| | 40 | * documentation and/or other materials provided with the distribution. |
| | 41 | * 3. All advertising materials mentioning features or use of this software |
| | 42 | * must display the following acknowledgement: |
| | 43 | * This product includes software developed by the University of |
| | 44 | * California, Berkeley and its contributors. |
| | 45 | * 4. Neither the name of the University nor the names of its contributors |
| | 46 | * may be used to endorse or promote products derived from this software |
| | 47 | * without specific prior written permission. |
| | 48 | * |
| | 49 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
| | 50 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| | 51 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| | 52 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
| | 53 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| | 54 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| | 55 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| | 56 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| | 57 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| | 58 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| | 59 | * SUCH DAMAGE. |
| | 60 | * |
| | 61 | * @(#)resourcevar.h 8.4 (Berkeley) 1/9/95 |
| | 62 | */ |
| | 63 | |
| | 64 | #ifndef _SYS_RESOURCEVAR_H_ |
| | 65 | #define _SYS_RESOURCEVAR_H_ |
| | 66 | |
| | 67 | #include <sys/appleapiopts.h> |
| | 68 | |
| | 69 | /* |
| | 70 | * Kernel per-process accounting / statistics |
| | 71 | * (not necessarily resident except when running). |
| | 72 | */ |
| | 73 | struct pstats { |
| | 74 | #define pstat_startzero p_ru |
| | 75 | struct rusage p_ru; /* stats for this proc */ |
| | 76 | struct rusage p_cru; /* (PL) sum of stats for reaped children */ |
| | 77 | |
| | 78 | struct uprof { /* profile arguments */ |
| | 79 | struct uprof *pr_next; /* multiple prof buffers allowed */ |
| | 80 | caddr_t pr_base; /* buffer base */ |
| | 81 | u_int32_t pr_size; /* buffer size */ |
| | 82 | u_int32_t pr_off; /* pc offset */ |
| | 83 | u_int32_t pr_scale; /* pc scaling */ |
| | 84 | u_int32_t pr_addr; /* temp storage for addr until AST */ |
| | 85 | u_int32_t pr_ticks; /* temp storage for ticks until AST */ |
| | 86 | } p_prof; |
| | 87 | #define pstat_endzero p_start |
| | 88 | |
| | 89 | struct timeval p_start; /* starting time ; compat only */ |
| | 90 | #ifdef KERNEL |
| | 91 | struct user_uprof { /* profile arguments */ |
| | 92 | struct user_uprof *pr_next; /* multiple prof buffers allowed */ |
| | 93 | user_addr_t pr_base; /* buffer base */ |
| | 94 | user_size_t pr_size; /* buffer size */ |
| | 95 | user_ulong_t pr_off; /* pc offset */ |
| | 96 | user_ulong_t pr_scale; /* pc scaling */ |
| | 97 | user_ulong_t pr_addr; /* temp storage for addr until AST */ |
| | 98 | user_ulong_t pr_ticks; /* temp storage for ticks until AST */ |
| | 99 | } user_p_prof; |
| | 100 | #endif // KERNEL |
| | 101 | }; |
| | 102 | |
| | 103 | /* |
| | 104 | * Kernel shareable process resource limits. Because this structure |
| | 105 | * is moderately large but changes infrequently, it is normally |
| | 106 | * shared copy-on-write after forks. If a group of processes |
| | 107 | * ("threads") share modifications, the PL_SHAREMOD flag is set, |
| | 108 | * and a copy must be made for the child of a new fork that isn't |
| | 109 | * sharing modifications to the limits. |
| | 110 | */ |
| | 111 | /* |
| | 112 | * Modifications are done with the list lock held (p_limit as well)and access indv |
| | 113 | * limits can be done without limit as we keep the old copy in p_olimit. Which is |
| | 114 | * dropped in proc_exit. This way all access will have a valid kernel address |
| | 115 | */ |
| | 116 | struct plimit { |
| | 117 | struct rlimit pl_rlimit[RLIM_NLIMITS]; |
| | 118 | int pl_refcnt; /* number of references */ |
| | 119 | }; |
| | 120 | |
| | 121 | #ifdef KERNEL |
| | 122 | /* add user profiling from AST */ |
| | 123 | #define ADDUPROF(p) \ |
| | 124 | addupc_task(p, \ |
| | 125 | (proc_is64bit((p)) ? (p)->p_stats->user_p_prof.pr_addr \ |
| | 126 | : CAST_USER_ADDR_T((p)->p_stats->p_prof.pr_addr)), \ |
| | 127 | (proc_is64bit((p)) ? (p)->p_stats->user_p_prof.pr_ticks \ |
| | 128 | : (p)->p_stats->p_prof.pr_ticks)) |
| | 129 | |
| | 130 | void addupc_intr(struct proc *p, uint32_t pc, u_int ticks); |
| | 131 | void addupc_task(struct proc *p, user_addr_t pc, u_int ticks); |
| | 132 | void calcru(struct proc *p, struct timeval *up, struct timeval *sp, |
| | 133 | struct timeval *ip); |
| | 134 | void ruadd(struct rusage *ru, struct rusage *ru2); |
| | 135 | void proc_limitget(proc_t p, int whichi, struct rlimit * limp); |
| | 136 | void proc_limitdrop(proc_t p, int exiting); |
| | 137 | void proc_limitfork(proc_t parent, proc_t child); |
| | 138 | int proc_limitreplace(proc_t p); |
| | 139 | void proc_limitblock(proc_t); |
| | 140 | void proc_limitunblock(proc_t); |
| | 141 | #endif /* KERNEL */ |
| | 142 | |
| | 143 | |
| | 144 | #endif /* !_SYS_RESOURCEVAR_H_ */ |
projects / apple / xnu.git / blame_incremental