Rev 2531 | Rev 2535 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
2518 | jermar | 1 | /* |
2 | * Copyright (c) 2007 Jakub Jermar |
||
3 | * All rights reserved. |
||
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * - The name of the author may not be used to endorse or promote products |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
||
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
29 | /** @addtogroup fs |
||
30 | * @{ |
||
31 | */ |
||
32 | |||
33 | /** |
||
34 | * @file vfs.c |
||
35 | * @brief VFS multiplexer for HelenOS. |
||
36 | */ |
||
37 | |||
2520 | jermar | 38 | #include <ipc/ipc.h> |
39 | #include <ipc/services.h> |
||
40 | #include <async.h> |
||
41 | #include <errno.h> |
||
2532 | jermar | 42 | #include <stdio.h> |
2523 | jermar | 43 | #include <stdlib.h> |
2526 | jermar | 44 | #include <string.h> |
45 | #include <ctype.h> |
||
2523 | jermar | 46 | #include <bool.h> |
2526 | jermar | 47 | #include <futex.h> |
48 | #include <libadt/list.h> |
||
2520 | jermar | 49 | #include "vfs.h" |
50 | |||
2532 | jermar | 51 | |
52 | #define dprintf(...) printf(__VA_ARGS__) |
||
53 | |||
2526 | jermar | 54 | atomic_t fs_head_futex = FUTEX_INITIALIZER; |
55 | link_t fs_head; |
||
56 | |||
2523 | jermar | 57 | /** Verify the VFS info structure. |
58 | * |
||
59 | * @param info Info structure to be verified. |
||
60 | * |
||
61 | * @return Non-zero if the info structure is sane, zero otherwise. |
||
62 | */ |
||
2526 | jermar | 63 | static bool vfs_info_sane(vfs_info_t *info) |
2521 | jermar | 64 | { |
2526 | jermar | 65 | int i; |
66 | |||
67 | /* |
||
68 | * Check if the name is non-empty and is composed solely of ASCII |
||
69 | * characters [a-z]+[a-z0-9_-]*. |
||
70 | */ |
||
2532 | jermar | 71 | if (!islower(info->name[0])) { |
72 | dprintf("The name doesn't start with a lowercase character.\n"); |
||
2526 | jermar | 73 | return false; |
2532 | jermar | 74 | } |
2526 | jermar | 75 | for (i = 1; i < FS_NAME_MAXLEN; i++) { |
76 | if (!(islower(info->name[i]) || isdigit(info->name[i])) && |
||
77 | (info->name[i] != '-') && (info->name[i] != '_')) { |
||
2532 | jermar | 78 | if (info->name[i] == '\0') { |
2526 | jermar | 79 | break; |
2532 | jermar | 80 | } else { |
81 | dprintf("The name contains illegal " |
||
82 | "characters.\n"); |
||
2526 | jermar | 83 | return false; |
2532 | jermar | 84 | } |
2526 | jermar | 85 | } |
86 | } |
||
87 | |||
88 | |||
89 | /* |
||
90 | * Check if the FS implements mandatory VFS operations. |
||
91 | */ |
||
2532 | jermar | 92 | if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_REGISTER)] != VFS_OP_DEFINED) { |
93 | dprintf("Operation VFS_REGISTER not defined by the client.\n"); |
||
2526 | jermar | 94 | return false; |
2532 | jermar | 95 | } |
96 | if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_MOUNT)] != VFS_OP_DEFINED) { |
||
97 | dprintf("Operation VFS_MOUNT not defined by the client.\n"); |
||
2526 | jermar | 98 | return false; |
2532 | jermar | 99 | } |
100 | if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_UNMOUNT)] != VFS_OP_DEFINED) { |
||
101 | dprintf("Operation VFS_UNMOUNT not defined by the client.\n"); |
||
2526 | jermar | 102 | return false; |
2532 | jermar | 103 | } |
104 | if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_LOOKUP)] != VFS_OP_DEFINED) { |
||
105 | dprintf("Operation VFS_LOOKUP not defined by the client.\n"); |
||
2527 | jermar | 106 | return false; |
2532 | jermar | 107 | } |
108 | if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_OPEN)] != VFS_OP_DEFINED) { |
||
109 | dprintf("Operation VFS_OPEN not defined by the client.\n"); |
||
2526 | jermar | 110 | return false; |
2532 | jermar | 111 | } |
112 | if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_CLOSE)] != VFS_OP_DEFINED) { |
||
113 | dprintf("Operation VFS_CLOSE not defined by the client.\n"); |
||
2526 | jermar | 114 | return false; |
2532 | jermar | 115 | } |
116 | if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_READ)] != VFS_OP_DEFINED) { |
||
117 | dprintf("Operation VFS_READ not defined by the client.\n"); |
||
2526 | jermar | 118 | return false; |
2532 | jermar | 119 | } |
2526 | jermar | 120 | |
121 | /* |
||
122 | * Check if each operation is either not defined, defined or default. |
||
123 | */ |
||
124 | for (i = VFS_FIRST; i < VFS_LAST; i++) { |
||
2532 | jermar | 125 | if ((info->ops[IPC_METHOD_TO_VFS_OP(i)] != VFS_OP_NULL) && |
126 | (info->ops[IPC_METHOD_TO_VFS_OP(i)] != VFS_OP_DEFAULT) && |
||
127 | (info->ops[IPC_METHOD_TO_VFS_OP(i)] != VFS_OP_DEFINED)) { |
||
128 | dprintf("Operation info not understood.\n"); |
||
129 | return false; |
||
130 | } |
||
2526 | jermar | 131 | } |
132 | return true; |
||
2523 | jermar | 133 | } |
134 | |||
135 | /** VFS_REGISTER protocol function. |
||
136 | * |
||
137 | * @param rid Hash of the call with the request. |
||
138 | * @param request Call structure with the request. |
||
139 | */ |
||
140 | static void vfs_register(ipc_callid_t rid, ipc_call_t *request) |
||
141 | { |
||
2521 | jermar | 142 | ipc_callid_t callid; |
143 | ipc_call_t call; |
||
2523 | jermar | 144 | int rc; |
145 | size_t size; |
||
2521 | jermar | 146 | |
2532 | jermar | 147 | dprintf("Processing VFS_REGISTER request received from %p.\n", |
148 | request->in_phone_hash); |
||
149 | |||
2523 | jermar | 150 | /* |
151 | * The first call has to be IPC_M_DATA_SEND in which we receive the |
||
152 | * VFS info structure from the client FS. |
||
153 | */ |
||
2531 | jermar | 154 | if (!ipc_data_receive(&callid, &call, NULL, &size)) { |
2521 | jermar | 155 | /* |
156 | * The client doesn't obey the same protocol as we do. |
||
2532 | jermar | 157 | */ |
158 | dprintf("Receiving of VFS info failed.\n"); |
||
2521 | jermar | 159 | ipc_answer_fast(callid, EINVAL, 0, 0); |
2523 | jermar | 160 | ipc_answer_fast(rid, EINVAL, 0, 0); |
2521 | jermar | 161 | return; |
162 | } |
||
2523 | jermar | 163 | |
2532 | jermar | 164 | dprintf("VFS info received, size = %d\n", size); |
165 | |||
2523 | jermar | 166 | /* |
2526 | jermar | 167 | * We know the size of the VFS info structure. See if the client |
168 | * understands this easy concept too. |
||
2523 | jermar | 169 | */ |
170 | if (size != sizeof(vfs_info_t)) { |
||
171 | /* |
||
172 | * The client is sending us something, which cannot be |
||
173 | * the info structure. |
||
174 | */ |
||
2532 | jermar | 175 | dprintf("Received VFS info has bad size.\n"); |
2523 | jermar | 176 | ipc_answer_fast(callid, EINVAL, 0, 0); |
177 | ipc_answer_fast(rid, EINVAL, 0, 0); |
||
178 | return; |
||
179 | } |
||
2526 | jermar | 180 | fs_info_t *fs_info; |
2523 | jermar | 181 | |
182 | /* |
||
2526 | jermar | 183 | * Allocate and initialize a buffer for the fs_info structure. |
2523 | jermar | 184 | */ |
2526 | jermar | 185 | fs_info = (fs_info_t *) malloc(sizeof(fs_info_t)); |
186 | if (!fs_info) { |
||
2532 | jermar | 187 | dprintf("Could not allocate memory for FS info.\n"); |
2523 | jermar | 188 | ipc_answer_fast(callid, ENOMEM, 0, 0); |
189 | ipc_answer_fast(rid, ENOMEM, 0, 0); |
||
190 | return; |
||
191 | } |
||
2526 | jermar | 192 | link_initialize(&fs_info->fs_link); |
2523 | jermar | 193 | |
2531 | jermar | 194 | rc = ipc_data_deliver(callid, &call, &fs_info->vfs_info, size); |
2532 | jermar | 195 | if (rc != EOK) { |
196 | dprintf("Failed to deliver the VFS info into our AS, rc=%d.\n", |
||
197 | rc); |
||
2526 | jermar | 198 | free(fs_info); |
2523 | jermar | 199 | ipc_answer_fast(callid, rc, 0, 0); |
200 | ipc_answer_fast(rid, rc, 0, 0); |
||
201 | return; |
||
202 | } |
||
2532 | jermar | 203 | |
204 | dprintf("VFS info delivered.\n"); |
||
2523 | jermar | 205 | |
2526 | jermar | 206 | if (!vfs_info_sane(&fs_info->vfs_info)) { |
207 | free(fs_info); |
||
2523 | jermar | 208 | ipc_answer_fast(callid, EINVAL, 0, 0); |
209 | ipc_answer_fast(rid, EINVAL, 0, 0); |
||
210 | return; |
||
211 | } |
||
212 | |||
2526 | jermar | 213 | futex_down(&fs_head_futex); |
214 | |||
215 | /* |
||
216 | * Check for duplicit registrations. |
||
217 | */ |
||
218 | link_t *cur; |
||
219 | for (cur = fs_head.next; cur != &fs_head; cur = cur->next) { |
||
220 | fs_info_t *fi = list_get_instance(cur, fs_info_t, |
||
221 | fs_link); |
||
222 | /* TODO: replace strcmp with strncmp once we have it */ |
||
223 | if (strcmp(fs_info->vfs_info.name, fi->vfs_info.name) == 0) { |
||
224 | /* |
||
225 | * We already register a fs like this. |
||
226 | */ |
||
2532 | jermar | 227 | dprintf("FS is already registered.\n"); |
2526 | jermar | 228 | futex_up(&fs_head_futex); |
229 | free(fs_info); |
||
230 | ipc_answer_fast(callid, EEXISTS, 0, 0); |
||
231 | ipc_answer_fast(rid, EEXISTS, 0, 0); |
||
232 | return; |
||
233 | } |
||
234 | } |
||
2527 | jermar | 235 | |
236 | /* |
||
237 | * Add fs_info to the list of registered FS's. |
||
238 | */ |
||
2532 | jermar | 239 | dprintf("Adding FS into the registered list.\n"); |
2527 | jermar | 240 | list_append(&fs_info->fs_link, &fs_head); |
241 | |||
242 | /* |
||
243 | * ACK receiving a properly formatted, non-duplicit vfs_info. |
||
244 | */ |
||
245 | ipc_answer_fast(callid, EOK, 0, 0); |
||
2526 | jermar | 246 | |
247 | /* |
||
2527 | jermar | 248 | * Now we want the client to send us the IPC_M_CONNECT_TO_ME call so |
249 | * that a callback connection is created and we have a phone through |
||
250 | * which to forward VFS requests to it. |
||
2526 | jermar | 251 | */ |
2527 | jermar | 252 | callid = async_get_call(&call); |
253 | if (IPC_GET_METHOD(call) != IPC_M_CONNECT_TO_ME) { |
||
2532 | jermar | 254 | dprintf("Unexpected call, method = %d\n", IPC_GET_METHOD(call)); |
2527 | jermar | 255 | list_remove(&fs_info->fs_link); |
256 | futex_up(&fs_head_futex); |
||
257 | free(fs_info); |
||
258 | ipc_answer_fast(callid, EINVAL, 0, 0); |
||
259 | ipc_answer_fast(rid, EINVAL, 0, 0); |
||
260 | return; |
||
261 | } |
||
262 | fs_info->phone = IPC_GET_ARG3(call); |
||
263 | ipc_answer_fast(callid, EOK, 0, 0); |
||
2526 | jermar | 264 | |
2532 | jermar | 265 | dprintf("Callback connection to FS created.\n"); |
266 | |||
2526 | jermar | 267 | futex_up(&fs_head_futex); |
2527 | jermar | 268 | |
269 | /* |
||
270 | * That was it. The FS has been registered. |
||
271 | */ |
||
272 | ipc_answer_fast(rid, EOK, 0, 0); |
||
2532 | jermar | 273 | dprintf("\"%s\" filesystem successfully registered.\n", |
274 | fs_info->vfs_info.name); |
||
2521 | jermar | 275 | } |
276 | |||
2520 | jermar | 277 | static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall) |
278 | { |
||
2523 | jermar | 279 | bool keep_on_going = 1; |
2520 | jermar | 280 | |
2532 | jermar | 281 | printf("Connection opened from %p\n", icall->in_phone_hash); |
282 | |||
2520 | jermar | 283 | /* |
284 | * The connection was opened via the IPC_CONNECT_ME_TO call. |
||
285 | * This call needs to be answered. |
||
286 | */ |
||
2523 | jermar | 287 | ipc_answer_fast(iid, EOK, 0, 0); |
2520 | jermar | 288 | |
289 | /* |
||
2523 | jermar | 290 | * Here we enter the main connection fibril loop. |
291 | * The logic behind this loop and the protocol is that we'd like to keep |
||
292 | * each connection open for a while before we close it. The benefit of |
||
293 | * this is that the client doesn't have to establish a new connection |
||
294 | * upon each request. On the other hand, the client must be ready to |
||
295 | * re-establish a connection if we hang it up due to reaching of maximum |
||
296 | * number of requests per connection or due to the client timing out. |
||
2520 | jermar | 297 | */ |
2523 | jermar | 298 | |
299 | while (keep_on_going) { |
||
300 | ipc_callid_t callid; |
||
301 | ipc_call_t call; |
||
302 | |||
303 | callid = async_get_call(&call); |
||
2532 | jermar | 304 | |
305 | printf("Received call, method=%d\n", IPC_GET_METHOD(call)); |
||
2523 | jermar | 306 | |
307 | switch (IPC_GET_METHOD(call)) { |
||
308 | case IPC_M_PHONE_HUNGUP: |
||
309 | keep_on_going = false; |
||
310 | break; |
||
311 | case VFS_REGISTER: |
||
312 | vfs_register(callid, &call); |
||
313 | keep_on_going = false; |
||
314 | break; |
||
315 | case VFS_MOUNT: |
||
316 | case VFS_UNMOUNT: |
||
317 | case VFS_OPEN: |
||
318 | case VFS_CREATE: |
||
319 | case VFS_CLOSE: |
||
320 | case VFS_READ: |
||
321 | case VFS_WRITE: |
||
322 | case VFS_SEEK: |
||
323 | default: |
||
324 | ipc_answer_fast(callid, ENOTSUP, 0, 0); |
||
325 | break; |
||
326 | } |
||
2520 | jermar | 327 | } |
2523 | jermar | 328 | |
329 | /* TODO: cleanup after the client */ |
||
330 | |||
2520 | jermar | 331 | } |
332 | |||
2518 | jermar | 333 | int main(int argc, char **argv) |
334 | { |
||
2520 | jermar | 335 | ipcarg_t phonead; |
336 | |||
2532 | jermar | 337 | printf("VFS: HelenOS VFS server\n"); |
338 | |||
2526 | jermar | 339 | list_initialize(&fs_head); |
2520 | jermar | 340 | async_set_client_connection(vfs_connection); |
341 | ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, &phonead); |
||
342 | async_manager(); |
||
2518 | jermar | 343 | return 0; |
344 | } |
||
345 | |||
346 | /** |
||
347 | * @} |
||
348 | */ |