Subversion Repositories HelenOS

Rev

Rev 4419 | Rev 4439 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 4419 Rev 4420
Line 53... Line 53...
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
#define FAT_NODE(node)  ((node) ? (fat_node_t *) (node)->data : NULL)
-
 
59
#define FS_NODE(node)   ((node) ? (node)->bp : NULL)
-
 
60
 
58
/** Futex protecting the list of cached free FAT nodes. */
61
/** Futex protecting the list of cached free FAT nodes. */
59
static futex_t ffn_futex = FUTEX_INITIALIZER;
62
static futex_t ffn_futex = FUTEX_INITIALIZER;
60
 
63
 
61
/** List of cached free FAT nodes. */
64
/** List of cached free FAT nodes. */
62
static LIST_INITIALIZE(ffn_head);
65
static LIST_INITIALIZE(ffn_head);
63
 
66
 
64
static void fat_node_initialize(fat_node_t *node)
67
static void fat_node_initialize(fat_node_t *node)
65
{
68
{
66
    futex_initialize(&node->lock, 1);
69
    futex_initialize(&node->lock, 1);
-
 
70
    node->bp = NULL;
67
    node->idx = NULL;
71
    node->idx = NULL;
68
    node->type = 0;
72
    node->type = 0;
69
    link_initialize(&node->ffn_link);
73
    link_initialize(&node->ffn_link);
70
    node->size = 0;
74
    node->size = 0;
71
    node->lnkcnt = 0;
75
    node->lnkcnt = 0;
Line 106... Line 110...
106
    block_put(b);
110
    block_put(b);
107
}
111
}
108
 
112
 
109
static fat_node_t *fat_node_get_new(void)
113
static fat_node_t *fat_node_get_new(void)
110
{
114
{
-
 
115
    fs_node_t *fn;
111
    fat_node_t *nodep;
116
    fat_node_t *nodep;
112
 
117
 
113
    futex_down(&ffn_futex);
118
    futex_down(&ffn_futex);
114
    if (!list_empty(&ffn_head)) {
119
    if (!list_empty(&ffn_head)) {
115
        /* Try to use a cached free node structure. */
120
        /* Try to use a cached free node structure. */
Line 127... Line 132...
127
        if (nodep->dirty)
132
        if (nodep->dirty)
128
            fat_node_sync(nodep);
133
            fat_node_sync(nodep);
129
        idxp_tmp->nodep = NULL;
134
        idxp_tmp->nodep = NULL;
130
        futex_up(&nodep->lock);
135
        futex_up(&nodep->lock);
131
        futex_up(&idxp_tmp->lock);
136
        futex_up(&idxp_tmp->lock);
-
 
137
        fn = FS_NODE(nodep);
132
    } else {
138
    } else {
133
skip_cache:
139
skip_cache:
134
        /* Try to allocate a new node structure. */
140
        /* Try to allocate a new node structure. */
135
        futex_up(&ffn_futex);
141
        futex_up(&ffn_futex);
-
 
142
        fn = (fs_node_t *)malloc(sizeof(fs_node_t));
-
 
143
        if (!fn)
-
 
144
            return NULL;
136
        nodep = (fat_node_t *)malloc(sizeof(fat_node_t));
145
        nodep = (fat_node_t *)malloc(sizeof(fat_node_t));
137
        if (!nodep)
146
        if (!nodep) {
-
 
147
            free(fn);
138
            return NULL;
148
            return NULL;
-
 
149
        }
139
    }
150
    }
140
    fat_node_initialize(nodep);
151
    fat_node_initialize(nodep);
-
 
152
    fs_node_initialize(fn);
-
 
153
    fn->data = nodep;
-
 
154
    nodep->bp = fn;
141
   
155
   
142
    return nodep;
156
    return nodep;
143
}
157
}
144
 
158
 
145
/** Internal version of fat_node_get().
159
/** Internal version of fat_node_get().
146
 *
160
 *
147
 * @param idxp      Locked index structure.
161
 * @param idxp      Locked index structure.
148
 */
162
 */
149
static void *fat_node_get_core(fat_idx_t *idxp)
163
static fat_node_t *fat_node_get_core(fat_idx_t *idxp)
150
{
164
{
151
    block_t *b;
165
    block_t *b;
152
    fat_bs_t *bs;
166
    fat_bs_t *bs;
153
    fat_dentry_t *d;
167
    fat_dentry_t *d;
154
    fat_node_t *nodep = NULL;
168
    fat_node_t *nodep = NULL;
Line 221... Line 235...
221
}
235
}
222
 
236
 
223
/*
237
/*
224
 * Forward declarations of FAT libfs operations.
238
 * Forward declarations of FAT libfs operations.
225
 */
239
 */
