Rev 2601 | Rev 2623 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2601 | Rev 2622 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2006 Ondrej Palkovsky |
2 | * Copyright (c) 2006 Ondrej Palkovsky |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
13 | * documentation and/or other materials provided with the distribution. |
14 | * - The name of the author may not be used to endorse or promote products |
14 | * - The name of the author may not be used to endorse or promote products |
15 | * derived from this software without specific prior written permission. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup genericipc |
29 | /** @addtogroup genericipc |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | /** @file |
32 | /** @file |
33 | */ |
33 | */ |
34 | 34 | ||
35 | /* Lock ordering |
35 | /* Lock ordering |
36 | * |
36 | * |
37 | * First the answerbox, then the phone. |
37 | * First the answerbox, then the phone. |
38 | */ |
38 | */ |
39 | 39 | ||
40 | #include <synch/spinlock.h> |
40 | #include <synch/spinlock.h> |
41 | #include <synch/waitq.h> |
41 | #include <synch/waitq.h> |
42 | #include <synch/synch.h> |
42 | #include <synch/synch.h> |
43 | #include <ipc/ipc.h> |
43 | #include <ipc/ipc.h> |
44 | #include <errno.h> |
44 | #include <errno.h> |
45 | #include <mm/slab.h> |
45 | #include <mm/slab.h> |
46 | #include <arch.h> |
46 | #include <arch.h> |
47 | #include <proc/task.h> |
47 | #include <proc/task.h> |
48 | #include <memstr.h> |
48 | #include <memstr.h> |
49 | #include <debug.h> |
49 | #include <debug.h> |
50 | 50 | ||
51 | #include <print.h> |
51 | #include <print.h> |
52 | #include <proc/thread.h> |
52 | #include <proc/thread.h> |
53 | #include <arch/interrupt.h> |
53 | #include <arch/interrupt.h> |
54 | #include <ipc/irq.h> |
54 | #include <ipc/irq.h> |
55 | 55 | ||
56 | /** Open channel that is assigned automatically to new tasks */ |
56 | /** Open channel that is assigned automatically to new tasks */ |
57 | answerbox_t *ipc_phone_0 = NULL; |
57 | answerbox_t *ipc_phone_0 = NULL; |
58 | 58 | ||
59 | static slab_cache_t *ipc_call_slab; |
59 | static slab_cache_t *ipc_call_slab; |
60 | 60 | ||
61 | /** Initialize a call structure. |
61 | /** Initialize a call structure. |
62 | * |
62 | * |
63 | * @param call Call structure to be initialized. |
63 | * @param call Call structure to be initialized. |
64 | */ |
64 | */ |
65 | static void _ipc_call_init(call_t *call) |
65 | static void _ipc_call_init(call_t *call) |
66 | { |
66 | { |
67 | memsetb((uintptr_t) call, sizeof(*call), 0); |
67 | memsetb((uintptr_t) call, sizeof(*call), 0); |
68 | call->callerbox = &TASK->answerbox; |
68 | call->callerbox = &TASK->answerbox; |
69 | call->sender = TASK; |
69 | call->sender = TASK; |
70 | call->buffer = NULL; |
70 | call->buffer = NULL; |
71 | } |
71 | } |
72 | 72 | ||
73 | /** Allocate and initialize a call structure. |
73 | /** Allocate and initialize a call structure. |
74 | * |
74 | * |
75 | * The call is initialized, so that the reply will be directed to |
75 | * The call is initialized, so that the reply will be directed to |
76 | * TASK->answerbox. |
76 | * TASK->answerbox. |
77 | * |
77 | * |
78 | * @param flags Parameters for slab_alloc (e.g FRAME_ATOMIC). |
78 | * @param flags Parameters for slab_alloc (e.g FRAME_ATOMIC). |
79 | * |
79 | * |
80 | * @return If flags permit it, return NULL, or initialized kernel |
80 | * @return If flags permit it, return NULL, or initialized kernel |
81 | * call structure. |
81 | * call structure. |
82 | */ |
82 | */ |
83 | call_t *ipc_call_alloc(int flags) |
83 | call_t *ipc_call_alloc(int flags) |
84 | { |
84 | { |
85 | call_t *call; |
85 | call_t *call; |
86 | 86 | ||
87 | call = slab_alloc(ipc_call_slab, flags); |
87 | call = slab_alloc(ipc_call_slab, flags); |
88 | _ipc_call_init(call); |
88 | _ipc_call_init(call); |
89 | 89 | ||
90 | return call; |
90 | return call; |
91 | } |
91 | } |
92 | 92 | ||
93 | /** Initialize a statically allocated call structure. |
93 | /** Initialize a statically allocated call structure. |
94 | * |
94 | * |
95 | * @param call Statically allocated kernel call structure to be |
95 | * @param call Statically allocated kernel call structure to be |
96 | * initialized. |
96 | * initialized. |
97 | */ |
97 | */ |
98 | void ipc_call_static_init(call_t *call) |
98 | void ipc_call_static_init(call_t *call) |
99 | { |
99 | { |
100 | _ipc_call_init(call); |
100 | _ipc_call_init(call); |
101 | call->flags |= IPC_CALL_STATIC_ALLOC; |
101 | call->flags |= IPC_CALL_STATIC_ALLOC; |
102 | } |
102 | } |
103 | 103 | ||
104 | /** Deallocate a call structure. |
104 | /** Deallocate a call structure. |
105 | * |
105 | * |
106 | * @param call Call structure to be freed. |
106 | * @param call Call structure to be freed. |
107 | */ |
107 | */ |
108 | void ipc_call_free(call_t *call) |
108 | void ipc_call_free(call_t *call) |
109 | { |
109 | { |
110 | ASSERT(!(call->flags & IPC_CALL_STATIC_ALLOC)); |
110 | ASSERT(!(call->flags & IPC_CALL_STATIC_ALLOC)); |
111 | /* Check to see if we have data in the IPC_M_DATA_SEND buffer. */ |
111 | /* Check to see if we have data in the IPC_M_DATA_SEND buffer. */ |
112 | if (call->buffer) |
112 | if (call->buffer) |
113 | free(call->buffer); |
113 | free(call->buffer); |
114 | slab_free(ipc_call_slab, call); |
114 | slab_free(ipc_call_slab, call); |
115 | } |
115 | } |
116 | 116 | ||
117 | /** Initialize an answerbox structure. |
117 | /** Initialize an answerbox structure. |
118 | * |
118 | * |
119 | * @param box Answerbox structure to be initialized. |
119 | * @param box Answerbox structure to be initialized. |
120 | */ |
120 | */ |
121 | void ipc_answerbox_init(answerbox_t *box) |
121 | void ipc_answerbox_init(answerbox_t *box) |
122 | { |
122 | { |
123 | spinlock_initialize(&box->lock, "ipc_box_lock"); |
123 | spinlock_initialize(&box->lock, "ipc_box_lock"); |
124 | spinlock_initialize(&box->irq_lock, "ipc_box_irqlock"); |
124 | spinlock_initialize(&box->irq_lock, "ipc_box_irqlock"); |
125 | waitq_initialize(&box->wq); |
125 | waitq_initialize(&box->wq); |
126 | list_initialize(&box->connected_phones); |
126 | list_initialize(&box->connected_phones); |
127 | list_initialize(&box->calls); |
127 | list_initialize(&box->calls); |
128 | list_initialize(&box->dispatched_calls); |
128 | list_initialize(&box->dispatched_calls); |
129 | list_initialize(&box->answers); |
129 | list_initialize(&box->answers); |
130 | list_initialize(&box->irq_notifs); |
130 | list_initialize(&box->irq_notifs); |
131 | list_initialize(&box->irq_head); |
131 | list_initialize(&box->irq_head); |
132 | box->task = TASK; |
132 | box->task = TASK; |
133 | } |
133 | } |
134 | 134 | ||
135 | /** Connect a phone to an answerbox. |
135 | /** Connect a phone to an answerbox. |
136 | * |
136 | * |
137 | * @param phone Initialized phone structure. |
137 | * @param phone Initialized phone structure. |
138 | * @param box Initialized answerbox structure. |
138 | * @param box Initialized answerbox structure. |
139 | */ |
139 | */ |
140 | void ipc_phone_connect(phone_t *phone, answerbox_t *box) |
140 | void ipc_phone_connect(phone_t *phone, answerbox_t *box) |
141 | { |
141 | { |
142 | spinlock_lock(&phone->lock); |
142 | spinlock_lock(&phone->lock); |
143 | 143 | ||
144 | phone->state = IPC_PHONE_CONNECTED; |
144 | phone->state = IPC_PHONE_CONNECTED; |
145 | phone->callee = box; |
145 | phone->callee = box; |
146 | 146 | ||
147 | spinlock_lock(&box->lock); |
147 | spinlock_lock(&box->lock); |
148 | list_append(&phone->link, &box->connected_phones); |
148 | list_append(&phone->link, &box->connected_phones); |
149 | spinlock_unlock(&box->lock); |
149 | spinlock_unlock(&box->lock); |
150 | 150 | ||
151 | spinlock_unlock(&phone->lock); |
151 | spinlock_unlock(&phone->lock); |
152 | } |
152 | } |
153 | 153 | ||
154 | /** Initialize a phone structure. |
154 | /** Initialize a phone structure. |
155 | * |
155 | * |
156 | * @param phone Phone structure to be initialized. |
156 | * @param phone Phone structure to be initialized. |
157 | */ |
157 | */ |
158 | void ipc_phone_init(phone_t *phone) |
158 | void ipc_phone_init(phone_t *phone) |
159 | { |
159 | { |
160 | spinlock_initialize(&phone->lock, "phone_lock"); |
160 | spinlock_initialize(&phone->lock, "phone_lock"); |
161 | phone->callee = NULL; |
161 | phone->callee = NULL; |
162 | phone->state = IPC_PHONE_FREE; |
162 | phone->state = IPC_PHONE_FREE; |
163 | atomic_set(&phone->active_calls, 0); |
163 | atomic_set(&phone->active_calls, 0); |
164 | } |
164 | } |
165 | 165 | ||
166 | /** Helper function to facilitate synchronous calls. |
166 | /** Helper function to facilitate synchronous calls. |
167 | * |
167 | * |
168 | * @param phone Destination kernel phone structure. |
168 | * @param phone Destination kernel phone structure. |
169 | * @param request Call structure with request. |
169 | * @param request Call structure with request. |
170 | */ |
170 | */ |
171 | void ipc_call_sync(phone_t *phone, call_t *request) |
171 | void ipc_call_sync(phone_t *phone, call_t *request) |
172 | { |
172 | { |
173 | answerbox_t sync_box; |
173 | answerbox_t sync_box; |
174 | 174 | ||
175 | ipc_answerbox_init(&sync_box); |
175 | ipc_answerbox_init(&sync_box); |
176 | 176 | ||
177 | /* We will receive data in a special box. */ |
177 | /* We will receive data in a special box. */ |
178 | request->callerbox = &sync_box; |
178 | request->callerbox = &sync_box; |
179 | 179 | ||
180 | ipc_call(phone, request); |
180 | ipc_call(phone, request); |
181 | ipc_wait_for_call(&sync_box, SYNCH_NO_TIMEOUT, SYNCH_FLAGS_NONE); |
181 | ipc_wait_for_call(&sync_box, SYNCH_NO_TIMEOUT, SYNCH_FLAGS_NONE); |
182 | } |
182 | } |
183 | 183 | ||
184 | /** Answer a message which was not dispatched and is not listed in any queue. |
184 | /** Answer a message which was not dispatched and is not listed in any queue. |
185 | * |
185 | * |
186 | * @param call Call structure to be answered. |
186 | * @param call Call structure to be answered. |
187 | */ |
187 | */ |
188 | static void _ipc_answer_free_call(call_t *call) |
188 | static void _ipc_answer_free_call(call_t *call) |
189 | { |
189 | { |
190 | answerbox_t *callerbox = call->callerbox; |
190 | answerbox_t *callerbox = call->callerbox; |
191 | 191 | ||
192 | call->flags |= IPC_CALL_ANSWERED; |
192 | call->flags |= IPC_CALL_ANSWERED; |
193 | 193 | ||
194 | spinlock_lock(&callerbox->lock); |
194 | spinlock_lock(&callerbox->lock); |
195 | list_append(&call->link, &callerbox->answers); |
195 | list_append(&call->link, &callerbox->answers); |
196 | spinlock_unlock(&callerbox->lock); |
196 | spinlock_unlock(&callerbox->lock); |
197 | waitq_wakeup(&callerbox->wq, WAKEUP_FIRST); |
197 | waitq_wakeup(&callerbox->wq, WAKEUP_FIRST); |
198 | } |
198 | } |
199 | 199 | ||
200 | /** Answer a message which is in a callee queue. |
200 | /** Answer a message which is in a callee queue. |
201 | * |
201 | * |
202 | * @param box Answerbox that is answering the message. |
202 | * @param box Answerbox that is answering the message. |
203 | * @param call Modified request that is being sent back. |
203 | * @param call Modified request that is being sent back. |
204 | */ |
204 | */ |
205 | void ipc_answer(answerbox_t *box, call_t *call) |
205 | void ipc_answer(answerbox_t *box, call_t *call) |
206 | { |
206 | { |
207 | /* Remove from active box */ |
207 | /* Remove from active box */ |
208 | spinlock_lock(&box->lock); |
208 | spinlock_lock(&box->lock); |
209 | list_remove(&call->link); |
209 | list_remove(&call->link); |
210 | spinlock_unlock(&box->lock); |
210 | spinlock_unlock(&box->lock); |
211 | /* Send back answer */ |
211 | /* Send back answer */ |
212 | _ipc_answer_free_call(call); |
212 | _ipc_answer_free_call(call); |
213 | } |
213 | } |
214 | 214 | ||
215 | /** Simulate sending back a message. |
215 | /** Simulate sending back a message. |
216 | * |
216 | * |
217 | * Most errors are better handled by forming a normal backward |
217 | * Most errors are better handled by forming a normal backward |
218 | * message and sending it as a normal answer. |
218 | * message and sending it as a normal answer. |
219 | * |
219 | * |
220 | * @param phone Phone structure the call should appear to come from. |
220 | * @param phone Phone structure the call should appear to come from. |
221 | * @param call Call structure to be answered. |
221 | * @param call Call structure to be answered. |
222 | * @param err Return value to be used for the answer. |
222 | * @param err Return value to be used for the answer. |
223 | */ |
223 | */ |
224 | void ipc_backsend_err(phone_t *phone, call_t *call, unative_t err) |
224 | void ipc_backsend_err(phone_t *phone, call_t *call, unative_t err) |
225 | { |
225 | { |
226 | call->data.phone = phone; |
226 | call->data.phone = phone; |
227 | atomic_inc(&phone->active_calls); |
227 | atomic_inc(&phone->active_calls); |
228 | IPC_SET_RETVAL(call->data, err); |
228 | IPC_SET_RETVAL(call->data, err); |
229 | _ipc_answer_free_call(call); |
229 | _ipc_answer_free_call(call); |
230 | } |
230 | } |
231 | 231 | ||
232 | /** Unsafe unchecking version of ipc_call. |
232 | /** Unsafe unchecking version of ipc_call. |
233 | * |
233 | * |
234 | * @param phone Phone structure the call comes from. |
234 | * @param phone Phone structure the call comes from. |
235 | * @param box Destination answerbox structure. |
235 | * @param box Destination answerbox structure. |
236 | * @param call Call structure with request. |
236 | * @param call Call structure with request. |
237 | */ |
237 | */ |
238 | static void _ipc_call(phone_t *phone, answerbox_t *box, call_t *call) |
238 | static void _ipc_call(phone_t *phone, answerbox_t *box, call_t *call) |
239 | { |
239 | { |
240 | if (!(call->flags & IPC_CALL_FORWARDED)) { |
240 | if (!(call->flags & IPC_CALL_FORWARDED)) { |
241 | atomic_inc(&phone->active_calls); |
241 | atomic_inc(&phone->active_calls); |
242 | call->data.phone = phone; |
242 | call->data.phone = phone; |
243 | } |
243 | } |
244 | 244 | ||
245 | spinlock_lock(&box->lock); |
245 | spinlock_lock(&box->lock); |
246 | list_append(&call->link, &box->calls); |
246 | list_append(&call->link, &box->calls); |
247 | spinlock_unlock(&box->lock); |
247 | spinlock_unlock(&box->lock); |
248 | waitq_wakeup(&box->wq, WAKEUP_FIRST); |
248 | waitq_wakeup(&box->wq, WAKEUP_FIRST); |
249 | } |
249 | } |
250 | 250 | ||
251 | /** Send an asynchronous request using a phone to an answerbox. |
251 | /** Send an asynchronous request using a phone to an answerbox. |
252 | * |
252 | * |
253 | * @param phone Phone structure the call comes from and which is |
253 | * @param phone Phone structure the call comes from and which is |
254 | * connected to the destination answerbox. |
254 | * connected to the destination answerbox. |
255 | * @param call Call structure with request. |
255 | * @param call Call structure with request. |
256 | * |
256 | * |
257 | * @return Return 0 on success, ENOENT on error. |
257 | * @return Return 0 on success, ENOENT on error. |
258 | */ |
258 | */ |
259 | int ipc_call(phone_t *phone, call_t *call) |
259 | int ipc_call(phone_t *phone, call_t *call) |
260 | { |
260 | { |
261 | answerbox_t *box; |
261 | answerbox_t *box; |
262 | 262 | ||
263 | spinlock_lock(&phone->lock); |
263 | spinlock_lock(&phone->lock); |
264 | if (phone->state != IPC_PHONE_CONNECTED) { |
264 | if (phone->state != IPC_PHONE_CONNECTED) { |
265 | spinlock_unlock(&phone->lock); |
265 | spinlock_unlock(&phone->lock); |
266 | if (call->flags & IPC_CALL_FORWARDED) { |
266 | if (call->flags & IPC_CALL_FORWARDED) { |
267 | IPC_SET_RETVAL(call->data, EFORWARD); |
267 | IPC_SET_RETVAL(call->data, EFORWARD); |
268 | _ipc_answer_free_call(call); |
268 | _ipc_answer_free_call(call); |
269 | } else { |
269 | } else { |
270 | if (phone->state == IPC_PHONE_HUNGUP) |
270 | if (phone->state == IPC_PHONE_HUNGUP) |
271 | ipc_backsend_err(phone, call, EHANGUP); |
271 | ipc_backsend_err(phone, call, EHANGUP); |
272 | else |
272 | else |
273 | ipc_backsend_err(phone, call, ENOENT); |
273 | ipc_backsend_err(phone, call, ENOENT); |
274 | } |
274 | } |
275 | return ENOENT; |
275 | return ENOENT; |
276 | } |
276 | } |
277 | box = phone->callee; |
277 | box = phone->callee; |
278 | _ipc_call(phone, box, call); |
278 | _ipc_call(phone, box, call); |
279 | 279 | ||
280 | spinlock_unlock(&phone->lock); |
280 | spinlock_unlock(&phone->lock); |
281 | return 0; |
281 | return 0; |
282 | } |
282 | } |
283 | 283 | ||
284 | /** Disconnect phone from answerbox. |
284 | /** Disconnect phone from answerbox. |
285 | * |
285 | * |
286 | * This call leaves the phone in the HUNGUP state. The change to 'free' is done |
286 | * This call leaves the phone in the HUNGUP state. The change to 'free' is done |
287 | * lazily later. |
287 | * lazily later. |
288 | * |
288 | * |
289 | * @param phone Phone structure to be hung up. |
289 | * @param phone Phone structure to be hung up. |
290 | * |
290 | * |
291 | * @return Return 0 if the phone is disconnected. |
291 | * @return Return 0 if the phone is disconnected. |
292 | * Return -1 if the phone was already disconnected. |
292 | * Return -1 if the phone was already disconnected. |
293 | */ |
293 | */ |
294 | int ipc_phone_hangup(phone_t *phone) |
294 | int ipc_phone_hangup(phone_t *phone) |
295 | { |
295 | { |
296 | answerbox_t *box; |
296 | answerbox_t *box; |
297 | call_t *call; |
297 | call_t *call; |
298 | 298 | ||
299 | spinlock_lock(&phone->lock); |
299 | spinlock_lock(&phone->lock); |
300 | if (phone->state == IPC_PHONE_FREE || |
300 | if (phone->state == IPC_PHONE_FREE || |
301 | phone->state == IPC_PHONE_HUNGUP || |
301 | phone->state == IPC_PHONE_HUNGUP || |
302 | phone->state == IPC_PHONE_CONNECTING) { |
302 | phone->state == IPC_PHONE_CONNECTING) { |
303 | spinlock_unlock(&phone->lock); |
303 | spinlock_unlock(&phone->lock); |
304 | return -1; |
304 | return -1; |
305 | } |
305 | } |
306 | box = phone->callee; |
306 | box = phone->callee; |
307 | if (phone->state != IPC_PHONE_SLAMMED) { |
307 | if (phone->state != IPC_PHONE_SLAMMED) { |
308 | /* Remove myself from answerbox */ |
308 | /* Remove myself from answerbox */ |
309 | spinlock_lock(&box->lock); |
309 | spinlock_lock(&box->lock); |
310 | list_remove(&phone->link); |
310 | list_remove(&phone->link); |
311 | spinlock_unlock(&box->lock); |
311 | spinlock_unlock(&box->lock); |
312 | 312 | ||
313 | if (phone->state != IPC_PHONE_SLAMMED) { |
313 | if (phone->state != IPC_PHONE_SLAMMED) { |
314 | call = ipc_call_alloc(0); |
314 | call = ipc_call_alloc(0); |
315 | IPC_SET_METHOD(call->data, IPC_M_PHONE_HUNGUP); |
315 | IPC_SET_METHOD(call->data, IPC_M_PHONE_HUNGUP); |
316 | call->flags |= IPC_CALL_DISCARD_ANSWER; |
316 | call->flags |= IPC_CALL_DISCARD_ANSWER; |
317 | _ipc_call(phone, box, call); |
317 | _ipc_call(phone, box, call); |
318 | } |
318 | } |
319 | } |
319 | } |
320 | 320 | ||
321 | phone->state = IPC_PHONE_HUNGUP; |
321 | phone->state = IPC_PHONE_HUNGUP; |
322 | spinlock_unlock(&phone->lock); |
322 | spinlock_unlock(&phone->lock); |
323 | 323 | ||
324 | return 0; |
324 | return 0; |
325 | } |
325 | } |
326 | 326 | ||
327 | /** Forwards call from one answerbox to another one. |
327 | /** Forwards call from one answerbox to another one. |
328 | * |
328 | * |
329 | * @param call Call structure to be redirected. |
329 | * @param call Call structure to be redirected. |
330 | * @param newphone Phone structure to target answerbox. |
330 | * @param newphone Phone structure to target answerbox. |
331 | * @param oldbox Old answerbox structure. |
331 | * @param oldbox Old answerbox structure. |
- | 332 | * @param mode Flags that specify mode of the forward operation. |
|
332 | * |
333 | * |
333 | * @return Return 0 if forwarding succeeded or an error code if |
334 | * @return Return 0 if forwarding succeeded or an error code if |
334 | * there was error. |
335 | * there was error. |
335 | * |
336 | * |
336 | * The return value serves only as an information for the forwarder, |
337 | * The return value serves only as an information for the forwarder, |
337 | * the original caller is notified automatically with EFORWARD. |
338 | * the original caller is notified automatically with EFORWARD. |
338 | */ |
339 | */ |
339 | int ipc_forward(call_t *call, phone_t *newphone, answerbox_t *oldbox) |
340 | int ipc_forward(call_t *call, phone_t *newphone, answerbox_t *oldbox, int mode) |
340 | { |
341 | { |
341 | spinlock_lock(&oldbox->lock); |
342 | spinlock_lock(&oldbox->lock); |
342 | list_remove(&call->link); |
343 | list_remove(&call->link); |
343 | spinlock_unlock(&oldbox->lock); |
344 | spinlock_unlock(&oldbox->lock); |
344 | 345 | ||
345 | return ipc_call(newphone, call); |
346 | return ipc_call(newphone, call); |
346 | } |
347 | } |
347 | 348 | ||
348 | 349 | ||
349 | /** Wait for a phone call. |
350 | /** Wait for a phone call. |
350 | * |
351 | * |
351 | * @param box Answerbox expecting the call. |
352 | * @param box Answerbox expecting the call. |
352 | * @param usec Timeout in microseconds. See documentation for |
353 | * @param usec Timeout in microseconds. See documentation for |
353 | * waitq_sleep_timeout() for decription of its special |
354 | * waitq_sleep_timeout() for decription of its special |
354 | * meaning. |
355 | * meaning. |
355 | * @param flags Select mode of sleep operation. See documentation for |
356 | * @param flags Select mode of sleep operation. See documentation for |
356 | * waitq_sleep_timeout() for description of its special |
357 | * waitq_sleep_timeout() for description of its special |
357 | * meaning. |
358 | * meaning. |
358 | * @return Recived call structure or NULL. |
359 | * @return Recived call structure or NULL. |
359 | * |
360 | * |
360 | * To distinguish between a call and an answer, have a look at call->flags. |
361 | * To distinguish between a call and an answer, have a look at call->flags. |
361 | */ |
362 | */ |
362 | call_t *ipc_wait_for_call(answerbox_t *box, uint32_t usec, int flags) |
363 | call_t *ipc_wait_for_call(answerbox_t *box, uint32_t usec, int flags) |
363 | { |
364 | { |
364 | call_t *request; |
365 | call_t *request; |
365 | ipl_t ipl; |
366 | ipl_t ipl; |
366 | int rc; |
367 | int rc; |
367 | 368 | ||
368 | restart: |
369 | restart: |
369 | rc = waitq_sleep_timeout(&box->wq, usec, flags); |
370 | rc = waitq_sleep_timeout(&box->wq, usec, flags); |
370 | if (SYNCH_FAILED(rc)) |
371 | if (SYNCH_FAILED(rc)) |
371 | return NULL; |
372 | return NULL; |
372 | 373 | ||
373 | spinlock_lock(&box->lock); |
374 | spinlock_lock(&box->lock); |
374 | if (!list_empty(&box->irq_notifs)) { |
375 | if (!list_empty(&box->irq_notifs)) { |
375 | ipl = interrupts_disable(); |
376 | ipl = interrupts_disable(); |
376 | spinlock_lock(&box->irq_lock); |
377 | spinlock_lock(&box->irq_lock); |
377 | 378 | ||
378 | request = list_get_instance(box->irq_notifs.next, call_t, link); |
379 | request = list_get_instance(box->irq_notifs.next, call_t, link); |
379 | list_remove(&request->link); |
380 | list_remove(&request->link); |
380 | 381 | ||
381 | spinlock_unlock(&box->irq_lock); |
382 | spinlock_unlock(&box->irq_lock); |
382 | interrupts_restore(ipl); |
383 | interrupts_restore(ipl); |
383 | } else if (!list_empty(&box->answers)) { |
384 | } else if (!list_empty(&box->answers)) { |
384 | /* Handle asynchronous answers */ |
385 | /* Handle asynchronous answers */ |
385 | request = list_get_instance(box->answers.next, call_t, link); |
386 | request = list_get_instance(box->answers.next, call_t, link); |
386 | list_remove(&request->link); |
387 | list_remove(&request->link); |
387 | atomic_dec(&request->data.phone->active_calls); |
388 | atomic_dec(&request->data.phone->active_calls); |
388 | } else if (!list_empty(&box->calls)) { |
389 | } else if (!list_empty(&box->calls)) { |
389 | /* Handle requests */ |
390 | /* Handle requests */ |
390 | request = list_get_instance(box->calls.next, call_t, link); |
391 | request = list_get_instance(box->calls.next, call_t, link); |
391 | list_remove(&request->link); |
392 | list_remove(&request->link); |
392 | /* Append request to dispatch queue */ |
393 | /* Append request to dispatch queue */ |
393 | list_append(&request->link, &box->dispatched_calls); |
394 | list_append(&request->link, &box->dispatched_calls); |
394 | } else { |
395 | } else { |
395 | /* This can happen regularly after ipc_cleanup */ |
396 | /* This can happen regularly after ipc_cleanup */ |
396 | spinlock_unlock(&box->lock); |
397 | spinlock_unlock(&box->lock); |
397 | goto restart; |
398 | goto restart; |
398 | } |
399 | } |
399 | spinlock_unlock(&box->lock); |
400 | spinlock_unlock(&box->lock); |
400 | return request; |
401 | return request; |
401 | } |
402 | } |
402 | 403 | ||
403 | /** Answer all calls from list with EHANGUP answer. |
404 | /** Answer all calls from list with EHANGUP answer. |
404 | * |
405 | * |
405 | * @param lst Head of the list to be cleaned up. |
406 | * @param lst Head of the list to be cleaned up. |
406 | */ |
407 | */ |
407 | static void ipc_cleanup_call_list(link_t *lst) |
408 | static void ipc_cleanup_call_list(link_t *lst) |
408 | { |
409 | { |
409 | call_t *call; |
410 | call_t *call; |
410 | 411 | ||
411 | while (!list_empty(lst)) { |
412 | while (!list_empty(lst)) { |
412 | call = list_get_instance(lst->next, call_t, link); |
413 | call = list_get_instance(lst->next, call_t, link); |
413 | list_remove(&call->link); |
414 | list_remove(&call->link); |
414 | 415 | ||
415 | IPC_SET_RETVAL(call->data, EHANGUP); |
416 | IPC_SET_RETVAL(call->data, EHANGUP); |
416 | _ipc_answer_free_call(call); |
417 | _ipc_answer_free_call(call); |
417 | } |
418 | } |
418 | } |
419 | } |
419 | 420 | ||
420 | /** Cleans up all IPC communication of the current task. |
421 | /** Cleans up all IPC communication of the current task. |
421 | * |
422 | * |
422 | * Note: ipc_hangup sets returning answerbox to TASK->answerbox, you |
423 | * Note: ipc_hangup sets returning answerbox to TASK->answerbox, you |
423 | * have to change it as well if you want to cleanup other tasks than TASK. |
424 | * have to change it as well if you want to cleanup other tasks than TASK. |
424 | */ |
425 | */ |
425 | void ipc_cleanup(void) |
426 | void ipc_cleanup(void) |
426 | { |
427 | { |
427 | int i; |
428 | int i; |
428 | call_t *call; |
429 | call_t *call; |
429 | phone_t *phone; |
430 | phone_t *phone; |
430 | DEADLOCK_PROBE_INIT(p_phonelck); |
431 | DEADLOCK_PROBE_INIT(p_phonelck); |
431 | 432 | ||
432 | /* Disconnect all our phones ('ipc_phone_hangup') */ |
433 | /* Disconnect all our phones ('ipc_phone_hangup') */ |
433 | for (i = 0; i < IPC_MAX_PHONES; i++) |
434 | for (i = 0; i < IPC_MAX_PHONES; i++) |
434 | ipc_phone_hangup(&TASK->phones[i]); |
435 | ipc_phone_hangup(&TASK->phones[i]); |
435 | 436 | ||
436 | /* Disconnect all connected irqs */ |
437 | /* Disconnect all connected irqs */ |
437 | ipc_irq_cleanup(&TASK->answerbox); |
438 | ipc_irq_cleanup(&TASK->answerbox); |
438 | 439 | ||
439 | /* Disconnect all phones connected to our answerbox */ |
440 | /* Disconnect all phones connected to our answerbox */ |
440 | restart_phones: |
441 | restart_phones: |
441 | spinlock_lock(&TASK->answerbox.lock); |
442 | spinlock_lock(&TASK->answerbox.lock); |
442 | while (!list_empty(&TASK->answerbox.connected_phones)) { |
443 | while (!list_empty(&TASK->answerbox.connected_phones)) { |
443 | phone = list_get_instance(TASK->answerbox.connected_phones.next, |
444 | phone = list_get_instance(TASK->answerbox.connected_phones.next, |
444 | phone_t, link); |
445 | phone_t, link); |
445 | if (!spinlock_trylock(&phone->lock)) { |
446 | if (!spinlock_trylock(&phone->lock)) { |
446 | spinlock_unlock(&TASK->answerbox.lock); |
447 | spinlock_unlock(&TASK->answerbox.lock); |
447 | DEADLOCK_PROBE(p_phonelck, DEADLOCK_THRESHOLD); |
448 | DEADLOCK_PROBE(p_phonelck, DEADLOCK_THRESHOLD); |
448 | goto restart_phones; |
449 | goto restart_phones; |
449 | } |
450 | } |
450 | 451 | ||
451 | /* Disconnect phone */ |
452 | /* Disconnect phone */ |
452 | ASSERT(phone->state == IPC_PHONE_CONNECTED); |
453 | ASSERT(phone->state == IPC_PHONE_CONNECTED); |
453 | phone->state = IPC_PHONE_SLAMMED; |
454 | phone->state = IPC_PHONE_SLAMMED; |
454 | list_remove(&phone->link); |
455 | list_remove(&phone->link); |
455 | 456 | ||
456 | spinlock_unlock(&phone->lock); |
457 | spinlock_unlock(&phone->lock); |
457 | } |
458 | } |
458 | 459 | ||
459 | /* Answer all messages in 'calls' and 'dispatched_calls' queues */ |
460 | /* Answer all messages in 'calls' and 'dispatched_calls' queues */ |
460 | ipc_cleanup_call_list(&TASK->answerbox.dispatched_calls); |
461 | ipc_cleanup_call_list(&TASK->answerbox.dispatched_calls); |
461 | ipc_cleanup_call_list(&TASK->answerbox.calls); |
462 | ipc_cleanup_call_list(&TASK->answerbox.calls); |
462 | spinlock_unlock(&TASK->answerbox.lock); |
463 | spinlock_unlock(&TASK->answerbox.lock); |
463 | 464 | ||
464 | /* Wait for all async answers to arrive */ |
465 | /* Wait for all async answers to arrive */ |
465 | while (1) { |
466 | while (1) { |
466 | /* Go through all phones, until all are FREE... */ |
467 | /* Go through all phones, until all are FREE... */ |
467 | /* Locking not needed, no one else should modify |
468 | /* Locking not needed, no one else should modify |
468 | * it, when we are in cleanup */ |
469 | * it, when we are in cleanup */ |
469 | for (i = 0; i < IPC_MAX_PHONES; i++) { |
470 | for (i = 0; i < IPC_MAX_PHONES; i++) { |
470 | if (TASK->phones[i].state == IPC_PHONE_HUNGUP && |
471 | if (TASK->phones[i].state == IPC_PHONE_HUNGUP && |
471 | atomic_get(&TASK->phones[i].active_calls) == 0) |
472 | atomic_get(&TASK->phones[i].active_calls) == 0) |
472 | TASK->phones[i].state = IPC_PHONE_FREE; |
473 | TASK->phones[i].state = IPC_PHONE_FREE; |
473 | 474 | ||
474 | /* Just for sure, we might have had some |
475 | /* Just for sure, we might have had some |
475 | * IPC_PHONE_CONNECTING phones */ |
476 | * IPC_PHONE_CONNECTING phones */ |
476 | if (TASK->phones[i].state == IPC_PHONE_CONNECTED) |
477 | if (TASK->phones[i].state == IPC_PHONE_CONNECTED) |
477 | ipc_phone_hangup(&TASK->phones[i]); |
478 | ipc_phone_hangup(&TASK->phones[i]); |
478 | /* If the hangup succeeded, it has sent a HANGUP |
479 | /* If the hangup succeeded, it has sent a HANGUP |
479 | * message, the IPC is now in HUNGUP state, we |
480 | * message, the IPC is now in HUNGUP state, we |
480 | * wait for the reply to come */ |
481 | * wait for the reply to come */ |
481 | 482 | ||
482 | if (TASK->phones[i].state != IPC_PHONE_FREE) |
483 | if (TASK->phones[i].state != IPC_PHONE_FREE) |
483 | break; |
484 | break; |
484 | } |
485 | } |
485 | /* Voila, got into cleanup */ |
486 | /* Voila, got into cleanup */ |
486 | if (i == IPC_MAX_PHONES) |
487 | if (i == IPC_MAX_PHONES) |
487 | break; |
488 | break; |
488 | 489 | ||
489 | call = ipc_wait_for_call(&TASK->answerbox, SYNCH_NO_TIMEOUT, |
490 | call = ipc_wait_for_call(&TASK->answerbox, SYNCH_NO_TIMEOUT, |
490 | SYNCH_FLAGS_NONE); |
491 | SYNCH_FLAGS_NONE); |
491 | ASSERT((call->flags & IPC_CALL_ANSWERED) || |
492 | ASSERT((call->flags & IPC_CALL_ANSWERED) || |
492 | (call->flags & IPC_CALL_NOTIF)); |
493 | (call->flags & IPC_CALL_NOTIF)); |
493 | ASSERT(!(call->flags & IPC_CALL_STATIC_ALLOC)); |
494 | ASSERT(!(call->flags & IPC_CALL_STATIC_ALLOC)); |
494 | 495 | ||
495 | atomic_dec(&TASK->active_calls); |
496 | atomic_dec(&TASK->active_calls); |
496 | ipc_call_free(call); |
497 | ipc_call_free(call); |
497 | } |
498 | } |
498 | } |
499 | } |
499 | 500 | ||
500 | 501 | ||
501 | /** Initilize IPC subsystem */ |
502 | /** Initilize IPC subsystem */ |
502 | void ipc_init(void) |
503 | void ipc_init(void) |
503 | { |
504 | { |
504 | ipc_call_slab = slab_cache_create("ipc_call", sizeof(call_t), 0, NULL, |
505 | ipc_call_slab = slab_cache_create("ipc_call", sizeof(call_t), 0, NULL, |
505 | NULL, 0); |
506 | NULL, 0); |
506 | } |
507 | } |
507 | 508 | ||
508 | 509 | ||
509 | /** List answerbox contents. |
510 | /** List answerbox contents. |
510 | * |
511 | * |
511 | * @param taskid Task ID. |
512 | * @param taskid Task ID. |
512 | */ |
513 | */ |
513 | void ipc_print_task(task_id_t taskid) |
514 | void ipc_print_task(task_id_t taskid) |
514 | { |
515 | { |
515 | task_t *task; |
516 | task_t *task; |
516 | int i; |
517 | int i; |
517 | call_t *call; |
518 | call_t *call; |
518 | link_t *tmp; |
519 | link_t *tmp; |
519 | 520 | ||
520 | spinlock_lock(&tasks_lock); |
521 | spinlock_lock(&tasks_lock); |
521 | task = task_find_by_id(taskid); |
522 | task = task_find_by_id(taskid); |
522 | if (task) |
523 | if (task) |
523 | spinlock_lock(&task->lock); |
524 | spinlock_lock(&task->lock); |
524 | spinlock_unlock(&tasks_lock); |
525 | spinlock_unlock(&tasks_lock); |
525 | if (!task) |
526 | if (!task) |
526 | return; |
527 | return; |
527 | 528 | ||
528 | /* Print opened phones & details */ |
529 | /* Print opened phones & details */ |
529 | printf("PHONE:\n"); |
530 | printf("PHONE:\n"); |
530 | for (i = 0; i < IPC_MAX_PHONES; i++) { |
531 | for (i = 0; i < IPC_MAX_PHONES; i++) { |
531 | spinlock_lock(&task->phones[i].lock); |
532 | spinlock_lock(&task->phones[i].lock); |
532 | if (task->phones[i].state != IPC_PHONE_FREE) { |
533 | if (task->phones[i].state != IPC_PHONE_FREE) { |
533 | printf("%d: ", i); |
534 | printf("%d: ", i); |
534 | switch (task->phones[i].state) { |
535 | switch (task->phones[i].state) { |
535 | case IPC_PHONE_CONNECTING: |
536 | case IPC_PHONE_CONNECTING: |
536 | printf("connecting "); |
537 | printf("connecting "); |
537 | break; |
538 | break; |
538 | case IPC_PHONE_CONNECTED: |
539 | case IPC_PHONE_CONNECTED: |
539 | printf("connected to: %p ", |
540 | printf("connected to: %p ", |
540 | task->phones[i].callee); |
541 | task->phones[i].callee); |
541 | break; |
542 | break; |
542 | case IPC_PHONE_SLAMMED: |
543 | case IPC_PHONE_SLAMMED: |
543 | printf("slammed by: %p ", |
544 | printf("slammed by: %p ", |
544 | task->phones[i].callee); |
545 | task->phones[i].callee); |
545 | break; |
546 | break; |
546 | case IPC_PHONE_HUNGUP: |
547 | case IPC_PHONE_HUNGUP: |
547 | printf("hung up - was: %p ", |
548 | printf("hung up - was: %p ", |
548 | task->phones[i].callee); |
549 | task->phones[i].callee); |
549 | break; |
550 | break; |
550 | default: |
551 | default: |
551 | break; |
552 | break; |
552 | } |
553 | } |
553 | printf("active: %d\n", |
554 | printf("active: %d\n", |
554 | atomic_get(&task->phones[i].active_calls)); |
555 | atomic_get(&task->phones[i].active_calls)); |
555 | } |
556 | } |
556 | spinlock_unlock(&task->phones[i].lock); |
557 | spinlock_unlock(&task->phones[i].lock); |
557 | } |
558 | } |
558 | 559 | ||
559 | 560 | ||
560 | /* Print answerbox - calls */ |
561 | /* Print answerbox - calls */ |
561 | spinlock_lock(&task->answerbox.lock); |
562 | spinlock_lock(&task->answerbox.lock); |
562 | printf("ABOX - CALLS:\n"); |
563 | printf("ABOX - CALLS:\n"); |
563 | for (tmp = task->answerbox.calls.next; tmp != &task->answerbox.calls; |
564 | for (tmp = task->answerbox.calls.next; tmp != &task->answerbox.calls; |
564 | tmp = tmp->next) { |
565 | tmp = tmp->next) { |
565 | call = list_get_instance(tmp, call_t, link); |
566 | call = list_get_instance(tmp, call_t, link); |
566 | printf("Callid: %p Srctask:%llu M:%d A1:%d A2:%d A3:%d " |
567 | printf("Callid: %p Srctask:%llu M:%d A1:%d A2:%d A3:%d " |
567 | "Flags:%x\n", call, call->sender->taskid, |
568 | "Flags:%x\n", call, call->sender->taskid, |
568 | IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
569 | IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
569 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), |
570 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), |
570 | call->flags); |
571 | call->flags); |
571 | } |
572 | } |
572 | /* Print answerbox - calls */ |
573 | /* Print answerbox - calls */ |
573 | printf("ABOX - DISPATCHED CALLS:\n"); |
574 | printf("ABOX - DISPATCHED CALLS:\n"); |
574 | for (tmp=task->answerbox.dispatched_calls.next; |
575 | for (tmp=task->answerbox.dispatched_calls.next; |
575 | tmp != &task->answerbox.dispatched_calls; |
576 | tmp != &task->answerbox.dispatched_calls; |
576 | tmp = tmp->next) { |
577 | tmp = tmp->next) { |
577 | call = list_get_instance(tmp, call_t, link); |
578 | call = list_get_instance(tmp, call_t, link); |
578 | printf("Callid: %p Srctask:%llu M:%d A1:%d A2:%d A3:%d " |
579 | printf("Callid: %p Srctask:%llu M:%d A1:%d A2:%d A3:%d " |
579 | "Flags:%x\n", call, call->sender->taskid, |
580 | "Flags:%x\n", call, call->sender->taskid, |
580 | IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
581 | IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
581 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), |
582 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), |
582 | call->flags); |
583 | call->flags); |
583 | } |
584 | } |
584 | /* Print answerbox - calls */ |
585 | /* Print answerbox - calls */ |
585 | printf("ABOX - ANSWERS:\n"); |
586 | printf("ABOX - ANSWERS:\n"); |
586 | for (tmp = task->answerbox.answers.next; tmp != &task->answerbox.answers; |
587 | for (tmp = task->answerbox.answers.next; tmp != &task->answerbox.answers; |
587 | tmp = tmp->next) { |
588 | tmp = tmp->next) { |
588 | call = list_get_instance(tmp, call_t, link); |
589 | call = list_get_instance(tmp, call_t, link); |
589 | printf("Callid:%p M:%d A1:%d A2:%d A3:%d Flags:%x\n", call, |
590 | printf("Callid:%p M:%d A1:%d A2:%d A3:%d Flags:%x\n", call, |
590 | IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
591 | IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
591 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), |
592 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), |
592 | call->flags); |
593 | call->flags); |
593 | } |
594 | } |
594 | 595 | ||
595 | spinlock_unlock(&task->answerbox.lock); |
596 | spinlock_unlock(&task->answerbox.lock); |
596 | spinlock_unlock(&task->lock); |
597 | spinlock_unlock(&task->lock); |
597 | } |
598 | } |
598 | 599 | ||
599 | /** @} |
600 | /** @} |
600 | */ |
601 | */ |
601 | 602 |