Initial source

1 files changed, 164 insertions, 0 deletions

diff --git a/ipc/ipc_space.h b/ipc/ipc_space.h
new file mode 100644
index 00000000..430971f7
--- /dev/null
+++ b/ipc/ipc_space.h
@@ -0,0 +1,164 @@
+/*
+ * Mach Operating System
+ * Copyright (c) 1991,1990,1989 Carnegie Mellon University.
+ * Copyright (c) 1993,1994 The University of Utah and
+ * the Computer Systems Laboratory (CSL).
+ * 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, THE UNIVERSITY OF UTAH AND CSL ALLOW FREE USE OF
+ * THIS SOFTWARE IN ITS "AS IS" CONDITION, AND DISCLAIM 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_space.h
+ *	Author:	Rich Draves
+ *	Date:	1989
+ *
+ *	Definitions for IPC spaces of capabilities.
+ */
+
+#ifndef	_IPC_IPC_SPACE_H_
+#define _IPC_IPC_SPACE_H_
+
+#include <mach_ipc_compat.h>
+#include <norma_ipc.h>
+
+#include <mach/boolean.h>
+#include <mach/kern_return.h>
+#include <kern/macro_help.h>
+#include <kern/lock.h>
+#include <ipc/ipc_splay.h>
+
+/*
+ *	Every task has a space of IPC capabilities.
+ *	IPC operations like send and receive use this space.
+ *	IPC kernel calls manipulate the space of the target task.
+ *
+ *	Every space has a non-NULL is_table with is_table_size entries.
+ *	A space may have a NULL is_tree.  is_tree_small records the
+ *	number of entries in the tree that, if the table were to grow
+ *	to the next larger size, would move from the tree to the table.
+ *
+ *	is_growing marks when the table is in the process of growing.
+ *	When the table is growing, it can't be freed or grown by another
+ *	thread, because of krealloc/kmem_realloc's requirements.
+ */
+
+typedef unsigned int ipc_space_refs_t;
+
+struct ipc_space {
+	decl_simple_lock_data(,is_ref_lock_data)
+	ipc_space_refs_t is_references;
+
+	decl_simple_lock_data(,is_lock_data)
+	boolean_t is_active;		/* is the space alive? */
+	boolean_t is_growing;		/* is the space growing? */
+	ipc_entry_t is_table;		/* an array of entries */
+	ipc_entry_num_t is_table_size;	/* current size of table */
+	struct ipc_table_size *is_table_next; /* info for larger table */
+	struct ipc_splay_tree is_tree;	/* a splay tree of entries */
+	ipc_entry_num_t is_tree_total;	/* number of entries in the tree */
+	ipc_entry_num_t is_tree_small;	/* # of small entries in the tree */
+	ipc_entry_num_t is_tree_hash;	/* # of hashed entries in the tree */
+
+#if	MACH_IPC_COMPAT
+	struct ipc_port *is_notify;	/* notification port */
+#endif	MACH_IPC_COMPAT
+};
+
+#define	IS_NULL			((ipc_space_t) 0)
+
+extern zone_t ipc_space_zone;
+
+#define is_alloc()		((ipc_space_t) zalloc(ipc_space_zone))
+#define	is_free(is)		zfree(ipc_space_zone, (vm_offset_t) (is))
+
+extern struct ipc_space *ipc_space_kernel;
+extern struct ipc_space *ipc_space_reply;
+#if	NORMA_IPC
+extern struct ipc_space *ipc_space_remote;
+#endif	NORMA_IPC
+
+#define	is_ref_lock_init(is)	simple_lock_init(&(is)->is_ref_lock_data)
+
+#define	ipc_space_reference_macro(is)					\
+MACRO_BEGIN								\
+	simple_lock(&(is)->is_ref_lock_data);				\
+	assert((is)->is_references > 0);				\
+	(is)->is_references++;						\
+	simple_unlock(&(is)->is_ref_lock_data);				\
+MACRO_END
+
+#define	ipc_space_release_macro(is)					\
+MACRO_BEGIN								\
+	ipc_space_refs_t _refs;						\
+									\
+	simple_lock(&(is)->is_ref_lock_data);				\
+	assert((is)->is_references > 0);				\
+	_refs = --(is)->is_references;					\
+	simple_unlock(&(is)->is_ref_lock_data);				\
+									\
+	if (_refs == 0)							\
+		is_free(is);						\
+MACRO_END
+
+#define	is_lock_init(is)	simple_lock_init(&(is)->is_lock_data)
+
+#define	is_read_lock(is)	simple_lock(&(is)->is_lock_data)
+#define is_read_unlock(is)	simple_unlock(&(is)->is_lock_data)
+
+#define	is_write_lock(is)	simple_lock(&(is)->is_lock_data)
+#define	is_write_lock_try(is)	simple_lock_try(&(is)->is_lock_data)
+#define is_write_unlock(is)	simple_unlock(&(is)->is_lock_data)
+
+#define	is_write_to_read_lock(is)
+
+extern void ipc_space_reference(struct ipc_space *space);
+extern void ipc_space_release(struct ipc_space *space);
+
+#define	is_reference(is)	ipc_space_reference(is)
+#define	is_release(is)		ipc_space_release(is)
+
+kern_return_t	ipc_space_create(/* ipc_table_size_t, ipc_space_t * */);
+kern_return_t	ipc_space_create_special(struct ipc_space **);
+void		ipc_space_destroy(struct ipc_space *);
+
+#if	MACH_IPC_COMPAT
+
+/*
+ *	Routine:	ipc_space_make_notify
+ *	Purpose:
+ *		Given a space, return a send right for a notification.
+ *		May return IP_NULL/IP_DEAD.
+ *	Conditions:
+ *		The space is locked (read or write) and active.
+ *
+ *	ipc_port_t
+ *	ipc_space_make_notify(space)
+ *		ipc_space_t space;
+ */
+
+#define	ipc_space_make_notify(space)	\
+		ipc_port_copy_send(space->is_notify)
+
+#endif	MACH_IPC_COMPAT
+#endif	_IPC_IPC_SPACE_H_