WebSVN – HelenOS – Diff – /trunk/uspace/srv/fs/fat/fat_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    fat_ops.c
 * @brief   Implementation of VFS operations for the FAT file system server.
 */
 
#include "fat.h"
#include "../../vfs/vfs.h"
#include <libfs.h>
#include <ipc/ipc.h>
#include <async.h>
#include <errno.h>
#include <string.h>
#include <byteorder.h>
#include <libadt/hash_table.h>
#include <libadt/list.h>
#include <assert.h>
#include <futex.h>
 
#define BS_BLOCK        0
 
#define FIN_KEY_DEV_HANDLE  0
#define FIN_KEY_INDEX       1
 
/** Futex protecting both fin_hash and ffn_head. */
futex_t fin_futex = FUTEX_INITIALIZER;
 
/** Hash table of FAT in-core nodes. */
hash_table_t fin_hash;
 
/** List of free FAT in-core nodes. */
link_t ffn_head;
 
#define FAT_NAME_LEN        8
#define FAT_EXT_LEN     3
 
#define FAT_PAD         ' ' 
 
#define FAT_DENTRY_UNUSED   0x00
#define FAT_DENTRY_E5_ESC   0x05
#define FAT_DENTRY_DOT      0x2e
#define FAT_DENTRY_ERASED   0xe5
 
static void dentry_name_canonify(fat_dentry_t *d, char *buf)
{
    int i;
 
    for (i = 0; i < FAT_NAME_LEN; i++) {
        if (d->name[i] == FAT_PAD) {
            buf++;
            break;
        }
        if (d->name[i] == FAT_DENTRY_E5_ESC)
            *buf++ = 0xe5;
        else
            *buf++ = d->name[i];
    }
    if (d->ext[0] != FAT_PAD)
        *buf++ = '.';
    for (i = 0; i < FAT_EXT_LEN; i++) {
        if (d->ext[i] == FAT_PAD) {
            *buf = '\0';
            return;
        }
        if (d->ext[i] == FAT_DENTRY_E5_ESC)
            *buf++ = 0xe5;
        else
            *buf++ = d->ext[i];
    }
}
 
/* TODO and also move somewhere else */
typedef struct {
    void *data;
} block_t;
 
static block_t *block_get(dev_handle_t dev_handle, off_t offset)
{
    return NULL;    /* TODO */
}
 
static block_t *fat_block_get(dev_handle_t dev_handle, fs_index_t index,
    off_t offset) {
    return NULL;    /* TODO */
}
 
static void block_put(block_t *block)
{
    /* TODO */
}
 
static void fat_node_initialize(fat_node_t *node)
{
    futex_initialize(&node->lock, 1);
    node->type = 0;
    node->index = 0;
    node->pindex = 0;
    node->dev_handle = 0;
    link_initialize(&node->fin_link);
    link_initialize(&node->ffn_link);
    node->size = 0;
    node->lnkcnt = 0;
    node->refcnt = 0;
    node->dirty = false;
}
 
static uint16_t fat_bps_get(dev_handle_t dev_handle)
{
    block_t *bb;
    uint16_t bps;
   
    bb = block_get(dev_handle, BS_BLOCK);
    assert(bb != NULL);
    bps = uint16_t_le2host(((fat_bs_t *)bb->data)->bps);
    block_put(bb);
 
    return bps;
}
 
typedef enum {
    FAT_DENTRY_SKIP,
    FAT_DENTRY_LAST,
    FAT_DENTRY_VALID
} fat_dentry_clsf_t;
 
static fat_dentry_clsf_t fat_classify_dentry(fat_dentry_t *d)
{
    if (d->attr & FAT_ATTR_VOLLABEL) {
        /* volume label entry */
        return FAT_DENTRY_SKIP;
    }
    if (d->name[0] == FAT_DENTRY_ERASED) {
        /* not-currently-used entry */
        return FAT_DENTRY_SKIP;
    }
    if (d->name[0] == FAT_DENTRY_UNUSED) {
        /* never used entry */
        return FAT_DENTRY_LAST;
    }
    if (d->name[0] == FAT_DENTRY_DOT) {
        /*
         * Most likely '.' or '..'.
         * It cannot occur in a regular file name.
         */
        return FAT_DENTRY_SKIP;
    }
    return FAT_DENTRY_VALID;
}
 
static void fat_sync_node(fat_node_t *node)
{
    /* TODO */
}
 
/** Instantiate a FAT in-core node.
 *
 * FAT stores the info necessary for instantiation of a node in the parent of
 * that node.  This design necessitated the addition of the parent node index
 * parameter to this otherwise generic libfs API.
 */
