Subversion Repositories HelenOS

Rev

Rev 4055 | Rev 4439 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 4055 Rev 4420
1
/*
1
/*
2
 * Copyright (c) 2008 Jakub Jermar
2
 * Copyright (c) 2009 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
void fs_node_initialize(fs_node_t *fn)
-
 
126
{
-
 
127
    memset(fn, 0, sizeof(fs_node_t));
-
 
128
}
-
 
129
 
-
 
130
void libfs_mount(libfs_ops_t *ops, ipc_callid_t rid, ipc_call_t *request)
-
 
131
{
-
 
132
    dev_handle_t mp_dev_handle = (dev_handle_t) IPC_GET_ARG1(*request);
-
 
133
    fs_index_t mp_fs_index = (fs_index_t) IPC_GET_ARG2(*request);
-
 
134
    fs_handle_t mr_fs_handle = (fs_handle_t) IPC_GET_ARG3(*request);
-
 
135
    dev_handle_t mr_dev_handle = (dev_handle_t) IPC_GET_ARG4(*request);
-
 
136
    int res;
-
 
137
    ipcarg_t rc;
-
 
138
 
-
 
139
    ipc_call_t call;
-
 
140
    ipc_callid_t callid;
-
 
141
 
-
 
142
    /* accept the phone */
-
 
143
    callid = async_get_call(&call);
-
 
144
    int mountee_phone = (int)IPC_GET_ARG1(call);
-
 
145
    if ((IPC_GET_METHOD(call) != IPC_M_CONNECTION_CLONE) ||
-
 
146
        mountee_phone < 0) {
-
 
147
        ipc_answer_0(callid, EINVAL);
-
 
148
        ipc_answer_0(rid, EINVAL);
-
 
149
        return;
-
 
150
    }
-
 
151
    ipc_answer_0(callid, EOK);  /* acknowledge the mountee_phone */
-
 
152
   
-
 
153
    res = ipc_data_write_receive(&callid, NULL);
-
 
154
    if (!res) {
-
 
155
        ipc_hangup(mountee_phone);
-
 
156
        ipc_answer_0(callid, EINVAL);
-
 
157
        ipc_answer_0(rid, EINVAL);
-
 
158
        return;
-
 
159
    }
-
 
160
 
-
 
161
    fs_node_t *fn = ops->node_get(mp_dev_handle, mp_fs_index);
-
 
162
    if (!fn) {
-
 
163
        ipc_hangup(mountee_phone);
-
 
164
        ipc_answer_0(callid, ENOENT);
-
 
165
        ipc_answer_0(rid, ENOENT);
-
 
166
        return;
-
 
167
    }
-
 
168
 
-
 
169
    if (fn->mp_data.mp_active) {
-
 
170
        ipc_hangup(mountee_phone);
-
 
171
        ops->node_put(fn);
-
 
172
        ipc_answer_0(callid, EBUSY);
-
 
173
        ipc_answer_0(rid, EBUSY);
-
 
174
        return;
-
 
175
    }
-
 
176
 
-
 
177
    rc = async_req_0_0(mountee_phone, IPC_M_CONNECT_ME);
-
 
178
    if (rc != 0) {
-
 
179
        ipc_hangup(mountee_phone);
-
 
180
        ops->node_put(fn);
-
 
181
        ipc_answer_0(callid, rc);
-
 
182
        ipc_answer_0(rid, rc);
-
 
183
        return;
-
 
184
    }
-
 
185
   
-
 
186
    ipc_call_t answer;
-
 
187
    aid_t msg = async_send_1(mountee_phone, VFS_MOUNTED, mr_dev_handle,
-
 
188
        &answer);
-
 
189
    ipc_forward_fast(callid, mountee_phone, 0, 0, 0, IPC_FF_ROUTE_FROM_ME);
-
 
190
    async_wait_for(msg, &rc);
-
 
191
   
-
 
