Subversion Repositories HelenOS

Rev

Rev 2589 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 2589 Rev 2590
Line 29... Line 29...
29 
/** @addtogroup fs
 29 
/** @addtogroup fs
30 
 * @{
 30 
 * @{
31 
 */
 31 
 */
32 
 
 32 
 
33 
/**
 33 
/**
34 
 * @file    vfs.c
 34 
 * @file    vfs_open.c
35 
 * @brief   VFS_OPEN method.
 35 
 * @brief   VFS_OPEN method.
36 
 */
 36 
 */
37 
 
 37 
 
38 
#include <ipc/ipc.h>
 38 
#include <ipc/ipc.h>
39 
#include <async.h>
 39 
#include <async.h>
Line 64... Line 64...
64 
__thread vfs_file_t *files = NULL;
 64 
__thread vfs_file_t *files = NULL;
65 
 
 65 
 
66 
/** Initialize the table of open files. */
 66 
/** Initialize the table of open files. */
67 
static bool vfs_conn_open_files_init(void)
 67 
static bool vfs_conn_open_files_init(void)
68 
{
 68 
{
- 
 
 69 
    /*
- 
 
 70 
     * Optimized fast path that will never go to sleep unnecessarily.
- 
 
 71 
     * The assumption is that once files is non-zero, it will never be zero
- 
 
 72 
     * again.
- 
 
 73 
     */
- 
 
 74 
    if (files)
- 
 
 75 
        return true;
- 
 
 76 
       
69 
    futex_down(&files_futex);
 77 
    futex_down(&files_futex);
70 
    if (!files) {
 78 
    if (!files) {
71 
        files = malloc(MAX_OPEN_FILES * sizeof(vfs_file_t));
 79 
        files = malloc(MAX_OPEN_FILES * sizeof(vfs_file_t));
72 
        if (!files) {
 80 
        if (!files) {
73 
            futex_up(&files_futex);
 81 
            futex_up(&files_futex);
Line 83... Line 91...
83 
{
 91 
{
84 
    if (!vfs_conn_open_files_init()) {
 92 
    if (!vfs_conn_open_files_init()) {
85 
        ipc_answer_fast_0(rid, ENOMEM);
 93 
        ipc_answer_fast_0(rid, ENOMEM);
86 
        return;
 94 
        return;
87 
    }
 95 
    }
- 
 
 96 
 
- 
 
 97 
    /*
- 
 
 98 
     * The POSIX interface is open(path, flags, mode).
- 
 
 99 
     * We can receive flags and mode along with the VFS_OPEN call; the path
- 
 
 100 
     * will need to arrive in another call.
- 
 
 101 
     */
- 
 
 102 
    int flags = IPC_GET_ARG1(*request);
- 
 
 103 
    int mode = IPC_GET_ARG2(*request);
- 
 
 104 
    size_t size;
- 
 
 105 
 
- 
 
 106 
    ipc_callid_t callid;
- 
 
 107 
    ipc_call_t call;
- 
 
 108 
 
- 
 
 109 
    if (!ipc_data_receive(&callid, &call, NULL, &size)) {
- 
 
 110 
        ipc_answer_fast_0(callid, EINVAL);
- 
 
 111 
        ipc_answer_fast_0(rid, EINVAL);
- 
 
 112 
        return;
- 
 
 113 
    }
- 
 
 114 
 
- 
 
 115 
    /*
- 
 
 116 
     * Now we are on the verge of accepting the path.
- 
 
 117 
     *
- 
 
 118 
     * There is one optimization we could do in the future: copy the path
- 
 
 119 
     * directly into the PLB using some kind of a callback.
- 
 
 120 
     */
- 
 
 121 
    char *path = malloc(size);
- 
 
 122 
   
- 
 
 123 
    if (!path) {
- 
 
 124 
        ipc_answer_fast_0(callid, ENOMEM);
- 
 
 125 
        ipc_answer_fast_0(rid, ENOMEM);
- 
 
 126 
        return;
- 
 
 127 
    }
- 
 
 128 
 
- 
 
 129 
    int rc;
- 
 
 130 
    if (rc = ipc_data_deliver(callid, &call, path, size)) {
- 
 
 131 
        ipc_answer_fast_0(rid, rc);
- 
 
 132 
        free(path);
- 
 
 133 
        return;
- 
 
 134 
    }
- 
 
 135 
   
- 
 
 136 
    /*
- 
 
 137 
     * The path is now populated and we can call vfs_lookup_internal().
- 
 
 138 
     */
- 
 
 139 
    vfs_triplet_t triplet;
- 
 
 140 
    rc = vfs_lookup_internal(path, size, &triplet, NULL);
- 
 
 141 
    if (rc) {
- 
 
 142 
        ipc_answer_fast_0(rid, rc);
- 
 
 143 
        free(path);
- 
 
 144 
        return;
- 
 
 145 
    }
- 
 
 146 
 
- 
 
 147 
    /*
- 
 
 148 
     * Path is no longer needed.
- 
 
 149 
     */
- 
 
 150 
    free(path);
- 
 
 151 
 
- 
 
 152 
    vfs_node_t *node = vfs_node_get(&triplet);
- 
 
 153 
    // TODO: not finished  
88 
}
 154 
}
89 
 
 155 
 
90 
/**
 156 
/**
91 
 * @}
 157 
 * @}
92 
 */
 158 
 */