static void *
fat_node_get(dev_handle_t dev_handle, fs_index_t index, fs_index_t pindex)
{
    link_t *lnk;
    fat_node_t *node = NULL;
    block_t *b;
    unsigned bps;
    unsigned dps;
    fat_dentry_t *d;
    unsigned i, j;
 
    unsigned long key[] = {
        [FIN_KEY_DEV_HANDLE] = dev_handle,
        [FIN_KEY_INDEX] = index
    };
 
    futex_down(&fin_futex);
    lnk = hash_table_find(&fin_hash, key);
    if (lnk) {
        /*
         * The in-core node was found in the hash table.
         */
        node = hash_table_get_instance(lnk, fat_node_t, fin_link);
        if (!node->refcnt++)
            list_remove(&node->ffn_link);
        futex_up(&fin_futex);
       
        /* Make sure that the node is fully instantiated. */
        futex_down(&node->lock);
        futex_up(&node->lock);
       
        return (void *) node;  
    }
 
    bps = fat_bps_get(dev_handle);
    dps = bps / sizeof(fat_dentry_t);
   
    if (!list_empty(&ffn_head)) {
        /*
         * We are going to reuse a node from the free list.
         */
        lnk = ffn_head.next;
        list_remove(lnk);
        node = list_get_instance(lnk, fat_node_t, ffn_link);
        assert(!node->refcnt);
        if (node->dirty)
            fat_sync_node(node);
        key[FIN_KEY_DEV_HANDLE] = node->dev_handle;
        key[FIN_KEY_INDEX] = node->index;
        hash_table_remove(&fin_hash, key, sizeof(key)/sizeof(*key));
    } else {
        /*
         * We need to allocate a new node.
         */
        node = malloc(sizeof(fat_node_t));
        if (!node)
            return NULL;
    }
    fat_node_initialize(node);
    node->refcnt++;
    node->lnkcnt++;
    node->dev_handle = dev_handle;
    node->index = index;
    node->pindex = pindex;
    key[FIN_KEY_DEV_HANDLE] = node->dev_handle;
    key[FIN_KEY_INDEX] = node->index;
    hash_table_insert(&fin_hash, key, &node->fin_link);
 
    /*
     * We have already put the node back to fin_hash.
     * The node is not yet fully instantiated so we lock it prior to
     * unlocking fin_hash.
     */
    futex_down(&node->lock);
    futex_up(&fin_futex);
 
    /*
     * Because of the design of the FAT file system, we have no clue about
     * how big (i.e. how many directory entries it contains) is the parent
     * of the node we are trying to instantiate.  However, we know that it
     * must contain a directory entry for our node of interest.  We simply
     * scan the parent until we find it.
     */
    for (i = 0; ; i++) {
        b = fat_block_get(node->dev_handle, node->pindex, i);
        for (j = 0; j < dps; j++) {
            d = ((fat_dentry_t *)b->data) + j;
            if (d->firstc == node->index)
                goto found;
        }
        block_put(b);
    }
   
found:
    if (!(d->attr & (FAT_ATTR_SUBDIR | FAT_ATTR_VOLLABEL)))
        node->type = FAT_FILE;
    if ((d->attr & FAT_ATTR_SUBDIR) || !index)
        node->type = FAT_DIRECTORY;
    assert((node->type == FAT_FILE) || (node->type == FAT_DIRECTORY));
   
    node->size = uint32_t_le2host(d->size);
    block_put(b);
 
    futex_up(&node->lock);
    return node;
}
 
static void fat_node_put(void *node)
{
    fat_node_t *nodep = (fat_node_t *)node;
 
    futex_down(&fin_futex);
    if (!--nodep->refcnt)
        list_append(&nodep->ffn_link, &ffn_head);
    futex_up(&fin_futex);
}
 
static void *fat_create(int flags)
{
    return NULL;    /* not supported at the moment */
}
 
static int fat_destroy(void *node)
{
    return ENOTSUP; /* not supported at the moment */
}
 
static bool fat_link(void *prnt, void *chld, const char *name)
{
    return false;   /* not supported at the moment */
}
 
static int fat_unlink(void *prnt, void *chld)
{
    return ENOTSUP; /* not supported at the moment */
}
 
static void *fat_match(void *prnt, const char *component)
{
    fat_node_t *parentp = (fat_node_t *)prnt;
    char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1];
    unsigned i, j;
    unsigned bps;       /* bytes per sector */
    unsigned dps;       /* dentries per sector */
    unsigned blocks;
    fat_dentry_t *d;
    block_t *b;
 
    bps = fat_bps_get(parentp->dev_handle);
    dps = bps / sizeof(fat_dentry_t);
    blocks = parentp->size / bps + (parentp->size % bps != 0);
    for (i = 0; i < blocks; i++) {
        unsigned dentries;
       
        b = fat_block_get(parentp->dev_handle, parentp->index, i);
        dentries = (i == blocks - 1) ?
            parentp->size % sizeof(fat_dentry_t) :
            dps;
        for (j = 0; j < dentries; j++) {
            d = ((fat_dentry_t *)b->data) + j;
            switch (fat_classify_dentry(d)) {
            case FAT_DENTRY_SKIP:
                continue;
            case FAT_DENTRY_LAST:
                block_put(b);
                return NULL;
            default:
            case FAT_DENTRY_VALID:
                dentry_name_canonify(d, name);
                break;
            }
            if (strcmp(name, component) == 0) {
                /* hit */
                void *node = fat_node_get(parentp->dev_handle,
                    (fs_index_t)uint16_t_le2host(d->firstc),
                    parentp->index);
                block_put(b);
                return node;
            }
        }
        block_put(b);
    }
 
    return NULL;
}
 
static fs_index_t fat_index_get(void *node)
{
    fat_node_t *fnodep = (fat_node_t *)node;
    if (!fnodep)
        return 0;
    return fnodep->index;
}
 
static size_t fat_size_get(void *node)
{
    return ((fat_node_t *)node)->size;
}
 
