Subversion Repositories HelenOS

Rev

Rev 2523 | Rev 2527 | 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 multiplexer for HelenOS.
  36.  */
  37.  
  38. #include <ipc/ipc.h>
  39. #include <ipc/services.h>
  40. #include <async.h>
  41. #include <errno.h>
  42. #include <stdlib.h>
  43. #include <string.h>
  44. #include <ctype.h>
  45. #include <bool.h>
  46. #include <futex.h>
  47. #include <libadt/list.h>
  48. #include "vfs.h"
  49.  
  50. atomic_t fs_head_futex = FUTEX_INITIALIZER;
  51. link_t fs_head;
  52.  
  53. /** Verify the VFS info structure.
  54.  *
  55.  * @param info      Info structure to be verified.
  56.  *
  57.  * @return      Non-zero if the info structure is sane, zero otherwise.
  58.  */
  59. static bool vfs_info_sane(vfs_info_t *info)
  60. {
  61.     int i;
  62.  
  63.     /*
  64.      * Check if the name is non-empty and is composed solely of ASCII
  65.      * characters [a-z]+[a-z0-9_-]*.
  66.      */
  67.     if (!islower(info->name[0]))
  68.         return false;
  69.     for (i = 1; i < FS_NAME_MAXLEN; i++) {
  70.         if (!(islower(info->name[i]) || isdigit(info->name[i])) &&
  71.             (info->name[i] != '-') && (info->name[i] != '_')) {
  72.             if (info->name[i] == '\0')
  73.                 break;
  74.             else
  75.                 return false;
  76.         }
  77.     }
  78.    
  79.  
  80.     /*
  81.      * Check if the FS implements mandatory VFS operations.
  82.      */
  83.     if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_REGISTER)] != VFS_OP_DEFINED)
  84.         return false;
  85.     if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_MOUNT)] != VFS_OP_DEFINED)
  86.         return false;
  87.     if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_UNMOUNT)] != VFS_OP_DEFINED)
  88.         return false;
  89.     if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_OPEN)] != VFS_OP_DEFINED)
  90.         return false;
  91.     if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_CLOSE)] != VFS_OP_DEFINED)
  92.         return false;
  93.     if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_READ)] != VFS_OP_DEFINED)
  94.         return false;
  95.    
  96.     /*
  97.      * Check if each operation is either not defined, defined or default.
  98.      */
  99.     for (i = VFS_FIRST; i < VFS_LAST; i++) {
  100.         if ((IPC_METHOD_TO_VFS_OP(i) != VFS_OP_NULL) &&
  101.             (IPC_METHOD_TO_VFS_OP(i) != VFS_OP_DEFAULT) &&
  102.             (IPC_METHOD_TO_VFS_OP(i) != VFS_OP_DEFINED))
  103.             return false;  
  104.     }
  105.     return true;
  106. }
  107.  
  108. /** VFS_REGISTER protocol function.
  109.  *
  110.  * @param rid       Hash of the call with the request.
  111.  * @param request   Call structure with the request.
  112.  */
  113. static void vfs_register(ipc_callid_t rid, ipc_call_t *request)
  114. {
  115.     ipc_callid_t callid;
  116.     ipc_call_t call;
  117.     int rc;
  118.     size_t size;
  119.  
  120.     /*
  121.      * The first call has to be IPC_M_DATA_SEND in which we receive the
  122.      * VFS info structure from the client FS.
  123.      */
  124.     if (!ipc_data_send_accept(&callid, &call, NULL, &size)) {
  125.         /*
  126.          * The client doesn't obey the same protocol as we do.
  127.          */
  128.         ipc_answer_fast(callid, EINVAL, 0, 0);
  129.         ipc_answer_fast(rid, EINVAL, 0, 0);
  130.         return;
  131.     }
  132.    
  133.     /*
  134.      * We know the size of the VFS info structure. See if the client
  135.      * understands this easy concept too.
  136.      */
  137.     if (size != sizeof(vfs_info_t)) {
  138.         /*
  139.          * The client is sending us something, which cannot be
  140.          * the info structure.
  141.          */
  142.         ipc_answer_fast(callid, EINVAL, 0, 0);
  143.         ipc_answer_fast(rid, EINVAL, 0, 0);
  144.         return;
  145.     }
  146.     fs_info_t *fs_info;
  147.  
  148.     /*
  149.      * Allocate and initialize a buffer for the fs_info structure.
  150.      */
  151.     fs_info = (fs_info_t *) malloc(sizeof(fs_info_t));
  152.     if (!fs_info) {
  153.         ipc_answer_fast(callid, ENOMEM, 0, 0);
  154.         ipc_answer_fast(rid, ENOMEM, 0, 0);
  155.         return;
  156.     }
  157.     link_initialize(&fs_info->fs_link);
  158.        
  159.     rc = ipc_data_send_answer(callid, &call, &fs_info->vfs_info, size);
  160.     if (!rc) {
  161.         free(fs_info);
  162.         ipc_answer_fast(callid, rc, 0, 0);
  163.         ipc_answer_fast(rid, rc, 0, 0);
  164.         return;
  165.     }
  166.        
  167.     if (!vfs_info_sane(&fs_info->vfs_info)) {
  168.         free(fs_info);
  169.         ipc_answer_fast(callid, EINVAL, 0, 0);
  170.         ipc_answer_fast(rid, EINVAL, 0, 0);
  171.         return;
  172.     }
  173.        
  174.     futex_down(&fs_head_futex);
  175.  
  176.     /*
  177.      * Check for duplicit registrations.
  178.      */
  179.     link_t *cur;
  180.     for (cur = fs_head.next; cur != &fs_head; cur = cur->next) {
  181.         fs_info_t *fi = list_get_instance(cur, fs_info_t,
  182.             fs_link);
  183.         /* TODO: replace strcmp with strncmp once we have it */
  184.         if (strcmp(fs_info->vfs_info.name, fi->vfs_info.name) == 0) {
  185.             /*
  186.              * We already register a fs like this.
  187.              */
  188.             futex_up(&fs_head_futex);
  189.             free(fs_info);
  190.             ipc_answer_fast(callid, EEXISTS, 0, 0);
  191.             ipc_answer_fast(rid, EEXISTS, 0, 0);
  192.             return;
  193.         }
  194.     }
  195.    
  196.     /*
  197.      * TODO:
  198.      * 1. send the client the IPC_M_CONNECT_TO_ME call so that it makes a
  199.      *    callback connection.
  200.      * 2. add the fs_info into fs_head
  201.      */
  202.  
  203.     futex_up(&fs_head_futex);
  204. }
  205.  
  206. static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall)
  207. {
  208.     bool keep_on_going = 1;
  209.  
  210.     /*
  211.      * The connection was opened via the IPC_CONNECT_ME_TO call.
  212.      * This call needs to be answered.
  213.      */
  214.     ipc_answer_fast(iid, EOK, 0, 0);
  215.  
  216.     /*
  217.      * Here we enter the main connection fibril loop.
  218.      * The logic behind this loop and the protocol is that we'd like to keep
  219.      * each connection open for a while before we close it. The benefit of
  220.      * this is that the client doesn't have to establish a new connection
  221.      * upon each request.  On the other hand, the client must be ready to
  222.      * re-establish a connection if we hang it up due to reaching of maximum
  223.      * number of requests per connection or due to the client timing out.
  224.      */
  225.      
  226.     while (keep_on_going) {
  227.         ipc_callid_t callid;
  228.         ipc_call_t call;
  229.  
  230.         callid = async_get_call(&call);
  231.        
  232.         switch (IPC_GET_METHOD(call)) {
  233.         case IPC_M_PHONE_HUNGUP:
  234.             keep_on_going = false;
  235.             break;
  236.         case VFS_REGISTER:
  237.             vfs_register(callid, &call);
  238.             keep_on_going = false;
  239.             break;
  240.         case VFS_MOUNT:
  241.         case VFS_UNMOUNT:
  242.         case VFS_OPEN:
  243.         case VFS_CREATE:
  244.         case VFS_CLOSE:
  245.         case VFS_READ:
  246.         case VFS_WRITE:
  247.         case VFS_SEEK:
  248.         default:
  249.             ipc_answer_fast(callid, ENOTSUP, 0, 0);
  250.             break;
  251.         }
  252.     }
  253.  
  254.     /* TODO: cleanup after the client */
  255.    
  256. }
  257.  
  258. int main(int argc, char **argv)
  259. {
  260.     ipcarg_t phonead;
  261.  
  262.     list_initialize(&fs_head);
  263.     async_set_client_connection(vfs_connection);
  264.     ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, &phonead);
  265.     async_manager();
  266.     return 0;
  267. }
  268.  
  269. /**
  270.  * @}
  271.  */
  272.