WebSVN – HelenOS-historic – Diff – /uspace/trunk/ns/ns.c


/*
 * Copyright (C) 2006 Ondrej Palkovsky
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
/**
 * @file    ns.c
 * @brief   Naming service for HelenOS IPC.
 */
 
#include <ipc/ipc.h>
#include <ipc/ns.h>
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <errno.h>
#include <assert.h>
#include <libadt/list.h>
#include <libadt/hash_table.h>
#include <sysinfo.h>
#include <ddi.h>
#include <as.h>
 
#define NAME    "NS"
 
#define NS_HASH_TABLE_CHAINS    20
 
static int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call);
static int connect_to_service(ipcarg_t service, ipc_call_t *call, ipc_callid_t callid);
 
/* Static functions implementing NS hash table operations. */
static hash_index_t ns_hash(unsigned long *key);
static int ns_compare(unsigned long *key, hash_count_t keys, link_t *item);
static void ns_remove(link_t *item);
 
/** Operations for NS hash table. */
static hash_table_operations_t ns_hash_table_ops = {
    .hash = ns_hash,
    .compare = ns_compare,
    .remove_callback = ns_remove
};
 
/** NS hash table structure. */
static hash_table_t ns_hash_table;
 
/** NS hash table item. */
typedef struct {
    link_t link;
    ipcarg_t service;       /**< Number of the service. */
    ipcarg_t phone;         /**< Phone registered with the service. */
    ipcarg_t in_phone_hash;     /**< Incoming phone hash. */
} hashed_service_t;
 
int static ping_phone;
 
static void get_realtime_as(ipc_callid_t callid, ipc_call_t *call)
{
    static void *addr = NULL;
    void *ph_addr;
 
    if (!addr) {
        ph_addr = (void *)sysinfo_value("clock.faddr");
        if (!ph_addr) {
            ipc_answer_fast(callid, ENOENT, 0, 0);
            return;
        }
        addr = as_get_mappable_page(PAGE_SIZE);
        map_physmem(ph_addr, addr, 1, AS_AREA_READ | AS_AREA_CACHEABLE);
    }
    ipc_answer_fast(callid, 0, (ipcarg_t)addr, AS_AREA_READ);
}
 
int main(int argc, char **argv)
{
    ipc_call_t call;
    ipc_callid_t callid;
    char *as_area;
   
    ipcarg_t retval, arg1, arg2;
 
    if (!hash_table_create(&ns_hash_table, NS_HASH_TABLE_CHAINS, 3, &ns_hash_table_ops)) {
        return ENOMEM;
    }
       
    while (1) {
        callid = ipc_wait_for_call(&call);
        switch (IPC_GET_METHOD(call)) {
        case IPC_M_AS_AREA_RECV:
            get_realtime_as(callid, &call);
            continue;
        case IPC_M_PHONE_HUNGUP:
            retval = 0;
            break;
        case IPC_M_CONNECT_TO_ME:
            /*
             * Server requests service registration.
             */
            retval = register_service(IPC_GET_ARG1(call), IPC_GET_ARG3(call), &call);
            break;
        case IPC_M_CONNECT_ME_TO:
            /*
             * Client requests to be connected to a service.
             */
            retval = connect_to_service(IPC_GET_ARG1(call), &call, callid);
            break;
        default:
            retval = ENOENT;
            break;
        }
        if (! (callid & IPC_CALLID_NOTIFICATION)) {
            ipc_answer_fast(callid, retval, arg1, arg2);
        }
    }
}
 
/** Register service.
 *
 * @param service Service to be registered.
 * @param phone phone Phone to be used for connections to the service.
 * @param call Pointer to call structure.
 *
 * @return Zero on success or a value from @ref errno.h.
 */
