Rev 4714 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 4714 | Rev 4722 | ||
---|---|---|---|
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 | #include <async.h> |
37 | #include <async.h> |
- | 38 | #include <malloc.h> |
|
37 | 39 | ||
38 | #include <ipc/ipc.h> |
40 | #include <ipc/ipc.h> |
39 | #include <ipc/services.h> |
41 | #include <ipc/services.h> |
40 | 42 | ||
41 | #include "err.h" |
43 | #include "err.h" |
42 | #include "modules.h" |
44 | #include "modules.h" |
43 | 45 | ||
44 | /** The time between connect requests. |
46 | /** The time between connect requests. |
45 | */ |
47 | */ |
46 | #define MODULE_WAIT_TIME 10000 |
48 | #define MODULE_WAIT_TIME 10000 |
47 | 49 | ||
48 | int connect_to_service( services_t need ){ |
50 | int connect_to_service( services_t need ){ |
49 | int phone; |
51 | int phone; |
50 | int res; |
52 | int res; |
51 | 53 | ||
52 | //TODO timeout version? |
54 | //TODO timeout version? |
53 | 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 ); |
54 | while(( res < 0 ) || ( phone < 0 )){ |
56 | while(( res < 0 ) || ( phone < 0 )){ |
55 | usleep( MODULE_WAIT_TIME ); |
57 | usleep( MODULE_WAIT_TIME ); |
56 | 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 ); |
57 | } |
59 | } |
58 | return phone; |
60 | return phone; |
59 | } |
61 | } |
60 | 62 | ||
61 | 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 ){ |
62 | ERROR_DECLARE; |
64 | ERROR_DECLARE; |
63 | 65 | ||
64 | int phone; |
66 | int phone; |
65 | ipcarg_t phonehash; |
67 | ipcarg_t phonehash; |
66 | 68 | ||
67 | phone = connect_to_service( need ); |
69 | phone = connect_to_service( need ); |
68 | if( phone >= 0 ){ |
70 | if( phone >= 0 ){ |
69 | 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 ))){ |
70 | async_msg_0( phone, IPC_M_PHONE_HUNGUP ); |
72 | async_msg_0( phone, IPC_M_PHONE_HUNGUP ); |
71 | return ERROR_CODE; |
73 | return ERROR_CODE; |
72 | } |
74 | } |
73 | async_new_connection( phonehash, 0, NULL, client_receiver ); |
75 | async_new_connection( phonehash, 0, NULL, client_receiver ); |
74 | } |
76 | } |
75 | return phone; |
77 | return phone; |
76 | } |
78 | } |
77 | 79 | ||
78 | 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 ){ |
79 | if( answer || ( ! answer_count )){ |
81 | if( answer || ( ! answer_count )){ |
80 | switch( answer_count ){ |
82 | switch( answer_count ){ |
81 | case 0: |
83 | case 0: |
82 | ipc_answer_0( callid, ( ipcarg_t ) result ); |
84 | ipc_answer_0( callid, ( ipcarg_t ) result ); |
83 | break; |
85 | break; |
84 | case 1: |
86 | case 1: |
85 | ipc_answer_1( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer )); |
87 | ipc_answer_1( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer )); |
86 | break; |
88 | break; |
87 | case 2: |
89 | case 2: |
88 | 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 )); |
89 | break; |
91 | break; |
90 | case 3: |
92 | case 3: |
91 | 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 )); |
92 | break; |
94 | break; |
93 | case 4: |
95 | case 4: |
94 | 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 )); |
95 | break; |
97 | break; |
96 | case 5: |
98 | case 5: |
97 | default: |
99 | default: |
98 | 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 )); |
99 | break; |
101 | break; |
100 | } |
102 | } |
101 | } |
103 | } |
102 | } |
104 | } |
103 | 105 | ||
104 | void refresh_answer( ipc_call_t * answer, int * answer_count ){ |
106 | void refresh_answer( ipc_call_t * answer, int * answer_count ){ |
105 | if( answer_count ){ |
107 | if( answer_count ){ |
106 | * answer_count = 0; |
108 | * answer_count = 0; |
107 | } |
109 | } |
108 | if( answer ){ |
110 | if( answer ){ |
109 | IPC_SET_RETVAL( * answer, 0 ); |
111 | IPC_SET_RETVAL( * answer, 0 ); |
110 | // just to be precize |
112 | // just to be precize |
111 | IPC_SET_METHOD( * answer, 0 ); |
113 | IPC_SET_METHOD( * answer, 0 ); |
112 | IPC_SET_ARG1( * answer, 0 ); |
114 | IPC_SET_ARG1( * answer, 0 ); |
113 | IPC_SET_ARG2( * answer, 0 ); |
115 | IPC_SET_ARG2( * answer, 0 ); |
114 | IPC_SET_ARG3( * answer, 0 ); |
116 | IPC_SET_ARG3( * answer, 0 ); |
115 | IPC_SET_ARG4( * answer, 0 ); |
117 | IPC_SET_ARG4( * answer, 0 ); |
116 | IPC_SET_ARG5( * answer, 0 ); |
118 | IPC_SET_ARG5( * answer, 0 ); |
117 | } |
119 | } |
118 | } |
120 | } |
- | 121 | ||
- | 122 | int data_receive( void ** data, size_t * length ){ |
|
- | 123 | ERROR_DECLARE; |
|
- | 124 | ||
- | 125 | ipc_callid_t callid; |
|
- | 126 | ||
- | 127 | if( !( data && length )) return EBADMEM; |
|
- | 128 | if( ! ipc_data_write_receive( & callid, length )) return EINVAL; |
|
- | 129 | * data = malloc( * length ); |
|
- | 130 | if( !( * data )) return ENOMEM; |
|
- | 131 | if( ERROR_OCCURRED( ipc_data_write_finalize( callid, * data, * length ))){ |
|
- | 132 | free( data ); |
|
- | 133 | return ERROR_CODE; |
|
- | 134 | } |
|
- | 135 | return EOK; |
|
- | 136 | } |
|
- | 137 | ||
- | 138 | int data_reply( void * data, size_t data_length ){ |
|
- | 139 | size_t length; |
|
- | 140 | ipc_callid_t callid; |
|
- | 141 | ||
- | 142 | if(( ! ipc_data_read_receive( & callid, & length )) |
|
- | 143 | || ( length < data_length )){ |
|
- | 144 | return EINVAL; |
|
- | 145 | } |
|
- | 146 | return ipc_data_read_finalize( callid, data, data_length ); |
|
- | 147 | } |
|
119 | 148 | ||
120 | /** @} |
149 | /** @} |
121 | */ |
150 | */ |
122 | 151 |