resourcevar.h revision 110190
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: head/sys/sys/resourcevar.h 110190 2003-02-01 12:17:09Z julian $ 35 */ 36 37#ifndef _SYS_RESOURCEVAR_H_ 38#define _SYS_RESOURCEVAR_H_ 39 40#include <sys/resource.h> 41#include <sys/queue.h> 42#ifdef _KERNEL 43#include <sys/_lock.h> 44#include <sys/_mutex.h> 45#endif 46 47/* 48 * Kernel per-process accounting / statistics 49 * (not necessarily resident except when running). 50 */ 51struct pstats { 52#define pstat_startzero p_ru 53 struct rusage p_ru; /* stats for this proc */ 54 struct rusage p_cru; /* sum of stats for reaped children */ 55#define pstat_endzero pstat_startcopy 56 57#define pstat_startcopy p_timer 58 struct itimerval p_timer[3]; /* virtual-time timers */ 59 60 struct uprof { /* profile arguments */ 61 caddr_t pr_base; /* buffer base */ 62 u_long pr_size; /* buffer size */ 63 u_long pr_off; /* pc offset */ 64 u_long pr_scale; /* pc scaling */ 65 u_long pr_addr; /* temp storage for addr until AST */ 66 u_int pr_ticks; /* temp storage for ticks until AST */ 67 } p_prof; 68#define pstat_endcopy p_start 69 struct timeval p_start; /* starting time */ 70}; 71 72/* 73 * Kernel shareable process resource limits. Because this structure 74 * is moderately large but changes infrequently, it is normally 75 * shared copy-on-write after forks. If a group of processes 76 * ("threads") share modifications, the PL_SHAREMOD flag is set, 77 * and a copy must be made for the child of a new fork that isn't 78 * sharing modifications to the limits. 79 */ 80struct plimit { 81 struct rlimit pl_rlimit[RLIM_NLIMITS]; 82#define PL_SHAREMOD 0x01 /* modifications are shared */ 83 int p_lflags; 84 int p_refcnt; /* number of references */ 85}; 86 87#ifdef _KERNEL 88 89/* 90 * Per uid resource consumption 91 */ 92struct uidinfo { 93 LIST_ENTRY(uidinfo) ui_hash; 94 rlim_t ui_sbsize; /* socket buffer space consumed */ 95 long ui_proccnt; /* number of processes */ 96 uid_t ui_uid; /* uid */ 97 u_short ui_ref; /* reference count */ 98 struct mtx *ui_mtxp; /* protect all counts/limits */ 99}; 100 101#define UIDINFO_LOCK(ui) mtx_lock((ui)->ui_mtxp) 102#define UIDINFO_UNLOCK(ui) mtx_unlock((ui)->ui_mtxp) 103 104struct thread; 105struct kse; 106struct proc; 107 108void addupc_intr(struct kse *ke, uintptr_t pc, u_int ticks); 109void addupc_task(struct kse *ke, 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 *limcopy(struct plimit *lim); 118void ruadd(struct rusage *ru, struct rusage *ru2); 119int suswintr(void *base, int word); 120struct uidinfo 121 *uifind(uid_t uid); 122void uihold(struct uidinfo *uip); 123void uifree(struct uidinfo *uip); 124void uihashinit(void); 125#endif 126 127#endif /* !_SYS_RESOURCEVAR_H_ */ 128