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

Subversion Repositories HelenOS-historic

(root)/uspace/trunk/ns/ns.c – Rev 1435 → 1462