Subversion Repositories HelenOS-historic

Rev

Rev 1435 | Rev 1501 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

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