Rev 4584 | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 4584 | Rev 4585 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2008 Jakub Jermar |
2 | * Copyright (c) 2008 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup fs |
29 | /** @addtogroup fs |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | 32 | ||
33 | /** |
33 | /** |
34 | * @file vfs.c |
34 | * @file vfs.c |
35 | * @brief VFS service for HelenOS. |
35 | * @brief VFS service for HelenOS. |
36 | */ |
36 | */ |
37 | 37 | ||
38 | #include <ipc/ipc.h> |
38 | #include <ipc/ipc.h> |
39 | #include <ipc/services.h> |
39 | #include <ipc/services.h> |
40 | #include <async.h> |
40 | #include <async.h> |
41 | #include <errno.h> |
41 | #include <errno.h> |
42 | #include <stdio.h> |
42 | #include <stdio.h> |
43 | #include <bool.h> |
43 | #include <bool.h> |
44 | #include <string.h> |
44 | #include <string.h> |
45 | #include <as.h> |
45 | #include <as.h> |
46 | #include <atomic.h> |
46 | #include <atomic.h> |
47 | #include "vfs.h" |
47 | #include "vfs.h" |
48 | 48 | ||
49 | #define NAME "vfs" |
49 | #define NAME "vfs" |
50 | 50 | ||
51 | static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall) |
51 | static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall) |
52 | { |
52 | { |
53 | bool keep_on_going = true; |
53 | bool keep_on_going = true; |
54 | 54 | ||
55 | /* |
55 | /* |
56 | * The connection was opened via the IPC_CONNECT_ME_TO call. |
56 | * The connection was opened via the IPC_CONNECT_ME_TO call. |
57 | * This call needs to be answered. |
57 | * This call needs to be answered. |
58 | */ |
58 | */ |
59 | ipc_answer_0(iid, EOK); |
59 | ipc_answer_0(iid, EOK); |
60 | 60 | ||
61 | /* |
61 | /* |
62 | * Here we enter the main connection fibril loop. |
62 | * Here we enter the main connection fibril loop. |
63 | * The logic behind this loop and the protocol is that we'd like to keep |
63 | * The logic behind this loop and the protocol is that we'd like to keep |
64 | * each connection open until the client hangs up. When the client hangs |
64 | * each connection open until the client hangs up. When the client hangs |
65 | * up, we will free its VFS state. The act of hanging up the connection |
65 | * up, we will free its VFS state. The act of hanging up the connection |
66 | * by the client is equivalent to client termination because we cannot |
66 | * by the client is equivalent to client termination because we cannot |
67 | * distinguish one from the other. On the other hand, the client can |
67 | * distinguish one from the other. On the other hand, the client can |
68 | * hang up arbitrarily if it has no open files and reestablish the |
68 | * hang up arbitrarily if it has no open files and reestablish the |
69 | * connection later. |
69 | * connection later. |
70 | */ |
70 | */ |
71 | while (keep_on_going) { |
71 | while (keep_on_going) { |
72 | ipc_call_t call; |
72 | ipc_call_t call; |
73 | ipc_callid_t callid = async_get_call(&call); |
73 | ipc_callid_t callid = async_get_call(&call); |
74 | 74 | ||
75 | fs_handle_t fs_handle; |
75 | fs_handle_t fs_handle; |
76 | int phone; |
76 | int phone; |
77 | 77 | ||
78 | switch (IPC_GET_METHOD(call)) { |
78 | switch (IPC_GET_METHOD(call)) { |
79 | case IPC_M_PHONE_HUNGUP: |
79 | case IPC_M_PHONE_HUNGUP: |
80 | keep_on_going = false; |
80 | keep_on_going = false; |
81 | break; |
81 | break; |
82 | case VFS_IN_REGISTER: |
82 | case VFS_IN_REGISTER: |
83 | vfs_register(callid, &call); |
83 | vfs_register(callid, &call); |
84 | keep_on_going = false; |
84 | keep_on_going = false; |
85 | break; |
85 | break; |
86 | case VFS_IN_MOUNT: |
86 | case VFS_IN_MOUNT: |
87 | vfs_mount(callid, &call); |
87 | vfs_mount(callid, &call); |
88 | break; |
88 | break; |
89 | case VFS_IN_OPEN: |
89 | case VFS_IN_OPEN: |
90 | vfs_open(callid, &call); |
90 | vfs_open(callid, &call); |
91 | break; |
91 | break; |
92 | case VFS_IN_OPEN_NODE: |
92 | case VFS_IN_OPEN_NODE: |
93 | vfs_open_node(callid, &call); |
93 | vfs_open_node(callid, &call); |
94 | break; |
94 | break; |
95 | case VFS_IN_CLOSE: |
95 | case VFS_IN_CLOSE: |
96 | vfs_close(callid, &call); |
96 | vfs_close(callid, &call); |
97 | break; |
97 | break; |
98 | case VFS_IN_READ: |
98 | case VFS_IN_READ: |
99 | vfs_read(callid, &call); |
99 | vfs_read(callid, &call); |
100 | break; |
100 | break; |
101 | case VFS_IN_WRITE: |
101 | case VFS_IN_WRITE: |
102 | vfs_write(callid, &call); |
102 | vfs_write(callid, &call); |
103 | break; |
103 | break; |
104 | case VFS_IN_SEEK: |
104 | case VFS_IN_SEEK: |
105 | vfs_seek(callid, &call); |
105 | vfs_seek(callid, &call); |
106 | break; |
106 | break; |
107 | case VFS_IN_TRUNCATE: |
107 | case VFS_IN_TRUNCATE: |
108 | vfs_truncate(callid, &call); |
108 | vfs_truncate(callid, &call); |
109 | break; |
109 | break; |
- | 110 | case VFS_IN_FSTAT: |
|
- | 111 | vfs_fstat(callid, &call); |
|
- | 112 | break; |
|
- | 113 | case VFS_IN_STAT: |
|
- | 114 | vfs_stat(callid, &call); |
|
- | 115 | break; |
|
110 | case VFS_IN_MKDIR: |
116 | case VFS_IN_MKDIR: |
111 | vfs_mkdir(callid, &call); |
117 | vfs_mkdir(callid, &call); |
112 | break; |
118 | break; |
113 | case VFS_IN_UNLINK: |
119 | case VFS_IN_UNLINK: |
114 | vfs_unlink(callid, &call); |
120 | vfs_unlink(callid, &call); |
115 | break; |
121 | break; |
116 | case VFS_IN_RENAME: |
122 | case VFS_IN_RENAME: |
117 | vfs_rename(callid, &call); |
123 | vfs_rename(callid, &call); |
118 | break; |
124 | break; |
119 | case VFS_IN_DEVICE: |
- | |
120 | vfs_device(callid, &call); |
- | |
121 | break; |
- | |
122 | case VFS_IN_SYNC: |
125 | case VFS_IN_SYNC: |
123 | vfs_sync(callid, &call); |
126 | vfs_sync(callid, &call); |
124 | break; |
127 | break; |
125 | case VFS_IN_NODE: |
- | |
126 | vfs_node(callid, &call); |
- | |
127 | break; |
- | |
128 | default: |
128 | default: |
129 | ipc_answer_0(callid, ENOTSUP); |
129 | ipc_answer_0(callid, ENOTSUP); |
130 | break; |
130 | break; |
131 | } |
131 | } |
132 | } |
132 | } |
133 | 133 | ||
134 | /* TODO: cleanup after the client */ |
134 | /* TODO: cleanup after the client */ |
135 | } |
135 | } |
136 | 136 | ||
137 | int main(int argc, char **argv) |
137 | int main(int argc, char **argv) |
138 | { |
138 | { |
139 | printf(NAME ": HelenOS VFS server\n"); |
139 | printf(NAME ": HelenOS VFS server\n"); |
140 | 140 | ||
141 | /* |
141 | /* |
142 | * Initialize VFS node hash table. |
142 | * Initialize VFS node hash table. |
143 | */ |
143 | */ |
144 | if (!vfs_nodes_init()) { |
144 | if (!vfs_nodes_init()) { |
145 | printf(NAME ": Failed to initialize VFS node hash table\n"); |
145 | printf(NAME ": Failed to initialize VFS node hash table\n"); |
146 | return ENOMEM; |
146 | return ENOMEM; |
147 | } |
147 | } |
148 | 148 | ||
149 | /* |
149 | /* |
150 | * Allocate and initialize the Path Lookup Buffer. |
150 | * Allocate and initialize the Path Lookup Buffer. |
151 | */ |
151 | */ |
152 | plb = as_get_mappable_page(PLB_SIZE); |
152 | plb = as_get_mappable_page(PLB_SIZE); |
153 | if (!plb) { |
153 | if (!plb) { |
154 | printf(NAME ": Cannot allocate a mappable piece of address space\n"); |
154 | printf(NAME ": Cannot allocate a mappable piece of address space\n"); |
155 | return ENOMEM; |
155 | return ENOMEM; |
156 | } |
156 | } |
157 | 157 | ||
158 | if (as_area_create(plb, PLB_SIZE, AS_AREA_READ | AS_AREA_WRITE | |
158 | if (as_area_create(plb, PLB_SIZE, AS_AREA_READ | AS_AREA_WRITE | |
159 | AS_AREA_CACHEABLE) != plb) { |
159 | AS_AREA_CACHEABLE) != plb) { |
160 | printf(NAME ": Cannot create address space area\n"); |
160 | printf(NAME ": Cannot create address space area\n"); |
161 | return ENOMEM; |
161 | return ENOMEM; |
162 | } |
162 | } |
163 | memset(plb, 0, PLB_SIZE); |
163 | memset(plb, 0, PLB_SIZE); |
164 | 164 | ||
165 | /* |
165 | /* |
166 | * Set a connection handling function/fibril. |
166 | * Set a connection handling function/fibril. |
167 | */ |
167 | */ |
168 | async_set_client_connection(vfs_connection); |
168 | async_set_client_connection(vfs_connection); |
169 | 169 | ||
170 | /* |
170 | /* |
171 | * Register at the naming service. |
171 | * Register at the naming service. |
172 | */ |
172 | */ |
173 | ipcarg_t phonead; |
173 | ipcarg_t phonead; |
174 | ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead); |
174 | ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead); |
175 | 175 | ||
176 | /* |
176 | /* |
177 | * Start accepting connections. |
177 | * Start accepting connections. |
178 | */ |
178 | */ |
179 | printf(NAME ": Accepting connections\n"); |
179 | printf(NAME ": Accepting connections\n"); |
180 | async_manager(); |
180 | async_manager(); |
181 | return 0; |
181 | return 0; |
182 | } |
182 | } |
183 | 183 | ||
184 | /** |
184 | /** |
185 | * @} |
185 | * @} |
186 | */ |
186 | */ |
187 | 187 |