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 * 4. Neither the name of the University nor the names of its contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * 29 * @(#)resourcevar.h 8.4 (Berkeley) 1/9/95 30 * $FreeBSD$ 31 */ 32 33 #ifndef _SYS_RESOURCEVAR_H_ 34 #define _SYS_RESOURCEVAR_H_ 35 36 #include <sys/resource.h> 37 #include <sys/queue.h> 38 #ifdef _KERNEL 39 #include <sys/_lock.h> 40 #include <sys/_mutex.h> 41 #endif 42 43 /* 44 * Kernel per-process accounting / statistics 45 * (not necessarily resident except when running). 46 * 47 * Locking key: 48 * b - created at fork, never changes 49 * c - locked by proc mtx 50 * j - locked by sched_lock mtx 51 * k - only accessed by curthread 52 */ 53 struct pstats { 54 #define pstat_startzero p_ru 55 struct rusage p_ru; /* Stats for this process. */ 56 struct rusage p_cru; /* Stats for reaped children. */ 57 struct itimerval p_timer[3]; /* (j) Virtual-time timers. */ 58 #define pstat_endzero pstat_startcopy 59 60 #define pstat_startcopy p_prof 61 struct uprof { /* Profile arguments. */ 62 caddr_t pr_base; /* (c + j) Buffer base. */ 63 u_long pr_size; /* (c + j) Buffer size. */ 64 u_long pr_off; /* (c + j) PC offset. */ 65 u_long pr_scale; /* (c + j) PC scaling. */ 66 } p_prof; 67 #define pstat_endcopy p_start 68 struct timeval p_start; /* (b) Starting time. */ 69 }; 70 71 #ifdef _KERNEL 72 73 /* 74 * Kernel shareable process resource limits. Because this structure 75 * is moderately large but changes infrequently, it is normally 76 * shared copy-on-write after forks. 77 */ 78 struct plimit { 79 struct rlimit pl_rlimit[RLIM_NLIMITS]; 80 int pl_refcnt; /* number of references */ 81 }; 82 83 /*- 84 * Per uid resource consumption 85 * 86 * Locking guide: 87 * (a) Constant from inception 88 * (b) Locked by ui_mtxp 89 * (c) Locked by global uihashtbl_mtx 90 */ 91 struct uidinfo { 92 LIST_ENTRY(uidinfo) ui_hash; /* (c) hash chain of uidinfos */ 93 rlim_t ui_sbsize; /* (b) socket buffer space consumed */ 94 long ui_proccnt; /* (b) number of processes */ 95 uid_t ui_uid; /* (a) uid */ 96 u_int ui_ref; /* (b) reference count */ 97 struct mtx *ui_mtxp; /* protect all counts/limits */ 98 }; 99 100 #define UIDINFO_LOCK(ui) mtx_lock((ui)->ui_mtxp) 101 #define UIDINFO_UNLOCK(ui) mtx_unlock((ui)->ui_mtxp) 102 103 struct proc; 104 struct rusage_ext; 105 struct thread; 106 107 void addupc_intr(struct thread *td, uintfptr_t pc, u_int ticks); 108 void addupc_task(struct thread *td, uintfptr_t pc, u_int ticks); 109 void calccru(struct proc *p, struct timeval *up, struct timeval *sp); 110 void calcru(struct proc *p, struct timeval *up, struct timeval *sp); 111 int chgproccnt(struct uidinfo *uip, int diff, int maxval); 112 int chgsbsize(struct uidinfo *uip, u_int *hiwat, u_int to, 113 rlim_t maxval); 114 int fuswintr(void *base); 115 struct plimit 116 *lim_alloc(void); 117 void lim_copy(struct plimit *dst, struct plimit *src); 118 rlim_t lim_cur(struct proc *p, int which); 119 void lim_free(struct plimit *limp); 120 struct plimit 121 *lim_hold(struct plimit *limp); 122 rlim_t lim_max(struct proc *p, int which); 123 void lim_rlimit(struct proc *p, int which, struct rlimit *rlp); 124 void ruadd(struct rusage *ru, struct rusage_ext *rux, struct rusage *ru2, 125 struct rusage_ext *rux2); 126 int suswintr(void *base, int word); 127 struct uidinfo 128 *uifind(uid_t uid); 129 void uifree(struct uidinfo *uip); 130 void uihashinit(void); 131 void uihold(struct uidinfo *uip); 132 133 #endif /* _KERNEL */ 134 #endif /* !_SYS_RESOURCEVAR_H_ */ 135