Subversion Repositories HelenOS

Rev

Rev 2590 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 2590 Rev 2593
1
/*
1
/*
2
 * Copyright (c) 2007 Jakub Jermar
2
 * Copyright (c) 2007 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 fs
29
/** @addtogroup fs
30
 * @{
30
 * @{
31
 */
31
 */
32
 
32
 
33
/**
33
/**
34
 * @file    vfs_open.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>
40
#include <errno.h>
40
#include <errno.h>
41
#include <stdlib.h>
-
 
42
#include <string.h>
-
 
43
#include <bool.h>
-
 
44
#include <futex.h>
41
#include <futex.h>
45
#include <libadt/list.h>
-
 
46
#include <sys/types.h>
42
#include <sys/types.h>
-
 
43
#include <stdlib.h>
47
#include "vfs.h"
44
#include "vfs.h"
48
 
45
 
49
/** Per-connection futex protecting the files array. */
-
 
50
__thread atomic_t files_futex = FUTEX_INITIALIZER;
-
 
51
 
-
 
52
/**
-
 
53
 * This is a per-connection table of open files.
-
 
54
 * Our assumption is that each client opens only one connection and therefore
-
 
55
 * there is one table of open files per task. However, this may not be the case
-
 
56
 * and the client can open more connections to VFS. In that case, there will be
-
 
57
 * several tables and several file handle name spaces per task. Besides of this,
-
 
58
 * the functionality will stay unchanged. So unless the client knows what it is
-
 
59
 * doing, it should open one connection to VFS only.
-
 
60
 *
-
 
61
 * Allocation of the open files table is deferred until the client makes the
-
 
62
 * first VFS_OPEN operation.
-
 
63
 */
-
 
64
__thread vfs_file_t *files = NULL;
-
 
65
 
-
 
66
/** Initialize the table of open files. */
-
 
67
static bool vfs_conn_open_files_init(void)
-
 
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
       
-
 
77
    futex_down(&files_futex);
-
 
78
    if (!files) {
-
 
79
        files = malloc(MAX_OPEN_FILES * sizeof(vfs_file_t));
-
 
80
        if (!files) {
-
 
81
            futex_up(&files_futex);
-
 
82
            return false;
-
 
83
        }
-
 
84
        memset(files, 0, MAX_OPEN_FILES * sizeof(vfs_file_t));
-
 
85
    }
-
 
86
    futex_up(&files_futex);
-
 
87
    return true;
-
 
88
}
-
 
89
 
-
 
