Subversion Repositories HelenOS

Rev

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

  1. /*
  2.  * Copyright (c) 2008 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 <adt/list.h>
  47. #include <atomic.h>
  48. #include <assert.h>
  49. #include "vfs.h"
  50.  
  51. #define NAME "vfs"
  52.  
  53. static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall)
  54. {
  55.     bool keep_on_going = true;
  56.  
  57.     /*
  58.      * The connection was opened via the IPC_CONNECT_ME_TO call.
  59.      * This call needs to be answered.
  60.      */
  61.     ipc_answer_0(iid, EOK);
  62.    
  63.     /*
  64.      * Here we enter the main connection fibril loop.
  65.      * The logic behind this loop and the protocol is that we'd like to keep
  66.      * each connection open until the client hangs up. When the client hangs
  67.      * up, we will free its VFS state. The act of hanging up the connection
  68.      * by the client is equivalent to client termination because we cannot
  69.      * distinguish one from the other. On the other hand, the client can
  70.      * hang up arbitrarily if it has no open files and reestablish the
  71.      * connection later.
  72.      */
  73.     while (keep_on_going) {
  74.         ipc_call_t call;
  75.         ipc_callid_t callid = async_get_call(&call);
  76.        
  77.         fs_handle_t fs_handle;
  78.         int phone;
  79.        
  80.         switch (IPC_GET_METHOD(call)) {
  81.         case IPC_M_PHONE_HUNGUP:
  82.             keep_on_going = false;
  83.             break;
  84.         case VFS_REGISTER:
  85.             vfs_register(callid, &call);
  86.             keep_on_going = false;
  87.             break;
  88.         case VFS_MOUNT:
  89.             vfs_mount(callid, &call);
  90.             break;
  91.         case VFS_OPEN:
  92.             vfs_open(callid, &call);
  93.             break;
  94.         case VFS_OPEN_NODE:
  95.             vfs_open_node(callid, &call);
  96.             break;
  97.         case VFS_CLOSE:
  98.             vfs_close(callid, &call);
  99.             break;
  100.         case VFS_READ:
  101.             vfs_read(callid, &call);
  102.             break;
  103.         case VFS_WRITE:
  104.             vfs_write(callid, &call);
  105.             break;
  106.         case VFS_SEEK:
  107.             vfs_seek(callid, &call);
  108.             break;
  109.         case VFS_TRUNCATE:
  110.             vfs_truncate(callid, &call);
  111.             break;
  112.         case VFS_MKDIR:
  113.             vfs_mkdir(callid, &call);
  114.             break;
  115.         case VFS_UNLINK:
  116.             vfs_unlink(callid, &call);
  117.             break;
  118.         case VFS_RENAME:
  119.             vfs_rename(callid, &call);
  120.             break;
  121.         case VFS_DEVICE:
  122.             vfs_device(callid, &call);
  123.             break;
  124.         case VFS_SYNC:
  125.             vfs_sync(callid, &call);
  126.             break;
  127.         case VFS_NODE:
  128.             vfs_node(callid, &call);
  129.             break;
  130.         default:
  131.             ipc_answer_0(callid, ENOTSUP);
  132.             break;
  133.         }
  134.     }
  135.    
  136.     /* TODO: cleanup after the client */
  137. }
  138.  
  139. int main(int argc, char **argv)
  140. {
  141.     printf(NAME ": HelenOS VFS server\n");
  142.    
  143.     /*
  144.      * Initialize the list of registered file systems.
  145.      */
  146.     list_initialize(&fs_head);
  147.    
  148.     /*
  149.      * Initialize VFS node hash table.
  150.      */
  151.     if (!vfs_nodes_init()) {
  152.         printf(NAME ": Failed to initialize VFS node hash table\n");
  153.         return ENOMEM;
  154.     }
  155.    
  156.     /*
  157.      * Allocate and initialize the Path Lookup Buffer.
  158.      */
  159.     list_initialize(&plb_head);
  160.     plb = as_get_mappable_page(PLB_SIZE);
  161.     if (!plb) {
  162.         printf(NAME ": Cannot allocate a mappable piece of address space\n");
  163.         return ENOMEM;
  164.     }
  165.    
  166.     if (as_area_create(plb, PLB_SIZE, AS_AREA_READ | AS_AREA_WRITE |
  167.         AS_AREA_CACHEABLE) != plb) {
  168.         printf(NAME ": Cannot create address space area\n");
  169.         return ENOMEM;
  170.     }
  171.     memset(plb, 0, PLB_SIZE);
  172.    
  173.     /*
  174.      * Set a connection handling function/fibril.
  175.      */
  176.     async_set_client_connection(vfs_connection);
  177.  
  178.     /*
  179.      * Add a fibril for handling pending mounts.
  180.      */
  181.     fid_t fid = fibril_create(vfs_process_pending_mount, NULL);
  182.     assert(fid);
  183.     fibril_add_ready(fid);
  184.    
  185.     /*
  186.      * Register at the naming service.
  187.      */
  188.     ipcarg_t phonead;
  189.     ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead);
  190.    
  191.     /*
  192.      * Start accepting connections.
  193.      */
  194.     printf(NAME ": Accepting connections\n");
  195.     async_manager();
  196.     return 0;
  197. }
  198.  
  199. /**
  200.  * @}
  201.  */
  202.