Rev 4350 | Rev 4722 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 3466 | mejdrech | 1 | /* |
| 3912 | mejdrech | 2 | * Copyright (c) 2009 Lukas Mejdrech |
| 3466 | mejdrech | 3 | * All rights reserved. |
| 4 | * |
||
| 5 | * Redistribution and use in source and binary forms, with or without |
||
| 6 | * modification, are permitted provided that the following conditions |
||
| 7 | * are met: |
||
| 8 | * |
||
| 9 | * - Redistributions of source code must retain the above copyright |
||
| 10 | * notice, this list of conditions and the following disclaimer. |
||
| 11 | * - Redistributions in binary form must reproduce the above copyright |
||
| 12 | * notice, this list of conditions and the following disclaimer in the |
||
| 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 |
||
| 15 | * derived from this software without specific prior written permission. |
||
| 16 | * |
||
| 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 |
||
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
| 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 |
||
| 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 |
||
| 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
| 27 | */ |
||
| 28 | |||
| 29 | /** @addtogroup net |
||
| 3912 | mejdrech | 30 | * @{ |
| 3466 | mejdrech | 31 | */ |
| 32 | |||
| 33 | /** @file |
||
| 4350 | mejdrech | 34 | * Generic module functions implementation. |
| 3466 | mejdrech | 35 | */ |
| 36 | #include <async.h> |
||
| 3846 | mejdrech | 37 | |
| 3466 | mejdrech | 38 | #include <ipc/ipc.h> |
| 39 | #include <ipc/services.h> |
||
| 40 | |||
| 3666 | mejdrech | 41 | #include "err.h" |
| 3466 | mejdrech | 42 | #include "modules.h" |
| 43 | |||
| 4350 | mejdrech | 44 | /** The time between connect requests. |
| 45 | */ |
||
| 3466 | mejdrech | 46 | #define MODULE_WAIT_TIME 10000 |
| 47 | |||
| 48 | int connect_to_service( services_t need ){ |
||
| 4243 | mejdrech | 49 | int phone; |
| 50 | int res; |
||
| 3466 | mejdrech | 51 | |
| 4350 | mejdrech | 52 | //TODO timeout version? |
| 4243 | mejdrech | 53 | res = async_req_3_5( PHONE_NS, IPC_M_CONNECT_ME_TO, need, 0, 0, NULL, NULL, NULL, NULL, ( ipcarg_t * ) & phone ); |
| 3685 | mejdrech | 54 | while(( res < 0 ) || ( phone < 0 )){ |
| 55 | usleep( MODULE_WAIT_TIME ); |
||
| 4243 | mejdrech | 56 | res = async_req_3_5( PHONE_NS, IPC_M_CONNECT_ME_TO, need, 0, 0, NULL, NULL, NULL, NULL, ( ipcarg_t * ) & phone ); |
| 3466 | mejdrech | 57 | } |
| 58 | return phone; |
||
| 59 | } |
||
| 60 | |||
| 3846 | mejdrech | 61 | int bind_service( services_t need, ipcarg_t arg1, ipcarg_t arg2, ipcarg_t arg3, async_client_conn_t client_receiver ){ |
| 3466 | mejdrech | 62 | ERROR_DECLARE; |
| 63 | |||
| 4243 | mejdrech | 64 | int phone; |
| 3846 | mejdrech | 65 | ipcarg_t phonehash; |
| 3466 | mejdrech | 66 | |
| 3846 | mejdrech | 67 | phone = connect_to_service( need ); |
| 68 | if( phone >= 0 ){ |
||
| 3912 | mejdrech | 69 | if( ERROR_OCCURRED( ipc_connect_to_me( phone, arg1, arg2, arg3, & phonehash ))){ |
| 3846 | mejdrech | 70 | async_msg_0( phone, IPC_M_PHONE_HUNGUP ); |
| 71 | return ERROR_CODE; |
||
| 3466 | mejdrech | 72 | } |
| 3846 | mejdrech | 73 | async_new_connection( phonehash, 0, NULL, client_receiver ); |
| 3466 | mejdrech | 74 | } |
| 3846 | mejdrech | 75 | return phone; |
| 3466 | mejdrech | 76 | } |
| 77 | |||
| 4714 | mejdrech | 78 | void answer_call( ipc_callid_t callid, int result, ipc_call_t * answer, int answer_count ){ |
| 79 | if( answer || ( ! answer_count )){ |
||
| 80 | switch( answer_count ){ |
||
| 81 | case 0: |
||
| 82 | ipc_answer_0( callid, ( ipcarg_t ) result ); |
||
| 83 | break; |
||
| 84 | case 1: |
||
| 85 | ipc_answer_1( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer )); |
||
| 86 | break; |
||
| 87 | case 2: |
||
| 88 | ipc_answer_2( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer )); |
||
| 89 | break; |
||
| 90 | case 3: |
||
| 91 | ipc_answer_3( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ), IPC_GET_ARG3( * answer )); |
||
| 92 | break; |
||
| 93 | 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 )); |
||
| 95 | break; |
||
| 96 | case 5: |
||
| 97 | 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 )); |
||
| 99 | break; |
||
| 100 | } |
||
| 101 | } |
||
| 102 | } |
||
| 103 | |||
| 104 | void refresh_answer( ipc_call_t * answer, int * answer_count ){ |
||
| 105 | if( answer_count ){ |
||
| 106 | * answer_count = 0; |
||
| 107 | } |
||
| 108 | if( answer ){ |
||
| 109 | IPC_SET_RETVAL( * answer, 0 ); |
||
| 110 | // just to be precize |
||
| 111 | IPC_SET_METHOD( * answer, 0 ); |
||
| 112 | IPC_SET_ARG1( * answer, 0 ); |
||
| 113 | IPC_SET_ARG2( * answer, 0 ); |
||
| 114 | IPC_SET_ARG3( * answer, 0 ); |
||
| 115 | IPC_SET_ARG4( * answer, 0 ); |
||
| 116 | IPC_SET_ARG5( * answer, 0 ); |
||
| 117 | } |
||
| 118 | } |
||
| 119 | |||
| 3466 | mejdrech | 120 | /** @} |
| 121 | */ |