|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved. ! 3: * ! 4: * @APPLE_LICENSE_HEADER_START@ ! 5: * ! 6: * The contents of this file constitute Original Code as defined in and ! 7: * are subject to the Apple Public Source License Version 1.1 (the ! 8: * "License"). You may not use this file except in compliance with the ! 9: * License. Please obtain a copy of the License at ! 10: * http://www.apple.com/publicsource and read it before using this file. ! 11: * ! 12: * This Original Code and all software distributed under the License are ! 13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER ! 14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, ! 15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, ! 16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the ! 17: * License for the specific language governing rights and limitations ! 18: * under the License. ! 19: * ! 20: * @APPLE_LICENSE_HEADER_END@ ! 21: */ ! 22: /* ! 23: * @OSF_COPYRIGHT@ ! 24: * ! 25: */ ! 26: ! 27: #ifndef _VM_CPM_H_ ! 28: #define _VM_CPM_H_ ! 29: ! 30: /* ! 31: * File: vm/cpm.h ! 32: * Author: Alan Langerman ! 33: * Date: April 1995 and January 1996 ! 34: * ! 35: * Contiguous physical memory allocator. ! 36: */ ! 37: ! 38: #include <mach_kdb.h> ! 39: #include <mach_counters.h> ! 40: ! 41: /* ! 42: * Return a linked list of physically contiguous ! 43: * wired pages. Caller is responsible for disposal ! 44: * via cpm_release. ! 45: * ! 46: * These pages are all in "gobbled" state when . ! 47: */ ! 48: extern kern_return_t ! 49: cpm_allocate(vm_size_t size, vm_page_t *list, boolean_t wire); ! 50: ! 51: /* ! 52: * CPM-specific event counters. ! 53: */ ! 54: #define VM_CPM_COUNTERS (MACH_KDB && MACH_COUNTERS && VM_CPM) ! 55: #if VM_CPM_COUNTERS ! 56: #define cpm_counter(foo) foo ! 57: #else /* VM_CPM_COUNTERS */ ! 58: #define cpm_counter(foo) ! 59: #endif /* VM_CPM_COUNTERS */ ! 60: ! 61: #endif /* _VM_CPM_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.