* 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
* 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,
* 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.
*/
void
ipc_space_reference(
- ipc_space_t space)
+ ipc_space_t space)
{
is_reference(space);
}
void
ipc_space_release(
- ipc_space_t space)
+ ipc_space_t space)
{
is_release(space);
}
-/* Routine: ipc_space_get_rollpoint
- * Purpose:
- * Generate a new gencount rollover point from a space's entropy pool
+/* Routine: ipc_space_get_rollpoint
+ * Purpose:
+ * Generate a new gencount rollover point from a space's entropy pool
*/
ipc_entry_bits_t
ipc_space_get_rollpoint(
- ipc_space_t space)
+ ipc_space_t space)
{
return random_bool_gen_bits(
- &space->bool_gen,
- &space->is_entropy[0],
- IS_ENTROPY_CNT,
- IE_BITS_ROLL_BITS);
+ &space->bool_gen,
+ &space->is_entropy[0],
+ IS_ENTROPY_CNT,
+ IE_BITS_ROLL_BITS);
}
/*
*/
void
ipc_space_rand_freelist(
- ipc_space_t space,
- ipc_entry_t table,
- mach_port_index_t bottom,
- mach_port_index_t top)
+ ipc_space_t space,
+ ipc_entry_t table,
+ mach_port_index_t bottom,
+ mach_port_index_t top)
{
int at_start = (bottom == 0);
#ifdef CONFIG_SEMI_RANDOM_ENTRIES
* doesn't break programs that might have (sad) hard-coded values for
* certain port names.
*/
- if (at_start && total++ < NUM_SEQ_ENTRIES)
+ if (at_start && total++ < NUM_SEQ_ENTRIES) {
which = 0;
- else
+ } else
#endif
- which = random_bool_gen_bits(
- &space->bool_gen,
- &space->is_entropy[0],
- IS_ENTROPY_CNT,
- 1);
+ which = random_bool_gen_bits(
+ &space->bool_gen,
+ &space->is_entropy[0],
+ IS_ENTROPY_CNT,
+ 1);
mach_port_index_t next;
if (which) {
* The entry's gencount will roll over on its first allocation, at which
* point a random rollover will be set for the entry.
*/
- entry->ie_bits = IE_BITS_GEN_MASK;
+ entry->ie_bits = IE_BITS_GEN_MASK;
entry->ie_next = next;
entry->ie_object = IO_NULL;
+ entry->ie_dist = 0;
entry->ie_index = 0;
curr = next;
}
table[curr].ie_next = 0;
table[curr].ie_object = IO_NULL;
table[curr].ie_index = 0;
+ table[curr].ie_dist = 0;
table[curr].ie_bits = IE_BITS_GEN_MASK;
/* The freelist head should always have generation number set to 0 */
kern_return_t
ipc_space_create(
- ipc_table_size_t initial,
- ipc_space_t *spacep)
+ ipc_table_size_t initial,
+ ipc_space_t *spacep)
{
ipc_space_t space;
ipc_entry_t table;
ipc_entry_num_t new_size;
space = is_alloc();
- if (space == IS_NULL)
+ if (space == IS_NULL) {
return KERN_RESOURCE_SHORTAGE;
+ }
table = it_entries_alloc(initial);
if (table == IE_NULL) {
is_lock_init(space);
space->is_bits = 2; /* 2 refs, active, not growing */
+ space->is_table_hashed = 0;
space->is_table_size = new_size;
space->is_table_free = new_size - 1;
space->is_table = table;
- space->is_table_next = initial+1;
+ space->is_table_next = initial + 1;
space->is_task = NULL;
space->is_low_mod = new_size;
space->is_high_mod = 0;
kern_return_t
ipc_space_create_special(
- ipc_space_t *spacep)
+ ipc_space_t *spacep)
{
ipc_space_t space;
space = is_alloc();
- if (space == IS_NULL)
+ if (space == IS_NULL) {
return KERN_RESOURCE_SHORTAGE;
+ }
is_lock_init(space);
* we must wait until they finish and figure
* out the space died.
*/
- retry:
+retry:
is_write_lock(space);
- while (is_growing(space))
+ while (is_growing(space)) {
is_write_sleep(space);
+ }
if (!is_active(space)) {
is_write_unlock(space);
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));
+ mach_port_name_t name = MACH_PORT_MAKE(index,
+ IE_BITS_GEN(entry->ie_bits));
ipc_right_destroy(space, name, entry, FALSE, 0); /* unlocks space */
goto retry;
}
}
- /*
+ /*
* JMM - Now the table is cleaned out. We don't bother shrinking the
* size of the table at this point, but we probably should if it is
* really large.
*/
-
+
is_write_unlock(space);
}
void
ipc_space_terminate(
- ipc_space_t space)
+ ipc_space_t space)
{
ipc_entry_t table;
ipc_entry_num_t size;
* we must wait until they finish and figure
* out the space died.
*/
- while (is_growing(space))
+ while (is_growing(space)) {
is_write_sleep(space);
+ }
is_write_unlock(space);
mach_port_name_t name;
name = MACH_PORT_MAKE(index,
- IE_BITS_GEN(entry->ie_bits));
+ IE_BITS_GEN(entry->ie_bits));
ipc_right_terminate(space, name, entry);
}
}
- it_entries_free(space->is_table_next-1, table);
+ it_entries_free(space->is_table_next - 1, table);
space->is_table_size = 0;
space->is_table_free = 0;
*/
is_release(space);
}
-
-