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 "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, BLOCK_FLAGS_NONE);
 
    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);
    } else if (node->type == FAT_DIRECTORY) {
        d->attr = FAT_ATTR_SUBDIR;
    }
   
    /* TODO: update other fields? (e.g time fields) */
   
    b->dirty = true;        /* need to sync block */
    block_put(b);
}
 
static fat_node_t *fat_node_get_new(void)
{
    fat_node_t *nodep;
 
    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);
   
    return nodep;
}
 
/** 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);
 
    nodep = fat_node_get_new();
    if (!nodep)
        return NULL;
 
    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, BLOCK_FLAGS_NONE);
    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;
}
 
/*
 * Forward declarations of FAT libfs operations.
 */
static void *fat_node_get(dev_handle_t, fs_index_t);
static void fat_node_put(void *);
static void *fat_create_node(dev_handle_t, int);
static int fat_destroy_node(void *);
static int fat_link(void *, void *, const char *);
static int fat_unlink(void *, void *);
static void *fat_match(void *, const char *);
static fs_index_t fat_index_get(void *);
static size_t fat_size_get(void *);
static unsigned fat_lnkcnt_get(void *);
static bool fat_has_children(void *);
static void *fat_root_get(dev_handle_t);
static char fat_plb_get_char(unsigned);
static bool fat_is_directory(void *);
static bool fat_is_file(void *node);
 
/*
 * FAT libfs operations.
 */
 
/** Instantiate a FAT in-core node. */
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;
}
 
void fat_node_put(void *node)
{
    fat_node_t *nodep = (fat_node_t *)node;
    bool destroy = false;
 
    futex_down(&nodep->lock);
    if (!--nodep->refcnt) {
        if (nodep->idx) {
            futex_down(&ffn_futex);
            list_append(&nodep->ffn_link, &ffn_head);
            futex_up(&ffn_futex);
        } else {
            /*
             * The node does not have any index structure associated
             * with itself. This can only mean that we are releasing
             * the node after a failed attempt to allocate the index
             * structure for it.
             */
            destroy = true;
        }
    }
    futex_up(&nodep->lock);
    if (destroy)
        free(node);
}
 
void *fat_create_node(dev_handle_t dev_handle, int flags)
{
    fat_idx_t *idxp;
    fat_node_t *nodep;
    fat_bs_t *bs;
    fat_cluster_t mcl, lcl;
    uint16_t bps;
    int rc;
 
    bs = block_bb_get(dev_handle);
    bps = uint16_t_le2host(bs->bps);
    if (flags & L_DIRECTORY) {
        /* allocate a cluster */
        rc = fat_alloc_clusters(bs, dev_handle, 1, &mcl, &lcl);
        if (rc != EOK)
            return NULL;
    }
 
    nodep = fat_node_get_new();
    if (!nodep) {
        fat_free_clusters(bs, dev_handle, mcl);
        return NULL;
    }
    idxp = fat_idx_get_new(dev_handle);
    if (!idxp) {
        fat_free_clusters(bs, dev_handle, mcl);
        fat_node_put(nodep);
        return NULL;
    }
    /* idxp->lock held */
    if (flags & L_DIRECTORY) {
        int i;
        block_t *b;
 
        /*
         * Populate the new cluster with unused dentries.
         * We don't create the '.' and '..' entries, since they are
         * optional and HelenOS VFS does not need them.
         */
        for (i = 0; i < bs->spc; i++) {
            b = _fat_block_get(bs, dev_handle, mcl, i,
                BLOCK_FLAGS_NOREAD);
            /* mark all dentries as never-used */
            memset(b->data, 0, bps);
            b->dirty = false;
            block_put(b);
        }
        nodep->type = FAT_DIRECTORY;
        nodep->firstc = mcl;
        nodep->size = bps * bs->spc;
    } else {
        nodep->type = FAT_FILE;
        nodep->firstc = FAT_CLST_RES0;
        nodep->size = 0;
    }
 
 
    nodep->lnkcnt = 0;  /* not linked anywhere */
    nodep->refcnt = 1;
    nodep->dirty = true;
 
    nodep->idx = idxp;
    idxp->nodep = nodep;
 
    futex_up(&idxp->lock);
    return nodep;
}
 
int fat_destroy_node(void *node)
{
    fat_node_t *nodep = (fat_node_t *)node;
    fat_bs_t *bs;
 
    /*
     * The node is not reachable from the file system. This means that the
     * link count should be zero and that the index structure cannot be
     * found in the position hash. Obviously, we don't need to lock the node
     * nor its index structure.
     */
    assert(nodep->lnkcnt == 0);
 
    /*
     * The node may not have any children.
     */
    assert(fat_has_children(node) == false);
 
    bs = block_bb_get(nodep->idx->dev_handle);
    if (nodep->firstc != FAT_CLST_RES0) {
        assert(nodep->size);
        /* Free all clusters allocated to the node. */
        fat_free_clusters(bs, nodep->idx->dev_handle, nodep->firstc);
    }
 
    fat_idx_destroy(nodep->idx);
    free(nodep);
    return EOK;
}
 
