Rev 4345 | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 4345 | Rev 4691 | ||
---|---|---|---|
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 fat.c |
35 | * @file fat.c |
36 | * @brief FAT file system driver for HelenOS. |
36 | * @brief FAT file system driver for HelenOS. |
37 | */ |
37 | */ |
38 | 38 | ||
39 | #include "fat.h" |
39 | #include "fat.h" |
40 | #include <ipc/ipc.h> |
40 | #include <ipc/ipc.h> |
41 | #include <ipc/services.h> |
41 | #include <ipc/services.h> |
42 | #include <async.h> |
42 | #include <async.h> |
43 | #include <errno.h> |
43 | #include <errno.h> |
44 | #include <unistd.h> |
44 | #include <unistd.h> |
45 | #include <stdio.h> |
45 | #include <stdio.h> |
46 | #include <libfs.h> |
46 | #include <libfs.h> |
47 | #include "../../vfs/vfs.h" |
47 | #include "../../vfs/vfs.h" |
48 | 48 | ||
49 | 49 | ||
50 | vfs_info_t fat_vfs_info = { |
50 | vfs_info_t fat_vfs_info = { |
51 | .name = "fat", |
51 | .name = "fat", |
52 | }; |
52 | }; |
53 | 53 | ||
54 | fs_reg_t fat_reg; |
54 | fs_reg_t fat_reg; |
55 | 55 | ||
56 | /** |
56 | /** |
57 | * This connection fibril processes VFS requests from VFS. |
57 | * This connection fibril processes VFS requests from VFS. |
58 | * |
58 | * |
59 | * In order to support simultaneous VFS requests, our design is as follows. |
59 | * In order to support simultaneous VFS requests, our design is as follows. |
60 | * The connection fibril accepts VFS requests from VFS. If there is only one |
60 | * The connection fibril accepts VFS requests from VFS. If there is only one |
61 | * instance of the fibril, VFS will need to serialize all VFS requests it sends |
61 | * instance of the fibril, VFS will need to serialize all VFS requests it sends |
62 | * to FAT. To overcome this bottleneck, VFS can send FAT the IPC_M_CONNECT_ME_TO |
62 | * to FAT. To overcome this bottleneck, VFS can send FAT the IPC_M_CONNECT_ME_TO |
63 | * call. In that case, a new connection fibril will be created, which in turn |
63 | * call. In that case, a new connection fibril will be created, which in turn |
64 | * will accept the call. Thus, a new phone will be opened for VFS. |
64 | * will accept the call. Thus, a new phone will be opened for VFS. |
65 | * |
65 | * |
66 | * There are few issues with this arrangement. First, VFS can run out of |
66 | * There are few issues with this arrangement. First, VFS can run out of |
67 | * available phones. In that case, VFS can close some other phones or use one |
67 | * available phones. In that case, VFS can close some other phones or use one |
68 | * phone for more serialized requests. Similarily, FAT can refuse to duplicate |
68 | * phone for more serialized requests. Similarily, FAT can refuse to duplicate |
69 | * the connection. VFS should then just make use of already existing phones and |
69 | * the connection. VFS should then just make use of already existing phones and |
70 | * route its requests through them. To avoid paying the fibril creation price |
70 | * route its requests through them. To avoid paying the fibril creation price |
71 | * upon each request, FAT might want to keep the connections open after the |
71 | * upon each request, FAT might want to keep the connections open after the |
72 | * request has been completed. |
72 | * request has been completed. |
73 | */ |
73 | */ |
74 | static void fat_connection(ipc_callid_t iid, ipc_call_t *icall) |
74 | static void fat_connection(ipc_callid_t iid, ipc_call_t *icall) |
75 | { |
75 | { |
76 | if (iid) { |
76 | if (iid) { |
77 | /* |
77 | /* |
78 | * This only happens for connections opened by |
78 | * This only happens for connections opened by |
79 | * IPC_M_CONNECT_ME_TO calls as opposed to callback connections |
79 | * IPC_M_CONNECT_ME_TO calls as opposed to callback connections |
80 | * created by IPC_M_CONNECT_TO_ME. |
80 | * created by IPC_M_CONNECT_TO_ME. |
81 | */ |
81 | */ |
82 | ipc_answer_0(iid, EOK); |
82 | ipc_answer_0(iid, EOK); |
83 | } |
83 | } |
84 | 84 | ||
85 | dprintf("VFS-FAT connection established.\n"); |
85 | dprintf("VFS-FAT connection established.\n"); |
86 | while (1) { |
86 | while (1) { |
87 | ipc_callid_t callid; |
87 | ipc_callid_t callid; |
88 | ipc_call_t call; |
88 | ipc_call_t call; |
89 | 89 | ||
90 | callid = async_get_call(&call); |
90 | callid = async_get_call(&call); |
91 | switch (IPC_GET_METHOD(call)) { |
91 | switch (IPC_GET_METHOD(call)) { |
- | 92 | case IPC_M_PHONE_HUNGUP: |
|
- | 93 | return; |
|
92 | case VFS_MOUNTED: |
94 | case VFS_OUT_MOUNTED: |
93 | fat_mounted(callid, &call); |
95 | fat_mounted(callid, &call); |
94 | break; |
96 | break; |
95 | case VFS_MOUNT: |
97 | case VFS_OUT_MOUNT: |
96 | fat_mount(callid, &call); |
98 | fat_mount(callid, &call); |
97 | break; |
99 | break; |
98 | case VFS_LOOKUP: |
100 | case VFS_OUT_LOOKUP: |
99 | fat_lookup(callid, &call); |
101 | fat_lookup(callid, &call); |
100 | break; |
102 | break; |
101 | case VFS_READ: |
103 | case VFS_OUT_READ: |
102 | fat_read(callid, &call); |
104 | fat_read(callid, &call); |
103 | break; |
105 | break; |
104 | case VFS_WRITE: |
106 | case VFS_OUT_WRITE: |
105 | fat_write(callid, &call); |
107 | fat_write(callid, &call); |
106 | break; |
108 | break; |
107 | case VFS_TRUNCATE: |
109 | case VFS_OUT_TRUNCATE: |
108 | fat_truncate(callid, &call); |
110 | fat_truncate(callid, &call); |
109 | break; |
111 | break; |
- | 112 | case VFS_OUT_STAT: |
|
- | 113 | fat_stat(callid, &call); |
|
- | 114 | break; |
|
- | 115 | case VFS_OUT_CLOSE: |
|
- | 116 | fat_close(callid, &call); |
|
- | 117 | break; |
|
110 | case VFS_DESTROY: |
118 | case VFS_OUT_DESTROY: |
111 | fat_destroy(callid, &call); |
119 | fat_destroy(callid, &call); |
112 | break; |
120 | break; |
- | 121 | case VFS_OUT_OPEN_NODE: |
|
- | 122 | fat_open_node(callid, &call); |
|
- | 123 | break; |
|
- | 124 | case VFS_OUT_SYNC: |
|
- | 125 | fat_sync(callid, &call); |
|
- | 126 | break; |
|
113 | default: |
127 | default: |
114 | ipc_answer_0(callid, ENOTSUP); |
128 | ipc_answer_0(callid, ENOTSUP); |
115 | break; |
129 | break; |
116 | } |
130 | } |
117 | } |
131 | } |
118 | } |
132 | } |
119 | 133 | ||
120 | int main(int argc, char **argv) |
134 | int main(int argc, char **argv) |
121 | { |
135 | { |
122 | int vfs_phone; |
136 | int vfs_phone; |
123 | int rc; |
137 | int rc; |
124 | 138 | ||
125 | printf("fat: HelenOS FAT file system server.\n"); |
139 | printf("fat: HelenOS FAT file system server.\n"); |
126 | 140 | ||
127 | rc = fat_idx_init(); |
141 | rc = fat_idx_init(); |
128 | if (rc != EOK) |
142 | if (rc != EOK) |
129 | goto err; |
143 | goto err; |
130 | 144 | ||
131 | vfs_phone = ipc_connect_me_to_blocking(PHONE_NS, SERVICE_VFS, 0, 0); |
145 | vfs_phone = ipc_connect_me_to_blocking(PHONE_NS, SERVICE_VFS, 0, 0); |
132 | if (vfs_phone < EOK) { |
146 | if (vfs_phone < EOK) { |
133 | printf("fat: failed to connect to VFS\n"); |
147 | printf("fat: failed to connect to VFS\n"); |
134 | return -1; |
148 | return -1; |
135 | } |
149 | } |
136 | 150 | ||
137 | rc = fs_register(vfs_phone, &fat_reg, &fat_vfs_info, fat_connection); |
151 | rc = fs_register(vfs_phone, &fat_reg, &fat_vfs_info, fat_connection); |
138 | if (rc != EOK) { |
152 | if (rc != EOK) { |
139 | fat_idx_fini(); |
153 | fat_idx_fini(); |
140 | goto err; |
154 | goto err; |
141 | } |
155 | } |
142 | 156 | ||
143 | dprintf("FAT filesystem registered, fs_handle=%d.\n", |
157 | dprintf("FAT filesystem registered, fs_handle=%d.\n", |
144 | fat_reg.fs_handle); |
158 | fat_reg.fs_handle); |
145 | 159 | ||
146 | async_manager(); |
160 | async_manager(); |
147 | /* not reached */ |
161 | /* not reached */ |
148 | return 0; |
162 | return 0; |
149 | 163 | ||
150 | err: |
164 | err: |
151 | printf("Failed to register the FAT file system (%d)\n", rc); |
165 | printf("Failed to register the FAT file system (%d)\n", rc); |
152 | return rc; |
166 | return rc; |
153 | } |
167 | } |
154 | 168 | ||
155 | /** |
169 | /** |
156 | * @} |
170 | * @} |
157 | */ |
171 | */ |
158 | 172 |