resourcevar.h revision 131437
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: head/sys/sys/resourcevar.h 131437 2004-07-02 03:50:48Z jhb $ 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 */ 53struct 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 u_long pr_addr; /* (k) Temporary addr until AST. */ 67 u_int pr_ticks; /* (k) Temporary ticks until AST. */ 68 } p_prof; 69#define pstat_endcopy p_start 70 struct timeval p_start; /* (b) Starting time. */ 71}; 72 73#ifdef _KERNEL 74 75/* 76 * Kernel shareable process resource limits. Because this structure 77 * is moderately large but changes infrequently, it is normally 78 * shared copy-on-write after forks. 79 */ 80struct plimit { 81 struct rlimit pl_rlimit[RLIM_NLIMITS]; 82 int pl_refcnt; /* number of references */ 83 struct mtx *pl_mtx; 84}; 85 86#define LIM_LOCK(lim) mtx_lock((lim)->pl_mtx) 87#define LIM_UNLOCK(lim) mtx_unlock((lim)->pl_mtx) 88#define LIM_LOCK_ASSERT(lim, f) mtx_assert((lim)->pl_mtx, (f)) 89 90/* 91 * Per uid resource consumption 92 */ 93struct uidinfo { 94 LIST_ENTRY(uidinfo) ui_hash; 95 rlim_t ui_sbsize; /* socket buffer space consumed */ 96 long ui_proccnt; /* number of processes */ 97 uid_t ui_uid; /* uid */ 98 u_int ui_ref; /* reference count */ 99 struct mtx *ui_mtxp; /* protect all counts/limits */ 100}; 101 102#define UIDINFO_LOCK(ui) mtx_lock((ui)->ui_mtxp) 103#define UIDINFO_UNLOCK(ui) mtx_unlock((ui)->ui_mtxp) 104 105struct proc; 106struct thread; 107 108void addupc_intr(struct thread *td, uintptr_t pc, u_int ticks); 109void addupc_task(struct thread *td, uintptr_t pc, u_int ticks); 110void calcru(struct proc *p, struct timeval *up, struct timeval *sp, 111 struct timeval *ip); 112int chgproccnt(struct uidinfo *uip, int diff, int max); 113int chgsbsize(struct uidinfo *uip, u_int *hiwat, u_int to, 114 rlim_t max); 115int fuswintr(void *base); 116struct plimit 117 *lim_alloc(void); 118void lim_copy(struct plimit *dst, struct plimit *src); 119rlim_t lim_cur(struct proc *p, int which); 120void lim_free(struct plimit *limp); 121struct plimit 122 *lim_hold(struct plimit *limp); 123rlim_t lim_max(struct proc *p, int which); 124void lim_rlimit(struct proc *p, int which, struct rlimit *rlp); 125void ruadd(struct rusage *ru, struct rusage *ru2); 126int suswintr(void *base, int word); 127struct uidinfo 128 *uifind(uid_t uid); 129void uifree(struct uidinfo *uip); 130void uihashinit(void); 131void uihold(struct uidinfo *uip); 132 133#endif /* _KERNEL */ 134#endif /* !_SYS_RESOURCEVAR_H_ */ 135