Rev 4153 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
| Rev 4153 | Rev 4581 | ||
|---|---|---|---|
| Line 1... | Line 1... | ||
| 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: |
| Line 40... | Line 40... | ||
| 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 |
| Line 120... | Line 121... | ||
| 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 | ||
| - | 126 | void fs_node_initialize(fs_node_t *fn) |
|
| - | 127 | { |
|
| - | 128 | memset(fn, 0, sizeof(fs_node_t)); |
|
| - | 129 | } |
|
| - | 130 | ||
| - | 131 | void libfs_mount(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid, |
|
| - | 132 | ipc_call_t *request) |
|
| - | 133 | { |
|
| - | 134 | dev_handle_t mp_dev_handle = (dev_handle_t) IPC_GET_ARG1(*request); |
|
| - | 135 | fs_index_t mp_fs_index = (fs_index_t) IPC_GET_ARG2(*request); |
|
| - | 136 | fs_handle_t mr_fs_handle = (fs_handle_t) IPC_GET_ARG3(*request); |
|
| - | 137 | dev_handle_t mr_dev_handle = (dev_handle_t) IPC_GET_ARG4(*request); |
|
| - | 138 | int res; |
|
| - | 139 | ipcarg_t rc; |
|
| - | 140 | ||
| - | 141 | ipc_call_t call; |
|
| - | 142 | ipc_callid_t callid; |
|
| - | 143 | ||
| - | 144 | /* accept the phone */ |
|
| - | 145 | callid = async_get_call(&call); |
|
| - | 146 | int mountee_phone = (int)IPC_GET_ARG1(call); |
|
| - | 147 | if ((IPC_GET_METHOD(call) != IPC_M_CONNECTION_CLONE) || |
|
| - | 148 | mountee_phone < 0) { |
|
| - | 149 | ipc_answer_0(callid, EINVAL); |
|
| - | 150 | ipc_answer_0(rid, EINVAL); |
|
| - | 151 | return; |
|
| - | 152 | } |
|
| - | 153 | ipc_answer_0(callid, EOK); /* acknowledge the mountee_phone */ |
|
| - | 154 | ||
| - | 155 | res = ipc_data_write_receive(&callid, NULL); |
|
| - | 156 | if (!res) { |
|
| - | 157 | ipc_hangup(mountee_phone); |
|
| - | 158 | ipc_answer_0(callid, EINVAL); |
|
| - | 159 | ipc_answer_0(rid, EINVAL); |
|
| - | 160 | return; |
|
| - | 161 | } |
|
| - | 162 | ||
| - | 163 | fs_node_t *fn = ops->node_get(mp_dev_handle, mp_fs_index); |
|
| - | 164 | if (!fn) { |
|
| - | 165 | ipc_hangup(mountee_phone); |
|
| - | 166 | ipc_answer_0(callid, ENOENT); |
|
| - | 167 | ipc_answer_0(rid, ENOENT); |
|
| - | 168 | return; |
|
| - | 169 | } |
|
| - | 170 | ||
| - | 171 | if (fn->mp_data.mp_active) { |
|
| - | 172 | ipc_hangup(mountee_phone); |
|
| - | 173 | ops->node_put(fn); |
|
| - | 174 | ipc_answer_0(callid, EBUSY); |
|
| - | 175 | ipc_answer_0(rid, EBUSY); |
|
| - | 176 | return; |
|
| - | 177 | } |
|
| - | 178 | ||
| - | 179 | rc = async_req_0_0(mountee_phone, IPC_M_CONNECT_ME); |
|
| - | 180 | if (rc != 0) { |
|
| - | 181 | ipc_hangup(mountee_phone); |
|
| - | 182 | ops->node_put(fn); |
|
| - | 183 | ipc_answer_0(callid, rc); |
|
| - | 184 | ipc_answer_0(rid, rc); |
|
| - | 185 | return; |
|
| - | 186 | } |
|
| - | 187 | ||
| - | 188 | ipc_call_t answer; |
|
| - | 189 | aid_t msg = async_send_1(mountee_phone, VFS_MOUNTED, mr_dev_handle, |
|
| - | 190 | &answer); |
|
| - | 191 | ipc_forward_fast(callid, mountee_phone, 0, 0, 0, IPC_FF_ROUTE_FROM_ME); |
|
| - | 192 | async_wait_for(msg, &rc); |
|
| - | 193 | ||
| - | 194 | if (rc == EOK) { |
|
| - | 195 | fn->mp_data.mp_active = true; |
|
| - | 196 | fn->mp_data.fs_handle = mr_fs_handle; |
|
| - | 197 | fn->mp_data.dev_handle = mr_dev_handle; |
|
| - | 198 | fn->mp_data.phone = mountee_phone; |
|
| - | 199 | } |
|
| - | 200 | /* |
|
| - | 201 | * Do not release the FS node so that it stays in memory. |
|
| - | 202 | */ |
|
| - | 203 | ipc_answer_3(rid, rc, IPC_GET_ARG1(answer), IPC_GET_ARG2(answer), |
|
| - | 204 | IPC_GET_ARG3(answer)); |
|
| - | 205 | } |
|
| - | 206 | ||
| 125 | /** Lookup VFS triplet by name in the file system name space. |
207 | /** Lookup VFS triplet by name in the file system name space. |
| 126 | * |
208 | * |
| 127 | * 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 |
| 128 | * as returned by the canonify() function. |
210 | * as returned by the canonify() function. |
| 129 | * |
211 | * |
| 130 | * @param ops libfs operations structure with function pointers to |
212 | * @param ops libfs operations structure with function pointers to |
| 131 | * file system implementation |
213 | * file system implementation |
| 132 | * @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 |
| 133 | * the lookup. |
215 | * the lookup. |
| 134 | * @param rid Request ID of the VFS_LOOKUP request. |
216 | * @param rid Request ID of the VFS_LOOKUP request. |
| 135 | * @param request VFS_LOOKUP request data itself. |
217 | * @param request VFS_LOOKUP request data itself. |
| - | 218 | * |
|
| 136 | */ |
219 | */ |
| 137 | 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, |
| 138 | ipc_call_t *request) |
221 | ipc_call_t *request) |
| 139 | { |
222 | { |
| 140 | unsigned next = IPC_GET_ARG1(*request); |
223 | unsigned first = IPC_GET_ARG1(*request); |
| 141 | unsigned last = IPC_GET_ARG2(*request); |
224 | unsigned last = IPC_GET_ARG2(*request); |
| - | 225 | unsigned next = first; |
|
| 142 | dev_handle_t dev_handle = IPC_GET_ARG3(*request); |
226 | dev_handle_t dev_handle = IPC_GET_ARG3(*request); |
| 143 | int lflag = IPC_GET_ARG4(*request); |
227 | int lflag = IPC_GET_ARG4(*request); |
| 144 | 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 */ |
| 145 | char component[NAME_MAX + 1]; |
229 | char component[NAME_MAX + 1]; |
| 146 | int len; |
230 | int len; |
| 147 | 231 | ||
| 148 | if (last < next) |
232 | if (last < next) |
| 149 | last += PLB_SIZE; |
233 | last += PLB_SIZE; |
| 150 | 234 | ||
| 151 | void *par = NULL; |
235 | fs_node_t *par = NULL; |
| 152 | void *cur = ops->root_get(dev_handle); |
236 | fs_node_t *cur = ops->root_get(dev_handle); |
| 153 | void *tmp = NULL; |
237 | fs_node_t *tmp = NULL; |
| - | 238 | ||
| - | 239 | if (cur->mp_data.mp_active) { |
|
| - | 240 | ipc_forward_slow(rid, cur->mp_data.phone, VFS_LOOKUP, |
|
| - | 241 | next, last, cur->mp_data.dev_handle, lflag, index, |
|
| - | 242 | IPC_FF_ROUTE_FROM_ME); |
|
| - | 243 | ops->node_put(cur); |
|
| - | 244 | return; |
|
| - | 245 | } |
|
| 154 | 246 | ||
| 155 | if (ops->plb_get_char(next) == '/') |
247 | if (ops->plb_get_char(next) == '/') |
| 156 | next++; /* eat slash */ |
248 | next++; /* eat slash */ |
| 157 | 249 | ||
| 158 | while (next <= last && ops->has_children(cur)) { |
250 | while (next <= last && ops->has_children(cur)) { |
| Line 172... | Line 264... | ||
| 172 | component[len] = '\0'; |
264 | component[len] = '\0'; |
| 173 | next++; /* eat slash */ |
265 | next++; /* eat slash */ |
| 174 | 266 | ||
| 175 | /* match the component */ |
267 | /* match the component */ |
| 176 | tmp = ops->match(cur, component); |
268 | tmp = ops->match(cur, component); |
| - | 269 | if (tmp && tmp->mp_data.mp_active) { |
|
| - | 270 | if (next > last) |
|
| - | 271 | next = last = first; |
|
| - | 272 | else |
|
| - | 273 | next--; |
|
| - | 274 | ||
| - | 275 | ipc_forward_slow(rid, tmp->mp_data.phone, VFS_LOOKUP, |
|
| - | 276 | next, last, tmp->mp_data.dev_handle, lflag, index, |
|
| - | 277 | IPC_FF_ROUTE_FROM_ME); |
|
| - | 278 | ops->node_put(cur); |
|
| - | 279 | ops->node_put(tmp); |
|
| - | 280 | if (par) |
|
| - | 281 | ops->node_put(par); |
|
| - | 282 | return; |
|
| - | 283 | } |
|
| 177 | 284 | ||
| 178 | /* handle miss: match amongst siblings */ |
285 | /* handle miss: match amongst siblings */ |
| 179 | if (!tmp) { |
286 | if (!tmp) { |
| 180 | if (next <= last) { |
287 | if (next <= last) { |
| 181 | /* there are unprocessed components */ |
288 | /* there are unprocessed components */ |
| Line 187... | Line 294... | ||
| 187 | /* request to create a new link */ |
294 | /* request to create a new link */ |
| 188 | if (!ops->is_directory(cur)) { |
295 | if (!ops->is_directory(cur)) { |
| 189 | ipc_answer_0(rid, ENOTDIR); |
296 | ipc_answer_0(rid, ENOTDIR); |
| 190 | goto out; |
297 | goto out; |
| 191 | } |
298 | } |
| 192 | void *nodep; |
299 | fs_node_t *fn; |
| 193 | if (lflag & L_CREATE) |
300 | if (lflag & L_CREATE) |
| 194 | nodep = ops->create(dev_handle, lflag); |
301 | fn = ops->create(dev_handle, lflag); |
| 195 | else |
302 | else |
| 196 | nodep = ops->node_get(dev_handle, |
303 | fn = ops->node_get(dev_handle, |
| 197 | index); |
304 | index); |
| 198 | if (nodep) { |
305 | if (fn) { |
| 199 | int rc; |
306 | int rc; |
| 200 | 307 | ||
| 201 | rc = ops->link(cur, nodep, component); |
308 | rc = ops->link(cur, fn, component); |
| 202 | if (rc != EOK) { |
309 | if (rc != EOK) { |
| 203 | if (lflag & L_CREATE) { |
310 | if (lflag & L_CREATE) { |
| 204 | (void)ops->destroy( |
311 | (void)ops->destroy(fn); |
| 205 | nodep); |
- | |
| 206 | } |
312 | } |
| 207 | ipc_answer_0(rid, rc); |
313 | ipc_answer_0(rid, rc); |
| 208 | } else { |
314 | } else { |
| 209 | ipc_answer_5(rid, EOK, |
315 | ipc_answer_5(rid, EOK, |
| 210 | fs_handle, dev_handle, |
316 | fs_handle, dev_handle, |
| 211 | ops->index_get(nodep), |
317 | ops->index_get(fn), |
| 212 | ops->size_get(nodep), |
318 | ops->size_get(fn), |
| 213 | ops->lnkcnt_get(nodep)); |
319 | ops->lnkcnt_get(fn)); |
| 214 | ops->node_put(nodep); |
320 | ops->node_put(fn); |
| 215 | } |
321 | } |
| 216 | } else { |
322 | } else { |
| 217 | ipc_answer_0(rid, ENOSPC); |
323 | ipc_answer_0(rid, ENOSPC); |
| 218 | } |
324 | } |
| 219 | goto out; |
325 | goto out; |
| 220 | } else if (lflag & L_PARENT) { |
- | |
| 221 | /* return parent */ |
- | |
| 222 | ipc_answer_5(rid, EOK, fs_handle, dev_handle, |
- | |
| 223 | ops->index_get(cur), ops->size_get(cur), |
- | |
| 224 | ops->lnkcnt_get(cur)); |
- | |
| 225 | } |
326 | } |
| 226 | ipc_answer_0(rid, ENOENT); |
327 | ipc_answer_0(rid, ENOENT); |
| 227 | goto out; |
328 | goto out; |
| 228 | } |
329 | } |
| 229 | 330 | ||
| Line 261... | Line 362... | ||
| 261 | next++; /* process next character */ |
362 | next++; /* process next character */ |
| 262 | } |
363 | } |
| 263 | assert(len); |
364 | assert(len); |
| 264 | component[len] = '\0'; |
365 | component[len] = '\0'; |
| 265 | 366 | ||
| 266 | void *nodep; |
367 | fs_node_t *fn; |
| 267 | if (lflag & L_CREATE) |
368 | if (lflag & L_CREATE) |
| 268 | nodep = ops->create(dev_handle, lflag); |
369 | fn = ops->create(dev_handle, lflag); |
| 269 | else |
370 | else |
| 270 | nodep = ops->node_get(dev_handle, index); |
371 | fn = ops->node_get(dev_handle, index); |
| 271 | if (nodep) { |
372 | if (fn) { |
| 272 | int rc; |
373 | int rc; |
| 273 | 374 | ||
| 274 | rc = ops->link(cur, nodep, component); |
375 | rc = ops->link(cur, fn, component); |
| 275 | if (rc != EOK) { |
376 | if (rc != EOK) { |
| 276 | if (lflag & L_CREATE) |
377 | if (lflag & L_CREATE) |
| 277 | (void)ops->destroy(nodep); |
378 | (void)ops->destroy(fn); |
| 278 | ipc_answer_0(rid, rc); |
379 | ipc_answer_0(rid, rc); |
| 279 | } else { |
380 | } else { |
| 280 | ipc_answer_5(rid, EOK, |
381 | ipc_answer_5(rid, EOK, |
| 281 | fs_handle, dev_handle, |
382 | fs_handle, dev_handle, |
| 282 | ops->index_get(nodep), |
383 | ops->index_get(fn), |
| 283 | ops->size_get(nodep), |
384 | ops->size_get(fn), |
| 284 | ops->lnkcnt_get(nodep)); |
385 | ops->lnkcnt_get(fn)); |
| 285 | ops->node_put(nodep); |
386 | ops->node_put(fn); |
| 286 | } |
387 | } |
| 287 | } else { |
388 | } else { |
| 288 | ipc_answer_0(rid, ENOSPC); |
389 | ipc_answer_0(rid, ENOSPC); |
| 289 | } |
390 | } |
| 290 | goto out; |
391 | goto out; |
| Line 292... | Line 393... | ||
| 292 | ipc_answer_0(rid, ENOENT); |
393 | ipc_answer_0(rid, ENOENT); |
| 293 | goto out; |
394 | goto out; |
| 294 | } |
395 | } |
| 295 | 396 | ||
| 296 | /* handle hit */ |
397 | /* handle hit */ |
| 297 | if (lflag & L_PARENT) { |
- | |
| 298 | ops->node_put(cur); |
- | |
| 299 | cur = par; |
- | |
| 300 | par = NULL; |
- | |
| 301 | if (!cur) { |
- | |
| 302 | ipc_answer_0(rid, ENOENT); |
- | |
| 303 | goto out; |
- | |
| 304 | } |
- | |
| 305 | } |
- | |
| 306 | if (lflag & L_UNLINK) { |
398 | if (lflag & L_UNLINK) { |
| 307 | unsigned old_lnkcnt = ops->lnkcnt_get(cur); |
399 | unsigned old_lnkcnt = ops->lnkcnt_get(cur); |
| 308 | int res = ops->unlink(par, cur); |
400 | int res = ops->unlink(par, cur, component); |
| 309 | ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle, |
401 | ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle, |
| 310 | ops->index_get(cur), ops->size_get(cur), old_lnkcnt); |
402 | ops->index_get(cur), ops->size_get(cur), old_lnkcnt); |
| 311 | goto out; |
403 | goto out; |
| 312 | } |
404 | } |
| 313 | if (((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) || |
405 | if (((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) || |
| Line 334... | Line 426... | ||
| 334 | ops->node_put(cur); |
426 | ops->node_put(cur); |
| 335 | if (tmp) |
427 | if (tmp) |
| 336 | ops->node_put(tmp); |
428 | ops->node_put(tmp); |
| 337 | } |
429 | } |
| 338 | 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 | } |
|
| - | 457 | ||
| 339 | /** @} |
458 | /** @} |
| 340 | */ |
459 | */ |