2 -------------------------------------------------------------------------
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 *-----------------------------------------------------------------------*/
10 * some portions of this code are taken from jffs2, and as such, the
11 * following copyright notice is included.
13 * JFFS2 -- Journalling Flash File System, Version 2.
15 * Copyright (C) 2001 Red Hat, Inc.
17 * Created by David Woodhouse <dwmw2@cambridge.redhat.com>
19 * The original JFFS, from which the design for JFFS2 was derived,
20 * was designed and implemented by Axis Communications AB.
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/
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.
32 * The Original Code is JFFS2 - Journalling Flash File System, version 2
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.
45 * $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $
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
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
67 * Adapted by Nye Liu <nyet@zumanetworks.com> and
68 * Rex Feany <rfeany@zumanetworks.com>
69 * on Jan/2002 for U-Boot.
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 ;).
79 * Bugfixing by Kai-Uwe Bloem <kai-uwe.bloem@auerswald.de>, (C) Mar/2003
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.
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
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.
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.
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.
104 * There's a big issue left: endianess is completely ignored in this code. Duh!
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
109 * might be incompatible with any new code from the jffs2 maintainers anyway,
110 * it should probably be dumped and replaced by something like jffs2reader!
117 #include <linux/stat.h>
118 #include <linux/time.h>
120 #if defined(CONFIG_CMD_JFFS2)
122 #include <jffs2/jffs2.h>
123 #include <jffs2/jffs2_1pass.h>
125 #include "jffs2_private.h"
128 #define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */
129 #define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */
131 /* 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 */
138 # define DEBUGF(fmt,args...) printf(fmt ,##args)
140 # define DEBUGF(fmt,args...)
143 /* keeps pointer to currentlu processed partition */
144 static struct part_info
*current_part
;
146 #if (defined(CONFIG_JFFS2_NAND) && \
147 defined(CONFIG_CMD_NAND) )
148 #if defined(CFG_NAND_LEGACY)
149 #include <linux/mtd/nand_legacy.h>
154 * Support for jffs2 on top of NAND-flash
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
163 #if defined(CFG_NAND_LEGACY)
164 /* this one defined in nand_legacy.c */
165 int read_jffs2_nand(size_t start
, size_t len
,
166 size_t * retlen
, u_char
* buf
, int nanddev
);
169 #define NAND_PAGE_SIZE 512
170 #define NAND_PAGE_SHIFT 9
171 #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
173 #ifndef NAND_CACHE_PAGES
174 #define NAND_CACHE_PAGES 16
176 #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
178 static u8
* nand_cache
= NULL
;
179 static u32 nand_cache_off
= (u32
)-1;
181 static int read_nand_cached(u32 off
, u32 size
, u_char
*buf
)
183 struct mtdids
*id
= current_part
->dev
->id
;
188 while (bytes_read
< size
) {
189 if ((off
+ bytes_read
< nand_cache_off
) ||
190 (off
+ bytes_read
>= nand_cache_off
+NAND_CACHE_SIZE
)) {
191 nand_cache_off
= (off
+ bytes_read
) & NAND_PAGE_MASK
;
193 /* This memory never gets freed but 'cause
194 it's a bootloader, nobody cares */
195 nand_cache
= malloc(NAND_CACHE_SIZE
);
197 printf("read_nand_cached: can't alloc cache size %d bytes\n",
203 #if defined(CFG_NAND_LEGACY)
204 if (read_jffs2_nand(nand_cache_off
, NAND_CACHE_SIZE
,
205 &retlen
, nand_cache
, id
->num
) < 0 ||
206 retlen
!= NAND_CACHE_SIZE
) {
207 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
208 nand_cache_off
, NAND_CACHE_SIZE
);
212 retlen
= NAND_CACHE_SIZE
;
213 if (nand_read(&nand_info
[id
->num
], nand_cache_off
,
214 &retlen
, nand_cache
) != 0 ||
215 retlen
!= NAND_CACHE_SIZE
) {
216 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
217 nand_cache_off
, NAND_CACHE_SIZE
);
222 cpy_bytes
= nand_cache_off
+ NAND_CACHE_SIZE
- (off
+ bytes_read
);
223 if (cpy_bytes
> size
- bytes_read
)
224 cpy_bytes
= size
- bytes_read
;
225 memcpy(buf
+ bytes_read
,
226 nand_cache
+ off
+ bytes_read
- nand_cache_off
,
228 bytes_read
+= cpy_bytes
;
233 static void *get_fl_mem_nand(u32 off
, u32 size
, void *ext_buf
)
235 u_char
*buf
= ext_buf
? (u_char
*)ext_buf
: (u_char
*)malloc(size
);
238 printf("get_fl_mem_nand: can't alloc %d bytes\n", size
);
241 if (read_nand_cached(off
, size
, buf
) < 0) {
250 static void *get_node_mem_nand(u32 off
)
252 struct jffs2_unknown_node node
;
255 if (NULL
== get_fl_mem_nand(off
, sizeof(node
), &node
))
258 if (!(ret
= get_fl_mem_nand(off
, node
.magic
==
259 JFFS2_MAGIC_BITMASK
? node
.totlen
: sizeof(node
),
261 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
262 off
, node
.magic
, node
.nodetype
, node
.totlen
);
267 static void put_fl_mem_nand(void *buf
)
274 #if defined(CONFIG_CMD_FLASH)
276 * Support for jffs2 on top of NOR-flash
278 * NOR flash memory is mapped in processor's address space,
279 * just return address.
281 static inline void *get_fl_mem_nor(u32 off
)
284 struct mtdids
*id
= current_part
->dev
->id
;
286 extern flash_info_t flash_info
[];
287 flash_info_t
*flash
= &flash_info
[id
->num
];
289 addr
+= flash
->start
[0];
293 static inline void *get_node_mem_nor(u32 off
)
295 return (void*)get_fl_mem_nor(off
);
301 * Generic jffs2 raw memory and node read routines.
304 static inline void *get_fl_mem(u32 off
, u32 size
, void *ext_buf
)
306 struct mtdids
*id
= current_part
->dev
->id
;
308 #if defined(CONFIG_CMD_FLASH)
309 if (id
->type
== MTD_DEV_TYPE_NOR
)
310 return get_fl_mem_nor(off
);
313 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
314 if (id
->type
== MTD_DEV_TYPE_NAND
)
315 return get_fl_mem_nand(off
, size
, ext_buf
);
318 printf("get_fl_mem: unknown device type, using raw offset!\n");
322 static inline void *get_node_mem(u32 off
)
324 struct mtdids
*id
= current_part
->dev
->id
;
326 #if defined(CONFIG_CMD_FLASH)
327 if (id
->type
== MTD_DEV_TYPE_NOR
)
328 return get_node_mem_nor(off
);
331 #if defined(CONFIG_JFFS2_NAND) && \
332 defined(CONFIG_CMD_NAND)
333 if (id
->type
== MTD_DEV_TYPE_NAND
)
334 return get_node_mem_nand(off
);
337 printf("get_node_mem: unknown device type, using raw offset!\n");
341 static inline void put_fl_mem(void *buf
)
343 #if defined(CONFIG_JFFS2_NAND) && \
344 defined(CONFIG_CMD_NAND)
345 struct mtdids
*id
= current_part
->dev
->id
;
347 if (id
->type
== MTD_DEV_TYPE_NAND
)
348 return put_fl_mem_nand(buf
);
352 /* Compression names */
353 static char *compr_names
[] = {
361 #if defined(CONFIG_JFFS2_LZO_LZARI)
368 static char spinner
[] = { '|', '/', '-', '\\' };
370 /* Memory management */
373 struct mem_block
*next
;
374 struct b_node nodes
[NODE_CHUNK
];
379 free_nodes(struct b_list
*list
)
381 while (list
->listMemBase
!= NULL
) {
382 struct mem_block
*next
= list
->listMemBase
->next
;
383 free( list
->listMemBase
);
384 list
->listMemBase
= next
;
388 static struct b_node
*
389 add_node(struct b_list
*list
)
392 struct mem_block
*memBase
;
395 memBase
= list
->listMemBase
;
397 index
= memBase
->index
;
399 putLabeledWord("add_node: index = ", index
);
400 putLabeledWord("add_node: memBase = ", list
->listMemBase
);
403 if (memBase
== NULL
|| index
>= NODE_CHUNK
) {
404 /* we need more space before we continue */
405 memBase
= mmalloc(sizeof(struct mem_block
));
406 if (memBase
== NULL
) {
407 putstr("add_node: malloc failed\n");
410 memBase
->next
= list
->listMemBase
;
413 putLabeledWord("add_node: alloced a new membase at ", *memBase
);
417 /* now we have room to add it. */
418 b
= &memBase
->nodes
[index
];
421 memBase
->index
= index
;
422 list
->listMemBase
= memBase
;
427 static struct b_node
*
428 insert_node(struct b_list
*list
, u32 offset
)
431 #ifdef CFG_JFFS2_SORT_FRAGMENTS
432 struct b_node
*b
, *prev
;
435 if (!(new = add_node(list
))) {
436 putstr("add_node failed!\r\n");
439 new->offset
= offset
;
441 #ifdef CFG_JFFS2_SORT_FRAGMENTS
442 if (list
->listTail
!= NULL
&& list
->listCompare(new, list
->listTail
))
443 prev
= list
->listTail
;
444 else if (list
->listLast
!= NULL
&& list
->listCompare(new, list
->listLast
))
445 prev
= list
->listLast
;
449 for (b
= (prev
? prev
->next
: list
->listHead
);
450 b
!= NULL
&& list
->listCompare(new, b
);
451 prev
= b
, b
= b
->next
) {
455 list
->listLast
= prev
;
462 list
->listHead
= new;
466 new->next
= (struct b_node
*) NULL
;
467 if (list
->listTail
!= NULL
) {
468 list
->listTail
->next
= new;
469 list
->listTail
= new;
471 list
->listTail
= list
->listHead
= new;
478 #ifdef CFG_JFFS2_SORT_FRAGMENTS
479 /* Sort data entries with the latest version last, so that if there
480 * is overlapping data the latest version will be used.
482 static int compare_inodes(struct b_node
*new, struct b_node
*old
)
484 struct jffs2_raw_inode ojNew
;
485 struct jffs2_raw_inode ojOld
;
486 struct jffs2_raw_inode
*jNew
=
487 (struct jffs2_raw_inode
*)get_fl_mem(new->offset
, sizeof(ojNew
), &ojNew
);
488 struct jffs2_raw_inode
*jOld
=
489 (struct jffs2_raw_inode
*)get_fl_mem(old
->offset
, sizeof(ojOld
), &ojOld
);
491 return jNew
->version
> jOld
->version
;
494 /* Sort directory entries so all entries in the same directory
495 * with the same name are grouped together, with the latest version
496 * last. This makes it easy to eliminate all but the latest version
497 * by marking the previous version dead by setting the inode to 0.
499 static int compare_dirents(struct b_node
*new, struct b_node
*old
)
501 struct jffs2_raw_dirent ojNew
;
502 struct jffs2_raw_dirent ojOld
;
503 struct jffs2_raw_dirent
*jNew
=
504 (struct jffs2_raw_dirent
*)get_fl_mem(new->offset
, sizeof(ojNew
), &ojNew
);
505 struct jffs2_raw_dirent
*jOld
=
506 (struct jffs2_raw_dirent
*)get_fl_mem(old
->offset
, sizeof(ojOld
), &ojOld
);
509 /* ascending sort by pino */
510 if (jNew
->pino
!= jOld
->pino
)
511 return jNew
->pino
> jOld
->pino
;
513 /* pino is the same, so use ascending sort by nsize, so
514 * we don't do strncmp unless we really must.
516 if (jNew
->nsize
!= jOld
->nsize
)
517 return jNew
->nsize
> jOld
->nsize
;
519 /* length is also the same, so use ascending sort by name
521 cmp
= strncmp((char *)jNew
->name
, (char *)jOld
->name
, jNew
->nsize
);
525 /* we have duplicate names in this directory, so use ascending
528 if (jNew
->version
> jOld
->version
) {
529 /* since jNew is newer, we know jOld is not valid, so
530 * mark it with inode 0 and it will not be used
541 jffs2_scan_empty(u32 start_offset
, struct part_info
*part
)
543 char *max
= (char *)(part
->offset
+ part
->size
- sizeof(struct jffs2_raw_inode
));
544 char *offset
= (char *)(part
->offset
+ start_offset
);
547 while (offset
< max
&&
548 *(u32
*)get_fl_mem((u32
)offset
, sizeof(u32
), &off
) == 0xFFFFFFFF) {
549 offset
+= sizeof(u32
);
550 /* return if spinning is due */
551 if (((u32
)offset
& ((1 << SPIN_BLKSIZE
)-1)) == 0) break;
554 return (u32
)offset
- part
->offset
;
558 jffs2_free_cache(struct part_info
*part
)
562 if (part
->jffs2_priv
!= NULL
) {
563 pL
= (struct b_lists
*)part
->jffs2_priv
;
564 free_nodes(&pL
->frag
);
565 free_nodes(&pL
->dir
);
571 jffs_init_1pass_list(struct part_info
*part
)
575 jffs2_free_cache(part
);
577 if (NULL
!= (part
->jffs2_priv
= malloc(sizeof(struct b_lists
)))) {
578 pL
= (struct b_lists
*)part
->jffs2_priv
;
580 memset(pL
, 0, sizeof(*pL
));
581 #ifdef CFG_JFFS2_SORT_FRAGMENTS
582 pL
->dir
.listCompare
= compare_dirents
;
583 pL
->frag
.listCompare
= compare_inodes
;
589 /* find the inode from the slashless name given a parent */
591 jffs2_1pass_read_inode(struct b_lists
*pL
, u32 inode
, char *dest
)
594 struct jffs2_raw_inode
*jNode
;
596 u32 latestVersion
= 0;
602 #ifdef CFG_JFFS2_SORT_FRAGMENTS
603 /* Find file size before loading any data, so fragments that
604 * start past the end of file can be ignored. A fragment
605 * that is partially in the file is loaded, so extra data may
606 * be loaded up to the next 4K boundary above the file size.
607 * This shouldn't cause trouble when loading kernel images, so
608 * we will live with it.
610 for (b
= pL
->frag
.listHead
; b
!= NULL
; b
= b
->next
) {
611 jNode
= (struct jffs2_raw_inode
*) get_fl_mem(b
->offset
,
612 sizeof(struct jffs2_raw_inode
), NULL
);
613 if ((inode
== jNode
->ino
)) {
614 /* get actual file length from the newest node */
615 if (jNode
->version
>= latestVersion
) {
616 totalSize
= jNode
->isize
;
617 latestVersion
= jNode
->version
;
624 for (b
= pL
->frag
.listHead
; b
!= NULL
; b
= b
->next
) {
625 jNode
= (struct jffs2_raw_inode
*) get_node_mem(b
->offset
);
626 if ((inode
== jNode
->ino
)) {
628 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode
->totlen
);
629 putLabeledWord("read_inode: inode = ", jNode
->ino
);
630 putLabeledWord("read_inode: version = ", jNode
->version
);
631 putLabeledWord("read_inode: isize = ", jNode
->isize
);
632 putLabeledWord("read_inode: offset = ", jNode
->offset
);
633 putLabeledWord("read_inode: csize = ", jNode
->csize
);
634 putLabeledWord("read_inode: dsize = ", jNode
->dsize
);
635 putLabeledWord("read_inode: compr = ", jNode
->compr
);
636 putLabeledWord("read_inode: usercompr = ", jNode
->usercompr
);
637 putLabeledWord("read_inode: flags = ", jNode
->flags
);
640 #ifndef CFG_JFFS2_SORT_FRAGMENTS
641 /* get actual file length from the newest node */
642 if (jNode
->version
>= latestVersion
) {
643 totalSize
= jNode
->isize
;
644 latestVersion
= jNode
->version
;
649 src
= ((uchar
*) jNode
) + sizeof(struct jffs2_raw_inode
);
650 /* ignore data behind latest known EOF */
651 if (jNode
->offset
> totalSize
) {
656 lDest
= (uchar
*) (dest
+ jNode
->offset
);
658 putLabeledWord("read_inode: src = ", src
);
659 putLabeledWord("read_inode: dest = ", lDest
);
661 switch (jNode
->compr
) {
662 case JFFS2_COMPR_NONE
:
663 ret
= (unsigned long) ldr_memcpy(lDest
, src
, jNode
->dsize
);
665 case JFFS2_COMPR_ZERO
:
667 for (i
= 0; i
< jNode
->dsize
; i
++)
670 case JFFS2_COMPR_RTIME
:
672 rtime_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
674 case JFFS2_COMPR_DYNRUBIN
:
675 /* this is slow but it works */
677 dynrubin_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
679 case JFFS2_COMPR_ZLIB
:
680 ret
= zlib_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
682 #if defined(CONFIG_JFFS2_LZO_LZARI)
683 case JFFS2_COMPR_LZO
:
684 ret
= lzo_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
686 case JFFS2_COMPR_LZARI
:
687 ret
= lzari_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
692 putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode
->compr
);
700 putLabeledWord("read_inode: totalSize = ", totalSize
);
701 putLabeledWord("read_inode: compr ret = ", ret
);
709 putLabeledWord("read_inode: returning = ", totalSize
);
714 /* find the inode from the slashless name given a parent */
716 jffs2_1pass_find_inode(struct b_lists
* pL
, const char *name
, u32 pino
)
719 struct jffs2_raw_dirent
*jDir
;
725 /* name is assumed slash free */
729 /* we need to search all and return the inode with the highest version */
730 for(b
= pL
->dir
.listHead
; b
; b
= b
->next
, counter
++) {
731 jDir
= (struct jffs2_raw_dirent
*) get_node_mem(b
->offset
);
732 if ((pino
== jDir
->pino
) && (len
== jDir
->nsize
) &&
733 (jDir
->ino
) && /* 0 for unlink */
734 (!strncmp((char *)jDir
->name
, name
, len
))) { /* a match */
735 if (jDir
->version
< version
) {
740 if (jDir
->version
== version
&& inode
!= 0) {
741 /* I'm pretty sure this isn't legal */
742 putstr(" ** ERROR ** ");
743 putnstr(jDir
->name
, jDir
->nsize
);
744 putLabeledWord(" has dup version =", version
);
747 version
= jDir
->version
;
750 putstr("\r\nfind_inode:p&l ->");
751 putnstr(jDir
->name
, jDir
->nsize
);
753 putLabeledWord("pino = ", jDir
->pino
);
754 putLabeledWord("nsize = ", jDir
->nsize
);
755 putLabeledWord("b = ", (u32
) b
);
756 putLabeledWord("counter = ", counter
);
763 char *mkmodestr(unsigned long mode
, char *str
)
765 static const char *l
= "xwr";
769 switch (mode
& S_IFMT
) {
770 case S_IFDIR
: str
[0] = 'd'; break;
771 case S_IFBLK
: str
[0] = 'b'; break;
772 case S_IFCHR
: str
[0] = 'c'; break;
773 case S_IFIFO
: str
[0] = 'f'; break;
774 case S_IFLNK
: str
[0] = 'l'; break;
775 case S_IFSOCK
: str
[0] = 's'; break;
776 case S_IFREG
: str
[0] = '-'; break;
777 default: str
[0] = '?';
780 for(i
= 0; i
< 9; i
++) {
782 str
[9-i
] = (mode
& mask
)?c
:'-';
786 if(mode
& S_ISUID
) str
[3] = (mode
& S_IXUSR
)?'s':'S';
787 if(mode
& S_ISGID
) str
[6] = (mode
& S_IXGRP
)?'s':'S';
788 if(mode
& S_ISVTX
) str
[9] = (mode
& S_IXOTH
)?'t':'T';
793 static inline void dump_stat(struct stat
*st
, const char *name
)
798 if (st
->st_mtime
== (time_t)(-1)) /* some ctimes really hate -1 */
801 ctime_r((time_t *)&st
->st_mtime
, s
/*,64*/); /* newlib ctime doesn't have buflen */
803 if ((p
= strchr(s
,'\n')) != NULL
) *p
= '\0';
804 if ((p
= strchr(s
,'\r')) != NULL
) *p
= '\0';
807 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
808 st->st_size, s, name);
811 printf(" %s %8ld %s %s", mkmodestr(st
->st_mode
,str
), st
->st_size
, s
, name
);
814 static inline u32
dump_inode(struct b_lists
* pL
, struct jffs2_raw_dirent
*d
, struct jffs2_raw_inode
*i
)
819 if(!d
|| !i
) return -1;
821 strncpy(fname
, (char *)d
->name
, d
->nsize
);
822 fname
[d
->nsize
] = '\0';
824 memset(&st
,0,sizeof(st
));
826 st
.st_mtime
= i
->mtime
;
827 st
.st_mode
= i
->mode
;
830 /* neither dsize nor isize help us.. do it the long way */
831 st
.st_size
= jffs2_1pass_read_inode(pL
, i
->ino
, NULL
);
833 dump_stat(&st
, fname
);
835 if (d
->type
== DT_LNK
) {
836 unsigned char *src
= (unsigned char *) (&i
[1]);
838 putnstr(src
, (int)i
->dsize
);
846 /* list inodes with the given pino */
848 jffs2_1pass_list_inodes(struct b_lists
* pL
, u32 pino
)
851 struct jffs2_raw_dirent
*jDir
;
853 for (b
= pL
->dir
.listHead
; b
; b
= b
->next
) {
854 jDir
= (struct jffs2_raw_dirent
*) get_node_mem(b
->offset
);
855 if ((pino
== jDir
->pino
) && (jDir
->ino
)) { /* ino=0 -> unlink */
857 struct jffs2_raw_inode ojNode
;
858 struct jffs2_raw_inode
*jNode
, *i
= NULL
;
859 struct b_node
*b2
= pL
->frag
.listHead
;
862 jNode
= (struct jffs2_raw_inode
*)
863 get_fl_mem(b2
->offset
, sizeof(ojNode
), &ojNode
);
864 if (jNode
->ino
== jDir
->ino
&& jNode
->version
>= i_version
) {
868 if (jDir
->type
== DT_LNK
)
869 i
= get_node_mem(b2
->offset
);
871 i
= get_fl_mem(b2
->offset
, sizeof(*i
), NULL
);
876 dump_inode(pL
, jDir
, i
);
885 jffs2_1pass_search_inode(struct b_lists
* pL
, const char *fname
, u32 pino
)
889 char working_tmp
[256];
892 /* discard any leading slash */
894 while (fname
[i
] == '/')
896 strcpy(tmp
, &fname
[i
]);
898 while ((c
= (char *) strchr(tmp
, '/'))) /* we are still dired searching */
900 strncpy(working_tmp
, tmp
, c
- tmp
);
901 working_tmp
[c
- tmp
] = '\0';
903 putstr("search_inode: tmp = ");
906 putstr("search_inode: wtmp = ");
909 putstr("search_inode: c = ");
913 for (i
= 0; i
< strlen(c
) - 1; i
++)
917 putstr("search_inode: post tmp = ");
922 if (!(pino
= jffs2_1pass_find_inode(pL
, working_tmp
, pino
))) {
923 putstr("find_inode failed for name=");
929 /* this is for the bare filename, directories have already been mapped */
930 if (!(pino
= jffs2_1pass_find_inode(pL
, tmp
, pino
))) {
931 putstr("find_inode failed for name=");
941 jffs2_1pass_resolve_inode(struct b_lists
* pL
, u32 ino
)
945 struct jffs2_raw_dirent
*jDir
;
946 struct jffs2_raw_inode
*jNode
;
947 u8 jDirFoundType
= 0;
948 u32 jDirFoundIno
= 0;
949 u32 jDirFoundPino
= 0;
955 /* we need to search all and return the inode with the highest version */
956 for(b
= pL
->dir
.listHead
; b
; b
= b
->next
) {
957 jDir
= (struct jffs2_raw_dirent
*) get_node_mem(b
->offset
);
958 if (ino
== jDir
->ino
) {
959 if (jDir
->version
< version
) {
964 if (jDir
->version
== version
&& jDirFoundType
) {
965 /* I'm pretty sure this isn't legal */
966 putstr(" ** ERROR ** ");
967 putnstr(jDir
->name
, jDir
->nsize
);
968 putLabeledWord(" has dup version (resolve) = ",
972 jDirFoundType
= jDir
->type
;
973 jDirFoundIno
= jDir
->ino
;
974 jDirFoundPino
= jDir
->pino
;
975 version
= jDir
->version
;
979 /* now we found the right entry again. (shoulda returned inode*) */
980 if (jDirFoundType
!= DT_LNK
)
983 /* it's a soft link so we follow it again. */
984 b2
= pL
->frag
.listHead
;
986 jNode
= (struct jffs2_raw_inode
*) get_node_mem(b2
->offset
);
987 if (jNode
->ino
== jDirFoundIno
) {
988 src
= (unsigned char *)jNode
+ sizeof(struct jffs2_raw_inode
);
991 putLabeledWord("\t\t dsize = ", jNode
->dsize
);
992 putstr("\t\t target = ");
993 putnstr(src
, jNode
->dsize
);
996 strncpy(tmp
, (char *)src
, jNode
->dsize
);
997 tmp
[jNode
->dsize
] = '\0';
1004 /* ok so the name of the new file to find is in tmp */
1005 /* if it starts with a slash it is root based else shared dirs */
1009 pino
= jDirFoundPino
;
1011 return jffs2_1pass_search_inode(pL
, tmp
, pino
);
1015 jffs2_1pass_search_list_inodes(struct b_lists
* pL
, const char *fname
, u32 pino
)
1019 char working_tmp
[256];
1022 /* discard any leading slash */
1024 while (fname
[i
] == '/')
1026 strcpy(tmp
, &fname
[i
]);
1027 working_tmp
[0] = '\0';
1028 while ((c
= (char *) strchr(tmp
, '/'))) /* we are still dired searching */
1030 strncpy(working_tmp
, tmp
, c
- tmp
);
1031 working_tmp
[c
- tmp
] = '\0';
1032 for (i
= 0; i
< strlen(c
) - 1; i
++)
1035 /* only a failure if we arent looking at top level */
1036 if (!(pino
= jffs2_1pass_find_inode(pL
, working_tmp
, pino
)) &&
1038 putstr("find_inode failed for name=");
1039 putstr(working_tmp
);
1045 if (tmp
[0] && !(pino
= jffs2_1pass_find_inode(pL
, tmp
, pino
))) {
1046 putstr("find_inode failed for name=");
1051 /* this is for the bare filename, directories have already been mapped */
1052 if (!(pino
= jffs2_1pass_list_inodes(pL
, pino
))) {
1053 putstr("find_inode failed for name=");
1063 jffs2_1pass_rescan_needed(struct part_info
*part
)
1066 struct jffs2_unknown_node onode
;
1067 struct jffs2_unknown_node
*node
;
1068 struct b_lists
*pL
= (struct b_lists
*)part
->jffs2_priv
;
1070 if (part
->jffs2_priv
== 0){
1071 DEBUGF ("rescan: First time in use\n");
1075 /* if we have no list, we need to rescan */
1076 if (pL
->frag
.listCount
== 0) {
1077 DEBUGF ("rescan: fraglist zero\n");
1081 /* but suppose someone reflashed a partition at the same offset... */
1082 b
= pL
->dir
.listHead
;
1084 node
= (struct jffs2_unknown_node
*) get_fl_mem(b
->offset
,
1085 sizeof(onode
), &onode
);
1086 if (node
->nodetype
!= JFFS2_NODETYPE_DIRENT
) {
1087 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1088 (unsigned long) b
->offset
);
1096 #ifdef DEBUG_FRAGMENTS
1098 dump_fragments(struct b_lists
*pL
)
1101 struct jffs2_raw_inode ojNode
;
1102 struct jffs2_raw_inode
*jNode
;
1104 putstr("\r\n\r\n******The fragment Entries******\r\n");
1105 b
= pL
->frag
.listHead
;
1107 jNode
= (struct jffs2_raw_inode
*) get_fl_mem(b
->offset
,
1108 sizeof(ojNode
), &ojNode
);
1109 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b
->offset
);
1110 putLabeledWord("\tbuild_list: totlen = ", jNode
->totlen
);
1111 putLabeledWord("\tbuild_list: inode = ", jNode
->ino
);
1112 putLabeledWord("\tbuild_list: version = ", jNode
->version
);
1113 putLabeledWord("\tbuild_list: isize = ", jNode
->isize
);
1114 putLabeledWord("\tbuild_list: atime = ", jNode
->atime
);
1115 putLabeledWord("\tbuild_list: offset = ", jNode
->offset
);
1116 putLabeledWord("\tbuild_list: csize = ", jNode
->csize
);
1117 putLabeledWord("\tbuild_list: dsize = ", jNode
->dsize
);
1118 putLabeledWord("\tbuild_list: compr = ", jNode
->compr
);
1119 putLabeledWord("\tbuild_list: usercompr = ", jNode
->usercompr
);
1120 putLabeledWord("\tbuild_list: flags = ", jNode
->flags
);
1121 putLabeledWord("\tbuild_list: offset = ", b
->offset
); /* FIXME: ? [RS] */
1127 #ifdef DEBUG_DIRENTS
1129 dump_dirents(struct b_lists
*pL
)
1132 struct jffs2_raw_dirent
*jDir
;
1134 putstr("\r\n\r\n******The directory Entries******\r\n");
1135 b
= pL
->dir
.listHead
;
1137 jDir
= (struct jffs2_raw_dirent
*) get_node_mem(b
->offset
);
1139 putnstr(jDir
->name
, jDir
->nsize
);
1140 putLabeledWord("\r\n\tbuild_list: magic = ", jDir
->magic
);
1141 putLabeledWord("\tbuild_list: nodetype = ", jDir
->nodetype
);
1142 putLabeledWord("\tbuild_list: hdr_crc = ", jDir
->hdr_crc
);
1143 putLabeledWord("\tbuild_list: pino = ", jDir
->pino
);
1144 putLabeledWord("\tbuild_list: version = ", jDir
->version
);
1145 putLabeledWord("\tbuild_list: ino = ", jDir
->ino
);
1146 putLabeledWord("\tbuild_list: mctime = ", jDir
->mctime
);
1147 putLabeledWord("\tbuild_list: nsize = ", jDir
->nsize
);
1148 putLabeledWord("\tbuild_list: type = ", jDir
->type
);
1149 putLabeledWord("\tbuild_list: node_crc = ", jDir
->node_crc
);
1150 putLabeledWord("\tbuild_list: name_crc = ", jDir
->name_crc
);
1151 putLabeledWord("\tbuild_list: offset = ", b
->offset
); /* FIXME: ? [RS] */
1159 jffs2_1pass_build_lists(struct part_info
* part
)
1162 struct jffs2_unknown_node
*node
;
1163 u32 offset
, oldoffset
= 0;
1164 u32 max
= part
->size
- sizeof(struct jffs2_raw_inode
);
1170 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1171 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1172 /* only about 5 %. not enough to inconvenience people for. */
1175 /* if we are building a list we need to refresh the cache. */
1176 jffs_init_1pass_list(part
);
1177 pL
= (struct b_lists
*)part
->jffs2_priv
;
1179 puts ("Scanning JFFS2 FS: ");
1181 /* start at the beginning of the partition */
1182 while (offset
< max
) {
1183 if ((oldoffset
>> SPIN_BLKSIZE
) != (offset
>> SPIN_BLKSIZE
)) {
1184 printf("\b\b%c ", spinner
[counter
++ % sizeof(spinner
)]);
1188 node
= (struct jffs2_unknown_node
*) get_node_mem((u32
)part
->offset
+ offset
);
1189 if (node
->magic
== JFFS2_MAGIC_BITMASK
&& hdr_crc(node
)) {
1190 /* if its a fragment add it */
1191 if (node
->nodetype
== JFFS2_NODETYPE_INODE
&&
1192 inode_crc((struct jffs2_raw_inode
*) node
) &&
1193 data_crc((struct jffs2_raw_inode
*) node
)) {
1194 if (insert_node(&pL
->frag
, (u32
) part
->offset
+
1199 } else if (node
->nodetype
== JFFS2_NODETYPE_DIRENT
&&
1200 dirent_crc((struct jffs2_raw_dirent
*) node
) &&
1201 dirent_name_crc((struct jffs2_raw_dirent
*) node
)) {
1202 if (! (counterN
%100))
1204 if (insert_node(&pL
->dir
, (u32
) part
->offset
+
1210 } else if (node
->nodetype
== JFFS2_NODETYPE_CLEANMARKER
) {
1211 if (node
->totlen
!= sizeof(struct jffs2_unknown_node
))
1212 printf("OOPS Cleanmarker has bad size "
1213 "%d != %d\n", node
->totlen
,
1214 sizeof(struct jffs2_unknown_node
));
1215 } else if (node
->nodetype
== JFFS2_NODETYPE_PADDING
) {
1216 if (node
->totlen
< sizeof(struct jffs2_unknown_node
))
1217 printf("OOPS Padding has bad size "
1218 "%d < %d\n", node
->totlen
,
1219 sizeof(struct jffs2_unknown_node
));
1221 printf("Unknown node type: %x len %d "
1222 "offset 0x%x\n", node
->nodetype
,
1223 node
->totlen
, offset
);
1225 offset
+= ((node
->totlen
+ 3) & ~3);
1227 } else if (node
->magic
== JFFS2_EMPTY_BITMASK
&&
1228 node
->nodetype
== JFFS2_EMPTY_BITMASK
) {
1229 offset
= jffs2_scan_empty(offset
, part
);
1230 } else { /* if we know nothing, we just step and look. */
1234 /* printf("unknown node magic %4.4x %4.4x @ %lx\n", node->magic, node->nodetype, (unsigned long)node); */
1238 putstr("\b\b done.\r\n"); /* close off the dots */
1239 /* turn the lcd back on. */
1243 putLabeledWord("dir entries = ", pL
->dir
.listCount
);
1244 putLabeledWord("frag entries = ", pL
->frag
.listCount
);
1245 putLabeledWord("+4 increments = ", counter4
);
1246 putLabeledWord("+file_offset increments = ", counterF
);
1250 #ifdef DEBUG_DIRENTS
1254 #ifdef DEBUG_FRAGMENTS
1258 /* give visual feedback that we are done scanning the flash */
1259 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1265 jffs2_1pass_fill_info(struct b_lists
* pL
, struct b_jffs2_info
* piL
)
1268 struct jffs2_raw_inode ojNode
;
1269 struct jffs2_raw_inode
*jNode
;
1272 for (i
= 0; i
< JFFS2_NUM_COMPR
; i
++) {
1273 piL
->compr_info
[i
].num_frags
= 0;
1274 piL
->compr_info
[i
].compr_sum
= 0;
1275 piL
->compr_info
[i
].decompr_sum
= 0;
1278 b
= pL
->frag
.listHead
;
1280 jNode
= (struct jffs2_raw_inode
*) get_fl_mem(b
->offset
,
1281 sizeof(ojNode
), &ojNode
);
1282 if (jNode
->compr
< JFFS2_NUM_COMPR
) {
1283 piL
->compr_info
[jNode
->compr
].num_frags
++;
1284 piL
->compr_info
[jNode
->compr
].compr_sum
+= jNode
->csize
;
1285 piL
->compr_info
[jNode
->compr
].decompr_sum
+= jNode
->dsize
;
1293 static struct b_lists
*
1294 jffs2_get_list(struct part_info
* part
, const char *who
)
1296 /* copy requested part_info struct pointer to global location */
1297 current_part
= part
;
1299 if (jffs2_1pass_rescan_needed(part
)) {
1300 if (!jffs2_1pass_build_lists(part
)) {
1301 printf("%s: Failed to scan JFFSv2 file structure\n", who
);
1305 return (struct b_lists
*)part
->jffs2_priv
;
1309 /* Print directory / file contents */
1311 jffs2_1pass_ls(struct part_info
* part
, const char *fname
)
1317 if (! (pl
= jffs2_get_list(part
, "ls")))
1320 if (! (inode
= jffs2_1pass_search_list_inodes(pl
, fname
, 1))) {
1321 putstr("ls: Failed to scan jffs2 file structure\r\n");
1327 putLabeledWord("found file at inode = ", inode
);
1328 putLabeledWord("read_inode returns = ", ret
);
1335 /* Load a file from flash into memory. fname can be a full path */
1337 jffs2_1pass_load(char *dest
, struct part_info
* part
, const char *fname
)
1344 if (! (pl
= jffs2_get_list(part
, "load")))
1347 if (! (inode
= jffs2_1pass_search_inode(pl
, fname
, 1))) {
1348 putstr("load: Failed to find inode\r\n");
1352 /* Resolve symlinks */
1353 if (! (inode
= jffs2_1pass_resolve_inode(pl
, inode
))) {
1354 putstr("load: Failed to resolve inode structure\r\n");
1358 if ((ret
= jffs2_1pass_read_inode(pl
, inode
, dest
)) < 0) {
1359 putstr("load: Failed to read inode\r\n");
1363 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname
,
1364 (unsigned long) dest
, ret
);
1368 /* Return information about the fs on this partition */
1370 jffs2_1pass_info(struct part_info
* part
)
1372 struct b_jffs2_info info
;
1376 if (! (pl
= jffs2_get_list(part
, "info")))
1379 jffs2_1pass_fill_info(pl
, &info
);
1380 for (i
= 0; i
< JFFS2_NUM_COMPR
; i
++) {
1381 printf ("Compression: %s\n"
1382 "\tfrag count: %d\n"
1383 "\tcompressed sum: %d\n"
1384 "\tuncompressed sum: %d\n",
1386 info
.compr_info
[i
].num_frags
,
1387 info
.compr_info
[i
].compr_sum
,
1388 info
.compr_info
[i
].decompr_sum
);