192
    if (rc == EOK) {
-
 
193
        fn->mp_data.mp_active = true;
-
 
194
        fn->mp_data.fs_handle = mr_fs_handle;
-
 
195
        fn->mp_data.dev_handle = mr_dev_handle;
-
 
196
        fn->mp_data.phone = mountee_phone;
-
 
197
    }
-
 
198
    /*
-
 
199
     * Do not release the FS node so that it stays in memory.
-
 
200
     */
-
 
201
    ipc_answer_0(rid, rc);
-
 
202
}
-
 
203
 
125
/** Lookup VFS triplet by name in the file system name space.
204
/** Lookup VFS triplet by name in the file system name space.
126
 *
205
 *
127
 * The path passed in the PLB must be in the canonical file system path format
206
 * The path passed in the PLB must be in the canonical file system path format
128
 * as returned by the canonify() function.
207
 * as returned by the canonify() function.
129
 *
208
 *
130
 * @param ops       libfs operations structure with function pointers to
209
 * @param ops       libfs operations structure with function pointers to
131
 *          file system implementation
210
 *          file system implementation
132
 * @param fs_handle File system handle of the file system where to perform
211
 * @param fs_handle File system handle of the file system where to perform
133
 *          the lookup.
212
 *          the lookup.
134
 * @param rid       Request ID of the VFS_LOOKUP request.
213
 * @param rid       Request ID of the VFS_LOOKUP request.
135
 * @param request   VFS_LOOKUP request data itself.
214
 * @param request   VFS_LOOKUP request data itself.
136
 */
215
 */
137
void libfs_lookup(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid,
216
void libfs_lookup(libfs_ops_t *ops, fs_handle_t fs_handle, ipc_callid_t rid,
138
    ipc_call_t *request)
217
    ipc_call_t *request)
