WebSVN – HelenOS – Diff – /branches/dynload/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 "fat_dentry.h"
#include "fat_fat.h"
#include "../../vfs/vfs.h"
#include <libfs.h>
#include <libblock.h>
#include <ipc/ipc.h>
#include <ipc/services.h>
#include <ipc/devmap.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>
#include <sys/mman.h>
#include <align.h>
 
/** Futex protecting the list of cached free FAT nodes. */
static futex_t ffn_futex = FUTEX_INITIALIZER;
 
/** List of cached free FAT nodes. */
static LIST_INITIALIZE(ffn_head);
 
static void fat_node_initialize(fat_node_t *node)
{
    futex_initialize(&node->lock, 1);
    node->idx = NULL;
    node->type = 0;
    link_initialize(&node->ffn_link);
    node->size = 0;
    node->lnkcnt = 0;
    node->refcnt = 0;
    node->dirty = false;
}
 
static void fat_node_sync(fat_node_t *node)
{
    block_t *b;
    fat_bs_t *bs;
    fat_dentry_t *d;
    uint16_t bps;
    unsigned dps;
   
    assert(node->dirty);
 
    bs = block_bb_get(node->idx->dev_handle);
    bps = uint16_t_le2host(bs->bps);
    dps = bps / sizeof(fat_dentry_t);
   
    /* Read the block that contains the dentry of interest. */
    b = _fat_block_get(bs, node->idx->dev_handle, node->idx->pfc,
        (node->idx->pdi * sizeof(fat_dentry_t)) / bps);
 
    d = ((fat_dentry_t *)b->data) + (node->idx->pdi % dps);
 
    d->firstc = host2uint16_t_le(node->firstc);
    if (node->type == FAT_FILE)
        d->size = host2uint32_t_le(node->size);
    /* TODO: update other fields? (e.g time fields, attr field) */
   
    b->dirty = true;        /* need to sync block */
    block_put(b);
}
 
/** Internal version of fat_node_get().
 *
 * @param idxp      Locked index structure.
 */
static void *fat_node_get_core(fat_idx_t *idxp)
{
    block_t *b;
    fat_bs_t *bs;
    fat_dentry_t *d;
    fat_node_t *nodep = NULL;
    unsigned bps;
    unsigned spc;
    unsigned dps;
 
    if (idxp->nodep) {
        /*
         * We are lucky.
         * The node is already instantiated in memory.
         */
        futex_down(&idxp->nodep->lock);
        if (!idxp->nodep->refcnt++)
            list_remove(&idxp->nodep->ffn_link);
        futex_up(&idxp->nodep->lock);
        return idxp->nodep;
    }
 
    /*
     * We must instantiate the node from the file system.
     */
   
    assert(idxp->pfc);
 
    futex_down(&ffn_futex);
    if (!list_empty(&ffn_head)) {
        /* Try to use a cached free node structure. */
        fat_idx_t *idxp_tmp;
        nodep = list_get_instance(ffn_head.next, fat_node_t, ffn_link);
        if (futex_trydown(&nodep->lock) == ESYNCH_WOULD_BLOCK)
            goto skip_cache;
        idxp_tmp = nodep->idx;
        if (futex_trydown(&idxp_tmp->lock) == ESYNCH_WOULD_BLOCK) {
            futex_up(&nodep->lock);
            goto skip_cache;
        }
        list_remove(&nodep->ffn_link);
        futex_up(&ffn_futex);
        if (nodep->dirty)
            fat_node_sync(nodep);
        idxp_tmp->nodep = NULL;
        futex_up(&nodep->lock);
        futex_up(&idxp_tmp->lock);
    } else {
skip_cache:
        /* Try to allocate a new node structure. */
        futex_up(&ffn_futex);
        nodep = (fat_node_t *)malloc(sizeof(fat_node_t));
        if (!nodep)
            return NULL;
    }
    fat_node_initialize(nodep);
 
    bs = block_bb_get(idxp->dev_handle);
    bps = uint16_t_le2host(bs->bps);
    spc = bs->spc;
    dps = bps / sizeof(fat_dentry_t);
 
    /* Read the block that contains the dentry of interest. */
    b = _fat_block_get(bs, idxp->dev_handle, idxp->pfc,
        (idxp->pdi * sizeof(fat_dentry_t)) / bps);
    assert(b);
 
    d = ((fat_dentry_t *)b->data) + (idxp->pdi % dps);
    if (d->attr & FAT_ATTR_SUBDIR) {
        /*
         * The only directory which does not have this bit set is the
         * root directory itself. The root directory node is handled
         * and initialized elsewhere.
         */
        nodep->type = FAT_DIRECTORY;
        /*
         * Unfortunately, the 'size' field of the FAT dentry is not
         * defined for the directory entry type. We must determine the
         * size of the directory by walking the FAT.
         */
        nodep->size = bps * spc * fat_clusters_get(bs, idxp->dev_handle,
            uint16_t_le2host(d->firstc));
    } else {
        nodep->type = FAT_FILE;
        nodep->size = uint32_t_le2host(d->size);
    }
    nodep->firstc = uint16_t_le2host(d->firstc);
    nodep->lnkcnt = 1;
    nodep->refcnt = 1;
 
    block_put(b);
 
    /* Link the idx structure with the node structure. */
    nodep->idx = idxp;
    idxp->nodep = nodep;
 
    return nodep;
}
 
/** Instantiate a FAT in-core node. */
static void *fat_node_get(dev_handle_t dev_handle, fs_index_t index)
{
    void *node;
    fat_idx_t *idxp;
 
    idxp = fat_idx_get_by_index(dev_handle, index);
    if (!idxp)
        return NULL;
    /* idxp->lock held */
    node = fat_node_get_core(idxp);
    futex_up(&idxp->lock);
    return node;
}
 
