blob: af2a8e28067ec1c3e75d2c61803b9434aaa15987 [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:
55 * (1) most pages are 4096 bytes
56 * (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
wdenk06d01db2003-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 *
95 * The fragment sorting feature must be enabled by CFG_JFFS2_SORT_FRAGMENTS.
96 * 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
wdenkdd875c72004-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!
wdenk06d01db2003-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>
117#include <linux/stat.h>
118#include <linux/time.h>
119
Jon Loeliger4e109ae2007-06-11 19:02:20 -0500120#if (CONFIG_COMMANDS & CFG_CMD_JFFS2) || defined(CONFIG_CMD_JFFS2)
wdenkfe8c2802002-11-03 00:38:21 +0000121
122#include <jffs2/jffs2.h>
123#include <jffs2/jffs2_1pass.h>
124
125#include "jffs2_private.h"
126
wdenkfe8c2802002-11-03 00:38:21 +0000127
wdenk06d01db2003-03-14 20:47:52 +0000128#define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */
wdenkfc1cfcd2004-04-25 15:41:35 +0000129#define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */
wdenkfe8c2802002-11-03 00:38:21 +0000130
wdenk06d01db2003-03-14 20:47:52 +0000131/* Debugging switches */
132#undef DEBUG_DIRENTS /* print directory entry list after scan */
133#undef DEBUG_FRAGMENTS /* print fragment list after scan */
134#undef DEBUG /* enable debugging messages */
135
136
wdenkfe8c2802002-11-03 00:38:21 +0000137#ifdef DEBUG
138# define DEBUGF(fmt,args...) printf(fmt ,##args)
139#else
140# define DEBUGF(fmt,args...)
141#endif
142
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200143/* keeps pointer to currentlu processed partition */
144static struct part_info *current_part;
wdenk998eaae2004-04-18 19:43:36 +0000145
Wolfgang Denke4dbe1b2007-07-05 17:56:27 +0200146#if (defined(CONFIG_JFFS2_NAND) && \
147 ((CONFIG_COMMANDS & CFG_CMD_NAND) || defined(CONFIG_CMD_NAND)) )
Marian Balakowicz6db39702006-04-08 19:08:06 +0200148#if defined(CFG_NAND_LEGACY)
149#include <linux/mtd/nand_legacy.h>
150#else
Bartlomiej Siekaaddb2e12006-03-05 18:57:33 +0100151#include <nand.h>
Marian Balakowicz6db39702006-04-08 19:08:06 +0200152#endif
wdenk998eaae2004-04-18 19:43:36 +0000153/*
154 * Support for jffs2 on top of NAND-flash
155 *
156 * NAND memory isn't mapped in processor's address space,
157 * so data should be fetched from flash before
158 * being processed. This is exactly what functions declared
159 * here do.
160 *
161 */
162
Marian Balakowicz6db39702006-04-08 19:08:06 +0200163#if defined(CFG_NAND_LEGACY)
164/* this one defined in nand_legacy.c */
165int read_jffs2_nand(size_t start, size_t len,
166 size_t * retlen, u_char * buf, int nanddev);
167#else
Bartlomiej Siekaaddb2e12006-03-05 18:57:33 +0100168/* info for NAND chips, defined in drivers/nand/nand.c */
169extern nand_info_t nand_info[];
Marian Balakowicz6db39702006-04-08 19:08:06 +0200170#endif
wdenk998eaae2004-04-18 19:43:36 +0000171
172#define NAND_PAGE_SIZE 512
173#define NAND_PAGE_SHIFT 9
174#define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
175
176#ifndef NAND_CACHE_PAGES
177#define NAND_CACHE_PAGES 16
178#endif
179#define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
180
181static u8* nand_cache = NULL;
182static u32 nand_cache_off = (u32)-1;
wdenk998eaae2004-04-18 19:43:36 +0000183
184static int read_nand_cached(u32 off, u32 size, u_char *buf)
185{
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200186 struct mtdids *id = current_part->dev->id;
wdenk998eaae2004-04-18 19:43:36 +0000187 u32 bytes_read = 0;
Marian Balakowicz6db39702006-04-08 19:08:06 +0200188#if defined(CFG_NAND_LEGACY)
189 size_t retlen;
190#else
Bartlomiej Siekaaddb2e12006-03-05 18:57:33 +0100191 ulong retlen;
Marian Balakowicz6db39702006-04-08 19:08:06 +0200192#endif
wdenk998eaae2004-04-18 19:43:36 +0000193 int cpy_bytes;
194
195 while (bytes_read < size) {
196 if ((off + bytes_read < nand_cache_off) ||
197 (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) {
198 nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
199 if (!nand_cache) {
200 /* This memory never gets freed but 'cause
201 it's a bootloader, nobody cares */
wdenk507bbe32004-04-18 21:13:41 +0000202 nand_cache = malloc(NAND_CACHE_SIZE);
203 if (!nand_cache) {
wdenk998eaae2004-04-18 19:43:36 +0000204 printf("read_nand_cached: can't alloc cache size %d bytes\n",
205 NAND_CACHE_SIZE);
206 return -1;
207 }
208 }
Bartlomiej Siekaaddb2e12006-03-05 18:57:33 +0100209
Marian Balakowicz6db39702006-04-08 19:08:06 +0200210#if defined(CFG_NAND_LEGACY)
211 if (read_jffs2_nand(nand_cache_off, NAND_CACHE_SIZE,
212 &retlen, nand_cache, id->num) < 0 ||
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200213 retlen != NAND_CACHE_SIZE) {
wdenk998eaae2004-04-18 19:43:36 +0000214 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200215 nand_cache_off, NAND_CACHE_SIZE);
wdenk998eaae2004-04-18 19:43:36 +0000216 return -1;
217 }
Marian Balakowicz6db39702006-04-08 19:08:06 +0200218#else
219 retlen = NAND_CACHE_SIZE;
220 if (nand_read(&nand_info[id->num], nand_cache_off,
221 &retlen, nand_cache) != 0 ||
222 retlen != NAND_CACHE_SIZE) {
223 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
224 nand_cache_off, NAND_CACHE_SIZE);
225 return -1;
226 }
227#endif
wdenk998eaae2004-04-18 19:43:36 +0000228 }
229 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
230 if (cpy_bytes > size - bytes_read)
231 cpy_bytes = size - bytes_read;
232 memcpy(buf + bytes_read,
233 nand_cache + off + bytes_read - nand_cache_off,
234 cpy_bytes);
235 bytes_read += cpy_bytes;
236 }
237 return bytes_read;
238}
239
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200240static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
wdenk998eaae2004-04-18 19:43:36 +0000241{
242 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
243
244 if (NULL == buf) {
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200245 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
wdenk998eaae2004-04-18 19:43:36 +0000246 return NULL;
247 }
248 if (read_nand_cached(off, size, buf) < 0) {
wdenk32877d62004-05-05 19:44:41 +0000249 if (!ext_buf)
250 free(buf);
wdenk998eaae2004-04-18 19:43:36 +0000251 return NULL;
252 }
253
254 return buf;
255}
256
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200257static void *get_node_mem_nand(u32 off)
wdenk998eaae2004-04-18 19:43:36 +0000258{
259 struct jffs2_unknown_node node;
260 void *ret = NULL;
261
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200262 if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
wdenk998eaae2004-04-18 19:43:36 +0000263 return NULL;
264
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200265 if (!(ret = get_fl_mem_nand(off, node.magic ==
wdenk998eaae2004-04-18 19:43:36 +0000266 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
267 NULL))) {
268 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
269 off, node.magic, node.nodetype, node.totlen);
270 }
271 return ret;
272}
273
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200274static void put_fl_mem_nand(void *buf)
wdenk998eaae2004-04-18 19:43:36 +0000275{
276 free(buf);
277}
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200278#endif /* #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND) */
wdenk998eaae2004-04-18 19:43:36 +0000279
wdenk998eaae2004-04-18 19:43:36 +0000280
Jon Loeliger4e109ae2007-06-11 19:02:20 -0500281#if (CONFIG_COMMANDS & CFG_CMD_FLASH) || defined(CONFIG_CMD_FLASH)
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200282/*
283 * Support for jffs2 on top of NOR-flash
284 *
285 * NOR flash memory is mapped in processor's address space,
286 * just return address.
287 */
288static inline void *get_fl_mem_nor(u32 off)
289{
290 u32 addr = off;
291 struct mtdids *id = current_part->dev->id;
292
Marian Balakowicze6f2e902005-10-11 19:09:42 +0200293 extern flash_info_t flash_info[];
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200294 flash_info_t *flash = &flash_info[id->num];
295
296 addr += flash->start[0];
297 return (void*)addr;
298}
299
300static inline void *get_node_mem_nor(u32 off)
301{
302 return (void*)get_fl_mem_nor(off);
303}
304#endif /* #if (CONFIG_COMMANDS & CFG_CMD_FLASH) */
305
306
307/*
Wolfgang Denk8f79e4c2005-08-10 15:14:32 +0200308 * Generic jffs2 raw memory and node read routines.
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200309 *
310 */
wdenk998eaae2004-04-18 19:43:36 +0000311static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
312{
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200313 struct mtdids *id = current_part->dev->id;
Wolfgang Denk8f79e4c2005-08-10 15:14:32 +0200314
Jon Loeliger4e109ae2007-06-11 19:02:20 -0500315#if (CONFIG_COMMANDS & CFG_CMD_FLASH) || defined(CONFIG_CMD_FLASH)
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200316 if (id->type == MTD_DEV_TYPE_NOR)
317 return get_fl_mem_nor(off);
318#endif
319
Jon Loeliger4e109ae2007-06-11 19:02:20 -0500320#if defined(CONFIG_JFFS2_NAND) && ((CONFIG_COMMANDS & CFG_CMD_NAND) || defined(CONFIG_CMD_NAND))
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200321 if (id->type == MTD_DEV_TYPE_NAND)
322 return get_fl_mem_nand(off, size, ext_buf);
323#endif
324
325 printf("get_fl_mem: unknown device type, using raw offset!\n");
wdenk998eaae2004-04-18 19:43:36 +0000326 return (void*)off;
327}
328
329static inline void *get_node_mem(u32 off)
330{
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200331 struct mtdids *id = current_part->dev->id;
Wolfgang Denk8f79e4c2005-08-10 15:14:32 +0200332
Jon Loeliger4e109ae2007-06-11 19:02:20 -0500333#if (CONFIG_COMMANDS & CFG_CMD_FLASH) || defined(CONFIG_CMD_FLASH)
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200334 if (id->type == MTD_DEV_TYPE_NOR)
335 return get_node_mem_nor(off);
336#endif
337
Wolfgang Denke4dbe1b2007-07-05 17:56:27 +0200338#if defined(CONFIG_JFFS2_NAND) && \
339 (CONFIG_COMMANDS & CFG_CMD_NAND) || defined(CONFIG_CMD_NAND)
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200340 if (id->type == MTD_DEV_TYPE_NAND)
341 return get_node_mem_nand(off);
342#endif
343
344 printf("get_node_mem: unknown device type, using raw offset!\n");
wdenk998eaae2004-04-18 19:43:36 +0000345 return (void*)off;
346}
347
wdenk507bbe32004-04-18 21:13:41 +0000348static inline void put_fl_mem(void *buf)
wdenk998eaae2004-04-18 19:43:36 +0000349{
Wolfgang Denke4dbe1b2007-07-05 17:56:27 +0200350#if defined(CONFIG_JFFS2_NAND) && \
351 (CONFIG_COMMANDS & CFG_CMD_NAND) || defined(CONFIG_CMD_NAND)
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200352 struct mtdids *id = current_part->dev->id;
353
354 if (id->type == MTD_DEV_TYPE_NAND)
355 return put_fl_mem_nand(buf);
356#endif
wdenk998eaae2004-04-18 19:43:36 +0000357}
358
wdenk06d01db2003-03-14 20:47:52 +0000359/* Compression names */
360static char *compr_names[] = {
361 "NONE",
362 "ZERO",
363 "RTIME",
364 "RUBINMIPS",
365 "COPY",
366 "DYNRUBIN",
wdenk07cc0992005-05-05 00:04:14 +0000367 "ZLIB",
wdenk412babe2005-05-05 09:51:44 +0000368#if defined(CONFIG_JFFS2_LZO_LZARI)
wdenk07cc0992005-05-05 00:04:14 +0000369 "LZO",
wdenk07cc0992005-05-05 00:04:14 +0000370 "LZARI",
371#endif
wdenk06d01db2003-03-14 20:47:52 +0000372};
373
374/* Spinning wheel */
375static char spinner[] = { '|', '/', '-', '\\' };
376
377/* Memory management */
378struct mem_block {
379 u32 index;
380 struct mem_block *next;
381 struct b_node nodes[NODE_CHUNK];
382};
383
384
385static void
386free_nodes(struct b_list *list)
387{
388 while (list->listMemBase != NULL) {
389 struct mem_block *next = list->listMemBase->next;
390 free( list->listMemBase );
391 list->listMemBase = next;
392 }
393}
wdenkfe8c2802002-11-03 00:38:21 +0000394
395static struct b_node *
wdenk06d01db2003-03-14 20:47:52 +0000396add_node(struct b_list *list)
wdenkfe8c2802002-11-03 00:38:21 +0000397{
wdenk06d01db2003-03-14 20:47:52 +0000398 u32 index = 0;
399 struct mem_block *memBase;
wdenkfe8c2802002-11-03 00:38:21 +0000400 struct b_node *b;
401
wdenk06d01db2003-03-14 20:47:52 +0000402 memBase = list->listMemBase;
403 if (memBase != NULL)
404 index = memBase->index;
wdenkfe8c2802002-11-03 00:38:21 +0000405#if 0
406 putLabeledWord("add_node: index = ", index);
wdenk06d01db2003-03-14 20:47:52 +0000407 putLabeledWord("add_node: memBase = ", list->listMemBase);
wdenkfe8c2802002-11-03 00:38:21 +0000408#endif
409
wdenk06d01db2003-03-14 20:47:52 +0000410 if (memBase == NULL || index >= NODE_CHUNK) {
411 /* we need more space before we continue */
412 memBase = mmalloc(sizeof(struct mem_block));
413 if (memBase == NULL) {
wdenkfe8c2802002-11-03 00:38:21 +0000414 putstr("add_node: malloc failed\n");
415 return NULL;
416 }
wdenk06d01db2003-03-14 20:47:52 +0000417 memBase->next = list->listMemBase;
418 index = 0;
wdenkfe8c2802002-11-03 00:38:21 +0000419#if 0
420 putLabeledWord("add_node: alloced a new membase at ", *memBase);
421#endif
422
423 }
424 /* now we have room to add it. */
wdenk06d01db2003-03-14 20:47:52 +0000425 b = &memBase->nodes[index];
426 index ++;
wdenkfe8c2802002-11-03 00:38:21 +0000427
wdenk06d01db2003-03-14 20:47:52 +0000428 memBase->index = index;
429 list->listMemBase = memBase;
430 list->listCount++;
wdenkfe8c2802002-11-03 00:38:21 +0000431 return b;
wdenkfe8c2802002-11-03 00:38:21 +0000432}
433
wdenk06d01db2003-03-14 20:47:52 +0000434static struct b_node *
435insert_node(struct b_list *list, u32 offset)
436{
437 struct b_node *new;
438#ifdef CFG_JFFS2_SORT_FRAGMENTS
439 struct b_node *b, *prev;
440#endif
441
442 if (!(new = add_node(list))) {
443 putstr("add_node failed!\r\n");
444 return NULL;
445 }
446 new->offset = offset;
447
448#ifdef CFG_JFFS2_SORT_FRAGMENTS
449 if (list->listTail != NULL && list->listCompare(new, list->listTail))
450 prev = list->listTail;
451 else if (list->listLast != NULL && list->listCompare(new, list->listLast))
452 prev = list->listLast;
453 else
454 prev = NULL;
455
456 for (b = (prev ? prev->next : list->listHead);
457 b != NULL && list->listCompare(new, b);
458 prev = b, b = b->next) {
459 list->listLoops++;
460 }
461 if (b != NULL)
462 list->listLast = prev;
463
464 if (b != NULL) {
465 new->next = b;
466 if (prev != NULL)
467 prev->next = new;
468 else
469 list->listHead = new;
470 } else
471#endif
472 {
473 new->next = (struct b_node *) NULL;
474 if (list->listTail != NULL) {
475 list->listTail->next = new;
476 list->listTail = new;
477 } else {
478 list->listTail = list->listHead = new;
479 }
480 }
481
482 return new;
483}
484
485#ifdef CFG_JFFS2_SORT_FRAGMENTS
wdenk7205e402003-09-10 22:30:53 +0000486/* Sort data entries with the latest version last, so that if there
487 * is overlapping data the latest version will be used.
488 */
wdenk06d01db2003-03-14 20:47:52 +0000489static int compare_inodes(struct b_node *new, struct b_node *old)
490{
wdenk998eaae2004-04-18 19:43:36 +0000491 struct jffs2_raw_inode ojNew;
492 struct jffs2_raw_inode ojOld;
493 struct jffs2_raw_inode *jNew =
494 (struct jffs2_raw_inode *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
495 struct jffs2_raw_inode *jOld =
496 (struct jffs2_raw_inode *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
wdenk06d01db2003-03-14 20:47:52 +0000497
wdenk7205e402003-09-10 22:30:53 +0000498 return jNew->version > jOld->version;
wdenk06d01db2003-03-14 20:47:52 +0000499}
500
wdenk7205e402003-09-10 22:30:53 +0000501/* Sort directory entries so all entries in the same directory
502 * with the same name are grouped together, with the latest version
503 * last. This makes it easy to eliminate all but the latest version
504 * by marking the previous version dead by setting the inode to 0.
505 */
wdenk06d01db2003-03-14 20:47:52 +0000506static int compare_dirents(struct b_node *new, struct b_node *old)
507{
wdenk998eaae2004-04-18 19:43:36 +0000508 struct jffs2_raw_dirent ojNew;
509 struct jffs2_raw_dirent ojOld;
510 struct jffs2_raw_dirent *jNew =
511 (struct jffs2_raw_dirent *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
wdenk507bbe32004-04-18 21:13:41 +0000512 struct jffs2_raw_dirent *jOld =
wdenk998eaae2004-04-18 19:43:36 +0000513 (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
wdenk7205e402003-09-10 22:30:53 +0000514 int cmp;
wdenk06d01db2003-03-14 20:47:52 +0000515
wdenk7205e402003-09-10 22:30:53 +0000516 /* ascending sort by pino */
517 if (jNew->pino != jOld->pino)
518 return jNew->pino > jOld->pino;
519
520 /* pino is the same, so use ascending sort by nsize, so
521 * we don't do strncmp unless we really must.
522 */
523 if (jNew->nsize != jOld->nsize)
524 return jNew->nsize > jOld->nsize;
525
526 /* length is also the same, so use ascending sort by name
527 */
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200528 cmp = strncmp((char *)jNew->name, (char *)jOld->name, jNew->nsize);
wdenk7205e402003-09-10 22:30:53 +0000529 if (cmp != 0)
530 return cmp > 0;
531
532 /* we have duplicate names in this directory, so use ascending
533 * sort by version
534 */
535 if (jNew->version > jOld->version) {
536 /* since jNew is newer, we know jOld is not valid, so
537 * mark it with inode 0 and it will not be used
538 */
539 jOld->ino = 0;
540 return 1;
541 }
wdenk42d1f032003-10-15 23:53:47 +0000542
wdenk7205e402003-09-10 22:30:53 +0000543 return 0;
wdenk06d01db2003-03-14 20:47:52 +0000544}
545#endif
wdenkfe8c2802002-11-03 00:38:21 +0000546
547static u32
548jffs2_scan_empty(u32 start_offset, struct part_info *part)
549{
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200550 char *max = (char *)(part->offset + part->size - sizeof(struct jffs2_raw_inode));
551 char *offset = (char *)(part->offset + start_offset);
wdenk998eaae2004-04-18 19:43:36 +0000552 u32 off;
wdenkfe8c2802002-11-03 00:38:21 +0000553
wdenk998eaae2004-04-18 19:43:36 +0000554 while (offset < max &&
555 *(u32*)get_fl_mem((u32)offset, sizeof(u32), &off) == 0xFFFFFFFF) {
wdenk06d01db2003-03-14 20:47:52 +0000556 offset += sizeof(u32);
557 /* return if spinning is due */
558 if (((u32)offset & ((1 << SPIN_BLKSIZE)-1)) == 0) break;
wdenkfe8c2802002-11-03 00:38:21 +0000559 }
wdenkfc1cfcd2004-04-25 15:41:35 +0000560
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200561 return (u32)offset - part->offset;
wdenkfe8c2802002-11-03 00:38:21 +0000562}
563
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200564void
565jffs2_free_cache(struct part_info *part)
wdenkfe8c2802002-11-03 00:38:21 +0000566{
wdenk06d01db2003-03-14 20:47:52 +0000567 struct b_lists *pL;
wdenkfe8c2802002-11-03 00:38:21 +0000568
wdenk06d01db2003-03-14 20:47:52 +0000569 if (part->jffs2_priv != NULL) {
570 pL = (struct b_lists *)part->jffs2_priv;
571 free_nodes(&pL->frag);
572 free_nodes(&pL->dir);
573 free(pL);
574 }
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200575}
576
577static u32
578jffs_init_1pass_list(struct part_info *part)
579{
580 struct b_lists *pL;
581
582 jffs2_free_cache(part);
583
wdenk06d01db2003-03-14 20:47:52 +0000584 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
585 pL = (struct b_lists *)part->jffs2_priv;
586
587 memset(pL, 0, sizeof(*pL));
588#ifdef CFG_JFFS2_SORT_FRAGMENTS
589 pL->dir.listCompare = compare_dirents;
590 pL->frag.listCompare = compare_inodes;
591#endif
wdenkfe8c2802002-11-03 00:38:21 +0000592 }
593 return 0;
594}
595
596/* find the inode from the slashless name given a parent */
597static long
598jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
599{
600 struct b_node *b;
601 struct jffs2_raw_inode *jNode;
wdenk06d01db2003-03-14 20:47:52 +0000602 u32 totalSize = 0;
wdenk7205e402003-09-10 22:30:53 +0000603 u32 latestVersion = 0;
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200604 uchar *lDest;
605 uchar *src;
wdenkfe8c2802002-11-03 00:38:21 +0000606 long ret;
607 int i;
608 u32 counter = 0;
wdenk7205e402003-09-10 22:30:53 +0000609#ifdef CFG_JFFS2_SORT_FRAGMENTS
610 /* Find file size before loading any data, so fragments that
611 * start past the end of file can be ignored. A fragment
612 * that is partially in the file is loaded, so extra data may
613 * be loaded up to the next 4K boundary above the file size.
614 * This shouldn't cause trouble when loading kernel images, so
615 * we will live with it.
616 */
617 for (b = pL->frag.listHead; b != NULL; b = b->next) {
wdenk507bbe32004-04-18 21:13:41 +0000618 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
wdenk998eaae2004-04-18 19:43:36 +0000619 sizeof(struct jffs2_raw_inode), NULL);
wdenk7205e402003-09-10 22:30:53 +0000620 if ((inode == jNode->ino)) {
621 /* get actual file length from the newest node */
622 if (jNode->version >= latestVersion) {
623 totalSize = jNode->isize;
624 latestVersion = jNode->version;
625 }
626 }
wdenk998eaae2004-04-18 19:43:36 +0000627 put_fl_mem(jNode);
wdenk7205e402003-09-10 22:30:53 +0000628 }
629#endif
wdenkfe8c2802002-11-03 00:38:21 +0000630
wdenk06d01db2003-03-14 20:47:52 +0000631 for (b = pL->frag.listHead; b != NULL; b = b->next) {
wdenk998eaae2004-04-18 19:43:36 +0000632 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset);
wdenkfe8c2802002-11-03 00:38:21 +0000633 if ((inode == jNode->ino)) {
wdenk06d01db2003-03-14 20:47:52 +0000634#if 0
wdenkfe8c2802002-11-03 00:38:21 +0000635 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
636 putLabeledWord("read_inode: inode = ", jNode->ino);
637 putLabeledWord("read_inode: version = ", jNode->version);
638 putLabeledWord("read_inode: isize = ", jNode->isize);
639 putLabeledWord("read_inode: offset = ", jNode->offset);
640 putLabeledWord("read_inode: csize = ", jNode->csize);
641 putLabeledWord("read_inode: dsize = ", jNode->dsize);
642 putLabeledWord("read_inode: compr = ", jNode->compr);
643 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
644 putLabeledWord("read_inode: flags = ", jNode->flags);
wdenkfe8c2802002-11-03 00:38:21 +0000645#endif
wdenk7205e402003-09-10 22:30:53 +0000646
647#ifndef CFG_JFFS2_SORT_FRAGMENTS
wdenk06d01db2003-03-14 20:47:52 +0000648 /* get actual file length from the newest node */
649 if (jNode->version >= latestVersion) {
wdenkfe8c2802002-11-03 00:38:21 +0000650 totalSize = jNode->isize;
wdenk06d01db2003-03-14 20:47:52 +0000651 latestVersion = jNode->version;
wdenkfe8c2802002-11-03 00:38:21 +0000652 }
wdenk7205e402003-09-10 22:30:53 +0000653#endif
wdenkfe8c2802002-11-03 00:38:21 +0000654
655 if(dest) {
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200656 src = ((uchar *) jNode) + sizeof(struct jffs2_raw_inode);
wdenk06d01db2003-03-14 20:47:52 +0000657 /* ignore data behind latest known EOF */
wdenk998eaae2004-04-18 19:43:36 +0000658 if (jNode->offset > totalSize) {
659 put_fl_mem(jNode);
wdenk06d01db2003-03-14 20:47:52 +0000660 continue;
wdenk998eaae2004-04-18 19:43:36 +0000661 }
wdenk06d01db2003-03-14 20:47:52 +0000662
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200663 lDest = (uchar *) (dest + jNode->offset);
wdenkfe8c2802002-11-03 00:38:21 +0000664#if 0
wdenk06d01db2003-03-14 20:47:52 +0000665 putLabeledWord("read_inode: src = ", src);
wdenkfe8c2802002-11-03 00:38:21 +0000666 putLabeledWord("read_inode: dest = ", lDest);
wdenkfe8c2802002-11-03 00:38:21 +0000667#endif
668 switch (jNode->compr) {
669 case JFFS2_COMPR_NONE:
wdenkfe8c2802002-11-03 00:38:21 +0000670 ret = (unsigned long) ldr_memcpy(lDest, src, jNode->dsize);
671 break;
672 case JFFS2_COMPR_ZERO:
673 ret = 0;
674 for (i = 0; i < jNode->dsize; i++)
675 *(lDest++) = 0;
676 break;
677 case JFFS2_COMPR_RTIME:
678 ret = 0;
679 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
680 break;
681 case JFFS2_COMPR_DYNRUBIN:
682 /* this is slow but it works */
683 ret = 0;
684 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
685 break;
686 case JFFS2_COMPR_ZLIB:
687 ret = zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
688 break;
wdenk412babe2005-05-05 09:51:44 +0000689#if defined(CONFIG_JFFS2_LZO_LZARI)
wdenk07cc0992005-05-05 00:04:14 +0000690 case JFFS2_COMPR_LZO:
691 ret = lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
692 break;
wdenk412babe2005-05-05 09:51:44 +0000693 case JFFS2_COMPR_LZARI:
694 ret = lzari_decompress(src, lDest, jNode->csize, jNode->dsize);
695 break;
wdenk07cc0992005-05-05 00:04:14 +0000696#endif
wdenkfe8c2802002-11-03 00:38:21 +0000697 default:
698 /* unknown */
699 putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode->compr);
wdenk998eaae2004-04-18 19:43:36 +0000700 put_fl_mem(jNode);
wdenkfe8c2802002-11-03 00:38:21 +0000701 return -1;
702 break;
703 }
704 }
705
wdenkfe8c2802002-11-03 00:38:21 +0000706#if 0
wdenkfe8c2802002-11-03 00:38:21 +0000707 putLabeledWord("read_inode: totalSize = ", totalSize);
708 putLabeledWord("read_inode: compr ret = ", ret);
709#endif
710 }
wdenkfe8c2802002-11-03 00:38:21 +0000711 counter++;
wdenk998eaae2004-04-18 19:43:36 +0000712 put_fl_mem(jNode);
wdenkfe8c2802002-11-03 00:38:21 +0000713 }
wdenkfe8c2802002-11-03 00:38:21 +0000714
715#if 0
wdenk06d01db2003-03-14 20:47:52 +0000716 putLabeledWord("read_inode: returning = ", totalSize);
wdenkfe8c2802002-11-03 00:38:21 +0000717#endif
wdenk06d01db2003-03-14 20:47:52 +0000718 return totalSize;
wdenkfe8c2802002-11-03 00:38:21 +0000719}
720
721/* find the inode from the slashless name given a parent */
722static u32
723jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
724{
725 struct b_node *b;
726 struct jffs2_raw_dirent *jDir;
727 int len;
728 u32 counter;
729 u32 version = 0;
730 u32 inode = 0;
731
732 /* name is assumed slash free */
733 len = strlen(name);
734
735 counter = 0;
736 /* we need to search all and return the inode with the highest version */
wdenk06d01db2003-03-14 20:47:52 +0000737 for(b = pL->dir.listHead; b; b = b->next, counter++) {
wdenk998eaae2004-04-18 19:43:36 +0000738 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
wdenk06d01db2003-03-14 20:47:52 +0000739 if ((pino == jDir->pino) && (len == jDir->nsize) &&
740 (jDir->ino) && /* 0 for unlink */
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200741 (!strncmp((char *)jDir->name, name, len))) { /* a match */
wdenk998eaae2004-04-18 19:43:36 +0000742 if (jDir->version < version) {
743 put_fl_mem(jDir);
wdenk7205e402003-09-10 22:30:53 +0000744 continue;
wdenk998eaae2004-04-18 19:43:36 +0000745 }
wdenkfe8c2802002-11-03 00:38:21 +0000746
wdenk7205e402003-09-10 22:30:53 +0000747 if (jDir->version == version && inode != 0) {
748 /* I'm pretty sure this isn't legal */
wdenkfe8c2802002-11-03 00:38:21 +0000749 putstr(" ** ERROR ** ");
750 putnstr(jDir->name, jDir->nsize);
751 putLabeledWord(" has dup version =", version);
752 }
753 inode = jDir->ino;
754 version = jDir->version;
755 }
756#if 0
757 putstr("\r\nfind_inode:p&l ->");
758 putnstr(jDir->name, jDir->nsize);
759 putstr("\r\n");
760 putLabeledWord("pino = ", jDir->pino);
761 putLabeledWord("nsize = ", jDir->nsize);
762 putLabeledWord("b = ", (u32) b);
763 putLabeledWord("counter = ", counter);
764#endif
wdenk998eaae2004-04-18 19:43:36 +0000765 put_fl_mem(jDir);
wdenkfe8c2802002-11-03 00:38:21 +0000766 }
767 return inode;
768}
769
wdenk180d3f72004-01-04 16:28:35 +0000770char *mkmodestr(unsigned long mode, char *str)
wdenkfe8c2802002-11-03 00:38:21 +0000771{
wdenk06d01db2003-03-14 20:47:52 +0000772 static const char *l = "xwr";
773 int mask = 1, i;
774 char c;
wdenkfe8c2802002-11-03 00:38:21 +0000775
wdenk06d01db2003-03-14 20:47:52 +0000776 switch (mode & S_IFMT) {
777 case S_IFDIR: str[0] = 'd'; break;
778 case S_IFBLK: str[0] = 'b'; break;
779 case S_IFCHR: str[0] = 'c'; break;
780 case S_IFIFO: str[0] = 'f'; break;
781 case S_IFLNK: str[0] = 'l'; break;
782 case S_IFSOCK: str[0] = 's'; break;
783 case S_IFREG: str[0] = '-'; break;
784 default: str[0] = '?';
785 }
wdenkfe8c2802002-11-03 00:38:21 +0000786
wdenk06d01db2003-03-14 20:47:52 +0000787 for(i = 0; i < 9; i++) {
788 c = l[i%3];
789 str[9-i] = (mode & mask)?c:'-';
790 mask = mask<<1;
791 }
wdenkfe8c2802002-11-03 00:38:21 +0000792
wdenk06d01db2003-03-14 20:47:52 +0000793 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
794 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
795 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
796 str[10] = '\0';
797 return str;
wdenkfe8c2802002-11-03 00:38:21 +0000798}
799
800static inline void dump_stat(struct stat *st, const char *name)
801{
wdenk06d01db2003-03-14 20:47:52 +0000802 char str[20];
803 char s[64], *p;
wdenkfe8c2802002-11-03 00:38:21 +0000804
wdenk06d01db2003-03-14 20:47:52 +0000805 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
806 st->st_mtime = 1;
wdenkfe8c2802002-11-03 00:38:21 +0000807
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200808 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
wdenkfe8c2802002-11-03 00:38:21 +0000809
wdenk06d01db2003-03-14 20:47:52 +0000810 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
811 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
wdenkfe8c2802002-11-03 00:38:21 +0000812
813/*
wdenk06d01db2003-03-14 20:47:52 +0000814 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
815 st->st_size, s, name);
wdenkfe8c2802002-11-03 00:38:21 +0000816*/
817
wdenk06d01db2003-03-14 20:47:52 +0000818 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
wdenkfe8c2802002-11-03 00:38:21 +0000819}
820
821static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
822{
823 char fname[256];
824 struct stat st;
825
826 if(!d || !i) return -1;
827
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200828 strncpy(fname, (char *)d->name, d->nsize);
wdenk06d01db2003-03-14 20:47:52 +0000829 fname[d->nsize] = '\0';
wdenkfe8c2802002-11-03 00:38:21 +0000830
831 memset(&st,0,sizeof(st));
832
wdenk06d01db2003-03-14 20:47:52 +0000833 st.st_mtime = i->mtime;
834 st.st_mode = i->mode;
835 st.st_ino = i->ino;
wdenkfe8c2802002-11-03 00:38:21 +0000836
837 /* neither dsize nor isize help us.. do it the long way */
wdenk06d01db2003-03-14 20:47:52 +0000838 st.st_size = jffs2_1pass_read_inode(pL, i->ino, NULL);
wdenkfe8c2802002-11-03 00:38:21 +0000839
840 dump_stat(&st, fname);
841
842 if (d->type == DT_LNK) {
843 unsigned char *src = (unsigned char *) (&i[1]);
844 putstr(" -> ");
845 putnstr(src, (int)i->dsize);
846 }
847
848 putstr("\r\n");
849
850 return 0;
851}
852
853/* list inodes with the given pino */
854static u32
855jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
856{
857 struct b_node *b;
858 struct jffs2_raw_dirent *jDir;
859
wdenk06d01db2003-03-14 20:47:52 +0000860 for (b = pL->dir.listHead; b; b = b->next) {
wdenk998eaae2004-04-18 19:43:36 +0000861 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
wdenk06d01db2003-03-14 20:47:52 +0000862 if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */
863 u32 i_version = 0;
wdenk998eaae2004-04-18 19:43:36 +0000864 struct jffs2_raw_inode ojNode;
wdenk06d01db2003-03-14 20:47:52 +0000865 struct jffs2_raw_inode *jNode, *i = NULL;
866 struct b_node *b2 = pL->frag.listHead;
wdenkfe8c2802002-11-03 00:38:21 +0000867
868 while (b2) {
wdenk998eaae2004-04-18 19:43:36 +0000869 jNode = (struct jffs2_raw_inode *)
870 get_fl_mem(b2->offset, sizeof(ojNode), &ojNode);
wdenk32877d62004-05-05 19:44:41 +0000871 if (jNode->ino == jDir->ino && jNode->version >= i_version) {
872 if (i)
wdenk02b11f82004-05-12 22:54:36 +0000873 put_fl_mem(i);
wdenkcf8bc572005-05-04 23:50:54 +0000874
875 if (jDir->type == DT_LNK)
876 i = get_node_mem(b2->offset);
877 else
878 i = get_fl_mem(b2->offset, sizeof(*i), NULL);
wdenk32877d62004-05-05 19:44:41 +0000879 }
wdenkfe8c2802002-11-03 00:38:21 +0000880 b2 = b2->next;
881 }
882
883 dump_inode(pL, jDir, i);
wdenk998eaae2004-04-18 19:43:36 +0000884 put_fl_mem(i);
wdenkfe8c2802002-11-03 00:38:21 +0000885 }
wdenk998eaae2004-04-18 19:43:36 +0000886 put_fl_mem(jDir);
wdenkfe8c2802002-11-03 00:38:21 +0000887 }
888 return pino;
889}
890
891static u32
892jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
893{
894 int i;
895 char tmp[256];
896 char working_tmp[256];
897 char *c;
898
899 /* discard any leading slash */
900 i = 0;
901 while (fname[i] == '/')
902 i++;
903 strcpy(tmp, &fname[i]);
904
905 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
906 {
907 strncpy(working_tmp, tmp, c - tmp);
908 working_tmp[c - tmp] = '\0';
909#if 0
910 putstr("search_inode: tmp = ");
911 putstr(tmp);
912 putstr("\r\n");
913 putstr("search_inode: wtmp = ");
914 putstr(working_tmp);
915 putstr("\r\n");
916 putstr("search_inode: c = ");
917 putstr(c);
918 putstr("\r\n");
919#endif
920 for (i = 0; i < strlen(c) - 1; i++)
921 tmp[i] = c[i + 1];
922 tmp[i] = '\0';
923#if 0
924 putstr("search_inode: post tmp = ");
925 putstr(tmp);
926 putstr("\r\n");
927#endif
928
929 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
930 putstr("find_inode failed for name=");
931 putstr(working_tmp);
932 putstr("\r\n");
933 return 0;
934 }
935 }
936 /* this is for the bare filename, directories have already been mapped */
937 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
938 putstr("find_inode failed for name=");
939 putstr(tmp);
940 putstr("\r\n");
941 return 0;
942 }
943 return pino;
944
945}
946
947static u32
948jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
949{
950 struct b_node *b;
951 struct b_node *b2;
952 struct jffs2_raw_dirent *jDir;
953 struct jffs2_raw_inode *jNode;
wdenk998eaae2004-04-18 19:43:36 +0000954 u8 jDirFoundType = 0;
955 u32 jDirFoundIno = 0;
956 u32 jDirFoundPino = 0;
wdenkfe8c2802002-11-03 00:38:21 +0000957 char tmp[256];
958 u32 version = 0;
959 u32 pino;
960 unsigned char *src;
961
962 /* we need to search all and return the inode with the highest version */
wdenk06d01db2003-03-14 20:47:52 +0000963 for(b = pL->dir.listHead; b; b = b->next) {
wdenk998eaae2004-04-18 19:43:36 +0000964 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
wdenkfe8c2802002-11-03 00:38:21 +0000965 if (ino == jDir->ino) {
wdenk998eaae2004-04-18 19:43:36 +0000966 if (jDir->version < version) {
967 put_fl_mem(jDir);
wdenk7205e402003-09-10 22:30:53 +0000968 continue;
wdenk998eaae2004-04-18 19:43:36 +0000969 }
wdenkfe8c2802002-11-03 00:38:21 +0000970
wdenk998eaae2004-04-18 19:43:36 +0000971 if (jDir->version == version && jDirFoundType) {
wdenk7205e402003-09-10 22:30:53 +0000972 /* I'm pretty sure this isn't legal */
wdenkfe8c2802002-11-03 00:38:21 +0000973 putstr(" ** ERROR ** ");
974 putnstr(jDir->name, jDir->nsize);
975 putLabeledWord(" has dup version (resolve) = ",
976 version);
977 }
978
wdenk998eaae2004-04-18 19:43:36 +0000979 jDirFoundType = jDir->type;
980 jDirFoundIno = jDir->ino;
981 jDirFoundPino = jDir->pino;
wdenkfe8c2802002-11-03 00:38:21 +0000982 version = jDir->version;
983 }
wdenk998eaae2004-04-18 19:43:36 +0000984 put_fl_mem(jDir);
wdenkfe8c2802002-11-03 00:38:21 +0000985 }
986 /* now we found the right entry again. (shoulda returned inode*) */
wdenk998eaae2004-04-18 19:43:36 +0000987 if (jDirFoundType != DT_LNK)
988 return jDirFoundIno;
wdenk06d01db2003-03-14 20:47:52 +0000989
990 /* it's a soft link so we follow it again. */
991 b2 = pL->frag.listHead;
wdenkfe8c2802002-11-03 00:38:21 +0000992 while (b2) {
wdenk998eaae2004-04-18 19:43:36 +0000993 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset);
994 if (jNode->ino == jDirFoundIno) {
wdenk2729af92004-05-03 20:45:30 +0000995 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
wdenkfe8c2802002-11-03 00:38:21 +0000996
997#if 0
998 putLabeledWord("\t\t dsize = ", jNode->dsize);
999 putstr("\t\t target = ");
1000 putnstr(src, jNode->dsize);
1001 putstr("\r\n");
1002#endif
Wolfgang Denk77ddac92005-10-13 16:45:02 +02001003 strncpy(tmp, (char *)src, jNode->dsize);
wdenkfe8c2802002-11-03 00:38:21 +00001004 tmp[jNode->dsize] = '\0';
wdenk998eaae2004-04-18 19:43:36 +00001005 put_fl_mem(jNode);
wdenkfe8c2802002-11-03 00:38:21 +00001006 break;
1007 }
1008 b2 = b2->next;
wdenk998eaae2004-04-18 19:43:36 +00001009 put_fl_mem(jNode);
wdenkfe8c2802002-11-03 00:38:21 +00001010 }
1011 /* ok so the name of the new file to find is in tmp */
1012 /* if it starts with a slash it is root based else shared dirs */
1013 if (tmp[0] == '/')
1014 pino = 1;
1015 else
wdenk998eaae2004-04-18 19:43:36 +00001016 pino = jDirFoundPino;
wdenkfe8c2802002-11-03 00:38:21 +00001017
1018 return jffs2_1pass_search_inode(pL, tmp, pino);
1019}
1020
1021static u32
1022jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1023{
1024 int i;
1025 char tmp[256];
1026 char working_tmp[256];
1027 char *c;
1028
1029 /* discard any leading slash */
1030 i = 0;
1031 while (fname[i] == '/')
1032 i++;
1033 strcpy(tmp, &fname[i]);
1034 working_tmp[0] = '\0';
1035 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1036 {
1037 strncpy(working_tmp, tmp, c - tmp);
1038 working_tmp[c - tmp] = '\0';
1039 for (i = 0; i < strlen(c) - 1; i++)
1040 tmp[i] = c[i + 1];
1041 tmp[i] = '\0';
1042 /* only a failure if we arent looking at top level */
wdenk06d01db2003-03-14 20:47:52 +00001043 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1044 (working_tmp[0])) {
wdenkfe8c2802002-11-03 00:38:21 +00001045 putstr("find_inode failed for name=");
1046 putstr(working_tmp);
1047 putstr("\r\n");
1048 return 0;
1049 }
1050 }
1051
1052 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1053 putstr("find_inode failed for name=");
1054 putstr(tmp);
1055 putstr("\r\n");
1056 return 0;
1057 }
1058 /* this is for the bare filename, directories have already been mapped */
1059 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1060 putstr("find_inode failed for name=");
1061 putstr(tmp);
1062 putstr("\r\n");
1063 return 0;
1064 }
1065 return pino;
1066
1067}
1068
1069unsigned char
1070jffs2_1pass_rescan_needed(struct part_info *part)
1071{
1072 struct b_node *b;
wdenk998eaae2004-04-18 19:43:36 +00001073 struct jffs2_unknown_node onode;
wdenkfe8c2802002-11-03 00:38:21 +00001074 struct jffs2_unknown_node *node;
wdenk06d01db2003-03-14 20:47:52 +00001075 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
wdenkfe8c2802002-11-03 00:38:21 +00001076
1077 if (part->jffs2_priv == 0){
1078 DEBUGF ("rescan: First time in use\n");
1079 return 1;
1080 }
Wolfgang Denk700a0c62005-08-08 01:03:24 +02001081
wdenkfe8c2802002-11-03 00:38:21 +00001082 /* if we have no list, we need to rescan */
wdenk06d01db2003-03-14 20:47:52 +00001083 if (pL->frag.listCount == 0) {
wdenkfe8c2802002-11-03 00:38:21 +00001084 DEBUGF ("rescan: fraglist zero\n");
1085 return 1;
1086 }
1087
wdenk06d01db2003-03-14 20:47:52 +00001088 /* but suppose someone reflashed a partition at the same offset... */
1089 b = pL->dir.listHead;
wdenkfe8c2802002-11-03 00:38:21 +00001090 while (b) {
wdenk998eaae2004-04-18 19:43:36 +00001091 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1092 sizeof(onode), &onode);
wdenkfe8c2802002-11-03 00:38:21 +00001093 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
wdenk06d01db2003-03-14 20:47:52 +00001094 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1095 (unsigned long) b->offset);
wdenkfe8c2802002-11-03 00:38:21 +00001096 return 1;
1097 }
1098 b = b->next;
1099 }
1100 return 0;
1101}
1102
wdenk06d01db2003-03-14 20:47:52 +00001103#ifdef DEBUG_FRAGMENTS
1104static void
1105dump_fragments(struct b_lists *pL)
1106{
1107 struct b_node *b;
wdenk998eaae2004-04-18 19:43:36 +00001108 struct jffs2_raw_inode ojNode;
wdenk06d01db2003-03-14 20:47:52 +00001109 struct jffs2_raw_inode *jNode;
1110
1111 putstr("\r\n\r\n******The fragment Entries******\r\n");
1112 b = pL->frag.listHead;
1113 while (b) {
wdenk998eaae2004-04-18 19:43:36 +00001114 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1115 sizeof(ojNode), &ojNode);
wdenk06d01db2003-03-14 20:47:52 +00001116 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1117 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1118 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1119 putLabeledWord("\tbuild_list: version = ", jNode->version);
1120 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1121 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1122 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1123 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1124 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1125 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1126 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1127 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
wdenk8bde7f72003-06-27 21:31:46 +00001128 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
wdenk06d01db2003-03-14 20:47:52 +00001129 b = b->next;
1130 }
1131}
1132#endif
1133
1134#ifdef DEBUG_DIRENTS
1135static void
1136dump_dirents(struct b_lists *pL)
1137{
1138 struct b_node *b;
1139 struct jffs2_raw_dirent *jDir;
1140
1141 putstr("\r\n\r\n******The directory Entries******\r\n");
1142 b = pL->dir.listHead;
1143 while (b) {
wdenk998eaae2004-04-18 19:43:36 +00001144 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
wdenk06d01db2003-03-14 20:47:52 +00001145 putstr("\r\n");
1146 putnstr(jDir->name, jDir->nsize);
1147 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1148 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1149 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1150 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1151 putLabeledWord("\tbuild_list: version = ", jDir->version);
1152 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1153 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1154 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1155 putLabeledWord("\tbuild_list: type = ", jDir->type);
1156 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1157 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
wdenk8bde7f72003-06-27 21:31:46 +00001158 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
wdenk06d01db2003-03-14 20:47:52 +00001159 b = b->next;
wdenk998eaae2004-04-18 19:43:36 +00001160 put_fl_mem(jDir);
wdenk06d01db2003-03-14 20:47:52 +00001161 }
1162}
1163#endif
1164
wdenkfe8c2802002-11-03 00:38:21 +00001165static u32
1166jffs2_1pass_build_lists(struct part_info * part)
1167{
1168 struct b_lists *pL;
1169 struct jffs2_unknown_node *node;
wdenk06d01db2003-03-14 20:47:52 +00001170 u32 offset, oldoffset = 0;
wdenkfe8c2802002-11-03 00:38:21 +00001171 u32 max = part->size - sizeof(struct jffs2_raw_inode);
1172 u32 counter = 0;
1173 u32 counter4 = 0;
1174 u32 counterF = 0;
1175 u32 counterN = 0;
1176
1177 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1178 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1179 /* only about 5 %. not enough to inconvenience people for. */
1180 /* lcd_off(); */
1181
1182 /* if we are building a list we need to refresh the cache. */
wdenkfe8c2802002-11-03 00:38:21 +00001183 jffs_init_1pass_list(part);
wdenk06d01db2003-03-14 20:47:52 +00001184 pL = (struct b_lists *)part->jffs2_priv;
wdenkfe8c2802002-11-03 00:38:21 +00001185 offset = 0;
wdenk4b9206e2004-03-23 22:14:11 +00001186 puts ("Scanning JFFS2 FS: ");
wdenkfe8c2802002-11-03 00:38:21 +00001187
1188 /* start at the beginning of the partition */
1189 while (offset < max) {
wdenk06d01db2003-03-14 20:47:52 +00001190 if ((oldoffset >> SPIN_BLKSIZE) != (offset >> SPIN_BLKSIZE)) {
1191 printf("\b\b%c ", spinner[counter++ % sizeof(spinner)]);
1192 oldoffset = offset;
1193 }
wdenk0b8fa032004-04-25 14:37:29 +00001194
wdenkfc1cfcd2004-04-25 15:41:35 +00001195 node = (struct jffs2_unknown_node *) get_node_mem((u32)part->offset + offset);
1196 if (node->magic == JFFS2_MAGIC_BITMASK && hdr_crc(node)) {
1197 /* if its a fragment add it */
1198 if (node->nodetype == JFFS2_NODETYPE_INODE &&
Wolfgang Denk74f92e62006-03-12 16:05:05 +01001199 inode_crc((struct jffs2_raw_inode *) node) &&
1200 data_crc((struct jffs2_raw_inode *) node)) {
wdenk06d01db2003-03-14 20:47:52 +00001201 if (insert_node(&pL->frag, (u32) part->offset +
wdenk998eaae2004-04-18 19:43:36 +00001202 offset) == NULL) {
1203 put_fl_mem(node);
wdenkfe8c2802002-11-03 00:38:21 +00001204 return 0;
wdenk998eaae2004-04-18 19:43:36 +00001205 }
wdenkfe8c2802002-11-03 00:38:21 +00001206 } else if (node->nodetype == JFFS2_NODETYPE_DIRENT &&
1207 dirent_crc((struct jffs2_raw_dirent *) node) &&
1208 dirent_name_crc((struct jffs2_raw_dirent *) node)) {
wdenkfc1cfcd2004-04-25 15:41:35 +00001209 if (! (counterN%100))
wdenk4b9206e2004-03-23 22:14:11 +00001210 puts ("\b\b. ");
wdenk06d01db2003-03-14 20:47:52 +00001211 if (insert_node(&pL->dir, (u32) part->offset +
wdenk998eaae2004-04-18 19:43:36 +00001212 offset) == NULL) {
1213 put_fl_mem(node);
wdenkfe8c2802002-11-03 00:38:21 +00001214 return 0;
wdenk998eaae2004-04-18 19:43:36 +00001215 }
wdenkfe8c2802002-11-03 00:38:21 +00001216 counterN++;
1217 } else if (node->nodetype == JFFS2_NODETYPE_CLEANMARKER) {
1218 if (node->totlen != sizeof(struct jffs2_unknown_node))
wdenk06d01db2003-03-14 20:47:52 +00001219 printf("OOPS Cleanmarker has bad size "
1220 "%d != %d\n", node->totlen,
1221 sizeof(struct jffs2_unknown_node));
wdenk7205e402003-09-10 22:30:53 +00001222 } else if (node->nodetype == JFFS2_NODETYPE_PADDING) {
1223 if (node->totlen < sizeof(struct jffs2_unknown_node))
1224 printf("OOPS Padding has bad size "
1225 "%d < %d\n", node->totlen,
1226 sizeof(struct jffs2_unknown_node));
wdenkfe8c2802002-11-03 00:38:21 +00001227 } else {
wdenkfc1cfcd2004-04-25 15:41:35 +00001228 printf("Unknown node type: %x len %d "
1229 "offset 0x%x\n", node->nodetype,
1230 node->totlen, offset);
wdenkfe8c2802002-11-03 00:38:21 +00001231 }
1232 offset += ((node->totlen + 3) & ~3);
1233 counterF++;
wdenk06d01db2003-03-14 20:47:52 +00001234 } else if (node->magic == JFFS2_EMPTY_BITMASK &&
1235 node->nodetype == JFFS2_EMPTY_BITMASK) {
wdenkfe8c2802002-11-03 00:38:21 +00001236 offset = jffs2_scan_empty(offset, part);
wdenkfc1cfcd2004-04-25 15:41:35 +00001237 } else { /* if we know nothing, we just step and look. */
wdenkfe8c2802002-11-03 00:38:21 +00001238 offset += 4;
1239 counter4++;
1240 }
1241/* printf("unknown node magic %4.4x %4.4x @ %lx\n", node->magic, node->nodetype, (unsigned long)node); */
wdenk998eaae2004-04-18 19:43:36 +00001242 put_fl_mem(node);
wdenkfe8c2802002-11-03 00:38:21 +00001243 }
1244
1245 putstr("\b\b done.\r\n"); /* close off the dots */
1246 /* turn the lcd back on. */
1247 /* splash(); */
1248
1249#if 0
wdenk06d01db2003-03-14 20:47:52 +00001250 putLabeledWord("dir entries = ", pL->dir.listCount);
1251 putLabeledWord("frag entries = ", pL->frag.listCount);
wdenkfe8c2802002-11-03 00:38:21 +00001252 putLabeledWord("+4 increments = ", counter4);
1253 putLabeledWord("+file_offset increments = ", counterF);
1254
1255#endif
1256
wdenk06d01db2003-03-14 20:47:52 +00001257#ifdef DEBUG_DIRENTS
1258 dump_dirents(pL);
1259#endif
wdenkfe8c2802002-11-03 00:38:21 +00001260
wdenk06d01db2003-03-14 20:47:52 +00001261#ifdef DEBUG_FRAGMENTS
1262 dump_fragments(pL);
1263#endif
wdenkfe8c2802002-11-03 00:38:21 +00001264
wdenkfe8c2802002-11-03 00:38:21 +00001265 /* give visual feedback that we are done scanning the flash */
1266 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1267 return 1;
1268}
1269
1270
wdenkfe8c2802002-11-03 00:38:21 +00001271static u32
1272jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1273{
1274 struct b_node *b;
wdenk998eaae2004-04-18 19:43:36 +00001275 struct jffs2_raw_inode ojNode;
wdenkfe8c2802002-11-03 00:38:21 +00001276 struct jffs2_raw_inode *jNode;
1277 int i;
1278
wdenkfe8c2802002-11-03 00:38:21 +00001279 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1280 piL->compr_info[i].num_frags = 0;
1281 piL->compr_info[i].compr_sum = 0;
1282 piL->compr_info[i].decompr_sum = 0;
1283 }
1284
wdenk06d01db2003-03-14 20:47:52 +00001285 b = pL->frag.listHead;
wdenkfe8c2802002-11-03 00:38:21 +00001286 while (b) {
wdenk998eaae2004-04-18 19:43:36 +00001287 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1288 sizeof(ojNode), &ojNode);
wdenkfe8c2802002-11-03 00:38:21 +00001289 if (jNode->compr < JFFS2_NUM_COMPR) {
1290 piL->compr_info[jNode->compr].num_frags++;
1291 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1292 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1293 }
1294 b = b->next;
1295 }
1296 return 0;
1297}
1298
1299
wdenkfe8c2802002-11-03 00:38:21 +00001300static struct b_lists *
1301jffs2_get_list(struct part_info * part, const char *who)
1302{
Wolfgang Denk700a0c62005-08-08 01:03:24 +02001303 /* copy requested part_info struct pointer to global location */
1304 current_part = part;
1305
wdenkfe8c2802002-11-03 00:38:21 +00001306 if (jffs2_1pass_rescan_needed(part)) {
1307 if (!jffs2_1pass_build_lists(part)) {
1308 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1309 return NULL;
1310 }
1311 }
1312 return (struct b_lists *)part->jffs2_priv;
1313}
1314
1315
1316/* Print directory / file contents */
1317u32
1318jffs2_1pass_ls(struct part_info * part, const char *fname)
1319{
1320 struct b_lists *pl;
Wolfgang Denk87b8bd52005-08-16 09:32:45 +02001321 long ret = 1;
wdenkfe8c2802002-11-03 00:38:21 +00001322 u32 inode;
1323
wdenk06d01db2003-03-14 20:47:52 +00001324 if (! (pl = jffs2_get_list(part, "ls")))
wdenkfe8c2802002-11-03 00:38:21 +00001325 return 0;
1326
1327 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1328 putstr("ls: Failed to scan jffs2 file structure\r\n");
1329 return 0;
1330 }
wdenkfc1cfcd2004-04-25 15:41:35 +00001331
1332
wdenkfe8c2802002-11-03 00:38:21 +00001333#if 0
1334 putLabeledWord("found file at inode = ", inode);
1335 putLabeledWord("read_inode returns = ", ret);
1336#endif
wdenkfc1cfcd2004-04-25 15:41:35 +00001337
1338 return ret;
wdenkfe8c2802002-11-03 00:38:21 +00001339}
1340
1341
wdenkfe8c2802002-11-03 00:38:21 +00001342/* Load a file from flash into memory. fname can be a full path */
1343u32
1344jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1345{
1346
1347 struct b_lists *pl;
Wolfgang Denk87b8bd52005-08-16 09:32:45 +02001348 long ret = 1;
wdenkfe8c2802002-11-03 00:38:21 +00001349 u32 inode;
1350
1351 if (! (pl = jffs2_get_list(part, "load")))
1352 return 0;
1353
1354 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1355 putstr("load: Failed to find inode\r\n");
1356 return 0;
1357 }
1358
1359 /* Resolve symlinks */
1360 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1361 putstr("load: Failed to resolve inode structure\r\n");
1362 return 0;
1363 }
1364
1365 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1366 putstr("load: Failed to read inode\r\n");
1367 return 0;
1368 }
1369
1370 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1371 (unsigned long) dest, ret);
1372 return ret;
1373}
1374
1375/* Return information about the fs on this partition */
1376u32
1377jffs2_1pass_info(struct part_info * part)
1378{
1379 struct b_jffs2_info info;
1380 struct b_lists *pl;
1381 int i;
1382
1383 if (! (pl = jffs2_get_list(part, "info")))
1384 return 0;
1385
1386 jffs2_1pass_fill_info(pl, &info);
wdenk06d01db2003-03-14 20:47:52 +00001387 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
wdenk4b9206e2004-03-23 22:14:11 +00001388 printf ("Compression: %s\n"
1389 "\tfrag count: %d\n"
1390 "\tcompressed sum: %d\n"
1391 "\tuncompressed sum: %d\n",
1392 compr_names[i],
1393 info.compr_info[i].num_frags,
1394 info.compr_info[i].compr_sum,
1395 info.compr_info[i].decompr_sum);
wdenkfe8c2802002-11-03 00:38:21 +00001396 }
1397 return 1;
1398}
1399
1400#endif /* CFG_CMD_JFFS2 */