WebSVN – HelenOS – Diff – /branches/dynload/uspace/srv/fs/tmpfs/tmpfs_dump.c


/*
 * Copyright (c) 2008 Jakub Jermar
 * Copyright (c) 2008 Martin Decky
 * 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    tmpfs_dump.c
 * @brief   Support for loading TMPFS file system dump.
 */
 
#include "tmpfs.h"
#include "../../vfs/vfs.h"
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <as.h>
#include <libblock.h>
#include <byteorder.h>
 
#define TMPFS_BLOCK_SIZE    1024
 
struct rdentry {
    uint8_t type;
    uint32_t len;
} __attribute__((packed));
 
static bool
tmpfs_restore_recursion(int dev, off_t *bufpos, size_t *buflen, off_t *pos,
    tmpfs_dentry_t *parent)
{
    struct rdentry entry;
    libfs_ops_t *ops = &tmpfs_libfs_ops;
   
    do {
        char *fname;
        tmpfs_dentry_t *node;
        uint32_t size;
       
        if (block_read(dev, bufpos, buflen, pos, &entry, sizeof(entry),
            TMPFS_BLOCK_SIZE) != EOK)
            return false;
       
        entry.len = uint32_t_le2host(entry.len);
       
        switch (entry.type) {
        case TMPFS_NONE:
            break;
        case TMPFS_FILE:
            fname = malloc(entry.len + 1);
            if (fname == NULL)
                return false;
           
            node = (tmpfs_dentry_t *) ops->create(L_FILE);
            if (node == NULL) {
                free(fname);
                return false;
            }
           
            if (block_read(dev, bufpos, buflen, pos, fname,
                entry.len, TMPFS_BLOCK_SIZE) != EOK) {
                ops->destroy((void *) node);
                free(fname);
                return false;
            }
            fname[entry.len] = 0;
           
            if (!ops->link((void *) parent, (void *) node, fname)) {
                ops->destroy((void *) node);
                free(fname);
                return false;
            }
            free(fname);
           
            if (block_read(dev, bufpos, buflen, pos, &size,
                sizeof(size), TMPFS_BLOCK_SIZE) != EOK)
                return false;
           
            size = uint32_t_le2host(size);
           
            node->data = malloc(size);
            if (node->data == NULL)
                return false;
           
            node->size = size;
            if (block_read(dev, bufpos, buflen, pos, node->data,
                size, TMPFS_BLOCK_SIZE) != EOK)
                return false;
           
            break;
        case TMPFS_DIRECTORY:
            fname = malloc(entry.len + 1);
            if (fname == NULL)
                return false;
           
            node = (tmpfs_dentry_t *) ops->create(L_DIRECTORY);
            if (node == NULL) {
                free(fname);
                return false;
            }
           
            if (block_read(dev, bufpos, buflen, pos, fname,
                entry.len, TMPFS_BLOCK_SIZE) != EOK) {
                ops->destroy((void *) node);
                free(fname);
                return false;
            }
            fname[entry.len] = 0;
           
            if (!ops->link((void *) parent, (void *) node, fname)) {
                ops->destroy((void *) node);
                free(fname);
                return false;
            }
            free(fname);
           
            if (!tmpfs_restore_recursion(dev, bufpos, buflen, pos,
                node))
                return false;
           
            break;
        default:
            return false;
        }
    } while (entry.type != TMPFS_NONE);
   
    return true;
}
 
bool tmpfs_restore(dev_handle_t dev)
{
    libfs_ops_t *ops = &tmpfs_libfs_ops;
    int rc;
 
    rc = block_init(dev, TMPFS_BLOCK_SIZE);
    if (rc != EOK)
        return false;
   
    off_t bufpos = 0;
    size_t buflen = 0;
    off_t pos = 0;
   
    char tag[6];
    if (block_read(dev, &bufpos, &buflen, &pos, tag, 5,
        TMPFS_BLOCK_SIZE) != EOK)
        goto error;
   
    tag[5] = 0;
    if (strcmp(tag, "TMPFS") != 0)
        goto error;
   
    if (!tmpfs_restore_recursion(dev, &bufpos, &buflen, &pos,
        ops->root_get(dev)))
        goto error;
       
    block_fini(dev);
    return true;
   
error:
    block_fini(dev);
    return false;
}
 
/**
 * @}
 */
 

