Rev 2747 | Rev 2751 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2747 | Rev 2750 | ||
---|---|---|---|
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 libfs |
29 | /** @addtogroup libfs |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | /** |
32 | /** |
33 | * @file |
33 | * @file |
34 | * Glue code which is commonod to all FS implementations. |
34 | * Glue code which is commonod to all FS implementations. |
35 | */ |
35 | */ |
36 | 36 | ||
37 | #include "libfs.h" |
37 | #include "libfs.h" |
38 | #include "../../srv/vfs/vfs.h" |
38 | #include "../../srv/vfs/vfs.h" |
39 | #include <errno.h> |
39 | #include <errno.h> |
40 | #include <async.h> |
40 | #include <async.h> |
41 | #include <ipc/ipc.h> |
41 | #include <ipc/ipc.h> |
42 | #include <as.h> |
42 | #include <as.h> |
43 | #include <assert.h> |
43 | #include <assert.h> |
44 | #include <dirent.h> |
44 | #include <dirent.h> |
45 | 45 | ||
46 | /** Register file system server. |
46 | /** Register file system server. |
47 | * |
47 | * |
48 | * This function abstracts away the tedious registration protocol from |
48 | * This function abstracts away the tedious registration protocol from |
49 | * file system implementations and lets them to reuse this registration glue |
49 | * file system implementations and lets them to reuse this registration glue |
50 | * code. |
50 | * code. |
51 | * |
51 | * |
52 | * @param vfs_phone Open phone for communication with VFS. |
52 | * @param vfs_phone Open phone for communication with VFS. |
53 | * @param reg File system registration structure. It will be |
53 | * @param reg File system registration structure. It will be |
54 | * initialized by this function. |
54 | * initialized by this function. |
55 | * @param info VFS info structure supplied by the file system |
55 | * @param info VFS info structure supplied by the file system |
56 | * implementation. |
56 | * implementation. |
57 | * @param conn Connection fibril for handling all calls originating in |
57 | * @param conn Connection fibril for handling all calls originating in |
58 | * VFS. |
58 | * VFS. |
59 | * |
59 | * |
60 | * @return EOK on success or a non-zero error code on errror. |
60 | * @return EOK on success or a non-zero error code on errror. |
61 | */ |
61 | */ |
62 | int fs_register(int vfs_phone, fs_reg_t *reg, vfs_info_t *info, |
62 | int fs_register(int vfs_phone, fs_reg_t *reg, vfs_info_t *info, |
63 | async_client_conn_t conn) |
63 | async_client_conn_t conn) |
64 | { |
64 | { |
65 | /* |
65 | /* |
66 | * Tell VFS that we are here and want to get registered. |
66 | * Tell VFS that we are here and want to get registered. |
67 | * We use the async framework because VFS will answer the request |
67 | * We use the async framework because VFS will answer the request |
68 | * out-of-order, when it knows that the operation succeeded or failed. |
68 | * out-of-order, when it knows that the operation succeeded or failed. |
69 | */ |
69 | */ |
70 | ipc_call_t answer; |
70 | ipc_call_t answer; |
71 | aid_t req = async_send_0(vfs_phone, VFS_REGISTER, &answer); |
71 | aid_t req = async_send_0(vfs_phone, VFS_REGISTER, &answer); |
72 | 72 | ||
73 | /* |
73 | /* |
74 | * Send our VFS info structure to VFS. |
74 | * Send our VFS info structure to VFS. |
75 | */ |
75 | */ |
76 | int rc = ipc_data_write_start(vfs_phone, info, sizeof(*info)); |
76 | int rc = ipc_data_write_start(vfs_phone, info, sizeof(*info)); |
77 | if (rc != EOK) { |
77 | if (rc != EOK) { |
78 | async_wait_for(req, NULL); |
78 | async_wait_for(req, NULL); |
79 | return rc; |
79 | return rc; |
80 | } |
80 | } |
81 | 81 | ||
82 | /* |
82 | /* |
83 | * Ask VFS for callback connection. |
83 | * Ask VFS for callback connection. |
84 | */ |
84 | */ |
85 | ipc_connect_to_me(vfs_phone, 0, 0, 0, ®->vfs_phonehash); |
85 | ipc_connect_to_me(vfs_phone, 0, 0, 0, ®->vfs_phonehash); |
86 | 86 | ||
87 | /* |
87 | /* |
88 | * Allocate piece of address space for PLB. |
88 | * Allocate piece of address space for PLB. |
89 | */ |
89 | */ |
90 | reg->plb_ro = as_get_mappable_page(PLB_SIZE); |
90 | reg->plb_ro = as_get_mappable_page(PLB_SIZE); |
91 | if (!reg->plb_ro) { |
91 | if (!reg->plb_ro) { |
92 | async_wait_for(req, NULL); |
92 | async_wait_for(req, NULL); |
93 | return ENOMEM; |
93 | return ENOMEM; |
94 | } |
94 | } |
95 | 95 | ||
96 | /* |
96 | /* |
97 | * Request sharing the Path Lookup Buffer with VFS. |
97 | * Request sharing the Path Lookup Buffer with VFS. |
98 | */ |
98 | */ |
99 | rc = ipc_share_in_start_0_0(vfs_phone, reg->plb_ro, PLB_SIZE); |
99 | rc = ipc_share_in_start_0_0(vfs_phone, reg->plb_ro, PLB_SIZE); |
100 | if (rc) { |
100 | if (rc) { |
101 | async_wait_for(req, NULL); |
101 | async_wait_for(req, NULL); |
102 | return rc; |
102 | return rc; |
103 | } |
103 | } |
104 | 104 | ||
105 | /* |
105 | /* |
106 | * Pick up the answer for the request to the VFS_REQUEST call. |
106 | * Pick up the answer for the request to the VFS_REQUEST call. |
107 | */ |
107 | */ |
108 | async_wait_for(req, NULL); |
108 | async_wait_for(req, NULL); |
109 | reg->fs_handle = (int) IPC_GET_ARG1(answer); |
109 | reg->fs_handle = (int) IPC_GET_ARG1(answer); |
110 | 110 | ||
111 | /* |
111 | /* |
112 | * Create a connection fibril to handle the callback connection. |
112 | * Create a connection fibril to handle the callback connection. |
113 | */ |
113 | */ |
114 | async_new_connection(reg->vfs_phonehash, 0, NULL, conn); |
114 | async_new_connection(reg->vfs_phonehash, 0, NULL, conn); |
115 | 115 | ||
116 | /* |
116 | /* |
117 | * Tell the async framework that other connections are to be handled by |
117 | * Tell the async framework that other connections are to be handled by |
118 | * the same connection fibril as well. |
118 | * the same connection fibril as well. |
119 | */ |
119 | */ |
120 | async_set_client_connection(conn); |
120 | async_set_client_connection(conn); |
121 | 121 | ||
122 | return IPC_GET_RETVAL(answer); |
122 | return IPC_GET_RETVAL(answer); |
123 | } |
123 | } |
124 | 124 | ||
- | 125 | /** Lookup VFS triplet by name in the file system name space. |
|
- | 126 | * |
|
- | 127 | * @param ops libfs operations structure with function pointers to |
|
- | 128 | * file system implementation |
|
- | 129 | * @param fs_handle File system handle of the file system where to perform |
|
- | 130 | * the lookup. |
|
- | 131 | * @param rid Request ID of the VFS_LOOKUP request. |
|
- | 132 | * @param request VFS_LOOKUP request data itself. |
|
- | 133 | */ |
|
125 | void libfs_lookup(libfs_ops_t *ops, int fs_handle, ipc_callid_t rid, |
134 | void libfs_lookup(libfs_ops_t *ops, int fs_handle, ipc_callid_t rid, |
126 | ipc_call_t *request) |
135 | ipc_call_t *request) |
127 | { |
136 | { |
128 | unsigned next = IPC_GET_ARG1(*request); |
137 | unsigned next = IPC_GET_ARG1(*request); |
129 | unsigned last = IPC_GET_ARG2(*request); |
138 | unsigned last = IPC_GET_ARG2(*request); |
130 | int dev_handle = IPC_GET_ARG3(*request); |
139 | int dev_handle = IPC_GET_ARG3(*request); |
131 | int lflag = IPC_GET_ARG4(*request); |
140 | int lflag = IPC_GET_ARG4(*request); |
132 | 141 | ||
133 | if (last < next) |
142 | if (last < next) |
134 | last += PLB_SIZE; |
143 | last += PLB_SIZE; |
135 | 144 | ||
136 | void *cur = ops->root_get(); |
145 | void *cur = ops->root_get(); |
137 | void *tmp = ops->child_get(cur); |
146 | void *tmp = ops->child_get(cur); |
138 | 147 | ||
139 | if (ops->plb_get_char(next) == '/') |
148 | if (ops->plb_get_char(next) == '/') |
140 | next++; /* eat slash */ |
149 | next++; /* eat slash */ |
141 | 150 | ||
142 | char component[NAME_MAX + 1]; |
151 | char component[NAME_MAX + 1]; |
143 | int len = 0; |
152 | int len = 0; |
144 | while (tmp && next <= last) { |
153 | while (tmp && next <= last) { |
145 | 154 | ||
146 | /* collect the component */ |
155 | /* collect the component */ |
147 | if (ops->plb_get_char(next) != '/') { |
156 | if (ops->plb_get_char(next) != '/') { |
148 | if (len + 1 == NAME_MAX) { |
157 | if (len + 1 == NAME_MAX) { |
149 | /* comopnent length overflow */ |
158 | /* comopnent length overflow */ |
150 | ipc_answer_0(rid, ENAMETOOLONG); |
159 | ipc_answer_0(rid, ENAMETOOLONG); |
151 | return; |
160 | return; |
152 | } |
161 | } |
153 | component[len++] = ops->plb_get_char(next); |
162 | component[len++] = ops->plb_get_char(next); |
154 | next++; /* process next character */ |
163 | next++; /* process next character */ |
155 | if (next <= last) |
164 | if (next <= last) |
156 | continue; |
165 | continue; |
157 | } |
166 | } |
158 | 167 | ||
159 | assert(len); |
168 | assert(len); |
160 | component[len] = '\0'; |
169 | component[len] = '\0'; |
161 | next++; /* eat slash */ |
170 | next++; /* eat slash */ |
162 | len = 0; |
171 | len = 0; |
163 | 172 | ||
164 | /* match the component */ |
173 | /* match the component */ |
165 | while (tmp && !ops->match(tmp, component)) |
174 | while (tmp && !ops->match(tmp, component)) |
166 | tmp = ops->sibling_get(tmp); |
175 | tmp = ops->sibling_get(tmp); |
167 | 176 | ||
168 | /* handle miss: match amongst siblings */ |
177 | /* handle miss: match amongst siblings */ |
169 | if (!tmp) { |
178 | if (!tmp) { |
170 | if ((next > last) && (lflag & L_CREATE)) { |
179 | if ((next > last) && (lflag & L_CREATE)) { |
171 | /* no components left and L_CREATE specified */ |
180 | /* no components left and L_CREATE specified */ |
172 | if (!ops->is_directory(cur)) { |
181 | if (!ops->is_directory(cur)) { |
173 | ipc_answer_0(rid, ENOTDIR); |
182 | ipc_answer_0(rid, ENOTDIR); |
174 | return; |
183 | return; |
175 | } |
184 | } |
176 | void *nodep = ops->create(lflag); |
185 | void *nodep = ops->create(lflag); |
177 | if (nodep) { |
186 | if (nodep) { |
178 | if (!ops->link(cur, nodep, component)) { |
187 | if (!ops->link(cur, nodep, component)) { |
179 | ops->destroy(nodep); |
188 | ops->destroy(nodep); |
180 | ipc_answer_0(rid, ENOSPC); |
189 | ipc_answer_0(rid, ENOSPC); |
181 | } else { |
190 | } else { |
182 | ipc_answer_5(rid, EOK, |
191 | ipc_answer_5(rid, EOK, |
183 | fs_handle, dev_handle, |
192 | fs_handle, dev_handle, |
184 | ops->index_get(nodep), 0, |
193 | ops->index_get(nodep), 0, |
185 | ops->lnkcnt_get(nodep)); |
194 | ops->lnkcnt_get(nodep)); |
186 | } |
195 | } |
187 | } else { |
196 | } else { |
188 | ipc_answer_0(rid, ENOSPC); |
197 | ipc_answer_0(rid, ENOSPC); |
189 | } |
198 | } |
190 | return; |
199 | return; |
191 | } |
200 | } |
192 | ipc_answer_0(rid, ENOENT); |
201 | ipc_answer_0(rid, ENOENT); |
193 | return; |
202 | return; |
194 | } |
203 | } |
195 | 204 | ||
196 | /* descend one level */ |
205 | /* descend one level */ |
197 | cur = tmp; |
206 | cur = tmp; |
198 | tmp = ops->child_get(tmp); |
207 | tmp = ops->child_get(tmp); |
199 | } |
208 | } |
200 | 209 | ||
201 | /* handle miss: excessive components */ |
210 | /* handle miss: excessive components */ |
202 | if (!tmp && next <= last) { |
211 | if (!tmp && next <= last) { |
203 | if (lflag & L_CREATE) { |
212 | if (lflag & L_CREATE) { |
204 | if (!ops->is_directory(cur)) { |
213 | if (!ops->is_directory(cur)) { |
205 | ipc_answer_0(rid, ENOTDIR); |
214 | ipc_answer_0(rid, ENOTDIR); |
206 | return; |
215 | return; |
207 | } |
216 | } |
208 | 217 | ||
209 | /* collect next component */ |
218 | /* collect next component */ |
210 | while (next <= last) { |
219 | while (next <= last) { |
211 | if (ops->plb_get_char(next) == '/') { |
220 | if (ops->plb_get_char(next) == '/') { |
212 | /* more than one component */ |
221 | /* more than one component */ |
213 | ipc_answer_0(rid, ENOENT); |
222 | ipc_answer_0(rid, ENOENT); |
214 | return; |
223 | return; |
215 | } |
224 | } |
216 | if (len + 1 == NAME_MAX) { |
225 | if (len + 1 == NAME_MAX) { |
217 | /* component length overflow */ |
226 | /* component length overflow */ |
218 | ipc_answer_0(rid, ENAMETOOLONG); |
227 | ipc_answer_0(rid, ENAMETOOLONG); |
219 | return; |
228 | return; |
220 | } |
229 | } |
221 | component[len++] = ops->plb_get_char(next); |
230 | component[len++] = ops->plb_get_char(next); |
222 | next++; /* process next character */ |
231 | next++; /* process next character */ |
223 | } |
232 | } |
224 | assert(len); |
233 | assert(len); |
225 | component[len] = '\0'; |
234 | component[len] = '\0'; |
226 | len = 0; |
235 | len = 0; |
227 | 236 | ||
228 | void *nodep = ops->create(lflag); |
237 | void *nodep = ops->create(lflag); |
229 | if (nodep) { |
238 | if (nodep) { |
230 | if (!ops->link(cur, nodep, component)) { |
239 | if (!ops->link(cur, nodep, component)) { |
231 | ops->destroy(nodep); |
240 | ops->destroy(nodep); |
232 | ipc_answer_0(rid, ENOSPC); |
241 | ipc_answer_0(rid, ENOSPC); |
233 | } else { |
242 | } else { |
234 | ipc_answer_5(rid, EOK, |
243 | ipc_answer_5(rid, EOK, |
235 | fs_handle, dev_handle, |
244 | fs_handle, dev_handle, |
236 | ops->index_get(nodep), 0, |
245 | ops->index_get(nodep), 0, |
237 | ops->lnkcnt_get(nodep)); |
246 | ops->lnkcnt_get(nodep)); |
238 | } |
247 | } |
239 | } else { |
248 | } else { |
240 | ipc_answer_0(rid, ENOSPC); |
249 | ipc_answer_0(rid, ENOSPC); |
241 | } |
250 | } |
242 | return; |
251 | return; |
243 | } |
252 | } |
244 | ipc_answer_0(rid, ENOENT); |
253 | ipc_answer_0(rid, ENOENT); |
245 | return; |
254 | return; |
246 | } |
255 | } |
247 | 256 | ||
248 | /* handle hit */ |
257 | /* handle hit */ |
249 | if (lflag & L_DESTROY) { |
258 | if (lflag & L_DESTROY) { |
250 | unsigned old_lnkcnt = ops->lnkcnt_get(cur); |
259 | unsigned old_lnkcnt = ops->lnkcnt_get(cur); |
251 | int res = ops->unlink(cur); |
260 | int res = ops->unlink(cur); |
252 | ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle, |
261 | ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle, |
253 | ops->index_get(cur), ops->size_get(cur), old_lnkcnt); |
262 | ops->index_get(cur), ops->size_get(cur), old_lnkcnt); |
254 | return; |
263 | return; |
255 | } |
264 | } |
256 | if ((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) { |
265 | if ((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) { |
257 | ipc_answer_0(rid, EEXIST); |
266 | ipc_answer_0(rid, EEXIST); |
258 | return; |
267 | return; |
259 | } |
268 | } |
260 | if ((lflag & L_FILE) && (ops->is_directory(cur))) { |
269 | if ((lflag & L_FILE) && (ops->is_directory(cur))) { |
261 | ipc_answer_0(rid, EISDIR); |
270 | ipc_answer_0(rid, EISDIR); |
262 | return; |
271 | return; |
263 | } |
272 | } |
264 | if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) { |
273 | if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) { |
265 | ipc_answer_0(rid, ENOTDIR); |
274 | ipc_answer_0(rid, ENOTDIR); |
266 | return; |
275 | return; |
267 | } |
276 | } |
268 | 277 | ||
269 | ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur), |
278 | ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur), |
270 | ops->size_get(cur), ops->lnkcnt_get(cur)); |
279 | ops->size_get(cur), ops->lnkcnt_get(cur)); |
271 | } |
280 | } |
272 | 281 | ||
273 | /** @} |
282 | /** @} |
274 | */ |
283 | */ |
275 | 284 |