WebSVN – HelenOS – Diff – /trunk/uspace/srv/fs/tmpfs/tmpfs_ops.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    tmpfs_ops.c
 * @brief   Implementation of VFS operations for the TMPFS file system
 *      server.
 */
 
#include "tmpfs.h"
#include "../../vfs/vfs.h"
#include <ipc/ipc.h>
#include <async.h>
#include <errno.h>
#include <atomic.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <dirent.h>
#include <assert.h>
#include <sys/types.h>
#include <libadt/hash_table.h>
#include <as.h>
 
#define min(a, b)       ((a) < (b) ? (a) : (b))
#define max(a, b)       ((a) > (b) ? (a) : (b))
 
#define PLB_GET_CHAR(i)     (tmpfs_reg.plb_ro[(i) % PLB_SIZE])
 
#define DENTRIES_BUCKETS    256
 
#define TMPFS_GET_INDEX(x)  (((tmpfs_dentry_t *)(x))->index)
#define TMPFS_GET_LNKCNT(x) 1
 
/* Forward declarations of static functions. */
static void *create_node(int);
static bool link_node(void *, void *, const char *);
static int unlink_node(void *);
static void destroy_node(void *);
 
/** Hash table of all directory entries. */
 
hash_table_t dentries;
 
static hash_index_t dentries_hash(unsigned long *key)
{
    return *key % DENTRIES_BUCKETS;
}
 
static int dentries_compare(unsigned long *key, hash_count_t keys,
    link_t *item)
{
    tmpfs_dentry_t *dentry = hash_table_get_instance(item, tmpfs_dentry_t,
        dh_link);
    return dentry->index == *key;
}
 
static void dentries_remove_callback(link_t *item)
{
}
 
/** TMPFS dentries hash table operations. */
hash_table_operations_t dentries_ops = {
    .hash = dentries_hash,
    .compare = dentries_compare,
    .remove_callback = dentries_remove_callback
};
 
unsigned tmpfs_next_index = 1;
 
static void tmpfs_dentry_initialize(tmpfs_dentry_t *dentry)
{
    dentry->index = 0;
    dentry->parent = NULL;
    dentry->sibling = NULL;
    dentry->child = NULL;
    dentry->name = NULL;
    dentry->type = TMPFS_NONE;
    dentry->size = 0;
    dentry->data = NULL;
    link_initialize(&dentry->dh_link);
}
 
/*
 * For now, we don't distinguish between different dev_handles/instances. All
 * requests resolve to the only instance, rooted in the following variable.
 */
static tmpfs_dentry_t *root;
 
static bool tmpfs_init(void)
{
    if (!hash_table_create(&dentries, DENTRIES_BUCKETS, 1, &dentries_ops))
        return false;
 
    root = (tmpfs_dentry_t *) create_node(L_DIRECTORY);
 
 
 
 
 
 
 
 
    return root != NULL;
}
 
/** Compare one component of path to a directory entry.
 *
 * @param nodep     Node to compare the path component with.
 * @param component Array of characters holding component name.
 *
 * @return      True on match, false otherwise.
 */
static bool match_component(void *nodep, const char *component)
{
    tmpfs_dentry_t *dentry = (tmpfs_dentry_t *) nodep;
 
    return !strcmp(dentry->name, component);
}
 
void *create_node(int lflag)
 
{
 
 
 
    assert((lflag & L_FILE) ^ (lflag & L_DIRECTORY));
 
    tmpfs_dentry_t *node = malloc(sizeof(tmpfs_dentry_t));
    if (!node)
        return NULL;
 
 
 
 
 
 
 
 
    tmpfs_dentry_initialize(node);
    node->index = tmpfs_next_index++;
 
 
    if (lflag & L_DIRECTORY)
        node->type = TMPFS_DIRECTORY;
    else
        node->type = TMPFS_FILE;
 
    /* Insert the new node into the dentry hash table. */
    hash_table_insert(&dentries, &node->index, &node->dh_link);
    return (void *) node;
}
 
bool link_node(void *prnt, void *chld, const char *nm)
{
    tmpfs_dentry_t *parentp = (tmpfs_dentry_t *) prnt;
    tmpfs_dentry_t *childp = (tmpfs_dentry_t *) chld;
 
    assert(parentp->type == TMPFS_DIRECTORY);
 
    size_t len = strlen(nm);
    char *name = malloc(len + 1);
    if (!name)
        return false;
    strcpy(name, nm);
    childp->name = name;
 
    /* Insert the new node into the namespace. */
    if (parentp->child) {
        tmpfs_dentry_t *tmp = parentp->child;
        while (tmp->sibling)
            tmp = tmp->sibling;
        tmp->sibling = childp;
    } else {
        parentp->child = childp;
    }
    childp->parent = parentp;
 
 
 
    return true;
}
 
int unlink_node(void *nodeptr)
{
    tmpfs_dentry_t *dentry = (tmpfs_dentry_t *)nodeptr;
 
    if (dentry->child)
        return ENOTEMPTY;
 
    if (!dentry->parent)
        return EBUSY;
 
    if (dentry->parent->child == dentry) {
        dentry->parent->child = dentry->sibling;
    } else {
        /* TODO: consider doubly linked list for organizing siblings. */
        tmpfs_dentry_t *tmp = dentry->parent->child;
        while (tmp->sibling != dentry)
            tmp = tmp->sibling;
        tmp->sibling = dentry->sibling;
    }
    dentry->sibling = NULL;
    dentry->parent = NULL;
 
    free(dentry->name);
    dentry->name = NULL;
 
    return EOK;
}
 
