Rev 3431 | Rev 3471 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3431 | Rev 3433 | ||
---|---|---|---|
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/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> |
54 | #include <console/console.h> |
55 | #include <console/console.h> |
55 | #include <proc/thread.h> |
56 | #include <proc/thread.h> |
56 | #include <arch/interrupt.h> |
57 | #include <arch/interrupt.h> |
57 | #include <ipc/irq.h> |
58 | #include <ipc/irq.h> |
58 | 59 | ||
59 | /** Open channel that is assigned automatically to new tasks */ |
60 | /** Open channel that is assigned automatically to new tasks */ |
60 | answerbox_t *ipc_phone_0 = NULL; |
61 | answerbox_t *ipc_phone_0 = NULL; |
61 | 62 | ||
62 | static slab_cache_t *ipc_call_slab; |
63 | static slab_cache_t *ipc_call_slab; |
63 | 64 | ||
64 | /** Initialize a call structure. |
65 | /** Initialize a call structure. |
65 | * |
66 | * |
66 | * @param call Call structure to be initialized. |
67 | * @param call Call structure to be initialized. |
67 | */ |
68 | */ |
68 | static void _ipc_call_init(call_t *call) |
69 | static void _ipc_call_init(call_t *call) |
69 | { |
70 | { |
70 | memsetb(call, sizeof(*call), 0); |
71 | memsetb(call, sizeof(*call), 0); |
71 | call->callerbox = &TASK->answerbox; |
72 | call->callerbox = &TASK->answerbox; |
72 | call->sender = TASK; |
73 | call->sender = TASK; |
73 | call->buffer = NULL; |
74 | call->buffer = NULL; |
74 | } |
75 | } |
75 | 76 | ||
76 | /** Allocate and initialize a call structure. |
77 | /** Allocate and initialize a call structure. |
77 | * |
78 | * |
78 | * 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 |
79 | * TASK->answerbox. |
80 | * TASK->answerbox. |
80 | * |
81 | * |
81 | * @param flags Parameters for slab_alloc (e.g FRAME_ATOMIC). |
82 | * @param flags Parameters for slab_alloc (e.g FRAME_ATOMIC). |
82 | * |
83 | * |
83 | * @return If flags permit it, return NULL, or initialized kernel |
84 | * @return If flags permit it, return NULL, or initialized kernel |
84 | * call structure. |
85 | * call structure. |
85 | */ |
86 | */ |
86 | call_t *ipc_call_alloc(int flags) |
87 | call_t *ipc_call_alloc(int flags) |
87 | { |
88 | { |
88 | call_t *call; |
89 | call_t *call; |
89 | 90 | ||
90 | call = slab_alloc(ipc_call_slab, flags); |
91 | call = slab_alloc(ipc_call_slab, flags); |
91 | if (call) |
92 | if (call) |
92 | _ipc_call_init(call); |
93 | _ipc_call_init(call); |
93 | 94 | ||
94 | return call; |
95 | return call; |
95 | } |
96 | } |
96 | 97 | ||
97 | /** Initialize a statically allocated call structure. |
98 | /** Initialize a statically allocated call structure. |
98 | * |
99 | * |
99 | * @param call Statically allocated kernel call structure to be |
100 | * @param call Statically allocated kernel call structure to be |
100 | * initialized. |
101 | * initialized. |
101 | */ |
102 | */ |
102 | void ipc_call_static_init(call_t *call) |
103 | void ipc_call_static_init(call_t *call) |
103 | { |
104 | { |
104 | _ipc_call_init(call); |
105 | _ipc_call_init(call); |
105 | call->flags |= IPC_CALL_STATIC_ALLOC; |
106 | call->flags |= IPC_CALL_STATIC_ALLOC; |
106 | } |
107 | } |
107 | 108 | ||
108 | /** Deallocate a call structure. |
109 | /** Deallocate a call structure. |
109 | * |
110 | * |
110 | * @param call Call structure to be freed. |
111 | * @param call Call structure to be freed. |
111 | */ |
112 | */ |
112 | void ipc_call_free(call_t *call) |
113 | void ipc_call_free(call_t *call) |
113 | { |
114 | { |
114 | ASSERT(!(call->flags & IPC_CALL_STATIC_ALLOC)); |
115 | ASSERT(!(call->flags & IPC_CALL_STATIC_ALLOC)); |
115 | /* 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. */ |
116 | if (call->buffer) |
117 | if (call->buffer) |
117 | free(call->buffer); |
118 | free(call->buffer); |
118 | slab_free(ipc_call_slab, call); |
119 | slab_free(ipc_call_slab, call); |
119 | } |
120 | } |
120 | 121 | ||
121 | /** Initialize an answerbox structure. |
122 | /** Initialize an answerbox structure. |
122 | * |
123 | * |
123 | * @param box Answerbox structure to be initialized. |
124 | * @param box Answerbox structure to be initialized. |
124 | * @param task Task to which the answerbox belongs. |
125 | * @param task Task to which the answerbox belongs. |
125 | */ |
126 | */ |
126 | void ipc_answerbox_init(answerbox_t *box, task_t *task) |
127 | void ipc_answerbox_init(answerbox_t *box, task_t *task) |
127 | { |
128 | { |
128 | spinlock_initialize(&box->lock, "ipc_box_lock"); |
129 | spinlock_initialize(&box->lock, "ipc_box_lock"); |
129 | spinlock_initialize(&box->irq_lock, "ipc_box_irqlock"); |
130 | spinlock_initialize(&box->irq_lock, "ipc_box_irqlock"); |
130 | waitq_initialize(&box->wq); |
131 | waitq_initialize(&box->wq); |
131 | list_initialize(&box->connected_phones); |
132 | list_initialize(&box->connected_phones); |
132 | list_initialize(&box->calls); |
133 | list_initialize(&box->calls); |
133 | list_initialize(&box->dispatched_calls); |
134 | list_initialize(&box->dispatched_calls); |
134 | list_initialize(&box->answers); |
135 | list_initialize(&box->answers); |
135 | list_initialize(&box->irq_notifs); |
136 | list_initialize(&box->irq_notifs); |
136 | list_initialize(&box->irq_head); |
137 | list_initialize(&box->irq_head); |
137 | box->task = task; |
138 | box->task = task; |
138 | } |
139 | } |
139 | 140 | ||
140 | /** Connect a phone to an answerbox. |
141 | /** Connect a phone to an answerbox. |
141 | * |
142 | * |
142 | * @param phone Initialized phone structure. |
143 | * @param phone Initialized phone structure. |
143 | * @param box Initialized answerbox structure. |
144 | * @param box Initialized answerbox structure. |
144 | */ |
145 | */ |
145 | void ipc_phone_connect(phone_t *phone, answerbox_t *box) |
146 | void ipc_phone_connect(phone_t *phone, answerbox_t *box) |
146 | { |
147 | { |
147 | mutex_lock(&phone->lock); |
148 | mutex_lock(&phone->lock); |
148 | 149 | ||
149 | phone->state = IPC_PHONE_CONNECTED; |
150 | phone->state = IPC_PHONE_CONNECTED; |
150 | phone->callee = box; |
151 | phone->callee = box; |
151 | 152 | ||
152 | spinlock_lock(&box->lock); |
153 | spinlock_lock(&box->lock); |
153 | list_append(&phone->link, &box->connected_phones); |
154 | list_append(&phone->link, &box->connected_phones); |
154 | spinlock_unlock(&box->lock); |
155 | spinlock_unlock(&box->lock); |
155 | 156 | ||
156 | mutex_unlock(&phone->lock); |
157 | mutex_unlock(&phone->lock); |
157 | } |
158 | } |
158 | 159 | ||
159 | /** Initialize a phone structure. |
160 | /** Initialize a phone structure. |
160 | * |
161 | * |
161 | * @param phone Phone structure to be initialized. |
162 | * @param phone Phone structure to be initialized. |
162 | */ |
163 | */ |
163 | void ipc_phone_init(phone_t *phone) |
164 | void ipc_phone_init(phone_t *phone) |
164 | { |
165 | { |
165 | mutex_initialize(&phone->lock, MUTEX_PASSIVE); |
166 | mutex_initialize(&phone->lock, MUTEX_PASSIVE); |
166 | phone->callee = NULL; |
167 | phone->callee = NULL; |
167 | phone->state = IPC_PHONE_FREE; |
168 | phone->state = IPC_PHONE_FREE; |
168 | atomic_set(&phone->active_calls, 0); |
169 | atomic_set(&phone->active_calls, 0); |
169 | } |
170 | } |
170 | 171 | ||
171 | /** Helper function to facilitate synchronous calls. |
172 | /** Helper function to facilitate synchronous calls. |
172 | * |
173 | * |
173 | * @param phone Destination kernel phone structure. |
174 | * @param phone Destination kernel phone structure. |
174 | * @param request Call structure with request. |
175 | * @param request Call structure with request. |
175 | * |
176 | * |
176 | * @return EOK on success or EINTR if the sleep was interrupted. |
177 | * @return EOK on success or EINTR if the sleep was interrupted. |
177 | */ |
178 | */ |
178 | int ipc_call_sync(phone_t *phone, call_t *request) |
179 | int ipc_call_sync(phone_t *phone, call_t *request) |
179 | { |
180 | { |
180 | answerbox_t sync_box; |
181 | answerbox_t sync_box; |
181 | 182 | ||
182 | ipc_answerbox_init(&sync_box, TASK); |
183 | ipc_answerbox_init(&sync_box, TASK); |
183 | 184 | ||
184 | /* We will receive data in a special box. */ |
185 | /* We will receive data in a special box. */ |
185 | request->callerbox = &sync_box; |
186 | request->callerbox = &sync_box; |
186 | 187 | ||
187 | ipc_call(phone, request); |
188 | ipc_call(phone, request); |
188 | if (!ipc_wait_for_call(&sync_box, SYNCH_NO_TIMEOUT, |
189 | if (!ipc_wait_for_call(&sync_box, SYNCH_NO_TIMEOUT, |
189 | SYNCH_FLAGS_INTERRUPTIBLE)) |
190 | SYNCH_FLAGS_INTERRUPTIBLE)) |
190 | return EINTR; |
191 | return EINTR; |
191 | return EOK; |
192 | return EOK; |
192 | } |
193 | } |
193 | 194 | ||
194 | /** 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. |
195 | * |
196 | * |
196 | * @param call Call structure to be answered. |
197 | * @param call Call structure to be answered. |
197 | */ |
198 | */ |
198 | static void _ipc_answer_free_call(call_t *call) |
199 | static void _ipc_answer_free_call(call_t *call) |
199 | { |
200 | { |
200 | answerbox_t *callerbox = call->callerbox; |
201 | answerbox_t *callerbox = call->callerbox; |
201 | 202 | ||
202 | call->flags |= IPC_CALL_ANSWERED; |
203 | call->flags |= IPC_CALL_ANSWERED; |
203 | 204 | ||
204 | if (call->flags & IPC_CALL_FORWARDED) { |
205 | if (call->flags & IPC_CALL_FORWARDED) { |
205 | if (call->caller_phone) { |
206 | if (call->caller_phone) { |
206 | /* Demasquerade the caller phone. */ |
207 | /* Demasquerade the caller phone. */ |
207 | call->data.phone = call->caller_phone; |
208 | call->data.phone = call->caller_phone; |
208 | } |
209 | } |
209 | } |
210 | } |
210 | 211 | ||
211 | spinlock_lock(&callerbox->lock); |
212 | spinlock_lock(&callerbox->lock); |
212 | list_append(&call->link, &callerbox->answers); |
213 | list_append(&call->link, &callerbox->answers); |
213 | spinlock_unlock(&callerbox->lock); |
214 | spinlock_unlock(&callerbox->lock); |
214 | waitq_wakeup(&callerbox->wq, WAKEUP_FIRST); |
215 | waitq_wakeup(&callerbox->wq, WAKEUP_FIRST); |
215 | } |
216 | } |
216 | 217 | ||
217 | /** Answer a message which is in a callee queue. |
218 | /** Answer a message which is in a callee queue. |
218 | * |
219 | * |
219 | * @param box Answerbox that is answering the message. |
220 | * @param box Answerbox that is answering the message. |
220 | * @param call Modified request that is being sent back. |
221 | * @param call Modified request that is being sent back. |
221 | */ |
222 | */ |
222 | void ipc_answer(answerbox_t *box, call_t *call) |
223 | void ipc_answer(answerbox_t *box, call_t *call) |
223 | { |
224 | { |
224 | /* Remove from active box */ |
225 | /* Remove from active box */ |
225 | spinlock_lock(&box->lock); |
226 | spinlock_lock(&box->lock); |
226 | list_remove(&call->link); |
227 | list_remove(&call->link); |
227 | spinlock_unlock(&box->lock); |
228 | spinlock_unlock(&box->lock); |
228 | /* Send back answer */ |
229 | /* Send back answer */ |
229 | _ipc_answer_free_call(call); |
230 | _ipc_answer_free_call(call); |
230 | } |
231 | } |
231 | 232 | ||
232 | /** Simulate sending back a message. |
233 | /** Simulate sending back a message. |
233 | * |
234 | * |
234 | * Most errors are better handled by forming a normal backward |
235 | * Most errors are better handled by forming a normal backward |
235 | * message and sending it as a normal answer. |
236 | * message and sending it as a normal answer. |
236 | * |
237 | * |
237 | * @param phone Phone structure the call should appear to come from. |
238 | * @param phone Phone structure the call should appear to come from. |
238 | * @param call Call structure to be answered. |
239 | * @param call Call structure to be answered. |
239 | * @param err Return value to be used for the answer. |
240 | * @param err Return value to be used for the answer. |
240 | */ |
241 | */ |
241 | 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) |
242 | { |
243 | { |
243 | call->data.phone = phone; |
244 | call->data.phone = phone; |
244 | atomic_inc(&phone->active_calls); |
245 | atomic_inc(&phone->active_calls); |
245 | IPC_SET_RETVAL(call->data, err); |
246 | IPC_SET_RETVAL(call->data, err); |
246 | _ipc_answer_free_call(call); |
247 | _ipc_answer_free_call(call); |
247 | } |
248 | } |
248 | 249 | ||
249 | /** Unsafe unchecking version of ipc_call. |
250 | /** Unsafe unchecking version of ipc_call. |
250 | * |
251 | * |
251 | * @param phone Phone structure the call comes from. |
252 | * @param phone Phone structure the call comes from. |
252 | * @param box Destination answerbox structure. |
253 | * @param box Destination answerbox structure. |
253 | * @param call Call structure with request. |
254 | * @param call Call structure with request. |
254 | */ |
255 | */ |
255 | 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) |
256 | { |
257 | { |
257 | if (!(call->flags & IPC_CALL_FORWARDED)) { |
258 | if (!(call->flags & IPC_CALL_FORWARDED)) { |
258 | atomic_inc(&phone->active_calls); |
259 | atomic_inc(&phone->active_calls); |
259 | call->data.phone = phone; |
260 | call->data.phone = phone; |
260 | } |
261 | } |
261 | 262 | ||
262 | spinlock_lock(&box->lock); |
263 | spinlock_lock(&box->lock); |
263 | list_append(&call->link, &box->calls); |
264 | list_append(&call->link, &box->calls); |
264 | spinlock_unlock(&box->lock); |
265 | spinlock_unlock(&box->lock); |
265 | waitq_wakeup(&box->wq, WAKEUP_FIRST); |
266 | waitq_wakeup(&box->wq, WAKEUP_FIRST); |
266 | } |
267 | } |
267 | 268 | ||
268 | /** Send an asynchronous request using a phone to an answerbox. |
269 | /** Send an asynchronous request using a phone to an answerbox. |
269 | * |
270 | * |
270 | * @param phone Phone structure the call comes from and which is |
271 | * @param phone Phone structure the call comes from and which is |
271 | * connected to the destination answerbox. |
272 | * connected to the destination answerbox. |
272 | * @param call Call structure with request. |
273 | * @param call Call structure with request. |
273 | * |
274 | * |
274 | * @return Return 0 on success, ENOENT on error. |
275 | * @return Return 0 on success, ENOENT on error. |
275 | */ |
276 | */ |
276 | int ipc_call(phone_t *phone, call_t *call) |
277 | int ipc_call(phone_t *phone, call_t *call) |
277 | { |
278 | { |
278 | answerbox_t *box; |
279 | answerbox_t *box; |
279 | 280 | ||
280 | mutex_lock(&phone->lock); |
281 | mutex_lock(&phone->lock); |
281 | if (phone->state != IPC_PHONE_CONNECTED) { |
282 | if (phone->state != IPC_PHONE_CONNECTED) { |
282 | mutex_unlock(&phone->lock); |
283 | mutex_unlock(&phone->lock); |
283 | if (call->flags & IPC_CALL_FORWARDED) { |
284 | if (call->flags & IPC_CALL_FORWARDED) { |
284 | IPC_SET_RETVAL(call->data, EFORWARD); |
285 | IPC_SET_RETVAL(call->data, EFORWARD); |
285 | _ipc_answer_free_call(call); |
286 | _ipc_answer_free_call(call); |
286 | } else { |
287 | } else { |
287 | if (phone->state == IPC_PHONE_HUNGUP) |
288 | if (phone->state == IPC_PHONE_HUNGUP) |
288 | ipc_backsend_err(phone, call, EHANGUP); |
289 | ipc_backsend_err(phone, call, EHANGUP); |
289 | else |
290 | else |
290 | ipc_backsend_err(phone, call, ENOENT); |
291 | ipc_backsend_err(phone, call, ENOENT); |
291 | } |
292 | } |
292 | return ENOENT; |
293 | return ENOENT; |
293 | } |
294 | } |
294 | box = phone->callee; |
295 | box = phone->callee; |
295 | _ipc_call(phone, box, call); |
296 | _ipc_call(phone, box, call); |
296 | 297 | ||
297 | mutex_unlock(&phone->lock); |
298 | mutex_unlock(&phone->lock); |
298 | return 0; |
299 | return 0; |
299 | } |
300 | } |
300 | 301 | ||
301 | /** Disconnect phone from answerbox. |
302 | /** Disconnect phone from answerbox. |
302 | * |
303 | * |
303 | * 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 |
304 | * lazily later. |
305 | * lazily later. |
305 | * |
306 | * |
306 | * @param phone Phone structure to be hung up. |
307 | * @param phone Phone structure to be hung up. |
307 | * |
308 | * |
308 | * @return Return 0 if the phone is disconnected. |
309 | * @return Return 0 if the phone is disconnected. |
309 | * Return -1 if the phone was already disconnected. |
310 | * Return -1 if the phone was already disconnected. |
310 | */ |
311 | */ |
311 | int ipc_phone_hangup(phone_t *phone) |
312 | int ipc_phone_hangup(phone_t *phone) |
312 | { |
313 | { |
313 | answerbox_t *box; |
314 | answerbox_t *box; |
314 | call_t *call; |
315 | call_t *call; |
315 | 316 | ||
316 | mutex_lock(&phone->lock); |
317 | mutex_lock(&phone->lock); |
317 | if (phone->state == IPC_PHONE_FREE || |
318 | if (phone->state == IPC_PHONE_FREE || |
318 | phone->state == IPC_PHONE_HUNGUP || |
319 | phone->state == IPC_PHONE_HUNGUP || |
319 | phone->state == IPC_PHONE_CONNECTING) { |
320 | phone->state == IPC_PHONE_CONNECTING) { |
320 | mutex_unlock(&phone->lock); |
321 | mutex_unlock(&phone->lock); |
321 | return -1; |
322 | return -1; |
322 | } |
323 | } |
323 | box = phone->callee; |
324 | box = phone->callee; |
324 | if (phone->state != IPC_PHONE_SLAMMED) { |
325 | if (phone->state != IPC_PHONE_SLAMMED) { |
325 | /* Remove myself from answerbox */ |
326 | /* Remove myself from answerbox */ |
326 | spinlock_lock(&box->lock); |
327 | spinlock_lock(&box->lock); |
327 | list_remove(&phone->link); |
328 | list_remove(&phone->link); |
328 | spinlock_unlock(&box->lock); |
329 | spinlock_unlock(&box->lock); |
329 | 330 | ||
330 | if (phone->state != IPC_PHONE_SLAMMED) { |
331 | if (phone->state != IPC_PHONE_SLAMMED) { |
331 | call = ipc_call_alloc(0); |
332 | call = ipc_call_alloc(0); |
332 | IPC_SET_METHOD(call->data, IPC_M_PHONE_HUNGUP); |
333 | IPC_SET_METHOD(call->data, IPC_M_PHONE_HUNGUP); |
333 | call->flags |= IPC_CALL_DISCARD_ANSWER; |
334 | call->flags |= IPC_CALL_DISCARD_ANSWER; |
334 | _ipc_call(phone, box, call); |
335 | _ipc_call(phone, box, call); |
335 | } |
336 | } |
336 | } |
337 | } |
337 | 338 | ||
338 | phone->state = IPC_PHONE_HUNGUP; |
339 | phone->state = IPC_PHONE_HUNGUP; |
339 | mutex_unlock(&phone->lock); |
340 | mutex_unlock(&phone->lock); |
340 | 341 | ||
341 | return 0; |
342 | return 0; |
342 | } |
343 | } |
343 | 344 | ||
344 | /** Forwards call from one answerbox to another one. |
345 | /** Forwards call from one answerbox to another one. |
345 | * |
346 | * |
346 | * @param call Call structure to be redirected. |
347 | * @param call Call structure to be redirected. |
347 | * @param newphone Phone structure to target answerbox. |
348 | * @param newphone Phone structure to target answerbox. |
348 | * @param oldbox Old answerbox structure. |
349 | * @param oldbox Old answerbox structure. |
349 | * @param mode Flags that specify mode of the forward operation. |
350 | * @param mode Flags that specify mode of the forward operation. |
350 | * |
351 | * |
351 | * @return Return 0 if forwarding succeeded or an error code if |
352 | * @return Return 0 if forwarding succeeded or an error code if |
352 | * there was error. |
353 | * there was error. |
353 | * |
354 | * |
354 | * The return value serves only as an information for the forwarder, |
355 | * The return value serves only as an information for the forwarder, |
355 | * the original caller is notified automatically with EFORWARD. |
356 | * the original caller is notified automatically with EFORWARD. |
356 | */ |
357 | */ |
357 | 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) |
358 | { |
359 | { |
359 | spinlock_lock(&oldbox->lock); |
360 | spinlock_lock(&oldbox->lock); |
360 | list_remove(&call->link); |
361 | list_remove(&call->link); |
361 | spinlock_unlock(&oldbox->lock); |
362 | spinlock_unlock(&oldbox->lock); |
362 | 363 | ||
363 | if (mode & IPC_FF_ROUTE_FROM_ME) { |
364 | if (mode & IPC_FF_ROUTE_FROM_ME) { |
364 | if (!call->caller_phone) |
365 | if (!call->caller_phone) |
365 | call->caller_phone = call->data.phone; |
366 | call->caller_phone = call->data.phone; |
366 | call->data.phone = newphone; |
367 | call->data.phone = newphone; |
367 | } |
368 | } |
368 | 369 | ||
369 | return ipc_call(newphone, call); |
370 | return ipc_call(newphone, call); |
370 | } |
371 | } |
371 | 372 | ||
372 | 373 | ||
373 | /** Wait for a phone call. |
374 | /** Wait for a phone call. |
374 | * |
375 | * |
375 | * @param box Answerbox expecting the call. |
376 | * @param box Answerbox expecting the call. |
376 | * @param usec Timeout in microseconds. See documentation for |
377 | * @param usec Timeout in microseconds. See documentation for |
377 | * waitq_sleep_timeout() for decription of its special |
378 | * waitq_sleep_timeout() for decription of its special |
378 | * meaning. |
379 | * meaning. |
379 | * @param flags Select mode of sleep operation. See documentation for |
380 | * @param flags Select mode of sleep operation. See documentation for |
380 | * waitq_sleep_timeout() for description of its special |
381 | * waitq_sleep_timeout() for description of its special |
381 | * meaning. |
382 | * meaning. |
382 | * @return Recived call structure or NULL. |
383 | * @return Recived call structure or NULL. |
383 | * |
384 | * |
384 | * 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. |
385 | */ |
386 | */ |
386 | 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) |
387 | { |
388 | { |
388 | call_t *request; |
389 | call_t *request; |
389 | ipl_t ipl; |
390 | ipl_t ipl; |
390 | int rc; |
391 | int rc; |
391 | 392 | ||
392 | restart: |
393 | restart: |
393 | rc = waitq_sleep_timeout(&box->wq, usec, flags); |
394 | rc = waitq_sleep_timeout(&box->wq, usec, flags); |
394 | if (SYNCH_FAILED(rc)) |
395 | if (SYNCH_FAILED(rc)) |
395 | return NULL; |
396 | return NULL; |
396 | 397 | ||
397 | spinlock_lock(&box->lock); |
398 | spinlock_lock(&box->lock); |
398 | if (!list_empty(&box->irq_notifs)) { |
399 | if (!list_empty(&box->irq_notifs)) { |
399 | ipl = interrupts_disable(); |
400 | ipl = interrupts_disable(); |
400 | spinlock_lock(&box->irq_lock); |
401 | spinlock_lock(&box->irq_lock); |
401 | 402 | ||
402 | request = list_get_instance(box->irq_notifs.next, call_t, link); |
403 | request = list_get_instance(box->irq_notifs.next, call_t, link); |
403 | list_remove(&request->link); |
404 | list_remove(&request->link); |
404 | 405 | ||
405 | spinlock_unlock(&box->irq_lock); |
406 | spinlock_unlock(&box->irq_lock); |
406 | interrupts_restore(ipl); |
407 | interrupts_restore(ipl); |
407 | } else if (!list_empty(&box->answers)) { |
408 | } else if (!list_empty(&box->answers)) { |
408 | /* Handle asynchronous answers */ |
409 | /* Handle asynchronous answers */ |
409 | request = list_get_instance(box->answers.next, call_t, link); |
410 | request = list_get_instance(box->answers.next, call_t, link); |
410 | list_remove(&request->link); |
411 | list_remove(&request->link); |
411 | atomic_dec(&request->data.phone->active_calls); |
412 | atomic_dec(&request->data.phone->active_calls); |
412 | } else if (!list_empty(&box->calls)) { |
413 | } else if (!list_empty(&box->calls)) { |
413 | /* Handle requests */ |
414 | /* Handle requests */ |
414 | request = list_get_instance(box->calls.next, call_t, link); |
415 | request = list_get_instance(box->calls.next, call_t, link); |
415 | list_remove(&request->link); |
416 | list_remove(&request->link); |
416 | /* Append request to dispatch queue */ |
417 | /* Append request to dispatch queue */ |
417 | list_append(&request->link, &box->dispatched_calls); |
418 | list_append(&request->link, &box->dispatched_calls); |
418 | } else { |
419 | } else { |
419 | /* This can happen regularly after ipc_cleanup */ |
420 | /* This can happen regularly after ipc_cleanup */ |
420 | spinlock_unlock(&box->lock); |
421 | spinlock_unlock(&box->lock); |
421 | goto restart; |
422 | goto restart; |
422 | } |
423 | } |
423 | spinlock_unlock(&box->lock); |
424 | spinlock_unlock(&box->lock); |
424 | return request; |
425 | return request; |
425 | } |
426 | } |
426 | 427 | ||
427 | /** Answer all calls from list with EHANGUP answer. |
428 | /** Answer all calls from list with EHANGUP answer. |
428 | * |
429 | * |
429 | * @param lst Head of the list to be cleaned up. |
430 | * @param lst Head of the list to be cleaned up. |
430 | */ |
431 | */ |
431 | static void ipc_cleanup_call_list(link_t *lst) |
432 | void ipc_cleanup_call_list(link_t *lst) |
432 | { |
433 | { |
433 | call_t *call; |
434 | call_t *call; |
434 | 435 | ||
435 | while (!list_empty(lst)) { |
436 | while (!list_empty(lst)) { |
436 | call = list_get_instance(lst->next, call_t, link); |
437 | call = list_get_instance(lst->next, call_t, link); |
437 | if (call->buffer) |
438 | if (call->buffer) |
438 | free(call->buffer); |
439 | free(call->buffer); |
439 | list_remove(&call->link); |
440 | list_remove(&call->link); |
440 | 441 | ||
441 | IPC_SET_RETVAL(call->data, EHANGUP); |
442 | IPC_SET_RETVAL(call->data, EHANGUP); |
442 | _ipc_answer_free_call(call); |
443 | _ipc_answer_free_call(call); |
443 | } |
444 | } |
444 | } |
445 | } |
445 | 446 | ||
446 | /** Disconnects all phones connected to an answerbox. |
447 | /** Disconnects all phones connected to an answerbox. |
447 | * |
448 | * |
448 | * @param box Answerbox to disconnect phones from. |
449 | * @param box Answerbox to disconnect phones from. |
449 | * @param notify_box If true, the answerbox will get a hangup message for |
450 | * @param notify_box If true, the answerbox will get a hangup message for |
450 | * each disconnected phone. |
451 | * each disconnected phone. |
451 | */ |
452 | */ |
452 | static void ipc_answerbox_slam_phones(answerbox_t *box, bool notify_box) |
453 | void ipc_answerbox_slam_phones(answerbox_t *box, bool notify_box) |
453 | { |
454 | { |
454 | phone_t *phone; |
455 | phone_t *phone; |
455 | DEADLOCK_PROBE_INIT(p_phonelck); |
456 | DEADLOCK_PROBE_INIT(p_phonelck); |
456 | ipl_t ipl; |
457 | ipl_t ipl; |
457 | call_t *call; |
458 | call_t *call; |
458 | 459 | ||
459 | call = notify_box ? ipc_call_alloc(0) : NULL; |
460 | call = notify_box ? ipc_call_alloc(0) : NULL; |
460 | 461 | ||
461 | /* Disconnect all phones connected to our answerbox */ |
462 | /* Disconnect all phones connected to our answerbox */ |
462 | restart_phones: |
463 | restart_phones: |
463 | ipl = interrupts_disable(); |
464 | ipl = interrupts_disable(); |
464 | spinlock_lock(&box->lock); |
465 | spinlock_lock(&box->lock); |
465 | while (!list_empty(&box->connected_phones)) { |
466 | while (!list_empty(&box->connected_phones)) { |
466 | phone = list_get_instance(box->connected_phones.next, |
467 | phone = list_get_instance(box->connected_phones.next, |
467 | phone_t, link); |
468 | phone_t, link); |
468 | if (SYNCH_FAILED(mutex_trylock(&phone->lock))) { |
469 | if (SYNCH_FAILED(mutex_trylock(&phone->lock))) { |
469 | spinlock_unlock(&box->lock); |
470 | spinlock_unlock(&box->lock); |
470 | interrupts_restore(ipl); |
471 | interrupts_restore(ipl); |
471 | DEADLOCK_PROBE(p_phonelck, DEADLOCK_THRESHOLD); |
472 | DEADLOCK_PROBE(p_phonelck, DEADLOCK_THRESHOLD); |
472 | goto restart_phones; |
473 | goto restart_phones; |
473 | } |
474 | } |
474 | 475 | ||
475 | /* Disconnect phone */ |
476 | /* Disconnect phone */ |
476 | ASSERT(phone->state == IPC_PHONE_CONNECTED); |
477 | ASSERT(phone->state == IPC_PHONE_CONNECTED); |
477 | 478 | ||
478 | list_remove(&phone->link); |
479 | list_remove(&phone->link); |
479 | phone->state = IPC_PHONE_SLAMMED; |
480 | phone->state = IPC_PHONE_SLAMMED; |
480 | 481 | ||
481 | if (notify_box) { |
482 | if (notify_box) { |
482 | mutex_unlock(&phone->lock); |
483 | mutex_unlock(&phone->lock); |
483 | spinlock_unlock(&box->lock); |
484 | spinlock_unlock(&box->lock); |
484 | interrupts_restore(ipl); |
485 | interrupts_restore(ipl); |
485 | 486 | ||
486 | /* |
487 | /* |
487 | * Send one message to the answerbox for each |
488 | * Send one message to the answerbox for each |
488 | * phone. Used to make sure the kbox thread |
489 | * phone. Used to make sure the kbox thread |
489 | * wakes up after the last phone has been |
490 | * wakes up after the last phone has been |
490 | * disconnected. |
491 | * disconnected. |
491 | */ |
492 | */ |
492 | IPC_SET_METHOD(call->data, IPC_M_PHONE_HUNGUP); |
493 | IPC_SET_METHOD(call->data, IPC_M_PHONE_HUNGUP); |
493 | call->flags |= IPC_CALL_DISCARD_ANSWER; |
494 | call->flags |= IPC_CALL_DISCARD_ANSWER; |
494 | _ipc_call(phone, box, call); |
495 | _ipc_call(phone, box, call); |
495 | 496 | ||
496 | /* Allocate another call in advance */ |
497 | /* Allocate another call in advance */ |
497 | call = ipc_call_alloc(0); |
498 | call = ipc_call_alloc(0); |
498 | 499 | ||
499 | /* Must start again */ |
500 | /* Must start again */ |
500 | goto restart_phones; |
501 | goto restart_phones; |
501 | } |
502 | } |
502 | 503 | ||
503 | mutex_unlock(&phone->lock); |
504 | mutex_unlock(&phone->lock); |
504 | } |
505 | } |
505 | 506 | ||
506 | spinlock_unlock(&box->lock); |
507 | spinlock_unlock(&box->lock); |
507 | interrupts_restore(ipl); |
508 | interrupts_restore(ipl); |
508 | 509 | ||
509 | /* Free unused call */ |
510 | /* Free unused call */ |
510 | if (call) ipc_call_free(call); |
511 | if (call) ipc_call_free(call); |
511 | } |
512 | } |
512 | 513 | ||
513 | #ifdef CONFIG_UDEBUG |
- | |
514 | - | ||
515 | static void ipc_kbox_cleanup() |
- | |
516 | { |
- | |
517 | bool have_kb_thread; |
- | |
518 | - | ||
519 | /* Only hold kb_cleanup_lock while setting kb_finished - this is enough */ |
- | |
520 | mutex_lock(&TASK->kb_cleanup_lock); |
- | |
521 | TASK->kb_finished = true; |
- | |
522 | mutex_unlock(&TASK->kb_cleanup_lock); |
- | |
523 | - | ||
524 | have_kb_thread = (TASK->kb_thread != NULL); |
- | |
525 | - | ||
526 | /* From now on nobody will try to connect phones or attach kbox threads */ |
- | |
527 | - | ||
528 | /* |
- | |
529 | * Disconnect all phones connected to our kbox. Passing true for |
- | |
530 | * notify_box causes a HANGUP message to be inserted for each |
- | |
531 | * disconnected phone. This ensures the kbox thread is going to |
- | |
532 | * wake up and terminate. |
- | |
533 | */ |
- | |
534 | ipc_answerbox_slam_phones(&TASK->kernel_box, have_kb_thread); |
- | |
535 | - | ||
536 | if (have_kb_thread) { |
- | |
537 | printf("join kb_thread..\n"); |
- | |
538 | thread_join(TASK->kb_thread); |
- | |
539 | thread_detach(TASK->kb_thread); |
- | |
540 | printf("join done\n"); |
- | |
541 | TASK->kb_thread = NULL; |
- | |
542 | } |
- | |
543 | - | ||
544 | /* Answer all messages in 'calls' and 'dispatched_calls' queues */ |
- | |
545 | spinlock_lock(&TASK->kernel_box.lock); |
- | |
546 | ipc_cleanup_call_list(&TASK->kernel_box.dispatched_calls); |
- | |
547 | ipc_cleanup_call_list(&TASK->kernel_box.calls); |
- | |
548 | spinlock_unlock(&TASK->kernel_box.lock); |
- | |
549 | } |
- | |
550 | - | ||
551 | #endif |
- | |
552 | - | ||
553 | /** Cleans up all IPC communication of the current task. |
514 | /** Cleans up all IPC communication of the current task. |
554 | * |
515 | * |
555 | * Note: ipc_hangup sets returning answerbox to TASK->answerbox, you |
516 | * Note: ipc_hangup sets returning answerbox to TASK->answerbox, you |
556 | * have to change it as well if you want to cleanup other tasks than TASK. |
517 | * have to change it as well if you want to cleanup other tasks than TASK. |
557 | */ |
518 | */ |
558 | void ipc_cleanup(void) |
519 | void ipc_cleanup(void) |
559 | { |
520 | { |
560 | int i; |
521 | int i; |
561 | call_t *call; |
522 | call_t *call; |
562 | 523 | ||
563 | /* Disconnect all our phones ('ipc_phone_hangup') */ |
524 | /* Disconnect all our phones ('ipc_phone_hangup') */ |
564 | for (i = 0; i < IPC_MAX_PHONES; i++) |
525 | for (i = 0; i < IPC_MAX_PHONES; i++) |
565 | ipc_phone_hangup(&TASK->phones[i]); |
526 | ipc_phone_hangup(&TASK->phones[i]); |
566 | 527 | ||
567 | /* Disconnect all connected irqs */ |
528 | /* Disconnect all connected irqs */ |
568 | ipc_irq_cleanup(&TASK->answerbox); |
529 | ipc_irq_cleanup(&TASK->answerbox); |
569 | 530 | ||
570 | /* Disconnect all phones connected to our regular answerbox */ |
531 | /* Disconnect all phones connected to our regular answerbox */ |
571 | ipc_answerbox_slam_phones(&TASK->answerbox, false); |
532 | ipc_answerbox_slam_phones(&TASK->answerbox, false); |
572 | 533 | ||
573 | #ifdef CONFIG_UDEBUG |
534 | #ifdef CONFIG_UDEBUG |
574 | /* Clean up kbox thread and communications */ |
535 | /* Clean up kbox thread and communications */ |
575 | ipc_kbox_cleanup(); |
536 | ipc_kbox_cleanup(); |
576 | #endif |
537 | #endif |
577 | 538 | ||
578 | /* Answer all messages in 'calls' and 'dispatched_calls' queues */ |
539 | /* Answer all messages in 'calls' and 'dispatched_calls' queues */ |
579 | spinlock_lock(&TASK->answerbox.lock); |
540 | spinlock_lock(&TASK->answerbox.lock); |
580 | ipc_cleanup_call_list(&TASK->answerbox.dispatched_calls); |
541 | ipc_cleanup_call_list(&TASK->answerbox.dispatched_calls); |
581 | ipc_cleanup_call_list(&TASK->answerbox.calls); |
542 | ipc_cleanup_call_list(&TASK->answerbox.calls); |
582 | spinlock_unlock(&TASK->answerbox.lock); |
543 | spinlock_unlock(&TASK->answerbox.lock); |
583 | 544 | ||
584 | /* Wait for all async answers to arrive */ |
545 | /* Wait for all async answers to arrive */ |
585 | while (1) { |
546 | while (1) { |
586 | /* Go through all phones, until all are FREE... */ |
547 | /* Go through all phones, until all are FREE... */ |
587 | /* Locking not needed, no one else should modify |
548 | /* Locking not needed, no one else should modify |
588 | * it, when we are in cleanup */ |
549 | * it, when we are in cleanup */ |
589 | for (i = 0; i < IPC_MAX_PHONES; i++) { |
550 | for (i = 0; i < IPC_MAX_PHONES; i++) { |
590 | if (TASK->phones[i].state == IPC_PHONE_HUNGUP && |
551 | if (TASK->phones[i].state == IPC_PHONE_HUNGUP && |
591 | atomic_get(&TASK->phones[i].active_calls) == 0) |
552 | atomic_get(&TASK->phones[i].active_calls) == 0) |
592 | TASK->phones[i].state = IPC_PHONE_FREE; |
553 | TASK->phones[i].state = IPC_PHONE_FREE; |
593 | 554 | ||
594 | /* Just for sure, we might have had some |
555 | /* Just for sure, we might have had some |
595 | * IPC_PHONE_CONNECTING phones */ |
556 | * IPC_PHONE_CONNECTING phones */ |
596 | if (TASK->phones[i].state == IPC_PHONE_CONNECTED) |
557 | if (TASK->phones[i].state == IPC_PHONE_CONNECTED) |
597 | ipc_phone_hangup(&TASK->phones[i]); |
558 | ipc_phone_hangup(&TASK->phones[i]); |
598 | /* If the hangup succeeded, it has sent a HANGUP |
559 | /* If the hangup succeeded, it has sent a HANGUP |
599 | * message, the IPC is now in HUNGUP state, we |
560 | * message, the IPC is now in HUNGUP state, we |
600 | * wait for the reply to come */ |
561 | * wait for the reply to come */ |
601 | 562 | ||
602 | if (TASK->phones[i].state != IPC_PHONE_FREE) |
563 | if (TASK->phones[i].state != IPC_PHONE_FREE) |
603 | break; |
564 | break; |
604 | } |
565 | } |
605 | /* Voila, got into cleanup */ |
566 | /* Voila, got into cleanup */ |
606 | if (i == IPC_MAX_PHONES) |
567 | if (i == IPC_MAX_PHONES) |
607 | break; |
568 | break; |
608 | 569 | ||
609 | call = ipc_wait_for_call(&TASK->answerbox, SYNCH_NO_TIMEOUT, |
570 | call = ipc_wait_for_call(&TASK->answerbox, SYNCH_NO_TIMEOUT, |
610 | SYNCH_FLAGS_NONE); |
571 | SYNCH_FLAGS_NONE); |
611 | ASSERT((call->flags & IPC_CALL_ANSWERED) || |
572 | ASSERT((call->flags & IPC_CALL_ANSWERED) || |
612 | (call->flags & IPC_CALL_NOTIF)); |
573 | (call->flags & IPC_CALL_NOTIF)); |
613 | ASSERT(!(call->flags & IPC_CALL_STATIC_ALLOC)); |
574 | ASSERT(!(call->flags & IPC_CALL_STATIC_ALLOC)); |
614 | 575 | ||
615 | atomic_dec(&TASK->active_calls); |
576 | atomic_dec(&TASK->active_calls); |
616 | ipc_call_free(call); |
577 | ipc_call_free(call); |
617 | } |
578 | } |
618 | } |
579 | } |
619 | 580 | ||
620 | 581 | ||
621 | /** Initilize IPC subsystem */ |
582 | /** Initilize IPC subsystem */ |
622 | void ipc_init(void) |
583 | void ipc_init(void) |
623 | { |
584 | { |
624 | ipc_call_slab = slab_cache_create("ipc_call", sizeof(call_t), 0, NULL, |
585 | ipc_call_slab = slab_cache_create("ipc_call", sizeof(call_t), 0, NULL, |
625 | NULL, 0); |
586 | NULL, 0); |
626 | } |
587 | } |
627 | 588 | ||
628 | 589 | ||
629 | /** List answerbox contents. |
590 | /** List answerbox contents. |
630 | * |
591 | * |
631 | * @param taskid Task ID. |
592 | * @param taskid Task ID. |
632 | */ |
593 | */ |
633 | void ipc_print_task(task_id_t taskid) |
594 | void ipc_print_task(task_id_t taskid) |
634 | { |
595 | { |
635 | task_t *task; |
596 | task_t *task; |
636 | int i; |
597 | int i; |
637 | call_t *call; |
598 | call_t *call; |
638 | link_t *tmp; |
599 | link_t *tmp; |
639 | 600 | ||
640 | spinlock_lock(&tasks_lock); |
601 | spinlock_lock(&tasks_lock); |
641 | task = task_find_by_id(taskid); |
602 | task = task_find_by_id(taskid); |
642 | if (task) |
603 | if (task) |
643 | spinlock_lock(&task->lock); |
604 | spinlock_lock(&task->lock); |
644 | spinlock_unlock(&tasks_lock); |
605 | spinlock_unlock(&tasks_lock); |
645 | if (!task) |
606 | if (!task) |
646 | return; |
607 | return; |
647 | 608 | ||
648 | /* Print opened phones & details */ |
609 | /* Print opened phones & details */ |
649 | printf("PHONE:\n"); |
610 | printf("PHONE:\n"); |
650 | for (i = 0; i < IPC_MAX_PHONES; i++) { |
611 | for (i = 0; i < IPC_MAX_PHONES; i++) { |
651 | if (SYNCH_FAILED(mutex_trylock(&task->phones[i].lock))) { |
612 | if (SYNCH_FAILED(mutex_trylock(&task->phones[i].lock))) { |
652 | printf("%d: mutex busy\n", i); |
613 | printf("%d: mutex busy\n", i); |
653 | continue; |
614 | continue; |
654 | } |
615 | } |
655 | if (task->phones[i].state != IPC_PHONE_FREE) { |
616 | if (task->phones[i].state != IPC_PHONE_FREE) { |
656 | printf("%d: ", i); |
617 | printf("%d: ", i); |
657 | switch (task->phones[i].state) { |
618 | switch (task->phones[i].state) { |
658 | case IPC_PHONE_CONNECTING: |
619 | case IPC_PHONE_CONNECTING: |
659 | printf("connecting "); |
620 | printf("connecting "); |
660 | break; |
621 | break; |
661 | case IPC_PHONE_CONNECTED: |
622 | case IPC_PHONE_CONNECTED: |
662 | printf("connected to: %p ", |
623 | printf("connected to: %p ", |
663 | task->phones[i].callee); |
624 | task->phones[i].callee); |
664 | break; |
625 | break; |
665 | case IPC_PHONE_SLAMMED: |
626 | case IPC_PHONE_SLAMMED: |
666 | printf("slammed by: %p ", |
627 | printf("slammed by: %p ", |
667 | task->phones[i].callee); |
628 | task->phones[i].callee); |
668 | break; |
629 | break; |
669 | case IPC_PHONE_HUNGUP: |
630 | case IPC_PHONE_HUNGUP: |
670 | printf("hung up - was: %p ", |
631 | printf("hung up - was: %p ", |
671 | task->phones[i].callee); |
632 | task->phones[i].callee); |
672 | break; |
633 | break; |
673 | default: |
634 | default: |
674 | break; |
635 | break; |
675 | } |
636 | } |
676 | printf("active: %ld\n", |
637 | printf("active: %ld\n", |
677 | atomic_get(&task->phones[i].active_calls)); |
638 | atomic_get(&task->phones[i].active_calls)); |
678 | } |
639 | } |
679 | mutex_unlock(&task->phones[i].lock); |
640 | mutex_unlock(&task->phones[i].lock); |
680 | } |
641 | } |
681 | 642 | ||
682 | 643 | ||
683 | /* Print answerbox - calls */ |
644 | /* Print answerbox - calls */ |
684 | spinlock_lock(&task->answerbox.lock); |
645 | spinlock_lock(&task->answerbox.lock); |
685 | printf("ABOX - CALLS:\n"); |
646 | printf("ABOX - CALLS:\n"); |
686 | for (tmp = task->answerbox.calls.next; tmp != &task->answerbox.calls; |
647 | for (tmp = task->answerbox.calls.next; tmp != &task->answerbox.calls; |
687 | tmp = tmp->next) { |
648 | tmp = tmp->next) { |
688 | call = list_get_instance(tmp, call_t, link); |
649 | call = list_get_instance(tmp, call_t, link); |
689 | printf("Callid: %p Srctask:%" PRIu64 " M:%" PRIun |
650 | printf("Callid: %p Srctask:%" PRIu64 " M:%" PRIun |
690 | " A1:%" PRIun " A2:%" PRIun " A3:%" PRIun |
651 | " A1:%" PRIun " A2:%" PRIun " A3:%" PRIun |
691 | " A4:%" PRIun " A5:%" PRIun " Flags:%x\n", call, |
652 | " A4:%" PRIun " A5:%" PRIun " Flags:%x\n", call, |
692 | call->sender->taskid, |
653 | call->sender->taskid, |
693 | IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
654 | IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
694 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), |
655 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), |
695 | IPC_GET_ARG4(call->data), IPC_GET_ARG5(call->data), |
656 | IPC_GET_ARG4(call->data), IPC_GET_ARG5(call->data), |
696 | call->flags); |
657 | call->flags); |
697 | } |
658 | } |
698 | /* Print answerbox - calls */ |
659 | /* Print answerbox - calls */ |
699 | printf("ABOX - DISPATCHED CALLS:\n"); |
660 | printf("ABOX - DISPATCHED CALLS:\n"); |
700 | for (tmp = task->answerbox.dispatched_calls.next; |
661 | for (tmp = task->answerbox.dispatched_calls.next; |
701 | tmp != &task->answerbox.dispatched_calls; |
662 | tmp != &task->answerbox.dispatched_calls; |
702 | tmp = tmp->next) { |
663 | tmp = tmp->next) { |
703 | call = list_get_instance(tmp, call_t, link); |
664 | call = list_get_instance(tmp, call_t, link); |
704 | printf("Callid: %p Srctask:%" PRIu64 " M:%" PRIun |
665 | printf("Callid: %p Srctask:%" PRIu64 " M:%" PRIun |
705 | " A1:%" PRIun " A2:%" PRIun " A3:%" PRIun |
666 | " A1:%" PRIun " A2:%" PRIun " A3:%" PRIun |
706 | " A4:%" PRIun " A5:%" PRIun " Flags:%x\n", call, |
667 | " A4:%" PRIun " A5:%" PRIun " Flags:%x\n", call, |
707 | call->sender->taskid, |
668 | call->sender->taskid, |
708 | IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
669 | IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
709 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), |
670 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), |
710 | IPC_GET_ARG4(call->data), IPC_GET_ARG5(call->data), |
671 | IPC_GET_ARG4(call->data), IPC_GET_ARG5(call->data), |
711 | call->flags); |
672 | call->flags); |
712 | } |
673 | } |
713 | /* Print answerbox - calls */ |
674 | /* Print answerbox - calls */ |
714 | printf("ABOX - ANSWERS:\n"); |
675 | printf("ABOX - ANSWERS:\n"); |
715 | for (tmp = task->answerbox.answers.next; |
676 | for (tmp = task->answerbox.answers.next; |
716 | tmp != &task->answerbox.answers; |
677 | tmp != &task->answerbox.answers; |
717 | tmp = tmp->next) { |
678 | tmp = tmp->next) { |
718 | call = list_get_instance(tmp, call_t, link); |
679 | call = list_get_instance(tmp, call_t, link); |
719 | printf("Callid:%p M:%" PRIun " A1:%" PRIun " A2:%" PRIun |
680 | printf("Callid:%p M:%" PRIun " A1:%" PRIun " A2:%" PRIun |
720 | " A3:%" PRIun " A4:%" PRIun " A5:%" PRIun " Flags:%x\n", |
681 | " A3:%" PRIun " A4:%" PRIun " A5:%" PRIun " Flags:%x\n", |
721 | call, IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
682 | call, IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
722 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), |
683 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), |
723 | IPC_GET_ARG4(call->data), IPC_GET_ARG5(call->data), |
684 | IPC_GET_ARG4(call->data), IPC_GET_ARG5(call->data), |
724 | call->flags); |
685 | call->flags); |
725 | } |
686 | } |
726 | 687 | ||
727 | spinlock_unlock(&task->answerbox.lock); |
688 | spinlock_unlock(&task->answerbox.lock); |
728 | spinlock_unlock(&task->lock); |
689 | spinlock_unlock(&task->lock); |
729 | } |
690 | } |
730 | 691 | ||
731 | #ifdef CONFIG_UDEBUG |
- | |
732 | - | ||
733 | #include <ipc/ipcrsc.h> |
- | |
734 | #include <print.h> |
- | |
735 | #include <udebug/udebug_ipc.h> |
- | |
736 | - | ||
737 | static void kbox_thread_proc(void *arg) |
- | |
738 | { |
- | |
739 | call_t *call; |
- | |
740 | int method; |
- | |
741 | bool done; |
- | |
742 | ipl_t ipl; |
- | |
743 | - | ||
744 | (void)arg; |
- | |
745 | printf("kbox_thread_proc()\n"); |
- | |
746 | done = false; |
- | |
747 | - | ||
748 | while (!done) { |
- | |
749 | //printf("kbox: wait for call\n"); |
- | |
750 | call = ipc_wait_for_call(&TASK->kernel_box, SYNCH_NO_TIMEOUT, |
- | |
751 | SYNCH_FLAGS_NONE); |
- | |
752 | - | ||
753 | if (call != NULL) { |
- | |
754 | method = IPC_GET_METHOD(call->data); |
- | |
755 | - | ||
756 | if (method == IPC_M_DEBUG_ALL) { |
- | |
757 | udebug_call_receive(call); |
- | |
758 | } |
- | |
759 | - | ||
760 | if (method == IPC_M_PHONE_HUNGUP) { |
- | |
761 | printf("kbox: handle hangup message\n"); |
- | |
762 | - | ||
763 | /* Was it our debugger, who hung up? */ |
- | |
764 | if (call->sender == TASK->udebug.debugger) { |
- | |
765 | /* Terminate debugging session (if any) */ |
- | |
766 | printf("kbox: terminate debug session\n"); |
- | |
767 | ipl = interrupts_disable(); |
- | |
768 | spinlock_lock(&TASK->lock); |
- | |
769 | udebug_task_cleanup(TASK); |
- | |
770 | spinlock_unlock(&TASK->lock); |
- | |
771 | interrupts_restore(ipl); |
- | |
772 | } else { |
- | |
773 | printf("kbox: was not debugger\n"); |
- | |
774 | } |
- | |
775 | - | ||
776 | printf("kbox: continue with hangup message\n"); |
- | |
777 | IPC_SET_RETVAL(call->data, 0); |
- | |
778 | ipc_answer(&TASK->kernel_box, call); |
- | |
779 | - | ||
780 | ipl = interrupts_disable(); |
- | |
781 | spinlock_lock(&TASK->lock); |
- | |
782 | spinlock_lock(&TASK->answerbox.lock); |
- | |
783 | if (list_empty(&TASK->answerbox.connected_phones)) { |
- | |
784 | /* Last phone has been disconnected */ |
- | |
785 | TASK->kb_thread = NULL; |
- | |
786 | done = true; |
- | |
787 | printf("phone list is empty\n"); |
- | |
788 | } |
- | |
789 | spinlock_unlock(&TASK->answerbox.lock); |
- | |
790 | spinlock_unlock(&TASK->lock); |
- | |
791 | interrupts_restore(ipl); |
- | |
792 | } |
- | |
793 | } |
- | |
794 | } |
- | |
795 | - | ||
796 | printf("kbox: finished\n"); |
- | |
797 | } |
- | |
798 | - | ||
799 | - | ||
800 | /** |
- | |
801 | * Connect phone to a task kernel-box specified by id. |
- | |
802 | * |
- | |
803 | * Note that this is not completely atomic. For optimisation reasons, |
- | |
804 | * The task might start cleaning up kbox after the phone has been connected |
- | |
805 | * and before a kbox thread has been created. This must be taken into account |
- | |
806 | * in the cleanup code. |
- | |
807 | * |
- | |
808 | * @return Phone id on success, or negative error code. |
- | |
809 | */ |
- | |
810 | int ipc_connect_kbox(task_id_t taskid) |
- | |
811 | { |
- | |
812 | int newphid; |
- | |
813 | task_t *ta; |
- | |
814 | thread_t *kb_thread; |
- | |
815 | ipl_t ipl; |
- | |
816 | - | ||
817 | ipl = interrupts_disable(); |
- | |
818 | spinlock_lock(&tasks_lock); |
- | |
819 | - | ||
820 | ta = task_find_by_id(taskid); |
- | |
821 | if (ta == NULL) { |
- | |
822 | spinlock_unlock(&tasks_lock); |
- | |
823 | interrupts_restore(ipl); |
- | |
824 | return ENOENT; |
- | |
825 | } |
- | |
826 | - | ||
827 | atomic_inc(&ta->refcount); |
- | |
828 | - | ||
829 | spinlock_unlock(&tasks_lock); |
- | |
830 | interrupts_restore(ipl); |
- | |
831 | - | ||
832 | mutex_lock(&ta->kb_cleanup_lock); |
- | |
833 | - | ||
834 | if (atomic_predec(&ta->refcount) == 0) { |
- | |
835 | mutex_unlock(&ta->kb_cleanup_lock); |
- | |
836 | task_destroy(ta); |
- | |
837 | return ENOENT; |
- | |
838 | } |
- | |
839 | - | ||
840 | if (ta->kb_finished != false) { |
- | |
841 | mutex_unlock(&ta->kb_cleanup_lock); |
- | |
842 | return EINVAL; |
- | |
843 | } |
- | |
844 | - | ||
845 | newphid = phone_alloc(); |
- | |
846 | if (newphid < 0) { |
- | |
847 | mutex_unlock(&ta->kb_cleanup_lock); |
- | |
848 | return ELIMIT; |
- | |
849 | } |
- | |
850 | - | ||
851 | /* Connect the newly allocated phone to the kbox */ |
- | |
852 | ipc_phone_connect(&TASK->phones[newphid], &ta->kernel_box); |
- | |
853 | - | ||
854 | if (ta->kb_thread != NULL) { |
- | |
855 | mutex_unlock(&ta->kb_cleanup_lock); |
- | |
856 | return newphid; |
- | |
857 | } |
- | |
858 | - | ||
859 | /* Create a kbox thread */ |
- | |
860 | kb_thread = thread_create(kbox_thread_proc, NULL, ta, 0, "kbox", false); |
- | |
861 | if (!kb_thread) { |
- | |
862 | mutex_unlock(&ta->kb_cleanup_lock); |
- | |
863 | return ENOMEM; |
- | |
864 | } |
- | |
865 | - | ||
866 | ta->kb_thread = kb_thread; |
- | |
867 | thread_ready(kb_thread); |
- | |
868 | - | ||
869 | mutex_unlock(&ta->kb_cleanup_lock); |
- | |
870 | - | ||
871 | return newphid; |
- | |
872 | } |
- | |
873 | - | ||
874 | #endif /* defined(CONFIG_UDEBUG) */ |
- | |
875 | - | ||
876 | /** @} |
692 | /** @} |
877 | */ |
693 | */ |
878 | 694 |