Subversion Repositories HelenOS

Rev

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

Rev 2735 Rev 2763
1
/*
1
/*
2
 * Copyright (c) 2008 Jakub Jermar
2
 * Copyright (c) 2008 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.c
34
 * @file    vfs.c
35
 * @brief   VFS service for HelenOS.
35
 * @brief   VFS service for HelenOS.
36
 */
36
 */
37
 
37
 
38
#include <ipc/ipc.h>
38
#include <ipc/ipc.h>
39
#include <ipc/services.h>
39
#include <ipc/services.h>
40
#include <async.h>
40
#include <async.h>
41
#include <errno.h>
41
#include <errno.h>
42
#include <stdio.h>
42
#include <stdio.h>
43
#include <bool.h>
43
#include <bool.h>
44
#include <string.h>
44
#include <string.h>
45
#include <as.h>
45
#include <as.h>
46
#include <libadt/list.h>
46
#include <libadt/list.h>
47
#include <atomic.h>
47
#include <atomic.h>
48
#include "vfs.h"
48
#include "vfs.h"
49
 
49
 
50
#define dprintf(...)    printf(__VA_ARGS__)
50
#define dprintf(...)    printf(__VA_ARGS__)
51
 
51
 
52
static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall)
52
static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall)
53
{
53
{
54
    bool keep_on_going = 1;
54
    bool keep_on_going = 1;
55
 
55
 
56
    printf("Connection opened from %p\n", icall->in_phone_hash);
56
    printf("Connection opened from %p\n", icall->in_phone_hash);
57
 
57
 
58
    /*
58
    /*
59
     * The connection was opened via the IPC_CONNECT_ME_TO call.
59
     * The connection was opened via the IPC_CONNECT_ME_TO call.
60
     * This call needs to be answered.
60
     * This call needs to be answered.
61
     */
61
     */
62
    ipc_answer_0(iid, EOK);
62
    ipc_answer_0(iid, EOK);
63
 
63
 
64
    /*
64
    /*
65
     * Here we enter the main connection fibril loop.
65
     * Here we enter the main connection fibril loop.
66
     * The logic behind this loop and the protocol is that we'd like to keep
66
     * The logic behind this loop and the protocol is that we'd like to keep
67
     * each connection open until the client hangs up. When the client hangs
67
     * each connection open until the client hangs up. When the client hangs
68
     * up, we will free its VFS state. The act of hanging up the connection
68
     * up, we will free its VFS state. The act of hanging up the connection
69
     * by the client is equivalent to client termination because we cannot
69
     * by the client is equivalent to client termination because we cannot
70
     * distinguish one from the other. On the other hand, the client can
70
     * distinguish one from the other. On the other hand, the client can
71
     * hang up arbitrarily if it has no open files and reestablish the
71
     * hang up arbitrarily if it has no open files and reestablish the
72
     * connection later.
72
     * connection later.
73
     */
73
     */
74
    while (keep_on_going) {
74
    while (keep_on_going) {
75
        ipc_callid_t callid;
75
        ipc_callid_t callid;
76
        ipc_call_t call;
76
        ipc_call_t call;
77
 
77
 
78
        callid = async_get_call(&call);
78
        callid = async_get_call(&call);
79
 
79
 
80
        printf("Received call, method=%d\n", IPC_GET_METHOD(call));
80
        printf("Received call, method=%d\n", IPC_GET_METHOD(call));
81
       
81
       
82
        switch (IPC_GET_METHOD(call)) {
82
        switch (IPC_GET_METHOD(call)) {
83
        case IPC_M_PHONE_HUNGUP:
83
        case IPC_M_PHONE_HUNGUP:
84
            keep_on_going = false;
84
            keep_on_going = false;
85
            break;
85
            break;
86
        case VFS_REGISTER:
86
        case VFS_REGISTER:
87
            vfs_register(callid, &call);
87
            vfs_register(callid, &call);
88
            keep_on_going = false;
88
            keep_on_going = false;
89
            break;
89
            break;
90
        case VFS_MOUNT:
90
        case VFS_MOUNT:
91
            vfs_mount(callid, &call);
91
            vfs_mount(callid, &call);
92
            break;
92
            break;
93
        case VFS_OPEN:
93
        case VFS_OPEN:
94
            vfs_open(callid, &call);
94
            vfs_open(callid, &call);
95
            break;
95
            break;
96
        case VFS_CLOSE:
96
        case VFS_CLOSE:
97
            vfs_close(callid, &call);
97
            vfs_close(callid, &call);
98
            break;
98
            break;
99
        case VFS_READ:
99
        case VFS_READ:
100
            vfs_read(callid, &call);
100
            vfs_read(callid, &call);
101
            break;
101
            break;
102
        case VFS_WRITE:
102
        case VFS_WRITE:
103
            vfs_write(callid, &call);
103
            vfs_write(callid, &call);
104
            break;
104
            break;
105
        case VFS_SEEK:
105
        case VFS_SEEK:
106
            vfs_seek(callid, &call);
106
            vfs_seek(callid, &call);
107
            break;
107
            break;
108
        case VFS_TRUNCATE:
108
        case VFS_TRUNCATE:
109
            vfs_truncate(callid, &call);
109
            vfs_truncate(callid, &call);
110
            break;
110
            break;
111
        case VFS_MKDIR:
111
        case VFS_MKDIR:
112
            vfs_mkdir(callid, &call);
112
            vfs_mkdir(callid, &call);
113
            break;
113
            break;
114
        case VFS_UNLINK:
114
        case VFS_UNLINK:
115
            vfs_unlink(callid, &call);
115
            vfs_unlink(callid, &call);
116
            break;
116
            break;
-
 
117
        case VFS_RENAME:
-
 
118
            vfs_rename(callid, &call);
-
 
119
            break;
117
        default:
120
        default:
118
            ipc_answer_0(callid, ENOTSUP);
121
            ipc_answer_0(callid, ENOTSUP);
119
            break;
122
            break;
120
        }
123
        }
121
    }
124
    }
122
 
125
 
123
    /* TODO: cleanup after the client */
126
    /* TODO: cleanup after the client */
124
   
127
   
125
}
128
}
126
 
