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 CONFIG_SYS_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!
118 #include <linux/compiler.h>
119 #include <linux/stat.h>
120 #include <linux/time.h>
121 #include <watchdog.h>
122 #include <jffs2/jffs2.h>
123 #include <jffs2/jffs2_1pass.h>
124 #include <linux/compat.h>
125 #include <asm/errno.h>
127 #include "jffs2_private.h"
130 #define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */
131 #define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */
133 /* Debugging switches */
134 #undef DEBUG_DIRENTS /* print directory entry list after scan */
135 #undef DEBUG_FRAGMENTS /* print fragment list after scan */
136 #undef DEBUG /* enable debugging messages */
140 # define DEBUGF(fmt,args...) printf(fmt ,##args)
142 # define DEBUGF(fmt,args...)
147 /* keeps pointer to currentlu processed partition */
148 static struct part_info
*current_part
;
150 #if (defined(CONFIG_JFFS2_NAND) && \
151 defined(CONFIG_CMD_NAND) )
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 #define NAND_PAGE_SIZE 512
164 #define NAND_PAGE_SHIFT 9
165 #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
167 #ifndef NAND_CACHE_PAGES
168 #define NAND_CACHE_PAGES 16
170 #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
172 static u8
* nand_cache
= NULL
;
173 static u32 nand_cache_off
= (u32
)-1;
175 static int read_nand_cached(u32 off
, u32 size
, u_char
*buf
)
177 struct mtdids
*id
= current_part
->dev
->id
;
182 while (bytes_read
< size
) {
183 if ((off
+ bytes_read
< nand_cache_off
) ||
184 (off
+ bytes_read
>= nand_cache_off
+NAND_CACHE_SIZE
)) {
185 nand_cache_off
= (off
+ bytes_read
) & NAND_PAGE_MASK
;
187 /* This memory never gets freed but 'cause
188 it's a bootloader, nobody cares */
189 nand_cache
= malloc(NAND_CACHE_SIZE
);
191 printf("read_nand_cached: can't alloc cache size %d bytes\n",
197 retlen
= NAND_CACHE_SIZE
;
198 if (nand_read(nand_info
[id
->num
], nand_cache_off
,
199 &retlen
, nand_cache
) != 0 ||
200 retlen
!= NAND_CACHE_SIZE
) {
201 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
202 nand_cache_off
, NAND_CACHE_SIZE
);
206 cpy_bytes
= nand_cache_off
+ NAND_CACHE_SIZE
- (off
+ bytes_read
);
207 if (cpy_bytes
> size
- bytes_read
)
208 cpy_bytes
= size
- bytes_read
;
209 memcpy(buf
+ bytes_read
,
210 nand_cache
+ off
+ bytes_read
- nand_cache_off
,
212 bytes_read
+= cpy_bytes
;
217 static void *get_fl_mem_nand(u32 off
, u32 size
, void *ext_buf
)
219 u_char
*buf
= ext_buf
? (u_char
*)ext_buf
: (u_char
*)malloc(size
);
222 printf("get_fl_mem_nand: can't alloc %d bytes\n", size
);
225 if (read_nand_cached(off
, size
, buf
) < 0) {
234 static void *get_node_mem_nand(u32 off
, void *ext_buf
)
236 struct jffs2_unknown_node node
;
239 if (NULL
== get_fl_mem_nand(off
, sizeof(node
), &node
))
242 if (!(ret
= get_fl_mem_nand(off
, node
.magic
==
243 JFFS2_MAGIC_BITMASK
? node
.totlen
: sizeof(node
),
245 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
246 off
, node
.magic
, node
.nodetype
, node
.totlen
);
251 static void put_fl_mem_nand(void *buf
)
257 #if defined(CONFIG_CMD_ONENAND)
259 #include <linux/mtd/mtd.h>
260 #include <linux/mtd/onenand.h>
261 #include <onenand_uboot.h>
263 #define ONENAND_PAGE_SIZE 2048
264 #define ONENAND_PAGE_SHIFT 11
265 #define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1))
267 #ifndef ONENAND_CACHE_PAGES
268 #define ONENAND_CACHE_PAGES 4
270 #define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE)
272 static u8
* onenand_cache
;
273 static u32 onenand_cache_off
= (u32
)-1;
275 static int read_onenand_cached(u32 off
, u32 size
, u_char
*buf
)
281 while (bytes_read
< size
) {
282 if ((off
+ bytes_read
< onenand_cache_off
) ||
283 (off
+ bytes_read
>= onenand_cache_off
+ ONENAND_CACHE_SIZE
)) {
284 onenand_cache_off
= (off
+ bytes_read
) & ONENAND_PAGE_MASK
;
285 if (!onenand_cache
) {
286 /* This memory never gets freed but 'cause
287 it's a bootloader, nobody cares */
288 onenand_cache
= malloc(ONENAND_CACHE_SIZE
);
289 if (!onenand_cache
) {
290 printf("read_onenand_cached: can't alloc cache size %d bytes\n",
296 retlen
= ONENAND_CACHE_SIZE
;
297 if (onenand_read(&onenand_mtd
, onenand_cache_off
, retlen
,
298 &retlen
, onenand_cache
) != 0 ||
299 retlen
!= ONENAND_CACHE_SIZE
) {
300 printf("read_onenand_cached: error reading nand off %#x size %d bytes\n",
301 onenand_cache_off
, ONENAND_CACHE_SIZE
);
305 cpy_bytes
= onenand_cache_off
+ ONENAND_CACHE_SIZE
- (off
+ bytes_read
);
306 if (cpy_bytes
> size
- bytes_read
)
307 cpy_bytes
= size
- bytes_read
;
308 memcpy(buf
+ bytes_read
,
309 onenand_cache
+ off
+ bytes_read
- onenand_cache_off
,
311 bytes_read
+= cpy_bytes
;
316 static void *get_fl_mem_onenand(u32 off
, u32 size
, void *ext_buf
)
318 u_char
*buf
= ext_buf
? (u_char
*)ext_buf
: (u_char
*)malloc(size
);
321 printf("get_fl_mem_onenand: can't alloc %d bytes\n", size
);
324 if (read_onenand_cached(off
, size
, buf
) < 0) {
333 static void *get_node_mem_onenand(u32 off
, void *ext_buf
)
335 struct jffs2_unknown_node node
;
338 if (NULL
== get_fl_mem_onenand(off
, sizeof(node
), &node
))
341 ret
= get_fl_mem_onenand(off
, node
.magic
==
342 JFFS2_MAGIC_BITMASK
? node
.totlen
: sizeof(node
),
345 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
346 off
, node
.magic
, node
.nodetype
, node
.totlen
);
352 static void put_fl_mem_onenand(void *buf
)
359 #if defined(CONFIG_CMD_FLASH)
361 * Support for jffs2 on top of NOR-flash
363 * NOR flash memory is mapped in processor's address space,
364 * just return address.
366 static inline void *get_fl_mem_nor(u32 off
, u32 size
, void *ext_buf
)
369 struct mtdids
*id
= current_part
->dev
->id
;
371 extern flash_info_t flash_info
[];
372 flash_info_t
*flash
= &flash_info
[id
->num
];
374 addr
+= flash
->start
[0];
376 memcpy(ext_buf
, (void *)addr
, size
);
382 static inline void *get_node_mem_nor(u32 off
, void *ext_buf
)
384 struct jffs2_unknown_node
*pNode
;
386 /* pNode will point directly to flash - don't provide external buffer
387 and don't care about size */
388 pNode
= get_fl_mem_nor(off
, 0, NULL
);
389 return (void *)get_fl_mem_nor(off
, pNode
->magic
== JFFS2_MAGIC_BITMASK
?
390 pNode
->totlen
: sizeof(*pNode
), ext_buf
);
396 * Generic jffs2 raw memory and node read routines.
399 static inline void *get_fl_mem(u32 off
, u32 size
, void *ext_buf
)
401 struct mtdids
*id
= current_part
->dev
->id
;
404 #if defined(CONFIG_CMD_FLASH)
405 case MTD_DEV_TYPE_NOR
:
406 return get_fl_mem_nor(off
, size
, ext_buf
);
409 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
410 case MTD_DEV_TYPE_NAND
:
411 return get_fl_mem_nand(off
, size
, ext_buf
);
414 #if defined(CONFIG_CMD_ONENAND)
415 case MTD_DEV_TYPE_ONENAND
:
416 return get_fl_mem_onenand(off
, size
, ext_buf
);
420 printf("get_fl_mem: unknown device type, " \
421 "using raw offset!\n");
426 static inline void *get_node_mem(u32 off
, void *ext_buf
)
428 struct mtdids
*id
= current_part
->dev
->id
;
431 #if defined(CONFIG_CMD_FLASH)
432 case MTD_DEV_TYPE_NOR
:
433 return get_node_mem_nor(off
, ext_buf
);
436 #if defined(CONFIG_JFFS2_NAND) && \
437 defined(CONFIG_CMD_NAND)
438 case MTD_DEV_TYPE_NAND
:
439 return get_node_mem_nand(off
, ext_buf
);
442 #if defined(CONFIG_CMD_ONENAND)
443 case MTD_DEV_TYPE_ONENAND
:
444 return get_node_mem_onenand(off
, ext_buf
);
448 printf("get_fl_mem: unknown device type, " \
449 "using raw offset!\n");
454 static inline void put_fl_mem(void *buf
, void *ext_buf
)
456 struct mtdids
*id
= current_part
->dev
->id
;
458 /* If buf is the same as ext_buf, it was provided by the caller -
459 we shouldn't free it then. */
463 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
464 case MTD_DEV_TYPE_NAND
:
465 return put_fl_mem_nand(buf
);
467 #if defined(CONFIG_CMD_ONENAND)
468 case MTD_DEV_TYPE_ONENAND
:
469 return put_fl_mem_onenand(buf
);
474 /* Compression names */
475 static char *compr_names
[] = {
483 #if defined(CONFIG_JFFS2_LZO)
488 /* Memory management */
491 struct mem_block
*next
;
492 struct b_node nodes
[NODE_CHUNK
];
497 free_nodes(struct b_list
*list
)
499 while (list
->listMemBase
!= NULL
) {
500 struct mem_block
*next
= list
->listMemBase
->next
;
501 free( list
->listMemBase
);
502 list
->listMemBase
= next
;
506 static struct b_node
*
507 add_node(struct b_list
*list
)
510 struct mem_block
*memBase
;
513 memBase
= list
->listMemBase
;
515 index
= memBase
->index
;
517 putLabeledWord("add_node: index = ", index
);
518 putLabeledWord("add_node: memBase = ", list
->listMemBase
);
521 if (memBase
== NULL
|| index
>= NODE_CHUNK
) {
522 /* we need more space before we continue */
523 memBase
= mmalloc(sizeof(struct mem_block
));
524 if (memBase
== NULL
) {
525 putstr("add_node: malloc failed\n");
528 memBase
->next
= list
->listMemBase
;
531 putLabeledWord("add_node: alloced a new membase at ", *memBase
);
535 /* now we have room to add it. */
536 b
= &memBase
->nodes
[index
];
539 memBase
->index
= index
;
540 list
->listMemBase
= memBase
;
545 static struct b_node
*
546 insert_node(struct b_list
*list
, u32 offset
)
550 if (!(new = add_node(list
))) {
551 putstr("add_node failed!\r\n");
554 new->offset
= offset
;
557 if (list
->listTail
!= NULL
)
558 list
->listTail
->next
= new;
560 list
->listHead
= new;
561 list
->listTail
= new;
566 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
567 /* Sort data entries with the latest version last, so that if there
568 * is overlapping data the latest version will be used.
570 static int compare_inodes(struct b_node
*new, struct b_node
*old
)
573 * Only read in the version info from flash, not the entire inode.
574 * This can make a big difference to speed if flash is slow.
578 get_fl_mem(new->offset
+ offsetof(struct jffs2_raw_inode
, version
),
579 sizeof(new_version
), &new_version
);
580 get_fl_mem(old
->offset
+ offsetof(struct jffs2_raw_inode
, version
),
581 sizeof(old_version
), &old_version
);
583 return new_version
> old_version
;
586 /* Sort directory entries so all entries in the same directory
587 * with the same name are grouped together, with the latest version
588 * last. This makes it easy to eliminate all but the latest version
589 * by marking the previous version dead by setting the inode to 0.
591 static int compare_dirents(struct b_node
*new, struct b_node
*old
)
594 * Using NULL as the buffer for NOR flash prevents the entire node
595 * being read. This makes most comparisons much quicker as only one
596 * or two entries from the node will be used most of the time.
598 struct jffs2_raw_dirent
*jNew
= get_node_mem(new->offset
, NULL
);
599 struct jffs2_raw_dirent
*jOld
= get_node_mem(old
->offset
, NULL
);
603 if (jNew
->pino
!= jOld
->pino
) {
604 /* ascending sort by pino */
605 ret
= jNew
->pino
> jOld
->pino
;
606 } else if (jNew
->nsize
!= jOld
->nsize
) {
608 * pino is the same, so use ascending sort by nsize,
609 * so we don't do strncmp unless we really must.
611 ret
= jNew
->nsize
> jOld
->nsize
;
614 * length is also the same, so use ascending sort by name
616 cmp
= strncmp((char *)jNew
->name
, (char *)jOld
->name
,
622 * we have duplicate names in this directory,
623 * so use ascending sort by version
625 ret
= jNew
->version
> jOld
->version
;
628 put_fl_mem(jNew
, NULL
);
629 put_fl_mem(jOld
, NULL
);
636 jffs2_free_cache(struct part_info
*part
)
640 if (part
->jffs2_priv
!= NULL
) {
641 pL
= (struct b_lists
*)part
->jffs2_priv
;
642 free_nodes(&pL
->frag
);
643 free_nodes(&pL
->dir
);
650 jffs_init_1pass_list(struct part_info
*part
)
654 jffs2_free_cache(part
);
656 if (NULL
!= (part
->jffs2_priv
= malloc(sizeof(struct b_lists
)))) {
657 pL
= (struct b_lists
*)part
->jffs2_priv
;
659 memset(pL
, 0, sizeof(*pL
));
660 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
661 pL
->dir
.listCompare
= compare_dirents
;
662 pL
->frag
.listCompare
= compare_inodes
;
668 /* find the inode from the slashless name given a parent */
670 jffs2_1pass_read_inode(struct b_lists
*pL
, u32 inode
, char *dest
)
673 struct jffs2_raw_inode
*jNode
;
675 u32 latestVersion
= 0;
680 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
681 /* Find file size before loading any data, so fragments that
682 * start past the end of file can be ignored. A fragment
683 * that is partially in the file is loaded, so extra data may
684 * be loaded up to the next 4K boundary above the file size.
685 * This shouldn't cause trouble when loading kernel images, so
686 * we will live with it.
688 for (b
= pL
->frag
.listHead
; b
!= NULL
; b
= b
->next
) {
689 jNode
= (struct jffs2_raw_inode
*) get_fl_mem(b
->offset
,
690 sizeof(struct jffs2_raw_inode
), pL
->readbuf
);
691 if ((inode
== jNode
->ino
)) {
692 /* get actual file length from the newest node */
693 if (jNode
->version
>= latestVersion
) {
694 totalSize
= jNode
->isize
;
695 latestVersion
= jNode
->version
;
698 put_fl_mem(jNode
, pL
->readbuf
);
701 * If no destination is provided, we are done.
702 * Just return the total size.
708 for (b
= pL
->frag
.listHead
; b
!= NULL
; b
= b
->next
) {
710 * Copy just the node and not the data at this point,
711 * since we don't yet know if we need this data.
713 jNode
= (struct jffs2_raw_inode
*)get_fl_mem(b
->offset
,
714 sizeof(struct jffs2_raw_inode
),
716 if (inode
== jNode
->ino
) {
718 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode
->totlen
);
719 putLabeledWord("read_inode: inode = ", jNode
->ino
);
720 putLabeledWord("read_inode: version = ", jNode
->version
);
721 putLabeledWord("read_inode: isize = ", jNode
->isize
);
722 putLabeledWord("read_inode: offset = ", jNode
->offset
);
723 putLabeledWord("read_inode: csize = ", jNode
->csize
);
724 putLabeledWord("read_inode: dsize = ", jNode
->dsize
);
725 putLabeledWord("read_inode: compr = ", jNode
->compr
);
726 putLabeledWord("read_inode: usercompr = ", jNode
->usercompr
);
727 putLabeledWord("read_inode: flags = ", jNode
->flags
);
730 #ifndef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
731 /* get actual file length from the newest node */
732 if (jNode
->version
>= latestVersion
) {
733 totalSize
= jNode
->isize
;
734 latestVersion
= jNode
->version
;
740 * Now that the inode has been checked,
741 * read the entire inode, including data.
743 put_fl_mem(jNode
, pL
->readbuf
);
744 jNode
= (struct jffs2_raw_inode
*)
745 get_node_mem(b
->offset
, pL
->readbuf
);
746 src
= ((uchar
*)jNode
) +
747 sizeof(struct jffs2_raw_inode
);
748 /* ignore data behind latest known EOF */
749 if (jNode
->offset
> totalSize
) {
750 put_fl_mem(jNode
, pL
->readbuf
);
753 if (b
->datacrc
== CRC_UNKNOWN
)
754 b
->datacrc
= data_crc(jNode
) ?
756 if (b
->datacrc
== CRC_BAD
) {
757 put_fl_mem(jNode
, pL
->readbuf
);
761 lDest
= (uchar
*) (dest
+ jNode
->offset
);
763 putLabeledWord("read_inode: src = ", src
);
764 putLabeledWord("read_inode: dest = ", lDest
);
766 switch (jNode
->compr
) {
767 case JFFS2_COMPR_NONE
:
768 ldr_memcpy(lDest
, src
, jNode
->dsize
);
770 case JFFS2_COMPR_ZERO
:
771 for (i
= 0; i
< jNode
->dsize
; i
++)
774 case JFFS2_COMPR_RTIME
:
775 rtime_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
777 case JFFS2_COMPR_DYNRUBIN
:
778 /* this is slow but it works */
779 dynrubin_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
781 case JFFS2_COMPR_ZLIB
:
782 zlib_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
784 #if defined(CONFIG_JFFS2_LZO)
785 case JFFS2_COMPR_LZO
:
786 lzo_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
791 putLabeledWord("UNKNOWN COMPRESSION METHOD = ", jNode
->compr
);
792 put_fl_mem(jNode
, pL
->readbuf
);
799 putLabeledWord("read_inode: totalSize = ", totalSize
);
803 put_fl_mem(jNode
, pL
->readbuf
);
807 putLabeledWord("read_inode: returning = ", totalSize
);
812 /* find the inode from the slashless name given a parent */
814 jffs2_1pass_find_inode(struct b_lists
* pL
, const char *name
, u32 pino
)
817 struct jffs2_raw_dirent
*jDir
;
823 /* name is assumed slash free */
827 /* we need to search all and return the inode with the highest version */
828 for(b
= pL
->dir
.listHead
; b
; b
= b
->next
, counter
++) {
829 jDir
= (struct jffs2_raw_dirent
*) get_node_mem(b
->offset
,
831 if ((pino
== jDir
->pino
) && (len
== jDir
->nsize
) &&
832 (!strncmp((char *)jDir
->name
, name
, len
))) { /* a match */
833 if (jDir
->version
< version
) {
834 put_fl_mem(jDir
, pL
->readbuf
);
838 if (jDir
->version
== version
&& inode
!= 0) {
839 /* I'm pretty sure this isn't legal */
840 putstr(" ** ERROR ** ");
841 putnstr(jDir
->name
, jDir
->nsize
);
842 putLabeledWord(" has dup version =", version
);
845 version
= jDir
->version
;
848 putstr("\r\nfind_inode:p&l ->");
849 putnstr(jDir
->name
, jDir
->nsize
);
851 putLabeledWord("pino = ", jDir
->pino
);
852 putLabeledWord("nsize = ", jDir
->nsize
);
853 putLabeledWord("b = ", (u32
) b
);
854 putLabeledWord("counter = ", counter
);
856 put_fl_mem(jDir
, pL
->readbuf
);
861 char *mkmodestr(unsigned long mode
, char *str
)
863 static const char *l
= "xwr";
867 switch (mode
& S_IFMT
) {
868 case S_IFDIR
: str
[0] = 'd'; break;
869 case S_IFBLK
: str
[0] = 'b'; break;
870 case S_IFCHR
: str
[0] = 'c'; break;
871 case S_IFIFO
: str
[0] = 'f'; break;
872 case S_IFLNK
: str
[0] = 'l'; break;
873 case S_IFSOCK
: str
[0] = 's'; break;
874 case S_IFREG
: str
[0] = '-'; break;
875 default: str
[0] = '?';
878 for(i
= 0; i
< 9; i
++) {
880 str
[9-i
] = (mode
& mask
)?c
:'-';
884 if(mode
& S_ISUID
) str
[3] = (mode
& S_IXUSR
)?'s':'S';
885 if(mode
& S_ISGID
) str
[6] = (mode
& S_IXGRP
)?'s':'S';
886 if(mode
& S_ISVTX
) str
[9] = (mode
& S_IXOTH
)?'t':'T';
891 static inline void dump_stat(struct stat
*st
, const char *name
)
896 if (st
->st_mtime
== (time_t)(-1)) /* some ctimes really hate -1 */
899 ctime_r((time_t *)&st
->st_mtime
, s
/*,64*/); /* newlib ctime doesn't have buflen */
901 if ((p
= strchr(s
,'\n')) != NULL
) *p
= '\0';
902 if ((p
= strchr(s
,'\r')) != NULL
) *p
= '\0';
905 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
906 st->st_size, s, name);
909 printf(" %s %8ld %s %s", mkmodestr(st
->st_mode
,str
), st
->st_size
, s
, name
);
912 static inline u32
dump_inode(struct b_lists
* pL
, struct jffs2_raw_dirent
*d
, struct jffs2_raw_inode
*i
)
917 if(!d
|| !i
) return -1;
919 strncpy(fname
, (char *)d
->name
, d
->nsize
);
920 fname
[d
->nsize
] = '\0';
922 memset(&st
,0,sizeof(st
));
924 st
.st_mtime
= i
->mtime
;
925 st
.st_mode
= i
->mode
;
927 st
.st_size
= i
->isize
;
929 dump_stat(&st
, fname
);
931 if (d
->type
== DT_LNK
) {
932 unsigned char *src
= (unsigned char *) (&i
[1]);
934 putnstr(src
, (int)i
->dsize
);
942 /* list inodes with the given pino */
944 jffs2_1pass_list_inodes(struct b_lists
* pL
, u32 pino
)
947 struct jffs2_raw_dirent
*jDir
;
949 for (b
= pL
->dir
.listHead
; b
; b
= b
->next
) {
950 jDir
= (struct jffs2_raw_dirent
*) get_node_mem(b
->offset
,
952 if (pino
== jDir
->pino
) {
954 struct jffs2_raw_inode
*jNode
, *i
= NULL
;
957 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
958 /* Check for more recent versions of this file */
961 struct b_node
*next
= b
->next
;
962 struct jffs2_raw_dirent
*jDirNext
;
965 jDirNext
= (struct jffs2_raw_dirent
*)
966 get_node_mem(next
->offset
, NULL
);
967 match
= jDirNext
->pino
== jDir
->pino
&&
968 jDirNext
->nsize
== jDir
->nsize
&&
969 strncmp((char *)jDirNext
->name
,
973 /* Use next. It is more recent */
975 /* Update buffer with the new info */
978 put_fl_mem(jDirNext
, NULL
);
981 if (jDir
->ino
== 0) {
983 put_fl_mem(jDir
, pL
->readbuf
);
987 for (b2
= pL
->frag
.listHead
; b2
; b2
= b2
->next
) {
988 jNode
= (struct jffs2_raw_inode
*)
989 get_fl_mem(b2
->offset
, sizeof(*jNode
),
991 if (jNode
->ino
== jDir
->ino
&&
992 jNode
->version
>= i_version
) {
993 i_version
= jNode
->version
;
997 if (jDir
->type
== DT_LNK
)
998 i
= get_node_mem(b2
->offset
,
1001 i
= get_fl_mem(b2
->offset
,
1005 put_fl_mem(jNode
, NULL
);
1008 dump_inode(pL
, jDir
, i
);
1009 put_fl_mem(i
, NULL
);
1011 put_fl_mem(jDir
, pL
->readbuf
);
1017 jffs2_1pass_search_inode(struct b_lists
* pL
, const char *fname
, u32 pino
)
1021 char working_tmp
[256];
1024 /* discard any leading slash */
1026 while (fname
[i
] == '/')
1028 strcpy(tmp
, &fname
[i
]);
1030 while ((c
= (char *) strchr(tmp
, '/'))) /* we are still dired searching */
1032 strncpy(working_tmp
, tmp
, c
- tmp
);
1033 working_tmp
[c
- tmp
] = '\0';
1035 putstr("search_inode: tmp = ");
1038 putstr("search_inode: wtmp = ");
1039 putstr(working_tmp
);
1041 putstr("search_inode: c = ");
1045 for (i
= 0; i
< strlen(c
) - 1; i
++)
1049 putstr("search_inode: post tmp = ");
1054 if (!(pino
= jffs2_1pass_find_inode(pL
, working_tmp
, pino
))) {
1055 putstr("find_inode failed for name=");
1056 putstr(working_tmp
);
1061 /* this is for the bare filename, directories have already been mapped */
1062 if (!(pino
= jffs2_1pass_find_inode(pL
, tmp
, pino
))) {
1063 putstr("find_inode failed for name=");
1073 jffs2_1pass_resolve_inode(struct b_lists
* pL
, u32 ino
)
1077 struct jffs2_raw_dirent
*jDir
;
1078 struct jffs2_raw_inode
*jNode
;
1079 u8 jDirFoundType
= 0;
1080 u32 jDirFoundIno
= 0;
1081 u32 jDirFoundPino
= 0;
1087 /* we need to search all and return the inode with the highest version */
1088 for(b
= pL
->dir
.listHead
; b
; b
= b
->next
) {
1089 jDir
= (struct jffs2_raw_dirent
*) get_node_mem(b
->offset
,
1091 if (ino
== jDir
->ino
) {
1092 if (jDir
->version
< version
) {
1093 put_fl_mem(jDir
, pL
->readbuf
);
1097 if (jDir
->version
== version
&& jDirFoundType
) {
1098 /* I'm pretty sure this isn't legal */
1099 putstr(" ** ERROR ** ");
1100 putnstr(jDir
->name
, jDir
->nsize
);
1101 putLabeledWord(" has dup version (resolve) = ",
1105 jDirFoundType
= jDir
->type
;
1106 jDirFoundIno
= jDir
->ino
;
1107 jDirFoundPino
= jDir
->pino
;
1108 version
= jDir
->version
;
1110 put_fl_mem(jDir
, pL
->readbuf
);
1112 /* now we found the right entry again. (shoulda returned inode*) */
1113 if (jDirFoundType
!= DT_LNK
)
1114 return jDirFoundIno
;
1116 /* it's a soft link so we follow it again. */
1117 b2
= pL
->frag
.listHead
;
1119 jNode
= (struct jffs2_raw_inode
*) get_node_mem(b2
->offset
,
1121 if (jNode
->ino
== jDirFoundIno
) {
1122 src
= (unsigned char *)jNode
+ sizeof(struct jffs2_raw_inode
);
1125 putLabeledWord("\t\t dsize = ", jNode
->dsize
);
1126 putstr("\t\t target = ");
1127 putnstr(src
, jNode
->dsize
);
1130 strncpy(tmp
, (char *)src
, jNode
->dsize
);
1131 tmp
[jNode
->dsize
] = '\0';
1132 put_fl_mem(jNode
, pL
->readbuf
);
1136 put_fl_mem(jNode
, pL
->readbuf
);
1138 /* ok so the name of the new file to find is in tmp */
1139 /* if it starts with a slash it is root based else shared dirs */
1143 pino
= jDirFoundPino
;
1145 return jffs2_1pass_search_inode(pL
, tmp
, pino
);
1149 jffs2_1pass_search_list_inodes(struct b_lists
* pL
, const char *fname
, u32 pino
)
1153 char working_tmp
[256];
1156 /* discard any leading slash */
1158 while (fname
[i
] == '/')
1160 strcpy(tmp
, &fname
[i
]);
1161 working_tmp
[0] = '\0';
1162 while ((c
= (char *) strchr(tmp
, '/'))) /* we are still dired searching */
1164 strncpy(working_tmp
, tmp
, c
- tmp
);
1165 working_tmp
[c
- tmp
] = '\0';
1166 for (i
= 0; i
< strlen(c
) - 1; i
++)
1169 /* only a failure if we arent looking at top level */
1170 if (!(pino
= jffs2_1pass_find_inode(pL
, working_tmp
, pino
)) &&
1172 putstr("find_inode failed for name=");
1173 putstr(working_tmp
);
1179 if (tmp
[0] && !(pino
= jffs2_1pass_find_inode(pL
, tmp
, pino
))) {
1180 putstr("find_inode failed for name=");
1185 /* this is for the bare filename, directories have already been mapped */
1186 if (!(pino
= jffs2_1pass_list_inodes(pL
, pino
))) {
1187 putstr("find_inode failed for name=");
1197 jffs2_1pass_rescan_needed(struct part_info
*part
)
1200 struct jffs2_unknown_node onode
;
1201 struct jffs2_unknown_node
*node
;
1202 struct b_lists
*pL
= (struct b_lists
*)part
->jffs2_priv
;
1204 if (part
->jffs2_priv
== 0){
1205 DEBUGF ("rescan: First time in use\n");
1209 /* if we have no list, we need to rescan */
1210 if (pL
->frag
.listCount
== 0) {
1211 DEBUGF ("rescan: fraglist zero\n");
1215 /* but suppose someone reflashed a partition at the same offset... */
1216 b
= pL
->dir
.listHead
;
1218 node
= (struct jffs2_unknown_node
*) get_fl_mem(b
->offset
,
1219 sizeof(onode
), &onode
);
1220 if (node
->nodetype
!= JFFS2_NODETYPE_DIRENT
) {
1221 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1222 (unsigned long) b
->offset
);
1230 #ifdef CONFIG_JFFS2_SUMMARY
1231 static u32
sum_get_unaligned32(u32
*ptr
)
1236 val
= *p
| (*(p
+ 1) << 8) | (*(p
+ 2) << 16) | (*(p
+ 3) << 24);
1238 return __le32_to_cpu(val
);
1241 static u16
sum_get_unaligned16(u16
*ptr
)
1246 val
= *p
| (*(p
+ 1) << 8);
1248 return __le16_to_cpu(val
);
1251 #define dbg_summary(...) do {} while (0);
1253 * Process the stored summary information - helper function for
1254 * jffs2_sum_scan_sumnode()
1257 static int jffs2_sum_process_sum_data(struct part_info
*part
, uint32_t offset
,
1258 struct jffs2_raw_summary
*summary
,
1265 for (pass
= 0; pass
< 2; pass
++) {
1268 for (i
= 0; i
< summary
->sum_num
; i
++) {
1269 struct jffs2_sum_unknown_flash
*spu
= sp
;
1270 dbg_summary("processing summary index %d\n", i
);
1272 switch (sum_get_unaligned16(&spu
->nodetype
)) {
1273 case JFFS2_NODETYPE_INODE
: {
1274 struct jffs2_sum_inode_flash
*spi
;
1278 ret
= insert_node(&pL
->frag
,
1281 sum_get_unaligned32(
1287 sp
+= JFFS2_SUMMARY_INODE_SIZE
;
1291 case JFFS2_NODETYPE_DIRENT
: {
1292 struct jffs2_sum_dirent_flash
*spd
;
1295 ret
= insert_node(&pL
->dir
,
1296 (u32
) part
->offset
+
1298 sum_get_unaligned32(
1304 sp
+= JFFS2_SUMMARY_DIRENT_SIZE(
1310 uint16_t nodetype
= sum_get_unaligned16(
1312 printf("Unsupported node type %x found"
1315 if ((nodetype
& JFFS2_COMPAT_MASK
) ==
1316 JFFS2_FEATURE_INCOMPAT
)
1326 /* Process the summary node - called from jffs2_scan_eraseblock() */
1327 int jffs2_sum_scan_sumnode(struct part_info
*part
, uint32_t offset
,
1328 struct jffs2_raw_summary
*summary
, uint32_t sumsize
,
1331 struct jffs2_unknown_node crcnode
;
1332 int ret
, __maybe_unused ofs
;
1335 ofs
= part
->sector_size
- sumsize
;
1337 dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
1338 offset
, offset
+ ofs
, sumsize
);
1340 /* OK, now check for node validity and CRC */
1341 crcnode
.magic
= JFFS2_MAGIC_BITMASK
;
1342 crcnode
.nodetype
= JFFS2_NODETYPE_SUMMARY
;
1343 crcnode
.totlen
= summary
->totlen
;
1344 crc
= crc32_no_comp(0, (uchar
*)&crcnode
, sizeof(crcnode
)-4);
1346 if (summary
->hdr_crc
!= crc
) {
1347 dbg_summary("Summary node header is corrupt (bad CRC or "
1348 "no summary at all)\n");
1352 if (summary
->totlen
!= sumsize
) {
1353 dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
1357 crc
= crc32_no_comp(0, (uchar
*)summary
,
1358 sizeof(struct jffs2_raw_summary
)-8);
1360 if (summary
->node_crc
!= crc
) {
1361 dbg_summary("Summary node is corrupt (bad CRC)\n");
1365 crc
= crc32_no_comp(0, (uchar
*)summary
->sum
,
1366 sumsize
- sizeof(struct jffs2_raw_summary
));
1368 if (summary
->sum_crc
!= crc
) {
1369 dbg_summary("Summary node data is corrupt (bad CRC)\n");
1373 if (summary
->cln_mkr
)
1374 dbg_summary("Summary : CLEANMARKER node \n");
1376 ret
= jffs2_sum_process_sum_data(part
, offset
, summary
, pL
);
1377 if (ret
== -EBADMSG
)
1380 return ret
; /* real error */
1385 putstr("Summary node crc error, skipping summary information.\n");
1389 #endif /* CONFIG_JFFS2_SUMMARY */
1391 #ifdef DEBUG_FRAGMENTS
1393 dump_fragments(struct b_lists
*pL
)
1396 struct jffs2_raw_inode ojNode
;
1397 struct jffs2_raw_inode
*jNode
;
1399 putstr("\r\n\r\n******The fragment Entries******\r\n");
1400 b
= pL
->frag
.listHead
;
1402 jNode
= (struct jffs2_raw_inode
*) get_fl_mem(b
->offset
,
1403 sizeof(ojNode
), &ojNode
);
1404 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b
->offset
);
1405 putLabeledWord("\tbuild_list: totlen = ", jNode
->totlen
);
1406 putLabeledWord("\tbuild_list: inode = ", jNode
->ino
);
1407 putLabeledWord("\tbuild_list: version = ", jNode
->version
);
1408 putLabeledWord("\tbuild_list: isize = ", jNode
->isize
);
1409 putLabeledWord("\tbuild_list: atime = ", jNode
->atime
);
1410 putLabeledWord("\tbuild_list: offset = ", jNode
->offset
);
1411 putLabeledWord("\tbuild_list: csize = ", jNode
->csize
);
1412 putLabeledWord("\tbuild_list: dsize = ", jNode
->dsize
);
1413 putLabeledWord("\tbuild_list: compr = ", jNode
->compr
);
1414 putLabeledWord("\tbuild_list: usercompr = ", jNode
->usercompr
);
1415 putLabeledWord("\tbuild_list: flags = ", jNode
->flags
);
1416 putLabeledWord("\tbuild_list: offset = ", b
->offset
); /* FIXME: ? [RS] */
1422 #ifdef DEBUG_DIRENTS
1424 dump_dirents(struct b_lists
*pL
)
1427 struct jffs2_raw_dirent
*jDir
;
1429 putstr("\r\n\r\n******The directory Entries******\r\n");
1430 b
= pL
->dir
.listHead
;
1432 jDir
= (struct jffs2_raw_dirent
*) get_node_mem(b
->offset
,
1435 putnstr(jDir
->name
, jDir
->nsize
);
1436 putLabeledWord("\r\n\tbuild_list: magic = ", jDir
->magic
);
1437 putLabeledWord("\tbuild_list: nodetype = ", jDir
->nodetype
);
1438 putLabeledWord("\tbuild_list: hdr_crc = ", jDir
->hdr_crc
);
1439 putLabeledWord("\tbuild_list: pino = ", jDir
->pino
);
1440 putLabeledWord("\tbuild_list: version = ", jDir
->version
);
1441 putLabeledWord("\tbuild_list: ino = ", jDir
->ino
);
1442 putLabeledWord("\tbuild_list: mctime = ", jDir
->mctime
);
1443 putLabeledWord("\tbuild_list: nsize = ", jDir
->nsize
);
1444 putLabeledWord("\tbuild_list: type = ", jDir
->type
);
1445 putLabeledWord("\tbuild_list: node_crc = ", jDir
->node_crc
);
1446 putLabeledWord("\tbuild_list: name_crc = ", jDir
->name_crc
);
1447 putLabeledWord("\tbuild_list: offset = ", b
->offset
); /* FIXME: ? [RS] */
1449 put_fl_mem(jDir
, pL
->readbuf
);
1454 #define DEFAULT_EMPTY_SCAN_SIZE 256
1456 static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size
)
1458 if (sector_size
< DEFAULT_EMPTY_SCAN_SIZE
)
1461 return DEFAULT_EMPTY_SCAN_SIZE
;
1465 jffs2_1pass_build_lists(struct part_info
* part
)
1468 struct jffs2_unknown_node
*node
;
1478 nr_sectors
= lldiv(part
->size
, part
->sector_size
);
1479 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1480 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1481 /* only about 5 %. not enough to inconvenience people for. */
1484 /* if we are building a list we need to refresh the cache. */
1485 jffs_init_1pass_list(part
);
1486 pL
= (struct b_lists
*)part
->jffs2_priv
;
1487 buf
= malloc(DEFAULT_EMPTY_SCAN_SIZE
);
1488 puts ("Scanning JFFS2 FS: ");
1490 /* start at the beginning of the partition */
1491 for (i
= 0; i
< nr_sectors
; i
++) {
1492 uint32_t sector_ofs
= i
* part
->sector_size
;
1493 uint32_t buf_ofs
= sector_ofs
;
1495 uint32_t ofs
, prevofs
;
1496 #ifdef CONFIG_JFFS2_SUMMARY
1497 struct jffs2_sum_marker
*sm
;
1498 void *sumptr
= NULL
;
1502 /* Indicates a sector with a CLEANMARKER was found */
1503 int clean_sector
= 0;
1505 /* Set buf_size to maximum length */
1506 buf_size
= DEFAULT_EMPTY_SCAN_SIZE
;
1509 #ifdef CONFIG_JFFS2_SUMMARY
1510 buf_len
= sizeof(*sm
);
1512 /* Read as much as we want into the _end_ of the preallocated
1515 get_fl_mem(part
->offset
+ sector_ofs
+ part
->sector_size
-
1516 buf_len
, buf_len
, buf
+ buf_size
- buf_len
);
1518 sm
= (void *)buf
+ buf_size
- sizeof(*sm
);
1519 if (sm
->magic
== JFFS2_SUM_MAGIC
) {
1520 sumlen
= part
->sector_size
- sm
->offset
;
1521 sumptr
= buf
+ buf_size
- sumlen
;
1523 /* Now, make sure the summary itself is available */
1524 if (sumlen
> buf_size
) {
1525 /* Need to kmalloc for this. */
1526 sumptr
= malloc(sumlen
);
1528 putstr("Can't get memory for summary "
1531 jffs2_free_cache(part
);
1534 memcpy(sumptr
+ sumlen
- buf_len
, buf
+
1535 buf_size
- buf_len
, buf_len
);
1537 if (buf_len
< sumlen
) {
1538 /* Need to read more so that the entire summary
1541 get_fl_mem(part
->offset
+ sector_ofs
+
1542 part
->sector_size
- sumlen
,
1543 sumlen
- buf_len
, sumptr
);
1548 ret
= jffs2_sum_scan_sumnode(part
, sector_ofs
, sumptr
,
1551 if (buf_size
&& sumlen
> buf_size
)
1555 jffs2_free_cache(part
);
1562 #endif /* CONFIG_JFFS2_SUMMARY */
1564 buf_len
= EMPTY_SCAN_SIZE(part
->sector_size
);
1566 get_fl_mem((u32
)part
->offset
+ buf_ofs
, buf_len
, buf
);
1568 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
1571 /* Scan only 4KiB of 0xFF before declaring it's empty */
1572 while (ofs
< EMPTY_SCAN_SIZE(part
->sector_size
) &&
1573 *(uint32_t *)(&buf
[ofs
]) == 0xFFFFFFFF)
1576 if (ofs
== EMPTY_SCAN_SIZE(part
->sector_size
))
1582 * Set buf_size down to the minimum size required.
1583 * This prevents reading in chunks of flash data unnecessarily.
1585 buf_size
= sizeof(union jffs2_node_union
);
1588 while (ofs
< sector_ofs
+ part
->sector_size
) {
1589 if (ofs
== prevofs
) {
1590 printf("offset %08x already seen, skip\n", ofs
);
1596 if (sector_ofs
+ part
->sector_size
<
1597 ofs
+ sizeof(*node
))
1599 if (buf_ofs
+ buf_len
< ofs
+ sizeof(*node
)) {
1600 buf_len
= min_t(uint32_t, buf_size
, sector_ofs
1601 + part
->sector_size
- ofs
);
1602 get_fl_mem((u32
)part
->offset
+ ofs
, buf_len
,
1607 node
= (struct jffs2_unknown_node
*)&buf
[ofs
-buf_ofs
];
1609 if (*(uint32_t *)(&buf
[ofs
-buf_ofs
]) == 0xffffffff) {
1614 scan_end
= min_t(uint32_t, EMPTY_SCAN_SIZE(
1615 part
->sector_size
)/8,
1618 inbuf_ofs
= ofs
- buf_ofs
;
1619 while (inbuf_ofs
< scan_end
) {
1620 if (*(uint32_t *)(&buf
[inbuf_ofs
]) !=
1629 * If this sector had a clean marker at the
1630 * beginning, and immediately following this
1631 * have been a bunch of FF bytes, treat the
1632 * entire sector as empty.
1637 /* See how much more there is to read in this
1640 buf_len
= min_t(uint32_t, buf_size
,
1642 part
->sector_size
- ofs
);
1644 /* No more to read. Break out of main
1645 * loop without marking this range of
1646 * empty space as dirty (because it's
1652 get_fl_mem((u32
)part
->offset
+ ofs
, buf_len
,
1658 * Found something not erased in the sector, so reset
1659 * the 'clean_sector' flag.
1662 if (node
->magic
!= JFFS2_MAGIC_BITMASK
||
1668 if (ofs
+ node
->totlen
>
1669 sector_ofs
+ part
->sector_size
) {
1674 /* if its a fragment add it */
1675 switch (node
->nodetype
) {
1676 case JFFS2_NODETYPE_INODE
:
1677 if (buf_ofs
+ buf_len
< ofs
+ sizeof(struct
1679 buf_len
= min_t(uint32_t,
1680 sizeof(struct jffs2_raw_inode
),
1684 get_fl_mem((u32
)part
->offset
+ ofs
,
1689 if (!inode_crc((struct jffs2_raw_inode
*)node
))
1692 if (insert_node(&pL
->frag
, (u32
) part
->offset
+
1695 jffs2_free_cache(part
);
1698 if (max_totlen
< node
->totlen
)
1699 max_totlen
= node
->totlen
;
1701 case JFFS2_NODETYPE_DIRENT
:
1702 if (buf_ofs
+ buf_len
< ofs
+ sizeof(struct
1707 buf_len
= min_t(uint32_t,
1712 get_fl_mem((u32
)part
->offset
+ ofs
,
1718 if (!dirent_crc((struct jffs2_raw_dirent
*)
1725 if (! (counterN
%100))
1727 if (insert_node(&pL
->dir
, (u32
) part
->offset
+
1730 jffs2_free_cache(part
);
1733 if (max_totlen
< node
->totlen
)
1734 max_totlen
= node
->totlen
;
1737 case JFFS2_NODETYPE_CLEANMARKER
:
1738 if (node
->totlen
!= sizeof(struct jffs2_unknown_node
))
1739 printf("OOPS Cleanmarker has bad size "
1742 sizeof(struct jffs2_unknown_node
));
1743 if ((node
->totlen
==
1744 sizeof(struct jffs2_unknown_node
)) &&
1745 (ofs
== sector_ofs
)) {
1747 * Found a CLEANMARKER at the beginning
1748 * of the sector. It's in the correct
1749 * place with correct size and CRC.
1754 case JFFS2_NODETYPE_PADDING
:
1755 if (node
->totlen
< sizeof(struct jffs2_unknown_node
))
1756 printf("OOPS Padding has bad size "
1759 sizeof(struct jffs2_unknown_node
));
1761 case JFFS2_NODETYPE_SUMMARY
:
1764 printf("Unknown node type: %x len %d offset 0x%x\n",
1768 ofs
+= ((node
->totlen
+ 3) & ~3);
1774 #if defined(CONFIG_SYS_JFFS2_SORT_FRAGMENTS)
1778 sort_list(&pL
->frag
);
1779 sort_list(&pL
->dir
);
1781 putstr("\b\b done.\r\n"); /* close off the dots */
1783 /* We don't care if malloc failed - then each read operation will
1784 * allocate its own buffer as necessary (NAND) or will read directly
1787 pL
->readbuf
= malloc(max_totlen
);
1789 /* turn the lcd back on. */
1793 putLabeledWord("dir entries = ", pL
->dir
.listCount
);
1794 putLabeledWord("frag entries = ", pL
->frag
.listCount
);
1795 putLabeledWord("+4 increments = ", counter4
);
1796 putLabeledWord("+file_offset increments = ", counterF
);
1800 #ifdef DEBUG_DIRENTS
1804 #ifdef DEBUG_FRAGMENTS
1808 /* give visual feedback that we are done scanning the flash */
1809 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1815 jffs2_1pass_fill_info(struct b_lists
* pL
, struct b_jffs2_info
* piL
)
1818 struct jffs2_raw_inode ojNode
;
1819 struct jffs2_raw_inode
*jNode
;
1822 for (i
= 0; i
< JFFS2_NUM_COMPR
; i
++) {
1823 piL
->compr_info
[i
].num_frags
= 0;
1824 piL
->compr_info
[i
].compr_sum
= 0;
1825 piL
->compr_info
[i
].decompr_sum
= 0;
1828 b
= pL
->frag
.listHead
;
1830 jNode
= (struct jffs2_raw_inode
*) get_fl_mem(b
->offset
,
1831 sizeof(ojNode
), &ojNode
);
1832 if (jNode
->compr
< JFFS2_NUM_COMPR
) {
1833 piL
->compr_info
[jNode
->compr
].num_frags
++;
1834 piL
->compr_info
[jNode
->compr
].compr_sum
+= jNode
->csize
;
1835 piL
->compr_info
[jNode
->compr
].decompr_sum
+= jNode
->dsize
;
1843 static struct b_lists
*
1844 jffs2_get_list(struct part_info
* part
, const char *who
)
1846 /* copy requested part_info struct pointer to global location */
1847 current_part
= part
;
1849 if (jffs2_1pass_rescan_needed(part
)) {
1850 if (!jffs2_1pass_build_lists(part
)) {
1851 printf("%s: Failed to scan JFFSv2 file structure\n", who
);
1855 return (struct b_lists
*)part
->jffs2_priv
;
1859 /* Print directory / file contents */
1861 jffs2_1pass_ls(struct part_info
* part
, const char *fname
)
1867 if (! (pl
= jffs2_get_list(part
, "ls")))
1870 if (! (inode
= jffs2_1pass_search_list_inodes(pl
, fname
, 1))) {
1871 putstr("ls: Failed to scan jffs2 file structure\r\n");
1877 putLabeledWord("found file at inode = ", inode
);
1878 putLabeledWord("read_inode returns = ", ret
);
1885 /* Load a file from flash into memory. fname can be a full path */
1887 jffs2_1pass_load(char *dest
, struct part_info
* part
, const char *fname
)
1894 if (! (pl
= jffs2_get_list(part
, "load")))
1897 if (! (inode
= jffs2_1pass_search_inode(pl
, fname
, 1))) {
1898 putstr("load: Failed to find inode\r\n");
1902 /* Resolve symlinks */
1903 if (! (inode
= jffs2_1pass_resolve_inode(pl
, inode
))) {
1904 putstr("load: Failed to resolve inode structure\r\n");
1908 if ((ret
= jffs2_1pass_read_inode(pl
, inode
, dest
)) < 0) {
1909 putstr("load: Failed to read inode\r\n");
1913 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname
,
1914 (unsigned long) dest
, ret
);
1918 /* Return information about the fs on this partition */
1920 jffs2_1pass_info(struct part_info
* part
)
1922 struct b_jffs2_info info
;
1926 if (! (pl
= jffs2_get_list(part
, "info")))
1929 jffs2_1pass_fill_info(pl
, &info
);
1930 for (i
= 0; i
< JFFS2_NUM_COMPR
; i
++) {
1931 printf ("Compression: %s\n"
1932 "\tfrag count: %d\n"
1933 "\tcompressed sum: %d\n"
1934 "\tuncompressed sum: %d\n",
1936 info
.compr_info
[i
].num_frags
,
1937 info
.compr_info
[i
].compr_sum
,
1938 info
.compr_info
[i
].decompr_sum
);