WebSVN – HelenOS – Diff – /branches/network/uspace/srv/net/modules.c


/*
 * Copyright (c) 2009 Lukas Mejdrech
 * 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 net
 *  @{
 */
 
/** @file
 *  Generic module functions implementation.
 */
 
#include <async.h>
#include <malloc.h>
 
#include <ipc/ipc.h>
#include <ipc/services.h>
 
#include "err.h"
#include "modules.h"
 
/** The time between connect requests.
 */
#define MODULE_WAIT_TIME    10000
 
int connect_to_service( services_t need ){
    int phone;
    int res;
 
    //TODO timeout version?
    res = async_req_3_5( PHONE_NS, IPC_M_CONNECT_ME_TO, need, 0, 0, NULL, NULL, NULL, NULL, ( ipcarg_t * ) & phone );
    while(( res < 0 ) || ( phone < 0 )){
        usleep( MODULE_WAIT_TIME );
        res = async_req_3_5( PHONE_NS, IPC_M_CONNECT_ME_TO, need, 0, 0, NULL, NULL, NULL, NULL, ( ipcarg_t * ) & phone );
    }
    return phone;
}
 
int bind_service( services_t need, ipcarg_t arg1, ipcarg_t arg2, ipcarg_t arg3, async_client_conn_t client_receiver ){
    ERROR_DECLARE;
 
    int         phone;
    ipcarg_t    phonehash;
 
    phone = connect_to_service( need );
    if( phone >= 0 ){
        if( ERROR_OCCURRED( ipc_connect_to_me( phone, arg1, arg2, arg3, & phonehash ))){
            async_msg_0( phone, IPC_M_PHONE_HUNGUP );
            return ERROR_CODE;
        }
        async_new_connection( phonehash, 0, NULL, client_receiver );
    }
    return phone;
}
 
void answer_call( ipc_callid_t callid, int result, ipc_call_t * answer, int answer_count ){
    if( answer || ( ! answer_count )){
        switch( answer_count ){
            case 0:
                ipc_answer_0( callid, ( ipcarg_t ) result );
                break;
            case 1:
                ipc_answer_1( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ));
                break;
            case 2:
                ipc_answer_2( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ));
                break;
            case 3:
                ipc_answer_3( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ), IPC_GET_ARG3( * answer ));
                break;
            case 4:
                ipc_answer_4( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ), IPC_GET_ARG3( * answer ), IPC_GET_ARG4( * answer ));
                break;
            case 5:
            default:
                ipc_answer_5( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ), IPC_GET_ARG3( * answer ), IPC_GET_ARG4( * answer ), IPC_GET_ARG5( * answer ));
                break;
        }
    }
}
 
void refresh_answer( ipc_call_t * answer, int * answer_count ){
    if( answer_count ){
        * answer_count = 0;
    }
    if( answer ){
        IPC_SET_RETVAL( * answer, 0 );
        // just to be precize
        IPC_SET_METHOD( * answer, 0 );
        IPC_SET_ARG1( * answer, 0 );
        IPC_SET_ARG2( * answer, 0 );
        IPC_SET_ARG3( * answer, 0 );
        IPC_SET_ARG4( * answer, 0 );
        IPC_SET_ARG5( * answer, 0 );
    }
}
 
int data_receive( void ** data, size_t * length ){
    ERROR_DECLARE;
 
    ipc_callid_t    callid;
 
    if( !( data && length )) return EBADMEM;
    if( ! ipc_data_write_receive( & callid, length )) return EINVAL;
    * data = malloc( * length );
    if( !( * data )) return ENOMEM;
    if( ERROR_OCCURRED( ipc_data_write_finalize( callid, * data, * length ))){
        free( data );
        return ERROR_CODE;
    }
    return EOK;
}
 
int data_reply( void * data, size_t data_length ){
    size_t          length;
    ipc_callid_t    callid;
 
    if( ! ipc_data_read_receive( & callid, & length )){
 
        return EINVAL;
    }
    if( length < data_length ){
        ipc_data_read_finalize( callid, data, length );
        return EOVERFLOW;
    }
    return ipc_data_read_finalize( callid, data, data_length );
}
 
/** @}
 */
 

