Rev 3403 | Rev 3588 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3403 | Rev 3535 | ||
---|---|---|---|
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 "../../srv/rd/rd.h" |
- | |
40 | #include <errno.h> |
39 | #include <errno.h> |
41 | #include <async.h> |
40 | #include <async.h> |
42 | #include <ipc/ipc.h> |
41 | #include <ipc/ipc.h> |
43 | #include <as.h> |
42 | #include <as.h> |
44 | #include <assert.h> |
43 | #include <assert.h> |
45 | #include <dirent.h> |
44 | #include <dirent.h> |
46 | 45 | ||
47 | /** Register file system server. |
46 | /** Register file system server. |
48 | * |
47 | * |
49 | * This function abstracts away the tedious registration protocol from |
48 | * This function abstracts away the tedious registration protocol from |
50 | * file system implementations and lets them to reuse this registration glue |
49 | * file system implementations and lets them to reuse this registration glue |
51 | * code. |
50 | * code. |
52 | * |
51 | * |
53 | * @param vfs_phone Open phone for communication with VFS. |
52 | * @param vfs_phone Open phone for communication with VFS. |
54 | * @param reg File system registration structure. It will be |
53 | * @param reg File system registration structure. It will be |
55 | * initialized by this function. |
54 | * initialized by this function. |
56 | * @param info VFS info structure supplied by the file system |
55 | * @param info VFS info structure supplied by the file system |
57 | * implementation. |
56 | * implementation. |
58 | * @param conn Connection fibril for handling all calls originating in |
57 | * @param conn Connection fibril for handling all calls originating in |
59 | * VFS. |
58 | * VFS. |
60 | * |
59 | * |
61 | * @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. |
62 | */ |
61 | */ |
63 | 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, |
64 | async_client_conn_t conn) |
63 | async_client_conn_t conn) |
65 | { |
64 | { |
66 | /* |
65 | /* |
67 | * Tell VFS that we are here and want to get registered. |
66 | * Tell VFS that we are here and want to get registered. |
68 | * We use the async framework because VFS will answer the request |
67 | * We use the async framework because VFS will answer the request |
69 | * 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. |
70 | */ |
69 | */ |
71 | ipc_call_t answer; |
70 | ipc_call_t answer; |
72 | aid_t req = async_send_0(vfs_phone, VFS_REGISTER, &answer); |
71 | aid_t req = async_send_0(vfs_phone, VFS_REGISTER, &answer); |
73 | 72 | ||
74 | /* |
73 | /* |
75 | * Send our VFS info structure to VFS. |
74 | * Send our VFS info structure to VFS. |
76 | */ |
75 | */ |
77 | int rc = ipc_data_write_start(vfs_phone, info, sizeof(*info)); |
76 | int rc = ipc_data_write_start(vfs_phone, info, sizeof(*info)); |
78 | if (rc != EOK) { |
77 | if (rc != EOK) { |
79 | async_wait_for(req, NULL); |
78 | async_wait_for(req, NULL); |
80 | return rc; |
79 | return rc; |
81 | } |
80 | } |
82 | 81 | ||
83 | /* |
82 | /* |
84 | * Ask VFS for callback connection. |
83 | * Ask VFS for callback connection. |
85 | */ |
84 | */ |
86 | ipc_connect_to_me(vfs_phone, 0, 0, 0, ®->vfs_phonehash); |
85 | ipc_connect_to_me(vfs_phone, 0, 0, 0, ®->vfs_phonehash); |
87 | 86 | ||
88 | /* |
87 | /* |
89 | * Allocate piece of address space for PLB. |
88 | * Allocate piece of address space for PLB. |
90 | */ |
89 | */ |
91 | reg->plb_ro = as_get_mappable_page(PLB_SIZE); |
90 | reg->plb_ro = as_get_mappable_page(PLB_SIZE); |
92 | if (!reg->plb_ro) { |
91 | if (!reg->plb_ro) { |
93 | async_wait_for(req, NULL); |
92 | async_wait_for(req, NULL); |
94 | return ENOMEM; |
93 | return ENOMEM; |
95 | } |
94 | } |
96 | 95 | ||
97 | /* |
96 | /* |
98 | * Request sharing the Path Lookup Buffer with VFS. |
97 | * Request sharing the Path Lookup Buffer with VFS. |
99 | */ |
98 | */ |
100 | 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); |
101 | if (rc) { |
100 | if (rc) { |
102 | async_wait_for(req, NULL); |
101 | async_wait_for(req, NULL); |
103 | return rc; |
102 | return rc; |
104 | } |
103 | } |
105 | 104 | ||
106 | /* |
105 | /* |
107 | * 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. |
108 | */ |
107 | */ |
109 | async_wait_for(req, NULL); |
108 | async_wait_for(req, NULL); |
110 | reg->fs_handle = (int) IPC_GET_ARG1(answer); |
109 | reg->fs_handle = (int) IPC_GET_ARG1(answer); |
111 | 110 | ||
112 | /* |
111 | /* |
113 | * Create a connection fibril to handle the callback connection. |
112 | * Create a connection fibril to handle the callback connection. |
114 | */ |
113 | */ |
115 | async_new_connection(reg->vfs_phonehash, 0, NULL, conn); |
114 | async_new_connection(reg->vfs_phonehash, 0, NULL, conn); |
116 | 115 | ||
117 | /* |
116 | /* |
118 | * 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 |
119 | * the same connection fibril as well. |
118 | * the same connection fibril as well. |
120 | */ |
119 | */ |
121 | async_set_client_connection(conn); |
120 | async_set_client_connection(conn); |
122 | 121 | ||
123 | return IPC_GET_RETVAL(answer); |
122 | return IPC_GET_RETVAL(answer); |
124 | } |
123 | } |
125 | 124 | ||
126 | /** Lookup VFS triplet by name in the file system name space. |
125 | /** Lookup VFS triplet by name in the file system name space. |
127 | * |
126 | * |
128 | * The path passed in the PLB must be in the canonical file system path format |
127 | * The path passed in the PLB must be in the canonical file system path format |
129 | * as returned by the canonify() function. |
128 | * as returned by the canonify() function. |
130 | * |
129 | * |
131 | * @param ops libfs operations structure with function pointers to |
130 | * @param ops libfs operations structure with function pointers to |
132 | * file system implementation |
131 | * file system implementation |
133 | * @param fs_handle File system handle of the file system where to perform |
132 | * @param fs_handle File system handle of the file system where to perform |
134 | * the lookup. |
133 | * the lookup. |
135 | * @param rid Request ID of the VFS_LOOKUP request. |
134 | * @param rid Request ID of the VFS_LOOKUP request. |
136 | * @param request VFS_LOOKUP request data itself. |
135 | * @param request VFS_LOOKUP request data itself. |
137 | */ |
136 | */ |
138 | void libfs_lookup(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid, |
137 | void libfs_lookup(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid, |
139 | ipc_call_t *request) |
138 | ipc_call_t *request) |
140 | { |
139 | { |
141 | unsigned next = IPC_GET_ARG1(*request); |
140 | unsigned next = IPC_GET_ARG1(*request); |
142 | unsigned last = IPC_GET_ARG2(*request); |
141 | unsigned last = IPC_GET_ARG2(*request); |
143 | dev_handle_t dev_handle = IPC_GET_ARG3(*request); |
142 | dev_handle_t dev_handle = IPC_GET_ARG3(*request); |
144 | int lflag = IPC_GET_ARG4(*request); |
143 | int lflag = IPC_GET_ARG4(*request); |
145 | fs_index_t index = IPC_GET_ARG5(*request); /* when L_LINK specified */ |
144 | fs_index_t index = IPC_GET_ARG5(*request); /* when L_LINK specified */ |
146 | char component[NAME_MAX + 1]; |
145 | char component[NAME_MAX + 1]; |
147 | int len; |
146 | int len; |
148 | 147 | ||
149 | if (last < next) |
148 | if (last < next) |
150 | last += PLB_SIZE; |
149 | last += PLB_SIZE; |
151 | 150 | ||
152 | void *par = NULL; |
151 | void *par = NULL; |
153 | void *cur = ops->root_get(dev_handle); |
152 | void *cur = ops->root_get(dev_handle); |
154 | void *tmp = NULL; |
153 | void *tmp = NULL; |
155 | 154 | ||
156 | if (ops->plb_get_char(next) == '/') |
155 | if (ops->plb_get_char(next) == '/') |
157 | next++; /* eat slash */ |
156 | next++; /* eat slash */ |
158 | 157 | ||
159 | while (next <= last && ops->has_children(cur)) { |
158 | while (next <= last && ops->has_children(cur)) { |
160 | /* collect the component */ |
159 | /* collect the component */ |
161 | len = 0; |
160 | len = 0; |
162 | while ((next <= last) && (ops->plb_get_char(next) != '/')) { |
161 | while ((next <= last) && (ops->plb_get_char(next) != '/')) { |
163 | if (len + 1 == NAME_MAX) { |
162 | if (len + 1 == NAME_MAX) { |
164 | /* component length overflow */ |
163 | /* component length overflow */ |
165 | ipc_answer_0(rid, ENAMETOOLONG); |
164 | ipc_answer_0(rid, ENAMETOOLONG); |
166 | goto out; |
165 | goto out; |
167 | } |
166 | } |
168 | component[len++] = ops->plb_get_char(next); |
167 | component[len++] = ops->plb_get_char(next); |
169 | next++; /* process next character */ |
168 | next++; /* process next character */ |
170 | } |
169 | } |
171 | 170 | ||
172 | assert(len); |
171 | assert(len); |
173 | component[len] = '\0'; |
172 | component[len] = '\0'; |
174 | next++; /* eat slash */ |
173 | next++; /* eat slash */ |
175 | 174 | ||
176 | /* match the component */ |
175 | /* match the component */ |
177 | tmp = ops->match(cur, component); |
176 | tmp = ops->match(cur, component); |
178 | 177 | ||
179 | /* handle miss: match amongst siblings */ |
178 | /* handle miss: match amongst siblings */ |
180 | if (!tmp) { |
179 | if (!tmp) { |
181 | if (next <= last) { |
180 | if (next <= last) { |
182 | /* there are unprocessed components */ |
181 | /* there are unprocessed components */ |
183 | ipc_answer_0(rid, ENOENT); |
182 | ipc_answer_0(rid, ENOENT); |
184 | goto out; |
183 | goto out; |
185 | } |
184 | } |
186 | /* miss in the last component */ |
185 | /* miss in the last component */ |
187 | if (lflag & (L_CREATE | L_LINK)) { |
186 | if (lflag & (L_CREATE | L_LINK)) { |
188 | /* request to create a new link */ |
187 | /* request to create a new link */ |
189 | if (!ops->is_directory(cur)) { |
188 | if (!ops->is_directory(cur)) { |
190 | ipc_answer_0(rid, ENOTDIR); |
189 | ipc_answer_0(rid, ENOTDIR); |
191 | goto out; |
190 | goto out; |
192 | } |
191 | } |
193 | void *nodep; |
192 | void *nodep; |
194 | if (lflag & L_CREATE) |
193 | if (lflag & L_CREATE) |
195 | nodep = ops->create(lflag); |
194 | nodep = ops->create(lflag); |
196 | else |
195 | else |
197 | nodep = ops->node_get(dev_handle, |
196 | nodep = ops->node_get(dev_handle, |
198 | index); |
197 | index); |
199 | if (nodep) { |
198 | if (nodep) { |
200 | if (!ops->link(cur, nodep, component)) { |
199 | if (!ops->link(cur, nodep, component)) { |
201 | if (lflag & L_CREATE) { |
200 | if (lflag & L_CREATE) { |
202 | (void)ops->destroy( |
201 | (void)ops->destroy( |
203 | nodep); |
202 | nodep); |
204 | } |
203 | } |
205 | ipc_answer_0(rid, ENOSPC); |
204 | ipc_answer_0(rid, ENOSPC); |
206 | } else { |
205 | } else { |
207 | ipc_answer_5(rid, EOK, |
206 | ipc_answer_5(rid, EOK, |
208 | fs_handle, dev_handle, |
207 | fs_handle, dev_handle, |
209 | ops->index_get(nodep), |
208 | ops->index_get(nodep), |
210 | ops->size_get(nodep), |
209 | ops->size_get(nodep), |
211 | ops->lnkcnt_get(nodep)); |
210 | ops->lnkcnt_get(nodep)); |
212 | ops->node_put(nodep); |
211 | ops->node_put(nodep); |
213 | } |
212 | } |
214 | } else { |
213 | } else { |
215 | ipc_answer_0(rid, ENOSPC); |
214 | ipc_answer_0(rid, ENOSPC); |
216 | } |
215 | } |
217 | goto out; |
216 | goto out; |
218 | } else if (lflag & L_PARENT) { |
217 | } else if (lflag & L_PARENT) { |
219 | /* return parent */ |
218 | /* return parent */ |
220 | ipc_answer_5(rid, EOK, fs_handle, dev_handle, |
219 | ipc_answer_5(rid, EOK, fs_handle, dev_handle, |
221 | ops->index_get(cur), ops->size_get(cur), |
220 | ops->index_get(cur), ops->size_get(cur), |
222 | ops->lnkcnt_get(cur)); |
221 | ops->lnkcnt_get(cur)); |
223 | } |
222 | } |
224 | ipc_answer_0(rid, ENOENT); |
223 | ipc_answer_0(rid, ENOENT); |
225 | goto out; |
224 | goto out; |
226 | } |
225 | } |
227 | 226 | ||
228 | if (par) |
227 | if (par) |
229 | ops->node_put(par); |
228 | ops->node_put(par); |
230 | 229 | ||
231 | /* descend one level */ |
230 | /* descend one level */ |
232 | par = cur; |
231 | par = cur; |
233 | cur = tmp; |
232 | cur = tmp; |
234 | tmp = NULL; |
233 | tmp = NULL; |
235 | } |
234 | } |
236 | 235 | ||
237 | /* handle miss: excessive components */ |
236 | /* handle miss: excessive components */ |
238 | if (next <= last && !ops->has_children(cur)) { |
237 | if (next <= last && !ops->has_children(cur)) { |
239 | if (lflag & (L_CREATE | L_LINK)) { |
238 | if (lflag & (L_CREATE | L_LINK)) { |
240 | if (!ops->is_directory(cur)) { |
239 | if (!ops->is_directory(cur)) { |
241 | ipc_answer_0(rid, ENOTDIR); |
240 | ipc_answer_0(rid, ENOTDIR); |
242 | goto out; |
241 | goto out; |
243 | } |
242 | } |
244 | 243 | ||
245 | /* collect next component */ |
244 | /* collect next component */ |
246 | len = 0; |
245 | len = 0; |
247 | while (next <= last) { |
246 | while (next <= last) { |
248 | if (ops->plb_get_char(next) == '/') { |
247 | if (ops->plb_get_char(next) == '/') { |
249 | /* more than one component */ |
248 | /* more than one component */ |
250 | ipc_answer_0(rid, ENOENT); |
249 | ipc_answer_0(rid, ENOENT); |
251 | goto out; |
250 | goto out; |
252 | } |
251 | } |
253 | if (len + 1 == NAME_MAX) { |
252 | if (len + 1 == NAME_MAX) { |
254 | /* component length overflow */ |
253 | /* component length overflow */ |
255 | ipc_answer_0(rid, ENAMETOOLONG); |
254 | ipc_answer_0(rid, ENAMETOOLONG); |
256 | goto out; |
255 | goto out; |
257 | } |
256 | } |
258 | component[len++] = ops->plb_get_char(next); |
257 | component[len++] = ops->plb_get_char(next); |
259 | next++; /* process next character */ |
258 | next++; /* process next character */ |
260 | } |
259 | } |
261 | assert(len); |
260 | assert(len); |
262 | component[len] = '\0'; |
261 | component[len] = '\0'; |
263 | 262 | ||
264 | void *nodep; |
263 | void *nodep; |
265 | if (lflag & L_CREATE) |
264 | if (lflag & L_CREATE) |
266 | nodep = ops->create(lflag); |
265 | nodep = ops->create(lflag); |
267 | else |
266 | else |
268 | nodep = ops->node_get(dev_handle, index); |
267 | nodep = ops->node_get(dev_handle, index); |
269 | if (nodep) { |
268 | if (nodep) { |
270 | if (!ops->link(cur, nodep, component)) { |
269 | if (!ops->link(cur, nodep, component)) { |
271 | if (lflag & L_CREATE) |
270 | if (lflag & L_CREATE) |
272 | (void)ops->destroy(nodep); |
271 | (void)ops->destroy(nodep); |
273 | ipc_answer_0(rid, ENOSPC); |
272 | ipc_answer_0(rid, ENOSPC); |
274 | } else { |
273 | } else { |
275 | ipc_answer_5(rid, EOK, |
274 | ipc_answer_5(rid, EOK, |
276 | fs_handle, dev_handle, |
275 | fs_handle, dev_handle, |
277 | ops->index_get(nodep), |
276 | ops->index_get(nodep), |
278 | ops->size_get(nodep), |
277 | ops->size_get(nodep), |
279 | ops->lnkcnt_get(nodep)); |
278 | ops->lnkcnt_get(nodep)); |
280 | ops->node_put(nodep); |
279 | ops->node_put(nodep); |
281 | } |
280 | } |
282 | } else { |
281 | } else { |
283 | ipc_answer_0(rid, ENOSPC); |
282 | ipc_answer_0(rid, ENOSPC); |
284 | } |
283 | } |
285 | goto out; |
284 | goto out; |
286 | } |
285 | } |
287 | ipc_answer_0(rid, ENOENT); |
286 | ipc_answer_0(rid, ENOENT); |
288 | goto out; |
287 | goto out; |
289 | } |
288 | } |
290 | 289 | ||
291 | /* handle hit */ |
290 | /* handle hit */ |
292 | if (lflag & L_PARENT) { |
291 | if (lflag & L_PARENT) { |
293 | ops->node_put(cur); |
292 | ops->node_put(cur); |
294 | cur = par; |
293 | cur = par; |
295 | par = NULL; |
294 | par = NULL; |
296 | if (!cur) { |
295 | if (!cur) { |
297 | ipc_answer_0(rid, ENOENT); |
296 | ipc_answer_0(rid, ENOENT); |
298 | goto out; |
297 | goto out; |
299 | } |
298 | } |
300 | } |
299 | } |
301 | if (lflag & L_UNLINK) { |
300 | if (lflag & L_UNLINK) { |
302 | unsigned old_lnkcnt = ops->lnkcnt_get(cur); |
301 | unsigned old_lnkcnt = ops->lnkcnt_get(cur); |
303 | int res = ops->unlink(par, cur); |
302 | int res = ops->unlink(par, cur); |
304 | ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle, |
303 | ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle, |
305 | ops->index_get(cur), ops->size_get(cur), old_lnkcnt); |
304 | ops->index_get(cur), ops->size_get(cur), old_lnkcnt); |
306 | goto out; |
305 | goto out; |
307 | } |
306 | } |
308 | if (((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) || |
307 | if (((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) || |
309 | (lflag & L_LINK)) { |
308 | (lflag & L_LINK)) { |
310 | ipc_answer_0(rid, EEXIST); |
309 | ipc_answer_0(rid, EEXIST); |
311 | goto out; |
310 | goto out; |
312 | } |
311 | } |
313 | if ((lflag & L_FILE) && (ops->is_directory(cur))) { |
312 | if ((lflag & L_FILE) && (ops->is_directory(cur))) { |
314 | ipc_answer_0(rid, EISDIR); |
313 | ipc_answer_0(rid, EISDIR); |
315 | goto out; |
314 | goto out; |
316 | } |
315 | } |
317 | if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) { |
316 | if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) { |
318 | ipc_answer_0(rid, ENOTDIR); |
317 | ipc_answer_0(rid, ENOTDIR); |
319 | goto out; |
318 | goto out; |
320 | } |
319 | } |
321 | 320 | ||
322 | ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur), |
321 | ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur), |
323 | ops->size_get(cur), ops->lnkcnt_get(cur)); |
322 | ops->size_get(cur), ops->lnkcnt_get(cur)); |
324 | 323 | ||
325 | out: |
324 | out: |
326 | if (par) |
325 | if (par) |
327 | ops->node_put(par); |
326 | ops->node_put(par); |
328 | if (cur) |
327 | if (cur) |
329 | ops->node_put(cur); |
328 | ops->node_put(cur); |
330 | if (tmp) |
329 | if (tmp) |
331 | ops->node_put(tmp); |
330 | ops->node_put(tmp); |
332 | } |
331 | } |
333 | - | ||
334 | /** Read data from a block device. |
- | |
335 | * |
- | |
336 | * @param phone Phone to be used to communicate with the device. |
- | |
337 | * @param buffer Communication buffer shared with the device. |
- | |
338 | * @param bufpos Pointer to the first unread valid offset within the |
- | |
339 | * communication buffer. |
- | |
340 | * @param buflen Pointer to the number of unread bytes that are ready in |
- | |
341 | * the communication buffer. |
- | |
342 | * @param pos Device position to be read. |
- | |
343 | * @param dst Destination buffer. |
- | |
344 | * @param size Size of the destination buffer. |
- | |
345 | * @param block_size Block size to be used for the transfer. |
- | |
346 | * |
- | |
347 | * @return True on success, false on failure. |
- | |
348 | */ |
- | |
349 | bool libfs_blockread(int phone, void *buffer, off_t *bufpos, size_t *buflen, |
- | |
350 | off_t *pos, void *dst, size_t size, size_t block_size) |
- | |
351 | { |
- | |
352 | off_t offset = 0; |
- | |
353 | size_t left = size; |
- | |
354 | - | ||
355 | while (left > 0) { |
- | |
356 | size_t rd; |
- | |
357 | - | ||
358 | if (*bufpos + left < *buflen) |
- | |
359 | rd = left; |
- | |
360 | else |
- | |
361 | rd = *buflen - *bufpos; |
- | |
362 | - | ||
363 | if (rd > 0) { |
- | |
364 | /* |
- | |
365 | * Copy the contents of the communication buffer to the |
- | |
366 | * destination buffer. |
- | |
367 | */ |
- | |
368 | memcpy(dst + offset, buffer + *bufpos, rd); |
- | |
369 | offset += rd; |
- | |
370 | *bufpos += rd; |
- | |
371 | *pos += rd; |
- | |
372 | left -= rd; |
- | |
373 | } |
- | |
374 | - | ||
375 | if (*bufpos == *buflen) { |
- | |
376 | /* Refill the communication buffer with a new block. */ |
- | |
377 | ipcarg_t retval; |
- | |
378 | int rc = async_req_2_1(phone, RD_READ_BLOCK, |
- | |
379 | *pos / block_size, block_size, &retval); |
- | |
380 | if ((rc != EOK) || (retval != EOK)) |
- | |
381 | return false; |
- | |
382 | - | ||
383 | *bufpos = 0; |
- | |
384 | *buflen = block_size; |
- | |
385 | } |
- | |
386 | } |
- | |
387 | - | ||
388 | return true; |
- | |
389 | } |
- | |
390 | 332 | ||
391 | /** @} |
333 | /** @} |
392 | */ |
334 | */ |
393 | 335 |