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
|
/*
* 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_entry.h
* Author: Rich Draves
* Date: 1989
*
* Definitions for translation entries, which represent
* tasks' capabilities for ports and port sets.
*/
#ifndef _IPC_IPC_ENTRY_H_
#define _IPC_IPC_ENTRY_H_
#include <mach/mach_types.h>
#include <mach/port.h>
#include <mach/kern_return.h>
#include <kern/slab.h>
#include <ipc/port.h>
#include <ipc/ipc_table.h>
#include <ipc/ipc_types.h>
/*
* Spaces hold capabilities for ipc_object_t's (ports and port sets).
* Each ipc_entry_t records a capability. Most capabilities have
* small names, and the entries are elements of a table.
* Capabilities can have large names, and a splay tree holds
* those entries. The cutoff point between the table and the tree
* is adjusted dynamically to minimize memory consumption.
*
* Free (unallocated) entries in the table have null ie_object
* fields. The ie_bits field is zero except for IE_BITS_GEN.
* The ie_next (ie_request) field links free entries into a free list.
*
* The first entry in the table (index 0) is always free.
* It is used as the head of the free list.
*/
typedef unsigned int ipc_entry_bits_t;
typedef ipc_table_elems_t ipc_entry_num_t; /* number of entries */
typedef struct ipc_entry {
ipc_entry_bits_t ie_bits;
struct ipc_object *ie_object;
union {
mach_port_index_t next;
/*XXX ipc_port_request_index_t request;*/
unsigned int request;
} index;
union {
mach_port_index_t table;
struct ipc_tree_entry *tree;
} hash;
} *ipc_entry_t;
#define IE_NULL ((ipc_entry_t) 0)
#define ie_request index.request
#define ie_next index.next
#define ie_index hash.table
#define IE_BITS_UREFS_MASK 0x0000ffff /* 16 bits of user-reference */
#define IE_BITS_UREFS(bits) ((bits) & IE_BITS_UREFS_MASK)
#define IE_BITS_TYPE_MASK 0x001f0000 /* 5 bits of capability type */
#define IE_BITS_TYPE(bits) ((bits) & IE_BITS_TYPE_MASK)
#define IE_BITS_MAREQUEST 0x00200000 /* 1 bit for msg-accepted */
#define IE_BITS_COMPAT 0x00400000 /* 1 bit for compatibility */
#define IE_BITS_COLLISION 0x00800000 /* 1 bit for collisions */
#define IE_BITS_RIGHT_MASK 0x007fffff /* relevant to the right */
#if PORT_GENERATIONS
#define IE_BITS_GEN_MASK 0xff000000U /* 8 bits for generation */
#define IE_BITS_GEN(bits) ((bits) & IE_BITS_GEN_MASK)
#define IE_BITS_GEN_ONE 0x01000000 /* low bit of generation */
#else
#define IE_BITS_GEN_MASK 0
#define IE_BITS_GEN(bits) 0
#define IE_BITS_GEN_ONE 0
#endif
typedef struct ipc_tree_entry {
struct ipc_entry ite_entry;
mach_port_t ite_name;
struct ipc_space *ite_space;
struct ipc_tree_entry *ite_lchild;
struct ipc_tree_entry *ite_rchild;
} *ipc_tree_entry_t;
#define ITE_NULL ((ipc_tree_entry_t) 0)
#define ite_bits ite_entry.ie_bits
#define ite_object ite_entry.ie_object
#define ite_request ite_entry.ie_request
#define ite_next ite_entry.hash.tree
extern struct kmem_cache ipc_tree_entry_cache;
#define ite_alloc() ((ipc_tree_entry_t) kmem_cache_alloc(&ipc_tree_entry_cache))
#define ite_free(ite) kmem_cache_free(&ipc_tree_entry_cache, (vm_offset_t) (ite))
extern ipc_entry_t
ipc_entry_lookup(ipc_space_t space, mach_port_t name);
extern kern_return_t
ipc_entry_get(ipc_space_t space, mach_port_t *namep, ipc_entry_t *entryp);
extern kern_return_t
ipc_entry_alloc(ipc_space_t space, mach_port_t *namep, ipc_entry_t *entryp);
extern kern_return_t
ipc_entry_alloc_name(ipc_space_t space, mach_port_t name, ipc_entry_t *entryp);
extern void
ipc_entry_dealloc(ipc_space_t space, mach_port_t name, ipc_entry_t entry);
extern kern_return_t
ipc_entry_grow_table(ipc_space_t space);
ipc_entry_t
db_ipc_object_by_name(
task_t task,
mach_port_t name);
#endif /* _IPC_IPC_ENTRY_H_ */
|