static void fat_node_put(void *node)
{
    fat_node_t *nodep = (fat_node_t *)node;
 
    futex_down(&nodep->lock);
    if (!--nodep->refcnt) {
        futex_down(&ffn_futex);
        list_append(&nodep->ffn_link, &ffn_head);
        futex_up(&ffn_futex);
    }
    futex_up(&nodep->lock);
}
 
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_bs_t *bs;
    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;
 
    futex_down(&parentp->idx->lock);
    bs = block_bb_get(parentp->idx->dev_handle);
    bps = uint16_t_le2host(bs->bps);
    dps = bps / sizeof(fat_dentry_t);
    blocks = parentp->size / bps;
    for (i = 0; i < blocks; i++) {
        b = fat_block_get(bs, parentp, i);
        for (j = 0; j < dps; 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);
                futex_up(&parentp->idx->lock);
                return NULL;
            default:
            case FAT_DENTRY_VALID:
                dentry_name_canonify(d, name);
                break;
            }
            if (stricmp(name, component) == 0) {
                /* hit */
                void *node;
                /*
                 * Assume tree hierarchy for locking.  We
                 * already have the parent and now we are going
                 * to lock the child.  Never lock in the oposite
                 * order.
                 */
                fat_idx_t *idx = fat_idx_get_by_pos(
                    parentp->idx->dev_handle, parentp->firstc,
                    i * dps + j);
                futex_up(&parentp->idx->lock);
                if (!idx) {
                    /*
                     * Can happen if memory is low or if we
                     * run out of 32-bit indices.
                     */
                    block_put(b);
                    return NULL;
                }
                node = fat_node_get_core(idx);
                futex_up(&idx->lock);
                block_put(b);
                return node;
            }
        }
        block_put(b);
    }
 
    futex_up(&parentp->idx->lock);
    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_bs_t *bs;
    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;
   
    futex_down(&nodep->idx->lock);
    bs = block_bb_get(nodep->idx->dev_handle);
    bps = uint16_t_le2host(bs->bps);
    dps = bps / sizeof(fat_dentry_t);
 
    blocks = nodep->size / bps;
 
    for (i = 0; i < blocks; i++) {
        fat_dentry_t *d;
   
        b = fat_block_get(bs, nodep, i);
        for (j = 0; j < dps; 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);
                futex_up(&nodep->idx->lock);
                return false;
            default:
            case FAT_DENTRY_VALID:
                block_put(b);
                futex_up(&nodep->idx->lock);
                return true;
            }
            block_put(b);
            futex_up(&nodep->idx->lock);
            return true;
        }
        block_put(b);
    }
 
    futex_up(&nodep->idx->lock);
    return false;
}
 
static void *fat_root_get(dev_handle_t dev_handle)
{
    return fat_node_get(dev_handle, 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_mounted(ipc_callid_t rid, ipc_call_t *request)
{
    dev_handle_t dev_handle = (dev_handle_t) IPC_GET_ARG1(*request);
    fat_bs_t *bs;
    uint16_t bps;
    uint16_t rde;
    int rc;
 
    /* initialize libblock */
    rc = block_init(dev_handle, BS_SIZE);
    if (rc != EOK) {
        ipc_answer_0(rid, rc);
        return;
    }
 
    /* prepare the boot block */
    rc = block_bb_read(dev_handle, BS_BLOCK * BS_SIZE, BS_SIZE);
    if (rc != EOK) {
        block_fini(dev_handle);
        ipc_answer_0(rid, rc);
        return;
    }
 
    /* get the buffer with the boot sector */
    bs = block_bb_get(dev_handle);
   
    /* Read the number of root directory entries. */
    bps = uint16_t_le2host(bs->bps);
    rde = uint16_t_le2host(bs->root_ent_max);
 
    if (bps != BS_SIZE) {
        block_fini(dev_handle);
        ipc_answer_0(rid, ENOTSUP);
        return;
    }
 
    /* Initialize the block cache */
    rc = block_cache_init(dev_handle, bps, 0 /* XXX */);
    if (rc != EOK) {
        block_fini(dev_handle);
        ipc_answer_0(rid, rc);
        return;
    }
 
    rc = fat_idx_init_by_dev_handle(dev_handle);
    if (rc != EOK) {
        block_fini(dev_handle);
        ipc_answer_0(rid, rc);
        return;
    }
 
    /* Initialize the root node. */
    fat_node_t *rootp = (fat_node_t *)malloc(sizeof(fat_node_t));
    if (!rootp) {
        block_fini(dev_handle);
        fat_idx_fini_by_dev_handle(dev_handle);
        ipc_answer_0(rid, ENOMEM);
        return;
    }
    fat_node_initialize(rootp);
 
    fat_idx_t *ridxp = fat_idx_get_by_pos(dev_handle, FAT_CLST_ROOTPAR, 0);
    if (!ridxp) {
        block_fini(dev_handle);
        free(rootp);
        fat_idx_fini_by_dev_handle(dev_handle);
        ipc_answer_0(rid, ENOMEM);
        return;
    }
    assert(ridxp->index == 0);
    /* ridxp->lock held */
 
    rootp->type = FAT_DIRECTORY;
    rootp->firstc = FAT_CLST_ROOT;
    rootp->refcnt = 1;
    rootp->lnkcnt = 0;  /* FS root is not linked */
    rootp->size = rde * sizeof(fat_dentry_t);
    rootp->idx = ridxp;
    ridxp->nodep = rootp;
   
    futex_up(&ridxp->lock);
 
    ipc_answer_3(rid, EOK, ridxp->index, rootp->size, rootp->lnkcnt);
}
 
void fat_mount(ipc_callid_t rid, ipc_call_t *request)
{
    ipc_answer_0(rid, ENOTSUP);
}
 
void fat_lookup(ipc_callid_t rid, ipc_call_t *request)
{
    libfs_lookup(&fat_libfs_ops, fat_reg.fs_handle, rid, request);
}
 
void fat_read(ipc_callid_t rid, ipc_call_t *request)
{
    dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);
    fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request);
    off_t pos = (off_t)IPC_GET_ARG3(*request);
    fat_node_t *nodep = (fat_node_t *)fat_node_get(dev_handle, index);
    fat_bs_t *bs;
    uint16_t bps;
    size_t bytes;
    block_t *b;
 
    if (!nodep) {
        ipc_answer_0(rid, ENOENT);
        return;
    }
 
    ipc_callid_t callid;
    size_t len;
    if (!ipc_data_read_receive(&callid, &len)) {
        fat_node_put(nodep);
        ipc_answer_0(callid, EINVAL);
        ipc_answer_0(rid, EINVAL);
        return;
    }
 
    bs = block_bb_get(dev_handle);
    bps = uint16_t_le2host(bs->bps);
 
    if (nodep->type == FAT_FILE) {
        /*
         * Our strategy for regular file reads is to read one block at
         * most and make use of the possibility to return less data than
         * requested. This keeps the code very simple.
         */
        if (pos >= nodep->size) {
            /* reading beyond the EOF */
            bytes = 0;
            (void) ipc_data_read_finalize(callid, NULL, 0);
        } else {
            bytes = min(len, bps - pos % bps);
            bytes = min(bytes, nodep->size - pos);
            b = fat_block_get(bs, nodep, pos / bps);
            (void) ipc_data_read_finalize(callid, b->data + pos % bps,
                bytes);
            block_put(b);
        }
    } else {
        unsigned bnum;
        off_t spos = pos;
        char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1];
        fat_dentry_t *d;
 
        assert(nodep->type == FAT_DIRECTORY);
        assert(nodep->size % bps == 0);
        assert(bps % sizeof(fat_dentry_t) == 0);
 
        /*
         * Our strategy for readdir() is to use the position pointer as
         * an index into the array of all dentries. On entry, it points
         * to the first unread dentry. If we skip any dentries, we bump
         * the position pointer accordingly.
         */
        bnum = (pos * sizeof(fat_dentry_t)) / bps;
        while (bnum < nodep->size / bps) {
            off_t o;
 
            b = fat_block_get(bs, nodep, bnum);
            for (o = pos % (bps / sizeof(fat_dentry_t));
                o < bps / sizeof(fat_dentry_t);
                o++, pos++) {
                d = ((fat_dentry_t *)b->data) + o;
                switch (fat_classify_dentry(d)) {
                case FAT_DENTRY_SKIP:
                    continue;
                case FAT_DENTRY_LAST:
                    block_put(b);
                    goto miss;
                default:
                case FAT_DENTRY_VALID:
                    dentry_name_canonify(d, name);
                    block_put(b);
                    goto hit;
                }
            }
            block_put(b);
            bnum++;
        }
miss:
        fat_node_put(nodep);
        ipc_answer_0(callid, ENOENT);
        ipc_answer_1(rid, ENOENT, 0);
        return;
hit:
        (void) ipc_data_read_finalize(callid, name, strlen(name) + 1);
        bytes = (pos - spos) + 1;
    }
 
    fat_node_put(nodep);
    ipc_answer_1(rid, EOK, (ipcarg_t)bytes);
}
 
