Subversion Repositories HelenOS

Rev

Rev 4496 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (c) 2009 Martin Decky
  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 ns
  30.  * @{
  31.  */
  32.  
  33. #include <ipc/ipc.h>
  34. #include <ipc/services.h>
  35. #include <libadt/list.h>
  36. #include <bool.h>
  37. #include <errno.h>
  38. #include <assert.h>
  39. #include <stdio.h>
  40. #include <malloc.h>
  41. #include "clonable.h"
  42. #include "ns.h"
  43.  
  44. /** Request for connection to a clonable service. */
  45. typedef struct {
  46.     link_t link;
  47.     ipcarg_t service;
  48.     ipc_call_t call;
  49.     ipc_callid_t callid;
  50. } cs_req_t;
  51.  
  52. /** List of clonable-service connection requests. */
  53. static link_t cs_req;
  54.  
  55. int clonable_init(void)
  56. {
  57.     list_initialize(&cs_req);
  58.     return EOK;
  59. }
  60.  
  61. /** Return true if @a service is clonable. */
  62. bool service_clonable(int service)
  63. {
  64.     return (service == SERVICE_LOAD);
  65. }
  66.  
  67. /** Register clonable service.
  68.  *
  69.  * @param service Service to be registered.
  70.  * @param phone   Phone to be used for connections to the service.
  71.  * @param call    Pointer to call structure.
  72.  *
  73.  */
  74. void register_clonable(ipcarg_t service, ipcarg_t phone, ipc_call_t *call,
  75.     ipc_callid_t callid)
  76. {
  77.     if (list_empty(&cs_req)) {
  78.         /* There was no pending connection request. */
  79.         printf(NAME ": Unexpected clonable server.\n");
  80.         ipc_answer_0(callid, EBUSY);
  81.         return;
  82.     }
  83.    
  84.     cs_req_t *csr = list_get_instance(cs_req.next, cs_req_t, link);
  85.     list_remove(&csr->link);
  86.    
  87.     /* Currently we can only handle a single type of clonable service. */
  88.     assert(csr->service == SERVICE_LOAD);
  89.    
  90.     ipc_answer_0(callid, EOK);
  91.    
  92.     ipc_forward_fast(csr->callid, phone, IPC_GET_ARG2(csr->call),
  93.         IPC_GET_ARG3(csr->call), 0, IPC_FF_NONE);
  94.    
  95.     free(csr);
  96.     ipc_hangup(phone);
  97. }
  98.  
  99. /** Connect client to clonable service.
  100.  *
  101.  * @param service Service to be connected to.
  102.  * @param call    Pointer to call structure.
  103.  * @param callid  Call ID of the request.
  104.  *
  105.  * @return Zero on success or a value from @ref errno.h.
  106.  *
  107.  */
  108. void connect_to_clonable(ipcarg_t service, ipc_call_t *call,
  109.     ipc_callid_t callid)
  110. {
  111.     assert(service == SERVICE_LOAD);
  112.    
  113.     cs_req_t *csr = malloc(sizeof(cs_req_t));
  114.     if (csr == NULL) {
  115.         ipc_answer_0(callid, ENOMEM);
  116.         return;
  117.     }
  118.    
  119.     /* Spawn a loader. */
  120.     int rc = loader_spawn("loader");
  121.    
  122.     if (rc < 0) {
  123.         free(csr);
  124.         ipc_answer_0(callid, rc);
  125.         return;
  126.     }
  127.    
  128.     csr->service = service;
  129.     csr->call = *call;
  130.     csr->callid = callid;
  131.    
  132.     /*
  133.      * We can forward the call only after the server we spawned connects
  134.      * to us. Meanwhile we might need to service more connection requests.
  135.      * Thus we store the call in a queue.
  136.      */
  137.     list_append(&csr->link, &cs_req);
  138. }
  139.  
  140. /**
  141.  * @}
  142.  */
  143.