WebSVN – HelenOS – Diff – /branches/dynload/uspace/lib/libfs/libfs.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 libfs
 * @{
 */
/**
 * @file
 * Glue code which is commonod to all FS implementations.
 */
 
#include "libfs.h" 
#include "../../srv/vfs/vfs.h"
#include <errno.h>
#include <async.h>
#include <ipc/ipc.h>
#include <as.h>
#include <assert.h>
#include <dirent.h>
 
/** Register file system server.
 *
 * This function abstracts away the tedious registration protocol from
 * file system implementations and lets them to reuse this registration glue
 * code.
 *
 * @param vfs_phone Open phone for communication with VFS.
 * @param reg       File system registration structure. It will be
 *          initialized by this function.
 * @param info      VFS info structure supplied by the file system
 *          implementation.
 * @param conn      Connection fibril for handling all calls originating in
 *          VFS.
 *
 * @return      EOK on success or a non-zero error code on errror.
 */
int fs_register(int vfs_phone, fs_reg_t *reg, vfs_info_t *info,
    async_client_conn_t conn)
{
    /*
     * Tell VFS that we are here and want to get registered.
     * We use the async framework because VFS will answer the request
     * out-of-order, when it knows that the operation succeeded or failed.
     */
    ipc_call_t answer;
    aid_t req = async_send_0(vfs_phone, VFS_REGISTER, &answer);
 
    /*
     * Send our VFS info structure to VFS.
     */
    int rc = ipc_data_write_start(vfs_phone, info, sizeof(*info));
    if (rc != EOK) {
        async_wait_for(req, NULL);
        return rc;
    }
 
    /*
     * Ask VFS for callback connection.
     */
    ipc_connect_to_me(vfs_phone, 0, 0, 0, &reg->vfs_phonehash);
 
    /*
     * Allocate piece of address space for PLB.
     */
    reg->plb_ro = as_get_mappable_page(PLB_SIZE);
    if (!reg->plb_ro) {
        async_wait_for(req, NULL);
        return ENOMEM;
    }
 
    /*
     * Request sharing the Path Lookup Buffer with VFS.
     */
    rc = ipc_share_in_start_0_0(vfs_phone, reg->plb_ro, PLB_SIZE);
    if (rc) {
        async_wait_for(req, NULL);
        return rc;
    }
     
    /*
     * Pick up the answer for the request to the VFS_REQUEST call.
     */
    async_wait_for(req, NULL);
    reg->fs_handle = (int) IPC_GET_ARG1(answer);
   
    /*
     * Create a connection fibril to handle the callback connection.
     */
    async_new_connection(reg->vfs_phonehash, 0, NULL, conn);
   
    /*
     * Tell the async framework that other connections are to be handled by
     * the same connection fibril as well.
     */
    async_set_client_connection(conn);
 
    return IPC_GET_RETVAL(answer);
}
 
/** Lookup VFS triplet by name in the file system name space.
 *
 * The path passed in the PLB must be in the canonical file system path format
 * as returned by the canonify() function.
 *
 * @param ops       libfs operations structure with function pointers to
 *          file system implementation
 * @param fs_handle File system handle of the file system where to perform
 *          the lookup.
 * @param rid       Request ID of the VFS_LOOKUP request.
 * @param request   VFS_LOOKUP request data itself.
 */
void libfs_lookup(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid,
    ipc_call_t *request)
{
    unsigned next = IPC_GET_ARG1(*request);
    unsigned last = IPC_GET_ARG2(*request);
    dev_handle_t dev_handle = IPC_GET_ARG3(*request);
    int lflag = IPC_GET_ARG4(*request);
    fs_index_t index = IPC_GET_ARG5(*request); /* when L_LINK specified */
    char component[NAME_MAX + 1];
    int len;
 
    if (last < next)
        last += PLB_SIZE;
 
    void *par = NULL;
    void *cur = ops->root_get(dev_handle);
    void *tmp = NULL;
 
    if (ops->plb_get_char(next) == '/')
        next++;     /* eat slash */
   
    while (next <= last && ops->has_children(cur)) {
        /* collect the component */
        len = 0;
        while ((next <= last) &&  (ops->plb_get_char(next) != '/')) {
            if (len + 1 == NAME_MAX) {
                /* component length overflow */
                ipc_answer_0(rid, ENAMETOOLONG);
                goto out;
            }
            component[len++] = ops->plb_get_char(next);
            next++; /* process next character */
        }
 
        assert(len);
        component[len] = '\0';
        next++;     /* eat slash */
 
        /* match the component */
        tmp = ops->match(cur, component);
 
        /* handle miss: match amongst siblings */
        if (!tmp) {
            if (next <= last) {
                /* there are unprocessed components */
                ipc_answer_0(rid, ENOENT);
                goto out;
            }
            /* miss in the last component */
            if (lflag & (L_CREATE | L_LINK)) {
                /* request to create a new link */
                if (!ops->is_directory(cur)) {
                    ipc_answer_0(rid, ENOTDIR);
                    goto out;
                }
                void *nodep;
                if (lflag & L_CREATE)
                    nodep = ops->create(dev_handle, lflag);
                else
                    nodep = ops->node_get(dev_handle,
                        index);
                if (nodep) {
                    int rc;
 
                    rc = ops->link(cur, nodep, component);
                    if (rc != EOK) {
                        if (lflag & L_CREATE) {
                            (void)ops->destroy(
                                nodep);
                        }
                        ipc_answer_0(rid, rc);
                    } else {
                        ipc_answer_5(rid, EOK,
                            fs_handle, dev_handle,
                            ops->index_get(nodep),
                            ops->size_get(nodep),
                            ops->lnkcnt_get(nodep));
                        ops->node_put(nodep);
                    }
                } else {
                    ipc_answer_0(rid, ENOSPC);
                }
                goto out;
            } else if (lflag & L_PARENT) {
                /* return parent */
                ipc_answer_5(rid, EOK, fs_handle, dev_handle,
                    ops->index_get(cur), ops->size_get(cur),
                    ops->lnkcnt_get(cur));
            }
            ipc_answer_0(rid, ENOENT);
            goto out;
        }
 
        if (par)
            ops->node_put(par);
 
        /* descend one level */
        par = cur;
        cur = tmp;
        tmp = NULL;
    }
 
    /* handle miss: excessive components */
    if (next <= last && !ops->has_children(cur)) {
        if (lflag & (L_CREATE | L_LINK)) {
            if (!ops->is_directory(cur)) {
                ipc_answer_0(rid, ENOTDIR);
                goto out;
            }
 
            /* collect next component */
            len = 0;
            while (next <= last) {
                if (ops->plb_get_char(next) == '/') {
                    /* more than one component */
                    ipc_answer_0(rid, ENOENT);
                    goto out;
                }
                if (len + 1 == NAME_MAX) {
                    /* component length overflow */
                    ipc_answer_0(rid, ENAMETOOLONG);
                    goto out;
                }
                component[len++] = ops->plb_get_char(next);
                next++; /* process next character */
            }
            assert(len);
            component[len] = '\0';
               
            void *nodep;
            if (lflag & L_CREATE)
                nodep = ops->create(dev_handle, lflag);
            else
                nodep = ops->node_get(dev_handle, index);
            if (nodep) {
                int rc;
 
                rc = ops->link(cur, nodep, component);
                if (rc != EOK) {
                    if (lflag & L_CREATE)
                        (void)ops->destroy(nodep);
                    ipc_answer_0(rid, rc);
                } else {
                    ipc_answer_5(rid, EOK,
                        fs_handle, dev_handle,
                        ops->index_get(nodep),
                        ops->size_get(nodep),
                        ops->lnkcnt_get(nodep));
                    ops->node_put(nodep);
                }
            } else {
                ipc_answer_0(rid, ENOSPC);
            }
            goto out;
        }
        ipc_answer_0(rid, ENOENT);
        goto out;
    }
 
    /* handle hit */
    if (lflag & L_PARENT) {
        ops->node_put(cur);
        cur = par;
        par = NULL;
        if (!cur) {
            ipc_answer_0(rid, ENOENT);
            goto out;
        }
    }
    if (lflag & L_UNLINK) {
        unsigned old_lnkcnt = ops->lnkcnt_get(cur);
        int res = ops->unlink(par, cur);
        ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle,
            ops->index_get(cur), ops->size_get(cur), old_lnkcnt);
        goto out;
    }
    if (((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) ||
        (lflag & L_LINK)) {
        ipc_answer_0(rid, EEXIST);
        goto out;
    }
    if ((lflag & L_FILE) && (ops->is_directory(cur))) {
        ipc_answer_0(rid, EISDIR);
        goto out;
    }
    if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) {
        ipc_answer_0(rid, ENOTDIR);
        goto out;
    }
 
    ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur),
        ops->size_get(cur), ops->lnkcnt_get(cur));
 
