1 /* 2 * Copyright (c) 1982, 1986 The Regents of the University of California. 3 * 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 7.5 (Berkeley) 3/17/91 34 */ 35 36 #ifndef _RESOURCE_H_ 37 #define _RESOURCE_H_ 38 39 /* 40 * Process priority specifications to get/setpriority. 41 */ 42 #define PRIO_MIN -20 43 #define PRIO_MAX 20 44 45 #define PRIO_PROCESS 0 46 #define PRIO_PGRP 1 47 #define PRIO_USER 2 48 49 /* 50 * Resource utilization information. 51 */ 52 53 #define RUSAGE_SELF 0 54 #define RUSAGE_CHILDREN -1 55 56 struct rusage { 57 struct timeval ru_utime; /* user time used */ 58 struct timeval ru_stime; /* system time used */ 59 long ru_maxrss; /* max resident set size */ 60 #define ru_first ru_ixrss 61 long ru_ixrss; /* integral sharable memory size */ 62 /* long ru_ilrss; /* integral shared memory size */ 63 long ru_idrss; /* integral unshared data " */ 64 long ru_isrss; /* integral unshared stack " */ 65 long ru_minflt; /* page reclaims */ 66 long ru_majflt; /* page faults */ 67 long ru_nswap; /* swaps */ 68 long ru_inblock; /* block input operations */ 69 long ru_oublock; /* block output operations */ 70 long ru_msgsnd; /* messages sent */ 71 long ru_msgrcv; /* messages received */ 72 long ru_nsignals; /* signals received */ 73 long ru_nvcsw; /* voluntary context switches */ 74 long ru_nivcsw; /* involuntary " */ 75 #define ru_last ru_nivcsw 76 }; 77 78 /* 79 * Resource limits 80 */ 81 #define RLIMIT_CPU 0 /* cpu time in milliseconds */ 82 #define RLIMIT_FSIZE 1 /* maximum file size */ 83 #define RLIMIT_DATA 2 /* data size */ 84 #define RLIMIT_STACK 3 /* stack size */ 85 #define RLIMIT_CORE 4 /* core file size */ 86 #define RLIMIT_RSS 5 /* resident set size */ 87 #define RLIMIT_MEMLOCK 6 /* locked-in-memory address space */ 88 #define RLIMIT_NPROC 7 /* number of processes */ 89 #define RLIMIT_OFILE 8 /* number of open files */ 90 91 #define RLIM_NLIMITS 9 /* number of resource limits */ 92 93 #define RLIM_INFINITY 0x7fffffff 94 95 struct rlimit { 96 long rlim_cur; /* current (soft) limit */ 97 long rlim_max; /* maximum value for rlim_cur */ 98 }; 99 100 #ifndef KERNEL 101 #include <sys/cdefs.h> 102 103 __BEGIN_DECLS 104 int getpriority __P((int, int)); 105 int getrlimit __P((int, struct rlimit *)); 106 int getrusage __P((int, struct rusage *)); 107 int setpriority __P((int, int, int)); 108 int setrlimit __P((int, const struct rlimit *)); 109 void ruadd __P((struct rusage *ru, struct rusage *ru2)); 110 __END_DECLS 111 112 #endif /* !KERNEL */ 113 #endif /* !_RESOURCE_H_ */ 114