Rev 4389 | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 4389 | Rev 4691 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2008 Jakub Jermar |
2 | * Copyright (c) 2009 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 | #include <mem.h> |
|
- | 46 | #include <sys/stat.h> |
|
45 | 47 | ||
46 | /** Register file system server. |
48 | /** Register file system server. |
47 | * |
49 | * |
48 | * This function abstracts away the tedious registration protocol from |
50 | * This function abstracts away the tedious registration protocol from |
49 | * file system implementations and lets them to reuse this registration glue |
51 | * file system implementations and lets them to reuse this registration glue |
50 | * code. |
52 | * code. |
51 | * |
53 | * |
52 | * @param vfs_phone Open phone for communication with VFS. |
54 | * @param vfs_phone Open phone for communication with VFS. |
53 | * @param reg File system registration structure. It will be |
55 | * @param reg File system registration structure. It will be |
54 | * initialized by this function. |
56 | * initialized by this function. |
55 | * @param info VFS info structure supplied by the file system |
57 | * @param info VFS info structure supplied by the file system |
56 | * implementation. |
58 | * implementation. |
57 | * @param conn Connection fibril for handling all calls originating in |
59 | * @param conn Connection fibril for handling all calls originating in |
58 | * VFS. |
60 | * VFS. |
59 | * |
61 | * |
60 | * @return EOK on success or a non-zero error code on errror. |
62 | * @return EOK on success or a non-zero error code on errror. |
61 | */ |
63 | */ |
62 | int fs_register(int vfs_phone, fs_reg_t *reg, vfs_info_t *info, |
64 | int fs_register(int vfs_phone, fs_reg_t *reg, vfs_info_t *info, |
63 | async_client_conn_t conn) |
65 | async_client_conn_t conn) |
64 | { |
66 | { |
65 | /* |
67 | /* |
66 | * Tell VFS that we are here and want to get registered. |
68 | * Tell VFS that we are here and want to get registered. |
67 | * We use the async framework because VFS will answer the request |
69 | * We use the async framework because VFS will answer the request |
68 | * out-of-order, when it knows that the operation succeeded or failed. |
70 | * out-of-order, when it knows that the operation succeeded or failed. |
69 | */ |
71 | */ |
70 | ipc_call_t answer; |
72 | ipc_call_t answer; |
71 | aid_t req = async_send_0(vfs_phone, VFS_REGISTER, &answer); |
73 | aid_t req = async_send_0(vfs_phone, VFS_IN_REGISTER, &answer); |
72 | 74 | ||
73 | /* |
75 | /* |
74 | * Send our VFS info structure to VFS. |
76 | * Send our VFS info structure to VFS. |
75 | */ |
77 | */ |
76 | int rc = ipc_data_write_start(vfs_phone, info, sizeof(*info)); |
78 | int rc = ipc_data_write_start(vfs_phone, info, sizeof(*info)); |
77 | if (rc != EOK) { |
79 | if (rc != EOK) { |
78 | async_wait_for(req, NULL); |
80 | async_wait_for(req, NULL); |
79 | return rc; |
81 | return rc; |
80 | } |
82 | } |
81 | 83 | ||
82 | /* |
84 | /* |
83 | * Ask VFS for callback connection. |
85 | * Ask VFS for callback connection. |
84 | */ |
86 | */ |
85 | ipc_connect_to_me(vfs_phone, 0, 0, 0, ®->vfs_phonehash); |
87 | ipc_connect_to_me(vfs_phone, 0, 0, 0, ®->vfs_phonehash); |
86 | 88 | ||
87 | /* |
89 | /* |
88 | * Allocate piece of address space for PLB. |
90 | * Allocate piece of address space for PLB. |
89 | */ |
91 | */ |
90 | reg->plb_ro = as_get_mappable_page(PLB_SIZE); |
92 | reg->plb_ro = as_get_mappable_page(PLB_SIZE); |
91 | if (!reg->plb_ro) { |
93 | if (!reg->plb_ro) { |
92 | async_wait_for(req, NULL); |
94 | async_wait_for(req, NULL); |
93 | return ENOMEM; |
95 | return ENOMEM; |
94 | } |
96 | } |
95 | 97 | ||
96 | /* |
98 | /* |
97 | * Request sharing the Path Lookup Buffer with VFS. |
99 | * Request sharing the Path Lookup Buffer with VFS. |
98 | */ |
100 | */ |
99 | rc = ipc_share_in_start_0_0(vfs_phone, reg->plb_ro, PLB_SIZE); |
101 | rc = ipc_share_in_start_0_0(vfs_phone, reg->plb_ro, PLB_SIZE); |
100 | if (rc) { |
102 | if (rc) { |
101 | async_wait_for(req, NULL); |
103 | async_wait_for(req, NULL); |
102 | return rc; |
104 | return rc; |
103 | } |
105 | } |
104 | 106 | ||
105 | /* |
107 | /* |
106 | * Pick up the answer for the request to the VFS_REQUEST call. |
108 | * Pick up the answer for the request to the VFS_IN_REQUEST call. |
107 | */ |
109 | */ |
108 | async_wait_for(req, NULL); |
110 | async_wait_for(req, NULL); |
109 | reg->fs_handle = (int) IPC_GET_ARG1(answer); |
111 | reg->fs_handle = (int) IPC_GET_ARG1(answer); |
110 | 112 | ||
111 | /* |
113 | /* |
112 | * Create a connection fibril to handle the callback connection. |
114 | * Create a connection fibril to handle the callback connection. |
113 | */ |
115 | */ |
114 | async_new_connection(reg->vfs_phonehash, 0, NULL, conn); |
116 | async_new_connection(reg->vfs_phonehash, 0, NULL, conn); |
115 | 117 | ||
116 | /* |
118 | /* |
117 | * Tell the async framework that other connections are to be handled by |
119 | * Tell the async framework that other connections are to be handled by |
118 | * the same connection fibril as well. |
120 | * the same connection fibril as well. |
119 | */ |
121 | */ |
120 | async_set_client_connection(conn); |
122 | async_set_client_connection(conn); |
121 | 123 | ||
122 | return IPC_GET_RETVAL(answer); |
124 | return IPC_GET_RETVAL(answer); |
123 | } |
125 | } |
124 | 126 | ||
- | 127 | void fs_node_initialize(fs_node_t *fn) |
|
- | 128 | { |
|
- | 129 | memset(fn, 0, sizeof(fs_node_t)); |
|
- | 130 | } |
|
- | 131 | ||
- | 132 | void libfs_mount(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid, |
|
- | 133 | ipc_call_t *request) |
|
- | 134 | { |
|
- | 135 | dev_handle_t mp_dev_handle = (dev_handle_t) IPC_GET_ARG1(*request); |
|
- | 136 | fs_index_t mp_fs_index = (fs_index_t) IPC_GET_ARG2(*request); |
|
- | 137 | fs_handle_t mr_fs_handle = (fs_handle_t) IPC_GET_ARG3(*request); |
|
- | 138 | dev_handle_t mr_dev_handle = (dev_handle_t) IPC_GET_ARG4(*request); |
|
- | 139 | int res; |
|
- | 140 | ipcarg_t rc; |
|
- | 141 | ||
- | 142 | ipc_call_t call; |
|
- | 143 | ipc_callid_t callid; |
|
- | 144 | ||
- | 145 | /* accept the phone */ |
|
- | 146 | callid = async_get_call(&call); |
|
- | 147 | int mountee_phone = (int)IPC_GET_ARG1(call); |
|
- | 148 | if ((IPC_GET_METHOD(call) != IPC_M_CONNECTION_CLONE) || |
|
- | 149 | mountee_phone < 0) { |
|
- | 150 | ipc_answer_0(callid, EINVAL); |
|
- | 151 | ipc_answer_0(rid, EINVAL); |
|
- | 152 | return; |
|
- | 153 | } |
|
- | 154 | ipc_answer_0(callid, EOK); /* acknowledge the mountee_phone */ |
|
- | 155 | ||
- | 156 | res = ipc_data_write_receive(&callid, NULL); |
|
- | 157 | if (!res) { |
|
- | 158 | ipc_hangup(mountee_phone); |
|
- | 159 | ipc_answer_0(callid, EINVAL); |
|
- | 160 | ipc_answer_0(rid, EINVAL); |
|
- | 161 | return; |
|
- | 162 | } |
|
- | 163 | ||
- | 164 | fs_node_t *fn = ops->node_get(mp_dev_handle, mp_fs_index); |
|
- | 165 | if (!fn) { |
|
- | 166 | ipc_hangup(mountee_phone); |
|
- | 167 | ipc_answer_0(callid, ENOENT); |
|
- | 168 | ipc_answer_0(rid, ENOENT); |
|
- | 169 | return; |
|
- | 170 | } |
|
- | 171 | ||
- | 172 | if (fn->mp_data.mp_active) { |
|
- | 173 | ipc_hangup(mountee_phone); |
|
- | 174 | ops->node_put(fn); |
|
- | 175 | ipc_answer_0(callid, EBUSY); |
|
- | 176 | ipc_answer_0(rid, EBUSY); |
|
- | 177 | return; |
|
- | 178 | } |
|
- | 179 | ||
- | 180 | rc = async_req_0_0(mountee_phone, IPC_M_CONNECT_ME); |
|
- | 181 | if (rc != 0) { |
|
- | 182 | ipc_hangup(mountee_phone); |
|
- | 183 | ops->node_put(fn); |
|
- | 184 | ipc_answer_0(callid, rc); |
|
- | 185 | ipc_answer_0(rid, rc); |
|
- | 186 | return; |
|
- | 187 | } |
|
- | 188 | ||
- | 189 | ipc_call_t answer; |
|
- | 190 | aid_t msg = async_send_1(mountee_phone, VFS_OUT_MOUNTED, mr_dev_handle, |
|
- | 191 | &answer); |
|
- | 192 | ipc_forward_fast(callid, mountee_phone, 0, 0, 0, IPC_FF_ROUTE_FROM_ME); |
|
- | 193 | async_wait_for(msg, &rc); |
|
- | 194 | ||
- | 195 | if (rc == EOK) { |
|
- | 196 | fn->mp_data.mp_active = true; |
|
- | 197 | fn->mp_data.fs_handle = mr_fs_handle; |
|
- | 198 | fn->mp_data.dev_handle = mr_dev_handle; |
|
- | 199 | fn->mp_data.phone = mountee_phone; |
|
- | 200 | } |
|
- | 201 | /* |
|
- | 202 | * Do not release the FS node so that it stays in memory. |
|
- | 203 | */ |
|
- | 204 | ipc_answer_3(rid, rc, IPC_GET_ARG1(answer), IPC_GET_ARG2(answer), |
|
- | 205 | IPC_GET_ARG3(answer)); |
|
- | 206 | } |
|
- | 207 | ||
125 | /** Lookup VFS triplet by name in the file system name space. |
208 | /** Lookup VFS triplet by name in the file system name space. |
126 | * |
209 | * |
127 | * The path passed in the PLB must be in the canonical file system path format |
210 | * The path passed in the PLB must be in the canonical file system path format |
128 | * as returned by the canonify() function. |
211 | * as returned by the canonify() function. |
129 | * |
212 | * |
130 | * @param ops libfs operations structure with function pointers to |
213 | * @param ops libfs operations structure with function pointers to |
131 | * file system implementation |
214 | * file system implementation |
132 | * @param fs_handle File system handle of the file system where to perform |
215 | * @param fs_handle File system handle of the file system where to perform |
133 | * the lookup. |
216 | * the lookup. |
134 | * @param rid Request ID of the VFS_LOOKUP request. |
217 | * @param rid Request ID of the VFS_OUT_LOOKUP request. |
135 | * @param request VFS_LOOKUP request data itself. |
218 | * @param request VFS_OUT_LOOKUP request data itself. |
- | 219 | * |
|
136 | */ |
220 | */ |
137 | void libfs_lookup(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid, |
221 | void libfs_lookup(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid, |
138 | ipc_call_t *request) |
222 | ipc_call_t *request) |
139 | { |
223 | { |
140 | unsigned next = IPC_GET_ARG1(*request); |
224 | unsigned first = IPC_GET_ARG1(*request); |
141 | unsigned last = IPC_GET_ARG2(*request); |
225 | unsigned last = IPC_GET_ARG2(*request); |
- | 226 | unsigned next = first; |
|
142 | dev_handle_t dev_handle = IPC_GET_ARG3(*request); |
227 | dev_handle_t dev_handle = IPC_GET_ARG3(*request); |
143 | int lflag = IPC_GET_ARG4(*request); |
228 | int lflag = IPC_GET_ARG4(*request); |
144 | fs_index_t index = IPC_GET_ARG5(*request); /* when L_LINK specified */ |
229 | fs_index_t index = IPC_GET_ARG5(*request); /* when L_LINK specified */ |
145 | char component[NAME_MAX + 1]; |
230 | char component[NAME_MAX + 1]; |
146 | int len; |
231 | int len; |
147 | 232 | ||
148 | if (last < next) |
233 | if (last < next) |
149 | last += PLB_SIZE; |
234 | last += PLB_SIZE; |
150 | 235 | ||
151 | fs_node_t *par = NULL; |
236 | fs_node_t *par = NULL; |
152 | fs_node_t *cur = ops->root_get(dev_handle); |
237 | fs_node_t *cur = ops->root_get(dev_handle); |
153 | fs_node_t *tmp = NULL; |
238 | fs_node_t *tmp = NULL; |
154 | 239 | ||
- | 240 | if (cur->mp_data.mp_active) { |
|
- | 241 | ipc_forward_slow(rid, cur->mp_data.phone, VFS_OUT_LOOKUP, |
|
- | 242 | next, last, cur->mp_data.dev_handle, lflag, index, |
|
- | 243 | IPC_FF_ROUTE_FROM_ME); |
|
- | 244 | ops->node_put(cur); |
|
- | 245 | return; |
|
- | 246 | } |
|
- | 247 | ||
155 | if (ops->plb_get_char(next) == '/') |
248 | if (ops->plb_get_char(next) == '/') |
156 | next++; /* eat slash */ |
249 | next++; /* eat slash */ |
157 | 250 | ||
158 | while (next <= last && ops->has_children(cur)) { |
251 | while (next <= last && ops->has_children(cur)) { |
159 | /* collect the component */ |
252 | /* collect the component */ |
160 | len = 0; |
253 | len = 0; |
161 | while ((next <= last) && (ops->plb_get_char(next) != '/')) { |
254 | while ((next <= last) && (ops->plb_get_char(next) != '/')) { |
162 | if (len + 1 == NAME_MAX) { |
255 | if (len + 1 == NAME_MAX) { |
163 | /* component length overflow */ |
256 | /* component length overflow */ |
164 | ipc_answer_0(rid, ENAMETOOLONG); |
257 | ipc_answer_0(rid, ENAMETOOLONG); |
165 | goto out; |
258 | goto out; |
166 | } |
259 | } |
167 | component[len++] = ops->plb_get_char(next); |
260 | component[len++] = ops->plb_get_char(next); |
168 | next++; /* process next character */ |
261 | next++; /* process next character */ |
169 | } |
262 | } |
170 | 263 | ||
171 | assert(len); |
264 | assert(len); |
172 | component[len] = '\0'; |
265 | component[len] = '\0'; |
173 | next++; /* eat slash */ |
266 | next++; /* eat slash */ |
174 | 267 | ||
175 | /* match the component */ |
268 | /* match the component */ |
176 | tmp = ops->match(cur, component); |
269 | tmp = ops->match(cur, component); |
- | 270 | if (tmp && tmp->mp_data.mp_active) { |
|
- | 271 | if (next > last) |
|
- | 272 | next = last = first; |
|
- | 273 | else |
|
- | 274 | next--; |
|
- | 275 | ||
- | 276 | ipc_forward_slow(rid, tmp->mp_data.phone, |
|
- | 277 | VFS_OUT_LOOKUP, next, last, tmp->mp_data.dev_handle, |
|
- | 278 | lflag, index, IPC_FF_ROUTE_FROM_ME); |
|
- | 279 | ops->node_put(cur); |
|
- | 280 | ops->node_put(tmp); |
|
- | 281 | if (par) |
|
- | 282 | ops->node_put(par); |
|
- | 283 | return; |
|
- | 284 | } |
|
177 | 285 | ||
178 | /* handle miss: match amongst siblings */ |
286 | /* handle miss: match amongst siblings */ |
179 | if (!tmp) { |
287 | if (!tmp) { |
180 | if (next <= last) { |
288 | if (next <= last) { |
181 | /* there are unprocessed components */ |
289 | /* there are unprocessed components */ |
182 | ipc_answer_0(rid, ENOENT); |
290 | ipc_answer_0(rid, ENOENT); |
183 | goto out; |
291 | goto out; |
184 | } |
292 | } |
185 | /* miss in the last component */ |
293 | /* miss in the last component */ |
186 | if (lflag & (L_CREATE | L_LINK)) { |
294 | if (lflag & (L_CREATE | L_LINK)) { |
187 | /* request to create a new link */ |
295 | /* request to create a new link */ |
188 | if (!ops->is_directory(cur)) { |
296 | if (!ops->is_directory(cur)) { |
189 | ipc_answer_0(rid, ENOTDIR); |
297 | ipc_answer_0(rid, ENOTDIR); |
190 | goto out; |
298 | goto out; |
191 | } |
299 | } |
192 | fs_node_t *fn; |
300 | fs_node_t *fn; |
193 | if (lflag & L_CREATE) |
301 | if (lflag & L_CREATE) |
194 | fn = ops->create(dev_handle, lflag); |
302 | fn = ops->create(dev_handle, lflag); |
195 | else |
303 | else |
196 | fn = ops->node_get(dev_handle, |
304 | fn = ops->node_get(dev_handle, |
197 | index); |
305 | index); |
198 | if (fn) { |
306 | if (fn) { |
199 | int rc; |
307 | int rc; |
200 | 308 | ||
201 | rc = ops->link(cur, fn, component); |
309 | rc = ops->link(cur, fn, component); |
202 | if (rc != EOK) { |
310 | if (rc != EOK) { |
203 | if (lflag & L_CREATE) { |
311 | if (lflag & L_CREATE) { |
204 | (void)ops->destroy(fn); |
312 | (void)ops->destroy(fn); |
205 | } |
313 | } |
206 | ipc_answer_0(rid, rc); |
314 | ipc_answer_0(rid, rc); |
207 | } else { |
315 | } else { |
208 | ipc_answer_5(rid, EOK, |
316 | ipc_answer_5(rid, EOK, |
209 | fs_handle, dev_handle, |
317 | fs_handle, dev_handle, |
210 | ops->index_get(fn), |
318 | ops->index_get(fn), |
211 | ops->size_get(fn), |
319 | ops->size_get(fn), |
212 | ops->lnkcnt_get(fn)); |
320 | ops->lnkcnt_get(fn)); |
213 | ops->node_put(fn); |
321 | ops->node_put(fn); |
214 | } |
322 | } |
215 | } else { |
323 | } else { |
216 | ipc_answer_0(rid, ENOSPC); |
324 | ipc_answer_0(rid, ENOSPC); |
217 | } |
325 | } |
218 | goto out; |
326 | goto out; |
219 | } |
327 | } |
220 | ipc_answer_0(rid, ENOENT); |
328 | ipc_answer_0(rid, ENOENT); |
221 | goto out; |
329 | goto out; |
222 | } |
330 | } |
223 | 331 | ||
224 | if (par) |
332 | if (par) |
225 | ops->node_put(par); |
333 | ops->node_put(par); |
226 | 334 | ||
227 | /* descend one level */ |
335 | /* descend one level */ |
228 | par = cur; |
336 | par = cur; |
229 | cur = tmp; |
337 | cur = tmp; |
230 | tmp = NULL; |
338 | tmp = NULL; |
231 | } |
339 | } |
232 | 340 | ||
233 | /* handle miss: excessive components */ |
341 | /* handle miss: excessive components */ |
234 | if (next <= last && !ops->has_children(cur)) { |
342 | if (next <= last && !ops->has_children(cur)) { |
235 | if (lflag & (L_CREATE | L_LINK)) { |
343 | if (lflag & (L_CREATE | L_LINK)) { |
236 | if (!ops->is_directory(cur)) { |
344 | if (!ops->is_directory(cur)) { |
237 | ipc_answer_0(rid, ENOTDIR); |
345 | ipc_answer_0(rid, ENOTDIR); |
238 | goto out; |
346 | goto out; |
239 | } |
347 | } |
240 | 348 | ||
241 | /* collect next component */ |
349 | /* collect next component */ |
242 | len = 0; |
350 | len = 0; |
243 | while (next <= last) { |
351 | while (next <= last) { |
244 | if (ops->plb_get_char(next) == '/') { |
352 | if (ops->plb_get_char(next) == '/') { |
245 | /* more than one component */ |
353 | /* more than one component */ |
246 | ipc_answer_0(rid, ENOENT); |
354 | ipc_answer_0(rid, ENOENT); |
247 | goto out; |
355 | goto out; |
248 | } |
356 | } |
249 | if (len + 1 == NAME_MAX) { |
357 | if (len + 1 == NAME_MAX) { |
250 | /* component length overflow */ |
358 | /* component length overflow */ |
251 | ipc_answer_0(rid, ENAMETOOLONG); |
359 | ipc_answer_0(rid, ENAMETOOLONG); |
252 | goto out; |
360 | goto out; |
253 | } |
361 | } |
254 | component[len++] = ops->plb_get_char(next); |
362 | component[len++] = ops->plb_get_char(next); |
255 | next++; /* process next character */ |
363 | next++; /* process next character */ |
256 | } |
364 | } |
257 | assert(len); |
365 | assert(len); |
258 | component[len] = '\0'; |
366 | component[len] = '\0'; |
259 | 367 | ||
260 | fs_node_t *fn; |
368 | fs_node_t *fn; |
261 | if (lflag & L_CREATE) |
369 | if (lflag & L_CREATE) |
262 | fn = ops->create(dev_handle, lflag); |
370 | fn = ops->create(dev_handle, lflag); |
263 | else |
371 | else |
264 | fn = ops->node_get(dev_handle, index); |
372 | fn = ops->node_get(dev_handle, index); |
265 | if (fn) { |
373 | if (fn) { |
266 | int rc; |
374 | int rc; |
267 | 375 | ||
268 | rc = ops->link(cur, fn, component); |
376 | rc = ops->link(cur, fn, component); |
269 | if (rc != EOK) { |
377 | if (rc != EOK) { |
270 | if (lflag & L_CREATE) |
378 | if (lflag & L_CREATE) |
271 | (void)ops->destroy(fn); |
379 | (void)ops->destroy(fn); |
272 | ipc_answer_0(rid, rc); |
380 | ipc_answer_0(rid, rc); |
273 | } else { |
381 | } else { |
274 | ipc_answer_5(rid, EOK, |
382 | ipc_answer_5(rid, EOK, |
275 | fs_handle, dev_handle, |
383 | fs_handle, dev_handle, |
276 | ops->index_get(fn), |
384 | ops->index_get(fn), |
277 | ops->size_get(fn), |
385 | ops->size_get(fn), |
278 | ops->lnkcnt_get(fn)); |
386 | ops->lnkcnt_get(fn)); |
279 | ops->node_put(fn); |
387 | ops->node_put(fn); |
280 | } |
388 | } |
281 | } else { |
389 | } else { |
282 | ipc_answer_0(rid, ENOSPC); |
390 | ipc_answer_0(rid, ENOSPC); |
283 | } |
391 | } |
284 | goto out; |
392 | goto out; |
285 | } |
393 | } |
286 | ipc_answer_0(rid, ENOENT); |
394 | ipc_answer_0(rid, ENOENT); |
287 | goto out; |
395 | goto out; |
288 | } |
396 | } |
289 | 397 | ||
290 | /* handle hit */ |
398 | /* handle hit */ |
291 | if (lflag & L_UNLINK) { |
399 | if (lflag & L_UNLINK) { |
292 | unsigned old_lnkcnt = ops->lnkcnt_get(cur); |
400 | unsigned old_lnkcnt = ops->lnkcnt_get(cur); |
293 | int res = ops->unlink(par, cur, component); |
401 | int res = ops->unlink(par, cur, component); |
294 | ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle, |
402 | ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle, |
295 | ops->index_get(cur), ops->size_get(cur), old_lnkcnt); |
403 | ops->index_get(cur), ops->size_get(cur), old_lnkcnt); |
296 | goto out; |
404 | goto out; |
297 | } |
405 | } |
298 | if (((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) || |
406 | if (((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) || |
299 | (lflag & L_LINK)) { |
407 | (lflag & L_LINK)) { |
300 | ipc_answer_0(rid, EEXIST); |
408 | ipc_answer_0(rid, EEXIST); |
301 | goto out; |
409 | goto out; |
302 | } |
410 | } |
303 | if ((lflag & L_FILE) && (ops->is_directory(cur))) { |
411 | if ((lflag & L_FILE) && (ops->is_directory(cur))) { |
304 | ipc_answer_0(rid, EISDIR); |
412 | ipc_answer_0(rid, EISDIR); |
305 | goto out; |
413 | goto out; |
306 | } |
414 | } |
307 | if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) { |
415 | if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) { |
308 | ipc_answer_0(rid, ENOTDIR); |
416 | ipc_answer_0(rid, ENOTDIR); |
309 | goto out; |
417 | goto out; |
310 | } |
418 | } |
311 | 419 | ||
312 | ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur), |
420 | ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur), |
313 | ops->size_get(cur), ops->lnkcnt_get(cur)); |
421 | ops->size_get(cur), ops->lnkcnt_get(cur)); |
314 | 422 | ||
315 | out: |
423 | out: |
316 | if (par) |
424 | if (par) |
317 | ops->node_put(par); |
425 | ops->node_put(par); |
318 | if (cur) |
426 | if (cur) |
319 | ops->node_put(cur); |
427 | ops->node_put(cur); |
320 | if (tmp) |
428 | if (tmp) |
321 | ops->node_put(tmp); |
429 | ops->node_put(tmp); |
322 | } |
430 | } |
- | 431 | ||
- | 432 | void libfs_stat(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid, |
|
- | 433 | ipc_call_t *request) |
|
- | 434 | { |
|
- | 435 | dev_handle_t dev_handle = (dev_handle_t) IPC_GET_ARG1(*request); |
|
- | 436 | fs_index_t index = (fs_index_t) IPC_GET_ARG2(*request); |
|
- | 437 | fs_node_t *fn = ops->node_get(dev_handle, index); |
|
- | 438 | ||
- | 439 | ipc_callid_t callid; |
|
- | 440 | size_t size; |
|
- | 441 | if (!ipc_data_read_receive(&callid, &size) || |
|
- | 442 | size != sizeof(struct stat)) { |
|
- | 443 | ipc_answer_0(callid, EINVAL); |
|
- | 444 | ipc_answer_0(rid, EINVAL); |
|
- | 445 | return; |
|
- | 446 | } |
|
- | 447 | ||
- | 448 | struct stat stat; |
|
- | 449 | memset(&stat, 0, sizeof(struct stat)); |
|
- | 450 | ||
- | 451 | stat.fs_handle = fs_handle; |
|
- | 452 | stat.dev_handle = dev_handle; |
|
- | 453 | stat.index = index; |
|
- | 454 | stat.lnkcnt = ops->lnkcnt_get(fn); |
|
- | 455 | stat.is_file = ops->is_file(fn); |
|
- | 456 | stat.size = ops->size_get(fn); |
|
- | 457 | ||
- | 458 | ipc_data_read_finalize(callid, &stat, sizeof(struct stat)); |
|
- | 459 | ipc_answer_0(rid, EOK); |
|
- | 460 | } |
|
- | 461 | ||
- | 462 | /** Open VFS triplet. |
|
- | 463 | * |
|
- | 464 | * @param ops libfs operations structure with function pointers to |
|
- | 465 | * file system implementation |
|
- | 466 | * @param rid Request ID of the VFS_OUT_OPEN_NODE request. |
|
- | 467 | * @param request VFS_OUT_OPEN_NODE request data itself. |
|
- | 468 | * |
|
- | 469 | */ |
|
- | 470 | void libfs_open_node(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid, |
|
- | 471 | ipc_call_t *request) |
|
- | 472 | { |
|
- | 473 | dev_handle_t dev_handle = IPC_GET_ARG1(*request); |
|
- | 474 | fs_index_t index = IPC_GET_ARG2(*request); |
|
- | 475 | ||
- | 476 | fs_node_t *node = ops->node_get(dev_handle, index); |
|
- | 477 | ||
- | 478 | if (node == NULL) { |
|
- | 479 | ipc_answer_0(rid, ENOENT); |
|
- | 480 | return; |
|
- | 481 | } |
|
- | 482 | ||
- | 483 | ipc_answer_5(rid, EOK, fs_handle, dev_handle, index, |
|
- | 484 | ops->size_get(node), ops->lnkcnt_get(node)); |
|
- | 485 | ||
- | 486 | ops->node_put(node); |
|
- | 487 | } |
|
323 | 488 | ||
324 | /** @} |
489 | /** @} |
325 | */ |
490 | */ |
326 | 491 |