WebSVN – HelenOS – Diff – /branches/dynload/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_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_MOUNT)] = VFS_OP_NULL,
        [IPC_METHOD_TO_VFS_OP(VFS_MOUNTED)] = VFS_OP_DEFINED,
        [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_MOUNTED:
            fat_mounted(callid, &call);
            break;
        case VFS_MOUNT:
            fat_mount(callid, &call);
            break;
        case VFS_LOOKUP:
            fat_lookup(callid, &call);
            break;
        case VFS_READ:
            fat_read(callid, &call);
            break;
        case VFS_WRITE:
            fat_write(callid, &call);
            break;
        case VFS_TRUNCATE:
            fat_truncate(callid, &call);
            break;
        case VFS_DESTROY:
            fat_destroy(callid, &call);
            break;
        default:
            ipc_answer_0(callid, ENOTSUP);
            break;
        }
    }
}
 
int main(int argc, char **argv)
{
    int vfs_phone;
    int rc;
 
    printf("FAT: HelenOS FAT file system server.\n");
 
    rc = fat_idx_init();
    if (rc != EOK)
        goto err;
 
    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);
    }
   
    rc = fs_register(vfs_phone, &fat_reg, &fat_vfs_info, fat_connection);
    if (rc != EOK) {
        fat_idx_fini();
        goto err;
    }
   
    dprintf("FAT filesystem registered, fs_handle=%d.\n",
        fat_reg.fs_handle);
 
    async_manager();
    /* not reached */
    return 0;
 
err:
    printf("Failed to register the FAT file system (%d)\n", rc);
    return rc;
}
 
/**
 * @}
 */
 

