WebSVN – HelenOS – Diff – /branches/tracing/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_on_going = false;
            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 3424	Rev 3536
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	#define dprintf(...) printf(__VA_ARGS__)	-
53		-
54	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)
55	{	53	{
56	bool keep_on_going = 1;	54	bool keep_on_going = 1;
57		55
58	/*	56	/*
59	* The connection was opened via the IPC_CONNECT_ME_TO call.	57	* The connection was opened via the IPC_CONNECT_ME_TO call.
60	* This call needs to be answered.	58	* This call needs to be answered.
61	*/	59	*/
62	ipc_answer_0(iid, EOK);	60	ipc_answer_0(iid, EOK);
63		61
64	/*	62	/*
65	* Here we enter the main connection fibril loop.	63	* Here we enter the main connection fibril loop.
66	* 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
67	* 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
68	* 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
69	* by the client is equivalent to client termination because we cannot	67	* by the client is equivalent to client termination because we cannot
70	* 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
71	* 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
72	* connection later.	70	* connection later.
73	*/	71	*/
74	while (keep_on_going) {	72	while (keep_on_going) {
75	ipc_callid_t callid;	73	ipc_callid_t callid;
76	ipc_call_t call;	74	ipc_call_t call;
77		75
78	callid = async_get_call(&call);	76	callid = async_get_call(&call);
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_CLOSE:	92	case VFS_CLOSE:
95	vfs_close(callid, &call);	93	vfs_close(callid, &call);
96	break;	94	break;
97	case VFS_READ:	95	case VFS_READ:
98	vfs_read(callid, &call);	96	vfs_read(callid, &call);
99	break;	97	break;
100	case VFS_WRITE:	98	case VFS_WRITE:
101	vfs_write(callid, &call);	99	vfs_write(callid, &call);
102	break;	100	break;
103	case VFS_SEEK:	101	case VFS_SEEK:
104	vfs_seek(callid, &call);	102	vfs_seek(callid, &call);
105	break;	103	break;
106	case VFS_TRUNCATE:	104	case VFS_TRUNCATE:
107	vfs_truncate(callid, &call);	105	vfs_truncate(callid, &call);
108	break;	106	break;
109	case VFS_MKDIR:	107	case VFS_MKDIR:
110	vfs_mkdir(callid, &call);	108	vfs_mkdir(callid, &call);
111	break;	109	break;
112	case VFS_UNLINK:	110	case VFS_UNLINK:
113	vfs_unlink(callid, &call);	111	vfs_unlink(callid, &call);
114	break;	112	break;
115	case VFS_RENAME:	113	case VFS_RENAME:
116	vfs_rename(callid, &call);	114	vfs_rename(callid, &call);
117	break;	115	break;
118	default:	116	default:
119	ipc_answer_0(callid, ENOTSUP);	117	ipc_answer_0(callid, ENOTSUP);
120	break;	118	break;
121	}	119	}
122	}	120	}
123		121
124	/* TODO: cleanup after the client */	122	/* TODO: cleanup after the client */
125		123
126	}	124	}
127		125
128	int main(int argc, char **argv)	126	int main(int argc, char **argv)
129	{	127	{
130	ipcarg_t phonead;	128	ipcarg_t phonead;
131		129
132	printf(NAME ": HelenOS VFS server\n");	130	printf(NAME ": HelenOS VFS server\n");
133		131
134	/*	132	/*
135	* Initialize the list of registered file systems.	133	* Initialize the list of registered file systems.
136	*/	134	*/
137	list_initialize(&fs_head);	135	list_initialize(&fs_head);
138		136
139	/*	137	/*
140	* Initialize VFS node hash table.	138	* Initialize VFS node hash table.
141	*/	139	*/
142	if (!vfs_nodes_init()) {	140	if (!vfs_nodes_init()) {
143	printf(NAME ": Failed to initialize VFS node hash table\n");	141	printf(NAME ": Failed to initialize VFS node hash table\n");
144	return ENOMEM;	142	return ENOMEM;
145	}	143	}
146		144
147	/*	145	/*
148	* Allocate and initialize the Path Lookup Buffer.	146	* Allocate and initialize the Path Lookup Buffer.
149	*/	147	*/
150	list_initialize(&plb_head);	148	list_initialize(&plb_head);
151	plb = as_get_mappable_page(PLB_SIZE);	149	plb = as_get_mappable_page(PLB_SIZE);
152	if (!plb) {	150	if (!plb) {
153	printf(NAME ": Cannot allocate a mappable piece of address space\n");	151	printf(NAME ": Cannot allocate a mappable piece of address space\n");
154	return ENOMEM;	152	return ENOMEM;
155	}	153	}
156	if (as_area_create(plb, PLB_SIZE, AS_AREA_READ \| AS_AREA_WRITE \|	154	if (as_area_create(plb, PLB_SIZE, AS_AREA_READ \| AS_AREA_WRITE \|
157	AS_AREA_CACHEABLE) != plb) {	155	AS_AREA_CACHEABLE) != plb) {
158	printf(NAME ": Cannot create address space area\n");	156	printf(NAME ": Cannot create address space area\n");
159	return ENOMEM;	157	return ENOMEM;
160	}	158	}
161	memset(plb, 0, PLB_SIZE);	159	memset(plb, 0, PLB_SIZE);
162		160
163	/*	161	/*
164	* Set a connectio handling function/fibril.	162	* Set a connectio handling function/fibril.
165	*/	163	*/
166	async_set_client_connection(vfs_connection);	164	async_set_client_connection(vfs_connection);
167		165
168	/*	166	/*
169	* Register at the naming service.	167	* Register at the naming service.
170	*/	168	*/
171	ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead);	169	ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead);
172		170
173	/*	171	/*
174	* Start accepting connections.	172	* Start accepting connections.
175	*/	173	*/
176	printf(NAME ": Accepting connections\n");	174	printf(NAME ": Accepting connections\n");
177	async_manager();	175	async_manager();
178	return 0;	176	return 0;
179	}	177	}
180		178
181	/**	179	/**
182	* @}	180	* @}
183	*/	181	*/
184		182

Subversion Repositories HelenOS

(root)/branches/tracing/uspace/srv/vfs/vfs.c – Rev 3424 → 3536