The Design and Implementation of the FreeBSD Operating System, Second Edition
Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]

FreeBSD/Linux Kernel Cross Reference
sys/sys/resourcevar.h

Version: -  FREEBSD  -  FREEBSD-12-STABLE  -  FREEBSD-12-0  -  FREEBSD-11-STABLE  -  FREEBSD-11-2  -  FREEBSD-11-1  -  FREEBSD-11-0  -  FREEBSD-10-STABLE  -  FREEBSD-10-4  -  FREEBSD-10-3  -  FREEBSD-10-2  -  FREEBSD-10-1  -  FREEBSD-10-0  -  FREEBSD-9-STABLE  -  FREEBSD-9-3  -  FREEBSD-9-2  -  FREEBSD-9-1  -  FREEBSD-9-0  -  FREEBSD-8-STABLE  -  FREEBSD-8-4  -  FREEBSD-8-3  -  FREEBSD-8-2  -  FREEBSD-8-1  -  FREEBSD-8-0  -  FREEBSD-7-STABLE  -  FREEBSD-7-4  -  FREEBSD-7-3  -  FREEBSD-7-2  -  FREEBSD-7-1  -  FREEBSD-7-0  -  FREEBSD-6-STABLE  -  FREEBSD-6-4  -  FREEBSD-6-3  -  FREEBSD-6-2  -  FREEBSD-6-1  -  FREEBSD-6-0  -  FREEBSD-5-STABLE  -  FREEBSD-5-5  -  FREEBSD-5-4  -  FREEBSD-5-3  -  FREEBSD-5-2  -  FREEBSD-5-1  -  FREEBSD-5-0  -  FREEBSD-4-STABLE  -  FREEBSD-3-STABLE  -  FREEBSD22  -  linux-2.6  -  linux-2.4.22  -  MK83  -  MK84  -  PLAN9  -  DFBSD  -  NETBSD  -  NETBSD5  -  NETBSD4  -  NETBSD3  -  NETBSD20  -  OPENBSD  -  xnu-517  -  xnu-792  -  xnu-792.6.70  -  xnu-1228  -  xnu-1456.1.26  -  xnu-1699.24.8  -  xnu-2050.18.24  -  OPENSOLARIS  -  minix-3-1-1 
SearchContext: -  none  -  3  -  10 

    1 /*-
    2  * SPDX-License-Identifier: BSD-3-Clause
    3  *
    4  * Copyright (c) 1991, 1993
    5  *      The Regents of the University of California.  All rights reserved.
    6  *
    7  * Redistribution and use in source and binary forms, with or without
    8  * modification, are permitted provided that the following conditions
    9  * are met:
   10  * 1. Redistributions of source code must retain the above copyright
   11  *    notice, this list of conditions and the following disclaimer.
   12  * 2. Redistributions in binary form must reproduce the above copyright
   13  *    notice, this list of conditions and the following disclaimer in the
   14  *    documentation and/or other materials provided with the distribution.
   15  * 3. Neither the name of the University nor the names of its contributors
   16  *    may be used to endorse or promote products derived from this software
   17  *    without specific prior written permission.
   18  *
   19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
   20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
   23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   29  * SUCH DAMAGE.
   30  *
   31  *      @(#)resourcevar.h       8.4 (Berkeley) 1/9/95
   32  * $FreeBSD: stable/12/sys/sys/resourcevar.h 339187 2018-10-05 05:50:56Z mmacy $
   33  */
   34 
   35 #ifndef _SYS_RESOURCEVAR_H_
   36 #define _SYS_RESOURCEVAR_H_
   37 
   38 #include <sys/resource.h>
   39 #include <sys/queue.h>
   40 #ifdef _KERNEL
   41 #include <sys/_lock.h>
   42 #include <sys/_mutex.h>
   43 #endif
   44 
   45 /*
   46  * Kernel per-process accounting / statistics
   47  * (not necessarily resident except when running).
   48  *
   49  * Locking key:
   50  *      b - created at fork, never changes
   51  *      c - locked by proc mtx
   52  *      k - only accessed by curthread
   53  *      w - locked by proc itim lock
   54  *      w2 - locked by proc prof lock
   55  */
   56 struct pstats {
   57 #define pstat_startzero p_cru
   58         struct  rusage p_cru;           /* Stats for reaped children. */
   59         struct  itimerval p_timer[3];   /* (w) Virtual-time timers. */
   60 #define pstat_endzero   pstat_startcopy
   61 
   62 #define pstat_startcopy p_prof
   63         struct uprof {                  /* Profile arguments. */
   64                 caddr_t pr_base;        /* (c + w2) Buffer base. */
   65                 u_long  pr_size;        /* (c + w2) Buffer size. */
   66                 u_long  pr_off;         /* (c + w2) PC offset. */
   67                 u_long  pr_scale;       /* (c + w2) PC scaling. */
   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  */
   80 struct plimit {
   81         struct  rlimit pl_rlimit[RLIM_NLIMITS];
   82         int     pl_refcnt;              /* number of references */
   83 };
   84 
   85 struct racct;
   86 
   87 /*-
   88  * Per uid resource consumption.  This structure is used to track
   89  * the total resource consumption (process count, socket buffer size,
   90  * etc) for the uid and impose limits.
   91  *
   92  * Locking guide:
   93  * (a) Constant from inception
   94  * (b) Lockless, updated using atomics
   95  * (c) Locked by global uihashtbl_lock
   96  */
   97 struct uidinfo {
   98         LIST_ENTRY(uidinfo) ui_hash;    /* (c) hash chain of uidinfos */
   99         u_long ui_vmsize;       /* (b) pages of 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 
  115 struct proc;
  116 struct rusage_ext;
  117 struct thread;
  118 
  119 void     addupc_intr(struct thread *td, uintfptr_t pc, u_int ticks);
  120 void     addupc_task(struct thread *td, uintfptr_t pc, u_int ticks);
  121 void     calccru(struct proc *p, struct timeval *up, struct timeval *sp);
  122 void     calcru(struct proc *p, struct timeval *up, struct timeval *sp);
  123 int      chgkqcnt(struct uidinfo *uip, int diff, rlim_t max);
  124 int      chgproccnt(struct uidinfo *uip, int diff, rlim_t maxval);
  125 int      chgsbsize(struct uidinfo *uip, u_int *hiwat, u_int to,
  126             rlim_t maxval);
  127 int      chgptscnt(struct uidinfo *uip, int diff, rlim_t maxval);
  128 int      chgumtxcnt(struct uidinfo *uip, int diff, rlim_t maxval);
  129 int      kern_proc_setrlimit(struct thread *td, struct proc *p, u_int which,
  130             struct rlimit *limp);
  131 struct plimit
  132         *lim_alloc(void);
  133 void     lim_copy(struct plimit *dst, struct plimit *src);
  134 rlim_t   lim_cur(struct thread *td, int which);
  135 rlim_t   lim_cur_proc(struct proc *p, int which);
  136 void     lim_fork(struct proc *p1, struct proc *p2);
  137 void     lim_free(struct plimit *limp);
  138 struct plimit
  139         *lim_hold(struct plimit *limp);
  140 rlim_t   lim_max(struct thread *td, int which);
  141 rlim_t   lim_max_proc(struct proc *p, int which);
  142 void     lim_rlimit(struct thread *td, int which, struct rlimit *rlp);
  143 void     lim_rlimit_proc(struct proc *p, int which, struct rlimit *rlp);
  144 void     ruadd(struct rusage *ru, struct rusage_ext *rux, struct rusage *ru2,
  145             struct rusage_ext *rux2);
  146 void     rucollect(struct rusage *ru, struct rusage *ru2);
  147 void     rufetch(struct proc *p, struct rusage *ru);
  148 void     rufetchcalc(struct proc *p, struct rusage *ru, struct timeval *up,
  149             struct timeval *sp);
  150 void     rufetchtd(struct thread *td, struct rusage *ru);
  151 void     ruxagg(struct proc *p, struct thread *td);
  152 struct uidinfo
  153         *uifind(uid_t uid);
  154 void     uifree(struct uidinfo *uip);
  155 void     uihashinit(void);
  156 void     uihold(struct uidinfo *uip);
  157 #ifdef  RACCT
  158 void     ui_racct_foreach(void (*callback)(struct racct *racct,
  159             void *arg2, void *arg3), void (*pre)(void), void (*post)(void),
  160             void *arg2, void *arg3);
  161 #endif
  162 
  163 #endif /* _KERNEL */
  164 #endif /* !_SYS_RESOURCEVAR_H_ */

Cache object: fa6439a550a2ecbb111471f29e71d5f5


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]


This page is part of the FreeBSD/Linux Linux Kernel Cross-Reference, and was automatically generated using a modified version of the LXR engine.