static unsigned fat_lnkcnt_get(void *node)
{
    return ((fat_node_t *)node)->lnkcnt;
}
 
static bool fat_has_children(void *node)
{
    fat_node_t *nodep = (fat_node_t *)node;
    unsigned bps;
    unsigned dps;
    unsigned blocks;
    block_t *b;
    unsigned i, j;
 
    if (nodep->type != FAT_DIRECTORY)
        return false;
 
    bps = fat_bps_get(nodep->dev_handle);
    dps = bps / sizeof(fat_dentry_t);
 
    blocks = nodep->size / bps + (nodep->size % bps != 0);
 
    for (i = 0; i < blocks; i++) {
        unsigned dentries;
        fat_dentry_t *d;
   
        b = fat_block_get(nodep->dev_handle, nodep->index, i);
        dentries = (i == blocks - 1) ?
            nodep->size % sizeof(fat_dentry_t) :
            dps;
        for (j = 0; j < dentries; j++) {
            d = ((fat_dentry_t *)b->data) + j;
            switch (fat_classify_dentry(d)) {
            case FAT_DENTRY_SKIP:
                continue;
            case FAT_DENTRY_LAST:
                block_put(b);
                return false;
            default:
            case FAT_DENTRY_VALID:
                block_put(b);
                return true;
            }
            block_put(b);
            return true;
        }
        block_put(b);
    }
 
    return false;
}
 
static void *fat_root_get(dev_handle_t dev_handle)
{
    return fat_node_get(dev_handle, 0, 0); 
}
 
static char fat_plb_get_char(unsigned pos)
{
    return fat_reg.plb_ro[pos % PLB_SIZE];
}
 
static bool fat_is_directory(void *node)
{
    return ((fat_node_t *)node)->type == FAT_DIRECTORY;
}
 
static bool fat_is_file(void *node)
{
    return ((fat_node_t *)node)->type == FAT_FILE;
}
 
/** libfs operations */
libfs_ops_t fat_libfs_ops = {
    .match = fat_match,
    .node_get = fat_node_get,
    .node_put = fat_node_put,
    .create = fat_create,
    .destroy = fat_destroy,
    .link = fat_link,
    .unlink = fat_unlink,
    .index_get = fat_index_get,
    .size_get = fat_size_get,
    .lnkcnt_get = fat_lnkcnt_get,
    .has_children = fat_has_children,
    .root_get = fat_root_get,
    .plb_get_char = fat_plb_get_char,
    .is_directory = fat_is_directory,
    .is_file = fat_is_file
};
 
void fat_lookup(ipc_callid_t rid, ipc_call_t *request)
{
    libfs_lookup(&fat_libfs_ops, fat_reg.fs_handle, rid, request);
}
 
/**
 * @}
 */
 

