Subversion Repositories HelenOS

Rev

Rev 4722 | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (c) 2009 Lukas 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
  30.  *  @{
  31.  */
  32.  
  33. /** @file
  34.  *  Generic module functions implementation.
  35.  */
  36.  
  37. #include <async.h>
  38. #include <malloc.h>
  39.  
  40. #include <ipc/ipc.h>
  41. #include <ipc/services.h>
  42.  
  43. #include "err.h"
  44. #include "modules.h"
  45.  
  46. /** The time between connect requests.
  47.  */
  48. #define MODULE_WAIT_TIME    10000
  49.  
  50. int connect_to_service( services_t need ){
  51.     int phone;
  52.     int res;
  53.  
  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 );
  56.     while(( res < 0 ) || ( phone < 0 )){
  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 );
  59.     }
  60.     return phone;
  61. }
  62.  
  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;
  65.  
  66.     int         phone;
  67.     ipcarg_t    phonehash;
  68.  
  69.     phone = connect_to_service( need );
  70.     if( phone >= 0 ){
  71.         if( ERROR_OCCURRED( ipc_connect_to_me( phone, arg1, arg2, arg3, & phonehash ))){
  72.             async_msg_0( phone, IPC_M_PHONE_HUNGUP );
  73.             return ERROR_CODE;
  74.         }
  75.         async_new_connection( phonehash, 0, NULL, client_receiver );
  76.     }
  77.     return phone;
  78. }
  79.  
  80. void answer_call( ipc_callid_t callid, int result, ipc_call_t * answer, int answer_count ){
  81.     if( answer || ( ! answer_count )){
  82.         switch( answer_count ){
  83.             case 0:
  84.                 ipc_answer_0( callid, ( ipcarg_t ) result );
  85.                 break;
  86.             case 1:
  87.                 ipc_answer_1( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ));
  88.                 break;
  89.             case 2:
  90.                 ipc_answer_2( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ));
  91.                 break;
  92.             case 3:
  93.                 ipc_answer_3( callid, ( ipcarg_t ) result, IPC_GET_ARG1( * answer ), IPC_GET_ARG2( * answer ), IPC_GET_ARG3( * answer ));
  94.                 break;
  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 ));
  97.                 break;
  98.             case 5:
  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 ));
  101.                 break;
  102.         }
  103.     }
  104. }
  105.  
  106. void refresh_answer( ipc_call_t * answer, int * answer_count ){
  107.     if( answer_count ){
  108.         * answer_count = 0;
  109.     }
  110.     if( answer ){
  111.         IPC_SET_RETVAL( * answer, 0 );
  112.         // just to be precize
  113.         IPC_SET_METHOD( * answer, 0 );
  114.         IPC_SET_ARG1( * answer, 0 );
  115.         IPC_SET_ARG2( * answer, 0 );
  116.         IPC_SET_ARG3( * answer, 0 );
  117.         IPC_SET_ARG4( * answer, 0 );
  118.         IPC_SET_ARG5( * answer, 0 );
  119.     }
  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.         return EINVAL;
  144.     }
  145.     if( length < data_length ){
  146.         ipc_data_read_finalize( callid, data, length );
  147.         return EOVERFLOW;
  148.     }
  149.     return ipc_data_read_finalize( callid, data, data_length );
  150. }
  151.  
  152. /** @}
  153.  */
  154.