WebSVN – HelenOS – Diff – /branches/network/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 dprintf(...)    printf(__VA_ARGS__)
 
static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall)
{
    bool keep_on_going = 1;
 
    printf("Connection opened from %p\n", icall->in_phone_hash);
 
    /*
     * 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);
 
        printf("Received call, method=%d\n", IPC_GET_METHOD(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;
        default:
            ipc_answer_0(callid, ENOTSUP);
            break;
        }
    }
 
    /* TODO: cleanup after the client */
   
}
 
int main(int argc, char **argv)
{
    ipcarg_t phonead;
 
    printf("VFS: 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("Failed to initialize the 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("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("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.
     */
    async_manager();
    return 0;
}
 
/**
 * @}
 */
 

Rev 2734	Rev 2735
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:
-		115	vfs_unlink(callid, &call);
-		116	break;
114	default:	117	default:
115	ipc_answer_0(callid, ENOTSUP);	118	ipc_answer_0(callid, ENOTSUP);
116	break;	119	break;
117	}	120	}
118	}	121	}
119		122
120	/* TODO: cleanup after the client */	123	/* TODO: cleanup after the client */
121		124
122	}	125	}
123		126
124	int main(int argc, char **argv)	127	int main(int argc, char **argv)
125	{	128	{
126	ipcarg_t phonead;	129	ipcarg_t phonead;
127		130
128	printf("VFS: HelenOS VFS server\n");	131	printf("VFS: HelenOS VFS server\n");
129		132
130	/*	133	/*
131	* Initialize the list of registered file systems.	134	* Initialize the list of registered file systems.
132	*/	135	*/
133	list_initialize(&fs_head);	136	list_initialize(&fs_head);
134		137
135	/*	138	/*
136	* Initialize VFS node hash table.	139	* Initialize VFS node hash table.
137	*/	140	*/
138	if (!vfs_nodes_init()) {	141	if (!vfs_nodes_init()) {
139	printf("Failed to initialize the VFS node hash table.\n");	142	printf("Failed to initialize the VFS node hash table.\n");
140	return ENOMEM;	143	return ENOMEM;
141	}	144	}
142		145
143	/*	146	/*
144	* Allocate and initialize the Path Lookup Buffer.	147	* Allocate and initialize the Path Lookup Buffer.
145	*/	148	*/
146	list_initialize(&plb_head);	149	list_initialize(&plb_head);
147	plb = as_get_mappable_page(PLB_SIZE);	150	plb = as_get_mappable_page(PLB_SIZE);
148	if (!plb) {	151	if (!plb) {
149	printf("Cannot allocate a mappable piece of address space\n");	152	printf("Cannot allocate a mappable piece of address space\n");
150	return ENOMEM;	153	return ENOMEM;
151	}	154	}
152	if (as_area_create(plb, PLB_SIZE, AS_AREA_READ \| AS_AREA_WRITE \|	155	if (as_area_create(plb, PLB_SIZE, AS_AREA_READ \| AS_AREA_WRITE \|
153	AS_AREA_CACHEABLE) != plb) {	156	AS_AREA_CACHEABLE) != plb) {
154	printf("Cannot create address space area.\n");	157	printf("Cannot create address space area.\n");
155	return ENOMEM;	158	return ENOMEM;
156	}	159	}
157	memset(plb, 0, PLB_SIZE);	160	memset(plb, 0, PLB_SIZE);
158		161
159	/*	162	/*
160	* Set a connectio handling function/fibril.	163	* Set a connectio handling function/fibril.
161	*/	164	*/
162	async_set_client_connection(vfs_connection);	165	async_set_client_connection(vfs_connection);
163		166
164	/*	167	/*
165	* Register at the naming service.	168	* Register at the naming service.
166	*/	169	*/
167	ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead);	170	ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, 0, &phonead);
168		171
169	/*	172	/*
170	* Start accepting connections.	173	* Start accepting connections.
171	*/	174	*/
172	async_manager();	175	async_manager();
173	return 0;	176	return 0;
174	}	177	}
175		178
176	/**	179	/**
177	* @}	180	* @}
178	*/	181	*/
179		182

Subversion Repositories HelenOS

(root)/branches/network/uspace/srv/vfs/vfs.c @ 4718 – Rev 2734 → 2735