Subversion Repositories HelenOS

Rev

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

  1. /*
  2.  * Copyright (c) 2006 Ondrej Palkovsky
  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. /**
  34.  * @file    ns.c
  35.  * @brief   Naming service for HelenOS IPC.
  36.  */
  37.  
  38.  
  39. #include <ipc/ipc.h>
  40. #include <ipc/ns.h>
  41. #include <ipc/services.h>
  42. #include <stdio.h>
  43. #include <unistd.h>
  44. #include <stdlib.h>
  45. #include <errno.h>
  46. #include <assert.h>
  47. #include <libadt/list.h>
  48. #include <libadt/hash_table.h>
  49. #include <sysinfo.h>
  50. #include <ddi.h>
  51. #include <as.h>
  52.  
  53. #define NAME    "NS"
  54.  
  55. #define NS_HASH_TABLE_CHAINS    20
  56.  
  57. static int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call);
  58. static int connect_to_service(ipcarg_t service, ipc_call_t *call,
  59.     ipc_callid_t callid);
  60.  
  61. /* Static functions implementing NS hash table operations. */
  62. static hash_index_t ns_hash(unsigned long *key);
  63. static int ns_compare(unsigned long *key, hash_count_t keys, link_t *item);
  64. static void ns_remove(link_t *item);
  65.  
  66. /** Operations for NS hash table. */
  67. static hash_table_operations_t ns_hash_table_ops = {
  68.     .hash = ns_hash,
  69.     .compare = ns_compare,
  70.     .remove_callback = ns_remove
  71. };
  72.  
  73. /** NS hash table structure. */
  74. static hash_table_t ns_hash_table;
  75.  
  76. /** NS hash table item. */
  77. typedef struct {
  78.     link_t link;
  79.     ipcarg_t service;       /**< Number of the service. */
  80.     ipcarg_t phone;         /**< Phone registered with the service. */
  81.     ipcarg_t in_phone_hash;     /**< Incoming phone hash. */
  82. } hashed_service_t;
  83.  
  84. static void *clockaddr = NULL;
  85. static void *klogaddr = NULL;
  86.  
  87. static void get_as_area(ipc_callid_t callid, ipc_call_t *call, char *name,
  88.     void **addr)
  89. {
  90.     void *ph_addr;
  91.  
  92.     if (!*addr) {
  93.         ph_addr = (void *) sysinfo_value(name);
  94.         if (!ph_addr) {
  95.             ipc_answer_0(callid, ENOENT);
  96.             return;
  97.         }
  98.         *addr = as_get_mappable_page(PAGE_SIZE);
  99.         physmem_map(ph_addr, *addr, 1,
  100.             AS_AREA_READ | AS_AREA_CACHEABLE);
  101.     }
  102.     ipc_answer_2(callid, EOK, (ipcarg_t) *addr, AS_AREA_READ);
  103. }
  104.  
  105. int main(int argc, char **argv)
  106. {
  107.     ipc_call_t call;
  108.     ipc_callid_t callid;
  109.    
  110.     ipcarg_t retval;
  111.  
  112.     if (!hash_table_create(&ns_hash_table, NS_HASH_TABLE_CHAINS, 3,
  113.         &ns_hash_table_ops)) {
  114.         return ENOMEM;
  115.     }
  116.        
  117.     while (1) {
  118.         callid = ipc_wait_for_call(&call);
  119.         switch (IPC_GET_METHOD(call)) {
  120.         case IPC_M_AS_AREA_RECV:
  121.             switch (IPC_GET_ARG3(call)) {
  122.             case SERVICE_MEM_REALTIME:
  123.                 get_as_area(callid, &call, "clock.faddr",
  124.                     &clockaddr);
  125.                 break;
  126.             case SERVICE_MEM_KLOG:
  127.                 get_as_area(callid, &call, "klog.faddr",
  128.                     &klogaddr);
  129.                 break;
  130.             default:
  131.                 ipc_answer_0(callid, ENOENT);
  132.             }
  133.             continue;
  134.         case IPC_M_PHONE_HUNGUP:
  135.             retval = EOK;
  136.             break;
  137.         case IPC_M_CONNECT_TO_ME:
  138.             /*
  139.              * Server requests service registration.
  140.              */
  141.             retval = register_service(IPC_GET_ARG1(call),
  142.                 IPC_GET_ARG3(call), &call);
  143.             break;
  144.         case IPC_M_CONNECT_ME_TO:
  145.             /*
  146.              * Client requests to be connected to a service.
  147.              */
  148.             retval = connect_to_service(IPC_GET_ARG1(call), &call,
  149.                 callid);
  150.             break;
  151.         default:
  152.             retval = ENOENT;
  153.             break;
  154.         }
  155.         if (!(callid & IPC_CALLID_NOTIFICATION)) {
  156.             ipc_answer_0(callid, retval);
  157.         }
  158.     }
  159. }
  160.  
  161. /** Register service.
  162.  *
  163.  * @param service Service to be registered.
  164.  * @param phone Phone to be used for connections to the service.
  165.  * @param call Pointer to call structure.
  166.  *
  167.  * @return Zero on success or a value from @ref errno.h.
  168.  */
  169. int register_service(ipcarg_t service, ipcarg_t phone, ipc_call_t *call)
  170. {
  171.     unsigned long keys[3] = {
  172.         service,
  173.         call->in_phone_hash,
  174.         0
  175.     };
  176.     hashed_service_t *hs;
  177.            
  178.     if (hash_table_find(&ns_hash_table, keys)) {
  179.         return EEXISTS;
  180.     }
  181.            
  182.     hs = (hashed_service_t *) malloc(sizeof(hashed_service_t));
  183.     if (!hs) {
  184.         return ENOMEM;
  185.     }
  186.            
  187.     link_initialize(&hs->link);
  188.     hs->service = service;
  189.     hs->phone = phone;
  190.     hs->in_phone_hash = call->in_phone_hash;
  191.     hash_table_insert(&ns_hash_table, keys, &hs->link);
  192.            
  193.     return 0;
  194. }
  195.  
  196. /** Connect client to service.
  197.  *
  198.  * @param service Service to be connected to.
  199.  * @param call Pointer to call structure.
  200.  * @param callid Call ID of the request.
  201.  *
  202.  * @return Zero on success or a value from @ref errno.h.
  203.  */
  204. int connect_to_service(ipcarg_t service, ipc_call_t *call, ipc_callid_t callid)
  205. {
  206.     unsigned long keys[3] = { service, 0, 0 };
  207.     link_t *hlp;
  208.     hashed_service_t *hs;
  209.            
  210.     hlp = hash_table_find(&ns_hash_table, keys);
  211.     if (!hlp) {
  212.         return ENOENT;
  213.     }
  214.     hs = hash_table_get_instance(hlp, hashed_service_t, link);
  215.     return ipc_forward_fast(callid, hs->phone, IPC_GET_ARG2(*call), 0);
  216. }
  217.  
  218. /** Compute hash index into NS hash table.
  219.  *
  220.  * @param key Pointer keys. However, only the first key (i.e. service number)
  221.  *        is used to compute the hash index.
  222.  * @return Hash index corresponding to key[0].
  223.  */
  224. hash_index_t ns_hash(unsigned long *key)
  225. {
  226.     assert(key);
  227.     return *key % NS_HASH_TABLE_CHAINS;
  228. }
  229.  
  230. /** Compare a key with hashed item.
  231.  *
  232.  * This compare function always ignores the third key.
  233.  * It exists only to make it possible to remove records
  234.  * originating from connection with key[1] in_phone_hash
  235.  * value. Note that this is close to being classified
  236.  * as a nasty hack.
  237.  *
  238.  * @param key Array of keys.
  239.  * @param keys Must be lesser or equal to 3.
  240.  * @param item Pointer to a hash table item.
  241.  * @return Non-zero if the key matches the item, zero otherwise.
  242.  */
  243. int ns_compare(unsigned long key[], hash_count_t keys, link_t *item)
  244. {
  245.     hashed_service_t *hs;
  246.  
  247.     assert(key);
  248.     assert(keys <= 3);
  249.     assert(item);
  250.    
  251.     hs = hash_table_get_instance(item, hashed_service_t, link);
  252.    
  253.     if (keys == 2)
  254.         return key[1] == hs->in_phone_hash;
  255.     else
  256.         return key[0] == hs->service;
  257. }
  258.  
  259. /** Perform actions after removal of item from the hash table.
  260.  *
  261.  * @param item Item that was removed from the hash table.
  262.  */
  263. void ns_remove(link_t *item)
  264. {
  265.     assert(item);
  266.     free(hash_table_get_instance(item, hashed_service_t, link));
  267. }
  268.  
  269. /**
  270.  * @}
  271.  */
  272.