source: mainline/uspace/srv/vfs/vfs_register.c@ 84b86dcb

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 84b86dcb was 84b86dcb, checked in by Jakub Jermar <jakub@…>, 18 years ago

VFS work.
Add fs_name_to_handle() function to abstract away the details of walking the
list of registered file systems, and in order to avoid code duplication.

  • Property mode set to 100644
File size: 11.0 KB
Line 
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_REGISTER method.
36 */
37
38#include <ipc/ipc.h>
39#include <ipc/services.h>
40#include <async.h>
41#include <errno.h>
42#include <stdio.h>
43#include <stdlib.h>
44#include <string.h>
45#include <ctype.h>
46#include <bool.h>
47#include <futex.h>
48#include <as.h>
49#include <libadt/list.h>
50#include <assert.h>
51#include "vfs.h"
52
53atomic_t fs_head_futex = FUTEX_INITIALIZER;
54link_t fs_head;
55
56atomic_t fs_handle_next = {
57 .count = 1
58};
59
60/** Verify the VFS info structure.
61 *
62 * @param info Info structure to be verified.
63 *
64 * @return Non-zero if the info structure is sane, zero otherwise.
65 */
66static bool vfs_info_sane(vfs_info_t *info)
67{
68 int i;
69
70 /*
71 * Check if the name is non-empty and is composed solely of ASCII
72 * characters [a-z]+[a-z0-9_-]*.
73 */
74 if (!islower(info->name[0])) {
75 dprintf("The name doesn't start with a lowercase character.\n");
76 return false;
77 }
78 for (i = 1; i < FS_NAME_MAXLEN; i++) {
79 if (!(islower(info->name[i]) || isdigit(info->name[i])) &&
80 (info->name[i] != '-') && (info->name[i] != '_')) {
81 if (info->name[i] == '\0') {
82 break;
83 } else {
84 dprintf("The name contains illegal "
85 "characters.\n");
86 return false;
87 }
88 }
89 }
90
91
92 /*
93 * Check if the FS implements mandatory VFS operations.
94 */
95 if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_REGISTER)] != VFS_OP_DEFINED) {
96 dprintf("Operation VFS_REGISTER not defined by the client.\n");
97 return false;
98 }
99 if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_MOUNT)] != VFS_OP_DEFINED) {
100 dprintf("Operation VFS_MOUNT not defined by the client.\n");
101 return false;
102 }
103 if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_UNMOUNT)] != VFS_OP_DEFINED) {
104 dprintf("Operation VFS_UNMOUNT not defined by the client.\n");
105 return false;
106 }
107 if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_LOOKUP)] != VFS_OP_DEFINED) {
108 dprintf("Operation VFS_LOOKUP not defined by the client.\n");
109 return false;
110 }
111 if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_OPEN)] != VFS_OP_DEFINED) {
112 dprintf("Operation VFS_OPEN not defined by the client.\n");
113 return false;
114 }
115 if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_CLOSE)] != VFS_OP_DEFINED) {
116 dprintf("Operation VFS_CLOSE not defined by the client.\n");
117 return false;
118 }
119 if (info->ops[IPC_METHOD_TO_VFS_OP(VFS_READ)] != VFS_OP_DEFINED) {
120 dprintf("Operation VFS_READ not defined by the client.\n");
121 return false;
122 }
123
124 /*
125 * Check if each operation is either not defined, defined or default.
126 */
127 for (i = VFS_FIRST; i < VFS_LAST; i++) {
128 if ((info->ops[IPC_METHOD_TO_VFS_OP(i)] != VFS_OP_NULL) &&
129 (info->ops[IPC_METHOD_TO_VFS_OP(i)] != VFS_OP_DEFAULT) &&
130 (info->ops[IPC_METHOD_TO_VFS_OP(i)] != VFS_OP_DEFINED)) {
131 dprintf("Operation info not understood.\n");
132 return false;
133 }
134 }
135 return true;
136}
137
138/** VFS_REGISTER protocol function.
139 *
140 * @param rid Hash of the call with the request.
141 * @param request Call structure with the request.
142 */
143void vfs_register(ipc_callid_t rid, ipc_call_t *request)
144{
145 ipc_callid_t callid;
146 ipc_call_t call;
147 int rc;
148 size_t size;
149
150 dprintf("Processing VFS_REGISTER request received from %p.\n",
151 request->in_phone_hash);
152
153 /*
154 * The first call has to be IPC_M_DATA_SEND in which we receive the
155 * VFS info structure from the client FS.
156 */
157 if (!ipc_data_receive(&callid, &call, NULL, &size)) {
158 /*
159 * The client doesn't obey the same protocol as we do.
160 */
161 dprintf("Receiving of VFS info failed.\n");
162 ipc_answer_fast(callid, EINVAL, 0, 0);
163 ipc_answer_fast(rid, EINVAL, 0, 0);
164 return;
165 }
166
167 dprintf("VFS info received, size = %d\n", size);
168
169 /*
170 * We know the size of the VFS info structure. See if the client
171 * understands this easy concept too.
172 */
173 if (size != sizeof(vfs_info_t)) {
174 /*
175 * The client is sending us something, which cannot be
176 * the info structure.
177 */
178 dprintf("Received VFS info has bad size.\n");
179 ipc_answer_fast(callid, EINVAL, 0, 0);
180 ipc_answer_fast(rid, EINVAL, 0, 0);
181 return;
182 }
183
184 /*
185 * Allocate and initialize a buffer for the fs_info structure.
186 */
187 fs_info_t *fs_info;
188 fs_info = (fs_info_t *) malloc(sizeof(fs_info_t));
189 if (!fs_info) {
190 dprintf("Could not allocate memory for FS info.\n");
191 ipc_answer_fast(callid, ENOMEM, 0, 0);
192 ipc_answer_fast(rid, ENOMEM, 0, 0);
193 return;
194 }
195 link_initialize(&fs_info->fs_link);
196
197 rc = ipc_data_deliver(callid, &call, &fs_info->vfs_info, size);
198 if (rc != EOK) {
199 dprintf("Failed to deliver the VFS info into our AS, rc=%d.\n",
200 rc);
201 free(fs_info);
202 ipc_answer_fast(callid, rc, 0, 0);
203 ipc_answer_fast(rid, rc, 0, 0);
204 return;
205 }
206
207 dprintf("VFS info delivered.\n");
208
209 if (!vfs_info_sane(&fs_info->vfs_info)) {
210 free(fs_info);
211 ipc_answer_fast(callid, EINVAL, 0, 0);
212 ipc_answer_fast(rid, EINVAL, 0, 0);
213 return;
214 }
215
216 futex_down(&fs_head_futex);
217
218 /*
219 * Check for duplicit registrations.
220 */
221 if (fs_name_to_handle(fs_info->vfs_info.name, false)) {
222 /*
223 * We already register a fs like this.
224 */
225 dprintf("FS is already registered.\n");
226 futex_up(&fs_head_futex);
227 free(fs_info);
228 ipc_answer_fast(callid, EEXISTS, 0, 0);
229 ipc_answer_fast(rid, EEXISTS, 0, 0);
230 return;
231 }
232
233 /*
234 * Add fs_info to the list of registered FS's.
235 */
236 dprintf("Adding FS into the registered list.\n");
237 list_append(&fs_info->fs_link, &fs_head);
238
239 /*
240 * ACK receiving a properly formatted, non-duplicit vfs_info.
241 */
242 ipc_answer_fast(callid, EOK, 0, 0);
243
244 /*
245 * Now we want the client to send us the IPC_M_CONNECT_TO_ME call so
246 * that a callback connection is created and we have a phone through
247 * which to forward VFS requests to it.
248 */
249 callid = async_get_call(&call);
250 if (IPC_GET_METHOD(call) != IPC_M_CONNECT_TO_ME) {
251 dprintf("Unexpected call, method = %d\n", IPC_GET_METHOD(call));
252 list_remove(&fs_info->fs_link);
253 futex_up(&fs_head_futex);
254 free(fs_info);
255 ipc_answer_fast(callid, EINVAL, 0, 0);
256 ipc_answer_fast(rid, EINVAL, 0, 0);
257 return;
258 }
259 fs_info->phone = IPC_GET_ARG3(call);
260 ipc_answer_fast(callid, EOK, 0, 0);
261
262 dprintf("Callback connection to FS created.\n");
263
264 /*
265 * The client will want us to send him the address space area with PLB.
266 */
267 callid = async_get_call(&call);
268 if (IPC_GET_METHOD(call) != IPC_M_AS_AREA_RECV) {
269 dprintf("Unexpected call, method = %d\n", IPC_GET_METHOD(call));
270 list_remove(&fs_info->fs_link);
271 futex_up(&fs_head_futex);
272 ipc_hangup(fs_info->phone);
273 free(fs_info);
274 ipc_answer_fast(callid, EINVAL, 0, 0);
275 ipc_answer_fast(rid, EINVAL, 0, 0);
276 return;
277 }
278
279 /*
280 * We can only send the client address space area PLB_SIZE bytes long.
281 */
282 size = IPC_GET_ARG2(call);
283 if (size != PLB_SIZE) {
284 dprintf("Client suggests wrong size of PFB, size = %d\n", size);
285 list_remove(&fs_info->fs_link);
286 futex_up(&fs_head_futex);
287 ipc_hangup(fs_info->phone);
288 free(fs_info);
289 ipc_answer_fast(callid, EINVAL, 0, 0);
290 ipc_answer_fast(rid, EINVAL, 0, 0);
291 return;
292
293 }
294
295 /*
296 * Commit to read-only sharing the PLB with the client.
297 */
298 ipc_answer_fast(callid, EOK, (ipcarg_t) plb,
299 (ipcarg_t) (AS_AREA_READ | AS_AREA_CACHEABLE));
300
301 dprintf("Sharing PLB.\n");
302
303 /*
304 * That was it. The FS has been registered.
305 * In reply to the VFS_REGISTER request, we assign the client file
306 * system a global file system handle.
307 */
308 fs_info->fs_handle = (int) atomic_postinc(&fs_handle_next);
309 ipc_answer_fast(rid, EOK, (ipcarg_t) fs_info->fs_handle, 0);
310
311 futex_up(&fs_head_futex);
312
313 dprintf("\"%s\" filesystem successfully registered, handle=%d.\n",
314 fs_info->vfs_info.name, fs_info->fs_handle);
315
316}
317
318/** For a given file system handle, implement policy for allocating a phone.
319 *
320 * @param handle File system handle.
321 *
322 * @return Phone over which a multi-call request can be safely
323 * sent. Return 0 if no phone was found.
324 */
325int vfs_grab_phone(int handle)
326{
327 /*
328 * For now, we don't try to be very clever and very fast.
329 * We simply lookup the phone in the fs_head list. We currently don't
330 * open any additional phones (even though that itself would be pretty
331 * straightforward; housekeeping multiple open phones to a FS task would
332 * be more demanding). Instead, we simply take the respective
333 * phone_futex and keep it until vfs_release_phone().
334 */
335 futex_down(&fs_head_futex);
336 link_t *cur;
337 fs_info_t *fs;
338 for (cur = fs_head.next; cur != &fs_head; cur = cur->next) {
339 fs = list_get_instance(cur, fs_info_t, fs_link);
340 if (fs->fs_handle == handle) {
341 futex_up(&fs_head_futex);
342 /*
343 * For now, take the futex unconditionally.
344 * Oh yeah, serialization rocks.
345 * It will be up'ed in vfs_release_phone().
346 */
347 futex_down(&fs->phone_futex);
348 return fs->phone;
349 }
350 }
351 futex_up(&fs_head_futex);
352 return 0;
353}
354
355/** Tell VFS that the phone is in use for any request.
356 *
357 * @param phone Phone to FS task.
358 */
359void vfs_release_phone(int phone)
360{
361 bool found = false;
362
363 futex_down(&fs_head_futex);
364 link_t *cur;
365 for (cur = fs_head.next; cur != &fs_head; cur = cur->next) {
366 fs_info_t *fs = list_get_instance(cur, fs_info_t, fs_link);
367 if (fs->phone == phone) {
368 found = true;
369 futex_up(&fs_head_futex);
370 futex_up(&fs->phone_futex);
371 return;
372 }
373 }
374 futex_up(&fs_head_futex);
375
376 /*
377 * Not good to get here.
378 */
379 assert(found == true);
380}
381
382/** Convert file system name to its handle.
383 *
384 * @param name File system name.
385 * @param lock If true, the function will down and up the
386 * fs_head_futex.
387 *
388 * @return File system handle or zero if file system not found.
389 */
390int fs_name_to_handle(char *name, bool lock)
391{
392 int handle = 0;
393
394 if (lock)
395 futex_down(&fs_head_futex);
396 link_t *cur;
397 for (cur = fs_head.next; cur != &fs_head; cur = cur->next) {
398 fs_info_t *fs = list_get_instance(cur, fs_info_t, fs_link);
399 if (strcmp(fs->vfs_info.name, name) == 0) { /* XXX: strncmp() */
400 handle = fs->fs_handle;
401 break;
402 }
403 }
404 if (lock)
405 futex_up(&fs_head_futex);
406 return handle;
407}
408
409/**
410 * @}
411 */
Note: See TracBrowser for help on using the repository browser.