int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call)
{
    unsigned long keys[3] = { service, call->in_phone_hash, 0 };
    hashed_service_t *hs;
           
    if (hash_table_find(&ns_hash_table, keys)) {
        return EEXISTS;
    }
           
    hs = (hashed_service_t *) malloc(sizeof(hashed_service_t));
    if (!hs) {
        return ENOMEM;
    }
           
    link_initialize(&hs->link);
    hs->service = service;
    hs->phone = phone;
    hs->in_phone_hash = call->in_phone_hash;
    hash_table_insert(&ns_hash_table, keys, &hs->link);
           
    return 0;
}
 
/** Connect client to service.
 *
 * @param service Service to be connected to.
 * @param call Pointer to call structure.
 * @param callid Call ID of the request.
 *
 * @return Zero on success or a value from @ref errno.h.
 */
int connect_to_service(ipcarg_t service, ipc_call_t *call, ipc_callid_t callid)
{
    unsigned long keys[3] = { service, 0, 0 };
    link_t *hlp;
    hashed_service_t *hs;
           
    hlp = hash_table_find(&ns_hash_table, keys);
    if (!hlp) {
        return ENOENT;
    }
    hs = hash_table_get_instance(hlp, hashed_service_t, link);
    return ipc_forward_fast(callid, hs->phone, 0, 0);
}
 
/** Compute hash index into NS hash table.
 *
 * @param key Pointer keys. However, only the first key (i.e. service number)
 *        is used to compute the hash index.
 * @return Hash index corresponding to key[0].
 */
hash_index_t ns_hash(unsigned long *key)
{
    assert(key);
    return *key % NS_HASH_TABLE_CHAINS;
}
 
/** Compare a key with hashed item.
 *
 * This compare function always ignores the third key.
 * It exists only to make it possible to remove records
 * originating from connection with key[1] in_phone_hash
 * value. Note that this is close to being classified
 * as a nasty hack.
 *
 * @param key Array of keys.
 * @param keys Must be lesser or equal to 3.
 * @param item Pointer to a hash table item.
 * @return Non-zero if the key matches the item, zero otherwise.
 */
int ns_compare(unsigned long key[], hash_count_t keys, link_t *item)
{
    hashed_service_t *hs;
 
    assert(key);
    assert(keys <= 3);
    assert(item);
   
    hs = hash_table_get_instance(item, hashed_service_t, link);
   
    if (keys == 2)
        return key[1] == hs->in_phone_hash;
    else
        return key[0] == hs->service;
}
 
/** Perform actions after removal of item from the hash table.
 *
 * @param item Item that was removed from the hash table.
 */
void ns_remove(link_t *item)
{
    assert(item);
    free(hash_table_get_instance(item, hashed_service_t, link));
}
 

