[apple/xnu.git] / osfmk / ipc / ipc_table.c

/*
 * 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.c
 *	Author:	Rich Draves
 *	Date:	1989
 *
 *	Functions to manipulate tables of IPC capabilities.
 */

#include <mach/kern_return.h>
#include <mach/vm_param.h>
#include <ipc/ipc_table.h>
#include <ipc/ipc_port.h>
#include <ipc/ipc_entry.h>
#include <kern/kalloc.h>
#include <vm/vm_kern.h>

/*
 * Forward declarations
 */
void ipc_table_fill(
	ipc_table_size_t	its,
	unsigned int		num,
	unsigned int		min,
	vm_size_t		elemsize);

/*
 *	We borrow the kalloc map, rather than creating
 *	yet another submap of the kernel map.
 */

extern vm_map_t kalloc_map;

ipc_table_size_t ipc_table_entries;
unsigned int ipc_table_entries_size = 512;

ipc_table_size_t ipc_table_dnrequests;
unsigned int ipc_table_dnrequests_size = 64;

void
ipc_table_fill(
	ipc_table_size_t	its,	     /* array to fill */
	unsigned int		num,	     /* size of array */
	unsigned int		min,	     /* at least this many elements */
	vm_size_t		elemsize)    /* size of elements */
{
	unsigned int index;
	vm_size_t minsize = min * elemsize;
	vm_size_t size;
	vm_size_t incrsize;

	/* first use powers of two, up to the page size */

	for (index = 0, size = 1;
	     (index < num) && (size < PAGE_SIZE);
	     size <<= 1) {
		if (size >= minsize) {
			its[index].its_size = (ipc_table_elems_t)(size / elemsize);
			index++;
		}
	}

	/* then increments of a page, then two pages, etc. */

	for (incrsize = PAGE_SIZE; index < num;) {
		unsigned int period;

		for (period = 0;
		     (period < 15) && (index < num);
		     period++, size += incrsize) {
			if (size >= minsize) {
				its[index].its_size = (ipc_table_elems_t)(size / elemsize);
				index++;
			}
		}
		if (incrsize < (PAGE_SIZE << 3))
			incrsize <<= 1;
	}
}

void
ipc_table_init(void)
{
	ipc_table_entries = (ipc_table_size_t)
		kalloc(sizeof(struct ipc_table_size) *
		       ipc_table_entries_size);
	assert(ipc_table_entries != ITS_NULL);

	ipc_table_fill(ipc_table_entries, ipc_table_entries_size - 1,
		       16, sizeof(struct ipc_entry));

	/* the last two elements should have the same size */

	ipc_table_entries[ipc_table_entries_size - 1].its_size =
		ipc_table_entries[ipc_table_entries_size - 2].its_size;


	ipc_table_dnrequests = (ipc_table_size_t)
		kalloc(sizeof(struct ipc_table_size) *
		       ipc_table_dnrequests_size);
	assert(ipc_table_dnrequests != ITS_NULL);

	ipc_table_fill(ipc_table_dnrequests, ipc_table_dnrequests_size - 1,
		       2, sizeof(struct ipc_port_request));

	/* the last element should have zero size */

	ipc_table_dnrequests[ipc_table_dnrequests_size - 1].its_size = 0;
}

/*
 *	Routine:	ipc_table_alloc
 *	Purpose:
 *		Allocate a table.
 *	Conditions:
 *		May block.
 */

void *
ipc_table_alloc(
	vm_size_t	size)
{
	vm_offset_t table;

	if (size < PAGE_SIZE)
		return kalloc(size);

	if (kmem_alloc(kalloc_map, &table, size) != KERN_SUCCESS)
		table = 0;

	return (void *)table;
}

/*
 *	Routine:	ipc_table_realloc
 *	Purpose:
 *		Reallocate a big table.
 *
 *		The new table remaps the old table,
 *		so copying is not necessary.
 *	Conditions:
 *		Only works for page-size or bigger tables.
 *		May block.
 */

void *
ipc_table_realloc(
	vm_size_t	old_size,
	void *		old_table,
	vm_size_t	new_size)
{
	vm_offset_t new_table;

	if (kmem_realloc(kalloc_map,
			 (vm_offset_t) old_table, old_size,
			 &new_table, new_size) != KERN_SUCCESS)
		new_table = 0;

	return (void *)new_table;
}

