Rev 4341 | Rev 4348 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 4341 | Rev 4345 | ||
---|---|---|---|
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 VFS_MOUNTED: |
99 | case VFS_MOUNTED: |
100 | tmpfs_mounted(callid, &call); |
100 | tmpfs_mounted(callid, &call); |
101 | break; |
101 | break; |
102 | case VFS_MOUNT: |
102 | case VFS_MOUNT: |
103 | tmpfs_mount(callid, &call); |
103 | tmpfs_mount(callid, &call); |
104 | break; |
104 | break; |
105 | case VFS_LOOKUP: |
105 | case VFS_LOOKUP: |
106 | tmpfs_lookup(callid, &call); |
106 | tmpfs_lookup(callid, &call); |
107 | break; |
107 | break; |
108 | case VFS_READ: |
108 | case VFS_READ: |
109 | tmpfs_read(callid, &call); |
109 | tmpfs_read(callid, &call); |
110 | break; |
110 | break; |
111 | case VFS_WRITE: |
111 | case VFS_WRITE: |
112 | tmpfs_write(callid, &call); |
112 | tmpfs_write(callid, &call); |
113 | break; |
113 | break; |
114 | case VFS_TRUNCATE: |
114 | case VFS_TRUNCATE: |
115 | tmpfs_truncate(callid, &call); |
115 | tmpfs_truncate(callid, &call); |
116 | break; |
116 | break; |
117 | case VFS_DESTROY: |
117 | case VFS_DESTROY: |
118 | tmpfs_destroy(callid, &call); |
118 | tmpfs_destroy(callid, &call); |
119 | break; |
119 | break; |
120 | default: |
120 | default: |
121 | ipc_answer_0(callid, ENOTSUP); |
121 | ipc_answer_0(callid, ENOTSUP); |
122 | break; |
122 | break; |
123 | } |
123 | } |
124 | } |
124 | } |
125 | } |
125 | } |
126 | 126 | ||
127 | int main(int argc, char **argv) |
127 | int main(int argc, char **argv) |
128 | { |
128 | { |
129 | int vfs_phone; |
- | |
130 | - | ||
131 | printf(NAME ": HelenOS TMPFS file system server\n"); |
129 | printf(NAME ": HelenOS TMPFS file system server\n"); |
132 | 130 | ||
133 | vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0); |
131 | int vfs_phone = ipc_connect_me_to_blocking(PHONE_NS, SERVICE_VFS, 0, 0); |
134 | while (vfs_phone < EOK) { |
132 | if (vfs_phone < EOK) { |
- | 133 | printf(NAME ": Unable to connect to VFS\n"); |
|
135 | usleep(10000); |
134 | return -1; |
136 | vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0); |
- | |
137 | } |
135 | } |
138 | 136 | ||
139 | int rc; |
- | |
140 | rc = fs_register(vfs_phone, &tmpfs_reg, &tmpfs_vfs_info, |
137 | int rc = fs_register(vfs_phone, &tmpfs_reg, &tmpfs_vfs_info, |
141 | tmpfs_connection); |
138 | tmpfs_connection); |
142 | if (rc != EOK) { |
139 | if (rc != EOK) { |
143 | printf(NAME ": Failed to register file system (%d)\n", rc); |
140 | printf(NAME ": Failed to register file system (%d)\n", rc); |
144 | return rc; |
141 | return rc; |
145 | } |
142 | } |
146 | 143 | ||
147 | printf(NAME ": Accepting connections\n"); |
144 | printf(NAME ": Accepting connections\n"); |
148 | async_manager(); |
145 | async_manager(); |
149 | /* not reached */ |
146 | /* not reached */ |
150 | return 0; |
147 | return 0; |
151 | } |
148 | } |
152 | 149 | ||
153 | /** |
150 | /** |
154 | * @} |
151 | * @} |
155 | */ |
152 | */ |
156 | 153 |