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

Subversion Repositories HelenOS-historic

(root)/uspace/trunk/ns/ns.c – Rev 1353 → 1360