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 * k - only accessed by curthread 51 * w - locked by proc itim lock 52 * w2 - locked by proc prof lock 53 */ 54struct pstats { 55#define pstat_startzero p_cru 56 struct rusage p_cru; /* Stats for reaped children. */ 57 struct itimerval p_timer[3]; /* (w) 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 + w2) Buffer base. */ 63 u_long pr_size; /* (c + w2) Buffer size. */ 64 u_long pr_off; /* (c + w2) PC offset. */ 65 u_long pr_scale; /* (c + w2) 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 */ 78struct plimit { 79 struct rlimit pl_rlimit[RLIM_NLIMITS]; 80 int pl_refcnt; /* number of references */ 81}; 82 83struct racct; 84 85/*- 86 * Per uid resource consumption. This structure is used to track 87 * the total resource consumption (process count, socket buffer size, 88 * etc) for the uid and impose limits. 89 * 90 * Locking guide: 91 * (a) Constant from inception 92 * (b) Lockless, updated using atomics 93 * (c) Locked by global uihashtbl_lock 94 * (d) Locked by the ui_vmsize_mtx 95 */ 96struct uidinfo { 97 LIST_ENTRY(uidinfo) ui_hash; /* (c) hash chain of uidinfos */ 98 struct mtx ui_vmsize_mtx; 99 vm_ooffset_t ui_vmsize; /* (d) swap reservation by uid */ 100 long ui_sbsize; /* (b) socket buffer space consumed */ 101 long ui_proccnt; /* (b) number of processes */ 102 long ui_ptscnt; /* (b) number of pseudo-terminals */ 103 long ui_kqcnt; /* (b) number of kqueues */ 104 long ui_umtxcnt; /* (b) number of shared umtxs */ 105 uid_t ui_uid; /* (a) uid */ 106 u_int ui_ref; /* (b) reference count */ 107#ifdef RACCT 108 struct racct *ui_racct; /* (a) resource accounting */ 109#endif 110}; 111 112#define UIDINFO_VMSIZE_LOCK(ui) mtx_lock(&((ui)->ui_vmsize_mtx)) 113#define UIDINFO_VMSIZE_UNLOCK(ui) mtx_unlock(&((ui)->ui_vmsize_mtx)) 114 115struct proc; 116struct rusage_ext; 117struct thread; 118 119void addupc_intr(struct thread *td, uintfptr_t pc, u_int ticks); 120void addupc_task(struct thread *td, uintfptr_t pc, u_int ticks); 121void calccru(struct proc *p, struct timeval *up, struct timeval *sp); 122void calcru(struct proc *p, struct timeval *up, struct timeval *sp); 123int chgkqcnt(struct uidinfo *uip, int diff, rlim_t max); 124int chgproccnt(struct uidinfo *uip, int diff, rlim_t maxval); 125int chgsbsize(struct uidinfo *uip, u_int *hiwat, u_int to, 126 rlim_t maxval); 127int chgptscnt(struct uidinfo *uip, int diff, rlim_t maxval); 128int chgumtxcnt(struct uidinfo *uip, int diff, rlim_t maxval); 129int fuswintr(void *base); 130int kern_proc_setrlimit(struct thread *td, struct proc *p, u_int which, 131 struct rlimit *limp); 132struct plimit 133 *lim_alloc(void); 134void lim_copy(struct plimit *dst, struct plimit *src); 135rlim_t lim_cur(struct thread *td, int which); 136rlim_t lim_cur_proc(struct proc *p, int which); 137void lim_fork(struct proc *p1, struct proc *p2); 138void lim_free(struct plimit *limp); 139struct plimit 140 *lim_hold(struct plimit *limp); 141rlim_t lim_max(struct thread *td, int which); 142rlim_t lim_max_proc(struct proc *p, int which); 143void lim_rlimit(struct thread *td, int which, struct rlimit *rlp); 144void lim_rlimit_proc(struct proc *p, int which, struct rlimit *rlp); 145void ruadd(struct rusage *ru, struct rusage_ext *rux, struct rusage *ru2, 146 struct rusage_ext *rux2); 147void rucollect(struct rusage *ru, struct rusage *ru2); 148void rufetch(struct proc *p, struct rusage *ru); 149void rufetchcalc(struct proc *p, struct rusage *ru, struct timeval *up, 150 struct timeval *sp); 151void rufetchtd(struct thread *td, struct rusage *ru); 152void ruxagg(struct proc *p, struct thread *td); 153int suswintr(void *base, int word); 154struct uidinfo 155 *uifind(uid_t uid); 156void uifree(struct uidinfo *uip); 157void uihashinit(void); 158void uihold(struct uidinfo *uip); 159#ifdef RACCT 160void ui_racct_foreach(void (*callback)(struct racct *racct, 161 void *arg2, void *arg3), void (*pre)(void), void (*post)(void), 162 void *arg2, void *arg3); 163#endif 164 165#endif /* _KERNEL */ 166#endif /* !_SYS_RESOURCEVAR_H_ */ 167