139
{
218
{
140
    unsigned next = IPC_GET_ARG1(*request);
219
    unsigned first = IPC_GET_ARG1(*request);
141
    unsigned last = IPC_GET_ARG2(*request);
220
    unsigned last = IPC_GET_ARG2(*request);
-
 
221
    unsigned next = first;
142
    dev_handle_t dev_handle = IPC_GET_ARG3(*request);
222
    dev_handle_t dev_handle = IPC_GET_ARG3(*request);
143
    int lflag = IPC_GET_ARG4(*request);
223
    int lflag = IPC_GET_ARG4(*request);
144
    fs_index_t index = IPC_GET_ARG5(*request); /* when L_LINK specified */
224
    fs_index_t index = IPC_GET_ARG5(*request); /* when L_LINK specified */
145
    char component[NAME_MAX + 1];
225
    char component[NAME_MAX + 1];
146
    int len;
226
    int len;
147
 
227
 
148
    if (last < next)
228
    if (last < next)
149
        last += PLB_SIZE;
229
        last += PLB_SIZE;
150
 
230
 
151
    void *par = NULL;
231
    fs_node_t *par = NULL;
152
    void *cur = ops->root_get(dev_handle);
232
    fs_node_t *cur = ops->root_get(dev_handle);
153
    void *tmp = NULL;
233
    fs_node_t *tmp = NULL;
-
 
234
 
-
 
235
    if (cur->mp_data.mp_active) {
-
 
236
        ipc_forward_slow(rid, cur->mp_data.phone, VFS_LOOKUP,
-
 
237
            next, last, cur->mp_data.dev_handle, lflag, index,
-
 
238
            IPC_FF_ROUTE_FROM_ME);
-
 
239
        ops->node_put(cur);
-
 
240
        return;
-
 
241
    }
154
 
242
 
155
    if (ops->plb_get_char(next) == '/')
243
    if (ops->plb_get_char(next) == '/')
156
        next++;     /* eat slash */
244
        next++;     /* eat slash */
157
   
245
   
158
    while (next <= last && ops->has_children(cur)) {
246
    while (next <= last && ops->has_children(cur)) {
159
        /* collect the component */
247
        /* collect the component */
160
        len = 0;
248
        len = 0;
161
        while ((next <= last) &&  (ops->plb_get_char(next) != '/')) {
249
        while ((next <= last) &&  (ops->plb_get_char(next) != '/')) {
162
            if (len + 1 == NAME_MAX) {
250
            if (len + 1 == NAME_MAX) {
163
                /* component length overflow */
251
                /* component length overflow */
164
                ipc_answer_0(rid, ENAMETOOLONG);
252
                ipc_answer_0(rid, ENAMETOOLONG);
165
                goto out;
253
                goto out;
166
            }
254
            }
167
            component[len++] = ops->plb_get_char(next);
255
            component[len++] = ops->plb_get_char(next);
168
            next++; /* process next character */
256
            next++; /* process next character */
169
        }
257
        }
170
 
258
 
171
        assert(len);
259
        assert(len);
172
        component[len] = '\0';
260
        component[len] = '\0';
173
        next++;     /* eat slash */
261
        next++;     /* eat slash */
174
 
262
 
175
        /* match the component */
263
        /* match the component */
176
        tmp = ops->match(cur, component);
264
        tmp = ops->match(cur, component);
-
 
265
        if (tmp && tmp->mp_data.mp_active) {
-
 
266
            if (next > last)
-
 
267
                next = last = first;
-
 
268
            else
-
 
269
                next--;
-
 
270
               
-
 
271
            ipc_forward_slow(rid, tmp->mp_data.phone, VFS_LOOKUP,
-
 
272
                next, last, tmp->mp_data.dev_handle, lflag, index,
-
 
273
                IPC_FF_ROUTE_FROM_ME);
-
 
274
            ops->node_put(cur);
-
 
275
            ops->node_put(tmp);
-
 
276
            if (par)
-
 
277
                ops->node_put(par);
-
 
278
            return;
-
 
279
        }
177
 
280
 
178
        /* handle miss: match amongst siblings */
281
        /* handle miss: match amongst siblings */
179
        if (!tmp) {
282
        if (!tmp) {
180
            if (next <= last) {
283
            if (next <= last) {
181
                /* there are unprocessed components */
284
                /* there are unprocessed components */
182
                ipc_answer_0(rid, ENOENT);
285
                ipc_answer_0(rid, ENOENT);
183
                goto out;
286
                goto out;
184
            }
287
            }
185
            /* miss in the last component */
288
            /* miss in the last component */
186
            if (lflag & (L_CREATE | L_LINK)) {
289
            if (lflag & (L_CREATE | L_LINK)) {
187
                /* request to create a new link */
290
                /* request to create a new link */
188
                if (!ops->is_directory(cur)) {
291
                if (!ops->is_directory(cur)) {
189
                    ipc_answer_0(rid, ENOTDIR);
292
                    ipc_answer_0(rid, ENOTDIR);
190
                    goto out;
293
                    goto out;
191
                }
294
                }
192
                void *nodep;
295
                fs_node_t *fn;
193
                if (lflag & L_CREATE)
296
                if (lflag & L_CREATE)
194
                    nodep = ops->create(dev_handle, lflag);
297
                    fn = ops->create(dev_handle, lflag);
195
                else
298
                else
196
                    nodep = ops->node_get(dev_handle,
299
                    fn = ops->node_get(dev_handle,
197
                        index);
300
                        index);
198
                if (nodep) {
301
                if (fn) {
199
                    int rc;
302
                    int rc;
200
 
303
 
201
                    rc = ops->link(cur, nodep, component);
304
                    rc = ops->link(cur, fn, component);
202
                    if (rc != EOK) {
305
                    if (rc != EOK) {
203
                        if (lflag & L_CREATE) {
306
                        if (lflag & L_CREATE) {
204
                            (void)ops->destroy(
307
                            (void)ops->destroy(fn);
205
                                nodep);
-
 
206
                        }
308
                        }
207
                        ipc_answer_0(rid, rc);
309
                        ipc_answer_0(rid, rc);
208
                    } else {
310
                    } else {
209
                        ipc_answer_5(rid, EOK,
311
                        ipc_answer_5(rid, EOK,
210
                            fs_handle, dev_handle,
312
                            fs_handle, dev_handle,
211
                            ops->index_get(nodep),
313
                            ops->index_get(fn),
212
                            ops->size_get(nodep),
314
                            ops->size_get(fn),
213
                            ops->lnkcnt_get(nodep));
315
                            ops->lnkcnt_get(fn));
214
                        ops->node_put(nodep);
316
                        ops->node_put(fn);
215
                    }
317
                    }
216
                } else {
318
                } else {
217
                    ipc_answer_0(rid, ENOSPC);
319
                    ipc_answer_0(rid, ENOSPC);
218
                }
320
                }
219
                goto out;
321
                goto out;
220
            } else if (lflag & L_PARENT) {
-
 
221
                /* return parent */
-
 
222
                ipc_answer_5(rid, EOK, fs_handle, dev_handle,
-
 
223
                    ops->index_get(cur), ops->size_get(cur),
-
 
224
                    ops->lnkcnt_get(cur));
-
 
225
            }
322
            }
226
            ipc_answer_0(rid, ENOENT);
323
            ipc_answer_0(rid, ENOENT);
227
            goto out;
324
            goto out;
228
        }
325
        }
229
 
326
 
230
        if (par)
327
        if (par)
231
            ops->node_put(par);
328
            ops->node_put(par);
232
 
329
 
233
        /* descend one level */
330
        /* descend one level */
234
        par = cur;
331
        par = cur;
235
        cur = tmp;
332
        cur = tmp;
236
        tmp = NULL;
333
        tmp = NULL;
237
    }
334
    }
238
 
335
 
239
    /* handle miss: excessive components */
336
    /* handle miss: excessive components */
240
    if (next <= last && !ops->has_children(cur)) {
337
    if (next <= last && !ops->has_children(cur)) {
241
        if (lflag & (L_CREATE | L_LINK)) {
338
        if (lflag & (L_CREATE | L_LINK)) {
242
            if (!ops->is_directory(cur)) {
339
            if (!ops->is_directory(cur)) {
243
                ipc_answer_0(rid, ENOTDIR);
340
                ipc_answer_0(rid, ENOTDIR);
244
                goto out;
341
                goto out;
245
            }
342
            }
246
 
343
 
247
            /* collect next component */
344
            /* collect next component */
248
            len = 0;
345
            len = 0;
249
            while (next <= last) {
346
            while (next <= last) {
250
                if (ops->plb_get_char(next) == '/') {
347
                if (ops->plb_get_char(next) == '/') {
251
                    /* more than one component */
348
                    /* more than one component */
252
                    ipc_answer_0(rid, ENOENT);
349
                    ipc_answer_0(rid, ENOENT);
253
                    goto out;
350
                    goto out;
254
                }
351
                }
255
                if (len + 1 == NAME_MAX) {
352
                if (len + 1 == NAME_MAX) {
256
                    /* component length overflow */
353
                    /* component length overflow */
257
                    ipc_answer_0(rid, ENAMETOOLONG);
354
                    ipc_answer_0(rid, ENAMETOOLONG);
258
                    goto out;
355
                    goto out;
259
                }
356
                }
260
                component[len++] = ops->plb_get_char(next);
357
                component[len++] = ops->plb_get_char(next);
261
                next++; /* process next character */
358
                next++; /* process next character */
262
            }
359
            }
263
            assert(len);
360
            assert(len);
264
            component[len] = '\0';
361
            component[len] = '\0';
265
               
362
               
266
            void *nodep;
363
            fs_node_t *fn;
267
            if (lflag & L_CREATE)
364
            if (lflag & L_CREATE)
268
                nodep = ops->create(dev_handle, lflag);
365
                fn = ops->create(dev_handle, lflag);
269
            else
366
            else
270
                nodep = ops->node_get(dev_handle, index);
367
                fn = ops->node_get(dev_handle, index);
271
            if (nodep) {
368
            if (fn) {
272
                int rc;
369
                int rc;
273
 
370
 
274
                rc = ops->link(cur, nodep, component);
371
                rc = ops->link(cur, fn, component);
275
                if (rc != EOK) {
372
                if (rc != EOK) {
276
                    if (lflag & L_CREATE)
373
                    if (lflag & L_CREATE)
277
                        (void)ops->destroy(nodep);
374
                        (void)ops->destroy(fn);
278
                    ipc_answer_0(rid, rc);
375
                    ipc_answer_0(rid, rc);
279
                } else {
376
                } else {
280
                    ipc_answer_5(rid, EOK,
377
                    ipc_answer_5(rid, EOK,
281
                        fs_handle, dev_handle,
378
                        fs_handle, dev_handle,
282
                        ops->index_get(nodep),
379
                        ops->index_get(fn),
283
                        ops->size_get(nodep),
380
                        ops->size_get(fn),
284
                        ops->lnkcnt_get(nodep));
381
                        ops->lnkcnt_get(fn));
285
                    ops->node_put(nodep);
382
                    ops->node_put(fn);
286
                }
383
                }
287
            } else {
384
            } else {
288
                ipc_answer_0(rid, ENOSPC);
385
                ipc_answer_0(rid, ENOSPC);
289
            }
386
            }
290
            goto out;
387
            goto out;
291
        }
388
        }
292
        ipc_answer_0(rid, ENOENT);
389
        ipc_answer_0(rid, ENOENT);
293
        goto out;
390
        goto out;
294
    }
391
    }
295
 
392
 
296
    /* handle hit */
393
    /* handle hit */
297
    if (lflag & L_PARENT) {
-
 
298
        ops->node_put(cur);
-
 
299
        cur = par;
-
 
300
        par = NULL;
-
 
301
        if (!cur) {
-
 
302
            ipc_answer_0(rid, ENOENT);
-
 
303
            goto out;
-
 
304
        }
-
 
305
    }
-
 
306
    if (lflag & L_UNLINK) {
394
    if (lflag & L_UNLINK) {
307
        unsigned old_lnkcnt = ops->lnkcnt_get(cur);
395
        unsigned old_lnkcnt = ops->lnkcnt_get(cur);
308
        int res = ops->unlink(par, cur);
396
        int res = ops->unlink(par, cur, component);
309
        ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle,
397
        ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle,
310
            ops->index_get(cur), ops->size_get(cur), old_lnkcnt);
398
            ops->index_get(cur), ops->size_get(cur), old_lnkcnt);
311
        goto out;
399
        goto out;
312
    }
400
    }
