Subversion Repositories HelenOS

Rev

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

  1. /*
  2.  * Copyright (c) 2007 Jakub Jermar
  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 fs
  30.  * @{
  31.  */
  32.  
  33. /**
  34.  * @file    vfs.c
  35.  * @brief   VFS service for HelenOS.
  36.  */
  37.  
  38. #include <ipc/ipc.h>
  39. #include <ipc/services.h>
  40. #include <async.h>
  41. #include <errno.h>
  42. #include <stdio.h>
  43. #include <bool.h>
  44. #include <string.h>
  45. #include <as.h>
  46. #include <libadt/list.h>
  47. #include <atomic.h>
  48. #include "vfs.h"
  49.  
  50. #define dprintf(...)    printf(__VA_ARGS__)
  51.  
  52. static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall)
  53. {
  54.     bool keep_on_going = 1;
  55.  
  56.     printf("Connection opened from %p\n", icall->in_phone_hash);
  57.  
  58.     /*
  59.      * The connection was opened via the IPC_CONNECT_ME_TO call.
  60.      * This call needs to be answered.
  61.      */
  62.     ipc_answer_0(iid, EOK);
  63.  
  64.     /*
  65.      * Here we enter the main connection fibril loop.
  66.      * The logic behind this loop and the protocol is that we'd like to keep
  67.      * each connection open until the client hangs up. When the client hangs
  68.      * up, we will free its VFS state. The act of hanging up the connection
  69.      * by the client is equivalent to client termination because we cannot
  70.      * distinguish one from the other. On the other hand, the client can
  71.      * hang up arbitrarily if it has no open files and reestablish the
  72.      * connection later.
  73.      */
  74.     while (keep_on_going) {
  75.         ipc_callid_t callid;
  76.         ipc_call_t call;
  77.  
  78.         callid = async_get_call(&call);
  79.  
  80.         printf("Received call, method=%d\n", IPC_GET_METHOD(call));
  81.        
  82.         switch (IPC_GET_METHOD(call)) {
  83.         case IPC_M_PHONE_HUNGUP:
  84.             keep_on_going = false;
  85.             break;
  86.         case VFS_REGISTER:
  87.             vfs_register(callid, &call);
  88.             keep_on_going = false;
  89.             break;
  90.         case VFS_MOUNT:
  91.             vfs_mount(callid, &call);
  92.             keep_on_going = false;
  93.             break;
  94.         case VFS_OPEN:
  95.             vfs_open(callid, &call);
  96.             break;
  97.         case VFS_READ:
  98.             vfs_read(callid, &call);
  99.             break;
  100.         case VFS_UNMOUNT:
  101.         case VFS_CREATE:
  102.         case VFS_CLOSE:
  103.         case VFS_WRITE:
  104.         case VFS_SEEK:
  105.         case VFS_UNLINK:
  106.         case VFS_RENAME:
  107.         default:
  108.             ipc_answer_0(callid, ENOTSUP);
  109.             break;
  110.         }
  111.     }
  112.  
  113.     /* TODO: cleanup after the client */
  114.    
  115. }
  116.  
  117. int main(int argc, char **argv)
  118. {
  119.     ipcarg_t phonead;
  120.  
  121.     printf("VFS: HelenOS VFS server\n");
  122.  
  123.     /*
  124.      * Initialize the list of registered file systems.
  125.      */
  126.     list_initialize(&fs_head);
  127.  
  128.     /*
  129.      * Initialize VFS node hash table.
  130.      */
  131.     if (!vfs_nodes_init()) {
  132.         printf("Failed to initialize the VFS node hash table.\n");
  133.         return ENOMEM;
  134.     }
  135.  
  136.     /*
  137.      * Allocate and initialize the Path Lookup Buffer.
  138.      */
  139.     list_initialize(&plb_head);
  140.     plb = as_get_mappable_page(PLB_SIZE);
  141.     if (!plb) {
  142.         printf("Cannot allocate a mappable piece of address space\n");
  143.         return ENOMEM;
  144.     }
  145.     if (as_area_create(plb, PLB_SIZE, AS_AREA_READ | AS_AREA_WRITE |
  146.         AS_AREA_CACHEABLE) != plb) {
  147.         printf("Cannot create address space area.\n");
  148.         return ENOMEM;
  149.     }
  150.     memset(plb, 0, PLB_SIZE);
  151.    
  152.     /*
  153.      * Set a connectio handling function/fibril.
  154.      */
  155.     async_set_client_connection(vfs_connection);
  156.  
  157.     /*
  158.      * Register at the naming service.
  159.      */
  160.     ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead);
  161.  
  162.     /*
  163.      * Start accepting connections.
  164.      */
  165.     async_manager();
  166.     return 0;
  167. }
  168.  
  169. /**
  170.  * @}
  171.  */
  172.