int fat_link(void *prnt, void *chld, const char *name)
{
    fat_node_t *parentp = (fat_node_t *)prnt;
    fat_node_t *childp = (fat_node_t *)chld;
    fat_dentry_t *d;
    fat_bs_t *bs;
    block_t *b;
    int i, j;
    uint16_t bps;
    unsigned dps;
    unsigned blocks;
 
    futex_down(&childp->lock);
    if (childp->lnkcnt == 1) {
        /*
         * On FAT, we don't support multiple hard links.
         */
        futex_up(&childp->lock);
        return EMLINK;
    }
    assert(childp->lnkcnt == 0);
    futex_up(&childp->lock);
 
    if (!fat_dentry_name_verify(name)) {
        /*
         * Attempt to create unsupported name.
         */
        return ENOTSUP;
    }
 
    /*
     * Get us an unused parent node's dentry or grow the parent and allocate
     * a new one.
     */
   
    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, BLOCK_FLAGS_NONE);
        for (j = 0; j < dps; j++) {
            d = ((fat_dentry_t *)b->data) + j;
            switch (fat_classify_dentry(d)) {
            case FAT_DENTRY_SKIP:
            case FAT_DENTRY_VALID:
                /* skipping used and meta entries */
                continue;
            case FAT_DENTRY_FREE:
            case FAT_DENTRY_LAST:
                /* found an empty slot */
                goto hit;
            }
        }
        block_put(b);
    }
   
    /*
     * We need to grow the parent in order to create a new unused dentry.
     */
    futex_up(&parentp->idx->lock);
    return ENOTSUP; /* XXX */
 
hit:
    /*
     * At this point we only establish the link between the parent and the
     * child.  The dentry, except of the name and the extension, will remain
     * uninitialized until the the corresponding node is synced. Thus the
     * valid dentry data is kept in the child node structure.
     */
    memset(d, 0, sizeof(fat_dentry_t));
    fat_dentry_name_set(d, name);
    b->dirty = true;        /* need to sync block */
    block_put(b);
    futex_up(&parentp->idx->lock);
 
    futex_down(&childp->idx->lock);
    childp->idx->pfc = parentp->firstc;
    childp->idx->pdi = i * dps + j;
    futex_up(&childp->idx->lock);
 
    futex_down(&childp->lock);
    childp->lnkcnt = 1;
    childp->dirty = true;       /* need to sync node */
    futex_up(&childp->lock);
 
    /*
     * Hash in the index structure into the position hash.
     */
    fat_idx_hashin(childp->idx);
 
    return EOK;
}
 
