123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139 |
- /*
- * 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/boolean.h>
- #include <mach/kern_return.h>
- #include <mach/mach_types.h>
- //#include <kern/macro_help.h>
- #include <kern/lock.h>
- #include <kern/slab.h>
- #include <ipc/ipc_splay.h>
- #include <ipc/ipc_types.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 */
- };
- #define IS_NULL ((ipc_space_t) 0)
- extern struct gnu_kmem_cache ipc_space_cache;
- #define is_alloc() ((ipc_space_t) gnu_kmem_cache_alloc(&ipc_space_cache))
- #define is_free(is) gnu_kmem_cache_free(&ipc_space_cache, (vm_offset_t) (is))
- extern struct ipc_space *ipc_space_kernel;
- extern struct ipc_space *ipc_space_reply;
- #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 *);
- #endif /* _IPC_IPC_SPACE_H_ */
|