Return to resource.h CVS log

Up to [Apple Darwin 0.x] / kernel / bsd / sys

Annotation of kernel/bsd/sys/resource.h, revision 1.1

1.1     ! root        1: /*
        !             2:  * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
        !             3:  *
        !             4:  * @APPLE_LICENSE_HEADER_START@
        !             5:  * 
        !             6:  * Portions Copyright (c) 1999 Apple Computer, Inc.  All Rights
        !             7:  * Reserved.  This file contains Original Code and/or Modifications of
        !             8:  * Original Code as defined in and that are subject to the Apple Public
        !             9:  * Source License Version 1.1 (the "License").  You may not use this file
        !            10:  * except in compliance with the License.  Please obtain a copy of the
        !            11:  * License at http://www.apple.com/publicsource and read it before using
        !            12:  * this file.
        !            13:  * 
        !            14:  * The Original Code and all software distributed under the License are
        !            15:  * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
        !            16:  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
        !            17:  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
        !            18:  * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT.  Please see the
        !            19:  * License for the specific language governing rights and limitations
        !            20:  * under the License.
        !            21:  * 
        !            22:  * @APPLE_LICENSE_HEADER_END@
        !            23:  */
        !            24: 
        !            25: /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
        !            26: /*
        !            27:  * Copyright (c) 1982, 1986, 1993
        !            28:  *     The Regents of the University of California.  All rights reserved.
        !            29:  *
        !            30:  * Redistribution and use in source and binary forms, with or without
        !            31:  * modification, are permitted provided that the following conditions
        !            32:  * are met:
        !            33:  * 1. Redistributions of source code must retain the above copyright
        !            34:  *    notice, this list of conditions and the following disclaimer.
        !            35:  * 2. Redistributions in binary form must reproduce the above copyright
        !            36:  *    notice, this list of conditions and the following disclaimer in the
        !            37:  *    documentation and/or other materials provided with the distribution.
        !            38:  * 3. All advertising materials mentioning features or use of this software
        !            39:  *    must display the following acknowledgement:
        !            40:  *     This product includes software developed by the University of
        !            41:  *     California, Berkeley and its contributors.
        !            42:  * 4. Neither the name of the University nor the names of its contributors
        !            43:  *    may be used to endorse or promote products derived from this software
        !            44:  *    without specific prior written permission.
        !            45:  *
        !            46:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
        !            47:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
        !            48:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
        !            49:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
        !            50:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
        !            51:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
        !            52:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
        !            53:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
        !            54:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
        !            55:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
        !            56:  * SUCH DAMAGE.
        !            57:  *
        !            58:  *     @(#)resource.h  8.4 (Berkeley) 1/9/95
        !            59:  */
        !            60: 
        !            61: #ifndef _SYS_RESOURCE_H_
        !            62: #define        _SYS_RESOURCE_H_
        !            63: 
        !            64: /*
        !            65:  * Process priority specifications to get/setpriority.
        !            66:  */
        !            67: #define        PRIO_MIN        -20
        !            68: #define        PRIO_MAX        20
        !            69: 
        !            70: #define        PRIO_PROCESS    0
        !            71: #define        PRIO_PGRP       1
        !            72: #define        PRIO_USER       2
        !            73: 
        !            74: /*
        !            75:  * Resource utilization information.
        !            76:  */
        !            77: 
        !            78: #define        RUSAGE_SELF     0
        !            79: #define        RUSAGE_CHILDREN -1
        !            80: 
        !            81: struct rusage {
        !            82:        struct timeval ru_utime;        /* user time used */
        !            83:        struct timeval ru_stime;        /* system time used */
        !            84:        long    ru_maxrss;              /* max resident set size */
        !            85: #define        ru_first        ru_ixrss
        !            86:        long    ru_ixrss;               /* integral shared memory size */
        !            87:        long    ru_idrss;               /* integral unshared data " */
        !            88:        long    ru_isrss;               /* integral unshared stack " */
        !            89:        long    ru_minflt;              /* page reclaims */
        !            90:        long    ru_majflt;              /* page faults */
        !            91:        long    ru_nswap;               /* swaps */
        !            92:        long    ru_inblock;             /* block input operations */
        !            93:        long    ru_oublock;             /* block output operations */
        !            94:        long    ru_msgsnd;              /* messages sent */
        !            95:        long    ru_msgrcv;              /* messages received */
        !            96:        long    ru_nsignals;            /* signals received */
        !            97:        long    ru_nvcsw;               /* voluntary context switches */
        !            98:        long    ru_nivcsw;              /* involuntary " */
        !            99: #define        ru_last         ru_nivcsw
        !           100: };
        !           101: 
        !           102: /*
        !           103:  * Resource limits
        !           104:  */
        !           105: #define        RLIMIT_CPU      0               /* cpu time in milliseconds */
        !           106: #define        RLIMIT_FSIZE    1               /* maximum file size */
        !           107: #define        RLIMIT_DATA     2               /* data size */
        !           108: #define        RLIMIT_STACK    3               /* stack size */
        !           109: #define        RLIMIT_CORE     4               /* core file size */
        !           110: #define        RLIMIT_RSS      5               /* resident set size */
        !           111: #define        RLIMIT_MEMLOCK  6               /* locked-in-memory address space */
        !           112: #define        RLIMIT_NPROC    7               /* number of processes */
        !           113: #define        RLIMIT_NOFILE   8               /* number of open files */
        !           114: 
        !           115: #define        RLIM_NLIMITS    9               /* number of resource limits */
        !           116: 
        !           117: #define        RLIM_INFINITY   (((u_quad_t)1 << 63) - 1)
        !           118: 
        !           119: struct orlimit {
        !           120:        int32_t rlim_cur;               /* current (soft) limit */
        !           121:        int32_t rlim_max;               /* maximum value for rlim_cur */
        !           122: };
        !           123: 
        !           124: struct rlimit {
        !           125:        rlim_t  rlim_cur;               /* current (soft) limit */
        !           126:        rlim_t  rlim_max;               /* maximum value for rlim_cur */
        !           127: };
        !           128: 
        !           129: /* Load average structure. */
        !           130: struct loadavg {
        !           131:        fixpt_t ldavg[3];
        !           132:        long    fscale;
        !           133: };
        !           134: 
        !           135: #ifdef _KERNEL
        !           136: extern struct loadavg averunnable;
        !           137: #define LSCALE 1000            /* scaling for "fixed point" arithmetic */
        !           138: #else
        !           139: #include <sys/cdefs.h>
        !           140: 
        !           141: __BEGIN_DECLS
        !           142: int    getpriority __P((int, int));
        !           143: int    getrlimit __P((int, struct rlimit *));
        !           144: int    getrusage __P((int, struct rusage *));
        !           145: int    setpriority __P((int, int, int));
        !           146: int    setrlimit __P((int, const struct rlimit *));
        !           147: __END_DECLS
        !           148: 
        !           149: #endif /* _KERNEL */
        !           150: #endif /* !_SYS_RESOURCE_H_ */

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.