* Copyright (c) 1982, 1986 The Regents of the University of California.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* @(#)resource.h 7.5 (Berkeley) 3/17/91
* Process priority specifications to get/setpriority.
* Resource utilization information.
#define RUSAGE_CHILDREN -1
struct timeval ru_utime
; /* user time used */
struct timeval ru_stime
; /* system time used */
long ru_maxrss
; /* max resident set size */
#define ru_first ru_ixrss
long ru_ixrss
; /* integral shared memory size */
long ru_idrss
; /* integral unshared data " */
long ru_isrss
; /* integral unshared stack " */
long ru_minflt
; /* page reclaims */
long ru_majflt
; /* page faults */
long ru_nswap
; /* swaps */
long ru_inblock
; /* block input operations */
long ru_oublock
; /* block output operations */
long ru_msgsnd
; /* messages sent */
long ru_msgrcv
; /* messages received */
long ru_nsignals
; /* signals received */
long ru_nvcsw
; /* voluntary context switches */
long ru_nivcsw
; /* involuntary " */
#define ru_last ru_nivcsw
#define RLIMIT_CPU 0 /* cpu time in milliseconds */
#define RLIMIT_FSIZE 1 /* maximum file size */
#define RLIMIT_DATA 2 /* data size */
#define RLIMIT_STACK 3 /* stack size */
#define RLIMIT_CORE 4 /* core file size */
#define RLIMIT_RSS 5 /* resident set size */
#define RLIMIT_MEMLOCK 6 /* locked-in-memory address space */
#define RLIMIT_NPROC 7 /* number of processes */
#define RLIMIT_OFILE 8 /* number of open files */
#define RLIM_NLIMITS 9 /* number of resource limits */
#define RLIM_INFINITY 0x7fffffff
long rlim_cur
; /* current (soft) limit */
long rlim_max
; /* maximum value for rlim_cur */
int getpriority
__P((int, int));
int getrlimit
__P((int, struct rlimit
*));
int getrusage
__P((int, struct rusage
*));
int setpriority
__P((int, int, int));
int setrlimit
__P((int, const struct rlimit
*));
#endif /* !_RESOURCE_H_ */