blob: 3fb5db383ec9206fba37f5f4039f635b30c1cce0 [file] [log] [blame]
wdenkfe8c2802002-11-03 00:38:21 +00001/*
2-------------------------------------------------------------------------
3 * Filename: jffs2.c
4 * Version: $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $
5 * Copyright: Copyright (C) 2001, Russ Dill
6 * Author: Russ Dill <Russ.Dill@asu.edu>
7 * Description: Module to load kernel from jffs2
8 *-----------------------------------------------------------------------*/
9/*
10 * some portions of this code are taken from jffs2, and as such, the
11 * following copyright notice is included.
12 *
13 * JFFS2 -- Journalling Flash File System, Version 2.
14 *
15 * Copyright (C) 2001 Red Hat, Inc.
16 *
17 * Created by David Woodhouse <dwmw2@cambridge.redhat.com>
18 *
19 * The original JFFS, from which the design for JFFS2 was derived,
20 * was designed and implemented by Axis Communications AB.
21 *
22 * The contents of this file are subject to the Red Hat eCos Public
23 * License Version 1.1 (the "Licence"); you may not use this file
24 * except in compliance with the Licence. You may obtain a copy of
25 * the Licence at http://www.redhat.com/
26 *
27 * Software distributed under the Licence is distributed on an "AS IS"
28 * basis, WITHOUT WARRANTY OF ANY KIND, either express or implied.
29 * See the Licence for the specific language governing rights and
30 * limitations under the Licence.
31 *
32 * The Original Code is JFFS2 - Journalling Flash File System, version 2
33 *
34 * Alternatively, the contents of this file may be used under the
35 * terms of the GNU General Public License version 2 (the "GPL"), in
36 * which case the provisions of the GPL are applicable instead of the
37 * above. If you wish to allow the use of your version of this file
38 * only under the terms of the GPL and not to allow others to use your
39 * version of this file under the RHEPL, indicate your decision by
40 * deleting the provisions above and replace them with the notice and
41 * other provisions required by the GPL. If you do not delete the
42 * provisions above, a recipient may use your version of this file
43 * under either the RHEPL or the GPL.
44 *
45 * $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $
46 *
47 */
48
49/* Ok, so anyone who knows the jffs2 code will probably want to get a papar
50 * bag to throw up into before reading this code. I looked through the jffs2
51 * code, the caching scheme is very elegant. I tried to keep the version
52 * for a bootloader as small and simple as possible. Instead of worring about
53 * unneccesary data copies, node scans, etc, I just optimized for the known
54 * common case, a kernel, which looks like:
Wolfgang Denka1be4762008-05-20 16:00:29 +020055 * (1) most pages are 4096 bytes
wdenkfe8c2802002-11-03 00:38:21 +000056 * (2) version numbers are somewhat sorted in acsending order
57 * (3) multiple compressed blocks making up one page is uncommon
58 *
59 * So I create a linked list of decending version numbers (insertions at the
60 * head), and then for each page, walk down the list, until a matching page
61 * with 4096 bytes is found, and then decompress the watching pages in
62 * reverse order.
63 *
64 */
65
66/*
67 * Adapted by Nye Liu <nyet@zumanetworks.com> and
68 * Rex Feany <rfeany@zumanetworks.com>
69 * on Jan/2002 for U-Boot.
70 *
71 * Clipped out all the non-1pass functions, cleaned up warnings,
72 * wrappers, etc. No major changes to the code.
73 * Please, he really means it when he said have a paper bag
74 * handy. We needed it ;).
75 *
76 */
77
wdenk6b58f332003-03-14 20:47:52 +000078/*
79 * Bugfixing by Kai-Uwe Bloem <kai-uwe.bloem@auerswald.de>, (C) Mar/2003
80 *
81 * - overhaul of the memory management. Removed much of the "paper-bagging"
82 * in that part of the code, fixed several bugs, now frees memory when
83 * partition is changed.
84 * It's still ugly :-(
85 * - fixed a bug in jffs2_1pass_read_inode where the file length calculation
86 * was incorrect. Removed a bit of the paper-bagging as well.
87 * - removed double crc calculation for fragment headers in jffs2_private.h
88 * for speedup.
89 * - scan_empty rewritten in a more "standard" manner (non-paperbag, that is).
90 * - spinning wheel now spins depending on how much memory has been scanned
91 * - lots of small changes all over the place to "improve" readability.
92 * - implemented fragment sorting to ensure that the newest data is copied
93 * if there are multiple copies of fragments for a certain file offset.
94 *
Jean-Christophe PLAGNIOL-VILLARD03836942008-10-16 15:01:15 +020095 * The fragment sorting feature must be enabled by CONFIG_SYS_JFFS2_SORT_FRAGMENTS.
wdenk6b58f332003-03-14 20:47:52 +000096 * Sorting is done while adding fragments to the lists, which is more or less a
97 * bubble sort. This takes a lot of time, and is most probably not an issue if
98 * the boot filesystem is always mounted readonly.
99 *
100 * You should define it if the boot filesystem is mounted writable, and updates
101 * to the boot files are done by copying files to that filesystem.
102 *
103 *
104 * There's a big issue left: endianess is completely ignored in this code. Duh!
105 *
106 *
107 * You still should have paper bags at hand :-(. The code lacks more or less
108 * any comment, and is still arcane and difficult to read in places. As this
wdenkae65f502004-01-03 21:24:46 +0000109 * might be incompatible with any new code from the jffs2 maintainers anyway,
110 * it should probably be dumped and replaced by something like jffs2reader!
wdenk6b58f332003-03-14 20:47:52 +0000111 */
112
113
wdenkfe8c2802002-11-03 00:38:21 +0000114#include <common.h>
115#include <config.h>
116#include <malloc.h>
Tom Rini3cd84d62013-12-05 14:48:38 -0500117#include <div64.h>
wdenkfe8c2802002-11-03 00:38:21 +0000118#include <linux/stat.h>
119#include <linux/time.h>
Stuart Wood471a2f02008-06-02 16:40:08 -0400120#include <watchdog.h>
wdenkfe8c2802002-11-03 00:38:21 +0000121#include <jffs2/jffs2.h>
122#include <jffs2/jffs2_1pass.h>
Mike Frysinger11d1a092012-04-09 13:39:55 +0000123#include <linux/compat.h>
Ilya Yanokbcaa1f72009-07-17 15:02:42 +0400124#include <asm/errno.h>
wdenkfe8c2802002-11-03 00:38:21 +0000125
126#include "jffs2_private.h"
127
wdenk6b58f332003-03-14 20:47:52 +0000128
Wolfgang Denka1be4762008-05-20 16:00:29 +0200129#define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */
130#define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */
wdenkfe8c2802002-11-03 00:38:21 +0000131
wdenk6b58f332003-03-14 20:47:52 +0000132/* Debugging switches */
133#undef DEBUG_DIRENTS /* print directory entry list after scan */
134#undef DEBUG_FRAGMENTS /* print fragment list after scan */
Wolfgang Denka1be4762008-05-20 16:00:29 +0200135#undef DEBUG /* enable debugging messages */
wdenkfe8c2802002-11-03 00:38:21 +0000136
wdenk6b58f332003-03-14 20:47:52 +0000137
wdenkfe8c2802002-11-03 00:38:21 +0000138#ifdef DEBUG
139# define DEBUGF(fmt,args...) printf(fmt ,##args)
140#else
141# define DEBUGF(fmt,args...)
142#endif
143
Ilya Yanoka933bd62008-11-13 19:49:35 +0300144#include "summary.h"
145
Wolfgang Denk47f57792005-08-08 01:03:24 +0200146/* keeps pointer to currentlu processed partition */
147static struct part_info *current_part;
wdenk8886a662004-04-18 19:43:36 +0000148
Wolfgang Denk15888b42007-07-05 17:56:27 +0200149#if (defined(CONFIG_JFFS2_NAND) && \
Jon Loeliger80eb47c2007-07-09 17:56:50 -0500150 defined(CONFIG_CMD_NAND) )
Bartlomiej Sieka582f1a32006-03-05 18:57:33 +0100151#include <nand.h>
wdenk8886a662004-04-18 19:43:36 +0000152/*
153 * Support for jffs2 on top of NAND-flash
154 *
155 * NAND memory isn't mapped in processor's address space,
156 * so data should be fetched from flash before
157 * being processed. This is exactly what functions declared
158 * here do.
159 *
160 */
161
wdenk8886a662004-04-18 19:43:36 +0000162#define NAND_PAGE_SIZE 512
163#define NAND_PAGE_SHIFT 9
164#define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
165
166#ifndef NAND_CACHE_PAGES
167#define NAND_CACHE_PAGES 16
168#endif
169#define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
170
171static u8* nand_cache = NULL;
172static u32 nand_cache_off = (u32)-1;
wdenk8886a662004-04-18 19:43:36 +0000173
174static int read_nand_cached(u32 off, u32 size, u_char *buf)
175{
Wolfgang Denk47f57792005-08-08 01:03:24 +0200176 struct mtdids *id = current_part->dev->id;
wdenk8886a662004-04-18 19:43:36 +0000177 u32 bytes_read = 0;
Marian Balakowicz6a076752006-04-08 19:08:06 +0200178 size_t retlen;
wdenk8886a662004-04-18 19:43:36 +0000179 int cpy_bytes;
180
181 while (bytes_read < size) {
182 if ((off + bytes_read < nand_cache_off) ||
183 (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) {
184 nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
185 if (!nand_cache) {
186 /* This memory never gets freed but 'cause
187 it's a bootloader, nobody cares */
wdenk12490652004-04-18 21:13:41 +0000188 nand_cache = malloc(NAND_CACHE_SIZE);
189 if (!nand_cache) {
wdenk8886a662004-04-18 19:43:36 +0000190 printf("read_nand_cached: can't alloc cache size %d bytes\n",
191 NAND_CACHE_SIZE);
192 return -1;
193 }
194 }
Bartlomiej Sieka582f1a32006-03-05 18:57:33 +0100195
196 retlen = NAND_CACHE_SIZE;
197 if (nand_read(&nand_info[id->num], nand_cache_off,
Marian Balakowicz6a076752006-04-08 19:08:06 +0200198 &retlen, nand_cache) != 0 ||
Wolfgang Denk47f57792005-08-08 01:03:24 +0200199 retlen != NAND_CACHE_SIZE) {
wdenk8886a662004-04-18 19:43:36 +0000200 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
Wolfgang Denk47f57792005-08-08 01:03:24 +0200201 nand_cache_off, NAND_CACHE_SIZE);
wdenk8886a662004-04-18 19:43:36 +0000202 return -1;
203 }
204 }
205 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
206 if (cpy_bytes > size - bytes_read)
207 cpy_bytes = size - bytes_read;
208 memcpy(buf + bytes_read,
209 nand_cache + off + bytes_read - nand_cache_off,
210 cpy_bytes);
211 bytes_read += cpy_bytes;
212 }
213 return bytes_read;
214}
215
Wolfgang Denk47f57792005-08-08 01:03:24 +0200216static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
wdenk8886a662004-04-18 19:43:36 +0000217{
218 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
219
220 if (NULL == buf) {
Wolfgang Denk47f57792005-08-08 01:03:24 +0200221 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
wdenk8886a662004-04-18 19:43:36 +0000222 return NULL;
223 }
224 if (read_nand_cached(off, size, buf) < 0) {
wdenkf248ebc2004-05-05 19:44:41 +0000225 if (!ext_buf)
226 free(buf);
wdenk8886a662004-04-18 19:43:36 +0000227 return NULL;
228 }
229
230 return buf;
231}
232
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300233static void *get_node_mem_nand(u32 off, void *ext_buf)
wdenk8886a662004-04-18 19:43:36 +0000234{
235 struct jffs2_unknown_node node;
236 void *ret = NULL;
237
Wolfgang Denk47f57792005-08-08 01:03:24 +0200238 if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
wdenk8886a662004-04-18 19:43:36 +0000239 return NULL;
240
Wolfgang Denk47f57792005-08-08 01:03:24 +0200241 if (!(ret = get_fl_mem_nand(off, node.magic ==
wdenk8886a662004-04-18 19:43:36 +0000242 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300243 ext_buf))) {
wdenk8886a662004-04-18 19:43:36 +0000244 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
245 off, node.magic, node.nodetype, node.totlen);
246 }
247 return ret;
248}
249
Wolfgang Denk47f57792005-08-08 01:03:24 +0200250static void put_fl_mem_nand(void *buf)
wdenk8886a662004-04-18 19:43:36 +0000251{
252 free(buf);
253}
Jon Loeliger80eb47c2007-07-09 17:56:50 -0500254#endif
Wolfgang Denk47f57792005-08-08 01:03:24 +0200255
Kyungmin Park25383742008-08-27 14:45:20 +0900256#if defined(CONFIG_CMD_ONENAND)
257
258#include <linux/mtd/mtd.h>
259#include <linux/mtd/onenand.h>
260#include <onenand_uboot.h>
261
262#define ONENAND_PAGE_SIZE 2048
263#define ONENAND_PAGE_SHIFT 11
264#define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1))
265
266#ifndef ONENAND_CACHE_PAGES
267#define ONENAND_CACHE_PAGES 4
268#endif
269#define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE)
270
271static u8* onenand_cache;
272static u32 onenand_cache_off = (u32)-1;
273
274static int read_onenand_cached(u32 off, u32 size, u_char *buf)
275{
276 u32 bytes_read = 0;
277 size_t retlen;
278 int cpy_bytes;
279
280 while (bytes_read < size) {
281 if ((off + bytes_read < onenand_cache_off) ||
282 (off + bytes_read >= onenand_cache_off + ONENAND_CACHE_SIZE)) {
283 onenand_cache_off = (off + bytes_read) & ONENAND_PAGE_MASK;
284 if (!onenand_cache) {
285 /* This memory never gets freed but 'cause
286 it's a bootloader, nobody cares */
287 onenand_cache = malloc(ONENAND_CACHE_SIZE);
288 if (!onenand_cache) {
289 printf("read_onenand_cached: can't alloc cache size %d bytes\n",
290 ONENAND_CACHE_SIZE);
291 return -1;
292 }
293 }
294
295 retlen = ONENAND_CACHE_SIZE;
296 if (onenand_read(&onenand_mtd, onenand_cache_off, retlen,
297 &retlen, onenand_cache) != 0 ||
298 retlen != ONENAND_CACHE_SIZE) {
299 printf("read_onenand_cached: error reading nand off %#x size %d bytes\n",
300 onenand_cache_off, ONENAND_CACHE_SIZE);
301 return -1;
302 }
303 }
304 cpy_bytes = onenand_cache_off + ONENAND_CACHE_SIZE - (off + bytes_read);
305 if (cpy_bytes > size - bytes_read)
306 cpy_bytes = size - bytes_read;
307 memcpy(buf + bytes_read,
308 onenand_cache + off + bytes_read - onenand_cache_off,
309 cpy_bytes);
310 bytes_read += cpy_bytes;
311 }
312 return bytes_read;
313}
314
315static void *get_fl_mem_onenand(u32 off, u32 size, void *ext_buf)
316{
317 u_char *buf = ext_buf ? (u_char *)ext_buf : (u_char *)malloc(size);
318
319 if (NULL == buf) {
320 printf("get_fl_mem_onenand: can't alloc %d bytes\n", size);
321 return NULL;
322 }
323 if (read_onenand_cached(off, size, buf) < 0) {
324 if (!ext_buf)
325 free(buf);
326 return NULL;
327 }
328
329 return buf;
330}
331
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300332static void *get_node_mem_onenand(u32 off, void *ext_buf)
Kyungmin Park25383742008-08-27 14:45:20 +0900333{
334 struct jffs2_unknown_node node;
335 void *ret = NULL;
336
337 if (NULL == get_fl_mem_onenand(off, sizeof(node), &node))
338 return NULL;
339
340 ret = get_fl_mem_onenand(off, node.magic ==
341 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300342 ext_buf);
Kyungmin Park25383742008-08-27 14:45:20 +0900343 if (!ret) {
344 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
345 off, node.magic, node.nodetype, node.totlen);
346 }
347 return ret;
348}
349
350
351static void put_fl_mem_onenand(void *buf)
352{
353 free(buf);
354}
355#endif
356
Wolfgang Denk47f57792005-08-08 01:03:24 +0200357
Jon Loeliger80eb47c2007-07-09 17:56:50 -0500358#if defined(CONFIG_CMD_FLASH)
Wolfgang Denk47f57792005-08-08 01:03:24 +0200359/*
360 * Support for jffs2 on top of NOR-flash
361 *
362 * NOR flash memory is mapped in processor's address space,
363 * just return address.
364 */
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300365static inline void *get_fl_mem_nor(u32 off, u32 size, void *ext_buf)
Wolfgang Denk47f57792005-08-08 01:03:24 +0200366{
367 u32 addr = off;
368 struct mtdids *id = current_part->dev->id;
369
Marian Balakowicz513b4a12005-10-11 19:09:42 +0200370 extern flash_info_t flash_info[];
Wolfgang Denk47f57792005-08-08 01:03:24 +0200371 flash_info_t *flash = &flash_info[id->num];
372
373 addr += flash->start[0];
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300374 if (ext_buf) {
375 memcpy(ext_buf, (void *)addr, size);
376 return ext_buf;
377 }
Wolfgang Denk47f57792005-08-08 01:03:24 +0200378 return (void*)addr;
379}
380
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300381static inline void *get_node_mem_nor(u32 off, void *ext_buf)
Ilya Yanokddb02692008-11-13 19:49:33 +0300382{
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300383 struct jffs2_unknown_node *pNode;
Ilya Yanokddb02692008-11-13 19:49:33 +0300384
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300385 /* pNode will point directly to flash - don't provide external buffer
386 and don't care about size */
387 pNode = get_fl_mem_nor(off, 0, NULL);
388 return (void *)get_fl_mem_nor(off, pNode->magic == JFFS2_MAGIC_BITMASK ?
389 pNode->totlen : sizeof(*pNode), ext_buf);
Wolfgang Denk47f57792005-08-08 01:03:24 +0200390}
Jon Loeliger80eb47c2007-07-09 17:56:50 -0500391#endif
wdenk8886a662004-04-18 19:43:36 +0000392
wdenk8886a662004-04-18 19:43:36 +0000393
Wolfgang Denk47f57792005-08-08 01:03:24 +0200394/*
Wolfgang Denkeb95c852005-08-10 15:14:32 +0200395 * Generic jffs2 raw memory and node read routines.
Wolfgang Denk47f57792005-08-08 01:03:24 +0200396 *
397 */
wdenk8886a662004-04-18 19:43:36 +0000398static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
399{
Wolfgang Denk47f57792005-08-08 01:03:24 +0200400 struct mtdids *id = current_part->dev->id;
Wolfgang Denkeb95c852005-08-10 15:14:32 +0200401
Heiko Schocherd64a8132010-03-24 13:22:50 +0100402 switch(id->type) {
Jon Loeliger80eb47c2007-07-09 17:56:50 -0500403#if defined(CONFIG_CMD_FLASH)
Heiko Schocherd64a8132010-03-24 13:22:50 +0100404 case MTD_DEV_TYPE_NOR:
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300405 return get_fl_mem_nor(off, size, ext_buf);
Heiko Schocherd64a8132010-03-24 13:22:50 +0100406 break;
Wolfgang Denk47f57792005-08-08 01:03:24 +0200407#endif
Jon Loeliger80eb47c2007-07-09 17:56:50 -0500408#if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
Heiko Schocherd64a8132010-03-24 13:22:50 +0100409 case MTD_DEV_TYPE_NAND:
Wolfgang Denk47f57792005-08-08 01:03:24 +0200410 return get_fl_mem_nand(off, size, ext_buf);
Heiko Schocherd64a8132010-03-24 13:22:50 +0100411 break;
Wolfgang Denk47f57792005-08-08 01:03:24 +0200412#endif
Kyungmin Park25383742008-08-27 14:45:20 +0900413#if defined(CONFIG_CMD_ONENAND)
Heiko Schocherd64a8132010-03-24 13:22:50 +0100414 case MTD_DEV_TYPE_ONENAND:
Kyungmin Park25383742008-08-27 14:45:20 +0900415 return get_fl_mem_onenand(off, size, ext_buf);
Heiko Schocherd64a8132010-03-24 13:22:50 +0100416 break;
Kyungmin Park25383742008-08-27 14:45:20 +0900417#endif
Heiko Schocherd64a8132010-03-24 13:22:50 +0100418 default:
419 printf("get_fl_mem: unknown device type, " \
420 "using raw offset!\n");
421 }
wdenk8886a662004-04-18 19:43:36 +0000422 return (void*)off;
423}
424
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300425static inline void *get_node_mem(u32 off, void *ext_buf)
wdenk8886a662004-04-18 19:43:36 +0000426{
Wolfgang Denk47f57792005-08-08 01:03:24 +0200427 struct mtdids *id = current_part->dev->id;
Wolfgang Denkeb95c852005-08-10 15:14:32 +0200428
Heiko Schocherd64a8132010-03-24 13:22:50 +0100429 switch(id->type) {
Jon Loeliger80eb47c2007-07-09 17:56:50 -0500430#if defined(CONFIG_CMD_FLASH)
Heiko Schocherd64a8132010-03-24 13:22:50 +0100431 case MTD_DEV_TYPE_NOR:
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300432 return get_node_mem_nor(off, ext_buf);
Heiko Schocherd64a8132010-03-24 13:22:50 +0100433 break;
Wolfgang Denk47f57792005-08-08 01:03:24 +0200434#endif
Wolfgang Denk15888b42007-07-05 17:56:27 +0200435#if defined(CONFIG_JFFS2_NAND) && \
Jon Loeliger80eb47c2007-07-09 17:56:50 -0500436 defined(CONFIG_CMD_NAND)
Heiko Schocherd64a8132010-03-24 13:22:50 +0100437 case MTD_DEV_TYPE_NAND:
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300438 return get_node_mem_nand(off, ext_buf);
Heiko Schocherd64a8132010-03-24 13:22:50 +0100439 break;
Wolfgang Denk47f57792005-08-08 01:03:24 +0200440#endif
Kyungmin Park25383742008-08-27 14:45:20 +0900441#if defined(CONFIG_CMD_ONENAND)
Heiko Schocherd64a8132010-03-24 13:22:50 +0100442 case MTD_DEV_TYPE_ONENAND:
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300443 return get_node_mem_onenand(off, ext_buf);
Heiko Schocherd64a8132010-03-24 13:22:50 +0100444 break;
Kyungmin Park25383742008-08-27 14:45:20 +0900445#endif
Heiko Schocherd64a8132010-03-24 13:22:50 +0100446 default:
447 printf("get_fl_mem: unknown device type, " \
448 "using raw offset!\n");
449 }
wdenk8886a662004-04-18 19:43:36 +0000450 return (void*)off;
451}
452
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300453static inline void put_fl_mem(void *buf, void *ext_buf)
wdenk8886a662004-04-18 19:43:36 +0000454{
Wolfgang Denk47f57792005-08-08 01:03:24 +0200455 struct mtdids *id = current_part->dev->id;
wdenk8886a662004-04-18 19:43:36 +0000456
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300457 /* If buf is the same as ext_buf, it was provided by the caller -
458 we shouldn't free it then. */
459 if (buf == ext_buf)
460 return;
Scott Woodc97ba112008-10-31 13:51:12 -0500461 switch (id->type) {
462#if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
463 case MTD_DEV_TYPE_NAND:
Wolfgang Denk47f57792005-08-08 01:03:24 +0200464 return put_fl_mem_nand(buf);
465#endif
Kyungmin Park25383742008-08-27 14:45:20 +0900466#if defined(CONFIG_CMD_ONENAND)
Scott Woodc97ba112008-10-31 13:51:12 -0500467 case MTD_DEV_TYPE_ONENAND:
Kyungmin Park25383742008-08-27 14:45:20 +0900468 return put_fl_mem_onenand(buf);
469#endif
Scott Woodc97ba112008-10-31 13:51:12 -0500470 }
Wolfgang Denk47f57792005-08-08 01:03:24 +0200471}
wdenk6b58f332003-03-14 20:47:52 +0000472
473/* Compression names */
474static char *compr_names[] = {
475 "NONE",
476 "ZERO",
477 "RTIME",
478 "RUBINMIPS",
479 "COPY",
480 "DYNRUBIN",
wdenke84ec902005-05-05 00:04:14 +0000481 "ZLIB",
Wolfgang Denk0eded4f2010-01-15 11:10:33 +0100482#if defined(CONFIG_JFFS2_LZO)
wdenke84ec902005-05-05 00:04:14 +0000483 "LZO",
wdenke84ec902005-05-05 00:04:14 +0000484#endif
wdenk6b58f332003-03-14 20:47:52 +0000485};
486
wdenk6b58f332003-03-14 20:47:52 +0000487/* Memory management */
488struct mem_block {
489 u32 index;
490 struct mem_block *next;
491 struct b_node nodes[NODE_CHUNK];
492};
493
494
495static void
496free_nodes(struct b_list *list)
497{
498 while (list->listMemBase != NULL) {
499 struct mem_block *next = list->listMemBase->next;
500 free( list->listMemBase );
501 list->listMemBase = next;
502 }
503}
wdenkfe8c2802002-11-03 00:38:21 +0000504
505static struct b_node *
wdenk6b58f332003-03-14 20:47:52 +0000506add_node(struct b_list *list)
wdenkfe8c2802002-11-03 00:38:21 +0000507{
wdenk6b58f332003-03-14 20:47:52 +0000508 u32 index = 0;
509 struct mem_block *memBase;
wdenkfe8c2802002-11-03 00:38:21 +0000510 struct b_node *b;
511
wdenk6b58f332003-03-14 20:47:52 +0000512 memBase = list->listMemBase;
513 if (memBase != NULL)
514 index = memBase->index;
wdenkfe8c2802002-11-03 00:38:21 +0000515#if 0
516 putLabeledWord("add_node: index = ", index);
wdenk6b58f332003-03-14 20:47:52 +0000517 putLabeledWord("add_node: memBase = ", list->listMemBase);
wdenkfe8c2802002-11-03 00:38:21 +0000518#endif
519
wdenk6b58f332003-03-14 20:47:52 +0000520 if (memBase == NULL || index >= NODE_CHUNK) {
521 /* we need more space before we continue */
522 memBase = mmalloc(sizeof(struct mem_block));
523 if (memBase == NULL) {
wdenkfe8c2802002-11-03 00:38:21 +0000524 putstr("add_node: malloc failed\n");
525 return NULL;
526 }
wdenk6b58f332003-03-14 20:47:52 +0000527 memBase->next = list->listMemBase;
528 index = 0;
wdenkfe8c2802002-11-03 00:38:21 +0000529#if 0
530 putLabeledWord("add_node: alloced a new membase at ", *memBase);
531#endif
532
533 }
534 /* now we have room to add it. */
wdenk6b58f332003-03-14 20:47:52 +0000535 b = &memBase->nodes[index];
536 index ++;
wdenkfe8c2802002-11-03 00:38:21 +0000537
wdenk6b58f332003-03-14 20:47:52 +0000538 memBase->index = index;
539 list->listMemBase = memBase;
540 list->listCount++;
541 return b;
542}
wdenkfe8c2802002-11-03 00:38:21 +0000543
wdenk6b58f332003-03-14 20:47:52 +0000544static struct b_node *
545insert_node(struct b_list *list, u32 offset)
546{
547 struct b_node *new;
Jean-Christophe PLAGNIOL-VILLARD03836942008-10-16 15:01:15 +0200548#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk6b58f332003-03-14 20:47:52 +0000549 struct b_node *b, *prev;
wdenkfe8c2802002-11-03 00:38:21 +0000550#endif
551
wdenk6b58f332003-03-14 20:47:52 +0000552 if (!(new = add_node(list))) {
553 putstr("add_node failed!\r\n");
554 return NULL;
555 }
556 new->offset = offset;
557
Jean-Christophe PLAGNIOL-VILLARD03836942008-10-16 15:01:15 +0200558#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk6b58f332003-03-14 20:47:52 +0000559 if (list->listTail != NULL && list->listCompare(new, list->listTail))
560 prev = list->listTail;
561 else if (list->listLast != NULL && list->listCompare(new, list->listLast))
562 prev = list->listLast;
563 else
564 prev = NULL;
565
566 for (b = (prev ? prev->next : list->listHead);
567 b != NULL && list->listCompare(new, b);
568 prev = b, b = b->next) {
569 list->listLoops++;
570 }
571 if (b != NULL)
572 list->listLast = prev;
573
574 if (b != NULL) {
575 new->next = b;
576 if (prev != NULL)
577 prev->next = new;
578 else
579 list->listHead = new;
580 } else
wdenkfe8c2802002-11-03 00:38:21 +0000581#endif
wdenk6b58f332003-03-14 20:47:52 +0000582 {
583 new->next = (struct b_node *) NULL;
584 if (list->listTail != NULL) {
585 list->listTail->next = new;
586 list->listTail = new;
587 } else {
588 list->listTail = list->listHead = new;
589 }
590 }
wdenkfe8c2802002-11-03 00:38:21 +0000591
wdenk6b58f332003-03-14 20:47:52 +0000592 return new;
wdenkfe8c2802002-11-03 00:38:21 +0000593}
594
Jean-Christophe PLAGNIOL-VILLARD03836942008-10-16 15:01:15 +0200595#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk2c9b05d2003-09-10 22:30:53 +0000596/* Sort data entries with the latest version last, so that if there
597 * is overlapping data the latest version will be used.
598 */
wdenk6b58f332003-03-14 20:47:52 +0000599static int compare_inodes(struct b_node *new, struct b_node *old)
600{
wdenk8886a662004-04-18 19:43:36 +0000601 struct jffs2_raw_inode ojNew;
602 struct jffs2_raw_inode ojOld;
603 struct jffs2_raw_inode *jNew =
604 (struct jffs2_raw_inode *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
605 struct jffs2_raw_inode *jOld =
606 (struct jffs2_raw_inode *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
wdenk6b58f332003-03-14 20:47:52 +0000607
wdenk2c9b05d2003-09-10 22:30:53 +0000608 return jNew->version > jOld->version;
wdenk6b58f332003-03-14 20:47:52 +0000609}
610
wdenk2c9b05d2003-09-10 22:30:53 +0000611/* Sort directory entries so all entries in the same directory
612 * with the same name are grouped together, with the latest version
613 * last. This makes it easy to eliminate all but the latest version
614 * by marking the previous version dead by setting the inode to 0.
615 */
wdenk6b58f332003-03-14 20:47:52 +0000616static int compare_dirents(struct b_node *new, struct b_node *old)
617{
wdenk8886a662004-04-18 19:43:36 +0000618 struct jffs2_raw_dirent ojNew;
619 struct jffs2_raw_dirent ojOld;
620 struct jffs2_raw_dirent *jNew =
621 (struct jffs2_raw_dirent *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
wdenk12490652004-04-18 21:13:41 +0000622 struct jffs2_raw_dirent *jOld =
wdenk8886a662004-04-18 19:43:36 +0000623 (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
wdenk2c9b05d2003-09-10 22:30:53 +0000624 int cmp;
wdenk6b58f332003-03-14 20:47:52 +0000625
wdenk2c9b05d2003-09-10 22:30:53 +0000626 /* ascending sort by pino */
627 if (jNew->pino != jOld->pino)
628 return jNew->pino > jOld->pino;
629
630 /* pino is the same, so use ascending sort by nsize, so
631 * we don't do strncmp unless we really must.
632 */
633 if (jNew->nsize != jOld->nsize)
634 return jNew->nsize > jOld->nsize;
635
636 /* length is also the same, so use ascending sort by name
637 */
Wolfgang Denk7fb52662005-10-13 16:45:02 +0200638 cmp = strncmp((char *)jNew->name, (char *)jOld->name, jNew->nsize);
wdenk2c9b05d2003-09-10 22:30:53 +0000639 if (cmp != 0)
640 return cmp > 0;
641
642 /* we have duplicate names in this directory, so use ascending
643 * sort by version
644 */
645 if (jNew->version > jOld->version) {
646 /* since jNew is newer, we know jOld is not valid, so
647 * mark it with inode 0 and it will not be used
648 */
649 jOld->ino = 0;
650 return 1;
651 }
wdenk9c53f402003-10-15 23:53:47 +0000652
wdenk2c9b05d2003-09-10 22:30:53 +0000653 return 0;
wdenk6b58f332003-03-14 20:47:52 +0000654}
655#endif
wdenkfe8c2802002-11-03 00:38:21 +0000656
Wolfgang Denk47f57792005-08-08 01:03:24 +0200657void
658jffs2_free_cache(struct part_info *part)
wdenkfe8c2802002-11-03 00:38:21 +0000659{
wdenk6b58f332003-03-14 20:47:52 +0000660 struct b_lists *pL;
661
662 if (part->jffs2_priv != NULL) {
663 pL = (struct b_lists *)part->jffs2_priv;
664 free_nodes(&pL->frag);
665 free_nodes(&pL->dir);
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300666 free(pL->readbuf);
wdenk6b58f332003-03-14 20:47:52 +0000667 free(pL);
668 }
Wolfgang Denk47f57792005-08-08 01:03:24 +0200669}
670
671static u32
672jffs_init_1pass_list(struct part_info *part)
673{
674 struct b_lists *pL;
675
676 jffs2_free_cache(part);
677
wdenk6b58f332003-03-14 20:47:52 +0000678 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
679 pL = (struct b_lists *)part->jffs2_priv;
wdenkfe8c2802002-11-03 00:38:21 +0000680
wdenk6b58f332003-03-14 20:47:52 +0000681 memset(pL, 0, sizeof(*pL));
Jean-Christophe PLAGNIOL-VILLARD03836942008-10-16 15:01:15 +0200682#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk6b58f332003-03-14 20:47:52 +0000683 pL->dir.listCompare = compare_dirents;
684 pL->frag.listCompare = compare_inodes;
685#endif
wdenkfe8c2802002-11-03 00:38:21 +0000686 }
687 return 0;
688}
689
690/* find the inode from the slashless name given a parent */
691static long
692jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
693{
694 struct b_node *b;
695 struct jffs2_raw_inode *jNode;
wdenk6b58f332003-03-14 20:47:52 +0000696 u32 totalSize = 0;
wdenk2c9b05d2003-09-10 22:30:53 +0000697 u32 latestVersion = 0;
Wolfgang Denk7fb52662005-10-13 16:45:02 +0200698 uchar *lDest;
699 uchar *src;
wdenkfe8c2802002-11-03 00:38:21 +0000700 int i;
701 u32 counter = 0;
Jean-Christophe PLAGNIOL-VILLARD03836942008-10-16 15:01:15 +0200702#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk2c9b05d2003-09-10 22:30:53 +0000703 /* Find file size before loading any data, so fragments that
704 * start past the end of file can be ignored. A fragment
705 * that is partially in the file is loaded, so extra data may
706 * be loaded up to the next 4K boundary above the file size.
707 * This shouldn't cause trouble when loading kernel images, so
708 * we will live with it.
709 */
710 for (b = pL->frag.listHead; b != NULL; b = b->next) {
wdenk12490652004-04-18 21:13:41 +0000711 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300712 sizeof(struct jffs2_raw_inode), pL->readbuf);
wdenk2c9b05d2003-09-10 22:30:53 +0000713 if ((inode == jNode->ino)) {
714 /* get actual file length from the newest node */
715 if (jNode->version >= latestVersion) {
716 totalSize = jNode->isize;
717 latestVersion = jNode->version;
718 }
719 }
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300720 put_fl_mem(jNode, pL->readbuf);
wdenk2c9b05d2003-09-10 22:30:53 +0000721 }
722#endif
wdenkfe8c2802002-11-03 00:38:21 +0000723
wdenk6b58f332003-03-14 20:47:52 +0000724 for (b = pL->frag.listHead; b != NULL; b = b->next) {
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300725 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset,
726 pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +0000727 if ((inode == jNode->ino)) {
wdenk6b58f332003-03-14 20:47:52 +0000728#if 0
wdenkfe8c2802002-11-03 00:38:21 +0000729 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
730 putLabeledWord("read_inode: inode = ", jNode->ino);
731 putLabeledWord("read_inode: version = ", jNode->version);
732 putLabeledWord("read_inode: isize = ", jNode->isize);
733 putLabeledWord("read_inode: offset = ", jNode->offset);
734 putLabeledWord("read_inode: csize = ", jNode->csize);
735 putLabeledWord("read_inode: dsize = ", jNode->dsize);
736 putLabeledWord("read_inode: compr = ", jNode->compr);
737 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
738 putLabeledWord("read_inode: flags = ", jNode->flags);
wdenkfe8c2802002-11-03 00:38:21 +0000739#endif
wdenk2c9b05d2003-09-10 22:30:53 +0000740
Jean-Christophe PLAGNIOL-VILLARD03836942008-10-16 15:01:15 +0200741#ifndef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk6b58f332003-03-14 20:47:52 +0000742 /* get actual file length from the newest node */
743 if (jNode->version >= latestVersion) {
wdenkfe8c2802002-11-03 00:38:21 +0000744 totalSize = jNode->isize;
wdenk6b58f332003-03-14 20:47:52 +0000745 latestVersion = jNode->version;
wdenkfe8c2802002-11-03 00:38:21 +0000746 }
wdenk2c9b05d2003-09-10 22:30:53 +0000747#endif
wdenkfe8c2802002-11-03 00:38:21 +0000748
749 if(dest) {
Wolfgang Denk7fb52662005-10-13 16:45:02 +0200750 src = ((uchar *) jNode) + sizeof(struct jffs2_raw_inode);
wdenk6b58f332003-03-14 20:47:52 +0000751 /* ignore data behind latest known EOF */
wdenk8886a662004-04-18 19:43:36 +0000752 if (jNode->offset > totalSize) {
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300753 put_fl_mem(jNode, pL->readbuf);
wdenk6b58f332003-03-14 20:47:52 +0000754 continue;
wdenk8886a662004-04-18 19:43:36 +0000755 }
Ilya Yanokc0c07732008-11-13 19:49:36 +0300756 if (b->datacrc == CRC_UNKNOWN)
757 b->datacrc = data_crc(jNode) ?
758 CRC_OK : CRC_BAD;
759 if (b->datacrc == CRC_BAD) {
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300760 put_fl_mem(jNode, pL->readbuf);
Ilya Yanokddb02692008-11-13 19:49:33 +0300761 continue;
762 }
wdenk6b58f332003-03-14 20:47:52 +0000763
Wolfgang Denk7fb52662005-10-13 16:45:02 +0200764 lDest = (uchar *) (dest + jNode->offset);
wdenkfe8c2802002-11-03 00:38:21 +0000765#if 0
wdenk6b58f332003-03-14 20:47:52 +0000766 putLabeledWord("read_inode: src = ", src);
wdenkfe8c2802002-11-03 00:38:21 +0000767 putLabeledWord("read_inode: dest = ", lDest);
wdenkfe8c2802002-11-03 00:38:21 +0000768#endif
769 switch (jNode->compr) {
770 case JFFS2_COMPR_NONE:
Wolfgang Denkbf913c12011-10-05 22:58:11 +0200771 ldr_memcpy(lDest, src, jNode->dsize);
wdenkfe8c2802002-11-03 00:38:21 +0000772 break;
773 case JFFS2_COMPR_ZERO:
wdenkfe8c2802002-11-03 00:38:21 +0000774 for (i = 0; i < jNode->dsize; i++)
775 *(lDest++) = 0;
776 break;
777 case JFFS2_COMPR_RTIME:
wdenkfe8c2802002-11-03 00:38:21 +0000778 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
779 break;
780 case JFFS2_COMPR_DYNRUBIN:
781 /* this is slow but it works */
wdenkfe8c2802002-11-03 00:38:21 +0000782 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
783 break;
784 case JFFS2_COMPR_ZLIB:
Wolfgang Denkbf913c12011-10-05 22:58:11 +0200785 zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
wdenkfe8c2802002-11-03 00:38:21 +0000786 break;
Wolfgang Denk0eded4f2010-01-15 11:10:33 +0100787#if defined(CONFIG_JFFS2_LZO)
wdenke84ec902005-05-05 00:04:14 +0000788 case JFFS2_COMPR_LZO:
Wolfgang Denkbf913c12011-10-05 22:58:11 +0200789 lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
wdenke84ec902005-05-05 00:04:14 +0000790 break;
791#endif
wdenkfe8c2802002-11-03 00:38:21 +0000792 default:
793 /* unknown */
Loïc Minier5d0569a2011-02-03 22:04:26 +0100794 putLabeledWord("UNKNOWN COMPRESSION METHOD = ", jNode->compr);
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300795 put_fl_mem(jNode, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +0000796 return -1;
797 break;
798 }
799 }
800
wdenkfe8c2802002-11-03 00:38:21 +0000801#if 0
wdenkfe8c2802002-11-03 00:38:21 +0000802 putLabeledWord("read_inode: totalSize = ", totalSize);
wdenkfe8c2802002-11-03 00:38:21 +0000803#endif
804 }
wdenkfe8c2802002-11-03 00:38:21 +0000805 counter++;
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300806 put_fl_mem(jNode, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +0000807 }
wdenkfe8c2802002-11-03 00:38:21 +0000808
809#if 0
wdenk6b58f332003-03-14 20:47:52 +0000810 putLabeledWord("read_inode: returning = ", totalSize);
wdenkfe8c2802002-11-03 00:38:21 +0000811#endif
wdenk6b58f332003-03-14 20:47:52 +0000812 return totalSize;
wdenkfe8c2802002-11-03 00:38:21 +0000813}
814
815/* find the inode from the slashless name given a parent */
816static u32
817jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
818{
819 struct b_node *b;
820 struct jffs2_raw_dirent *jDir;
821 int len;
822 u32 counter;
823 u32 version = 0;
824 u32 inode = 0;
825
826 /* name is assumed slash free */
827 len = strlen(name);
828
829 counter = 0;
830 /* we need to search all and return the inode with the highest version */
wdenk6b58f332003-03-14 20:47:52 +0000831 for(b = pL->dir.listHead; b; b = b->next, counter++) {
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300832 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
833 pL->readbuf);
wdenk6b58f332003-03-14 20:47:52 +0000834 if ((pino == jDir->pino) && (len == jDir->nsize) &&
835 (jDir->ino) && /* 0 for unlink */
Wolfgang Denk7fb52662005-10-13 16:45:02 +0200836 (!strncmp((char *)jDir->name, name, len))) { /* a match */
wdenk8886a662004-04-18 19:43:36 +0000837 if (jDir->version < version) {
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300838 put_fl_mem(jDir, pL->readbuf);
wdenk2c9b05d2003-09-10 22:30:53 +0000839 continue;
wdenk8886a662004-04-18 19:43:36 +0000840 }
wdenkfe8c2802002-11-03 00:38:21 +0000841
wdenk2c9b05d2003-09-10 22:30:53 +0000842 if (jDir->version == version && inode != 0) {
Wolfgang Denka1be4762008-05-20 16:00:29 +0200843 /* I'm pretty sure this isn't legal */
wdenkfe8c2802002-11-03 00:38:21 +0000844 putstr(" ** ERROR ** ");
845 putnstr(jDir->name, jDir->nsize);
846 putLabeledWord(" has dup version =", version);
847 }
848 inode = jDir->ino;
849 version = jDir->version;
850 }
851#if 0
852 putstr("\r\nfind_inode:p&l ->");
853 putnstr(jDir->name, jDir->nsize);
854 putstr("\r\n");
855 putLabeledWord("pino = ", jDir->pino);
856 putLabeledWord("nsize = ", jDir->nsize);
857 putLabeledWord("b = ", (u32) b);
858 putLabeledWord("counter = ", counter);
859#endif
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300860 put_fl_mem(jDir, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +0000861 }
862 return inode;
863}
864
wdenkad276f22004-01-04 16:28:35 +0000865char *mkmodestr(unsigned long mode, char *str)
wdenkfe8c2802002-11-03 00:38:21 +0000866{
wdenk6b58f332003-03-14 20:47:52 +0000867 static const char *l = "xwr";
868 int mask = 1, i;
869 char c;
wdenkfe8c2802002-11-03 00:38:21 +0000870
wdenk6b58f332003-03-14 20:47:52 +0000871 switch (mode & S_IFMT) {
872 case S_IFDIR: str[0] = 'd'; break;
873 case S_IFBLK: str[0] = 'b'; break;
874 case S_IFCHR: str[0] = 'c'; break;
875 case S_IFIFO: str[0] = 'f'; break;
876 case S_IFLNK: str[0] = 'l'; break;
877 case S_IFSOCK: str[0] = 's'; break;
878 case S_IFREG: str[0] = '-'; break;
879 default: str[0] = '?';
880 }
wdenkfe8c2802002-11-03 00:38:21 +0000881
wdenk6b58f332003-03-14 20:47:52 +0000882 for(i = 0; i < 9; i++) {
883 c = l[i%3];
884 str[9-i] = (mode & mask)?c:'-';
885 mask = mask<<1;
886 }
wdenkfe8c2802002-11-03 00:38:21 +0000887
wdenk6b58f332003-03-14 20:47:52 +0000888 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
889 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
890 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
891 str[10] = '\0';
892 return str;
wdenkfe8c2802002-11-03 00:38:21 +0000893}
894
895static inline void dump_stat(struct stat *st, const char *name)
896{
wdenk6b58f332003-03-14 20:47:52 +0000897 char str[20];
898 char s[64], *p;
wdenkfe8c2802002-11-03 00:38:21 +0000899
wdenk6b58f332003-03-14 20:47:52 +0000900 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
901 st->st_mtime = 1;
wdenkfe8c2802002-11-03 00:38:21 +0000902
Wolfgang Denk7fb52662005-10-13 16:45:02 +0200903 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
wdenkfe8c2802002-11-03 00:38:21 +0000904
wdenk6b58f332003-03-14 20:47:52 +0000905 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
906 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
wdenkfe8c2802002-11-03 00:38:21 +0000907
908/*
wdenk6b58f332003-03-14 20:47:52 +0000909 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
910 st->st_size, s, name);
wdenkfe8c2802002-11-03 00:38:21 +0000911*/
912
wdenk6b58f332003-03-14 20:47:52 +0000913 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
wdenkfe8c2802002-11-03 00:38:21 +0000914}
915
916static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
917{
918 char fname[256];
919 struct stat st;
920
921 if(!d || !i) return -1;
922
Wolfgang Denk7fb52662005-10-13 16:45:02 +0200923 strncpy(fname, (char *)d->name, d->nsize);
wdenk6b58f332003-03-14 20:47:52 +0000924 fname[d->nsize] = '\0';
wdenkfe8c2802002-11-03 00:38:21 +0000925
926 memset(&st,0,sizeof(st));
927
wdenk6b58f332003-03-14 20:47:52 +0000928 st.st_mtime = i->mtime;
929 st.st_mode = i->mode;
930 st.st_ino = i->ino;
Ilya Yanokc4785fb2008-11-13 19:49:31 +0300931 st.st_size = i->isize;
wdenkfe8c2802002-11-03 00:38:21 +0000932
933 dump_stat(&st, fname);
934
935 if (d->type == DT_LNK) {
936 unsigned char *src = (unsigned char *) (&i[1]);
937 putstr(" -> ");
938 putnstr(src, (int)i->dsize);
939 }
940
941 putstr("\r\n");
942
943 return 0;
944}
945
946/* list inodes with the given pino */
947static u32
948jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
949{
950 struct b_node *b;
951 struct jffs2_raw_dirent *jDir;
952
wdenk6b58f332003-03-14 20:47:52 +0000953 for (b = pL->dir.listHead; b; b = b->next) {
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300954 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
955 pL->readbuf);
wdenk6b58f332003-03-14 20:47:52 +0000956 if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */
957 u32 i_version = 0;
wdenk8886a662004-04-18 19:43:36 +0000958 struct jffs2_raw_inode ojNode;
wdenk6b58f332003-03-14 20:47:52 +0000959 struct jffs2_raw_inode *jNode, *i = NULL;
960 struct b_node *b2 = pL->frag.listHead;
wdenkfe8c2802002-11-03 00:38:21 +0000961
962 while (b2) {
wdenk8886a662004-04-18 19:43:36 +0000963 jNode = (struct jffs2_raw_inode *)
964 get_fl_mem(b2->offset, sizeof(ojNode), &ojNode);
wdenkf248ebc2004-05-05 19:44:41 +0000965 if (jNode->ino == jDir->ino && jNode->version >= i_version) {
Ilya Yanokc4785fb2008-11-13 19:49:31 +0300966 i_version = jNode->version;
wdenkf248ebc2004-05-05 19:44:41 +0000967 if (i)
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300968 put_fl_mem(i, NULL);
wdenke02d2ae2005-05-04 23:50:54 +0000969
970 if (jDir->type == DT_LNK)
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300971 i = get_node_mem(b2->offset,
972 NULL);
wdenke02d2ae2005-05-04 23:50:54 +0000973 else
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300974 i = get_fl_mem(b2->offset,
975 sizeof(*i),
976 NULL);
wdenkf248ebc2004-05-05 19:44:41 +0000977 }
wdenkfe8c2802002-11-03 00:38:21 +0000978 b2 = b2->next;
979 }
980
981 dump_inode(pL, jDir, i);
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300982 put_fl_mem(i, NULL);
wdenkfe8c2802002-11-03 00:38:21 +0000983 }
Ilya Yanoke7fd6712008-11-13 19:49:34 +0300984 put_fl_mem(jDir, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +0000985 }
986 return pino;
987}
988
989static u32
990jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
991{
992 int i;
993 char tmp[256];
994 char working_tmp[256];
995 char *c;
996
997 /* discard any leading slash */
998 i = 0;
999 while (fname[i] == '/')
1000 i++;
1001 strcpy(tmp, &fname[i]);
1002
1003 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1004 {
1005 strncpy(working_tmp, tmp, c - tmp);
1006 working_tmp[c - tmp] = '\0';
1007#if 0
1008 putstr("search_inode: tmp = ");
1009 putstr(tmp);
1010 putstr("\r\n");
1011 putstr("search_inode: wtmp = ");
1012 putstr(working_tmp);
1013 putstr("\r\n");
1014 putstr("search_inode: c = ");
1015 putstr(c);
1016 putstr("\r\n");
1017#endif
1018 for (i = 0; i < strlen(c) - 1; i++)
1019 tmp[i] = c[i + 1];
1020 tmp[i] = '\0';
1021#if 0
1022 putstr("search_inode: post tmp = ");
1023 putstr(tmp);
1024 putstr("\r\n");
1025#endif
1026
1027 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
1028 putstr("find_inode failed for name=");
1029 putstr(working_tmp);
1030 putstr("\r\n");
1031 return 0;
1032 }
1033 }
1034 /* this is for the bare filename, directories have already been mapped */
1035 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1036 putstr("find_inode failed for name=");
1037 putstr(tmp);
1038 putstr("\r\n");
1039 return 0;
1040 }
1041 return pino;
1042
1043}
1044
1045static u32
1046jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
1047{
1048 struct b_node *b;
1049 struct b_node *b2;
1050 struct jffs2_raw_dirent *jDir;
1051 struct jffs2_raw_inode *jNode;
wdenk8886a662004-04-18 19:43:36 +00001052 u8 jDirFoundType = 0;
1053 u32 jDirFoundIno = 0;
1054 u32 jDirFoundPino = 0;
wdenkfe8c2802002-11-03 00:38:21 +00001055 char tmp[256];
1056 u32 version = 0;
1057 u32 pino;
1058 unsigned char *src;
1059
1060 /* we need to search all and return the inode with the highest version */
wdenk6b58f332003-03-14 20:47:52 +00001061 for(b = pL->dir.listHead; b; b = b->next) {
Ilya Yanoke7fd6712008-11-13 19:49:34 +03001062 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1063 pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +00001064 if (ino == jDir->ino) {
Wolfgang Denka1be4762008-05-20 16:00:29 +02001065 if (jDir->version < version) {
Ilya Yanoke7fd6712008-11-13 19:49:34 +03001066 put_fl_mem(jDir, pL->readbuf);
wdenk2c9b05d2003-09-10 22:30:53 +00001067 continue;
wdenk8886a662004-04-18 19:43:36 +00001068 }
wdenkfe8c2802002-11-03 00:38:21 +00001069
wdenk8886a662004-04-18 19:43:36 +00001070 if (jDir->version == version && jDirFoundType) {
Wolfgang Denka1be4762008-05-20 16:00:29 +02001071 /* I'm pretty sure this isn't legal */
wdenkfe8c2802002-11-03 00:38:21 +00001072 putstr(" ** ERROR ** ");
1073 putnstr(jDir->name, jDir->nsize);
1074 putLabeledWord(" has dup version (resolve) = ",
1075 version);
1076 }
1077
wdenk8886a662004-04-18 19:43:36 +00001078 jDirFoundType = jDir->type;
1079 jDirFoundIno = jDir->ino;
1080 jDirFoundPino = jDir->pino;
wdenkfe8c2802002-11-03 00:38:21 +00001081 version = jDir->version;
1082 }
Ilya Yanoke7fd6712008-11-13 19:49:34 +03001083 put_fl_mem(jDir, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +00001084 }
1085 /* now we found the right entry again. (shoulda returned inode*) */
wdenk8886a662004-04-18 19:43:36 +00001086 if (jDirFoundType != DT_LNK)
1087 return jDirFoundIno;
wdenk6b58f332003-03-14 20:47:52 +00001088
1089 /* it's a soft link so we follow it again. */
1090 b2 = pL->frag.listHead;
wdenkfe8c2802002-11-03 00:38:21 +00001091 while (b2) {
Ilya Yanoke7fd6712008-11-13 19:49:34 +03001092 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset,
1093 pL->readbuf);
wdenk8886a662004-04-18 19:43:36 +00001094 if (jNode->ino == jDirFoundIno) {
wdenk6c59edc2004-05-03 20:45:30 +00001095 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
wdenkfe8c2802002-11-03 00:38:21 +00001096
1097#if 0
1098 putLabeledWord("\t\t dsize = ", jNode->dsize);
1099 putstr("\t\t target = ");
1100 putnstr(src, jNode->dsize);
1101 putstr("\r\n");
1102#endif
Wolfgang Denk7fb52662005-10-13 16:45:02 +02001103 strncpy(tmp, (char *)src, jNode->dsize);
wdenkfe8c2802002-11-03 00:38:21 +00001104 tmp[jNode->dsize] = '\0';
Ilya Yanoke7fd6712008-11-13 19:49:34 +03001105 put_fl_mem(jNode, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +00001106 break;
1107 }
1108 b2 = b2->next;
Ilya Yanoke7fd6712008-11-13 19:49:34 +03001109 put_fl_mem(jNode, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +00001110 }
1111 /* ok so the name of the new file to find is in tmp */
1112 /* if it starts with a slash it is root based else shared dirs */
1113 if (tmp[0] == '/')
1114 pino = 1;
1115 else
wdenk8886a662004-04-18 19:43:36 +00001116 pino = jDirFoundPino;
wdenkfe8c2802002-11-03 00:38:21 +00001117
1118 return jffs2_1pass_search_inode(pL, tmp, pino);
1119}
1120
1121static u32
1122jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1123{
1124 int i;
1125 char tmp[256];
1126 char working_tmp[256];
1127 char *c;
1128
1129 /* discard any leading slash */
1130 i = 0;
1131 while (fname[i] == '/')
1132 i++;
1133 strcpy(tmp, &fname[i]);
1134 working_tmp[0] = '\0';
1135 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1136 {
1137 strncpy(working_tmp, tmp, c - tmp);
1138 working_tmp[c - tmp] = '\0';
1139 for (i = 0; i < strlen(c) - 1; i++)
1140 tmp[i] = c[i + 1];
1141 tmp[i] = '\0';
1142 /* only a failure if we arent looking at top level */
wdenk6b58f332003-03-14 20:47:52 +00001143 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1144 (working_tmp[0])) {
wdenkfe8c2802002-11-03 00:38:21 +00001145 putstr("find_inode failed for name=");
1146 putstr(working_tmp);
1147 putstr("\r\n");
1148 return 0;
1149 }
1150 }
1151
1152 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1153 putstr("find_inode failed for name=");
1154 putstr(tmp);
1155 putstr("\r\n");
1156 return 0;
1157 }
1158 /* this is for the bare filename, directories have already been mapped */
1159 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1160 putstr("find_inode failed for name=");
1161 putstr(tmp);
1162 putstr("\r\n");
1163 return 0;
1164 }
1165 return pino;
1166
1167}
1168
1169unsigned char
1170jffs2_1pass_rescan_needed(struct part_info *part)
1171{
1172 struct b_node *b;
wdenk8886a662004-04-18 19:43:36 +00001173 struct jffs2_unknown_node onode;
wdenkfe8c2802002-11-03 00:38:21 +00001174 struct jffs2_unknown_node *node;
wdenk6b58f332003-03-14 20:47:52 +00001175 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
wdenkfe8c2802002-11-03 00:38:21 +00001176
1177 if (part->jffs2_priv == 0){
1178 DEBUGF ("rescan: First time in use\n");
1179 return 1;
1180 }
Wolfgang Denk47f57792005-08-08 01:03:24 +02001181
wdenkfe8c2802002-11-03 00:38:21 +00001182 /* if we have no list, we need to rescan */
wdenk6b58f332003-03-14 20:47:52 +00001183 if (pL->frag.listCount == 0) {
wdenkfe8c2802002-11-03 00:38:21 +00001184 DEBUGF ("rescan: fraglist zero\n");
1185 return 1;
1186 }
1187
wdenk6b58f332003-03-14 20:47:52 +00001188 /* but suppose someone reflashed a partition at the same offset... */
1189 b = pL->dir.listHead;
wdenkfe8c2802002-11-03 00:38:21 +00001190 while (b) {
wdenk8886a662004-04-18 19:43:36 +00001191 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1192 sizeof(onode), &onode);
wdenkfe8c2802002-11-03 00:38:21 +00001193 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
wdenk6b58f332003-03-14 20:47:52 +00001194 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1195 (unsigned long) b->offset);
wdenkfe8c2802002-11-03 00:38:21 +00001196 return 1;
1197 }
1198 b = b->next;
1199 }
1200 return 0;
1201}
wdenk6b58f332003-03-14 20:47:52 +00001202
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001203#ifdef CONFIG_JFFS2_SUMMARY
1204static u32 sum_get_unaligned32(u32 *ptr)
1205{
1206 u32 val;
1207 u8 *p = (u8 *)ptr;
1208
1209 val = *p | (*(p + 1) << 8) | (*(p + 2) << 16) | (*(p + 3) << 24);
1210
1211 return __le32_to_cpu(val);
1212}
1213
1214static u16 sum_get_unaligned16(u16 *ptr)
1215{
1216 u16 val;
1217 u8 *p = (u8 *)ptr;
1218
1219 val = *p | (*(p + 1) << 8);
1220
1221 return __le16_to_cpu(val);
1222}
1223
Ilya Yanoka933bd62008-11-13 19:49:35 +03001224#define dbg_summary(...) do {} while (0);
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001225/*
1226 * Process the stored summary information - helper function for
Ilya Yanoka933bd62008-11-13 19:49:35 +03001227 * jffs2_sum_scan_sumnode()
1228 */
1229
1230static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset,
1231 struct jffs2_raw_summary *summary,
1232 struct b_lists *pL)
1233{
1234 void *sp;
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001235 int i, pass;
1236 void *ret;
Ilya Yanoka933bd62008-11-13 19:49:35 +03001237
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001238 for (pass = 0; pass < 2; pass++) {
1239 sp = summary->sum;
Ilya Yanoka933bd62008-11-13 19:49:35 +03001240
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001241 for (i = 0; i < summary->sum_num; i++) {
1242 struct jffs2_sum_unknown_flash *spu = sp;
1243 dbg_summary("processing summary index %d\n", i);
Ilya Yanoka933bd62008-11-13 19:49:35 +03001244
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001245 switch (sum_get_unaligned16(&spu->nodetype)) {
1246 case JFFS2_NODETYPE_INODE: {
Ilya Yanoka933bd62008-11-13 19:49:35 +03001247 struct jffs2_sum_inode_flash *spi;
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001248 if (pass) {
1249 spi = sp;
Ilya Yanoka933bd62008-11-13 19:49:35 +03001250
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001251 ret = insert_node(&pL->frag,
1252 (u32)part->offset +
1253 offset +
1254 sum_get_unaligned32(
1255 &spi->offset));
1256 if (ret == NULL)
1257 return -1;
1258 }
Ilya Yanoka933bd62008-11-13 19:49:35 +03001259
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001260 sp += JFFS2_SUMMARY_INODE_SIZE;
Ilya Yanoka933bd62008-11-13 19:49:35 +03001261
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001262 break;
1263 }
1264 case JFFS2_NODETYPE_DIRENT: {
1265 struct jffs2_sum_dirent_flash *spd;
1266 spd = sp;
1267 if (pass) {
1268 ret = insert_node(&pL->dir,
1269 (u32) part->offset +
1270 offset +
1271 sum_get_unaligned32(
1272 &spd->offset));
1273 if (ret == NULL)
1274 return -1;
1275 }
Ilya Yanoka933bd62008-11-13 19:49:35 +03001276
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001277 sp += JFFS2_SUMMARY_DIRENT_SIZE(
1278 spd->nsize);
Ilya Yanoka933bd62008-11-13 19:49:35 +03001279
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001280 break;
1281 }
1282 default : {
1283 uint16_t nodetype = sum_get_unaligned16(
1284 &spu->nodetype);
1285 printf("Unsupported node type %x found"
1286 " in summary!\n",
1287 nodetype);
1288 if ((nodetype & JFFS2_COMPAT_MASK) ==
1289 JFFS2_FEATURE_INCOMPAT)
1290 return -EIO;
1291 return -EBADMSG;
1292 }
Ilya Yanoka933bd62008-11-13 19:49:35 +03001293 }
1294 }
1295 }
1296 return 0;
1297}
1298
1299/* Process the summary node - called from jffs2_scan_eraseblock() */
1300int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset,
1301 struct jffs2_raw_summary *summary, uint32_t sumsize,
1302 struct b_lists *pL)
1303{
1304 struct jffs2_unknown_node crcnode;
1305 int ret, ofs;
1306 uint32_t crc;
1307
1308 ofs = part->sector_size - sumsize;
1309
1310 dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
1311 offset, offset + ofs, sumsize);
1312
1313 /* OK, now check for node validity and CRC */
1314 crcnode.magic = JFFS2_MAGIC_BITMASK;
1315 crcnode.nodetype = JFFS2_NODETYPE_SUMMARY;
1316 crcnode.totlen = summary->totlen;
1317 crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4);
1318
1319 if (summary->hdr_crc != crc) {
1320 dbg_summary("Summary node header is corrupt (bad CRC or "
1321 "no summary at all)\n");
1322 goto crc_err;
1323 }
1324
1325 if (summary->totlen != sumsize) {
1326 dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
1327 goto crc_err;
1328 }
1329
1330 crc = crc32_no_comp(0, (uchar *)summary,
1331 sizeof(struct jffs2_raw_summary)-8);
1332
1333 if (summary->node_crc != crc) {
1334 dbg_summary("Summary node is corrupt (bad CRC)\n");
1335 goto crc_err;
1336 }
1337
1338 crc = crc32_no_comp(0, (uchar *)summary->sum,
1339 sumsize - sizeof(struct jffs2_raw_summary));
1340
1341 if (summary->sum_crc != crc) {
1342 dbg_summary("Summary node data is corrupt (bad CRC)\n");
1343 goto crc_err;
1344 }
1345
1346 if (summary->cln_mkr)
1347 dbg_summary("Summary : CLEANMARKER node \n");
1348
1349 ret = jffs2_sum_process_sum_data(part, offset, summary, pL);
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001350 if (ret == -EBADMSG)
1351 return 0;
Ilya Yanoka933bd62008-11-13 19:49:35 +03001352 if (ret)
1353 return ret; /* real error */
1354
1355 return 1;
1356
1357crc_err:
1358 putstr("Summary node crc error, skipping summary information.\n");
1359
1360 return 0;
1361}
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001362#endif /* CONFIG_JFFS2_SUMMARY */
Ilya Yanoka933bd62008-11-13 19:49:35 +03001363
wdenk6b58f332003-03-14 20:47:52 +00001364#ifdef DEBUG_FRAGMENTS
1365static void
1366dump_fragments(struct b_lists *pL)
1367{
1368 struct b_node *b;
wdenk8886a662004-04-18 19:43:36 +00001369 struct jffs2_raw_inode ojNode;
wdenk6b58f332003-03-14 20:47:52 +00001370 struct jffs2_raw_inode *jNode;
1371
1372 putstr("\r\n\r\n******The fragment Entries******\r\n");
1373 b = pL->frag.listHead;
1374 while (b) {
wdenk8886a662004-04-18 19:43:36 +00001375 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1376 sizeof(ojNode), &ojNode);
wdenk6b58f332003-03-14 20:47:52 +00001377 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1378 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1379 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1380 putLabeledWord("\tbuild_list: version = ", jNode->version);
1381 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1382 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1383 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1384 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1385 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1386 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1387 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1388 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
wdenk57b2d802003-06-27 21:31:46 +00001389 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
wdenk6b58f332003-03-14 20:47:52 +00001390 b = b->next;
1391 }
1392}
1393#endif
1394
1395#ifdef DEBUG_DIRENTS
1396static void
1397dump_dirents(struct b_lists *pL)
1398{
1399 struct b_node *b;
1400 struct jffs2_raw_dirent *jDir;
1401
1402 putstr("\r\n\r\n******The directory Entries******\r\n");
1403 b = pL->dir.listHead;
1404 while (b) {
Ilya Yanoke7fd6712008-11-13 19:49:34 +03001405 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1406 pL->readbuf);
wdenk6b58f332003-03-14 20:47:52 +00001407 putstr("\r\n");
1408 putnstr(jDir->name, jDir->nsize);
1409 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1410 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1411 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1412 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1413 putLabeledWord("\tbuild_list: version = ", jDir->version);
1414 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1415 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1416 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1417 putLabeledWord("\tbuild_list: type = ", jDir->type);
1418 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1419 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
Wolfgang Denka1be4762008-05-20 16:00:29 +02001420 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
wdenk6b58f332003-03-14 20:47:52 +00001421 b = b->next;
Ilya Yanoke7fd6712008-11-13 19:49:34 +03001422 put_fl_mem(jDir, pL->readbuf);
wdenk6b58f332003-03-14 20:47:52 +00001423 }
1424}
1425#endif
wdenkfe8c2802002-11-03 00:38:21 +00001426
Ilya Yanokddb02692008-11-13 19:49:33 +03001427#define DEFAULT_EMPTY_SCAN_SIZE 4096
1428
1429static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size)
1430{
1431 if (sector_size < DEFAULT_EMPTY_SCAN_SIZE)
1432 return sector_size;
1433 else
1434 return DEFAULT_EMPTY_SCAN_SIZE;
1435}
1436
wdenkfe8c2802002-11-03 00:38:21 +00001437static u32
1438jffs2_1pass_build_lists(struct part_info * part)
1439{
1440 struct b_lists *pL;
1441 struct jffs2_unknown_node *node;
Tom Rini3cd84d62013-12-05 14:48:38 -05001442 u32 nr_sectors;
Ilya Yanokddb02692008-11-13 19:49:33 +03001443 u32 i;
wdenkfe8c2802002-11-03 00:38:21 +00001444 u32 counter4 = 0;
1445 u32 counterF = 0;
1446 u32 counterN = 0;
Ilya Yanoke7fd6712008-11-13 19:49:34 +03001447 u32 max_totlen = 0;
Ilya Yanokddb02692008-11-13 19:49:33 +03001448 u32 buf_size = DEFAULT_EMPTY_SCAN_SIZE;
1449 char *buf;
wdenkfe8c2802002-11-03 00:38:21 +00001450
Tom Rini3cd84d62013-12-05 14:48:38 -05001451 nr_sectors = lldiv(part->size, part->sector_size);
wdenkfe8c2802002-11-03 00:38:21 +00001452 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1453 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1454 /* only about 5 %. not enough to inconvenience people for. */
1455 /* lcd_off(); */
1456
1457 /* if we are building a list we need to refresh the cache. */
wdenkfe8c2802002-11-03 00:38:21 +00001458 jffs_init_1pass_list(part);
wdenk6b58f332003-03-14 20:47:52 +00001459 pL = (struct b_lists *)part->jffs2_priv;
Ilya Yanokddb02692008-11-13 19:49:33 +03001460 buf = malloc(buf_size);
wdenk42c05472004-03-23 22:14:11 +00001461 puts ("Scanning JFFS2 FS: ");
wdenkfe8c2802002-11-03 00:38:21 +00001462
1463 /* start at the beginning of the partition */
Ilya Yanokddb02692008-11-13 19:49:33 +03001464 for (i = 0; i < nr_sectors; i++) {
1465 uint32_t sector_ofs = i * part->sector_size;
1466 uint32_t buf_ofs = sector_ofs;
Ilya Yanoka933bd62008-11-13 19:49:35 +03001467 uint32_t buf_len;
Ilya Yanokddb02692008-11-13 19:49:33 +03001468 uint32_t ofs, prevofs;
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001469#ifdef CONFIG_JFFS2_SUMMARY
Ilya Yanoka933bd62008-11-13 19:49:35 +03001470 struct jffs2_sum_marker *sm;
1471 void *sumptr = NULL;
1472 uint32_t sumlen;
1473 int ret;
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001474#endif
wdenk7ad5e4c2004-04-25 15:41:35 +00001475
Stuart Wood471a2f02008-06-02 16:40:08 -04001476 WATCHDOG_RESET();
Ilya Yanoka933bd62008-11-13 19:49:35 +03001477
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001478#ifdef CONFIG_JFFS2_SUMMARY
Ilya Yanoka933bd62008-11-13 19:49:35 +03001479 buf_len = sizeof(*sm);
1480
1481 /* Read as much as we want into the _end_ of the preallocated
1482 * buffer
1483 */
1484 get_fl_mem(part->offset + sector_ofs + part->sector_size -
1485 buf_len, buf_len, buf + buf_size - buf_len);
1486
1487 sm = (void *)buf + buf_size - sizeof(*sm);
1488 if (sm->magic == JFFS2_SUM_MAGIC) {
1489 sumlen = part->sector_size - sm->offset;
1490 sumptr = buf + buf_size - sumlen;
1491
1492 /* Now, make sure the summary itself is available */
1493 if (sumlen > buf_size) {
1494 /* Need to kmalloc for this. */
1495 sumptr = malloc(sumlen);
1496 if (!sumptr) {
1497 putstr("Can't get memory for summary "
1498 "node!\n");
Ilya Yanoka87011e2009-08-12 16:42:48 +04001499 free(buf);
1500 jffs2_free_cache(part);
Ilya Yanoka933bd62008-11-13 19:49:35 +03001501 return 0;
1502 }
1503 memcpy(sumptr + sumlen - buf_len, buf +
1504 buf_size - buf_len, buf_len);
1505 }
1506 if (buf_len < sumlen) {
1507 /* Need to read more so that the entire summary
1508 * node is present
1509 */
1510 get_fl_mem(part->offset + sector_ofs +
1511 part->sector_size - sumlen,
1512 sumlen - buf_len, sumptr);
1513 }
1514 }
1515
1516 if (sumptr) {
1517 ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr,
1518 sumlen, pL);
1519
1520 if (buf_size && sumlen > buf_size)
1521 free(sumptr);
Ilya Yanoka87011e2009-08-12 16:42:48 +04001522 if (ret < 0) {
1523 free(buf);
1524 jffs2_free_cache(part);
Ilya Yanoka933bd62008-11-13 19:49:35 +03001525 return 0;
Ilya Yanoka87011e2009-08-12 16:42:48 +04001526 }
Ilya Yanoka933bd62008-11-13 19:49:35 +03001527 if (ret)
1528 continue;
1529
1530 }
Ilya Yanokbcaa1f72009-07-17 15:02:42 +04001531#endif /* CONFIG_JFFS2_SUMMARY */
Ilya Yanoka933bd62008-11-13 19:49:35 +03001532
1533 buf_len = EMPTY_SCAN_SIZE(part->sector_size);
1534
Ilya Yanokddb02692008-11-13 19:49:33 +03001535 get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf);
Stuart Wood471a2f02008-06-02 16:40:08 -04001536
Ilya Yanokddb02692008-11-13 19:49:33 +03001537 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
1538 ofs = 0;
1539
1540 /* Scan only 4KiB of 0xFF before declaring it's empty */
1541 while (ofs < EMPTY_SCAN_SIZE(part->sector_size) &&
1542 *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF)
1543 ofs += 4;
1544
1545 if (ofs == EMPTY_SCAN_SIZE(part->sector_size))
1546 continue;
1547
1548 ofs += sector_ofs;
1549 prevofs = ofs - 1;
1550
1551 scan_more:
1552 while (ofs < sector_ofs + part->sector_size) {
1553 if (ofs == prevofs) {
1554 printf("offset %08x already seen, skip\n", ofs);
1555 ofs += 4;
1556 counter4++;
1557 continue;
1558 }
1559 prevofs = ofs;
1560 if (sector_ofs + part->sector_size <
1561 ofs + sizeof(*node))
1562 break;
1563 if (buf_ofs + buf_len < ofs + sizeof(*node)) {
1564 buf_len = min_t(uint32_t, buf_size, sector_ofs
1565 + part->sector_size - ofs);
1566 get_fl_mem((u32)part->offset + ofs, buf_len,
1567 buf);
1568 buf_ofs = ofs;
1569 }
1570
1571 node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs];
1572
1573 if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) {
1574 uint32_t inbuf_ofs;
Wolfgang Denkbf913c12011-10-05 22:58:11 +02001575 uint32_t scan_end;
Ilya Yanokddb02692008-11-13 19:49:33 +03001576
Ilya Yanokddb02692008-11-13 19:49:33 +03001577 ofs += 4;
1578 scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(
1579 part->sector_size)/8,
1580 buf_len);
1581 more_empty:
1582 inbuf_ofs = ofs - buf_ofs;
1583 while (inbuf_ofs < scan_end) {
1584 if (*(uint32_t *)(&buf[inbuf_ofs]) !=
1585 0xffffffff)
1586 goto scan_more;
1587
1588 inbuf_ofs += 4;
1589 ofs += 4;
1590 }
1591 /* Ran off end. */
1592
1593 /* See how much more there is to read in this
1594 * eraseblock...
1595 */
1596 buf_len = min_t(uint32_t, buf_size,
1597 sector_ofs +
1598 part->sector_size - ofs);
1599 if (!buf_len) {
1600 /* No more to read. Break out of main
1601 * loop without marking this range of
1602 * empty space as dirty (because it's
1603 * not)
1604 */
1605 break;
1606 }
1607 scan_end = buf_len;
1608 get_fl_mem((u32)part->offset + ofs, buf_len,
1609 buf);
1610 buf_ofs = ofs;
1611 goto more_empty;
1612 }
1613 if (node->magic != JFFS2_MAGIC_BITMASK ||
1614 !hdr_crc(node)) {
1615 ofs += 4;
1616 counter4++;
1617 continue;
1618 }
1619 if (ofs + node->totlen >
1620 sector_ofs + part->sector_size) {
1621 ofs += 4;
1622 counter4++;
1623 continue;
1624 }
wdenkfe8c2802002-11-03 00:38:21 +00001625 /* if its a fragment add it */
Ilya Yanokddb02692008-11-13 19:49:33 +03001626 switch (node->nodetype) {
1627 case JFFS2_NODETYPE_INODE:
1628 if (buf_ofs + buf_len < ofs + sizeof(struct
1629 jffs2_raw_inode)) {
1630 get_fl_mem((u32)part->offset + ofs,
1631 buf_len, buf);
1632 buf_ofs = ofs;
1633 node = (void *)buf;
1634 }
1635 if (!inode_crc((struct jffs2_raw_inode *) node))
1636 break;
1637
wdenk6b58f332003-03-14 20:47:52 +00001638 if (insert_node(&pL->frag, (u32) part->offset +
Ilya Yanoka87011e2009-08-12 16:42:48 +04001639 ofs) == NULL) {
1640 free(buf);
1641 jffs2_free_cache(part);
wdenkfe8c2802002-11-03 00:38:21 +00001642 return 0;
Ilya Yanoka87011e2009-08-12 16:42:48 +04001643 }
Ilya Yanoke7fd6712008-11-13 19:49:34 +03001644 if (max_totlen < node->totlen)
1645 max_totlen = node->totlen;
Ilya Yanokddb02692008-11-13 19:49:33 +03001646 break;
1647 case JFFS2_NODETYPE_DIRENT:
1648 if (buf_ofs + buf_len < ofs + sizeof(struct
1649 jffs2_raw_dirent) +
1650 ((struct
1651 jffs2_raw_dirent *)
1652 node)->nsize) {
1653 get_fl_mem((u32)part->offset + ofs,
1654 buf_len, buf);
1655 buf_ofs = ofs;
1656 node = (void *)buf;
wdenk8886a662004-04-18 19:43:36 +00001657 }
Ilya Yanokddb02692008-11-13 19:49:33 +03001658
1659 if (!dirent_crc((struct jffs2_raw_dirent *)
1660 node) ||
1661 !dirent_name_crc(
1662 (struct
1663 jffs2_raw_dirent *)
1664 node))
1665 break;
wdenk7ad5e4c2004-04-25 15:41:35 +00001666 if (! (counterN%100))
wdenk42c05472004-03-23 22:14:11 +00001667 puts ("\b\b. ");
wdenk6b58f332003-03-14 20:47:52 +00001668 if (insert_node(&pL->dir, (u32) part->offset +
Ilya Yanoka87011e2009-08-12 16:42:48 +04001669 ofs) == NULL) {
1670 free(buf);
1671 jffs2_free_cache(part);
wdenkfe8c2802002-11-03 00:38:21 +00001672 return 0;
Ilya Yanoka87011e2009-08-12 16:42:48 +04001673 }
Ilya Yanoke7fd6712008-11-13 19:49:34 +03001674 if (max_totlen < node->totlen)
1675 max_totlen = node->totlen;
wdenkfe8c2802002-11-03 00:38:21 +00001676 counterN++;
Ilya Yanokddb02692008-11-13 19:49:33 +03001677 break;
1678 case JFFS2_NODETYPE_CLEANMARKER:
wdenkfe8c2802002-11-03 00:38:21 +00001679 if (node->totlen != sizeof(struct jffs2_unknown_node))
wdenk6b58f332003-03-14 20:47:52 +00001680 printf("OOPS Cleanmarker has bad size "
Wolfgang Denk509cd072008-07-14 15:06:35 +02001681 "%d != %zu\n",
1682 node->totlen,
wdenk6b58f332003-03-14 20:47:52 +00001683 sizeof(struct jffs2_unknown_node));
Ilya Yanokddb02692008-11-13 19:49:33 +03001684 break;
1685 case JFFS2_NODETYPE_PADDING:
wdenk2c9b05d2003-09-10 22:30:53 +00001686 if (node->totlen < sizeof(struct jffs2_unknown_node))
1687 printf("OOPS Padding has bad size "
Wolfgang Denk509cd072008-07-14 15:06:35 +02001688 "%d < %zu\n",
1689 node->totlen,
wdenk2c9b05d2003-09-10 22:30:53 +00001690 sizeof(struct jffs2_unknown_node));
Ilya Yanokddb02692008-11-13 19:49:33 +03001691 break;
Ilya Yanoka933bd62008-11-13 19:49:35 +03001692 case JFFS2_NODETYPE_SUMMARY:
1693 break;
Ilya Yanokddb02692008-11-13 19:49:33 +03001694 default:
Wolfgang Denk509cd072008-07-14 15:06:35 +02001695 printf("Unknown node type: %x len %d offset 0x%x\n",
1696 node->nodetype,
Ilya Yanokddb02692008-11-13 19:49:33 +03001697 node->totlen, ofs);
wdenkfe8c2802002-11-03 00:38:21 +00001698 }
Ilya Yanokddb02692008-11-13 19:49:33 +03001699 ofs += ((node->totlen + 3) & ~3);
wdenkfe8c2802002-11-03 00:38:21 +00001700 counterF++;
wdenkfe8c2802002-11-03 00:38:21 +00001701 }
wdenkfe8c2802002-11-03 00:38:21 +00001702 }
1703
Ilya Yanokddb02692008-11-13 19:49:33 +03001704 free(buf);
wdenkfe8c2802002-11-03 00:38:21 +00001705 putstr("\b\b done.\r\n"); /* close off the dots */
Ilya Yanoke7fd6712008-11-13 19:49:34 +03001706
1707 /* We don't care if malloc failed - then each read operation will
1708 * allocate its own buffer as necessary (NAND) or will read directly
1709 * from flash (NOR).
1710 */
1711 pL->readbuf = malloc(max_totlen);
1712
wdenkfe8c2802002-11-03 00:38:21 +00001713 /* turn the lcd back on. */
1714 /* splash(); */
1715
1716#if 0
wdenk6b58f332003-03-14 20:47:52 +00001717 putLabeledWord("dir entries = ", pL->dir.listCount);
1718 putLabeledWord("frag entries = ", pL->frag.listCount);
wdenkfe8c2802002-11-03 00:38:21 +00001719 putLabeledWord("+4 increments = ", counter4);
1720 putLabeledWord("+file_offset increments = ", counterF);
1721
1722#endif
1723
wdenk6b58f332003-03-14 20:47:52 +00001724#ifdef DEBUG_DIRENTS
1725 dump_dirents(pL);
1726#endif
wdenkfe8c2802002-11-03 00:38:21 +00001727
wdenk6b58f332003-03-14 20:47:52 +00001728#ifdef DEBUG_FRAGMENTS
1729 dump_fragments(pL);
1730#endif
wdenkfe8c2802002-11-03 00:38:21 +00001731
wdenkfe8c2802002-11-03 00:38:21 +00001732 /* give visual feedback that we are done scanning the flash */
1733 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1734 return 1;
1735}
1736
1737
wdenkfe8c2802002-11-03 00:38:21 +00001738static u32
1739jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1740{
1741 struct b_node *b;
wdenk8886a662004-04-18 19:43:36 +00001742 struct jffs2_raw_inode ojNode;
wdenkfe8c2802002-11-03 00:38:21 +00001743 struct jffs2_raw_inode *jNode;
1744 int i;
1745
wdenkfe8c2802002-11-03 00:38:21 +00001746 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1747 piL->compr_info[i].num_frags = 0;
1748 piL->compr_info[i].compr_sum = 0;
1749 piL->compr_info[i].decompr_sum = 0;
1750 }
1751
wdenk6b58f332003-03-14 20:47:52 +00001752 b = pL->frag.listHead;
wdenkfe8c2802002-11-03 00:38:21 +00001753 while (b) {
wdenk8886a662004-04-18 19:43:36 +00001754 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1755 sizeof(ojNode), &ojNode);
wdenkfe8c2802002-11-03 00:38:21 +00001756 if (jNode->compr < JFFS2_NUM_COMPR) {
1757 piL->compr_info[jNode->compr].num_frags++;
1758 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1759 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1760 }
1761 b = b->next;
1762 }
1763 return 0;
1764}
1765
1766
wdenkfe8c2802002-11-03 00:38:21 +00001767static struct b_lists *
1768jffs2_get_list(struct part_info * part, const char *who)
1769{
Wolfgang Denk47f57792005-08-08 01:03:24 +02001770 /* copy requested part_info struct pointer to global location */
1771 current_part = part;
1772
wdenkfe8c2802002-11-03 00:38:21 +00001773 if (jffs2_1pass_rescan_needed(part)) {
1774 if (!jffs2_1pass_build_lists(part)) {
1775 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1776 return NULL;
1777 }
1778 }
1779 return (struct b_lists *)part->jffs2_priv;
1780}
1781
1782
1783/* Print directory / file contents */
1784u32
1785jffs2_1pass_ls(struct part_info * part, const char *fname)
1786{
1787 struct b_lists *pl;
Wolfgang Denk79117cd2005-08-16 09:32:45 +02001788 long ret = 1;
wdenkfe8c2802002-11-03 00:38:21 +00001789 u32 inode;
1790
wdenk6b58f332003-03-14 20:47:52 +00001791 if (! (pl = jffs2_get_list(part, "ls")))
wdenkfe8c2802002-11-03 00:38:21 +00001792 return 0;
1793
1794 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1795 putstr("ls: Failed to scan jffs2 file structure\r\n");
1796 return 0;
1797 }
wdenk7ad5e4c2004-04-25 15:41:35 +00001798
1799
wdenkfe8c2802002-11-03 00:38:21 +00001800#if 0
1801 putLabeledWord("found file at inode = ", inode);
1802 putLabeledWord("read_inode returns = ", ret);
1803#endif
wdenk7ad5e4c2004-04-25 15:41:35 +00001804
1805 return ret;
wdenkfe8c2802002-11-03 00:38:21 +00001806}
1807
1808
wdenkfe8c2802002-11-03 00:38:21 +00001809/* Load a file from flash into memory. fname can be a full path */
1810u32
1811jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1812{
1813
1814 struct b_lists *pl;
Wolfgang Denk79117cd2005-08-16 09:32:45 +02001815 long ret = 1;
wdenkfe8c2802002-11-03 00:38:21 +00001816 u32 inode;
1817
1818 if (! (pl = jffs2_get_list(part, "load")))
1819 return 0;
1820
1821 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1822 putstr("load: Failed to find inode\r\n");
1823 return 0;
1824 }
1825
1826 /* Resolve symlinks */
1827 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1828 putstr("load: Failed to resolve inode structure\r\n");
1829 return 0;
1830 }
1831
1832 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1833 putstr("load: Failed to read inode\r\n");
1834 return 0;
1835 }
1836
1837 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1838 (unsigned long) dest, ret);
1839 return ret;
1840}
1841
1842/* Return information about the fs on this partition */
1843u32
1844jffs2_1pass_info(struct part_info * part)
1845{
1846 struct b_jffs2_info info;
1847 struct b_lists *pl;
1848 int i;
1849
1850 if (! (pl = jffs2_get_list(part, "info")))
1851 return 0;
1852
1853 jffs2_1pass_fill_info(pl, &info);
wdenk6b58f332003-03-14 20:47:52 +00001854 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
wdenk42c05472004-03-23 22:14:11 +00001855 printf ("Compression: %s\n"
1856 "\tfrag count: %d\n"
1857 "\tcompressed sum: %d\n"
1858 "\tuncompressed sum: %d\n",
1859 compr_names[i],
1860 info.compr_info[i].num_frags,
1861 info.compr_info[i].compr_sum,
1862 info.compr_info[i].decompr_sum);
wdenkfe8c2802002-11-03 00:38:21 +00001863 }
1864 return 1;
1865}