| 1 | /* |
| 2 | * Copyright (c) 1982, 1986, 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 | * @(#)resource.h 8.4 (Berkeley) 1/9/95 |
| 34 | * $FreeBSD: src/sys/sys/resource.h,v 1.12.2.2 2002/08/20 18:42:20 dillon Exp $ |
| 35 | * $DragonFly: src/sys/sys/resource.h,v 1.8 2004/07/27 19:18:50 drhodus Exp $ |
| 36 | */ |
| 37 | |
| 38 | #ifndef _SYS_RESOURCE_H_ |
| 39 | #define _SYS_RESOURCE_H_ |
| 40 | |
| 41 | /* |
| 42 | * Process priority specifications to get/setpriority. |
| 43 | */ |
| 44 | #define PRIO_MIN -20 |
| 45 | #define PRIO_MAX 20 |
| 46 | |
| 47 | #define PRIO_PROCESS 0 |
| 48 | #define PRIO_PGRP 1 |
| 49 | #define PRIO_USER 2 |
| 50 | |
| 51 | /* |
| 52 | * Resource utilization information. |
| 53 | */ |
| 54 | |
| 55 | #define RUSAGE_SELF 0 |
| 56 | #define RUSAGE_CHILDREN -1 |
| 57 | |
| 58 | struct rusage { |
| 59 | struct timeval ru_utime; /* user time used */ |
| 60 | struct timeval ru_stime; /* system time used */ |
| 61 | long ru_maxrss; /* max resident set size */ |
| 62 | #define ru_first ru_ixrss |
| 63 | long ru_ixrss; /* integral shared memory size */ |
| 64 | long ru_idrss; /* integral unshared data " */ |
| 65 | long ru_isrss; /* integral unshared stack " */ |
| 66 | long ru_minflt; /* page reclaims */ |
| 67 | long ru_majflt; /* page faults */ |
| 68 | long ru_nswap; /* swaps */ |
| 69 | long ru_inblock; /* block input operations */ |
| 70 | long ru_oublock; /* block output operations */ |
| 71 | long ru_msgsnd; /* messages sent */ |
| 72 | long ru_msgrcv; /* messages received */ |
| 73 | long ru_nsignals; /* signals received */ |
| 74 | long ru_nvcsw; /* voluntary context switches */ |
| 75 | long ru_nivcsw; /* involuntary " */ |
| 76 | #define ru_last ru_nivcsw |
| 77 | }; |
| 78 | |
| 79 | /* |
| 80 | * Resource limits |
| 81 | */ |
| 82 | #define RLIMIT_CPU 0 /* cpu time in milliseconds */ |
| 83 | #define RLIMIT_FSIZE 1 /* maximum file size */ |
| 84 | #define RLIMIT_DATA 2 /* data size */ |
| 85 | #define RLIMIT_STACK 3 /* stack size */ |
| 86 | #define RLIMIT_CORE 4 /* core file size */ |
| 87 | #define RLIMIT_RSS 5 /* resident set size */ |
| 88 | #define RLIMIT_MEMLOCK 6 /* locked-in-memory address space */ |
| 89 | #define RLIMIT_NPROC 7 /* number of processes */ |
| 90 | #define RLIMIT_NOFILE 8 /* number of open files */ |
| 91 | #define RLIMIT_SBSIZE 9 /* maximum size of all socket buffers */ |
| 92 | #define RLIMIT_VMEM 10 /* virtual process size (inclusive of mmap) */ |
| 93 | #define RLIMIT_POSIXLOCKS 11 /* maximum number of POSIX locks per user */ |
| 94 | |
| 95 | #define RLIM_NLIMITS 12 /* number of resource limits */ |
| 96 | |
| 97 | #define RLIM_INFINITY ((rlim_t)(((u_quad_t)1 << 63) - 1)) |
| 98 | |
| 99 | |
| 100 | /* |
| 101 | * Resource limit string identifiers |
| 102 | */ |
| 103 | |
| 104 | #ifdef _RLIMIT_IDENT |
| 105 | static char *rlimit_ident[] = { |
| 106 | "cpu", |
| 107 | "fsize", |
| 108 | "data", |
| 109 | "stack", |
| 110 | "core", |
| 111 | "rss", |
| 112 | "memlock", |
| 113 | "nproc", |
| 114 | "nofile", |
| 115 | "sbsize", |
| 116 | "vmem", |
| 117 | "posixlock", |
| 118 | }; |
| 119 | #endif |
| 120 | |
| 121 | struct orlimit { |
| 122 | int32_t rlim_cur; /* current (soft) limit */ |
| 123 | int32_t rlim_max; /* maximum value for rlim_cur */ |
| 124 | }; |
| 125 | |
| 126 | struct rlimit { |
| 127 | rlim_t rlim_cur; /* current (soft) limit */ |
| 128 | rlim_t rlim_max; /* maximum value for rlim_cur */ |
| 129 | }; |
| 130 | |
| 131 | /* Load average structure. */ |
| 132 | struct loadavg { |
| 133 | fixpt_t ldavg[3]; |
| 134 | long fscale; |
| 135 | }; |
| 136 | |
| 137 | #ifdef _KERNEL |
| 138 | extern struct loadavg averunnable; |
| 139 | |
| 140 | int dosetrlimit (u_int which, struct rlimit *limp); |
| 141 | |
| 142 | #else |
| 143 | #include <sys/cdefs.h> |
| 144 | |
| 145 | __BEGIN_DECLS |
| 146 | int getpriority (int, int); |
| 147 | int getrlimit (int, struct rlimit *); |
| 148 | int getrusage (int, struct rusage *); |
| 149 | int setpriority (int, int, int); |
| 150 | int setrlimit (int, const struct rlimit *); |
| 151 | __END_DECLS |
| 152 | |
| 153 | #endif /* _KERNEL */ |
| 154 | #endif /* !_SYS_RESOURCE_H_ */ |