[c2eef61c] | 1 | /*
|
---|
| 2 | * Copyright (c) 2006 Martin Decky
|
---|
| 3 | * Copyright (c) 2008 Jakub Jermar
|
---|
| 4 | * Copyright (c) 2011 Maurizio Lombardi
|
---|
| 5 | * All rights reserved.
|
---|
| 6 | *
|
---|
| 7 | * Redistribution and use in source and binary forms, with or without
|
---|
| 8 | * modification, are permitted provided that the following conditions
|
---|
| 9 | * are met:
|
---|
| 10 | *
|
---|
| 11 | * - Redistributions of source code must retain the above copyright
|
---|
| 12 | * notice, this list of conditions and the following disclaimer.
|
---|
| 13 | * - Redistributions in binary form must reproduce the above copyright
|
---|
| 14 | * notice, this list of conditions and the following disclaimer in the
|
---|
| 15 | * documentation and/or other materials provided with the distribution.
|
---|
| 16 | * - The name of the author may not be used to endorse or promote products
|
---|
| 17 | * derived from this software without specific prior written permission.
|
---|
| 18 | *
|
---|
| 19 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
| 20 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
| 21 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
| 22 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
| 23 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
| 24 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
| 25 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
| 26 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
| 27 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
| 28 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
| 29 | */
|
---|
| 30 |
|
---|
| 31 | /** @addtogroup fs
|
---|
| 32 | * @{
|
---|
| 33 | */
|
---|
| 34 |
|
---|
| 35 | /**
|
---|
| 36 | * @file mfs.c
|
---|
| 37 | * @brief Minix file system driver for HelenOS.
|
---|
| 38 | */
|
---|
| 39 |
|
---|
| 40 | #include <ipc/services.h>
|
---|
| 41 | #include <ipc/ns.h>
|
---|
| 42 | #include <async.h>
|
---|
| 43 | #include <errno.h>
|
---|
| 44 | #include <unistd.h>
|
---|
| 45 | #include <task.h>
|
---|
| 46 | #include <stdio.h>
|
---|
| 47 | #include <libfs.h>
|
---|
[7413683] | 48 | #include "mfs.h"
|
---|
[c2eef61c] | 49 |
|
---|
| 50 | #define NAME "mfs"
|
---|
| 51 |
|
---|
| 52 | vfs_info_t mfs_vfs_info = {
|
---|
| 53 | .name = NAME,
|
---|
| 54 | .concurrent_read_write = false,
|
---|
| 55 | .write_retains_size = false,
|
---|
| 56 | };
|
---|
| 57 |
|
---|
| 58 | fs_reg_t mfs_reg;
|
---|
| 59 |
|
---|
[7de65cd] | 60 |
|
---|
| 61 |
|
---|
| 62 | /**
|
---|
| 63 | * This connection fibril processes VFS requests from VFS.
|
---|
| 64 | *
|
---|
| 65 | * In order to support simultaneous VFS requests, our design is as follows.
|
---|
| 66 | * The connection fibril accepts VFS requests from VFS. If there is only one
|
---|
| 67 | * instance of the fibril, VFS will need to serialize all VFS requests it sends
|
---|
[fd7f329a] | 68 | * to MinixFS. To overcome this bottleneck, VFS can send MinixFS the IPC_M_CONNECT_ME_TO
|
---|
[7de65cd] | 69 | * call. In that case, a new connection fibril will be created, which in turn
|
---|
| 70 | * will accept the call. Thus, a new phone will be opened for VFS.
|
---|
| 71 | *
|
---|
| 72 | * There are few issues with this arrangement. First, VFS can run out of
|
---|
| 73 | * available phones. In that case, VFS can close some other phones or use one
|
---|
[fd7f329a] | 74 | * phone for more serialized requests. Similarily, MinixFS can refuse to duplicate
|
---|
[7de65cd] | 75 | * the connection. VFS should then just make use of already existing phones and
|
---|
| 76 | * route its requests through them. To avoid paying the fibril creation price
|
---|
[fd7f329a] | 77 | * upon each request, MinixFS might want to keep the connections open after the
|
---|
[7de65cd] | 78 | * request has been completed.
|
---|
| 79 | */
|
---|
| 80 |
|
---|
| 81 | static void mfs_connection(ipc_callid_t iid, ipc_call_t *icall)
|
---|
| 82 | {
|
---|
| 83 | if (iid) {
|
---|
| 84 | /*
|
---|
| 85 | * This only happens for connections opened by
|
---|
| 86 | * IPC_M_CONNECT_ME_TO calls as opposed to callback connections
|
---|
| 87 | * created by IPC_M_CONNECT_TO_ME.
|
---|
| 88 | */
|
---|
| 89 | async_answer_0(iid, EOK);
|
---|
| 90 | }
|
---|
| 91 |
|
---|
| 92 | printf(NAME ": connection opened\n");
|
---|
| 93 | while (1) {
|
---|
| 94 | ipc_callid_t callid;
|
---|
| 95 | ipc_call_t call;
|
---|
| 96 |
|
---|
| 97 | callid = async_get_call(&call);
|
---|
| 98 | switch (IPC_GET_IMETHOD(call)) {
|
---|
| 99 | default:
|
---|
| 100 | case IPC_M_PHONE_HUNGUP:
|
---|
[8ceba1e] | 101 | return;
|
---|
| 102 | case VFS_OUT_MOUNTED:
|
---|
| 103 | mfs_mounted(callid, &call);
|
---|
| 104 | break;
|
---|
[7de65cd] | 105 | }
|
---|
| 106 | }
|
---|
| 107 | }
|
---|
| 108 |
|
---|
| 109 |
|
---|
[c2eef61c] | 110 | int main(int argc, char **argv)
|
---|
| 111 | {
|
---|
[7de65cd] | 112 | int vfs_phone;
|
---|
| 113 | int rc;
|
---|
| 114 |
|
---|
[c2eef61c] | 115 | printf(NAME ": HelenOS Minix file system server\n");
|
---|
[7de65cd] | 116 |
|
---|
| 117 | vfs_phone = service_connect_blocking(SERVICE_VFS, 0, 0);
|
---|
| 118 |
|
---|
| 119 | if (vfs_phone < EOK) {
|
---|
| 120 | printf(NAME ": failed to connect to VFS\n");
|
---|
| 121 | return -1;
|
---|
| 122 | }
|
---|
| 123 |
|
---|
| 124 | rc = fs_register(vfs_phone, &mfs_reg, &mfs_vfs_info, mfs_connection);
|
---|
| 125 | if (rc != EOK)
|
---|
| 126 | goto err;
|
---|
[f6d4462] | 127 |
|
---|
| 128 | printf(NAME ": Accepting connections\n");
|
---|
| 129 | task_retval(0);
|
---|
| 130 | async_manager();
|
---|
[fd7f329a] | 131 | /* not reached */
|
---|
[c2eef61c] | 132 | return 0;
|
---|
[7de65cd] | 133 |
|
---|
| 134 | err:
|
---|
| 135 | printf(NAME ": Failed to register file system (%d)\n", rc);
|
---|
| 136 | return rc;
|
---|
[c2eef61c] | 137 | }
|
---|
| 138 |
|
---|
| 139 | /**
|
---|
| 140 | * @}
|
---|
| 141 | */
|
---|
| 142 |
|
---|