Subversion Repositories HelenOS

Rev

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

Rev 2534 Rev 2536
1
/*
1
/*
2
 * Copyright (c) 2006 Martin Decky
2
 * Copyright (c) 2006 Martin Decky
3
 * Copyright (c) 2007 Jakub Jermar
3
 * Copyright (c) 2007 Jakub Jermar
4
 * All rights reserved.
4
 * All rights reserved.
5
 *
5
 *
6
 * Redistribution and use in source and binary forms, with or without
6
 * Redistribution and use in source and binary forms, with or without
7
 * modification, are permitted provided that the following conditions
7
 * modification, are permitted provided that the following conditions
8
 * are met:
8
 * are met:
9
 *
9
 *
10
 * - Redistributions of source code must retain the above copyright
10
 * - Redistributions of source code must retain the above copyright
11
 *   notice, this list of conditions and the following disclaimer.
11
 *   notice, this list of conditions and the following disclaimer.
12
 * - Redistributions in binary form must reproduce the above copyright
12
 * - Redistributions in binary form must reproduce the above copyright
13
 *   notice, this list of conditions and the following disclaimer in the
13
 *   notice, this list of conditions and the following disclaimer in the
14
 *   documentation and/or other materials provided with the distribution.
14
 *   documentation and/or other materials provided with the distribution.
15
 * - The name of the author may not be used to endorse or promote products
15
 * - The name of the author may not be used to endorse or promote products
16
 *   derived from this software without specific prior written permission.
16
 *   derived from this software without specific prior written permission.
17
 *
17
 *
18
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28
 */
28
 */
29
 
29
 
30
/** @addtogroup fs
30
/** @addtogroup fs
31
 * @{
31
 * @{
32
 */
32
 */
33
 
33
 
34
/**
34
/**
35
 * @file    fat.c
35
 * @file    fat.c
36
 * @brief   FAT file system driver for HelenOS.
36
 * @brief   FAT file system driver for HelenOS.
37
 */
37
 */
38
 
38
 
39
#include <ipc/ipc.h>
39
#include <ipc/ipc.h>
40
#include <ipc/services.h>
40
#include <ipc/services.h>
41
#include <async.h>
41
#include <async.h>
42
#include <errno.h>
42
#include <errno.h>
43
#include <unistd.h>
43
#include <unistd.h>
44
#include <stdio.h>>
44
#include <stdio.h>
45
#include "../../vfs/vfs.h"
45
#include "../../vfs/vfs.h"
46
 
46
 
47
#define dprintf(...)    printf(__VA_ARGS__)
47
#define dprintf(...)    printf(__VA_ARGS__)
48
 
48
 
49
vfs_info_t fat_vfs_info = {
49
vfs_info_t fat_vfs_info = {
50
    .name = "fat",
50
    .name = "fat",
51
    .ops = {
51
    .ops = {
52
        [IPC_METHOD_TO_VFS_OP(VFS_REGISTER)] = VFS_OP_DEFINED,
52
        [IPC_METHOD_TO_VFS_OP(VFS_REGISTER)] = VFS_OP_DEFINED,
53
        [IPC_METHOD_TO_VFS_OP(VFS_MOUNT)] = VFS_OP_DEFINED,
53
        [IPC_METHOD_TO_VFS_OP(VFS_MOUNT)] = VFS_OP_DEFINED,
54
        [IPC_METHOD_TO_VFS_OP(VFS_UNMOUNT)] = VFS_OP_DEFINED,
54
        [IPC_METHOD_TO_VFS_OP(VFS_UNMOUNT)] = VFS_OP_DEFINED,
55
        [IPC_METHOD_TO_VFS_OP(VFS_LOOKUP)] = VFS_OP_DEFINED,
55
        [IPC_METHOD_TO_VFS_OP(VFS_LOOKUP)] = VFS_OP_DEFINED,
56
        [IPC_METHOD_TO_VFS_OP(VFS_OPEN)] = VFS_OP_DEFINED,
56
        [IPC_METHOD_TO_VFS_OP(VFS_OPEN)] = VFS_OP_DEFINED,
57
        [IPC_METHOD_TO_VFS_OP(VFS_CREATE)] = VFS_OP_DEFINED,
57
        [IPC_METHOD_TO_VFS_OP(VFS_CREATE)] = VFS_OP_DEFINED,
58
        [IPC_METHOD_TO_VFS_OP(VFS_CLOSE)] = VFS_OP_DEFINED,
58
        [IPC_METHOD_TO_VFS_OP(VFS_CLOSE)] = VFS_OP_DEFINED,
59
        [IPC_METHOD_TO_VFS_OP(VFS_READ)] = VFS_OP_DEFINED,
59
        [IPC_METHOD_TO_VFS_OP(VFS_READ)] = VFS_OP_DEFINED,
60
        [IPC_METHOD_TO_VFS_OP(VFS_WRITE)] = VFS_OP_NULL,
60
        [IPC_METHOD_TO_VFS_OP(VFS_WRITE)] = VFS_OP_NULL,
61
        [IPC_METHOD_TO_VFS_OP(VFS_SEEK)] = VFS_OP_DEFAULT
61
        [IPC_METHOD_TO_VFS_OP(VFS_SEEK)] = VFS_OP_DEFAULT
62
    }
62
    }
63
};
63
};
64
 
