Subversion Repositories HelenOS

Rev

Rev 3150 | Rev 4345 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 3150 Rev 4343
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
/** @addtogroup ns
29
/** @addtogroup ns
30
 * @{
30
 * @{
31
 */
31
 */
32
 
32
 
33
/**
33
/**
34
 * @file    ns.c
34
 * @file    ns.c
35
 * @brief   Naming service for HelenOS IPC.
35
 * @brief   Naming service for HelenOS IPC.
36
 */
36
 */
37
 
37
 
38
 
38
 
39
#include <ipc/ipc.h>
39
#include <ipc/ipc.h>
40
#include <ipc/ns.h>
40
#include <ipc/ns.h>
41
#include <ipc/services.h>
41
#include <ipc/services.h>
42
#include <stdio.h>
42
#include <stdio.h>
-
 
43
#include <bool.h>
43
#include <unistd.h>
44
#include <unistd.h>
44
#include <stdlib.h>
45
#include <stdlib.h>
45
#include <errno.h>
46
#include <errno.h>
46
#include <assert.h>
47
#include <assert.h>
47
#include <libadt/list.h>
48
#include <libadt/list.h>
48
#include <libadt/hash_table.h>
49
#include <libadt/hash_table.h>
49
#include <sysinfo.h>
50
#include <sysinfo.h>
-
 
51
#include <loader/loader.h>
50
#include <ddi.h>
52
#include <ddi.h>
51
#include <as.h>
53
#include <as.h>
52
 
54
 
53
#define NAME    "ns"
55
#define NAME    "ns"
54
 
56
 
55
#define NS_HASH_TABLE_CHAINS    20
57
#define NS_HASH_TABLE_CHAINS    20
56
 
58
 
57
static int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call);
59
static int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call);
58
static int connect_to_service(ipcarg_t service, ipc_call_t *call,
60
static int connect_to_service(ipcarg_t service, ipc_call_t *call,
59
    ipc_callid_t callid);
61
    ipc_callid_t callid);
60
 
62
 
-
 
63
void register_clonable(ipcarg_t service, ipcarg_t phone, ipc_call_t *call,
-
 
64
    ipc_callid_t callid);
-
 
65
void connect_to_clonable(ipcarg_t service, ipc_call_t *call,
-
 
66
    ipc_callid_t callid);
-
 
67
 
61
/* Static functions implementing NS hash table operations. */
68
/* Static functions implementing NS hash table operations. */
62
static hash_index_t ns_hash(unsigned long *key);
69
static hash_index_t ns_hash(unsigned long *key);
63
static int ns_compare(unsigned long *key, hash_count_t keys, link_t *item);
70
static int ns_compare(unsigned long *key, hash_count_t keys, link_t *item);
64
static void ns_remove(link_t *item);
71
static void ns_remove(link_t *item);
65
 
72
 
66
/** Operations for NS hash table. */
73
/** Operations for NS hash table. */
67
static hash_table_operations_t ns_hash_table_ops = {
74
static hash_table_operations_t ns_hash_table_ops = {
68
    .hash = ns_hash,
75
    .hash = ns_hash,
69
    .compare = ns_compare,
76
    .compare = ns_compare,
70
    .remove_callback = ns_remove
77
    .remove_callback = ns_remove
71
};
78
};
72
 
79
 
73
/** NS hash table structure. */
80
/** NS hash table structure. */
74
static hash_table_t ns_hash_table;
81
static hash_table_t ns_hash_table;
75
 
82
 
76
/** NS hash table item. */
83
/** NS hash table item. */
77
typedef struct {
84
typedef struct {
78
    link_t link;
85
    link_t link;
79
    ipcarg_t service;       /**< Number of the service. */
86
    ipcarg_t service;       /**< Number of the service. */
80
    ipcarg_t phone;         /**< Phone registered with the service. */
87
    ipcarg_t phone;         /**< Phone registered with the service. */
81
    ipcarg_t in_phone_hash;     /**< Incoming phone hash. */
88
    ipcarg_t in_phone_hash;     /**< Incoming phone hash. */
82
} hashed_service_t;
89
} hashed_service_t;
83
 
90
 
84
static void *clockaddr = NULL;
91
static void *clockaddr = NULL;
85
static void *klogaddr = NULL;
92
static void *klogaddr = NULL;
86
 
93
 
