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

Subversion Repositories HelenOS

(root)/trunk/uspace/ns/ns.c – Rev 2141 → 2471