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