void destroy_node(void *nodep)
{
    tmpfs_dentry_t *dentry = (tmpfs_dentry_t *) nodep;
   
    assert(!dentry->child);
    assert(!dentry->sibling);
 
    unsigned long index = dentry->index;
    hash_table_remove(&dentries, &index, 1);
 
    if (dentry->type == TMPFS_FILE)
        free(dentry->data);
    free(dentry);
}
 
void tmpfs_lookup(ipc_callid_t rid, ipc_call_t *request)
{
    unsigned next = IPC_GET_ARG1(*request);
    unsigned last = IPC_GET_ARG2(*request);
    int dev_handle = IPC_GET_ARG3(*request);
    int lflag = IPC_GET_ARG4(*request);
 
    if (last < next)
        last += PLB_SIZE;
 
    /*
     * Initialize TMPFS.
     */
    if (!root && !tmpfs_init()) {
        ipc_answer_0(rid, ENOMEM);
        return;
    }
 
    tmpfs_dentry_t *dtmp = root->child;
    tmpfs_dentry_t *dcur = root;
 
    if (PLB_GET_CHAR(next) == '/')
        next++;     /* eat slash */
   
    char component[NAME_MAX + 1];
    int len = 0;
    while (dtmp && next <= last) {
 
        /* collect the component */
        if (PLB_GET_CHAR(next) != '/') {
            if (len + 1 == NAME_MAX) {
                /* comopnent length overflow */
                ipc_answer_0(rid, ENAMETOOLONG);
                return;
            }
            component[len++] = PLB_GET_CHAR(next);
            next++; /* process next character */
            if (next <= last)
                continue;
        }
 
        assert(len);
        component[len] = '\0';
        next++;     /* eat slash */
        len = 0;
 
        /* match the component */
        while (dtmp && !match_component(dtmp, component))
            dtmp = dtmp->sibling;
 
        /* handle miss: match amongst siblings */
        if (!dtmp) {
            if ((next > last) && (lflag & L_CREATE)) {
                /* no components left and L_CREATE specified */
                if (dcur->type != TMPFS_DIRECTORY) {
                    ipc_answer_0(rid, ENOTDIR);
                    return;
                }
                void *nodep = create_node(lflag);
 
                if (nodep) {
                    if (!link_node(dcur, nodep,
                        component)) {
                        destroy_node(nodep);
                        ipc_answer_0(rid, ENOSPC);
                    } else {
                        ipc_answer_5(rid, EOK,
                            tmpfs_reg.fs_handle,
                            dev_handle,
                            TMPFS_GET_INDEX(nodep), 0,
                            TMPFS_GET_LNKCNT(nodep));
                    }
                } else {
                    ipc_answer_0(rid, ENOSPC);
                }
                return;
            }
            ipc_answer_0(rid, ENOENT);
            return;
        }
 
        /* descend one level */
        dcur = dtmp;
        dtmp = dtmp->child;
    }
 
    /* handle miss: excessive components */
    if (!dtmp && next <= last) {
        if (lflag & L_CREATE) {
            if (dcur->type != TMPFS_DIRECTORY) {
                ipc_answer_0(rid, ENOTDIR);
                return;
            }
 
            /* collect next component */
            while (next <= last) {
                if (PLB_GET_CHAR(next) == '/') {
                    /* more than one component */
                    ipc_answer_0(rid, ENOENT);
                    return;
                }
                if (len + 1 == NAME_MAX) {
                    /* component length overflow */
                    ipc_answer_0(rid, ENAMETOOLONG);
                    return;
                }
                component[len++] = PLB_GET_CHAR(next);
                next++; /* process next character */
            }
            assert(len);
            component[len] = '\0';
            len = 0;
               
            void *nodep = create_node(lflag);
            if (nodep) {
                if (!link_node(dcur, nodep, component)) {
                    destroy_node(nodep);
                    ipc_answer_0(rid, ENOSPC);
                } else {
                    ipc_answer_5(rid, EOK,
                        tmpfs_reg.fs_handle,
                        dev_handle, TMPFS_GET_INDEX(nodep),
                        0, TMPFS_GET_LNKCNT(nodep));
                }
            } else {
                ipc_answer_0(rid, ENOSPC);
            }
            return;
        }
        ipc_answer_0(rid, ENOENT);
        return;
    }
 
    /* handle hit */
    if (lflag & L_DESTROY) {
        unsigned old_lnkcnt = TMPFS_GET_LNKCNT(dcur);
        int res = unlink_node(dcur);
        ipc_answer_5(rid, (ipcarg_t)res, tmpfs_reg.fs_handle,
            dev_handle, dcur->index, dcur->size, old_lnkcnt);
        return;
    }
    if ((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) {
        ipc_answer_0(rid, EEXIST);
        return;
    }
    if ((lflag & L_FILE) && (dcur->type != TMPFS_FILE)) {
        ipc_answer_0(rid, EISDIR);
        return;
    }
    if ((lflag & L_DIRECTORY) && (dcur->type != TMPFS_DIRECTORY)) {
        ipc_answer_0(rid, ENOTDIR);
        return;
    }
 
    ipc_answer_5(rid, EOK, tmpfs_reg.fs_handle, dev_handle, dcur->index,
        dcur->size, TMPFS_GET_LNKCNT(dcur));
}
 
void tmpfs_read(ipc_callid_t rid, ipc_call_t *request)
{
    int dev_handle = IPC_GET_ARG1(*request);
    unsigned long index = IPC_GET_ARG2(*request);
    off_t pos = IPC_GET_ARG3(*request);
 
    /*
     * Lookup the respective dentry.
     */
    link_t *hlp;
    hlp = hash_table_find(&dentries, &index);
    if (!hlp) {
        ipc_answer_0(rid, ENOENT);
        return;
    }
    tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t,
        dh_link);
 
    /*
     * Receive the read request.
     */
    ipc_callid_t callid;
    size_t len;
    if (!ipc_data_read_receive(&callid, &len)) {
        ipc_answer_0(callid, EINVAL);  
        ipc_answer_0(rid, EINVAL);
        return;
    }
 
    size_t bytes;
    if (dentry->type == TMPFS_FILE) {
        bytes = max(0, min(dentry->size - pos, len));
        (void) ipc_data_read_finalize(callid, dentry->data + pos,
            bytes);
    } else {
        int i;
        tmpfs_dentry_t *cur;
       
        assert(dentry->type == TMPFS_DIRECTORY);
       
        /*
         * Yes, we really use O(n) algorithm here.
         * If it bothers someone, it could be fixed by introducing a
         * hash table.
         */
        for (i = 0, cur = dentry->child; i < pos && cur; i++,
            cur = cur->sibling)
            ;
 
        if (!cur) {
            ipc_answer_0(callid, ENOENT);
            ipc_answer_1(rid, ENOENT, 0);
            return;
        }
 
        (void) ipc_data_read_finalize(callid, cur->name,
            strlen(cur->name) + 1);
        bytes = 1;
    }
 
    /*
     * Answer the VFS_READ call.
     */
    ipc_answer_1(rid, EOK, bytes);
}
 