226
static void *fat_node_get(dev_handle_t, fs_index_t);
240
static fs_node_t *fat_node_get(dev_handle_t, fs_index_t);
227
static void fat_node_put(void *);
241
static void fat_node_put(fs_node_t *);
228
static void *fat_create_node(dev_handle_t, int);
242
static fs_node_t *fat_create_node(dev_handle_t, int);
229
static int fat_destroy_node(void *);
243
static int fat_destroy_node(fs_node_t *);
230
static int fat_link(void *, void *, const char *);
244
static int fat_link(fs_node_t *, fs_node_t *, const char *);
231
static int fat_unlink(void *, void *);
245
static int fat_unlink(fs_node_t *, fs_node_t *, const char *);
232
static void *fat_match(void *, const char *);
246
static fs_node_t *fat_match(fs_node_t *, const char *);
233
static fs_index_t fat_index_get(void *);
247
static fs_index_t fat_index_get(fs_node_t *);
234
static size_t fat_size_get(void *);
248
static size_t fat_size_get(fs_node_t *);
235
static unsigned fat_lnkcnt_get(void *);
249
static unsigned fat_lnkcnt_get(fs_node_t *);
236
static bool fat_has_children(void *);
250
static bool fat_has_children(fs_node_t *);
237
static void *fat_root_get(dev_handle_t);
251
static fs_node_t *fat_root_get(dev_handle_t);
238
static char fat_plb_get_char(unsigned);
252
static char fat_plb_get_char(unsigned);
239
static bool fat_is_directory(void *);
253
static bool fat_is_directory(fs_node_t *);
240
static bool fat_is_file(void *node);
254
static bool fat_is_file(fs_node_t *node);
241
 
255
 
242
/*
256
/*
243
 * FAT libfs operations.
257
 * FAT libfs operations.
244
 */
258
 */
245
 
259
 
246
/** Instantiate a FAT in-core node. */
260
/** Instantiate a FAT in-core node. */
247
void *fat_node_get(dev_handle_t dev_handle, fs_index_t index)
261
fs_node_t *fat_node_get(dev_handle_t dev_handle, fs_index_t index)
248
{
262
{
249
    void *node;
263
    fat_node_t *nodep;
250
    fat_idx_t *idxp;
264
    fat_idx_t *idxp;
251
 
265
 
252
    idxp = fat_idx_get_by_index(dev_handle, index);
266
    idxp = fat_idx_get_by_index(dev_handle, index);
253
    if (!idxp)
267
    if (!idxp)
254
        return NULL;
268
        return NULL;
255
    /* idxp->lock held */
269
    /* idxp->lock held */
256
    node = fat_node_get_core(idxp);
270
    nodep = fat_node_get_core(idxp);
257
    futex_up(&idxp->lock);
271
    futex_up(&idxp->lock);
258
    return node;
272
    return FS_NODE(nodep);
259
}
273
}
260
 
274
 
261
void fat_node_put(void *node)
275
void fat_node_put(fs_node_t *fn)
262
{
276
{
263
    fat_node_t *nodep = (fat_node_t *)node;
277
    fat_node_t *nodep = FAT_NODE(fn);
264
    bool destroy = false;
278
    bool destroy = false;
265
 
279
 
266
    futex_down(&nodep->lock);
280
    futex_down(&nodep->lock);
267
    if (!--nodep->refcnt) {
281
    if (!--nodep->refcnt) {
268
        if (nodep->idx) {
282
        if (nodep->idx) {
Line 278... Line 292...
278
             */
292
             */
279
            destroy = true;
293
            destroy = true;
280
        }
294
        }
281
    }
295
    }
282
    futex_up(&nodep->lock);
296
    futex_up(&nodep->lock);
283
    if (destroy)
297
    if (destroy) {
-
 
298
        free(nodep->bp);
284
        free(node);
299
        free(nodep);
-
 
300
    }
285
}
301
}
286
 
302
 
287
void *fat_create_node(dev_handle_t dev_handle, int flags)
303
fs_node_t *fat_create_node(dev_handle_t dev_handle, int flags)
288
{
304
{
289
    fat_idx_t *idxp;
305
    fat_idx_t *idxp;
290
    fat_node_t *nodep;
306
    fat_node_t *nodep;
291
    fat_bs_t *bs;
307
    fat_bs_t *bs;
292
    fat_cluster_t mcl, lcl;
308
    fat_cluster_t mcl, lcl;
Line 308... Line 324...
308
        return NULL;
324
        return NULL;
309
    }
325
    }
310
    idxp = fat_idx_get_new(dev_handle);
326
    idxp = fat_idx_get_new(dev_handle);