64
 
65
/*
65
/**
66
 * This fibril processes request from the VFS server.
66
 * This connection fibril processes VFS requests from VFS.
-
 
67
 *
-
 
68
 * In order to support simultaneous VFS requests, our design is as follows.
-
 
69
 * The connection fibril accepts VFS requests from VFS. If there is only one
-
 
70
 * instance of the fibril, VFS will need to serialize all VFS requests it sends
-
 
71
 * to FAT. To overcome this bottleneck, VFS can send FAT the IPC_M_CONNECT_ME_TO
-
 
72
 * call. In that case, a new connection fibril will be created, which in turn
-
 
73
 * will accept the call. Thus, a new phone will be opened for VFS.
-
 
74
 *
-
 
75
 * There are few issues with this arrangement. First, VFS can run out of
-
 
76
 * available phones. In that case, VFS can close some other phones or use one
-
 
77
 * phone for more serialized requests. Similarly, FAT can refuse to duplicate
-
 
78
 * the connection. VFS should then just make use of already existing phones and
-
 
79
 * route its requests through them. To avoid paying the fibril creation price
-
 
80
 * upon each request, FAT might want to keep the connections open after the
-
 
81
 * request has been completed.
67
 */
82
 */
68
void fat_connection(ipc_callid_t iid, ipc_call_t *icall)
83
static void fat_connection(ipc_callid_t iid, ipc_call_t *icall)
69
{
84
{
-
 
85
    if (iid) {
-
 
86
        /*
-
 
87
         * This only happens for connections opened by
-
 
88
         * IPC_M_CONNECT_ME_TO calls as opposed to callback connections
-
 
89
         * created by IPC_M_CONNECT_TO_ME.
-
 
90
         */
-
 
91
        ipc_answer_fast(iid, EOK, 0, 0);
-
 
92
    }
-
 
93
   
70
    dprintf("Callback connection established.\n");
94
    dprintf("VFS-FAT connection established.\n");
71
    while (1) {
95
    while (1) {
72
        ipc_callid_t callid;
96
        ipc_callid_t callid;
73
        ipc_call_t call;
97
        ipc_call_t call;
74
   
98
   
75
        callid = async_get_call(&call);
99
        callid = async_get_call(&call);
-
 
100
        switch  (IPC_GET_METHOD(call)) {
-
 
101
        default:
76
        ipc_answer_fast(callid, ENOTSUP, 0, 0);
102
            ipc_answer_fast(callid, ENOTSUP, 0, 0);
-
 
103
            break;
-
 
104
        }
77
    }
105
    }
78
}
106
}
79
 
107
 
