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 <libadt/list.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 = 1;
 
    /*
     * 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_callid_t callid;
        ipc_call_t call;
 
        callid = async_get_call(&call);
 
        switch (IPC_GET_METHOD(call)) {
        case IPC_M_PHONE_HUNGUP:
            keep_on_going = false;
            break;
        case VFS_REGISTER:
            vfs_register(callid, &call);
            /*
             * Keep the connection open so that a file system can
             * later ask us to connect it to another file system.
             * This is necessary to support non-root mounts.
             */
            break;
        case VFS_MOUNT:
            vfs_mount(callid, &call);
            break;
        case VFS_OPEN:
            vfs_open(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;
        default:
            ipc_answer_0(callid, ENOTSUP);
            break;
        }
    }
 
    /* TODO: cleanup after the client */
   
}
 
int main(int argc, char **argv)
{
    ipcarg_t phonead;
 
    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 connectio handling function/fibril.
     */
    async_set_client_connection(vfs_connection);
 
    /*
     * Register at the naming service.
     */
    ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead);
 
    /*
     * Start accepting connections.
     */
    printf(NAME ": Accepting connections\n");
    async_manager();
    return 0;
}
 
/**
 * @}
 */
 

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

Subversion Repositories HelenOS

(root)/trunk/uspace/srv/vfs/vfs.c – Rev 3488 → 3847