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