void fat_write(ipc_callid_t rid, ipc_call_t *request)
{
    dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);
    fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request);
    off_t pos = (off_t)IPC_GET_ARG3(*request);
    fat_node_t *nodep = (fat_node_t *)fat_node_get(dev_handle, index);
    fat_bs_t *bs;
    size_t bytes;
    block_t *b;
    uint16_t bps;
    unsigned spc;
    off_t boundary;
   
    if (!nodep) {
        ipc_answer_0(rid, ENOENT);
        return;
    }
   
 
 
 
 
 
 
 
    ipc_callid_t callid;
    size_t len;
    if (!ipc_data_write_receive(&callid, &len)) {
        fat_node_put(nodep);
        ipc_answer_0(callid, EINVAL);
        ipc_answer_0(rid, EINVAL);
        return;
    }
 
    /*
     * In all scenarios, we will attempt to write out only one block worth
     * of data at maximum. There might be some more efficient approaches,
     * but this one greatly simplifies fat_write(). Note that we can afford
     * to do this because the client must be ready to handle the return
     * value signalizing a smaller number of bytes written.
     */
    bytes = min(len, bps - pos % bps);
 
    bs = block_bb_get(dev_handle);
    bps = uint16_t_le2host(bs->bps);
    spc = bs->spc;
   
    boundary = ROUND_UP(nodep->size, bps * spc);
    if (pos < boundary) {
        /*
         * This is the easier case - we are either overwriting already
         * existing contents or writing behind the EOF, but still within
         * the limits of the last cluster. The node size may grow to the
         * next block size boundary.
         */
        fat_fill_gap(bs, nodep, FAT_CLST_RES0, pos);
        b = fat_block_get(bs, nodep, pos / bps);
        (void) ipc_data_write_finalize(callid, b->data + pos % bps,
            bytes);
        b->dirty = true;        /* need to sync block */
        block_put(b);
        if (pos + bytes > nodep->size) {
            nodep->size = pos + bytes;
            nodep->dirty = true;    /* need to sync node */
        }
        fat_node_put(nodep);
        ipc_answer_1(rid, EOK, bytes); 
        return;
    } else {
        /*
         * This is the more difficult case. We must allocate new
         * clusters for the node and zero them out.
         */
        int status;
        unsigned nclsts;
        fat_cluster_t mcl, lcl;
 
        nclsts = (ROUND_UP(pos + bytes, bps * spc) - boundary) /
            bps * spc;
        /* create an independent chain of nclsts clusters in all FATs */
        status = fat_alloc_clusters(bs, dev_handle, nclsts, &mcl,
            &lcl);
        if (status != EOK) {
            /* could not allocate a chain of nclsts clusters */
            fat_node_put(nodep);
            ipc_answer_0(callid, status);
            ipc_answer_0(rid, status);
            return;
        }
        /* zero fill any gaps */
        fat_fill_gap(bs, nodep, mcl, pos);
        b = _fat_block_get(bs, dev_handle, lcl, (pos / bps) % spc);
 
        (void) ipc_data_write_finalize(callid, b->data + pos % bps,
            bytes);
        b->dirty = true;        /* need to sync block */
        block_put(b);
        /*
         * Append the cluster chain starting in mcl to the end of the
         * node's cluster chain.
         */
        fat_append_clusters(bs, nodep, mcl);
        nodep->size = pos + bytes;
        nodep->dirty = true;        /* need to sync node */
        fat_node_put(nodep);
        ipc_answer_1(rid, EOK, bytes);
        return;
    }
}
 
