]>
Commit | Line | Data |
---|---|---|
f0e44959 | 1 | /* Bit values & structures for resource limits. Linux version. |
a9c27b3e | 2 | Copyright (C) 1994, 1996, 1997, 1998, 1999 Free Software Foundation, Inc. |
54d79e99 UD |
3 | This file is part of the GNU C Library. |
4 | ||
5 | The GNU C Library is free software; you can redistribute it and/or | |
6 | modify it under the terms of the GNU Library General Public License as | |
7 | published by the Free Software Foundation; either version 2 of the | |
8 | License, or (at your option) any later version. | |
9 | ||
10 | The GNU C Library is distributed in the hope that it will be useful, | |
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
13 | Library General Public License for more details. | |
14 | ||
15 | You should have received a copy of the GNU Library General Public | |
16 | License along with the GNU C Library; see the file COPYING.LIB. If not, | |
17 | write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
18 | Boston, MA 02111-1307, USA. */ | |
f0e44959 | 19 | |
f4017d20 UD |
20 | #ifndef _SYS_RESOURCE_H |
21 | # error "Never use <bits/resource.h> directly; include <sys/resource.h> instead." | |
22 | #endif | |
23 | ||
f0e44959 | 24 | #include <asm/resource.h> |
dfd2257a | 25 | #include <bits/types.h> |
f0e44959 UD |
26 | |
27 | /* Transmute defines to enumerations. The macro re-definitions are | |
28 | necessary because some programs want to test for operating system | |
29 | features with #ifdef RUSAGE_SELF. In ISO C the reflexive | |
30 | definition is a no-op. */ | |
31 | ||
32 | /* Kinds of resource limit. */ | |
33 | enum __rlimit_resource | |
34 | { | |
35 | /* Per-process CPU limit, in seconds. */ | |
36 | _RLIMIT_CPU = RLIMIT_CPU, | |
37 | #undef RLIMIT_CPU | |
38 | RLIMIT_CPU = _RLIMIT_CPU, | |
39 | #define RLIMIT_CPU RLIMIT_CPU | |
40 | ||
41 | /* Largest file that can be created, in bytes. */ | |
42 | _RLIMIT_FSIZE = RLIMIT_FSIZE, | |
43 | #undef RLIMIT_FSIZE | |
44 | RLIMIT_FSIZE = _RLIMIT_FSIZE, | |
45 | #define RLIMIT_FSIZE RLIMIT_FSIZE | |
46 | ||
47 | /* Maximum size of data segment, in bytes. */ | |
48 | _RLIMIT_DATA = RLIMIT_DATA, | |
49 | #undef RLIMIT_DATA | |
50 | RLIMIT_DATA = _RLIMIT_DATA, | |
51 | #define RLIMIT_DATA RLIMIT_DATA | |
52 | ||
53 | /* Maximum size of stack segment, in bytes. */ | |
54 | _RLIMIT_STACK = RLIMIT_STACK, | |
55 | #undef RLIMIT_STACK | |
56 | RLIMIT_STACK = _RLIMIT_STACK, | |
57 | #define RLIMIT_STACK RLIMIT_STACK | |
58 | ||
59 | /* Largest core file that can be created, in bytes. */ | |
60 | _RLIMIT_CORE = RLIMIT_CORE, | |
61 | #undef RLIMIT_CORE | |
62 | RLIMIT_CORE = _RLIMIT_CORE, | |
63 | #define RLIMIT_CORE RLIMIT_CORE | |
64 | ||
65 | /* Largest resident set size, in bytes. | |
66 | This affects swapping; processes that are exceeding their | |
67 | resident set size will be more likely to have physical memory | |
68 | taken from them. */ | |
69 | _RLIMIT_RSS = RLIMIT_RSS, | |
70 | #undef RLIMIT_RSS | |
71 | RLIMIT_RSS = _RLIMIT_RSS, | |
72 | #define RLIMIT_RSS RLIMIT_RSS | |
73 | ||
74 | /* Number of open files. */ | |
75 | _RLIMIT_NOFILE = RLIMIT_NOFILE, | |
76 | #undef RLIMIT_NOFILE | |
77 | RLIMIT_NOFILE = _RLIMIT_NOFILE, | |
78 | RLIMIT_OFILE = RLIMIT_NOFILE, /* BSD name for same. */ | |
79 | #define RLIMIT_NOFILE RLIMIT_NOFILE | |
80 | #define RLIMIT_OFILE RLIMIT_OFILE | |
81 | ||
82 | /* Address space limit (?) */ | |
83 | _RLIMIT_AS = RLIMIT_AS, | |
84 | #undef RLIMIT_AS | |
85 | RLIMIT_AS = _RLIMIT_AS, | |
86 | #define RLIMIT_AS RLIMIT_AS | |
87 | ||
88 | /* Number of processes. */ | |
89 | _RLIMIT_NPROC = RLIMIT_NPROC, | |
90 | #undef RLIMIT_NPROC | |
91 | RLIMIT_NPROC = _RLIMIT_NPROC, | |
92 | #define RLIMIT_NPROC RLIMIT_NPROC | |
93 | ||
94 | /* Locked-in-memory address space. */ | |
95 | _RLIMIT_MEMLOCK = RLIMIT_MEMLOCK, | |
96 | #undef RLIMIT_MEMLOCK | |
97 | RLIMIT_MEMLOCK = _RLIMIT_MEMLOCK, | |
98 | #define RLIMIT_MEMLOCK RLIMIT_MEMLOCK | |
99 | ||
100 | RLIMIT_NLIMITS = RLIM_NLIMITS, | |
101 | #undef RLIM_NLIMITS | |
31161268 | 102 | RLIM_NLIMITS = RLIMIT_NLIMITS |
f0e44959 UD |
103 | #define RLIMIT_NLIMITS RLIMIT_NLIMITS |
104 | #define RLIM_NLIMITS RLIM_NLIMITS | |
f0e44959 UD |
105 | }; |
106 | ||
9756dfe1 UD |
107 | /* Value to indicate that there is no limit. */ |
108 | #ifndef __USE_FILE_OFFSET64 | |
b85697f6 | 109 | # define RLIM_INFINITY ((long int)(~0UL >> 1)) |
9756dfe1 | 110 | #else |
b85697f6 | 111 | # define RLIM_INFINITY 0x7fffffffffffffffLL |
9756dfe1 UD |
112 | #endif |
113 | ||
114 | #ifdef __USE_LARGEFILE64 | |
b85697f6 | 115 | # define RLIM64_INFINITY 0x7fffffffffffffffLL |
9756dfe1 UD |
116 | #endif |
117 | ||
4bae5567 UD |
118 | /* We can represent all limits. */ |
119 | #define RLIM_SAVED_MAX RLIM_INFINITY | |
120 | #define RLIM_SAVED_CUR RLIM_INFINITY | |
121 | ||
9756dfe1 | 122 | |
dfd2257a UD |
123 | /* Type for resource quantity measurement. */ |
124 | #ifndef __USE_FILE_OFFSET64 | |
125 | typedef __rlim_t rlim_t; | |
126 | #else | |
127 | typedef __rlim64_t rlim_t; | |
128 | #endif | |
129 | #ifdef __USE_LARGEFILE64 | |
130 | typedef __rlim64_t rlim64_t; | |
131 | #endif | |
132 | ||
f0e44959 | 133 | struct rlimit |
dfd2257a UD |
134 | { |
135 | /* The current (soft) limit. */ | |
136 | rlim_t rlim_cur; | |
137 | /* The hard limit. */ | |
138 | rlim_t rlim_max; | |
139 | }; | |
140 | ||
141 | #ifdef __USE_LARGEFILE64 | |
142 | struct rlimit64 | |
143 | { | |
144 | /* The current (soft) limit. */ | |
145 | rlim64_t rlim_cur; | |
146 | /* The hard limit. */ | |
147 | rlim64_t rlim_max; | |
148 | }; | |
149 | #endif | |
f0e44959 UD |
150 | |
151 | /* Whose usage statistics do you want? */ | |
152 | enum __rusage_who | |
153 | { | |
154 | /* The calling process. */ | |
155 | RUSAGE_SELF = 0, | |
156 | #define RUSAGE_SELF RUSAGE_SELF | |
157 | ||
158 | /* All of its terminated child processes. */ | |
159 | RUSAGE_CHILDREN = -1, | |
160 | #define RUSAGE_CHILDREN RUSAGE_CHILDREN | |
161 | ||
162 | /* Both. */ | |
163 | RUSAGE_BOTH = -2 | |
164 | #define RUSAGE_BOTH RUSAGE_BOTH | |
165 | }; | |
166 | ||
f4017d20 UD |
167 | #define __need_timeval |
168 | #include <bits/time.h> /* For `struct timeval'. */ | |
f0e44959 UD |
169 | |
170 | /* Structure which says how much of each resource has been used. */ | |
171 | struct rusage | |
dfd2257a UD |
172 | { |
173 | /* Total amount of user time used. */ | |
174 | struct timeval ru_utime; | |
175 | /* Total amount of system time used. */ | |
176 | struct timeval ru_stime; | |
177 | /* Maximum resident set size (in kilobytes). */ | |
178 | long int ru_maxrss; | |
179 | /* Amount of sharing of text segment memory | |
180 | with other processes (kilobyte-seconds). */ | |
181 | long int ru_ixrss; | |
182 | /* Amount of data segment memory used (kilobyte-seconds). */ | |
183 | long int ru_idrss; | |
184 | /* Amount of stack memory used (kilobyte-seconds). */ | |
185 | long int ru_isrss; | |
186 | /* Number of soft page faults (i.e. those serviced by reclaiming | |
187 | a page from the list of pages awaiting reallocation. */ | |
188 | long int ru_minflt; | |
189 | /* Number of hard page faults (i.e. those that required I/O). */ | |
190 | long int ru_majflt; | |
191 | /* Number of times a process was swapped out of physical memory. */ | |
192 | long int ru_nswap; | |
193 | /* Number of input operations via the file system. Note: This | |
194 | and `ru_oublock' do not include operations with the cache. */ | |
195 | long int ru_inblock; | |
196 | /* Number of output operations via the file system. */ | |
197 | long int ru_oublock; | |
198 | /* Number of IPC messages sent. */ | |
199 | long int ru_msgsnd; | |
200 | /* Number of IPC messages received. */ | |
201 | long int ru_msgrcv; | |
202 | /* Number of signals delivered. */ | |
203 | long int ru_nsignals; | |
204 | /* Number of voluntary context switches, i.e. because the process | |
205 | gave up the process before it had to (usually to wait for some | |
206 | resource to be available). */ | |
207 | long int ru_nvcsw; | |
208 | /* Number of involuntary context switches, i.e. a higher priority process | |
209 | became runnable or the current process used up its time slice. */ | |
210 | long int ru_nivcsw; | |
211 | }; | |
f0e44959 UD |
212 | |
213 | /* Priority limits. */ | |
214 | #define PRIO_MIN -20 /* Minimum priority a process can have. */ | |
215 | #define PRIO_MAX 20 /* Maximum priority a process can have. */ | |
216 | ||
217 | /* The type of the WHICH argument to `getpriority' and `setpriority', | |
218 | indicating what flavor of entity the WHO argument specifies. */ | |
219 | enum __priority_which | |
220 | { | |
221 | PRIO_PROCESS = 0, /* WHO is a process ID. */ | |
2864e767 | 222 | #define PRIO_PROCESS PRIO_PROCESS |
f0e44959 | 223 | PRIO_PGRP = 1, /* WHO is a process group ID. */ |
2864e767 | 224 | #define PRIO_PGRP PRIO_PGRP |
f0e44959 | 225 | PRIO_USER = 2 /* WHO is a user ID. */ |
2864e767 | 226 | #define PRIO_USER PRIO_USER |
f0e44959 | 227 | }; |