mirror of
https://sourceware.org/git/glibc.git
synced 2024-11-26 23:10:06 +00:00
2002-10-15 Roland McGrath <roland@redhat.com>
* sysdeps/unix/sysv/linux/bits/resource.h: Replaced with the contents of the sysdeps/unix/sysv/linux/i386/bits/resource.h file. All the following files were identical or equivalent to it. * sysdeps/unix/sysv/linux/i386/bits/resource.h: File removed. * sysdeps/unix/sysv/linux/arm/bits/resource.h: File removed. * sysdeps/unix/sysv/linux/cris/bits/resource.h: File removed. * sysdeps/unix/sysv/linux/hppa/bits/resource.h: File removed. * sysdeps/unix/sysv/linux/ia64/bits/resource.h: File removed. * sysdeps/unix/sysv/linux/m68k/bits/resource.h: File removed. * sysdeps/unix/sysv/linux/powerpc/bits/resource.h: File removed. * sysdeps/unix/sysv/linux/s390/bits/resource.h: File removed. * sysdeps/unix/sysv/linux/sh/bits/resource.h: File removed. * sysdeps/unix/sysv/linux/x86_64/bits/resource.h: File removed.
This commit is contained in:
parent
7d1ed880a3
commit
f7d1f342cc
@ -1,209 +0,0 @@
|
|||||||
/* Bit values & structures for resource limits. Linux/Arm version.
|
|
||||||
Copyright (C) 1994,1996,1997,1998,1999,2000 Free Software Foundation, Inc.
|
|
||||||
This file is part of the GNU C Library.
|
|
||||||
|
|
||||||
The GNU C Library is free software; you can redistribute it and/or
|
|
||||||
modify it under the terms of the GNU Lesser General Public
|
|
||||||
License as published by the Free Software Foundation; either
|
|
||||||
version 2.1 of the License, or (at your option) any later version.
|
|
||||||
|
|
||||||
The GNU C Library is distributed in the hope that it will be useful,
|
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
||||||
Lesser General Public License for more details.
|
|
||||||
|
|
||||||
You should have received a copy of the GNU Lesser General Public
|
|
||||||
License along with the GNU C Library; if not, write to the Free
|
|
||||||
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
|
||||||
02111-1307 USA. */
|
|
||||||
|
|
||||||
#ifndef _SYS_RESOURCE_H
|
|
||||||
# error "Never use <bits/resource.h> directly; include <sys/resource.h> instead."
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include <bits/types.h>
|
|
||||||
|
|
||||||
/* Transmute defines to enumerations. The macro re-definitions are
|
|
||||||
necessary because some programs want to test for operating system
|
|
||||||
features with #ifdef RUSAGE_SELF. In ISO C the reflexive
|
|
||||||
definition is a no-op. */
|
|
||||||
|
|
||||||
/* Kinds of resource limit. */
|
|
||||||
enum __rlimit_resource
|
|
||||||
{
|
|
||||||
/* Per-process CPU limit, in seconds. */
|
|
||||||
RLIMIT_CPU = 0,
|
|
||||||
#define RLIMIT_CPU RLIMIT_CPU
|
|
||||||
|
|
||||||
/* Largest file that can be created, in bytes. */
|
|
||||||
RLIMIT_FSIZE = 1,
|
|
||||||
#define RLIMIT_FSIZE RLIMIT_FSIZE
|
|
||||||
|
|
||||||
/* Maximum size of data segment, in bytes. */
|
|
||||||
RLIMIT_DATA = 2,
|
|
||||||
#define RLIMIT_DATA RLIMIT_DATA
|
|
||||||
|
|
||||||
/* Maximum size of stack segment, in bytes. */
|
|
||||||
RLIMIT_STACK = 3,
|
|
||||||
#define RLIMIT_STACK RLIMIT_STACK
|
|
||||||
|
|
||||||
/* Largest core file that can be created, in bytes. */
|
|
||||||
RLIMIT_CORE = 4,
|
|
||||||
#define RLIMIT_CORE RLIMIT_CORE
|
|
||||||
|
|
||||||
/* Largest resident set size, in bytes.
|
|
||||||
This affects swapping; processes that are exceeding their
|
|
||||||
resident set size will be more likely to have physical memory
|
|
||||||
taken from them. */
|
|
||||||
RLIMIT_RSS = 5,
|
|
||||||
#define RLIMIT_RSS RLIMIT_RSS
|
|
||||||
|
|
||||||
/* Number of open files. */
|
|
||||||
RLIMIT_NOFILE = 7,
|
|
||||||
RLIMIT_OFILE = RLIMIT_NOFILE, /* BSD name for same. */
|
|
||||||
#define RLIMIT_NOFILE RLIMIT_NOFILE
|
|
||||||
#define RLIMIT_OFILE RLIMIT_OFILE
|
|
||||||
|
|
||||||
/* Address space limit. */
|
|
||||||
RLIMIT_AS = 9,
|
|
||||||
#define RLIMIT_AS RLIMIT_AS
|
|
||||||
|
|
||||||
/* Number of processes. */
|
|
||||||
RLIMIT_NPROC = 6,
|
|
||||||
#define RLIMIT_NPROC RLIMIT_NPROC
|
|
||||||
|
|
||||||
/* Locked-in-memory address space. */
|
|
||||||
RLIMIT_MEMLOCK = 8,
|
|
||||||
#define RLIMIT_MEMLOCK RLIMIT_MEMLOCK
|
|
||||||
|
|
||||||
/* Maximum number of file locks. */
|
|
||||||
RLIMIT_LOCKS = 10,
|
|
||||||
#define RLIMIT_LOCKS RLIMIT_LOCKS
|
|
||||||
|
|
||||||
RLIMIT_NLIMITS = 11,
|
|
||||||
RLIM_NLIMITS = RLIMIT_NLIMITS
|
|
||||||
#define RLIMIT_NLIMITS RLIMIT_NLIMITS
|
|
||||||
#define RLIM_NLIMITS RLIM_NLIMITS
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Value to indicate that there is no limit. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
# define RLIM_INFINITY ((unsigned long int)(~0UL))
|
|
||||||
#else
|
|
||||||
# define RLIM_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
# define RLIM64_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* We can represent all limits. */
|
|
||||||
#define RLIM_SAVED_MAX RLIM_INFINITY
|
|
||||||
#define RLIM_SAVED_CUR RLIM_INFINITY
|
|
||||||
|
|
||||||
|
|
||||||
/* Type for resource quantity measurement. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
typedef __rlim_t rlim_t;
|
|
||||||
#else
|
|
||||||
typedef __rlim64_t rlim_t;
|
|
||||||
#endif
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
typedef __rlim64_t rlim64_t;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
struct rlimit
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim_t rlim_max;
|
|
||||||
};
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
struct rlimit64
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim64_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim64_t rlim_max;
|
|
||||||
};
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Whose usage statistics do you want? */
|
|
||||||
enum __rusage_who
|
|
||||||
{
|
|
||||||
/* The calling process. */
|
|
||||||
RUSAGE_SELF = 0,
|
|
||||||
#define RUSAGE_SELF RUSAGE_SELF
|
|
||||||
|
|
||||||
/* All of its terminated child processes. */
|
|
||||||
RUSAGE_CHILDREN = -1,
|
|
||||||
#define RUSAGE_CHILDREN RUSAGE_CHILDREN
|
|
||||||
|
|
||||||
/* Both. */
|
|
||||||
RUSAGE_BOTH = -2
|
|
||||||
#define RUSAGE_BOTH RUSAGE_BOTH
|
|
||||||
};
|
|
||||||
|
|
||||||
#define __need_timeval
|
|
||||||
#include <bits/time.h> /* For `struct timeval'. */
|
|
||||||
|
|
||||||
/* Structure which says how much of each resource has been used. */
|
|
||||||
struct rusage
|
|
||||||
{
|
|
||||||
/* Total amount of user time used. */
|
|
||||||
struct timeval ru_utime;
|
|
||||||
/* Total amount of system time used. */
|
|
||||||
struct timeval ru_stime;
|
|
||||||
/* Maximum resident set size (in kilobytes). */
|
|
||||||
long int ru_maxrss;
|
|
||||||
/* Amount of sharing of text segment memory
|
|
||||||
with other processes (kilobyte-seconds). */
|
|
||||||
long int ru_ixrss;
|
|
||||||
/* Amount of data segment memory used (kilobyte-seconds). */
|
|
||||||
long int ru_idrss;
|
|
||||||
/* Amount of stack memory used (kilobyte-seconds). */
|
|
||||||
long int ru_isrss;
|
|
||||||
/* Number of soft page faults (i.e. those serviced by reclaiming
|
|
||||||
a page from the list of pages awaiting reallocation. */
|
|
||||||
long int ru_minflt;
|
|
||||||
/* Number of hard page faults (i.e. those that required I/O). */
|
|
||||||
long int ru_majflt;
|
|
||||||
/* Number of times a process was swapped out of physical memory. */
|
|
||||||
long int ru_nswap;
|
|
||||||
/* Number of input operations via the file system. Note: This
|
|
||||||
and `ru_oublock' do not include operations with the cache. */
|
|
||||||
long int ru_inblock;
|
|
||||||
/* Number of output operations via the file system. */
|
|
||||||
long int ru_oublock;
|
|
||||||
/* Number of IPC messages sent. */
|
|
||||||
long int ru_msgsnd;
|
|
||||||
/* Number of IPC messages received. */
|
|
||||||
long int ru_msgrcv;
|
|
||||||
/* Number of signals delivered. */
|
|
||||||
long int ru_nsignals;
|
|
||||||
/* Number of voluntary context switches, i.e. because the process
|
|
||||||
gave up the process before it had to (usually to wait for some
|
|
||||||
resource to be available). */
|
|
||||||
long int ru_nvcsw;
|
|
||||||
/* Number of involuntary context switches, i.e. a higher priority process
|
|
||||||
became runnable or the current process used up its time slice. */
|
|
||||||
long int ru_nivcsw;
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Priority limits. */
|
|
||||||
#define PRIO_MIN -20 /* Minimum priority a process can have. */
|
|
||||||
#define PRIO_MAX 20 /* Maximum priority a process can have. */
|
|
||||||
|
|
||||||
/* The type of the WHICH argument to `getpriority' and `setpriority',
|
|
||||||
indicating what flavor of entity the WHO argument specifies. */
|
|
||||||
enum __priority_which
|
|
||||||
{
|
|
||||||
PRIO_PROCESS = 0, /* WHO is a process ID. */
|
|
||||||
#define PRIO_PROCESS PRIO_PROCESS
|
|
||||||
PRIO_PGRP = 1, /* WHO is a process group ID. */
|
|
||||||
#define PRIO_PGRP PRIO_PGRP
|
|
||||||
PRIO_USER = 2 /* WHO is a user ID. */
|
|
||||||
#define PRIO_USER PRIO_USER
|
|
||||||
};
|
|
@ -64,7 +64,7 @@ enum __rlimit_resource
|
|||||||
#define RLIMIT_NOFILE RLIMIT_NOFILE
|
#define RLIMIT_NOFILE RLIMIT_NOFILE
|
||||||
#define RLIMIT_OFILE RLIMIT_OFILE
|
#define RLIMIT_OFILE RLIMIT_OFILE
|
||||||
|
|
||||||
/* Address space limit (?) */
|
/* Address space limit. */
|
||||||
RLIMIT_AS = 9,
|
RLIMIT_AS = 9,
|
||||||
#define RLIMIT_AS RLIMIT_AS
|
#define RLIMIT_AS RLIMIT_AS
|
||||||
|
|
||||||
@ -80,20 +80,21 @@ enum __rlimit_resource
|
|||||||
RLIMIT_LOCKS = 10,
|
RLIMIT_LOCKS = 10,
|
||||||
#define RLIMIT_LOCKS RLIMIT_LOCKS
|
#define RLIMIT_LOCKS RLIMIT_LOCKS
|
||||||
|
|
||||||
RLIM_NLIMITS = 11
|
RLIMIT_NLIMITS = 11,
|
||||||
|
RLIM_NLIMITS = RLIMIT_NLIMITS
|
||||||
#define RLIMIT_NLIMITS RLIMIT_NLIMITS
|
#define RLIMIT_NLIMITS RLIMIT_NLIMITS
|
||||||
#define RLIM_NLIMITS RLIM_NLIMITS
|
#define RLIM_NLIMITS RLIM_NLIMITS
|
||||||
};
|
};
|
||||||
|
|
||||||
/* Value to indicate that there is no limit. */
|
/* Value to indicate that there is no limit. */
|
||||||
#ifndef __USE_FILE_OFFSET64
|
#ifndef __USE_FILE_OFFSET64
|
||||||
# define RLIM_INFINITY ((long int)(~0UL >> 1))
|
# define RLIM_INFINITY ((unsigned long int)(~0UL))
|
||||||
#else
|
#else
|
||||||
# define RLIM_INFINITY 0x7fffffffffffffffLL
|
# define RLIM_INFINITY 0xffffffffffffffffuLL
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
#ifdef __USE_LARGEFILE64
|
||||||
# define RLIM64_INFINITY 0x7fffffffffffffffLL
|
# define RLIM64_INFINITY 0xffffffffffffffffuLL
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
/* We can represent all limits. */
|
/* We can represent all limits. */
|
||||||
|
@ -1,209 +0,0 @@
|
|||||||
/* Bit values & structures for resource limits. Linux/CRIS version.
|
|
||||||
Copyright (C) 1994,1996,1997,1998,1999,2000, 2001 Free Software Foundation, Inc.
|
|
||||||
This file is part of the GNU C Library.
|
|
||||||
|
|
||||||
The GNU C Library is free software; you can redistribute it and/or
|
|
||||||
modify it under the terms of the GNU Lesser General Public
|
|
||||||
License as published by the Free Software Foundation; either
|
|
||||||
version 2.1 of the License, or (at your option) any later version.
|
|
||||||
|
|
||||||
The GNU C Library is distributed in the hope that it will be useful,
|
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
||||||
Lesser General Public License for more details.
|
|
||||||
|
|
||||||
You should have received a copy of the GNU Lesser General Public
|
|
||||||
License along with the GNU C Library; if not, write to the Free
|
|
||||||
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
|
||||||
02111-1307 USA. */
|
|
||||||
|
|
||||||
#ifndef _SYS_RESOURCE_H
|
|
||||||
# error "Never use <bits/resource.h> directly; include <sys/resource.h> instead."
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include <bits/types.h>
|
|
||||||
|
|
||||||
/* Transmute defines to enumerations. The macro re-definitions are
|
|
||||||
necessary because some programs want to test for operating system
|
|
||||||
features with #ifdef RUSAGE_SELF. In ISO C the reflexive
|
|
||||||
definition is a no-op. */
|
|
||||||
|
|
||||||
/* Kinds of resource limit. */
|
|
||||||
enum __rlimit_resource
|
|
||||||
{
|
|
||||||
/* Per-process CPU limit, in seconds. */
|
|
||||||
RLIMIT_CPU = 0,
|
|
||||||
#define RLIMIT_CPU RLIMIT_CPU
|
|
||||||
|
|
||||||
/* Largest file that can be created, in bytes. */
|
|
||||||
RLIMIT_FSIZE = 1,
|
|
||||||
#define RLIMIT_FSIZE RLIMIT_FSIZE
|
|
||||||
|
|
||||||
/* Maximum size of data segment, in bytes. */
|
|
||||||
RLIMIT_DATA = 2,
|
|
||||||
#define RLIMIT_DATA RLIMIT_DATA
|
|
||||||
|
|
||||||
/* Maximum size of stack segment, in bytes. */
|
|
||||||
RLIMIT_STACK = 3,
|
|
||||||
#define RLIMIT_STACK RLIMIT_STACK
|
|
||||||
|
|
||||||
/* Largest core file that can be created, in bytes. */
|
|
||||||
RLIMIT_CORE = 4,
|
|
||||||
#define RLIMIT_CORE RLIMIT_CORE
|
|
||||||
|
|
||||||
/* Largest resident set size, in bytes.
|
|
||||||
This affects swapping; processes that are exceeding their
|
|
||||||
resident set size will be more likely to have physical memory
|
|
||||||
taken from them. */
|
|
||||||
RLIMIT_RSS = 5,
|
|
||||||
#define RLIMIT_RSS RLIMIT_RSS
|
|
||||||
|
|
||||||
/* Number of open files. */
|
|
||||||
RLIMIT_NOFILE = 7,
|
|
||||||
RLIMIT_OFILE = RLIMIT_NOFILE, /* BSD name for same. */
|
|
||||||
#define RLIMIT_NOFILE RLIMIT_NOFILE
|
|
||||||
#define RLIMIT_OFILE RLIMIT_OFILE
|
|
||||||
|
|
||||||
/* Address space limit. */
|
|
||||||
RLIMIT_AS = 9,
|
|
||||||
#define RLIMIT_AS RLIMIT_AS
|
|
||||||
|
|
||||||
/* Number of processes. */
|
|
||||||
RLIMIT_NPROC = 6,
|
|
||||||
#define RLIMIT_NPROC RLIMIT_NPROC
|
|
||||||
|
|
||||||
/* Locked-in-memory address space. */
|
|
||||||
RLIMIT_MEMLOCK = 8,
|
|
||||||
#define RLIMIT_MEMLOCK RLIMIT_MEMLOCK
|
|
||||||
|
|
||||||
/* Maximum number of file locks. */
|
|
||||||
RLIMIT_LOCKS = 10,
|
|
||||||
#define RLIMIT_LOCKS RLIMIT_LOCKS
|
|
||||||
|
|
||||||
RLIMIT_NLIMITS = 11,
|
|
||||||
RLIM_NLIMITS = RLIMIT_NLIMITS
|
|
||||||
#define RLIMIT_NLIMITS RLIMIT_NLIMITS
|
|
||||||
#define RLIM_NLIMITS RLIM_NLIMITS
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Value to indicate that there is no limit. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
# define RLIM_INFINITY ((unsigned long int)(~0UL))
|
|
||||||
#else
|
|
||||||
# define RLIM_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
# define RLIM64_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* We can represent all limits. */
|
|
||||||
#define RLIM_SAVED_MAX RLIM_INFINITY
|
|
||||||
#define RLIM_SAVED_CUR RLIM_INFINITY
|
|
||||||
|
|
||||||
|
|
||||||
/* Type for resource quantity measurement. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
typedef __rlim_t rlim_t;
|
|
||||||
#else
|
|
||||||
typedef __rlim64_t rlim_t;
|
|
||||||
#endif
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
typedef __rlim64_t rlim64_t;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
struct rlimit
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim_t rlim_max;
|
|
||||||
};
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
struct rlimit64
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim64_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim64_t rlim_max;
|
|
||||||
};
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Whose usage statistics do you want? */
|
|
||||||
enum __rusage_who
|
|
||||||
{
|
|
||||||
/* The calling process. */
|
|
||||||
RUSAGE_SELF = 0,
|
|
||||||
#define RUSAGE_SELF RUSAGE_SELF
|
|
||||||
|
|
||||||
/* All of its terminated child processes. */
|
|
||||||
RUSAGE_CHILDREN = -1,
|
|
||||||
#define RUSAGE_CHILDREN RUSAGE_CHILDREN
|
|
||||||
|
|
||||||
/* Both. */
|
|
||||||
RUSAGE_BOTH = -2
|
|
||||||
#define RUSAGE_BOTH RUSAGE_BOTH
|
|
||||||
};
|
|
||||||
|
|
||||||
#define __need_timeval
|
|
||||||
#include <bits/time.h> /* For `struct timeval'. */
|
|
||||||
|
|
||||||
/* Structure which says how much of each resource has been used. */
|
|
||||||
struct rusage
|
|
||||||
{
|
|
||||||
/* Total amount of user time used. */
|
|
||||||
struct timeval ru_utime;
|
|
||||||
/* Total amount of system time used. */
|
|
||||||
struct timeval ru_stime;
|
|
||||||
/* Maximum resident set size (in kilobytes). */
|
|
||||||
long int ru_maxrss;
|
|
||||||
/* Amount of sharing of text segment memory
|
|
||||||
with other processes (kilobyte-seconds). */
|
|
||||||
long int ru_ixrss;
|
|
||||||
/* Amount of data segment memory used (kilobyte-seconds). */
|
|
||||||
long int ru_idrss;
|
|
||||||
/* Amount of stack memory used (kilobyte-seconds). */
|
|
||||||
long int ru_isrss;
|
|
||||||
/* Number of soft page faults (i.e. those serviced by reclaiming
|
|
||||||
a page from the list of pages awaiting reallocation. */
|
|
||||||
long int ru_minflt;
|
|
||||||
/* Number of hard page faults (i.e. those that required I/O). */
|
|
||||||
long int ru_majflt;
|
|
||||||
/* Number of times a process was swapped out of physical memory. */
|
|
||||||
long int ru_nswap;
|
|
||||||
/* Number of input operations via the file system. Note: This
|
|
||||||
and `ru_oublock' do not include operations with the cache. */
|
|
||||||
long int ru_inblock;
|
|
||||||
/* Number of output operations via the file system. */
|
|
||||||
long int ru_oublock;
|
|
||||||
/* Number of IPC messages sent. */
|
|
||||||
long int ru_msgsnd;
|
|
||||||
/* Number of IPC messages received. */
|
|
||||||
long int ru_msgrcv;
|
|
||||||
/* Number of signals delivered. */
|
|
||||||
long int ru_nsignals;
|
|
||||||
/* Number of voluntary context switches, i.e. because the process
|
|
||||||
gave up the process before it had to (usually to wait for some
|
|
||||||
resource to be available). */
|
|
||||||
long int ru_nvcsw;
|
|
||||||
/* Number of involuntary context switches, i.e. a higher priority process
|
|
||||||
became runnable or the current process used up its time slice. */
|
|
||||||
long int ru_nivcsw;
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Priority limits. */
|
|
||||||
#define PRIO_MIN -20 /* Minimum priority a process can have. */
|
|
||||||
#define PRIO_MAX 20 /* Maximum priority a process can have. */
|
|
||||||
|
|
||||||
/* The type of the WHICH argument to `getpriority' and `setpriority',
|
|
||||||
indicating what flavor of entity the WHO argument specifies. */
|
|
||||||
enum __priority_which
|
|
||||||
{
|
|
||||||
PRIO_PROCESS = 0, /* WHO is a process ID. */
|
|
||||||
#define PRIO_PROCESS PRIO_PROCESS
|
|
||||||
PRIO_PGRP = 1, /* WHO is a process group ID. */
|
|
||||||
#define PRIO_PGRP PRIO_PGRP
|
|
||||||
PRIO_USER = 2 /* WHO is a user ID. */
|
|
||||||
#define PRIO_USER PRIO_USER
|
|
||||||
};
|
|
@ -1,209 +0,0 @@
|
|||||||
/* Bit values & structures for resource limits. Linux/HPPA version.
|
|
||||||
Copyright (C) 1994-99, 2000 Free Software Foundation, Inc.
|
|
||||||
This file is part of the GNU C Library.
|
|
||||||
|
|
||||||
The GNU C Library is free software; you can redistribute it and/or
|
|
||||||
modify it under the terms of the GNU Lesser General Public
|
|
||||||
License as published by the Free Software Foundation; either
|
|
||||||
version 2.1 of the License, or (at your option) any later version.
|
|
||||||
|
|
||||||
The GNU C Library is distributed in the hope that it will be useful,
|
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
||||||
Lesser General Public License for more details.
|
|
||||||
|
|
||||||
You should have received a copy of the GNU Lesser General Public
|
|
||||||
License along with the GNU C Library; if not, write to the Free
|
|
||||||
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
|
||||||
02111-1307 USA. */
|
|
||||||
|
|
||||||
#ifndef _SYS_RESOURCE_H
|
|
||||||
# error "Never use <bits/resource.h> directly; include <sys/resource.h> instead."
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include <bits/types.h>
|
|
||||||
|
|
||||||
/* Transmute defines to enumerations. The macro re-definitions are
|
|
||||||
necessary because some programs want to test for operating system
|
|
||||||
features with #ifdef RUSAGE_SELF. In ISO C the reflexive
|
|
||||||
definition is a no-op. */
|
|
||||||
|
|
||||||
/* Kinds of resource limit. */
|
|
||||||
enum __rlimit_resource
|
|
||||||
{
|
|
||||||
/* Per-process CPU limit, in seconds. */
|
|
||||||
RLIMIT_CPU = 0,
|
|
||||||
#define RLIMIT_CPU RLIMIT_CPU
|
|
||||||
|
|
||||||
/* Largest file that can be created, in bytes. */
|
|
||||||
RLIMIT_FSIZE = 1,
|
|
||||||
#define RLIMIT_FSIZE RLIMIT_FSIZE
|
|
||||||
|
|
||||||
/* Maximum size of data segment, in bytes. */
|
|
||||||
RLIMIT_DATA = 2,
|
|
||||||
#define RLIMIT_DATA RLIMIT_DATA
|
|
||||||
|
|
||||||
/* Maximum size of stack segment, in bytes. */
|
|
||||||
RLIMIT_STACK = 3,
|
|
||||||
#define RLIMIT_STACK RLIMIT_STACK
|
|
||||||
|
|
||||||
/* Largest core file that can be created, in bytes. */
|
|
||||||
RLIMIT_CORE = 4,
|
|
||||||
#define RLIMIT_CORE RLIMIT_CORE
|
|
||||||
|
|
||||||
/* Largest resident set size, in bytes.
|
|
||||||
This affects swapping; processes that are exceeding their
|
|
||||||
resident set size will be more likely to have physical memory
|
|
||||||
taken from them. */
|
|
||||||
RLIMIT_RSS = 5,
|
|
||||||
#define RLIMIT_RSS RLIMIT_RSS
|
|
||||||
|
|
||||||
/* Number of open files. */
|
|
||||||
RLIMIT_NOFILE = 7,
|
|
||||||
RLIMIT_OFILE = RLIMIT_NOFILE, /* BSD name for same. */
|
|
||||||
#define RLIMIT_NOFILE RLIMIT_NOFILE
|
|
||||||
#define RLIMIT_OFILE RLIMIT_OFILE
|
|
||||||
|
|
||||||
/* Address space limit. */
|
|
||||||
RLIMIT_AS = 9,
|
|
||||||
#define RLIMIT_AS RLIMIT_AS
|
|
||||||
|
|
||||||
/* Number of processes. */
|
|
||||||
RLIMIT_NPROC = 6,
|
|
||||||
#define RLIMIT_NPROC RLIMIT_NPROC
|
|
||||||
|
|
||||||
/* Locked-in-memory address space. */
|
|
||||||
RLIMIT_MEMLOCK = 8,
|
|
||||||
#define RLIMIT_MEMLOCK RLIMIT_MEMLOCK
|
|
||||||
|
|
||||||
/* Maximum number of file locks. */
|
|
||||||
RLIMIT_LOCKS = 10,
|
|
||||||
#define RLIMIT_LOCKS RLIMIT_LOCKS
|
|
||||||
|
|
||||||
RLIMIT_NLIMITS = 11,
|
|
||||||
RLIM_NLIMITS = RLIMIT_NLIMITS
|
|
||||||
#define RLIMIT_NLIMITS RLIMIT_NLIMITS
|
|
||||||
#define RLIM_NLIMITS RLIM_NLIMITS
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Value to indicate that there is no limit. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
# define RLIM_INFINITY ((unsigned long int)(~0UL))
|
|
||||||
#else
|
|
||||||
# define RLIM_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
# define RLIM64_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* We can represent all limits. */
|
|
||||||
#define RLIM_SAVED_MAX RLIM_INFINITY
|
|
||||||
#define RLIM_SAVED_CUR RLIM_INFINITY
|
|
||||||
|
|
||||||
|
|
||||||
/* Type for resource quantity measurement. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
typedef __rlim_t rlim_t;
|
|
||||||
#else
|
|
||||||
typedef __rlim64_t rlim_t;
|
|
||||||
#endif
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
typedef __rlim64_t rlim64_t;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
struct rlimit
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim_t rlim_max;
|
|
||||||
};
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
struct rlimit64
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim64_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim64_t rlim_max;
|
|
||||||
};
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Whose usage statistics do you want? */
|
|
||||||
enum __rusage_who
|
|
||||||
{
|
|
||||||
/* The calling process. */
|
|
||||||
RUSAGE_SELF = 0,
|
|
||||||
#define RUSAGE_SELF RUSAGE_SELF
|
|
||||||
|
|
||||||
/* All of its terminated child processes. */
|
|
||||||
RUSAGE_CHILDREN = -1,
|
|
||||||
#define RUSAGE_CHILDREN RUSAGE_CHILDREN
|
|
||||||
|
|
||||||
/* Both. */
|
|
||||||
RUSAGE_BOTH = -2
|
|
||||||
#define RUSAGE_BOTH RUSAGE_BOTH
|
|
||||||
};
|
|
||||||
|
|
||||||
#define __need_timeval
|
|
||||||
#include <bits/time.h> /* For `struct timeval'. */
|
|
||||||
|
|
||||||
/* Structure which says how much of each resource has been used. */
|
|
||||||
struct rusage
|
|
||||||
{
|
|
||||||
/* Total amount of user time used. */
|
|
||||||
struct timeval ru_utime;
|
|
||||||
/* Total amount of system time used. */
|
|
||||||
struct timeval ru_stime;
|
|
||||||
/* Maximum resident set size (in kilobytes). */
|
|
||||||
long int ru_maxrss;
|
|
||||||
/* Amount of sharing of text segment memory
|
|
||||||
with other processes (kilobyte-seconds). */
|
|
||||||
long int ru_ixrss;
|
|
||||||
/* Amount of data segment memory used (kilobyte-seconds). */
|
|
||||||
long int ru_idrss;
|
|
||||||
/* Amount of stack memory used (kilobyte-seconds). */
|
|
||||||
long int ru_isrss;
|
|
||||||
/* Number of soft page faults (i.e. those serviced by reclaiming
|
|
||||||
a page from the list of pages awaiting reallocation. */
|
|
||||||
long int ru_minflt;
|
|
||||||
/* Number of hard page faults (i.e. those that required I/O). */
|
|
||||||
long int ru_majflt;
|
|
||||||
/* Number of times a process was swapped out of physical memory. */
|
|
||||||
long int ru_nswap;
|
|
||||||
/* Number of input operations via the file system. Note: This
|
|
||||||
and `ru_oublock' do not include operations with the cache. */
|
|
||||||
long int ru_inblock;
|
|
||||||
/* Number of output operations via the file system. */
|
|
||||||
long int ru_oublock;
|
|
||||||
/* Number of IPC messages sent. */
|
|
||||||
long int ru_msgsnd;
|
|
||||||
/* Number of IPC messages received. */
|
|
||||||
long int ru_msgrcv;
|
|
||||||
/* Number of signals delivered. */
|
|
||||||
long int ru_nsignals;
|
|
||||||
/* Number of voluntary context switches, i.e. because the process
|
|
||||||
gave up the process before it had to (usually to wait for some
|
|
||||||
resource to be available). */
|
|
||||||
long int ru_nvcsw;
|
|
||||||
/* Number of involuntary context switches, i.e. a higher priority process
|
|
||||||
became runnable or the current process used up its time slice. */
|
|
||||||
long int ru_nivcsw;
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Priority limits. */
|
|
||||||
#define PRIO_MIN -20 /* Minimum priority a process can have. */
|
|
||||||
#define PRIO_MAX 20 /* Maximum priority a process can have. */
|
|
||||||
|
|
||||||
/* The type of the WHICH argument to `getpriority' and `setpriority',
|
|
||||||
indicating what flavor of entity the WHO argument specifies. */
|
|
||||||
enum __priority_which
|
|
||||||
{
|
|
||||||
PRIO_PROCESS = 0, /* WHO is a process ID. */
|
|
||||||
#define PRIO_PROCESS PRIO_PROCESS
|
|
||||||
PRIO_PGRP = 1, /* WHO is a process group ID. */
|
|
||||||
#define PRIO_PGRP PRIO_PGRP
|
|
||||||
PRIO_USER = 2 /* WHO is a user ID. */
|
|
||||||
#define PRIO_USER PRIO_USER
|
|
||||||
};
|
|
@ -1,209 +0,0 @@
|
|||||||
/* Bit values & structures for resource limits. Linux/x86 version.
|
|
||||||
Copyright (C) 1994,1996,1997,1998,1999,2000 Free Software Foundation, Inc.
|
|
||||||
This file is part of the GNU C Library.
|
|
||||||
|
|
||||||
The GNU C Library is free software; you can redistribute it and/or
|
|
||||||
modify it under the terms of the GNU Lesser General Public
|
|
||||||
License as published by the Free Software Foundation; either
|
|
||||||
version 2.1 of the License, or (at your option) any later version.
|
|
||||||
|
|
||||||
The GNU C Library is distributed in the hope that it will be useful,
|
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
||||||
Lesser General Public License for more details.
|
|
||||||
|
|
||||||
You should have received a copy of the GNU Lesser General Public
|
|
||||||
License along with the GNU C Library; if not, write to the Free
|
|
||||||
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
|
||||||
02111-1307 USA. */
|
|
||||||
|
|
||||||
#ifndef _SYS_RESOURCE_H
|
|
||||||
# error "Never use <bits/resource.h> directly; include <sys/resource.h> instead."
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include <bits/types.h>
|
|
||||||
|
|
||||||
/* Transmute defines to enumerations. The macro re-definitions are
|
|
||||||
necessary because some programs want to test for operating system
|
|
||||||
features with #ifdef RUSAGE_SELF. In ISO C the reflexive
|
|
||||||
definition is a no-op. */
|
|
||||||
|
|
||||||
/* Kinds of resource limit. */
|
|
||||||
enum __rlimit_resource
|
|
||||||
{
|
|
||||||
/* Per-process CPU limit, in seconds. */
|
|
||||||
RLIMIT_CPU = 0,
|
|
||||||
#define RLIMIT_CPU RLIMIT_CPU
|
|
||||||
|
|
||||||
/* Largest file that can be created, in bytes. */
|
|
||||||
RLIMIT_FSIZE = 1,
|
|
||||||
#define RLIMIT_FSIZE RLIMIT_FSIZE
|
|
||||||
|
|
||||||
/* Maximum size of data segment, in bytes. */
|
|
||||||
RLIMIT_DATA = 2,
|
|
||||||
#define RLIMIT_DATA RLIMIT_DATA
|
|
||||||
|
|
||||||
/* Maximum size of stack segment, in bytes. */
|
|
||||||
RLIMIT_STACK = 3,
|
|
||||||
#define RLIMIT_STACK RLIMIT_STACK
|
|
||||||
|
|
||||||
/* Largest core file that can be created, in bytes. */
|
|
||||||
RLIMIT_CORE = 4,
|
|
||||||
#define RLIMIT_CORE RLIMIT_CORE
|
|
||||||
|
|
||||||
/* Largest resident set size, in bytes.
|
|
||||||
This affects swapping; processes that are exceeding their
|
|
||||||
resident set size will be more likely to have physical memory
|
|
||||||
taken from them. */
|
|
||||||
RLIMIT_RSS = 5,
|
|
||||||
#define RLIMIT_RSS RLIMIT_RSS
|
|
||||||
|
|
||||||
/* Number of open files. */
|
|
||||||
RLIMIT_NOFILE = 7,
|
|
||||||
RLIMIT_OFILE = RLIMIT_NOFILE, /* BSD name for same. */
|
|
||||||
#define RLIMIT_NOFILE RLIMIT_NOFILE
|
|
||||||
#define RLIMIT_OFILE RLIMIT_OFILE
|
|
||||||
|
|
||||||
/* Address space limit. */
|
|
||||||
RLIMIT_AS = 9,
|
|
||||||
#define RLIMIT_AS RLIMIT_AS
|
|
||||||
|
|
||||||
/* Number of processes. */
|
|
||||||
RLIMIT_NPROC = 6,
|
|
||||||
#define RLIMIT_NPROC RLIMIT_NPROC
|
|
||||||
|
|
||||||
/* Locked-in-memory address space. */
|
|
||||||
RLIMIT_MEMLOCK = 8,
|
|
||||||
#define RLIMIT_MEMLOCK RLIMIT_MEMLOCK
|
|
||||||
|
|
||||||
/* Maximum number of file locks. */
|
|
||||||
RLIMIT_LOCKS = 10,
|
|
||||||
#define RLIMIT_LOCKS RLIMIT_LOCKS
|
|
||||||
|
|
||||||
RLIMIT_NLIMITS = 11,
|
|
||||||
RLIM_NLIMITS = RLIMIT_NLIMITS
|
|
||||||
#define RLIMIT_NLIMITS RLIMIT_NLIMITS
|
|
||||||
#define RLIM_NLIMITS RLIM_NLIMITS
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Value to indicate that there is no limit. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
# define RLIM_INFINITY ((unsigned long int)(~0UL))
|
|
||||||
#else
|
|
||||||
# define RLIM_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
# define RLIM64_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* We can represent all limits. */
|
|
||||||
#define RLIM_SAVED_MAX RLIM_INFINITY
|
|
||||||
#define RLIM_SAVED_CUR RLIM_INFINITY
|
|
||||||
|
|
||||||
|
|
||||||
/* Type for resource quantity measurement. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
typedef __rlim_t rlim_t;
|
|
||||||
#else
|
|
||||||
typedef __rlim64_t rlim_t;
|
|
||||||
#endif
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
typedef __rlim64_t rlim64_t;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
struct rlimit
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim_t rlim_max;
|
|
||||||
};
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
struct rlimit64
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim64_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim64_t rlim_max;
|
|
||||||
};
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Whose usage statistics do you want? */
|
|
||||||
enum __rusage_who
|
|
||||||
{
|
|
||||||
/* The calling process. */
|
|
||||||
RUSAGE_SELF = 0,
|
|
||||||
#define RUSAGE_SELF RUSAGE_SELF
|
|
||||||
|
|
||||||
/* All of its terminated child processes. */
|
|
||||||
RUSAGE_CHILDREN = -1,
|
|
||||||
#define RUSAGE_CHILDREN RUSAGE_CHILDREN
|
|
||||||
|
|
||||||
/* Both. */
|
|
||||||
RUSAGE_BOTH = -2
|
|
||||||
#define RUSAGE_BOTH RUSAGE_BOTH
|
|
||||||
};
|
|
||||||
|
|
||||||
#define __need_timeval
|
|
||||||
#include <bits/time.h> /* For `struct timeval'. */
|
|
||||||
|
|
||||||
/* Structure which says how much of each resource has been used. */
|
|
||||||
struct rusage
|
|
||||||
{
|
|
||||||
/* Total amount of user time used. */
|
|
||||||
struct timeval ru_utime;
|
|
||||||
/* Total amount of system time used. */
|
|
||||||
struct timeval ru_stime;
|
|
||||||
/* Maximum resident set size (in kilobytes). */
|
|
||||||
long int ru_maxrss;
|
|
||||||
/* Amount of sharing of text segment memory
|
|
||||||
with other processes (kilobyte-seconds). */
|
|
||||||
long int ru_ixrss;
|
|
||||||
/* Amount of data segment memory used (kilobyte-seconds). */
|
|
||||||
long int ru_idrss;
|
|
||||||
/* Amount of stack memory used (kilobyte-seconds). */
|
|
||||||
long int ru_isrss;
|
|
||||||
/* Number of soft page faults (i.e. those serviced by reclaiming
|
|
||||||
a page from the list of pages awaiting reallocation. */
|
|
||||||
long int ru_minflt;
|
|
||||||
/* Number of hard page faults (i.e. those that required I/O). */
|
|
||||||
long int ru_majflt;
|
|
||||||
/* Number of times a process was swapped out of physical memory. */
|
|
||||||
long int ru_nswap;
|
|
||||||
/* Number of input operations via the file system. Note: This
|
|
||||||
and `ru_oublock' do not include operations with the cache. */
|
|
||||||
long int ru_inblock;
|
|
||||||
/* Number of output operations via the file system. */
|
|
||||||
long int ru_oublock;
|
|
||||||
/* Number of IPC messages sent. */
|
|
||||||
long int ru_msgsnd;
|
|
||||||
/* Number of IPC messages received. */
|
|
||||||
long int ru_msgrcv;
|
|
||||||
/* Number of signals delivered. */
|
|
||||||
long int ru_nsignals;
|
|
||||||
/* Number of voluntary context switches, i.e. because the process
|
|
||||||
gave up the process before it had to (usually to wait for some
|
|
||||||
resource to be available). */
|
|
||||||
long int ru_nvcsw;
|
|
||||||
/* Number of involuntary context switches, i.e. a higher priority process
|
|
||||||
became runnable or the current process used up its time slice. */
|
|
||||||
long int ru_nivcsw;
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Priority limits. */
|
|
||||||
#define PRIO_MIN -20 /* Minimum priority a process can have. */
|
|
||||||
#define PRIO_MAX 20 /* Maximum priority a process can have. */
|
|
||||||
|
|
||||||
/* The type of the WHICH argument to `getpriority' and `setpriority',
|
|
||||||
indicating what flavor of entity the WHO argument specifies. */
|
|
||||||
enum __priority_which
|
|
||||||
{
|
|
||||||
PRIO_PROCESS = 0, /* WHO is a process ID. */
|
|
||||||
#define PRIO_PROCESS PRIO_PROCESS
|
|
||||||
PRIO_PGRP = 1, /* WHO is a process group ID. */
|
|
||||||
#define PRIO_PGRP PRIO_PGRP
|
|
||||||
PRIO_USER = 2 /* WHO is a user ID. */
|
|
||||||
#define PRIO_USER PRIO_USER
|
|
||||||
};
|
|
@ -1,201 +0,0 @@
|
|||||||
/* Bit values & structures for resource limits. Linux version.
|
|
||||||
Copyright (C) 1994, 1996, 1997, 1998, 2000 Free Software Foundation, Inc.
|
|
||||||
This file is part of the GNU C Library.
|
|
||||||
|
|
||||||
The GNU C Library is free software; you can redistribute it and/or
|
|
||||||
modify it under the terms of the GNU Lesser General Public
|
|
||||||
License as published by the Free Software Foundation; either
|
|
||||||
version 2.1 of the License, or (at your option) any later version.
|
|
||||||
|
|
||||||
The GNU C Library is distributed in the hope that it will be useful,
|
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
||||||
Lesser General Public License for more details.
|
|
||||||
|
|
||||||
You should have received a copy of the GNU Lesser General Public
|
|
||||||
License along with the GNU C Library; if not, write to the Free
|
|
||||||
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
|
||||||
02111-1307 USA. */
|
|
||||||
|
|
||||||
#ifndef _SYS_RESOURCE_H
|
|
||||||
# error "Never use <bits/resource.h> directly; include <sys/resource.h> instead."
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include <bits/types.h>
|
|
||||||
|
|
||||||
/* Transmute defines to enumerations. The macro re-definitions are
|
|
||||||
necessary because some programs want to test for operating system
|
|
||||||
features with #ifdef RUSAGE_SELF. In ISO C the reflexive
|
|
||||||
definition is a no-op. */
|
|
||||||
|
|
||||||
/* Kinds of resource limit. */
|
|
||||||
enum __rlimit_resource
|
|
||||||
{
|
|
||||||
/* Per-process CPU limit, in seconds. */
|
|
||||||
RLIMIT_CPU = 0,
|
|
||||||
#define RLIMIT_CPU RLIMIT_CPU
|
|
||||||
|
|
||||||
/* Largest file that can be created, in bytes. */
|
|
||||||
RLIMIT_FSIZE = 1,
|
|
||||||
#define RLIMIT_FSIZE RLIMIT_FSIZE
|
|
||||||
|
|
||||||
/* Maximum size of data segment, in bytes. */
|
|
||||||
RLIMIT_DATA = 2,
|
|
||||||
#define RLIMIT_DATA RLIMIT_DATA
|
|
||||||
|
|
||||||
/* Maximum size of stack segment, in bytes. */
|
|
||||||
RLIMIT_STACK = 3,
|
|
||||||
#define RLIMIT_STACK RLIMIT_STACK
|
|
||||||
|
|
||||||
/* Largest core file that can be created, in bytes. */
|
|
||||||
RLIMIT_CORE = 4,
|
|
||||||
#define RLIMIT_CORE RLIMIT_CORE
|
|
||||||
|
|
||||||
/* Largest resident set size, in bytes.
|
|
||||||
This affects swapping; processes that are exceeding their
|
|
||||||
resident set size will be more likely to have physical memory
|
|
||||||
taken from them. */
|
|
||||||
RLIMIT_RSS = 5,
|
|
||||||
#define RLIMIT_RSS RLIMIT_RSS
|
|
||||||
|
|
||||||
/* Number of processes. */
|
|
||||||
RLIMIT_NPROC = 6,
|
|
||||||
#define RLIMIT_NPROC RLIMIT_NPROC
|
|
||||||
|
|
||||||
/* Number of open files. */
|
|
||||||
RLIMIT_NOFILE = 7,
|
|
||||||
RLIMIT_OFILE = RLIMIT_NOFILE, /* BSD name for same. */
|
|
||||||
#define RLIMIT_NOFILE RLIMIT_NOFILE
|
|
||||||
#define RLIMIT_OFILE RLIMIT_OFILE
|
|
||||||
|
|
||||||
/* Locked-in-memory address space. */
|
|
||||||
RLIMIT_MEMLOCK = 8,
|
|
||||||
#define RLIMIT_MEMLOCK RLIMIT_MEMLOCK
|
|
||||||
|
|
||||||
/* Address space limit (?) */
|
|
||||||
RLIMIT_AS = 9,
|
|
||||||
#define RLIMIT_AS RLIMIT_AS
|
|
||||||
|
|
||||||
/* Maximum number of file locks. */
|
|
||||||
RLIMIT_LOCKS = 10,
|
|
||||||
#define RLIMIT_LOCKS RLIMIT_LOCKS
|
|
||||||
|
|
||||||
RLIMIT_NLIMITS = 11,
|
|
||||||
RLIM_NLIMITS = RLIMIT_NLIMITS
|
|
||||||
#define RLIMIT_NLIMITS RLIMIT_NLIMITS
|
|
||||||
#define RLIM_NLIMITS RLIM_NLIMITS
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Value to indicate that there is no limit. */
|
|
||||||
#define RLIM_INFINITY ~0UL
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
# define RLIM64_INFINITY ~0UL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* We can represent all limits. */
|
|
||||||
#define RLIM_SAVED_MAX RLIM_INFINITY
|
|
||||||
#define RLIM_SAVED_CUR RLIM_INFINITY
|
|
||||||
|
|
||||||
|
|
||||||
/* Type for resource quantity measurement. */
|
|
||||||
typedef __rlim64_t rlim_t;
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
typedef __rlim64_t rlim64_t;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
struct rlimit
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim_t rlim_max;
|
|
||||||
};
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
struct rlimit64
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim64_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim64_t rlim_max;
|
|
||||||
};
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Whose usage statistics do you want? */
|
|
||||||
enum __rusage_who
|
|
||||||
{
|
|
||||||
/* The calling process. */
|
|
||||||
RUSAGE_SELF = 0,
|
|
||||||
#define RUSAGE_SELF RUSAGE_SELF
|
|
||||||
|
|
||||||
/* All of its terminated child processes. */
|
|
||||||
RUSAGE_CHILDREN = -1,
|
|
||||||
#define RUSAGE_CHILDREN RUSAGE_CHILDREN
|
|
||||||
|
|
||||||
/* Both. */
|
|
||||||
RUSAGE_BOTH = -2
|
|
||||||
#define RUSAGE_BOTH RUSAGE_BOTH
|
|
||||||
};
|
|
||||||
|
|
||||||
#define __need_timeval
|
|
||||||
#include <bits/time.h> /* For `struct timeval'. */
|
|
||||||
|
|
||||||
/* Structure which says how much of each resource has been used. */
|
|
||||||
struct rusage
|
|
||||||
{
|
|
||||||
/* Total amount of user time used. */
|
|
||||||
struct timeval ru_utime;
|
|
||||||
/* Total amount of system time used. */
|
|
||||||
struct timeval ru_stime;
|
|
||||||
/* Maximum resident set size (in kilobytes). */
|
|
||||||
long int ru_maxrss;
|
|
||||||
/* Amount of sharing of text segment memory
|
|
||||||
with other processes (kilobyte-seconds). */
|
|
||||||
long int ru_ixrss;
|
|
||||||
/* Amount of data segment memory used (kilobyte-seconds). */
|
|
||||||
long int ru_idrss;
|
|
||||||
/* Amount of stack memory used (kilobyte-seconds). */
|
|
||||||
long int ru_isrss;
|
|
||||||
/* Number of soft page faults (i.e. those serviced by reclaiming
|
|
||||||
a page from the list of pages awaiting reallocation. */
|
|
||||||
long int ru_minflt;
|
|
||||||
/* Number of hard page faults (i.e. those that required I/O). */
|
|
||||||
long int ru_majflt;
|
|
||||||
/* Number of times a process was swapped out of physical memory. */
|
|
||||||
long int ru_nswap;
|
|
||||||
/* Number of input operations via the file system. Note: This
|
|
||||||
and `ru_oublock' do not include operations with the cache. */
|
|
||||||
long int ru_inblock;
|
|
||||||
/* Number of output operations via the file system. */
|
|
||||||
long int ru_oublock;
|
|
||||||
/* Number of IPC messages sent. */
|
|
||||||
long int ru_msgsnd;
|
|
||||||
/* Number of IPC messages received. */
|
|
||||||
long int ru_msgrcv;
|
|
||||||
/* Number of signals delivered. */
|
|
||||||
long int ru_nsignals;
|
|
||||||
/* Number of voluntary context switches, i.e. because the process
|
|
||||||
gave up the process before it had to (usually to wait for some
|
|
||||||
resource to be available). */
|
|
||||||
long int ru_nvcsw;
|
|
||||||
/* Number of involuntary context switches, i.e. a higher priority process
|
|
||||||
became runnable or the current process used up its time slice. */
|
|
||||||
long int ru_nivcsw;
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Priority limits. */
|
|
||||||
#define PRIO_MIN -20 /* Minimum priority a process can have. */
|
|
||||||
#define PRIO_MAX 20 /* Maximum priority a process can have. */
|
|
||||||
|
|
||||||
/* The type of the WHICH argument to `getpriority' and `setpriority',
|
|
||||||
indicating what flavor of entity the WHO argument specifies. */
|
|
||||||
enum __priority_which
|
|
||||||
{
|
|
||||||
PRIO_PROCESS = 0, /* WHO is a process ID. */
|
|
||||||
#define PRIO_PROCESS PRIO_PROCESS
|
|
||||||
PRIO_PGRP = 1, /* WHO is a process group ID. */
|
|
||||||
#define PRIO_PGRP PRIO_PGRP
|
|
||||||
PRIO_USER = 2 /* WHO is a user ID. */
|
|
||||||
#define PRIO_USER PRIO_USER
|
|
||||||
};
|
|
@ -1,209 +0,0 @@
|
|||||||
/* Bit values & structures for resource limits. Linux/m68k version.
|
|
||||||
Copyright (C) 1994,1996,1997,1998,1999,2000,2001 Free Software Foundation, Inc.
|
|
||||||
This file is part of the GNU C Library.
|
|
||||||
|
|
||||||
The GNU C Library is free software; you can redistribute it and/or
|
|
||||||
modify it under the terms of the GNU Lesser General Public
|
|
||||||
License as published by the Free Software Foundation; either
|
|
||||||
version 2.1 of the License, or (at your option) any later version.
|
|
||||||
|
|
||||||
The GNU C Library is distributed in the hope that it will be useful,
|
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
||||||
Lesser General Public License for more details.
|
|
||||||
|
|
||||||
You should have received a copy of the GNU Lesser General Public
|
|
||||||
License along with the GNU C Library; if not, write to the Free
|
|
||||||
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
|
||||||
02111-1307 USA. */
|
|
||||||
|
|
||||||
#ifndef _SYS_RESOURCE_H
|
|
||||||
# error "Never use <bits/resource.h> directly; include <sys/resource.h> instead."
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include <bits/types.h>
|
|
||||||
|
|
||||||
/* Transmute defines to enumerations. The macro re-definitions are
|
|
||||||
necessary because some programs want to test for operating system
|
|
||||||
features with #ifdef RUSAGE_SELF. In ISO C the reflexive
|
|
||||||
definition is a no-op. */
|
|
||||||
|
|
||||||
/* Kinds of resource limit. */
|
|
||||||
enum __rlimit_resource
|
|
||||||
{
|
|
||||||
/* Per-process CPU limit, in seconds. */
|
|
||||||
RLIMIT_CPU = 0,
|
|
||||||
#define RLIMIT_CPU RLIMIT_CPU
|
|
||||||
|
|
||||||
/* Largest file that can be created, in bytes. */
|
|
||||||
RLIMIT_FSIZE = 1,
|
|
||||||
#define RLIMIT_FSIZE RLIMIT_FSIZE
|
|
||||||
|
|
||||||
/* Maximum size of data segment, in bytes. */
|
|
||||||
RLIMIT_DATA = 2,
|
|
||||||
#define RLIMIT_DATA RLIMIT_DATA
|
|
||||||
|
|
||||||
/* Maximum size of stack segment, in bytes. */
|
|
||||||
RLIMIT_STACK = 3,
|
|
||||||
#define RLIMIT_STACK RLIMIT_STACK
|
|
||||||
|
|
||||||
/* Largest core file that can be created, in bytes. */
|
|
||||||
RLIMIT_CORE = 4,
|
|
||||||
#define RLIMIT_CORE RLIMIT_CORE
|
|
||||||
|
|
||||||
/* Largest resident set size, in bytes.
|
|
||||||
This affects swapping; processes that are exceeding their
|
|
||||||
resident set size will be more likely to have physical memory
|
|
||||||
taken from them. */
|
|
||||||
RLIMIT_RSS = 5,
|
|
||||||
#define RLIMIT_RSS RLIMIT_RSS
|
|
||||||
|
|
||||||
/* Number of open files. */
|
|
||||||
RLIMIT_NOFILE = 7,
|
|
||||||
RLIMIT_OFILE = RLIMIT_NOFILE, /* BSD name for same. */
|
|
||||||
#define RLIMIT_NOFILE RLIMIT_NOFILE
|
|
||||||
#define RLIMIT_OFILE RLIMIT_OFILE
|
|
||||||
|
|
||||||
/* Address space limit. */
|
|
||||||
RLIMIT_AS = 9,
|
|
||||||
#define RLIMIT_AS RLIMIT_AS
|
|
||||||
|
|
||||||
/* Number of processes. */
|
|
||||||
RLIMIT_NPROC = 6,
|
|
||||||
#define RLIMIT_NPROC RLIMIT_NPROC
|
|
||||||
|
|
||||||
/* Locked-in-memory address space. */
|
|
||||||
RLIMIT_MEMLOCK = 8,
|
|
||||||
#define RLIMIT_MEMLOCK RLIMIT_MEMLOCK
|
|
||||||
|
|
||||||
/* Maximum number of file locks. */
|
|
||||||
RLIMIT_LOCKS = 10,
|
|
||||||
#define RLIMIT_LOCKS RLIMIT_LOCKS
|
|
||||||
|
|
||||||
RLIMIT_NLIMITS = 11,
|
|
||||||
RLIM_NLIMITS = RLIMIT_NLIMITS
|
|
||||||
#define RLIMIT_NLIMITS RLIMIT_NLIMITS
|
|
||||||
#define RLIM_NLIMITS RLIM_NLIMITS
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Value to indicate that there is no limit. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
# define RLIM_INFINITY ((unsigned long int)(~0UL))
|
|
||||||
#else
|
|
||||||
# define RLIM_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
# define RLIM64_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* We can represent all limits. */
|
|
||||||
#define RLIM_SAVED_MAX RLIM_INFINITY
|
|
||||||
#define RLIM_SAVED_CUR RLIM_INFINITY
|
|
||||||
|
|
||||||
|
|
||||||
/* Type for resource quantity measurement. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
typedef __rlim_t rlim_t;
|
|
||||||
#else
|
|
||||||
typedef __rlim64_t rlim_t;
|
|
||||||
#endif
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
typedef __rlim64_t rlim64_t;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
struct rlimit
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim_t rlim_max;
|
|
||||||
};
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
struct rlimit64
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim64_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim64_t rlim_max;
|
|
||||||
};
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Whose usage statistics do you want? */
|
|
||||||
enum __rusage_who
|
|
||||||
{
|
|
||||||
/* The calling process. */
|
|
||||||
RUSAGE_SELF = 0,
|
|
||||||
#define RUSAGE_SELF RUSAGE_SELF
|
|
||||||
|
|
||||||
/* All of its terminated child processes. */
|
|
||||||
RUSAGE_CHILDREN = -1,
|
|
||||||
#define RUSAGE_CHILDREN RUSAGE_CHILDREN
|
|
||||||
|
|
||||||
/* Both. */
|
|
||||||
RUSAGE_BOTH = -2
|
|
||||||
#define RUSAGE_BOTH RUSAGE_BOTH
|
|
||||||
};
|
|
||||||
|
|
||||||
#define __need_timeval
|
|
||||||
#include <bits/time.h> /* For `struct timeval'. */
|
|
||||||
|
|
||||||
/* Structure which says how much of each resource has been used. */
|
|
||||||
struct rusage
|
|
||||||
{
|
|
||||||
/* Total amount of user time used. */
|
|
||||||
struct timeval ru_utime;
|
|
||||||
/* Total amount of system time used. */
|
|
||||||
struct timeval ru_stime;
|
|
||||||
/* Maximum resident set size (in kilobytes). */
|
|
||||||
long int ru_maxrss;
|
|
||||||
/* Amount of sharing of text segment memory
|
|
||||||
with other processes (kilobyte-seconds). */
|
|
||||||
long int ru_ixrss;
|
|
||||||
/* Amount of data segment memory used (kilobyte-seconds). */
|
|
||||||
long int ru_idrss;
|
|
||||||
/* Amount of stack memory used (kilobyte-seconds). */
|
|
||||||
long int ru_isrss;
|
|
||||||
/* Number of soft page faults (i.e. those serviced by reclaiming
|
|
||||||
a page from the list of pages awaiting reallocation. */
|
|
||||||
long int ru_minflt;
|
|
||||||
/* Number of hard page faults (i.e. those that required I/O). */
|
|
||||||
long int ru_majflt;
|
|
||||||
/* Number of times a process was swapped out of physical memory. */
|
|
||||||
long int ru_nswap;
|
|
||||||
/* Number of input operations via the file system. Note: This
|
|
||||||
and `ru_oublock' do not include operations with the cache. */
|
|
||||||
long int ru_inblock;
|
|
||||||
/* Number of output operations via the file system. */
|
|
||||||
long int ru_oublock;
|
|
||||||
/* Number of IPC messages sent. */
|
|
||||||
long int ru_msgsnd;
|
|
||||||
/* Number of IPC messages received. */
|
|
||||||
long int ru_msgrcv;
|
|
||||||
/* Number of signals delivered. */
|
|
||||||
long int ru_nsignals;
|
|
||||||
/* Number of voluntary context switches, i.e. because the process
|
|
||||||
gave up the process before it had to (usually to wait for some
|
|
||||||
resource to be available). */
|
|
||||||
long int ru_nvcsw;
|
|
||||||
/* Number of involuntary context switches, i.e. a higher priority process
|
|
||||||
became runnable or the current process used up its time slice. */
|
|
||||||
long int ru_nivcsw;
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Priority limits. */
|
|
||||||
#define PRIO_MIN -20 /* Minimum priority a process can have. */
|
|
||||||
#define PRIO_MAX 20 /* Maximum priority a process can have. */
|
|
||||||
|
|
||||||
/* The type of the WHICH argument to `getpriority' and `setpriority',
|
|
||||||
indicating what flavor of entity the WHO argument specifies. */
|
|
||||||
enum __priority_which
|
|
||||||
{
|
|
||||||
PRIO_PROCESS = 0, /* WHO is a process ID. */
|
|
||||||
#define PRIO_PROCESS PRIO_PROCESS
|
|
||||||
PRIO_PGRP = 1, /* WHO is a process group ID. */
|
|
||||||
#define PRIO_PGRP PRIO_PGRP
|
|
||||||
PRIO_USER = 2 /* WHO is a user ID. */
|
|
||||||
#define PRIO_USER PRIO_USER
|
|
||||||
};
|
|
@ -1,209 +0,0 @@
|
|||||||
/* Bit values & structures for resource limits. Linux/PPC version.
|
|
||||||
Copyright (C) 1994-99, 2000 Free Software Foundation, Inc.
|
|
||||||
This file is part of the GNU C Library.
|
|
||||||
|
|
||||||
The GNU C Library is free software; you can redistribute it and/or
|
|
||||||
modify it under the terms of the GNU Lesser General Public
|
|
||||||
License as published by the Free Software Foundation; either
|
|
||||||
version 2.1 of the License, or (at your option) any later version.
|
|
||||||
|
|
||||||
The GNU C Library is distributed in the hope that it will be useful,
|
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
||||||
Lesser General Public License for more details.
|
|
||||||
|
|
||||||
You should have received a copy of the GNU Lesser General Public
|
|
||||||
License along with the GNU C Library; if not, write to the Free
|
|
||||||
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
|
||||||
02111-1307 USA. */
|
|
||||||
|
|
||||||
#ifndef _SYS_RESOURCE_H
|
|
||||||
# error "Never use <bits/resource.h> directly; include <sys/resource.h> instead."
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include <bits/types.h>
|
|
||||||
|
|
||||||
/* Transmute defines to enumerations. The macro re-definitions are
|
|
||||||
necessary because some programs want to test for operating system
|
|
||||||
features with #ifdef RUSAGE_SELF. In ISO C the reflexive
|
|
||||||
definition is a no-op. */
|
|
||||||
|
|
||||||
/* Kinds of resource limit. */
|
|
||||||
enum __rlimit_resource
|
|
||||||
{
|
|
||||||
/* Per-process CPU limit, in seconds. */
|
|
||||||
RLIMIT_CPU = 0,
|
|
||||||
#define RLIMIT_CPU RLIMIT_CPU
|
|
||||||
|
|
||||||
/* Largest file that can be created, in bytes. */
|
|
||||||
RLIMIT_FSIZE = 1,
|
|
||||||
#define RLIMIT_FSIZE RLIMIT_FSIZE
|
|
||||||
|
|
||||||
/* Maximum size of data segment, in bytes. */
|
|
||||||
RLIMIT_DATA = 2,
|
|
||||||
#define RLIMIT_DATA RLIMIT_DATA
|
|
||||||
|
|
||||||
/* Maximum size of stack segment, in bytes. */
|
|
||||||
RLIMIT_STACK = 3,
|
|
||||||
#define RLIMIT_STACK RLIMIT_STACK
|
|
||||||
|
|
||||||
/* Largest core file that can be created, in bytes. */
|
|
||||||
RLIMIT_CORE = 4,
|
|
||||||
#define RLIMIT_CORE RLIMIT_CORE
|
|
||||||
|
|
||||||
/* Largest resident set size, in bytes.
|
|
||||||
This affects swapping; processes that are exceeding their
|
|
||||||
resident set size will be more likely to have physical memory
|
|
||||||
taken from them. */
|
|
||||||
RLIMIT_RSS = 5,
|
|
||||||
#define RLIMIT_RSS RLIMIT_RSS
|
|
||||||
|
|
||||||
/* Number of open files. */
|
|
||||||
RLIMIT_NOFILE = 7,
|
|
||||||
RLIMIT_OFILE = RLIMIT_NOFILE, /* BSD name for same. */
|
|
||||||
#define RLIMIT_NOFILE RLIMIT_NOFILE
|
|
||||||
#define RLIMIT_OFILE RLIMIT_OFILE
|
|
||||||
|
|
||||||
/* Address space limit. */
|
|
||||||
RLIMIT_AS = 9,
|
|
||||||
#define RLIMIT_AS RLIMIT_AS
|
|
||||||
|
|
||||||
/* Number of processes. */
|
|
||||||
RLIMIT_NPROC = 6,
|
|
||||||
#define RLIMIT_NPROC RLIMIT_NPROC
|
|
||||||
|
|
||||||
/* Locked-in-memory address space. */
|
|
||||||
RLIMIT_MEMLOCK = 8,
|
|
||||||
#define RLIMIT_MEMLOCK RLIMIT_MEMLOCK
|
|
||||||
|
|
||||||
/* Maximum number of file locks. */
|
|
||||||
RLIMIT_LOCKS = 10,
|
|
||||||
#define RLIMIT_LOCKS RLIMIT_LOCKS
|
|
||||||
|
|
||||||
RLIMIT_NLIMITS = 11,
|
|
||||||
RLIM_NLIMITS = RLIMIT_NLIMITS
|
|
||||||
#define RLIMIT_NLIMITS RLIMIT_NLIMITS
|
|
||||||
#define RLIM_NLIMITS RLIM_NLIMITS
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Value to indicate that there is no limit. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
# define RLIM_INFINITY ((unsigned long int)(~0UL))
|
|
||||||
#else
|
|
||||||
# define RLIM_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
# define RLIM64_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* We can represent all limits. */
|
|
||||||
#define RLIM_SAVED_MAX RLIM_INFINITY
|
|
||||||
#define RLIM_SAVED_CUR RLIM_INFINITY
|
|
||||||
|
|
||||||
|
|
||||||
/* Type for resource quantity measurement. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
typedef __rlim_t rlim_t;
|
|
||||||
#else
|
|
||||||
typedef __rlim64_t rlim_t;
|
|
||||||
#endif
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
typedef __rlim64_t rlim64_t;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
struct rlimit
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim_t rlim_max;
|
|
||||||
};
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
struct rlimit64
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim64_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim64_t rlim_max;
|
|
||||||
};
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Whose usage statistics do you want? */
|
|
||||||
enum __rusage_who
|
|
||||||
{
|
|
||||||
/* The calling process. */
|
|
||||||
RUSAGE_SELF = 0,
|
|
||||||
#define RUSAGE_SELF RUSAGE_SELF
|
|
||||||
|
|
||||||
/* All of its terminated child processes. */
|
|
||||||
RUSAGE_CHILDREN = -1,
|
|
||||||
#define RUSAGE_CHILDREN RUSAGE_CHILDREN
|
|
||||||
|
|
||||||
/* Both. */
|
|
||||||
RUSAGE_BOTH = -2
|
|
||||||
#define RUSAGE_BOTH RUSAGE_BOTH
|
|
||||||
};
|
|
||||||
|
|
||||||
#define __need_timeval
|
|
||||||
#include <bits/time.h> /* For `struct timeval'. */
|
|
||||||
|
|
||||||
/* Structure which says how much of each resource has been used. */
|
|
||||||
struct rusage
|
|
||||||
{
|
|
||||||
/* Total amount of user time used. */
|
|
||||||
struct timeval ru_utime;
|
|
||||||
/* Total amount of system time used. */
|
|
||||||
struct timeval ru_stime;
|
|
||||||
/* Maximum resident set size (in kilobytes). */
|
|
||||||
long int ru_maxrss;
|
|
||||||
/* Amount of sharing of text segment memory
|
|
||||||
with other processes (kilobyte-seconds). */
|
|
||||||
long int ru_ixrss;
|
|
||||||
/* Amount of data segment memory used (kilobyte-seconds). */
|
|
||||||
long int ru_idrss;
|
|
||||||
/* Amount of stack memory used (kilobyte-seconds). */
|
|
||||||
long int ru_isrss;
|
|
||||||
/* Number of soft page faults (i.e. those serviced by reclaiming
|
|
||||||
a page from the list of pages awaiting reallocation. */
|
|
||||||
long int ru_minflt;
|
|
||||||
/* Number of hard page faults (i.e. those that required I/O). */
|
|
||||||
long int ru_majflt;
|
|
||||||
/* Number of times a process was swapped out of physical memory. */
|
|
||||||
long int ru_nswap;
|
|
||||||
/* Number of input operations via the file system. Note: This
|
|
||||||
and `ru_oublock' do not include operations with the cache. */
|
|
||||||
long int ru_inblock;
|
|
||||||
/* Number of output operations via the file system. */
|
|
||||||
long int ru_oublock;
|
|
||||||
/* Number of IPC messages sent. */
|
|
||||||
long int ru_msgsnd;
|
|
||||||
/* Number of IPC messages received. */
|
|
||||||
long int ru_msgrcv;
|
|
||||||
/* Number of signals delivered. */
|
|
||||||
long int ru_nsignals;
|
|
||||||
/* Number of voluntary context switches, i.e. because the process
|
|
||||||
gave up the process before it had to (usually to wait for some
|
|
||||||
resource to be available). */
|
|
||||||
long int ru_nvcsw;
|
|
||||||
/* Number of involuntary context switches, i.e. a higher priority process
|
|
||||||
became runnable or the current process used up its time slice. */
|
|
||||||
long int ru_nivcsw;
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Priority limits. */
|
|
||||||
#define PRIO_MIN -20 /* Minimum priority a process can have. */
|
|
||||||
#define PRIO_MAX 20 /* Maximum priority a process can have. */
|
|
||||||
|
|
||||||
/* The type of the WHICH argument to `getpriority' and `setpriority',
|
|
||||||
indicating what flavor of entity the WHO argument specifies. */
|
|
||||||
enum __priority_which
|
|
||||||
{
|
|
||||||
PRIO_PROCESS = 0, /* WHO is a process ID. */
|
|
||||||
#define PRIO_PROCESS PRIO_PROCESS
|
|
||||||
PRIO_PGRP = 1, /* WHO is a process group ID. */
|
|
||||||
#define PRIO_PGRP PRIO_PGRP
|
|
||||||
PRIO_USER = 2 /* WHO is a user ID. */
|
|
||||||
#define PRIO_USER PRIO_USER
|
|
||||||
};
|
|
@ -1,219 +0,0 @@
|
|||||||
/* Bit values & structures for resource limits. Linux version.
|
|
||||||
Copyright (C) 2000, 2001, 2002 Free Software Foundation, Inc.
|
|
||||||
This file is part of the GNU C Library.
|
|
||||||
|
|
||||||
The GNU C Library is free software; you can redistribute it and/or
|
|
||||||
modify it under the terms of the GNU Lesser General Public
|
|
||||||
License as published by the Free Software Foundation; either
|
|
||||||
version 2.1 of the License, or (at your option) any later version.
|
|
||||||
|
|
||||||
The GNU C Library is distributed in the hope that it will be useful,
|
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
||||||
Lesser General Public License for more details.
|
|
||||||
|
|
||||||
You should have received a copy of the GNU Lesser General Public
|
|
||||||
License along with the GNU C Library; if not, write to the Free
|
|
||||||
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
|
||||||
02111-1307 USA. */
|
|
||||||
|
|
||||||
#ifndef _SYS_RESOURCE_H
|
|
||||||
# error "Never use <bits/resource.h> directly; include <sys/resource.h> instead."
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include <bits/types.h>
|
|
||||||
#include <bits/wordsize.h>
|
|
||||||
|
|
||||||
/* Transmute defines to enumerations. The macro re-definitions are
|
|
||||||
necessary because some programs want to test for operating system
|
|
||||||
features with #ifdef RUSAGE_SELF. In ISO C the reflexive
|
|
||||||
definition is a no-op. */
|
|
||||||
|
|
||||||
/* Kinds of resource limit. */
|
|
||||||
enum __rlimit_resource
|
|
||||||
{
|
|
||||||
/* Per-process CPU limit, in seconds. */
|
|
||||||
RLIMIT_CPU = 0,
|
|
||||||
#define RLIMIT_CPU RLIMIT_CPU
|
|
||||||
|
|
||||||
/* Largest file that can be created, in bytes. */
|
|
||||||
RLIMIT_FSIZE = 1,
|
|
||||||
#define RLIMIT_FSIZE RLIMIT_FSIZE
|
|
||||||
|
|
||||||
/* Maximum size of data segment, in bytes. */
|
|
||||||
RLIMIT_DATA = 2,
|
|
||||||
#define RLIMIT_DATA RLIMIT_DATA
|
|
||||||
|
|
||||||
/* Maximum size of stack segment, in bytes. */
|
|
||||||
RLIMIT_STACK = 3,
|
|
||||||
#define RLIMIT_STACK RLIMIT_STACK
|
|
||||||
|
|
||||||
/* Largest core file that can be created, in bytes. */
|
|
||||||
RLIMIT_CORE = 4,
|
|
||||||
#define RLIMIT_CORE RLIMIT_CORE
|
|
||||||
|
|
||||||
/* Largest resident set size, in bytes.
|
|
||||||
This affects swapping; processes that are exceeding their
|
|
||||||
resident set size will be more likely to have physical memory
|
|
||||||
taken from them. */
|
|
||||||
RLIMIT_RSS = 5,
|
|
||||||
#define RLIMIT_RSS RLIMIT_RSS
|
|
||||||
|
|
||||||
/* Number of processes. */
|
|
||||||
RLIMIT_NPROC = 6,
|
|
||||||
#define RLIMIT_NPROC RLIMIT_NPROC
|
|
||||||
|
|
||||||
/* Number of open files. */
|
|
||||||
RLIMIT_NOFILE = 7,
|
|
||||||
RLIMIT_OFILE = RLIMIT_NOFILE, /* BSD name for same. */
|
|
||||||
#define RLIMIT_NOFILE RLIMIT_NOFILE
|
|
||||||
#define RLIMIT_OFILE RLIMIT_OFILE
|
|
||||||
|
|
||||||
/* Locked-in-memory address space. */
|
|
||||||
RLIMIT_MEMLOCK = 8,
|
|
||||||
#define RLIMIT_MEMLOCK RLIMIT_MEMLOCK
|
|
||||||
|
|
||||||
/* Address space limit. */
|
|
||||||
RLIMIT_AS = 9,
|
|
||||||
#define RLIMIT_AS RLIMIT_AS
|
|
||||||
|
|
||||||
/* Maximum number of file locks. */
|
|
||||||
RLIMIT_LOCKS = 10,
|
|
||||||
#define RLIMIT_LOCKS RLIMIT_LOCKS
|
|
||||||
|
|
||||||
RLIMIT_NLIMITS = 11,
|
|
||||||
RLIM_NLIMITS = RLIMIT_NLIMITS
|
|
||||||
#define RLIMIT_NLIMITS RLIMIT_NLIMITS
|
|
||||||
#define RLIM_NLIMITS RLIM_NLIMITS
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Value to indicate that there is no limit. */
|
|
||||||
#if __WORDSIZE == 64
|
|
||||||
# define RLIM_INFINITY ~0UL
|
|
||||||
#else
|
|
||||||
# ifndef __USE_FILE_OFFSET64
|
|
||||||
# define RLIM_INFINITY ((unsigned long int) (~0UL))
|
|
||||||
# else
|
|
||||||
# define RLIM_INFINITY 0xffffffffffffffffuLL
|
|
||||||
# endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
# if __WORDSIZE == 64
|
|
||||||
# define RLIM64_INFINITY ~0UL
|
|
||||||
# else
|
|
||||||
# define RLIM64_INFINITY 0xffffffffffffffffuLL
|
|
||||||
# endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* We can represent all limits. */
|
|
||||||
#define RLIM_SAVED_MAX RLIM_INFINITY
|
|
||||||
#define RLIM_SAVED_CUR RLIM_INFINITY
|
|
||||||
|
|
||||||
|
|
||||||
/* Type for resource quantity measurement. */
|
|
||||||
#if __WORDSIZE != 64 && !defined(__USE_FILE_OFFSET64)
|
|
||||||
typedef __rlim_t rlim_t;
|
|
||||||
#else
|
|
||||||
typedef __rlim64_t rlim_t;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
typedef __rlim64_t rlim64_t;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
struct rlimit
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim_t rlim_max;
|
|
||||||
};
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
struct rlimit64
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim64_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim64_t rlim_max;
|
|
||||||
};
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Whose usage statistics do you want? */
|
|
||||||
enum __rusage_who
|
|
||||||
{
|
|
||||||
/* The calling process. */
|
|
||||||
RUSAGE_SELF = 0,
|
|
||||||
#define RUSAGE_SELF RUSAGE_SELF
|
|
||||||
|
|
||||||
/* All of its terminated child processes. */
|
|
||||||
RUSAGE_CHILDREN = -1,
|
|
||||||
#define RUSAGE_CHILDREN RUSAGE_CHILDREN
|
|
||||||
|
|
||||||
/* Both. */
|
|
||||||
RUSAGE_BOTH = -2
|
|
||||||
#define RUSAGE_BOTH RUSAGE_BOTH
|
|
||||||
};
|
|
||||||
|
|
||||||
#define __need_timeval
|
|
||||||
#include <bits/time.h> /* For `struct timeval'. */
|
|
||||||
|
|
||||||
/* Structure which says how much of each resource has been used. */
|
|
||||||
struct rusage
|
|
||||||
{
|
|
||||||
/* Total amount of user time used. */
|
|
||||||
struct timeval ru_utime;
|
|
||||||
/* Total amount of system time used. */
|
|
||||||
struct timeval ru_stime;
|
|
||||||
/* Maximum resident set size (in kilobytes). */
|
|
||||||
long int ru_maxrss;
|
|
||||||
/* Amount of sharing of text segment memory
|
|
||||||
with other processes (kilobyte-seconds). */
|
|
||||||
long int ru_ixrss;
|
|
||||||
/* Amount of data segment memory used (kilobyte-seconds). */
|
|
||||||
long int ru_idrss;
|
|
||||||
/* Amount of stack memory used (kilobyte-seconds). */
|
|
||||||
long int ru_isrss;
|
|
||||||
/* Number of soft page faults (i.e. those serviced by reclaiming
|
|
||||||
a page from the list of pages awaiting reallocation. */
|
|
||||||
long int ru_minflt;
|
|
||||||
/* Number of hard page faults (i.e. those that required I/O). */
|
|
||||||
long int ru_majflt;
|
|
||||||
/* Number of times a process was swapped out of physical memory. */
|
|
||||||
long int ru_nswap;
|
|
||||||
/* Number of input operations via the file system. Note: This
|
|
||||||
and `ru_oublock' do not include operations with the cache. */
|
|
||||||
long int ru_inblock;
|
|
||||||
/* Number of output operations via the file system. */
|
|
||||||
long int ru_oublock;
|
|
||||||
/* Number of IPC messages sent. */
|
|
||||||
long int ru_msgsnd;
|
|
||||||
/* Number of IPC messages received. */
|
|
||||||
long int ru_msgrcv;
|
|
||||||
/* Number of signals delivered. */
|
|
||||||
long int ru_nsignals;
|
|
||||||
/* Number of voluntary context switches, i.e. because the process
|
|
||||||
gave up the process before it had to (usually to wait for some
|
|
||||||
resource to be available). */
|
|
||||||
long int ru_nvcsw;
|
|
||||||
/* Number of involuntary context switches, i.e. a higher priority process
|
|
||||||
became runnable or the current process used up its time slice. */
|
|
||||||
long int ru_nivcsw;
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Priority limits. */
|
|
||||||
#define PRIO_MIN -20 /* Minimum priority a process can have. */
|
|
||||||
#define PRIO_MAX 20 /* Maximum priority a process can have. */
|
|
||||||
|
|
||||||
/* The type of the WHICH argument to `getpriority' and `setpriority',
|
|
||||||
indicating what flavor of entity the WHO argument specifies. */
|
|
||||||
enum __priority_which
|
|
||||||
{
|
|
||||||
PRIO_PROCESS = 0, /* WHO is a process ID. */
|
|
||||||
#define PRIO_PROCESS PRIO_PROCESS
|
|
||||||
PRIO_PGRP = 1, /* WHO is a process group ID. */
|
|
||||||
#define PRIO_PGRP PRIO_PGRP
|
|
||||||
PRIO_USER = 2 /* WHO is a user ID. */
|
|
||||||
#define PRIO_USER PRIO_USER
|
|
||||||
};
|
|
@ -1,209 +0,0 @@
|
|||||||
/* Bit values & structures for resource limits. Linux/SH version.
|
|
||||||
Copyright (C) 1994,1996,1997,1998,1999,2000 Free Software Foundation, Inc.
|
|
||||||
This file is part of the GNU C Library.
|
|
||||||
|
|
||||||
The GNU C Library is free software; you can redistribute it and/or
|
|
||||||
modify it under the terms of the GNU Lesser General Public
|
|
||||||
License as published by the Free Software Foundation; either
|
|
||||||
version 2.1 of the License, or (at your option) any later version.
|
|
||||||
|
|
||||||
The GNU C Library is distributed in the hope that it will be useful,
|
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
||||||
Lesser General Public License for more details.
|
|
||||||
|
|
||||||
You should have received a copy of the GNU Lesser General Public
|
|
||||||
License along with the GNU C Library; if not, write to the Free
|
|
||||||
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
|
||||||
02111-1307 USA. */
|
|
||||||
|
|
||||||
#ifndef _SYS_RESOURCE_H
|
|
||||||
# error "Never use <bits/resource.h> directly; include <sys/resource.h> instead."
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include <bits/types.h>
|
|
||||||
|
|
||||||
/* Transmute defines to enumerations. The macro re-definitions are
|
|
||||||
necessary because some programs want to test for operating system
|
|
||||||
features with #ifdef RUSAGE_SELF. In ISO C the reflexive
|
|
||||||
definition is a no-op. */
|
|
||||||
|
|
||||||
/* Kinds of resource limit. */
|
|
||||||
enum __rlimit_resource
|
|
||||||
{
|
|
||||||
/* Per-process CPU limit, in seconds. */
|
|
||||||
RLIMIT_CPU = 0,
|
|
||||||
#define RLIMIT_CPU RLIMIT_CPU
|
|
||||||
|
|
||||||
/* Largest file that can be created, in bytes. */
|
|
||||||
RLIMIT_FSIZE = 1,
|
|
||||||
#define RLIMIT_FSIZE RLIMIT_FSIZE
|
|
||||||
|
|
||||||
/* Maximum size of data segment, in bytes. */
|
|
||||||
RLIMIT_DATA = 2,
|
|
||||||
#define RLIMIT_DATA RLIMIT_DATA
|
|
||||||
|
|
||||||
/* Maximum size of stack segment, in bytes. */
|
|
||||||
RLIMIT_STACK = 3,
|
|
||||||
#define RLIMIT_STACK RLIMIT_STACK
|
|
||||||
|
|
||||||
/* Largest core file that can be created, in bytes. */
|
|
||||||
RLIMIT_CORE = 4,
|
|
||||||
#define RLIMIT_CORE RLIMIT_CORE
|
|
||||||
|
|
||||||
/* Largest resident set size, in bytes.
|
|
||||||
This affects swapping; processes that are exceeding their
|
|
||||||
resident set size will be more likely to have physical memory
|
|
||||||
taken from them. */
|
|
||||||
RLIMIT_RSS = 5,
|
|
||||||
#define RLIMIT_RSS RLIMIT_RSS
|
|
||||||
|
|
||||||
/* Number of open files. */
|
|
||||||
RLIMIT_NOFILE = 7,
|
|
||||||
RLIMIT_OFILE = RLIMIT_NOFILE, /* BSD name for same. */
|
|
||||||
#define RLIMIT_NOFILE RLIMIT_NOFILE
|
|
||||||
#define RLIMIT_OFILE RLIMIT_OFILE
|
|
||||||
|
|
||||||
/* Address space limit. */
|
|
||||||
RLIMIT_AS = 9,
|
|
||||||
#define RLIMIT_AS RLIMIT_AS
|
|
||||||
|
|
||||||
/* Number of processes. */
|
|
||||||
RLIMIT_NPROC = 6,
|
|
||||||
#define RLIMIT_NPROC RLIMIT_NPROC
|
|
||||||
|
|
||||||
/* Locked-in-memory address space. */
|
|
||||||
RLIMIT_MEMLOCK = 8,
|
|
||||||
#define RLIMIT_MEMLOCK RLIMIT_MEMLOCK
|
|
||||||
|
|
||||||
/* Maximum number of file locks. */
|
|
||||||
RLIMIT_LOCKS = 10,
|
|
||||||
#define RLIMIT_LOCKS RLIMIT_LOCKS
|
|
||||||
|
|
||||||
RLIMIT_NLIMITS = 11,
|
|
||||||
RLIM_NLIMITS = RLIMIT_NLIMITS
|
|
||||||
#define RLIMIT_NLIMITS RLIMIT_NLIMITS
|
|
||||||
#define RLIM_NLIMITS RLIM_NLIMITS
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Value to indicate that there is no limit. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
# define RLIM_INFINITY ((unsigned long int)(~0UL))
|
|
||||||
#else
|
|
||||||
# define RLIM_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
# define RLIM64_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* We can represent all limits. */
|
|
||||||
#define RLIM_SAVED_MAX RLIM_INFINITY
|
|
||||||
#define RLIM_SAVED_CUR RLIM_INFINITY
|
|
||||||
|
|
||||||
|
|
||||||
/* Type for resource quantity measurement. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
typedef __rlim_t rlim_t;
|
|
||||||
#else
|
|
||||||
typedef __rlim64_t rlim_t;
|
|
||||||
#endif
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
typedef __rlim64_t rlim64_t;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
struct rlimit
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim_t rlim_max;
|
|
||||||
};
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
struct rlimit64
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim64_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim64_t rlim_max;
|
|
||||||
};
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Whose usage statistics do you want? */
|
|
||||||
enum __rusage_who
|
|
||||||
{
|
|
||||||
/* The calling process. */
|
|
||||||
RUSAGE_SELF = 0,
|
|
||||||
#define RUSAGE_SELF RUSAGE_SELF
|
|
||||||
|
|
||||||
/* All of its terminated child processes. */
|
|
||||||
RUSAGE_CHILDREN = -1,
|
|
||||||
#define RUSAGE_CHILDREN RUSAGE_CHILDREN
|
|
||||||
|
|
||||||
/* Both. */
|
|
||||||
RUSAGE_BOTH = -2
|
|
||||||
#define RUSAGE_BOTH RUSAGE_BOTH
|
|
||||||
};
|
|
||||||
|
|
||||||
#define __need_timeval
|
|
||||||
#include <bits/time.h> /* For `struct timeval'. */
|
|
||||||
|
|
||||||
/* Structure which says how much of each resource has been used. */
|
|
||||||
struct rusage
|
|
||||||
{
|
|
||||||
/* Total amount of user time used. */
|
|
||||||
struct timeval ru_utime;
|
|
||||||
/* Total amount of system time used. */
|
|
||||||
struct timeval ru_stime;
|
|
||||||
/* Maximum resident set size (in kilobytes). */
|
|
||||||
long int ru_maxrss;
|
|
||||||
/* Amount of sharing of text segment memory
|
|
||||||
with other processes (kilobyte-seconds). */
|
|
||||||
long int ru_ixrss;
|
|
||||||
/* Amount of data segment memory used (kilobyte-seconds). */
|
|
||||||
long int ru_idrss;
|
|
||||||
/* Amount of stack memory used (kilobyte-seconds). */
|
|
||||||
long int ru_isrss;
|
|
||||||
/* Number of soft page faults (i.e. those serviced by reclaiming
|
|
||||||
a page from the list of pages awaiting reallocation. */
|
|
||||||
long int ru_minflt;
|
|
||||||
/* Number of hard page faults (i.e. those that required I/O). */
|
|
||||||
long int ru_majflt;
|
|
||||||
/* Number of times a process was swapped out of physical memory. */
|
|
||||||
long int ru_nswap;
|
|
||||||
/* Number of input operations via the file system. Note: This
|
|
||||||
and `ru_oublock' do not include operations with the cache. */
|
|
||||||
long int ru_inblock;
|
|
||||||
/* Number of output operations via the file system. */
|
|
||||||
long int ru_oublock;
|
|
||||||
/* Number of IPC messages sent. */
|
|
||||||
long int ru_msgsnd;
|
|
||||||
/* Number of IPC messages received. */
|
|
||||||
long int ru_msgrcv;
|
|
||||||
/* Number of signals delivered. */
|
|
||||||
long int ru_nsignals;
|
|
||||||
/* Number of voluntary context switches, i.e. because the process
|
|
||||||
gave up the process before it had to (usually to wait for some
|
|
||||||
resource to be available). */
|
|
||||||
long int ru_nvcsw;
|
|
||||||
/* Number of involuntary context switches, i.e. a higher priority process
|
|
||||||
became runnable or the current process used up its time slice. */
|
|
||||||
long int ru_nivcsw;
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Priority limits. */
|
|
||||||
#define PRIO_MIN -20 /* Minimum priority a process can have. */
|
|
||||||
#define PRIO_MAX 20 /* Maximum priority a process can have. */
|
|
||||||
|
|
||||||
/* The type of the WHICH argument to `getpriority' and `setpriority',
|
|
||||||
indicating what flavor of entity the WHO argument specifies. */
|
|
||||||
enum __priority_which
|
|
||||||
{
|
|
||||||
PRIO_PROCESS = 0, /* WHO is a process ID. */
|
|
||||||
#define PRIO_PROCESS PRIO_PROCESS
|
|
||||||
PRIO_PGRP = 1, /* WHO is a process group ID. */
|
|
||||||
#define PRIO_PGRP PRIO_PGRP
|
|
||||||
PRIO_USER = 2 /* WHO is a user ID. */
|
|
||||||
#define PRIO_USER PRIO_USER
|
|
||||||
};
|
|
@ -1,209 +0,0 @@
|
|||||||
/* Bit values & structures for resource limits. Linux/x86-64 version.
|
|
||||||
Copyright (C) 1994,1996,1997,1998,1999,2000,2002 Free Software Foundation, Inc.
|
|
||||||
This file is part of the GNU C Library.
|
|
||||||
|
|
||||||
The GNU C Library is free software; you can redistribute it and/or
|
|
||||||
modify it under the terms of the GNU Lesser General Public
|
|
||||||
License as published by the Free Software Foundation; either
|
|
||||||
version 2.1 of the License, or (at your option) any later version.
|
|
||||||
|
|
||||||
The GNU C Library is distributed in the hope that it will be useful,
|
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
||||||
Lesser General Public License for more details.
|
|
||||||
|
|
||||||
You should have received a copy of the GNU Lesser General Public
|
|
||||||
License along with the GNU C Library; if not, write to the Free
|
|
||||||
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
|
||||||
02111-1307 USA. */
|
|
||||||
|
|
||||||
#ifndef _SYS_RESOURCE_H
|
|
||||||
# error "Never use <bits/resource.h> directly; include <sys/resource.h> instead."
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include <bits/types.h>
|
|
||||||
|
|
||||||
/* Transmute defines to enumerations. The macro re-definitions are
|
|
||||||
necessary because some programs want to test for operating system
|
|
||||||
features with #ifdef RUSAGE_SELF. In ISO C the reflexive
|
|
||||||
definition is a no-op. */
|
|
||||||
|
|
||||||
/* Kinds of resource limit. */
|
|
||||||
enum __rlimit_resource
|
|
||||||
{
|
|
||||||
/* Per-process CPU limit, in seconds. */
|
|
||||||
RLIMIT_CPU = 0,
|
|
||||||
#define RLIMIT_CPU RLIMIT_CPU
|
|
||||||
|
|
||||||
/* Largest file that can be created, in bytes. */
|
|
||||||
RLIMIT_FSIZE = 1,
|
|
||||||
#define RLIMIT_FSIZE RLIMIT_FSIZE
|
|
||||||
|
|
||||||
/* Maximum size of data segment, in bytes. */
|
|
||||||
RLIMIT_DATA = 2,
|
|
||||||
#define RLIMIT_DATA RLIMIT_DATA
|
|
||||||
|
|
||||||
/* Maximum size of stack segment, in bytes. */
|
|
||||||
RLIMIT_STACK = 3,
|
|
||||||
#define RLIMIT_STACK RLIMIT_STACK
|
|
||||||
|
|
||||||
/* Largest core file that can be created, in bytes. */
|
|
||||||
RLIMIT_CORE = 4,
|
|
||||||
#define RLIMIT_CORE RLIMIT_CORE
|
|
||||||
|
|
||||||
/* Largest resident set size, in bytes.
|
|
||||||
This affects swapping; processes that are exceeding their
|
|
||||||
resident set size will be more likely to have physical memory
|
|
||||||
taken from them. */
|
|
||||||
RLIMIT_RSS = 5,
|
|
||||||
#define RLIMIT_RSS RLIMIT_RSS
|
|
||||||
|
|
||||||
/* Number of open files. */
|
|
||||||
RLIMIT_NOFILE = 7,
|
|
||||||
RLIMIT_OFILE = RLIMIT_NOFILE, /* BSD name for same. */
|
|
||||||
#define RLIMIT_NOFILE RLIMIT_NOFILE
|
|
||||||
#define RLIMIT_OFILE RLIMIT_OFILE
|
|
||||||
|
|
||||||
/* Address space limit. */
|
|
||||||
RLIMIT_AS = 9,
|
|
||||||
#define RLIMIT_AS RLIMIT_AS
|
|
||||||
|
|
||||||
/* Number of processes. */
|
|
||||||
RLIMIT_NPROC = 6,
|
|
||||||
#define RLIMIT_NPROC RLIMIT_NPROC
|
|
||||||
|
|
||||||
/* Locked-in-memory address space. */
|
|
||||||
RLIMIT_MEMLOCK = 8,
|
|
||||||
#define RLIMIT_MEMLOCK RLIMIT_MEMLOCK
|
|
||||||
|
|
||||||
/* Maximum number of file locks. */
|
|
||||||
RLIMIT_LOCKS = 10,
|
|
||||||
#define RLIMIT_LOCKS RLIMIT_LOCKS
|
|
||||||
|
|
||||||
RLIMIT_NLIMITS = 11,
|
|
||||||
RLIM_NLIMITS = RLIMIT_NLIMITS
|
|
||||||
#define RLIMIT_NLIMITS RLIMIT_NLIMITS
|
|
||||||
#define RLIM_NLIMITS RLIM_NLIMITS
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Value to indicate that there is no limit. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
# define RLIM_INFINITY ((unsigned long int)(~0UL))
|
|
||||||
#else
|
|
||||||
# define RLIM_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
# define RLIM64_INFINITY 0xffffffffffffffffuLL
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* We can represent all limits. */
|
|
||||||
#define RLIM_SAVED_MAX RLIM_INFINITY
|
|
||||||
#define RLIM_SAVED_CUR RLIM_INFINITY
|
|
||||||
|
|
||||||
|
|
||||||
/* Type for resource quantity measurement. */
|
|
||||||
#ifndef __USE_FILE_OFFSET64
|
|
||||||
typedef __rlim_t rlim_t;
|
|
||||||
#else
|
|
||||||
typedef __rlim64_t rlim_t;
|
|
||||||
#endif
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
typedef __rlim64_t rlim64_t;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
struct rlimit
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim_t rlim_max;
|
|
||||||
};
|
|
||||||
|
|
||||||
#ifdef __USE_LARGEFILE64
|
|
||||||
struct rlimit64
|
|
||||||
{
|
|
||||||
/* The current (soft) limit. */
|
|
||||||
rlim64_t rlim_cur;
|
|
||||||
/* The hard limit. */
|
|
||||||
rlim64_t rlim_max;
|
|
||||||
};
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Whose usage statistics do you want? */
|
|
||||||
enum __rusage_who
|
|
||||||
{
|
|
||||||
/* The calling process. */
|
|
||||||
RUSAGE_SELF = 0,
|
|
||||||
#define RUSAGE_SELF RUSAGE_SELF
|
|
||||||
|
|
||||||
/* All of its terminated child processes. */
|
|
||||||
RUSAGE_CHILDREN = -1,
|
|
||||||
#define RUSAGE_CHILDREN RUSAGE_CHILDREN
|
|
||||||
|
|
||||||
/* Both. */
|
|
||||||
RUSAGE_BOTH = -2
|
|
||||||
#define RUSAGE_BOTH RUSAGE_BOTH
|
|
||||||
};
|
|
||||||
|
|
||||||
#define __need_timeval
|
|
||||||
#include <bits/time.h> /* For `struct timeval'. */
|
|
||||||
|
|
||||||
/* Structure which says how much of each resource has been used. */
|
|
||||||
struct rusage
|
|
||||||
{
|
|
||||||
/* Total amount of user time used. */
|
|
||||||
struct timeval ru_utime;
|
|
||||||
/* Total amount of system time used. */
|
|
||||||
struct timeval ru_stime;
|
|
||||||
/* Maximum resident set size (in kilobytes). */
|
|
||||||
long int ru_maxrss;
|
|
||||||
/* Amount of sharing of text segment memory
|
|
||||||
with other processes (kilobyte-seconds). */
|
|
||||||
long int ru_ixrss;
|
|
||||||
/* Amount of data segment memory used (kilobyte-seconds). */
|
|
||||||
long int ru_idrss;
|
|
||||||
/* Amount of stack memory used (kilobyte-seconds). */
|
|
||||||
long int ru_isrss;
|
|
||||||
/* Number of soft page faults (i.e. those serviced by reclaiming
|
|
||||||
a page from the list of pages awaiting reallocation. */
|
|
||||||
long int ru_minflt;
|
|
||||||
/* Number of hard page faults (i.e. those that required I/O). */
|
|
||||||
long int ru_majflt;
|
|
||||||
/* Number of times a process was swapped out of physical memory. */
|
|
||||||
long int ru_nswap;
|
|
||||||
/* Number of input operations via the file system. Note: This
|
|
||||||
and `ru_oublock' do not include operations with the cache. */
|
|
||||||
long int ru_inblock;
|
|
||||||
/* Number of output operations via the file system. */
|
|
||||||
long int ru_oublock;
|
|
||||||
/* Number of IPC messages sent. */
|
|
||||||
long int ru_msgsnd;
|
|
||||||
/* Number of IPC messages received. */
|
|
||||||
long int ru_msgrcv;
|
|
||||||
/* Number of signals delivered. */
|
|
||||||
long int ru_nsignals;
|
|
||||||
/* Number of voluntary context switches, i.e. because the process
|
|
||||||
gave up the process before it had to (usually to wait for some
|
|
||||||
resource to be available). */
|
|
||||||
long int ru_nvcsw;
|
|
||||||
/* Number of involuntary context switches, i.e. a higher priority process
|
|
||||||
became runnable or the current process used up its time slice. */
|
|
||||||
long int ru_nivcsw;
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Priority limits. */
|
|
||||||
#define PRIO_MIN -20 /* Minimum priority a process can have. */
|
|
||||||
#define PRIO_MAX 20 /* Maximum priority a process can have. */
|
|
||||||
|
|
||||||
/* The type of the WHICH argument to `getpriority' and `setpriority',
|
|
||||||
indicating what flavor of entity the WHO argument specifies. */
|
|
||||||
enum __priority_which
|
|
||||||
{
|
|
||||||
PRIO_PROCESS = 0, /* WHO is a process ID. */
|
|
||||||
#define PRIO_PROCESS PRIO_PROCESS
|
|
||||||
PRIO_PGRP = 1, /* WHO is a process group ID. */
|
|
||||||
#define PRIO_PGRP PRIO_PGRP
|
|
||||||
PRIO_USER = 2 /* WHO is a user ID. */
|
|
||||||
#define PRIO_USER PRIO_USER
|
|
||||||
};
|
|
Loading…
Reference in New Issue
Block a user