void fat_truncate(ipc_callid_t rid, ipc_call_t *request)
{
    dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);
    fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request);
    size_t size = (off_t)IPC_GET_ARG3(*request);
    fat_node_t *nodep = (fat_node_t *)fat_node_get(dev_handle, index);
    int rc;
 
    if (!nodep) {
        ipc_answer_0(rid, ENOENT);
        return;
    }
 
    if (nodep->size == size) {
        rc = EOK;
    } else if (nodep->size < size) {
        /*
         * TODO: the standard says we have the freedom to grow the file.
         * For now, we simply return an error.
         */
        rc = EINVAL;
    } else {
        /*
         * The file is to be shrunk.
         */
        rc = ENOTSUP;   /* XXX */
    }
    fat_node_put(nodep);
    ipc_answer_0(rid, rc);
    return;
 
}
 
/**
 * @}
 */
 

Rev 3535	Rev 3561
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 "fat_dentry.h"	39	#include "fat_dentry.h"
40	#include "fat_fat.h"	40	#include "fat_fat.h"
41	#include "../../vfs/vfs.h"	41	#include "../../vfs/vfs.h"
42	#include <libfs.h>	42	#include <libfs.h>
43	#include <libblock.h>	43	#include <libblock.h>
44	#include <ipc/ipc.h>	44	#include <ipc/ipc.h>
45	#include <ipc/services.h>	45	#include <ipc/services.h>
46	#include <ipc/devmap.h>	46	#include <ipc/devmap.h>
47	#include <async.h>	47	#include <async.h>
48	#include <errno.h>	48	#include <errno.h>
49	#include <string.h>	49	#include <string.h>
50	#include <byteorder.h>	50	#include <byteorder.h>
51	#include <libadt/hash_table.h>	51	#include <libadt/hash_table.h>
52	#include <libadt/list.h>	52	#include <libadt/list.h>
53	#include <assert.h>	53	#include <assert.h>
54	#include <futex.h>	54	#include <futex.h>
55	#include <sys/mman.h>	55	#include <sys/mman.h>
56	#include <align.h>	56	#include <align.h>
57		57
58	/** Futex protecting the list of cached free FAT nodes. */	58	/** Futex protecting the list of cached free FAT nodes. */
59	static futex_t ffn_futex = FUTEX_INITIALIZER;	59	static futex_t ffn_futex = FUTEX_INITIALIZER;
60		60
61	/** List of cached free FAT nodes. */	61	/** List of cached free FAT nodes. */
62	static LIST_INITIALIZE(ffn_head);	62	static LIST_INITIALIZE(ffn_head);
63		63
64	static void fat_node_initialize(fat_node_t *node)	64	static void fat_node_initialize(fat_node_t *node)
65	{	65	{
66	futex_initialize(&node->lock, 1);	66	futex_initialize(&node->lock, 1);
67	node->idx = NULL;	67	node->idx = NULL;
68	node->type = 0;	68	node->type = 0;
69	link_initialize(&node->ffn_link);	69	link_initialize(&node->ffn_link);
70	node->size = 0;	70	node->size = 0;
71	node->lnkcnt = 0;	71	node->lnkcnt = 0;
72	node->refcnt = 0;	72	node->refcnt = 0;
73	node->dirty = false;	73	node->dirty = false;
74	}	74	}
75		75
76	static void fat_node_sync(fat_node_t *node)	76	static void fat_node_sync(fat_node_t *node)
77	{	77	{
78	block_t *b;	78	block_t *b;
79	fat_bs_t *bs;	79	fat_bs_t *bs;
80	fat_dentry_t *d;	80	fat_dentry_t *d;
81	uint16_t bps;	81	uint16_t bps;
82	unsigned dps;	82	unsigned dps;
83		83
84	assert(node->dirty);	84	assert(node->dirty);
85		85
86	bs = block_bb_get(node->idx->dev_handle);	86	bs = block_bb_get(node->idx->dev_handle);
87	bps = uint16_t_le2host(bs->bps);	87	bps = uint16_t_le2host(bs->bps);
88	dps = bps / sizeof(fat_dentry_t);	88	dps = bps / sizeof(fat_dentry_t);
89		89
90	/* Read the block that contains the dentry of interest. */	90	/* Read the block that contains the dentry of interest. */
91	b = _fat_block_get(bs, node->idx->dev_handle, node->idx->pfc,	91	b = _fat_block_get(bs, node->idx->dev_handle, node->idx->pfc,
92	(node->idx->pdi * sizeof(fat_dentry_t)) / bps);	92	(node->idx->pdi * sizeof(fat_dentry_t)) / bps);
93		93
94	d = ((fat_dentry_t *)b->data) + (node->idx->pdi % dps);	94	d = ((fat_dentry_t *)b->data) + (node->idx->pdi % dps);
95		95
96	d->firstc = host2uint16_t_le(node->firstc);	96	d->firstc = host2uint16_t_le(node->firstc);
97	if (node->type == FAT_FILE)	97	if (node->type == FAT_FILE)
98	d->size = host2uint32_t_le(node->size);	98	d->size = host2uint32_t_le(node->size);
99	/* TODO: update other fields? (e.g time fields, attr field) */	99	/* TODO: update other fields? (e.g time fields, attr field) */
100		100
101	b->dirty = true; /* need to sync block */	101	b->dirty = true; /* need to sync block */
102	block_put(b);	102	block_put(b);
103	}	103	}
104		104
105	/** Internal version of fat_node_get().	105	/** Internal version of fat_node_get().
106	*	106	*
107	* @param idxp Locked index structure.	107	* @param idxp Locked index structure.
108	*/	108	*/
109	static void fat_node_get_core(fat_idx_t idxp)	109	static void fat_node_get_core(fat_idx_t idxp)
110	{	110	{
111	block_t *b;	111	block_t *b;
112	fat_bs_t *bs;	112	fat_bs_t *bs;
113	fat_dentry_t *d;	113	fat_dentry_t *d;
114	fat_node_t *nodep = NULL;	114	fat_node_t *nodep = NULL;
115	unsigned bps;	115	unsigned bps;
-		116	unsigned spc;
116	unsigned dps;	117	unsigned dps;
117		118
118	if (idxp->nodep) {	119	if (idxp->nodep) {
119	/*	120	/*
120	* We are lucky.	121	* We are lucky.
121	* The node is already instantiated in memory.	122	* The node is already instantiated in memory.
122	*/	123	*/
123	futex_down(&idxp->nodep->lock);	124	futex_down(&idxp->nodep->lock);
124	if (!idxp->nodep->refcnt++)	125	if (!idxp->nodep->refcnt++)
125	list_remove(&idxp->nodep->ffn_link);	126	list_remove(&idxp->nodep->ffn_link);
126	futex_up(&idxp->nodep->lock);	127	futex_up(&idxp->nodep->lock);
127	return idxp->nodep;	128	return idxp->nodep;
128	}	129	}
129		130
130	/*	131	/*
131	* We must instantiate the node from the file system.	132	* We must instantiate the node from the file system.
132	*/	133	*/
133		134
134	assert(idxp->pfc);	135	assert(idxp->pfc);
135		136
136	futex_down(&ffn_futex);	137	futex_down(&ffn_futex);
137	if (!list_empty(&ffn_head)) {	138	if (!list_empty(&ffn_head)) {
138	/* Try to use a cached free node structure. */	139	/* Try to use a cached free node structure. */
139	fat_idx_t *idxp_tmp;	140	fat_idx_t *idxp_tmp;
140	nodep = list_get_instance(ffn_head.next, fat_node_t, ffn_link);	141	nodep = list_get_instance(ffn_head.next, fat_node_t, ffn_link);
141	if (futex_trydown(&nodep->lock) == ESYNCH_WOULD_BLOCK)	142	if (futex_trydown(&nodep->lock) == ESYNCH_WOULD_BLOCK)
142	goto skip_cache;	143	goto skip_cache;
143	idxp_tmp = nodep->idx;	144	idxp_tmp = nodep->idx;
144	if (futex_trydown(&idxp_tmp->lock) == ESYNCH_WOULD_BLOCK) {	145	if (futex_trydown(&idxp_tmp->lock) == ESYNCH_WOULD_BLOCK) {
145	futex_up(&nodep->lock);	146	futex_up(&nodep->lock);
146	goto skip_cache;	147	goto skip_cache;
147	}	148	}
148	list_remove(&nodep->ffn_link);	149	list_remove(&nodep->ffn_link);
149	futex_up(&ffn_futex);	150	futex_up(&ffn_futex);
150	if (nodep->dirty)	151	if (nodep->dirty)
151	fat_node_sync(nodep);	152	fat_node_sync(nodep);
152	idxp_tmp->nodep = NULL;	153	idxp_tmp->nodep = NULL;
153	futex_up(&nodep->lock);	154	futex_up(&nodep->lock);
154	futex_up(&idxp_tmp->lock);	155	futex_up(&idxp_tmp->lock);
155	} else {	156	} else {
156	skip_cache:	157	skip_cache:
157	/* Try to allocate a new node structure. */	158	/* Try to allocate a new node structure. */
158	futex_up(&ffn_futex);	159	futex_up(&ffn_futex);
159	nodep = (fat_node_t *)malloc(sizeof(fat_node_t));	160	nodep = (fat_node_t *)malloc(sizeof(fat_node_t));
160	if (!nodep)	161	if (!nodep)
161	return NULL;	162	return NULL;
162	}	163	}
163	fat_node_initialize(nodep);	164	fat_node_initialize(nodep);
164		165
165	bs = block_bb_get(idxp->dev_handle);	166	bs = block_bb_get(idxp->dev_handle);
166	bps = uint16_t_le2host(bs->bps);	167	bps = uint16_t_le2host(bs->bps);
-		168	spc = bs->spc;
167	dps = bps / sizeof(fat_dentry_t);	169	dps = bps / sizeof(fat_dentry_t);
168		170
169	/* Read the block that contains the dentry of interest. */	171	/* Read the block that contains the dentry of interest. */
170	b = _fat_block_get(bs, idxp->dev_handle, idxp->pfc,	172	b = _fat_block_get(bs, idxp->dev_handle, idxp->pfc,
171	(idxp->pdi * sizeof(fat_dentry_t)) / bps);	173	(idxp->pdi * sizeof(fat_dentry_t)) / bps);
172	assert(b);	174	assert(b);
173		175
174	d = ((fat_dentry_t *)b->data) + (idxp->pdi % dps);	176	d = ((fat_dentry_t *)b->data) + (idxp->pdi % dps);
175	if (d->attr & FAT_ATTR_SUBDIR) {	177	if (d->attr & FAT_ATTR_SUBDIR) {
176	/*	178	/*
177	* The only directory which does not have this bit set is the	179	* The only directory which does not have this bit set is the
178	* root directory itself. The root directory node is handled	180	* root directory itself. The root directory node is handled
179	* and initialized elsewhere.	181	* and initialized elsewhere.
180	*/	182	*/
181	nodep->type = FAT_DIRECTORY;	183	nodep->type = FAT_DIRECTORY;
182	/*	184	/*
183	* Unfortunately, the 'size' field of the FAT dentry is not	185	* Unfortunately, the 'size' field of the FAT dentry is not
184	* defined for the directory entry type. We must determine the	186	* defined for the directory entry type. We must determine the
185	* size of the directory by walking the FAT.	187	* size of the directory by walking the FAT.
186	*/	188	*/
187	nodep->size = bps * _fat_blcks_get(bs, idxp->dev_handle,	189	nodep->size = bps * spc * fat_clusters_get(bs, idxp->dev_handle,
188	uint16_t_le2host(d->firstc), NULL);	190	uint16_t_le2host(d->firstc));
189	} else {	191	} else {
190	nodep->type = FAT_FILE;	192	nodep->type = FAT_FILE;
191	nodep->size = uint32_t_le2host(d->size);	193	nodep->size = uint32_t_le2host(d->size);
192	}	194	}
193	nodep->firstc = uint16_t_le2host(d->firstc);	195	nodep->firstc = uint16_t_le2host(d->firstc);
194	nodep->lnkcnt = 1;	196	nodep->lnkcnt = 1;
195	nodep->refcnt = 1;	197	nodep->refcnt = 1;
196		198
197	block_put(b);	199	block_put(b);
198		200
199	/* Link the idx structure with the node structure. */	201	/* Link the idx structure with the node structure. */
200	nodep->idx = idxp;	202	nodep->idx = idxp;
201	idxp->nodep = nodep;	203	idxp->nodep = nodep;
202		204
203	return nodep;	205	return nodep;
204	}	206	}
205		207
206	/** Instantiate a FAT in-core node. */	208	/** Instantiate a FAT in-core node. */
207	static void *fat_node_get(dev_handle_t dev_handle, fs_index_t index)	209	static void *fat_node_get(dev_handle_t dev_handle, fs_index_t index)
208	{	210	{
209	void *node;	211	void *node;
210	fat_idx_t *idxp;	212	fat_idx_t *idxp;
211		213
212	idxp = fat_idx_get_by_index(dev_handle, index);	214	idxp = fat_idx_get_by_index(dev_handle, index);
213	if (!idxp)	215	if (!idxp)
214	return NULL;	216	return NULL;
215	/* idxp->lock held */	217	/* idxp->lock held */
216	node = fat_node_get_core(idxp);	218	node = fat_node_get_core(idxp);
217	futex_up(&idxp->lock);	219	futex_up(&idxp->lock);
218	return node;	220	return node;
219	}	221	}
220		222
221	static void fat_node_put(void *node)	223	static void fat_node_put(void *node)
222	{	224	{
223	fat_node_t nodep = (fat_node_t )node;	225	fat_node_t nodep = (fat_node_t )node;
224		226
225	futex_down(&nodep->lock);	227	futex_down(&nodep->lock);
226	if (!--nodep->refcnt) {	228	if (!--nodep->refcnt) {
227	futex_down(&ffn_futex);	229	futex_down(&ffn_futex);
228	list_append(&nodep->ffn_link, &ffn_head);	230	list_append(&nodep->ffn_link, &ffn_head);
229	futex_up(&ffn_futex);	231	futex_up(&ffn_futex);
230	}	232	}
231	futex_up(&nodep->lock);	233	futex_up(&nodep->lock);
232	}	234	}
233		235
234	static void *fat_create(int flags)	236	static void *fat_create(int flags)
235	{	237	{
236	return NULL; /* not supported at the moment */	238	return NULL; /* not supported at the moment */
237	}	239	}
238		240
239	static int fat_destroy(void *node)	241	static int fat_destroy(void *node)
240	{	242	{
241	return ENOTSUP; /* not supported at the moment */	243	return ENOTSUP; /* not supported at the moment */
242	}	244	}
243		245
244	static bool fat_link(void prnt, void chld, const char *name)	246	static bool fat_link(void prnt, void chld, const char *name)
245	{	247	{
246	return false; /* not supported at the moment */	248	return false; /* not supported at the moment */
247	}	249	}
248		250
249	static int fat_unlink(void prnt, void chld)	251	static int fat_unlink(void prnt, void chld)
250	{	252	{
251	return ENOTSUP; /* not supported at the moment */	253	return ENOTSUP; /* not supported at the moment */
252	}	254	}
253		255
254	static void fat_match(void prnt, const char *component)	256	static void fat_match(void prnt, const char *component)
255	{	257	{
256	fat_bs_t *bs;	258	fat_bs_t *bs;
257	fat_node_t parentp = (fat_node_t )prnt;	259	fat_node_t parentp = (fat_node_t )prnt;
258	char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1];	260	char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1];
259	unsigned i, j;	261	unsigned i, j;
260	unsigned bps; /* bytes per sector */	262	unsigned bps; /* bytes per sector */
261	unsigned dps; /* dentries per sector */	263	unsigned dps; /* dentries per sector */
262	unsigned blocks;	264	unsigned blocks;
263	fat_dentry_t *d;	265	fat_dentry_t *d;
264	block_t *b;	266	block_t *b;
265		267
266	futex_down(&parentp->idx->lock);	268	futex_down(&parentp->idx->lock);
267	bs = block_bb_get(parentp->idx->dev_handle);	269	bs = block_bb_get(parentp->idx->dev_handle);
268	bps = uint16_t_le2host(bs->bps);	270	bps = uint16_t_le2host(bs->bps);
269	dps = bps / sizeof(fat_dentry_t);	271	dps = bps / sizeof(fat_dentry_t);
270	blocks = parentp->size / bps;	272	blocks = parentp->size / bps;
271	for (i = 0; i < blocks; i++) {	273	for (i = 0; i < blocks; i++) {
272	b = fat_block_get(bs, parentp, i);	274	b = fat_block_get(bs, parentp, i);
273	for (j = 0; j < dps; j++) {	275	for (j = 0; j < dps; j++) {
274	d = ((fat_dentry_t *)b->data) + j;	276	d = ((fat_dentry_t *)b->data) + j;
275	switch (fat_classify_dentry(d)) {	277	switch (fat_classify_dentry(d)) {
276	case FAT_DENTRY_SKIP:	278	case FAT_DENTRY_SKIP:
277	continue;	279	continue;
278	case FAT_DENTRY_LAST:	280	case FAT_DENTRY_LAST:
279	block_put(b);	281	block_put(b);
280	futex_up(&parentp->idx->lock);	282	futex_up(&parentp->idx->lock);
281	return NULL;	283	return NULL;
282	default:	284	default:
283	case FAT_DENTRY_VALID:	285	case FAT_DENTRY_VALID:
284	dentry_name_canonify(d, name);	286	dentry_name_canonify(d, name);
285	break;	287	break;
286	}	288	}
287	if (stricmp(name, component) == 0) {	289	if (stricmp(name, component) == 0) {
288	/* hit */	290	/* hit */
289	void *node;	291	void *node;
290	/*	292	/*
291	* Assume tree hierarchy for locking. We	293	* Assume tree hierarchy for locking. We
292	* already have the parent and now we are going	294	* already have the parent and now we are going
293	* to lock the child. Never lock in the oposite	295	* to lock the child. Never lock in the oposite
294	* order.	296	* order.
295	*/	297	*/
296	fat_idx_t *idx = fat_idx_get_by_pos(	298	fat_idx_t *idx = fat_idx_get_by_pos(
297	parentp->idx->dev_handle, parentp->firstc,	299	parentp->idx->dev_handle, parentp->firstc,
298	i * dps + j);	300	i * dps + j);
299	futex_up(&parentp->idx->lock);	301	futex_up(&parentp->idx->lock);
300	if (!idx) {	302	if (!idx) {
301	/*	303	/*
302	* Can happen if memory is low or if we	304	* Can happen if memory is low or if we
303	* run out of 32-bit indices.	305	* run out of 32-bit indices.
304	*/	306	*/
305	block_put(b);	307	block_put(b);
306	return NULL;	308	return NULL;
307	}	309	}
308	node = fat_node_get_core(idx);	310	node = fat_node_get_core(idx);
309	futex_up(&idx->lock);	311	futex_up(&idx->lock);
310	block_put(b);	312	block_put(b);
311	return node;	313	return node;
312	}	314	}
313	}	315	}
314	block_put(b);	316	block_put(b);
315	}	317	}
316		318
317	futex_up(&parentp->idx->lock);	319	futex_up(&parentp->idx->lock);
318	return NULL;	320	return NULL;
319	}	321	}
320		322
321	static fs_index_t fat_index_get(void *node)	323	static fs_index_t fat_index_get(void *node)
322	{	324	{
323	fat_node_t fnodep = (fat_node_t )node;	325	fat_node_t fnodep = (fat_node_t )node;
324	if (!fnodep)	326	if (!fnodep)
325	return 0;	327	return 0;
326	return fnodep->idx->index;	328	return fnodep->idx->index;
327	}	329	}
328		330
329	static size_t fat_size_get(void *node)	331	static size_t fat_size_get(void *node)
330	{	332	{
331	return ((fat_node_t *)node)->size;	333	return ((fat_node_t *)node)->size;
332	}	334	}
333		335
334	static unsigned fat_lnkcnt_get(void *node)	336	static unsigned fat_lnkcnt_get(void *node)
335	{	337	{
336	return ((fat_node_t *)node)->lnkcnt;	338	return ((fat_node_t *)node)->lnkcnt;
337	}	339	}
338		340
339	static bool fat_has_children(void *node)	341	static bool fat_has_children(void *node)
340	{	342	{
341	fat_bs_t *bs;	343	fat_bs_t *bs;
342	fat_node_t nodep = (fat_node_t )node;	344	fat_node_t nodep = (fat_node_t )node;
343	unsigned bps;	345	unsigned bps;
344	unsigned dps;	346	unsigned dps;
345	unsigned blocks;	347	unsigned blocks;
346	block_t *b;	348	block_t *b;
347	unsigned i, j;	349	unsigned i, j;
348		350
349	if (nodep->type != FAT_DIRECTORY)	351	if (nodep->type != FAT_DIRECTORY)
350	return false;	352	return false;
351		353
352	futex_down(&nodep->idx->lock);	354	futex_down(&nodep->idx->lock);
353	bs = block_bb_get(nodep->idx->dev_handle);	355	bs = block_bb_get(nodep->idx->dev_handle);
354	bps = uint16_t_le2host(bs->bps);	356	bps = uint16_t_le2host(bs->bps);
355	dps = bps / sizeof(fat_dentry_t);	357	dps = bps / sizeof(fat_dentry_t);
356		358
357	blocks = nodep->size / bps;	359	blocks = nodep->size / bps;
358		360
359	for (i = 0; i < blocks; i++) {	361	for (i = 0; i < blocks; i++) {
360	fat_dentry_t *d;	362	fat_dentry_t *d;
361		363
362	b = fat_block_get(bs, nodep, i);	364	b = fat_block_get(bs, nodep, i);
363	for (j = 0; j < dps; j++) {	365	for (j = 0; j < dps; j++) {
364	d = ((fat_dentry_t *)b->data) + j;	366	d = ((fat_dentry_t *)b->data) + j;
365	switch (fat_classify_dentry(d)) {	367	switch (fat_classify_dentry(d)) {
366	case FAT_DENTRY_SKIP:	368	case FAT_DENTRY_SKIP:
367	continue;	369	continue;
368	case FAT_DENTRY_LAST:	370	case FAT_DENTRY_LAST:
369	block_put(b);	371	block_put(b);
370	futex_up(&nodep->idx->lock);	372	futex_up(&nodep->idx->lock);
371	return false;	373	return false;
372	default:	374	default:
373	case FAT_DENTRY_VALID:	375	case FAT_DENTRY_VALID:
374	block_put(b);	376	block_put(b);
375	futex_up(&nodep->idx->lock);	377	futex_up(&nodep->idx->lock);
376	return true;	378	return true;
377	}	379	}
378	block_put(b);	380	block_put(b);
379	futex_up(&nodep->idx->lock);	381	futex_up(&nodep->idx->lock);
380	return true;	382	return true;
381	}	383	}
382	block_put(b);	384	block_put(b);
383	}	385	}
384		386
385	futex_up(&nodep->idx->lock);	387	futex_up(&nodep->idx->lock);
386	return false;	388	return false;
387	}	389	}
388		390
389	static void *fat_root_get(dev_handle_t dev_handle)	391	static void *fat_root_get(dev_handle_t dev_handle)
390	{	392	{
391	return fat_node_get(dev_handle, 0);	393	return fat_node_get(dev_handle, 0);
392	}	394	}
393		395
394	static char fat_plb_get_char(unsigned pos)	396	static char fat_plb_get_char(unsigned pos)
395	{	397	{
396	return fat_reg.plb_ro[pos % PLB_SIZE];	398	return fat_reg.plb_ro[pos % PLB_SIZE];
397	}	399	}
398		400
399	static bool fat_is_directory(void *node)	401	static bool fat_is_directory(void *node)
400	{	402	{
401	return ((fat_node_t *)node)->type == FAT_DIRECTORY;	403	return ((fat_node_t *)node)->type == FAT_DIRECTORY;
402	}	404	}
403		405
404	static bool fat_is_file(void *node)	406	static bool fat_is_file(void *node)
405	{	407	{
406	return ((fat_node_t *)node)->type == FAT_FILE;	408	return ((fat_node_t *)node)->type == FAT_FILE;
407	}	409	}
408		410
409	/** libfs operations */	411	/** libfs operations */
410	libfs_ops_t fat_libfs_ops = {	412	libfs_ops_t fat_libfs_ops = {
411	.match = fat_match,	413	.match = fat_match,
412	.node_get = fat_node_get,	414	.node_get = fat_node_get,
413	.node_put = fat_node_put,	415	.node_put = fat_node_put,
414	.create = fat_create,	416	.create = fat_create,
415	.destroy = fat_destroy,	417	.destroy = fat_destroy,
416	.link = fat_link,	418	.link = fat_link,
417	.unlink = fat_unlink,	419	.unlink = fat_unlink,
418	.index_get = fat_index_get,	420	.index_get = fat_index_get,
419	.size_get = fat_size_get,	421	.size_get = fat_size_get,
420	.lnkcnt_get = fat_lnkcnt_get,	422	.lnkcnt_get = fat_lnkcnt_get,
421	.has_children = fat_has_children,	423	.has_children = fat_has_children,
422	.root_get = fat_root_get,	424	.root_get = fat_root_get,
423	.plb_get_char = fat_plb_get_char,	425	.plb_get_char = fat_plb_get_char,
424	.is_directory = fat_is_directory,	426	.is_directory = fat_is_directory,
425	.is_file = fat_is_file	427	.is_file = fat_is_file
426	};	428	};
427		429
428	void fat_mounted(ipc_callid_t rid, ipc_call_t *request)	430	void fat_mounted(ipc_callid_t rid, ipc_call_t *request)
429	{	431	{
430	dev_handle_t dev_handle = (dev_handle_t) IPC_GET_ARG1(*request);	432	dev_handle_t dev_handle = (dev_handle_t) IPC_GET_ARG1(*request);
431	fat_bs_t *bs;	433	fat_bs_t *bs;
432	uint16_t bps;	434	uint16_t bps;
433	uint16_t rde;	435	uint16_t rde;
434	int rc;	436	int rc;
435		437
436	/* initialize libblock */	438	/* initialize libblock */
437	rc = block_init(dev_handle, BS_SIZE, BS_BLOCK * BS_SIZE, BS_SIZE);	439	rc = block_init(dev_handle, BS_SIZE);
438	if (rc != EOK) {	440	if (rc != EOK) {
439	ipc_answer_0(rid, 0);	441	ipc_answer_0(rid, rc);
-		442	return;
-		443	}
-		444
-		445	/* prepare the boot block */
-		446	rc = block_bb_read(dev_handle, BS_BLOCK * BS_SIZE, BS_SIZE);
-		447	if (rc != EOK) {
-		448	block_fini(dev_handle);
-		449	ipc_answer_0(rid, rc);
440	return;	450	return;
441	}	451	}
442		452
443	/* get the buffer with the boot sector */	453	/* get the buffer with the boot sector */
444	bs = block_bb_get(dev_handle);	454	bs = block_bb_get(dev_handle);
445		455
446	/* Read the number of root directory entries. */	456	/* Read the number of root directory entries. */
447	bps = uint16_t_le2host(bs->bps);	457	bps = uint16_t_le2host(bs->bps);
448	rde = uint16_t_le2host(bs->root_ent_max);	458	rde = uint16_t_le2host(bs->root_ent_max);
449		459
450	if (bps != BS_SIZE) {	460	if (bps != BS_SIZE) {
451	block_fini(dev_handle);	461	block_fini(dev_handle);
452	ipc_answer_0(rid, ENOTSUP);	462	ipc_answer_0(rid, ENOTSUP);
453	return;	463	return;
454	}	464	}
455		465
-		466	/* Initialize the block cache */
-		467	rc = block_cache_init(dev_handle, bps, 0 /* XXX */);
-		468	if (rc != EOK) {
-		469	block_fini(dev_handle);
-		470	ipc_answer_0(rid, rc);
-		471	return;
-		472	}
-		473
456	rc = fat_idx_init_by_dev_handle(dev_handle);	474	rc = fat_idx_init_by_dev_handle(dev_handle);
457	if (rc != EOK) {	475	if (rc != EOK) {
458	block_fini(dev_handle);	476	block_fini(dev_handle);
459	ipc_answer_0(rid, rc);	477	ipc_answer_0(rid, rc);
460	return;	478	return;
461	}	479	}
462		480
463	/* Initialize the root node. */	481	/* Initialize the root node. */
464	fat_node_t rootp = (fat_node_t )malloc(sizeof(fat_node_t));	482	fat_node_t rootp = (fat_node_t )malloc(sizeof(fat_node_t));
465	if (!rootp) {	483	if (!rootp) {
466	block_fini(dev_handle);	484	block_fini(dev_handle);
467	fat_idx_fini_by_dev_handle(dev_handle);	485	fat_idx_fini_by_dev_handle(dev_handle);
468	ipc_answer_0(rid, ENOMEM);	486	ipc_answer_0(rid, ENOMEM);
469	return;	487	return;
470	}	488	}
471	fat_node_initialize(rootp);	489	fat_node_initialize(rootp);
472		490
473	fat_idx_t *ridxp = fat_idx_get_by_pos(dev_handle, FAT_CLST_ROOTPAR, 0);	491	fat_idx_t *ridxp = fat_idx_get_by_pos(dev_handle, FAT_CLST_ROOTPAR, 0);
474	if (!ridxp) {	492	if (!ridxp) {
475	block_fini(dev_handle);	493	block_fini(dev_handle);
476	free(rootp);	494	free(rootp);
477	fat_idx_fini_by_dev_handle(dev_handle);	495	fat_idx_fini_by_dev_handle(dev_handle);
478	ipc_answer_0(rid, ENOMEM);	496	ipc_answer_0(rid, ENOMEM);
479	return;	497	return;
480	}	498	}
481	assert(ridxp->index == 0);	499	assert(ridxp->index == 0);
482	/* ridxp->lock held */	500	/* ridxp->lock held */

Subversion Repositories HelenOS

(root)/branches/dynload/uspace/srv/fs/fat/fat_ops.c – Rev 3535 → 3561