87
static void get_as_area(ipc_callid_t callid, ipc_call_t *call, char *name,
94
/** Request for connection to a clonable service. */
-
 
95
typedef struct {
-
 
96
    link_t link;
-
 
97
    ipcarg_t service;
-
 
98
    ipc_call_t call;
88
    void **addr)
99
    ipc_callid_t callid;
-
 
100
} cs_req_t;
-
 
101
 
-
 
102
/** List of clonable-service connection requests. */
-
 
103
static link_t cs_req;
-
 
104
 
-
 
105
/** Return true if @a service is clonable. */
-
 
106
static bool service_clonable(int service)
89
{
107
{
90
    void *ph_addr;
108
    return service == SERVICE_LOAD;
-
 
109
}
91
 
110
 
-
 
111
static void get_as_area(ipc_callid_t callid, ipc_call_t *call, char *name, void **addr)
-
 
112
{
-
 
113
    void *ph_addr;
-
 
114
   
92
    if (!*addr) {
115
    if (!*addr) {
93
        ph_addr = (void *) sysinfo_value(name);
116
        ph_addr = (void *) sysinfo_value(name);
94
        if (!ph_addr) {
117
        if (!ph_addr) {
95
            ipc_answer_0(callid, ENOENT);
118
            ipc_answer_0(callid, ENOENT);
96
            return;
119
            return;
97
        }
120
        }
98
        *addr = as_get_mappable_page(PAGE_SIZE);
121
        *addr = as_get_mappable_page(PAGE_SIZE);
99
        physmem_map(ph_addr, *addr, 1,
122
        if (physmem_map(ph_addr, *addr, 1,
100
            AS_AREA_READ | AS_AREA_CACHEABLE);
123
            AS_AREA_READ | AS_AREA_CACHEABLE) != 0) {
-
 
124
            ipc_answer_0(callid, ENOENT);
-
 
125
            return;
-
 
126
        }
101
    }
127
    }
102
    ipc_answer_2(callid, EOK, (ipcarg_t) *addr, AS_AREA_READ);
128
    ipc_answer_2(callid, EOK, (ipcarg_t) *addr, AS_AREA_READ);
103
}
129
}
104
 
130
 
