Subversion Repositories HelenOS

Rev

Rev 3386 | Rev 4327 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 3386 Rev 4153
1
/*
1
/*
2
 * Copyright (c) 2008 Jakub Jermar
2
 * Copyright (c) 2008 Jakub Jermar
3
 * Copyright (c) 2008 Martin Decky
3
 * Copyright (c) 2008 Martin Decky
4
 * All rights reserved.
4
 * All rights reserved.
5
 *
5
 *
6
 * Redistribution and use in source and binary forms, with or without
6
 * Redistribution and use in source and binary forms, with or without
7
 * modification, are permitted provided that the following conditions
7
 * modification, are permitted provided that the following conditions
8
 * are met:
8
 * are met:
9
 *
9
 *
10
 * - Redistributions of source code must retain the above copyright
10
 * - Redistributions of source code must retain the above copyright
11
 *   notice, this list of conditions and the following disclaimer.
11
 *   notice, this list of conditions and the following disclaimer.
12
 * - Redistributions in binary form must reproduce the above copyright
12
 * - Redistributions in binary form must reproduce the above copyright
13
 *   notice, this list of conditions and the following disclaimer in the
13
 *   notice, this list of conditions and the following disclaimer in the
14
 *   documentation and/or other materials provided with the distribution.
14
 *   documentation and/or other materials provided with the distribution.
15
 * - The name of the author may not be used to endorse or promote products
15
 * - The name of the author may not be used to endorse or promote products
16
 *   derived from this software without specific prior written permission.
16
 *   derived from this software without specific prior written permission.
17
 *
17
 *
18
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28
 */
28
 */
29
 
29
 
30
/** @addtogroup fs
30
/** @addtogroup fs
31
 * @{
31
 * @{
32
 */
32
 */
33
 
33
 
34
/**
34
/**
35
 * @file    tmpfs_dump.c
35
 * @file    tmpfs_dump.c
36
 * @brief   Support for loading TMPFS file system dump.
36
 * @brief   Support for loading TMPFS file system dump.
37
 */
37
 */
38
 
38
 
39
#include "tmpfs.h"
39
#include "tmpfs.h"
40
#include "../../vfs/vfs.h"
40
#include "../../vfs/vfs.h"
41
#include <ipc/ipc.h>
-
 
42
#include <async.h>
-
 
43
#include <errno.h>
41
#include <errno.h>
44
#include <stdlib.h>
42
#include <stdlib.h>
45
#include <string.h>
43
#include <string.h>
46
#include <sys/types.h>
44
#include <sys/types.h>
47
#include <as.h>
45
#include <as.h>
48
#include <libfs.h>
46
#include <libblock.h>
49
#include <ipc/services.h>
-
 
50
#include <ipc/devmap.h>
-
 
51
#include <sys/mman.h>
-
 
52
#include <byteorder.h>
47
#include <byteorder.h>
53
 
48
 
54
#define TMPFS_BLOCK_SIZE    1024
49
#define TMPFS_BLOCK_SIZE    1024
55
 
50
 
56
struct rdentry {
51
struct rdentry {
57
    uint8_t type;
52
    uint8_t type;
58
    uint32_t len;
53
    uint32_t len;
59
} __attribute__((packed));
54
} __attribute__((packed));
60
 
55
 
61
static bool
56
static bool
62
tmpfs_restore_recursion(int phone, void *block, off_t *bufpos, size_t *buflen,
57
tmpfs_restore_recursion(int dev, off_t *bufpos, size_t *buflen, off_t *pos,
63
    off_t *pos, tmpfs_dentry_t *parent)
58
    tmpfs_dentry_t *parent)
