Rev 1408 | Rev 1435 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1408 | Rev 1427 | ||
---|---|---|---|
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 | /** |
29 | /** |
30 | * Asynchronous library |
30 | * Asynchronous library |
31 | * |
31 | * |
32 | * The aim of this library is facilitating writing programs utilizing |
32 | * The aim of this library is facilitating writing programs utilizing |
33 | * the asynchronous nature of Helenos IPC, yet using a normal way |
33 | * the asynchronous nature of Helenos IPC, yet using a normal way |
34 | * of programming. |
34 | * of programming. |
35 | * |
35 | * |
36 | * You should be able to write very simple multithreaded programs, |
36 | * You should be able to write very simple multithreaded programs, |
37 | * the async framework will automatically take care of most synchronization |
37 | * the async framework will automatically take care of most synchronization |
38 | * problems. |
38 | * problems. |
39 | * |
39 | * |
40 | * Default semantics: |
40 | * Default semantics: |
41 | * - send() - send asynchronously. If the kernel refuses to send more |
41 | * - send() - send asynchronously. If the kernel refuses to send more |
42 | * messages, [ try to get responses from kernel, if nothing |
42 | * messages, [ try to get responses from kernel, if nothing |
43 | * found, might try synchronous ] |
43 | * found, might try synchronous ] |
44 | * |
44 | * |
45 | * Example of use: |
45 | * Example of use: |
46 | * |
46 | * |
47 | * 1) Multithreaded client application |
47 | * 1) Multithreaded client application |
48 | * create_thread(thread1); |
48 | * create_thread(thread1); |
49 | * create_thread(thread2); |
49 | * create_thread(thread2); |
50 | * ... |
50 | * ... |
51 | * |
51 | * |
52 | * thread1() { |
52 | * thread1() { |
53 | * conn = ipc_connect_me_to(); |
53 | * conn = ipc_connect_me_to(); |
54 | * c1 = send(conn); |
54 | * c1 = send(conn); |
55 | * c2 = send(conn); |
55 | * c2 = send(conn); |
56 | * wait_for(c1); |
56 | * wait_for(c1); |
57 | * wait_for(c2); |
57 | * wait_for(c2); |
58 | * } |
58 | * } |
59 | * |
59 | * |
60 | * |
60 | * |
61 | * 2) Multithreaded server application |
61 | * 2) Multithreaded server application |
62 | * main() { |
62 | * main() { |
63 | * async_manager(); |
63 | * async_manager(); |
64 | * } |
64 | * } |
65 | * |
65 | * |
66 | * |
66 | * |
67 | * client_connection(icallid, *icall) { |
67 | * client_connection(icallid, *icall) { |
68 | * if (want_refuse) { |
68 | * if (want_refuse) { |
69 | * ipc_answer_fast(icallid, ELIMIT, 0, 0); |
69 | * ipc_answer_fast(icallid, ELIMIT, 0, 0); |
70 | * return; |
70 | * return; |
71 | * } |
71 | * } |
72 | * ipc_answer_fast(icallid, 0, 0, 0); |
72 | * ipc_answer_fast(icallid, 0, 0, 0); |
73 | * |
73 | * |
74 | * callid = async_get_call(&call); |
74 | * callid = async_get_call(&call); |
75 | * handle(callid, call); |
75 | * handle(callid, call); |
76 | * ipc_answer_fast(callid, 1,2,3); |
76 | * ipc_answer_fast(callid, 1,2,3); |
77 | * |
77 | * |
78 | * callid = async_get_call(&call); |
78 | * callid = async_get_call(&call); |
79 | * .... |
79 | * .... |
80 | * } |
80 | * } |
81 | * |
81 | * |
82 | * TODO: Detaching/joining dead psthreads? |
82 | * TODO: Detaching/joining dead psthreads? |
83 | */ |
83 | */ |
84 | #include <futex.h> |
84 | #include <futex.h> |
85 | #include <async.h> |
85 | #include <async.h> |
86 | #include <psthread.h> |
86 | #include <psthread.h> |
87 | #include <stdio.h> |
87 | #include <stdio.h> |
88 | #include <libadt/hash_table.h> |
88 | #include <libadt/hash_table.h> |
89 | #include <libadt/list.h> |
89 | #include <libadt/list.h> |
90 | #include <ipc/ipc.h> |
90 | #include <ipc/ipc.h> |
91 | #include <assert.h> |
91 | #include <assert.h> |
92 | #include <errno.h> |
92 | #include <errno.h> |
93 | 93 | ||
94 | static atomic_t conn_futex = FUTEX_INITIALIZER; |
94 | static atomic_t async_futex = FUTEX_INITIALIZER; |
95 | static hash_table_t conn_hash_table; |
95 | static hash_table_t conn_hash_table; |
96 | 96 | ||
97 | typedef struct { |
97 | typedef struct { |
- | 98 | pstid_t ptid; /**< Thread waiting for this message */ |
|
- | 99 | int active; /**< If this thread is currently active */ |
|
- | 100 | int done; /**< If reply was received */ |
|
- | 101 | ipc_call_t *dataptr; /**< Pointer where the answer data |
|
- | 102 | * should be stored */ |
|
- | 103 | ipcarg_t retval; |
|
- | 104 | } amsg_t; |
|
- | 105 | ||
- | 106 | typedef struct { |
|
98 | link_t link; |
107 | link_t link; |
99 | ipc_callid_t callid; |
108 | ipc_callid_t callid; |
100 | ipc_call_t call; |
109 | ipc_call_t call; |
101 | } msg_t; |
110 | } msg_t; |
102 | 111 | ||
103 | typedef struct { |
112 | typedef struct { |
104 | link_t link; |
113 | link_t link; |
105 | ipcarg_t in_phone_hash; /**< Incoming phone hash. */ |
114 | ipcarg_t in_phone_hash; /**< Incoming phone hash. */ |
106 | link_t msg_queue; /**< Messages that should be delivered to this thread */ |
115 | link_t msg_queue; /**< Messages that should be delivered to this thread */ |
107 | pstid_t ptid; /**< Thread associated with this connection */ |
116 | pstid_t ptid; /**< Thread associated with this connection */ |
108 | int active; /**< If this thread is currently active */ |
117 | int active; /**< If this thread is currently active */ |
109 | /* Structures for connection opening packet */ |
118 | /* Structures for connection opening packet */ |
110 | ipc_callid_t callid; |
119 | ipc_callid_t callid; |
111 | ipc_call_t call; |
120 | ipc_call_t call; |
112 | void (*cthread)(ipc_callid_t,ipc_call_t *); |
121 | void (*cthread)(ipc_callid_t,ipc_call_t *); |
113 | } connection_t; |
122 | } connection_t; |
114 | 123 | ||
115 | __thread connection_t *PS_connection; |
124 | __thread connection_t *PS_connection; |
116 | 125 | ||
117 | /* Hash table functions */ |
126 | /* Hash table functions */ |
118 | - | ||
119 | #define CONN_HASH_TABLE_CHAINS 32 |
127 | #define CONN_HASH_TABLE_CHAINS 32 |
120 | 128 | ||
121 | static hash_index_t conn_hash(unsigned long *key) |
129 | static hash_index_t conn_hash(unsigned long *key) |
122 | { |
130 | { |
123 | assert(key); |
131 | assert(key); |
124 | return ((*key) >> 4) % CONN_HASH_TABLE_CHAINS; |
132 | return ((*key) >> 4) % CONN_HASH_TABLE_CHAINS; |
125 | } |
133 | } |
126 | 134 | ||
127 | static int conn_compare(unsigned long key[], hash_count_t keys, link_t *item) |
135 | static int conn_compare(unsigned long key[], hash_count_t keys, link_t *item) |
128 | { |
136 | { |
129 | connection_t *hs; |
137 | connection_t *hs; |
130 | 138 | ||
131 | hs = hash_table_get_instance(item, connection_t, link); |
139 | hs = hash_table_get_instance(item, connection_t, link); |
132 | 140 | ||
133 | return key[0] == hs->in_phone_hash; |
141 | return key[0] == hs->in_phone_hash; |
134 | } |
142 | } |
135 | 143 | ||
136 | static void conn_remove(link_t *item) |
144 | static void conn_remove(link_t *item) |
137 | { |
145 | { |
138 | free(hash_table_get_instance(item, connection_t, link)); |
146 | free(hash_table_get_instance(item, connection_t, link)); |
139 | } |
147 | } |
140 | 148 | ||
141 | 149 | ||
142 | /** Operations for NS hash table. */ |
150 | /** Operations for NS hash table. */ |
143 | static hash_table_operations_t conn_hash_table_ops = { |
151 | static hash_table_operations_t conn_hash_table_ops = { |
144 | .hash = conn_hash, |
152 | .hash = conn_hash, |
145 | .compare = conn_compare, |
153 | .compare = conn_compare, |
146 | .remove_callback = conn_remove |
154 | .remove_callback = conn_remove |
147 | }; |
155 | }; |
148 | 156 | ||
- | 157 | /*************************************************/ |
|
- | 158 | ||
149 | /** Try to route a call to an appropriate connection thread |
159 | /** Try to route a call to an appropriate connection thread |
150 | * |
160 | * |
151 | */ |
161 | */ |
152 | static int route_call(ipc_callid_t callid, ipc_call_t *call) |
162 | static int route_call(ipc_callid_t callid, ipc_call_t *call) |
153 | { |
163 | { |
154 | connection_t *conn; |
164 | connection_t *conn; |
155 | msg_t *msg; |
165 | msg_t *msg; |
156 | link_t *hlp; |
166 | link_t *hlp; |
157 | unsigned long key; |
167 | unsigned long key; |
158 | 168 | ||
159 | futex_down(&conn_futex); |
169 | futex_down(&async_futex); |
160 | 170 | ||
161 | key = call->in_phone_hash; |
171 | key = call->in_phone_hash; |
162 | hlp = hash_table_find(&conn_hash_table, &key); |
172 | hlp = hash_table_find(&conn_hash_table, &key); |
163 | if (!hlp) { |
173 | if (!hlp) { |
164 | futex_up(&conn_futex); |
174 | futex_up(&async_futex); |
165 | return 0; |
175 | return 0; |
166 | } |
176 | } |
167 | conn = hash_table_get_instance(hlp, connection_t, link); |
177 | conn = hash_table_get_instance(hlp, connection_t, link); |
168 | 178 | ||
169 | msg = malloc(sizeof(*msg)); |
179 | msg = malloc(sizeof(*msg)); |
170 | msg->callid = callid; |
180 | msg->callid = callid; |
171 | msg->call = *call; |
181 | msg->call = *call; |
172 | list_append(&msg->link, &conn->msg_queue); |
182 | list_append(&msg->link, &conn->msg_queue); |
173 | 183 | ||
174 | if (!conn->active) { |
184 | if (!conn->active) { |
175 | conn->active = 1; |
185 | conn->active = 1; |
176 | psthread_add_ready(conn->ptid); |
186 | psthread_add_ready(conn->ptid); |
177 | } |
187 | } |
178 | 188 | ||
179 | futex_up(&conn_futex); |
189 | futex_up(&async_futex); |
180 | 190 | ||
181 | return 1; |
191 | return 1; |
182 | } |
192 | } |
183 | 193 | ||
184 | /** Return new incoming message for current(thread-local) connection */ |
194 | /** Return new incoming message for current(thread-local) connection */ |
185 | ipc_callid_t async_get_call(ipc_call_t *call) |
195 | ipc_callid_t async_get_call(ipc_call_t *call) |
186 | { |
196 | { |
187 | msg_t *msg; |
197 | msg_t *msg; |
188 | ipc_callid_t callid; |
198 | ipc_callid_t callid; |
189 | connection_t *conn; |
199 | connection_t *conn; |
190 | 200 | ||
191 | futex_down(&conn_futex); |
201 | futex_down(&async_futex); |
192 | 202 | ||
193 | conn = PS_connection; |
203 | conn = PS_connection; |
194 | /* If nothing in queue, wait until something appears */ |
204 | /* If nothing in queue, wait until something appears */ |
195 | if (list_empty(&conn->msg_queue)) { |
205 | if (list_empty(&conn->msg_queue)) { |
196 | conn->active = 0; |
206 | conn->active = 0; |
197 | psthread_schedule_next_adv(PS_TO_MANAGER); |
207 | psthread_schedule_next_adv(PS_TO_MANAGER); |
198 | } |
208 | } |
199 | 209 | ||
200 | msg = list_get_instance(conn->msg_queue.next, msg_t, link); |
210 | msg = list_get_instance(conn->msg_queue.next, msg_t, link); |
201 | list_remove(&msg->link); |
211 | list_remove(&msg->link); |
202 | callid = msg->callid; |
212 | callid = msg->callid; |
203 | *call = msg->call; |
213 | *call = msg->call; |
204 | free(msg); |
214 | free(msg); |
205 | 215 | ||
206 | futex_up(&conn_futex); |
216 | futex_up(&async_futex); |
207 | return callid; |
217 | return callid; |
208 | } |
218 | } |
209 | 219 | ||
210 | /** Thread function that gets created on new connection |
220 | /** Thread function that gets created on new connection |
211 | * |
221 | * |
212 | * This function is defined as a weak symbol - to be redefined in |
222 | * This function is defined as a weak symbol - to be redefined in |
213 | * user code. |
223 | * user code. |
214 | */ |
224 | */ |
215 | void client_connection(ipc_callid_t callid, ipc_call_t *call) |
225 | void client_connection(ipc_callid_t callid, ipc_call_t *call) |
216 | { |
226 | { |
217 | ipc_answer_fast(callid, ENOENT, 0, 0); |
227 | ipc_answer_fast(callid, ENOENT, 0, 0); |
218 | } |
228 | } |
219 | 229 | ||
220 | /** Wrapper for client connection thread |
230 | /** Wrapper for client connection thread |
221 | * |
231 | * |
222 | * When new connection arrives, thread with this function is created. |
232 | * When new connection arrives, thread with this function is created. |
223 | * It calls client_connection and does final cleanup. |
233 | * It calls client_connection and does final cleanup. |
224 | * |
234 | * |
225 | * @parameter arg Connection structure pointer |
235 | * @parameter arg Connection structure pointer |
226 | */ |
236 | */ |
227 | static int connection_thread(void *arg) |
237 | static int connection_thread(void *arg) |
228 | { |
238 | { |
229 | unsigned long key; |
239 | unsigned long key; |
230 | msg_t *msg; |
240 | msg_t *msg; |
231 | connection_t *conn; |
241 | connection_t *conn; |
232 | 242 | ||
233 | /* Setup thread local connection pointer */ |
243 | /* Setup thread local connection pointer */ |
234 | PS_connection = (connection_t *)arg; |
244 | PS_connection = (connection_t *)arg; |
235 | conn = PS_connection; |
245 | conn = PS_connection; |
236 | conn->cthread(conn->callid, &conn->call); |
246 | conn->cthread(conn->callid, &conn->call); |
237 | 247 | ||
238 | /* Remove myself from connection hash table */ |
248 | /* Remove myself from connection hash table */ |
239 | futex_down(&conn_futex); |
249 | futex_down(&async_futex); |
240 | key = conn->in_phone_hash; |
250 | key = conn->in_phone_hash; |
241 | hash_table_remove(&conn_hash_table, &key, 1); |
251 | hash_table_remove(&conn_hash_table, &key, 1); |
242 | futex_up(&conn_futex); |
252 | futex_up(&async_futex); |
243 | /* Answer all remaining messages with ehangup */ |
253 | /* Answer all remaining messages with ehangup */ |
244 | while (!list_empty(&conn->msg_queue)) { |
254 | while (!list_empty(&conn->msg_queue)) { |
245 | msg = list_get_instance(conn->msg_queue.next, msg_t, link); |
255 | msg = list_get_instance(conn->msg_queue.next, msg_t, link); |
246 | list_remove(&msg->link); |
256 | list_remove(&msg->link); |
247 | ipc_answer_fast(msg->callid, EHANGUP, 0, 0); |
257 | ipc_answer_fast(msg->callid, EHANGUP, 0, 0); |
248 | free(msg); |
258 | free(msg); |
249 | } |
259 | } |
250 | } |
260 | } |
251 | 261 | ||
252 | /** Create new thread for a new connection |
262 | /** Create new thread for a new connection |
253 | * |
263 | * |
254 | * Creates new thread for connection, fills in connection |
264 | * Creates new thread for connection, fills in connection |
255 | * structures and inserts it into the hash table, so that |
265 | * structures and inserts it into the hash table, so that |
256 | * later we can easily do routing of messages to particular |
266 | * later we can easily do routing of messages to particular |
257 | * threads. |
267 | * threads. |
258 | * |
268 | * |
259 | * @param callid Callid of the IPC_M_CONNECT_ME_TO packet |
269 | * @param callid Callid of the IPC_M_CONNECT_ME_TO packet |
260 | * @param call Call data of the opening packet |
270 | * @param call Call data of the opening packet |
261 | * @param cthread Thread function that should be called upon |
271 | * @param cthread Thread function that should be called upon |
262 | * opening the connection |
272 | * opening the connection |
263 | * @return New thread id |
273 | * @return New thread id |
264 | */ |
274 | */ |
265 | pstid_t async_new_connection(ipc_callid_t callid, ipc_call_t *call, |
275 | pstid_t async_new_connection(ipc_callid_t callid, ipc_call_t *call, |
266 | void (*cthread)(ipc_callid_t,ipc_call_t *)) |
276 | void (*cthread)(ipc_callid_t,ipc_call_t *)) |
267 | { |
277 | { |
268 | pstid_t ptid; |
278 | pstid_t ptid; |
269 | connection_t *conn; |
279 | connection_t *conn; |
270 | unsigned long key; |
280 | unsigned long key; |
271 | 281 | ||
272 | conn = malloc(sizeof(*conn)); |
282 | conn = malloc(sizeof(*conn)); |
273 | if (!conn) { |
283 | if (!conn) { |
274 | ipc_answer_fast(callid, ENOMEM, 0, 0); |
284 | ipc_answer_fast(callid, ENOMEM, 0, 0); |
275 | return NULL; |
285 | return NULL; |
276 | } |
286 | } |
277 | conn->in_phone_hash = IPC_GET_ARG3(*call); |
287 | conn->in_phone_hash = IPC_GET_ARG3(*call); |
278 | list_initialize(&conn->msg_queue); |
288 | list_initialize(&conn->msg_queue); |
279 | conn->ptid = psthread_create(connection_thread, conn); |
289 | conn->ptid = psthread_create(connection_thread, conn); |
280 | conn->callid = callid; |
290 | conn->callid = callid; |
281 | conn->call = *call; |
291 | conn->call = *call; |
282 | conn->active = 1; /* We will activate it asap */ |
292 | conn->active = 1; /* We will activate it asap */ |
283 | conn->cthread = cthread; |
293 | conn->cthread = cthread; |
284 | list_initialize(&conn->link); |
294 | list_initialize(&conn->link); |
285 | if (!conn->ptid) { |
295 | if (!conn->ptid) { |
286 | free(conn); |
296 | free(conn); |
287 | ipc_answer_fast(callid, ENOMEM, 0, 0); |
297 | ipc_answer_fast(callid, ENOMEM, 0, 0); |
288 | return NULL; |
298 | return NULL; |
289 | } |
299 | } |
290 | key = conn->in_phone_hash; |
300 | key = conn->in_phone_hash; |
291 | futex_down(&conn_futex); |
301 | futex_down(&async_futex); |
292 | /* Add connection to hash table */ |
302 | /* Add connection to hash table */ |
293 | hash_table_insert(&conn_hash_table, &key, &conn->link); |
303 | hash_table_insert(&conn_hash_table, &key, &conn->link); |
294 | futex_up(&conn_futex); |
304 | futex_up(&async_futex); |
295 | 305 | ||
296 | psthread_add_ready(conn->ptid); |
306 | psthread_add_ready(conn->ptid); |
297 | 307 | ||
298 | return conn->ptid; |
308 | return conn->ptid; |
299 | } |
309 | } |
300 | 310 | ||
301 | /** Handle call to a task */ |
311 | /** Handle call that was received */ |
302 | static void handle_call(ipc_callid_t callid, ipc_call_t *call) |
312 | static void handle_call(ipc_callid_t callid, ipc_call_t *call) |
303 | { |
313 | { |
304 | if (route_call(callid, call)) |
314 | if (route_call(callid, call)) |
305 | return; |
315 | return; |
306 | 316 | ||
307 | switch (IPC_GET_METHOD(*call)) { |
317 | switch (IPC_GET_METHOD(*call)) { |
308 | case IPC_M_INTERRUPT: |
318 | case IPC_M_INTERRUPT: |
309 | break; |
319 | break; |
310 | case IPC_M_CONNECT_ME_TO: |
320 | case IPC_M_CONNECT_ME_TO: |
311 | /* Open new connection with thread etc. */ |
321 | /* Open new connection with thread etc. */ |
312 | async_new_connection(callid, call, client_connection); |
322 | async_new_connection(callid, call, client_connection); |
313 | break; |
323 | break; |
314 | default: |
324 | default: |
315 | ipc_answer_fast(callid, EHANGUP, 0, 0); |
325 | ipc_answer_fast(callid, EHANGUP, 0, 0); |
316 | } |
326 | } |
317 | } |
327 | } |
318 | 328 | ||
319 | /** Endless loop dispatching incoming calls and answers */ |
329 | /** Endless loop dispatching incoming calls and answers */ |
320 | int async_manager() |
330 | int async_manager() |
321 | { |
331 | { |
322 | ipc_call_t call; |
332 | ipc_call_t call; |
323 | ipc_callid_t callid; |
333 | ipc_callid_t callid; |
324 | 334 | ||
325 | while (1) { |
335 | while (1) { |
326 | if (psthread_schedule_next_adv(PS_FROM_MANAGER)) { |
336 | if (psthread_schedule_next_adv(PS_FROM_MANAGER)) { |
327 | futex_up(&conn_futex); /* conn_futex is always held |
337 | futex_up(&async_futex); /* async_futex is always held |
328 | * when entering manager thread |
338 | * when entering manager thread |
329 | */ |
339 | */ |
330 | continue; |
340 | continue; |
331 | } |
341 | } |
332 | callid = ipc_wait_cycle(&call,SYNCH_NO_TIMEOUT,SYNCH_BLOCKING); |
342 | callid = ipc_wait_cycle(&call,SYNCH_NO_TIMEOUT,SYNCH_BLOCKING); |
333 | 343 | ||
334 | if (callid & IPC_CALLID_ANSWERED) |
344 | if (callid & IPC_CALLID_ANSWERED) |
335 | continue; |
345 | continue; |
- | 346 | ||
336 | handle_call(callid, &call); |
347 | handle_call(callid, &call); |
337 | } |
348 | } |
338 | } |
349 | } |
339 | 350 | ||
340 | /** Function to start async_manager as a standalone thread |
351 | /** Function to start async_manager as a standalone thread |
341 | * |
352 | * |
342 | * When more kernel threads are used, one async manager should |
353 | * When more kernel threads are used, one async manager should |
343 | * exist per thread. The particular implementation may change, |
354 | * exist per thread. The particular implementation may change, |
344 | * currently one async_manager is started automatically per kernel |
355 | * currently one async_manager is started automatically per kernel |
345 | * thread except main thread. |
356 | * thread except main thread. |
346 | */ |
357 | */ |
347 | static int async_manager_thread(void *arg) |
358 | static int async_manager_thread(void *arg) |
348 | { |
359 | { |
349 | futex_up(&conn_futex); /* conn_futex is always locked when entering |
360 | futex_up(&async_futex); /* async_futex is always locked when entering |
350 | * manager */ |
361 | * manager */ |
351 | async_manager(); |
362 | async_manager(); |
352 | } |
363 | } |
353 | 364 | ||
354 | /** Add one manager to manager list */ |
365 | /** Add one manager to manager list */ |
355 | void async_create_manager(void) |
366 | void async_create_manager(void) |
356 | { |
367 | { |
357 | pstid_t ptid; |
368 | pstid_t ptid; |
358 | 369 | ||
359 | ptid = psthread_create(async_manager_thread, NULL); |
370 | ptid = psthread_create(async_manager_thread, NULL); |
360 | psthread_add_manager(ptid); |
371 | psthread_add_manager(ptid); |
361 | } |
372 | } |
362 | 373 | ||
363 | /** Remove one manager from manager list */ |
374 | /** Remove one manager from manager list */ |
364 | void async_destroy_manager(void) |
375 | void async_destroy_manager(void) |
365 | { |
376 | { |
366 | psthread_remove_manager(); |
377 | psthread_remove_manager(); |
367 | } |
378 | } |
368 | 379 | ||
369 | /** Initialize internal structures needed for async manager */ |
380 | /** Initialize internal structures needed for async manager */ |
370 | int _async_init(void) |
381 | int _async_init(void) |
371 | { |
382 | { |
372 | if (!hash_table_create(&conn_hash_table, CONN_HASH_TABLE_CHAINS, 1, &conn_hash_table_ops)) { |
383 | if (!hash_table_create(&conn_hash_table, CONN_HASH_TABLE_CHAINS, 1, &conn_hash_table_ops)) { |
373 | printf("%s: cannot create hash table\n", "async"); |
384 | printf("%s: cannot create hash table\n", "async"); |
374 | return ENOMEM; |
385 | return ENOMEM; |
375 | } |
386 | } |
376 | 387 | ||
377 | } |
388 | } |
- | 389 | ||
- | 390 | /** IPC handler for messages in async framework |
|
- | 391 | * |
|
- | 392 | * Notify thread that is waiting for this message, that it arrived |
|
- | 393 | */ |
|
- | 394 | static void reply_received(void *private, int retval, |
|
- | 395 | ipc_call_t *data) |
|
- | 396 | { |
|
- | 397 | amsg_t *msg = (amsg_t *) private; |
|
- | 398 | ||
- | 399 | msg->retval = retval; |
|
- | 400 | ||
- | 401 | futex_down(&async_futex); |
|
- | 402 | /* Copy data after futex_down, just in case the |
|
- | 403 | * call was detached |
|
- | 404 | */ |
|
- | 405 | if (msg->dataptr) |
|
- | 406 | *msg->dataptr = *data; |
|
- | 407 | ||
- | 408 | msg->done = 1; |
|
- | 409 | if (! msg->active) { |
|
- | 410 | msg->active = 1; |
|
- | 411 | psthread_add_ready(msg->ptid); |
|
- | 412 | } |
|
- | 413 | futex_up(&async_futex); |
|
- | 414 | } |
|
- | 415 | ||
- | 416 | /** Send message and return id of the sent message |
|
- | 417 | * |
|
- | 418 | * The return value can be used as input for async_wait() to wait |
|
- | 419 | * for completion. |
|
- | 420 | */ |
|
- | 421 | aid_t async_send_2(int phoneid, ipcarg_t method, ipcarg_t arg1, ipcarg_t arg2, |
|
- | 422 | ipc_call_t *dataptr) |
|
- | 423 | { |
|
- | 424 | amsg_t *msg; |
|
- | 425 | ||
- | 426 | msg = malloc(sizeof(*msg)); |
|
- | 427 | msg->active = 1; |
|
- | 428 | msg->done = 0; |
|
- | 429 | msg->dataptr = dataptr; |
|
- | 430 | ipc_call_async_2(phoneid,method,arg1,arg2,msg,reply_received); |
|
- | 431 | ||
- | 432 | return (aid_t) msg; |
|
- | 433 | } |
|
- | 434 | ||
- | 435 | /** Wait for a message sent by async framework |
|
- | 436 | * |
|
- | 437 | * @param amsgid Message ID to wait for |
|
- | 438 | * @param retval Pointer to variable where will be stored retval |
|
- | 439 | * of the answered message. If NULL, it is ignored. |
|
- | 440 | * |
|
- | 441 | */ |
|
- | 442 | void async_wait_for(aid_t amsgid, ipcarg_t *retval) |
|
- | 443 | { |
|
- | 444 | amsg_t *msg = (amsg_t *) amsgid; |
|
- | 445 | connection_t *conn; |
|
- | 446 | ||
- | 447 | futex_down(&async_futex); |
|
- | 448 | if (msg->done) { |
|
- | 449 | futex_up(&async_futex); |
|
- | 450 | goto done; |
|
- | 451 | } |
|
- | 452 | ||
- | 453 | msg->ptid = psthread_get_id(); |
|
- | 454 | msg->active = 0; |
|
- | 455 | /* Leave locked async_futex when entering this function */ |
|
- | 456 | psthread_schedule_next_adv(PS_TO_MANAGER); |
|
- | 457 | /* futex is up automatically after psthread_schedule_next...*/ |
|
- | 458 | done: |
|
- | 459 | if (retval) |
|
- | 460 | *retval = msg->retval; |
|
- | 461 | free(msg); |
|
- | 462 | } |
|
378 | 463 |