WebSVN – HelenOS – Diff – /branches/dynload/uspace/srv/fs/fat/fat_idx.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_idx.c
 * @brief   Layer for translating FAT entities to VFS node indices.
 */
 
#include "fat.h"
#include "../../vfs/vfs.h"
#include <errno.h>
#include <string.h>
#include <libadt/hash_table.h>
#include <libadt/list.h>
#include <assert.h>
#include <futex.h>
 
/** Each instance of this type describes one interval of freed VFS indices. */
typedef struct {
    link_t      link;
    fs_index_t  first;
    fs_index_t  last;
} freed_t;
 
/**
 * Each instance of this type describes state of all VFS indices that
 * are currently unused.
 */
typedef struct {
    link_t      link;
    dev_handle_t    dev_handle;
 
    /** Next unassigned index. */
    fs_index_t  next;
    /** Number of remaining unassigned indices. */
    uint64_t    remaining;
 
    /** Sorted list of intervals of freed indices. */
    link_t      freed_head;
} unused_t;
 
/** Futex protecting the list of unused structures. */
static futex_t unused_futex = FUTEX_INITIALIZER;
 
/** List of unused structures. */
static LIST_INITIALIZE(unused_head);
 
/** Futex protecting the up_hash and ui_hash.
 *
 * The locking strategy assumes that there will be at most one fibril for each
 * dev_handle.  Therefore it will be sufficient to hold the futex for shorter
 * times (i.e. only during hash table operations as opposed to holding it the
 * whole time between an unsuccessful find and the following insert). Should the
 * assumption break, the locking strategy for this futex will have to be
 * reconsidered.
 */
static futex_t used_futex = FUTEX_INITIALIZER;
 
/**
 * Global hash table of all used fat_idx_t structures.
 * The index structures are hashed by the dev_handle, parent node's first
 * cluster and index within the parent directory.
 */
static hash_table_t up_hash;
 
#define UPH_BUCKETS_LOG 12
#define UPH_BUCKETS (1 << UPH_BUCKETS_LOG)
 
#define UPH_DH_KEY  0
#define UPH_PFC_KEY 1
#define UPH_PDI_KEY 2
 
static hash_index_t pos_hash(unsigned long key[])
{
    dev_handle_t dev_handle = (dev_handle_t)key[UPH_DH_KEY];
    fat_cluster_t pfc = (fat_cluster_t)key[UPH_PFC_KEY];
    unsigned pdi = (unsigned)key[UPH_PDI_KEY];
 
    hash_index_t h;
 
    /*
     * The least significant half of all bits are the least significant bits
     * of the parent node's first cluster.
     *
     * The least significant half of the most significant half of all bits
     * are the least significant bits of the node's dentry index within the
     * parent directory node.
     *
     * The most significant half of the most significant half of all bits
     * are the least significant bits of the device handle.
     */
    h = pfc & ((1 << (UPH_BUCKETS_LOG / 2)) - 1);
    h |= (pdi & ((1 << (UPH_BUCKETS_LOG / 4)) - 1)) <<
        (UPH_BUCKETS_LOG / 2);
    h |= (dev_handle & ((1 << (UPH_BUCKETS_LOG / 4)) - 1)) <<
        (3 * (UPH_BUCKETS_LOG / 4));
 
    return h;
}
 
static int pos_compare(unsigned long key[], hash_count_t keys, link_t *item)
{
    dev_handle_t dev_handle = (dev_handle_t)key[UPH_DH_KEY];
    fat_cluster_t pfc = (fat_cluster_t)key[UPH_PFC_KEY];
    unsigned pdi = (unsigned)key[UPH_PDI_KEY];
    fat_idx_t *fidx = list_get_instance(item, fat_idx_t, uph_link);
 
    return (dev_handle == fidx->dev_handle) && (pfc == fidx->pfc) &&
        (pdi == fidx->pdi);
}
 
static void pos_remove_callback(link_t *item)
{
    /* nothing to do */
}
 
static hash_table_operations_t uph_ops = {
    .hash = pos_hash,
    .compare = pos_compare,
    .remove_callback = pos_remove_callback,
};
 
/**
 * Global hash table of all used fat_idx_t structures.
 * The index structures are hashed by the dev_handle and index.
 */
static hash_table_t ui_hash;
 
#define UIH_BUCKETS_LOG 12
#define UIH_BUCKETS (1 << UIH_BUCKETS_LOG)
 
#define UIH_DH_KEY  0
#define UIH_INDEX_KEY   1
 
