source: mainline/ns/ns.c@ 0b99e40

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 0b99e40 was 0b99e40, checked in by Ondrej Palkovsky <ondrap@…>, 19 years ago

Rough implementation of gettimeofday.
IPC_M_RECV_AS doesn't allow us to specify additional user parametrs. That
doesn't seem to be very configurable :-/

  • Property mode set to 100644
File size: 8.2 KB
Line 
1/*
2 * Copyright (C) 2006 Ondrej Palkovsky
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
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
15 * derived from this software without specific prior written permission.
16 *
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
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29/**
30 * @file ns.c
31 * @brief Naming service for HelenOS IPC.
32 */
33
34#include <ipc/ipc.h>
35#include <ipc/ns.h>
36#include <stdio.h>
37#include <unistd.h>
38#include <stdlib.h>
39#include <errno.h>
40#include <assert.h>
41#include <libadt/list.h>
42#include <libadt/hash_table.h>
43#include <sysinfo.h>
44#include <ddi.h>
45#include <as.h>
46
47#define NAME "NS"
48
49#define NS_HASH_TABLE_CHAINS 20
50
51static int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call);
52static int connect_to_service(ipcarg_t service, ipc_call_t *call, ipc_callid_t callid);
53
54/* Static functions implementing NS hash table operations. */
55static hash_index_t ns_hash(unsigned long *key);
56static int ns_compare(unsigned long *key, hash_count_t keys, link_t *item);
57static void ns_remove(link_t *item);
58
59/** Operations for NS hash table. */
60static hash_table_operations_t ns_hash_table_ops = {
61 .hash = ns_hash,
62 .compare = ns_compare,
63 .remove_callback = ns_remove
64};
65
66/** NS hash table structure. */
67static hash_table_t ns_hash_table;
68
69/** NS hash table item. */
70typedef struct {
71 link_t link;
72 ipcarg_t service; /**< Number of the service. */
73 ipcarg_t phone; /**< Phone registered with the service. */
74 ipcarg_t in_phone_hash; /**< Incoming phone hash. */
75} hashed_service_t;
76
77int static ping_phone;
78
79static 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
101int main(int argc, char **argv)
102{
103 ipc_call_t call;
104 ipc_callid_t callid;
105 char *as_area;
106
107 ipcarg_t retval, arg1, arg2;
108
109// printf("%s: Naming service started.\n", NAME);
110
111 if (!hash_table_create(&ns_hash_table, NS_HASH_TABLE_CHAINS, 3, &ns_hash_table_ops)) {
112// printf("%s: cannot create hash table\n", NAME);
113 return ENOMEM;
114 }
115
116 while (1) {
117 callid = ipc_wait_for_call(&call);
118// printf("NS: Call in_phone_hash=%lX...", call.in_phone_hash);
119 switch (IPC_GET_METHOD(call)) {
120 case IPC_M_AS_AREA_SEND:
121 as_area = (char *)IPC_GET_ARG1(call);
122// printf("Received as_area: %P, size:%d\n", as_area, IPC_GET_ARG2(call));
123 retval = ipc_answer_fast(callid, 0,(sysarg_t)(1024*1024), 0);
124 if (!retval) {
125// printf("Reading shared memory...");
126// printf("Text: %s", as_area);
127 } else
128// printf("Failed answer: %d\n", retval);
129 continue;
130 case IPC_M_AS_AREA_RECV:
131 get_realtime_as(callid, &call);
132 continue;
133 case IPC_M_INTERRUPT:
134 break;
135 case IPC_M_PHONE_HUNGUP:
136 retval = 0;
137 break;
138 case IPC_M_CONNECT_TO_ME:
139 /*
140 * Server requests service registration.
141 */
142 retval = register_service(IPC_GET_ARG1(call), IPC_GET_ARG3(call), &call);
143 ping_phone = IPC_GET_ARG3(call);
144 break;
145 case IPC_M_CONNECT_ME_TO:
146 /*
147 * Client requests to be connected to a service.
148 */
149 retval = connect_to_service(IPC_GET_ARG1(call), &call, callid);
150 break;
151 case NS_HANGUP:
152// printf("Closing connection.\n");
153 retval = EHANGUP;
154 break;
155 case NS_PING:
156// printf("Ping...%P %P\n", IPC_GET_ARG1(call),
157// IPC_GET_ARG2(call));
158 retval = 0;
159 arg1 = 0xdead;
160 arg2 = 0xbeef;
161 break;
162 case NS_PING_SVC:
163// printf("NS:Pinging service %d\n", ping_phone);
164 ipc_call_sync(ping_phone, NS_PING, 0xbeef, 0);
165// printf("NS:Got pong\n");
166 break;
167 default:
168// printf("Unknown method: %zd\n", IPC_GET_METHOD(call));
169 retval = ENOENT;
170 break;
171 }
172 if (! (callid & IPC_CALLID_NOTIFICATION)) {
173// printf("Answering.\n");
174 ipc_answer_fast(callid, retval, arg1, arg2);
175 }
176 }
177}
178
179/** Register service.
180 *
181 * @param service Service to be registered.
182 * @param phone phone Phone to be used for connections to the service.
183 * @param call Pointer to call structure.
184 *
185 * @return Zero on success or a value from @ref errno.h.
186 */
187int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call)
188{
189 unsigned long keys[3] = { service, call->in_phone_hash, 0 };
190 hashed_service_t *hs;
191
192// printf("Registering service %d on phone %d...", service, phone);
193
194 if (hash_table_find(&ns_hash_table, keys)) {
195// printf("Service %d already registered.\n", service);
196 return EEXISTS;
197 }
198
199 hs = (hashed_service_t *) malloc(sizeof(hashed_service_t));
200 if (!hs) {
201// printf("Failed to register service %d.\n", service);
202 return ENOMEM;
203 }
204
205 link_initialize(&hs->link);
206 hs->service = service;
207 hs->phone = phone;
208 hs->in_phone_hash = call->in_phone_hash;
209 hash_table_insert(&ns_hash_table, keys, &hs->link);
210
211 return 0;
212}
213
214/** Connect client to service.
215 *
216 * @param service Service to be connected to.
217 * @param call Pointer to call structure.
218 * @param callid Call ID of the request.
219 *
220 * @return Zero on success or a value from @ref errno.h.
221 */
222int connect_to_service(ipcarg_t service, ipc_call_t *call, ipc_callid_t callid)
223{
224 unsigned long keys[3] = { service, 0, 0 };
225 link_t *hlp;
226 hashed_service_t *hs;
227
228 hlp = hash_table_find(&ns_hash_table, keys);
229 if (!hlp) {
230// printf("Service %d not registered.\n", service);
231 return ENOENT;
232 }
233 hs = hash_table_get_instance(hlp, hashed_service_t, link);
234// printf("Connecting in_phone_hash=%lX to service at phone %d...", call->in_phone_hash, hs->phone);
235 return ipc_forward_fast(callid, hs->phone, 0, 0);
236}
237
238/** Compute hash index into NS hash table.
239 *
240 * @param key Pointer keys. However, only the first key (i.e. service number)
241 * is used to compute the hash index.
242 * @return Hash index corresponding to key[0].
243 */
244hash_index_t ns_hash(unsigned long *key)
245{
246 assert(key);
247 return *key % NS_HASH_TABLE_CHAINS;
248}
249
250/** Compare a key with hashed item.
251 *
252 * This compare function always ignores the third key.
253 * It exists only to make it possible to remove records
254 * originating from connection with key[1] in_phone_hash
255 * value. Note that this is close to being classified
256 * as a nasty hack.
257 *
258 * @param key Array of keys.
259 * @param keys Must be lesser or equal to 3.
260 * @param item Pointer to a hash table item.
261 * @return Non-zero if the key matches the item, zero otherwise.
262 */
263int ns_compare(unsigned long key[], hash_count_t keys, link_t *item)
264{
265 hashed_service_t *hs;
266
267 assert(key);
268 assert(keys <= 3);
269 assert(item);
270
271 hs = hash_table_get_instance(item, hashed_service_t, link);
272
273 if (keys == 2)
274 return key[1] == hs->in_phone_hash;
275 else
276 return key[0] == hs->service;
277}
278
279/** Perform actions after removal of item from the hash table.
280 *
281 * @param item Item that was removed from the hash table.
282 */
283void ns_remove(link_t *item)
284{
285 assert(item);
286 free(hash_table_get_instance(item, hashed_service_t, link));
287}
Note: See TracBrowser for help on using the repository browser.