#include <mach_kdb.h>
#include <mach/boolean.h>
#include <mach/kern_return.h>
#include <mach/port.h>
#include <kern/assert.h>
#include <kern/sched_prim.h>
#include <kern/zalloc.h>
#include <ipc/port.h>
#include <ipc/ipc_entry.h>
#include <ipc/ipc_splay.h>
#include <ipc/ipc_object.h>
#include <ipc/ipc_hash.h>
#include <ipc/ipc_table.h>
#include <ipc/ipc_port.h>
#include <ipc/ipc_space.h>
#include <ipc/ipc_right.h>
#include <string.h>
zone_t ipc_space_zone;
ipc_space_t ipc_space_kernel;
ipc_space_t ipc_space_reply;
#if MACH_KDB
ipc_space_t default_pager_space;
#endif
void
ipc_space_reference(
ipc_space_t space)
{
ipc_space_reference_macro(space);
}
void
ipc_space_release(
ipc_space_t space)
{
ipc_space_release_macro(space);
}
kern_return_t
ipc_space_create(
ipc_table_size_t initial,
ipc_space_t *spacep)
{
ipc_space_t space;
ipc_entry_t table;
ipc_entry_num_t new_size;
mach_port_index_t index;
space = is_alloc();
if (space == IS_NULL)
return KERN_RESOURCE_SHORTAGE;
table = it_entries_alloc(initial);
if (table == IE_NULL) {
is_free(space);
return KERN_RESOURCE_SHORTAGE;
}
new_size = initial->its_size;
memset((void *) table, 0, new_size * sizeof(struct ipc_entry));
for (index = 0; index < new_size; index++) {
ipc_entry_t entry = &table[index];
entry->ie_bits = IE_BITS_GEN_MASK;
entry->ie_next = index+1;
}
table[new_size-1].ie_next = 0;
is_ref_lock_init(space);
space->is_references = 2;
is_lock_init(space);
space->is_active = TRUE;
space->is_growing = FALSE;
space->is_table = table;
space->is_table_size = new_size;
space->is_table_next = initial+1;
ipc_splay_tree_init(&space->is_tree);
space->is_tree_total = 0;
space->is_tree_small = 0;
space->is_tree_hash = 0;
*spacep = space;
return KERN_SUCCESS;
}
kern_return_t
ipc_space_create_special(
ipc_space_t *spacep)
{
ipc_space_t space;
space = is_alloc();
if (space == IS_NULL)
return KERN_RESOURCE_SHORTAGE;
is_ref_lock_init(space);
space->is_references = 1;
is_lock_init(space);
space->is_active = FALSE;
*spacep = space;
return KERN_SUCCESS;
}
void
ipc_space_clean(
ipc_space_t space)
{
ipc_tree_entry_t tentry;
ipc_entry_t table;
ipc_entry_num_t size;
mach_port_index_t index;
is_write_lock(space);
while (space->is_growing) {
assert_wait((event_t) space, THREAD_UNINT);
is_write_unlock(space);
thread_block((void (*)(void)) 0);
is_write_lock(space);
}
#if MACH_KDB
if (space == default_pager_space)
default_pager_space = IS_NULL;
#endif
table = space->is_table;
size = space->is_table_size;
for (index = 0; index < size; index++) {
ipc_entry_t entry = &table[index];
mach_port_type_t type;
type = IE_BITS_TYPE(entry->ie_bits);
if (type != MACH_PORT_TYPE_NONE) {
mach_port_name_t name = MACH_PORT_MAKE(index,
IE_BITS_GEN(entry->ie_bits));
ipc_right_destroy(space, name, entry);
}
}
start_splay:
for (tentry = ipc_splay_traverse_start(&space->is_tree);
tentry != ITE_NULL;
tentry = ipc_splay_traverse_next(&space->is_tree, TRUE)) {
int i;
mach_port_type_t type;
mach_port_name_t name = tentry->ite_name;
type = IE_BITS_TYPE(tentry->ite_bits);
if(type != MACH_PORT_TYPE_NONE) {
ipc_splay_traverse_finish(&space->is_tree);
ipc_right_destroy(space, name, &tentry->ite_entry);
goto start_splay;
}
}
ipc_splay_traverse_finish(&space->is_tree);
is_write_unlock(space);
}
void
ipc_space_destroy(
ipc_space_t space)
{
boolean_t active;
ipc_tree_entry_t tentry;
ipc_entry_t table;
ipc_entry_num_t size;
mach_port_index_t index;
assert(space != IS_NULL);
is_write_lock(space);
active = space->is_active;
space->is_active = FALSE;
is_write_unlock(space);
if (!active)
return;
is_read_lock(space);
while (space->is_growing) {
assert_wait((event_t) space, THREAD_UNINT);
is_read_unlock(space);
thread_block((void (*)(void)) 0);
is_read_lock(space);
}
is_read_unlock(space);
#if MACH_KDB
if (space == default_pager_space)
default_pager_space = IS_NULL;
#endif
table = space->is_table;
size = space->is_table_size;
for (index = 0; index < size; index++) {
ipc_entry_t entry = &table[index];
mach_port_type_t type;
type = IE_BITS_TYPE(entry->ie_bits);
if (type != MACH_PORT_TYPE_NONE) {
mach_port_name_t name;
name = MACH_PORT_MAKE(index,
IE_BITS_GEN(entry->ie_bits));
ipc_right_clean(space, name, entry);
}
}
it_entries_free(space->is_table_next-1, table);
space->is_table_size = 0;
for (tentry = ipc_splay_traverse_start(&space->is_tree);
tentry != ITE_NULL;
tentry = ipc_splay_traverse_next(&space->is_tree, TRUE)) {
mach_port_type_t type;
mach_port_name_t name = tentry->ite_name;
type = IE_BITS_TYPE(tentry->ite_bits);
assert(type != MACH_PORT_TYPE_NONE);
ipc_right_clean(space, name, &tentry->ite_entry);
if(type == MACH_PORT_TYPE_SEND)
ipc_hash_global_delete(space, tentry->ite_object,
name, tentry);
}
ipc_splay_traverse_finish(&space->is_tree);
is_release(space);
}