void tmpfs_write(ipc_callid_t rid, ipc_call_t *request)
{
    int dev_handle = IPC_GET_ARG1(*request);
    unsigned long index = IPC_GET_ARG2(*request);
    off_t pos = IPC_GET_ARG3(*request);
 
    /*
     * Lookup the respective dentry.
     */
    link_t *hlp;
    hlp = hash_table_find(&dentries, &index);
    if (!hlp) {
        ipc_answer_0(rid, ENOENT);
        return;
    }
    tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t,
        dh_link);
 
    /*
     * Receive the write request.
     */
    ipc_callid_t callid;
    size_t len;
    if (!ipc_data_write_receive(&callid, &len)) {
        ipc_answer_0(callid, EINVAL);  
        ipc_answer_0(rid, EINVAL);
        return;
    }
 
    /*
     * Check whether the file needs to grow.
     */
    if (pos + len <= dentry->size) {
        /* The file size is not changing. */
        (void) ipc_data_write_finalize(callid, dentry->data + pos, len);
        ipc_answer_2(rid, EOK, len, dentry->size);
        return;
    }
    size_t delta = (pos + len) - dentry->size;
    /*
     * At this point, we are deliberately extremely straightforward and
     * simply realloc the contents of the file on every write that grows the
     * file. In the end, the situation might not be as bad as it may look:
     * our heap allocator can save us and just grow the block whenever
     * possible.
     */
    void *newdata = realloc(dentry->data, dentry->size + delta);
    if (!newdata) {
        ipc_answer_0(callid, ENOMEM);
        ipc_answer_2(rid, EOK, 0, dentry->size);
        return;
    }
    /* Clear any newly allocated memory in order to emulate gaps. */
    memset(newdata + dentry->size, 0, delta);
    dentry->size += delta;
    dentry->data = newdata;
    (void) ipc_data_write_finalize(callid, dentry->data + pos, len);
    ipc_answer_2(rid, EOK, len, dentry->size);
}
 
void tmpfs_truncate(ipc_callid_t rid, ipc_call_t *request)
{
    int dev_handle = IPC_GET_ARG1(*request);
    unsigned long index = IPC_GET_ARG2(*request);
    size_t size = IPC_GET_ARG3(*request);
 
    /*
     * Lookup the respective dentry.
     */
    link_t *hlp;
    hlp = hash_table_find(&dentries, &index);
    if (!hlp) {
        ipc_answer_0(rid, ENOENT);
        return;
    }
    tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t,
        dh_link);
 
    if (size == dentry->size) {
        ipc_answer_0(rid, EOK);
        return;
    }
 
    void *newdata = realloc(dentry->data, size);
    if (!newdata) {
        ipc_answer_0(rid, ENOMEM);
        return;
    }
    if (size > dentry->size) {
        size_t delta = size - dentry->size;
        memset(newdata + dentry->size, 0, delta);
    }
    dentry->size = size;
    dentry->data = newdata;
    ipc_answer_0(rid, EOK);
}
 
void tmpfs_destroy(ipc_callid_t rid, ipc_call_t *request)
{
    int dev_handle = IPC_GET_ARG1(*request);
    unsigned long index = IPC_GET_ARG2(*request);
 
    link_t *hlp;
    hlp = hash_table_find(&dentries, &index);
    if (!hlp) {
        ipc_answer_0(rid, ENOENT);
        return;
    }
    tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t,
        dh_link);
 
 
 
 
 
 
 
 
 
 
    destroy_node(dentry);
 
    ipc_answer_0(rid, EOK);
}
 
/**
 * @}
 */
 

