1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
|
/*
* 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 <machine/vm_param.h>
#include <kern/macros.h>
#include <kern/lock.h>
#include <kern/rdxtree.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 */
struct rdxtree is_reverse_map; /* maps objects to entries */
};
#define IS_NULL ((ipc_space_t) 0)
extern struct kmem_cache ipc_space_cache;
#define is_alloc() ((ipc_space_t) kmem_cache_alloc(&ipc_space_cache))
#define is_free(is) 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 *);
/* Reverse lookups. */
/* Cast a pointer to a suitable key. */
#define KEY(X) \
({ \
assert((((unsigned long) (X)) & 0x07) == 0); \
((unsigned long long) \
(((unsigned long) (X) - VM_MIN_KERNEL_ADDRESS) >> 3)); \
})
/* Insert (OBJ, ENTRY) pair into the reverse mapping. SPACE must
be write-locked. */
static inline kern_return_t
ipc_reverse_insert(ipc_space_t space,
ipc_object_t obj,
ipc_entry_t entry)
{
assert(space != IS_NULL);
assert(obj != IO_NULL);
return (kern_return_t) rdxtree_insert(&space->is_reverse_map,
KEY(obj), entry);
}
/* Remove OBJ from the reverse mapping. SPACE must be
write-locked. */
static inline ipc_entry_t
ipc_reverse_remove(ipc_space_t space,
ipc_object_t obj)
{
assert(space != IS_NULL);
assert(obj != IO_NULL);
return rdxtree_remove(&space->is_reverse_map, KEY(obj));
}
/* Remove all entries from the reverse mapping. SPACE must be
write-locked. */
static inline void
ipc_reverse_remove_all(ipc_space_t space)
{
assert(space != IS_NULL);
rdxtree_remove_all(&space->is_reverse_map);
assert(space->is_reverse_map.height == 0);
assert(space->is_reverse_map.root == NULL);
}
/* Return ENTRY related to OBJ, or NULL if no such entry is found in
the reverse mapping. SPACE must be read-locked or
write-locked. */
static inline ipc_entry_t
ipc_reverse_lookup(ipc_space_t space,
ipc_object_t obj)
{
assert(space != IS_NULL);
assert(obj != IO_NULL);
return rdxtree_lookup(&space->is_reverse_map, KEY(obj));
}
#undef KEY
#endif /* _IPC_IPC_SPACE_H_ */
|
