williamr@2: /*- williamr@2: * Copyright (c) 1982, 1986, 1993 williamr@2: * The Regents of the University of California. All rights reserved. williamr@2: * williamr@2: * Redistribution and use in source and binary forms, with or without williamr@2: * modification, are permitted provided that the following conditions williamr@2: * are met: williamr@2: * 1. Redistributions of source code must retain the above copyright williamr@2: * notice, this list of conditions and the following disclaimer. williamr@2: * 2. Redistributions in binary form must reproduce the above copyright williamr@2: * notice, this list of conditions and the following disclaimer in the williamr@2: * documentation and/or other materials provided with the distribution. williamr@2: * 4. Neither the name of the University nor the names of its contributors williamr@2: * may be used to endorse or promote products derived from this software williamr@2: * without specific prior written permission. williamr@2: * williamr@2: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND williamr@2: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE williamr@2: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE williamr@2: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE williamr@2: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL williamr@2: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS williamr@2: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) williamr@2: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT williamr@2: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY williamr@2: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF williamr@2: * SUCH DAMAGE. williamr@2: * williamr@2: * @(#)resource.h 8.4 (Berkeley) 1/9/95 williamr@2: * $FreeBSD: src/sys/sys/resource.h,v 1.29 2005/01/07 02:29:23 imp Exp $ williamr@2: * williamr@2: * © Portions copyright (c) 2006 Nokia Corporation. All rights reserved. williamr@2: */ williamr@2: williamr@2: #ifndef _SYS_RESOURCE_H_ williamr@2: #define _SYS_RESOURCE_H_ williamr@2: williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: williamr@2: #ifdef __SYMBIAN32__ williamr@2: #include <_ansi.h> williamr@2: #endif //__SYMBIAN32__ williamr@2: /* williamr@2: * Process priority specifications to get/setpriority. williamr@2: */ williamr@2: #define PRIO_MIN -20 williamr@2: #define PRIO_MAX 20 williamr@2: williamr@2: #define PRIO_PROCESS 0 williamr@2: #define PRIO_PGRP 1 williamr@2: #define PRIO_USER 2 williamr@2: williamr@2: #ifdef __SYMBIAN32__ williamr@2: enum { williamr@2: UPPER_LIMIT_PRIORITY_HIGHEST = -20, williamr@2: LOWER_LIMIT_PRIORITY_HIGHEST = -16, williamr@2: williamr@2: UPPER_LIMIT_PRIORITY_ABOVE_NORMAL = -15, williamr@2: LOWER_LIMIT_PRIORITY_ABOVE_NORMAL = -6, williamr@2: williamr@2: UPPER_LIMIT_PRIORITY_NORMAL = -5, williamr@2: LOWER_LIMIT_PRIORITY_NORMAL = 4, williamr@2: williamr@2: UPPER_LIMIT_PRIORITY_BELOW_NORMAL = 5, williamr@2: LOWER_LIMIT_PRIORITY_BELOW_NORMAL = 14, williamr@2: williamr@2: UPPER_LIMIT_PRIORITY_LOWEST = 15, williamr@2: LOWER_LIMIT_PRIORITY_LOWEST = 20 williamr@2: }; williamr@2: #endif /* __SYMBIAN32__ */ williamr@2: /* williamr@2: * Resource utilization information. williamr@2: * williamr@2: * Locking key: williamr@2: * c - locked by proc mtx williamr@2: * j - locked by sched_lock mtx williamr@2: * n - not locked, lazy williamr@2: */ williamr@2: williamr@2: #define RUSAGE_SELF 0 williamr@2: #define RUSAGE_CHILDREN -1 williamr@2: williamr@2: struct rusage { williamr@2: struct timeval ru_utime; /* (n) user time used */ williamr@2: struct timeval ru_stime; /* (n) system time used */ williamr@2: long ru_maxrss; /* (j) max resident set size */ williamr@2: #define ru_first ru_ixrss williamr@2: long ru_ixrss; /* (j) integral shared memory size */ williamr@2: long ru_idrss; /* (j) integral unshared data " */ williamr@2: long ru_isrss; /* (j) integral unshared stack " */ williamr@2: long ru_minflt; /* (c) page reclaims */ williamr@2: long ru_majflt; /* (c) page faults */ williamr@2: long ru_nswap; /* (c + j) swaps */ williamr@2: long ru_inblock; /* (n) block input operations */ williamr@2: long ru_oublock; /* (n) block output operations */ williamr@2: long ru_msgsnd; /* (n) messages sent */ williamr@2: long ru_msgrcv; /* (n) messages received */ williamr@2: long ru_nsignals; /* (c) signals received */ williamr@2: long ru_nvcsw; /* (j) voluntary context switches */ williamr@2: long ru_nivcsw; /* (j) involuntary " */ williamr@2: #define ru_last ru_nivcsw williamr@2: }; williamr@2: williamr@2: /* williamr@2: * Resource limits williamr@2: */ williamr@2: #define RLIMIT_CPU 0 /* cpu time in milliseconds */ williamr@2: #define RLIMIT_FSIZE 1 /* maximum file size */ williamr@2: #define RLIMIT_DATA 2 /* data size */ williamr@2: #define RLIMIT_STACK 3 /* stack size */ williamr@2: #define RLIMIT_CORE 4 /* core file size */ williamr@2: #define RLIMIT_RSS 5 /* resident set size */ williamr@2: #define RLIMIT_MEMLOCK 6 /* locked-in-memory address space */ williamr@2: #define RLIMIT_NPROC 7 /* number of processes */ williamr@2: #define RLIMIT_NOFILE 8 /* number of open files */ williamr@2: #define RLIMIT_SBSIZE 9 /* maximum size of all socket buffers */ williamr@2: #define RLIMIT_VMEM 10 /* virtual process size (inclusive of mmap) */ williamr@2: #define RLIMIT_AS RLIMIT_VMEM /* standard name for RLIMIT_VMEM */ williamr@2: williamr@2: #define RLIM_NLIMITS 11 /* number of resource limits */ williamr@2: williamr@2: #define RLIM_INFINITY ((rlim_t)(((uint64_t)1 << 63) - 1)) williamr@2: /* XXX Missing: RLIM_SAVED_MAX, RLIM_SAVED_CUR */ williamr@2: williamr@2: williamr@2: /* williamr@2: * Resource limit string identifiers williamr@2: */ williamr@2: williamr@2: #ifdef _RLIMIT_IDENT williamr@2: static char *rlimit_ident[] = { williamr@2: "cpu", williamr@2: "fsize", williamr@2: "data", williamr@2: "stack", williamr@2: "core", williamr@2: "rss", williamr@2: "memlock", williamr@2: "nproc", williamr@2: "nofile", williamr@2: "sbsize", williamr@2: "vmem", williamr@2: }; williamr@2: #endif williamr@2: williamr@2: #ifndef _RLIM_T_DECLARED williamr@2: typedef __rlim_t rlim_t; williamr@2: #define _RLIM_T_DECLARED williamr@2: #endif williamr@2: williamr@2: struct rlimit { williamr@2: rlim_t rlim_cur; /* current (soft) limit */ williamr@2: rlim_t rlim_max; /* maximum value for rlim_cur */ williamr@2: }; williamr@2: williamr@2: #if __BSD_VISIBLE williamr@2: williamr@2: struct orlimit { williamr@2: __int32_t rlim_cur; /* current (soft) limit */ williamr@2: __int32_t rlim_max; /* maximum value for rlim_cur */ williamr@2: }; williamr@2: williamr@2: struct loadavg { williamr@2: __fixpt_t ldavg[3]; williamr@2: long fscale; williamr@2: }; williamr@2: williamr@2: #define CP_USER 0 williamr@2: #define CP_NICE 1 williamr@2: #define CP_SYS 2 williamr@2: #define CP_INTR 3 williamr@2: #define CP_IDLE 4 williamr@2: #define CPUSTATES 5 williamr@2: williamr@2: #endif /* __BSD_VISIBLE */ williamr@2: williamr@2: #ifdef _KERNEL williamr@2: williamr@2: extern struct loadavg averunnable; williamr@2: extern long cp_time[CPUSTATES]; williamr@2: williamr@2: #else williamr@2: williamr@2: __BEGIN_DECLS williamr@2: /* XXX 2nd arg to [gs]etpriority() should be an id_t */ williamr@2: IMPORT_C int getpriority(int, int); williamr@2: IMPORT_C int setpriority(int, int, int); williamr@2: __END_DECLS williamr@2: williamr@2: #endif /* _KERNEL */ williamr@2: #endif /* !_SYS_RESOURCE_H_ */