WebSVN – HelenOS – Diff – /trunk/uspace/srv/vfs/vfs.c


/*
 * Copyright (c) 2008 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
/** @addtogroup fs
 * @{
 */
 
/**
 * @file vfs.c
 * @brief VFS service for HelenOS.
 */
 
#include <ipc/ipc.h>
#include <ipc/services.h>
#include <async.h>
#include <errno.h>
#include <stdio.h>
#include <bool.h>
#include <string.h>
#include <as.h>
#include <adt/list.h>
#include <atomic.h>
#include <assert.h>
#include "vfs.h"
 
#define NAME "vfs"
 
static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall)
{
    bool keep_on_going = true;
 
    /*
     * The connection was opened via the IPC_CONNECT_ME_TO call.
     * This call needs to be answered.
     */
    ipc_answer_0(iid, EOK);
   
    /*
     * Here we enter the main connection fibril loop.
     * The logic behind this loop and the protocol is that we'd like to keep
     * each connection open until the client hangs up. When the client hangs
     * up, we will free its VFS state. The act of hanging up the connection
     * by the client is equivalent to client termination because we cannot
     * distinguish one from the other. On the other hand, the client can
     * hang up arbitrarily if it has no open files and reestablish the
     * connection later.
     */
    while (keep_on_going) {
        ipc_call_t call;
        ipc_callid_t callid = async_get_call(&call);
       
        fs_handle_t fs_handle;
        int phone;
       
        switch (IPC_GET_METHOD(call)) {
        case IPC_M_PHONE_HUNGUP:
            keep_on_going = false;
            break;
        case VFS_REGISTER:
            vfs_register(callid, &call);
 
            keep_on_going = false;
 
 
 
            break;
        case VFS_MOUNT:
            vfs_mount(callid, &call);
            break;
        case VFS_OPEN:
            vfs_open(callid, &call);
            break;
        case VFS_OPEN_NODE:
            vfs_open_node(callid, &call);
            break;
        case VFS_CLOSE:
            vfs_close(callid, &call);
            break;
        case VFS_READ:
            vfs_read(callid, &call);
            break;
        case VFS_WRITE:
            vfs_write(callid, &call);
            break;
        case VFS_SEEK:
            vfs_seek(callid, &call);
            break;
        case VFS_TRUNCATE:
            vfs_truncate(callid, &call);
            break;
        case VFS_MKDIR:
            vfs_mkdir(callid, &call);
            break;
        case VFS_UNLINK:
            vfs_unlink(callid, &call);
            break;
        case VFS_RENAME:
            vfs_rename(callid, &call);
            break;
        case VFS_DEVICE:
            vfs_device(callid, &call);
            break;
        case VFS_SYNC:
            vfs_sync(callid, &call);
            break;
        case VFS_NODE:
            vfs_node(callid, &call);
            break;
        default:
            ipc_answer_0(callid, ENOTSUP);
            break;
        }
    }
   
    /* TODO: cleanup after the client */
}
 
int main(int argc, char **argv)
{
    printf(NAME ": HelenOS VFS server\n");
   
    /*
     * Initialize the list of registered file systems.
     */
    list_initialize(&fs_head);
   
    /*
     * Initialize VFS node hash table.
     */
    if (!vfs_nodes_init()) {
        printf(NAME ": Failed to initialize VFS node hash table\n");
        return ENOMEM;
    }
   
    /*
     * Allocate and initialize the Path Lookup Buffer.
     */
    list_initialize(&plb_head);
    plb = as_get_mappable_page(PLB_SIZE);
    if (!plb) {
        printf(NAME ": Cannot allocate a mappable piece of address space\n");
        return ENOMEM;
    }
   
    if (as_area_create(plb, PLB_SIZE, AS_AREA_READ | AS_AREA_WRITE |
        AS_AREA_CACHEABLE) != plb) {
        printf(NAME ": Cannot create address space area\n");
        return ENOMEM;
    }
    memset(plb, 0, PLB_SIZE);
   
    /*
     * Set a connection handling function/fibril.
     */
    async_set_client_connection(vfs_connection);
 
    /*
     * Add a fibril for handling pending mounts.
     */
    fid_t fid = fibril_create(vfs_process_pending_mount, NULL);
    assert(fid);
    fibril_add_ready(fid);
   
    /*
     * Register at the naming service.
     */
    ipcarg_t phonead;
    ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead);
   
    /*
     * Start accepting connections.
     */
    printf(NAME ": Accepting connections\n");
    async_manager();
    return 0;
}
 
/**
 * @}
 */
 

