Subversion Repositories HelenOS

Rev

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