static hash_index_t idx_hash(unsigned long key[])
{
    dev_handle_t dev_handle = (dev_handle_t)key[UIH_DH_KEY];
    fs_index_t index = (fs_index_t)key[UIH_INDEX_KEY];
 
    hash_index_t h;
 
    h = dev_handle & ((1 << (UIH_BUCKETS_LOG / 2)) - 1);
    h |= (index & ((1 << (UIH_BUCKETS_LOG / 2)) - 1)) <<
        (UIH_BUCKETS_LOG / 2);
 
    return h;
}
 
static int idx_compare(unsigned long key[], hash_count_t keys, link_t *item)
{
    dev_handle_t dev_handle = (dev_handle_t)key[UIH_DH_KEY];
    fs_index_t index = (fs_index_t)key[UIH_INDEX_KEY];
    fat_idx_t *fidx = list_get_instance(item, fat_idx_t, uih_link);
 
    return (dev_handle == fidx->dev_handle) && (index == fidx->index);
}
 
static void idx_remove_callback(link_t *item)
{
    /* nothing to do */
}
 
static hash_table_operations_t uih_ops = {
    .hash = idx_hash,
    .compare = idx_compare,
    .remove_callback = idx_remove_callback,
};
 
/** Allocate a VFS index which is not currently in use. */
static bool fat_idx_alloc(dev_handle_t dev_handle, fs_index_t *index)
{
    link_t *l;
    unused_t *u;
   
    assert(index);
    futex_down(&unused_futex);
    for (l = unused_head.next; l != &unused_head; l = l->next) {
        u = list_get_instance(l, unused_t, link);
        if (u->dev_handle == dev_handle)
            goto hit;
    }
    futex_up(&unused_futex);
   
    /* dev_handle not found */
    return false;  
 
hit:
    if (list_empty(&u->freed_head)) {
        if (u->remaining) {
            /*
             * There are no freed indices, allocate one directly
             * from the counter.
             */
            *index = u->next++;
            --u->remaining;
            futex_up(&unused_futex);
            return true;
        }
    } else {
        /* There are some freed indices which we can reuse. */
        freed_t *f = list_get_instance(u->freed_head.next, freed_t,
            link);
        *index = f->first;
        if (f->first++ == f->last) {
            /* Destroy the interval. */
            list_remove(&f->link);
            free(f);
        }
        futex_up(&unused_futex);
        return true;
    }
    /*
     * We ran out of indices, which is extremely unlikely with FAT16, but
     * theoretically still possible (e.g. too many open unlinked nodes or
     * too many zero-sized nodes).
     */
    futex_up(&unused_futex);
    return false;
}
 
/** If possible, coalesce two intervals of freed indices. */
static void try_coalesce_intervals(link_t *l, link_t *r, link_t *cur)
{
    freed_t *fl = list_get_instance(l, freed_t, link);
    freed_t *fr = list_get_instance(r, freed_t, link);
 
    if (fl->last + 1 == fr->first) {
        if (cur == l) {
            fl->last = fr->last;
            list_remove(r);
            free(r);
        } else {
            fr->first = fl->first;
            list_remove(l);
            free(l);
        }
    }
}
 
/** Free a VFS index, which is no longer in use. */
static void fat_idx_free(dev_handle_t dev_handle, fs_index_t index)
{
    link_t *l;
    unused_t *u;
 
    futex_down(&unused_futex);
    for (l = unused_head.next; l != &unused_head; l = l->next) {
        u = list_get_instance(l, unused_t, link);
        if (u->dev_handle == dev_handle)
            goto hit;
    }
    futex_up(&unused_futex);
 
    /* should not happen */
    assert(0);
 
hit:
    if (u->next == index + 1) {
        /* The index can be returned directly to the counter. */
        u->next--;
        u->remaining++;
 
    } else {
        /*
         * The index must be returned either to an existing freed
         * interval or a new interval must be created.
         */
        link_t *lnk;
        freed_t *n;
        for (lnk = u->freed_head.next; lnk != &u->freed_head;
            lnk = lnk->next) {
            freed_t *f = list_get_instance(lnk, freed_t, link);
            if (f->first == index + 1) {
                f->first--;
                if (lnk->prev != &u->freed_head)
                    try_coalesce_intervals(lnk->prev, lnk,
                        lnk);
                futex_up(&unused_futex);
                return;
            }
            if (f->last == index - 1) {
                f->last++;
                if (lnk->next != &u->freed_head)
                    try_coalesce_intervals(lnk, lnk->next,
                        lnk);
                futex_up(&unused_futex);
                return;
            }
            if (index > f->first) {
                n = malloc(sizeof(freed_t));
                /* TODO: sleep until allocation succeeds */
                assert(n);
                link_initialize(&n->link);
                n->first = index;
                n->last = index;
                list_insert_before(&n->link, lnk);
                futex_up(&unused_futex);
                return;
            }
 
        }
        /* The index will form the last interval. */
        n = malloc(sizeof(freed_t));
        /* TODO: sleep until allocation succeeds */
        assert(n);
        link_initialize(&n->link);
        n->first = index;
        n->last = index;
        list_append(&n->link, &u->freed_head);
    }
    futex_up(&unused_futex);
}
 