Rev 4539	Rev 4563
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 <adt/list.h>	46	#include <adt/list.h>
47	#include <atomic.h>	47	#include <atomic.h>
48	#include <assert.h>	48	#include <assert.h>
49	#include "vfs.h"	49	#include "vfs.h"
50		50
51	#define NAME "vfs"	51	#define NAME "vfs"
52		52
53	static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall)	53	static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall)
54	{	54	{
55	bool keep_on_going = true;	55	bool keep_on_going = true;
56		56
57	/*	57	/*
58	* The connection was opened via the IPC_CONNECT_ME_TO call.	58	* The connection was opened via the IPC_CONNECT_ME_TO call.
59	* This call needs to be answered.	59	* This call needs to be answered.
60	*/	60	*/
61	ipc_answer_0(iid, EOK);	61	ipc_answer_0(iid, EOK);
62		62
63	/*	63	/*
64	* Here we enter the main connection fibril loop.	64	* Here we enter the main connection fibril loop.
65	* The logic behind this loop and the protocol is that we'd like to keep	65	* The logic behind this loop and the protocol is that we'd like to keep
66	* each connection open until the client hangs up. When the client hangs	66	* each connection open until the client hangs up. When the client hangs
67	* up, we will free its VFS state. The act of hanging up the connection	67	* up, we will free its VFS state. The act of hanging up the connection
68	* by the client is equivalent to client termination because we cannot	68	* by the client is equivalent to client termination because we cannot
69	* distinguish one from the other. On the other hand, the client can	69	* distinguish one from the other. On the other hand, the client can
70	* hang up arbitrarily if it has no open files and reestablish the	70	* hang up arbitrarily if it has no open files and reestablish the
71	* connection later.	71	* connection later.
72	*/	72	*/
73	while (keep_on_going) {	73	while (keep_on_going) {
74	ipc_call_t call;	74	ipc_call_t call;
75	ipc_callid_t callid = async_get_call(&call);	75	ipc_callid_t callid = async_get_call(&call);
76		76
77	fs_handle_t fs_handle;	77	fs_handle_t fs_handle;
78	int phone;	78	int phone;
79		79
80	switch (IPC_GET_METHOD(call)) {	80	switch (IPC_GET_METHOD(call)) {
81	case IPC_M_PHONE_HUNGUP:	81	case IPC_M_PHONE_HUNGUP:
82	keep_on_going = false;	82	keep_on_going = false;
83	break;	83	break;
84	case VFS_REGISTER:	84	case VFS_REGISTER:
85	vfs_register(callid, &call);	85	vfs_register(callid, &call);
86	/*	-
87	* Keep the connection open so that a file system can	86	keep_on_going = false;
88	* later ask us to connect it to another file system.	-
89	* This is necessary to support non-root mounts.	-
90	*/	-
91	break;	87	break;
92	case VFS_MOUNT:	88	case VFS_MOUNT:
93	vfs_mount(callid, &call);	89	vfs_mount(callid, &call);
94	break;	90	break;
95	case VFS_OPEN:	91	case VFS_OPEN:
96	vfs_open(callid, &call);	92	vfs_open(callid, &call);
97	break;	93	break;
98	case VFS_OPEN_NODE:	94	case VFS_OPEN_NODE:
99	vfs_open_node(callid, &call);	95	vfs_open_node(callid, &call);
100	break;	96	break;
101	case VFS_CLOSE:	97	case VFS_CLOSE:
102	vfs_close(callid, &call);	98	vfs_close(callid, &call);
103	break;	99	break;
104	case VFS_READ:	100	case VFS_READ:
105	vfs_read(callid, &call);	101	vfs_read(callid, &call);
106	break;	102	break;
107	case VFS_WRITE:	103	case VFS_WRITE:
108	vfs_write(callid, &call);	104	vfs_write(callid, &call);
109	break;	105	break;
110	case VFS_SEEK:	106	case VFS_SEEK:
111	vfs_seek(callid, &call);	107	vfs_seek(callid, &call);
112	break;	108	break;
113	case VFS_TRUNCATE:	109	case VFS_TRUNCATE:
114	vfs_truncate(callid, &call);	110	vfs_truncate(callid, &call);
115	break;	111	break;
116	case VFS_MKDIR:	112	case VFS_MKDIR:
117	vfs_mkdir(callid, &call);	113	vfs_mkdir(callid, &call);
118	break;	114	break;
119	case VFS_UNLINK:	115	case VFS_UNLINK:
120	vfs_unlink(callid, &call);	116	vfs_unlink(callid, &call);
121	break;	117	break;
122	case VFS_RENAME:	118	case VFS_RENAME:
123	vfs_rename(callid, &call);	119	vfs_rename(callid, &call);
124	break;	120	break;
125	case VFS_DEVICE:	121	case VFS_DEVICE:
126	vfs_device(callid, &call);	122	vfs_device(callid, &call);
127	break;	123	break;
128	case VFS_SYNC:	124	case VFS_SYNC:
129	vfs_sync(callid, &call);	125	vfs_sync(callid, &call);
130	break;	126	break;
131	case VFS_NODE:	127	case VFS_NODE:
132	vfs_node(callid, &call);	128	vfs_node(callid, &call);
133	break;	129	break;
134	default:	130	default:
135	ipc_answer_0(callid, ENOTSUP);	131	ipc_answer_0(callid, ENOTSUP);
136	break;	132	break;
137	}	133	}
138	}	134	}
139		135
140	/* TODO: cleanup after the client */	136	/* TODO: cleanup after the client */
141	}	137	}
142		138
143	int main(int argc, char **argv)	139	int main(int argc, char **argv)
144	{	140	{
145	printf(NAME ": HelenOS VFS server\n");	141	printf(NAME ": HelenOS VFS server\n");
146		142
147	/*	143	/*
148	* Initialize the list of registered file systems.	144	* Initialize the list of registered file systems.
149	*/	145	*/
150	list_initialize(&fs_head);	146	list_initialize(&fs_head);
151		147
152	/*	148	/*
153	* Initialize VFS node hash table.	149	* Initialize VFS node hash table.
154	*/	150	*/
155	if (!vfs_nodes_init()) {	151	if (!vfs_nodes_init()) {
156	printf(NAME ": Failed to initialize VFS node hash table\n");	152	printf(NAME ": Failed to initialize VFS node hash table\n");
157	return ENOMEM;	153	return ENOMEM;
158	}	154	}
159		155
160	/*	156	/*
161	* Allocate and initialize the Path Lookup Buffer.	157	* Allocate and initialize the Path Lookup Buffer.
162	*/	158	*/
163	list_initialize(&plb_head);	159	list_initialize(&plb_head);
164	plb = as_get_mappable_page(PLB_SIZE);	160	plb = as_get_mappable_page(PLB_SIZE);
165	if (!plb) {	161	if (!plb) {
166	printf(NAME ": Cannot allocate a mappable piece of address space\n");	162	printf(NAME ": Cannot allocate a mappable piece of address space\n");
167	return ENOMEM;	163	return ENOMEM;
168	}	164	}
169		165
170	if (as_area_create(plb, PLB_SIZE, AS_AREA_READ \| AS_AREA_WRITE \|	166	if (as_area_create(plb, PLB_SIZE, AS_AREA_READ \| AS_AREA_WRITE \|
171	AS_AREA_CACHEABLE) != plb) {	167	AS_AREA_CACHEABLE) != plb) {
172	printf(NAME ": Cannot create address space area\n");	168	printf(NAME ": Cannot create address space area\n");
173	return ENOMEM;	169	return ENOMEM;
174	}	170	}
175	memset(plb, 0, PLB_SIZE);	171	memset(plb, 0, PLB_SIZE);
176		172
177	/*	173	/*
178	* Set a connection handling function/fibril.	174	* Set a connection handling function/fibril.
179	*/	175	*/
180	async_set_client_connection(vfs_connection);	176	async_set_client_connection(vfs_connection);
181		177
182	/*	178	/*
183	* Add a fibril for handling pending mounts.	179	* Add a fibril for handling pending mounts.
184	*/	180	*/
185	fid_t fid = fibril_create(vfs_process_pending_mount, NULL);	181	fid_t fid = fibril_create(vfs_process_pending_mount, NULL);
186	assert(fid);	182	assert(fid);
187	fibril_add_ready(fid);	183	fibril_add_ready(fid);
188		184
189	/*	185	/*
190	* Register at the naming service.	186	* Register at the naming service.
191	*/	187	*/
192	ipcarg_t phonead;	188	ipcarg_t phonead;
193	ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead);	189	ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead);
194		190
195	/*	191	/*
196	* Start accepting connections.	192	* Start accepting connections.
197	*/	193	*/
198	printf(NAME ": Accepting connections\n");	194	printf(NAME ": Accepting connections\n");
199	async_manager();	195	async_manager();
200	return 0;	196	return 0;
201	}	197	}
202		198
203	/**	199	/**
204	* @}	200	* @}
205	*/	201	*/
206		202

Subversion Repositories HelenOS

(root)/trunk/uspace/srv/vfs/vfs.c @ 3955 – Rev 4539 → 4563