311
    if (!idxp) {
327
    if (!idxp) {
312
        fat_free_clusters(bs, dev_handle, mcl);
328
        fat_free_clusters(bs, dev_handle, mcl);
313
        fat_node_put(nodep);
329
        fat_node_put(FS_NODE(nodep));
314
        return NULL;
330
        return NULL;
315
    }
331
    }
316
    /* idxp->lock held */
332
    /* idxp->lock held */
317
    if (flags & L_DIRECTORY) {
333
    if (flags & L_DIRECTORY) {
318
        int i;
334
        int i;
Line 343... Line 359...
343
 
359
 
344
    nodep->idx = idxp;
360
    nodep->idx = idxp;
345
    idxp->nodep = nodep;
361
    idxp->nodep = nodep;
346
 
362
 
347
    futex_up(&idxp->lock);
363
    futex_up(&idxp->lock);
348
    return nodep;
364
    return FS_NODE(nodep);
349
}
365
}
350
 
366
 
351
int fat_destroy_node(void *node)
367
int fat_destroy_node(fs_node_t *fn)
352
{
368
{
353
    fat_node_t *nodep = (fat_node_t *)node;
369
    fat_node_t *nodep = FAT_NODE(fn);
354
    fat_bs_t *bs;
370
    fat_bs_t *bs;
355
 
371
 
356
    /*
372
    /*
357
     * The node is not reachable from the file system. This means that the
373
     * The node is not reachable from the file system. This means that the
358
     * link count should be zero and that the index structure cannot be
374
     * link count should be zero and that the index structure cannot be
Line 362... Line 378...
362
    assert(nodep->lnkcnt == 0);
378
    assert(nodep->lnkcnt == 0);
363
 
379
 
364
    /*
380
    /*
365
     * The node may not have any children.
381
     * The node may not have any children.
366
     */
382
     */
367
    assert(fat_has_children(node) == false);
383
    assert(fat_has_children(fn) == false);
368
 
384
 
369
    bs = block_bb_get(nodep->idx->dev_handle);
385
    bs = block_bb_get(nodep->idx->dev_handle);
370
    if (nodep->firstc != FAT_CLST_RES0) {
386
    if (nodep->firstc != FAT_CLST_RES0) {
371
        assert(nodep->size);
387
        assert(nodep->size);
372
        /* Free all clusters allocated to the node. */
388
        /* Free all clusters allocated to the node. */
373
        fat_free_clusters(bs, nodep->idx->dev_handle, nodep->firstc);
389
        fat_free_clusters(bs, nodep->idx->dev_handle, nodep->firstc);
374
    }
390
    }
375
 
391
 
376
    fat_idx_destroy(nodep->idx);
392
    fat_idx_destroy(nodep->idx);
-
 
393
    free(nodep->bp);
377
    free(nodep);
394
    free(nodep);
378
    return EOK;
395
    return EOK;
379
}
396
}
380
 
397
 
381
int fat_link(void *prnt, void *chld, const char *name)
398
int fat_link(fs_node_t *pfn, fs_node_t *cfn, const char *name)
382
{
399
{
383
    fat_node_t *parentp = (fat_node_t *)prnt;
400
    fat_node_t *parentp = FAT_NODE(pfn);
384
    fat_node_t *childp = (fat_node_t *)chld;
401
    fat_node_t *childp = FAT_NODE(cfn);
385
    fat_dentry_t *d;
402
    fat_dentry_t *d;
386
    fat_bs_t *bs;
403
    fat_bs_t *bs;
387
    block_t *b;
404
    block_t *b;
388
    int i, j;
405
    int i, j;
389
    uint16_t bps;
406
    uint16_t bps;
Line 525... Line 542...
525
    fat_idx_hashin(childp->idx);
542
    fat_idx_hashin(childp->idx);
526
 
543
 
527
    return EOK;
544
    return EOK;
528
}
545
}
529
 
546
 
530
int fat_unlink(void *prnt, void *chld)
547
int fat_unlink(fs_node_t *pfn, fs_node_t *cfn, const char *nm)
531
{
548
{
532
    fat_node_t *parentp = (fat_node_t *)prnt;
549
    fat_node_t *parentp = FAT_NODE(pfn);
533
    fat_node_t *childp = (fat_node_t *)chld;
550
    fat_node_t *childp = FAT_NODE(cfn);
534
    fat_bs_t *bs;
551
    fat_bs_t *bs;
535
    fat_dentry_t *d;
552
    fat_dentry_t *d;
536
    uint16_t bps;
553
    uint16_t bps;
537
    block_t *b;
554
    block_t *b;
538
 
555
 
-
 
556
    if (!parentp)
-
 
557
        return EBUSY;
-
 
558
   
-
 
559
    if (fat_has_children(cfn))
-
 
560
        return ENOTEMPTY;
-
 
561
 
539
    futex_down(&parentp->lock);
562
    futex_down(&parentp->lock);
540
    futex_down(&childp->lock);
563
    futex_down(&childp->lock);
541
    assert(childp->lnkcnt == 1);
564
    assert(childp->lnkcnt == 1);
542
    futex_down(&childp->idx->lock);
565
    futex_down(&childp->idx->lock);
543
    bs = block_bb_get(childp->idx->dev_handle);
566
    bs = block_bb_get(childp->idx->dev_handle);
Line 565... Line 588...
565
    futex_up(&parentp->lock);
588
    futex_up(&parentp->lock);
566
 
589
 
567
    return EOK;
590
    return EOK;
568
}
591
}
569
 
