Rev 3666 | Rev 4307 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3666 | Rev 3846 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2008 Lukas Mejdrech |
2 | * Copyright (c) 2008 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 | */ |
34 | */ |
35 | 35 | ||
36 | #include <async.h> |
36 | #include <async.h> |
37 | #include <stdio.h> |
37 | #include <stdio.h> |
38 | #include <task.h> |
38 | #include <task.h> |
- | 39 | ||
39 | #include <ipc/ipc.h> |
40 | #include <ipc/ipc.h> |
40 | 41 | ||
41 | #include "err.h" |
42 | #include "err.h" |
42 | #include "modules.h" |
- | |
43 | 43 | ||
44 | extern int module_call( ipc_callid_t callid ); |
- | |
45 | extern int module_message( ipc_callid_t callid, ipcarg_t method, ipcarg_t arg1, ipcarg_t arg2, ipcarg_t arg3, ipcarg_t * result1, ipcarg_t * result2, ipcarg_t * result3 ); |
44 | extern int module_message( ipc_callid_t callid, ipc_call_t * call, ipc_call_t * answer, int * answer_count ); |
46 | extern void module_print_name( void ); |
45 | extern void module_print_name( void ); |
47 | extern int module_start( void ( * client_connection )( ipc_callid_t iid, ipc_call_t * icall )); |
46 | extern int module_start( async_client_conn_t client_connection ); |
48 | 47 | ||
49 | void client_connection( ipc_callid_t iid, ipc_call_t * icall ); |
48 | void client_connection( ipc_callid_t iid, ipc_call_t * icall ); |
50 | int main( int argc, char * argv[] ); |
49 | int main( int argc, char * argv[] ); |
51 | 50 | ||
52 | /** Default thread for new connections. |
51 | /** Default thread for new connections. |
53 | */ |
52 | */ |
54 | void client_connection( ipc_callid_t iid, ipc_call_t * icall ){ |
53 | void client_connection( ipc_callid_t iid, ipc_call_t * icall ){ |
55 | ipc_callid_t callid; |
54 | ipc_callid_t callid; |
56 | ipc_call_t call; |
55 | ipc_call_t call; |
57 | ipcarg_t arg1, arg2, arg3; |
56 | ipc_call_t answer; |
- | 57 | int count; |
|
58 | int res; |
58 | int res; |
59 | 59 | ||
- | 60 | /* |
|
60 | /* Accept the connection */ |
61 | * Accept the connection |
- | 62 | * - Answer the first IPC_M_CONNECT_ME_TO call. |
|
- | 63 | */ |
|
61 | ipc_answer_0( iid, EOK ); |
64 | ipc_answer_0( iid, EOK ); |
62 | 65 | ||
63 | while( true ){ |
66 | while( true ){ |
- | 67 | // refresh data |
|
- | 68 | count = 0; |
|
- | 69 | IPC_SET_RETVAL( answer, 0 ); |
|
- | 70 | // just to be precize |
|
- | 71 | IPC_SET_RETVAL( answer, 0 ); |
|
- | 72 | IPC_SET_ARG1( answer, 0 ); |
|
- | 73 | IPC_SET_ARG2( answer, 0 ); |
|
- | 74 | IPC_SET_ARG3( answer, 0 ); |
|
- | 75 | IPC_SET_ARG4( answer, 0 ); |
|
- | 76 | IPC_SET_ARG5( answer, 0 ); |
|
- | 77 | ||
64 | callid = async_get_call( & call ); |
78 | callid = async_get_call( & call ); |
- | 79 | res = module_message( callid, & call, & answer, & count ); |
|
- | 80 | ||
- | 81 | switch( count ){ |
|
- | 82 | case 0: ipc_answer_0( callid, res ); |
|
65 | arg1 = 0; |
83 | continue; |
- | 84 | case 1: ipc_answer_1( callid, res, IPC_GET_ARG1( answer )); |
|
66 | arg2 = 0; |
85 | continue; |
- | 86 | case 2: ipc_answer_2( callid, res, IPC_GET_ARG1( answer ), IPC_GET_ARG2( answer )); |
|
67 | arg3 = 0; |
87 | continue; |
- | 88 | case 3: ipc_answer_3( callid, res, IPC_GET_ARG1( answer ), IPC_GET_ARG2( answer ), IPC_GET_ARG3( answer )); |
|
68 | res = module_call( callid ); |
89 | continue; |
- | 90 | case 4: ipc_answer_4( callid, res, IPC_GET_ARG1( answer ), IPC_GET_ARG2( answer ), IPC_GET_ARG3( answer ), IPC_GET_ARG4( answer )); |
|
69 | if( res == EOK ){ |
91 | continue; |
70 | res = module_message( callid, IPC_GET_METHOD( call ), IPC_GET_ARG1( call ), IPC_GET_ARG2( call ), IPC_GET_ARG3( call ), & arg1, & arg2, & arg3 ); |
92 | default: ipc_answer_5( callid, res, IPC_GET_ARG1( answer ), IPC_GET_ARG2( answer ), IPC_GET_ARG3( answer ), IPC_GET_ARG4( answer ), IPC_GET_ARG5( answer )); |
- | 93 | continue; |
|
71 | } |
94 | } |
72 | ipc_answer_2( callid, res, arg1, arg2 ); |
- | |
73 | } |
95 | } |
74 | } |
96 | } |
75 | 97 | ||
76 | /** Starts the module. |
98 | /** Starts the module. |
77 | * Parameters are ignored. |
99 | * Parameters are ignored. |
78 | */ |
100 | */ |
79 | int main( int argc, char * argv[] ){ |
101 | int main( int argc, char * argv[] ){ |
80 | ERROR_DECLARE; |
102 | ERROR_DECLARE; |
81 | 103 | ||
82 | printf("\nTask %d - ", task_get_id()); |
104 | printf("\nTask %d - ", task_get_id()); |
83 | module_print_name(); |
105 | module_print_name(); |
84 | if( ERROR_OCCURED( module_start( client_connection ))){ |
106 | if( ERROR_OCCURED( module_start( client_connection ))){ |
85 | printf( " - ERROR %i", ERROR_CODE ); |
107 | printf( " - ERROR %i", ERROR_CODE ); |
86 | return ERROR_CODE; |
108 | return ERROR_CODE; |
87 | } |
109 | } |
88 | return EOK; |
110 | return EOK; |
89 | } |
111 | } |
90 | 112 | ||
91 | /** @} |
113 | /** @} |
92 | */ |
114 | */ |
93 | 115 |