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