Subversion Repositories HelenOS

Rev

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