WebSVN – HelenOS – Diff – /branches/network/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
 
/** 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 void block_put(block_t *block)
{
    /* TODO */
}
 
#define FAT_BS(b)       ((fat_bs_t *)((b)->data))
 
#define FAT_CLST_RES0   0x0000
#define FAT_CLST_RES1   0x0001  /* internally used to mark root directory */
#define FAT_CLST_FIRST  0x0002
#define FAT_CLST_BAD    0xfff7
#define FAT_CLST_LAST1  0xfff8
#define FAT_CLST_LAST8  0xffff
 
static block_t *fat_block_get(fat_node_t *nodep, off_t offset)
{
    block_t *bb;
    block_t *b;
    unsigned bps;
    unsigned spc;
    unsigned rscnt;     /* block address of the first FAT */
    unsigned fatcnt;
    unsigned rde;
    unsigned rds;       /* root directory size */
    unsigned sf;
    unsigned ssa;       /* size of the system area */
    unsigned clusters;
    fat_cluster_t clst = nodep->firstc;
    unsigned i;
 
    bb = block_get(nodep->idx->dev_handle, BS_BLOCK);
    bps = uint16_t_le2host(FAT_BS(bb)->bps);
    spc = FAT_BS(bb)->spc;
    rscnt = uint16_t_le2host(FAT_BS(bb)->rscnt);
    fatcnt = FAT_BS(bb)->fatcnt;
    rde = uint16_t_le2host(FAT_BS(bb)->root_ent_max);
    sf = uint16_t_le2host(FAT_BS(bb)->sec_per_fat);
    block_put(bb);
 
    rds = (sizeof(fat_dentry_t) * rde) / bps;
    rds += ((sizeof(fat_dentry_t) * rde) % bps != 0);
    ssa = rscnt + fatcnt * sf + rds;
 
    if (nodep->idx->index == FAT_CLST_RES1) {
        /* root directory special case */
        assert(offset < rds);
        b = block_get(nodep->idx->dev_handle,
            rscnt + fatcnt * sf + offset);
        return b;
    }
 
    clusters = offset / spc;
    for (i = 0; i < clusters; i++) {
        unsigned fsec;  /* sector offset relative to FAT1 */
        unsigned fidx;  /* FAT1 entry index */
 
        assert(clst >= FAT_CLST_FIRST && clst < FAT_CLST_BAD);
        fsec = (clst * sizeof(fat_cluster_t)) / bps;
        fidx = clst % (bps / sizeof(fat_cluster_t));
        /* read FAT1 */
        b = block_get(nodep->idx->dev_handle, rscnt + fsec);
        clst = uint16_t_le2host(((fat_cluster_t *)b->data)[fidx]);
        assert(clst != FAT_CLST_BAD);
        assert(clst < FAT_CLST_LAST1);
        block_put(b);
    }
 
    b = block_get(nodep->idx->dev_handle, ssa +
        (clst - FAT_CLST_FIRST) * spc + offset % spc);
 
    return b;
}
 
