source: mainline/uspace/srv/fs/tmpfs/tmpfs.c@ 5581b469

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 5581b469 was 5581b469, checked in by Jakub Jermar <jakub@…>, 15 years ago

Introduce new boolean properties into vfs_info_t.

The FS can set concurrent_read_write to true if it is ready to handle
concurrent reads and writes from/to one node.

The FS can set write_retains_size if its write method never modifies the
size of the node.

  • Property mode set to 100644
File size: 5.1 KB
Line 
1/*
2 * Copyright (c) 2006 Martin Decky
3 * Copyright (c) 2008 Jakub Jermar
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 *
10 * - Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * - Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * - The name of the author may not be used to endorse or promote products
16 * derived from this software without specific prior written permission.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 */
29
30/** @addtogroup fs
31 * @{
32 */
33
34/**
35 * @file tmpfs.c
36 * @brief File system driver for in-memory file system.
37 *
38 * Every instance of tmpfs exists purely in memory and has neither a disk layout
39 * nor any permanent storage (e.g. disk blocks). With each system reboot, data
40 * stored in a tmpfs file system is lost.
41 */
42
43#include "tmpfs.h"
44#include <ipc/ipc.h>
45#include <ipc/services.h>
46#include <async.h>
47#include <errno.h>
48#include <unistd.h>
49#include <stdio.h>
50#include <task.h>
51#include <libfs.h>
52#include "../../vfs/vfs.h"
53
54#define NAME "tmpfs"
55
56
57vfs_info_t tmpfs_vfs_info = {
58 .name = NAME,
59 .concurrent_read_write = false,
60 .write_retains_size = false,
61};
62
63fs_reg_t tmpfs_reg;
64
65/**
66 * This connection fibril processes VFS requests from VFS.
67 *
68 * In order to support simultaneous VFS requests, our design is as follows.
69 * The connection fibril accepts VFS requests from VFS. If there is only one
70 * instance of the fibril, VFS will need to serialize all VFS requests it sends
71 * to FAT. To overcome this bottleneck, VFS can send TMPFS the
72 * IPC_M_CONNECT_ME_TO call. In that case, a new connection fibril will be
73 * created, which in turn will accept the call. Thus, a new phone will be
74 * opened for VFS.
75 *
76 * There are few issues with this arrangement. First, VFS can run out of
77 * available phones. In that case, VFS can close some other phones or use one
78 * phone for more serialized requests. Similarily, TMPFS can refuse to duplicate
79 * the connection. VFS should then just make use of already existing phones and
80 * route its requests through them. To avoid paying the fibril creation price
81 * upon each request, TMPFS might want to keep the connections open after the
82 * request has been completed.
83 */
84static void tmpfs_connection(ipc_callid_t iid, ipc_call_t *icall)
85{
86 if (iid) {
87 /*
88 * This only happens for connections opened by
89 * IPC_M_CONNECT_ME_TO calls as opposed to callback connections
90 * created by IPC_M_CONNECT_TO_ME.
91 */
92 ipc_answer_0(iid, EOK);
93 }
94
95 dprintf(NAME ": connection opened\n");
96 while (1) {
97 ipc_callid_t callid;
98 ipc_call_t call;
99
100 callid = async_get_call(&call);
101 switch (IPC_GET_METHOD(call)) {
102 case IPC_M_PHONE_HUNGUP:
103 return;
104 case VFS_OUT_MOUNTED:
105 tmpfs_mounted(callid, &call);
106 break;
107 case VFS_OUT_MOUNT:
108 tmpfs_mount(callid, &call);
109 break;
110 case VFS_OUT_UNMOUNTED:
111 tmpfs_unmounted(callid, &call);
112 break;
113 case VFS_OUT_UNMOUNT:
114 tmpfs_unmount(callid, &call);
115 break;
116 case VFS_OUT_LOOKUP:
117 tmpfs_lookup(callid, &call);
118 break;
119 case VFS_OUT_READ:
120 tmpfs_read(callid, &call);
121 break;
122 case VFS_OUT_WRITE:
123 tmpfs_write(callid, &call);
124 break;
125 case VFS_OUT_TRUNCATE:
126 tmpfs_truncate(callid, &call);
127 break;
128 case VFS_OUT_CLOSE:
129 tmpfs_close(callid, &call);
130 break;
131 case VFS_OUT_DESTROY:
132 tmpfs_destroy(callid, &call);
133 break;
134 case VFS_OUT_OPEN_NODE:
135 tmpfs_open_node(callid, &call);
136 break;
137 case VFS_OUT_STAT:
138 tmpfs_stat(callid, &call);
139 break;
140 case VFS_OUT_SYNC:
141 tmpfs_sync(callid, &call);
142 break;
143 default:
144 ipc_answer_0(callid, ENOTSUP);
145 break;
146 }
147 }
148}
149
150int main(int argc, char **argv)
151{
152 printf(NAME ": HelenOS TMPFS file system server\n");
153
154 if (!tmpfs_init()) {
155 printf(NAME ": failed to initialize TMPFS\n");
156 return -1;
157 }
158
159 int vfs_phone = ipc_connect_me_to_blocking(PHONE_NS, SERVICE_VFS, 0, 0);
160 if (vfs_phone < EOK) {
161 printf(NAME ": Unable to connect to VFS\n");
162 return -1;
163 }
164
165 int rc = fs_register(vfs_phone, &tmpfs_reg, &tmpfs_vfs_info,
166 tmpfs_connection);
167 if (rc != EOK) {
168 printf(NAME ": Failed to register file system (%d)\n", rc);
169 return rc;
170 }
171
172 printf(NAME ": Accepting connections\n");
173 task_retval(0);
174 async_manager();
175 /* not reached */
176 return 0;
177}
178
179/**
180 * @}
181 */
Note: See TracBrowser for help on using the repository browser.