105
int main(int argc, char **argv)
131
int main(int argc, char **argv)
106
{
132
{
107
    printf(NAME ": HelenOS IPC Naming Service\n");
133
    printf(NAME ": HelenOS IPC Naming Service\n");
108
   
134
   
109
    ipc_call_t call;
135
    ipc_call_t call;
110
    ipc_callid_t callid;
136
    ipc_callid_t callid;
111
   
137
   
112
    ipcarg_t retval;
138
    ipcarg_t retval;
113
 
139
 
114
    if (!hash_table_create(&ns_hash_table, NS_HASH_TABLE_CHAINS, 3,
140
    if (!hash_table_create(&ns_hash_table, NS_HASH_TABLE_CHAINS, 3,
115
        &ns_hash_table_ops)) {
141
        &ns_hash_table_ops)) {
116
        printf(NAME ": No memory available\n");
142
        printf(NAME ": No memory available\n");
117
        return ENOMEM;
143
        return ENOMEM;
118
    }
144
    }
-
 
145
 
-
 
146
    list_initialize(&cs_req);
119
   
147
   
120
    printf(NAME ": Accepting connections\n");
148
    printf(NAME ": Accepting connections\n");
121
    while (1) {
149
    while (1) {
122
        callid = ipc_wait_for_call(&call);
150
        callid = ipc_wait_for_call(&call);
123
        switch (IPC_GET_METHOD(call)) {
151
        switch (IPC_GET_METHOD(call)) {
124
        case IPC_M_SHARE_IN:
152
        case IPC_M_SHARE_IN:
125
            switch (IPC_GET_ARG3(call)) {
153
            switch (IPC_GET_ARG3(call)) {
126
            case SERVICE_MEM_REALTIME:
154
            case SERVICE_MEM_REALTIME:
127
                get_as_area(callid, &call, "clock.faddr",
155
                get_as_area(callid, &call, "clock.faddr", &clockaddr);
128
                    &clockaddr);
-
 
129
                break;
156
                break;
130
            case SERVICE_MEM_KLOG:
157
            case SERVICE_MEM_KLOG:
131
                get_as_area(callid, &call, "klog.faddr",
158
                get_as_area(callid, &call, "klog.faddr", &klogaddr);
132
                    &klogaddr);
-
 
133
                break;
159
                break;
134
            default:
160
            default:
135
                ipc_answer_0(callid, ENOENT);
161
                ipc_answer_0(callid, ENOENT);
136
            }
162
            }
137
            continue;
163
            continue;
138
        case IPC_M_PHONE_HUNGUP:
164
        case IPC_M_PHONE_HUNGUP:
139
            retval = EOK;
165
            retval = EOK;
140
            break;
166
            break;
141
        case IPC_M_CONNECT_TO_ME:
167
        case IPC_M_CONNECT_TO_ME:
142
            /*
168
            /*
143
             * Server requests service registration.
169
             * Server requests service registration.
144
             */
170
             */
-
 
171
            if (service_clonable(IPC_GET_ARG1(call))) {
-
 
172
                register_clonable(IPC_GET_ARG1(call),
-
 
173
                    IPC_GET_ARG5(call), &call, callid);
-
 
174
                continue;
-
 
175
            } else {
145
            retval = register_service(IPC_GET_ARG1(call),
176
                retval = register_service(IPC_GET_ARG1(call),
146
                IPC_GET_ARG5(call), &call);
177
                    IPC_GET_ARG5(call), &call);
-
 
178
            }
147
            break;
179
            break;
148
        case IPC_M_CONNECT_ME_TO:
180
        case IPC_M_CONNECT_ME_TO:
149
            /*
181
            /*
150
             * Client requests to be connected to a service.
182
             * Client requests to be connected to a service.
151
             */
183
             */
-
 
184
            if (service_clonable(IPC_GET_ARG1(call))) {
-
 
185
                connect_to_clonable(IPC_GET_ARG1(call),
-
 
186
                    &call, callid);
-
 
187
                continue;
-
 
188
            } else {
152
            retval = connect_to_service(IPC_GET_ARG1(call), &call,
189
                retval = connect_to_service(IPC_GET_ARG1(call),
153
                callid);
190
                    &call, callid);
-
 
191
            }
154
            break;
192
            break;
155
        default:
193
        default:
156
            retval = ENOENT;
194
            retval = ENOENT;
157
            break;
195
            break;
158
        }
196
        }
159
        if (!(callid & IPC_CALLID_NOTIFICATION)) {
197
        if (!(callid & IPC_CALLID_NOTIFICATION)) {
160
            ipc_answer_0(callid, retval);
198
            ipc_answer_0(callid, retval);
161
        }
199
        }
162
    }
200
    }
163
   
201
   
164
    /* Not reached */
202
    /* Not reached */
165
    return 0;
203
    return 0;
166
}
204
}
167
 
205
 
168
/** Register service.
206
/** Register service.
169
 *
207
 *
170
 * @param service Service to be registered.
208
 * @param service   Service to be registered.
171
 * @param phone Phone to be used for connections to the service.
209
 * @param phone     Phone to be used for connections to the service.
172
 * @param call Pointer to call structure.
210
 * @param call      Pointer to call structure.
173
 *
211
 *
174
 * @return Zero on success or a value from @ref errno.h.
212
 * @return      Zero on success or a value from @ref errno.h.
175
 */
213
 */
176
int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call)
214
int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call)
177
{
215
{
178
    unsigned long keys[3] = {
216
    unsigned long keys[3] = {
179
        service,
217
        service,
180
        call->in_phone_hash,
218
        call->in_phone_hash,
181
        0
219
        0
182
    };
220
    };
183
    hashed_service_t *hs;
221
    hashed_service_t *hs;
184
           
222
 
185
    if (hash_table_find(&ns_hash_table, keys)) {
223
    if (hash_table_find(&ns_hash_table, keys)) {
186
        return EEXISTS;
224
        return EEXISTS;
187
    }
225
    }
188
           
226
           
189
    hs = (hashed_service_t *) malloc(sizeof(hashed_service_t));
227
    hs = (hashed_service_t *) malloc(sizeof(hashed_service_t));
190
    if (!hs) {
228
    if (!hs) {
191
        return ENOMEM;
229
        return ENOMEM;
192
    }
230
    }
193
           
231
           
194
    link_initialize(&hs->link);
232
    link_initialize(&hs->link);
195
    hs->service = service;
233
    hs->service = service;
196
    hs->phone = phone;
234
    hs->phone = phone;
197
    hs->in_phone_hash = call->in_phone_hash;
235
    hs->in_phone_hash = call->in_phone_hash;
198
    hash_table_insert(&ns_hash_table, keys, &hs->link);
236
    hash_table_insert(&ns_hash_table, keys, &hs->link);
199
           
237
           
200
    return 0;
238
    return 0;
201
}
239
}
202
 
