|
|
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: /* ! 26: * Mach Operating System ! 27: * Copyright (c) 1992,1991,1990,1989,1988,1987 Carnegie Mellon University ! 28: * All Rights Reserved. ! 29: * ! 30: * Permission to use, copy, modify and distribute this software and its ! 31: * documentation is hereby granted, provided that both the copyright ! 32: * notice and this permission notice appear in all copies of the ! 33: * software, derivative works or modified versions, and any portions ! 34: * thereof, and that both notices appear in supporting documentation. ! 35: * ! 36: * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" ! 37: * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR ! 38: * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. ! 39: * ! 40: * Carnegie Mellon requests users of this software to return to ! 41: * ! 42: * Software Distribution Coordinator or [email protected] ! 43: * School of Computer Science ! 44: * Carnegie Mellon University ! 45: * Pittsburgh PA 15213-3890 ! 46: * ! 47: * any improvements or extensions that they make and grant Carnegie Mellon ! 48: * the rights to redistribute these changes. ! 49: */ ! 50: /* ! 51: * File: mach/vm_statistics.h ! 52: * Author: Avadis Tevanian, Jr., Michael Wayne Young, David Golub ! 53: * ! 54: * Virtual memory statistics structure. ! 55: * ! 56: */ ! 57: ! 58: #ifndef _MACH_VM_STATISTICS_H_ ! 59: #define _MACH_VM_STATISTICS_H_ ! 60: ! 61: #import <mach/machine/vm_types.h> ! 62: ! 63: struct vm_statistics { ! 64: integer_t pagesize; /* page size in bytes */ ! 65: integer_t free_count; /* # of pages free */ ! 66: integer_t active_count; /* # of pages active */ ! 67: integer_t inactive_count; /* # of pages inactive */ ! 68: integer_t wire_count; /* # of pages wired down */ ! 69: integer_t zero_fill_count; /* # of zero fill pages */ ! 70: integer_t reactivations; /* # of pages reactivated */ ! 71: integer_t pageins; /* # of pageins */ ! 72: integer_t pageouts; /* # of pageouts */ ! 73: integer_t faults; /* # of faults */ ! 74: integer_t cow_faults; /* # of copy-on-writes */ ! 75: integer_t lookups; /* object cache lookups */ ! 76: integer_t hits; /* object cache hits */ ! 77: }; ! 78: ! 79: typedef struct vm_statistics *vm_statistics_t; ! 80: typedef struct vm_statistics vm_statistics_data_t; ! 81: ! 82: #ifdef KERNEL ! 83: extern vm_statistics_data_t vm_stat; ! 84: #endif /* KERNEL */ ! 85: ! 86: /* ! 87: * Each machine dependent implementation is expected to ! 88: * keep certain statistics. They may do this anyway they ! 89: * so choose, but are expected to return the statistics ! 90: * in the following structure. ! 91: */ ! 92: ! 93: struct pmap_statistics { ! 94: integer_t resident_count; /* # of pages mapped (total)*/ ! 95: integer_t wired_count; /* # of pages wired */ ! 96: }; ! 97: ! 98: typedef struct pmap_statistics *pmap_statistics_t; ! 99: #endif /* _MACH_VM_STATISTICS_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.