Rev 2739	Rev 2742
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 tmpfs_ops.c	34	* @file tmpfs_ops.c
35	* @brief Implementation of VFS operations for the TMPFS file system	35	* @brief Implementation of VFS operations for the TMPFS file system
36	* server.	36	* server.
37	*/	37	*/
38		38
39	#include "tmpfs.h"	39	#include "tmpfs.h"
40	#include "../../vfs/vfs.h"	40	#include "../../vfs/vfs.h"
41	#include <ipc/ipc.h>	41	#include <ipc/ipc.h>
42	#include <async.h>	42	#include <async.h>
43	#include <errno.h>	43	#include <errno.h>
44	#include <atomic.h>	44	#include <atomic.h>
45	#include <stdlib.h>	45	#include <stdlib.h>
46	#include <string.h>	46	#include <string.h>
47	#include <stdio.h>	47	#include <stdio.h>
48	#include <dirent.h>	48	#include <dirent.h>
49	#include <assert.h>	49	#include <assert.h>
50	#include <sys/types.h>	50	#include <sys/types.h>
51	#include <libadt/hash_table.h>	51	#include <libadt/hash_table.h>
52	#include <as.h>	52	#include <as.h>
53		53
54	#define min(a, b) ((a) < (b) ? (a) : (b))	54	#define min(a, b) ((a) < (b) ? (a) : (b))
55	#define max(a, b) ((a) > (b) ? (a) : (b))	55	#define max(a, b) ((a) > (b) ? (a) : (b))
56		56
57	#define PLB_GET_CHAR(i) (tmpfs_reg.plb_ro[(i) % PLB_SIZE])	57	#define PLB_GET_CHAR(i) (tmpfs_reg.plb_ro[(i) % PLB_SIZE])
58		58
59	#define DENTRIES_BUCKETS 256	59	#define DENTRIES_BUCKETS 256
60		60
61	#define TMPFS_GET_INDEX(x) (((tmpfs_dentry_t *)(x))->index)	61	#define TMPFS_GET_INDEX(x) (((tmpfs_dentry_t *)(x))->index)
62	#define TMPFS_GET_LNKCNT(x) 1	62	#define TMPFS_GET_LNKCNT(x) 1
63		63
-		64	/* Forward declarations of static functions. */
-		65	static void *create_node(int);
-		66	static bool link_node(void , void , const char *);
-		67	static int unlink_node(void *);
-		68	static void destroy_node(void *);
64	/*	69
65	* Hash table of all directory entries.	70	/** Hash table of all directory entries. */
66	*/	-
67	hash_table_t dentries;	71	hash_table_t dentries;
68		72
69	static hash_index_t dentries_hash(unsigned long *key)	73	static hash_index_t dentries_hash(unsigned long *key)
70	{	74	{
71	return *key % DENTRIES_BUCKETS;	75	return *key % DENTRIES_BUCKETS;
72	}	76	}
73		77
74	static int dentries_compare(unsigned long *key, hash_count_t keys,	78	static int dentries_compare(unsigned long *key, hash_count_t keys,
75	link_t *item)	79	link_t *item)
76	{	80	{
77	tmpfs_dentry_t *dentry = hash_table_get_instance(item, tmpfs_dentry_t,	81	tmpfs_dentry_t *dentry = hash_table_get_instance(item, tmpfs_dentry_t,
78	dh_link);	82	dh_link);
79	return dentry->index == *key;	83	return dentry->index == *key;
80	}	84	}
81		85
82	static void dentries_remove_callback(link_t *item)	86	static void dentries_remove_callback(link_t *item)
83	{	87	{
84	}	88	}
85		89
86	/** TMPFS dentries hash table operations. */	90	/** TMPFS dentries hash table operations. */
87	hash_table_operations_t dentries_ops = {	91	hash_table_operations_t dentries_ops = {
88	.hash = dentries_hash,	92	.hash = dentries_hash,
89	.compare = dentries_compare,	93	.compare = dentries_compare,
90	.remove_callback = dentries_remove_callback	94	.remove_callback = dentries_remove_callback
91	};	95	};
92		96
93	unsigned tmpfs_next_index = 1;	97	unsigned tmpfs_next_index = 1;
94		98
95	static void tmpfs_dentry_initialize(tmpfs_dentry_t *dentry)	99	static void tmpfs_dentry_initialize(tmpfs_dentry_t *dentry)
96	{	100	{
97	dentry->index = 0;	101	dentry->index = 0;
98	dentry->parent = NULL;	102	dentry->parent = NULL;
99	dentry->sibling = NULL;	103	dentry->sibling = NULL;
100	dentry->child = NULL;	104	dentry->child = NULL;
101	dentry->name = NULL;	105	dentry->name = NULL;
102	dentry->type = TMPFS_NONE;	106	dentry->type = TMPFS_NONE;
103	dentry->size = 0;	107	dentry->size = 0;
104	dentry->data = NULL;	108	dentry->data = NULL;
105	link_initialize(&dentry->dh_link);	109	link_initialize(&dentry->dh_link);
106	}	110	}
107		111
108	/*	112	/*
109	* For now, we don't distinguish between different dev_handles/instances. All	113	* For now, we don't distinguish between different dev_handles/instances. All
110	* requests resolve to the only instance, rooted in the following variable.	114	* requests resolve to the only instance, rooted in the following variable.
111	*/	115	*/
112	static tmpfs_dentry_t *root;	116	static tmpfs_dentry_t *root;
113		117
114	static bool tmpfs_init(void)	118	static bool tmpfs_init(void)
115	{	119	{
116	if (!hash_table_create(&dentries, DENTRIES_BUCKETS, 1, &dentries_ops))	120	if (!hash_table_create(&dentries, DENTRIES_BUCKETS, 1, &dentries_ops))
117	return false;	121	return false;
118		-
119	root = (tmpfs_dentry_t *) malloc(sizeof(tmpfs_dentry_t));	122	root = (tmpfs_dentry_t *) create_node(L_DIRECTORY);
120	if (!root)	-
121	return false;	-
122	tmpfs_dentry_initialize(root);	-
123	root->index = tmpfs_next_index++;	-
124	root->name = "";	-
125	root->type = TMPFS_DIRECTORY;	-
126	hash_table_insert(&dentries, &root->index, &root->dh_link);	-
127		-
128	return true;	123	return root != NULL;
129	}	124	}
130		125
131	/** Compare one component of path to a directory entry.	126	/** Compare one component of path to a directory entry.
132	*	127	*
133	* @param nodep Node to compare the path component with.	128	* @param nodep Node to compare the path component with.
134	* @param component Array of characters holding component name.	129	* @param component Array of characters holding component name.
135	*	130	*
136	* @return True on match, false otherwise.	131	* @return True on match, false otherwise.
137	*/	132	*/
138	static bool match_component(void nodep, const char component)	133	static bool match_component(void nodep, const char component)
139	{	134	{
140	tmpfs_dentry_t dentry = (tmpfs_dentry_t ) nodep;	135	tmpfs_dentry_t dentry = (tmpfs_dentry_t ) nodep;
141		136
142	return !strcmp(dentry->name, component);	137	return !strcmp(dentry->name, component);
143	}	138	}
144		139
145	static void create_node(void nodep,	140	void *create_node(int lflag)
146	const char *component, int lflag)	-
147	{	141	{
148	tmpfs_dentry_t dentry = (tmpfs_dentry_t ) nodep;	-
149		-
150	assert(dentry->type == TMPFS_DIRECTORY);	-
151	assert((lflag & L_FILE) ^ (lflag & L_DIRECTORY));	142	assert((lflag & L_FILE) ^ (lflag & L_DIRECTORY));
152		143
153	tmpfs_dentry_t *node = malloc(sizeof(tmpfs_dentry_t));	144	tmpfs_dentry_t *node = malloc(sizeof(tmpfs_dentry_t));
154	if (!node)	145	if (!node)
155	return NULL;	146	return NULL;
156	size_t len = strlen(component);	-
157	char *name = malloc(len + 1);	-
158	if (!name) {	-
159	free(node);	-
160	return NULL;	-
161	}	-
162	strcpy(name, component);	-
163		147
164	tmpfs_dentry_initialize(node);	148	tmpfs_dentry_initialize(node);
165	node->index = tmpfs_next_index++;	149	node->index = tmpfs_next_index++;
166	node->name = name;	-
167	node->parent = dentry;	-
168	if (lflag & L_DIRECTORY)	150	if (lflag & L_DIRECTORY)
169	node->type = TMPFS_DIRECTORY;	151	node->type = TMPFS_DIRECTORY;
170	else	152	else
171	node->type = TMPFS_FILE;	153	node->type = TMPFS_FILE;
172		154
-		155	/* Insert the new node into the dentry hash table. */
-		156	hash_table_insert(&dentries, &node->index, &node->dh_link);
-		157	return (void *) node;
-		158	}
-		159
-		160	bool link_node(void prnt, void chld, const char *nm)
-		161	{
-		162	tmpfs_dentry_t parentp = (tmpfs_dentry_t ) prnt;
-		163	tmpfs_dentry_t childp = (tmpfs_dentry_t ) chld;
-		164
-		165	assert(parentp->type == TMPFS_DIRECTORY);
-		166
-		167	size_t len = strlen(nm);
-		168	char *name = malloc(len + 1);
-		169	if (!name)
-		170	return false;
-		171	strcpy(name, nm);
-		172	childp->name = name;
-		173
173	/* Insert the new node into the namespace. */	174	/* Insert the new node into the namespace. */
174	if (dentry->child) {	175	if (parentp->child) {
175	tmpfs_dentry_t *tmp = dentry->child;	176	tmpfs_dentry_t *tmp = parentp->child;
176	while (tmp->sibling)	177	while (tmp->sibling)
177	tmp = tmp->sibling;	178	tmp = tmp->sibling;
178	tmp->sibling = node;	179	tmp->sibling = childp;
179	} else {	180	} else {
180	dentry->child = node;	181	parentp->child = childp;
181	}	182	}
-		183	childp->parent = parentp;
182		184
183	/* Insert the new node into the dentry hash table. */	-
184	hash_table_insert(&dentries, &node->index, &node->dh_link);	-
185	return (void *) node;	185	return true;
186	}	186	}
187		187
188	static int destroy_component(void *nodeptr)	188	int unlink_node(void *nodeptr)
189	{	189	{
190	tmpfs_dentry_t dentry = (tmpfs_dentry_t )nodeptr;	190	tmpfs_dentry_t dentry = (tmpfs_dentry_t )nodeptr;
191		191
192	if (dentry->child)	192	if (dentry->child)
193	return ENOTEMPTY;	193	return ENOTEMPTY;
194		194
195	if (!dentry->parent)	195	if (!dentry->parent)
196	return EBUSY;	196	return EBUSY;
197		197
198	if (dentry->parent->child == dentry) {	198	if (dentry->parent->child == dentry) {
199	dentry->parent->child = dentry->sibling;	199	dentry->parent->child = dentry->sibling;
200	} else {	200	} else {
201	/* TODO: consider doubly linked list for organizing siblings. */	201	/* TODO: consider doubly linked list for organizing siblings. */
202	tmpfs_dentry_t *tmp = dentry->parent->child;	202	tmpfs_dentry_t *tmp = dentry->parent->child;
203	while (tmp->sibling != dentry)	203	while (tmp->sibling != dentry)
204	tmp = tmp->sibling;	204	tmp = tmp->sibling;
205	tmp->sibling = dentry->sibling;	205	tmp->sibling = dentry->sibling;
206	}	206	}
207	dentry->sibling = NULL;	207	dentry->sibling = NULL;
208	dentry->parent = NULL;	208	dentry->parent = NULL;
209		209
-		210	free(dentry->name);
-		211	dentry->name = NULL;
-		212
210	return EOK;	213	return EOK;
211	}	214	}
212		215
-		216	void destroy_node(void *nodep)
-		217	{
-		218	tmpfs_dentry_t dentry = (tmpfs_dentry_t ) nodep;
-		219
-		220	assert(!dentry->child);
-		221	assert(!dentry->sibling);
-		222
-		223	unsigned long index = dentry->index;
-		224	hash_table_remove(&dentries, &index, 1);
-		225
-		226	if (dentry->type == TMPFS_FILE)
-		227	free(dentry->data);
-		228	free(dentry);
-		229	}
-		230
213	void tmpfs_lookup(ipc_callid_t rid, ipc_call_t *request)	231	void tmpfs_lookup(ipc_callid_t rid, ipc_call_t *request)
214	{	232	{
215	unsigned next = IPC_GET_ARG1(*request);	233	unsigned next = IPC_GET_ARG1(*request);
216	unsigned last = IPC_GET_ARG2(*request);	234	unsigned last = IPC_GET_ARG2(*request);
217	int dev_handle = IPC_GET_ARG3(*request);	235	int dev_handle = IPC_GET_ARG3(*request);
218	int lflag = IPC_GET_ARG4(*request);	236	int lflag = IPC_GET_ARG4(*request);
219		237
220	if (last < next)	238	if (last < next)
221	last += PLB_SIZE;	239	last += PLB_SIZE;
222		240
223	/*	241	/*
224	* Initialize TMPFS.	242	* Initialize TMPFS.
225	*/	243	*/
226	if (!root && !tmpfs_init()) {	244	if (!root && !tmpfs_init()) {
227	ipc_answer_0(rid, ENOMEM);	245	ipc_answer_0(rid, ENOMEM);
228	return;	246	return;
229	}	247	}
230		248
231	tmpfs_dentry_t *dtmp = root->child;	249	tmpfs_dentry_t *dtmp = root->child;
232	tmpfs_dentry_t *dcur = root;	250	tmpfs_dentry_t *dcur = root;
233		251
234	if (PLB_GET_CHAR(next) == '/')	252	if (PLB_GET_CHAR(next) == '/')
235	next++; /* eat slash */	253	next++; /* eat slash */
236		254
237	char component[NAME_MAX + 1];	255	char component[NAME_MAX + 1];
238	int len = 0;	256	int len = 0;
239	while (dtmp && next <= last) {	257	while (dtmp && next <= last) {
240		258
241	/* collect the component */	259	/* collect the component */
242	if (PLB_GET_CHAR(next) != '/') {	260	if (PLB_GET_CHAR(next) != '/') {
243	if (len + 1 == NAME_MAX) {	261	if (len + 1 == NAME_MAX) {
244	/* comopnent length overflow */	262	/* comopnent length overflow */
245	ipc_answer_0(rid, ENAMETOOLONG);	263	ipc_answer_0(rid, ENAMETOOLONG);
246	return;	264	return;
247	}	265	}
248	component[len++] = PLB_GET_CHAR(next);	266	component[len++] = PLB_GET_CHAR(next);
249	next++; /* process next character */	267	next++; /* process next character */
250	if (next <= last)	268	if (next <= last)
251	continue;	269	continue;
252	}	270	}
253		271
254	assert(len);	272	assert(len);
255	component[len] = '\0';	273	component[len] = '\0';
256	next++; /* eat slash */	274	next++; /* eat slash */
257	len = 0;	275	len = 0;
258		276
259	/* match the component */	277	/* match the component */
260	while (dtmp && !match_component(dtmp, component))	278	while (dtmp && !match_component(dtmp, component))
261	dtmp = dtmp->sibling;	279	dtmp = dtmp->sibling;
262		280
263	/* handle miss: match amongst siblings */	281	/* handle miss: match amongst siblings */
264	if (!dtmp) {	282	if (!dtmp) {
265	if ((next > last) && (lflag & L_CREATE)) {	283	if ((next > last) && (lflag & L_CREATE)) {
266	/* no components left and L_CREATE specified */	284	/* no components left and L_CREATE specified */
267	if (dcur->type != TMPFS_DIRECTORY) {	285	if (dcur->type != TMPFS_DIRECTORY) {
268	ipc_answer_0(rid, ENOTDIR);	286	ipc_answer_0(rid, ENOTDIR);
269	return;	287	return;
270	}	288	}
271	void *nodep = create_node(dcur,	289	void *nodep = create_node(lflag);
272	component, lflag);	-
273	if (nodep) {	290	if (nodep) {
-		291	if (!link_node(dcur, nodep,
-		292	component)) {
-		293	destroy_node(nodep);
-		294	ipc_answer_0(rid, ENOSPC);
-		295	} else {
274	ipc_answer_5(rid, EOK,	296	ipc_answer_5(rid, EOK,
275	tmpfs_reg.fs_handle, dev_handle,	297	tmpfs_reg.fs_handle,
-		298	dev_handle,
276	TMPFS_GET_INDEX(nodep), 0,	299	TMPFS_GET_INDEX(nodep), 0,
277	TMPFS_GET_LNKCNT(nodep));	300	TMPFS_GET_LNKCNT(nodep));
-		301	}
278	} else {	302	} else {
279	ipc_answer_0(rid, ENOSPC);	303	ipc_answer_0(rid, ENOSPC);
280	}	304	}
281	return;	305	return;
282	}	306	}
283	ipc_answer_0(rid, ENOENT);	307	ipc_answer_0(rid, ENOENT);
284	return;	308	return;
285	}	309	}
286		310
287	/* descend one level */	311	/* descend one level */
288	dcur = dtmp;	312	dcur = dtmp;
289	dtmp = dtmp->child;	313	dtmp = dtmp->child;
290	}	314	}
291		315
292	/* handle miss: excessive components */	316	/* handle miss: excessive components */
293	if (!dtmp && next <= last) {	317	if (!dtmp && next <= last) {
294	if (lflag & L_CREATE) {	318	if (lflag & L_CREATE) {
295	if (dcur->type != TMPFS_DIRECTORY) {	319	if (dcur->type != TMPFS_DIRECTORY) {
296	ipc_answer_0(rid, ENOTDIR);	320	ipc_answer_0(rid, ENOTDIR);
297	return;	321	return;
298	}	322	}
299		323
300	/* collect next component */	324	/* collect next component */
301	while (next <= last) {	325	while (next <= last) {
302	if (PLB_GET_CHAR(next) == '/') {	326	if (PLB_GET_CHAR(next) == '/') {
303	/* more than one component */	327	/* more than one component */
304	ipc_answer_0(rid, ENOENT);	328	ipc_answer_0(rid, ENOENT);
305	return;	329	return;
306	}	330	}
307	if (len + 1 == NAME_MAX) {	331	if (len + 1 == NAME_MAX) {
308	/* component length overflow */	332	/* component length overflow */
309	ipc_answer_0(rid, ENAMETOOLONG);	333	ipc_answer_0(rid, ENAMETOOLONG);
310	return;	334	return;
311	}	335	}
312	component[len++] = PLB_GET_CHAR(next);	336	component[len++] = PLB_GET_CHAR(next);
313	next++; /* process next character */	337	next++; /* process next character */
314	}	338	}
315	assert(len);	339	assert(len);
316	component[len] = '\0';	340	component[len] = '\0';
317	len = 0;	341	len = 0;
318		342
319	void *nodep = create_node(dcur, component, lflag);	343	void *nodep = create_node(lflag);
320	if (nodep) {	344	if (nodep) {
-		345	if (!link_node(dcur, nodep, component)) {
-		346	destroy_node(nodep);
-		347	ipc_answer_0(rid, ENOSPC);
-		348	} else {
-		349	ipc_answer_5(rid, EOK,
321	ipc_answer_5(rid, EOK, tmpfs_reg.fs_handle,	350	tmpfs_reg.fs_handle,
322	dev_handle, TMPFS_GET_INDEX(nodep), 0,	351	dev_handle, TMPFS_GET_INDEX(nodep),
323	TMPFS_GET_LNKCNT(nodep));	352	0, TMPFS_GET_LNKCNT(nodep));
-		353	}
324	} else {	354	} else {
325	ipc_answer_0(rid, ENOSPC);	355	ipc_answer_0(rid, ENOSPC);
326	}	356	}
327	return;	357	return;
328	}	358	}
329	ipc_answer_0(rid, ENOENT);	359	ipc_answer_0(rid, ENOENT);
330	return;	360	return;
331	}	361	}
332		362
333	/* handle hit */	363	/* handle hit */
334	if (lflag & L_DESTROY) {	364	if (lflag & L_DESTROY) {
335	unsigned old_lnkcnt = TMPFS_GET_LNKCNT(dcur);	365	unsigned old_lnkcnt = TMPFS_GET_LNKCNT(dcur);
336	int res = destroy_component(dcur);	366	int res = unlink_node(dcur);
337	ipc_answer_5(rid, (ipcarg_t)res, tmpfs_reg.fs_handle,	367	ipc_answer_5(rid, (ipcarg_t)res, tmpfs_reg.fs_handle,
338	dev_handle, dcur->index, dcur->size, old_lnkcnt);	368	dev_handle, dcur->index, dcur->size, old_lnkcnt);
339	return;	369	return;
340	}	370	}
341	if ((lflag & (L_CREATE \| L_EXCLUSIVE)) == (L_CREATE \| L_EXCLUSIVE)) {	371	if ((lflag & (L_CREATE \| L_EXCLUSIVE)) == (L_CREATE \| L_EXCLUSIVE)) {
342	ipc_answer_0(rid, EEXIST);	372	ipc_answer_0(rid, EEXIST);
343	return;	373	return;
344	}	374	}
345	if ((lflag & L_FILE) && (dcur->type != TMPFS_FILE)) {	375	if ((lflag & L_FILE) && (dcur->type != TMPFS_FILE)) {
346	ipc_answer_0(rid, EISDIR);	376	ipc_answer_0(rid, EISDIR);
347	return;	377	return;
348	}	378	}
349	if ((lflag & L_DIRECTORY) && (dcur->type != TMPFS_DIRECTORY)) {	379	if ((lflag & L_DIRECTORY) && (dcur->type != TMPFS_DIRECTORY)) {
350	ipc_answer_0(rid, ENOTDIR);	380	ipc_answer_0(rid, ENOTDIR);
351	return;	381	return;
352	}	382	}
353		383
354	ipc_answer_5(rid, EOK, tmpfs_reg.fs_handle, dev_handle, dcur->index,	384	ipc_answer_5(rid, EOK, tmpfs_reg.fs_handle, dev_handle, dcur->index,
355	dcur->size, TMPFS_GET_LNKCNT(dcur));	385	dcur->size, TMPFS_GET_LNKCNT(dcur));
356	}	386	}
357		387
358	void tmpfs_read(ipc_callid_t rid, ipc_call_t *request)	388	void tmpfs_read(ipc_callid_t rid, ipc_call_t *request)
359	{	389	{
360	int dev_handle = IPC_GET_ARG1(*request);	390	int dev_handle = IPC_GET_ARG1(*request);
361	unsigned long index = IPC_GET_ARG2(*request);	391	unsigned long index = IPC_GET_ARG2(*request);
362	off_t pos = IPC_GET_ARG3(*request);	392	off_t pos = IPC_GET_ARG3(*request);
363		393
364	/*	394	/*
365	* Lookup the respective dentry.	395	* Lookup the respective dentry.
366	*/	396	*/
367	link_t *hlp;	397	link_t *hlp;
368	hlp = hash_table_find(&dentries, &index);	398	hlp = hash_table_find(&dentries, &index);
369	if (!hlp) {	399	if (!hlp) {
370	ipc_answer_0(rid, ENOENT);	400	ipc_answer_0(rid, ENOENT);
371	return;	401	return;
372	}	402	}
373	tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t,	403	tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t,
374	dh_link);	404	dh_link);
375		405
376	/*	406	/*
377	* Receive the read request.	407	* Receive the read request.
378	*/	408	*/
379	ipc_callid_t callid;	409	ipc_callid_t callid;
380	size_t len;	410	size_t len;
381	if (!ipc_data_read_receive(&callid, &len)) {	411	if (!ipc_data_read_receive(&callid, &len)) {
382	ipc_answer_0(callid, EINVAL);	412	ipc_answer_0(callid, EINVAL);
383	ipc_answer_0(rid, EINVAL);	413	ipc_answer_0(rid, EINVAL);
384	return;	414	return;
385	}	415	}
386		416
387	size_t bytes;	417	size_t bytes;
388	if (dentry->type == TMPFS_FILE) {	418	if (dentry->type == TMPFS_FILE) {
389	bytes = max(0, min(dentry->size - pos, len));	419	bytes = max(0, min(dentry->size - pos, len));
390	(void) ipc_data_read_finalize(callid, dentry->data + pos,	420	(void) ipc_data_read_finalize(callid, dentry->data + pos,
391	bytes);	421	bytes);
392	} else {	422	} else {
393	int i;	423	int i;
394	tmpfs_dentry_t *cur;	424	tmpfs_dentry_t *cur;
395		425
396	assert(dentry->type == TMPFS_DIRECTORY);	426	assert(dentry->type == TMPFS_DIRECTORY);
397		427
398	/*	428	/*
399	* Yes, we really use O(n) algorithm here.	429	* Yes, we really use O(n) algorithm here.
400	* If it bothers someone, it could be fixed by introducing a	430	* If it bothers someone, it could be fixed by introducing a
401	* hash table.	431	* hash table.
402	*/	432	*/
403	for (i = 0, cur = dentry->child; i < pos && cur; i++,	433	for (i = 0, cur = dentry->child; i < pos && cur; i++,
404	cur = cur->sibling)	434	cur = cur->sibling)
405	;	435	;
406		436
407	if (!cur) {	437	if (!cur) {
408	ipc_answer_0(callid, ENOENT);	438	ipc_answer_0(callid, ENOENT);
409	ipc_answer_1(rid, ENOENT, 0);	439	ipc_answer_1(rid, ENOENT, 0);
410	return;	440	return;
411	}	441	}
412		442
413	(void) ipc_data_read_finalize(callid, cur->name,	443	(void) ipc_data_read_finalize(callid, cur->name,
414	strlen(cur->name) + 1);	444	strlen(cur->name) + 1);
415	bytes = 1;	445	bytes = 1;
416	}	446	}
417		447
418	/*	448	/*
419	* Answer the VFS_READ call.	449	* Answer the VFS_READ call.
420	*/	450	*/
421	ipc_answer_1(rid, EOK, bytes);	451	ipc_answer_1(rid, EOK, bytes);
422	}	452	}
423		453
424	void tmpfs_write(ipc_callid_t rid, ipc_call_t *request)	454	void tmpfs_write(ipc_callid_t rid, ipc_call_t *request)
425	{	455	{
426	int dev_handle = IPC_GET_ARG1(*request);	456	int dev_handle = IPC_GET_ARG1(*request);
427	unsigned long index = IPC_GET_ARG2(*request);	457	unsigned long index = IPC_GET_ARG2(*request);
428	off_t pos = IPC_GET_ARG3(*request);	458	off_t pos = IPC_GET_ARG3(*request);
429		459
430	/*	460	/*
431	* Lookup the respective dentry.	461	* Lookup the respective dentry.
432	*/	462	*/
433	link_t *hlp;	463	link_t *hlp;
434	hlp = hash_table_find(&dentries, &index);	464	hlp = hash_table_find(&dentries, &index);
435	if (!hlp) {	465	if (!hlp) {
436	ipc_answer_0(rid, ENOENT);	466	ipc_answer_0(rid, ENOENT);
437	return;	467	return;
438	}	468	}
439	tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t,	469	tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t,
440	dh_link);	470	dh_link);
441		471
442	/*	472	/*
443	* Receive the write request.	473	* Receive the write request.
444	*/	474	*/

Subversion Repositories HelenOS

(root)/trunk/uspace/srv/fs/tmpfs/tmpfs_ops.c @ 3575 – Rev 2739 → 2742