240
 
203
/** Connect client to service.
241
/** Connect client to service.
204
 *
242
 *
205
 * @param service Service to be connected to.
243
 * @param service   Service to be connected to.
206
 * @param call Pointer to call structure.
244
 * @param call      Pointer to call structure.
207
 * @param callid Call ID of the request.
245
 * @param callid    Call ID of the request.
208
 *
246
 *
209
 * @return Zero on success or a value from @ref errno.h.
247
 * @return Zero on success or a value from @ref errno.h.
210
 */
248
 */
211
int connect_to_service(ipcarg_t service, ipc_call_t *call, ipc_callid_t callid)
249
int connect_to_service(ipcarg_t service, ipc_call_t *call, ipc_callid_t callid)
212
{
250
{
213
    unsigned long keys[3] = { service, 0, 0 };
251
    unsigned long keys[3] = { service, 0, 0 };
214
    link_t *hlp;
252
    link_t *hlp;
215
    hashed_service_t *hs;
253
    hashed_service_t *hs;
216
           
254
 
217
    hlp = hash_table_find(&ns_hash_table, keys);
255
    hlp = hash_table_find(&ns_hash_table, keys);
218
    if (!hlp) {
256
    if (!hlp) {
219
        return ENOENT;
257
        return ENOENT;
220
    }
258
    }
221
    hs = hash_table_get_instance(hlp, hashed_service_t, link);
259
    hs = hash_table_get_instance(hlp, hashed_service_t, link);
222
    return ipc_forward_fast(callid, hs->phone, IPC_GET_ARG2(*call),
260
    return ipc_forward_fast(callid, hs->phone, IPC_GET_ARG2(*call),
223
        IPC_GET_ARG3(*call), 0, IPC_FF_NONE);
261
        IPC_GET_ARG3(*call), 0, IPC_FF_NONE);
224
}
262
}
-
 
263
 
-
 
264
/** Register clonable service.
-
 
265
 *
-
 
266
 * @param service   Service to be registered.
-
 
267
 * @param phone     Phone to be used for connections to the service.
-
 
268
 * @param call      Pointer to call structure.
-
 
269
 */
-
 
270
void register_clonable(ipcarg_t service, ipcarg_t phone, ipc_call_t *call,
-
 
271
    ipc_callid_t callid)
-
 
272
{
-
 
273
    int rc;
-
 
274
    cs_req_t *csr;
-
 
275
 
-
 
276
    if (list_empty(&cs_req)) {
-
 
277
        /* There was no pending connection request. */
-
 
278
        printf(NAME ": Unexpected clonable server.\n");
-
 
279
        ipc_answer_0(callid, EBUSY);
-
 
280
        return;
-
 
281
    }
-
 
282
 
-
 
283
    csr = list_get_instance(cs_req.next, cs_req_t, link);
-
 
284
    list_remove(&csr->link);
-
 
285
 
-
 
286
    /* Currently we can only handle a single type of clonable service. */
-
 
287
    assert(csr->service == SERVICE_LOAD);
-
 
288
 
-
 
289
    ipc_answer_0(callid, EOK);
-
 
290
 
-
 
291
    rc = ipc_forward_fast(csr->callid, phone, IPC_GET_ARG2(csr->call),
-
 
292
        IPC_GET_ARG3(csr->call), 0, IPC_FF_NONE);
-
 
293
 
-
 
294
    free(csr);
-
 
295
}
-
 
296
 
-
 
297
/** Connect client to clonable service.
-
 
298
 *
-
 
299
 * @param service   Service to be connected to.
-
 
300
 * @param call      Pointer to call structure.
-
 
301
 * @param callid    Call ID of the request.
-
 
302
 *
-
 
303
 * @return      Zero on success or a value from @ref errno.h.
-
 
304
 */
-
 
305
void connect_to_clonable(ipcarg_t service, ipc_call_t *call,
-
 
306
    ipc_callid_t callid)
-
 