Rev 3561	Rev 3674
1	/*	1	/*
2	* Copyright (c) 2006 Martin Decky	2	* Copyright (c) 2006 Martin Decky
3	* Copyright (c) 2008 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_LOOKUP)] = VFS_OP_DEFINED,	53	[IPC_METHOD_TO_VFS_OP(VFS_LOOKUP)] = VFS_OP_DEFINED,
54	[IPC_METHOD_TO_VFS_OP(VFS_READ)] = VFS_OP_DEFINED,	54	[IPC_METHOD_TO_VFS_OP(VFS_READ)] = VFS_OP_DEFINED,
55	[IPC_METHOD_TO_VFS_OP(VFS_WRITE)] = VFS_OP_NULL,	55	[IPC_METHOD_TO_VFS_OP(VFS_WRITE)] = VFS_OP_NULL,
56	[IPC_METHOD_TO_VFS_OP(VFS_TRUNCATE)] = VFS_OP_NULL,	56	[IPC_METHOD_TO_VFS_OP(VFS_TRUNCATE)] = VFS_OP_NULL,
57	[IPC_METHOD_TO_VFS_OP(VFS_MOUNT)] = VFS_OP_NULL,	57	[IPC_METHOD_TO_VFS_OP(VFS_MOUNT)] = VFS_OP_NULL,
58	[IPC_METHOD_TO_VFS_OP(VFS_MOUNTED)] = VFS_OP_DEFINED,	58	[IPC_METHOD_TO_VFS_OP(VFS_MOUNTED)] = VFS_OP_DEFINED,
59	[IPC_METHOD_TO_VFS_OP(VFS_UNMOUNT)] = VFS_OP_NULL,	59	[IPC_METHOD_TO_VFS_OP(VFS_UNMOUNT)] = VFS_OP_NULL,
60	}	60	}
61	};	61	};
62		62
63	fs_reg_t fat_reg;	63	fs_reg_t fat_reg;
64		64
65	/**	65	/**
66	* This connection fibril processes VFS requests from VFS.	66	* This connection fibril processes VFS requests from VFS.
67	*	67	*
68	* In order to support simultaneous VFS requests, our design is as follows.	68	* In order to support simultaneous VFS requests, our design is as follows.
69	* The connection fibril accepts VFS requests from VFS. If there is only one	69	* The connection fibril accepts VFS requests from VFS. If there is only one
70	* instance of the fibril, VFS will need to serialize all VFS requests it sends	70	* instance of the fibril, VFS will need to serialize all VFS requests it sends
71	* to FAT. To overcome this bottleneck, VFS can send FAT the IPC_M_CONNECT_ME_TO	71	* to FAT. To overcome this bottleneck, VFS can send FAT the IPC_M_CONNECT_ME_TO
72	* call. In that case, a new connection fibril will be created, which in turn	72	* call. In that case, a new connection fibril will be created, which in turn
73	* will accept the call. Thus, a new phone will be opened for VFS.	73	* will accept the call. Thus, a new phone will be opened for VFS.
74	*	74	*
75	* There are few issues with this arrangement. First, VFS can run out of	75	* There are few issues with this arrangement. First, VFS can run out of
76	* available phones. In that case, VFS can close some other phones or use one	76	* available phones. In that case, VFS can close some other phones or use one
77	* phone for more serialized requests. Similarily, FAT can refuse to duplicate	77	* phone for more serialized requests. Similarily, FAT can refuse to duplicate
78	* the connection. VFS should then just make use of already existing phones and	78	* the connection. VFS should then just make use of already existing phones and
79	* route its requests through them. To avoid paying the fibril creation price	79	* route its requests through them. To avoid paying the fibril creation price
80	* upon each request, FAT might want to keep the connections open after the	80	* upon each request, FAT might want to keep the connections open after the
81	* request has been completed.	81	* request has been completed.
82	*/	82	*/
83	static void fat_connection(ipc_callid_t iid, ipc_call_t *icall)	83	static void fat_connection(ipc_callid_t iid, ipc_call_t *icall)
84	{	84	{
85	if (iid) {	85	if (iid) {
86	/*	86	/*
87	* This only happens for connections opened by	87	* This only happens for connections opened by
88	* IPC_M_CONNECT_ME_TO calls as opposed to callback connections	88	* IPC_M_CONNECT_ME_TO calls as opposed to callback connections
89	* created by IPC_M_CONNECT_TO_ME.	89	* created by IPC_M_CONNECT_TO_ME.
90	*/	90	*/
91	ipc_answer_0(iid, EOK);	91	ipc_answer_0(iid, EOK);
92	}	92	}
93		93
94	dprintf("VFS-FAT connection established.\n");	94	dprintf("VFS-FAT connection established.\n");
95	while (1) {	95	while (1) {
96	ipc_callid_t callid;	96	ipc_callid_t callid;
97	ipc_call_t call;	97	ipc_call_t call;
98		98
99	callid = async_get_call(&call);	99	callid = async_get_call(&call);
100	switch (IPC_GET_METHOD(call)) {	100	switch (IPC_GET_METHOD(call)) {
101	case VFS_MOUNTED:	101	case VFS_MOUNTED:
102	fat_mounted(callid, &call);	102	fat_mounted(callid, &call);
103	break;	103	break;
104	case VFS_MOUNT:	104	case VFS_MOUNT:
105	fat_mount(callid, &call);	105	fat_mount(callid, &call);
106	break;	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	case VFS_READ:	110	case VFS_READ:
111	fat_read(callid, &call);	111	fat_read(callid, &call);
112	break;	112	break;
113	case VFS_WRITE:	113	case VFS_WRITE:
114	fat_write(callid, &call);	114	fat_write(callid, &call);
115	break;	115	break;
116	case VFS_TRUNCATE:	116	case VFS_TRUNCATE:
117	fat_truncate(callid, &call);	117	fat_truncate(callid, &call);
118	break;	118	break;
-		119	case VFS_DESTROY:
-		120	fat_destroy(callid, &call);
-		121	break;
119	default:	122	default:
120	ipc_answer_0(callid, ENOTSUP);	123	ipc_answer_0(callid, ENOTSUP);
121	break;	124	break;
122	}	125	}
123	}	126	}
124	}	127	}
125		128
126	int main(int argc, char **argv)	129	int main(int argc, char **argv)
127	{	130	{
128	int vfs_phone;	131	int vfs_phone;
129	int rc;	132	int rc;
130		133
131	printf("FAT: HelenOS FAT file system server.\n");	134	printf("FAT: HelenOS FAT file system server.\n");
132		135
133	rc = fat_idx_init();	136	rc = fat_idx_init();
134	if (rc != EOK)	137	if (rc != EOK)
135	goto err;	138	goto err;
136		139
137	vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0);	140	vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0);
138	while (vfs_phone < EOK) {	141	while (vfs_phone < EOK) {
139	usleep(10000);	142	usleep(10000);
140	vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0);	143	vfs_phone = ipc_connect_me_to(PHONE_NS, SERVICE_VFS, 0, 0);
141	}	144	}
142		145
143	rc = fs_register(vfs_phone, &fat_reg, &fat_vfs_info, fat_connection);	146	rc = fs_register(vfs_phone, &fat_reg, &fat_vfs_info, fat_connection);
144	if (rc != EOK) {	147	if (rc != EOK) {
145	fat_idx_fini();	148	fat_idx_fini();
146	goto err;	149	goto err;
147	}	150	}
148		151
149	dprintf("FAT filesystem registered, fs_handle=%d.\n",	152	dprintf("FAT filesystem registered, fs_handle=%d.\n",
150	fat_reg.fs_handle);	153	fat_reg.fs_handle);
151		154
152	async_manager();	155	async_manager();
153	/* not reached */	156	/* not reached */
154	return 0;	157	return 0;
155		158
156	err:	159	err:
157	printf("Failed to register the FAT file system (%d)\n", rc);	160	printf("Failed to register the FAT file system (%d)\n", rc);
158	return rc;	161	return rc;
159	}	162	}
160		163
161	/**	164	/**
162	* @}	165	* @}
163	*/	166	*/
164		167

Subversion Repositories HelenOS

(root)/branches/dynload/uspace/srv/fs/fat/fat.c – Rev 3561 → 3674