Rev 4722	Rev 4731
1	/*	1	/*
2	* Copyright (c) 2009 Lukas Mejdrech	2	* Copyright (c) 2009 Lukas Mejdrech
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 net	29	/** @addtogroup net
30	* @{	30	* @{
31	*/	31	*/
32		32
33	/** @file	33	/** @file
34	* Generic module functions implementation.	34	* Generic module functions implementation.
35	*/	35	*/
36		36
37	#include <async.h>	37	#include <async.h>
38	#include <malloc.h>	38	#include <malloc.h>
39		39
40	#include <ipc/ipc.h>	40	#include <ipc/ipc.h>
41	#include <ipc/services.h>	41	#include <ipc/services.h>
42		42
43	#include "err.h"	43	#include "err.h"
44	#include "modules.h"	44	#include "modules.h"
45		45
46	/** The time between connect requests.	46	/** The time between connect requests.
47	*/	47	*/
48	#define MODULE_WAIT_TIME 10000	48	#define MODULE_WAIT_TIME 10000
49		49
50	int connect_to_service( services_t need ){	50	int connect_to_service( services_t need ){
51	int phone;	51	int phone;
52	int res;	52	int res;
53		53
54	//TODO timeout version?	54	//TODO timeout version?
55	res = async_req_3_5( PHONE_NS, IPC_M_CONNECT_ME_TO, need, 0, 0, NULL, NULL, NULL, NULL, ( ipcarg_t * ) & phone );	55	res = async_req_3_5( PHONE_NS, IPC_M_CONNECT_ME_TO, need, 0, 0, NULL, NULL, NULL, NULL, ( ipcarg_t * ) & phone );
56	while(( res < 0 ) \|\| ( phone < 0 )){	56	while(( res < 0 ) \|\| ( phone < 0 )){
57	usleep( MODULE_WAIT_TIME );	57	usleep( MODULE_WAIT_TIME );
58	res = async_req_3_5( PHONE_NS, IPC_M_CONNECT_ME_TO, need, 0, 0, NULL, NULL, NULL, NULL, ( ipcarg_t * ) & phone );	58	res = async_req_3_5( PHONE_NS, IPC_M_CONNECT_ME_TO, need, 0, 0, NULL, NULL, NULL, NULL, ( ipcarg_t * ) & phone );
59	}	59	}
60	return phone;	60	return phone;
61	}	61	}
62		62
63	int bind_service( services_t need, ipcarg_t arg1, ipcarg_t arg2, ipcarg_t arg3, async_client_conn_t client_receiver ){	63	int bind_service( services_t need, ipcarg_t arg1, ipcarg_t arg2, ipcarg_t arg3, async_client_conn_t client_receiver ){
64	ERROR_DECLARE;	64	ERROR_DECLARE;
65		65
66	int phone;	66	int phone;
67	ipcarg_t phonehash;	67	ipcarg_t phonehash;
68		68
69	phone = connect_to_service( need );	69	phone = connect_to_service( need );
70	if( phone >= 0 ){	70	if( phone >= 0 ){
71	if( ERROR_OCCURRED( ipc_connect_to_me( phone, arg1, arg2, arg3, & phonehash ))){	71	if( ERROR_OCCURRED( ipc_connect_to_me( phone, arg1, arg2, arg3, & phonehash ))){
72	async_msg_0( phone, IPC_M_PHONE_HUNGUP );	72	async_msg_0( phone, IPC_M_PHONE_HUNGUP );
73	return ERROR_CODE;	73	return ERROR_CODE;
74	}	74	}
75	async_new_connection( phonehash, 0, NULL, client_receiver );	75	async_new_connection( phonehash, 0, NULL, client_receiver );
76	}	76	}
77	return phone;	77	return phone;
78	}	78	}
79		79
80	void answer_call( ipc_callid_t callid, int result, ipc_call_t * answer, int answer_count ){	80	void answer_call( ipc_callid_t callid, int result, ipc_call_t * answer, int answer_count ){
81	if( answer \|\| ( ! answer_count )){	81	if( answer \|\| ( ! answer_count )){
82	switch( answer_count ){	82	switch( answer_count ){
83	case 0:	83	case 0:
84	ipc_answer_0( callid, ( ipcarg_t ) result );	84	ipc_answer_0( callid, ( ipcarg_t ) result );
85	break;	85	break;
86	case 1:	86	case 1:
87	ipc_answer_1( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ));	87	ipc_answer_1( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ));
88	break;	88	break;
89	case 2:	89	case 2:
90	ipc_answer_2( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ));	90	ipc_answer_2( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ));
91	break;	91	break;
92	case 3:	92	case 3:
93	ipc_answer_3( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ), IPC_GET_ARG3( * answer ));	93	ipc_answer_3( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ), IPC_GET_ARG3( * answer ));
94	break;	94	break;
95	case 4:	95	case 4:
96	ipc_answer_4( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ), IPC_GET_ARG3( * answer ), IPC_GET_ARG4( * answer ));	96	ipc_answer_4( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ), IPC_GET_ARG3( * answer ), IPC_GET_ARG4( * answer ));
97	break;	97	break;
98	case 5:	98	case 5:
99	default:	99	default:
100	ipc_answer_5( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ), IPC_GET_ARG3( * answer ), IPC_GET_ARG4( * answer ), IPC_GET_ARG5( * answer ));	100	ipc_answer_5( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ), IPC_GET_ARG3( * answer ), IPC_GET_ARG4( * answer ), IPC_GET_ARG5( * answer ));
101	break;	101	break;
102	}	102	}
103	}	103	}
104	}	104	}
105		105
106	void refresh_answer( ipc_call_t * answer, int * answer_count ){	106	void refresh_answer( ipc_call_t * answer, int * answer_count ){
107	if( answer_count ){	107	if( answer_count ){
108	* answer_count = 0;	108	* answer_count = 0;
109	}	109	}
110	if( answer ){	110	if( answer ){
111	IPC_SET_RETVAL( * answer, 0 );	111	IPC_SET_RETVAL( * answer, 0 );
112	// just to be precize	112	// just to be precize
113	IPC_SET_METHOD( * answer, 0 );	113	IPC_SET_METHOD( * answer, 0 );
114	IPC_SET_ARG1( * answer, 0 );	114	IPC_SET_ARG1( * answer, 0 );
115	IPC_SET_ARG2( * answer, 0 );	115	IPC_SET_ARG2( * answer, 0 );
116	IPC_SET_ARG3( * answer, 0 );	116	IPC_SET_ARG3( * answer, 0 );
117	IPC_SET_ARG4( * answer, 0 );	117	IPC_SET_ARG4( * answer, 0 );
118	IPC_SET_ARG5( * answer, 0 );	118	IPC_SET_ARG5( * answer, 0 );
119	}	119	}
120	}	120	}
121		121
122	int data_receive( void ** data, size_t * length ){	122	int data_receive( void ** data, size_t * length ){
123	ERROR_DECLARE;	123	ERROR_DECLARE;
124		124
125	ipc_callid_t callid;	125	ipc_callid_t callid;
126		126
127	if( !( data && length )) return EBADMEM;	127	if( !( data && length )) return EBADMEM;
128	if( ! ipc_data_write_receive( & callid, length )) return EINVAL;	128	if( ! ipc_data_write_receive( & callid, length )) return EINVAL;
129	* data = malloc( * length );	129	* data = malloc( * length );
130	if( !( * data )) return ENOMEM;	130	if( !( * data )) return ENOMEM;
131	if( ERROR_OCCURRED( ipc_data_write_finalize( callid, * data, * length ))){	131	if( ERROR_OCCURRED( ipc_data_write_finalize( callid, * data, * length ))){
132	free( data );	132	free( data );
133	return ERROR_CODE;	133	return ERROR_CODE;
134	}	134	}
135	return EOK;	135	return EOK;
136	}	136	}
137		137
138	int data_reply( void * data, size_t data_length ){	138	int data_reply( void * data, size_t data_length ){
139	size_t length;	139	size_t length;
140	ipc_callid_t callid;	140	ipc_callid_t callid;
141		141
142	if(( ! ipc_data_read_receive( & callid, & length ))	142	if( ! ipc_data_read_receive( & callid, & length )){
143	\|\| ( length < data_length )){	-
144	return EINVAL;	143	return EINVAL;
145	}	144	}
-		145	if( length < data_length ){
-		146	ipc_data_read_finalize( callid, data, length );
-		147	return EOVERFLOW;
-		148	}
146	return ipc_data_read_finalize( callid, data, data_length );	149	return ipc_data_read_finalize( callid, data, data_length );
147	}	150	}
148		151
149	/** @}	152	/** @}
150	*/	153	*/
151		154

Subversion Repositories HelenOS

(root)/branches/network/uspace/srv/net/modules.c – Rev 4722 → 4731