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