Rev 3867 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3867 | Rev 3870 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2008 Jiri Svoboda |
2 | * Copyright (c) 2008 Jiri Svoboda |
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 | #include <synch/synch.h> |
35 | #include <synch/synch.h> |
36 | #include <synch/spinlock.h> |
36 | #include <synch/spinlock.h> |
37 | #include <synch/mutex.h> |
37 | #include <synch/mutex.h> |
38 | #include <ipc/ipc.h> |
38 | #include <ipc/ipc.h> |
39 | #include <ipc/ipcrsc.h> |
39 | #include <ipc/ipcrsc.h> |
40 | #include <arch.h> |
40 | #include <arch.h> |
41 | #include <errno.h> |
41 | #include <errno.h> |
42 | #include <debug.h> |
42 | #include <debug.h> |
43 | #include <udebug/udebug_ipc.h> |
43 | #include <udebug/udebug_ipc.h> |
44 | #include <ipc/kbox.h> |
44 | #include <ipc/kbox.h> |
- | 45 | #include <print.h> |
|
45 | 46 | ||
46 | void ipc_kbox_cleanup(void) |
47 | void ipc_kbox_cleanup(void) |
47 | { |
48 | { |
48 | ipl_t ipl; |
49 | ipl_t ipl; |
49 | bool have_kb_thread; |
50 | bool have_kb_thread; |
50 | 51 | ||
51 | /* |
52 | /* |
52 | * Only hold kb.cleanup_lock while setting kb.finished - |
53 | * Only hold kb.cleanup_lock while setting kb.finished - |
53 | * this is enough. |
54 | * this is enough. |
54 | */ |
55 | */ |
55 | mutex_lock(&TASK->kb.cleanup_lock); |
56 | mutex_lock(&TASK->kb.cleanup_lock); |
56 | TASK->kb.finished = true; |
57 | TASK->kb.finished = true; |
57 | mutex_unlock(&TASK->kb.cleanup_lock); |
58 | mutex_unlock(&TASK->kb.cleanup_lock); |
58 | 59 | ||
59 | have_kb_thread = (TASK->kb.thread != NULL); |
60 | have_kb_thread = (TASK->kb.thread != NULL); |
60 | 61 | ||
61 | /* |
62 | /* |
62 | * From now on nobody will try to connect phones or attach |
63 | * From now on nobody will try to connect phones or attach |
63 | * kbox threads |
64 | * kbox threads |
64 | */ |
65 | */ |
65 | 66 | ||
66 | /* |
67 | /* |
67 | * Disconnect all phones connected to our kbox. Passing true for |
68 | * Disconnect all phones connected to our kbox. Passing true for |
68 | * notify_box causes a HANGUP message to be inserted for each |
69 | * notify_box causes a HANGUP message to be inserted for each |
69 | * disconnected phone. This ensures the kbox thread is going to |
70 | * disconnected phone. This ensures the kbox thread is going to |
70 | * wake up and terminate. |
71 | * wake up and terminate. |
71 | */ |
72 | */ |
72 | ipc_answerbox_slam_phones(&TASK->kb.box, have_kb_thread); |
73 | ipc_answerbox_slam_phones(&TASK->kb.box, have_kb_thread); |
73 | 74 | ||
74 | /* |
75 | /* |
75 | * If the task was being debugged, clean up debugging session. |
76 | * If the task was being debugged, clean up debugging session. |
76 | * This is necessarry as slamming the phones won't force |
77 | * This is necessarry as slamming the phones won't force |
77 | * kbox thread to clean it up since sender != debugger. |
78 | * kbox thread to clean it up since sender != debugger. |
78 | */ |
79 | */ |
79 | ipl = interrupts_disable(); |
80 | ipl = interrupts_disable(); |
80 | spinlock_lock(&TASK->lock); |
81 | spinlock_lock(&TASK->lock); |
81 | udebug_task_cleanup(TASK); |
82 | udebug_task_cleanup(TASK); |
82 | spinlock_unlock(&TASK->lock); |
83 | spinlock_unlock(&TASK->lock); |
83 | interrupts_restore(ipl); |
84 | interrupts_restore(ipl); |
84 | 85 | ||
85 | if (have_kb_thread) { |
86 | if (have_kb_thread) { |
86 | LOG("join kb.thread..\n"); |
87 | LOG("join kb.thread..\n"); |
87 | thread_join(TASK->kb.thread); |
88 | thread_join(TASK->kb.thread); |
88 | thread_detach(TASK->kb.thread); |
89 | thread_detach(TASK->kb.thread); |
89 | LOG("join done\n"); |
90 | LOG("join done\n"); |
90 | TASK->kb.thread = NULL; |
91 | TASK->kb.thread = NULL; |
91 | } |
92 | } |
92 | 93 | ||
93 | /* Answer all messages in 'calls' and 'dispatched_calls' queues. */ |
94 | /* Answer all messages in 'calls' and 'dispatched_calls' queues. */ |
94 | spinlock_lock(&TASK->kb.box.lock); |
95 | spinlock_lock(&TASK->kb.box.lock); |
95 | ipc_cleanup_call_list(&TASK->kb.box.dispatched_calls); |
96 | ipc_cleanup_call_list(&TASK->kb.box.dispatched_calls); |
96 | ipc_cleanup_call_list(&TASK->kb.box.calls); |
97 | ipc_cleanup_call_list(&TASK->kb.box.calls); |
97 | spinlock_unlock(&TASK->kb.box.lock); |
98 | spinlock_unlock(&TASK->kb.box.lock); |
98 | } |
99 | } |
99 | 100 | ||
100 | /** Handle hangup message in kbox. |
101 | /** Handle hangup message in kbox. |
101 | * |
102 | * |
102 | * @param call The IPC_M_PHONE_HUNGUP call structure. |
103 | * @param call The IPC_M_PHONE_HUNGUP call structure. |
103 | * @param last Output, the function stores @c true here if |
104 | * @param last Output, the function stores @c true here if |
104 | * this was the last phone, @c false otherwise. |
105 | * this was the last phone, @c false otherwise. |
105 | **/ |
106 | **/ |
106 | static void kbox_proc_phone_hungup(call_t *call, bool *last) |
107 | static void kbox_proc_phone_hungup(call_t *call, bool *last) |
107 | { |
108 | { |
108 | ipl_t ipl; |
109 | ipl_t ipl; |
109 | 110 | ||
110 | LOG("kbox_proc_phone_hungup()\n"); |
111 | LOG("kbox_proc_phone_hungup()\n"); |
111 | 112 | ||
112 | /* Was it our debugger, who hung up? */ |
113 | /* Was it our debugger, who hung up? */ |
113 | if (call->sender == TASK->udebug.debugger) { |
114 | if (call->sender == TASK->udebug.debugger) { |
114 | /* Terminate debugging session (if any). */ |
115 | /* Terminate debugging session (if any). */ |
115 | LOG("kbox: terminate debug session\n"); |
116 | LOG("kbox: terminate debug session\n"); |
116 | ipl = interrupts_disable(); |
117 | ipl = interrupts_disable(); |
117 | spinlock_lock(&TASK->lock); |
118 | spinlock_lock(&TASK->lock); |
118 | udebug_task_cleanup(TASK); |
119 | udebug_task_cleanup(TASK); |
119 | spinlock_unlock(&TASK->lock); |
120 | spinlock_unlock(&TASK->lock); |
120 | interrupts_restore(ipl); |
121 | interrupts_restore(ipl); |
121 | } else { |
122 | } else { |
122 | LOG("kbox: was not debugger\n"); |
123 | LOG("kbox: was not debugger\n"); |
123 | } |
124 | } |
124 | 125 | ||
125 | LOG("kbox: continue with hangup message\n"); |
126 | LOG("kbox: continue with hangup message\n"); |
126 | IPC_SET_RETVAL(call->data, 0); |
127 | IPC_SET_RETVAL(call->data, 0); |
127 | ipc_answer(&TASK->kb.box, call); |
128 | ipc_answer(&TASK->kb.box, call); |
128 | 129 | ||
129 | ipl = interrupts_disable(); |
130 | ipl = interrupts_disable(); |
130 | spinlock_lock(&TASK->lock); |
131 | spinlock_lock(&TASK->lock); |
131 | spinlock_lock(&TASK->kb.box.lock); |
132 | spinlock_lock(&TASK->kb.box.lock); |
132 | if (list_empty(&TASK->kb.box.connected_phones)) { |
133 | if (list_empty(&TASK->kb.box.connected_phones)) { |
133 | /* |
134 | /* |
134 | * Last phone has been disconnected. Detach this thread so it |
135 | * Last phone has been disconnected. Detach this thread so it |
135 | * gets freed and signal to the caller. |
136 | * gets freed and signal to the caller. |
136 | */ |
137 | */ |
137 | 138 | ||
138 | /* Only detach kbox thread unless already terminating. */ |
139 | /* Only detach kbox thread unless already terminating. */ |
139 | mutex_lock(&TASK->kb.cleanup_lock); |
140 | mutex_lock(&TASK->kb.cleanup_lock); |
140 | if (&TASK->kb.finished == false) { |
141 | if (&TASK->kb.finished == false) { |
141 | /* Detach kbox thread so it gets freed from memory. */ |
142 | /* Detach kbox thread so it gets freed from memory. */ |
142 | thread_detach(TASK->kb.thread); |
143 | thread_detach(TASK->kb.thread); |
143 | TASK->kb.thread = NULL; |
144 | TASK->kb.thread = NULL; |
144 | } |
145 | } |
145 | mutex_unlock(&TASK->kb.cleanup_lock); |
146 | mutex_unlock(&TASK->kb.cleanup_lock); |
146 | 147 | ||
147 | LOG("phone list is empty\n"); |
148 | LOG("phone list is empty\n"); |
148 | *last = true; |
149 | *last = true; |
149 | } else { |
150 | } else { |
150 | *last = false; |
151 | *last = false; |
151 | } |
152 | } |
152 | 153 | ||
153 | spinlock_unlock(&TASK->kb.box.lock); |
154 | spinlock_unlock(&TASK->kb.box.lock); |
154 | spinlock_unlock(&TASK->lock); |
155 | spinlock_unlock(&TASK->lock); |
155 | interrupts_restore(ipl); |
156 | interrupts_restore(ipl); |
156 | } |
157 | } |
157 | 158 | ||
158 | /** Implementing function for the kbox thread. |
159 | /** Implementing function for the kbox thread. |
159 | * |
160 | * |
160 | * This function listens for debug requests. It terminates |
161 | * This function listens for debug requests. It terminates |
161 | * when all phones are disconnected from the kbox. |
162 | * when all phones are disconnected from the kbox. |
162 | * |
163 | * |
163 | * @param arg Ignored. |
164 | * @param arg Ignored. |
164 | */ |
165 | */ |
165 | static void kbox_thread_proc(void *arg) |
166 | static void kbox_thread_proc(void *arg) |
166 | { |
167 | { |
167 | call_t *call; |
168 | call_t *call; |
168 | bool done; |
169 | bool done; |
169 | 170 | ||
170 | (void)arg; |
171 | (void)arg; |
171 | LOG("kbox_thread_proc()\n"); |
172 | LOG("kbox_thread_proc()\n"); |
172 | done = false; |
173 | done = false; |
173 | 174 | ||
174 | while (!done) { |
175 | while (!done) { |
175 | call = ipc_wait_for_call(&TASK->kb.box, SYNCH_NO_TIMEOUT, |
176 | call = ipc_wait_for_call(&TASK->kb.box, SYNCH_NO_TIMEOUT, |
176 | SYNCH_FLAGS_NONE); |
177 | SYNCH_FLAGS_NONE); |
177 | 178 | ||
178 | if (call == NULL) |
179 | if (call == NULL) |
179 | continue; /* Try again. */ |
180 | continue; /* Try again. */ |
180 | 181 | ||
181 | switch (IPC_GET_METHOD(call->data)) { |
182 | switch (IPC_GET_METHOD(call->data)) { |
182 | 183 | ||
183 | case IPC_M_DEBUG_ALL: |
184 | case IPC_M_DEBUG_ALL: |
184 | /* Handle debug call. */ |
185 | /* Handle debug call. */ |
185 | udebug_call_receive(call); |
186 | udebug_call_receive(call); |
186 | break; |
187 | break; |
187 | 188 | ||
188 | case IPC_M_PHONE_HUNGUP: |
189 | case IPC_M_PHONE_HUNGUP: |
189 | /* |
190 | /* |
190 | * Process the hangup call. If this was the last |
191 | * Process the hangup call. If this was the last |
191 | * phone, done will be set to true and the |
192 | * phone, done will be set to true and the |
192 | * while loop will terminate. |
193 | * while loop will terminate. |
193 | */ |
194 | */ |
194 | kbox_proc_phone_hungup(call, &done); |
195 | kbox_proc_phone_hungup(call, &done); |
195 | break; |
196 | break; |
196 | 197 | ||
197 | default: |
198 | default: |
198 | /* Ignore */ |
199 | /* Ignore */ |
199 | break; |
200 | break; |
200 | } |
201 | } |
201 | } |
202 | } |
202 | 203 | ||
203 | LOG("kbox: finished\n"); |
204 | LOG("kbox: finished\n"); |
204 | } |
205 | } |
205 | 206 | ||
206 | 207 | ||
207 | /** |
208 | /** |
208 | * Connect phone to a task kernel-box specified by id. |
209 | * Connect phone to a task kernel-box specified by id. |
209 | * |
210 | * |
210 | * Note that this is not completely atomic. For optimisation reasons, the task |
211 | * Note that this is not completely atomic. For optimisation reasons, the task |
211 | * might start cleaning up kbox after the phone has been connected and before |
212 | * might start cleaning up kbox after the phone has been connected and before |
212 | * a kbox thread has been created. This must be taken into account in the |
213 | * a kbox thread has been created. This must be taken into account in the |
213 | * cleanup code. |
214 | * cleanup code. |
214 | * |
215 | * |
215 | * @return Phone id on success, or negative error code. |
216 | * @return Phone id on success, or negative error code. |
216 | */ |
217 | */ |
217 | int ipc_connect_kbox(task_id_t taskid) |
218 | int ipc_connect_kbox(task_id_t taskid) |
218 | { |
219 | { |
219 | int newphid; |
220 | int newphid; |
220 | task_t *ta; |
221 | task_t *ta; |
221 | thread_t *kb_thread; |
222 | thread_t *kb_thread; |
222 | ipl_t ipl; |
223 | ipl_t ipl; |
223 | 224 | ||
224 | ipl = interrupts_disable(); |
225 | ipl = interrupts_disable(); |
225 | spinlock_lock(&tasks_lock); |
226 | spinlock_lock(&tasks_lock); |
226 | 227 | ||
227 | ta = task_find_by_id(taskid); |
228 | ta = task_find_by_id(taskid); |
228 | if (ta == NULL) { |
229 | if (ta == NULL) { |
229 | spinlock_unlock(&tasks_lock); |
230 | spinlock_unlock(&tasks_lock); |
230 | interrupts_restore(ipl); |
231 | interrupts_restore(ipl); |
231 | return ENOENT; |
232 | return ENOENT; |
232 | } |
233 | } |
233 | 234 | ||
234 | atomic_inc(&ta->refcount); |
235 | atomic_inc(&ta->refcount); |
235 | 236 | ||
236 | spinlock_unlock(&tasks_lock); |
237 | spinlock_unlock(&tasks_lock); |
237 | interrupts_restore(ipl); |
238 | interrupts_restore(ipl); |
238 | 239 | ||
239 | mutex_lock(&ta->kb.cleanup_lock); |
240 | mutex_lock(&ta->kb.cleanup_lock); |
240 | 241 | ||
241 | if (atomic_predec(&ta->refcount) == 0) { |
242 | if (atomic_predec(&ta->refcount) == 0) { |
242 | mutex_unlock(&ta->kb.cleanup_lock); |
243 | mutex_unlock(&ta->kb.cleanup_lock); |
243 | task_destroy(ta); |
244 | task_destroy(ta); |
244 | return ENOENT; |
245 | return ENOENT; |
245 | } |
246 | } |
246 | 247 | ||
247 | if (ta->kb.finished != false) { |
248 | if (ta->kb.finished != false) { |
248 | mutex_unlock(&ta->kb.cleanup_lock); |
249 | mutex_unlock(&ta->kb.cleanup_lock); |
249 | return EINVAL; |
250 | return EINVAL; |
250 | } |
251 | } |
251 | 252 | ||
252 | newphid = phone_alloc(); |
253 | newphid = phone_alloc(); |
253 | if (newphid < 0) { |
254 | if (newphid < 0) { |
254 | mutex_unlock(&ta->kb.cleanup_lock); |
255 | mutex_unlock(&ta->kb.cleanup_lock); |
255 | return ELIMIT; |
256 | return ELIMIT; |
256 | } |
257 | } |
257 | 258 | ||
258 | /* Connect the newly allocated phone to the kbox */ |
259 | /* Connect the newly allocated phone to the kbox */ |
259 | ipc_phone_connect(&TASK->phones[newphid], &ta->kb.box); |
260 | ipc_phone_connect(&TASK->phones[newphid], &ta->kb.box); |
260 | 261 | ||
261 | if (ta->kb.thread != NULL) { |
262 | if (ta->kb.thread != NULL) { |
262 | mutex_unlock(&ta->kb.cleanup_lock); |
263 | mutex_unlock(&ta->kb.cleanup_lock); |
263 | return newphid; |
264 | return newphid; |
264 | } |
265 | } |
265 | 266 | ||
266 | /* Create a kbox thread */ |
267 | /* Create a kbox thread */ |
267 | kb_thread = thread_create(kbox_thread_proc, NULL, ta, 0, |
268 | kb_thread = thread_create(kbox_thread_proc, NULL, ta, 0, |
268 | "kbox", false); |
269 | "kbox", false); |
269 | if (!kb_thread) { |
270 | if (!kb_thread) { |
270 | mutex_unlock(&ta->kb.cleanup_lock); |
271 | mutex_unlock(&ta->kb.cleanup_lock); |
271 | return ENOMEM; |
272 | return ENOMEM; |
272 | } |
273 | } |
273 | 274 | ||
274 | ta->kb.thread = kb_thread; |
275 | ta->kb.thread = kb_thread; |
275 | thread_ready(kb_thread); |
276 | thread_ready(kb_thread); |
276 | 277 | ||
277 | mutex_unlock(&ta->kb.cleanup_lock); |
278 | mutex_unlock(&ta->kb.cleanup_lock); |
278 | 279 | ||
279 | return newphid; |
280 | return newphid; |
280 | } |
281 | } |
281 | 282 | ||
282 | /** @} |
283 | /** @} |
283 | */ |
284 | */ |
284 | 285 |