129
 
127
int main(int argc, char **argv)
130
int main(int argc, char **argv)
128
{
131
{
129
    ipcarg_t phonead;
132
    ipcarg_t phonead;
130
 
133
 
131
    printf("VFS: HelenOS VFS server\n");
134
    printf("VFS: HelenOS VFS server\n");
132
 
135
 
133
    /*
136
    /*
134
     * Initialize the list of registered file systems.
137
     * Initialize the list of registered file systems.
135
     */
138
     */
136
    list_initialize(&fs_head);
139
    list_initialize(&fs_head);
137
 
140
 
138
    /*
141
    /*
139
     * Initialize VFS node hash table.
142
     * Initialize VFS node hash table.
140
     */
143
     */
141
    if (!vfs_nodes_init()) {
144
    if (!vfs_nodes_init()) {
142
        printf("Failed to initialize the VFS node hash table.\n");
145
        printf("Failed to initialize the VFS node hash table.\n");
143
        return ENOMEM;
146
        return ENOMEM;
144
    }
147
    }
145
 
148
 
146
    /*
149
    /*
147
     * Allocate and initialize the Path Lookup Buffer.
150
     * Allocate and initialize the Path Lookup Buffer.
148
     */
151
     */
149
    list_initialize(&plb_head);
152
    list_initialize(&plb_head);
150
    plb = as_get_mappable_page(PLB_SIZE);
153
    plb = as_get_mappable_page(PLB_SIZE);
151
    if (!plb) {
154
    if (!plb) {
152
        printf("Cannot allocate a mappable piece of address space\n");
155
        printf("Cannot allocate a mappable piece of address space\n");
153
        return ENOMEM;
156
        return ENOMEM;
154
    }
157
    }
155
    if (as_area_create(plb, PLB_SIZE, AS_AREA_READ | AS_AREA_WRITE |
158
    if (as_area_create(plb, PLB_SIZE, AS_AREA_READ | AS_AREA_WRITE |
156
        AS_AREA_CACHEABLE) != plb) {
159
        AS_AREA_CACHEABLE) != plb) {
157
        printf("Cannot create address space area.\n");
160
        printf("Cannot create address space area.\n");
158
        return ENOMEM;
161
        return ENOMEM;
159
    }
162
    }
160
    memset(plb, 0, PLB_SIZE);
163
    memset(plb, 0, PLB_SIZE);
161
   
164
   
162
    /*
165
    /*
163
     * Set a connectio handling function/fibril.
166
     * Set a connectio handling function/fibril.
164
     */
167
     */
165
    async_set_client_connection(vfs_connection);
168
    async_set_client_connection(vfs_connection);
166
 
169
 
167
    /*
170
    /*
168
     * Register at the naming service.
171
     * Register at the naming service.
169
     */
172
     */
170
    ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead);
173
    ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead);
171
 
174
 
172
    /*
175
    /*
173
     * Start accepting connections.
176
     * Start accepting connections.
174
     */
177
     */
175
    async_manager();
178
    async_manager();
176
    return 0;
179
    return 0;
177
}
180
}
178
 
181
 
179
/**
182
/**
180
 * @}
183
 * @}
181
 */
184
 */
182
 
185