WebSVN – HelenOS – Diff – /branches/network/uspace/srv/fs/fat/fat.c


/*
 * Copyright (c) 2006 Martin Decky
 * 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    fat.c
 * @brief   FAT file system driver for HelenOS.
 */
 
#include "fat.h"
#include <ipc/ipc.h>
#include <ipc/services.h>
#include <async.h>
#include <errno.h>
#include <unistd.h>
#include <stdio.h>
#include <libfs.h>
#include "../../vfs/vfs.h"
 
 
vfs_info_t fat_vfs_info = {
    .name = "fat",
    .ops = {
 
 
 
        [IPC_METHOD_TO_VFS_OP(VFS_LOOKUP)] = VFS_OP_DEFINED,
        [IPC_METHOD_TO_VFS_OP(VFS_OPEN)] = VFS_OP_DEFINED,
 
        [IPC_METHOD_TO_VFS_OP(VFS_CLOSE)] = VFS_OP_DEFINED,
        [IPC_METHOD_TO_VFS_OP(VFS_READ)] = VFS_OP_DEFINED,
        [IPC_METHOD_TO_VFS_OP(VFS_WRITE)] = VFS_OP_NULL,
        [IPC_METHOD_TO_VFS_OP(VFS_TRUNCATE)] = VFS_OP_NULL,
        [IPC_METHOD_TO_VFS_OP(VFS_RENAME)] = VFS_OP_NULL,
        [IPC_METHOD_TO_VFS_OP(VFS_OPENDIR)] = VFS_OP_NULL,
        [IPC_METHOD_TO_VFS_OP(VFS_READDIR)] = VFS_OP_NULL,
        [IPC_METHOD_TO_VFS_OP(VFS_CLOSEDIR)] = VFS_OP_NULL,
        [IPC_METHOD_TO_VFS_OP(VFS_UNLINK)] = VFS_OP_NULL,
        [IPC_METHOD_TO_VFS_OP(VFS_MOUNT)] = VFS_OP_NULL,
        [IPC_METHOD_TO_VFS_OP(VFS_UNMOUNT)] = VFS_OP_NULL,
    }
};
 
fs_reg_t fat_reg;
 
/**
 * This connection fibril processes VFS requests from VFS.
 *
 * In order to support simultaneous VFS requests, our design is as follows.
 * The connection fibril accepts VFS requests from VFS. If there is only one
 * instance of the fibril, VFS will need to serialize all VFS requests it sends
 * to FAT. To overcome this bottleneck, VFS can send FAT the IPC_M_CONNECT_ME_TO
 * call. In that case, a new connection fibril will be created, which in turn
 * will accept the call. Thus, a new phone will be opened for VFS.
 *
 * There are few issues with this arrangement. First, VFS can run out of
 * available phones. In that case, VFS can close some other phones or use one
 * phone for more serialized requests. Similarily, FAT can refuse to duplicate
 * the connection. VFS should then just make use of already existing phones and
 * route its requests through them. To avoid paying the fibril creation price
 * upon each request, FAT might want to keep the connections open after the
 * request has been completed.
 */
static void fat_connection(ipc_callid_t iid, ipc_call_t *icall)
{
    if (iid) {
        /*
         * This only happens for connections opened by
         * IPC_M_CONNECT_ME_TO calls as opposed to callback connections
         * created by IPC_M_CONNECT_TO_ME.
         */
        ipc_answer_0(iid, EOK);
    }
   
    dprintf("VFS-FAT connection established.\n");
    while (1) {
        ipc_callid_t callid;
        ipc_call_t call;
   
        callid = async_get_call(&call);
        switch  (IPC_GET_METHOD(call)) {
 
 
 
        case VFS_LOOKUP:
            fat_lookup(callid, &call);
            break;
        default:
            ipc_answer_0(callid, ENOTSUP);
            break;
        }
    }
}
 