64
{
59
{
65
    struct rdentry entry;
60
    struct rdentry entry;
66
    libfs_ops_t *ops = &tmpfs_libfs_ops;
61
    libfs_ops_t *ops = &tmpfs_libfs_ops;
-
 
62
    int rc;
67
   
63
   
68
    do {
64
    do {
69
        char *fname;
65
        char *fname;
70
        tmpfs_dentry_t *node;
66
        tmpfs_dentry_t *node;
71
        uint32_t size;
67
        uint32_t size;
72
       
68
       
73
        if (!libfs_blockread(phone, block, bufpos, buflen, pos, &entry,
69
        if (block_read(dev, bufpos, buflen, pos, &entry, sizeof(entry),
74
            sizeof(entry), TMPFS_BLOCK_SIZE))
70
            TMPFS_BLOCK_SIZE) != EOK)
75
            return false;
71
            return false;
76
       
72
       
77
        entry.len = uint32_t_le2host(entry.len);
73
        entry.len = uint32_t_le2host(entry.len);
78
       
74
       
79
        switch (entry.type) {
75
        switch (entry.type) {
80
        case TMPFS_NONE:
76
        case TMPFS_NONE:
81
            break;
77
            break;
82
        case TMPFS_FILE:
78
        case TMPFS_FILE:
83
            fname = malloc(entry.len + 1);
79
            fname = malloc(entry.len + 1);
84
            if (fname == NULL)
80
            if (fname == NULL)
85
                return false;
81
                return false;
86
           
82
           
87
            node = (tmpfs_dentry_t *) ops->create(L_FILE);
83
            node = (tmpfs_dentry_t *) ops->create(dev, L_FILE);
88
            if (node == NULL) {
84
            if (node == NULL) {
89
                free(fname);
85
                free(fname);
90
                return false;
86
                return false;
91
            }
87
            }
92
           
88
           
93
            if (!libfs_blockread(phone, block, bufpos, buflen, pos,
89
            if (block_read(dev, bufpos, buflen, pos, fname,
94
                fname, entry.len, TMPFS_BLOCK_SIZE)) {
90
                entry.len, TMPFS_BLOCK_SIZE) != EOK) {
95
                ops->destroy((void *) node);
91
                ops->destroy((void *) node);
96
                free(fname);
92
                free(fname);
97
                return false;
93
                return false;
98
            }
94
            }
99
            fname[entry.len] = 0;
95
            fname[entry.len] = 0;
100
           
96
           
101
            if (!ops->link((void *) parent, (void *) node, fname)) {
97
            rc = ops->link((void *) parent, (void *) node, fname);
-
 
98
            if (rc != EOK) {
102
                ops->destroy((void *) node);
99
                ops->destroy((void *) node);
103
                free(fname);
100
                free(fname);
104
                return false;
101
                return false;
105
            }
102
            }
106
            free(fname);
103
            free(fname);
107
           
104
           
108
            if (!libfs_blockread(phone, block, bufpos, buflen, pos,
105
            if (block_read(dev, bufpos, buflen, pos, &size,
109
                &size, sizeof(size), TMPFS_BLOCK_SIZE))
106
                sizeof(size), TMPFS_BLOCK_SIZE) != EOK)
110
                return false;
107
                return false;
111
           
108
           
112
            size = uint32_t_le2host(size);
109
            size = uint32_t_le2host(size);
113
           
110
           
114
            node->data = malloc(size);
111
            node->data = malloc(size);
115
            if (node->data == NULL)
112
            if (node->data == NULL)
116
                return false;
113
                return false;
117
           
114
           
118
            node->size = size;
115
            node->size = size;
119
            if (!libfs_blockread(phone, block, bufpos, buflen, pos,
116
            if (block_read(dev, bufpos, buflen, pos, node->data,
120
                node->data, size, TMPFS_BLOCK_SIZE))
117
                size, TMPFS_BLOCK_SIZE) != EOK)
121
                return false;
118
                return false;
122
           
119
           
123
            break;
120
            break;
124
        case TMPFS_DIRECTORY:
121
        case TMPFS_DIRECTORY:
125
            fname = malloc(entry.len + 1);
122
            fname = malloc(entry.len + 1);
126
            if (fname == NULL)
123
            if (fname == NULL)
127
                return false;
124
                return false;
128
           
125
           
129
            node = (tmpfs_dentry_t *) ops->create(L_DIRECTORY);
126
            node = (tmpfs_dentry_t *) ops->create(dev, L_DIRECTORY);
130
            if (node == NULL) {
127
            if (node == NULL) {
131
                free(fname);
128
                free(fname);
132
                return false;
129
                return false;
133
            }
130
            }
134
           
131
           
135
            if (!libfs_blockread(phone, block, bufpos, buflen, pos,
132
            if (block_read(dev, bufpos, buflen, pos, fname,
136
                fname, entry.len, TMPFS_BLOCK_SIZE)) {
133
                entry.len, TMPFS_BLOCK_SIZE) != EOK) {
137
                ops->destroy((void *) node);
134
                ops->destroy((void *) node);
138
                free(fname);
135
                free(fname);
139
                return false;
136
                return false;
140
            }
137
            }
141
            fname[entry.len] = 0;
138
            fname[entry.len] = 0;
142
           
139
 
143
            if (!ops->link((void *) parent, (void *) node, fname)) {
140
            rc = ops->link((void *) parent, (void *) node, fname);
-
 
141
            if (rc != EOK) {
144
                ops->destroy((void *) node);
142
                ops->destroy((void *) node);
145
                free(fname);
143
                free(fname);
146
                return false;
144
                return false;
147
            }
145
            }
148
            free(fname);
146
            free(fname);
149
           
147
           
150
            if (!tmpfs_restore_recursion(phone, block, bufpos,
148
            if (!tmpfs_restore_recursion(dev, bufpos, buflen, pos,
151
                buflen, pos, node))
149
                node))
152
                return false;
150
                return false;
153
           
151
           
154
            break;
152
            break;
155
        default:
153
        default:
156
            return false;
154
            return false;
157
        }
155
        }
158
    } while (entry.type != TMPFS_NONE);
156
    } while (entry.type != TMPFS_NONE);
159
   
157
   
160
    return true;
158
    return true;
161
}
159
}
162
 