592
 
570
void *fat_match(void *prnt, const char *component)
593
fs_node_t *fat_match(fs_node_t *pfn, const char *component)
571
{
594
{
572
    fat_bs_t *bs;
595
    fat_bs_t *bs;
573
    fat_node_t *parentp = (fat_node_t *)prnt;
596
    fat_node_t *parentp = FAT_NODE(pfn);
574
    char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1];
597
    char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1];
575
    unsigned i, j;
598
    unsigned i, j;
576
    unsigned bps;       /* bytes per sector */
599
    unsigned bps;       /* bytes per sector */
577
    unsigned dps;       /* dentries per sector */
600
    unsigned dps;       /* dentries per sector */
578
    unsigned blocks;
601
    unsigned blocks;
Line 601... Line 624...
601
                fat_dentry_name_get(d, name);
624
                fat_dentry_name_get(d, name);
602
                break;
625
                break;
603
            }
626
            }
604
            if (fat_dentry_namecmp(name, component) == 0) {
627
            if (fat_dentry_namecmp(name, component) == 0) {
605
                /* hit */
628
                /* hit */
606
                void *node;
629
                fat_node_t *nodep;
607
                /*
630
                /*
608
                 * Assume tree hierarchy for locking.  We
631
                 * Assume tree hierarchy for locking.  We
609
                 * already have the parent and now we are going
632
                 * already have the parent and now we are going
610
                 * to lock the child.  Never lock in the oposite
633
                 * to lock the child.  Never lock in the oposite
611
                 * order.
634
                 * order.
Line 620... Line 643...
620
                     * run out of 32-bit indices.
643
                     * run out of 32-bit indices.
621
                     */
644
                     */
622
                    block_put(b);
645
                    block_put(b);
623
                    return NULL;
646
                    return NULL;
624
                }
647
                }
625
                node = fat_node_get_core(idx);
648
                nodep = fat_node_get_core(idx);
626
                futex_up(&idx->lock);
649
                futex_up(&idx->lock);
627
                block_put(b);
650
                block_put(b);
628
                return node;
651
                return FS_NODE(nodep);
629
            }
652
            }
630
        }
653
        }
631
        block_put(b);
654
        block_put(b);
632
    }
655
    }
633
 
656
 
634
    futex_up(&parentp->idx->lock);
657
    futex_up(&parentp->idx->lock);
635
    return NULL;
658
    return NULL;
636
}
659
}
637
 
660
 
638
fs_index_t fat_index_get(void *node)
661
fs_index_t fat_index_get(fs_node_t *fn)
639
{
662
{
640
    fat_node_t *fnodep = (fat_node_t *)node;
-
 
641
    if (!fnodep)
-
 
642
        return 0;
-
 
643
    return fnodep->idx->index;
663
    return FAT_NODE(fn)->idx->index;
644
}
664
}
645
 
665
 
646
size_t fat_size_get(void *node)
666
size_t fat_size_get(fs_node_t *fn)
647
{
667
{
648
    return ((fat_node_t *)node)->size;
668
    return FAT_NODE(fn)->size;
649
}
669
}
650
 
670
 
651
unsigned fat_lnkcnt_get(void *node)
671
unsigned fat_lnkcnt_get(fs_node_t *fn)
652
{
672
{
653
    return ((fat_node_t *)node)->lnkcnt;
673
    return FAT_NODE(fn)->lnkcnt;
654
}
674
}
655
 
675
 
656
bool fat_has_children(void *node)
676
bool fat_has_children(fs_node_t *fn)
657
{
677
{
658
    fat_bs_t *bs;
678
    fat_bs_t *bs;
659
    fat_node_t *nodep = (fat_node_t *)node;
679
    fat_node_t *nodep = FAT_NODE(fn);
660
    unsigned bps;
680
    unsigned bps;
661
    unsigned dps;
681
    unsigned dps;
662
    unsigned blocks;
682
    unsigned blocks;
663
    block_t *b;
683
    block_t *b;
664
    unsigned i, j;
684
    unsigned i, j;
Line 702... Line 722...
702
 
722
 
703
    futex_up(&nodep->idx->lock);
723
    futex_up(&nodep->idx->lock);
704
    return false;
724
    return false;
705
}
725
}
706
 
