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

Subversion Repositories HelenOS

(root)/trunk/uspace/srv/vfs/vfs.c – Rev 4563 → 4566