Rev 4537 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 4419 | trochtova | 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 <atomic.h> |
||
| 47 | #include "vfs.h" |
||
| 48 | |||
| 49 | #define NAME "vfs" |
||
| 50 | |||
| 51 | static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall) |
||
| 52 | { |
||
| 53 | bool keep_on_going = true; |
||
| 4420 | trochtova | 54 | |
| 4419 | trochtova | 55 | /* |
| 56 | * The connection was opened via the IPC_CONNECT_ME_TO call. |
||
| 57 | * This call needs to be answered. |
||
| 58 | */ |
||
| 59 | ipc_answer_0(iid, EOK); |
||
| 60 | |||
| 61 | /* |
||
| 62 | * Here we enter the main connection fibril loop. |
||
| 63 | * The logic behind this loop and the protocol is that we'd like to keep |
||
| 64 | * each connection open until the client hangs up. When the client hangs |
||
| 65 | * up, we will free its VFS state. The act of hanging up the connection |
||
| 66 | * by the client is equivalent to client termination because we cannot |
||
| 67 | * distinguish one from the other. On the other hand, the client can |
||
| 68 | * hang up arbitrarily if it has no open files and reestablish the |
||
| 69 | * connection later. |
||
| 70 | */ |
||
| 71 | while (keep_on_going) { |
||
| 72 | ipc_call_t call; |
||
| 73 | ipc_callid_t callid = async_get_call(&call); |
||
| 74 | |||
| 75 | fs_handle_t fs_handle; |
||
| 76 | int phone; |
||
| 77 | |||
| 78 | switch (IPC_GET_METHOD(call)) { |
||
| 79 | case IPC_M_PHONE_HUNGUP: |
||
| 80 | keep_on_going = false; |
||
| 81 | break; |
||
| 4668 | trochtova | 82 | case VFS_IN_REGISTER: |
| 4419 | trochtova | 83 | vfs_register(callid, &call); |
| 4668 | trochtova | 84 | keep_on_going = false; |
| 4419 | trochtova | 85 | break; |
| 4668 | trochtova | 86 | case VFS_IN_MOUNT: |
| 4419 | trochtova | 87 | vfs_mount(callid, &call); |
| 88 | break; |
||
| 4668 | trochtova | 89 | case VFS_IN_OPEN: |
| 4419 | trochtova | 90 | vfs_open(callid, &call); |
| 91 | break; |
||
| 4668 | trochtova | 92 | case VFS_IN_OPEN_NODE: |
| 4537 | trochtova | 93 | vfs_open_node(callid, &call); |
| 94 | break; |
||
| 4668 | trochtova | 95 | case VFS_IN_CLOSE: |
| 4419 | trochtova | 96 | vfs_close(callid, &call); |
| 97 | break; |
||
| 4668 | trochtova | 98 | case VFS_IN_READ: |
| 4419 | trochtova | 99 | vfs_read(callid, &call); |
| 100 | break; |
||
| 4668 | trochtova | 101 | case VFS_IN_WRITE: |
| 4419 | trochtova | 102 | vfs_write(callid, &call); |
| 103 | break; |
||
| 4668 | trochtova | 104 | case VFS_IN_SEEK: |
| 4419 | trochtova | 105 | vfs_seek(callid, &call); |
| 106 | break; |
||
| 4668 | trochtova | 107 | case VFS_IN_TRUNCATE: |
| 4419 | trochtova | 108 | vfs_truncate(callid, &call); |
| 109 | break; |
||
| 4668 | trochtova | 110 | case VFS_IN_FSTAT: |
| 111 | vfs_fstat(callid, &call); |
||
| 112 | break; |
||
| 113 | case VFS_IN_STAT: |
||
| 114 | vfs_stat(callid, &call); |
||
| 115 | break; |
||
| 116 | case VFS_IN_MKDIR: |
||
| 4419 | trochtova | 117 | vfs_mkdir(callid, &call); |
| 118 | break; |
||
| 4668 | trochtova | 119 | case VFS_IN_UNLINK: |
| 4419 | trochtova | 120 | vfs_unlink(callid, &call); |
| 121 | break; |
||
| 4668 | trochtova | 122 | case VFS_IN_RENAME: |
| 4419 | trochtova | 123 | vfs_rename(callid, &call); |
| 124 | break; |
||
| 4668 | trochtova | 125 | case VFS_IN_SYNC: |
| 4537 | trochtova | 126 | vfs_sync(callid, &call); |
| 127 | break; |
||
| 4419 | trochtova | 128 | default: |
| 129 | ipc_answer_0(callid, ENOTSUP); |
||
| 130 | break; |
||
| 131 | } |
||
| 132 | } |
||
| 133 | |||
| 134 | /* TODO: cleanup after the client */ |
||
| 135 | } |
||
| 136 | |||
| 137 | int main(int argc, char **argv) |
||
| 138 | { |
||
| 139 | printf(NAME ": HelenOS VFS server\n"); |
||
| 140 | |||
| 141 | /* |
||
| 142 | * Initialize VFS node hash table. |
||
| 143 | */ |
||
| 144 | if (!vfs_nodes_init()) { |
||
| 145 | printf(NAME ": Failed to initialize VFS node hash table\n"); |
||
| 146 | return ENOMEM; |
||
| 147 | } |
||
| 148 | |||
| 149 | /* |
||
| 150 | * Allocate and initialize the Path Lookup Buffer. |
||
| 151 | */ |
||
| 152 | plb = as_get_mappable_page(PLB_SIZE); |
||
| 153 | if (!plb) { |
||
| 154 | printf(NAME ": Cannot allocate a mappable piece of address space\n"); |
||
| 155 | return ENOMEM; |
||
| 156 | } |
||
| 157 | |||
| 158 | if (as_area_create(plb, PLB_SIZE, AS_AREA_READ | AS_AREA_WRITE | |
||
| 159 | AS_AREA_CACHEABLE) != plb) { |
||
| 160 | printf(NAME ": Cannot create address space area\n"); |
||
| 161 | return ENOMEM; |
||
| 162 | } |
||
| 163 | memset(plb, 0, PLB_SIZE); |
||
| 164 | |||
| 165 | /* |
||
| 4668 | trochtova | 166 | * Set a connection handling function/fibril. |
| 4419 | trochtova | 167 | */ |
| 168 | async_set_client_connection(vfs_connection); |
||
| 4668 | trochtova | 169 | |
| 4419 | trochtova | 170 | /* |
| 171 | * Register at the naming service. |
||
| 172 | */ |
||
| 173 | ipcarg_t phonead; |
||
| 174 | ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead); |
||
| 175 | |||
| 176 | /* |
||
| 177 | * Start accepting connections. |
||
| 178 | */ |
||
| 179 | printf(NAME ": Accepting connections\n"); |
||
| 180 | async_manager(); |
||
| 181 | return 0; |
||
| 182 | } |
||
| 183 | |||
| 184 | /** |
||
| 185 | * @} |
||
| 186 | */ |