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);
}
 
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);
    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(dev_handle_t dev_handle, 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;
    unsigned bpc;       /* bytes per cluster */
    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;
    }
 
    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);
 
 
 
 
   
    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);
        (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);
        (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;
 
}
 
/**
 * @}
 */
 

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

Subversion Repositories HelenOS

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