Rev 1568 | Rev 1582 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1568 | Rev 1573 | ||
---|---|---|---|
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 | /* Lock ordering |
29 | /* Lock ordering |
30 | * |
30 | * |
31 | * First the answerbox, then the phone |
31 | * First the answerbox, then the phone |
32 | */ |
32 | */ |
33 | 33 | ||
34 | #include <synch/spinlock.h> |
34 | #include <synch/spinlock.h> |
35 | #include <synch/waitq.h> |
35 | #include <synch/waitq.h> |
36 | #include <synch/synch.h> |
36 | #include <synch/synch.h> |
37 | #include <ipc/ipc.h> |
37 | #include <ipc/ipc.h> |
38 | #include <errno.h> |
38 | #include <errno.h> |
39 | #include <mm/slab.h> |
39 | #include <mm/slab.h> |
40 | #include <arch.h> |
40 | #include <arch.h> |
41 | #include <proc/task.h> |
41 | #include <proc/task.h> |
42 | #include <memstr.h> |
42 | #include <memstr.h> |
43 | #include <debug.h> |
43 | #include <debug.h> |
44 | 44 | ||
45 | #include <print.h> |
45 | #include <print.h> |
46 | #include <proc/thread.h> |
46 | #include <proc/thread.h> |
47 | #include <arch/interrupt.h> |
47 | #include <arch/interrupt.h> |
48 | #include <ipc/irq.h> |
48 | #include <ipc/irq.h> |
49 | 49 | ||
50 | /* Open channel that is assigned automatically to new tasks */ |
50 | /* Open channel that is assigned automatically to new tasks */ |
51 | answerbox_t *ipc_phone_0 = NULL; |
51 | answerbox_t *ipc_phone_0 = NULL; |
52 | 52 | ||
53 | static slab_cache_t *ipc_call_slab; |
53 | static slab_cache_t *ipc_call_slab; |
54 | 54 | ||
55 | /* Initialize new call */ |
55 | /* Initialize new call */ |
56 | static void _ipc_call_init(call_t *call) |
56 | static void _ipc_call_init(call_t *call) |
57 | { |
57 | { |
58 | memsetb((__address)call, sizeof(*call), 0); |
58 | memsetb((__address)call, sizeof(*call), 0); |
59 | call->callerbox = &TASK->answerbox; |
59 | call->callerbox = &TASK->answerbox; |
60 | call->sender = TASK; |
60 | call->sender = TASK; |
61 | } |
61 | } |
62 | 62 | ||
63 | /** Allocate & initialize call structure |
63 | /** Allocate & initialize call structure |
64 | * |
64 | * |
65 | * The call is initialized, so that the reply will be directed |
65 | * The call is initialized, so that the reply will be directed |
66 | * to TASK->answerbox |
66 | * to TASK->answerbox |
67 | * |
67 | * |
68 | * @param flags Parameters for slab_alloc (ATOMIC, etc.) |
68 | * @param flags Parameters for slab_alloc (ATOMIC, etc.) |
69 | */ |
69 | */ |
70 | call_t * ipc_call_alloc(int flags) |
70 | call_t * ipc_call_alloc(int flags) |
71 | { |
71 | { |
72 | call_t *call; |
72 | call_t *call; |
73 | 73 | ||
74 | call = slab_alloc(ipc_call_slab, flags); |
74 | call = slab_alloc(ipc_call_slab, flags); |
75 | _ipc_call_init(call); |
75 | _ipc_call_init(call); |
76 | 76 | ||
77 | return call; |
77 | return call; |
78 | } |
78 | } |
79 | 79 | ||
80 | /** Initialize allocated call */ |
80 | /** Initialize allocated call */ |
81 | void ipc_call_static_init(call_t *call) |
81 | void ipc_call_static_init(call_t *call) |
82 | { |
82 | { |
83 | _ipc_call_init(call); |
83 | _ipc_call_init(call); |
84 | call->flags |= IPC_CALL_STATIC_ALLOC; |
84 | call->flags |= IPC_CALL_STATIC_ALLOC; |
85 | } |
85 | } |
86 | 86 | ||
87 | /** Deallocate call stracuture */ |
87 | /** Deallocate call stracuture */ |
88 | void ipc_call_free(call_t *call) |
88 | void ipc_call_free(call_t *call) |
89 | { |
89 | { |
90 | slab_free(ipc_call_slab, call); |
90 | slab_free(ipc_call_slab, call); |
91 | } |
91 | } |
92 | 92 | ||
93 | /** Initialize answerbox structure |
93 | /** Initialize answerbox structure |
94 | */ |
94 | */ |
95 | void ipc_answerbox_init(answerbox_t *box) |
95 | void ipc_answerbox_init(answerbox_t *box) |
96 | { |
96 | { |
97 | spinlock_initialize(&box->lock, "ipc_box_lock"); |
97 | spinlock_initialize(&box->lock, "ipc_box_lock"); |
98 | spinlock_initialize(&box->irq_lock, "ipc_box_irqlock"); |
98 | spinlock_initialize(&box->irq_lock, "ipc_box_irqlock"); |
99 | waitq_initialize(&box->wq); |
99 | waitq_initialize(&box->wq); |
100 | list_initialize(&box->connected_phones); |
100 | list_initialize(&box->connected_phones); |
101 | list_initialize(&box->calls); |
101 | list_initialize(&box->calls); |
102 | list_initialize(&box->dispatched_calls); |
102 | list_initialize(&box->dispatched_calls); |
103 | list_initialize(&box->answers); |
103 | list_initialize(&box->answers); |
104 | list_initialize(&box->irq_notifs); |
104 | list_initialize(&box->irq_notifs); |
105 | box->task = TASK; |
105 | box->task = TASK; |
106 | } |
106 | } |
107 | 107 | ||
108 | /** Connect phone to answerbox */ |
108 | /** Connect phone to answerbox */ |
109 | void ipc_phone_connect(phone_t *phone, answerbox_t *box) |
109 | void ipc_phone_connect(phone_t *phone, answerbox_t *box) |
110 | { |
110 | { |
111 | spinlock_lock(&phone->lock); |
111 | spinlock_lock(&phone->lock); |
112 | 112 | ||
113 | ASSERT(!phone->callee); |
- | |
114 | phone->state = IPC_PHONE_CONNECTED; |
113 | phone->state = IPC_PHONE_CONNECTED; |
115 | phone->callee = box; |
114 | phone->callee = box; |
116 | 115 | ||
117 | spinlock_lock(&box->lock); |
116 | spinlock_lock(&box->lock); |
118 | list_append(&phone->list, &box->connected_phones); |
117 | list_append(&phone->link, &box->connected_phones); |
119 | spinlock_unlock(&box->lock); |
118 | spinlock_unlock(&box->lock); |
120 | 119 | ||
121 | spinlock_unlock(&phone->lock); |
120 | spinlock_unlock(&phone->lock); |
122 | } |
121 | } |
123 | 122 | ||
124 | /** Initialize phone structure and connect phone to answerbox |
123 | /** Initialize phone structure and connect phone to answerbox |
125 | */ |
124 | */ |
126 | void ipc_phone_init(phone_t *phone) |
125 | void ipc_phone_init(phone_t *phone) |
127 | { |
126 | { |
128 | spinlock_initialize(&phone->lock, "phone_lock"); |
127 | spinlock_initialize(&phone->lock, "phone_lock"); |
129 | phone->callee = NULL; |
128 | phone->callee = NULL; |
130 | phone->state = IPC_PHONE_FREE; |
129 | phone->state = IPC_PHONE_FREE; |
131 | atomic_set(&phone->active_calls, 0); |
130 | atomic_set(&phone->active_calls, 0); |
132 | } |
131 | } |
133 | 132 | ||
134 | /** Helper function to facilitate synchronous calls */ |
133 | /** Helper function to facilitate synchronous calls */ |
135 | void ipc_call_sync(phone_t *phone, call_t *request) |
134 | void ipc_call_sync(phone_t *phone, call_t *request) |
136 | { |
135 | { |
137 | answerbox_t sync_box; |
136 | answerbox_t sync_box; |
138 | 137 | ||
139 | ipc_answerbox_init(&sync_box); |
138 | ipc_answerbox_init(&sync_box); |
140 | 139 | ||
141 | /* We will receive data on special box */ |
140 | /* We will receive data on special box */ |
142 | request->callerbox = &sync_box; |
141 | request->callerbox = &sync_box; |
143 | 142 | ||
144 | ipc_call(phone, request); |
143 | ipc_call(phone, request); |
145 | ipc_wait_for_call(&sync_box, SYNCH_NO_TIMEOUT, SYNCH_FLAGS_NONE); |
144 | ipc_wait_for_call(&sync_box, SYNCH_NO_TIMEOUT, SYNCH_FLAGS_NONE); |
146 | } |
145 | } |
147 | 146 | ||
148 | /** Answer message that was not dispatched and is not entered in |
147 | /** Answer message that was not dispatched and is not entered in |
149 | * any queue |
148 | * any queue |
150 | */ |
149 | */ |
151 | static void _ipc_answer_free_call(call_t *call) |
150 | static void _ipc_answer_free_call(call_t *call) |
152 | { |
151 | { |
153 | answerbox_t *callerbox = call->callerbox; |
152 | answerbox_t *callerbox = call->callerbox; |
154 | 153 | ||
155 | call->flags |= IPC_CALL_ANSWERED; |
154 | call->flags |= IPC_CALL_ANSWERED; |
156 | 155 | ||
157 | spinlock_lock(&callerbox->lock); |
156 | spinlock_lock(&callerbox->lock); |
158 | list_append(&call->list, &callerbox->answers); |
157 | list_append(&call->link, &callerbox->answers); |
159 | spinlock_unlock(&callerbox->lock); |
158 | spinlock_unlock(&callerbox->lock); |
160 | waitq_wakeup(&callerbox->wq, 0); |
159 | waitq_wakeup(&callerbox->wq, 0); |
161 | } |
160 | } |
162 | 161 | ||
163 | /** Answer message, that is in callee queue |
162 | /** Answer message, that is in callee queue |
164 | * |
163 | * |
165 | * @param box Answerbox that is answering the message |
164 | * @param box Answerbox that is answering the message |
166 | * @param call Modified request that is being sent back |
165 | * @param call Modified request that is being sent back |
167 | */ |
166 | */ |
168 | void ipc_answer(answerbox_t *box, call_t *call) |
167 | void ipc_answer(answerbox_t *box, call_t *call) |
169 | { |
168 | { |
170 | /* Remove from active box */ |
169 | /* Remove from active box */ |
171 | spinlock_lock(&box->lock); |
170 | spinlock_lock(&box->lock); |
172 | list_remove(&call->list); |
171 | list_remove(&call->link); |
173 | spinlock_unlock(&box->lock); |
172 | spinlock_unlock(&box->lock); |
174 | /* Send back answer */ |
173 | /* Send back answer */ |
175 | _ipc_answer_free_call(call); |
174 | _ipc_answer_free_call(call); |
176 | } |
175 | } |
177 | 176 | ||
178 | /** Simulate sending back a message |
177 | /** Simulate sending back a message |
179 | * |
178 | * |
180 | * Most errors are better handled by forming a normal backward |
179 | * Most errors are better handled by forming a normal backward |
181 | * message and sending it as a normal answer. |
180 | * message and sending it as a normal answer. |
182 | */ |
181 | */ |
183 | void ipc_backsend_err(phone_t *phone, call_t *call, __native err) |
182 | void ipc_backsend_err(phone_t *phone, call_t *call, __native err) |
184 | { |
183 | { |
185 | call->data.phone = phone; |
184 | call->data.phone = phone; |
186 | atomic_inc(&phone->active_calls); |
185 | atomic_inc(&phone->active_calls); |
187 | IPC_SET_RETVAL(call->data, err); |
186 | IPC_SET_RETVAL(call->data, err); |
188 | _ipc_answer_free_call(call); |
187 | _ipc_answer_free_call(call); |
189 | } |
188 | } |
190 | 189 | ||
191 | /* Unsafe unchecking ipc_call */ |
190 | /* Unsafe unchecking ipc_call */ |
192 | static void _ipc_call(phone_t *phone, answerbox_t *box, call_t *call) |
191 | static void _ipc_call(phone_t *phone, answerbox_t *box, call_t *call) |
193 | { |
192 | { |
194 | if (! (call->flags & IPC_CALL_FORWARDED)) { |
193 | if (! (call->flags & IPC_CALL_FORWARDED)) { |
195 | atomic_inc(&phone->active_calls); |
194 | atomic_inc(&phone->active_calls); |
196 | call->data.phone = phone; |
195 | call->data.phone = phone; |
197 | } |
196 | } |
198 | 197 | ||
199 | spinlock_lock(&box->lock); |
198 | spinlock_lock(&box->lock); |
200 | list_append(&call->list, &box->calls); |
199 | list_append(&call->link, &box->calls); |
201 | spinlock_unlock(&box->lock); |
200 | spinlock_unlock(&box->lock); |
202 | waitq_wakeup(&box->wq, 0); |
201 | waitq_wakeup(&box->wq, 0); |
203 | } |
202 | } |
204 | 203 | ||
205 | /** Send a asynchronous request using phone to answerbox |
204 | /** Send a asynchronous request using phone to answerbox |
206 | * |
205 | * |
207 | * @param phone Phone connected to answerbox |
206 | * @param phone Phone connected to answerbox |
208 | * @param request Request to be sent |
207 | * @param request Request to be sent |
209 | */ |
208 | */ |
210 | int ipc_call(phone_t *phone, call_t *call) |
209 | int ipc_call(phone_t *phone, call_t *call) |
211 | { |
210 | { |
212 | answerbox_t *box; |
211 | answerbox_t *box; |
213 | 212 | ||
214 | spinlock_lock(&phone->lock); |
213 | spinlock_lock(&phone->lock); |
215 | if (phone->state != IPC_PHONE_CONNECTED) { |
214 | if (phone->state != IPC_PHONE_CONNECTED) { |
216 | spinlock_unlock(&phone->lock); |
215 | spinlock_unlock(&phone->lock); |
217 | if (call->flags & IPC_CALL_FORWARDED) { |
216 | if (call->flags & IPC_CALL_FORWARDED) { |
218 | IPC_SET_RETVAL(call->data, EFORWARD); |
217 | IPC_SET_RETVAL(call->data, EFORWARD); |
219 | _ipc_answer_free_call(call); |
218 | _ipc_answer_free_call(call); |
220 | } else { |
219 | } else { |
221 | if (phone->state == IPC_PHONE_HUNGUP) |
220 | if (phone->state == IPC_PHONE_HUNGUP) |
222 | ipc_backsend_err(phone, call, EHANGUP); |
221 | ipc_backsend_err(phone, call, EHANGUP); |
223 | else |
222 | else |
224 | ipc_backsend_err(phone, call, ENOENT); |
223 | ipc_backsend_err(phone, call, ENOENT); |
225 | } |
224 | } |
226 | return ENOENT; |
225 | return ENOENT; |
227 | } |
226 | } |
228 | box = phone->callee; |
227 | box = phone->callee; |
229 | _ipc_call(phone, box, call); |
228 | _ipc_call(phone, box, call); |
230 | 229 | ||
231 | spinlock_unlock(&phone->lock); |
230 | spinlock_unlock(&phone->lock); |
232 | return 0; |
231 | return 0; |
233 | } |
232 | } |
234 | 233 | ||
235 | /** Disconnect phone from answerbox |
234 | /** Disconnect phone from answerbox |
236 | * |
235 | * |
237 | * This call leaves the phone in HUNGUP state. The change to 'free' is done |
236 | * This call leaves the phone in HUNGUP state. The change to 'free' is done |
238 | * lazily later. |
237 | * lazily later. |
239 | * |
238 | * |
240 | * @param phone Phone to be hung up |
239 | * @param phone Phone to be hung up |
241 | * @param aggressive If false, the phone is only marked hungup, and all |
240 | * @param aggressive If false, the phone is only marked hungup, and all |
242 | * messages are allowed to complete. |
241 | * messages are allowed to complete. |
243 | * If true, all messages in all queues are discarded. There |
242 | * If true, all messages in all queues are discarded. There |
244 | * may still be some messages that will be 'in-transit' on |
243 | * may still be some messages that will be 'in-transit' on |
245 | * other CPU. |
244 | * other CPU. |
246 | * |
245 | * |
247 | * @return 0 - phone disconnected, -1 - the phone was already disconnected |
246 | * @return 0 - phone disconnected, -1 - the phone was already disconnected |
248 | */ |
247 | */ |
249 | int ipc_phone_hangup(phone_t *phone, int aggressive) |
248 | int ipc_phone_hangup(phone_t *phone, int aggressive) |
250 | { |
249 | { |
251 | answerbox_t *box; |
250 | answerbox_t *box; |
252 | call_t *call; |
251 | call_t *call; |
253 | 252 | ||
254 | spinlock_lock(&phone->lock); |
253 | spinlock_lock(&phone->lock); |
255 | if (phone->state == IPC_PHONE_FREE || phone->state ==IPC_PHONE_HUNGUP \ |
254 | if (phone->state == IPC_PHONE_FREE || phone->state ==IPC_PHONE_HUNGUP \ |
256 | || phone->state == IPC_PHONE_CONNECTING) { |
255 | || phone->state == IPC_PHONE_CONNECTING) { |
257 | spinlock_unlock(&phone->lock); |
256 | spinlock_unlock(&phone->lock); |
258 | return -1; |
257 | return -1; |
259 | } |
258 | } |
260 | box = phone->callee; |
259 | box = phone->callee; |
261 | if (phone->state != IPC_PHONE_SLAMMED) { |
260 | if (phone->state != IPC_PHONE_SLAMMED) { |
262 | /* Remove myself from answerbox */ |
261 | /* Remove myself from answerbox */ |
263 | spinlock_lock(&box->lock); |
262 | spinlock_lock(&box->lock); |
264 | list_remove(&phone->list); |
263 | list_remove(&phone->link); |
265 | spinlock_unlock(&box->lock); |
264 | spinlock_unlock(&box->lock); |
266 | 265 | ||
267 | if (phone->state != IPC_PHONE_SLAMMED) { |
266 | if (phone->state != IPC_PHONE_SLAMMED) { |
268 | call = ipc_call_alloc(0); |
267 | call = ipc_call_alloc(0); |
269 | IPC_SET_METHOD(call->data, IPC_M_PHONE_HUNGUP); |
268 | IPC_SET_METHOD(call->data, IPC_M_PHONE_HUNGUP); |
270 | call->flags |= IPC_CALL_DISCARD_ANSWER; |
269 | call->flags |= IPC_CALL_DISCARD_ANSWER; |
271 | _ipc_call(phone, box, call); |
270 | _ipc_call(phone, box, call); |
272 | } |
271 | } |
273 | } |
272 | } |
274 | 273 | ||
275 | if (aggressive && atomic_get(&phone->active_calls) > 0) { |
274 | if (aggressive && atomic_get(&phone->active_calls) > 0) { |
276 | /* TODO: Do some stuff be VERY aggressive */ |
275 | /* TODO: Do some stuff be VERY aggressive */ |
277 | } |
276 | } |
278 | 277 | ||
279 | phone->callee = 0; |
- | |
280 | - | ||
281 | phone->state = IPC_PHONE_HUNGUP; |
278 | phone->state = IPC_PHONE_HUNGUP; |
282 | spinlock_unlock(&phone->lock); |
279 | spinlock_unlock(&phone->lock); |
283 | 280 | ||
284 | return 0; |
281 | return 0; |
285 | } |
282 | } |
286 | 283 | ||
287 | /** Forwards call from one answerbox to a new one |
284 | /** Forwards call from one answerbox to a new one |
288 | * |
285 | * |
289 | * @param call Call to be redirected. |
286 | * @param call Call to be redirected. |
290 | * @param newphone Phone to target answerbox. |
287 | * @param newphone Phone to target answerbox. |
291 | * @param oldbox Old answerbox |
288 | * @param oldbox Old answerbox |
292 | * @return 0 on forward ok, error code, if there was error |
289 | * @return 0 on forward ok, error code, if there was error |
293 | * |
290 | * |
294 | * - the return value serves only as an information for the forwarder, |
291 | * - the return value serves only as an information for the forwarder, |
295 | * the original caller is notified automatically with EFORWARD |
292 | * the original caller is notified automatically with EFORWARD |
296 | */ |
293 | */ |
297 | int ipc_forward(call_t *call, phone_t *newphone, answerbox_t *oldbox) |
294 | int ipc_forward(call_t *call, phone_t *newphone, answerbox_t *oldbox) |
298 | { |
295 | { |
299 | spinlock_lock(&oldbox->lock); |
296 | spinlock_lock(&oldbox->lock); |
300 | list_remove(&call->list); |
297 | list_remove(&call->link); |
301 | spinlock_unlock(&oldbox->lock); |
298 | spinlock_unlock(&oldbox->lock); |
302 | 299 | ||
303 | return ipc_call(newphone, call); |
300 | return ipc_call(newphone, call); |
304 | } |
301 | } |
305 | 302 | ||
306 | 303 | ||
307 | /** Wait for phone call |
304 | /** Wait for phone call |
308 | * |
305 | * |
309 | * @param box Answerbox expecting the call. |
306 | * @param box Answerbox expecting the call. |
310 | * @param usec Timeout in microseconds. See documentation for waitq_sleep_timeout() for |
307 | * @param usec Timeout in microseconds. See documentation for waitq_sleep_timeout() for |
311 | * decription of its special meaning. |
308 | * decription of its special meaning. |
312 | * @param flags Select mode of sleep operation. See documentation for waitq_sleep_timeout()i |
309 | * @param flags Select mode of sleep operation. See documentation for waitq_sleep_timeout()i |
313 | * for description of its special meaning. |
310 | * for description of its special meaning. |
314 | * @return Recived message address |
311 | * @return Recived message address |
315 | * - to distinguish between call and answer, look at call->flags |
312 | * - to distinguish between call and answer, look at call->flags |
316 | */ |
313 | */ |
317 | call_t * ipc_wait_for_call(answerbox_t *box, __u32 usec, int flags) |
314 | call_t * ipc_wait_for_call(answerbox_t *box, __u32 usec, int flags) |
318 | { |
315 | { |
319 | call_t *request; |
316 | call_t *request; |
320 | ipl_t ipl; |
317 | ipl_t ipl; |
321 | int rc; |
318 | int rc; |
322 | 319 | ||
323 | restart: |
320 | restart: |
324 | rc = waitq_sleep_timeout(&box->wq, usec, flags); |
321 | rc = waitq_sleep_timeout(&box->wq, usec, flags); |
325 | if (SYNCH_FAILED(rc)) |
322 | if (SYNCH_FAILED(rc)) |
326 | return NULL; |
323 | return NULL; |
327 | 324 | ||
328 | spinlock_lock(&box->lock); |
325 | spinlock_lock(&box->lock); |
329 | if (!list_empty(&box->irq_notifs)) { |
326 | if (!list_empty(&box->irq_notifs)) { |
330 | ipl = interrupts_disable(); |
327 | ipl = interrupts_disable(); |
331 | spinlock_lock(&box->irq_lock); |
328 | spinlock_lock(&box->irq_lock); |
332 | 329 | ||
333 | request = list_get_instance(box->irq_notifs.next, call_t, list); |
330 | request = list_get_instance(box->irq_notifs.next, call_t, link); |
334 | list_remove(&request->list); |
331 | list_remove(&request->link); |
335 | 332 | ||
336 | spinlock_unlock(&box->irq_lock); |
333 | spinlock_unlock(&box->irq_lock); |
337 | interrupts_restore(ipl); |
334 | interrupts_restore(ipl); |
338 | } else if (!list_empty(&box->answers)) { |
335 | } else if (!list_empty(&box->answers)) { |
339 | /* Handle asynchronous answers */ |
336 | /* Handle asynchronous answers */ |
340 | request = list_get_instance(box->answers.next, call_t, list); |
337 | request = list_get_instance(box->answers.next, call_t, link); |
341 | list_remove(&request->list); |
338 | list_remove(&request->link); |
342 | atomic_dec(&request->data.phone->active_calls); |
339 | atomic_dec(&request->data.phone->active_calls); |
343 | } else if (!list_empty(&box->calls)) { |
340 | } else if (!list_empty(&box->calls)) { |
344 | /* Handle requests */ |
341 | /* Handle requests */ |
345 | request = list_get_instance(box->calls.next, call_t, list); |
342 | request = list_get_instance(box->calls.next, call_t, link); |
346 | list_remove(&request->list); |
343 | list_remove(&request->link); |
347 | /* Append request to dispatch queue */ |
344 | /* Append request to dispatch queue */ |
348 | list_append(&request->list, &box->dispatched_calls); |
345 | list_append(&request->link, &box->dispatched_calls); |
349 | } else { |
346 | } else { |
350 | /* This can happen regularly after ipc_cleanup, remove |
347 | /* This can happen regularly after ipc_cleanup, remove |
351 | * the warning in the future when the IPC is |
348 | * the warning in the future when the IPC is |
352 | * more debugged */ |
349 | * more debugged */ |
353 | printf("WARNING: Spurious IPC wakeup.\n"); |
350 | printf("WARNING: Spurious IPC wakeup.\n"); |
354 | spinlock_unlock(&box->lock); |
351 | spinlock_unlock(&box->lock); |
355 | goto restart; |
352 | goto restart; |
356 | } |
353 | } |
357 | spinlock_unlock(&box->lock); |
354 | spinlock_unlock(&box->lock); |
358 | return request; |
355 | return request; |
359 | } |
356 | } |
360 | 357 | ||
361 | /** Answer all calls from list with EHANGUP msg */ |
358 | /** Answer all calls from list with EHANGUP msg */ |
362 | static void ipc_cleanup_call_list(link_t *lst) |
359 | static void ipc_cleanup_call_list(link_t *lst) |
363 | { |
360 | { |
364 | call_t *call; |
361 | call_t *call; |
365 | 362 | ||
366 | while (!list_empty(lst)) { |
363 | while (!list_empty(lst)) { |
367 | call = list_get_instance(lst->next, call_t, list); |
364 | call = list_get_instance(lst->next, call_t, link); |
368 | list_remove(&call->list); |
365 | list_remove(&call->link); |
369 | 366 | ||
370 | IPC_SET_RETVAL(call->data, EHANGUP); |
367 | IPC_SET_RETVAL(call->data, EHANGUP); |
371 | _ipc_answer_free_call(call); |
368 | _ipc_answer_free_call(call); |
372 | } |
369 | } |
373 | } |
370 | } |
374 | 371 | ||
375 | /** Cleans up all IPC communication of the given task |
372 | /** Cleans up all IPC communication of the given task |
376 | * |
373 | * |
377 | * |
374 | * |
378 | */ |
375 | */ |
379 | void ipc_cleanup(task_t *task) |
376 | void ipc_cleanup(task_t *task) |
380 | { |
377 | { |
381 | int i; |
378 | int i; |
382 | call_t *call; |
379 | call_t *call; |
383 | phone_t *phone; |
380 | phone_t *phone; |
384 | 381 | ||
385 | /* Disconnect all our phones ('ipc_phone_hangup') */ |
382 | /* Disconnect all our phones ('ipc_phone_hangup') */ |
386 | for (i=0;i < IPC_MAX_PHONES; i++) |
383 | for (i=0;i < IPC_MAX_PHONES; i++) |
387 | ipc_phone_hangup(&task->phones[i], 1); |
384 | ipc_phone_hangup(&task->phones[i], 1); |
388 | 385 | ||
389 | /* Disconnect all connected irqs */ |
386 | /* Disconnect all connected irqs */ |
390 | ipc_irq_cleanup(&task->answerbox); |
387 | ipc_irq_cleanup(&task->answerbox); |
391 | 388 | ||
392 | /* Disconnect all phones connected to our answerbox */ |
389 | /* Disconnect all phones connected to our answerbox */ |
393 | restart_phones: |
390 | restart_phones: |
394 | spinlock_lock(&task->answerbox.lock); |
391 | spinlock_lock(&task->answerbox.lock); |
395 | while (!list_empty(&task->answerbox.connected_phones)) { |
392 | while (!list_empty(&task->answerbox.connected_phones)) { |
396 | phone = list_get_instance(task->answerbox.connected_phones.next, |
393 | phone = list_get_instance(task->answerbox.connected_phones.next, |
397 | phone_t, |
394 | phone_t, link); |
398 | list); |
- | |
399 | if (! spinlock_trylock(&phone->lock)) { |
395 | if (! spinlock_trylock(&phone->lock)) { |
400 | spinlock_unlock(&task->answerbox.lock); |
396 | spinlock_unlock(&task->answerbox.lock); |
401 | goto restart_phones; |
397 | goto restart_phones; |
402 | } |
398 | } |
403 | 399 | ||
404 | /* Disconnect phone */ |
400 | /* Disconnect phone */ |
405 | ASSERT(phone->state == IPC_PHONE_CONNECTED); |
401 | ASSERT(phone->state == IPC_PHONE_CONNECTED); |
406 | phone->state = IPC_PHONE_SLAMMED; |
402 | phone->state = IPC_PHONE_SLAMMED; |
407 | list_remove(&phone->list); |
403 | list_remove(&phone->link); |
408 | 404 | ||
409 | spinlock_unlock(&phone->lock); |
405 | spinlock_unlock(&phone->lock); |
410 | } |
406 | } |
411 | 407 | ||
412 | /* Answer all messages in 'calls' and 'dispatched_calls' queues */ |
408 | /* Answer all messages in 'calls' and 'dispatched_calls' queues */ |
413 | spinlock_lock(&task->answerbox.lock); |
409 | spinlock_lock(&task->answerbox.lock); |
414 | ipc_cleanup_call_list(&task->answerbox.dispatched_calls); |
410 | ipc_cleanup_call_list(&task->answerbox.dispatched_calls); |
415 | ipc_cleanup_call_list(&task->answerbox.calls); |
411 | ipc_cleanup_call_list(&task->answerbox.calls); |
416 | spinlock_unlock(&task->answerbox.lock); |
412 | spinlock_unlock(&task->answerbox.lock); |
417 | 413 | ||
418 | /* Wait for all async answers to arrive */ |
414 | /* Wait for all async answers to arrive */ |
419 | while (1) { |
415 | while (1) { |
420 | /* Go through all phones, until all are FREE... */ |
416 | /* Go through all phones, until all are FREE... */ |
421 | /* Locking not needed, no one else should modify |
417 | /* Locking not needed, no one else should modify |
422 | * it, when we are in cleanup */ |
418 | * it, when we are in cleanup */ |
423 | for (i=0;i < IPC_MAX_PHONES; i++) { |
419 | for (i=0;i < IPC_MAX_PHONES; i++) { |
424 | if (task->phones[i].state == IPC_PHONE_HUNGUP && \ |
420 | if (task->phones[i].state == IPC_PHONE_HUNGUP && \ |
425 | atomic_get(&task->phones[i].active_calls) == 0) |
421 | atomic_get(&task->phones[i].active_calls) == 0) |
426 | task->phones[i].state = IPC_PHONE_FREE; |
422 | task->phones[i].state = IPC_PHONE_FREE; |
427 | if (task->phones[i].state != IPC_PHONE_FREE) |
423 | if (task->phones[i].state != IPC_PHONE_FREE) |
428 | break; |
424 | break; |
429 | } |
425 | } |
430 | /* Voila, got into cleanup */ |
426 | /* Voila, got into cleanup */ |
431 | if (i == IPC_MAX_PHONES) |
427 | if (i == IPC_MAX_PHONES) |
432 | break; |
428 | break; |
433 | 429 | ||
434 | call = ipc_wait_for_call(&task->answerbox, SYNCH_NO_TIMEOUT, SYNCH_FLAGS_NONE); |
430 | call = ipc_wait_for_call(&task->answerbox, SYNCH_NO_TIMEOUT, SYNCH_FLAGS_NONE); |
435 | ASSERT((call->flags & IPC_CALL_ANSWERED) || (call->flags & IPC_CALL_NOTIF)); |
431 | ASSERT((call->flags & IPC_CALL_ANSWERED) || (call->flags & IPC_CALL_NOTIF)); |
436 | ASSERT(! (call->flags & IPC_CALL_STATIC_ALLOC)); |
432 | ASSERT(! (call->flags & IPC_CALL_STATIC_ALLOC)); |
437 | 433 | ||
438 | atomic_dec(&task->active_calls); |
434 | atomic_dec(&task->active_calls); |
439 | ipc_call_free(call); |
435 | ipc_call_free(call); |
440 | } |
436 | } |
441 | } |
437 | } |
442 | 438 | ||
443 | 439 | ||
444 | /** Initilize ipc subsystem */ |
440 | /** Initilize ipc subsystem */ |
445 | void ipc_init(void) |
441 | void ipc_init(void) |
446 | { |
442 | { |
447 | ipc_call_slab = slab_cache_create("ipc_call", |
443 | ipc_call_slab = slab_cache_create("ipc_call", |
448 | sizeof(call_t), |
444 | sizeof(call_t), |
449 | 0, |
445 | 0, |
450 | NULL, NULL, 0); |
446 | NULL, NULL, 0); |
451 | ipc_irq_make_table(IRQ_COUNT); |
447 | ipc_irq_make_table(IRQ_COUNT); |
452 | } |
448 | } |
453 | 449 | ||
- | 450 | ||
- | 451 | /** Kconsole - list answerbox contents */ |
|
- | 452 | void ipc_print_task(task_id_t taskid) |
|
- | 453 | { |
|
- | 454 | task_t *task; |
|
- | 455 | int i; |
|
- | 456 | call_t *call; |
|
- | 457 | link_t *tmp; |
|
- | 458 | ||
- | 459 | spinlock_lock(&tasks_lock); |
|
- | 460 | task = task_find_by_id(taskid); |
|
- | 461 | if (task) |
|
- | 462 | spinlock_lock(&task->lock); |
|
- | 463 | spinlock_unlock(&tasks_lock); |
|
- | 464 | if (!task) |
|
- | 465 | return; |
|
- | 466 | ||
- | 467 | /* Print opened phones & details */ |
|
- | 468 | printf("PHONE:\n"); |
|
- | 469 | for (i=0; i < IPC_MAX_PHONES;i++) { |
|
- | 470 | spinlock_lock(&task->phones[i].lock); |
|
- | 471 | if (task->phones[i].state != IPC_PHONE_FREE) { |
|
- | 472 | printf("%d: ",i); |
|
- | 473 | switch (task->phones[i].state) { |
|
- | 474 | case IPC_PHONE_CONNECTING: |
|
- | 475 | printf("connecting "); |
|
- | 476 | break; |
|
- | 477 | case IPC_PHONE_CONNECTED: |
|
- | 478 | printf("connected to: %P ", |
|
- | 479 | task->phones[i].callee); |
|
- | 480 | break; |
|
- | 481 | case IPC_PHONE_SLAMMED: |
|
- | 482 | printf("slammed by: %P ", |
|
- | 483 | task->phones[i].callee); |
|
- | 484 | break; |
|
- | 485 | case IPC_PHONE_HUNGUP: |
|
- | 486 | printf("hung up - was: %P ", |
|
- | 487 | task->phones[i].callee); |
|
- | 488 | break; |
|
- | 489 | default: |
|
- | 490 | break; |
|
- | 491 | } |
|
- | 492 | printf("active: %d\n", atomic_get(&task->phones[i].active_calls)); |
|
- | 493 | } |
|
- | 494 | spinlock_unlock(&task->phones[i].lock); |
|
- | 495 | } |
|
- | 496 | ||
- | 497 | ||
- | 498 | /* Print answerbox - calls */ |
|
- | 499 | spinlock_lock(&task->answerbox.lock); |
|
- | 500 | printf("ABOX - CALLS:\n"); |
|
- | 501 | for (tmp=task->answerbox.calls.next; tmp != &task->answerbox.calls;tmp = tmp->next) { |
|
- | 502 | call = list_get_instance(tmp, call_t, link); |
|
- | 503 | printf("Callid: %P Srctask:%lld M:%d A1:%d A2:%d A3:%d Flags:%x\n",call, |
|
- | 504 | call->sender->taskid, IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
|
- | 505 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), call->flags); |
|
- | 506 | } |
|
- | 507 | /* Print answerbox - calls */ |
|
- | 508 | printf("ABOX - DISPATCHED CALLS:\n"); |
|
- | 509 | for (tmp=task->answerbox.dispatched_calls.next; |
|
- | 510 | tmp != &task->answerbox.dispatched_calls; |
|
- | 511 | tmp = tmp->next) { |
|
- | 512 | call = list_get_instance(tmp, call_t, link); |
|
- | 513 | printf("Callid: %P Srctask:%lld M:%d A1:%d A2:%d A3:%d Flags:%x\n",call, |
|
- | 514 | call->sender->taskid, IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
|
- | 515 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), call->flags); |
|
- | 516 | } |
|
- | 517 | /* Print answerbox - calls */ |
|
- | 518 | printf("ABOX - ANSWERS:\n"); |
|
- | 519 | for (tmp=task->answerbox.answers.next; tmp != &task->answerbox.answers; tmp = tmp->next) { |
|
- | 520 | call = list_get_instance(tmp, call_t, link); |
|
- | 521 | printf("Callid:%P M:%d A1:%d A2:%d A3:%d Flags:%x\n",call, |
|
- | 522 | IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data), |
|
- | 523 | IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data), call->flags); |
|
- | 524 | } |
|
- | 525 | ||
- | 526 | spinlock_unlock(&task->answerbox.lock); |
|
- | 527 | spinlock_unlock(&task->lock); |
|
- | 528 | } |
|
454 | 529 |