out:
    if (par)
        ops->node_put(par);
    if (cur)
        ops->node_put(cur);
    if (tmp)
        ops->node_put(tmp);
}
 
/** @}
 */
 

Rev 3588	Rev 3674
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 libfs	29	/** @addtogroup libfs
30	* @{	30	* @{
31	*/	31	*/
32	/**	32	/**
33	* @file	33	* @file
34	* Glue code which is commonod to all FS implementations.	34	* Glue code which is commonod to all FS implementations.
35	*/	35	*/
36		36
37	#include "libfs.h"	37	#include "libfs.h"
38	#include "../../srv/vfs/vfs.h"	38	#include "../../srv/vfs/vfs.h"
39	#include <errno.h>	39	#include <errno.h>
40	#include <async.h>	40	#include <async.h>
41	#include <ipc/ipc.h>	41	#include <ipc/ipc.h>
42	#include <as.h>	42	#include <as.h>
43	#include <assert.h>	43	#include <assert.h>
44	#include <dirent.h>	44	#include <dirent.h>
45		45
46	/** Register file system server.	46	/** Register file system server.
47	*	47	*
48	* This function abstracts away the tedious registration protocol from	48	* This function abstracts away the tedious registration protocol from
49	* file system implementations and lets them to reuse this registration glue	49	* file system implementations and lets them to reuse this registration glue
50	* code.	50	* code.
51	*	51	*
52	* @param vfs_phone Open phone for communication with VFS.	52	* @param vfs_phone Open phone for communication with VFS.
53	* @param reg File system registration structure. It will be	53	* @param reg File system registration structure. It will be
54	* initialized by this function.	54	* initialized by this function.
55	* @param info VFS info structure supplied by the file system	55	* @param info VFS info structure supplied by the file system
56	* implementation.	56	* implementation.
57	* @param conn Connection fibril for handling all calls originating in	57	* @param conn Connection fibril for handling all calls originating in
58	* VFS.	58	* VFS.
59	*	59	*
60	* @return EOK on success or a non-zero error code on errror.	60	* @return EOK on success or a non-zero error code on errror.
61	*/	61	*/
62	int fs_register(int vfs_phone, fs_reg_t reg, vfs_info_t info,	62	int fs_register(int vfs_phone, fs_reg_t reg, vfs_info_t info,
63	async_client_conn_t conn)	63	async_client_conn_t conn)
64	{	64	{
65	/*	65	/*
66	* Tell VFS that we are here and want to get registered.	66	* Tell VFS that we are here and want to get registered.
67	* We use the async framework because VFS will answer the request	67	* We use the async framework because VFS will answer the request
68	* out-of-order, when it knows that the operation succeeded or failed.	68	* out-of-order, when it knows that the operation succeeded or failed.
69	*/	69	*/
70	ipc_call_t answer;	70	ipc_call_t answer;
71	aid_t req = async_send_0(vfs_phone, VFS_REGISTER, &answer);	71	aid_t req = async_send_0(vfs_phone, VFS_REGISTER, &answer);
72		72
73	/*	73	/*
74	* Send our VFS info structure to VFS.	74	* Send our VFS info structure to VFS.
75	*/	75	*/
76	int rc = ipc_data_write_start(vfs_phone, info, sizeof(*info));	76	int rc = ipc_data_write_start(vfs_phone, info, sizeof(*info));
77	if (rc != EOK) {	77	if (rc != EOK) {
78	async_wait_for(req, NULL);	78	async_wait_for(req, NULL);
79	return rc;	79	return rc;
80	}	80	}
81		81
82	/*	82	/*
83	* Ask VFS for callback connection.	83	* Ask VFS for callback connection.
84	*/	84	*/
85	ipc_connect_to_me(vfs_phone, 0, 0, 0, &reg->vfs_phonehash);	85	ipc_connect_to_me(vfs_phone, 0, 0, 0, &reg->vfs_phonehash);
86		86
87	/*	87	/*
88	* Allocate piece of address space for PLB.	88	* Allocate piece of address space for PLB.
89	*/	89	*/
90	reg->plb_ro = as_get_mappable_page(PLB_SIZE);	90	reg->plb_ro = as_get_mappable_page(PLB_SIZE);
91	if (!reg->plb_ro) {	91	if (!reg->plb_ro) {
92	async_wait_for(req, NULL);	92	async_wait_for(req, NULL);
93	return ENOMEM;	93	return ENOMEM;
94	}	94	}
95		95
96	/*	96	/*
97	* Request sharing the Path Lookup Buffer with VFS.	97	* Request sharing the Path Lookup Buffer with VFS.
98	*/	98	*/
99	rc = ipc_share_in_start_0_0(vfs_phone, reg->plb_ro, PLB_SIZE);	99	rc = ipc_share_in_start_0_0(vfs_phone, reg->plb_ro, PLB_SIZE);
100	if (rc) {	100	if (rc) {
101	async_wait_for(req, NULL);	101	async_wait_for(req, NULL);
102	return rc;	102	return rc;
103	}	103	}
104		104
105	/*	105	/*
106	* Pick up the answer for the request to the VFS_REQUEST call.	106	* Pick up the answer for the request to the VFS_REQUEST call.
107	*/	107	*/
108	async_wait_for(req, NULL);	108	async_wait_for(req, NULL);
109	reg->fs_handle = (int) IPC_GET_ARG1(answer);	109	reg->fs_handle = (int) IPC_GET_ARG1(answer);
110		110
111	/*	111	/*
112	* Create a connection fibril to handle the callback connection.	112	* Create a connection fibril to handle the callback connection.
113	*/	113	*/
114	async_new_connection(reg->vfs_phonehash, 0, NULL, conn);	114	async_new_connection(reg->vfs_phonehash, 0, NULL, conn);
115		115
116	/*	116	/*
117	* Tell the async framework that other connections are to be handled by	117	* Tell the async framework that other connections are to be handled by
118	* the same connection fibril as well.	118	* the same connection fibril as well.
119	*/	119	*/
120	async_set_client_connection(conn);	120	async_set_client_connection(conn);
121		121
122	return IPC_GET_RETVAL(answer);	122	return IPC_GET_RETVAL(answer);
123	}	123	}
124		124
125	/** Lookup VFS triplet by name in the file system name space.	125	/** Lookup VFS triplet by name in the file system name space.
126	*	126	*
127	* The path passed in the PLB must be in the canonical file system path format	127	* The path passed in the PLB must be in the canonical file system path format
128	* as returned by the canonify() function.	128	* as returned by the canonify() function.
129	*	129	*
130	* @param ops libfs operations structure with function pointers to	130	* @param ops libfs operations structure with function pointers to
131	* file system implementation	131	* file system implementation
132	* @param fs_handle File system handle of the file system where to perform	132	* @param fs_handle File system handle of the file system where to perform
133	* the lookup.	133	* the lookup.
134	* @param rid Request ID of the VFS_LOOKUP request.	134	* @param rid Request ID of the VFS_LOOKUP request.
135	* @param request VFS_LOOKUP request data itself.	135	* @param request VFS_LOOKUP request data itself.
136	*/	136	*/
137	void libfs_lookup(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid,	137	void libfs_lookup(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid,
138	ipc_call_t *request)	138	ipc_call_t *request)
139	{	139	{
140	unsigned next = IPC_GET_ARG1(*request);	140	unsigned next = IPC_GET_ARG1(*request);
141	unsigned last = IPC_GET_ARG2(*request);	141	unsigned last = IPC_GET_ARG2(*request);
142	dev_handle_t dev_handle = IPC_GET_ARG3(*request);	142	dev_handle_t dev_handle = IPC_GET_ARG3(*request);
143	int lflag = IPC_GET_ARG4(*request);	143	int lflag = IPC_GET_ARG4(*request);
144	fs_index_t index = IPC_GET_ARG5(request); / when L_LINK specified */	144	fs_index_t index = IPC_GET_ARG5(request); / when L_LINK specified */
145	char component[NAME_MAX + 1];	145	char component[NAME_MAX + 1];
146	int len;	146	int len;
147		147
148	if (last < next)	148	if (last < next)
149	last += PLB_SIZE;	149	last += PLB_SIZE;
150		150
151	void *par = NULL;	151	void *par = NULL;
152	void *cur = ops->root_get(dev_handle);	152	void *cur = ops->root_get(dev_handle);
153	void *tmp = NULL;	153	void *tmp = NULL;
154		154
155	if (ops->plb_get_char(next) == '/')	155	if (ops->plb_get_char(next) == '/')
156	next++; /* eat slash */	156	next++; /* eat slash */
157		157
158	while (next <= last && ops->has_children(cur)) {	158	while (next <= last && ops->has_children(cur)) {
159	/* collect the component */	159	/* collect the component */
160	len = 0;	160	len = 0;
161	while ((next <= last) && (ops->plb_get_char(next) != '/')) {	161	while ((next <= last) && (ops->plb_get_char(next) != '/')) {
162	if (len + 1 == NAME_MAX) {	162	if (len + 1 == NAME_MAX) {
163	/* component length overflow */	163	/* component length overflow */
164	ipc_answer_0(rid, ENAMETOOLONG);	164	ipc_answer_0(rid, ENAMETOOLONG);
165	goto out;	165	goto out;
166	}	166	}
167	component[len++] = ops->plb_get_char(next);	167	component[len++] = ops->plb_get_char(next);
168	next++; /* process next character */	168	next++; /* process next character */
169	}	169	}
170		170
171	assert(len);	171	assert(len);
172	component[len] = '\0';	172	component[len] = '\0';
173	next++; /* eat slash */	173	next++; /* eat slash */
174		174
175	/* match the component */	175	/* match the component */
176	tmp = ops->match(cur, component);	176	tmp = ops->match(cur, component);
177		177
178	/* handle miss: match amongst siblings */	178	/* handle miss: match amongst siblings */
179	if (!tmp) {	179	if (!tmp) {
180	if (next <= last) {	180	if (next <= last) {
181	/* there are unprocessed components */	181	/* there are unprocessed components */
182	ipc_answer_0(rid, ENOENT);	182	ipc_answer_0(rid, ENOENT);
183	goto out;	183	goto out;
184	}	184	}
185	/* miss in the last component */	185	/* miss in the last component */
186	if (lflag & (L_CREATE \| L_LINK)) {	186	if (lflag & (L_CREATE \| L_LINK)) {
187	/* request to create a new link */	187	/* request to create a new link */
188	if (!ops->is_directory(cur)) {	188	if (!ops->is_directory(cur)) {
189	ipc_answer_0(rid, ENOTDIR);	189	ipc_answer_0(rid, ENOTDIR);
190	goto out;	190	goto out;
191	}	191	}
192	void *nodep;	192	void *nodep;
193	if (lflag & L_CREATE)	193	if (lflag & L_CREATE)
194	nodep = ops->create(dev_handle, lflag);	194	nodep = ops->create(dev_handle, lflag);
195	else	195	else
196	nodep = ops->node_get(dev_handle,	196	nodep = ops->node_get(dev_handle,
197	index);	197	index);
198	if (nodep) {	198	if (nodep) {
-		199	int rc;
-		200
199	if (!ops->link(cur, nodep, component)) {	201	rc = ops->link(cur, nodep, component);
-		202	if (rc != EOK) {
200	if (lflag & L_CREATE) {	203	if (lflag & L_CREATE) {
201	(void)ops->destroy(	204	(void)ops->destroy(
202	nodep);	205	nodep);
203	}	206	}
204	ipc_answer_0(rid, ENOSPC);	207	ipc_answer_0(rid, rc);
205	} else {	208	} else {
206	ipc_answer_5(rid, EOK,	209	ipc_answer_5(rid, EOK,
207	fs_handle, dev_handle,	210	fs_handle, dev_handle,
208	ops->index_get(nodep),	211	ops->index_get(nodep),
209	ops->size_get(nodep),	212	ops->size_get(nodep),
210	ops->lnkcnt_get(nodep));	213	ops->lnkcnt_get(nodep));
211	ops->node_put(nodep);	214	ops->node_put(nodep);
212	}	215	}
213	} else {	216	} else {
214	ipc_answer_0(rid, ENOSPC);	217	ipc_answer_0(rid, ENOSPC);
215	}	218	}
216	goto out;	219	goto out;
217	} else if (lflag & L_PARENT) {	220	} else if (lflag & L_PARENT) {
218	/* return parent */	221	/* return parent */
219	ipc_answer_5(rid, EOK, fs_handle, dev_handle,	222	ipc_answer_5(rid, EOK, fs_handle, dev_handle,
220	ops->index_get(cur), ops->size_get(cur),	223	ops->index_get(cur), ops->size_get(cur),
221	ops->lnkcnt_get(cur));	224	ops->lnkcnt_get(cur));
222	}	225	}
223	ipc_answer_0(rid, ENOENT);	226	ipc_answer_0(rid, ENOENT);
224	goto out;	227	goto out;
225	}	228	}
226		229
227	if (par)	230	if (par)
228	ops->node_put(par);	231	ops->node_put(par);
229		232
230	/* descend one level */	233	/* descend one level */
231	par = cur;	234	par = cur;
232	cur = tmp;	235	cur = tmp;
233	tmp = NULL;	236	tmp = NULL;
234	}	237	}
235		238
236	/* handle miss: excessive components */	239	/* handle miss: excessive components */
237	if (next <= last && !ops->has_children(cur)) {	240	if (next <= last && !ops->has_children(cur)) {
238	if (lflag & (L_CREATE \| L_LINK)) {	241	if (lflag & (L_CREATE \| L_LINK)) {
239	if (!ops->is_directory(cur)) {	242	if (!ops->is_directory(cur)) {
240	ipc_answer_0(rid, ENOTDIR);	243	ipc_answer_0(rid, ENOTDIR);
241	goto out;	244	goto out;
242	}	245	}
243		246
244	/* collect next component */	247	/* collect next component */
245	len = 0;	248	len = 0;
246	while (next <= last) {	249	while (next <= last) {
247	if (ops->plb_get_char(next) == '/') {	250	if (ops->plb_get_char(next) == '/') {
248	/* more than one component */	251	/* more than one component */
249	ipc_answer_0(rid, ENOENT);	252	ipc_answer_0(rid, ENOENT);
250	goto out;	253	goto out;
251	}	254	}
252	if (len + 1 == NAME_MAX) {	255	if (len + 1 == NAME_MAX) {
253	/* component length overflow */	256	/* component length overflow */
254	ipc_answer_0(rid, ENAMETOOLONG);	257	ipc_answer_0(rid, ENAMETOOLONG);
255	goto out;	258	goto out;
256	}	259	}
257	component[len++] = ops->plb_get_char(next);	260	component[len++] = ops->plb_get_char(next);
258	next++; /* process next character */	261	next++; /* process next character */
259	}	262	}
260	assert(len);	263	assert(len);
261	component[len] = '\0';	264	component[len] = '\0';
262		265
263	void *nodep;	266	void *nodep;
264	if (lflag & L_CREATE)	267	if (lflag & L_CREATE)
265	nodep = ops->create(dev_handle, lflag);	268	nodep = ops->create(dev_handle, lflag);
266	else	269	else
267	nodep = ops->node_get(dev_handle, index);	270	nodep = ops->node_get(dev_handle, index);
268	if (nodep) {	271	if (nodep) {
-		272	int rc;
-		273
269	if (!ops->link(cur, nodep, component)) {	274	rc = ops->link(cur, nodep, component);
-		275	if (rc != EOK) {
270	if (lflag & L_CREATE)	276	if (lflag & L_CREATE)
271	(void)ops->destroy(nodep);	277	(void)ops->destroy(nodep);
272	ipc_answer_0(rid, ENOSPC);	278	ipc_answer_0(rid, rc);
273	} else {	279	} else {
274	ipc_answer_5(rid, EOK,	280	ipc_answer_5(rid, EOK,
275	fs_handle, dev_handle,	281	fs_handle, dev_handle,
276	ops->index_get(nodep),	282	ops->index_get(nodep),
277	ops->size_get(nodep),	283	ops->size_get(nodep),
278	ops->lnkcnt_get(nodep));	284	ops->lnkcnt_get(nodep));
279	ops->node_put(nodep);	285	ops->node_put(nodep);
280	}	286	}
281	} else {	287	} else {
282	ipc_answer_0(rid, ENOSPC);	288	ipc_answer_0(rid, ENOSPC);
283	}	289	}
284	goto out;	290	goto out;
285	}	291	}
286	ipc_answer_0(rid, ENOENT);	292	ipc_answer_0(rid, ENOENT);
287	goto out;	293	goto out;
288	}	294	}
289		295
290	/* handle hit */	296	/* handle hit */
291	if (lflag & L_PARENT) {	297	if (lflag & L_PARENT) {
292	ops->node_put(cur);	298	ops->node_put(cur);
293	cur = par;	299	cur = par;
294	par = NULL;	300	par = NULL;
295	if (!cur) {	301	if (!cur) {
296	ipc_answer_0(rid, ENOENT);	302	ipc_answer_0(rid, ENOENT);
297	goto out;	303	goto out;
298	}	304	}
299	}	305	}
300	if (lflag & L_UNLINK) {	306	if (lflag & L_UNLINK) {
301	unsigned old_lnkcnt = ops->lnkcnt_get(cur);	307	unsigned old_lnkcnt = ops->lnkcnt_get(cur);
302	int res = ops->unlink(par, cur);	308	int res = ops->unlink(par, cur);
303	ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle,	309	ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle,
304	ops->index_get(cur), ops->size_get(cur), old_lnkcnt);	310	ops->index_get(cur), ops->size_get(cur), old_lnkcnt);
305	goto out;	311	goto out;
306	}	312	}
307	if (((lflag & (L_CREATE \| L_EXCLUSIVE)) == (L_CREATE \| L_EXCLUSIVE)) \|\|	313	if (((lflag & (L_CREATE \| L_EXCLUSIVE)) == (L_CREATE \| L_EXCLUSIVE)) \|\|
308	(lflag & L_LINK)) {	314	(lflag & L_LINK)) {
309	ipc_answer_0(rid, EEXIST);	315	ipc_answer_0(rid, EEXIST);
310	goto out;	316	goto out;
311	}	317	}
312	if ((lflag & L_FILE) && (ops->is_directory(cur))) {	318	if ((lflag & L_FILE) && (ops->is_directory(cur))) {
313	ipc_answer_0(rid, EISDIR);	319	ipc_answer_0(rid, EISDIR);
314	goto out;	320	goto out;
315	}	321	}
316	if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) {	322	if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) {
317	ipc_answer_0(rid, ENOTDIR);	323	ipc_answer_0(rid, ENOTDIR);
318	goto out;	324	goto out;
319	}	325	}
320		326
321	ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur),	327	ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur),
322	ops->size_get(cur), ops->lnkcnt_get(cur));	328	ops->size_get(cur), ops->lnkcnt_get(cur));
323		329
324	out:	330	out:
325	if (par)	331	if (par)
326	ops->node_put(par);	332	ops->node_put(par);
327	if (cur)	333	if (cur)
328	ops->node_put(cur);	334	ops->node_put(cur);
329	if (tmp)	335	if (tmp)
330	ops->node_put(tmp);	336	ops->node_put(tmp);
331	}	337	}
332		338
333	/** @}	339	/** @}
334	*/	340	*/
335		341

Subversion Repositories HelenOS

(root)/branches/dynload/uspace/lib/libfs/libfs.c – Rev 3588 → 3674