--- a/epoc32/include/stdapis/sys/resource.h Tue Nov 24 13:55:44 2009 +0000
+++ b/epoc32/include/stdapis/sys/resource.h Tue Mar 16 16:12:26 2010 +0000
@@ -1,1 +1,193 @@
-resource.h
+/*-
+ * Copyright (c) 1982, 1986, 1993
+ * The Regents of the University of California. All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 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.
+ * 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
+ * SUCH DAMAGE.
+ *
+ * @(#)resource.h 8.4 (Berkeley) 1/9/95
+ * $FreeBSD: src/sys/sys/resource.h,v 1.29 2005/01/07 02:29:23 imp Exp $
+ *
+ * © Portions copyright (c) 2006 Nokia Corporation. All rights reserved.
+ */
+
+#ifndef _SYS_RESOURCE_H_
+#define _SYS_RESOURCE_H_
+
+#include <sys/cdefs.h>
+#include <sys/_timeval.h>
+#include <sys/_types.h>
+
+#ifdef __SYMBIAN32__
+#include <_ansi.h>
+#endif //__SYMBIAN32__
+/*
+ * Process priority specifications to get/setpriority.
+ */
+#define PRIO_MIN -20
+#define PRIO_MAX 20
+
+#define PRIO_PROCESS 0
+#define PRIO_PGRP 1
+#define PRIO_USER 2
+
+#ifdef __SYMBIAN32__
+enum {
+ UPPER_LIMIT_PRIORITY_HIGHEST = -20,
+ LOWER_LIMIT_PRIORITY_HIGHEST = -16,
+
+ UPPER_LIMIT_PRIORITY_ABOVE_NORMAL = -15,
+ LOWER_LIMIT_PRIORITY_ABOVE_NORMAL = -6,
+
+ UPPER_LIMIT_PRIORITY_NORMAL = -5,
+ LOWER_LIMIT_PRIORITY_NORMAL = 4,
+
+ UPPER_LIMIT_PRIORITY_BELOW_NORMAL = 5,
+ LOWER_LIMIT_PRIORITY_BELOW_NORMAL = 14,
+
+ UPPER_LIMIT_PRIORITY_LOWEST = 15,
+ LOWER_LIMIT_PRIORITY_LOWEST = 20
+};
+#endif /* __SYMBIAN32__ */
+/*
+ * Resource utilization information.
+ *
+ * Locking key:
+ * c - locked by proc mtx
+ * j - locked by sched_lock mtx
+ * n - not locked, lazy
+ */
+
+#define RUSAGE_SELF 0
+#define RUSAGE_CHILDREN -1
+
+struct rusage {
+ struct timeval ru_utime; /* (n) user time used */
+ struct timeval ru_stime; /* (n) system time used */
+ long ru_maxrss; /* (j) max resident set size */
+#define ru_first ru_ixrss
+ long ru_ixrss; /* (j) integral shared memory size */
+ long ru_idrss; /* (j) integral unshared data " */
+ long ru_isrss; /* (j) integral unshared stack " */
+ long ru_minflt; /* (c) page reclaims */
+ long ru_majflt; /* (c) page faults */
+ long ru_nswap; /* (c + j) swaps */
+ long ru_inblock; /* (n) block input operations */
+ long ru_oublock; /* (n) block output operations */
+ long ru_msgsnd; /* (n) messages sent */
+ long ru_msgrcv; /* (n) messages received */
+ long ru_nsignals; /* (c) signals received */
+ long ru_nvcsw; /* (j) voluntary context switches */
+ long ru_nivcsw; /* (j) involuntary " */
+#define ru_last ru_nivcsw
+};
+
+/*
+ * Resource limits
+ */
+#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_NOFILE 8 /* number of open files */
+#define RLIMIT_SBSIZE 9 /* maximum size of all socket buffers */
+#define RLIMIT_VMEM 10 /* virtual process size (inclusive of mmap) */
+#define RLIMIT_AS RLIMIT_VMEM /* standard name for RLIMIT_VMEM */
+
+#define RLIM_NLIMITS 11 /* number of resource limits */
+
+#define RLIM_INFINITY ((rlim_t)(((uint64_t)1 << 63) - 1))
+/* XXX Missing: RLIM_SAVED_MAX, RLIM_SAVED_CUR */
+
+
+/*
+ * Resource limit string identifiers
+ */
+
+#ifdef _RLIMIT_IDENT
+static char *rlimit_ident[] = {
+ "cpu",
+ "fsize",
+ "data",
+ "stack",
+ "core",
+ "rss",
+ "memlock",
+ "nproc",
+ "nofile",
+ "sbsize",
+ "vmem",
+};
+#endif
+
+#ifndef _RLIM_T_DECLARED
+typedef __rlim_t rlim_t;
+#define _RLIM_T_DECLARED
+#endif
+
+struct rlimit {
+ rlim_t rlim_cur; /* current (soft) limit */
+ rlim_t rlim_max; /* maximum value for rlim_cur */
+};
+
+#if __BSD_VISIBLE
+
+struct orlimit {
+ __int32_t rlim_cur; /* current (soft) limit */
+ __int32_t rlim_max; /* maximum value for rlim_cur */
+};
+
+struct loadavg {
+ __fixpt_t ldavg[3];
+ long fscale;
+};
+
+#define CP_USER 0
+#define CP_NICE 1
+#define CP_SYS 2
+#define CP_INTR 3
+#define CP_IDLE 4
+#define CPUSTATES 5
+
+#endif /* __BSD_VISIBLE */
+
+#ifdef _KERNEL
+
+extern struct loadavg averunnable;
+extern long cp_time[CPUSTATES];
+
+#else
+
+__BEGIN_DECLS
+/* XXX 2nd arg to [gs]etpriority() should be an id_t */
+IMPORT_C int getpriority(int, int);
+IMPORT_C int setpriority(int, int, int);
+__END_DECLS
+
+#endif /* _KERNEL */
+#endif /* !_SYS_RESOURCE_H_ */