aboutsummaryrefslogtreecommitdiff
path: root/jslinux-2019-12-21/tinyemu-2019-12-21/fs.c
blob: 7f92d823d0a639173690cbfb2857a1121bb899f1 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
/*
 * Filesystem utilities
 * 
 * Copyright (c) 2016 Fabrice Bellard
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <inttypes.h>
#include <assert.h>
#include <stdarg.h>

#include "cutils.h"
#include "fs.h"

FSFile *fs_dup(FSDevice *fs, FSFile *f)
{
    FSQID qid;
    fs->fs_walk(fs, &f, &qid, f, 0, NULL);
    return f;
}

FSFile *fs_walk_path1(FSDevice *fs, FSFile *f, const char *path,
                      char **pname)
{
    const char *p;
    char *name;
    FSFile *f1;
    FSQID qid;
    int len, ret;
    BOOL is_last, is_first;

    if (path[0] == '/')
        path++;
    
    is_first = TRUE;
    for(;;) {
        p = strchr(path, '/');
        if (!p) {
            name = (char *)path;
            if (pname) {
                *pname = name;
                if (is_first) {
                    ret = fs->fs_walk(fs, &f, &qid, f, 0, NULL);
                    if (ret < 0)
                        f = NULL;
                }
                return f;
            }
            is_last = TRUE;
        } else {
            len = p - path;
            name = malloc(len + 1);
            memcpy(name, path, len);
            name[len] = '\0';
            is_last = FALSE;
        }
        ret = fs->fs_walk(fs, &f1, &qid, f, 1, &name);
        if (!is_last)
            free(name);
        if (!is_first)
            fs->fs_delete(fs, f);
        f = f1;
        is_first = FALSE;
        if (ret <= 0) {
            fs->fs_delete(fs, f);
            f = NULL;
            break;
        } else if (is_last) {
            break;
        }
        path = p + 1;
    }
    return f;
}

FSFile *fs_walk_path(FSDevice *fs, FSFile *f, const char *path)
{
    return fs_walk_path1(fs, f, path, NULL);
}

void fs_end(FSDevice *fs)
{
    fs->fs_end(fs);
    free(fs);
}