text: /*
   * Copyright (c) 2000-2008 Apple Inc. All rights reserved.
   *
   * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
   * 
   * This file contains Original Code and/or Modifications of Original Code
   * as defined in and that are subject to the Apple Public Source License
   * Version 2.0 (the 'License'). You may not use this file except in
   * compliance with the License. The rights granted to you under the License
   * may not be used to create, or enable the creation or redistribution of,
   * unlawful or unlicensed copies of an Apple operating system, or to
   * circumvent, violate, or enable the circumvention or violation of, any
   * terms of an Apple operating system software license agreement.
   * 
   * Please obtain a copy of the License at
   * http://www.opensource.apple.com/apsl/ and read it before using this file.
   * 
   * The Original Code and all software distributed under the License are
   * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
   * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
   * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
   * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
   * Please see the License for the specific language governing rights and
   * limitations under the License.
   * 
   * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
   */
  /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
  /*
   * 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.
   * 3. All advertising materials mentioning features or use of this software
   *    must display the following acknowledgement:
   *	This product includes software developed by the University of
   *	California, Berkeley and its contributors.
   * 4. Neither the name of the University nor the names of its contributors
   *    may be used to endorse or promote products derived from this software
   *    without specific prior written permission.
   *
   * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
   * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
   * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   * SUCH DAMAGE.
   *
   *	@(#)resource.h	8.2 (Berkeley) 1/4/94
   */
  
  #ifndef _SYS_RESOURCE_H_
  #define	_SYS_RESOURCE_H_
  
  #include <sys/appleapiopts.h>
  #include <sys/cdefs.h>
  #include <sys/_types.h>
  
  #include <Availability.h>
  
  /* [XSI] The timeval structure shall be defined as described in
   * <sys/time.h>
   */
  #define __need_struct_timeval
  #include <sys/_structs.h>
  
  /* The id_t type shall be defined as described in <sys/types.h> */
  #ifndef _ID_T
  #define _ID_T
  typedef __darwin_id_t	id_t;		/* can hold pid_t, gid_t, or uid_t */
  #endif
  
  
  /*
   * Resource limit type (low 63 bits, excluding the sign bit)
   */
  typedef __uint64_t	rlim_t;
  
  
  /*****
   * PRIORITY
   */
  
  /*
   * Possible values of the first parameter to getpriority()/setpriority(),
   * used to indicate the type of the second parameter.
   */
  #define	PRIO_PROCESS	0		/* Second argument is a PID */
  #define	PRIO_PGRP	1		/* Second argument is a GID */
  #define	PRIO_USER	2		/* Second argument is a UID */
  
  #if !defined(_POSIX_C_SOURCE) || defined(_DARWIN_C_SOURCE)
  #define	PRIO_DARWIN_THREAD	3		/* Second argument is always 0 (current thread) */
  #define	PRIO_DARWIN_PROCESS	4		/* Second argument is a PID */
  
  /*
   * Range limitations for the value of the third parameter to setpriority().
   */
  #define	PRIO_MIN	-20
  #define	PRIO_MAX	20
  
  /* 
   * use PRIO_DARWIN_BG to set the current thread into "background" state
   * which lowers CPU, disk IO, and networking priorites until thread terminates
   * or "background" state is revoked
   */
  #define PRIO_DARWIN_BG 0x1000
  
  /*
   * use PRIO_DARWIN_NONUI to restrict a process's ability to make calls to
   * the GPU.
   */
  #define PRIO_DARWIN_NONUI 0x1001
  
  #endif	/* (!_POSIX_C_SOURCE || _DARWIN_C_SOURCE) */
  
  
  
  /*****
   * RESOURCE USAGE
   */
  
  /*
   * Possible values of the first parameter to getrusage(), used to indicate
   * the scope of the information to be returned.
   */
  #define	RUSAGE_SELF	0		/* Current process information */
  #define	RUSAGE_CHILDREN	-1		/* Current process' children */
  
  /*
   * A structure representing an accounting of resource utilization.  The
   * address of an instance of this structure is the second parameter to
   * getrusage().
   *
   * Note: All values other than ru_utime and ru_stime are implementaiton
   *       defined and subject to change in a future release.  Their use
   *       is discouraged for standards compliant programs.
   */
  struct	rusage {
  	struct timeval ru_utime;	/* user time used (PL) */
  	struct timeval ru_stime;	/* system time used (PL) */
  #if defined(_POSIX_C_SOURCE) && !defined(_DARWIN_C_SOURCE)
  	long	ru_opaque[14];		/* implementation defined */
  #else	/* (!_POSIX_C_SOURCE || _DARWIN_C_SOURCE) */
  	/*
  	 * Informational aliases for source compatibility with programs
  	 * that need more information than that provided by standards,
  	 * and which do not mind being OS-dependent.
  	 */
  	long	ru_maxrss;		/* max resident set size (PL) */
  #define	ru_first	ru_ixrss	/* internal: ruadd() range start */
  	long	ru_ixrss;		/* integral shared memory size (NU) */
  	long	ru_idrss;		/* integral unshared data (NU)  */
  	long	ru_isrss;		/* integral unshared stack (NU) */
  	long	ru_minflt;		/* page reclaims (NU) */
  	long	ru_majflt;		/* page faults (NU) */
  	long	ru_nswap;		/* swaps (NU) */
  	long	ru_inblock;		/* block input operations (atomic) */
  	long	ru_oublock;		/* block output operations (atomic) */
  	long	ru_msgsnd;		/* messages sent (atomic) */
  	long	ru_msgrcv;		/* messages received (atomic) */
  	long	ru_nsignals;		/* signals received (atomic) */
  	long	ru_nvcsw;		/* voluntary context switches (atomic) */
  	long	ru_nivcsw;		/* involuntary " */
  #define	ru_last		ru_nivcsw	/* internal: ruadd() range end */
  #endif	/* (!_POSIX_C_SOURCE || _DARWIN_C_SOURCE) */
  };
  
  
  
  
  /*****
   * RESOURCE LIMITS
   */
  
  /*
   * Symbolic constants for resource limits; since all limits are representable
   * as a type rlim_t, we are permitted to define RLIM_SAVED_* in terms of
   * RLIM_INFINITY.
   */
  #define	RLIM_INFINITY	(((__uint64_t)1 << 63) - 1)	/* no limit */
  #define	RLIM_SAVED_MAX	RLIM_INFINITY	/* Unrepresentable hard limit */
  #define	RLIM_SAVED_CUR	RLIM_INFINITY	/* Unrepresentable soft limit */
  
  /*
   * Possible values of the first parameter to getrlimit()/setrlimit(), to
   * indicate for which resource the operation is being performed.
   */
  #define	RLIMIT_CPU	0		/* cpu time per process */
  #define	RLIMIT_FSIZE	1		/* file size */
  #define	RLIMIT_DATA	2		/* data segment size */
  #define	RLIMIT_STACK	3		/* stack size */
  #define	RLIMIT_CORE	4		/* core file size */
  #define	RLIMIT_AS	5		/* address space (resident set size) */
  #if !defined(_POSIX_C_SOURCE) || defined(_DARWIN_C_SOURCE)
  #define	RLIMIT_RSS	RLIMIT_AS	/* source compatibility alias */
  #define	RLIMIT_MEMLOCK	6		/* locked-in-memory address space */
  #define	RLIMIT_NPROC	7		/* number of processes */
  #endif	/* (!_POSIX_C_SOURCE || _DARWIN_C_SOURCE) */
  #define	RLIMIT_NOFILE	8		/* number of open files */
  #if !defined(_POSIX_C_SOURCE) || defined(_DARWIN_C_SOURCE)
  #define	RLIM_NLIMITS	9		/* total number of resource limits */
  #endif	/* (!_POSIX_C_SOURCE || _DARWIN_C_SOURCE) */
  #define _RLIMIT_POSIX_FLAG	0x1000	/* Set bit for strict POSIX */
  
  /*
   * A structure representing a resource limit.  The address of an instance
   * of this structure is the second parameter to getrlimit()/setrlimit().
   */
  struct rlimit {
  	rlim_t	rlim_cur;		/* current (soft) limit */
  	rlim_t	rlim_max;		/* maximum value for rlim_cur */
  };
  
  #if !defined(_POSIX_C_SOURCE) || defined(_DARWIN_C_SOURCE)
  /* I/O type */
  #define IOPOL_TYPE_DISK	0
  
  /* scope */
  #define IOPOL_SCOPE_PROCESS   0
  #define IOPOL_SCOPE_THREAD    1
  
  /* I/O Priority */
  #define IOPOL_DEFAULT	0
  #define IOPOL_NORMAL	1
  #define IOPOL_PASSIVE	2
  #define IOPOL_THROTTLE	3
  #define IOPOL_UTILITY	4
  
  #endif /* !_POSIX_C_SOURCE || _DARWIN_C_SOURCE */
  
  
  __BEGIN_DECLS
  int	getpriority(int, id_t);
  #if !defined(_POSIX_C_SOURCE) || defined(_DARWIN_C_SOURCE)
  int	getiopolicy_np(int, int) __OSX_AVAILABLE_STARTING(__MAC_10_5, __IPHONE_2_0);
  #endif /* !_POSIX_C_SOURCE || _DARWIN_C_SOURCE */
  int	getrlimit(int, struct rlimit *) __DARWIN_ALIAS(getrlimit);
  int	getrusage(int, struct rusage *);
  int	setpriority(int, id_t, int);
  #if !defined(_POSIX_C_SOURCE) || defined(_DARWIN_C_SOURCE)
  int	setiopolicy_np(int, int, int) __OSX_AVAILABLE_STARTING(__MAC_10_5, __IPHONE_2_0);
  #endif /* !_POSIX_C_SOURCE || _DARWIN_C_SOURCE */
  int	setrlimit(int, const struct rlimit *) __DARWIN_ALIAS(setrlimit);
  __END_DECLS
  
  #endif	/* !_SYS_RESOURCE_H_ */
  