| 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_register.c
|
|---|
| 35 | * @brief
|
|---|
| 36 | */
|
|---|
| 37 |
|
|---|
| 38 | #include <ipc/services.h>
|
|---|
| 39 | #include <async.h>
|
|---|
| 40 | #include <fibril.h>
|
|---|
| 41 | #include <fibril_synch.h>
|
|---|
| 42 | #include <errno.h>
|
|---|
| 43 | #include <stdio.h>
|
|---|
| 44 | #include <stdlib.h>
|
|---|
| 45 | #include <str.h>
|
|---|
| 46 | #include <ctype.h>
|
|---|
| 47 | #include <bool.h>
|
|---|
| 48 | #include <adt/list.h>
|
|---|
| 49 | #include <as.h>
|
|---|
| 50 | #include <assert.h>
|
|---|
| 51 | #include <atomic.h>
|
|---|
| 52 | #include "vfs.h"
|
|---|
| 53 |
|
|---|
| 54 | FIBRIL_CONDVAR_INITIALIZE(fs_list_cv);
|
|---|
| 55 | FIBRIL_MUTEX_INITIALIZE(fs_list_lock);
|
|---|
| 56 | LIST_INITIALIZE(fs_list);
|
|---|
| 57 |
|
|---|
| 58 | atomic_t fs_handle_next = {
|
|---|
| 59 | .count = 1
|
|---|
| 60 | };
|
|---|
| 61 |
|
|---|
| 62 | /** Verify the VFS info structure.
|
|---|
| 63 | *
|
|---|
| 64 | * @param info Info structure to be verified.
|
|---|
| 65 | *
|
|---|
| 66 | * @return Non-zero if the info structure is sane, zero otherwise.
|
|---|
| 67 | *
|
|---|
| 68 | */
|
|---|
| 69 | static bool vfs_info_sane(vfs_info_t *info)
|
|---|
| 70 | {
|
|---|
| 71 | int i;
|
|---|
| 72 |
|
|---|
| 73 | /*
|
|---|
| 74 | * Check if the name is non-empty and is composed solely of ASCII
|
|---|
| 75 | * characters [a-z]+[a-z0-9_-]*.
|
|---|
| 76 | */
|
|---|
| 77 | if (!islower(info->name[0])) {
|
|---|
| 78 | dprintf("The name doesn't start with a lowercase character.\n");
|
|---|
| 79 | return false;
|
|---|
| 80 | }
|
|---|
| 81 |
|
|---|
| 82 | for (i = 1; i < FS_NAME_MAXLEN; i++) {
|
|---|
| 83 | if (!(islower(info->name[i]) || isdigit(info->name[i])) &&
|
|---|
| 84 | (info->name[i] != '-') && (info->name[i] != '_')) {
|
|---|
| 85 | if (info->name[i] == '\0') {
|
|---|
| 86 | break;
|
|---|
| 87 | } else {
|
|---|
| 88 | dprintf("The name contains illegal "
|
|---|
| 89 | "characters.\n");
|
|---|
| 90 | return false;
|
|---|
| 91 | }
|
|---|
| 92 | }
|
|---|
| 93 | }
|
|---|
| 94 |
|
|---|
| 95 | /*
|
|---|
| 96 | * This check is not redundant. It ensures that the name is
|
|---|
| 97 | * NULL-terminated, even if FS_NAME_MAXLEN characters are used.
|
|---|
| 98 | */
|
|---|
| 99 | if (info->name[i] != '\0') {
|
|---|
| 100 | dprintf("The name is not properly NULL-terminated.\n");
|
|---|
| 101 | return false;
|
|---|
| 102 | }
|
|---|
| 103 |
|
|---|
| 104 | return true;
|
|---|
| 105 | }
|
|---|
| 106 |
|
|---|
| 107 | /** VFS_REGISTER protocol function.
|
|---|
| 108 | *
|
|---|
| 109 | * @param rid Hash of the call with the request.
|
|---|
| 110 | * @param request Call structure with the request.
|
|---|
| 111 | *
|
|---|
| 112 | */
|
|---|
| 113 | void vfs_register(ipc_callid_t rid, ipc_call_t *request)
|
|---|
| 114 | {
|
|---|
| 115 | dprintf("Processing VFS_REGISTER request received from %p.\n",
|
|---|
| 116 | request->in_phone_hash);
|
|---|
| 117 |
|
|---|
| 118 | vfs_info_t *vfs_info;
|
|---|
| 119 | int rc = async_data_write_accept((void **) &vfs_info, false,
|
|---|
| 120 | sizeof(vfs_info_t), sizeof(vfs_info_t), 0, NULL);
|
|---|
| 121 |
|
|---|
| 122 | if (rc != EOK) {
|
|---|
| 123 | dprintf("Failed to deliver the VFS info into our AS, rc=%d.\n",
|
|---|
| 124 | rc);
|
|---|
| 125 | async_answer_0(rid, rc);
|
|---|
| 126 | return;
|
|---|
| 127 | }
|
|---|
| 128 |
|
|---|
| 129 | /*
|
|---|
| 130 | * Allocate and initialize a buffer for the fs_info structure.
|
|---|
| 131 | */
|
|---|
| 132 | fs_info_t *fs_info = (fs_info_t *) malloc(sizeof(fs_info_t));
|
|---|
| 133 | if (!fs_info) {
|
|---|
| 134 | dprintf("Could not allocate memory for FS info.\n");
|
|---|
| 135 | async_answer_0(rid, ENOMEM);
|
|---|
| 136 | return;
|
|---|
| 137 | }
|
|---|
| 138 |
|
|---|
| 139 | link_initialize(&fs_info->fs_link);
|
|---|
| 140 | fs_info->vfs_info = *vfs_info;
|
|---|
| 141 | free(vfs_info);
|
|---|
| 142 |
|
|---|
| 143 | dprintf("VFS info delivered.\n");
|
|---|
| 144 |
|
|---|
| 145 | if (!vfs_info_sane(&fs_info->vfs_info)) {
|
|---|
| 146 | free(fs_info);
|
|---|
| 147 | async_answer_0(rid, EINVAL);
|
|---|
| 148 | return;
|
|---|
| 149 | }
|
|---|
| 150 |
|
|---|
| 151 | fibril_mutex_lock(&fs_list_lock);
|
|---|
| 152 |
|
|---|
| 153 | /*
|
|---|
| 154 | * Check for duplicit registrations.
|
|---|
| 155 | */
|
|---|
| 156 | if (fs_name_to_handle(fs_info->vfs_info.name, false)) {
|
|---|
| 157 | /*
|
|---|
| 158 | * We already register a fs like this.
|
|---|
| 159 | */
|
|---|
| 160 | dprintf("FS is already registered.\n");
|
|---|
| 161 | fibril_mutex_unlock(&fs_list_lock);
|
|---|
| 162 | free(fs_info);
|
|---|
| 163 | async_answer_0(rid, EEXISTS);
|
|---|
| 164 | return;
|
|---|
| 165 | }
|
|---|
| 166 |
|
|---|
| 167 | /*
|
|---|
| 168 | * Add fs_info to the list of registered FS's.
|
|---|
| 169 | */
|
|---|
| 170 | dprintf("Inserting FS into the list of registered file systems.\n");
|
|---|
| 171 | list_append(&fs_info->fs_link, &fs_list);
|
|---|
| 172 |
|
|---|
| 173 | /*
|
|---|
| 174 | * Now we want the client to send us the IPC_M_CONNECT_TO_ME call so
|
|---|
| 175 | * that a callback connection is created and we have a phone through
|
|---|
| 176 | * which to forward VFS requests to it.
|
|---|
| 177 | */
|
|---|
| 178 | fs_info->sess = async_callback_receive(EXCHANGE_PARALLEL);
|
|---|
| 179 | if (!fs_info->sess) {
|
|---|
| 180 | dprintf("Callback connection expected\n");
|
|---|
| 181 | list_remove(&fs_info->fs_link);
|
|---|
| 182 | fibril_mutex_unlock(&fs_list_lock);
|
|---|
| 183 | free(fs_info);
|
|---|
| 184 | async_answer_0(rid, EINVAL);
|
|---|
| 185 | return;
|
|---|
| 186 | }
|
|---|
| 187 |
|
|---|
| 188 | dprintf("Callback connection to FS created.\n");
|
|---|
| 189 |
|
|---|
| 190 | /*
|
|---|
| 191 | * The client will want us to send him the address space area with PLB.
|
|---|
| 192 | */
|
|---|
| 193 |
|
|---|
| 194 | size_t size;
|
|---|
| 195 | ipc_callid_t callid;
|
|---|
| 196 | if (!async_share_in_receive(&callid, &size)) {
|
|---|
| 197 | dprintf("Unexpected call, method = %d\n", IPC_GET_IMETHOD(call));
|
|---|
| 198 | list_remove(&fs_info->fs_link);
|
|---|
| 199 | fibril_mutex_unlock(&fs_list_lock);
|
|---|
| 200 | async_hangup(fs_info->sess);
|
|---|
| 201 | free(fs_info);
|
|---|
| 202 | async_answer_0(callid, EINVAL);
|
|---|
| 203 | async_answer_0(rid, EINVAL);
|
|---|
| 204 | return;
|
|---|
| 205 | }
|
|---|
| 206 |
|
|---|
| 207 | /*
|
|---|
| 208 | * We can only send the client address space area PLB_SIZE bytes long.
|
|---|
| 209 | */
|
|---|
| 210 | if (size != PLB_SIZE) {
|
|---|
| 211 | dprintf("Client suggests wrong size of PFB, size = %d\n", size);
|
|---|
| 212 | list_remove(&fs_info->fs_link);
|
|---|
| 213 | fibril_mutex_unlock(&fs_list_lock);
|
|---|
| 214 | async_hangup(fs_info->sess);
|
|---|
| 215 | free(fs_info);
|
|---|
| 216 | async_answer_0(callid, EINVAL);
|
|---|
| 217 | async_answer_0(rid, EINVAL);
|
|---|
| 218 | return;
|
|---|
| 219 | }
|
|---|
| 220 |
|
|---|
| 221 | /*
|
|---|
| 222 | * Commit to read-only sharing the PLB with the client.
|
|---|
| 223 | */
|
|---|
| 224 | (void) async_share_in_finalize(callid, plb,
|
|---|
| 225 | AS_AREA_READ | AS_AREA_CACHEABLE);
|
|---|
| 226 |
|
|---|
| 227 | dprintf("Sharing PLB.\n");
|
|---|
| 228 |
|
|---|
| 229 | /*
|
|---|
| 230 | * That was it. The FS has been registered.
|
|---|
| 231 | * In reply to the VFS_REGISTER request, we assign the client file
|
|---|
| 232 | * system a global file system handle.
|
|---|
| 233 | */
|
|---|
| 234 | fs_info->fs_handle = (fs_handle_t) atomic_postinc(&fs_handle_next);
|
|---|
| 235 | async_answer_1(rid, EOK, (sysarg_t) fs_info->fs_handle);
|
|---|
| 236 |
|
|---|
| 237 | fibril_condvar_broadcast(&fs_list_cv);
|
|---|
| 238 | fibril_mutex_unlock(&fs_list_lock);
|
|---|
| 239 |
|
|---|
| 240 | dprintf("\"%.*s\" filesystem successfully registered, handle=%d.\n",
|
|---|
| 241 | FS_NAME_MAXLEN, fs_info->vfs_info.name, fs_info->fs_handle);
|
|---|
| 242 | }
|
|---|
| 243 |
|
|---|
| 244 | /** Begin an exchange for a given file system handle
|
|---|
| 245 | *
|
|---|
| 246 | * @param handle File system handle.
|
|---|
| 247 | *
|
|---|
| 248 | * @return Exchange for a multi-call request.
|
|---|
| 249 | * @return NULL if no such file exists.
|
|---|
| 250 | *
|
|---|
| 251 | */
|
|---|
| 252 | async_exch_t *vfs_exchange_grab(fs_handle_t handle)
|
|---|
| 253 | {
|
|---|
| 254 | /*
|
|---|
| 255 | * For now, we don't try to be very clever and very fast.
|
|---|
| 256 | * We simply lookup the session in fs_list and
|
|---|
| 257 | * begin an exchange.
|
|---|
| 258 | */
|
|---|
| 259 | fibril_mutex_lock(&fs_list_lock);
|
|---|
| 260 |
|
|---|
| 261 | list_foreach(fs_list, cur) {
|
|---|
| 262 | fs_info_t *fs = list_get_instance(cur, fs_info_t, fs_link);
|
|---|
| 263 |
|
|---|
| 264 | if (fs->fs_handle == handle) {
|
|---|
| 265 | fibril_mutex_unlock(&fs_list_lock);
|
|---|
| 266 |
|
|---|
| 267 | assert(fs->sess);
|
|---|
| 268 | async_exch_t *exch = async_exchange_begin(fs->sess);
|
|---|
| 269 |
|
|---|
| 270 | assert(exch);
|
|---|
| 271 | return exch;
|
|---|
| 272 | }
|
|---|
| 273 | }
|
|---|
| 274 |
|
|---|
| 275 | fibril_mutex_unlock(&fs_list_lock);
|
|---|
| 276 |
|
|---|
| 277 | return NULL;
|
|---|
| 278 | }
|
|---|
| 279 |
|
|---|
| 280 | /** End VFS server exchange.
|
|---|
| 281 | *
|
|---|
| 282 | * @param exch VFS server exchange.
|
|---|
| 283 | *
|
|---|
| 284 | */
|
|---|
| 285 | void vfs_exchange_release(async_exch_t *exch)
|
|---|
| 286 | {
|
|---|
| 287 | async_exchange_end(exch);
|
|---|
| 288 | }
|
|---|
| 289 |
|
|---|
| 290 | /** Convert file system name to its handle.
|
|---|
| 291 | *
|
|---|
| 292 | * @param name File system name.
|
|---|
| 293 | * @param lock If true, the function will lock and unlock the
|
|---|
| 294 | * fs_list_lock.
|
|---|
| 295 | *
|
|---|
| 296 | * @return File system handle or zero if file system not found.
|
|---|
| 297 | *
|
|---|
| 298 | */
|
|---|
| 299 | fs_handle_t fs_name_to_handle(char *name, bool lock)
|
|---|
| 300 | {
|
|---|
| 301 | int handle = 0;
|
|---|
| 302 |
|
|---|
| 303 | if (lock)
|
|---|
| 304 | fibril_mutex_lock(&fs_list_lock);
|
|---|
| 305 |
|
|---|
| 306 | list_foreach(fs_list, cur) {
|
|---|
| 307 | fs_info_t *fs = list_get_instance(cur, fs_info_t, fs_link);
|
|---|
| 308 | if (str_cmp(fs->vfs_info.name, name) == 0) {
|
|---|
| 309 | handle = fs->fs_handle;
|
|---|
| 310 | break;
|
|---|
| 311 | }
|
|---|
| 312 | }
|
|---|
| 313 |
|
|---|
| 314 | if (lock)
|
|---|
| 315 | fibril_mutex_unlock(&fs_list_lock);
|
|---|
| 316 |
|
|---|
| 317 | return handle;
|
|---|
| 318 | }
|
|---|
| 319 |
|
|---|
| 320 | /** Find the VFS info structure.
|
|---|
| 321 | *
|
|---|
| 322 | * @param handle FS handle for which the VFS info structure is sought.
|
|---|
| 323 | *
|
|---|
| 324 | * @return VFS info structure on success or NULL otherwise.
|
|---|
| 325 | *
|
|---|
| 326 | */
|
|---|
| 327 | vfs_info_t *fs_handle_to_info(fs_handle_t handle)
|
|---|
| 328 | {
|
|---|
| 329 | vfs_info_t *info = NULL;
|
|---|
| 330 |
|
|---|
| 331 | fibril_mutex_lock(&fs_list_lock);
|
|---|
| 332 | list_foreach(fs_list, cur) {
|
|---|
| 333 | fs_info_t *fs = list_get_instance(cur, fs_info_t, fs_link);
|
|---|
| 334 | if (fs->fs_handle == handle) {
|
|---|
| 335 | info = &fs->vfs_info;
|
|---|
| 336 | break;
|
|---|
| 337 | }
|
|---|
| 338 | }
|
|---|
| 339 | fibril_mutex_unlock(&fs_list_lock);
|
|---|
| 340 |
|
|---|
| 341 | return info;
|
|---|
| 342 | }
|
|---|
| 343 |
|
|---|
| 344 | /**
|
|---|
| 345 | * @}
|
|---|
| 346 | */
|
|---|