726
 
707
void *fat_root_get(dev_handle_t dev_handle)
727
fs_node_t *fat_root_get(dev_handle_t dev_handle)
708
{
728
{
709
    return fat_node_get(dev_handle, 0);
729
    return fat_node_get(dev_handle, 0);
710
}
730
}
711
 
731
 
712
char fat_plb_get_char(unsigned pos)
732
char fat_plb_get_char(unsigned pos)
713
{
733
{
714
    return fat_reg.plb_ro[pos % PLB_SIZE];
734
    return fat_reg.plb_ro[pos % PLB_SIZE];
715
}
735
}
716
 
736
 
717
bool fat_is_directory(void *node)
737
bool fat_is_directory(fs_node_t *fn)
718
{
738
{
719
    return ((fat_node_t *)node)->type == FAT_DIRECTORY;
739
    return FAT_NODE(fn)->type == FAT_DIRECTORY;
720
}
740
}
721
 
741
 
722
bool fat_is_file(void *node)
742
bool fat_is_file(fs_node_t *fn)
723
{
743
{
724
    return ((fat_node_t *)node)->type == FAT_FILE;
744
    return FAT_NODE(fn)->type == FAT_FILE;
725
}
745
}
726
 
746
 
727
/** libfs operations */
747
/** libfs operations */
728
libfs_ops_t fat_libfs_ops = {
748
libfs_ops_t fat_libfs_ops = {
729
    .match = fat_match,
749
    .match = fat_match,
Line 753... Line 773...
753
    fat_bs_t *bs;
773
    fat_bs_t *bs;
754
    uint16_t bps;
774
    uint16_t bps;
755
    uint16_t rde;
775
    uint16_t rde;
756
    int rc;
776
    int rc;
757
 
777
 
-
 
778
    /* accept the mount options */
-
 
779
    ipc_callid_t callid;
-
 
780
    size_t size;
-
 
781
    if (!ipc_data_write_receive(&callid, &size)) {
-
 
782
        ipc_answer_0(callid, EINVAL);
-
 
783
        ipc_answer_0(rid, EINVAL);
-
 
784
        return;
-
 
785
    }
-
 
786
    char *opts = malloc(size + 1);
-
 
787
    if (!opts) {
-
 
788
        ipc_answer_0(callid, ENOMEM);
-
 
789
        ipc_answer_0(rid, ENOMEM);
-
 
790
        return;
-
 
791
    }
-
 
792
    ipcarg_t retval = ipc_data_write_finalize(callid, opts, size);
-
 
793
    if (retval != EOK) {
-
 
794
        ipc_answer_0(rid, retval);
-
 
795
        free(opts);
-
 
796
        return;
-
 
797
    }
-
 
798
    opts[size] = '\0';
-
 
799
 
758
    /* initialize libblock */
800
    /* initialize libblock */
759
    rc = block_init(dev_handle, BS_SIZE);
801
    rc = block_init(dev_handle, BS_SIZE);
760
    if (rc != EOK) {
802
    if (rc != EOK) {
761
        ipc_answer_0(rid, rc);
803
        ipc_answer_0(rid, rc);
762
        return;
804
        return;
Line 797... Line 839...
797
        ipc_answer_0(rid, rc);
839
        ipc_answer_0(rid, rc);
798
        return;
840
        return;
799
    }
841
    }
800
 
842
 
801
    /* Initialize the root node. */
843
    /* Initialize the root node. */
-
 
844
    fs_node_t *rfn = (fs_node_t *)malloc(sizeof(fs_node_t));
-
 
845
    if (!rfn) {
-
 
846
        block_fini(dev_handle);
-
 
847
        fat_idx_fini_by_dev_handle(dev_handle);
-
 
848
        ipc_answer_0(rid, ENOMEM);
-
 
849
        return;
-
 
850
    }
-
 
851
    fs_node_initialize(rfn);
802
    fat_node_t *rootp = (fat_node_t *)malloc(sizeof(fat_node_t));
852
    fat_node_t *rootp = (fat_node_t *)malloc(sizeof(fat_node_t));
803
    if (!rootp) {
853
    if (!rootp) {
-
 
854
        free(rfn);
804
        block_fini(dev_handle);
855
        block_fini(dev_handle);
805
        fat_idx_fini_by_dev_handle(dev_handle);
856
        fat_idx_fini_by_dev_handle(dev_handle);
806
        ipc_answer_0(rid, ENOMEM);
857
        ipc_answer_0(rid, ENOMEM);
807
        return;
858
        return;
808
    }
859
    }
809
    fat_node_initialize(rootp);
860
    fat_node_initialize(rootp);
810
 
861
 
811
    fat_idx_t *ridxp = fat_idx_get_by_pos(dev_handle, FAT_CLST_ROOTPAR, 0);
862
    fat_idx_t *ridxp = fat_idx_get_by_pos(dev_handle, FAT_CLST_ROOTPAR, 0);
812
    if (!ridxp) {
863
    if (!ridxp) {
813
        block_fini(dev_handle);
864
        free(rfn);
814
        free(rootp);
865
        free(rootp);
-
 
866
        block_fini(dev_handle);
815
        fat_idx_fini_by_dev_handle(dev_handle);
867
        fat_idx_fini_by_dev_handle(dev_handle);
816
        ipc_answer_0(rid, ENOMEM);
868
        ipc_answer_0(rid, ENOMEM);
817
        return;
869
        return;
818
    }
870
    }
819
    assert(ridxp->index == 0);
871
    assert(ridxp->index == 0);
Line 824... Line 876...
824
    rootp->refcnt = 1;
876
    rootp->refcnt = 1;
825
    rootp->lnkcnt = 0;  /* FS root is not linked */
877
    rootp->lnkcnt = 0;  /* FS root is not linked */
826
    rootp->size = rde * sizeof(fat_dentry_t);
878
    rootp->size = rde * sizeof(fat_dentry_t);
827
    rootp->idx = ridxp;
879
    rootp->idx = ridxp;
828
    ridxp->nodep = rootp;
880
    ridxp->nodep = rootp;
-
 
881
    rootp->bp = rfn;
-
 
882
    rfn->data = rootp;
829
   
883
   
830
    futex_up(&ridxp->lock);
884
    futex_up(&ridxp->lock);
831
 
885
 
832
    ipc_answer_3(rid, EOK, ridxp->index, rootp->size, rootp->lnkcnt);
886
    ipc_answer_3(rid, EOK, ridxp->index, rootp->size, rootp->lnkcnt);
833
}
887
}
834
 