160
 
163
bool tmpfs_restore(dev_handle_t dev)
161
bool tmpfs_restore(dev_handle_t dev)
164
{
162
{
165
    libfs_ops_t *ops = &tmpfs_libfs_ops;
163
    libfs_ops_t *ops = &tmpfs_libfs_ops;
-
 
164
    int rc;
166
 
165
 
167
    void *block = mmap(NULL, TMPFS_BLOCK_SIZE,
166
    rc = block_init(dev, TMPFS_BLOCK_SIZE);
168
        PROTO_READ | PROTO_WRITE, MAP_ANONYMOUS | MAP_PRIVATE, 0, 0);
-
 
169
   
-
 
170
    if (block == NULL)
167
    if (rc != EOK)
171
        return false;
-
 
172
   
-
 
173
    int phone = ipc_connect_me_to(PHONE_NS, SERVICE_DEVMAP,
-
 
174
        DEVMAP_CONNECT_TO_DEVICE, dev);
-
 
175
 
-
 
176
    if (phone < 0) {
-
 
177
        munmap(block, TMPFS_BLOCK_SIZE);
-
 
178
        return false;
168
        return false;
179
    }
-
 
180
   
-
 
181
    if (ipc_share_out_start(phone, block, AS_AREA_READ | AS_AREA_WRITE) !=
-
 
182
        EOK)
-
 
183
        goto error;
-
 
184
   
169
   
185
    off_t bufpos = 0;
170
    off_t bufpos = 0;
186
    size_t buflen = 0;
171
    size_t buflen = 0;
187
    off_t pos = 0;
172
    off_t pos = 0;
188
   
173
   
189
    char tag[6];
174
    char tag[6];
190
    if (!libfs_blockread(phone, block, &bufpos, &buflen, &pos, tag, 5,
175
    if (block_read(dev, &bufpos, &buflen, &pos, tag, 5,
191
        TMPFS_BLOCK_SIZE))
176
        TMPFS_BLOCK_SIZE) != EOK)
192
        goto error;
177
        goto error;
193
   
178
   
194
    tag[5] = 0;
179
    tag[5] = 0;
195
    if (strcmp(tag, "TMPFS") != 0)
180
    if (strcmp(tag, "TMPFS") != 0)
196
        goto error;
181
        goto error;
197
   
182
   
198
    if (!tmpfs_restore_recursion(phone, block, &bufpos, &buflen, &pos,
183
    if (!tmpfs_restore_recursion(dev, &bufpos, &buflen, &pos,
199
        ops->root_get(dev)))
184
        ops->root_get(dev)))
200
        goto error;
185
        goto error;
201
       
186
       
202
    ipc_hangup(phone);
187
    block_fini(dev);
203
    munmap(block, TMPFS_BLOCK_SIZE);
-
 
204
    return true;
188
    return true;
205
   
189
   
206
error:
190
error:
207
    ipc_hangup(phone);
191
    block_fini(dev);
208
    munmap(block, TMPFS_BLOCK_SIZE);
-
 
209
    return false;
192
    return false;
210
}
193
}
211
 
194
 
212
/**
195
/**
213
 * @}
196
 * @}
214
 */
197
 */
215
 
198