Rev 2527 | Rev 2535 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
2520 | 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 | #ifndef VFS_VFS_H_ |
||
34 | #define VFS_VFS_H_ |
||
35 | |||
2523 | jermar | 36 | #include <ipc/ipc.h> |
2529 | jermar | 37 | #include <libadt/list.h> |
2523 | jermar | 38 | |
39 | #define VFS_FIRST FIRST_USER_METHOD |
||
40 | |||
2526 | jermar | 41 | #define IPC_METHOD_TO_VFS_OP(m) ((m) - VFS_FIRST) |
42 | |||
2520 | jermar | 43 | typedef enum { |
2523 | jermar | 44 | VFS_REGISTER = VFS_FIRST, |
2520 | jermar | 45 | VFS_MOUNT, |
46 | VFS_UNMOUNT, |
||
2527 | jermar | 47 | VFS_LOOKUP, |
2521 | jermar | 48 | VFS_OPEN, |
2523 | jermar | 49 | VFS_CREATE, |
50 | VFS_CLOSE, |
||
51 | VFS_READ, |
||
52 | VFS_WRITE, |
||
53 | VFS_SEEK, |
||
2521 | jermar | 54 | VFS_LAST, /* keep this the last member of the enum */ |
2520 | jermar | 55 | } vfs_request_t; |
56 | |||
2521 | jermar | 57 | |
58 | /** |
||
59 | * An instance of this structure is associated with a particular FS operation. |
||
60 | * It tells VFS if the FS supports the operation or maybe if a default one |
||
61 | * should be used. |
||
62 | */ |
||
63 | typedef enum { |
||
2523 | jermar | 64 | VFS_OP_NULL = 0, |
2521 | jermar | 65 | VFS_OP_DEFAULT, |
66 | VFS_OP_DEFINED |
||
67 | } vfs_op_t; |
||
68 | |||
69 | #define FS_NAME_MAXLEN 20 |
||
70 | |||
71 | /** |
||
72 | * A structure like this is passed to VFS by each individual FS upon its |
||
73 | * registration. It assosiates a human-readable identifier with each |
||
74 | * registered FS. More importantly, through this structure, the FS announces |
||
75 | * what operations it supports. |
||
76 | */ |
||
77 | typedef struct { |
||
2523 | jermar | 78 | /** Unique identifier of the fs. */ |
2526 | jermar | 79 | char name[FS_NAME_MAXLEN]; |
2523 | jermar | 80 | |
81 | /** Operations. */ |
||
82 | vfs_op_t ops[VFS_LAST - VFS_FIRST]; |
||
2521 | jermar | 83 | } vfs_info_t; |
84 | |||
2526 | jermar | 85 | typedef struct { |
86 | link_t fs_link; |
||
87 | vfs_info_t vfs_info; |
||
2527 | jermar | 88 | ipcarg_t phone; |
2526 | jermar | 89 | } fs_info_t; |
90 | |||
2520 | jermar | 91 | #endif |
92 | |||
93 | /** |
||
94 | * @} |
||
2523 | jermar | 95 | */ |