int main(int argc, char **argv)
{
    int vfs_phone;
 
    printf("FAT: HelenOS FAT file system server.\n");
 
    vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0);
    while (vfs_phone < EOK) {
        usleep(10000);
        vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0);
    }
   
    int rc;
    rc = fs_register(vfs_phone, &fat_reg, &fat_vfs_info, fat_connection);
    if (rc != EOK) {
        printf("Failed to register the FAT file system (%d)\n", rc);
        return rc;
    }
   
    dprintf("FAT filesystem registered, fs_handle=%d.\n",
        fat_reg.fs_handle);
 
    async_manager();
    /* not reached */
    return 0;
}
 
/**
 * @}
 */
 

Rev 2644	Rev 2690
1	/*	1	/*
2	* Copyright (c) 2006 Martin Decky	2	* Copyright (c) 2006 Martin Decky
3	* Copyright (c) 2007 Jakub Jermar	3	* Copyright (c) 2008 Jakub Jermar
4	* All rights reserved.	4	* All rights reserved.
5	*	5	*
6	* Redistribution and use in source and binary forms, with or without	6	* Redistribution and use in source and binary forms, with or without
7	* modification, are permitted provided that the following conditions	7	* modification, are permitted provided that the following conditions
8	* are met:	8	* are met:
9	*	9	*
10	* - Redistributions of source code must retain the above copyright	10	* - Redistributions of source code must retain the above copyright
11	* notice, this list of conditions and the following disclaimer.	11	* notice, this list of conditions and the following disclaimer.
12	* - Redistributions in binary form must reproduce the above copyright	12	* - Redistributions in binary form must reproduce the above copyright
13	* notice, this list of conditions and the following disclaimer in the	13	* notice, this list of conditions and the following disclaimer in the
14	* documentation and/or other materials provided with the distribution.	14	* documentation and/or other materials provided with the distribution.
15	* - The name of the author may not be used to endorse or promote products	15	* - The name of the author may not be used to endorse or promote products
16	* derived from this software without specific prior written permission.	16	* derived from this software without specific prior written permission.
17	*	17	*
18	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	18	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES	19	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	20	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	21	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	22	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	23	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY	24	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	25	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF	26	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.	27	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28	*/	28	*/
29		29
30	/** @addtogroup fs	30	/** @addtogroup fs
31	* @{	31	* @{
32	*/	32	*/
33		33
34	/**	34	/**
35	* @file fat.c	35	* @file fat.c
36	* @brief FAT file system driver for HelenOS.	36	* @brief FAT file system driver for HelenOS.
37	*/	37	*/
38		38
39	#include "fat.h"	39	#include "fat.h"
40	#include <ipc/ipc.h>	40	#include <ipc/ipc.h>
41	#include <ipc/services.h>	41	#include <ipc/services.h>
42	#include <async.h>	42	#include <async.h>
43	#include <errno.h>	43	#include <errno.h>
44	#include <unistd.h>	44	#include <unistd.h>
45	#include <stdio.h>	45	#include <stdio.h>
46	#include <libfs.h>	46	#include <libfs.h>
47	#include "../../vfs/vfs.h"	47	#include "../../vfs/vfs.h"
48		48
49		49
50	vfs_info_t fat_vfs_info = {	50	vfs_info_t fat_vfs_info = {
51	.name = "fat",	51	.name = "fat",
52	.ops = {	52	.ops = {
53	[IPC_METHOD_TO_VFS_OP(VFS_REGISTER)] = VFS_OP_DEFINED,	-
54	[IPC_METHOD_TO_VFS_OP(VFS_MOUNT)] = VFS_OP_DEFINED,	-
55	[IPC_METHOD_TO_VFS_OP(VFS_UNMOUNT)] = VFS_OP_DEFINED,	-
56	[IPC_METHOD_TO_VFS_OP(VFS_LOOKUP)] = VFS_OP_DEFINED,	53	[IPC_METHOD_TO_VFS_OP(VFS_LOOKUP)] = VFS_OP_DEFINED,
57	[IPC_METHOD_TO_VFS_OP(VFS_OPEN)] = VFS_OP_DEFINED,	54	[IPC_METHOD_TO_VFS_OP(VFS_OPEN)] = VFS_OP_DEFINED,
58	[IPC_METHOD_TO_VFS_OP(VFS_CREATE)] = VFS_OP_DEFINED,	-
59	[IPC_METHOD_TO_VFS_OP(VFS_CLOSE)] = VFS_OP_DEFINED,	55	[IPC_METHOD_TO_VFS_OP(VFS_CLOSE)] = VFS_OP_DEFINED,
60	[IPC_METHOD_TO_VFS_OP(VFS_READ)] = VFS_OP_DEFINED,	56	[IPC_METHOD_TO_VFS_OP(VFS_READ)] = VFS_OP_DEFINED,
61	[IPC_METHOD_TO_VFS_OP(VFS_WRITE)] = VFS_OP_NULL,	57	[IPC_METHOD_TO_VFS_OP(VFS_WRITE)] = VFS_OP_NULL,
-		58	[IPC_METHOD_TO_VFS_OP(VFS_TRUNCATE)] = VFS_OP_NULL,
62	[IPC_METHOD_TO_VFS_OP(VFS_SEEK)] = VFS_OP_DEFAULT	59	[IPC_METHOD_TO_VFS_OP(VFS_RENAME)] = VFS_OP_NULL,
-		60	[IPC_METHOD_TO_VFS_OP(VFS_OPENDIR)] = VFS_OP_NULL,
-		61	[IPC_METHOD_TO_VFS_OP(VFS_READDIR)] = VFS_OP_NULL,
-		62	[IPC_METHOD_TO_VFS_OP(VFS_CLOSEDIR)] = VFS_OP_NULL,
-		63	[IPC_METHOD_TO_VFS_OP(VFS_UNLINK)] = VFS_OP_NULL,
-		64	[IPC_METHOD_TO_VFS_OP(VFS_MOUNT)] = VFS_OP_NULL,
-		65	[IPC_METHOD_TO_VFS_OP(VFS_UNMOUNT)] = VFS_OP_NULL,
63	}	66	}
64	};	67	};
65		68
66	fs_reg_t fat_reg;	69	fs_reg_t fat_reg;
67		70
68	/**	71	/**
69	* This connection fibril processes VFS requests from VFS.	72	* This connection fibril processes VFS requests from VFS.
70	*	73	*
71	* In order to support simultaneous VFS requests, our design is as follows.	74	* In order to support simultaneous VFS requests, our design is as follows.
72	* The connection fibril accepts VFS requests from VFS. If there is only one	75	* The connection fibril accepts VFS requests from VFS. If there is only one
73	* instance of the fibril, VFS will need to serialize all VFS requests it sends	76	* instance of the fibril, VFS will need to serialize all VFS requests it sends
74	* to FAT. To overcome this bottleneck, VFS can send FAT the IPC_M_CONNECT_ME_TO	77	* to FAT. To overcome this bottleneck, VFS can send FAT the IPC_M_CONNECT_ME_TO
75	* call. In that case, a new connection fibril will be created, which in turn	78	* call. In that case, a new connection fibril will be created, which in turn
76	* will accept the call. Thus, a new phone will be opened for VFS.	79	* will accept the call. Thus, a new phone will be opened for VFS.
77	*	80	*
78	* There are few issues with this arrangement. First, VFS can run out of	81	* There are few issues with this arrangement. First, VFS can run out of
79	* available phones. In that case, VFS can close some other phones or use one	82	* available phones. In that case, VFS can close some other phones or use one
80	* phone for more serialized requests. Similarily, FAT can refuse to duplicate	83	* phone for more serialized requests. Similarily, FAT can refuse to duplicate
81	* the connection. VFS should then just make use of already existing phones and	84	* the connection. VFS should then just make use of already existing phones and
82	* route its requests through them. To avoid paying the fibril creation price	85	* route its requests through them. To avoid paying the fibril creation price
83	* upon each request, FAT might want to keep the connections open after the	86	* upon each request, FAT might want to keep the connections open after the
84	* request has been completed.	87	* request has been completed.
85	*/	88	*/
86	static void fat_connection(ipc_callid_t iid, ipc_call_t *icall)	89	static void fat_connection(ipc_callid_t iid, ipc_call_t *icall)
87	{	90	{
88	if (iid) {	91	if (iid) {
89	/*	92	/*
90	* This only happens for connections opened by	93	* This only happens for connections opened by
91	* IPC_M_CONNECT_ME_TO calls as opposed to callback connections	94	* IPC_M_CONNECT_ME_TO calls as opposed to callback connections
92	* created by IPC_M_CONNECT_TO_ME.	95	* created by IPC_M_CONNECT_TO_ME.
93	*/	96	*/
94	ipc_answer_0(iid, EOK);	97	ipc_answer_0(iid, EOK);
95	}	98	}
96		99
97	dprintf("VFS-FAT connection established.\n");	100	dprintf("VFS-FAT connection established.\n");
98	while (1) {	101	while (1) {
99	ipc_callid_t callid;	102	ipc_callid_t callid;
100	ipc_call_t call;	103	ipc_call_t call;
101		104
102	callid = async_get_call(&call);	105	callid = async_get_call(&call);
103	switch (IPC_GET_METHOD(call)) {	106	switch (IPC_GET_METHOD(call)) {
104	case VFS_REGISTER:	-
105	ipc_answer_0(callid, EOK);	-
106	break;	-
107	case VFS_LOOKUP:	107	case VFS_LOOKUP:
108	fat_lookup(callid, &call);	108	fat_lookup(callid, &call);
109	break;	109	break;
110	default:	110	default:
111	ipc_answer_0(callid, ENOTSUP);	111	ipc_answer_0(callid, ENOTSUP);
112	break;	112	break;
113	}	113	}
114	}	114	}
115	}	115	}
116		116
117	int main(int argc, char **argv)	117	int main(int argc, char **argv)
118	{	118	{
119	int vfs_phone;	119	int vfs_phone;
120		120
121	printf("FAT: HelenOS FAT file system server.\n");	121	printf("FAT: HelenOS FAT file system server.\n");
122		122
123	vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0);	123	vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0);
124	while (vfs_phone < EOK) {	124	while (vfs_phone < EOK) {
125	usleep(10000);	125	usleep(10000);
126	vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0);	126	vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0);
127	}	127	}
128		128
129	int rc;	129	int rc;
130	rc = fs_register(vfs_phone, &fat_reg, &fat_vfs_info, fat_connection);	130	rc = fs_register(vfs_phone, &fat_reg, &fat_vfs_info, fat_connection);
131	if (rc != EOK) {	131	if (rc != EOK) {
132	printf("Failed to register the FAT file system (%d)\n", rc);	132	printf("Failed to register the FAT file system (%d)\n", rc);
133	return rc;	133	return rc;
134	}	134	}
135		135
136	dprintf("FAT filesystem registered, fs_handle=%d.\n",	136	dprintf("FAT filesystem registered, fs_handle=%d.\n",
137	fat_reg.fs_handle);	137	fat_reg.fs_handle);
138		138
139	async_manager();	139	async_manager();
140	/* not reached */	140	/* not reached */
141	return 0;	141	return 0;
142	}	142	}
143		143
144	/**	144	/**
145	* @}	145	* @}
146	*/	146	*/
147		147

Subversion Repositories HelenOS

(root)/branches/network/uspace/srv/fs/fat/fat.c @ 4718 – Rev 2644 → 2690