90
void vfs_open(ipc_callid_t rid, ipc_call_t *request)
46
void vfs_open(ipc_callid_t rid, ipc_call_t *request)
91
{
47
{
92
    if (!vfs_conn_open_files_init()) {
48
    if (!vfs_files_init()) {
93
        ipc_answer_fast_0(rid, ENOMEM);
49
        ipc_answer_fast_0(rid, ENOMEM);
94
        return;
50
        return;
95
    }
51
    }
96
 
52
 
97
    /*
53
    /*
98
     * The POSIX interface is open(path, flags, mode).
54
     * The POSIX interface is open(path, flags, mode).
99
     * We can receive flags and mode along with the VFS_OPEN call; the path
55
     * We can receive flags and mode along with the VFS_OPEN call; the path
100
     * will need to arrive in another call.
56
     * will need to arrive in another call.
101
     */
57
     */
102
    int flags = IPC_GET_ARG1(*request);
58
    int flags = IPC_GET_ARG1(*request);
103
    int mode = IPC_GET_ARG2(*request);
59
    int mode = IPC_GET_ARG2(*request);
104
    size_t size;
60
    size_t size;
105
 
61
 
106
    ipc_callid_t callid;
62
    ipc_callid_t callid;
107
    ipc_call_t call;
63
    ipc_call_t call;
108
 
64
 
109
    if (!ipc_data_receive(&callid, &call, NULL, &size)) {
65
    if (!ipc_data_receive(&callid, &call, NULL, &size)) {
110
        ipc_answer_fast_0(callid, EINVAL);
66
        ipc_answer_fast_0(callid, EINVAL);
111
        ipc_answer_fast_0(rid, EINVAL);
67
        ipc_answer_fast_0(rid, EINVAL);
112
        return;
68
        return;
113
    }
69
    }
114
 
70
 
115
    /*
71
    /*
116
     * Now we are on the verge of accepting the path.
72
     * Now we are on the verge of accepting the path.
117
     *
73
     *
118
     * There is one optimization we could do in the future: copy the path
74
     * There is one optimization we could do in the future: copy the path
119
     * directly into the PLB using some kind of a callback.
75
     * directly into the PLB using some kind of a callback.
120
     */
76
     */
121
    char *path = malloc(size);
77
    char *path = malloc(size);
122
   
78
   
123
    if (!path) {
79
    if (!path) {
124
        ipc_answer_fast_0(callid, ENOMEM);
80
        ipc_answer_fast_0(callid, ENOMEM);
125
        ipc_answer_fast_0(rid, ENOMEM);
81
        ipc_answer_fast_0(rid, ENOMEM);
126
        return;
82
        return;
127
    }
83
    }
128
 
84
 
129
    int rc;
85
    int rc;
130
    if (rc = ipc_data_deliver(callid, &call, path, size)) {
86
    if ((rc = ipc_data_deliver(callid, &call, path, size))) {
131
        ipc_answer_fast_0(rid, rc);
87
        ipc_answer_fast_0(rid, rc);
132
        free(path);
88
        free(path);
133
        return;
89
        return;
134
    }
90
    }
135
   
91
   
136
    /*
92
    /*
-
 
93
     * Avoid the race condition in which the file can be deleted before we
-
 
94
     * find/create-and-lock the VFS node corresponding to the looked-up
-
 
95
     * triplet.
-
 
96
     */
-
 
97
    futex_down(&unlink_futex);
-
 
98
 
-
 
99
    /*
137
     * The path is now populated and we can call vfs_lookup_internal().
100
     * The path is now populated and we can call vfs_lookup_internal().
138
     */
101
     */
139
    vfs_triplet_t triplet;
102
    vfs_triplet_t triplet;
140
    rc = vfs_lookup_internal(path, size, &triplet, NULL);
103
    rc = vfs_lookup_internal(path, size, &triplet, NULL);
141
    if (rc) {
104
    if (rc) {
-
 
105
        futex_up(&unlink_futex);
142
        ipc_answer_fast_0(rid, rc);
106
        ipc_answer_fast_0(rid, rc);
143
        free(path);
107
        free(path);
144
        return;
108
        return;
145
    }
109
    }
146
 
110
 
147
    /*
111
    /*
148
     * Path is no longer needed.
112
     * Path is no longer needed.
149
     */
113
     */
150
    free(path);
114
    free(path);
151
 
115
 
152
    vfs_node_t *node = vfs_node_get(&triplet);
116
    vfs_node_t *node = vfs_node_get(&triplet);
-
 
117
    futex_up(&unlink_futex);
-
 
118
 
-
 
119
    /*
-
 
120
     * Get ourselves a file descriptor and the corresponding vfs_file_t
-
 
121
     * structure.
-
 
122
     */
-
 
123
    int fd = vfs_fd_alloc();
-
 
124
    if (fd < 0) {
-
 
125
        vfs_node_put(node);
-
 
126
        ipc_answer_fast_0(rid, fd);
-
 
127
        return;
-
 
128
    }
-
 
129
    vfs_file_t *file = vfs_file_get(fd);
153
    // TODO: not finished   
130
    file->node = node;
-
 
131
 
-
 
132
    /*
-
 
133
     * The following increase in reference count is for the fact that the
-
 
134
     * file is being opened and that a file structure is pointing to it.
-
 
135
     * It is necessary so that the file will not disappear when
-
 
136
     * vfs_node_put() is called. The reference will be dropped by the
-
 
137
     * respective VFS_CLOSE.
-
 
138
     */
-
 
139
    vfs_node_addref(node);
-
 
140
    vfs_node_put(node);
-
 
141
 
-
 
142
    /*
-
 
143
     * Success! Return the new file descriptor to the client.
-
 
144
     */
-
 
145
    ipc_answer_fast_1(rid, EOK, fd);
154
}
146
}
155
 
147
 
156
/**
148
/**
157
 * @}
149
 * @}
158
 */
150
 */
159
 
151