307
{
-
 
308
    int rc;
-
 
309
    cs_req_t *csr;
-
 
310
 
-
 
311
    assert(service == SERVICE_LOAD);
-
 
312
 
-
 
313
    csr = malloc(sizeof(cs_req_t));
-
 
314
    if (csr == NULL) {
-
 
315
        ipc_answer_0(callid, ENOMEM);
-
 
316
        return;
-
 
317
    }
-
 
318
 
-
 
319
    /* Spawn a loader. */
-
 
320
    rc = loader_spawn("loader");
-
 
321
 
-
 
322
    if (rc < 0) {
-
 
323
        free(csr);
-
 
324
        ipc_answer_0(callid, rc);
-
 
325
        return;
-
 
326
    }
-
 
327
 
-
 
328
    csr->service = service;
-
 
329
    csr->call = *call;
-
 
330
    csr->callid = callid;
-
 
331
 
-
 
332
    /*
-
 
333
     * We can forward the call only after the server we spawned connects
-
 
334
     * to us. Meanwhile we might need to service more connection requests.
-
 
335
     * Thus we store the call in a queue.
-
 
336
     */
-
 
337
    list_append(&csr->link, &cs_req);
-
 
338
}
225
 
339
 
226
/** Compute hash index into NS hash table.
340
/** Compute hash index into NS hash table.
227
 *
341
 *
228
 * @param key Pointer keys. However, only the first key (i.e. service number)
342
 * @param key Pointer keys. However, only the first key (i.e. service number)
229
 *        is used to compute the hash index.
343
 *        is used to compute the hash index.
230
 * @return Hash index corresponding to key[0].
344
 * @return Hash index corresponding to key[0].
231
 */
345
 */
232
hash_index_t ns_hash(unsigned long *key)
346
hash_index_t ns_hash(unsigned long *key)
233
{
347
{
234
    assert(key);
348
    assert(key);
235
    return *key % NS_HASH_TABLE_CHAINS;
349
    return *key % NS_HASH_TABLE_CHAINS;
236
}
350
}
237
 
351
 
238
/** Compare a key with hashed item.
352
/** Compare a key with hashed item.
239
 *
353
 *
240
 * This compare function always ignores the third key.
354
 * This compare function always ignores the third key.
241
 * It exists only to make it possible to remove records
355
 * It exists only to make it possible to remove records
242
 * originating from connection with key[1] in_phone_hash
356
 * originating from connection with key[1] in_phone_hash
243
 * value. Note that this is close to being classified
357
 * value. Note that this is close to being classified
244
 * as a nasty hack.
358
 * as a nasty hack.
245
 *
359
 *
246
 * @param key Array of keys.
360
 * @param key Array of keys.
247
 * @param keys Must be lesser or equal to 3.
361
 * @param keys Must be lesser or equal to 3.
248
 * @param item Pointer to a hash table item.
362
 * @param item Pointer to a hash table item.
249
 * @return Non-zero if the key matches the item, zero otherwise.
363
 * @return Non-zero if the key matches the item, zero otherwise.
250
 */
364
 */
251
int ns_compare(unsigned long key[], hash_count_t keys, link_t *item)
365
int ns_compare(unsigned long key[], hash_count_t keys, link_t *item)
252
{
366
{
253
    hashed_service_t *hs;
367
    hashed_service_t *hs;
254
 
368
 
255
    assert(key);
369
    assert(key);
256
    assert(keys <= 3);
370
    assert(keys <= 3);
257
    assert(item);
371
    assert(item);
258
   
372
   
259
    hs = hash_table_get_instance(item, hashed_service_t, link);
373
    hs = hash_table_get_instance(item, hashed_service_t, link);
260
   
374
   
261
    if (keys == 2)
375
    if (keys == 2)
262
        return key[1] == hs->in_phone_hash;
376
        return key[1] == hs->in_phone_hash;
263
    else
377
    else
264
        return key[0] == hs->service;
378
        return key[0] == hs->service;
265
}
379
}
266
 
380
 
267
/** Perform actions after removal of item from the hash table.
381
/** Perform actions after removal of item from the hash table.
268
 *
382
 *
269
 * @param item Item that was removed from the hash table.
383
 * @param item Item that was removed from the hash table.
270
 */
384
 */
271
void ns_remove(link_t *item)
385
void ns_remove(link_t *item)
272
{
386
{
273
    assert(item);
387
    assert(item);
274
    free(hash_table_get_instance(item, hashed_service_t, link));
388
    free(hash_table_get_instance(item, hashed_service_t, link));
275
}
389
}
276
 
390
 
277
/**
391
/**
278
 * @}
392
 * @}
279
 */
393
 */
280
 
394