Rev 3535	Rev 3561
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 <errno.h>	41	#include <errno.h>
42	#include <stdlib.h>	42	#include <stdlib.h>
43	#include <string.h>	43	#include <string.h>
44	#include <sys/types.h>	44	#include <sys/types.h>
45	#include <as.h>	45	#include <as.h>
46	#include <libblock.h>	46	#include <libblock.h>
47	#include <byteorder.h>	47	#include <byteorder.h>
48		48
49	#define TMPFS_BLOCK_SIZE 1024	49	#define TMPFS_BLOCK_SIZE 1024
50		50
51	struct rdentry {	51	struct rdentry {
52	uint8_t type;	52	uint8_t type;
53	uint32_t len;	53	uint32_t len;
54	} __attribute__((packed));	54	} __attribute__((packed));
55		55
56	static bool	56	static bool
57	tmpfs_restore_recursion(int dev, off_t bufpos, size_t buflen, off_t *pos,	57	tmpfs_restore_recursion(int dev, off_t bufpos, size_t buflen, off_t *pos,
58	tmpfs_dentry_t *parent)	58	tmpfs_dentry_t *parent)
59	{	59	{
60	struct rdentry entry;	60	struct rdentry entry;
61	libfs_ops_t *ops = &tmpfs_libfs_ops;	61	libfs_ops_t *ops = &tmpfs_libfs_ops;
62		62
63	do {	63	do {
64	char *fname;	64	char *fname;
65	tmpfs_dentry_t *node;	65	tmpfs_dentry_t *node;
66	uint32_t size;	66	uint32_t size;
67		67
68	if (!block_read(dev, bufpos, buflen, pos, &entry, sizeof(entry),	68	if (block_read(dev, bufpos, buflen, pos, &entry, sizeof(entry),
69	TMPFS_BLOCK_SIZE))	69	TMPFS_BLOCK_SIZE) != EOK)
70	return false;	70	return false;
71		71
72	entry.len = uint32_t_le2host(entry.len);	72	entry.len = uint32_t_le2host(entry.len);
73		73
74	switch (entry.type) {	74	switch (entry.type) {
75	case TMPFS_NONE:	75	case TMPFS_NONE:
76	break;	76	break;
77	case TMPFS_FILE:	77	case TMPFS_FILE:
78	fname = malloc(entry.len + 1);	78	fname = malloc(entry.len + 1);
79	if (fname == NULL)	79	if (fname == NULL)
80	return false;	80	return false;
81		81
82	node = (tmpfs_dentry_t *) ops->create(L_FILE);	82	node = (tmpfs_dentry_t *) ops->create(L_FILE);
83	if (node == NULL) {	83	if (node == NULL) {
84	free(fname);	84	free(fname);
85	return false;	85	return false;
86	}	86	}
87		87
88	if (!block_read(dev, bufpos, buflen, pos, fname,	88	if (block_read(dev, bufpos, buflen, pos, fname,
89	entry.len, TMPFS_BLOCK_SIZE)) {	89	entry.len, TMPFS_BLOCK_SIZE) != EOK) {
90	ops->destroy((void *) node);	90	ops->destroy((void *) node);
91	free(fname);	91	free(fname);
92	return false;	92	return false;
93	}	93	}
94	fname[entry.len] = 0;	94	fname[entry.len] = 0;
95		95
96	if (!ops->link((void ) parent, (void ) node, fname)) {	96	if (!ops->link((void ) parent, (void ) node, fname)) {
97	ops->destroy((void *) node);	97	ops->destroy((void *) node);
98	free(fname);	98	free(fname);
99	return false;	99	return false;
100	}	100	}
101	free(fname);	101	free(fname);
102		102
103	if (!block_read(dev, bufpos, buflen, pos, &size,	103	if (block_read(dev, bufpos, buflen, pos, &size,
104	sizeof(size), TMPFS_BLOCK_SIZE))	104	sizeof(size), TMPFS_BLOCK_SIZE) != EOK)
105	return false;	105	return false;
106		106
107	size = uint32_t_le2host(size);	107	size = uint32_t_le2host(size);
108		108
109	node->data = malloc(size);	109	node->data = malloc(size);
110	if (node->data == NULL)	110	if (node->data == NULL)
111	return false;	111	return false;
112		112
113	node->size = size;	113	node->size = size;
114	if (!block_read(dev, bufpos, buflen, pos, node->data,	114	if (block_read(dev, bufpos, buflen, pos, node->data,
115	size, TMPFS_BLOCK_SIZE))	115	size, TMPFS_BLOCK_SIZE) != EOK)
116	return false;	116	return false;
117		117
118	break;	118	break;
119	case TMPFS_DIRECTORY:	119	case TMPFS_DIRECTORY:
120	fname = malloc(entry.len + 1);	120	fname = malloc(entry.len + 1);
121	if (fname == NULL)	121	if (fname == NULL)
122	return false;	122	return false;
123		123
124	node = (tmpfs_dentry_t *) ops->create(L_DIRECTORY);	124	node = (tmpfs_dentry_t *) ops->create(L_DIRECTORY);
125	if (node == NULL) {	125	if (node == NULL) {
126	free(fname);	126	free(fname);
127	return false;	127	return false;
128	}	128	}
129		129
130	if (!block_read(dev, bufpos, buflen, pos,	130	if (block_read(dev, bufpos, buflen, pos, fname,
131	fname, entry.len, TMPFS_BLOCK_SIZE)) {	131	entry.len, TMPFS_BLOCK_SIZE) != EOK) {
132	ops->destroy((void *) node);	132	ops->destroy((void *) node);
133	free(fname);	133	free(fname);
134	return false;	134	return false;
135	}	135	}
136	fname[entry.len] = 0;	136	fname[entry.len] = 0;
137		137
138	if (!ops->link((void ) parent, (void ) node, fname)) {	138	if (!ops->link((void ) parent, (void ) node, fname)) {
139	ops->destroy((void *) node);	139	ops->destroy((void *) node);
140	free(fname);	140	free(fname);
141	return false;	141	return false;
142	}	142	}
143	free(fname);	143	free(fname);
144		144
145	if (!tmpfs_restore_recursion(dev, bufpos, buflen, pos,	145	if (!tmpfs_restore_recursion(dev, bufpos, buflen, pos,
146	node))	146	node))
147	return false;	147	return false;
148		148
149	break;	149	break;
150	default:	150	default:
151	return false;	151	return false;
152	}	152	}
153	} while (entry.type != TMPFS_NONE);	153	} while (entry.type != TMPFS_NONE);
154		154
155	return true;	155	return true;
156	}	156	}
157		157
158	bool tmpfs_restore(dev_handle_t dev)	158	bool tmpfs_restore(dev_handle_t dev)
159	{	159	{
160	libfs_ops_t *ops = &tmpfs_libfs_ops;	160	libfs_ops_t *ops = &tmpfs_libfs_ops;
161	int rc;	161	int rc;
162		162
163	rc = block_init(dev, TMPFS_BLOCK_SIZE, 0, 0);	163	rc = block_init(dev, TMPFS_BLOCK_SIZE);
164	if (rc != EOK)	164	if (rc != EOK)
165	return false;	165	return false;
166		166
167	off_t bufpos = 0;	167	off_t bufpos = 0;
168	size_t buflen = 0;	168	size_t buflen = 0;
169	off_t pos = 0;	169	off_t pos = 0;
170		170
171	char tag[6];	171	char tag[6];
172	if (!block_read(dev, &bufpos, &buflen, &pos, tag, 5,	172	if (block_read(dev, &bufpos, &buflen, &pos, tag, 5,
173	TMPFS_BLOCK_SIZE))	173	TMPFS_BLOCK_SIZE) != EOK)
174	goto error;	174	goto error;
175		175
176	tag[5] = 0;	176	tag[5] = 0;
177	if (strcmp(tag, "TMPFS") != 0)	177	if (strcmp(tag, "TMPFS") != 0)
178	goto error;	178	goto error;
179		179
180	if (!tmpfs_restore_recursion(dev, &bufpos, &buflen, &pos,	180	if (!tmpfs_restore_recursion(dev, &bufpos, &buflen, &pos,
181	ops->root_get(dev)))	181	ops->root_get(dev)))
182	goto error;	182	goto error;
183		183
184	block_fini(dev);	184	block_fini(dev);
185	return true;	185	return true;
186		186
187	error:	187	error:
188	block_fini(dev);	188	block_fini(dev);
189	return false;	189	return false;
190	}	190	}
191		191
192	/**	192	/**
193	* @}	193	* @}
194	*/	194	*/
195		195

Subversion Repositories HelenOS

(root)/branches/dynload/uspace/srv/fs/tmpfs/tmpfs_dump.c – Rev 3535 → 3561