static void fat_node_initialize(fat_node_t *node)
{
    node->idx = NULL;
    node->type = 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(bb)->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. */
static void *
fat_node_get(dev_handle_t dev_handle, fs_index_t index)
{
    return NULL;    /* TODO */
}
 
static void fat_node_put(void *node)
{
    /* TODO */
}
 
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->idx->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, 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 */
                fat_idx_t *idx = fat_idx_get_by_pos(
                    parentp->idx->dev_handle, parentp->firstc,
                    i * dps + j);
                if (!idx) {
                    /*
                     * Can happen if memory is low or if we
                     * run out of 32-bit indices.
                     */
                    block_put(b);
                    return NULL;
                }
                void *node = fat_node_get(idx->dev_handle,
                    idx->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->idx->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->idx->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, 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, FAT_CLST_RES1);
}
 
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 2881	Rev 2890
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	/** Hash table of FAT in-core nodes. */	56	/** Hash table of FAT in-core nodes. */
57	hash_table_t fin_hash;	57	hash_table_t fin_hash;
58		58
59	/** List of free FAT in-core nodes. */	59	/** List of free FAT in-core nodes. */
60	link_t ffn_head;	60	link_t ffn_head;
61		61
62	#define FAT_NAME_LEN 8	62	#define FAT_NAME_LEN 8
63	#define FAT_EXT_LEN 3	63	#define FAT_EXT_LEN 3
64		64
65	#define FAT_PAD ' '	65	#define FAT_PAD ' '
66		66
67	#define FAT_DENTRY_UNUSED 0x00	67	#define FAT_DENTRY_UNUSED 0x00
68	#define FAT_DENTRY_E5_ESC 0x05	68	#define FAT_DENTRY_E5_ESC 0x05
69	#define FAT_DENTRY_DOT 0x2e	69	#define FAT_DENTRY_DOT 0x2e
70	#define FAT_DENTRY_ERASED 0xe5	70	#define FAT_DENTRY_ERASED 0xe5
71		71
72	static void dentry_name_canonify(fat_dentry_t d, char buf)	72	static void dentry_name_canonify(fat_dentry_t d, char buf)
73	{	73	{
74	int i;	74	int i;
75		75
76	for (i = 0; i < FAT_NAME_LEN; i++) {	76	for (i = 0; i < FAT_NAME_LEN; i++) {
77	if (d->name[i] == FAT_PAD) {	77	if (d->name[i] == FAT_PAD) {
78	buf++;	78	buf++;
79	break;	79	break;
80	}	80	}
81	if (d->name[i] == FAT_DENTRY_E5_ESC)	81	if (d->name[i] == FAT_DENTRY_E5_ESC)
82	*buf++ = 0xe5;	82	*buf++ = 0xe5;
83	else	83	else
84	*buf++ = d->name[i];	84	*buf++ = d->name[i];
85	}	85	}
86	if (d->ext[0] != FAT_PAD)	86	if (d->ext[0] != FAT_PAD)
87	*buf++ = '.';	87	*buf++ = '.';
88	for (i = 0; i < FAT_EXT_LEN; i++) {	88	for (i = 0; i < FAT_EXT_LEN; i++) {
89	if (d->ext[i] == FAT_PAD) {	89	if (d->ext[i] == FAT_PAD) {
90	*buf = '\0';	90	*buf = '\0';
91	return;	91	return;
92	}	92	}
93	if (d->ext[i] == FAT_DENTRY_E5_ESC)	93	if (d->ext[i] == FAT_DENTRY_E5_ESC)
94	*buf++ = 0xe5;	94	*buf++ = 0xe5;
95	else	95	else
96	*buf++ = d->ext[i];	96	*buf++ = d->ext[i];
97	}	97	}
98	}	98	}
99		99
100	/* TODO and also move somewhere else */	100	/* TODO and also move somewhere else */
101	typedef struct {	101	typedef struct {
102	void *data;	102	void *data;
103	} block_t;	103	} block_t;
104		104
105	static block_t *block_get(dev_handle_t dev_handle, off_t offset)	105	static block_t *block_get(dev_handle_t dev_handle, off_t offset)
106	{	106	{
107	return NULL; /* TODO */	107	return NULL; /* TODO */
108	}	108	}
109		109
110	static void block_put(block_t *block)	110	static void block_put(block_t *block)
111	{	111	{
112	/* TODO */	112	/* TODO */
113	}	113	}
114		114
115	#define FAT_BS(b) ((fat_bs_t *)((b)->data))	115	#define FAT_BS(b) ((fat_bs_t *)((b)->data))
116		116
117	#define FAT_CLST_RES0 0x0000	117	#define FAT_CLST_RES0 0x0000
118	#define FAT_CLST_RES1 0x0001 /* internally used to mark root directory */	118	#define FAT_CLST_RES1 0x0001 /* internally used to mark root directory */
119	#define FAT_CLST_FIRST 0x0002	119	#define FAT_CLST_FIRST 0x0002
120	#define FAT_CLST_BAD 0xfff7	120	#define FAT_CLST_BAD 0xfff7
121	#define FAT_CLST_LAST1 0xfff8	121	#define FAT_CLST_LAST1 0xfff8
122	#define FAT_CLST_LAST8 0xffff	122	#define FAT_CLST_LAST8 0xffff
123		123
124	static block_t fat_block_get(fat_node_t nodep, off_t offset)	124	static block_t fat_block_get(fat_node_t nodep, off_t offset)
125	{	125	{
126	block_t *bb;	126	block_t *bb;
127	block_t *b;	127	block_t *b;
128	unsigned bps;	128	unsigned bps;
129	unsigned spc;	129	unsigned spc;
130	unsigned rscnt; /* block address of the first FAT */	130	unsigned rscnt; /* block address of the first FAT */
131	unsigned fatcnt;	131	unsigned fatcnt;
132	unsigned rde;	132	unsigned rde;
133	unsigned rds; /* root directory size */	133	unsigned rds; /* root directory size */
134	unsigned sf;	134	unsigned sf;
135	unsigned ssa; /* size of the system area */	135	unsigned ssa; /* size of the system area */
136	unsigned clusters;	136	unsigned clusters;
137	fat_cluster_t clst = nodep->firstc;	137	fat_cluster_t clst = nodep->firstc;
138	unsigned i;	138	unsigned i;
139		139
140	bb = block_get(nodep->idx->dev_handle, BS_BLOCK);	140	bb = block_get(nodep->idx->dev_handle, BS_BLOCK);
141	bps = uint16_t_le2host(FAT_BS(bb)->bps);	141	bps = uint16_t_le2host(FAT_BS(bb)->bps);
142	spc = FAT_BS(bb)->spc;	142	spc = FAT_BS(bb)->spc;
143	rscnt = uint16_t_le2host(FAT_BS(bb)->rscnt);	143	rscnt = uint16_t_le2host(FAT_BS(bb)->rscnt);
144	fatcnt = FAT_BS(bb)->fatcnt;	144	fatcnt = FAT_BS(bb)->fatcnt;
145	rde = uint16_t_le2host(FAT_BS(bb)->root_ent_max);	145	rde = uint16_t_le2host(FAT_BS(bb)->root_ent_max);
146	sf = uint16_t_le2host(FAT_BS(bb)->sec_per_fat);	146	sf = uint16_t_le2host(FAT_BS(bb)->sec_per_fat);
147	block_put(bb);	147	block_put(bb);
148		148
149	rds = (sizeof(fat_dentry_t) * rde) / bps;	149	rds = (sizeof(fat_dentry_t) * rde) / bps;
150	rds += ((sizeof(fat_dentry_t) * rde) % bps != 0);	150	rds += ((sizeof(fat_dentry_t) * rde) % bps != 0);
151	ssa = rscnt + fatcnt * sf + rds;	151	ssa = rscnt + fatcnt * sf + rds;
152		152
153	if (nodep->idx->index == FAT_CLST_RES1) {	153	if (nodep->idx->index == FAT_CLST_RES1) {
154	/* root directory special case */	154	/* root directory special case */
155	assert(offset < rds);	155	assert(offset < rds);
156	b = block_get(nodep->idx->dev_handle,	156	b = block_get(nodep->idx->dev_handle,
157	rscnt + fatcnt * sf + offset);	157	rscnt + fatcnt * sf + offset);
158	return b;	158	return b;
159	}	159	}
160		160
161	clusters = offset / spc;	161	clusters = offset / spc;
162	for (i = 0; i < clusters; i++) {	162	for (i = 0; i < clusters; i++) {
163	unsigned fsec; /* sector offset relative to FAT1 */	163	unsigned fsec; /* sector offset relative to FAT1 */
164	unsigned fidx; /* FAT1 entry index */	164	unsigned fidx; /* FAT1 entry index */
165		165
166	assert(clst >= FAT_CLST_FIRST && clst < FAT_CLST_BAD);	166	assert(clst >= FAT_CLST_FIRST && clst < FAT_CLST_BAD);
167	fsec = (clst * sizeof(fat_cluster_t)) / bps;	167	fsec = (clst * sizeof(fat_cluster_t)) / bps;
168	fidx = clst % (bps / sizeof(fat_cluster_t));	168	fidx = clst % (bps / sizeof(fat_cluster_t));
169	/* read FAT1 */	169	/* read FAT1 */
170	b = block_get(nodep->idx->dev_handle, rscnt + fsec);	170	b = block_get(nodep->idx->dev_handle, rscnt + fsec);
171	clst = uint16_t_le2host(((fat_cluster_t *)b->data)[fidx]);	171	clst = uint16_t_le2host(((fat_cluster_t *)b->data)[fidx]);
172	assert(clst != FAT_CLST_BAD);	172	assert(clst != FAT_CLST_BAD);
173	assert(clst < FAT_CLST_LAST1);	173	assert(clst < FAT_CLST_LAST1);
174	block_put(b);	174	block_put(b);
175	}	175	}
176		176
177	b = block_get(nodep->idx->dev_handle, ssa +	177	b = block_get(nodep->idx->dev_handle, ssa +
178	(clst - FAT_CLST_FIRST) * spc + offset % spc);	178	(clst - FAT_CLST_FIRST) * spc + offset % spc);
179		179
180	return b;	180	return b;
181	}	181	}
182		182
183	static void fat_node_initialize(fat_node_t *node)	183	static void fat_node_initialize(fat_node_t *node)
184	{	184	{
185	node->idx = NULL;	185	node->idx = NULL;
186	node->type = 0;	186	node->type = 0;
187	link_initialize(&node->fin_link);	187	link_initialize(&node->fin_link);
188	link_initialize(&node->ffn_link);	188	link_initialize(&node->ffn_link);
189	node->size = 0;	189	node->size = 0;
190	node->lnkcnt = 0;	190	node->lnkcnt = 0;
191	node->refcnt = 0;	191	node->refcnt = 0;
192	node->dirty = false;	192	node->dirty = false;
193	}	193	}
194		194
195	static uint16_t fat_bps_get(dev_handle_t dev_handle)	195	static uint16_t fat_bps_get(dev_handle_t dev_handle)
196	{	196	{
197	block_t *bb;	197	block_t *bb;
198	uint16_t bps;	198	uint16_t bps;
199		199
200	bb = block_get(dev_handle, BS_BLOCK);	200	bb = block_get(dev_handle, BS_BLOCK);
201	assert(bb != NULL);	201	assert(bb != NULL);
202	bps = uint16_t_le2host(FAT_BS(bb)->bps);	202	bps = uint16_t_le2host(FAT_BS(bb)->bps);
203	block_put(bb);	203	block_put(bb);
204		204
205	return bps;	205	return bps;
206	}	206	}
207		207
208	typedef enum {	208	typedef enum {
209	FAT_DENTRY_SKIP,	209	FAT_DENTRY_SKIP,
210	FAT_DENTRY_LAST,	210	FAT_DENTRY_LAST,
211	FAT_DENTRY_VALID	211	FAT_DENTRY_VALID
212	} fat_dentry_clsf_t;	212	} fat_dentry_clsf_t;
213		213
214	static fat_dentry_clsf_t fat_classify_dentry(fat_dentry_t *d)	214	static fat_dentry_clsf_t fat_classify_dentry(fat_dentry_t *d)
215	{	215	{
216	if (d->attr & FAT_ATTR_VOLLABEL) {	216	if (d->attr & FAT_ATTR_VOLLABEL) {
217	/* volume label entry */	217	/* volume label entry */
218	return FAT_DENTRY_SKIP;	218	return FAT_DENTRY_SKIP;
219	}	219	}
220	if (d->name[0] == FAT_DENTRY_ERASED) {	220	if (d->name[0] == FAT_DENTRY_ERASED) {
221	/* not-currently-used entry */	221	/* not-currently-used entry */
222	return FAT_DENTRY_SKIP;	222	return FAT_DENTRY_SKIP;
223	}	223	}
224	if (d->name[0] == FAT_DENTRY_UNUSED) {	224	if (d->name[0] == FAT_DENTRY_UNUSED) {
225	/* never used entry */	225	/* never used entry */
226	return FAT_DENTRY_LAST;	226	return FAT_DENTRY_LAST;
227	}	227	}
228	if (d->name[0] == FAT_DENTRY_DOT) {	228	if (d->name[0] == FAT_DENTRY_DOT) {
229	/*	229	/*
230	* Most likely '.' or '..'.	230	* Most likely '.' or '..'.
231	* It cannot occur in a regular file name.	231	* It cannot occur in a regular file name.
232	*/	232	*/
233	return FAT_DENTRY_SKIP;	233	return FAT_DENTRY_SKIP;
234	}	234	}
235	return FAT_DENTRY_VALID;	235	return FAT_DENTRY_VALID;
236	}	236	}
237		237
238	static void fat_sync_node(fat_node_t *node)	238	static void fat_sync_node(fat_node_t *node)
239	{	239	{
240	/* TODO */	240	/* TODO */
241	}	241	}
242		242
243	/** Instantiate a FAT in-core node. */	243	/** Instantiate a FAT in-core node. */
244	static void *	244	static void *
245	fat_node_get(dev_handle_t dev_handle, fs_index_t index)	245	fat_node_get(dev_handle_t dev_handle, fs_index_t index)
246	{	246	{
247	return NULL; /* TODO */	247	return NULL; /* TODO */
248	}	248	}
249		249
250	static void fat_node_put(void *node)	250	static void fat_node_put(void *node)
251	{	251	{
252	/* TODO */	252	/* TODO */
253	}	253	}
254		254
255	static void *fat_create(int flags)	255	static void *fat_create(int flags)
256	{	256	{
257	return NULL; /* not supported at the moment */	257	return NULL; /* not supported at the moment */
258	}	258	}
259		259
260	static int fat_destroy(void *node)	260	static int fat_destroy(void *node)
261	{	261	{
262	return ENOTSUP; /* not supported at the moment */	262	return ENOTSUP; /* not supported at the moment */
263	}	263	}
264		264
265	static bool fat_link(void prnt, void chld, const char *name)	265	static bool fat_link(void prnt, void chld, const char *name)
266	{	266	{
267	return false; /* not supported at the moment */	267	return false; /* not supported at the moment */
268	}	268	}
269		269
270	static int fat_unlink(void prnt, void chld)	270	static int fat_unlink(void prnt, void chld)
271	{	271	{
272	return ENOTSUP; /* not supported at the moment */	272	return ENOTSUP; /* not supported at the moment */
273	}	273	}
274		274
275	static void fat_match(void prnt, const char *component)	275	static void fat_match(void prnt, const char *component)
276	{	276	{
277	fat_node_t parentp = (fat_node_t )prnt;	277	fat_node_t parentp = (fat_node_t )prnt;
278	char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1];	278	char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1];
279	unsigned i, j;	279	unsigned i, j;
280	unsigned bps; /* bytes per sector */	280	unsigned bps; /* bytes per sector */
281	unsigned dps; /* dentries per sector */	281	unsigned dps; /* dentries per sector */
282	unsigned blocks;	282	unsigned blocks;
283	fat_dentry_t *d;	283	fat_dentry_t *d;
284	block_t *b;	284	block_t *b;
285		285
286	bps = fat_bps_get(parentp->idx->dev_handle);	286	bps = fat_bps_get(parentp->idx->dev_handle);
287	dps = bps / sizeof(fat_dentry_t);	287	dps = bps / sizeof(fat_dentry_t);
288	blocks = parentp->size / bps + (parentp->size % bps != 0);	288	blocks = parentp->size / bps + (parentp->size % bps != 0);
289	for (i = 0; i < blocks; i++) {	289	for (i = 0; i < blocks; i++) {
290	unsigned dentries;	290	unsigned dentries;
291		291
292	b = fat_block_get(parentp, i);	292	b = fat_block_get(parentp, i);
293	dentries = (i == blocks - 1) ?	293	dentries = (i == blocks - 1) ?
294	parentp->size % sizeof(fat_dentry_t) :	294	parentp->size % sizeof(fat_dentry_t) :
295	dps;	295	dps;
296	for (j = 0; j < dentries; j++) {	296	for (j = 0; j < dentries; j++) {
297	d = ((fat_dentry_t *)b->data) + j;	297	d = ((fat_dentry_t *)b->data) + j;
298	switch (fat_classify_dentry(d)) {	298	switch (fat_classify_dentry(d)) {
299	case FAT_DENTRY_SKIP:	299	case FAT_DENTRY_SKIP:
300	continue;	300	continue;
301	case FAT_DENTRY_LAST:	301	case FAT_DENTRY_LAST:
302	block_put(b);	302	block_put(b);
303	return NULL;	303	return NULL;
304	default:	304	default:
305	case FAT_DENTRY_VALID:	305	case FAT_DENTRY_VALID:
306	dentry_name_canonify(d, name);	306	dentry_name_canonify(d, name);
307	break;	307	break;
308	}	308	}
309	if (strcmp(name, component) == 0) {	309	if (strcmp(name, component) == 0) {
310	/* hit */	310	/* hit */
311	fat_idx_t *idx = fat_idx_map(	311	fat_idx_t *idx = fat_idx_get_by_pos(
312	parentp->idx->dev_handle, parentp->firstc,	312	parentp->idx->dev_handle, parentp->firstc,
313	i * dps + j);	313	i * dps + j);
-		314	if (!idx) {
-		315	/*
-		316	* Can happen if memory is low or if we
-		317	* run out of 32-bit indices.
-		318	*/
-		319	block_put(b);
-		320	return NULL;
-		321	}
314	void *node = fat_node_get(idx->dev_handle,	322	void *node = fat_node_get(idx->dev_handle,
315	idx->index);	323	idx->index);
316	block_put(b);	324	block_put(b);
317	return node;	325	return node;
318	}	326	}
319	}	327	}
320	block_put(b);	328	block_put(b);
321	}	329	}
322		330
323	return NULL;	331	return NULL;
324	}	332	}
325		333
326	static fs_index_t fat_index_get(void *node)	334	static fs_index_t fat_index_get(void *node)
327	{	335	{
328	fat_node_t fnodep = (fat_node_t )node;	336	fat_node_t fnodep = (fat_node_t )node;
329	if (!fnodep)	337	if (!fnodep)
330	return 0;	338	return 0;
331	return fnodep->idx->index;	339	return fnodep->idx->index;
332	}	340	}
333		341
334	static size_t fat_size_get(void *node)	342	static size_t fat_size_get(void *node)
335	{	343	{
336	return ((fat_node_t *)node)->size;	344	return ((fat_node_t *)node)->size;
337	}	345	}
338		346
339	static unsigned fat_lnkcnt_get(void *node)	347	static unsigned fat_lnkcnt_get(void *node)
340	{	348	{
341	return ((fat_node_t *)node)->lnkcnt;	349	return ((fat_node_t *)node)->lnkcnt;
342	}	350	}
343		351
344	static bool fat_has_children(void *node)	352	static bool fat_has_children(void *node)
345	{	353	{
346	fat_node_t nodep = (fat_node_t )node;	354	fat_node_t nodep = (fat_node_t )node;
347	unsigned bps;	355	unsigned bps;
348	unsigned dps;	356	unsigned dps;
349	unsigned blocks;	357	unsigned blocks;
350	block_t *b;	358	block_t *b;
351	unsigned i, j;	359	unsigned i, j;
352		360
353	if (nodep->type != FAT_DIRECTORY)	361	if (nodep->type != FAT_DIRECTORY)
354	return false;	362	return false;
355		363
356	bps = fat_bps_get(nodep->idx->dev_handle);	364	bps = fat_bps_get(nodep->idx->dev_handle);
357	dps = bps / sizeof(fat_dentry_t);	365	dps = bps / sizeof(fat_dentry_t);
358		366
359	blocks = nodep->size / bps + (nodep->size % bps != 0);	367	blocks = nodep->size / bps + (nodep->size % bps != 0);
360		368
361	for (i = 0; i < blocks; i++) {	369	for (i = 0; i < blocks; i++) {
362	unsigned dentries;	370	unsigned dentries;
363	fat_dentry_t *d;	371	fat_dentry_t *d;
364		372
365	b = fat_block_get(nodep, i);	373	b = fat_block_get(nodep, i);
366	dentries = (i == blocks - 1) ?	374	dentries = (i == blocks - 1) ?
367	nodep->size % sizeof(fat_dentry_t) :	375	nodep->size % sizeof(fat_dentry_t) :
368	dps;	376	dps;
369	for (j = 0; j < dentries; j++) {	377	for (j = 0; j < dentries; j++) {
370	d = ((fat_dentry_t *)b->data) + j;	378	d = ((fat_dentry_t *)b->data) + j;
371	switch (fat_classify_dentry(d)) {	379	switch (fat_classify_dentry(d)) {
372	case FAT_DENTRY_SKIP:	380	case FAT_DENTRY_SKIP:
373	continue;	381	continue;
374	case FAT_DENTRY_LAST:	382	case FAT_DENTRY_LAST:
375	block_put(b);	383	block_put(b);
376	return false;	384	return false;
377	default:	385	default:
378	case FAT_DENTRY_VALID:	386	case FAT_DENTRY_VALID:
379	block_put(b);	387	block_put(b);
380	return true;	388	return true;
381	}	389	}
382	block_put(b);	390	block_put(b);
383	return true;	391	return true;
384	}	392	}
385	block_put(b);	393	block_put(b);
386	}	394	}
387		395
388	return false;	396	return false;
389	}	397	}
390		398
391	static void *fat_root_get(dev_handle_t dev_handle)	399	static void *fat_root_get(dev_handle_t dev_handle)
392	{	400	{
393	return fat_node_get(dev_handle, FAT_CLST_RES1);	401	return fat_node_get(dev_handle, FAT_CLST_RES1);
394	}	402	}
395		403
396	static char fat_plb_get_char(unsigned pos)	404	static char fat_plb_get_char(unsigned pos)
397	{	405	{
398	return fat_reg.plb_ro[pos % PLB_SIZE];	406	return fat_reg.plb_ro[pos % PLB_SIZE];
399	}	407	}
400		408
401	static bool fat_is_directory(void *node)	409	static bool fat_is_directory(void *node)
402	{	410	{
403	return ((fat_node_t *)node)->type == FAT_DIRECTORY;	411	return ((fat_node_t *)node)->type == FAT_DIRECTORY;
404	}	412	}
405		413
406	static bool fat_is_file(void *node)	414	static bool fat_is_file(void *node)
407	{	415	{
408	return ((fat_node_t *)node)->type == FAT_FILE;	416	return ((fat_node_t *)node)->type == FAT_FILE;
409	}	417	}
410		418
411	/** libfs operations */	419	/** libfs operations */
412	libfs_ops_t fat_libfs_ops = {	420	libfs_ops_t fat_libfs_ops = {
413	.match = fat_match,	421	.match = fat_match,
414	.node_get = fat_node_get,	422	.node_get = fat_node_get,
415	.node_put = fat_node_put,	423	.node_put = fat_node_put,
416	.create = fat_create,	424	.create = fat_create,
417	.destroy = fat_destroy,	425	.destroy = fat_destroy,
418	.link = fat_link,	426	.link = fat_link,
419	.unlink = fat_unlink,	427	.unlink = fat_unlink,
420	.index_get = fat_index_get,	428	.index_get = fat_index_get,
421	.size_get = fat_size_get,	429	.size_get = fat_size_get,
422	.lnkcnt_get = fat_lnkcnt_get,	430	.lnkcnt_get = fat_lnkcnt_get,
423	.has_children = fat_has_children,	431	.has_children = fat_has_children,
424	.root_get = fat_root_get,	432	.root_get = fat_root_get,
425	.plb_get_char = fat_plb_get_char,	433	.plb_get_char = fat_plb_get_char,
426	.is_directory = fat_is_directory,	434	.is_directory = fat_is_directory,
427	.is_file = fat_is_file	435	.is_file = fat_is_file
428	};	436	};
429		437
430	void fat_lookup(ipc_callid_t rid, ipc_call_t *request)	438	void fat_lookup(ipc_callid_t rid, ipc_call_t *request)
431	{	439	{
432	libfs_lookup(&fat_libfs_ops, fat_reg.fs_handle, rid, request);	440	libfs_lookup(&fat_libfs_ops, fat_reg.fs_handle, rid, request);
433	}	441	}
434		442
435	/**	443	/**
436	* @}	444	* @}
437	*/	445	*/
438		446

Subversion Repositories HelenOS

(root)/branches/network/uspace/srv/fs/fat/fat_ops.c @ 4327 – Rev 2881 → 2890