int fat_unlink(void *prnt, void *chld)
{
    return ENOTSUP; /* not supported at the moment */
}
 
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, BLOCK_FLAGS_NONE);
        for (j = 0; j < dps; j++) {
            d = ((fat_dentry_t *)b->data) + j;
            switch (fat_classify_dentry(d)) {
            case FAT_DENTRY_SKIP:
            case FAT_DENTRY_FREE:
                continue;
            case FAT_DENTRY_LAST:
                block_put(b);
                futex_up(&parentp->idx->lock);
                return NULL;
            default:
            case FAT_DENTRY_VALID:
                fat_dentry_name_get(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;
}
 
fs_index_t fat_index_get(void *node)
{
    fat_node_t *fnodep = (fat_node_t *)node;
    if (!fnodep)
        return 0;
    return fnodep->idx->index;
}
 
size_t fat_size_get(void *node)
{
    return ((fat_node_t *)node)->size;
}
 
unsigned fat_lnkcnt_get(void *node)
{
    return ((fat_node_t *)node)->lnkcnt;
}
 
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, BLOCK_FLAGS_NONE);
        for (j = 0; j < dps; j++) {
            d = ((fat_dentry_t *)b->data) + j;
            switch (fat_classify_dentry(d)) {
            case FAT_DENTRY_SKIP:
            case FAT_DENTRY_FREE:
                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;
}
 
void *fat_root_get(dev_handle_t dev_handle)
{
    return fat_node_get(dev_handle, 0);
}
 
char fat_plb_get_char(unsigned pos)
{
    return fat_reg.plb_ro[pos % PLB_SIZE];
}
 
bool fat_is_directory(void *node)
{
    return ((fat_node_t *)node)->type == FAT_DIRECTORY;
}
 
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_node,
    .destroy = fat_destroy_node,
    .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
};
 
/*
 * VFS operations.
 */
 
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,
                BLOCK_FLAGS_NONE);
            (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, BLOCK_FLAGS_NONE);
            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:
                case FAT_DENTRY_FREE:
                    continue;
                case FAT_DENTRY_LAST:
                    block_put(b);
                    goto miss;
                default:
                case FAT_DENTRY_VALID:
                    fat_dentry_name_get(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;
    unsigned bpc;       /* bytes per cluster */
    off_t boundary;
    int flags = BLOCK_FLAGS_NONE;
   
    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;
    }
 
    bs = block_bb_get(dev_handle);
    bps = uint16_t_le2host(bs->bps);
    spc = bs->spc;
    bpc = bps * spc;
 
    /*
     * 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);
    if (bytes == bps)
        flags |= BLOCK_FLAGS_NOREAD;
   
    boundary = ROUND_UP(nodep->size, bpc);
    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, flags);
        (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 */
        }
        ipc_answer_2(rid, EOK, bytes, nodep->size);
        fat_node_put(nodep);
        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, bpc) - boundary) / bpc;
        /* 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,
            flags);
        (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 */
        ipc_answer_2(rid, EOK, bytes, nodep->size);
        fat_node_put(nodep);
        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);
    fat_bs_t *bs;
    uint16_t bps;
    uint8_t spc;
    unsigned bpc;   /* bytes per cluster */
    int rc;
 
    if (!nodep) {
        ipc_answer_0(rid, ENOENT);
        return;
    }
 
    bs = block_bb_get(dev_handle);
    bps = uint16_t_le2host(bs->bps);
    spc = bs->spc;
    bpc = bps * spc;
 
    if (nodep->size == size) {
        rc = EOK;
    } else if (nodep->size < size) {
        /*
         * The standard says we have the freedom to grow the node.
         * For now, we simply return an error.
         */
        rc = EINVAL;
    } else if (ROUND_UP(nodep->size, bpc) == ROUND_UP(size, bpc)) {
        /*
         * The node will be shrunk, but no clusters will be deallocated.
         */
        nodep->size = size;
        nodep->dirty = true;        /* need to sync node */
        rc = EOK;  
    } else {
        /*
         * The node will be shrunk, clusters will be deallocated.
         */
        if (size == 0) {
            fat_chop_clusters(bs, nodep, FAT_CLST_RES0);
        } else {
            fat_cluster_t lastc;
            (void) fat_cluster_walk(bs, dev_handle, nodep->firstc,
                &lastc, (size - 1) / bpc);
            fat_chop_clusters(bs, nodep, lastc);
        }
        nodep->size = size;
        nodep->dirty = true;        /* need to sync node */
        rc = EOK;  
    }
    fat_node_put(nodep);
    ipc_answer_0(rid, rc);
    return;
}
 
void fat_destroy(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);
    int rc;
 
    fat_node_t *nodep = fat_node_get(dev_handle, index);
    if (!nodep) {
        ipc_answer_0(rid, ENOENT);
        return;
    }
 
    rc = fat_destroy_node(nodep);
    ipc_answer_0(rid, rc);
}
 
/**
 * @}
 */
 

