phat32.c

Go to the documentation of this file.

/*
 * Copyright (C) 2005 by egnite Software GmbH. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. 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.
 * 3. Neither the name of the copyright holders nor the names of
 *    contributors may be used to endorse or promote products derived
 *    from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY EGNITE SOFTWARE GMBH AND CONTRIBUTORS
 * ``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 EGNITE
 * SOFTWARE GMBH OR CONTRIBUTORS 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.
 *
 * For additional information see http://www.ethernut.de/
 */

#include <errno.h>

#include <fs/phatfs.h>
#include <fs/phatvol.h>
#include <fs/phatio.h>


static void PhatTableLoc(PHATVOL * vol, uint32_t clust, int tabnum, uint32_t * sect, uint32_t * pos)
{
    uint32_t tabpos = clust * 4;

    *sect = vol->vol_tab_sect[tabnum] + tabpos / vol->vol_sectsz;
    *pos = tabpos % vol->vol_sectsz;
}

int Phat32GetClusterLink(NUTDEVICE * dev, uint32_t clust, uint32_t * link)
{
    uint32_t sect, pos;
    int sbn;
    PHATVOL *vol = (PHATVOL *) dev->dev_dcb;

    /* Do not seek beyond the end of the chain. */
    if (clust >= (PHATEOC & PHAT32CMASK)) {
        return -1;
    }

    /* Load the sector that contains the table entry. */
    PhatTableLoc(vol, clust, 0, &sect, &pos);
    if ((sbn = PhatSectorLoad(dev, sect)) < 0) {
        return -1;
    }

    /* Get the 32 bit link value. */
    *link = vol->vol_buf[sbn].sect_data[pos];
    *link += (uint32_t)(vol->vol_buf[sbn].sect_data[pos + 1]) << 8;
    *link += (uint32_t)(vol->vol_buf[sbn].sect_data[pos + 2]) << 16;
    *link += (uint32_t)(vol->vol_buf[sbn].sect_data[pos + 3]) << 24;

    return 0;
}

int Phat32SetClusterLink(NUTDEVICE * dev, uint32_t clust, uint32_t link)
{
    int tabnum;
    uint32_t sect;
    uint32_t pos;
    int sbn;
    PHATVOL *vol = (PHATVOL *) dev->dev_dcb;

    for (tabnum = 0; tabnum < 2 && vol->vol_tab_sect[tabnum]; tabnum++) {
        link &= PHAT32CMASK;

        PhatTableLoc(vol, clust, tabnum, &sect, &pos);
        if ((sbn = PhatSectorLoad(dev, sect)) < 0) {
            return -1;
        }
        vol->vol_buf[sbn].sect_data[pos] = (uint8_t) link;
        vol->vol_buf[sbn].sect_data[pos + 1] = (uint8_t) (link >> 8);
        vol->vol_buf[sbn].sect_data[pos + 2] = (uint8_t) (link >> 16);
        vol->vol_buf[sbn].sect_data[pos + 3] = (uint8_t) (link >> 24);
        vol->vol_buf[sbn].sect_dirty = 1;
    }
    return 0;
}

int Phat32ReleaseChain(NUTDEVICE * dev, uint32_t first)
{
    uint32_t next;
    PHATVOL *vol = (PHATVOL *) dev->dev_dcb;

    while (first < (PHATEOC & PHAT32CMASK)) {
        if (Phat32GetClusterLink(dev, first, &next)) {
            /* Read error. */
            return -1;
        }
        if (next < 2) {
            /* Incomplete chain, should not happen. */
            break;
        }
        if (Phat32SetClusterLink(dev, first, 0)) {
            /* Write error. */
            return -1;
        }
        vol->vol_numfree++;
        first = next;
    }
    return 0;
}