Rev 1531	Rev 1547
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>	43	#include <sysinfo.h>
44	#include <ddi.h>	44	#include <ddi.h>
45	#include <as.h>	45	#include <as.h>
46		46
47	#define NAME "NS"	47	#define NAME "NS"
48		48
49	#define NS_HASH_TABLE_CHAINS 20	49	#define NS_HASH_TABLE_CHAINS 20
50		50
51	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);
52	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);
53		53
54	/* Static functions implementing NS hash table operations. */	54	/* Static functions implementing NS hash table operations. */
55	static hash_index_t ns_hash(unsigned long *key);	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);	56	static int ns_compare(unsigned long key, hash_count_t keys, link_t item);
57	static void ns_remove(link_t *item);	57	static void ns_remove(link_t *item);
58		58
59	/** Operations for NS hash table. */	59	/** Operations for NS hash table. */
60	static hash_table_operations_t ns_hash_table_ops = {	60	static hash_table_operations_t ns_hash_table_ops = {
61	.hash = ns_hash,	61	.hash = ns_hash,
62	.compare = ns_compare,	62	.compare = ns_compare,
63	.remove_callback = ns_remove	63	.remove_callback = ns_remove
64	};	64	};
65		65
66	/** NS hash table structure. */	66	/** NS hash table structure. */
67	static hash_table_t ns_hash_table;	67	static hash_table_t ns_hash_table;
68		68
69	/** NS hash table item. */	69	/** NS hash table item. */
70	typedef struct {	70	typedef struct {
71	link_t link;	71	link_t link;
72	ipcarg_t service; /*< Number of the service. /	72	ipcarg_t service; /*< Number of the service. /
73	ipcarg_t phone; /*< Phone registered with the service. /	73	ipcarg_t phone; /*< Phone registered with the service. /
74	ipcarg_t in_phone_hash; /*< Incoming phone hash. /	74	ipcarg_t in_phone_hash; /*< Incoming phone hash. /
75	} hashed_service_t;	75	} hashed_service_t;
76		76
77	int static ping_phone;	77	int static ping_phone;
78		78
79	static void get_realtime_as(ipc_callid_t callid, ipc_call_t *call)	79	static void get_realtime_as(ipc_callid_t callid, ipc_call_t *call)
80	{	80	{
81	static void *addr = NULL;	81	static void *addr = NULL;
82	void *ph_addr;	82	void *ph_addr;
83		83
84	if (!addr) {	84	if (!addr) {
85	ph_addr = (void *)sysinfo_value("clock.faddr");	85	ph_addr = (void *)sysinfo_value("clock.faddr");
86	if (!ph_addr) {	86	if (!ph_addr) {
87	ipc_answer_fast(callid, ENOENT, 0, 0);	87	ipc_answer_fast(callid, ENOENT, 0, 0);
88	return;	88	return;
89	}	89	}
90	addr = as_get_mappable_page(PAGE_SIZE);	90	addr = as_get_mappable_page(PAGE_SIZE);
91	map_physmem(ph_addr, addr, 1, AS_AREA_READ \| AS_AREA_CACHEABLE);	91	map_physmem(ph_addr, addr, 1, AS_AREA_READ \| AS_AREA_CACHEABLE);
92	}	92	}
93	ipc_answer_fast(callid, 0, (ipcarg_t)addr, AS_AREA_READ \| AS_AREA_CACHEABLE);	93	ipc_answer_fast(callid, 0, (ipcarg_t)addr, AS_AREA_READ);
94	}	94	}
95		95
96	int main(int argc, char **argv)	96	int main(int argc, char **argv)
97	{	97	{
98	ipc_call_t call;	98	ipc_call_t call;
99	ipc_callid_t callid;	99	ipc_callid_t callid;
100	char *as_area;	100	char *as_area;
101		101
102	ipcarg_t retval, arg1, arg2;	102	ipcarg_t retval, arg1, arg2;
103		103
104	if (!hash_table_create(&ns_hash_table, NS_HASH_TABLE_CHAINS, 3, &ns_hash_table_ops)) {	104	if (!hash_table_create(&ns_hash_table, NS_HASH_TABLE_CHAINS, 3, &ns_hash_table_ops)) {
105	return ENOMEM;	105	return ENOMEM;
106	}	106	}
107		107
108	while (1) {	108	while (1) {
109	callid = ipc_wait_for_call(&call);	109	callid = ipc_wait_for_call(&call);
110	switch (IPC_GET_METHOD(call)) {	110	switch (IPC_GET_METHOD(call)) {
111	case IPC_M_AS_AREA_RECV:	111	case IPC_M_AS_AREA_RECV:
112	get_realtime_as(callid, &call);	112	get_realtime_as(callid, &call);
113	continue;	113	continue;
114	case IPC_M_PHONE_HUNGUP:	114	case IPC_M_PHONE_HUNGUP:
115	retval = 0;	115	retval = 0;
116	break;	116	break;
117	case IPC_M_CONNECT_TO_ME:	117	case IPC_M_CONNECT_TO_ME:
118	/*	118	/*
119	* Server requests service registration.	119	* Server requests service registration.
120	*/	120	*/
121	retval = register_service(IPC_GET_ARG1(call), IPC_GET_ARG3(call), &call);	121	retval = register_service(IPC_GET_ARG1(call), IPC_GET_ARG3(call), &call);
122	break;	122	break;
123	case IPC_M_CONNECT_ME_TO:	123	case IPC_M_CONNECT_ME_TO:
124	/*	124	/*
125	* Client requests to be connected to a service.	125	* Client requests to be connected to a service.
126	*/	126	*/
127	retval = connect_to_service(IPC_GET_ARG1(call), &call, callid);	127	retval = connect_to_service(IPC_GET_ARG1(call), &call, callid);
128	break;	128	break;
129	default:	129	default:
130	retval = ENOENT;	130	retval = ENOENT;
131	break;	131	break;
132	}	132	}
133	if (! (callid & IPC_CALLID_NOTIFICATION)) {	133	if (! (callid & IPC_CALLID_NOTIFICATION)) {
134	ipc_answer_fast(callid, retval, arg1, arg2);	134	ipc_answer_fast(callid, retval, arg1, arg2);
135	}	135	}
136	}	136	}
137	}	137	}
138		138
139	/** Register service.	139	/** Register service.
140	*	140	*
141	* @param service Service to be registered.	141	* @param service Service to be registered.
142	* @param phone phone Phone to be used for connections to the service.	142	* @param phone phone Phone to be used for connections to the service.
143	* @param call Pointer to call structure.	143	* @param call Pointer to call structure.
144	*	144	*
145	* @return Zero on success or a value from @ref errno.h.	145	* @return Zero on success or a value from @ref errno.h.
146	*/	146	*/
147	int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call)	147	int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call)
148	{	148	{
149	unsigned long keys[3] = { service, call->in_phone_hash, 0 };	149	unsigned long keys[3] = { service, call->in_phone_hash, 0 };
150	hashed_service_t *hs;	150	hashed_service_t *hs;
151		151
152	if (hash_table_find(&ns_hash_table, keys)) {	152	if (hash_table_find(&ns_hash_table, keys)) {
153	return EEXISTS;	153	return EEXISTS;
154	}	154	}
155		155
156	hs = (hashed_service_t *) malloc(sizeof(hashed_service_t));	156	hs = (hashed_service_t *) malloc(sizeof(hashed_service_t));
157	if (!hs) {	157	if (!hs) {
158	return ENOMEM;	158	return ENOMEM;
159	}	159	}
160		160
161	link_initialize(&hs->link);	161	link_initialize(&hs->link);
162	hs->service = service;	162	hs->service = service;
163	hs->phone = phone;	163	hs->phone = phone;
164	hs->in_phone_hash = call->in_phone_hash;	164	hs->in_phone_hash = call->in_phone_hash;
165	hash_table_insert(&ns_hash_table, keys, &hs->link);	165	hash_table_insert(&ns_hash_table, keys, &hs->link);
166		166
167	return 0;	167	return 0;
168	}	168	}
169		169
170	/** Connect client to service.	170	/** Connect client to service.
171	*	171	*
172	* @param service Service to be connected to.	172	* @param service Service to be connected to.
173	* @param call Pointer to call structure.	173	* @param call Pointer to call structure.
174	* @param callid Call ID of the request.	174	* @param callid Call ID of the request.
175	*	175	*
176	* @return Zero on success or a value from @ref errno.h.	176	* @return Zero on success or a value from @ref errno.h.
177	*/	177	*/
178	int connect_to_service(ipcarg_t service, ipc_call_t *call, ipc_callid_t callid)	178	int connect_to_service(ipcarg_t service, ipc_call_t *call, ipc_callid_t callid)
179	{	179	{
180	unsigned long keys[3] = { service, 0, 0 };	180	unsigned long keys[3] = { service, 0, 0 };
181	link_t *hlp;	181	link_t *hlp;
182	hashed_service_t *hs;	182	hashed_service_t *hs;
183		183
184	hlp = hash_table_find(&ns_hash_table, keys);	184	hlp = hash_table_find(&ns_hash_table, keys);
185	if (!hlp) {	185	if (!hlp) {
186	return ENOENT;	186	return ENOENT;
187	}	187	}
188	hs = hash_table_get_instance(hlp, hashed_service_t, link);	188	hs = hash_table_get_instance(hlp, hashed_service_t, link);
189	return ipc_forward_fast(callid, hs->phone, 0, 0);	189	return ipc_forward_fast(callid, hs->phone, 0, 0);
190	}	190	}
191		191
192	/** Compute hash index into NS hash table.	192	/** Compute hash index into NS hash table.
193	*	193	*
194	* @param key Pointer keys. However, only the first key (i.e. service number)	194	* @param key Pointer keys. However, only the first key (i.e. service number)
195	* is used to compute the hash index.	195	* is used to compute the hash index.
196	* @return Hash index corresponding to key[0].	196	* @return Hash index corresponding to key[0].
197	*/	197	*/
198	hash_index_t ns_hash(unsigned long *key)	198	hash_index_t ns_hash(unsigned long *key)
199	{	199	{
200	assert(key);	200	assert(key);
201	return *key % NS_HASH_TABLE_CHAINS;	201	return *key % NS_HASH_TABLE_CHAINS;
202	}	202	}
203		203
204	/** Compare a key with hashed item.	204	/** Compare a key with hashed item.
205	*	205	*
206	* This compare function always ignores the third key.	206	* This compare function always ignores the third key.
207	* It exists only to make it possible to remove records	207	* It exists only to make it possible to remove records
208	* originating from connection with key[1] in_phone_hash	208	* originating from connection with key[1] in_phone_hash
209	* value. Note that this is close to being classified	209	* value. Note that this is close to being classified
210	* as a nasty hack.	210	* as a nasty hack.
211	*	211	*
212	* @param key Array of keys.	212	* @param key Array of keys.
213	* @param keys Must be lesser or equal to 3.	213	* @param keys Must be lesser or equal to 3.
214	* @param item Pointer to a hash table item.	214	* @param item Pointer to a hash table item.
215	* @return Non-zero if the key matches the item, zero otherwise.	215	* @return Non-zero if the key matches the item, zero otherwise.
216	*/	216	*/
217	int ns_compare(unsigned long key[], hash_count_t keys, link_t *item)	217	int ns_compare(unsigned long key[], hash_count_t keys, link_t *item)
218	{	218	{
219	hashed_service_t *hs;	219	hashed_service_t *hs;
220		220
221	assert(key);	221	assert(key);
222	assert(keys <= 3);	222	assert(keys <= 3);
223	assert(item);	223	assert(item);
224		224
225	hs = hash_table_get_instance(item, hashed_service_t, link);	225	hs = hash_table_get_instance(item, hashed_service_t, link);
226		226
227	if (keys == 2)	227	if (keys == 2)
228	return key[1] == hs->in_phone_hash;	228	return key[1] == hs->in_phone_hash;
229	else	229	else
230	return key[0] == hs->service;	230	return key[0] == hs->service;
231	}	231	}
232		232
233	/** Perform actions after removal of item from the hash table.	233	/** Perform actions after removal of item from the hash table.
234	*	234	*
235	* @param item Item that was removed from the hash table.	235	* @param item Item that was removed from the hash table.
236	*/	236	*/
237	void ns_remove(link_t *item)	237	void ns_remove(link_t *item)
238	{	238	{
239	assert(item);	239	assert(item);
240	free(hash_table_get_instance(item, hashed_service_t, link));	240	free(hash_table_get_instance(item, hashed_service_t, link));
241	}	241	}
242		242

Subversion Repositories HelenOS-historic

(root)/uspace/trunk/ns/ns.c – Rev 1531 → 1547