/*
 *	Routine:	ipc_table_free
 *	Purpose:
 *		Free a table allocated with ipc_table_alloc or
 *		ipc_table_realloc.
 *	Conditions:
 *		May block.
 */

void
ipc_table_free(
	vm_size_t	size,
	void *		table)
{
	if (size < PAGE_SIZE)
		kfree(table, size);
	else
		kmem_free(kalloc_map, (vm_offset_t)table, size);
}
Commit	Line	Data
1c79356b	1	/*
91447636	2	* Copyright (c) 2000-2004 Apple Computer, Inc. All rights reserved.
1c79356b	3	*
2d21ac55	4	* @APPLE_OSREFERENCE_LICENSE_HEADER_START@
1c79356b	5	*
2d21ac55 A	6	* This file contains Original Code and/or Modifications of Original Code
	7	* as defined in and that are subject to the Apple Public Source License
	8	* Version 2.0 (the 'License'). You may not use this file except in
	9	* compliance with the License. The rights granted to you under the License
	10	* may not be used to create, or enable the creation or redistribution of,
	11	* unlawful or unlicensed copies of an Apple operating system, or to
	12	* circumvent, violate, or enable the circumvention or violation of, any
	13	* terms of an Apple operating system software license agreement.
8f6c56a5	14	*
2d21ac55 A	15	* Please obtain a copy of the License at
	16	* http://www.opensource.apple.com/apsl/ and read it before using this file.
	17	*
	18	* The Original Code and all software distributed under the License are
	19	* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
8f6c56a5 A	20	* EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
8f6c56a5 A	21	* INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
2d21ac55 A	22	* FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
	23	* Please see the License for the specific language governing rights and
	24	* limitations under the License.
8f6c56a5	25	*
2d21ac55	26	* @APPLE_OSREFERENCE_LICENSE_HEADER_END@
1c79356b A	27	*/
	28	/*
	29	* @OSF_COPYRIGHT@
	30	*/
1c79356b A	31	/*
	32	* Mach Operating System
	33	* Copyright (c) 1991,1990,1989 Carnegie Mellon University
	34	* All Rights Reserved.
	35	*
	36	* Permission to use, copy, modify and distribute this software and its
	37	* documentation is hereby granted, provided that both the copyright
	38	* notice and this permission notice appear in all copies of the
	39	* software, derivative works or modified versions, and any portions
	40	* thereof, and that both notices appear in supporting documentation.
	41	*
	42	* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
	43	* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
	44	* ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
	45	*
	46	* Carnegie Mellon requests users of this software to return to
	47	*
	48	* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
	49	* School of Computer Science
	50	* Carnegie Mellon University
	51	* Pittsburgh PA 15213-3890
	52	*
	53	* any improvements or extensions that they make and grant Carnegie Mellon
	54	* the rights to redistribute these changes.
	55	*/
	56	/*
	57	*/
	58	/*
	59	* File: ipc/ipc_table.c
	60	* Author: Rich Draves
	61	* Date: 1989
	62	*
	63	* Functions to manipulate tables of IPC capabilities.
	64	*/
	65
	66	#include <mach/kern_return.h>
	67	#include <mach/vm_param.h>
	68	#include <ipc/ipc_table.h>
	69	#include <ipc/ipc_port.h>
	70	#include <ipc/ipc_entry.h>
	71	#include <kern/kalloc.h>
	72	#include <vm/vm_kern.h>
	73
	74	/*
	75	* Forward declarations
	76	*/
	77	void ipc_table_fill(
	78	ipc_table_size_t its,
	79	unsigned int num,
	80	unsigned int min,
	81	vm_size_t elemsize);
	82
	83	/*
	84	* We borrow the kalloc map, rather than creating
	85	* yet another submap of the kernel map.
	86	*/
	87
	88	extern vm_map_t kalloc_map;
	89
	90	ipc_table_size_t ipc_table_entries;
	91	unsigned int ipc_table_entries_size = 512;
	92
	93	ipc_table_size_t ipc_table_dnrequests;
	94	unsigned int ipc_table_dnrequests_size = 64;