888
 
835
void fat_mount(ipc_callid_t rid, ipc_call_t *request)
889
void fat_mount(ipc_callid_t rid, ipc_call_t *request)
836
{
890
{
837
    ipc_answer_0(rid, ENOTSUP);
891
    libfs_mount(&fat_libfs_ops, rid, request);
838
}
892
}
839
 
893
 
840
void fat_lookup(ipc_callid_t rid, ipc_call_t *request)
894
void fat_lookup(ipc_callid_t rid, ipc_call_t *request)
841
{
895
{
842
    libfs_lookup(&fat_libfs_ops, fat_reg.fs_handle, rid, request);
896
    libfs_lookup(&fat_libfs_ops, fat_reg.fs_handle, rid, request);
Line 845... Line 899...
845
void fat_read(ipc_callid_t rid, ipc_call_t *request)
899
void fat_read(ipc_callid_t rid, ipc_call_t *request)
846
{
900
{
847
    dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);
901
    dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);
848
    fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request);
902
    fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request);
849
    off_t pos = (off_t)IPC_GET_ARG3(*request);
903
    off_t pos = (off_t)IPC_GET_ARG3(*request);
850
    fat_node_t *nodep = (fat_node_t *)fat_node_get(dev_handle, index);
904
    fs_node_t *fn = fat_node_get(dev_handle, index);
-
 
905
    fat_node_t *nodep;
851
    fat_bs_t *bs;
906
    fat_bs_t *bs;
852
    uint16_t bps;
907
    uint16_t bps;
853
    size_t bytes;
908
    size_t bytes;
854
    block_t *b;
909
    block_t *b;
855
 
910
 
856
    if (!nodep) {
911
    if (!fn) {
857
        ipc_answer_0(rid, ENOENT);
912
        ipc_answer_0(rid, ENOENT);
858
        return;
913
        return;
859
    }
914
    }
-
 
915
    nodep = FAT_NODE(fn);
860
 
916
 
861
    ipc_callid_t callid;
917
    ipc_callid_t callid;
862
    size_t len;
918
    size_t len;
863
    if (!ipc_data_read_receive(&callid, &len)) {
919
    if (!ipc_data_read_receive(&callid, &len)) {
864
        fat_node_put(nodep);
920
        fat_node_put(fn);
865
        ipc_answer_0(callid, EINVAL);
921
        ipc_answer_0(callid, EINVAL);
866
        ipc_answer_0(rid, EINVAL);
922
        ipc_answer_0(rid, EINVAL);
867
        return;
923
        return;
868
    }
924
    }
869
 
925
 
Line 930... Line 986...
930
            }
986
            }
931
            block_put(b);
987
            block_put(b);
932
            bnum++;
988
            bnum++;
933
        }
989
        }
934
miss:
990
miss:
935
        fat_node_put(nodep);
