1 /* 2 * Copyright (c) 1991, 1993 3 * The Regents of the University of California. 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 * @(#)resourcevar.h 8.4 (Berkeley) 1/9/95 34 * $FreeBSD: src/sys/sys/resourcevar.h,v 1.16.2.1 2000/09/07 19:13:55 truckman Exp $ 35 * $DragonFly: src/sys/sys/resourcevar.h,v 1.13 2006/05/23 20:35:12 dillon Exp $ 36 */ 37 38 #ifndef _SYS_RESOURCEVAR_H_ 39 #define _SYS_RESOURCEVAR_H_ 40 41 #ifndef _SYS_TYPES_H_ 42 #include <sys/types.h> 43 #endif 44 #ifndef _SYS_RESOURCE_H_ 45 #include <sys/resource.h> 46 #endif 47 #ifndef _SYS_QUEUE_H_ 48 #include <sys/queue.h> 49 #endif 50 #ifndef _SYS_VARSYM_H_ 51 #include <sys/varsym.h> 52 #endif 53 #ifndef _SYS_TIME_H_ 54 #include <sys/time.h> 55 #endif 56 #ifndef _SYS_SPINLOCK_H_ 57 #include <sys/spinlock.h> 58 #endif 59 60 /* 61 * Kernel per-process accounting / statistics 62 * (not necessarily resident except when running). 63 */ 64 struct pstats { 65 struct rusage p_ru; /* stats for this proc */ 66 struct rusage p_cru; /* sum of stats for reaped children */ 67 }; 68 69 struct uprof { /* profile arguments */ 70 caddr_t pr_base; /* buffer base */ 71 u_long pr_size; /* buffer size */ 72 u_long pr_off; /* pc offset */ 73 u_long pr_scale; /* pc scaling */ 74 u_long pr_addr; /* temp storage for addr until AST */ 75 u_long pr_ticks; /* temp storage for ticks until AST */ 76 }; 77 78 /* 79 * Kernel shareable process resource limits. Because this structure 80 * is moderately large but changes infrequently, it is normally 81 * shared copy-on-write after forks. If a group of processes 82 * ("threads") share modifications, the PL_SHAREMOD flag is set, 83 * and a copy must be made for the child of a new fork that isn't 84 * sharing modifications to the limits. 85 */ 86 struct plimit { 87 struct rlimit pl_rlimit[RLIM_NLIMITS]; 88 int p_refcnt; /* number of references */ 89 int p_exclusive; /* exclusive to proc due to lwp's */ 90 rlim_t p_cpulimit; /* current cpu limit in usec */ 91 struct spinlock p_spin; 92 }; 93 94 #define PLIMIT_TESTCPU_OK 0 95 #define PLIMIT_TESTCPU_XCPU 1 96 #define PLIMIT_TESTCPU_KILL 2 97 98 /* 99 * Per uid resource consumption 100 */ 101 struct uidinfo { 102 LIST_ENTRY(uidinfo) ui_hash; 103 rlim_t ui_sbsize; /* socket buffer space consumed */ 104 long ui_proccnt; /* number of processes */ 105 uid_t ui_uid; /* uid */ 106 int ui_ref; /* reference count */ 107 int ui_posixlocks; /* number of POSIX locks */ 108 struct varsymset ui_varsymset; /* variant symlinks */ 109 }; 110 111 #ifdef _KERNEL 112 113 struct proc; 114 115 void addupc_intr (struct proc *p, u_long pc, u_int ticks); 116 void addupc_task (struct proc *p, u_long pc, u_int ticks); 117 void calcru (struct proc *p, struct timeval *up, struct timeval *sp, 118 struct timeval *ip); 119 int chgproccnt (struct uidinfo *uip, int diff, int max); 120 int chgsbsize (struct uidinfo *uip, u_long *hiwat, u_long to, rlim_t max); 121 int fuswintr (void *base); 122 void ruadd (struct rusage *ru, struct rusage *ru2); 123 int suswintr (void *base, int word); 124 struct uidinfo *uifind (uid_t uid); 125 void uihold (struct uidinfo *uip); 126 void uidrop (struct uidinfo *uip); 127 void uireplace (struct uidinfo **puip, struct uidinfo *nuip); 128 void uihashinit (void); 129 130 void plimit_init0(struct plimit *); 131 struct plimit *plimit_fork(struct plimit *); 132 int plimit_testcpulimit(struct plimit *, u_int64_t); 133 void plimit_modify(struct plimit **, int, struct rlimit *); 134 void plimit_free(struct plimit **); 135 136 #endif 137 138 #endif /* !_SYS_RESOURCEVAR_H_ */ 139