Rev 3629	Rev 3633
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, BLOCK_FLAGS_NONE);	92	(node->idx->pdi * sizeof(fat_dentry_t)) / bps, BLOCK_FLAGS_NONE);
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	} else if (node->type == FAT_DIRECTORY) {	99	} else if (node->type == FAT_DIRECTORY) {
100	d->attr = FAT_ATTR_SUBDIR;	100	d->attr = FAT_ATTR_SUBDIR;
101	}	101	}
102		102
103	/* TODO: update other fields? (e.g time fields) */	103	/* TODO: update other fields? (e.g time fields) */
104		104
105	b->dirty = true; /* need to sync block */	105	b->dirty = true; /* need to sync block */
106	block_put(b);	106	block_put(b);
107	}	107	}
108		108
109	static fat_node_t *fat_node_get_new(void)	109	static fat_node_t *fat_node_get_new(void)
110	{	110	{
111	fat_node_t *nodep;	111	fat_node_t *nodep;
112		112
113	futex_down(&ffn_futex);	113	futex_down(&ffn_futex);
114	if (!list_empty(&ffn_head)) {	114	if (!list_empty(&ffn_head)) {
115	/* Try to use a cached free node structure. */	115	/* Try to use a cached free node structure. */
116	fat_idx_t *idxp_tmp;	116	fat_idx_t *idxp_tmp;
117	nodep = list_get_instance(ffn_head.next, fat_node_t, ffn_link);	117	nodep = list_get_instance(ffn_head.next, fat_node_t, ffn_link);
118	if (futex_trydown(&nodep->lock) == ESYNCH_WOULD_BLOCK)	118	if (futex_trydown(&nodep->lock) == ESYNCH_WOULD_BLOCK)
119	goto skip_cache;	119	goto skip_cache;
120	idxp_tmp = nodep->idx;	120	idxp_tmp = nodep->idx;
121	if (futex_trydown(&idxp_tmp->lock) == ESYNCH_WOULD_BLOCK) {	121	if (futex_trydown(&idxp_tmp->lock) == ESYNCH_WOULD_BLOCK) {
122	futex_up(&nodep->lock);	122	futex_up(&nodep->lock);
123	goto skip_cache;	123	goto skip_cache;
124	}	124	}
125	list_remove(&nodep->ffn_link);	125	list_remove(&nodep->ffn_link);
126	futex_up(&ffn_futex);	126	futex_up(&ffn_futex);
127	if (nodep->dirty)	127	if (nodep->dirty)
128	fat_node_sync(nodep);	128	fat_node_sync(nodep);
129	idxp_tmp->nodep = NULL;	129	idxp_tmp->nodep = NULL;
130	futex_up(&nodep->lock);	130	futex_up(&nodep->lock);
131	futex_up(&idxp_tmp->lock);	131	futex_up(&idxp_tmp->lock);
132	} else {	132	} else {
133	skip_cache:	133	skip_cache:
134	/* Try to allocate a new node structure. */	134	/* Try to allocate a new node structure. */
135	futex_up(&ffn_futex);	135	futex_up(&ffn_futex);
136	nodep = (fat_node_t *)malloc(sizeof(fat_node_t));	136	nodep = (fat_node_t *)malloc(sizeof(fat_node_t));
137	if (!nodep)	137	if (!nodep)
138	return NULL;	138	return NULL;
139	}	139	}
140	fat_node_initialize(nodep);	140	fat_node_initialize(nodep);
141		141
142	return nodep;	142	return nodep;
143	}	143	}
144		144
145	/** Internal version of fat_node_get().	145	/** Internal version of fat_node_get().
146	*	146	*
147	* @param idxp Locked index structure.	147	* @param idxp Locked index structure.
148	*/	148	*/
149	static void fat_node_get_core(fat_idx_t idxp)	149	static void fat_node_get_core(fat_idx_t idxp)
150	{	150	{
151	block_t *b;	151	block_t *b;
152	fat_bs_t *bs;	152	fat_bs_t *bs;
153	fat_dentry_t *d;	153	fat_dentry_t *d;
154	fat_node_t *nodep = NULL;	154	fat_node_t *nodep = NULL;
155	unsigned bps;	155	unsigned bps;
156	unsigned spc;	156	unsigned spc;
157	unsigned dps;	157	unsigned dps;
158		158
159	if (idxp->nodep) {	159	if (idxp->nodep) {
160	/*	160	/*
161	* We are lucky.	161	* We are lucky.
162	* The node is already instantiated in memory.	162	* The node is already instantiated in memory.
163	*/	163	*/
164	futex_down(&idxp->nodep->lock);	164	futex_down(&idxp->nodep->lock);
165	if (!idxp->nodep->refcnt++)	165	if (!idxp->nodep->refcnt++)
166	list_remove(&idxp->nodep->ffn_link);	166	list_remove(&idxp->nodep->ffn_link);
167	futex_up(&idxp->nodep->lock);	167	futex_up(&idxp->nodep->lock);
168	return idxp->nodep;	168	return idxp->nodep;
169	}	169	}
170		170
171	/*	171	/*
172	* We must instantiate the node from the file system.	172	* We must instantiate the node from the file system.
173	*/	173	*/
174		174
175	assert(idxp->pfc);	175	assert(idxp->pfc);
176		176
177	nodep = fat_node_get_new();	177	nodep = fat_node_get_new();
178	if (!nodep)	178	if (!nodep)
179	return NULL;	179	return NULL;
180		180
181	bs = block_bb_get(idxp->dev_handle);	181	bs = block_bb_get(idxp->dev_handle);
182	bps = uint16_t_le2host(bs->bps);	182	bps = uint16_t_le2host(bs->bps);
183	spc = bs->spc;	183	spc = bs->spc;
184	dps = bps / sizeof(fat_dentry_t);	184	dps = bps / sizeof(fat_dentry_t);
185		185
186	/* Read the block that contains the dentry of interest. */	186	/* Read the block that contains the dentry of interest. */
187	b = _fat_block_get(bs, idxp->dev_handle, idxp->pfc,	187	b = _fat_block_get(bs, idxp->dev_handle, idxp->pfc,
188	(idxp->pdi * sizeof(fat_dentry_t)) / bps, BLOCK_FLAGS_NONE);	188	(idxp->pdi * sizeof(fat_dentry_t)) / bps, BLOCK_FLAGS_NONE);
189	assert(b);	189	assert(b);
190		190
191	d = ((fat_dentry_t *)b->data) + (idxp->pdi % dps);	191	d = ((fat_dentry_t *)b->data) + (idxp->pdi % dps);
192	if (d->attr & FAT_ATTR_SUBDIR) {	192	if (d->attr & FAT_ATTR_SUBDIR) {
193	/*	193	/*
194	* The only directory which does not have this bit set is the	194	* The only directory which does not have this bit set is the
195	* root directory itself. The root directory node is handled	195	* root directory itself. The root directory node is handled
196	* and initialized elsewhere.	196	* and initialized elsewhere.
197	*/	197	*/
198	nodep->type = FAT_DIRECTORY;	198	nodep->type = FAT_DIRECTORY;
199	/*	199	/*
200	* Unfortunately, the 'size' field of the FAT dentry is not	200	* Unfortunately, the 'size' field of the FAT dentry is not
201	* defined for the directory entry type. We must determine the	201	* defined for the directory entry type. We must determine the
202	* size of the directory by walking the FAT.	202	* size of the directory by walking the FAT.
203	*/	203	*/
204	nodep->size = bps * spc * fat_clusters_get(bs, idxp->dev_handle,	204	nodep->size = bps * spc * fat_clusters_get(bs, idxp->dev_handle,
205	uint16_t_le2host(d->firstc));	205	uint16_t_le2host(d->firstc));
206	} else {	206	} else {
207	nodep->type = FAT_FILE;	207	nodep->type = FAT_FILE;
208	nodep->size = uint32_t_le2host(d->size);	208	nodep->size = uint32_t_le2host(d->size);
209	}	209	}
210	nodep->firstc = uint16_t_le2host(d->firstc);	210	nodep->firstc = uint16_t_le2host(d->firstc);
211	nodep->lnkcnt = 1;	211	nodep->lnkcnt = 1;
212	nodep->refcnt = 1;	212	nodep->refcnt = 1;
213		213
214	block_put(b);	214	block_put(b);
215		215
216	/* Link the idx structure with the node structure. */	216	/* Link the idx structure with the node structure. */
217	nodep->idx = idxp;	217	nodep->idx = idxp;
218	idxp->nodep = nodep;	218	idxp->nodep = nodep;
219		219
220	return nodep;	220	return nodep;
221	}	221	}
222		222
223	/*	223	/*
224	* Forward declarations of FAT libfs operations.	224	* Forward declarations of FAT libfs operations.
225	*/	225	*/
226	static void *fat_node_get(dev_handle_t, fs_index_t);	226	static void *fat_node_get(dev_handle_t, fs_index_t);
227	static void fat_node_put(void *);	227	static void fat_node_put(void *);
228	static void *fat_create_node(dev_handle_t, int);	228	static void *fat_create_node(dev_handle_t, int);
229	static int fat_destroy_node(void *);	229	static int fat_destroy_node(void *);
230	static int fat_link(void , void , const char *);	230	static int fat_link(void , void , const char *);
231	static int fat_unlink(void , void );	231	static int fat_unlink(void , void );
232	static void fat_match(void , const char *);	232	static void fat_match(void , const char *);
233	static fs_index_t fat_index_get(void *);	233	static fs_index_t fat_index_get(void *);
234	static size_t fat_size_get(void *);	234	static size_t fat_size_get(void *);
235	static unsigned fat_lnkcnt_get(void *);	235	static unsigned fat_lnkcnt_get(void *);
236	static bool fat_has_children(void *);	236	static bool fat_has_children(void *);
237	static void *fat_root_get(dev_handle_t);	237	static void *fat_root_get(dev_handle_t);
238	static char fat_plb_get_char(unsigned);	238	static char fat_plb_get_char(unsigned);
239	static bool fat_is_directory(void *);	239	static bool fat_is_directory(void *);
240	static bool fat_is_file(void *node);	240	static bool fat_is_file(void *node);
241		241
242	/*	242	/*
243	* FAT libfs operations.	243	* FAT libfs operations.
244	*/	244	*/
245		245
246	/** Instantiate a FAT in-core node. */	246	/** Instantiate a FAT in-core node. */
247	void *fat_node_get(dev_handle_t dev_handle, fs_index_t index)	247	void *fat_node_get(dev_handle_t dev_handle, fs_index_t index)
248	{	248	{
249	void *node;	249	void *node;
250	fat_idx_t *idxp;	250	fat_idx_t *idxp;
251		251
252	idxp = fat_idx_get_by_index(dev_handle, index);	252	idxp = fat_idx_get_by_index(dev_handle, index);
253	if (!idxp)	253	if (!idxp)
254	return NULL;	254	return NULL;
255	/* idxp->lock held */	255	/* idxp->lock held */
256	node = fat_node_get_core(idxp);	256	node = fat_node_get_core(idxp);
257	futex_up(&idxp->lock);	257	futex_up(&idxp->lock);
258	return node;	258	return node;
259	}	259	}
260		260
261	void fat_node_put(void *node)	261	void fat_node_put(void *node)
262	{	262	{
263	fat_node_t nodep = (fat_node_t )node;	263	fat_node_t nodep = (fat_node_t )node;
264	bool destroy = false;	264	bool destroy = false;
265		265
266	futex_down(&nodep->lock);	266	futex_down(&nodep->lock);
267	if (!--nodep->refcnt) {	267	if (!--nodep->refcnt) {
268	if (nodep->idx) {	268	if (nodep->idx) {
269	futex_down(&ffn_futex);	269	futex_down(&ffn_futex);
270	list_append(&nodep->ffn_link, &ffn_head);	270	list_append(&nodep->ffn_link, &ffn_head);
271	futex_up(&ffn_futex);	271	futex_up(&ffn_futex);
272	} else {	272	} else {
273	/*	273	/*
274	* The node does not have any index structure associated	274	* The node does not have any index structure associated
275	* with itself. This can only mean that we are releasing	275	* with itself. This can only mean that we are releasing
276	* the node after a failed attempt to allocate the index	276	* the node after a failed attempt to allocate the index
277	* structure for it.	277	* structure for it.
278	*/	278	*/
279	destroy = true;	279	destroy = true;
280	}	280	}
281	}	281	}
282	futex_up(&nodep->lock);	282	futex_up(&nodep->lock);
283	if (destroy)	283	if (destroy)
284	free(node);	284	free(node);
285	}	285	}
286		286
287	void *fat_create_node(dev_handle_t dev_handle, int flags)	287	void *fat_create_node(dev_handle_t dev_handle, int flags)
288	{	288	{
289	fat_idx_t *idxp;	289	fat_idx_t *idxp;
290	fat_node_t *nodep;	290	fat_node_t *nodep;
-		291	fat_bs_t *bs;
-		292	fat_cluster_t mcl, lcl;
-		293	uint16_t bps;
-		294	int rc;
-		295
-		296	bs = block_bb_get(dev_handle);
-		297	bps = uint16_t_le2host(bs->bps);
-		298	if (flags & L_DIRECTORY) {
-		299	/* allocate a cluster */
-		300	rc = fat_alloc_clusters(bs, dev_handle, 1, &mcl, &lcl);
-		301	if (rc != EOK)
-		302	return NULL;
-		303	}
291		304
292	nodep = fat_node_get_new();	305	nodep = fat_node_get_new();
293	if (!nodep)	306	if (!nodep) {
-		307	fat_free_clusters(bs, dev_handle, mcl);
294	return NULL;	308	return NULL;
-		309	}
295	idxp = fat_idx_get_new(dev_handle);	310	idxp = fat_idx_get_new(dev_handle);
296	if (!idxp) {	311	if (!idxp) {
-		312	fat_free_clusters(bs, dev_handle, mcl);
297	fat_node_put(nodep);	313	fat_node_put(nodep);
298	return NULL;	314	return NULL;
299	}	315	}
300	/* idxp->lock held */	316	/* idxp->lock held */
301	if (flags & L_DIRECTORY) {	317	if (flags & L_DIRECTORY) {
-		318	int i;
-		319	block_t *b;
-		320
-		321	/*
-		322	* Populate the new cluster with unused dentries.
-		323	* We don't create the '.' and '..' entries, since they are
-		324	* optional and HelenOS VFS does not need them.
-		325	*/
-		326	for (i = 0; i < bs->spc; i++) {
-		327	b = _fat_block_get(bs, dev_handle, mcl, i,
-		328	BLOCK_FLAGS_NOREAD);
-		329	/* mark all dentries as never-used */
-		330	memset(b->data, 0, bps);
-		331	b->dirty = false;
-		332	block_put(b);
-		333	}
302	nodep->type = FAT_DIRECTORY;	334	nodep->type = FAT_DIRECTORY;
-		335	nodep->firstc = mcl;
-		336	nodep->size = bps * bs->spc;
303	} else {	337	} else {
304	nodep->type = FAT_FILE;	338	nodep->type = FAT_FILE;
-		339	nodep->firstc = FAT_CLST_RES0;
-		340	nodep->size = 0;
305	}	341	}
306	nodep->size = 0;	-
307	nodep->firstc = FAT_CLST_RES0;	-
308	nodep->lnkcnt = 0; /* not linked anywhere */	342	nodep->lnkcnt = 0; /* not linked anywhere */
309	nodep->refcnt = 1;	343	nodep->refcnt = 1;
-		344	nodep->dirty = true;
310		345
311	nodep->idx = idxp;	346	nodep->idx = idxp;
312	idxp->nodep = nodep;	347	idxp->nodep = nodep;
313		348
314	futex_up(&idxp->lock);	349	futex_up(&idxp->lock);
315	return nodep;	350	return nodep;
316	}	351	}
317		352
318	int fat_destroy_node(void *node)	353	int fat_destroy_node(void *node)
319	{	354	{
320	fat_node_t nodep = (fat_node_t )node;	355	fat_node_t nodep = (fat_node_t )node;
321	fat_bs_t *bs;	356	fat_bs_t *bs;
322		357
323	/*	358	/*
324	* The node is not reachable from the file system. This means that the	359	* The node is not reachable from the file system. This means that the
325	* link count should be zero and that the index structure cannot be	360	* link count should be zero and that the index structure cannot be
326	* found in the position hash. Obviously, we don't need to lock the node	361	* found in the position hash. Obviously, we don't need to lock the node
327	* nor its index structure.	362	* nor its index structure.
328	*/	363	*/
329	assert(nodep->lnkcnt == 0);	364	assert(nodep->lnkcnt == 0);
330		365
331	/*	366	/*
332	* The node may not have any children.	367	* The node may not have any children.
333	*/	368	*/
334	assert(fat_has_children(node) == false);	369	assert(fat_has_children(node) == false);
335		370
336	bs = block_bb_get(nodep->idx->dev_handle);	371	bs = block_bb_get(nodep->idx->dev_handle);
337	if (nodep->firstc != FAT_CLST_RES0) {	372	if (nodep->firstc != FAT_CLST_RES0) {
338	assert(nodep->size);	373	assert(nodep->size);
339	/* Free all clusters allocated to the node. */	374	/* Free all clusters allocated to the node. */
340	fat_free_clusters(bs, nodep->idx->dev_handle, nodep->firstc);	375	fat_free_clusters(bs, nodep->idx->dev_handle, nodep->firstc);
341	}	376	}
342		377
343	fat_idx_destroy(nodep->idx);	378	fat_idx_destroy(nodep->idx);
344	free(nodep);	379	free(nodep);
345	return EOK;	380	return EOK;
346	}	381	}
347		382
348	int fat_link(void prnt, void chld, const char *name)	383	int fat_link(void prnt, void chld, const char *name)
349	{	384	{
350	fat_node_t parentp = (fat_node_t )prnt;	385	fat_node_t parentp = (fat_node_t )prnt;
351	fat_node_t childp = (fat_node_t )chld;	386	fat_node_t childp = (fat_node_t )chld;
352	fat_dentry_t *d;	387	fat_dentry_t *d;
353	fat_bs_t *bs;	388	fat_bs_t *bs;
354	block_t *b;	389	block_t *b;
355	int i, j;	390	int i, j;
356	uint16_t bps;	391	uint16_t bps;
357	unsigned dps;	392	unsigned dps;
358	unsigned blocks;	393	unsigned blocks;
359		394
360	futex_down(&childp->lock);	395	futex_down(&childp->lock);
361	if (childp->lnkcnt == 1) {	396	if (childp->lnkcnt == 1) {
362	/*	397	/*
363	* On FAT, we don't support multiple hard links.	398	* On FAT, we don't support multiple hard links.
364	*/	399	*/
365	futex_up(&childp->lock);	400	futex_up(&childp->lock);
366	return EMLINK;	401	return EMLINK;
367	}	402	}
368	assert(childp->lnkcnt == 0);	403	assert(childp->lnkcnt == 0);
369	futex_up(&childp->lock);	404	futex_up(&childp->lock);
370		405
371	if (!fat_dentry_name_verify(name)) {	406	if (!fat_dentry_name_verify(name)) {
372	/*	407	/*
373	* Attempt to create unsupported name.	408	* Attempt to create unsupported name.
374	*/	409	*/
375	return ENOTSUP;	410	return ENOTSUP;
376	}	411	}
377		412
378	/*	413	/*
379	* Get us an unused parent node's dentry or grow the parent and allocate	414	* Get us an unused parent node's dentry or grow the parent and allocate
380	* a new one.	415	* a new one.
381	*/	416	*/
382		417
383	futex_down(&parentp->idx->lock);	418	futex_down(&parentp->idx->lock);
384	bs = block_bb_get(parentp->idx->dev_handle);	419	bs = block_bb_get(parentp->idx->dev_handle);
385	bps = uint16_t_le2host(bs->bps);	420	bps = uint16_t_le2host(bs->bps);
386	dps = bps / sizeof(fat_dentry_t);	421	dps = bps / sizeof(fat_dentry_t);
387		422
388	blocks = parentp->size / bps;	423	blocks = parentp->size / bps;
389		424
390	for (i = 0; i < blocks; i++) {	425	for (i = 0; i < blocks; i++) {
391	b = fat_block_get(bs, parentp, i, BLOCK_FLAGS_NONE);	426	b = fat_block_get(bs, parentp, i, BLOCK_FLAGS_NONE);
392	for (j = 0; j < dps; j++) {	427	for (j = 0; j < dps; j++) {
393	d = ((fat_dentry_t *)b->data) + j;	428	d = ((fat_dentry_t *)b->data) + j;
394	switch (fat_classify_dentry(d)) {	429	switch (fat_classify_dentry(d)) {
395	case FAT_DENTRY_SKIP:	430	case FAT_DENTRY_SKIP:
396	case FAT_DENTRY_VALID:	431	case FAT_DENTRY_VALID:
397	/* skipping used and meta entries */	432	/* skipping used and meta entries */
398	continue;	433	continue;
399	case FAT_DENTRY_FREE:	434	case FAT_DENTRY_FREE:
400	case FAT_DENTRY_LAST:	435	case FAT_DENTRY_LAST:
401	/* found an empty slot */	436	/* found an empty slot */
402	goto hit;	437	goto hit;
403	}	438	}
404	}	439	}
405	block_put(b);	440	block_put(b);
406	}	441	}
407		442
408	/*	443	/*
409	* We need to grow the parent in order to create a new unused dentry.	444	* We need to grow the parent in order to create a new unused dentry.
410	*/	445	*/
411	futex_up(&parentp->idx->lock);	446	futex_up(&parentp->idx->lock);
412	return ENOTSUP; /* XXX */	447	return ENOTSUP; /* XXX */
413		448
414	hit:	449	hit:
415	/*	450	/*
416	* At this point we only establish the link between the parent and the	451	* At this point we only establish the link between the parent and the
417	* child. The dentry, except of the name and the extension, will remain	452	* child. The dentry, except of the name and the extension, will remain
418	* uninitialized until the the corresponding node is synced. Thus the	453	* uninitialized until the the corresponding node is synced. Thus the
419	* valid dentry data is kept in the child node structure.	454	* valid dentry data is kept in the child node structure.
420	*/	455	*/
421	memset(d, 0, sizeof(fat_dentry_t));	456	memset(d, 0, sizeof(fat_dentry_t));
422	fat_dentry_name_set(d, name);	457	fat_dentry_name_set(d, name);
423	b->dirty = true; /* need to sync block */	458	b->dirty = true; /* need to sync block */
424	block_put(b);	459	block_put(b);
425	futex_up(&parentp->idx->lock);	460	futex_up(&parentp->idx->lock);
426		461
427	futex_down(&childp->idx->lock);	462	futex_down(&childp->idx->lock);
428	childp->idx->pfc = parentp->firstc;	463	childp->idx->pfc = parentp->firstc;
429	childp->idx->pdi = i * dps + j;	464	childp->idx->pdi = i * dps + j;
430	futex_up(&childp->idx->lock);	465	futex_up(&childp->idx->lock);
431		466
432	futex_down(&childp->lock);	467	futex_down(&childp->lock);
433	childp->lnkcnt = 1;	468	childp->lnkcnt = 1;
434	childp->dirty = true; /* need to sync node */	469	childp->dirty = true; /* need to sync node */
435	futex_up(&childp->lock);	470	futex_up(&childp->lock);
436		471
437	/*	472	/*
438	* Hash in the index structure into the position hash.	473	* Hash in the index structure into the position hash.
439	*/	474	*/
440	fat_idx_hashin(childp->idx);	475	fat_idx_hashin(childp->idx);
441		476
442	return EOK;	477	return EOK;
443	}	478	}
444		479
445	int fat_unlink(void prnt, void chld)	480	int fat_unlink(void prnt, void chld)
446	{	481	{
447	return ENOTSUP; /* not supported at the moment */	482	return ENOTSUP; /* not supported at the moment */
448	}	483	}
449		484
450	void fat_match(void prnt, const char *component)	485	void fat_match(void prnt, const char *component)
451	{	486	{
452	fat_bs_t *bs;	487	fat_bs_t *bs;
453	fat_node_t parentp = (fat_node_t )prnt;	488	fat_node_t parentp = (fat_node_t )prnt;
454	char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1];	489	char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1];
455	unsigned i, j;	490	unsigned i, j;
456	unsigned bps; /* bytes per sector */	491	unsigned bps; /* bytes per sector */
457	unsigned dps; /* dentries per sector */	492	unsigned dps; /* dentries per sector */
458	unsigned blocks;	493	unsigned blocks;
459	fat_dentry_t *d;	494	fat_dentry_t *d;
460	block_t *b;	495	block_t *b;
461		496
462	futex_down(&parentp->idx->lock);	497	futex_down(&parentp->idx->lock);
463	bs = block_bb_get(parentp->idx->dev_handle);	498	bs = block_bb_get(parentp->idx->dev_handle);

Subversion Repositories HelenOS

(root)/trunk/uspace/srv/fs/fat/fat_ops.c @ 4680 – Rev 3629 → 3633