80
int main(int argc, char **argv)
108
int main(int argc, char **argv)
81
{
109
{
82
    int vfs_phone;
110
    int vfs_phone;
83
 
111
 
84
    printf("FAT: HelenOS FAT file system server.\n");
112
    printf("FAT: HelenOS FAT file system server.\n");
85
 
113
 
86
    vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0);
114
    vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0);
87
    while (vfs_phone < EOK) {
115
    while (vfs_phone < EOK) {
88
        usleep(10000);
116
        usleep(10000);
89
        vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0);
117
        vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0);
90
    }
118
    }
91
   
119
   
92
    /*
120
    /*
93
     * Tell VFS that we are here and want to get registered.
121
     * Tell VFS that we are here and want to get registered.
94
     * We use the async framework because VFS will answer the request
122
     * We use the async framework because VFS will answer the request
95
     * out-of-order, when it knows that the operation succeeded or failed.
123
     * out-of-order, when it knows that the operation succeeded or failed.
96
     */
124
     */
97
    ipc_call_t answer;
125
    ipc_call_t answer;
98
    aid_t req = async_send_2(vfs_phone, VFS_REGISTER, 0, 0, &answer);
126
    aid_t req = async_send_2(vfs_phone, VFS_REGISTER, 0, 0, &answer);
99
 
127
 
100
    /*
128
    /*
101
     * Send our VFS info structure to VFS.
129
     * Send our VFS info structure to VFS.
102
     */
130
     */
103
    int rc = ipc_data_send(vfs_phone, &fat_vfs_info, sizeof(fat_vfs_info));
131
    int rc = ipc_data_send(vfs_phone, &fat_vfs_info, sizeof(fat_vfs_info));
104
    if (rc != EOK) {
132
    if (rc != EOK) {
105
        async_wait_for(req, NULL);
133
        async_wait_for(req, NULL);
106
        return rc;
134
        return rc;
107
    }
135
    }
108
 
136
 
109
    /*
137
    /*
110
     * Ask VFS for callback connection.
138
     * Ask VFS for callback connection.
111
     */
139
     */
112
    ipcarg_t phonehash;
140
    ipcarg_t phonehash;
113
    ipc_connect_to_me(vfs_phone, 0, 0, &phonehash);
141
    ipc_connect_to_me(vfs_phone, 0, 0, &phonehash);
114
 
142
 
-
 
143
    /*
-
 
144
     * Create a connection fibril to handle the callback connection.
-
 
145
     */
115
    async_new_connection(phonehash, 0, NULL, fat_connection);
146
    async_new_connection(phonehash, 0, NULL, fat_connection);
-
 
147
   
-
 
148
    /*
-
 
149
     * Tell the async framework that other connections are to be handled by
-
 
150
     * the same connection fibril as well.
-
 
151
     */
-
 
152
    async_set_client_connection(fat_connection);
116
 
153
 
117
    /*
154
    /*
118
     * Pick up the answer for the request to the VFS_REQUEST call.
155
     * Pick up the answer for the request to the VFS_REQUEST call.
119
     */
156
     */
120
    async_wait_for(req, NULL);
157
    async_wait_for(req, NULL);
121
    dprintf("FAT filesystem registered.\n");
158
    dprintf("FAT filesystem registered.\n");
122
 
159
 
-
 
160
    async_create_manager();
-
 
161
 
123
    /*
162
    /*
124
     * TODO: Interestingly, if we merely return, the only thread dies.
163
     * TODO: Interestingly, if we merely return, the only thread dies.
125
     *       If the only thread dies, the whole task is destroyed.
164
     *   If the only thread dies, the whole task is destroyed.
126
     *       Prevent the thread from exiting when there are active fibrils.
165
     *   Prevent the thread from exiting when there are active fibrils.
127
     */
166
     */
128
    fibril_schedule_next_adv(FIBRIL_FROM_DEAD);
167
    fibril_schedule_next_adv(FIBRIL_FROM_DEAD);
129
    /* not reached */
168
    /* not reached */
130
 
169
 
131
    return 0;
170
    return 0;
132
}
171
}
133
 
172
 
134
/**
173
/**
135
 * @}
174
 * @}
136
 */
175
 */
137
 
176