Rev 2857	Rev 2858
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 fat_ops.c	34	* @file fat_ops.c
35	* @brief Implementation of VFS operations for the FAT file system server.	35	* @brief Implementation of VFS operations for the FAT file system server.
36	*/	36	*/
37		37
38	#include "fat.h"	38	#include "fat.h"
39	#include "../../vfs/vfs.h"	39	#include "../../vfs/vfs.h"
40	#include <libfs.h>	40	#include <libfs.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 <string.h>	44	#include <string.h>
45	#include <byteorder.h>	45	#include <byteorder.h>
46	#include <libadt/hash_table.h>	46	#include <libadt/hash_table.h>
47	#include <libadt/list.h>	47	#include <libadt/list.h>
48	#include <assert.h>	48	#include <assert.h>
49	#include <futex.h>	49	#include <futex.h>
50		50
51	#define BS_BLOCK 0	51	#define BS_BLOCK 0
52		52
53	#define FIN_KEY_DEV_HANDLE 0	53	#define FIN_KEY_DEV_HANDLE 0
54	#define FIN_KEY_INDEX 1	54	#define FIN_KEY_INDEX 1
55		55
56	/** Futex protecting both fin_hash and ffn_head. */	56	/** Futex protecting both fin_hash and ffn_head. */
57	futex_t fin_futex = FUTEX_INITIALIZER;	57	futex_t fin_futex = FUTEX_INITIALIZER;
58		58
59	/** Hash table of FAT in-core nodes. */	59	/** Hash table of FAT in-core nodes. */
60	hash_table_t fin_hash;	60	hash_table_t fin_hash;
61		61
62	/** List of free FAT in-core nodes. */	62	/** List of free FAT in-core nodes. */
63	link_t ffn_head;	63	link_t ffn_head;
64		64
65	#define FAT_NAME_LEN 8	65	#define FAT_NAME_LEN 8
66	#define FAT_EXT_LEN 3	66	#define FAT_EXT_LEN 3
67		67
68	#define FAT_PAD ' '	68	#define FAT_PAD ' '
69		69
70	#define FAT_DENTRY_UNUSED 0x00	70	#define FAT_DENTRY_UNUSED 0x00
71	#define FAT_DENTRY_E5_ESC 0x05	71	#define FAT_DENTRY_E5_ESC 0x05
72	#define FAT_DENTRY_DOT 0x2e	72	#define FAT_DENTRY_DOT 0x2e
73	#define FAT_DENTRY_ERASED 0xe5	73	#define FAT_DENTRY_ERASED 0xe5
74		74
75	static void dentry_name_canonify(fat_dentry_t d, char buf)	75	static void dentry_name_canonify(fat_dentry_t d, char buf)
76	{	76	{
77	int i;	77	int i;
78		78
79	for (i = 0; i < FAT_NAME_LEN; i++) {	79	for (i = 0; i < FAT_NAME_LEN; i++) {
80	if (d->name[i] == FAT_PAD) {	80	if (d->name[i] == FAT_PAD) {
81	buf++;	81	buf++;
82	break;	82	break;
83	}	83	}
84	if (d->name[i] == FAT_DENTRY_E5_ESC)	84	if (d->name[i] == FAT_DENTRY_E5_ESC)
85	*buf++ = 0xe5;	85	*buf++ = 0xe5;
86	else	86	else
87	*buf++ = d->name[i];	87	*buf++ = d->name[i];
88	}	88	}
89	if (d->ext[0] != FAT_PAD)	89	if (d->ext[0] != FAT_PAD)
90	*buf++ = '.';	90	*buf++ = '.';
91	for (i = 0; i < FAT_EXT_LEN; i++) {	91	for (i = 0; i < FAT_EXT_LEN; i++) {
92	if (d->ext[i] == FAT_PAD) {	92	if (d->ext[i] == FAT_PAD) {
93	*buf = '\0';	93	*buf = '\0';
94	return;	94	return;
95	}	95	}
96	if (d->ext[i] == FAT_DENTRY_E5_ESC)	96	if (d->ext[i] == FAT_DENTRY_E5_ESC)
97	*buf++ = 0xe5;	97	*buf++ = 0xe5;
98	else	98	else
99	*buf++ = d->ext[i];	99	*buf++ = d->ext[i];
100	}	100	}
101	}	101	}
102		102
103	/* TODO and also move somewhere else */	103	/* TODO and also move somewhere else */
104	typedef struct {	104	typedef struct {
105	void *data;	105	void *data;
106	} block_t;	106	} block_t;
107		107
108	static block_t *block_get(dev_handle_t dev_handle, off_t offset)	108	static block_t *block_get(dev_handle_t dev_handle, off_t offset)
109	{	109	{
110	return NULL; /* TODO */	110	return NULL; /* TODO */
111	}	111	}
112		112
113	static block_t *fat_block_get(dev_handle_t dev_handle, fs_index_t index,	113	static block_t *fat_block_get(dev_handle_t dev_handle, fs_index_t index,
114	off_t offset) {	114	off_t offset) {
115	return NULL; /* TODO */	115	return NULL; /* TODO */
116	}	116	}
117		117
118	static void block_put(block_t *block)	118	static void block_put(block_t *block)
119	{	119	{
120	/* TODO */	120	/* TODO */
121	}	121	}
122		122
123	static void fat_node_initialize(fat_node_t *node)	123	static void fat_node_initialize(fat_node_t *node)
124	{	124	{
125	futex_initialize(&node->lock, 1);	125	futex_initialize(&node->lock, 1);
126	node->type = 0;	126	node->type = 0;
127	node->index = 0;	127	node->index = 0;
128	node->pindex = 0;	128	node->pindex = 0;
129	node->dev_handle = 0;	129	node->dev_handle = 0;
130	link_initialize(&node->fin_link);	130	link_initialize(&node->fin_link);
131	link_initialize(&node->ffn_link);	131	link_initialize(&node->ffn_link);
132	node->size = 0;	132	node->size = 0;
133	node->lnkcnt = 0;	133	node->lnkcnt = 0;
134	node->refcnt = 0;	134	node->refcnt = 0;
135	node->dirty = false;	135	node->dirty = false;
136	}	136	}
137		137
138	static uint16_t fat_bps_get(dev_handle_t dev_handle)	138	static uint16_t fat_bps_get(dev_handle_t dev_handle)
139	{	139	{
140	block_t *bb;	140	block_t *bb;
141	uint16_t bps;	141	uint16_t bps;
142		142
143	bb = block_get(dev_handle, BS_BLOCK);	143	bb = block_get(dev_handle, BS_BLOCK);
144	assert(bb != NULL);	144	assert(bb != NULL);
145	bps = uint16_t_le2host(((fat_bs_t *)bb->data)->bps);	145	bps = uint16_t_le2host(((fat_bs_t *)bb->data)->bps);
146	block_put(bb);	146	block_put(bb);
147		147
148	return bps;	148	return bps;
149	}	149	}
150		150
151	typedef enum {	151	typedef enum {
152	FAT_DENTRY_SKIP,	152	FAT_DENTRY_SKIP,
153	FAT_DENTRY_LAST,	153	FAT_DENTRY_LAST,
154	FAT_DENTRY_VALID	154	FAT_DENTRY_VALID
155	} fat_dentry_clsf_t;	155	} fat_dentry_clsf_t;
156		156
157	static fat_dentry_clsf_t fat_classify_dentry(fat_dentry_t *d)	157	static fat_dentry_clsf_t fat_classify_dentry(fat_dentry_t *d)
158	{	158	{
159	if (d->attr & FAT_ATTR_VOLLABEL) {	159	if (d->attr & FAT_ATTR_VOLLABEL) {
160	/* volume label entry */	160	/* volume label entry */
161	return FAT_DENTRY_SKIP;	161	return FAT_DENTRY_SKIP;
162	}	162	}
163	if (d->name[0] == FAT_DENTRY_ERASED) {	163	if (d->name[0] == FAT_DENTRY_ERASED) {
164	/* not-currently-used entry */	164	/* not-currently-used entry */
165	return FAT_DENTRY_SKIP;	165	return FAT_DENTRY_SKIP;
166	}	166	}
167	if (d->name[0] == FAT_DENTRY_UNUSED) {	167	if (d->name[0] == FAT_DENTRY_UNUSED) {
168	/* never used entry */	168	/* never used entry */
169	return FAT_DENTRY_LAST;	169	return FAT_DENTRY_LAST;
170	}	170	}
171	if (d->name[0] == FAT_DENTRY_DOT) {	171	if (d->name[0] == FAT_DENTRY_DOT) {
172	/*	172	/*
173	* Most likely '.' or '..'.	173	* Most likely '.' or '..'.
174	* It cannot occur in a regular file name.	174	* It cannot occur in a regular file name.
175	*/	175	*/
176	return FAT_DENTRY_SKIP;	176	return FAT_DENTRY_SKIP;
177	}	177	}
178	return FAT_DENTRY_VALID;	178	return FAT_DENTRY_VALID;
179	}	179	}
180		180
181	static void fat_sync_node(fat_node_t *node)	181	static void fat_sync_node(fat_node_t *node)
182	{	182	{
183	/* TODO */	183	/* TODO */
184	}	184	}
185		185
186	/** Instantiate a FAT in-core node.	186	/** Instantiate a FAT in-core node.
187	*	187	*
188	* FAT stores the info necessary for instantiation of a node in the parent of	188	* FAT stores the info necessary for instantiation of a node in the parent of
189	* that node. This design necessitated the addition of the parent node index	189	* that node. This design necessitated the addition of the parent node index
190	* parameter to this otherwise generic libfs API.	190	* parameter to this otherwise generic libfs API.
191	*/	191	*/
192	static void *	192	static void *
193	fat_node_get(dev_handle_t dev_handle, fs_index_t index, fs_index_t pindex)	193	fat_node_get(dev_handle_t dev_handle, fs_index_t index, fs_index_t pindex)
194	{	194	{
195	link_t *lnk;	195	link_t *lnk;
196	fat_node_t *node = NULL;	196	fat_node_t *node = NULL;
197	block_t *b;	197	block_t *b;
198	unsigned bps;	198	unsigned bps;
199	unsigned dps;	199	unsigned dps;
200	fat_dentry_t *d;	200	fat_dentry_t *d;
201	unsigned i, j;	201	unsigned i, j;
202		202
203	unsigned long key[] = {	203	unsigned long key[] = {
204	[FIN_KEY_DEV_HANDLE] = dev_handle,	204	[FIN_KEY_DEV_HANDLE] = dev_handle,
205	[FIN_KEY_INDEX] = index	205	[FIN_KEY_INDEX] = index
206	};	206	};
207		207
208	futex_down(&fin_futex);	208	futex_down(&fin_futex);
209	lnk = hash_table_find(&fin_hash, key);	209	lnk = hash_table_find(&fin_hash, key);
210	if (lnk) {	210	if (lnk) {
211	/*	211	/*
212	* The in-core node was found in the hash table.	212	* The in-core node was found in the hash table.
213	*/	213	*/
214	node = hash_table_get_instance(lnk, fat_node_t, fin_link);	214	node = hash_table_get_instance(lnk, fat_node_t, fin_link);
215	if (!node->refcnt++)	215	if (!node->refcnt++)
216	list_remove(&node->ffn_link);	216	list_remove(&node->ffn_link);
217	futex_up(&fin_futex);	217	futex_up(&fin_futex);
218		218
219	/* Make sure that the node is fully instantiated. */	219	/* Make sure that the node is fully instantiated. */
220	futex_down(&node->lock);	220	futex_down(&node->lock);
221	futex_up(&node->lock);	221	futex_up(&node->lock);
222		222
223	return (void *) node;	223	return (void *) node;
224	}	224	}
225		225
226	bps = fat_bps_get(dev_handle);	226	bps = fat_bps_get(dev_handle);
227	dps = bps / sizeof(fat_dentry_t);	227	dps = bps / sizeof(fat_dentry_t);
228		228
229	if (!list_empty(&ffn_head)) {	229	if (!list_empty(&ffn_head)) {
230	/*	230	/*
231	* We are going to reuse a node from the free list.	231	* We are going to reuse a node from the free list.
232	*/	232	*/
233	lnk = ffn_head.next;	233	lnk = ffn_head.next;
234	list_remove(lnk);	234	list_remove(lnk);
235	node = list_get_instance(lnk, fat_node_t, ffn_link);	235	node = list_get_instance(lnk, fat_node_t, ffn_link);
236	assert(!node->refcnt);	236	assert(!node->refcnt);
237	if (node->dirty)	237	if (node->dirty)
238	fat_sync_node(node);	238	fat_sync_node(node);
239	key[FIN_KEY_DEV_HANDLE] = node->dev_handle;	239	key[FIN_KEY_DEV_HANDLE] = node->dev_handle;
240	key[FIN_KEY_INDEX] = node->index;	240	key[FIN_KEY_INDEX] = node->index;
241	hash_table_remove(&fin_hash, key, sizeof(key)/sizeof(*key));	241	hash_table_remove(&fin_hash, key, sizeof(key)/sizeof(*key));
242	} else {	242	} else {
243	/*	243	/*
244	* We need to allocate a new node.	244	* We need to allocate a new node.
245	*/	245	*/
246	node = malloc(sizeof(fat_node_t));	246	node = malloc(sizeof(fat_node_t));
247	if (!node)	247	if (!node)
248	return NULL;	248	return NULL;
249	}	249	}
250	fat_node_initialize(node);	250	fat_node_initialize(node);
251	node->refcnt++;	251	node->refcnt++;
252	node->lnkcnt++;	252	node->lnkcnt++;
253	node->dev_handle = dev_handle;	253	node->dev_handle = dev_handle;
254	node->index = index;	254	node->index = index;
255	node->pindex = pindex;	255	node->pindex = pindex;
256	key[FIN_KEY_DEV_HANDLE] = node->dev_handle;	256	key[FIN_KEY_DEV_HANDLE] = node->dev_handle;
257	key[FIN_KEY_INDEX] = node->index;	257	key[FIN_KEY_INDEX] = node->index;
258	hash_table_insert(&fin_hash, key, &node->fin_link);	258	hash_table_insert(&fin_hash, key, &node->fin_link);
259		259
260	/*	260	/*
261	* We have already put the node back to fin_hash.	261	* We have already put the node back to fin_hash.
262	* The node is not yet fully instantiated so we lock it prior to	262	* The node is not yet fully instantiated so we lock it prior to
263	* unlocking fin_hash.	263	* unlocking fin_hash.
264	*/	264	*/
265	futex_down(&node->lock);	265	futex_down(&node->lock);
266	futex_up(&fin_futex);	266	futex_up(&fin_futex);
267		267
268	/*	268	/*
269	* Because of the design of the FAT file system, we have no clue about	269	* Because of the design of the FAT file system, we have no clue about
270	* how big (i.e. how many directory entries it contains) is the parent	270	* how big (i.e. how many directory entries it contains) is the parent
271	* of the node we are trying to instantiate. However, we know that it	271	* of the node we are trying to instantiate. However, we know that it
272	* must contain a directory entry for our node of interest. We simply	272	* must contain a directory entry for our node of interest. We simply
273	* scan the parent until we find it.	273	* scan the parent until we find it.
274	*/	274	*/
275	for (i = 0; ; i++) {	275	for (i = 0; ; i++) {
276	b = fat_block_get(node->dev_handle, node->pindex, i);	276	b = fat_block_get(node->dev_handle, node->pindex, i);
277	for (j = 0; j < dps; j++) {	277	for (j = 0; j < dps; j++) {
278	d = ((fat_dentry_t *)b->data) + j;	278	d = ((fat_dentry_t *)b->data) + j;
279	if (d->firstc == node->index)	279	if (d->firstc == node->index)
280	goto found;	280	goto found;
281	}	281	}
282	block_put(b);	282	block_put(b);
283	}	283	}
284		284
285	found:	285	found:
286	if (!(d->attr & (FAT_ATTR_SUBDIR \| FAT_ATTR_VOLLABEL)))	286	if (!(d->attr & (FAT_ATTR_SUBDIR \| FAT_ATTR_VOLLABEL)))
287	node->type = FAT_FILE;	287	node->type = FAT_FILE;
288	if ((d->attr & FAT_ATTR_SUBDIR) \|\| !index)	288	if ((d->attr & FAT_ATTR_SUBDIR) \|\| !index)
289	node->type = FAT_DIRECTORY;	289	node->type = FAT_DIRECTORY;
290	assert((node->type == FAT_FILE) \|\| (node->type == FAT_DIRECTORY));	290	assert((node->type == FAT_FILE) \|\| (node->type == FAT_DIRECTORY));
291		291
292	node->size = uint32_t_le2host(d->size);	292	node->size = uint32_t_le2host(d->size);
293	block_put(b);	293	block_put(b);
294		294
295	futex_up(&node->lock);	295	futex_up(&node->lock);
296	return node;	296	return node;
297	}	297	}
298		298
299	static void fat_node_put(void *node)	299	static void fat_node_put(void *node)
300	{	300	{
301	fat_node_t nodep = (fat_node_t )node;	301	fat_node_t nodep = (fat_node_t )node;
302		302
303	futex_down(&fin_futex);	303	futex_down(&fin_futex);
304	if (!--nodep->refcnt)	304	if (!--nodep->refcnt)
305	list_append(&nodep->ffn_link, &ffn_head);	305	list_append(&nodep->ffn_link, &ffn_head);
306	futex_up(&fin_futex);	306	futex_up(&fin_futex);
307	}	307	}
308		308
309	static void *fat_create(int flags)	309	static void *fat_create(int flags)
310	{	310	{
311	return NULL; /* not supported at the moment */	311	return NULL; /* not supported at the moment */
312	}	312	}
313		313
314	static bool fat_destroy(void *node)	314	static int fat_destroy(void *node)
315	{	315	{
316	return false; /* not supported at the moment */	316	return ENOTSUP; /* not supported at the moment */
317	}	317	}
318		318
319	static bool fat_link(void prnt, void chld, const char *name)	319	static bool fat_link(void prnt, void chld, const char *name)
320	{	320	{
321	return false; /* not supported at the moment */	321	return false; /* not supported at the moment */
322	}	322	}
323		323
324	static int fat_unlink(void prnt, void chld)	324	static int fat_unlink(void prnt, void chld)
325	{	325	{
326	return ENOTSUP; /* not supported at the moment */	326	return ENOTSUP; /* not supported at the moment */
327	}	327	}
328		328
329	static void fat_match(void prnt, const char *component)	329	static void fat_match(void prnt, const char *component)
330	{	330	{
331	fat_node_t parentp = (fat_node_t )prnt;	331	fat_node_t parentp = (fat_node_t )prnt;
332	char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1];	332	char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1];
333	unsigned i, j;	333	unsigned i, j;
334	unsigned bps; /* bytes per sector */	334	unsigned bps; /* bytes per sector */
335	unsigned dps; /* dentries per sector */	335	unsigned dps; /* dentries per sector */
336	unsigned blocks;	336	unsigned blocks;
337	fat_dentry_t *d;	337	fat_dentry_t *d;
338	block_t *b;	338	block_t *b;
339		339
340	bps = fat_bps_get(parentp->dev_handle);	340	bps = fat_bps_get(parentp->dev_handle);
341	dps = bps / sizeof(fat_dentry_t);	341	dps = bps / sizeof(fat_dentry_t);
342	blocks = parentp->size / bps + (parentp->size % bps != 0);	342	blocks = parentp->size / bps + (parentp->size % bps != 0);
343	for (i = 0; i < blocks; i++) {	343	for (i = 0; i < blocks; i++) {
344	unsigned dentries;	344	unsigned dentries;
345		345
346	b = fat_block_get(parentp->dev_handle, parentp->index, i);	346	b = fat_block_get(parentp->dev_handle, parentp->index, i);
347	dentries = (i == blocks - 1) ?	347	dentries = (i == blocks - 1) ?
348	parentp->size % sizeof(fat_dentry_t) :	348	parentp->size % sizeof(fat_dentry_t) :
349	dps;	349	dps;
350	for (j = 0; j < dentries; j++) {	350	for (j = 0; j < dentries; j++) {
351	d = ((fat_dentry_t *)b->data) + j;	351	d = ((fat_dentry_t *)b->data) + j;
352	switch (fat_classify_dentry(d)) {	352	switch (fat_classify_dentry(d)) {
353	case FAT_DENTRY_SKIP:	353	case FAT_DENTRY_SKIP:
354	continue;	354	continue;
355	case FAT_DENTRY_LAST:	355	case FAT_DENTRY_LAST:
356	block_put(b);	356	block_put(b);
357	return NULL;	357	return NULL;
358	default:	358	default:
359	case FAT_DENTRY_VALID:	359	case FAT_DENTRY_VALID:
360	dentry_name_canonify(d, name);	360	dentry_name_canonify(d, name);
361	break;	361	break;
362	}	362	}
363	if (strcmp(name, component) == 0) {	363	if (strcmp(name, component) == 0) {
364	/* hit */	364	/* hit */
365	void *node = fat_node_get(parentp->dev_handle,	365	void *node = fat_node_get(parentp->dev_handle,
366	(fs_index_t)uint16_t_le2host(d->firstc),	366	(fs_index_t)uint16_t_le2host(d->firstc),
367	parentp->index);	367	parentp->index);
368	block_put(b);	368	block_put(b);
369	return node;	369	return node;
370	}	370	}
371	}	371	}
372	block_put(b);	372	block_put(b);
373	}	373	}
374		374
375	return NULL;	375	return NULL;
376	}	376	}
377		377
378	static fs_index_t fat_index_get(void *node)	378	static fs_index_t fat_index_get(void *node)
379	{	379	{
380	fat_node_t fnodep = (fat_node_t )node;	380	fat_node_t fnodep = (fat_node_t )node;
381	if (!fnodep)	381	if (!fnodep)
382	return 0;	382	return 0;
383	return fnodep->index;	383	return fnodep->index;
384	}	384	}
385		385
386	static size_t fat_size_get(void *node)	386	static size_t fat_size_get(void *node)
387	{	387	{
388	return ((fat_node_t *)node)->size;	388	return ((fat_node_t *)node)->size;
389	}	389	}
390		390
391	static unsigned fat_lnkcnt_get(void *node)	391	static unsigned fat_lnkcnt_get(void *node)
392	{	392	{
393	return ((fat_node_t *)node)->lnkcnt;	393	return ((fat_node_t *)node)->lnkcnt;
394	}	394	}
395		395
396	static bool fat_has_children(void *node)	396	static bool fat_has_children(void *node)
397	{	397	{
398	fat_node_t nodep = (fat_node_t )node;	398	fat_node_t nodep = (fat_node_t )node;
399	unsigned bps;	399	unsigned bps;
400	unsigned dps;	400	unsigned dps;
401	unsigned blocks;	401	unsigned blocks;
402	block_t *b;	402	block_t *b;
403	unsigned i, j;	403	unsigned i, j;
404		404
405	if (nodep->type != FAT_DIRECTORY)	405	if (nodep->type != FAT_DIRECTORY)
406	return false;	406	return false;
407		407
408	bps = fat_bps_get(nodep->dev_handle);	408	bps = fat_bps_get(nodep->dev_handle);
409	dps = bps / sizeof(fat_dentry_t);	409	dps = bps / sizeof(fat_dentry_t);
410		410
411	blocks = nodep->size / bps + (nodep->size % bps != 0);	411	blocks = nodep->size / bps + (nodep->size % bps != 0);
412		412
413	for (i = 0; i < blocks; i++) {	413	for (i = 0; i < blocks; i++) {
414	unsigned dentries;	414	unsigned dentries;
415	fat_dentry_t *d;	415	fat_dentry_t *d;
416		416
417	b = fat_block_get(nodep->dev_handle, nodep->index, i);	417	b = fat_block_get(nodep->dev_handle, nodep->index, i);
418	dentries = (i == blocks - 1) ?	418	dentries = (i == blocks - 1) ?
419	nodep->size % sizeof(fat_dentry_t) :	419	nodep->size % sizeof(fat_dentry_t) :
420	dps;	420	dps;
421	for (j = 0; j < dentries; j++) {	421	for (j = 0; j < dentries; j++) {
422	d = ((fat_dentry_t *)b->data) + j;	422	d = ((fat_dentry_t *)b->data) + j;
423	switch (fat_classify_dentry(d)) {	423	switch (fat_classify_dentry(d)) {
424	case FAT_DENTRY_SKIP:	424	case FAT_DENTRY_SKIP:
425	continue;	425	continue;
426	case FAT_DENTRY_LAST:	426	case FAT_DENTRY_LAST:
427	block_put(b);	427	block_put(b);
428	return false;	428	return false;
429	default:	429	default:
430	case FAT_DENTRY_VALID:	430	case FAT_DENTRY_VALID:
431	block_put(b);	431	block_put(b);
432	return true;	432	return true;
433	}	433	}
434	block_put(b);	434	block_put(b);
435	return true;	435	return true;
436	}	436	}
437	block_put(b);	437	block_put(b);
438	}	438	}
439		439
440	return false;	440	return false;
441	}	441	}
442		442
443	static void *fat_root_get(dev_handle_t dev_handle)	443	static void *fat_root_get(dev_handle_t dev_handle)
444	{	444	{
445	return fat_node_get(dev_handle, 0, 0);	445	return fat_node_get(dev_handle, 0, 0);
446	}	446	}
447		447
448	static char fat_plb_get_char(unsigned pos)	448	static char fat_plb_get_char(unsigned pos)
449	{	449	{
450	return fat_reg.plb_ro[pos % PLB_SIZE];	450	return fat_reg.plb_ro[pos % PLB_SIZE];
451	}	451	}
452		452
453	static bool fat_is_directory(void *node)	453	static bool fat_is_directory(void *node)
454	{	454	{
455	return ((fat_node_t *)node)->type == FAT_DIRECTORY;	455	return ((fat_node_t *)node)->type == FAT_DIRECTORY;
456	}	456	}
457		457
458	static bool fat_is_file(void *node)	458	static bool fat_is_file(void *node)
459	{	459	{
460	return ((fat_node_t *)node)->type == FAT_FILE;	460	return ((fat_node_t *)node)->type == FAT_FILE;
461	}	461	}
462		462
463	/** libfs operations */	463	/** libfs operations */
464	libfs_ops_t fat_libfs_ops = {	464	libfs_ops_t fat_libfs_ops = {
465	.match = fat_match,	465	.match = fat_match,
466	.node_get = fat_node_get,	466	.node_get = fat_node_get,
467	.node_put = fat_node_put,	467	.node_put = fat_node_put,
468	.create = fat_create,	468	.create = fat_create,
469	.destroy = fat_destroy,	469	.destroy = fat_destroy,
470	.link = fat_link,	470	.link = fat_link,
471	.unlink = fat_unlink,	471	.unlink = fat_unlink,
472	.index_get = fat_index_get,	472	.index_get = fat_index_get,
473	.size_get = fat_size_get,	473	.size_get = fat_size_get,
474	.lnkcnt_get = fat_lnkcnt_get,	474	.lnkcnt_get = fat_lnkcnt_get,
475	.has_children = fat_has_children,	475	.has_children = fat_has_children,
476	.root_get = fat_root_get,	476	.root_get = fat_root_get,
477	.plb_get_char = fat_plb_get_char,	477	.plb_get_char = fat_plb_get_char,
478	.is_directory = fat_is_directory,	478	.is_directory = fat_is_directory,
479	.is_file = fat_is_file	479	.is_file = fat_is_file
480	};	480	};
481		481
482	void fat_lookup(ipc_callid_t rid, ipc_call_t *request)	482	void fat_lookup(ipc_callid_t rid, ipc_call_t *request)
483	{	483	{
484	libfs_lookup(&fat_libfs_ops, fat_reg.fs_handle, rid, request);	484	libfs_lookup(&fat_libfs_ops, fat_reg.fs_handle, rid, request);
485	}	485	}
486		486
487	/**	487	/**
488	* @}	488	* @}
489	*/	489	*/
490		490

Subversion Repositories HelenOS

(root)/trunk/uspace/srv/fs/fat/fat_ops.c – Rev 2857 → 2858