1 /* $OpenBSD: resource.h,v 1.7 2003/12/11 23:02:30 millert Exp $ */
2 /* $NetBSD: resource.h,v 1.14 1996/02/09 18:25:27 christos Exp $ */
3
4 /*
5 * Copyright (c) 1982, 1986, 1993
6 * The Regents of the University of California. All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 *
32 * @(#)resource.h 8.2 (Berkeley) 1/4/94
33 */
34
35 #ifndef _SYS_RESOURCE_H_
36 #define _SYS_RESOURCE_H_
37
38 /*
39 * Process priority specifications to get/setpriority.
40 */
41 #define PRIO_MIN -20
42 #define PRIO_MAX 20
43
44 #define PRIO_PROCESS 0
45 #define PRIO_PGRP 1
46 #define PRIO_USER 2
47
48 /*
49 * Resource utilization information.
50 */
51
52 #define RUSAGE_SELF 0
53 #define RUSAGE_CHILDREN -1
54
55 struct rusage {
56 struct timeval ru_utime; /* user time used */
57 struct timeval ru_stime; /* system time used */
58 long ru_maxrss; /* max resident set size */
59 #define ru_first ru_ixrss
60 long ru_ixrss; /* integral shared text memory size */
61 long ru_idrss; /* integral unshared data " */
62 long ru_isrss; /* integral unshared stack " */
63 long ru_minflt; /* page reclaims */
64 long ru_majflt; /* page faults */
65 long ru_nswap; /* swaps */
66 long ru_inblock; /* block input operations */
67 long ru_oublock; /* block output operations */
68 long ru_msgsnd; /* messages sent */
69 long ru_msgrcv; /* messages received */
70 long ru_nsignals; /* signals received */
71 long ru_nvcsw; /* voluntary context switches */
72 long ru_nivcsw; /* involuntary " */
73 #define ru_last ru_nivcsw
74 };
75
76 /*
77 * Resource limits
78 */
79 #define RLIMIT_CPU 0 /* cpu time in milliseconds */
80 #define RLIMIT_FSIZE 1 /* maximum file size */
81 #define RLIMIT_DATA 2 /* data size */
82 #define RLIMIT_STACK 3 /* stack size */
83 #define RLIMIT_CORE 4 /* core file size */
84 #define RLIMIT_RSS 5 /* resident set size */
85 #define RLIMIT_MEMLOCK 6 /* locked-in-memory address space */
86 #define RLIMIT_NPROC 7 /* number of processes */
87 #define RLIMIT_NOFILE 8 /* number of open files */
88
89 #define RLIM_NLIMITS 9 /* number of resource limits */
90
91 #define RLIM_INFINITY (((rlim_t)1 << 63) - 1)
92 #define RLIM_SAVED_MAX RLIM_INFINITY
93 #define RLIM_SAVED_CUR RLIM_INFINITY
94
95 struct orlimit {
96 int32_t rlim_cur; /* current (soft) limit */
97 int32_t rlim_max; /* maximum value for rlim_cur */
98 };
99
100 struct rlimit {
101 rlim_t rlim_cur; /* current (soft) limit */
102 rlim_t rlim_max; /* maximum value for rlim_cur */
103 };
104
105 /* Load average structure. */
106 struct loadavg {
107 fixpt_t ldavg[3];
108 long fscale;
109 };
110
111 #ifdef _KERNEL
112 extern struct loadavg averunnable;
113 int dosetrlimit(struct proc *, u_int, struct rlimit *);
114 int donice(struct proc *, struct proc *, int);
115
116 #else
117 #include <sys/cdefs.h>
118
119 __BEGIN_DECLS
120 int getpriority(int, id_t);
121 int getrlimit(int, struct rlimit *);
122 int getrusage(int, struct rusage *);
123 int setpriority(int, id_t, int);
124 int setrlimit(int, const struct rlimit *);
125 __END_DECLS
126
127 #endif /* _KERNEL */
128 #endif /* !_SYS_RESOURCE_H_ */