blob: 6bf1943958246f66e1d258887810afa01d084cf3 [file] [log] [blame]
wdenkfe8c2802002-11-03 00:38:21 +00001/*
2-------------------------------------------------------------------------
3 * Filename: jffs2.c
4 * Version: $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $
5 * Copyright: Copyright (C) 2001, Russ Dill
6 * Author: Russ Dill <Russ.Dill@asu.edu>
7 * Description: Module to load kernel from jffs2
8 *-----------------------------------------------------------------------*/
9/*
10 * some portions of this code are taken from jffs2, and as such, the
11 * following copyright notice is included.
12 *
13 * JFFS2 -- Journalling Flash File System, Version 2.
14 *
15 * Copyright (C) 2001 Red Hat, Inc.
16 *
17 * Created by David Woodhouse <dwmw2@cambridge.redhat.com>
18 *
19 * The original JFFS, from which the design for JFFS2 was derived,
20 * was designed and implemented by Axis Communications AB.
21 *
22 * The contents of this file are subject to the Red Hat eCos Public
23 * License Version 1.1 (the "Licence"); you may not use this file
24 * except in compliance with the Licence. You may obtain a copy of
25 * the Licence at http://www.redhat.com/
26 *
27 * Software distributed under the Licence is distributed on an "AS IS"
28 * basis, WITHOUT WARRANTY OF ANY KIND, either express or implied.
29 * See the Licence for the specific language governing rights and
30 * limitations under the Licence.
31 *
32 * The Original Code is JFFS2 - Journalling Flash File System, version 2
33 *
34 * Alternatively, the contents of this file may be used under the
35 * terms of the GNU General Public License version 2 (the "GPL"), in
36 * which case the provisions of the GPL are applicable instead of the
37 * above. If you wish to allow the use of your version of this file
38 * only under the terms of the GPL and not to allow others to use your
39 * version of this file under the RHEPL, indicate your decision by
40 * deleting the provisions above and replace them with the notice and
41 * other provisions required by the GPL. If you do not delete the
42 * provisions above, a recipient may use your version of this file
43 * under either the RHEPL or the GPL.
44 *
45 * $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $
46 *
47 */
48
49/* Ok, so anyone who knows the jffs2 code will probably want to get a papar
50 * bag to throw up into before reading this code. I looked through the jffs2
51 * code, the caching scheme is very elegant. I tried to keep the version
52 * for a bootloader as small and simple as possible. Instead of worring about
53 * unneccesary data copies, node scans, etc, I just optimized for the known
54 * common case, a kernel, which looks like:
Wolfgang Denk53677ef2008-05-20 16:00:29 +020055 * (1) most pages are 4096 bytes
wdenkfe8c2802002-11-03 00:38:21 +000056 * (2) version numbers are somewhat sorted in acsending order
57 * (3) multiple compressed blocks making up one page is uncommon
58 *
59 * So I create a linked list of decending version numbers (insertions at the
60 * head), and then for each page, walk down the list, until a matching page
61 * with 4096 bytes is found, and then decompress the watching pages in
62 * reverse order.
63 *
64 */
65
66/*
67 * Adapted by Nye Liu <nyet@zumanetworks.com> and
68 * Rex Feany <rfeany@zumanetworks.com>
69 * on Jan/2002 for U-Boot.
70 *
71 * Clipped out all the non-1pass functions, cleaned up warnings,
72 * wrappers, etc. No major changes to the code.
73 * Please, he really means it when he said have a paper bag
74 * handy. We needed it ;).
75 *
76 */
77
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 *
Jean-Christophe PLAGNIOL-VILLARD6d0f6bc2008-10-16 15:01:15 +020095 * The fragment sorting feature must be enabled by CONFIG_SYS_JFFS2_SORT_FRAGMENTS.
wdenk06d01db2003-03-14 20:47:52 +000096 * Sorting is done while adding fragments to the lists, which is more or less a
97 * bubble sort. This takes a lot of time, and is most probably not an issue if
98 * the boot filesystem is always mounted readonly.
99 *
100 * You should define it if the boot filesystem is mounted writable, and updates
101 * to the boot files are done by copying files to that filesystem.
102 *
103 *
104 * There's a big issue left: endianess is completely ignored in this code. Duh!
105 *
106 *
107 * You still should have paper bags at hand :-(. The code lacks more or less
108 * any comment, and is still arcane and difficult to read in places. As this
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>
Tom Rini18e86722013-12-05 14:48:38 -0500117#include <div64.h>
Tom Rini1c8fdf82016-03-27 14:48:36 -0400118#include <linux/compiler.h>
wdenkfe8c2802002-11-03 00:38:21 +0000119#include <linux/stat.h>
120#include <linux/time.h>
Stuart Wood86d32732008-06-02 16:40:08 -0400121#include <watchdog.h>
wdenkfe8c2802002-11-03 00:38:21 +0000122#include <jffs2/jffs2.h>
123#include <jffs2/jffs2_1pass.h>
Mike Frysinger7b15e2b2012-04-09 13:39:55 +0000124#include <linux/compat.h>
Masahiro Yamada1221ce42016-09-21 11:28:55 +0900125#include <linux/errno.h>
wdenkfe8c2802002-11-03 00:38:21 +0000126
127#include "jffs2_private.h"
128
wdenkfe8c2802002-11-03 00:38:21 +0000129
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200130#define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */
131#define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */
wdenkfe8c2802002-11-03 00:38:21 +0000132
wdenk06d01db2003-03-14 20:47:52 +0000133/* Debugging switches */
134#undef DEBUG_DIRENTS /* print directory entry list after scan */
135#undef DEBUG_FRAGMENTS /* print fragment list after scan */
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200136#undef DEBUG /* enable debugging messages */
wdenk06d01db2003-03-14 20:47:52 +0000137
138
wdenkfe8c2802002-11-03 00:38:21 +0000139#ifdef DEBUG
140# define DEBUGF(fmt,args...) printf(fmt ,##args)
141#else
142# define DEBUGF(fmt,args...)
143#endif
144
Ilya Yanok9b707622008-11-13 19:49:35 +0300145#include "summary.h"
146
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200147/* keeps pointer to currentlu processed partition */
148static struct part_info *current_part;
wdenk998eaae2004-04-18 19:43:36 +0000149
Wolfgang Denke4dbe1b2007-07-05 17:56:27 +0200150#if (defined(CONFIG_JFFS2_NAND) && \
Jon Loeligerdd60d122007-07-09 17:56:50 -0500151 defined(CONFIG_CMD_NAND) )
Bartlomiej Siekaaddb2e12006-03-05 18:57:33 +0100152#include <nand.h>
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
wdenk998eaae2004-04-18 19:43:36 +0000163#define NAND_PAGE_SIZE 512
164#define NAND_PAGE_SHIFT 9
165#define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
166
167#ifndef NAND_CACHE_PAGES
168#define NAND_CACHE_PAGES 16
169#endif
170#define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
171
172static u8* nand_cache = NULL;
173static u32 nand_cache_off = (u32)-1;
wdenk998eaae2004-04-18 19:43:36 +0000174
175static int read_nand_cached(u32 off, u32 size, u_char *buf)
176{
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200177 struct mtdids *id = current_part->dev->id;
Grygorii Strashkoeb6a5c32017-06-26 19:12:57 -0500178 struct mtd_info *mtd;
wdenk998eaae2004-04-18 19:43:36 +0000179 u32 bytes_read = 0;
Marian Balakowicz6db39702006-04-08 19:08:06 +0200180 size_t retlen;
wdenk998eaae2004-04-18 19:43:36 +0000181 int cpy_bytes;
182
Grygorii Strashkoeb6a5c32017-06-26 19:12:57 -0500183 mtd = get_nand_dev_by_index(id->num);
184 if (!mtd)
185 return -1;
186
wdenk998eaae2004-04-18 19:43:36 +0000187 while (bytes_read < size) {
188 if ((off + bytes_read < nand_cache_off) ||
189 (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) {
190 nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
191 if (!nand_cache) {
192 /* This memory never gets freed but 'cause
193 it's a bootloader, nobody cares */
wdenk507bbe32004-04-18 21:13:41 +0000194 nand_cache = malloc(NAND_CACHE_SIZE);
195 if (!nand_cache) {
wdenk998eaae2004-04-18 19:43:36 +0000196 printf("read_nand_cached: can't alloc cache size %d bytes\n",
197 NAND_CACHE_SIZE);
198 return -1;
199 }
200 }
Bartlomiej Siekaaddb2e12006-03-05 18:57:33 +0100201
Marian Balakowicz6db39702006-04-08 19:08:06 +0200202 retlen = NAND_CACHE_SIZE;
Grygorii Strashkoeb6a5c32017-06-26 19:12:57 -0500203 if (nand_read(mtd, nand_cache_off,
Engling, Uwe41ba7f52017-10-10 14:20:55 +0000204 &retlen, nand_cache) < 0 ||
Marian Balakowicz6db39702006-04-08 19:08:06 +0200205 retlen != NAND_CACHE_SIZE) {
206 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
207 nand_cache_off, NAND_CACHE_SIZE);
208 return -1;
209 }
wdenk998eaae2004-04-18 19:43:36 +0000210 }
211 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
212 if (cpy_bytes > size - bytes_read)
213 cpy_bytes = size - bytes_read;
214 memcpy(buf + bytes_read,
215 nand_cache + off + bytes_read - nand_cache_off,
216 cpy_bytes);
217 bytes_read += cpy_bytes;
218 }
219 return bytes_read;
220}
221
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200222static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
wdenk998eaae2004-04-18 19:43:36 +0000223{
224 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
225
226 if (NULL == buf) {
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200227 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
wdenk998eaae2004-04-18 19:43:36 +0000228 return NULL;
229 }
230 if (read_nand_cached(off, size, buf) < 0) {
wdenk32877d62004-05-05 19:44:41 +0000231 if (!ext_buf)
232 free(buf);
wdenk998eaae2004-04-18 19:43:36 +0000233 return NULL;
234 }
235
236 return buf;
237}
238
Ilya Yanok70741002008-11-13 19:49:34 +0300239static void *get_node_mem_nand(u32 off, void *ext_buf)
wdenk998eaae2004-04-18 19:43:36 +0000240{
241 struct jffs2_unknown_node node;
242 void *ret = NULL;
243
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200244 if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
wdenk998eaae2004-04-18 19:43:36 +0000245 return NULL;
246
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200247 if (!(ret = get_fl_mem_nand(off, node.magic ==
wdenk998eaae2004-04-18 19:43:36 +0000248 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
Ilya Yanok70741002008-11-13 19:49:34 +0300249 ext_buf))) {
wdenk998eaae2004-04-18 19:43:36 +0000250 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
251 off, node.magic, node.nodetype, node.totlen);
252 }
253 return ret;
254}
255
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200256static void put_fl_mem_nand(void *buf)
wdenk998eaae2004-04-18 19:43:36 +0000257{
258 free(buf);
259}
Jon Loeligerdd60d122007-07-09 17:56:50 -0500260#endif
wdenk998eaae2004-04-18 19:43:36 +0000261
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900262#if defined(CONFIG_CMD_ONENAND)
263
264#include <linux/mtd/mtd.h>
265#include <linux/mtd/onenand.h>
266#include <onenand_uboot.h>
267
268#define ONENAND_PAGE_SIZE 2048
269#define ONENAND_PAGE_SHIFT 11
270#define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1))
271
272#ifndef ONENAND_CACHE_PAGES
273#define ONENAND_CACHE_PAGES 4
274#endif
275#define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE)
276
277static u8* onenand_cache;
278static u32 onenand_cache_off = (u32)-1;
279
280static int read_onenand_cached(u32 off, u32 size, u_char *buf)
281{
282 u32 bytes_read = 0;
283 size_t retlen;
284 int cpy_bytes;
285
286 while (bytes_read < size) {
287 if ((off + bytes_read < onenand_cache_off) ||
288 (off + bytes_read >= onenand_cache_off + ONENAND_CACHE_SIZE)) {
289 onenand_cache_off = (off + bytes_read) & ONENAND_PAGE_MASK;
290 if (!onenand_cache) {
291 /* This memory never gets freed but 'cause
292 it's a bootloader, nobody cares */
293 onenand_cache = malloc(ONENAND_CACHE_SIZE);
294 if (!onenand_cache) {
295 printf("read_onenand_cached: can't alloc cache size %d bytes\n",
296 ONENAND_CACHE_SIZE);
297 return -1;
298 }
299 }
300
301 retlen = ONENAND_CACHE_SIZE;
302 if (onenand_read(&onenand_mtd, onenand_cache_off, retlen,
Engling, Uwe41ba7f52017-10-10 14:20:55 +0000303 &retlen, onenand_cache) < 0 ||
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900304 retlen != ONENAND_CACHE_SIZE) {
305 printf("read_onenand_cached: error reading nand off %#x size %d bytes\n",
306 onenand_cache_off, ONENAND_CACHE_SIZE);
307 return -1;
308 }
309 }
310 cpy_bytes = onenand_cache_off + ONENAND_CACHE_SIZE - (off + bytes_read);
311 if (cpy_bytes > size - bytes_read)
312 cpy_bytes = size - bytes_read;
313 memcpy(buf + bytes_read,
314 onenand_cache + off + bytes_read - onenand_cache_off,
315 cpy_bytes);
316 bytes_read += cpy_bytes;
317 }
318 return bytes_read;
319}
320
321static void *get_fl_mem_onenand(u32 off, u32 size, void *ext_buf)
322{
323 u_char *buf = ext_buf ? (u_char *)ext_buf : (u_char *)malloc(size);
324
325 if (NULL == buf) {
326 printf("get_fl_mem_onenand: can't alloc %d bytes\n", size);
327 return NULL;
328 }
329 if (read_onenand_cached(off, size, buf) < 0) {
330 if (!ext_buf)
331 free(buf);
332 return NULL;
333 }
334
335 return buf;
336}
337
Ilya Yanok70741002008-11-13 19:49:34 +0300338static void *get_node_mem_onenand(u32 off, void *ext_buf)
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900339{
340 struct jffs2_unknown_node node;
341 void *ret = NULL;
342
343 if (NULL == get_fl_mem_onenand(off, sizeof(node), &node))
344 return NULL;
345
346 ret = get_fl_mem_onenand(off, node.magic ==
347 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
Ilya Yanok70741002008-11-13 19:49:34 +0300348 ext_buf);
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900349 if (!ret) {
350 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
351 off, node.magic, node.nodetype, node.totlen);
352 }
353 return ret;
354}
355
356
357static void put_fl_mem_onenand(void *buf)
358{
359 free(buf);
360}
361#endif
362
wdenk998eaae2004-04-18 19:43:36 +0000363
Jon Loeligerdd60d122007-07-09 17:56:50 -0500364#if defined(CONFIG_CMD_FLASH)
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200365/*
366 * Support for jffs2 on top of NOR-flash
367 *
368 * NOR flash memory is mapped in processor's address space,
369 * just return address.
370 */
Ilya Yanok70741002008-11-13 19:49:34 +0300371static inline void *get_fl_mem_nor(u32 off, u32 size, void *ext_buf)
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200372{
373 u32 addr = off;
374 struct mtdids *id = current_part->dev->id;
375
Marian Balakowicze6f2e902005-10-11 19:09:42 +0200376 extern flash_info_t flash_info[];
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200377 flash_info_t *flash = &flash_info[id->num];
378
379 addr += flash->start[0];
Ilya Yanok70741002008-11-13 19:49:34 +0300380 if (ext_buf) {
381 memcpy(ext_buf, (void *)addr, size);
382 return ext_buf;
383 }
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200384 return (void*)addr;
385}
386
Ilya Yanok70741002008-11-13 19:49:34 +0300387static inline void *get_node_mem_nor(u32 off, void *ext_buf)
Ilya Yanok8a36d312008-11-13 19:49:33 +0300388{
Ilya Yanok70741002008-11-13 19:49:34 +0300389 struct jffs2_unknown_node *pNode;
Ilya Yanok8a36d312008-11-13 19:49:33 +0300390
Ilya Yanok70741002008-11-13 19:49:34 +0300391 /* pNode will point directly to flash - don't provide external buffer
392 and don't care about size */
393 pNode = get_fl_mem_nor(off, 0, NULL);
394 return (void *)get_fl_mem_nor(off, pNode->magic == JFFS2_MAGIC_BITMASK ?
395 pNode->totlen : sizeof(*pNode), ext_buf);
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200396}
Jon Loeligerdd60d122007-07-09 17:56:50 -0500397#endif
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200398
399
400/*
Wolfgang Denk8f79e4c2005-08-10 15:14:32 +0200401 * Generic jffs2 raw memory and node read routines.
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200402 *
403 */
wdenk998eaae2004-04-18 19:43:36 +0000404static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
405{
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200406 struct mtdids *id = current_part->dev->id;
Wolfgang Denk8f79e4c2005-08-10 15:14:32 +0200407
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100408 switch(id->type) {
Jon Loeligerdd60d122007-07-09 17:56:50 -0500409#if defined(CONFIG_CMD_FLASH)
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100410 case MTD_DEV_TYPE_NOR:
Ilya Yanok70741002008-11-13 19:49:34 +0300411 return get_fl_mem_nor(off, size, ext_buf);
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100412 break;
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200413#endif
Jon Loeligerdd60d122007-07-09 17:56:50 -0500414#if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100415 case MTD_DEV_TYPE_NAND:
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200416 return get_fl_mem_nand(off, size, ext_buf);
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100417 break;
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200418#endif
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900419#if defined(CONFIG_CMD_ONENAND)
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100420 case MTD_DEV_TYPE_ONENAND:
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900421 return get_fl_mem_onenand(off, size, ext_buf);
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100422 break;
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900423#endif
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100424 default:
425 printf("get_fl_mem: unknown device type, " \
426 "using raw offset!\n");
427 }
wdenk998eaae2004-04-18 19:43:36 +0000428 return (void*)off;
429}
430
Ilya Yanok70741002008-11-13 19:49:34 +0300431static inline void *get_node_mem(u32 off, void *ext_buf)
wdenk998eaae2004-04-18 19:43:36 +0000432{
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200433 struct mtdids *id = current_part->dev->id;
Wolfgang Denk8f79e4c2005-08-10 15:14:32 +0200434
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100435 switch(id->type) {
Jon Loeligerdd60d122007-07-09 17:56:50 -0500436#if defined(CONFIG_CMD_FLASH)
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100437 case MTD_DEV_TYPE_NOR:
Ilya Yanok70741002008-11-13 19:49:34 +0300438 return get_node_mem_nor(off, ext_buf);
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100439 break;
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200440#endif
Wolfgang Denke4dbe1b2007-07-05 17:56:27 +0200441#if defined(CONFIG_JFFS2_NAND) && \
Jon Loeligerdd60d122007-07-09 17:56:50 -0500442 defined(CONFIG_CMD_NAND)
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100443 case MTD_DEV_TYPE_NAND:
Ilya Yanok70741002008-11-13 19:49:34 +0300444 return get_node_mem_nand(off, ext_buf);
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100445 break;
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200446#endif
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900447#if defined(CONFIG_CMD_ONENAND)
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100448 case MTD_DEV_TYPE_ONENAND:
Ilya Yanok70741002008-11-13 19:49:34 +0300449 return get_node_mem_onenand(off, ext_buf);
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100450 break;
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900451#endif
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100452 default:
453 printf("get_fl_mem: unknown device type, " \
454 "using raw offset!\n");
455 }
wdenk998eaae2004-04-18 19:43:36 +0000456 return (void*)off;
457}
458
Ilya Yanok70741002008-11-13 19:49:34 +0300459static inline void put_fl_mem(void *buf, void *ext_buf)
wdenk998eaae2004-04-18 19:43:36 +0000460{
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200461 struct mtdids *id = current_part->dev->id;
462
Ilya Yanok70741002008-11-13 19:49:34 +0300463 /* If buf is the same as ext_buf, it was provided by the caller -
464 we shouldn't free it then. */
465 if (buf == ext_buf)
466 return;
Scott Wood2f77c7f2008-10-31 13:51:12 -0500467 switch (id->type) {
468#if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
469 case MTD_DEV_TYPE_NAND:
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200470 return put_fl_mem_nand(buf);
471#endif
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900472#if defined(CONFIG_CMD_ONENAND)
Scott Wood2f77c7f2008-10-31 13:51:12 -0500473 case MTD_DEV_TYPE_ONENAND:
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900474 return put_fl_mem_onenand(buf);
475#endif
Scott Wood2f77c7f2008-10-31 13:51:12 -0500476 }
wdenk998eaae2004-04-18 19:43:36 +0000477}
478
wdenk06d01db2003-03-14 20:47:52 +0000479/* Compression names */
480static char *compr_names[] = {
481 "NONE",
482 "ZERO",
483 "RTIME",
484 "RUBINMIPS",
485 "COPY",
486 "DYNRUBIN",
wdenk07cc0992005-05-05 00:04:14 +0000487 "ZLIB",
Wolfgang Denkf0983372010-01-15 11:10:33 +0100488#if defined(CONFIG_JFFS2_LZO)
wdenk07cc0992005-05-05 00:04:14 +0000489 "LZO",
wdenk07cc0992005-05-05 00:04:14 +0000490#endif
wdenk06d01db2003-03-14 20:47:52 +0000491};
492
wdenk06d01db2003-03-14 20:47:52 +0000493/* Memory management */
494struct mem_block {
495 u32 index;
496 struct mem_block *next;
497 struct b_node nodes[NODE_CHUNK];
498};
499
500
501static void
502free_nodes(struct b_list *list)
503{
504 while (list->listMemBase != NULL) {
505 struct mem_block *next = list->listMemBase->next;
506 free( list->listMemBase );
507 list->listMemBase = next;
508 }
509}
wdenkfe8c2802002-11-03 00:38:21 +0000510
511static struct b_node *
wdenk06d01db2003-03-14 20:47:52 +0000512add_node(struct b_list *list)
wdenkfe8c2802002-11-03 00:38:21 +0000513{
wdenk06d01db2003-03-14 20:47:52 +0000514 u32 index = 0;
515 struct mem_block *memBase;
wdenkfe8c2802002-11-03 00:38:21 +0000516 struct b_node *b;
517
wdenk06d01db2003-03-14 20:47:52 +0000518 memBase = list->listMemBase;
519 if (memBase != NULL)
520 index = memBase->index;
wdenkfe8c2802002-11-03 00:38:21 +0000521#if 0
522 putLabeledWord("add_node: index = ", index);
wdenk06d01db2003-03-14 20:47:52 +0000523 putLabeledWord("add_node: memBase = ", list->listMemBase);
wdenkfe8c2802002-11-03 00:38:21 +0000524#endif
525
wdenk06d01db2003-03-14 20:47:52 +0000526 if (memBase == NULL || index >= NODE_CHUNK) {
527 /* we need more space before we continue */
528 memBase = mmalloc(sizeof(struct mem_block));
529 if (memBase == NULL) {
wdenkfe8c2802002-11-03 00:38:21 +0000530 putstr("add_node: malloc failed\n");
531 return NULL;
532 }
wdenk06d01db2003-03-14 20:47:52 +0000533 memBase->next = list->listMemBase;
534 index = 0;
wdenkfe8c2802002-11-03 00:38:21 +0000535#if 0
536 putLabeledWord("add_node: alloced a new membase at ", *memBase);
537#endif
538
539 }
540 /* now we have room to add it. */
wdenk06d01db2003-03-14 20:47:52 +0000541 b = &memBase->nodes[index];
542 index ++;
wdenkfe8c2802002-11-03 00:38:21 +0000543
wdenk06d01db2003-03-14 20:47:52 +0000544 memBase->index = index;
545 list->listMemBase = memBase;
546 list->listCount++;
wdenkfe8c2802002-11-03 00:38:21 +0000547 return b;
wdenkfe8c2802002-11-03 00:38:21 +0000548}
549
wdenk06d01db2003-03-14 20:47:52 +0000550static struct b_node *
551insert_node(struct b_list *list, u32 offset)
552{
553 struct b_node *new;
wdenk06d01db2003-03-14 20:47:52 +0000554
555 if (!(new = add_node(list))) {
556 putstr("add_node failed!\r\n");
557 return NULL;
558 }
559 new->offset = offset;
Mark Tomlinson10d3ac32015-07-01 16:38:29 +1200560 new->next = NULL;
wdenk06d01db2003-03-14 20:47:52 +0000561
Mark Tomlinson10d3ac32015-07-01 16:38:29 +1200562 if (list->listTail != NULL)
563 list->listTail->next = new;
wdenk06d01db2003-03-14 20:47:52 +0000564 else
Mark Tomlinson10d3ac32015-07-01 16:38:29 +1200565 list->listHead = new;
566 list->listTail = new;
wdenk06d01db2003-03-14 20:47:52 +0000567
568 return new;
569}
570
Jean-Christophe PLAGNIOL-VILLARD6d0f6bc2008-10-16 15:01:15 +0200571#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk7205e402003-09-10 22:30:53 +0000572/* Sort data entries with the latest version last, so that if there
573 * is overlapping data the latest version will be used.
574 */
wdenk06d01db2003-03-14 20:47:52 +0000575static int compare_inodes(struct b_node *new, struct b_node *old)
576{
Mark Tomlinson225cf4c2015-07-01 16:38:23 +1200577 /*
578 * Only read in the version info from flash, not the entire inode.
579 * This can make a big difference to speed if flash is slow.
580 */
581 u32 new_version;
582 u32 old_version;
583 get_fl_mem(new->offset + offsetof(struct jffs2_raw_inode, version),
584 sizeof(new_version), &new_version);
585 get_fl_mem(old->offset + offsetof(struct jffs2_raw_inode, version),
586 sizeof(old_version), &old_version);
wdenk06d01db2003-03-14 20:47:52 +0000587
Mark Tomlinson225cf4c2015-07-01 16:38:23 +1200588 return new_version > old_version;
wdenk06d01db2003-03-14 20:47:52 +0000589}
590
wdenk7205e402003-09-10 22:30:53 +0000591/* Sort directory entries so all entries in the same directory
592 * with the same name are grouped together, with the latest version
593 * last. This makes it easy to eliminate all but the latest version
594 * by marking the previous version dead by setting the inode to 0.
595 */
wdenk06d01db2003-03-14 20:47:52 +0000596static int compare_dirents(struct b_node *new, struct b_node *old)
597{
Mark Tomlinson225cf4c2015-07-01 16:38:23 +1200598 /*
599 * Using NULL as the buffer for NOR flash prevents the entire node
600 * being read. This makes most comparisons much quicker as only one
601 * or two entries from the node will be used most of the time.
602 */
603 struct jffs2_raw_dirent *jNew = get_node_mem(new->offset, NULL);
604 struct jffs2_raw_dirent *jOld = get_node_mem(old->offset, NULL);
wdenk7205e402003-09-10 22:30:53 +0000605 int cmp;
Mark Tomlinson225cf4c2015-07-01 16:38:23 +1200606 int ret;
wdenk06d01db2003-03-14 20:47:52 +0000607
Mark Tomlinson225cf4c2015-07-01 16:38:23 +1200608 if (jNew->pino != jOld->pino) {
609 /* ascending sort by pino */
610 ret = jNew->pino > jOld->pino;
611 } else if (jNew->nsize != jOld->nsize) {
612 /*
613 * pino is the same, so use ascending sort by nsize,
614 * so we don't do strncmp unless we really must.
wdenk7205e402003-09-10 22:30:53 +0000615 */
Mark Tomlinson225cf4c2015-07-01 16:38:23 +1200616 ret = jNew->nsize > jOld->nsize;
617 } else {
618 /*
619 * length is also the same, so use ascending sort by name
620 */
621 cmp = strncmp((char *)jNew->name, (char *)jOld->name,
622 jNew->nsize);
623 if (cmp != 0) {
624 ret = cmp > 0;
625 } else {
626 /*
627 * we have duplicate names in this directory,
628 * so use ascending sort by version
629 */
630 ret = jNew->version > jOld->version;
631 }
wdenk7205e402003-09-10 22:30:53 +0000632 }
Mark Tomlinson225cf4c2015-07-01 16:38:23 +1200633 put_fl_mem(jNew, NULL);
634 put_fl_mem(jOld, NULL);
wdenk42d1f032003-10-15 23:53:47 +0000635
Mark Tomlinson225cf4c2015-07-01 16:38:23 +1200636 return ret;
wdenk06d01db2003-03-14 20:47:52 +0000637}
638#endif
wdenkfe8c2802002-11-03 00:38:21 +0000639
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200640void
641jffs2_free_cache(struct part_info *part)
wdenkfe8c2802002-11-03 00:38:21 +0000642{
wdenk06d01db2003-03-14 20:47:52 +0000643 struct b_lists *pL;
wdenkfe8c2802002-11-03 00:38:21 +0000644
wdenk06d01db2003-03-14 20:47:52 +0000645 if (part->jffs2_priv != NULL) {
646 pL = (struct b_lists *)part->jffs2_priv;
647 free_nodes(&pL->frag);
648 free_nodes(&pL->dir);
Ilya Yanok70741002008-11-13 19:49:34 +0300649 free(pL->readbuf);
wdenk06d01db2003-03-14 20:47:52 +0000650 free(pL);
651 }
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200652}
653
654static u32
655jffs_init_1pass_list(struct part_info *part)
656{
657 struct b_lists *pL;
658
659 jffs2_free_cache(part);
660
wdenk06d01db2003-03-14 20:47:52 +0000661 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
662 pL = (struct b_lists *)part->jffs2_priv;
663
664 memset(pL, 0, sizeof(*pL));
Jean-Christophe PLAGNIOL-VILLARD6d0f6bc2008-10-16 15:01:15 +0200665#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk06d01db2003-03-14 20:47:52 +0000666 pL->dir.listCompare = compare_dirents;
667 pL->frag.listCompare = compare_inodes;
668#endif
wdenkfe8c2802002-11-03 00:38:21 +0000669 }
670 return 0;
671}
672
673/* find the inode from the slashless name given a parent */
674static long
675jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
676{
677 struct b_node *b;
678 struct jffs2_raw_inode *jNode;
wdenk06d01db2003-03-14 20:47:52 +0000679 u32 totalSize = 0;
wdenk7205e402003-09-10 22:30:53 +0000680 u32 latestVersion = 0;
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200681 uchar *lDest;
682 uchar *src;
wdenkfe8c2802002-11-03 00:38:21 +0000683 int i;
684 u32 counter = 0;
Jean-Christophe PLAGNIOL-VILLARD6d0f6bc2008-10-16 15:01:15 +0200685#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk7205e402003-09-10 22:30:53 +0000686 /* Find file size before loading any data, so fragments that
687 * start past the end of file can be ignored. A fragment
688 * that is partially in the file is loaded, so extra data may
689 * be loaded up to the next 4K boundary above the file size.
690 * This shouldn't cause trouble when loading kernel images, so
691 * we will live with it.
692 */
693 for (b = pL->frag.listHead; b != NULL; b = b->next) {
wdenk507bbe32004-04-18 21:13:41 +0000694 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
Ilya Yanok70741002008-11-13 19:49:34 +0300695 sizeof(struct jffs2_raw_inode), pL->readbuf);
wdenk7205e402003-09-10 22:30:53 +0000696 if ((inode == jNode->ino)) {
697 /* get actual file length from the newest node */
698 if (jNode->version >= latestVersion) {
699 totalSize = jNode->isize;
700 latestVersion = jNode->version;
701 }
702 }
Ilya Yanok70741002008-11-13 19:49:34 +0300703 put_fl_mem(jNode, pL->readbuf);
wdenk7205e402003-09-10 22:30:53 +0000704 }
Mark Tomlinson3799b3f2015-07-01 16:38:22 +1200705 /*
706 * If no destination is provided, we are done.
707 * Just return the total size.
708 */
709 if (!dest)
710 return totalSize;
wdenk7205e402003-09-10 22:30:53 +0000711#endif
wdenkfe8c2802002-11-03 00:38:21 +0000712
wdenk06d01db2003-03-14 20:47:52 +0000713 for (b = pL->frag.listHead; b != NULL; b = b->next) {
Mark Tomlinson2d6d93a2015-07-01 16:38:25 +1200714 /*
715 * Copy just the node and not the data at this point,
716 * since we don't yet know if we need this data.
717 */
718 jNode = (struct jffs2_raw_inode *)get_fl_mem(b->offset,
719 sizeof(struct jffs2_raw_inode),
720 pL->readbuf);
Jeroen Hofstee46f46fd2014-06-11 00:40:25 +0200721 if (inode == jNode->ino) {
wdenk06d01db2003-03-14 20:47:52 +0000722#if 0
wdenkfe8c2802002-11-03 00:38:21 +0000723 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
724 putLabeledWord("read_inode: inode = ", jNode->ino);
725 putLabeledWord("read_inode: version = ", jNode->version);
726 putLabeledWord("read_inode: isize = ", jNode->isize);
727 putLabeledWord("read_inode: offset = ", jNode->offset);
728 putLabeledWord("read_inode: csize = ", jNode->csize);
729 putLabeledWord("read_inode: dsize = ", jNode->dsize);
730 putLabeledWord("read_inode: compr = ", jNode->compr);
731 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
732 putLabeledWord("read_inode: flags = ", jNode->flags);
wdenkfe8c2802002-11-03 00:38:21 +0000733#endif
wdenk7205e402003-09-10 22:30:53 +0000734
Jean-Christophe PLAGNIOL-VILLARD6d0f6bc2008-10-16 15:01:15 +0200735#ifndef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk06d01db2003-03-14 20:47:52 +0000736 /* get actual file length from the newest node */
737 if (jNode->version >= latestVersion) {
wdenkfe8c2802002-11-03 00:38:21 +0000738 totalSize = jNode->isize;
wdenk06d01db2003-03-14 20:47:52 +0000739 latestVersion = jNode->version;
wdenkfe8c2802002-11-03 00:38:21 +0000740 }
wdenk7205e402003-09-10 22:30:53 +0000741#endif
wdenkfe8c2802002-11-03 00:38:21 +0000742
743 if(dest) {
Mark Tomlinson2d6d93a2015-07-01 16:38:25 +1200744 /*
745 * Now that the inode has been checked,
746 * read the entire inode, including data.
747 */
748 put_fl_mem(jNode, pL->readbuf);
749 jNode = (struct jffs2_raw_inode *)
750 get_node_mem(b->offset, pL->readbuf);
751 src = ((uchar *)jNode) +
752 sizeof(struct jffs2_raw_inode);
wdenk06d01db2003-03-14 20:47:52 +0000753 /* ignore data behind latest known EOF */
wdenk998eaae2004-04-18 19:43:36 +0000754 if (jNode->offset > totalSize) {
Ilya Yanok70741002008-11-13 19:49:34 +0300755 put_fl_mem(jNode, pL->readbuf);
wdenk06d01db2003-03-14 20:47:52 +0000756 continue;
wdenk998eaae2004-04-18 19:43:36 +0000757 }
Ilya Yanok142a80f2008-11-13 19:49:36 +0300758 if (b->datacrc == CRC_UNKNOWN)
759 b->datacrc = data_crc(jNode) ?
760 CRC_OK : CRC_BAD;
761 if (b->datacrc == CRC_BAD) {
Ilya Yanok70741002008-11-13 19:49:34 +0300762 put_fl_mem(jNode, pL->readbuf);
Ilya Yanok8a36d312008-11-13 19:49:33 +0300763 continue;
764 }
wdenk06d01db2003-03-14 20:47:52 +0000765
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200766 lDest = (uchar *) (dest + jNode->offset);
wdenkfe8c2802002-11-03 00:38:21 +0000767#if 0
wdenk06d01db2003-03-14 20:47:52 +0000768 putLabeledWord("read_inode: src = ", src);
wdenkfe8c2802002-11-03 00:38:21 +0000769 putLabeledWord("read_inode: dest = ", lDest);
wdenkfe8c2802002-11-03 00:38:21 +0000770#endif
771 switch (jNode->compr) {
772 case JFFS2_COMPR_NONE:
Wolfgang Denk16b9afd2011-10-05 22:58:11 +0200773 ldr_memcpy(lDest, src, jNode->dsize);
wdenkfe8c2802002-11-03 00:38:21 +0000774 break;
775 case JFFS2_COMPR_ZERO:
wdenkfe8c2802002-11-03 00:38:21 +0000776 for (i = 0; i < jNode->dsize; i++)
777 *(lDest++) = 0;
778 break;
779 case JFFS2_COMPR_RTIME:
wdenkfe8c2802002-11-03 00:38:21 +0000780 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
781 break;
782 case JFFS2_COMPR_DYNRUBIN:
783 /* this is slow but it works */
wdenkfe8c2802002-11-03 00:38:21 +0000784 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
785 break;
786 case JFFS2_COMPR_ZLIB:
Wolfgang Denk16b9afd2011-10-05 22:58:11 +0200787 zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
wdenkfe8c2802002-11-03 00:38:21 +0000788 break;
Wolfgang Denkf0983372010-01-15 11:10:33 +0100789#if defined(CONFIG_JFFS2_LZO)
wdenk07cc0992005-05-05 00:04:14 +0000790 case JFFS2_COMPR_LZO:
Wolfgang Denk16b9afd2011-10-05 22:58:11 +0200791 lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
wdenk07cc0992005-05-05 00:04:14 +0000792 break;
793#endif
wdenkfe8c2802002-11-03 00:38:21 +0000794 default:
795 /* unknown */
Loïc Minier6052cba2011-02-03 22:04:26 +0100796 putLabeledWord("UNKNOWN COMPRESSION METHOD = ", jNode->compr);
Ilya Yanok70741002008-11-13 19:49:34 +0300797 put_fl_mem(jNode, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +0000798 return -1;
799 break;
800 }
801 }
802
wdenkfe8c2802002-11-03 00:38:21 +0000803#if 0
wdenkfe8c2802002-11-03 00:38:21 +0000804 putLabeledWord("read_inode: totalSize = ", totalSize);
wdenkfe8c2802002-11-03 00:38:21 +0000805#endif
806 }
wdenkfe8c2802002-11-03 00:38:21 +0000807 counter++;
Ilya Yanok70741002008-11-13 19:49:34 +0300808 put_fl_mem(jNode, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +0000809 }
wdenkfe8c2802002-11-03 00:38:21 +0000810
811#if 0
wdenk06d01db2003-03-14 20:47:52 +0000812 putLabeledWord("read_inode: returning = ", totalSize);
wdenkfe8c2802002-11-03 00:38:21 +0000813#endif
wdenk06d01db2003-03-14 20:47:52 +0000814 return totalSize;
wdenkfe8c2802002-11-03 00:38:21 +0000815}
816
817/* find the inode from the slashless name given a parent */
818static u32
819jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
820{
821 struct b_node *b;
822 struct jffs2_raw_dirent *jDir;
823 int len;
824 u32 counter;
825 u32 version = 0;
826 u32 inode = 0;
827
828 /* name is assumed slash free */
829 len = strlen(name);
830
831 counter = 0;
832 /* we need to search all and return the inode with the highest version */
wdenk06d01db2003-03-14 20:47:52 +0000833 for(b = pL->dir.listHead; b; b = b->next, counter++) {
Ilya Yanok70741002008-11-13 19:49:34 +0300834 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
835 pL->readbuf);
wdenk06d01db2003-03-14 20:47:52 +0000836 if ((pino == jDir->pino) && (len == jDir->nsize) &&
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200837 (!strncmp((char *)jDir->name, name, len))) { /* a match */
wdenk998eaae2004-04-18 19:43:36 +0000838 if (jDir->version < version) {
Ilya Yanok70741002008-11-13 19:49:34 +0300839 put_fl_mem(jDir, pL->readbuf);
wdenk7205e402003-09-10 22:30:53 +0000840 continue;
wdenk998eaae2004-04-18 19:43:36 +0000841 }
wdenkfe8c2802002-11-03 00:38:21 +0000842
wdenk7205e402003-09-10 22:30:53 +0000843 if (jDir->version == version && inode != 0) {
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200844 /* I'm pretty sure this isn't legal */
wdenkfe8c2802002-11-03 00:38:21 +0000845 putstr(" ** ERROR ** ");
846 putnstr(jDir->name, jDir->nsize);
847 putLabeledWord(" has dup version =", version);
848 }
849 inode = jDir->ino;
850 version = jDir->version;
851 }
852#if 0
853 putstr("\r\nfind_inode:p&l ->");
854 putnstr(jDir->name, jDir->nsize);
855 putstr("\r\n");
856 putLabeledWord("pino = ", jDir->pino);
857 putLabeledWord("nsize = ", jDir->nsize);
858 putLabeledWord("b = ", (u32) b);
859 putLabeledWord("counter = ", counter);
860#endif
Ilya Yanok70741002008-11-13 19:49:34 +0300861 put_fl_mem(jDir, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +0000862 }
863 return inode;
864}
865
wdenk180d3f72004-01-04 16:28:35 +0000866char *mkmodestr(unsigned long mode, char *str)
wdenkfe8c2802002-11-03 00:38:21 +0000867{
wdenk06d01db2003-03-14 20:47:52 +0000868 static const char *l = "xwr";
869 int mask = 1, i;
870 char c;
wdenkfe8c2802002-11-03 00:38:21 +0000871
wdenk06d01db2003-03-14 20:47:52 +0000872 switch (mode & S_IFMT) {
873 case S_IFDIR: str[0] = 'd'; break;
874 case S_IFBLK: str[0] = 'b'; break;
875 case S_IFCHR: str[0] = 'c'; break;
876 case S_IFIFO: str[0] = 'f'; break;
877 case S_IFLNK: str[0] = 'l'; break;
878 case S_IFSOCK: str[0] = 's'; break;
879 case S_IFREG: str[0] = '-'; break;
880 default: str[0] = '?';
881 }
wdenkfe8c2802002-11-03 00:38:21 +0000882
wdenk06d01db2003-03-14 20:47:52 +0000883 for(i = 0; i < 9; i++) {
884 c = l[i%3];
885 str[9-i] = (mode & mask)?c:'-';
886 mask = mask<<1;
887 }
wdenkfe8c2802002-11-03 00:38:21 +0000888
wdenk06d01db2003-03-14 20:47:52 +0000889 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
890 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
891 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
892 str[10] = '\0';
893 return str;
wdenkfe8c2802002-11-03 00:38:21 +0000894}
895
896static inline void dump_stat(struct stat *st, const char *name)
897{
wdenk06d01db2003-03-14 20:47:52 +0000898 char str[20];
899 char s[64], *p;
wdenkfe8c2802002-11-03 00:38:21 +0000900
wdenk06d01db2003-03-14 20:47:52 +0000901 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
902 st->st_mtime = 1;
wdenkfe8c2802002-11-03 00:38:21 +0000903
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200904 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
wdenkfe8c2802002-11-03 00:38:21 +0000905
wdenk06d01db2003-03-14 20:47:52 +0000906 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
907 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
wdenkfe8c2802002-11-03 00:38:21 +0000908
909/*
wdenk06d01db2003-03-14 20:47:52 +0000910 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
911 st->st_size, s, name);
wdenkfe8c2802002-11-03 00:38:21 +0000912*/
913
wdenk06d01db2003-03-14 20:47:52 +0000914 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
wdenkfe8c2802002-11-03 00:38:21 +0000915}
916
917static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
918{
919 char fname[256];
920 struct stat st;
921
922 if(!d || !i) return -1;
923
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200924 strncpy(fname, (char *)d->name, d->nsize);
wdenk06d01db2003-03-14 20:47:52 +0000925 fname[d->nsize] = '\0';
wdenkfe8c2802002-11-03 00:38:21 +0000926
927 memset(&st,0,sizeof(st));
928
wdenk06d01db2003-03-14 20:47:52 +0000929 st.st_mtime = i->mtime;
930 st.st_mode = i->mode;
931 st.st_ino = i->ino;
Ilya Yanokf7384692008-11-13 19:49:31 +0300932 st.st_size = i->isize;
wdenkfe8c2802002-11-03 00:38:21 +0000933
934 dump_stat(&st, fname);
935
936 if (d->type == DT_LNK) {
937 unsigned char *src = (unsigned char *) (&i[1]);
938 putstr(" -> ");
939 putnstr(src, (int)i->dsize);
940 }
941
942 putstr("\r\n");
943
944 return 0;
945}
946
947/* list inodes with the given pino */
948static u32
949jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
950{
951 struct b_node *b;
952 struct jffs2_raw_dirent *jDir;
953
wdenk06d01db2003-03-14 20:47:52 +0000954 for (b = pL->dir.listHead; b; b = b->next) {
Ilya Yanok70741002008-11-13 19:49:34 +0300955 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
956 pL->readbuf);
Mark Tomlinson891224a2015-07-01 16:38:24 +1200957 if (pino == jDir->pino) {
wdenk06d01db2003-03-14 20:47:52 +0000958 u32 i_version = 0;
959 struct jffs2_raw_inode *jNode, *i = NULL;
Mark Tomlinson891224a2015-07-01 16:38:24 +1200960 struct b_node *b2;
wdenkfe8c2802002-11-03 00:38:21 +0000961
Mark Tomlinson891224a2015-07-01 16:38:24 +1200962#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
963 /* Check for more recent versions of this file */
964 int match;
965 do {
966 struct b_node *next = b->next;
967 struct jffs2_raw_dirent *jDirNext;
968 if (!next)
969 break;
970 jDirNext = (struct jffs2_raw_dirent *)
971 get_node_mem(next->offset, NULL);
972 match = jDirNext->pino == jDir->pino &&
973 jDirNext->nsize == jDir->nsize &&
974 strncmp((char *)jDirNext->name,
975 (char *)jDir->name,
976 jDir->nsize) == 0;
977 if (match) {
978 /* Use next. It is more recent */
979 b = next;
980 /* Update buffer with the new info */
981 *jDir = *jDirNext;
982 }
983 put_fl_mem(jDirNext, NULL);
984 } while (match);
985#endif
986 if (jDir->ino == 0) {
987 /* Deleted file */
988 put_fl_mem(jDir, pL->readbuf);
989 continue;
990 }
991
992 for (b2 = pL->frag.listHead; b2; b2 = b2->next) {
wdenk998eaae2004-04-18 19:43:36 +0000993 jNode = (struct jffs2_raw_inode *)
Mark Tomlinson2d6d93a2015-07-01 16:38:25 +1200994 get_fl_mem(b2->offset, sizeof(*jNode),
995 NULL);
996 if (jNode->ino == jDir->ino &&
997 jNode->version >= i_version) {
Ilya Yanokf7384692008-11-13 19:49:31 +0300998 i_version = jNode->version;
wdenk32877d62004-05-05 19:44:41 +0000999 if (i)
Ilya Yanok70741002008-11-13 19:49:34 +03001000 put_fl_mem(i, NULL);
wdenkcf8bc572005-05-04 23:50:54 +00001001
1002 if (jDir->type == DT_LNK)
Ilya Yanok70741002008-11-13 19:49:34 +03001003 i = get_node_mem(b2->offset,
1004 NULL);
wdenkcf8bc572005-05-04 23:50:54 +00001005 else
Ilya Yanok70741002008-11-13 19:49:34 +03001006 i = get_fl_mem(b2->offset,
1007 sizeof(*i),
1008 NULL);
wdenk32877d62004-05-05 19:44:41 +00001009 }
Mark Tomlinson2d6d93a2015-07-01 16:38:25 +12001010 put_fl_mem(jNode, NULL);
wdenkfe8c2802002-11-03 00:38:21 +00001011 }
1012
1013 dump_inode(pL, jDir, i);
Ilya Yanok70741002008-11-13 19:49:34 +03001014 put_fl_mem(i, NULL);
wdenkfe8c2802002-11-03 00:38:21 +00001015 }
Ilya Yanok70741002008-11-13 19:49:34 +03001016 put_fl_mem(jDir, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +00001017 }
1018 return pino;
1019}
1020
1021static u32
1022jffs2_1pass_search_inode(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
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#if 0
1040 putstr("search_inode: tmp = ");
1041 putstr(tmp);
1042 putstr("\r\n");
1043 putstr("search_inode: wtmp = ");
1044 putstr(working_tmp);
1045 putstr("\r\n");
1046 putstr("search_inode: c = ");
1047 putstr(c);
1048 putstr("\r\n");
1049#endif
1050 for (i = 0; i < strlen(c) - 1; i++)
1051 tmp[i] = c[i + 1];
1052 tmp[i] = '\0';
1053#if 0
1054 putstr("search_inode: post tmp = ");
1055 putstr(tmp);
1056 putstr("\r\n");
1057#endif
1058
1059 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
1060 putstr("find_inode failed for name=");
1061 putstr(working_tmp);
1062 putstr("\r\n");
1063 return 0;
1064 }
1065 }
1066 /* this is for the bare filename, directories have already been mapped */
1067 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1068 putstr("find_inode failed for name=");
1069 putstr(tmp);
1070 putstr("\r\n");
1071 return 0;
1072 }
1073 return pino;
1074
1075}
1076
1077static u32
1078jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
1079{
1080 struct b_node *b;
1081 struct b_node *b2;
1082 struct jffs2_raw_dirent *jDir;
1083 struct jffs2_raw_inode *jNode;
wdenk998eaae2004-04-18 19:43:36 +00001084 u8 jDirFoundType = 0;
1085 u32 jDirFoundIno = 0;
1086 u32 jDirFoundPino = 0;
wdenkfe8c2802002-11-03 00:38:21 +00001087 char tmp[256];
1088 u32 version = 0;
1089 u32 pino;
1090 unsigned char *src;
1091
1092 /* we need to search all and return the inode with the highest version */
wdenk06d01db2003-03-14 20:47:52 +00001093 for(b = pL->dir.listHead; b; b = b->next) {
Ilya Yanok70741002008-11-13 19:49:34 +03001094 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1095 pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +00001096 if (ino == jDir->ino) {
Wolfgang Denk53677ef2008-05-20 16:00:29 +02001097 if (jDir->version < version) {
Ilya Yanok70741002008-11-13 19:49:34 +03001098 put_fl_mem(jDir, pL->readbuf);
wdenk7205e402003-09-10 22:30:53 +00001099 continue;
wdenk998eaae2004-04-18 19:43:36 +00001100 }
wdenkfe8c2802002-11-03 00:38:21 +00001101
wdenk998eaae2004-04-18 19:43:36 +00001102 if (jDir->version == version && jDirFoundType) {
Wolfgang Denk53677ef2008-05-20 16:00:29 +02001103 /* I'm pretty sure this isn't legal */
wdenkfe8c2802002-11-03 00:38:21 +00001104 putstr(" ** ERROR ** ");
1105 putnstr(jDir->name, jDir->nsize);
1106 putLabeledWord(" has dup version (resolve) = ",
1107 version);
1108 }
1109
wdenk998eaae2004-04-18 19:43:36 +00001110 jDirFoundType = jDir->type;
1111 jDirFoundIno = jDir->ino;
1112 jDirFoundPino = jDir->pino;
wdenkfe8c2802002-11-03 00:38:21 +00001113 version = jDir->version;
1114 }
Ilya Yanok70741002008-11-13 19:49:34 +03001115 put_fl_mem(jDir, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +00001116 }
1117 /* now we found the right entry again. (shoulda returned inode*) */
wdenk998eaae2004-04-18 19:43:36 +00001118 if (jDirFoundType != DT_LNK)
1119 return jDirFoundIno;
wdenk06d01db2003-03-14 20:47:52 +00001120
1121 /* it's a soft link so we follow it again. */
1122 b2 = pL->frag.listHead;
wdenkfe8c2802002-11-03 00:38:21 +00001123 while (b2) {
Ilya Yanok70741002008-11-13 19:49:34 +03001124 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset,
1125 pL->readbuf);
wdenk998eaae2004-04-18 19:43:36 +00001126 if (jNode->ino == jDirFoundIno) {
wdenk2729af92004-05-03 20:45:30 +00001127 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
wdenkfe8c2802002-11-03 00:38:21 +00001128
1129#if 0
1130 putLabeledWord("\t\t dsize = ", jNode->dsize);
1131 putstr("\t\t target = ");
1132 putnstr(src, jNode->dsize);
1133 putstr("\r\n");
1134#endif
Wolfgang Denk77ddac92005-10-13 16:45:02 +02001135 strncpy(tmp, (char *)src, jNode->dsize);
wdenkfe8c2802002-11-03 00:38:21 +00001136 tmp[jNode->dsize] = '\0';
Ilya Yanok70741002008-11-13 19:49:34 +03001137 put_fl_mem(jNode, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +00001138 break;
1139 }
1140 b2 = b2->next;
Ilya Yanok70741002008-11-13 19:49:34 +03001141 put_fl_mem(jNode, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +00001142 }
1143 /* ok so the name of the new file to find is in tmp */
1144 /* if it starts with a slash it is root based else shared dirs */
1145 if (tmp[0] == '/')
1146 pino = 1;
1147 else
wdenk998eaae2004-04-18 19:43:36 +00001148 pino = jDirFoundPino;
wdenkfe8c2802002-11-03 00:38:21 +00001149
1150 return jffs2_1pass_search_inode(pL, tmp, pino);
1151}
1152
1153static u32
1154jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1155{
1156 int i;
1157 char tmp[256];
1158 char working_tmp[256];
1159 char *c;
1160
1161 /* discard any leading slash */
1162 i = 0;
1163 while (fname[i] == '/')
1164 i++;
1165 strcpy(tmp, &fname[i]);
1166 working_tmp[0] = '\0';
1167 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1168 {
1169 strncpy(working_tmp, tmp, c - tmp);
1170 working_tmp[c - tmp] = '\0';
1171 for (i = 0; i < strlen(c) - 1; i++)
1172 tmp[i] = c[i + 1];
1173 tmp[i] = '\0';
1174 /* only a failure if we arent looking at top level */
wdenk06d01db2003-03-14 20:47:52 +00001175 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1176 (working_tmp[0])) {
wdenkfe8c2802002-11-03 00:38:21 +00001177 putstr("find_inode failed for name=");
1178 putstr(working_tmp);
1179 putstr("\r\n");
1180 return 0;
1181 }
1182 }
1183
1184 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1185 putstr("find_inode failed for name=");
1186 putstr(tmp);
1187 putstr("\r\n");
1188 return 0;
1189 }
1190 /* this is for the bare filename, directories have already been mapped */
1191 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1192 putstr("find_inode failed for name=");
1193 putstr(tmp);
1194 putstr("\r\n");
1195 return 0;
1196 }
1197 return pino;
1198
1199}
1200
1201unsigned char
1202jffs2_1pass_rescan_needed(struct part_info *part)
1203{
1204 struct b_node *b;
wdenk998eaae2004-04-18 19:43:36 +00001205 struct jffs2_unknown_node onode;
wdenkfe8c2802002-11-03 00:38:21 +00001206 struct jffs2_unknown_node *node;
wdenk06d01db2003-03-14 20:47:52 +00001207 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
wdenkfe8c2802002-11-03 00:38:21 +00001208
1209 if (part->jffs2_priv == 0){
1210 DEBUGF ("rescan: First time in use\n");
1211 return 1;
1212 }
Wolfgang Denk700a0c62005-08-08 01:03:24 +02001213
wdenkfe8c2802002-11-03 00:38:21 +00001214 /* if we have no list, we need to rescan */
wdenk06d01db2003-03-14 20:47:52 +00001215 if (pL->frag.listCount == 0) {
wdenkfe8c2802002-11-03 00:38:21 +00001216 DEBUGF ("rescan: fraglist zero\n");
1217 return 1;
1218 }
1219
wdenk06d01db2003-03-14 20:47:52 +00001220 /* but suppose someone reflashed a partition at the same offset... */
1221 b = pL->dir.listHead;
wdenkfe8c2802002-11-03 00:38:21 +00001222 while (b) {
wdenk998eaae2004-04-18 19:43:36 +00001223 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1224 sizeof(onode), &onode);
wdenkfe8c2802002-11-03 00:38:21 +00001225 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
wdenk06d01db2003-03-14 20:47:52 +00001226 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1227 (unsigned long) b->offset);
wdenkfe8c2802002-11-03 00:38:21 +00001228 return 1;
1229 }
1230 b = b->next;
1231 }
1232 return 0;
1233}
1234
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001235#ifdef CONFIG_JFFS2_SUMMARY
1236static u32 sum_get_unaligned32(u32 *ptr)
1237{
1238 u32 val;
1239 u8 *p = (u8 *)ptr;
1240
1241 val = *p | (*(p + 1) << 8) | (*(p + 2) << 16) | (*(p + 3) << 24);
1242
1243 return __le32_to_cpu(val);
1244}
1245
1246static u16 sum_get_unaligned16(u16 *ptr)
1247{
1248 u16 val;
1249 u8 *p = (u8 *)ptr;
1250
1251 val = *p | (*(p + 1) << 8);
1252
1253 return __le16_to_cpu(val);
1254}
1255
Ilya Yanok9b707622008-11-13 19:49:35 +03001256#define dbg_summary(...) do {} while (0);
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001257/*
1258 * Process the stored summary information - helper function for
Ilya Yanok9b707622008-11-13 19:49:35 +03001259 * jffs2_sum_scan_sumnode()
1260 */
1261
1262static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset,
1263 struct jffs2_raw_summary *summary,
1264 struct b_lists *pL)
1265{
1266 void *sp;
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001267 int i, pass;
1268 void *ret;
Ilya Yanok9b707622008-11-13 19:49:35 +03001269
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001270 for (pass = 0; pass < 2; pass++) {
1271 sp = summary->sum;
Ilya Yanok9b707622008-11-13 19:49:35 +03001272
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001273 for (i = 0; i < summary->sum_num; i++) {
1274 struct jffs2_sum_unknown_flash *spu = sp;
1275 dbg_summary("processing summary index %d\n", i);
Ilya Yanok9b707622008-11-13 19:49:35 +03001276
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001277 switch (sum_get_unaligned16(&spu->nodetype)) {
1278 case JFFS2_NODETYPE_INODE: {
Ilya Yanok9b707622008-11-13 19:49:35 +03001279 struct jffs2_sum_inode_flash *spi;
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001280 if (pass) {
1281 spi = sp;
Ilya Yanok9b707622008-11-13 19:49:35 +03001282
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001283 ret = insert_node(&pL->frag,
1284 (u32)part->offset +
1285 offset +
1286 sum_get_unaligned32(
1287 &spi->offset));
1288 if (ret == NULL)
1289 return -1;
1290 }
Ilya Yanok9b707622008-11-13 19:49:35 +03001291
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001292 sp += JFFS2_SUMMARY_INODE_SIZE;
Ilya Yanok9b707622008-11-13 19:49:35 +03001293
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001294 break;
1295 }
1296 case JFFS2_NODETYPE_DIRENT: {
1297 struct jffs2_sum_dirent_flash *spd;
1298 spd = sp;
1299 if (pass) {
1300 ret = insert_node(&pL->dir,
1301 (u32) part->offset +
1302 offset +
1303 sum_get_unaligned32(
1304 &spd->offset));
1305 if (ret == NULL)
1306 return -1;
1307 }
Ilya Yanok9b707622008-11-13 19:49:35 +03001308
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001309 sp += JFFS2_SUMMARY_DIRENT_SIZE(
1310 spd->nsize);
Ilya Yanok9b707622008-11-13 19:49:35 +03001311
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001312 break;
1313 }
1314 default : {
1315 uint16_t nodetype = sum_get_unaligned16(
1316 &spu->nodetype);
1317 printf("Unsupported node type %x found"
1318 " in summary!\n",
1319 nodetype);
1320 if ((nodetype & JFFS2_COMPAT_MASK) ==
1321 JFFS2_FEATURE_INCOMPAT)
1322 return -EIO;
1323 return -EBADMSG;
1324 }
Ilya Yanok9b707622008-11-13 19:49:35 +03001325 }
1326 }
1327 }
1328 return 0;
1329}
1330
1331/* Process the summary node - called from jffs2_scan_eraseblock() */
1332int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset,
1333 struct jffs2_raw_summary *summary, uint32_t sumsize,
1334 struct b_lists *pL)
1335{
1336 struct jffs2_unknown_node crcnode;
Tom Rini1c8fdf82016-03-27 14:48:36 -04001337 int ret, __maybe_unused ofs;
Ilya Yanok9b707622008-11-13 19:49:35 +03001338 uint32_t crc;
1339
1340 ofs = part->sector_size - sumsize;
1341
1342 dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
1343 offset, offset + ofs, sumsize);
1344
1345 /* OK, now check for node validity and CRC */
1346 crcnode.magic = JFFS2_MAGIC_BITMASK;
1347 crcnode.nodetype = JFFS2_NODETYPE_SUMMARY;
1348 crcnode.totlen = summary->totlen;
1349 crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4);
1350
1351 if (summary->hdr_crc != crc) {
1352 dbg_summary("Summary node header is corrupt (bad CRC or "
1353 "no summary at all)\n");
1354 goto crc_err;
1355 }
1356
1357 if (summary->totlen != sumsize) {
1358 dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
1359 goto crc_err;
1360 }
1361
1362 crc = crc32_no_comp(0, (uchar *)summary,
1363 sizeof(struct jffs2_raw_summary)-8);
1364
1365 if (summary->node_crc != crc) {
1366 dbg_summary("Summary node is corrupt (bad CRC)\n");
1367 goto crc_err;
1368 }
1369
1370 crc = crc32_no_comp(0, (uchar *)summary->sum,
1371 sumsize - sizeof(struct jffs2_raw_summary));
1372
1373 if (summary->sum_crc != crc) {
1374 dbg_summary("Summary node data is corrupt (bad CRC)\n");
1375 goto crc_err;
1376 }
1377
1378 if (summary->cln_mkr)
1379 dbg_summary("Summary : CLEANMARKER node \n");
1380
1381 ret = jffs2_sum_process_sum_data(part, offset, summary, pL);
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001382 if (ret == -EBADMSG)
1383 return 0;
Ilya Yanok9b707622008-11-13 19:49:35 +03001384 if (ret)
1385 return ret; /* real error */
1386
1387 return 1;
1388
1389crc_err:
1390 putstr("Summary node crc error, skipping summary information.\n");
1391
1392 return 0;
1393}
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001394#endif /* CONFIG_JFFS2_SUMMARY */
Ilya Yanok9b707622008-11-13 19:49:35 +03001395
wdenk06d01db2003-03-14 20:47:52 +00001396#ifdef DEBUG_FRAGMENTS
1397static void
1398dump_fragments(struct b_lists *pL)
1399{
1400 struct b_node *b;
wdenk998eaae2004-04-18 19:43:36 +00001401 struct jffs2_raw_inode ojNode;
wdenk06d01db2003-03-14 20:47:52 +00001402 struct jffs2_raw_inode *jNode;
1403
1404 putstr("\r\n\r\n******The fragment Entries******\r\n");
1405 b = pL->frag.listHead;
1406 while (b) {
wdenk998eaae2004-04-18 19:43:36 +00001407 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1408 sizeof(ojNode), &ojNode);
wdenk06d01db2003-03-14 20:47:52 +00001409 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1410 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1411 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1412 putLabeledWord("\tbuild_list: version = ", jNode->version);
1413 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1414 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1415 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1416 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1417 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1418 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1419 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1420 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
wdenk8bde7f72003-06-27 21:31:46 +00001421 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
wdenk06d01db2003-03-14 20:47:52 +00001422 b = b->next;
1423 }
1424}
1425#endif
1426
1427#ifdef DEBUG_DIRENTS
1428static void
1429dump_dirents(struct b_lists *pL)
1430{
1431 struct b_node *b;
1432 struct jffs2_raw_dirent *jDir;
1433
1434 putstr("\r\n\r\n******The directory Entries******\r\n");
1435 b = pL->dir.listHead;
1436 while (b) {
Ilya Yanok70741002008-11-13 19:49:34 +03001437 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1438 pL->readbuf);
wdenk06d01db2003-03-14 20:47:52 +00001439 putstr("\r\n");
1440 putnstr(jDir->name, jDir->nsize);
1441 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1442 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1443 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1444 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1445 putLabeledWord("\tbuild_list: version = ", jDir->version);
1446 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1447 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1448 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1449 putLabeledWord("\tbuild_list: type = ", jDir->type);
1450 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1451 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
Wolfgang Denk53677ef2008-05-20 16:00:29 +02001452 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
wdenk06d01db2003-03-14 20:47:52 +00001453 b = b->next;
Ilya Yanok70741002008-11-13 19:49:34 +03001454 put_fl_mem(jDir, pL->readbuf);
wdenk06d01db2003-03-14 20:47:52 +00001455 }
1456}
1457#endif
1458
Mark Tomlinson081adef2015-07-01 16:38:27 +12001459#define DEFAULT_EMPTY_SCAN_SIZE 256
Ilya Yanok8a36d312008-11-13 19:49:33 +03001460
1461static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size)
1462{
1463 if (sector_size < DEFAULT_EMPTY_SCAN_SIZE)
1464 return sector_size;
1465 else
1466 return DEFAULT_EMPTY_SCAN_SIZE;
1467}
1468
wdenkfe8c2802002-11-03 00:38:21 +00001469static u32
1470jffs2_1pass_build_lists(struct part_info * part)
1471{
1472 struct b_lists *pL;
1473 struct jffs2_unknown_node *node;
Tom Rini18e86722013-12-05 14:48:38 -05001474 u32 nr_sectors;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001475 u32 i;
wdenkfe8c2802002-11-03 00:38:21 +00001476 u32 counter4 = 0;
1477 u32 counterF = 0;
1478 u32 counterN = 0;
Ilya Yanok70741002008-11-13 19:49:34 +03001479 u32 max_totlen = 0;
Mark Tomlinsonc5b19402015-07-01 16:38:26 +12001480 u32 buf_size;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001481 char *buf;
wdenkfe8c2802002-11-03 00:38:21 +00001482
Tom Rini18e86722013-12-05 14:48:38 -05001483 nr_sectors = lldiv(part->size, part->sector_size);
wdenkfe8c2802002-11-03 00:38:21 +00001484 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1485 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1486 /* only about 5 %. not enough to inconvenience people for. */
1487 /* lcd_off(); */
1488
1489 /* if we are building a list we need to refresh the cache. */
wdenkfe8c2802002-11-03 00:38:21 +00001490 jffs_init_1pass_list(part);
wdenk06d01db2003-03-14 20:47:52 +00001491 pL = (struct b_lists *)part->jffs2_priv;
Mark Tomlinsonc5b19402015-07-01 16:38:26 +12001492 buf = malloc(DEFAULT_EMPTY_SCAN_SIZE);
wdenk4b9206e2004-03-23 22:14:11 +00001493 puts ("Scanning JFFS2 FS: ");
wdenkfe8c2802002-11-03 00:38:21 +00001494
1495 /* start at the beginning of the partition */
Ilya Yanok8a36d312008-11-13 19:49:33 +03001496 for (i = 0; i < nr_sectors; i++) {
1497 uint32_t sector_ofs = i * part->sector_size;
1498 uint32_t buf_ofs = sector_ofs;
Ilya Yanok9b707622008-11-13 19:49:35 +03001499 uint32_t buf_len;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001500 uint32_t ofs, prevofs;
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001501#ifdef CONFIG_JFFS2_SUMMARY
Ilya Yanok9b707622008-11-13 19:49:35 +03001502 struct jffs2_sum_marker *sm;
1503 void *sumptr = NULL;
1504 uint32_t sumlen;
1505 int ret;
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001506#endif
Mark Tomlinson54a88382015-07-01 16:38:28 +12001507 /* Indicates a sector with a CLEANMARKER was found */
1508 int clean_sector = 0;
wdenk0b8fa032004-04-25 14:37:29 +00001509
Mark Tomlinsonc5b19402015-07-01 16:38:26 +12001510 /* Set buf_size to maximum length */
1511 buf_size = DEFAULT_EMPTY_SCAN_SIZE;
Stuart Wood86d32732008-06-02 16:40:08 -04001512 WATCHDOG_RESET();
Ilya Yanok9b707622008-11-13 19:49:35 +03001513
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001514#ifdef CONFIG_JFFS2_SUMMARY
Ilya Yanok9b707622008-11-13 19:49:35 +03001515 buf_len = sizeof(*sm);
1516
1517 /* Read as much as we want into the _end_ of the preallocated
1518 * buffer
1519 */
1520 get_fl_mem(part->offset + sector_ofs + part->sector_size -
1521 buf_len, buf_len, buf + buf_size - buf_len);
1522
1523 sm = (void *)buf + buf_size - sizeof(*sm);
1524 if (sm->magic == JFFS2_SUM_MAGIC) {
1525 sumlen = part->sector_size - sm->offset;
1526 sumptr = buf + buf_size - sumlen;
1527
1528 /* Now, make sure the summary itself is available */
1529 if (sumlen > buf_size) {
1530 /* Need to kmalloc for this. */
1531 sumptr = malloc(sumlen);
1532 if (!sumptr) {
1533 putstr("Can't get memory for summary "
1534 "node!\n");
Ilya Yanokb6440062009-08-12 16:42:48 +04001535 free(buf);
1536 jffs2_free_cache(part);
Ilya Yanok9b707622008-11-13 19:49:35 +03001537 return 0;
1538 }
1539 memcpy(sumptr + sumlen - buf_len, buf +
1540 buf_size - buf_len, buf_len);
1541 }
1542 if (buf_len < sumlen) {
1543 /* Need to read more so that the entire summary
1544 * node is present
1545 */
1546 get_fl_mem(part->offset + sector_ofs +
1547 part->sector_size - sumlen,
1548 sumlen - buf_len, sumptr);
1549 }
1550 }
1551
1552 if (sumptr) {
1553 ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr,
1554 sumlen, pL);
1555
1556 if (buf_size && sumlen > buf_size)
1557 free(sumptr);
Ilya Yanokb6440062009-08-12 16:42:48 +04001558 if (ret < 0) {
1559 free(buf);
1560 jffs2_free_cache(part);
Ilya Yanok9b707622008-11-13 19:49:35 +03001561 return 0;
Ilya Yanokb6440062009-08-12 16:42:48 +04001562 }
Ilya Yanok9b707622008-11-13 19:49:35 +03001563 if (ret)
1564 continue;
1565
1566 }
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001567#endif /* CONFIG_JFFS2_SUMMARY */
Ilya Yanok9b707622008-11-13 19:49:35 +03001568
1569 buf_len = EMPTY_SCAN_SIZE(part->sector_size);
1570
Ilya Yanok8a36d312008-11-13 19:49:33 +03001571 get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf);
Stuart Wood86d32732008-06-02 16:40:08 -04001572
Ilya Yanok8a36d312008-11-13 19:49:33 +03001573 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
1574 ofs = 0;
1575
1576 /* Scan only 4KiB of 0xFF before declaring it's empty */
1577 while (ofs < EMPTY_SCAN_SIZE(part->sector_size) &&
1578 *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF)
1579 ofs += 4;
1580
1581 if (ofs == EMPTY_SCAN_SIZE(part->sector_size))
1582 continue;
1583
1584 ofs += sector_ofs;
1585 prevofs = ofs - 1;
Mark Tomlinsonc5b19402015-07-01 16:38:26 +12001586 /*
1587 * Set buf_size down to the minimum size required.
1588 * This prevents reading in chunks of flash data unnecessarily.
1589 */
1590 buf_size = sizeof(union jffs2_node_union);
Ilya Yanok8a36d312008-11-13 19:49:33 +03001591
1592 scan_more:
1593 while (ofs < sector_ofs + part->sector_size) {
1594 if (ofs == prevofs) {
1595 printf("offset %08x already seen, skip\n", ofs);
1596 ofs += 4;
1597 counter4++;
1598 continue;
1599 }
1600 prevofs = ofs;
1601 if (sector_ofs + part->sector_size <
1602 ofs + sizeof(*node))
1603 break;
1604 if (buf_ofs + buf_len < ofs + sizeof(*node)) {
1605 buf_len = min_t(uint32_t, buf_size, sector_ofs
1606 + part->sector_size - ofs);
1607 get_fl_mem((u32)part->offset + ofs, buf_len,
1608 buf);
1609 buf_ofs = ofs;
1610 }
1611
1612 node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs];
1613
1614 if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) {
1615 uint32_t inbuf_ofs;
Wolfgang Denk16b9afd2011-10-05 22:58:11 +02001616 uint32_t scan_end;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001617
Ilya Yanok8a36d312008-11-13 19:49:33 +03001618 ofs += 4;
1619 scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(
1620 part->sector_size)/8,
1621 buf_len);
1622 more_empty:
1623 inbuf_ofs = ofs - buf_ofs;
1624 while (inbuf_ofs < scan_end) {
1625 if (*(uint32_t *)(&buf[inbuf_ofs]) !=
1626 0xffffffff)
1627 goto scan_more;
1628
1629 inbuf_ofs += 4;
1630 ofs += 4;
wdenk998eaae2004-04-18 19:43:36 +00001631 }
Ilya Yanok8a36d312008-11-13 19:49:33 +03001632 /* Ran off end. */
Mark Tomlinson54a88382015-07-01 16:38:28 +12001633 /*
1634 * If this sector had a clean marker at the
1635 * beginning, and immediately following this
1636 * have been a bunch of FF bytes, treat the
1637 * entire sector as empty.
1638 */
1639 if (clean_sector)
1640 break;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001641
1642 /* See how much more there is to read in this
1643 * eraseblock...
1644 */
1645 buf_len = min_t(uint32_t, buf_size,
1646 sector_ofs +
1647 part->sector_size - ofs);
1648 if (!buf_len) {
1649 /* No more to read. Break out of main
1650 * loop without marking this range of
1651 * empty space as dirty (because it's
1652 * not)
1653 */
1654 break;
1655 }
1656 scan_end = buf_len;
1657 get_fl_mem((u32)part->offset + ofs, buf_len,
1658 buf);
1659 buf_ofs = ofs;
1660 goto more_empty;
1661 }
Mark Tomlinson54a88382015-07-01 16:38:28 +12001662 /*
1663 * Found something not erased in the sector, so reset
1664 * the 'clean_sector' flag.
1665 */
1666 clean_sector = 0;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001667 if (node->magic != JFFS2_MAGIC_BITMASK ||
1668 !hdr_crc(node)) {
1669 ofs += 4;
1670 counter4++;
1671 continue;
1672 }
1673 if (ofs + node->totlen >
1674 sector_ofs + part->sector_size) {
1675 ofs += 4;
1676 counter4++;
1677 continue;
1678 }
1679 /* if its a fragment add it */
1680 switch (node->nodetype) {
1681 case JFFS2_NODETYPE_INODE:
1682 if (buf_ofs + buf_len < ofs + sizeof(struct
1683 jffs2_raw_inode)) {
Mark Tomlinsonc5b19402015-07-01 16:38:26 +12001684 buf_len = min_t(uint32_t,
1685 sizeof(struct jffs2_raw_inode),
1686 sector_ofs +
1687 part->sector_size -
1688 ofs);
Ilya Yanok8a36d312008-11-13 19:49:33 +03001689 get_fl_mem((u32)part->offset + ofs,
1690 buf_len, buf);
1691 buf_ofs = ofs;
1692 node = (void *)buf;
1693 }
Mark Tomlinsonc5b19402015-07-01 16:38:26 +12001694 if (!inode_crc((struct jffs2_raw_inode *)node))
1695 break;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001696
1697 if (insert_node(&pL->frag, (u32) part->offset +
Ilya Yanokb6440062009-08-12 16:42:48 +04001698 ofs) == NULL) {
1699 free(buf);
1700 jffs2_free_cache(part);
Ilya Yanok8a36d312008-11-13 19:49:33 +03001701 return 0;
Ilya Yanokb6440062009-08-12 16:42:48 +04001702 }
Ilya Yanok70741002008-11-13 19:49:34 +03001703 if (max_totlen < node->totlen)
1704 max_totlen = node->totlen;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001705 break;
1706 case JFFS2_NODETYPE_DIRENT:
1707 if (buf_ofs + buf_len < ofs + sizeof(struct
1708 jffs2_raw_dirent) +
1709 ((struct
1710 jffs2_raw_dirent *)
1711 node)->nsize) {
Mark Tomlinsonc5b19402015-07-01 16:38:26 +12001712 buf_len = min_t(uint32_t,
1713 node->totlen,
1714 sector_ofs +
1715 part->sector_size -
1716 ofs);
Ilya Yanok8a36d312008-11-13 19:49:33 +03001717 get_fl_mem((u32)part->offset + ofs,
1718 buf_len, buf);
1719 buf_ofs = ofs;
1720 node = (void *)buf;
1721 }
1722
1723 if (!dirent_crc((struct jffs2_raw_dirent *)
1724 node) ||
1725 !dirent_name_crc(
1726 (struct
1727 jffs2_raw_dirent *)
1728 node))
1729 break;
wdenkfc1cfcd2004-04-25 15:41:35 +00001730 if (! (counterN%100))
wdenk4b9206e2004-03-23 22:14:11 +00001731 puts ("\b\b. ");
wdenk06d01db2003-03-14 20:47:52 +00001732 if (insert_node(&pL->dir, (u32) part->offset +
Ilya Yanokb6440062009-08-12 16:42:48 +04001733 ofs) == NULL) {
1734 free(buf);
1735 jffs2_free_cache(part);
wdenkfe8c2802002-11-03 00:38:21 +00001736 return 0;
Ilya Yanokb6440062009-08-12 16:42:48 +04001737 }
Ilya Yanok70741002008-11-13 19:49:34 +03001738 if (max_totlen < node->totlen)
1739 max_totlen = node->totlen;
wdenkfe8c2802002-11-03 00:38:21 +00001740 counterN++;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001741 break;
1742 case JFFS2_NODETYPE_CLEANMARKER:
wdenkfe8c2802002-11-03 00:38:21 +00001743 if (node->totlen != sizeof(struct jffs2_unknown_node))
wdenk06d01db2003-03-14 20:47:52 +00001744 printf("OOPS Cleanmarker has bad size "
Wolfgang Denkb64f1902008-07-14 15:06:35 +02001745 "%d != %zu\n",
1746 node->totlen,
wdenk06d01db2003-03-14 20:47:52 +00001747 sizeof(struct jffs2_unknown_node));
Mark Tomlinson54a88382015-07-01 16:38:28 +12001748 if ((node->totlen ==
1749 sizeof(struct jffs2_unknown_node)) &&
1750 (ofs == sector_ofs)) {
1751 /*
1752 * Found a CLEANMARKER at the beginning
1753 * of the sector. It's in the correct
1754 * place with correct size and CRC.
1755 */
1756 clean_sector = 1;
1757 }
Ilya Yanok8a36d312008-11-13 19:49:33 +03001758 break;
1759 case JFFS2_NODETYPE_PADDING:
wdenk7205e402003-09-10 22:30:53 +00001760 if (node->totlen < sizeof(struct jffs2_unknown_node))
1761 printf("OOPS Padding has bad size "
Wolfgang Denkb64f1902008-07-14 15:06:35 +02001762 "%d < %zu\n",
1763 node->totlen,
wdenk7205e402003-09-10 22:30:53 +00001764 sizeof(struct jffs2_unknown_node));
Ilya Yanok8a36d312008-11-13 19:49:33 +03001765 break;
Ilya Yanok9b707622008-11-13 19:49:35 +03001766 case JFFS2_NODETYPE_SUMMARY:
1767 break;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001768 default:
Wolfgang Denkb64f1902008-07-14 15:06:35 +02001769 printf("Unknown node type: %x len %d offset 0x%x\n",
1770 node->nodetype,
Ilya Yanok8a36d312008-11-13 19:49:33 +03001771 node->totlen, ofs);
wdenkfe8c2802002-11-03 00:38:21 +00001772 }
Ilya Yanok8a36d312008-11-13 19:49:33 +03001773 ofs += ((node->totlen + 3) & ~3);
wdenkfe8c2802002-11-03 00:38:21 +00001774 counterF++;
wdenkfe8c2802002-11-03 00:38:21 +00001775 }
wdenkfe8c2802002-11-03 00:38:21 +00001776 }
1777
Ilya Yanok8a36d312008-11-13 19:49:33 +03001778 free(buf);
Mark Tomlinson10d3ac32015-07-01 16:38:29 +12001779#if defined(CONFIG_SYS_JFFS2_SORT_FRAGMENTS)
1780 /*
1781 * Sort the lists.
1782 */
1783 sort_list(&pL->frag);
1784 sort_list(&pL->dir);
1785#endif
wdenkfe8c2802002-11-03 00:38:21 +00001786 putstr("\b\b done.\r\n"); /* close off the dots */
Ilya Yanok70741002008-11-13 19:49:34 +03001787
1788 /* We don't care if malloc failed - then each read operation will
1789 * allocate its own buffer as necessary (NAND) or will read directly
1790 * from flash (NOR).
1791 */
1792 pL->readbuf = malloc(max_totlen);
1793
wdenkfe8c2802002-11-03 00:38:21 +00001794 /* turn the lcd back on. */
1795 /* splash(); */
1796
1797#if 0
wdenk06d01db2003-03-14 20:47:52 +00001798 putLabeledWord("dir entries = ", pL->dir.listCount);
1799 putLabeledWord("frag entries = ", pL->frag.listCount);
wdenkfe8c2802002-11-03 00:38:21 +00001800 putLabeledWord("+4 increments = ", counter4);
1801 putLabeledWord("+file_offset increments = ", counterF);
1802
1803#endif
1804
wdenk06d01db2003-03-14 20:47:52 +00001805#ifdef DEBUG_DIRENTS
1806 dump_dirents(pL);
1807#endif
wdenkfe8c2802002-11-03 00:38:21 +00001808
wdenk06d01db2003-03-14 20:47:52 +00001809#ifdef DEBUG_FRAGMENTS
1810 dump_fragments(pL);
1811#endif
wdenkfe8c2802002-11-03 00:38:21 +00001812
wdenkfe8c2802002-11-03 00:38:21 +00001813 /* give visual feedback that we are done scanning the flash */
1814 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1815 return 1;
1816}
1817
1818
wdenkfe8c2802002-11-03 00:38:21 +00001819static u32
1820jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1821{
1822 struct b_node *b;
wdenk998eaae2004-04-18 19:43:36 +00001823 struct jffs2_raw_inode ojNode;
wdenkfe8c2802002-11-03 00:38:21 +00001824 struct jffs2_raw_inode *jNode;
1825 int i;
1826
wdenkfe8c2802002-11-03 00:38:21 +00001827 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1828 piL->compr_info[i].num_frags = 0;
1829 piL->compr_info[i].compr_sum = 0;
1830 piL->compr_info[i].decompr_sum = 0;
1831 }
1832
wdenk06d01db2003-03-14 20:47:52 +00001833 b = pL->frag.listHead;
wdenkfe8c2802002-11-03 00:38:21 +00001834 while (b) {
wdenk998eaae2004-04-18 19:43:36 +00001835 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1836 sizeof(ojNode), &ojNode);
wdenkfe8c2802002-11-03 00:38:21 +00001837 if (jNode->compr < JFFS2_NUM_COMPR) {
1838 piL->compr_info[jNode->compr].num_frags++;
1839 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1840 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1841 }
1842 b = b->next;
1843 }
1844 return 0;
1845}
1846
1847
wdenkfe8c2802002-11-03 00:38:21 +00001848static struct b_lists *
1849jffs2_get_list(struct part_info * part, const char *who)
1850{
Wolfgang Denk700a0c62005-08-08 01:03:24 +02001851 /* copy requested part_info struct pointer to global location */
1852 current_part = part;
1853
wdenkfe8c2802002-11-03 00:38:21 +00001854 if (jffs2_1pass_rescan_needed(part)) {
1855 if (!jffs2_1pass_build_lists(part)) {
1856 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1857 return NULL;
1858 }
1859 }
1860 return (struct b_lists *)part->jffs2_priv;
1861}
1862
1863
1864/* Print directory / file contents */
1865u32
1866jffs2_1pass_ls(struct part_info * part, const char *fname)
1867{
1868 struct b_lists *pl;
Wolfgang Denk87b8bd52005-08-16 09:32:45 +02001869 long ret = 1;
wdenkfe8c2802002-11-03 00:38:21 +00001870 u32 inode;
1871
wdenk06d01db2003-03-14 20:47:52 +00001872 if (! (pl = jffs2_get_list(part, "ls")))
wdenkfe8c2802002-11-03 00:38:21 +00001873 return 0;
1874
1875 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1876 putstr("ls: Failed to scan jffs2 file structure\r\n");
1877 return 0;
1878 }
wdenkfc1cfcd2004-04-25 15:41:35 +00001879
1880
wdenkfe8c2802002-11-03 00:38:21 +00001881#if 0
1882 putLabeledWord("found file at inode = ", inode);
1883 putLabeledWord("read_inode returns = ", ret);
1884#endif
wdenkfc1cfcd2004-04-25 15:41:35 +00001885
1886 return ret;
wdenkfe8c2802002-11-03 00:38:21 +00001887}
1888
1889
wdenkfe8c2802002-11-03 00:38:21 +00001890/* Load a file from flash into memory. fname can be a full path */
1891u32
1892jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1893{
1894
1895 struct b_lists *pl;
Wolfgang Denk87b8bd52005-08-16 09:32:45 +02001896 long ret = 1;
wdenkfe8c2802002-11-03 00:38:21 +00001897 u32 inode;
1898
1899 if (! (pl = jffs2_get_list(part, "load")))
1900 return 0;
1901
1902 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1903 putstr("load: Failed to find inode\r\n");
1904 return 0;
1905 }
1906
1907 /* Resolve symlinks */
1908 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1909 putstr("load: Failed to resolve inode structure\r\n");
1910 return 0;
1911 }
1912
1913 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1914 putstr("load: Failed to read inode\r\n");
1915 return 0;
1916 }
1917
1918 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1919 (unsigned long) dest, ret);
1920 return ret;
1921}
1922
1923/* Return information about the fs on this partition */
1924u32
1925jffs2_1pass_info(struct part_info * part)
1926{
1927 struct b_jffs2_info info;
1928 struct b_lists *pl;
1929 int i;
1930
1931 if (! (pl = jffs2_get_list(part, "info")))
1932 return 0;
1933
1934 jffs2_1pass_fill_info(pl, &info);
wdenk06d01db2003-03-14 20:47:52 +00001935 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
wdenk4b9206e2004-03-23 22:14:11 +00001936 printf ("Compression: %s\n"
1937 "\tfrag count: %d\n"
1938 "\tcompressed sum: %d\n"
1939 "\tuncompressed sum: %d\n",
1940 compr_names[i],
1941 info.compr_info[i].num_frags,
1942 info.compr_info[i].compr_sum,
1943 info.compr_info[i].decompr_sum);
wdenkfe8c2802002-11-03 00:38:21 +00001944 }
1945 return 1;
1946}