95
96	void
97	ipc_table_fill(
98	ipc_table_size_t its, /* array to fill */
99	unsigned int num, /* size of array */
100	unsigned int min, /* at least this many elements */
101	vm_size_t elemsize) /* size of elements */
102	{
103	unsigned int index;
104	vm_size_t minsize = min * elemsize;
105	vm_size_t size;
106	vm_size_t incrsize;
107
108	/* first use powers of two, up to the page size */
109
110	for (index = 0, size = 1;
111	(index < num) && (size < PAGE_SIZE);
112	size <<= 1) {
113	if (size >= minsize) {
b0d623f7	114	its[index].its_size = (ipc_table_elems_t)(size / elemsize);
1c79356b A	115	index++;
	116	}
	117	}
	118
	119	/* then increments of a page, then two pages, etc. */
	120
	121	for (incrsize = PAGE_SIZE; index < num;) {
	122	unsigned int period;
	123
	124	for (period = 0;
	125	(period < 15) && (index < num);
	126	period++, size += incrsize) {
	127	if (size >= minsize) {
b0d623f7	128	its[index].its_size = (ipc_table_elems_t)(size / elemsize);
1c79356b A	129	index++;
	130	}
	131	}
	132	if (incrsize < (PAGE_SIZE << 3))
	133	incrsize <<= 1;
	134	}
	135	}
	136
	137	void
	138	ipc_table_init(void)
	139	{
	140	ipc_table_entries = (ipc_table_size_t)
	141	kalloc(sizeof(struct ipc_table_size) *
	142	ipc_table_entries_size);
	143	assert(ipc_table_entries != ITS_NULL);
	144
	145	ipc_table_fill(ipc_table_entries, ipc_table_entries_size - 1,
765c9de3	146	16, sizeof(struct ipc_entry));
1c79356b A	147
	148	/* the last two elements should have the same size */
	149
	150	ipc_table_entries[ipc_table_entries_size - 1].its_size =
	151	ipc_table_entries[ipc_table_entries_size - 2].its_size;
	152
	153
	154	ipc_table_dnrequests = (ipc_table_size_t)
	155	kalloc(sizeof(struct ipc_table_size) *
	156	ipc_table_dnrequests_size);
	157	assert(ipc_table_dnrequests != ITS_NULL);
	158
	159	ipc_table_fill(ipc_table_dnrequests, ipc_table_dnrequests_size - 1,
	160	2, sizeof(struct ipc_port_request));
	161
	162	/* the last element should have zero size */
	163
	164	ipc_table_dnrequests[ipc_table_dnrequests_size - 1].its_size = 0;
	165	}
	166
	167	/*
	168	* Routine: ipc_table_alloc
	169	* Purpose:
	170	* Allocate a table.
	171	* Conditions:
	172	* May block.
	173	*/
	174
91447636	175	void *
1c79356b A	176	ipc_table_alloc(
	177	vm_size_t size)
	178	{
	179	vm_offset_t table;
	180
	181	if (size < PAGE_SIZE)
91447636 A	182	return kalloc(size);
	183
	184	if (kmem_alloc(kalloc_map, &table, size) != KERN_SUCCESS)
	185	table = 0;
1c79356b	186
91447636	187	return (void *)table;
1c79356b A	188	}
	189
	190	/*
	191	* Routine: ipc_table_realloc
	192	* Purpose:
	193	* Reallocate a big table.
	194	*
	195	* The new table remaps the old table,
	196	* so copying is not necessary.
	197	* Conditions:
	198	* Only works for page-size or bigger tables.
	199	* May block.
	200	*/
	201
91447636	202	void *
1c79356b A	203	ipc_table_realloc(
1c79356b A	204	vm_size_t old_size,
91447636	205	void * old_table,
1c79356b A	206	vm_size_t new_size)
	207	{
	208	vm_offset_t new_table;
	209
91447636 A	210	if (kmem_realloc(kalloc_map,
91447636 A	211	(vm_offset_t) old_table, old_size,
1c79356b A	212	&new_table, new_size) != KERN_SUCCESS)
	213	new_table = 0;
	214
91447636	215	return (void *)new_table;
1c79356b A	216	}
	217
	218	/*
	219	* Routine: ipc_table_free
	220	* Purpose:
	221	* Free a table allocated with ipc_table_alloc or
	222	* ipc_table_realloc.
	223	* Conditions:
	224	* May block.
	225	*/
	226
	227	void
	228	ipc_table_free(
	229	vm_size_t size,
91447636	230	void * table)
1c79356b A	231	{
	232	if (size < PAGE_SIZE)
	233	kfree(table, size);
	234	else
91447636	235	kmem_free(kalloc_map, (vm_offset_t)table, size);
1c79356b	236	}