991
        fat_node_put(fn);
936
        ipc_answer_0(callid, ENOENT);
992
        ipc_answer_0(callid, ENOENT);
937
        ipc_answer_1(rid, ENOENT, 0);
993
        ipc_answer_1(rid, ENOENT, 0);
938
        return;
994
        return;
939
hit:
995
hit:
940
        (void) ipc_data_read_finalize(callid, name, str_size(name) + 1);
996
        (void) ipc_data_read_finalize(callid, name, str_size(name) + 1);
941
        bytes = (pos - spos) + 1;
997
        bytes = (pos - spos) + 1;
942
    }
998
    }
943
 
999
 
944
    fat_node_put(nodep);
1000
    fat_node_put(fn);
945
    ipc_answer_1(rid, EOK, (ipcarg_t)bytes);
1001
    ipc_answer_1(rid, EOK, (ipcarg_t)bytes);
946
}
1002
}
947
 
1003
 
948
void fat_write(ipc_callid_t rid, ipc_call_t *request)
1004
void fat_write(ipc_callid_t rid, ipc_call_t *request)
949
{
1005
{
950
    dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);
1006
    dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);
951
    fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request);
1007
    fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request);
952
    off_t pos = (off_t)IPC_GET_ARG3(*request);
1008
    off_t pos = (off_t)IPC_GET_ARG3(*request);
953
    fat_node_t *nodep = (fat_node_t *)fat_node_get(dev_handle, index);
1009
    fs_node_t *fn = fat_node_get(dev_handle, index);
-
 
1010
    fat_node_t *nodep;
954
    fat_bs_t *bs;
1011
    fat_bs_t *bs;
955
    size_t bytes;
1012
    size_t bytes;
956
    block_t *b;
1013
    block_t *b;
957
    uint16_t bps;
1014
    uint16_t bps;
958
    unsigned spc;
1015
    unsigned spc;
959
    unsigned bpc;       /* bytes per cluster */
1016
    unsigned bpc;       /* bytes per cluster */
960
    off_t boundary;
1017
    off_t boundary;
961
    int flags = BLOCK_FLAGS_NONE;
1018
    int flags = BLOCK_FLAGS_NONE;
962
   
1019
   
963
    if (!nodep) {
1020
    if (!fn) {
964
        ipc_answer_0(rid, ENOENT);
1021
        ipc_answer_0(rid, ENOENT);
965
        return;
1022
        return;
966
    }
1023
    }
-
 
1024
    nodep = FAT_NODE(fn);
967
   
1025
   
968
    ipc_callid_t callid;
1026
    ipc_callid_t callid;
969
    size_t len;
1027
    size_t len;
970
    if (!ipc_data_write_receive(&callid, &len)) {
1028
    if (!ipc_data_write_receive(&callid, &len)) {
971
        fat_node_put(nodep);
1029
        fat_node_put(fn);
972
        ipc_answer_0(callid, EINVAL);
1030
        ipc_answer_0(callid, EINVAL);
973
        ipc_answer_0(rid, EINVAL);
1031
        ipc_answer_0(rid, EINVAL);
974
        return;
1032
        return;
975
    }
1033
    }
976
 
1034
 
Line 1007... Line 1065...
1007
        if (pos + bytes > nodep->size) {
1065
        if (pos + bytes > nodep->size) {
1008
            nodep->size = pos + bytes;
1066
            nodep->size = pos + bytes;
1009
            nodep->dirty = true;    /* need to sync node */
1067
            nodep->dirty = true;    /* need to sync node */
1010
        }
1068
        }
1011
        ipc_answer_2(rid, EOK, bytes, nodep->size);
1069
        ipc_answer_2(rid, EOK, bytes, nodep->size);
1012
        fat_node_put(nodep);
1070
        fat_node_put(fn);
1013
        return;
1071
        return;