fat_idx_t *
fat_idx_get_by_pos(dev_handle_t dev_handle, fat_cluster_t pfc, unsigned pdi)
{
    fat_idx_t *fidx;
    link_t *l;
    unsigned long pkey[] = {
        [UPH_DH_KEY] = dev_handle,
        [UPH_PFC_KEY] = pfc,
        [UPH_PDI_KEY] = pdi,
    };
 
    futex_down(&used_futex);
    l = hash_table_find(&up_hash, pkey);
    futex_up(&used_futex);
    if (l) {
        fidx = hash_table_get_instance(l, fat_idx_t, uph_link);
    } else {
        fidx = (fat_idx_t *) malloc(sizeof(fat_idx_t));
        if (!fidx) {
            return NULL;
        }
        if (!fat_idx_alloc(dev_handle, &fidx->index)) {
            free(fidx);
            return NULL;
        }
       
        unsigned long ikey[] = {
            [UIH_DH_KEY] = dev_handle,
            [UIH_INDEX_KEY] = fidx->index,
        };
   
        link_initialize(&fidx->uph_link);
        link_initialize(&fidx->uih_link);
        fidx->dev_handle = dev_handle;
        fidx->pfc = pfc;
        fidx->pdi = pdi;
        fidx->nodep = NULL;
 
        futex_down(&used_futex);
        hash_table_insert(&up_hash, pkey, &fidx->uph_link);
        hash_table_insert(&ui_hash, ikey, &fidx->uih_link);
        futex_up(&used_futex);
    }
 
    return fidx;
}
 
fat_idx_t *
fat_idx_get_by_index(dev_handle_t dev_handle, fs_index_t index)
{
    fat_idx_t *fidx = NULL;
    link_t *l;
    unsigned long ikey[] = {
        [UIH_DH_KEY] = dev_handle,
        [UIH_INDEX_KEY] = index,
    };
 
    futex_down(&used_futex);
    l = hash_table_find(&ui_hash, ikey);
    futex_up(&used_futex);
    if (l) {
        fidx = hash_table_get_instance(l, fat_idx_t, uih_link);
    }
 
    return fidx;
}
 
 

