| 1,5 → 1,5 |
|---|
| /* |
| * Copyright (c) 2007 Jakub Jermar |
| * Copyright (c) 2008 Jakub Jermar |
| * All rights reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| 36,10 → 36,13 |
|---|
| |
| #include "libfs.h" |
| #include "../../srv/vfs/vfs.h" |
| #include "../../srv/rd/rd.h" |
| #include <errno.h> |
| #include <async.h> |
| #include <ipc/ipc.h> |
| #include <as.h> |
| #include <assert.h> |
| #include <dirent.h> |
| |
| /** Register file system server. |
| * |
| 120,5 → 123,270 |
|---|
| return IPC_GET_RETVAL(answer); |
| } |
| |
| /** Lookup VFS triplet by name in the file system name space. |
| * |
| * The path passed in the PLB must be in the canonical file system path format |
| * as returned by the canonify() function. |
| * |
| * @param ops libfs operations structure with function pointers to |
| * file system implementation |
| * @param fs_handle File system handle of the file system where to perform |
| * the lookup. |
| * @param rid Request ID of the VFS_LOOKUP request. |
| * @param request VFS_LOOKUP request data itself. |
| */ |
| void libfs_lookup(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid, |
| ipc_call_t *request) |
| { |
| unsigned next = IPC_GET_ARG1(*request); |
| unsigned last = IPC_GET_ARG2(*request); |
| dev_handle_t dev_handle = IPC_GET_ARG3(*request); |
| int lflag = IPC_GET_ARG4(*request); |
| fs_index_t index = IPC_GET_ARG5(*request); /* when L_LINK specified */ |
| char component[NAME_MAX + 1]; |
| int len; |
| |
| if (last < next) |
| last += PLB_SIZE; |
| |
| void *par = NULL; |
| void *cur = ops->root_get(dev_handle); |
| void *tmp = NULL; |
| |
| if (ops->plb_get_char(next) == '/') |
| next++; /* eat slash */ |
| |
| while (next <= last && ops->has_children(cur)) { |
| /* collect the component */ |
| len = 0; |
| while ((next <= last) && (ops->plb_get_char(next) != '/')) { |
| if (len + 1 == NAME_MAX) { |
| /* component length overflow */ |
| ipc_answer_0(rid, ENAMETOOLONG); |
| goto out; |
| } |
| component[len++] = ops->plb_get_char(next); |
| next++; /* process next character */ |
| } |
| |
| assert(len); |
| component[len] = '\0'; |
| next++; /* eat slash */ |
| |
| /* match the component */ |
| tmp = ops->match(cur, component); |
| |
| /* handle miss: match amongst siblings */ |
| if (!tmp) { |
| if (next <= last) { |
| /* there are unprocessed components */ |
| ipc_answer_0(rid, ENOENT); |
| goto out; |
| } |
| /* miss in the last component */ |
| if (lflag & (L_CREATE | L_LINK)) { |
| /* request to create a new link */ |
| if (!ops->is_directory(cur)) { |
| ipc_answer_0(rid, ENOTDIR); |
| goto out; |
| } |
| void *nodep; |
| if (lflag & L_CREATE) |
| nodep = ops->create(lflag); |
| else |
| nodep = ops->node_get(dev_handle, |
| index); |
| if (nodep) { |
| if (!ops->link(cur, nodep, component)) { |
| if (lflag & L_CREATE) { |
| (void)ops->destroy( |
| nodep); |
| } |
| ipc_answer_0(rid, ENOSPC); |
| } else { |
| ipc_answer_5(rid, EOK, |
| fs_handle, dev_handle, |
| ops->index_get(nodep), |
| ops->size_get(nodep), |
| ops->lnkcnt_get(nodep)); |
| ops->node_put(nodep); |
| } |
| } else { |
| ipc_answer_0(rid, ENOSPC); |
| } |
| goto out; |
| } else if (lflag & L_PARENT) { |
| /* return parent */ |
| ipc_answer_5(rid, EOK, fs_handle, dev_handle, |
| ops->index_get(cur), ops->size_get(cur), |
| ops->lnkcnt_get(cur)); |
| } |
| ipc_answer_0(rid, ENOENT); |
| goto out; |
| } |
| |
| if (par) |
| ops->node_put(par); |
| |
| /* descend one level */ |
| par = cur; |
| cur = tmp; |
| tmp = NULL; |
| } |
| |
| /* handle miss: excessive components */ |
| if (next <= last && !ops->has_children(cur)) { |
| if (lflag & (L_CREATE | L_LINK)) { |
| if (!ops->is_directory(cur)) { |
| ipc_answer_0(rid, ENOTDIR); |
| goto out; |
| } |
| |
| /* collect next component */ |
| len = 0; |
| while (next <= last) { |
| if (ops->plb_get_char(next) == '/') { |
| /* more than one component */ |
| ipc_answer_0(rid, ENOENT); |
| goto out; |
| } |
| if (len + 1 == NAME_MAX) { |
| /* component length overflow */ |
| ipc_answer_0(rid, ENAMETOOLONG); |
| goto out; |
| } |
| component[len++] = ops->plb_get_char(next); |
| next++; /* process next character */ |
| } |
| assert(len); |
| component[len] = '\0'; |
| |
| void *nodep; |
| if (lflag & L_CREATE) |
| nodep = ops->create(lflag); |
| else |
| nodep = ops->node_get(dev_handle, index); |
| if (nodep) { |
| if (!ops->link(cur, nodep, component)) { |
| if (lflag & L_CREATE) |
| (void)ops->destroy(nodep); |
| ipc_answer_0(rid, ENOSPC); |
| } else { |
| ipc_answer_5(rid, EOK, |
| fs_handle, dev_handle, |
| ops->index_get(nodep), |
| ops->size_get(nodep), |
| ops->lnkcnt_get(nodep)); |
| ops->node_put(nodep); |
| } |
| } else { |
| ipc_answer_0(rid, ENOSPC); |
| } |
| goto out; |
| } |
| ipc_answer_0(rid, ENOENT); |
| goto out; |
| } |
| |
| /* handle hit */ |
| if (lflag & L_PARENT) { |
| ops->node_put(cur); |
| cur = par; |
| par = NULL; |
| if (!cur) { |
| ipc_answer_0(rid, ENOENT); |
| goto out; |
| } |
| } |
| if (lflag & L_UNLINK) { |
| unsigned old_lnkcnt = ops->lnkcnt_get(cur); |
| int res = ops->unlink(par, cur); |
| ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle, |
| ops->index_get(cur), ops->size_get(cur), old_lnkcnt); |
| goto out; |
| } |
| if (((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) || |
| (lflag & L_LINK)) { |
| ipc_answer_0(rid, EEXIST); |
| goto out; |
| } |
| if ((lflag & L_FILE) && (ops->is_directory(cur))) { |
| ipc_answer_0(rid, EISDIR); |
| goto out; |
| } |
| if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) { |
| ipc_answer_0(rid, ENOTDIR); |
| goto out; |
| } |
| |
| ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur), |
| ops->size_get(cur), ops->lnkcnt_get(cur)); |
| |
| out: |
| if (par) |
| ops->node_put(par); |
| if (cur) |
| ops->node_put(cur); |
| if (tmp) |
| ops->node_put(tmp); |
| } |
| |
| /** Read data from a block device. |
| * |
| * @param phone Phone to be used to communicate with the device. |
| * @param buffer Communication buffer shared with the device. |
| * @param bufpos Pointer to the first unread valid offset within the |
| * communication buffer. |
| * @param buflen Pointer to the number of unread bytes that are ready in |
| * the communication buffer. |
| * @param pos Device position to be read. |
| * @param dst Destination buffer. |
| * @param size Size of the destination buffer. |
| * @param block_size Block size to be used for the transfer. |
| * |
| * @return True on success, false on failure. |
| */ |
| bool libfs_blockread(int phone, void *buffer, off_t *bufpos, size_t *buflen, |
| off_t *pos, void *dst, size_t size, size_t block_size) |
| { |
| off_t offset = 0; |
| size_t left = size; |
| |
| while (left > 0) { |
| size_t rd; |
| |
| if (*bufpos + left < *buflen) |
| rd = left; |
| else |
| rd = *buflen - *bufpos; |
| |
| if (rd > 0) { |
| /* |
| * Copy the contents of the communication buffer to the |
| * destination buffer. |
| */ |
| memcpy(dst + offset, buffer + *bufpos, rd); |
| offset += rd; |
| *bufpos += rd; |
| *pos += rd; |
| left -= rd; |
| } |
| |
| if (*bufpos == *buflen) { |
| /* Refill the communication buffer with a new block. */ |
| ipcarg_t retval; |
| int rc = async_req_2_1(phone, RD_READ_BLOCK, |
| *pos / block_size, block_size, &retval); |
| if ((rc != EOK) || (retval != EOK)) |
| return false; |
| |
| *bufpos = 0; |
| *buflen = block_size; |
| } |
| } |
| |
| return true; |
| } |
| |
| /** @} |
| */ |