1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1982, 1986, 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 * @(#)resource.h 8.4 (Berkeley) 1/9/95 32 */ 33 34 #ifndef _SYS_RESOURCE_H_ 35 #define _SYS_RESOURCE_H_ 36 37 #include <sys/cdefs.h> 38 #include <sys/_timeval.h> 39 #include <sys/_types.h> 40 41 #ifndef _ID_T_DECLARED 42 typedef __id_t id_t; 43 #define _ID_T_DECLARED 44 #endif 45 46 #ifndef _RLIM_T_DECLARED 47 typedef __rlim_t rlim_t; 48 #define _RLIM_T_DECLARED 49 #endif 50 51 /* 52 * Process priority specifications to get/setpriority. 53 */ 54 #define PRIO_MIN -20 55 #define PRIO_MAX 20 56 57 #define PRIO_PROCESS 0 58 #define PRIO_PGRP 1 59 #define PRIO_USER 2 60 61 /* 62 * Resource utilization information. 63 * 64 * All fields are only modified by curthread and 65 * no locks are required to read. 66 */ 67 68 #define RUSAGE_SELF 0 69 #define RUSAGE_CHILDREN -1 70 #define RUSAGE_THREAD 1 71 72 struct rusage { 73 struct timeval ru_utime; /* user time used */ 74 struct timeval ru_stime; /* system time used */ 75 long ru_maxrss; /* max resident set size */ 76 #define ru_first ru_ixrss 77 long ru_ixrss; /* integral shared memory size */ 78 long ru_idrss; /* integral unshared data " */ 79 long ru_isrss; /* integral unshared stack " */ 80 long ru_minflt; /* page reclaims */ 81 long ru_majflt; /* page faults */ 82 long ru_nswap; /* swaps */ 83 long ru_inblock; /* block input operations */ 84 long ru_oublock; /* block output operations */ 85 long ru_msgsnd; /* messages sent */ 86 long ru_msgrcv; /* messages received */ 87 long ru_nsignals; /* signals received */ 88 long ru_nvcsw; /* voluntary context switches */ 89 long ru_nivcsw; /* involuntary " */ 90 #define ru_last ru_nivcsw 91 }; 92 93 #if __BSD_VISIBLE 94 struct __wrusage { 95 struct rusage wru_self; 96 struct rusage wru_children; 97 }; 98 #endif 99 100 /* 101 * Resource limits 102 */ 103 #define RLIMIT_CPU 0 /* maximum cpu time in seconds */ 104 #define RLIMIT_FSIZE 1 /* maximum file size */ 105 #define RLIMIT_DATA 2 /* data size */ 106 #define RLIMIT_STACK 3 /* stack size */ 107 #define RLIMIT_CORE 4 /* core file size */ 108 #define RLIMIT_RSS 5 /* resident set size */ 109 #define RLIMIT_MEMLOCK 6 /* locked-in-memory address space */ 110 #define RLIMIT_NPROC 7 /* number of processes */ 111 #define RLIMIT_NOFILE 8 /* number of open files */ 112 #define RLIMIT_SBSIZE 9 /* maximum size of all socket buffers */ 113 #define RLIMIT_VMEM 10 /* virtual process size (incl. mmap) */ 114 #define RLIMIT_AS RLIMIT_VMEM /* standard name for RLIMIT_VMEM */ 115 #define RLIMIT_NPTS 11 /* pseudo-terminals */ 116 #define RLIMIT_SWAP 12 /* swap used */ 117 #define RLIMIT_KQUEUES 13 /* kqueues allocated */ 118 #define RLIMIT_UMTXP 14 /* process-shared umtx */ 119 120 #define RLIM_NLIMITS 15 /* number of resource limits */ 121 122 #define RLIM_INFINITY ((rlim_t)(((__uint64_t)1 << 63) - 1)) 123 #define RLIM_SAVED_MAX RLIM_INFINITY 124 #define RLIM_SAVED_CUR RLIM_INFINITY 125 126 /* 127 * Resource limit string identifiers 128 */ 129 130 #ifdef _RLIMIT_IDENT 131 static const char *rlimit_ident[RLIM_NLIMITS] = { 132 "cpu", 133 "fsize", 134 "data", 135 "stack", 136 "core", 137 "rss", 138 "memlock", 139 "nproc", 140 "nofile", 141 "sbsize", 142 "vmem", 143 "npts", 144 "swap", 145 "kqueues", 146 "umtx", 147 }; 148 #endif 149 150 struct rlimit { 151 rlim_t rlim_cur; /* current (soft) limit */ 152 rlim_t rlim_max; /* maximum value for rlim_cur */ 153 }; 154 155 #if __BSD_VISIBLE 156 157 struct orlimit { 158 __int32_t rlim_cur; /* current (soft) limit */ 159 __int32_t rlim_max; /* maximum value for rlim_cur */ 160 }; 161 162 struct loadavg { 163 __fixpt_t ldavg[3]; 164 long fscale; 165 }; 166 167 #define CP_USER 0 168 #define CP_NICE 1 169 #define CP_SYS 2 170 #define CP_INTR 3 171 #define CP_IDLE 4 172 #define CPUSTATES 5 173 174 #endif /* __BSD_VISIBLE */ 175 176 #ifdef _KERNEL 177 178 extern struct loadavg averunnable; 179 void read_cpu_time(long *cp_time); /* Writes array of CPUSTATES */ 180 181 #else 182 183 __BEGIN_DECLS 184 /* XXX 2nd arg to [gs]etpriority() should be an id_t */ 185 int getpriority(int, int); 186 int getrlimit(int, struct rlimit *); 187 int getrusage(int, struct rusage *); 188 int setpriority(int, int, int); 189 int setrlimit(int, const struct rlimit *); 190 __END_DECLS 191 192 #endif /* _KERNEL */ 193 #endif /* !_SYS_RESOURCE_H_ */ 194