1014
    } else {
1072
    } else {
1015
        /*
1073
        /*
1016
         * This is the more difficult case. We must allocate new
1074
         * This is the more difficult case. We must allocate new
1017
         * clusters for the node and zero them out.
1075
         * clusters for the node and zero them out.
Line 1023... Line 1081...
1023
        nclsts = (ROUND_UP(pos + bytes, bpc) - boundary) / bpc;
1081
        nclsts = (ROUND_UP(pos + bytes, bpc) - boundary) / bpc;
1024
        /* create an independent chain of nclsts clusters in all FATs */
1082
        /* create an independent chain of nclsts clusters in all FATs */
1025
        status = fat_alloc_clusters(bs, dev_handle, nclsts, &mcl, &lcl);
1083
        status = fat_alloc_clusters(bs, dev_handle, nclsts, &mcl, &lcl);
1026
        if (status != EOK) {
1084
        if (status != EOK) {
1027
            /* could not allocate a chain of nclsts clusters */
1085
            /* could not allocate a chain of nclsts clusters */
1028
            fat_node_put(nodep);
1086
            fat_node_put(fn);
1029
            ipc_answer_0(callid, status);
1087
            ipc_answer_0(callid, status);
1030
            ipc_answer_0(rid, status);
1088
            ipc_answer_0(rid, status);
1031
            return;
1089
            return;
1032
        }
1090
        }
1033
        /* zero fill any gaps */
1091
        /* zero fill any gaps */
Line 1044... Line 1102...
1044
         */
1102
         */
1045
        fat_append_clusters(bs, nodep, mcl);
1103
        fat_append_clusters(bs, nodep, mcl);
1046
        nodep->size = pos + bytes;
1104
        nodep->size = pos + bytes;
1047
        nodep->dirty = true;        /* need to sync node */
1105
        nodep->dirty = true;        /* need to sync node */
1048
        ipc_answer_2(rid, EOK, bytes, nodep->size);
1106
        ipc_answer_2(rid, EOK, bytes, nodep->size);
1049
        fat_node_put(nodep);
1107
        fat_node_put(fn);
1050
        return;
1108
        return;
1051
    }
1109
    }
1052
}
1110
}
1053
 
1111
 
1054
void fat_truncate(ipc_callid_t rid, ipc_call_t *request)
1112
void fat_truncate(ipc_callid_t rid, ipc_call_t *request)
1055
{
1113
{
1056
    dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);
1114
    dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);
1057
    fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request);
1115
    fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request);
1058
    size_t size = (off_t)IPC_GET_ARG3(*request);
1116
    size_t size = (off_t)IPC_GET_ARG3(*request);
1059
    fat_node_t *nodep = (fat_node_t *)fat_node_get(dev_handle, index);
1117
    fs_node_t *fn = fat_node_get(dev_handle, index);
-
 
1118
    fat_node_t *nodep;
1060
    fat_bs_t *bs;
1119
    fat_bs_t *bs;
1061
    uint16_t bps;
1120
    uint16_t bps;
1062
    uint8_t spc;
1121
    uint8_t spc;
1063
    unsigned bpc;   /* bytes per cluster */
1122
    unsigned bpc;   /* bytes per cluster */
1064
    int rc;
1123
    int rc;
1065
 
1124
 
1066
    if (!nodep) {
1125
    if (!fn) {
1067
        ipc_answer_0(rid, ENOENT);
1126
        ipc_answer_0(rid, ENOENT);
1068
        return;
1127
        return;
1069
    }
1128
    }
-
 
1129
    nodep = FAT_NODE(fn);
1070
 
1130
 
1071
    bs = block_bb_get(dev_handle);
1131
    bs = block_bb_get(dev_handle);
1072
    bps = uint16_t_le2host(bs->bps);
1132
    bps = uint16_t_le2host(bs->bps);
1073
    spc = bs->spc;
1133
    spc = bs->spc;
1074
    bpc = bps * spc;
1134
    bpc = bps * spc;
Line 1102... Line 1162...
1102
        }
1162
        }
1103
        nodep->size = size;
1163
        nodep->size = size;
1104
        nodep->dirty = true;        /* need to sync node */
1164
        nodep->dirty = true;        /* need to sync node */
1105
        rc = EOK;  
1165
        rc = EOK;  
1106
    }
1166
    }
1107
    fat_node_put(nodep);
1167
    fat_node_put(fn);
1108
    ipc_answer_0(rid, rc);
1168
    ipc_answer_0(rid, rc);
1109
    return;
1169
    return;
1110
}
1170
}
1111
 
1171
 
1112
void fat_destroy(ipc_callid_t rid, ipc_call_t *request)
1172
void fat_destroy(ipc_callid_t rid, ipc_call_t *request)
1113
{
1173
{
1114
    dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);
1174
    dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);
1115
    fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request);
1175
    fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request);
1116
    int rc;
1176
    int rc;
1117
 
1177
 
1118
    fat_node_t *nodep = fat_node_get(dev_handle, index);
1178
    fs_node_t *fn = fat_node_get(dev_handle, index);
1119
    if (!nodep) {
1179
    if (!fn) {
1120
        ipc_answer_0(rid, ENOENT);
1180
        ipc_answer_0(rid, ENOENT);
1121
        return;
1181
        return;
1122
    }
1182
    }
1123
 
1183
 
1124
    rc = fat_destroy_node(nodep);
1184
    rc = fat_destroy_node(fn);
1125
    ipc_answer_0(rid, rc);
1185
    ipc_answer_0(rid, rc);
1126
}
1186
}
1127
 
1187
 
1128
/**
1188
/**
1129
 * @}
1189
 * @}