Rev 2927	Rev 2948
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_idx.c	34	* @file fat_idx.c
35	* @brief Layer for translating FAT entities to VFS node indices.	35	* @brief Layer for translating FAT entities to VFS node indices.
36	*/	36	*/
37		37
38	#include "fat.h"	38	#include "fat.h"
39	#include "../../vfs/vfs.h"	39	#include "../../vfs/vfs.h"
40	#include <errno.h>	40	#include <errno.h>
41	#include <string.h>	41	#include <string.h>
42	#include <libadt/hash_table.h>	42	#include <libadt/hash_table.h>
43	#include <libadt/list.h>	43	#include <libadt/list.h>
44	#include <assert.h>	44	#include <assert.h>
45	#include <futex.h>	45	#include <futex.h>
46		46
47	/** Each instance of this type describes one interval of freed VFS indices. */	47	/** Each instance of this type describes one interval of freed VFS indices. */
48	typedef struct {	48	typedef struct {
49	link_t link;	49	link_t link;
50	fs_index_t first;	50	fs_index_t first;
51	fs_index_t last;	51	fs_index_t last;
52	} freed_t;	52	} freed_t;
53		53
54	/**	54	/**
55	* Each instance of this type describes state of all VFS indices that	55	* Each instance of this type describes state of all VFS indices that
56	* are currently unused.	56	* are currently unused.
57	*/	57	*/
58	typedef struct {	58	typedef struct {
59	link_t link;	59	link_t link;
60	dev_handle_t dev_handle;	60	dev_handle_t dev_handle;
61		61
62	/** Next unassigned index. */	62	/** Next unassigned index. */
63	fs_index_t next;	63	fs_index_t next;
64	/** Number of remaining unassigned indices. */	64	/** Number of remaining unassigned indices. */
65	uint64_t remaining;	65	uint64_t remaining;
66		66
67	/** Sorted list of intervals of freed indices. */	67	/** Sorted list of intervals of freed indices. */
68	link_t freed_head;	68	link_t freed_head;
69	} unused_t;	69	} unused_t;
70		70
-		71	/** Futex protecting the list of unused structures. */
-		72	static futex_t unused_futex = FUTEX_INITIALIZER;
-		73
-		74	/** List of unused structures. */
71	static LIST_INITIALIZE(unused_head);	75	static LIST_INITIALIZE(unused_head);
72		76
-		77	/** Futex protecting the up_hash and ui_hash.
-		78	*
-		79	* The locking strategy assumes that there will be at most one fibril for each
-		80	* dev_handle. Therefore it will be sufficient to hold the futex for shorter
-		81	* times (i.e. only during hash table operations as opposed to holding it the
-		82	* whole time between an unsuccessful find and the following insert). Should the
-		83	* assumption break, the locking strategy for this futex will have to be
-		84	* reconsidered.
-		85	*/
-		86	static futex_t used_futex = FUTEX_INITIALIZER;
-		87
73	/**	88	/**
74	* Global hash table of all used fat_idx_t structures.	89	* Global hash table of all used fat_idx_t structures.
75	* The index structures are hashed by the dev_handle, parent node's first	90	* The index structures are hashed by the dev_handle, parent node's first
76	* cluster and index within the parent directory.	91	* cluster and index within the parent directory.
77	*/	92	*/
78	static hash_table_t up_hash;	93	static hash_table_t up_hash;
79		94
80	#define UPH_BUCKETS_LOG 12	95	#define UPH_BUCKETS_LOG 12
81	#define UPH_BUCKETS (1 << UPH_BUCKETS_LOG)	96	#define UPH_BUCKETS (1 << UPH_BUCKETS_LOG)
82		97
83	#define UPH_DH_KEY 0	98	#define UPH_DH_KEY 0
84	#define UPH_PFC_KEY 1	99	#define UPH_PFC_KEY 1
85	#define UPH_PDI_KEY 2	100	#define UPH_PDI_KEY 2
86		101
87	static hash_index_t pos_hash(unsigned long key[])	102	static hash_index_t pos_hash(unsigned long key[])
88	{	103	{
89	dev_handle_t dev_handle = (dev_handle_t)key[UPH_DH_KEY];	104	dev_handle_t dev_handle = (dev_handle_t)key[UPH_DH_KEY];
90	fat_cluster_t pfc = (fat_cluster_t)key[UPH_PFC_KEY];	105	fat_cluster_t pfc = (fat_cluster_t)key[UPH_PFC_KEY];
91	unsigned pdi = (unsigned)key[UPH_PDI_KEY];	106	unsigned pdi = (unsigned)key[UPH_PDI_KEY];
92		107
93	hash_index_t h;	108	hash_index_t h;
94		109
95	/*	110	/*
96	* The least significant half of all bits are the least significant bits	111	* The least significant half of all bits are the least significant bits
97	* of the parent node's first cluster.	112	* of the parent node's first cluster.
98	*	113	*
99	* The least significant half of the most significant half of all bits	114	* The least significant half of the most significant half of all bits
100	* are the least significant bits of the node's dentry index within the	115	* are the least significant bits of the node's dentry index within the
101	* parent directory node.	116	* parent directory node.
102	*	117	*
103	* The most significant half of the most significant half of all bits	118	* The most significant half of the most significant half of all bits
104	* are the least significant bits of the device handle.	119	* are the least significant bits of the device handle.
105	*/	120	*/
106	h = pfc & ((1 << (UPH_BUCKETS_LOG / 2)) - 1);	121	h = pfc & ((1 << (UPH_BUCKETS_LOG / 2)) - 1);
107	h \|= (pdi & ((1 << (UPH_BUCKETS_LOG / 4)) - 1)) <<	122	h \|= (pdi & ((1 << (UPH_BUCKETS_LOG / 4)) - 1)) <<
108	(UPH_BUCKETS_LOG / 2);	123	(UPH_BUCKETS_LOG / 2);
109	h \|= (dev_handle & ((1 << (UPH_BUCKETS_LOG / 4)) - 1)) <<	124	h \|= (dev_handle & ((1 << (UPH_BUCKETS_LOG / 4)) - 1)) <<
110	(3 * (UPH_BUCKETS_LOG / 4));	125	(3 * (UPH_BUCKETS_LOG / 4));
111		126
112	return h;	127	return h;
113	}	128	}
114		129
115	static int pos_compare(unsigned long key[], hash_count_t keys, link_t *item)	130	static int pos_compare(unsigned long key[], hash_count_t keys, link_t *item)
116	{	131	{
117	dev_handle_t dev_handle = (dev_handle_t)key[UPH_DH_KEY];	132	dev_handle_t dev_handle = (dev_handle_t)key[UPH_DH_KEY];
118	fat_cluster_t pfc = (fat_cluster_t)key[UPH_PFC_KEY];	133	fat_cluster_t pfc = (fat_cluster_t)key[UPH_PFC_KEY];
119	unsigned pdi = (unsigned)key[UPH_PDI_KEY];	134	unsigned pdi = (unsigned)key[UPH_PDI_KEY];
120	fat_idx_t *fidx = list_get_instance(item, fat_idx_t, uph_link);	135	fat_idx_t *fidx = list_get_instance(item, fat_idx_t, uph_link);
121		136
122	return (dev_handle == fidx->dev_handle) && (pfc == fidx->pfc) &&	137	return (dev_handle == fidx->dev_handle) && (pfc == fidx->pfc) &&
123	(pdi == fidx->pdi);	138	(pdi == fidx->pdi);
124	}	139	}
125		140
126	static void pos_remove_callback(link_t *item)	141	static void pos_remove_callback(link_t *item)
127	{	142	{
128	/* nothing to do */	143	/* nothing to do */
129	}	144	}
130		145
131	static hash_table_operations_t uph_ops = {	146	static hash_table_operations_t uph_ops = {
132	.hash = pos_hash,	147	.hash = pos_hash,
133	.compare = pos_compare,	148	.compare = pos_compare,
134	.remove_callback = pos_remove_callback,	149	.remove_callback = pos_remove_callback,
135	};	150	};
136		151
137	/**	152	/**
138	* Global hash table of all used fat_idx_t structures.	153	* Global hash table of all used fat_idx_t structures.
139	* The index structures are hashed by the dev_handle and index.	154	* The index structures are hashed by the dev_handle and index.
140	*/	155	*/
141	static hash_table_t ui_hash;	156	static hash_table_t ui_hash;
142		157
143	#define UIH_BUCKETS_LOG 12	158	#define UIH_BUCKETS_LOG 12
144	#define UIH_BUCKETS (1 << UIH_BUCKETS_LOG)	159	#define UIH_BUCKETS (1 << UIH_BUCKETS_LOG)
145		160
146	#define UIH_DH_KEY 0	161	#define UIH_DH_KEY 0
147	#define UIH_INDEX_KEY 1	162	#define UIH_INDEX_KEY 1
148		163
149	static hash_index_t idx_hash(unsigned long key[])	164	static hash_index_t idx_hash(unsigned long key[])
150	{	165	{
151	dev_handle_t dev_handle = (dev_handle_t)key[UIH_DH_KEY];	166	dev_handle_t dev_handle = (dev_handle_t)key[UIH_DH_KEY];
152	fs_index_t index = (fs_index_t)key[UIH_INDEX_KEY];	167	fs_index_t index = (fs_index_t)key[UIH_INDEX_KEY];
153		168
154	hash_index_t h;	169	hash_index_t h;
155		170
156	h = dev_handle & ((1 << (UIH_BUCKETS_LOG / 2)) - 1);	171	h = dev_handle & ((1 << (UIH_BUCKETS_LOG / 2)) - 1);
157	h \|= (index & ((1 << (UIH_BUCKETS_LOG / 2)) - 1)) <<	172	h \|= (index & ((1 << (UIH_BUCKETS_LOG / 2)) - 1)) <<
158	(UIH_BUCKETS_LOG / 2);	173	(UIH_BUCKETS_LOG / 2);
159		174
160	return h;	175	return h;
161	}	176	}
162		177
163	static int idx_compare(unsigned long key[], hash_count_t keys, link_t *item)	178	static int idx_compare(unsigned long key[], hash_count_t keys, link_t *item)
164	{	179	{
165	dev_handle_t dev_handle = (dev_handle_t)key[UIH_DH_KEY];	180	dev_handle_t dev_handle = (dev_handle_t)key[UIH_DH_KEY];
166	fs_index_t index = (fs_index_t)key[UIH_INDEX_KEY];	181	fs_index_t index = (fs_index_t)key[UIH_INDEX_KEY];
167	fat_idx_t *fidx = list_get_instance(item, fat_idx_t, uih_link);	182	fat_idx_t *fidx = list_get_instance(item, fat_idx_t, uih_link);
168		183
169	return (dev_handle == fidx->dev_handle) && (index == fidx->index);	184	return (dev_handle == fidx->dev_handle) && (index == fidx->index);
170	}	185	}
171		186
172	static void idx_remove_callback(link_t *item)	187	static void idx_remove_callback(link_t *item)
173	{	188	{
174	/* nothing to do */	189	/* nothing to do */
175	}	190	}
176		191
177	static hash_table_operations_t uih_ops = {	192	static hash_table_operations_t uih_ops = {
178	.hash = idx_hash,	193	.hash = idx_hash,
179	.compare = idx_compare,	194	.compare = idx_compare,
180	.remove_callback = idx_remove_callback,	195	.remove_callback = idx_remove_callback,
181	};	196	};
182		197
183	/** Allocate a VFS index which is not currently in use. */	198	/** Allocate a VFS index which is not currently in use. */
184	static bool fat_idx_alloc(dev_handle_t dev_handle, fs_index_t *index)	199	static bool fat_idx_alloc(dev_handle_t dev_handle, fs_index_t *index)
185	{	200	{
186	link_t *l;	201	link_t *l;
187	unused_t *u;	202	unused_t *u;
188		203
189	assert(index);	204	assert(index);
-		205	futex_down(&unused_futex);
190	for (l = unused_head.next; l != &unused_head; l = l->next) {	206	for (l = unused_head.next; l != &unused_head; l = l->next) {
191	u = list_get_instance(l, unused_t, link);	207	u = list_get_instance(l, unused_t, link);
192	if (u->dev_handle == dev_handle)	208	if (u->dev_handle == dev_handle)
193	goto hit;	209	goto hit;
194	}	210	}
-		211	futex_up(&unused_futex);
195		212
196	/* dev_handle not found */	213	/* dev_handle not found */
197	return false;	214	return false;
198		215
199	hit:	216	hit:
200	if (list_empty(&u->freed_head)) {	217	if (list_empty(&u->freed_head)) {
201	if (u->remaining) {	218	if (u->remaining) {
202	/*	219	/*
203	* There are no freed indices, allocate one directly	220	* There are no freed indices, allocate one directly
204	* from the counter.	221	* from the counter.
205	*/	222	*/
206	*index = u->next++;	223	*index = u->next++;
207	--u->remaining;	224	--u->remaining;
-		225	futex_up(&unused_futex);
208	return true;	226	return true;
209	}	227	}
210	} else {	228	} else {
211	/* There are some freed indices which we can reuse. */	229	/* There are some freed indices which we can reuse. */
212	freed_t *f = list_get_instance(u->freed_head.next, freed_t,	230	freed_t *f = list_get_instance(u->freed_head.next, freed_t,
213	link);	231	link);
214	*index = f->first;	232	*index = f->first;
215	if (f->first++ == f->last) {	233	if (f->first++ == f->last) {
216	/* Destroy the interval. */	234	/* Destroy the interval. */
217	list_remove(&f->link);	235	list_remove(&f->link);
218	free(f);	236	free(f);
219	}	237	}
-		238	futex_up(&unused_futex);
220	return true;	239	return true;
221	}	240	}
222	/*	241	/*
223	* We ran out of indices, which is extremely unlikely with FAT16, but	242	* We ran out of indices, which is extremely unlikely with FAT16, but
224	* theoretically still possible (e.g. too many open unlinked nodes or	243	* theoretically still possible (e.g. too many open unlinked nodes or
225	* too many zero-sized nodes).	244	* too many zero-sized nodes).
226	*/	245	*/
-		246	futex_up(&unused_futex);
227	return false;	247	return false;
228	}	248	}
229		249
230	/** If possible, coalesce two intervals of freed indices. */	250	/** If possible, coalesce two intervals of freed indices. */
231	static void try_coalesce_intervals(link_t l, link_t r, link_t *cur)	251	static void try_coalesce_intervals(link_t l, link_t r, link_t *cur)
232	{	252	{
233	freed_t *fl = list_get_instance(l, freed_t, link);	253	freed_t *fl = list_get_instance(l, freed_t, link);
234	freed_t *fr = list_get_instance(r, freed_t, link);	254	freed_t *fr = list_get_instance(r, freed_t, link);
235		255
236	if (fl->last + 1 == fr->first) {	256	if (fl->last + 1 == fr->first) {
237	if (cur == l) {	257	if (cur == l) {
238	fl->last = fr->last;	258	fl->last = fr->last;
239	list_remove(r);	259	list_remove(r);
240	free(r);	260	free(r);
241	} else {	261	} else {
242	fr->first = fl->first;	262	fr->first = fl->first;
243	list_remove(l);	263	list_remove(l);
244	free(l);	264	free(l);
245	}	265	}
246	}	266	}
247	}	267	}
248		268
249	/** Free a VFS index, which is no longer in use. */	269	/** Free a VFS index, which is no longer in use. */
250	static void fat_idx_free(dev_handle_t dev_handle, fs_index_t index)	270	static void fat_idx_free(dev_handle_t dev_handle, fs_index_t index)
251	{	271	{
252	link_t *l;	272	link_t *l;
253	unused_t *u;	273	unused_t *u;
254		274
-		275	futex_down(&unused_futex);
255	for (l = unused_head.next; l != &unused_head; l = l->next) {	276	for (l = unused_head.next; l != &unused_head; l = l->next) {
256	u = list_get_instance(l, unused_t, link);	277	u = list_get_instance(l, unused_t, link);
257	if (u->dev_handle == dev_handle)	278	if (u->dev_handle == dev_handle)
258	goto hit;	279	goto hit;
259	}	280	}
-		281	futex_up(&unused_futex);
260		282
261	/* should not happen */	283	/* should not happen */
262	assert(0);	284	assert(0);
263		285
264	hit:	286	hit:
265	if (u->next == index + 1) {	287	if (u->next == index + 1) {
266	/* The index can be returned directly to the counter. */	288	/* The index can be returned directly to the counter. */
267	u->next--;	289	u->next--;
268	u->remaining++;	290	u->remaining++;
269	return;	-
270	} else {	291	} else {
271	/*	292	/*
272	* The index must be returned either to an existing freed	293	* The index must be returned either to an existing freed
273	* interval or a new interval must be created.	294	* interval or a new interval must be created.
274	*/	295	*/
275	link_t *lnk;	296	link_t *lnk;
276	freed_t *n;	297	freed_t *n;
277	for (lnk = u->freed_head.next; lnk != &u->freed_head;	298	for (lnk = u->freed_head.next; lnk != &u->freed_head;
278	lnk = lnk->next) {	299	lnk = lnk->next) {
279	freed_t *f = list_get_instance(lnk, freed_t, link);	300	freed_t *f = list_get_instance(lnk, freed_t, link);
280	if (f->first == index + 1) {	301	if (f->first == index + 1) {
281	f->first--;	302	f->first--;
282	if (lnk->prev != &u->freed_head)	303	if (lnk->prev != &u->freed_head)
283	try_coalesce_intervals(lnk->prev, lnk,	304	try_coalesce_intervals(lnk->prev, lnk,
284	lnk);	305	lnk);
-		306	futex_up(&unused_futex);
285	return;	307	return;
286	}	308	}
287	if (f->last == index - 1) {	309	if (f->last == index - 1) {
288	f->last++;	310	f->last++;
289	if (lnk->next != &u->freed_head)	311	if (lnk->next != &u->freed_head)
290	try_coalesce_intervals(lnk, lnk->next,	312	try_coalesce_intervals(lnk, lnk->next,
291	lnk);	313	lnk);
-		314	futex_up(&unused_futex);
292	return;	315	return;
293	}	316	}
294	if (index > f->first) {	317	if (index > f->first) {
295	n = malloc(sizeof(freed_t));	318	n = malloc(sizeof(freed_t));
296	/* TODO: sleep until allocation succeeds */	319	/* TODO: sleep until allocation succeeds */
297	assert(n);	320	assert(n);
298	link_initialize(&n->link);	321	link_initialize(&n->link);
299	n->first = index;	322	n->first = index;
300	n->last = index;	323	n->last = index;
301	list_insert_before(&n->link, lnk);	324	list_insert_before(&n->link, lnk);
-		325	futex_up(&unused_futex);
302	return;	326	return;
303	}	327	}
304		328
305	}	329	}
306	/* The index will form the last interval. */	330	/* The index will form the last interval. */
307	n = malloc(sizeof(freed_t));	331	n = malloc(sizeof(freed_t));
308	/* TODO: sleep until allocation succeeds */	332	/* TODO: sleep until allocation succeeds */
309	assert(n);	333	assert(n);
310	link_initialize(&n->link);	334	link_initialize(&n->link);
311	n->first = index;	335	n->first = index;
312	n->last = index;	336	n->last = index;
313	list_append(&n->link, &u->freed_head);	337	list_append(&n->link, &u->freed_head);
314	}	338	}
-		339	futex_up(&unused_futex);
315	}	340	}
316		341
317	fat_idx_t *	342	fat_idx_t *
318	fat_idx_get_by_pos(dev_handle_t dev_handle, fat_cluster_t pfc, unsigned pdi)	343	fat_idx_get_by_pos(dev_handle_t dev_handle, fat_cluster_t pfc, unsigned pdi)
319	{	344	{
320	fat_idx_t *fidx;	345	fat_idx_t *fidx;
321	link_t *l;	346	link_t *l;
322	unsigned long pkey[] = {	347	unsigned long pkey[] = {
323	[UPH_DH_KEY] = dev_handle,	348	[UPH_DH_KEY] = dev_handle,
324	[UPH_PFC_KEY] = pfc,	349	[UPH_PFC_KEY] = pfc,
325	[UPH_PDI_KEY] = pdi,	350	[UPH_PDI_KEY] = pdi,
326	};	351	};
327		352
-		353	futex_down(&used_futex);
328	l = hash_table_find(&up_hash, pkey);	354	l = hash_table_find(&up_hash, pkey);
-		355	futex_up(&used_futex);
329	if (l) {	356	if (l) {
330	fidx = hash_table_get_instance(l, fat_idx_t, uph_link);	357	fidx = hash_table_get_instance(l, fat_idx_t, uph_link);
331	} else {	358	} else {
332	fidx = (fat_idx_t *) malloc(sizeof(fat_idx_t));	359	fidx = (fat_idx_t *) malloc(sizeof(fat_idx_t));
333	if (!fidx) {	360	if (!fidx) {
334	return NULL;	361	return NULL;
335	}	362	}
336	if (!fat_idx_alloc(dev_handle, &fidx->index)) {	363	if (!fat_idx_alloc(dev_handle, &fidx->index)) {
337	free(fidx);	364	free(fidx);
338	return NULL;	365	return NULL;
339	}	366	}
340		367
341	unsigned long ikey[] = {	368	unsigned long ikey[] = {
342	[UIH_DH_KEY] = dev_handle,	369	[UIH_DH_KEY] = dev_handle,
343	[UIH_INDEX_KEY] = fidx->index,	370	[UIH_INDEX_KEY] = fidx->index,
344	};	371	};
345		372
346	link_initialize(&fidx->uph_link);	373	link_initialize(&fidx->uph_link);
347	link_initialize(&fidx->uih_link);	374	link_initialize(&fidx->uih_link);
348	fidx->dev_handle = dev_handle;	375	fidx->dev_handle = dev_handle;
349	fidx->pfc = pfc;	376	fidx->pfc = pfc;
350	fidx->pdi = pdi;	377	fidx->pdi = pdi;
351	fidx->nodep = NULL;	378	fidx->nodep = NULL;
352		379
-		380	futex_down(&used_futex);
353	hash_table_insert(&up_hash, pkey, &fidx->uph_link);	381	hash_table_insert(&up_hash, pkey, &fidx->uph_link);
354	hash_table_insert(&ui_hash, ikey, &fidx->uih_link);	382	hash_table_insert(&ui_hash, ikey, &fidx->uih_link);
-		383	futex_up(&used_futex);
355	}	384	}
356		385
357	return fidx;	386	return fidx;
358	}	387	}
359		388
360	fat_idx_t *	389	fat_idx_t *
361	fat_idx_get_by_index(dev_handle_t dev_handle, fs_index_t index)	390	fat_idx_get_by_index(dev_handle_t dev_handle, fs_index_t index)
362	{	391	{
363	fat_idx_t *fidx = NULL;	392	fat_idx_t *fidx = NULL;
364	link_t *l;	393	link_t *l;
365	unsigned long ikey[] = {	394	unsigned long ikey[] = {
366	[UIH_DH_KEY] = dev_handle,	395	[UIH_DH_KEY] = dev_handle,
367	[UIH_INDEX_KEY] = index,	396	[UIH_INDEX_KEY] = index,
368	};	397	};
369		398
-		399	futex_down(&used_futex);
370	l = hash_table_find(&ui_hash, ikey);	400	l = hash_table_find(&ui_hash, ikey);
-		401	futex_up(&used_futex);
371	if (l) {	402	if (l) {
372	fidx = hash_table_get_instance(l, fat_idx_t, uih_link);	403	fidx = hash_table_get_instance(l, fat_idx_t, uih_link);
373	}	404	}
374		405
375	return fidx;	406	return fidx;
376	}	407	}
377		408
378		409

Subversion Repositories HelenOS

(root)/branches/dynload/uspace/srv/fs/fat/fat_idx.c – Rev 2927 → 2948