Rev 3022 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
| Rev 3022 | Rev 4055 | ||
|---|---|---|---|
| 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 | .ops = { |
- | |
| 53 | [IPC_METHOD_TO_VFS_OP(VFS_LOOKUP)] = VFS_OP_DEFINED, |
- | |
| 54 | [IPC_METHOD_TO_VFS_OP(VFS_READ)] = VFS_OP_DEFINED, |
- | |
| 55 | [IPC_METHOD_TO_VFS_OP(VFS_WRITE)] = VFS_OP_NULL, |
- | |
| 56 | [IPC_METHOD_TO_VFS_OP(VFS_TRUNCATE)] = VFS_OP_NULL, |
- | |
| 57 | [IPC_METHOD_TO_VFS_OP(VFS_MOUNT)] = VFS_OP_NULL, |
- | |
| 58 | [IPC_METHOD_TO_VFS_OP(VFS_UNMOUNT)] = VFS_OP_NULL, |
- | |
| 59 | } |
- | |
| 60 | }; |
52 | }; |
| 61 | 53 | ||
| 62 | fs_reg_t fat_reg; |
54 | fs_reg_t fat_reg; |
| 63 | 55 | ||
| 64 | /** |
56 | /** |
| 65 | * This connection fibril processes VFS requests from VFS. |
57 | * This connection fibril processes VFS requests from VFS. |
| 66 | * |
58 | * |
| 67 | * 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. |
| 68 | * 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 |
| 69 | * 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 |
| 70 | * 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 |
| 71 | * 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 |
| 72 | * 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. |
| 73 | * |
65 | * |
| 74 | * 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 |
| 75 | * 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 |
| 76 | * phone for more serialized requests. Similarily, FAT can refuse to duplicate |
68 | * phone for more serialized requests. Similarily, FAT can refuse to duplicate |
| 77 | * 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 |
| 78 | * 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 |
| 79 | * 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 |
| 80 | * request has been completed. |
72 | * request has been completed. |
| 81 | */ |
73 | */ |
| 82 | 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) |
| 83 | { |
75 | { |
| 84 | if (iid) { |
76 | if (iid) { |
| 85 | /* |
77 | /* |
| 86 | * This only happens for connections opened by |
78 | * This only happens for connections opened by |
| 87 | * IPC_M_CONNECT_ME_TO calls as opposed to callback connections |
79 | * IPC_M_CONNECT_ME_TO calls as opposed to callback connections |
| 88 | * created by IPC_M_CONNECT_TO_ME. |
80 | * created by IPC_M_CONNECT_TO_ME. |
| 89 | */ |
81 | */ |
| 90 | ipc_answer_0(iid, EOK); |
82 | ipc_answer_0(iid, EOK); |
| 91 | } |
83 | } |
| 92 | 84 | ||
| 93 | dprintf("VFS-FAT connection established.\n"); |
85 | dprintf("VFS-FAT connection established.\n"); |
| 94 | while (1) { |
86 | while (1) { |
| 95 | ipc_callid_t callid; |
87 | ipc_callid_t callid; |
| 96 | ipc_call_t call; |
88 | ipc_call_t call; |
| 97 | 89 | ||
| 98 | callid = async_get_call(&call); |
90 | callid = async_get_call(&call); |
| 99 | switch (IPC_GET_METHOD(call)) { |
91 | switch (IPC_GET_METHOD(call)) { |
| - | 92 | case VFS_MOUNTED: |
|
| - | 93 | fat_mounted(callid, &call); |
|
| - | 94 | break; |
|
| - | 95 | case VFS_MOUNT: |
|
| - | 96 | fat_mount(callid, &call); |
|
| - | 97 | break; |
|
| 100 | case VFS_LOOKUP: |
98 | case VFS_LOOKUP: |
| 101 | fat_lookup(callid, &call); |
99 | fat_lookup(callid, &call); |
| 102 | break; |
100 | break; |
| - | 101 | case VFS_READ: |
|
| - | 102 | fat_read(callid, &call); |
|
| - | 103 | break; |
|
| - | 104 | case VFS_WRITE: |
|
| - | 105 | fat_write(callid, &call); |
|
| - | 106 | break; |
|
| - | 107 | case VFS_TRUNCATE: |
|
| - | 108 | fat_truncate(callid, &call); |
|
| - | 109 | break; |
|
| - | 110 | case VFS_DESTROY: |
|
| - | 111 | fat_destroy(callid, &call); |
|
| - | 112 | break; |
|
| 103 | default: |
113 | default: |
| 104 | ipc_answer_0(callid, ENOTSUP); |
114 | ipc_answer_0(callid, ENOTSUP); |
| 105 | break; |
115 | break; |
| 106 | } |
116 | } |
| 107 | } |
117 | } |
| 108 | } |
118 | } |
| 109 | 119 | ||
| 110 | int main(int argc, char **argv) |
120 | int main(int argc, char **argv) |
| 111 | { |
121 | { |
| 112 | int vfs_phone; |
122 | int vfs_phone; |
| - | 123 | int rc; |
|
| 113 | 124 | ||
| 114 | printf("FAT: HelenOS FAT file system server.\n"); |
125 | printf("fat: HelenOS FAT file system server.\n"); |
| 115 | 126 | ||
| - | 127 | rc = fat_idx_init(); |
|
| - | 128 | if (rc != EOK) |
|
| - | 129 | goto err; |
|
| - | 130 | ||
| 116 | vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0); |
131 | vfs_phone = ipc_connect_me_to_blocking(PHONE_NS, SERVICE_VFS, 0, 0); |
| 117 | while (vfs_phone < EOK) { |
132 | if (vfs_phone < EOK) { |
| - | 133 | printf("fat: failed to connect to VFS\n"); |
|
| 118 | usleep(10000); |
134 | return -1; |
| 119 | vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0); |
- | |
| 120 | } |
135 | } |
| 121 | 136 | ||
| 122 | int rc; |
- | |
| 123 | rc = fs_register(vfs_phone, &fat_reg, &fat_vfs_info, fat_connection); |
137 | rc = fs_register(vfs_phone, &fat_reg, &fat_vfs_info, fat_connection); |
| 124 | if (rc != EOK) { |
138 | if (rc != EOK) { |
| 125 | printf("Failed to register the FAT file system (%d)\n", rc); |
139 | fat_idx_fini(); |
| 126 | return rc; |
140 | goto err; |
| 127 | } |
141 | } |
| 128 | 142 | ||
| 129 | dprintf("FAT filesystem registered, fs_handle=%d.\n", |
143 | dprintf("FAT filesystem registered, fs_handle=%d.\n", |
| 130 | fat_reg.fs_handle); |
144 | fat_reg.fs_handle); |
| 131 | 145 | ||
| 132 | async_manager(); |
146 | async_manager(); |
| 133 | /* not reached */ |
147 | /* not reached */ |
| 134 | return 0; |
148 | return 0; |
| - | 149 | ||
| - | 150 | err: |
|
| - | 151 | printf("Failed to register the FAT file system (%d)\n", rc); |
|
| - | 152 | return rc; |
|
| 135 | } |
153 | } |
| 136 | 154 | ||
| 137 | /** |
155 | /** |
| 138 | * @} |
156 | * @} |
| 139 | */ |
157 | */ |
| 140 | 158 | ||