313
    if (((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) ||
401
    if (((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) ||
314
        (lflag & L_LINK)) {
402
        (lflag & L_LINK)) {
315
        ipc_answer_0(rid, EEXIST);
403
        ipc_answer_0(rid, EEXIST);
316
        goto out;
404
        goto out;
317
    }
405
    }
318
    if ((lflag & L_FILE) && (ops->is_directory(cur))) {
406
    if ((lflag & L_FILE) && (ops->is_directory(cur))) {
319
        ipc_answer_0(rid, EISDIR);
407
        ipc_answer_0(rid, EISDIR);
320
        goto out;
408
        goto out;
321
    }
409
    }
322
    if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) {
410
    if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) {
323
        ipc_answer_0(rid, ENOTDIR);
411
        ipc_answer_0(rid, ENOTDIR);
324
        goto out;
412
        goto out;
325
    }
413
    }
326
 
414
 
327
    ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur),
415
    ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur),
328
        ops->size_get(cur), ops->lnkcnt_get(cur));
416
        ops->size_get(cur), ops->lnkcnt_get(cur));
329
 
417
 
330
out:
418
out:
331
    if (par)
419
    if (par)
332
        ops->node_put(par);
420
        ops->node_put(par);
333
    if (cur)
421
    if (cur)
334
        ops->node_put(cur);
422
        ops->node_put(cur);
335
    if (tmp)
423
    if (tmp)
336
        ops->node_put(tmp);
424
        ops->node_put(tmp);
337
}
425
}
338
 
426
 
339
/** @}
427
/** @}
340
 */
428
 */
341
 
429