Rev 1418 | Rev 1462 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1418 | Rev 1435 | ||
---|---|---|---|
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 | * @file ns.c |
30 | * @file ns.c |
31 | * @brief Naming service for HelenOS IPC. |
31 | * @brief Naming service for HelenOS IPC. |
32 | */ |
32 | */ |
33 | 33 | ||
34 | #include <ipc/ipc.h> |
34 | #include <ipc/ipc.h> |
35 | #include <ipc/ns.h> |
35 | #include <ipc/ns.h> |
36 | #include <stdio.h> |
36 | #include <stdio.h> |
37 | #include <unistd.h> |
37 | #include <unistd.h> |
38 | #include <stdlib.h> |
38 | #include <stdlib.h> |
39 | #include <errno.h> |
39 | #include <errno.h> |
40 | #include <assert.h> |
40 | #include <assert.h> |
41 | #include <libadt/list.h> |
41 | #include <libadt/list.h> |
42 | #include <libadt/hash_table.h> |
42 | #include <libadt/hash_table.h> |
- | 43 | #include <sysinfo.h> |
|
- | 44 | #include <ddi.h> |
|
- | 45 | #include <as.h> |
|
43 | 46 | ||
44 | #define NAME "NS" |
47 | #define NAME "NS" |
45 | 48 | ||
46 | #define NS_HASH_TABLE_CHAINS 20 |
49 | #define NS_HASH_TABLE_CHAINS 20 |
47 | 50 | ||
48 | static int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call); |
51 | static int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call); |
49 | static int connect_to_service(ipcarg_t service, ipc_call_t *call, ipc_callid_t callid); |
52 | static int connect_to_service(ipcarg_t service, ipc_call_t *call, ipc_callid_t callid); |
50 | 53 | ||
51 | /* Static functions implementing NS hash table operations. */ |
54 | /* Static functions implementing NS hash table operations. */ |
52 | static hash_index_t ns_hash(unsigned long *key); |
55 | static hash_index_t ns_hash(unsigned long *key); |
53 | static int ns_compare(unsigned long *key, hash_count_t keys, link_t *item); |
56 | static int ns_compare(unsigned long *key, hash_count_t keys, link_t *item); |
54 | static void ns_remove(link_t *item); |
57 | static void ns_remove(link_t *item); |
55 | 58 | ||
56 | /** Operations for NS hash table. */ |
59 | /** Operations for NS hash table. */ |
57 | static hash_table_operations_t ns_hash_table_ops = { |
60 | static hash_table_operations_t ns_hash_table_ops = { |
58 | .hash = ns_hash, |
61 | .hash = ns_hash, |
59 | .compare = ns_compare, |
62 | .compare = ns_compare, |
60 | .remove_callback = ns_remove |
63 | .remove_callback = ns_remove |
61 | }; |
64 | }; |
62 | 65 | ||
63 | /** NS hash table structure. */ |
66 | /** NS hash table structure. */ |
64 | static hash_table_t ns_hash_table; |
67 | static hash_table_t ns_hash_table; |
65 | 68 | ||
66 | /** NS hash table item. */ |
69 | /** NS hash table item. */ |
67 | typedef struct { |
70 | typedef struct { |
68 | link_t link; |
71 | link_t link; |
69 | ipcarg_t service; /**< Number of the service. */ |
72 | ipcarg_t service; /**< Number of the service. */ |
70 | ipcarg_t phone; /**< Phone registered with the service. */ |
73 | ipcarg_t phone; /**< Phone registered with the service. */ |
71 | ipcarg_t in_phone_hash; /**< Incoming phone hash. */ |
74 | ipcarg_t in_phone_hash; /**< Incoming phone hash. */ |
72 | } hashed_service_t; |
75 | } hashed_service_t; |
73 | 76 | ||
74 | int static ping_phone; |
77 | int static ping_phone; |
75 | 78 | ||
- | 79 | static void get_realtime_as(ipc_callid_t callid, ipc_call_t *call) |
|
- | 80 | { |
|
- | 81 | static void *addr = NULL; |
|
- | 82 | void *ph_addr; |
|
- | 83 | ||
- | 84 | if (IPC_GET_ARG3(*call) != (AS_AREA_READ | AS_AREA_CACHEABLE)) { |
|
- | 85 | ipc_answer_fast(callid, EPERM, 0, 0); |
|
- | 86 | return; |
|
- | 87 | } |
|
- | 88 | if (!addr) { |
|
- | 89 | ph_addr = (void *)sysinfo_value("clock.faddr"); |
|
- | 90 | if (!ph_addr) { |
|
- | 91 | ipc_answer_fast(callid, ENOENT, 0, 0); |
|
- | 92 | return; |
|
- | 93 | } |
|
- | 94 | addr = (void *)(200*1024*1024); /* TODO: intelligent freemem space */ |
|
- | 95 | map_physmem(task_get_id(), ph_addr, addr, 1, |
|
- | 96 | AS_AREA_READ | AS_AREA_CACHEABLE); |
|
- | 97 | } |
|
- | 98 | ipc_answer_fast(callid, 0, (ipcarg_t)addr, 0); |
|
- | 99 | } |
|
- | 100 | ||
76 | int main(int argc, char **argv) |
101 | int main(int argc, char **argv) |
77 | { |
102 | { |
78 | ipc_call_t call; |
103 | ipc_call_t call; |
79 | ipc_callid_t callid; |
104 | ipc_callid_t callid; |
80 | char *as_area; |
105 | char *as_area; |
81 | 106 | ||
82 | ipcarg_t retval, arg1, arg2; |
107 | ipcarg_t retval, arg1, arg2; |
83 | 108 | ||
84 | // printf("%s: Naming service started.\n", NAME); |
109 | // printf("%s: Naming service started.\n", NAME); |
85 | 110 | ||
86 | if (!hash_table_create(&ns_hash_table, NS_HASH_TABLE_CHAINS, 3, &ns_hash_table_ops)) { |
111 | if (!hash_table_create(&ns_hash_table, NS_HASH_TABLE_CHAINS, 3, &ns_hash_table_ops)) { |
87 | // printf("%s: cannot create hash table\n", NAME); |
112 | // printf("%s: cannot create hash table\n", NAME); |
88 | return ENOMEM; |
113 | return ENOMEM; |
89 | } |
114 | } |
90 | 115 | ||
91 | while (1) { |
116 | while (1) { |
92 | callid = ipc_wait_for_call(&call); |
117 | callid = ipc_wait_for_call(&call); |
93 | // printf("NS: Call in_phone_hash=%lX...", call.in_phone_hash); |
118 | // printf("NS: Call in_phone_hash=%lX...", call.in_phone_hash); |
94 | switch (IPC_GET_METHOD(call)) { |
119 | switch (IPC_GET_METHOD(call)) { |
95 | case IPC_M_AS_AREA_SEND: |
120 | case IPC_M_AS_AREA_SEND: |
96 | as_area = (char *)IPC_GET_ARG1(call); |
121 | as_area = (char *)IPC_GET_ARG1(call); |
97 | // printf("Received as_area: %P, size:%d\n", as_area, IPC_GET_ARG2(call)); |
122 | // printf("Received as_area: %P, size:%d\n", as_area, IPC_GET_ARG2(call)); |
98 | retval = ipc_answer_fast(callid, 0,(sysarg_t)(1024*1024), 0); |
123 | retval = ipc_answer_fast(callid, 0,(sysarg_t)(1024*1024), 0); |
99 | if (!retval) { |
124 | if (!retval) { |
100 | // printf("Reading shared memory..."); |
125 | // printf("Reading shared memory..."); |
101 | // printf("Text: %s", as_area); |
126 | // printf("Text: %s", as_area); |
102 | } else |
127 | } else |
103 | // printf("Failed answer: %d\n", retval); |
128 | // printf("Failed answer: %d\n", retval); |
104 | continue; |
129 | continue; |
- | 130 | case IPC_M_AS_AREA_RECV: |
|
- | 131 | get_realtime_as(callid, &call); |
|
105 | break; |
132 | continue; |
106 | case IPC_M_INTERRUPT: |
133 | case IPC_M_INTERRUPT: |
107 | // printf("GOT INTERRUPT: %c\n", IPC_GET_ARG2(call)); |
- | |
108 | break; |
134 | break; |
109 | case IPC_M_PHONE_HUNGUP: |
135 | case IPC_M_PHONE_HUNGUP: |
110 | // printf("Phone hung up.\n"); |
- | |
111 | retval = 0; |
136 | retval = 0; |
112 | break; |
137 | break; |
113 | case IPC_M_CONNECT_TO_ME: |
138 | case IPC_M_CONNECT_TO_ME: |
114 | /* |
139 | /* |
115 | * Server requests service registration. |
140 | * Server requests service registration. |
116 | */ |
141 | */ |
117 | retval = register_service(IPC_GET_ARG1(call), IPC_GET_ARG3(call), &call); |
142 | retval = register_service(IPC_GET_ARG1(call), IPC_GET_ARG3(call), &call); |
118 | ping_phone = IPC_GET_ARG3(call); |
143 | ping_phone = IPC_GET_ARG3(call); |
119 | break; |
144 | break; |
120 | case IPC_M_CONNECT_ME_TO: |
145 | case IPC_M_CONNECT_ME_TO: |
121 | /* |
146 | /* |
122 | * Client requests to be connected to a service. |
147 | * Client requests to be connected to a service. |
123 | */ |
148 | */ |
124 | retval = connect_to_service(IPC_GET_ARG1(call), &call, callid); |
149 | retval = connect_to_service(IPC_GET_ARG1(call), &call, callid); |
125 | break; |
150 | break; |
126 | case NS_HANGUP: |
151 | case NS_HANGUP: |
127 | // printf("Closing connection.\n"); |
152 | // printf("Closing connection.\n"); |
128 | retval = EHANGUP; |
153 | retval = EHANGUP; |
129 | break; |
154 | break; |
130 | case NS_PING: |
155 | case NS_PING: |
131 | // printf("Ping...%P %P\n", IPC_GET_ARG1(call), |
156 | // printf("Ping...%P %P\n", IPC_GET_ARG1(call), |
132 | // IPC_GET_ARG2(call)); |
157 | // IPC_GET_ARG2(call)); |
133 | retval = 0; |
158 | retval = 0; |
134 | arg1 = 0xdead; |
159 | arg1 = 0xdead; |
135 | arg2 = 0xbeef; |
160 | arg2 = 0xbeef; |
136 | break; |
161 | break; |
137 | case NS_PING_SVC: |
162 | case NS_PING_SVC: |
138 | // printf("NS:Pinging service %d\n", ping_phone); |
163 | // printf("NS:Pinging service %d\n", ping_phone); |
139 | ipc_call_sync(ping_phone, NS_PING, 0xbeef, 0); |
164 | ipc_call_sync(ping_phone, NS_PING, 0xbeef, 0); |
140 | // printf("NS:Got pong\n"); |
165 | // printf("NS:Got pong\n"); |
141 | break; |
166 | break; |
142 | default: |
167 | default: |
143 | // printf("Unknown method: %zd\n", IPC_GET_METHOD(call)); |
168 | // printf("Unknown method: %zd\n", IPC_GET_METHOD(call)); |
144 | retval = ENOENT; |
169 | retval = ENOENT; |
145 | break; |
170 | break; |
146 | } |
171 | } |
147 | if (! (callid & IPC_CALLID_NOTIFICATION)) { |
172 | if (! (callid & IPC_CALLID_NOTIFICATION)) { |
148 | // printf("Answering.\n"); |
173 | // printf("Answering.\n"); |
149 | ipc_answer_fast(callid, retval, arg1, arg2); |
174 | ipc_answer_fast(callid, retval, arg1, arg2); |
150 | } |
175 | } |
151 | } |
176 | } |
152 | } |
177 | } |
153 | 178 | ||
154 | /** Register service. |
179 | /** Register service. |
155 | * |
180 | * |
156 | * @param service Service to be registered. |
181 | * @param service Service to be registered. |
157 | * @param phone phone Phone to be used for connections to the service. |
182 | * @param phone phone Phone to be used for connections to the service. |
158 | * @param call Pointer to call structure. |
183 | * @param call Pointer to call structure. |
159 | * |
184 | * |
160 | * @return Zero on success or a value from @ref errno.h. |
185 | * @return Zero on success or a value from @ref errno.h. |
161 | */ |
186 | */ |
162 | int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call) |
187 | int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call) |
163 | { |
188 | { |
164 | unsigned long keys[3] = { service, call->in_phone_hash, 0 }; |
189 | unsigned long keys[3] = { service, call->in_phone_hash, 0 }; |
165 | hashed_service_t *hs; |
190 | hashed_service_t *hs; |
166 | 191 | ||
167 | // printf("Registering service %d on phone %d...", service, phone); |
192 | // printf("Registering service %d on phone %d...", service, phone); |
168 | 193 | ||
169 | if (hash_table_find(&ns_hash_table, keys)) { |
194 | if (hash_table_find(&ns_hash_table, keys)) { |
170 | // printf("Service %d already registered.\n", service); |
195 | // printf("Service %d already registered.\n", service); |
171 | return EEXISTS; |
196 | return EEXISTS; |
172 | } |
197 | } |
173 | 198 | ||
174 | hs = (hashed_service_t *) malloc(sizeof(hashed_service_t)); |
199 | hs = (hashed_service_t *) malloc(sizeof(hashed_service_t)); |
175 | if (!hs) { |
200 | if (!hs) { |
176 | // printf("Failed to register service %d.\n", service); |
201 | // printf("Failed to register service %d.\n", service); |
177 | return ENOMEM; |
202 | return ENOMEM; |
178 | } |
203 | } |
179 | 204 | ||
180 | link_initialize(&hs->link); |
205 | link_initialize(&hs->link); |
181 | hs->service = service; |
206 | hs->service = service; |
182 | hs->phone = phone; |
207 | hs->phone = phone; |
183 | hs->in_phone_hash = call->in_phone_hash; |
208 | hs->in_phone_hash = call->in_phone_hash; |
184 | hash_table_insert(&ns_hash_table, keys, &hs->link); |
209 | hash_table_insert(&ns_hash_table, keys, &hs->link); |
185 | 210 | ||
186 | return 0; |
211 | return 0; |
187 | } |
212 | } |
188 | 213 | ||
189 | /** Connect client to service. |
214 | /** Connect client to service. |
190 | * |
215 | * |
191 | * @param service Service to be connected to. |
216 | * @param service Service to be connected to. |
192 | * @param call Pointer to call structure. |
217 | * @param call Pointer to call structure. |
193 | * @param callid Call ID of the request. |
218 | * @param callid Call ID of the request. |
194 | * |
219 | * |
195 | * @return Zero on success or a value from @ref errno.h. |
220 | * @return Zero on success or a value from @ref errno.h. |
196 | */ |
221 | */ |
197 | int connect_to_service(ipcarg_t service, ipc_call_t *call, ipc_callid_t callid) |
222 | int connect_to_service(ipcarg_t service, ipc_call_t *call, ipc_callid_t callid) |
198 | { |
223 | { |
199 | unsigned long keys[3] = { service, 0, 0 }; |
224 | unsigned long keys[3] = { service, 0, 0 }; |
200 | link_t *hlp; |
225 | link_t *hlp; |
201 | hashed_service_t *hs; |
226 | hashed_service_t *hs; |
202 | 227 | ||
203 | hlp = hash_table_find(&ns_hash_table, keys); |
228 | hlp = hash_table_find(&ns_hash_table, keys); |
204 | if (!hlp) { |
229 | if (!hlp) { |
205 | // printf("Service %d not registered.\n", service); |
230 | // printf("Service %d not registered.\n", service); |
206 | return ENOENT; |
231 | return ENOENT; |
207 | } |
232 | } |
208 | hs = hash_table_get_instance(hlp, hashed_service_t, link); |
233 | hs = hash_table_get_instance(hlp, hashed_service_t, link); |
209 | // printf("Connecting in_phone_hash=%lX to service at phone %d...", call->in_phone_hash, hs->phone); |
234 | // printf("Connecting in_phone_hash=%lX to service at phone %d...", call->in_phone_hash, hs->phone); |
210 | return ipc_forward_fast(callid, hs->phone, 0, 0); |
235 | return ipc_forward_fast(callid, hs->phone, 0, 0); |
211 | } |
236 | } |
212 | 237 | ||
213 | /** Compute hash index into NS hash table. |
238 | /** Compute hash index into NS hash table. |
214 | * |
239 | * |
215 | * @param key Pointer keys. However, only the first key (i.e. service number) |
240 | * @param key Pointer keys. However, only the first key (i.e. service number) |
216 | * is used to compute the hash index. |
241 | * is used to compute the hash index. |
217 | * @return Hash index corresponding to key[0]. |
242 | * @return Hash index corresponding to key[0]. |
218 | */ |
243 | */ |
219 | hash_index_t ns_hash(unsigned long *key) |
244 | hash_index_t ns_hash(unsigned long *key) |
220 | { |
245 | { |
221 | assert(key); |
246 | assert(key); |
222 | return *key % NS_HASH_TABLE_CHAINS; |
247 | return *key % NS_HASH_TABLE_CHAINS; |
223 | } |
248 | } |
224 | 249 | ||
225 | /** Compare a key with hashed item. |
250 | /** Compare a key with hashed item. |
226 | * |
251 | * |
227 | * This compare function always ignores the third key. |
252 | * This compare function always ignores the third key. |
228 | * It exists only to make it possible to remove records |
253 | * It exists only to make it possible to remove records |
229 | * originating from connection with key[1] in_phone_hash |
254 | * originating from connection with key[1] in_phone_hash |
230 | * value. Note that this is close to being classified |
255 | * value. Note that this is close to being classified |
231 | * as a nasty hack. |
256 | * as a nasty hack. |
232 | * |
257 | * |
233 | * @param key Array of keys. |
258 | * @param key Array of keys. |
234 | * @param keys Must be lesser or equal to 3. |
259 | * @param keys Must be lesser or equal to 3. |
235 | * @param item Pointer to a hash table item. |
260 | * @param item Pointer to a hash table item. |
236 | * @return Non-zero if the key matches the item, zero otherwise. |
261 | * @return Non-zero if the key matches the item, zero otherwise. |
237 | */ |
262 | */ |
238 | int ns_compare(unsigned long key[], hash_count_t keys, link_t *item) |
263 | int ns_compare(unsigned long key[], hash_count_t keys, link_t *item) |
239 | { |
264 | { |
240 | hashed_service_t *hs; |
265 | hashed_service_t *hs; |
241 | 266 | ||
242 | assert(key); |
267 | assert(key); |
243 | assert(keys <= 3); |
268 | assert(keys <= 3); |
244 | assert(item); |
269 | assert(item); |
245 | 270 | ||
246 | hs = hash_table_get_instance(item, hashed_service_t, link); |
271 | hs = hash_table_get_instance(item, hashed_service_t, link); |
247 | 272 | ||
248 | if (keys == 2) |
273 | if (keys == 2) |
249 | return key[1] == hs->in_phone_hash; |
274 | return key[1] == hs->in_phone_hash; |
250 | else |
275 | else |
251 | return key[0] == hs->service; |
276 | return key[0] == hs->service; |
252 | } |
277 | } |
253 | 278 | ||
254 | /** Perform actions after removal of item from the hash table. |
279 | /** Perform actions after removal of item from the hash table. |
255 | * |
280 | * |
256 | * @param item Item that was removed from the hash table. |
281 | * @param item Item that was removed from the hash table. |
257 | */ |
282 | */ |
258 | void ns_remove(link_t *item) |
283 | void ns_remove(link_t *item) |
259 | { |
284 | { |
260 | assert(item); |
285 | assert(item); |
261 | free(hash_table_get_instance(item, hashed_service_t, link)); |
286 | free(hash_table_get_instance(item, hashed_service_t, link)); |
262 | } |
287 | } |
263 | 288 |