/* * Copyright (c) 2000-2004 Apple Computer, 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@ */ /* * @OSF_COPYRIGHT@ */ /* * Mach Operating System * Copyright (c) 1991,1990,1989 Carnegie Mellon University * All Rights Reserved. * * Permission to use, copy, modify and distribute this software and its * documentation is hereby granted, provided that both the copyright * notice and this permission notice appear in all copies of the * software, derivative works or modified versions, and any portions * thereof, and that both notices appear in supporting documentation. * * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. * * Carnegie Mellon requests users of this software to return to * * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU * School of Computer Science * Carnegie Mellon University * Pittsburgh PA 15213-3890 * * any improvements or extensions that they make and grant Carnegie Mellon * the rights to redistribute these changes. */ /* */ /* * File: ipc/ipc_table.h * Author: Rich Draves * Date: 1989 * * Definitions for tables, used for IPC capabilities (ipc_entry_t) * and dead-name requests (ipc_port_request_t). */ #ifndef _IPC_IPC_TABLE_H_ #define _IPC_IPC_TABLE_H_ #include <mach/mach_types.h> #include <mach/boolean.h> #include <mach/vm_param.h> #include <ipc/ipc_types.h> /* * The is_table_next field of an ipc_space_t points to * an ipc_table_size structure. These structures must * be elements of an array, ipc_table_entries. * * The array must end with two elements with the same its_size value. * Except for the terminating element, the its_size values must * be strictly increasing. The largest (last) its_size value * must be less than or equal to MACH_PORT_INDEX(MACH_PORT_DEAD). * This ensures that * 1) MACH_PORT_INDEX(MACH_PORT_DEAD) isn't a valid index * in the table, so ipc_entry_get won't allocate it. * 2) MACH_PORT_MAKE(index+1, 0) and MAKE_PORT_MAKE(size, 0) * won't ever overflow. * * * The ipr_size field of the first element in a table of * dead-name requests (ipc_port_request_t) points to the * ipc_table_size structure. The structures must be elements * of ipc_table_dnrequests. ipc_table_dnrequests must end * with an element with zero its_size, and except for this last * element, the its_size values must be strictly increasing. * * The is_table_next field points to the ipc_table_size structure * for the next larger size of table, not the one currently in use. * The ipr_size field points to the currently used ipc_table_size. */ struct ipc_table_size { ipc_table_elems_t its_size; /* number of elements in table */ }; extern ipc_table_size_t ipc_table_entries; extern ipc_table_size_t ipc_table_dnrequests; /* Initialize IPC capabilities table storage */ extern void ipc_table_init(void) __attribute__((section("__TEXT, initcode"))); /* * Note that ipc_table_alloc, ipc_table_realloc, and ipc_table_free * all potentially use the VM system. Hence simple locks can't * be held across them. * * We can't use a copying realloc, because the realloc happens * with the data unlocked. ipc_table_realloc remaps the data, * so it is OK. */ /* Allocate a table */ extern void * ipc_table_alloc( vm_size_t size); /* Reallocate a big table */ extern void * ipc_table_realloc( vm_size_t old_size, void * old_table, vm_size_t new_size); /* Free a table */ extern void ipc_table_free( vm_size_t size, void * table); #define it_entries_reallocable(its) \ ((its)->its_size * sizeof(struct ipc_entry) >= PAGE_SIZE) #define it_entries_alloc(its) \ ((ipc_entry_t) \ ipc_table_alloc(it_entries_reallocable(its) ? \ round_page((its)->its_size * sizeof(struct ipc_entry)) : \ (its)->its_size * sizeof(struct ipc_entry) \ )) #define it_entries_realloc(its, table, nits) \ ((ipc_entry_t) \ ipc_table_realloc( \ round_page((its)->its_size * sizeof(struct ipc_entry)), \ (void *)(table), \ round_page((nits)->its_size * sizeof(struct ipc_entry)) \ )) #define it_entries_free(its, table) \ ipc_table_free(it_entries_reallocable(its) ? \ round_page((its)->its_size * sizeof(struct ipc_entry)) : \ (its)->its_size * sizeof(struct ipc_entry), \ (void *)(table) \ ) #define it_dnrequests_alloc(its) \ ((ipc_port_request_t) \ ipc_table_alloc((its)->its_size * \ sizeof(struct ipc_port_request))) #define it_dnrequests_free(its, table) \ ipc_table_free((its)->its_size * \ sizeof(struct ipc_port_request), \ (void *)(table)) #endif /* _IPC_IPC_TABLE_H_ */