1fe8c2806Swdenk /* 2fe8c2806Swdenk ------------------------------------------------------------------------- 3fe8c2806Swdenk * Filename: jffs2.c 4fe8c2806Swdenk * Version: $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $ 5fe8c2806Swdenk * Copyright: Copyright (C) 2001, Russ Dill 6fe8c2806Swdenk * Author: Russ Dill <Russ.Dill@asu.edu> 7fe8c2806Swdenk * Description: Module to load kernel from jffs2 8fe8c2806Swdenk *-----------------------------------------------------------------------*/ 9fe8c2806Swdenk /* 10fe8c2806Swdenk * some portions of this code are taken from jffs2, and as such, the 11fe8c2806Swdenk * following copyright notice is included. 12fe8c2806Swdenk * 13fe8c2806Swdenk * JFFS2 -- Journalling Flash File System, Version 2. 14fe8c2806Swdenk * 15fe8c2806Swdenk * Copyright (C) 2001 Red Hat, Inc. 16fe8c2806Swdenk * 17fe8c2806Swdenk * Created by David Woodhouse <dwmw2@cambridge.redhat.com> 18fe8c2806Swdenk * 19fe8c2806Swdenk * The original JFFS, from which the design for JFFS2 was derived, 20fe8c2806Swdenk * was designed and implemented by Axis Communications AB. 21fe8c2806Swdenk * 22fe8c2806Swdenk * The contents of this file are subject to the Red Hat eCos Public 23fe8c2806Swdenk * License Version 1.1 (the "Licence"); you may not use this file 24fe8c2806Swdenk * except in compliance with the Licence. You may obtain a copy of 25fe8c2806Swdenk * the Licence at http://www.redhat.com/ 26fe8c2806Swdenk * 27fe8c2806Swdenk * Software distributed under the Licence is distributed on an "AS IS" 28fe8c2806Swdenk * basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. 29fe8c2806Swdenk * See the Licence for the specific language governing rights and 30fe8c2806Swdenk * limitations under the Licence. 31fe8c2806Swdenk * 32fe8c2806Swdenk * The Original Code is JFFS2 - Journalling Flash File System, version 2 33fe8c2806Swdenk * 34fe8c2806Swdenk * Alternatively, the contents of this file may be used under the 35fe8c2806Swdenk * terms of the GNU General Public License version 2 (the "GPL"), in 36fe8c2806Swdenk * which case the provisions of the GPL are applicable instead of the 37fe8c2806Swdenk * above. If you wish to allow the use of your version of this file 38fe8c2806Swdenk * only under the terms of the GPL and not to allow others to use your 39fe8c2806Swdenk * version of this file under the RHEPL, indicate your decision by 40fe8c2806Swdenk * deleting the provisions above and replace them with the notice and 41fe8c2806Swdenk * other provisions required by the GPL. If you do not delete the 42fe8c2806Swdenk * provisions above, a recipient may use your version of this file 43fe8c2806Swdenk * under either the RHEPL or the GPL. 44fe8c2806Swdenk * 45fe8c2806Swdenk * $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $ 46fe8c2806Swdenk * 47fe8c2806Swdenk */ 48fe8c2806Swdenk 49fe8c2806Swdenk /* Ok, so anyone who knows the jffs2 code will probably want to get a papar 50fe8c2806Swdenk * bag to throw up into before reading this code. I looked through the jffs2 51fe8c2806Swdenk * code, the caching scheme is very elegant. I tried to keep the version 52fe8c2806Swdenk * for a bootloader as small and simple as possible. Instead of worring about 53fe8c2806Swdenk * unneccesary data copies, node scans, etc, I just optimized for the known 54fe8c2806Swdenk * common case, a kernel, which looks like: 55fe8c2806Swdenk * (1) most pages are 4096 bytes 56fe8c2806Swdenk * (2) version numbers are somewhat sorted in acsending order 57fe8c2806Swdenk * (3) multiple compressed blocks making up one page is uncommon 58fe8c2806Swdenk * 59fe8c2806Swdenk * So I create a linked list of decending version numbers (insertions at the 60fe8c2806Swdenk * head), and then for each page, walk down the list, until a matching page 61fe8c2806Swdenk * with 4096 bytes is found, and then decompress the watching pages in 62fe8c2806Swdenk * reverse order. 63fe8c2806Swdenk * 64fe8c2806Swdenk */ 65fe8c2806Swdenk 66fe8c2806Swdenk /* 67fe8c2806Swdenk * Adapted by Nye Liu <nyet@zumanetworks.com> and 68fe8c2806Swdenk * Rex Feany <rfeany@zumanetworks.com> 69fe8c2806Swdenk * on Jan/2002 for U-Boot. 70fe8c2806Swdenk * 71fe8c2806Swdenk * Clipped out all the non-1pass functions, cleaned up warnings, 72fe8c2806Swdenk * wrappers, etc. No major changes to the code. 73fe8c2806Swdenk * Please, he really means it when he said have a paper bag 74fe8c2806Swdenk * handy. We needed it ;). 75fe8c2806Swdenk * 76fe8c2806Swdenk */ 77fe8c2806Swdenk 7806d01dbeSwdenk /* 7906d01dbeSwdenk * Bugfixing by Kai-Uwe Bloem <kai-uwe.bloem@auerswald.de>, (C) Mar/2003 8006d01dbeSwdenk * 8106d01dbeSwdenk * - overhaul of the memory management. Removed much of the "paper-bagging" 8206d01dbeSwdenk * in that part of the code, fixed several bugs, now frees memory when 8306d01dbeSwdenk * partition is changed. 8406d01dbeSwdenk * It's still ugly :-( 8506d01dbeSwdenk * - fixed a bug in jffs2_1pass_read_inode where the file length calculation 8606d01dbeSwdenk * was incorrect. Removed a bit of the paper-bagging as well. 8706d01dbeSwdenk * - removed double crc calculation for fragment headers in jffs2_private.h 8806d01dbeSwdenk * for speedup. 8906d01dbeSwdenk * - scan_empty rewritten in a more "standard" manner (non-paperbag, that is). 9006d01dbeSwdenk * - spinning wheel now spins depending on how much memory has been scanned 9106d01dbeSwdenk * - lots of small changes all over the place to "improve" readability. 9206d01dbeSwdenk * - implemented fragment sorting to ensure that the newest data is copied 9306d01dbeSwdenk * if there are multiple copies of fragments for a certain file offset. 9406d01dbeSwdenk * 956d0f6bcfSJean-Christophe PLAGNIOL-VILLARD * The fragment sorting feature must be enabled by CONFIG_SYS_JFFS2_SORT_FRAGMENTS. 9606d01dbeSwdenk * Sorting is done while adding fragments to the lists, which is more or less a 9706d01dbeSwdenk * bubble sort. This takes a lot of time, and is most probably not an issue if 9806d01dbeSwdenk * the boot filesystem is always mounted readonly. 9906d01dbeSwdenk * 10006d01dbeSwdenk * You should define it if the boot filesystem is mounted writable, and updates 10106d01dbeSwdenk * to the boot files are done by copying files to that filesystem. 10206d01dbeSwdenk * 10306d01dbeSwdenk * 10406d01dbeSwdenk * There's a big issue left: endianess is completely ignored in this code. Duh! 10506d01dbeSwdenk * 10606d01dbeSwdenk * 10706d01dbeSwdenk * You still should have paper bags at hand :-(. The code lacks more or less 10806d01dbeSwdenk * any comment, and is still arcane and difficult to read in places. As this 109dd875c76Swdenk * might be incompatible with any new code from the jffs2 maintainers anyway, 110dd875c76Swdenk * it should probably be dumped and replaced by something like jffs2reader! 11106d01dbeSwdenk */ 11206d01dbeSwdenk 11306d01dbeSwdenk 114fe8c2806Swdenk #include <common.h> 115fe8c2806Swdenk #include <config.h> 116fe8c2806Swdenk #include <malloc.h> 117fe8c2806Swdenk #include <linux/stat.h> 118fe8c2806Swdenk #include <linux/time.h> 11986d3273eSStuart Wood #include <watchdog.h> 120fe8c2806Swdenk #include <jffs2/jffs2.h> 121fe8c2806Swdenk #include <jffs2/jffs2_1pass.h> 122*7b15e2bbSMike Frysinger #include <linux/compat.h> 1238cf19b9fSIlya Yanok #include <asm/errno.h> 124fe8c2806Swdenk 125fe8c2806Swdenk #include "jffs2_private.h" 126fe8c2806Swdenk 12706d01dbeSwdenk 12806d01dbeSwdenk #define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */ 129fc1cfcdbSwdenk #define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */ 13006d01dbeSwdenk 13106d01dbeSwdenk /* Debugging switches */ 13206d01dbeSwdenk #undef DEBUG_DIRENTS /* print directory entry list after scan */ 13306d01dbeSwdenk #undef DEBUG_FRAGMENTS /* print fragment list after scan */ 13406d01dbeSwdenk #undef DEBUG /* enable debugging messages */ 13506d01dbeSwdenk 13606d01dbeSwdenk 13706d01dbeSwdenk #ifdef DEBUG 13806d01dbeSwdenk # define DEBUGF(fmt,args...) printf(fmt ,##args) 13906d01dbeSwdenk #else 14006d01dbeSwdenk # define DEBUGF(fmt,args...) 14106d01dbeSwdenk #endif 14206d01dbeSwdenk 1439b707622SIlya Yanok #include "summary.h" 1449b707622SIlya Yanok 145700a0c64SWolfgang Denk /* keeps pointer to currentlu processed partition */ 146700a0c64SWolfgang Denk static struct part_info *current_part; 147998eaaecSwdenk 148e4dbe1b2SWolfgang Denk #if (defined(CONFIG_JFFS2_NAND) && \ 149dd60d122SJon Loeliger defined(CONFIG_CMD_NAND) ) 150addb2e16SBartlomiej Sieka #include <nand.h> 151998eaaecSwdenk /* 152998eaaecSwdenk * Support for jffs2 on top of NAND-flash 153998eaaecSwdenk * 154998eaaecSwdenk * NAND memory isn't mapped in processor's address space, 155998eaaecSwdenk * so data should be fetched from flash before 156998eaaecSwdenk * being processed. This is exactly what functions declared 157998eaaecSwdenk * here do. 158998eaaecSwdenk * 159998eaaecSwdenk */ 160998eaaecSwdenk 161998eaaecSwdenk #define NAND_PAGE_SIZE 512 162998eaaecSwdenk #define NAND_PAGE_SHIFT 9 163998eaaecSwdenk #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1)) 164998eaaecSwdenk 165998eaaecSwdenk #ifndef NAND_CACHE_PAGES 166998eaaecSwdenk #define NAND_CACHE_PAGES 16 167998eaaecSwdenk #endif 168998eaaecSwdenk #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE) 169998eaaecSwdenk 170998eaaecSwdenk static u8* nand_cache = NULL; 171998eaaecSwdenk static u32 nand_cache_off = (u32)-1; 172998eaaecSwdenk 173998eaaecSwdenk static int read_nand_cached(u32 off, u32 size, u_char *buf) 174998eaaecSwdenk { 175700a0c64SWolfgang Denk struct mtdids *id = current_part->dev->id; 176998eaaecSwdenk u32 bytes_read = 0; 1776db39708SMarian Balakowicz size_t retlen; 178998eaaecSwdenk int cpy_bytes; 179998eaaecSwdenk 180998eaaecSwdenk while (bytes_read < size) { 181998eaaecSwdenk if ((off + bytes_read < nand_cache_off) || 182998eaaecSwdenk (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) { 183998eaaecSwdenk nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK; 184998eaaecSwdenk if (!nand_cache) { 185998eaaecSwdenk /* This memory never gets freed but 'cause 186998eaaecSwdenk it's a bootloader, nobody cares */ 187998eaaecSwdenk nand_cache = malloc(NAND_CACHE_SIZE); 188998eaaecSwdenk if (!nand_cache) { 189998eaaecSwdenk printf("read_nand_cached: can't alloc cache size %d bytes\n", 190998eaaecSwdenk NAND_CACHE_SIZE); 191998eaaecSwdenk return -1; 192998eaaecSwdenk } 193998eaaecSwdenk } 194addb2e16SBartlomiej Sieka 195addb2e16SBartlomiej Sieka retlen = NAND_CACHE_SIZE; 196addb2e16SBartlomiej Sieka if (nand_read(&nand_info[id->num], nand_cache_off, 197addb2e16SBartlomiej Sieka &retlen, nand_cache) != 0 || 198998eaaecSwdenk retlen != NAND_CACHE_SIZE) { 199998eaaecSwdenk printf("read_nand_cached: error reading nand off %#x size %d bytes\n", 200998eaaecSwdenk nand_cache_off, NAND_CACHE_SIZE); 201998eaaecSwdenk return -1; 202998eaaecSwdenk } 203998eaaecSwdenk } 204998eaaecSwdenk cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read); 205998eaaecSwdenk if (cpy_bytes > size - bytes_read) 206998eaaecSwdenk cpy_bytes = size - bytes_read; 207998eaaecSwdenk memcpy(buf + bytes_read, 208998eaaecSwdenk nand_cache + off + bytes_read - nand_cache_off, 209998eaaecSwdenk cpy_bytes); 210998eaaecSwdenk bytes_read += cpy_bytes; 211998eaaecSwdenk } 212998eaaecSwdenk return bytes_read; 213998eaaecSwdenk } 214998eaaecSwdenk 215700a0c64SWolfgang Denk static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf) 216998eaaecSwdenk { 217998eaaecSwdenk u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size); 218998eaaecSwdenk 219998eaaecSwdenk if (NULL == buf) { 220700a0c64SWolfgang Denk printf("get_fl_mem_nand: can't alloc %d bytes\n", size); 221998eaaecSwdenk return NULL; 222998eaaecSwdenk } 223998eaaecSwdenk if (read_nand_cached(off, size, buf) < 0) { 22432877d66Swdenk if (!ext_buf) 225998eaaecSwdenk free(buf); 226998eaaecSwdenk return NULL; 227998eaaecSwdenk } 228998eaaecSwdenk 229998eaaecSwdenk return buf; 230998eaaecSwdenk } 231998eaaecSwdenk 23270741004SIlya Yanok static void *get_node_mem_nand(u32 off, void *ext_buf) 233998eaaecSwdenk { 234998eaaecSwdenk struct jffs2_unknown_node node; 235998eaaecSwdenk void *ret = NULL; 236998eaaecSwdenk 237700a0c64SWolfgang Denk if (NULL == get_fl_mem_nand(off, sizeof(node), &node)) 238998eaaecSwdenk return NULL; 239998eaaecSwdenk 240700a0c64SWolfgang Denk if (!(ret = get_fl_mem_nand(off, node.magic == 241998eaaecSwdenk JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node), 24270741004SIlya Yanok ext_buf))) { 243998eaaecSwdenk printf("off = %#x magic %#x type %#x node.totlen = %d\n", 244998eaaecSwdenk off, node.magic, node.nodetype, node.totlen); 245998eaaecSwdenk } 246998eaaecSwdenk return ret; 247998eaaecSwdenk } 248998eaaecSwdenk 249700a0c64SWolfgang Denk static void put_fl_mem_nand(void *buf) 250998eaaecSwdenk { 251998eaaecSwdenk free(buf); 252998eaaecSwdenk } 253dd60d122SJon Loeliger #endif 254998eaaecSwdenk 2551a7f8cceSKyungmin Park #if defined(CONFIG_CMD_ONENAND) 2561a7f8cceSKyungmin Park 2571a7f8cceSKyungmin Park #include <linux/mtd/mtd.h> 2581a7f8cceSKyungmin Park #include <linux/mtd/onenand.h> 2591a7f8cceSKyungmin Park #include <onenand_uboot.h> 2601a7f8cceSKyungmin Park 2611a7f8cceSKyungmin Park #define ONENAND_PAGE_SIZE 2048 2621a7f8cceSKyungmin Park #define ONENAND_PAGE_SHIFT 11 2631a7f8cceSKyungmin Park #define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1)) 2641a7f8cceSKyungmin Park 2651a7f8cceSKyungmin Park #ifndef ONENAND_CACHE_PAGES 2661a7f8cceSKyungmin Park #define ONENAND_CACHE_PAGES 4 2671a7f8cceSKyungmin Park #endif 2681a7f8cceSKyungmin Park #define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE) 2691a7f8cceSKyungmin Park 2701a7f8cceSKyungmin Park static u8* onenand_cache; 2711a7f8cceSKyungmin Park static u32 onenand_cache_off = (u32)-1; 2721a7f8cceSKyungmin Park 2731a7f8cceSKyungmin Park static int read_onenand_cached(u32 off, u32 size, u_char *buf) 2741a7f8cceSKyungmin Park { 2751a7f8cceSKyungmin Park u32 bytes_read = 0; 2761a7f8cceSKyungmin Park size_t retlen; 2771a7f8cceSKyungmin Park int cpy_bytes; 2781a7f8cceSKyungmin Park 2791a7f8cceSKyungmin Park while (bytes_read < size) { 2801a7f8cceSKyungmin Park if ((off + bytes_read < onenand_cache_off) || 2811a7f8cceSKyungmin Park (off + bytes_read >= onenand_cache_off + ONENAND_CACHE_SIZE)) { 2821a7f8cceSKyungmin Park onenand_cache_off = (off + bytes_read) & ONENAND_PAGE_MASK; 2831a7f8cceSKyungmin Park if (!onenand_cache) { 2841a7f8cceSKyungmin Park /* This memory never gets freed but 'cause 2851a7f8cceSKyungmin Park it's a bootloader, nobody cares */ 2861a7f8cceSKyungmin Park onenand_cache = malloc(ONENAND_CACHE_SIZE); 2871a7f8cceSKyungmin Park if (!onenand_cache) { 2881a7f8cceSKyungmin Park printf("read_onenand_cached: can't alloc cache size %d bytes\n", 2891a7f8cceSKyungmin Park ONENAND_CACHE_SIZE); 2901a7f8cceSKyungmin Park return -1; 2911a7f8cceSKyungmin Park } 2921a7f8cceSKyungmin Park } 2931a7f8cceSKyungmin Park 2941a7f8cceSKyungmin Park retlen = ONENAND_CACHE_SIZE; 2951a7f8cceSKyungmin Park if (onenand_read(&onenand_mtd, onenand_cache_off, retlen, 2961a7f8cceSKyungmin Park &retlen, onenand_cache) != 0 || 2971a7f8cceSKyungmin Park retlen != ONENAND_CACHE_SIZE) { 2981a7f8cceSKyungmin Park printf("read_onenand_cached: error reading nand off %#x size %d bytes\n", 2991a7f8cceSKyungmin Park onenand_cache_off, ONENAND_CACHE_SIZE); 3001a7f8cceSKyungmin Park return -1; 3011a7f8cceSKyungmin Park } 3021a7f8cceSKyungmin Park } 3031a7f8cceSKyungmin Park cpy_bytes = onenand_cache_off + ONENAND_CACHE_SIZE - (off + bytes_read); 3041a7f8cceSKyungmin Park if (cpy_bytes > size - bytes_read) 3051a7f8cceSKyungmin Park cpy_bytes = size - bytes_read; 3061a7f8cceSKyungmin Park memcpy(buf + bytes_read, 3071a7f8cceSKyungmin Park onenand_cache + off + bytes_read - onenand_cache_off, 3081a7f8cceSKyungmin Park cpy_bytes); 3091a7f8cceSKyungmin Park bytes_read += cpy_bytes; 3101a7f8cceSKyungmin Park } 3111a7f8cceSKyungmin Park return bytes_read; 3121a7f8cceSKyungmin Park } 3131a7f8cceSKyungmin Park 3141a7f8cceSKyungmin Park static void *get_fl_mem_onenand(u32 off, u32 size, void *ext_buf) 3151a7f8cceSKyungmin Park { 3161a7f8cceSKyungmin Park u_char *buf = ext_buf ? (u_char *)ext_buf : (u_char *)malloc(size); 3171a7f8cceSKyungmin Park 3181a7f8cceSKyungmin Park if (NULL == buf) { 3191a7f8cceSKyungmin Park printf("get_fl_mem_onenand: can't alloc %d bytes\n", size); 3201a7f8cceSKyungmin Park return NULL; 3211a7f8cceSKyungmin Park } 3221a7f8cceSKyungmin Park if (read_onenand_cached(off, size, buf) < 0) { 3231a7f8cceSKyungmin Park if (!ext_buf) 3241a7f8cceSKyungmin Park free(buf); 3251a7f8cceSKyungmin Park return NULL; 3261a7f8cceSKyungmin Park } 3271a7f8cceSKyungmin Park 3281a7f8cceSKyungmin Park return buf; 3291a7f8cceSKyungmin Park } 3301a7f8cceSKyungmin Park 33170741004SIlya Yanok static void *get_node_mem_onenand(u32 off, void *ext_buf) 3321a7f8cceSKyungmin Park { 3331a7f8cceSKyungmin Park struct jffs2_unknown_node node; 3341a7f8cceSKyungmin Park void *ret = NULL; 3351a7f8cceSKyungmin Park 3361a7f8cceSKyungmin Park if (NULL == get_fl_mem_onenand(off, sizeof(node), &node)) 3371a7f8cceSKyungmin Park return NULL; 3381a7f8cceSKyungmin Park 3391a7f8cceSKyungmin Park ret = get_fl_mem_onenand(off, node.magic == 3401a7f8cceSKyungmin Park JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node), 34170741004SIlya Yanok ext_buf); 3421a7f8cceSKyungmin Park if (!ret) { 3431a7f8cceSKyungmin Park printf("off = %#x magic %#x type %#x node.totlen = %d\n", 3441a7f8cceSKyungmin Park off, node.magic, node.nodetype, node.totlen); 3451a7f8cceSKyungmin Park } 3461a7f8cceSKyungmin Park return ret; 3471a7f8cceSKyungmin Park } 3481a7f8cceSKyungmin Park 3491a7f8cceSKyungmin Park 3501a7f8cceSKyungmin Park static void put_fl_mem_onenand(void *buf) 3511a7f8cceSKyungmin Park { 3521a7f8cceSKyungmin Park free(buf); 3531a7f8cceSKyungmin Park } 3541a7f8cceSKyungmin Park #endif 3551a7f8cceSKyungmin Park 356998eaaecSwdenk 357dd60d122SJon Loeliger #if defined(CONFIG_CMD_FLASH) 358700a0c64SWolfgang Denk /* 359700a0c64SWolfgang Denk * Support for jffs2 on top of NOR-flash 360700a0c64SWolfgang Denk * 361700a0c64SWolfgang Denk * NOR flash memory is mapped in processor's address space, 362700a0c64SWolfgang Denk * just return address. 363700a0c64SWolfgang Denk */ 36470741004SIlya Yanok static inline void *get_fl_mem_nor(u32 off, u32 size, void *ext_buf) 365700a0c64SWolfgang Denk { 366700a0c64SWolfgang Denk u32 addr = off; 367700a0c64SWolfgang Denk struct mtdids *id = current_part->dev->id; 368700a0c64SWolfgang Denk 369e6f2e902SMarian Balakowicz extern flash_info_t flash_info[]; 370700a0c64SWolfgang Denk flash_info_t *flash = &flash_info[id->num]; 371700a0c64SWolfgang Denk 372700a0c64SWolfgang Denk addr += flash->start[0]; 37370741004SIlya Yanok if (ext_buf) { 37470741004SIlya Yanok memcpy(ext_buf, (void *)addr, size); 37570741004SIlya Yanok return ext_buf; 37670741004SIlya Yanok } 377700a0c64SWolfgang Denk return (void*)addr; 378700a0c64SWolfgang Denk } 379700a0c64SWolfgang Denk 38070741004SIlya Yanok static inline void *get_node_mem_nor(u32 off, void *ext_buf) 3818a36d31fSIlya Yanok { 38270741004SIlya Yanok struct jffs2_unknown_node *pNode; 3838a36d31fSIlya Yanok 38470741004SIlya Yanok /* pNode will point directly to flash - don't provide external buffer 38570741004SIlya Yanok and don't care about size */ 38670741004SIlya Yanok pNode = get_fl_mem_nor(off, 0, NULL); 38770741004SIlya Yanok return (void *)get_fl_mem_nor(off, pNode->magic == JFFS2_MAGIC_BITMASK ? 38870741004SIlya Yanok pNode->totlen : sizeof(*pNode), ext_buf); 389700a0c64SWolfgang Denk } 390dd60d122SJon Loeliger #endif 391700a0c64SWolfgang Denk 392700a0c64SWolfgang Denk 393700a0c64SWolfgang Denk /* 394700a0c64SWolfgang Denk * Generic jffs2 raw memory and node read routines. 395700a0c64SWolfgang Denk * 396700a0c64SWolfgang Denk */ 397998eaaecSwdenk static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf) 398998eaaecSwdenk { 399700a0c64SWolfgang Denk struct mtdids *id = current_part->dev->id; 400700a0c64SWolfgang Denk 4012d2018f3SHeiko Schocher switch(id->type) { 402dd60d122SJon Loeliger #if defined(CONFIG_CMD_FLASH) 4032d2018f3SHeiko Schocher case MTD_DEV_TYPE_NOR: 40470741004SIlya Yanok return get_fl_mem_nor(off, size, ext_buf); 4052d2018f3SHeiko Schocher break; 406700a0c64SWolfgang Denk #endif 407dd60d122SJon Loeliger #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND) 4082d2018f3SHeiko Schocher case MTD_DEV_TYPE_NAND: 409700a0c64SWolfgang Denk return get_fl_mem_nand(off, size, ext_buf); 4102d2018f3SHeiko Schocher break; 411700a0c64SWolfgang Denk #endif 4121a7f8cceSKyungmin Park #if defined(CONFIG_CMD_ONENAND) 4132d2018f3SHeiko Schocher case MTD_DEV_TYPE_ONENAND: 4141a7f8cceSKyungmin Park return get_fl_mem_onenand(off, size, ext_buf); 4152d2018f3SHeiko Schocher break; 4161a7f8cceSKyungmin Park #endif 4172d2018f3SHeiko Schocher default: 4182d2018f3SHeiko Schocher printf("get_fl_mem: unknown device type, " \ 4192d2018f3SHeiko Schocher "using raw offset!\n"); 4202d2018f3SHeiko Schocher } 421998eaaecSwdenk return (void*)off; 422998eaaecSwdenk } 423998eaaecSwdenk 42470741004SIlya Yanok static inline void *get_node_mem(u32 off, void *ext_buf) 425998eaaecSwdenk { 426700a0c64SWolfgang Denk struct mtdids *id = current_part->dev->id; 427700a0c64SWolfgang Denk 4282d2018f3SHeiko Schocher switch(id->type) { 429dd60d122SJon Loeliger #if defined(CONFIG_CMD_FLASH) 4302d2018f3SHeiko Schocher case MTD_DEV_TYPE_NOR: 43170741004SIlya Yanok return get_node_mem_nor(off, ext_buf); 4322d2018f3SHeiko Schocher break; 433700a0c64SWolfgang Denk #endif 434e4dbe1b2SWolfgang Denk #if defined(CONFIG_JFFS2_NAND) && \ 435dd60d122SJon Loeliger defined(CONFIG_CMD_NAND) 4362d2018f3SHeiko Schocher case MTD_DEV_TYPE_NAND: 43770741004SIlya Yanok return get_node_mem_nand(off, ext_buf); 4382d2018f3SHeiko Schocher break; 439700a0c64SWolfgang Denk #endif 4401a7f8cceSKyungmin Park #if defined(CONFIG_CMD_ONENAND) 4412d2018f3SHeiko Schocher case MTD_DEV_TYPE_ONENAND: 44270741004SIlya Yanok return get_node_mem_onenand(off, ext_buf); 4432d2018f3SHeiko Schocher break; 4441a7f8cceSKyungmin Park #endif 4452d2018f3SHeiko Schocher default: 4462d2018f3SHeiko Schocher printf("get_fl_mem: unknown device type, " \ 4472d2018f3SHeiko Schocher "using raw offset!\n"); 4482d2018f3SHeiko Schocher } 449998eaaecSwdenk return (void*)off; 450998eaaecSwdenk } 451998eaaecSwdenk 45270741004SIlya Yanok static inline void put_fl_mem(void *buf, void *ext_buf) 453998eaaecSwdenk { 454700a0c64SWolfgang Denk struct mtdids *id = current_part->dev->id; 455700a0c64SWolfgang Denk 45670741004SIlya Yanok /* If buf is the same as ext_buf, it was provided by the caller - 45770741004SIlya Yanok we shouldn't free it then. */ 45870741004SIlya Yanok if (buf == ext_buf) 45970741004SIlya Yanok return; 4602f77c7f4SScott Wood switch (id->type) { 4612f77c7f4SScott Wood #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND) 4622f77c7f4SScott Wood case MTD_DEV_TYPE_NAND: 463700a0c64SWolfgang Denk return put_fl_mem_nand(buf); 464700a0c64SWolfgang Denk #endif 4651a7f8cceSKyungmin Park #if defined(CONFIG_CMD_ONENAND) 4662f77c7f4SScott Wood case MTD_DEV_TYPE_ONENAND: 4671a7f8cceSKyungmin Park return put_fl_mem_onenand(buf); 4681a7f8cceSKyungmin Park #endif 469998eaaecSwdenk } 4702f77c7f4SScott Wood } 471998eaaecSwdenk 472fe8c2806Swdenk /* Compression names */ 473fe8c2806Swdenk static char *compr_names[] = { 474fe8c2806Swdenk "NONE", 475fe8c2806Swdenk "ZERO", 476fe8c2806Swdenk "RTIME", 477fe8c2806Swdenk "RUBINMIPS", 478fe8c2806Swdenk "COPY", 479fe8c2806Swdenk "DYNRUBIN", 48007cc0999Swdenk "ZLIB", 481f0983371SWolfgang Denk #if defined(CONFIG_JFFS2_LZO) 48207cc0999Swdenk "LZO", 48307cc0999Swdenk #endif 48406d01dbeSwdenk }; 485fe8c2806Swdenk 48606d01dbeSwdenk /* Memory management */ 48706d01dbeSwdenk struct mem_block { 48806d01dbeSwdenk u32 index; 48906d01dbeSwdenk struct mem_block *next; 49006d01dbeSwdenk struct b_node nodes[NODE_CHUNK]; 49106d01dbeSwdenk }; 492fe8c2806Swdenk 493fe8c2806Swdenk 49406d01dbeSwdenk static void 49506d01dbeSwdenk free_nodes(struct b_list *list) 49606d01dbeSwdenk { 49706d01dbeSwdenk while (list->listMemBase != NULL) { 49806d01dbeSwdenk struct mem_block *next = list->listMemBase->next; 49906d01dbeSwdenk free( list->listMemBase ); 50006d01dbeSwdenk list->listMemBase = next; 50106d01dbeSwdenk } 50206d01dbeSwdenk } 503fe8c2806Swdenk 504fe8c2806Swdenk static struct b_node * 50506d01dbeSwdenk add_node(struct b_list *list) 506fe8c2806Swdenk { 50706d01dbeSwdenk u32 index = 0; 50806d01dbeSwdenk struct mem_block *memBase; 509fe8c2806Swdenk struct b_node *b; 510fe8c2806Swdenk 51106d01dbeSwdenk memBase = list->listMemBase; 51206d01dbeSwdenk if (memBase != NULL) 51306d01dbeSwdenk index = memBase->index; 514fe8c2806Swdenk #if 0 515fe8c2806Swdenk putLabeledWord("add_node: index = ", index); 51606d01dbeSwdenk putLabeledWord("add_node: memBase = ", list->listMemBase); 517fe8c2806Swdenk #endif 518fe8c2806Swdenk 51906d01dbeSwdenk if (memBase == NULL || index >= NODE_CHUNK) { 52006d01dbeSwdenk /* we need more space before we continue */ 52106d01dbeSwdenk memBase = mmalloc(sizeof(struct mem_block)); 52206d01dbeSwdenk if (memBase == NULL) { 523fe8c2806Swdenk putstr("add_node: malloc failed\n"); 524fe8c2806Swdenk return NULL; 525fe8c2806Swdenk } 52606d01dbeSwdenk memBase->next = list->listMemBase; 52706d01dbeSwdenk index = 0; 528fe8c2806Swdenk #if 0 529fe8c2806Swdenk putLabeledWord("add_node: alloced a new membase at ", *memBase); 530fe8c2806Swdenk #endif 531fe8c2806Swdenk 532fe8c2806Swdenk } 533fe8c2806Swdenk /* now we have room to add it. */ 53406d01dbeSwdenk b = &memBase->nodes[index]; 53506d01dbeSwdenk index ++; 536fe8c2806Swdenk 53706d01dbeSwdenk memBase->index = index; 53806d01dbeSwdenk list->listMemBase = memBase; 53906d01dbeSwdenk list->listCount++; 540fe8c2806Swdenk return b; 541fe8c2806Swdenk } 542fe8c2806Swdenk 54306d01dbeSwdenk static struct b_node * 54406d01dbeSwdenk insert_node(struct b_list *list, u32 offset) 54506d01dbeSwdenk { 54606d01dbeSwdenk struct b_node *new; 5476d0f6bcfSJean-Christophe PLAGNIOL-VILLARD #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS 54806d01dbeSwdenk struct b_node *b, *prev; 54906d01dbeSwdenk #endif 55006d01dbeSwdenk 55106d01dbeSwdenk if (!(new = add_node(list))) { 55206d01dbeSwdenk putstr("add_node failed!\r\n"); 55306d01dbeSwdenk return NULL; 55406d01dbeSwdenk } 55506d01dbeSwdenk new->offset = offset; 55606d01dbeSwdenk 5576d0f6bcfSJean-Christophe PLAGNIOL-VILLARD #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS 55806d01dbeSwdenk if (list->listTail != NULL && list->listCompare(new, list->listTail)) 55906d01dbeSwdenk prev = list->listTail; 56006d01dbeSwdenk else if (list->listLast != NULL && list->listCompare(new, list->listLast)) 56106d01dbeSwdenk prev = list->listLast; 56206d01dbeSwdenk else 56306d01dbeSwdenk prev = NULL; 56406d01dbeSwdenk 56506d01dbeSwdenk for (b = (prev ? prev->next : list->listHead); 56606d01dbeSwdenk b != NULL && list->listCompare(new, b); 56706d01dbeSwdenk prev = b, b = b->next) { 56806d01dbeSwdenk list->listLoops++; 56906d01dbeSwdenk } 57006d01dbeSwdenk if (b != NULL) 57106d01dbeSwdenk list->listLast = prev; 57206d01dbeSwdenk 57306d01dbeSwdenk if (b != NULL) { 57406d01dbeSwdenk new->next = b; 57506d01dbeSwdenk if (prev != NULL) 57606d01dbeSwdenk prev->next = new; 57706d01dbeSwdenk else 57806d01dbeSwdenk list->listHead = new; 57906d01dbeSwdenk } else 58006d01dbeSwdenk #endif 58106d01dbeSwdenk { 58206d01dbeSwdenk new->next = (struct b_node *) NULL; 58306d01dbeSwdenk if (list->listTail != NULL) { 58406d01dbeSwdenk list->listTail->next = new; 58506d01dbeSwdenk list->listTail = new; 58606d01dbeSwdenk } else { 58706d01dbeSwdenk list->listTail = list->listHead = new; 58806d01dbeSwdenk } 58906d01dbeSwdenk } 59006d01dbeSwdenk 59106d01dbeSwdenk return new; 59206d01dbeSwdenk } 59306d01dbeSwdenk 5946d0f6bcfSJean-Christophe PLAGNIOL-VILLARD #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS 5957205e407Swdenk /* Sort data entries with the latest version last, so that if there 5967205e407Swdenk * is overlapping data the latest version will be used. 5977205e407Swdenk */ 59806d01dbeSwdenk static int compare_inodes(struct b_node *new, struct b_node *old) 59906d01dbeSwdenk { 600998eaaecSwdenk struct jffs2_raw_inode ojNew; 601998eaaecSwdenk struct jffs2_raw_inode ojOld; 602998eaaecSwdenk struct jffs2_raw_inode *jNew = 603998eaaecSwdenk (struct jffs2_raw_inode *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew); 604998eaaecSwdenk struct jffs2_raw_inode *jOld = 605998eaaecSwdenk (struct jffs2_raw_inode *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld); 60606d01dbeSwdenk 6077205e407Swdenk return jNew->version > jOld->version; 60806d01dbeSwdenk } 60906d01dbeSwdenk 6107205e407Swdenk /* Sort directory entries so all entries in the same directory 6117205e407Swdenk * with the same name are grouped together, with the latest version 6127205e407Swdenk * last. This makes it easy to eliminate all but the latest version 6137205e407Swdenk * by marking the previous version dead by setting the inode to 0. 6147205e407Swdenk */ 61506d01dbeSwdenk static int compare_dirents(struct b_node *new, struct b_node *old) 61606d01dbeSwdenk { 617998eaaecSwdenk struct jffs2_raw_dirent ojNew; 618998eaaecSwdenk struct jffs2_raw_dirent ojOld; 619998eaaecSwdenk struct jffs2_raw_dirent *jNew = 620998eaaecSwdenk (struct jffs2_raw_dirent *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew); 621998eaaecSwdenk struct jffs2_raw_dirent *jOld = 622998eaaecSwdenk (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld); 6237205e407Swdenk int cmp; 62406d01dbeSwdenk 6257205e407Swdenk /* ascending sort by pino */ 6267205e407Swdenk if (jNew->pino != jOld->pino) 6277205e407Swdenk return jNew->pino > jOld->pino; 6287205e407Swdenk 6297205e407Swdenk /* pino is the same, so use ascending sort by nsize, so 6307205e407Swdenk * we don't do strncmp unless we really must. 6317205e407Swdenk */ 6327205e407Swdenk if (jNew->nsize != jOld->nsize) 6337205e407Swdenk return jNew->nsize > jOld->nsize; 6347205e407Swdenk 6357205e407Swdenk /* length is also the same, so use ascending sort by name 6367205e407Swdenk */ 63777ddac94SWolfgang Denk cmp = strncmp((char *)jNew->name, (char *)jOld->name, jNew->nsize); 6387205e407Swdenk if (cmp != 0) 6397205e407Swdenk return cmp > 0; 6407205e407Swdenk 6417205e407Swdenk /* we have duplicate names in this directory, so use ascending 6427205e407Swdenk * sort by version 6437205e407Swdenk */ 6447205e407Swdenk if (jNew->version > jOld->version) { 6457205e407Swdenk /* since jNew is newer, we know jOld is not valid, so 6467205e407Swdenk * mark it with inode 0 and it will not be used 6477205e407Swdenk */ 6487205e407Swdenk jOld->ino = 0; 6497205e407Swdenk return 1; 6507205e407Swdenk } 6517205e407Swdenk 6527205e407Swdenk return 0; 65306d01dbeSwdenk } 65406d01dbeSwdenk #endif 655fe8c2806Swdenk 656700a0c64SWolfgang Denk void 657700a0c64SWolfgang Denk jffs2_free_cache(struct part_info *part) 658fe8c2806Swdenk { 65906d01dbeSwdenk struct b_lists *pL; 660fe8c2806Swdenk 66106d01dbeSwdenk if (part->jffs2_priv != NULL) { 66206d01dbeSwdenk pL = (struct b_lists *)part->jffs2_priv; 66306d01dbeSwdenk free_nodes(&pL->frag); 66406d01dbeSwdenk free_nodes(&pL->dir); 66570741004SIlya Yanok free(pL->readbuf); 66606d01dbeSwdenk free(pL); 66706d01dbeSwdenk } 668700a0c64SWolfgang Denk } 669700a0c64SWolfgang Denk 670700a0c64SWolfgang Denk static u32 671700a0c64SWolfgang Denk jffs_init_1pass_list(struct part_info *part) 672700a0c64SWolfgang Denk { 673700a0c64SWolfgang Denk struct b_lists *pL; 674700a0c64SWolfgang Denk 675700a0c64SWolfgang Denk jffs2_free_cache(part); 676700a0c64SWolfgang Denk 67706d01dbeSwdenk if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) { 67806d01dbeSwdenk pL = (struct b_lists *)part->jffs2_priv; 67906d01dbeSwdenk 68006d01dbeSwdenk memset(pL, 0, sizeof(*pL)); 6816d0f6bcfSJean-Christophe PLAGNIOL-VILLARD #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS 68206d01dbeSwdenk pL->dir.listCompare = compare_dirents; 68306d01dbeSwdenk pL->frag.listCompare = compare_inodes; 68406d01dbeSwdenk #endif 685fe8c2806Swdenk } 686fe8c2806Swdenk return 0; 687fe8c2806Swdenk } 688fe8c2806Swdenk 689fe8c2806Swdenk /* find the inode from the slashless name given a parent */ 690fe8c2806Swdenk static long 691fe8c2806Swdenk jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest) 692fe8c2806Swdenk { 693fe8c2806Swdenk struct b_node *b; 694fe8c2806Swdenk struct jffs2_raw_inode *jNode; 69506d01dbeSwdenk u32 totalSize = 0; 6967205e407Swdenk u32 latestVersion = 0; 69777ddac94SWolfgang Denk uchar *lDest; 69877ddac94SWolfgang Denk uchar *src; 699fe8c2806Swdenk int i; 700fe8c2806Swdenk u32 counter = 0; 7016d0f6bcfSJean-Christophe PLAGNIOL-VILLARD #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS 7027205e407Swdenk /* Find file size before loading any data, so fragments that 7037205e407Swdenk * start past the end of file can be ignored. A fragment 7047205e407Swdenk * that is partially in the file is loaded, so extra data may 7057205e407Swdenk * be loaded up to the next 4K boundary above the file size. 7067205e407Swdenk * This shouldn't cause trouble when loading kernel images, so 7077205e407Swdenk * we will live with it. 7087205e407Swdenk */ 7097205e407Swdenk for (b = pL->frag.listHead; b != NULL; b = b->next) { 710998eaaecSwdenk jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset, 71170741004SIlya Yanok sizeof(struct jffs2_raw_inode), pL->readbuf); 7127205e407Swdenk if ((inode == jNode->ino)) { 7137205e407Swdenk /* get actual file length from the newest node */ 7147205e407Swdenk if (jNode->version >= latestVersion) { 7157205e407Swdenk totalSize = jNode->isize; 7167205e407Swdenk latestVersion = jNode->version; 7177205e407Swdenk } 7187205e407Swdenk } 71970741004SIlya Yanok put_fl_mem(jNode, pL->readbuf); 7207205e407Swdenk } 7217205e407Swdenk #endif 722fe8c2806Swdenk 72306d01dbeSwdenk for (b = pL->frag.listHead; b != NULL; b = b->next) { 72470741004SIlya Yanok jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset, 72570741004SIlya Yanok pL->readbuf); 726fe8c2806Swdenk if ((inode == jNode->ino)) { 72706d01dbeSwdenk #if 0 728fe8c2806Swdenk putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen); 729fe8c2806Swdenk putLabeledWord("read_inode: inode = ", jNode->ino); 730fe8c2806Swdenk putLabeledWord("read_inode: version = ", jNode->version); 731fe8c2806Swdenk putLabeledWord("read_inode: isize = ", jNode->isize); 732fe8c2806Swdenk putLabeledWord("read_inode: offset = ", jNode->offset); 733fe8c2806Swdenk putLabeledWord("read_inode: csize = ", jNode->csize); 734fe8c2806Swdenk putLabeledWord("read_inode: dsize = ", jNode->dsize); 735fe8c2806Swdenk putLabeledWord("read_inode: compr = ", jNode->compr); 736fe8c2806Swdenk putLabeledWord("read_inode: usercompr = ", jNode->usercompr); 737fe8c2806Swdenk putLabeledWord("read_inode: flags = ", jNode->flags); 738fe8c2806Swdenk #endif 7397205e407Swdenk 7406d0f6bcfSJean-Christophe PLAGNIOL-VILLARD #ifndef CONFIG_SYS_JFFS2_SORT_FRAGMENTS 74106d01dbeSwdenk /* get actual file length from the newest node */ 74206d01dbeSwdenk if (jNode->version >= latestVersion) { 743fe8c2806Swdenk totalSize = jNode->isize; 74406d01dbeSwdenk latestVersion = jNode->version; 745fe8c2806Swdenk } 7467205e407Swdenk #endif 747fe8c2806Swdenk 748fe8c2806Swdenk if(dest) { 74977ddac94SWolfgang Denk src = ((uchar *) jNode) + sizeof(struct jffs2_raw_inode); 75006d01dbeSwdenk /* ignore data behind latest known EOF */ 751998eaaecSwdenk if (jNode->offset > totalSize) { 75270741004SIlya Yanok put_fl_mem(jNode, pL->readbuf); 75306d01dbeSwdenk continue; 754998eaaecSwdenk } 755142a80ffSIlya Yanok if (b->datacrc == CRC_UNKNOWN) 756142a80ffSIlya Yanok b->datacrc = data_crc(jNode) ? 757142a80ffSIlya Yanok CRC_OK : CRC_BAD; 758142a80ffSIlya Yanok if (b->datacrc == CRC_BAD) { 75970741004SIlya Yanok put_fl_mem(jNode, pL->readbuf); 7608a36d31fSIlya Yanok continue; 7618a36d31fSIlya Yanok } 76206d01dbeSwdenk 76377ddac94SWolfgang Denk lDest = (uchar *) (dest + jNode->offset); 764fe8c2806Swdenk #if 0 76506d01dbeSwdenk putLabeledWord("read_inode: src = ", src); 766fe8c2806Swdenk putLabeledWord("read_inode: dest = ", lDest); 767fe8c2806Swdenk #endif 768fe8c2806Swdenk switch (jNode->compr) { 769fe8c2806Swdenk case JFFS2_COMPR_NONE: 77016b9afd2SWolfgang Denk ldr_memcpy(lDest, src, jNode->dsize); 771fe8c2806Swdenk break; 772fe8c2806Swdenk case JFFS2_COMPR_ZERO: 773fe8c2806Swdenk for (i = 0; i < jNode->dsize; i++) 774fe8c2806Swdenk *(lDest++) = 0; 775fe8c2806Swdenk break; 776fe8c2806Swdenk case JFFS2_COMPR_RTIME: 777fe8c2806Swdenk rtime_decompress(src, lDest, jNode->csize, jNode->dsize); 778fe8c2806Swdenk break; 779fe8c2806Swdenk case JFFS2_COMPR_DYNRUBIN: 780fe8c2806Swdenk /* this is slow but it works */ 781fe8c2806Swdenk dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize); 782fe8c2806Swdenk break; 783fe8c2806Swdenk case JFFS2_COMPR_ZLIB: 78416b9afd2SWolfgang Denk zlib_decompress(src, lDest, jNode->csize, jNode->dsize); 785fe8c2806Swdenk break; 786f0983371SWolfgang Denk #if defined(CONFIG_JFFS2_LZO) 78707cc0999Swdenk case JFFS2_COMPR_LZO: 78816b9afd2SWolfgang Denk lzo_decompress(src, lDest, jNode->csize, jNode->dsize); 78907cc0999Swdenk break; 79007cc0999Swdenk #endif 791fe8c2806Swdenk default: 792fe8c2806Swdenk /* unknown */ 7936052cbabSLoïc Minier putLabeledWord("UNKNOWN COMPRESSION METHOD = ", jNode->compr); 79470741004SIlya Yanok put_fl_mem(jNode, pL->readbuf); 795fe8c2806Swdenk return -1; 796fe8c2806Swdenk break; 797fe8c2806Swdenk } 798fe8c2806Swdenk } 799fe8c2806Swdenk 800fe8c2806Swdenk #if 0 801fe8c2806Swdenk putLabeledWord("read_inode: totalSize = ", totalSize); 802fe8c2806Swdenk #endif 803fe8c2806Swdenk } 804fe8c2806Swdenk counter++; 80570741004SIlya Yanok put_fl_mem(jNode, pL->readbuf); 806fe8c2806Swdenk } 807fe8c2806Swdenk 808fe8c2806Swdenk #if 0 80906d01dbeSwdenk putLabeledWord("read_inode: returning = ", totalSize); 810fe8c2806Swdenk #endif 81106d01dbeSwdenk return totalSize; 812fe8c2806Swdenk } 813fe8c2806Swdenk 814fe8c2806Swdenk /* find the inode from the slashless name given a parent */ 815fe8c2806Swdenk static u32 816fe8c2806Swdenk jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino) 817fe8c2806Swdenk { 818fe8c2806Swdenk struct b_node *b; 819fe8c2806Swdenk struct jffs2_raw_dirent *jDir; 820fe8c2806Swdenk int len; 821fe8c2806Swdenk u32 counter; 822fe8c2806Swdenk u32 version = 0; 823fe8c2806Swdenk u32 inode = 0; 824fe8c2806Swdenk 825fe8c2806Swdenk /* name is assumed slash free */ 826fe8c2806Swdenk len = strlen(name); 827fe8c2806Swdenk 828fe8c2806Swdenk counter = 0; 829fe8c2806Swdenk /* we need to search all and return the inode with the highest version */ 83006d01dbeSwdenk for(b = pL->dir.listHead; b; b = b->next, counter++) { 83170741004SIlya Yanok jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset, 83270741004SIlya Yanok pL->readbuf); 83306d01dbeSwdenk if ((pino == jDir->pino) && (len == jDir->nsize) && 83406d01dbeSwdenk (jDir->ino) && /* 0 for unlink */ 83577ddac94SWolfgang Denk (!strncmp((char *)jDir->name, name, len))) { /* a match */ 836998eaaecSwdenk if (jDir->version < version) { 83770741004SIlya Yanok put_fl_mem(jDir, pL->readbuf); 8387205e407Swdenk continue; 839998eaaecSwdenk } 840fe8c2806Swdenk 8417205e407Swdenk if (jDir->version == version && inode != 0) { 8427205e407Swdenk /* I'm pretty sure this isn't legal */ 843fe8c2806Swdenk putstr(" ** ERROR ** "); 844fe8c2806Swdenk putnstr(jDir->name, jDir->nsize); 845fe8c2806Swdenk putLabeledWord(" has dup version =", version); 846fe8c2806Swdenk } 847fe8c2806Swdenk inode = jDir->ino; 848fe8c2806Swdenk version = jDir->version; 849fe8c2806Swdenk } 850fe8c2806Swdenk #if 0 851fe8c2806Swdenk putstr("\r\nfind_inode:p&l ->"); 852fe8c2806Swdenk putnstr(jDir->name, jDir->nsize); 853fe8c2806Swdenk putstr("\r\n"); 854fe8c2806Swdenk putLabeledWord("pino = ", jDir->pino); 855fe8c2806Swdenk putLabeledWord("nsize = ", jDir->nsize); 856fe8c2806Swdenk putLabeledWord("b = ", (u32) b); 857fe8c2806Swdenk putLabeledWord("counter = ", counter); 858fe8c2806Swdenk #endif 85970741004SIlya Yanok put_fl_mem(jDir, pL->readbuf); 860fe8c2806Swdenk } 861fe8c2806Swdenk return inode; 862fe8c2806Swdenk } 863fe8c2806Swdenk 864180d3f74Swdenk char *mkmodestr(unsigned long mode, char *str) 865fe8c2806Swdenk { 866fe8c2806Swdenk static const char *l = "xwr"; 867fe8c2806Swdenk int mask = 1, i; 868fe8c2806Swdenk char c; 869fe8c2806Swdenk 870fe8c2806Swdenk switch (mode & S_IFMT) { 871fe8c2806Swdenk case S_IFDIR: str[0] = 'd'; break; 872fe8c2806Swdenk case S_IFBLK: str[0] = 'b'; break; 873fe8c2806Swdenk case S_IFCHR: str[0] = 'c'; break; 874fe8c2806Swdenk case S_IFIFO: str[0] = 'f'; break; 875fe8c2806Swdenk case S_IFLNK: str[0] = 'l'; break; 876fe8c2806Swdenk case S_IFSOCK: str[0] = 's'; break; 877fe8c2806Swdenk case S_IFREG: str[0] = '-'; break; 878fe8c2806Swdenk default: str[0] = '?'; 879fe8c2806Swdenk } 880fe8c2806Swdenk 881fe8c2806Swdenk for(i = 0; i < 9; i++) { 882fe8c2806Swdenk c = l[i%3]; 883fe8c2806Swdenk str[9-i] = (mode & mask)?c:'-'; 884fe8c2806Swdenk mask = mask<<1; 885fe8c2806Swdenk } 886fe8c2806Swdenk 887fe8c2806Swdenk if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S'; 888fe8c2806Swdenk if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S'; 889fe8c2806Swdenk if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T'; 890fe8c2806Swdenk str[10] = '\0'; 891fe8c2806Swdenk return str; 892fe8c2806Swdenk } 893fe8c2806Swdenk 894fe8c2806Swdenk static inline void dump_stat(struct stat *st, const char *name) 895fe8c2806Swdenk { 896fe8c2806Swdenk char str[20]; 897fe8c2806Swdenk char s[64], *p; 898fe8c2806Swdenk 899fe8c2806Swdenk if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */ 900fe8c2806Swdenk st->st_mtime = 1; 901fe8c2806Swdenk 90277ddac94SWolfgang Denk ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */ 903fe8c2806Swdenk 904fe8c2806Swdenk if ((p = strchr(s,'\n')) != NULL) *p = '\0'; 905fe8c2806Swdenk if ((p = strchr(s,'\r')) != NULL) *p = '\0'; 906fe8c2806Swdenk 907fe8c2806Swdenk /* 908fe8c2806Swdenk printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str), 909fe8c2806Swdenk st->st_size, s, name); 910fe8c2806Swdenk */ 911fe8c2806Swdenk 912fe8c2806Swdenk printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name); 913fe8c2806Swdenk } 914fe8c2806Swdenk 915fe8c2806Swdenk static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i) 916fe8c2806Swdenk { 917fe8c2806Swdenk char fname[256]; 918fe8c2806Swdenk struct stat st; 919fe8c2806Swdenk 920fe8c2806Swdenk if(!d || !i) return -1; 921fe8c2806Swdenk 92277ddac94SWolfgang Denk strncpy(fname, (char *)d->name, d->nsize); 923fe8c2806Swdenk fname[d->nsize] = '\0'; 924fe8c2806Swdenk 925fe8c2806Swdenk memset(&st,0,sizeof(st)); 926fe8c2806Swdenk 927fe8c2806Swdenk st.st_mtime = i->mtime; 928fe8c2806Swdenk st.st_mode = i->mode; 929fe8c2806Swdenk st.st_ino = i->ino; 930f7384695SIlya Yanok st.st_size = i->isize; 931fe8c2806Swdenk 932fe8c2806Swdenk dump_stat(&st, fname); 933fe8c2806Swdenk 934fe8c2806Swdenk if (d->type == DT_LNK) { 935fe8c2806Swdenk unsigned char *src = (unsigned char *) (&i[1]); 936fe8c2806Swdenk putstr(" -> "); 937fe8c2806Swdenk putnstr(src, (int)i->dsize); 938fe8c2806Swdenk } 939fe8c2806Swdenk 940fe8c2806Swdenk putstr("\r\n"); 941fe8c2806Swdenk 942fe8c2806Swdenk return 0; 943fe8c2806Swdenk } 944fe8c2806Swdenk 945fe8c2806Swdenk /* list inodes with the given pino */ 946fe8c2806Swdenk static u32 947fe8c2806Swdenk jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino) 948fe8c2806Swdenk { 949fe8c2806Swdenk struct b_node *b; 950fe8c2806Swdenk struct jffs2_raw_dirent *jDir; 951fe8c2806Swdenk 95206d01dbeSwdenk for (b = pL->dir.listHead; b; b = b->next) { 95370741004SIlya Yanok jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset, 95470741004SIlya Yanok pL->readbuf); 95506d01dbeSwdenk if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */ 956fe8c2806Swdenk u32 i_version = 0; 957998eaaecSwdenk struct jffs2_raw_inode ojNode; 958fe8c2806Swdenk struct jffs2_raw_inode *jNode, *i = NULL; 95906d01dbeSwdenk struct b_node *b2 = pL->frag.listHead; 960fe8c2806Swdenk 961fe8c2806Swdenk while (b2) { 962998eaaecSwdenk jNode = (struct jffs2_raw_inode *) 963998eaaecSwdenk get_fl_mem(b2->offset, sizeof(ojNode), &ojNode); 96432877d66Swdenk if (jNode->ino == jDir->ino && jNode->version >= i_version) { 965f7384695SIlya Yanok i_version = jNode->version; 96632877d66Swdenk if (i) 96770741004SIlya Yanok put_fl_mem(i, NULL); 968cf8bc577Swdenk 969cf8bc577Swdenk if (jDir->type == DT_LNK) 97070741004SIlya Yanok i = get_node_mem(b2->offset, 97170741004SIlya Yanok NULL); 972cf8bc577Swdenk else 97370741004SIlya Yanok i = get_fl_mem(b2->offset, 97470741004SIlya Yanok sizeof(*i), 97570741004SIlya Yanok NULL); 97632877d66Swdenk } 977fe8c2806Swdenk b2 = b2->next; 978fe8c2806Swdenk } 979fe8c2806Swdenk 980fe8c2806Swdenk dump_inode(pL, jDir, i); 98170741004SIlya Yanok put_fl_mem(i, NULL); 982fe8c2806Swdenk } 98370741004SIlya Yanok put_fl_mem(jDir, pL->readbuf); 984fe8c2806Swdenk } 985fe8c2806Swdenk return pino; 986fe8c2806Swdenk } 987fe8c2806Swdenk 988fe8c2806Swdenk static u32 989fe8c2806Swdenk jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino) 990fe8c2806Swdenk { 991fe8c2806Swdenk int i; 992fe8c2806Swdenk char tmp[256]; 993fe8c2806Swdenk char working_tmp[256]; 994fe8c2806Swdenk char *c; 995fe8c2806Swdenk 996fe8c2806Swdenk /* discard any leading slash */ 997fe8c2806Swdenk i = 0; 998fe8c2806Swdenk while (fname[i] == '/') 999fe8c2806Swdenk i++; 1000fe8c2806Swdenk strcpy(tmp, &fname[i]); 1001fe8c2806Swdenk 1002fe8c2806Swdenk while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */ 1003fe8c2806Swdenk { 1004fe8c2806Swdenk strncpy(working_tmp, tmp, c - tmp); 1005fe8c2806Swdenk working_tmp[c - tmp] = '\0'; 1006fe8c2806Swdenk #if 0 1007fe8c2806Swdenk putstr("search_inode: tmp = "); 1008fe8c2806Swdenk putstr(tmp); 1009fe8c2806Swdenk putstr("\r\n"); 1010fe8c2806Swdenk putstr("search_inode: wtmp = "); 1011fe8c2806Swdenk putstr(working_tmp); 1012fe8c2806Swdenk putstr("\r\n"); 1013fe8c2806Swdenk putstr("search_inode: c = "); 1014fe8c2806Swdenk putstr(c); 1015fe8c2806Swdenk putstr("\r\n"); 1016fe8c2806Swdenk #endif 1017fe8c2806Swdenk for (i = 0; i < strlen(c) - 1; i++) 1018fe8c2806Swdenk tmp[i] = c[i + 1]; 1019fe8c2806Swdenk tmp[i] = '\0'; 1020fe8c2806Swdenk #if 0 1021fe8c2806Swdenk putstr("search_inode: post tmp = "); 1022fe8c2806Swdenk putstr(tmp); 1023fe8c2806Swdenk putstr("\r\n"); 1024fe8c2806Swdenk #endif 1025fe8c2806Swdenk 1026fe8c2806Swdenk if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) { 1027fe8c2806Swdenk putstr("find_inode failed for name="); 1028fe8c2806Swdenk putstr(working_tmp); 1029fe8c2806Swdenk putstr("\r\n"); 1030fe8c2806Swdenk return 0; 1031fe8c2806Swdenk } 1032fe8c2806Swdenk } 1033fe8c2806Swdenk /* this is for the bare filename, directories have already been mapped */ 1034fe8c2806Swdenk if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) { 1035fe8c2806Swdenk putstr("find_inode failed for name="); 1036fe8c2806Swdenk putstr(tmp); 1037fe8c2806Swdenk putstr("\r\n"); 1038fe8c2806Swdenk return 0; 1039fe8c2806Swdenk } 1040fe8c2806Swdenk return pino; 1041fe8c2806Swdenk 1042fe8c2806Swdenk } 1043fe8c2806Swdenk 1044fe8c2806Swdenk static u32 1045fe8c2806Swdenk jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino) 1046fe8c2806Swdenk { 1047fe8c2806Swdenk struct b_node *b; 1048fe8c2806Swdenk struct b_node *b2; 1049fe8c2806Swdenk struct jffs2_raw_dirent *jDir; 1050fe8c2806Swdenk struct jffs2_raw_inode *jNode; 1051998eaaecSwdenk u8 jDirFoundType = 0; 1052998eaaecSwdenk u32 jDirFoundIno = 0; 1053998eaaecSwdenk u32 jDirFoundPino = 0; 1054fe8c2806Swdenk char tmp[256]; 1055fe8c2806Swdenk u32 version = 0; 1056fe8c2806Swdenk u32 pino; 1057fe8c2806Swdenk unsigned char *src; 1058fe8c2806Swdenk 1059fe8c2806Swdenk /* we need to search all and return the inode with the highest version */ 106006d01dbeSwdenk for(b = pL->dir.listHead; b; b = b->next) { 106170741004SIlya Yanok jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset, 106270741004SIlya Yanok pL->readbuf); 1063fe8c2806Swdenk if (ino == jDir->ino) { 1064998eaaecSwdenk if (jDir->version < version) { 106570741004SIlya Yanok put_fl_mem(jDir, pL->readbuf); 10667205e407Swdenk continue; 1067998eaaecSwdenk } 1068fe8c2806Swdenk 1069998eaaecSwdenk if (jDir->version == version && jDirFoundType) { 10707205e407Swdenk /* I'm pretty sure this isn't legal */ 1071fe8c2806Swdenk putstr(" ** ERROR ** "); 1072fe8c2806Swdenk putnstr(jDir->name, jDir->nsize); 1073fe8c2806Swdenk putLabeledWord(" has dup version (resolve) = ", 1074fe8c2806Swdenk version); 1075fe8c2806Swdenk } 1076fe8c2806Swdenk 1077998eaaecSwdenk jDirFoundType = jDir->type; 1078998eaaecSwdenk jDirFoundIno = jDir->ino; 1079998eaaecSwdenk jDirFoundPino = jDir->pino; 1080fe8c2806Swdenk version = jDir->version; 1081fe8c2806Swdenk } 108270741004SIlya Yanok put_fl_mem(jDir, pL->readbuf); 1083fe8c2806Swdenk } 1084fe8c2806Swdenk /* now we found the right entry again. (shoulda returned inode*) */ 1085998eaaecSwdenk if (jDirFoundType != DT_LNK) 1086998eaaecSwdenk return jDirFoundIno; 108706d01dbeSwdenk 108806d01dbeSwdenk /* it's a soft link so we follow it again. */ 108906d01dbeSwdenk b2 = pL->frag.listHead; 1090fe8c2806Swdenk while (b2) { 109170741004SIlya Yanok jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset, 109270741004SIlya Yanok pL->readbuf); 1093998eaaecSwdenk if (jNode->ino == jDirFoundIno) { 10942729af9dSwdenk src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode); 1095fe8c2806Swdenk 1096fe8c2806Swdenk #if 0 1097fe8c2806Swdenk putLabeledWord("\t\t dsize = ", jNode->dsize); 1098fe8c2806Swdenk putstr("\t\t target = "); 1099fe8c2806Swdenk putnstr(src, jNode->dsize); 1100fe8c2806Swdenk putstr("\r\n"); 1101fe8c2806Swdenk #endif 110277ddac94SWolfgang Denk strncpy(tmp, (char *)src, jNode->dsize); 1103fe8c2806Swdenk tmp[jNode->dsize] = '\0'; 110470741004SIlya Yanok put_fl_mem(jNode, pL->readbuf); 1105fe8c2806Swdenk break; 1106fe8c2806Swdenk } 1107fe8c2806Swdenk b2 = b2->next; 110870741004SIlya Yanok put_fl_mem(jNode, pL->readbuf); 1109fe8c2806Swdenk } 1110fe8c2806Swdenk /* ok so the name of the new file to find is in tmp */ 1111fe8c2806Swdenk /* if it starts with a slash it is root based else shared dirs */ 1112fe8c2806Swdenk if (tmp[0] == '/') 1113fe8c2806Swdenk pino = 1; 1114fe8c2806Swdenk else 1115998eaaecSwdenk pino = jDirFoundPino; 1116fe8c2806Swdenk 1117fe8c2806Swdenk return jffs2_1pass_search_inode(pL, tmp, pino); 1118fe8c2806Swdenk } 1119fe8c2806Swdenk 1120fe8c2806Swdenk static u32 1121fe8c2806Swdenk jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino) 1122fe8c2806Swdenk { 1123fe8c2806Swdenk int i; 1124fe8c2806Swdenk char tmp[256]; 1125fe8c2806Swdenk char working_tmp[256]; 1126fe8c2806Swdenk char *c; 1127fe8c2806Swdenk 1128fe8c2806Swdenk /* discard any leading slash */ 1129fe8c2806Swdenk i = 0; 1130fe8c2806Swdenk while (fname[i] == '/') 1131fe8c2806Swdenk i++; 1132fe8c2806Swdenk strcpy(tmp, &fname[i]); 1133fe8c2806Swdenk working_tmp[0] = '\0'; 1134fe8c2806Swdenk while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */ 1135fe8c2806Swdenk { 1136fe8c2806Swdenk strncpy(working_tmp, tmp, c - tmp); 1137fe8c2806Swdenk working_tmp[c - tmp] = '\0'; 1138fe8c2806Swdenk for (i = 0; i < strlen(c) - 1; i++) 1139fe8c2806Swdenk tmp[i] = c[i + 1]; 1140fe8c2806Swdenk tmp[i] = '\0'; 1141fe8c2806Swdenk /* only a failure if we arent looking at top level */ 114206d01dbeSwdenk if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) && 114306d01dbeSwdenk (working_tmp[0])) { 1144fe8c2806Swdenk putstr("find_inode failed for name="); 1145fe8c2806Swdenk putstr(working_tmp); 1146fe8c2806Swdenk putstr("\r\n"); 1147fe8c2806Swdenk return 0; 1148fe8c2806Swdenk } 1149fe8c2806Swdenk } 1150fe8c2806Swdenk 1151fe8c2806Swdenk if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) { 1152fe8c2806Swdenk putstr("find_inode failed for name="); 1153fe8c2806Swdenk putstr(tmp); 1154fe8c2806Swdenk putstr("\r\n"); 1155fe8c2806Swdenk return 0; 1156fe8c2806Swdenk } 1157fe8c2806Swdenk /* this is for the bare filename, directories have already been mapped */ 1158fe8c2806Swdenk if (!(pino = jffs2_1pass_list_inodes(pL, pino))) { 1159fe8c2806Swdenk putstr("find_inode failed for name="); 1160fe8c2806Swdenk putstr(tmp); 1161fe8c2806Swdenk putstr("\r\n"); 1162fe8c2806Swdenk return 0; 1163fe8c2806Swdenk } 1164fe8c2806Swdenk return pino; 1165fe8c2806Swdenk 1166fe8c2806Swdenk } 1167fe8c2806Swdenk 1168fe8c2806Swdenk unsigned char 1169fe8c2806Swdenk jffs2_1pass_rescan_needed(struct part_info *part) 1170fe8c2806Swdenk { 1171fe8c2806Swdenk struct b_node *b; 1172998eaaecSwdenk struct jffs2_unknown_node onode; 1173fe8c2806Swdenk struct jffs2_unknown_node *node; 1174fe8c2806Swdenk struct b_lists *pL = (struct b_lists *)part->jffs2_priv; 1175fe8c2806Swdenk 1176fe8c2806Swdenk if (part->jffs2_priv == 0){ 1177fe8c2806Swdenk DEBUGF ("rescan: First time in use\n"); 1178fe8c2806Swdenk return 1; 1179fe8c2806Swdenk } 1180700a0c64SWolfgang Denk 1181fe8c2806Swdenk /* if we have no list, we need to rescan */ 118206d01dbeSwdenk if (pL->frag.listCount == 0) { 1183fe8c2806Swdenk DEBUGF ("rescan: fraglist zero\n"); 1184fe8c2806Swdenk return 1; 1185fe8c2806Swdenk } 1186fe8c2806Swdenk 118706d01dbeSwdenk /* but suppose someone reflashed a partition at the same offset... */ 118806d01dbeSwdenk b = pL->dir.listHead; 1189fe8c2806Swdenk while (b) { 1190998eaaecSwdenk node = (struct jffs2_unknown_node *) get_fl_mem(b->offset, 1191998eaaecSwdenk sizeof(onode), &onode); 1192fe8c2806Swdenk if (node->nodetype != JFFS2_NODETYPE_DIRENT) { 119306d01dbeSwdenk DEBUGF ("rescan: fs changed beneath me? (%lx)\n", 119406d01dbeSwdenk (unsigned long) b->offset); 1195fe8c2806Swdenk return 1; 1196fe8c2806Swdenk } 1197fe8c2806Swdenk b = b->next; 1198fe8c2806Swdenk } 1199fe8c2806Swdenk return 0; 1200fe8c2806Swdenk } 1201fe8c2806Swdenk 12028cf19b9fSIlya Yanok #ifdef CONFIG_JFFS2_SUMMARY 12038cf19b9fSIlya Yanok static u32 sum_get_unaligned32(u32 *ptr) 12048cf19b9fSIlya Yanok { 12058cf19b9fSIlya Yanok u32 val; 12068cf19b9fSIlya Yanok u8 *p = (u8 *)ptr; 12078cf19b9fSIlya Yanok 12088cf19b9fSIlya Yanok val = *p | (*(p + 1) << 8) | (*(p + 2) << 16) | (*(p + 3) << 24); 12098cf19b9fSIlya Yanok 12108cf19b9fSIlya Yanok return __le32_to_cpu(val); 12118cf19b9fSIlya Yanok } 12128cf19b9fSIlya Yanok 12138cf19b9fSIlya Yanok static u16 sum_get_unaligned16(u16 *ptr) 12148cf19b9fSIlya Yanok { 12158cf19b9fSIlya Yanok u16 val; 12168cf19b9fSIlya Yanok u8 *p = (u8 *)ptr; 12178cf19b9fSIlya Yanok 12188cf19b9fSIlya Yanok val = *p | (*(p + 1) << 8); 12198cf19b9fSIlya Yanok 12208cf19b9fSIlya Yanok return __le16_to_cpu(val); 12218cf19b9fSIlya Yanok } 12228cf19b9fSIlya Yanok 12239b707622SIlya Yanok #define dbg_summary(...) do {} while (0); 12248cf19b9fSIlya Yanok /* 12258cf19b9fSIlya Yanok * Process the stored summary information - helper function for 12269b707622SIlya Yanok * jffs2_sum_scan_sumnode() 12279b707622SIlya Yanok */ 12289b707622SIlya Yanok 12299b707622SIlya Yanok static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset, 12309b707622SIlya Yanok struct jffs2_raw_summary *summary, 12319b707622SIlya Yanok struct b_lists *pL) 12329b707622SIlya Yanok { 12339b707622SIlya Yanok void *sp; 12348cf19b9fSIlya Yanok int i, pass; 12358cf19b9fSIlya Yanok void *ret; 12369b707622SIlya Yanok 12378cf19b9fSIlya Yanok for (pass = 0; pass < 2; pass++) { 12389b707622SIlya Yanok sp = summary->sum; 12399b707622SIlya Yanok 12409b707622SIlya Yanok for (i = 0; i < summary->sum_num; i++) { 12418cf19b9fSIlya Yanok struct jffs2_sum_unknown_flash *spu = sp; 12429b707622SIlya Yanok dbg_summary("processing summary index %d\n", i); 12439b707622SIlya Yanok 12448cf19b9fSIlya Yanok switch (sum_get_unaligned16(&spu->nodetype)) { 12459b707622SIlya Yanok case JFFS2_NODETYPE_INODE: { 12469b707622SIlya Yanok struct jffs2_sum_inode_flash *spi; 12478cf19b9fSIlya Yanok if (pass) { 12489b707622SIlya Yanok spi = sp; 12499b707622SIlya Yanok 12508cf19b9fSIlya Yanok ret = insert_node(&pL->frag, 12518cf19b9fSIlya Yanok (u32)part->offset + 12528cf19b9fSIlya Yanok offset + 12538cf19b9fSIlya Yanok sum_get_unaligned32( 12548cf19b9fSIlya Yanok &spi->offset)); 12558cf19b9fSIlya Yanok if (ret == NULL) 12569b707622SIlya Yanok return -1; 12578cf19b9fSIlya Yanok } 12589b707622SIlya Yanok 12599b707622SIlya Yanok sp += JFFS2_SUMMARY_INODE_SIZE; 12609b707622SIlya Yanok 12619b707622SIlya Yanok break; 12629b707622SIlya Yanok } 12639b707622SIlya Yanok case JFFS2_NODETYPE_DIRENT: { 12649b707622SIlya Yanok struct jffs2_sum_dirent_flash *spd; 12659b707622SIlya Yanok spd = sp; 12668cf19b9fSIlya Yanok if (pass) { 12678cf19b9fSIlya Yanok ret = insert_node(&pL->dir, 12688cf19b9fSIlya Yanok (u32) part->offset + 12698cf19b9fSIlya Yanok offset + 12708cf19b9fSIlya Yanok sum_get_unaligned32( 12718cf19b9fSIlya Yanok &spd->offset)); 12728cf19b9fSIlya Yanok if (ret == NULL) 12739b707622SIlya Yanok return -1; 12748cf19b9fSIlya Yanok } 12759b707622SIlya Yanok 12768cf19b9fSIlya Yanok sp += JFFS2_SUMMARY_DIRENT_SIZE( 12778cf19b9fSIlya Yanok spd->nsize); 12789b707622SIlya Yanok 12799b707622SIlya Yanok break; 12809b707622SIlya Yanok } 12819b707622SIlya Yanok default : { 12828cf19b9fSIlya Yanok uint16_t nodetype = sum_get_unaligned16( 12838cf19b9fSIlya Yanok &spu->nodetype); 12848cf19b9fSIlya Yanok printf("Unsupported node type %x found" 12858cf19b9fSIlya Yanok " in summary!\n", 12868cf19b9fSIlya Yanok nodetype); 12878cf19b9fSIlya Yanok if ((nodetype & JFFS2_COMPAT_MASK) == 12888cf19b9fSIlya Yanok JFFS2_FEATURE_INCOMPAT) 12898cf19b9fSIlya Yanok return -EIO; 12908cf19b9fSIlya Yanok return -EBADMSG; 12918cf19b9fSIlya Yanok } 12929b707622SIlya Yanok } 12939b707622SIlya Yanok } 12949b707622SIlya Yanok } 12959b707622SIlya Yanok return 0; 12969b707622SIlya Yanok } 12979b707622SIlya Yanok 12989b707622SIlya Yanok /* Process the summary node - called from jffs2_scan_eraseblock() */ 12999b707622SIlya Yanok int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset, 13009b707622SIlya Yanok struct jffs2_raw_summary *summary, uint32_t sumsize, 13019b707622SIlya Yanok struct b_lists *pL) 13029b707622SIlya Yanok { 13039b707622SIlya Yanok struct jffs2_unknown_node crcnode; 13049b707622SIlya Yanok int ret, ofs; 13059b707622SIlya Yanok uint32_t crc; 13069b707622SIlya Yanok 13079b707622SIlya Yanok ofs = part->sector_size - sumsize; 13089b707622SIlya Yanok 13099b707622SIlya Yanok dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n", 13109b707622SIlya Yanok offset, offset + ofs, sumsize); 13119b707622SIlya Yanok 13129b707622SIlya Yanok /* OK, now check for node validity and CRC */ 13139b707622SIlya Yanok crcnode.magic = JFFS2_MAGIC_BITMASK; 13149b707622SIlya Yanok crcnode.nodetype = JFFS2_NODETYPE_SUMMARY; 13159b707622SIlya Yanok crcnode.totlen = summary->totlen; 13169b707622SIlya Yanok crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4); 13179b707622SIlya Yanok 13189b707622SIlya Yanok if (summary->hdr_crc != crc) { 13199b707622SIlya Yanok dbg_summary("Summary node header is corrupt (bad CRC or " 13209b707622SIlya Yanok "no summary at all)\n"); 13219b707622SIlya Yanok goto crc_err; 13229b707622SIlya Yanok } 13239b707622SIlya Yanok 13249b707622SIlya Yanok if (summary->totlen != sumsize) { 13259b707622SIlya Yanok dbg_summary("Summary node is corrupt (wrong erasesize?)\n"); 13269b707622SIlya Yanok goto crc_err; 13279b707622SIlya Yanok } 13289b707622SIlya Yanok 13299b707622SIlya Yanok crc = crc32_no_comp(0, (uchar *)summary, 13309b707622SIlya Yanok sizeof(struct jffs2_raw_summary)-8); 13319b707622SIlya Yanok 13329b707622SIlya Yanok if (summary->node_crc != crc) { 13339b707622SIlya Yanok dbg_summary("Summary node is corrupt (bad CRC)\n"); 13349b707622SIlya Yanok goto crc_err; 13359b707622SIlya Yanok } 13369b707622SIlya Yanok 13379b707622SIlya Yanok crc = crc32_no_comp(0, (uchar *)summary->sum, 13389b707622SIlya Yanok sumsize - sizeof(struct jffs2_raw_summary)); 13399b707622SIlya Yanok 13409b707622SIlya Yanok if (summary->sum_crc != crc) { 13419b707622SIlya Yanok dbg_summary("Summary node data is corrupt (bad CRC)\n"); 13429b707622SIlya Yanok goto crc_err; 13439b707622SIlya Yanok } 13449b707622SIlya Yanok 13459b707622SIlya Yanok if (summary->cln_mkr) 13469b707622SIlya Yanok dbg_summary("Summary : CLEANMARKER node \n"); 13479b707622SIlya Yanok 13489b707622SIlya Yanok ret = jffs2_sum_process_sum_data(part, offset, summary, pL); 13498cf19b9fSIlya Yanok if (ret == -EBADMSG) 13508cf19b9fSIlya Yanok return 0; 13519b707622SIlya Yanok if (ret) 13529b707622SIlya Yanok return ret; /* real error */ 13539b707622SIlya Yanok 13549b707622SIlya Yanok return 1; 13559b707622SIlya Yanok 13569b707622SIlya Yanok crc_err: 13579b707622SIlya Yanok putstr("Summary node crc error, skipping summary information.\n"); 13589b707622SIlya Yanok 13599b707622SIlya Yanok return 0; 13609b707622SIlya Yanok } 13618cf19b9fSIlya Yanok #endif /* CONFIG_JFFS2_SUMMARY */ 13629b707622SIlya Yanok 136306d01dbeSwdenk #ifdef DEBUG_FRAGMENTS 136406d01dbeSwdenk static void 136506d01dbeSwdenk dump_fragments(struct b_lists *pL) 1366fe8c2806Swdenk { 1367fe8c2806Swdenk struct b_node *b; 1368998eaaecSwdenk struct jffs2_raw_inode ojNode; 1369fe8c2806Swdenk struct jffs2_raw_inode *jNode; 1370fe8c2806Swdenk 137106d01dbeSwdenk putstr("\r\n\r\n******The fragment Entries******\r\n"); 137206d01dbeSwdenk b = pL->frag.listHead; 137306d01dbeSwdenk while (b) { 1374998eaaecSwdenk jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset, 1375998eaaecSwdenk sizeof(ojNode), &ojNode); 137606d01dbeSwdenk putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset); 137706d01dbeSwdenk putLabeledWord("\tbuild_list: totlen = ", jNode->totlen); 137806d01dbeSwdenk putLabeledWord("\tbuild_list: inode = ", jNode->ino); 137906d01dbeSwdenk putLabeledWord("\tbuild_list: version = ", jNode->version); 138006d01dbeSwdenk putLabeledWord("\tbuild_list: isize = ", jNode->isize); 138106d01dbeSwdenk putLabeledWord("\tbuild_list: atime = ", jNode->atime); 138206d01dbeSwdenk putLabeledWord("\tbuild_list: offset = ", jNode->offset); 138306d01dbeSwdenk putLabeledWord("\tbuild_list: csize = ", jNode->csize); 138406d01dbeSwdenk putLabeledWord("\tbuild_list: dsize = ", jNode->dsize); 138506d01dbeSwdenk putLabeledWord("\tbuild_list: compr = ", jNode->compr); 138606d01dbeSwdenk putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr); 138706d01dbeSwdenk putLabeledWord("\tbuild_list: flags = ", jNode->flags); 13888bde7f77Swdenk putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */ 138906d01dbeSwdenk b = b->next; 139006d01dbeSwdenk } 139106d01dbeSwdenk } 139206d01dbeSwdenk #endif 139306d01dbeSwdenk 139406d01dbeSwdenk #ifdef DEBUG_DIRENTS 139506d01dbeSwdenk static void 139606d01dbeSwdenk dump_dirents(struct b_lists *pL) 139706d01dbeSwdenk { 139806d01dbeSwdenk struct b_node *b; 139906d01dbeSwdenk struct jffs2_raw_dirent *jDir; 140006d01dbeSwdenk 1401fe8c2806Swdenk putstr("\r\n\r\n******The directory Entries******\r\n"); 140206d01dbeSwdenk b = pL->dir.listHead; 1403fe8c2806Swdenk while (b) { 140470741004SIlya Yanok jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset, 140570741004SIlya Yanok pL->readbuf); 1406fe8c2806Swdenk putstr("\r\n"); 1407fe8c2806Swdenk putnstr(jDir->name, jDir->nsize); 1408fe8c2806Swdenk putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic); 1409fe8c2806Swdenk putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype); 1410fe8c2806Swdenk putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc); 1411fe8c2806Swdenk putLabeledWord("\tbuild_list: pino = ", jDir->pino); 1412fe8c2806Swdenk putLabeledWord("\tbuild_list: version = ", jDir->version); 1413fe8c2806Swdenk putLabeledWord("\tbuild_list: ino = ", jDir->ino); 1414fe8c2806Swdenk putLabeledWord("\tbuild_list: mctime = ", jDir->mctime); 1415fe8c2806Swdenk putLabeledWord("\tbuild_list: nsize = ", jDir->nsize); 1416fe8c2806Swdenk putLabeledWord("\tbuild_list: type = ", jDir->type); 1417fe8c2806Swdenk putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc); 1418fe8c2806Swdenk putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc); 14198bde7f77Swdenk putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */ 1420fe8c2806Swdenk b = b->next; 142170741004SIlya Yanok put_fl_mem(jDir, pL->readbuf); 1422fe8c2806Swdenk } 1423fe8c2806Swdenk } 142406d01dbeSwdenk #endif 142506d01dbeSwdenk 14268a36d31fSIlya Yanok #define DEFAULT_EMPTY_SCAN_SIZE 4096 14278a36d31fSIlya Yanok 14288a36d31fSIlya Yanok static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size) 14298a36d31fSIlya Yanok { 14308a36d31fSIlya Yanok if (sector_size < DEFAULT_EMPTY_SCAN_SIZE) 14318a36d31fSIlya Yanok return sector_size; 14328a36d31fSIlya Yanok else 14338a36d31fSIlya Yanok return DEFAULT_EMPTY_SCAN_SIZE; 14348a36d31fSIlya Yanok } 14358a36d31fSIlya Yanok 143606d01dbeSwdenk static u32 143706d01dbeSwdenk jffs2_1pass_build_lists(struct part_info * part) 143806d01dbeSwdenk { 143906d01dbeSwdenk struct b_lists *pL; 144006d01dbeSwdenk struct jffs2_unknown_node *node; 14418a36d31fSIlya Yanok u32 nr_sectors = part->size/part->sector_size; 14428a36d31fSIlya Yanok u32 i; 144306d01dbeSwdenk u32 counter4 = 0; 144406d01dbeSwdenk u32 counterF = 0; 144506d01dbeSwdenk u32 counterN = 0; 144670741004SIlya Yanok u32 max_totlen = 0; 14478a36d31fSIlya Yanok u32 buf_size = DEFAULT_EMPTY_SCAN_SIZE; 14488a36d31fSIlya Yanok char *buf; 144906d01dbeSwdenk 145006d01dbeSwdenk /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */ 145106d01dbeSwdenk /* jffs2 list building enterprise nope. in newer versions the overhead is */ 145206d01dbeSwdenk /* only about 5 %. not enough to inconvenience people for. */ 145306d01dbeSwdenk /* lcd_off(); */ 145406d01dbeSwdenk 145506d01dbeSwdenk /* if we are building a list we need to refresh the cache. */ 145606d01dbeSwdenk jffs_init_1pass_list(part); 145706d01dbeSwdenk pL = (struct b_lists *)part->jffs2_priv; 14588a36d31fSIlya Yanok buf = malloc(buf_size); 14594b9206edSwdenk puts ("Scanning JFFS2 FS: "); 146006d01dbeSwdenk 146106d01dbeSwdenk /* start at the beginning of the partition */ 14628a36d31fSIlya Yanok for (i = 0; i < nr_sectors; i++) { 14638a36d31fSIlya Yanok uint32_t sector_ofs = i * part->sector_size; 14648a36d31fSIlya Yanok uint32_t buf_ofs = sector_ofs; 14659b707622SIlya Yanok uint32_t buf_len; 14668a36d31fSIlya Yanok uint32_t ofs, prevofs; 14678cf19b9fSIlya Yanok #ifdef CONFIG_JFFS2_SUMMARY 14689b707622SIlya Yanok struct jffs2_sum_marker *sm; 14699b707622SIlya Yanok void *sumptr = NULL; 14709b707622SIlya Yanok uint32_t sumlen; 14719b707622SIlya Yanok int ret; 14728cf19b9fSIlya Yanok #endif 14730b8fa03bSwdenk 147486d3273eSStuart Wood WATCHDOG_RESET(); 14759b707622SIlya Yanok 14768cf19b9fSIlya Yanok #ifdef CONFIG_JFFS2_SUMMARY 14779b707622SIlya Yanok buf_len = sizeof(*sm); 14789b707622SIlya Yanok 14799b707622SIlya Yanok /* Read as much as we want into the _end_ of the preallocated 14809b707622SIlya Yanok * buffer 14819b707622SIlya Yanok */ 14829b707622SIlya Yanok get_fl_mem(part->offset + sector_ofs + part->sector_size - 14839b707622SIlya Yanok buf_len, buf_len, buf + buf_size - buf_len); 14849b707622SIlya Yanok 14859b707622SIlya Yanok sm = (void *)buf + buf_size - sizeof(*sm); 14869b707622SIlya Yanok if (sm->magic == JFFS2_SUM_MAGIC) { 14879b707622SIlya Yanok sumlen = part->sector_size - sm->offset; 14889b707622SIlya Yanok sumptr = buf + buf_size - sumlen; 14899b707622SIlya Yanok 14909b707622SIlya Yanok /* Now, make sure the summary itself is available */ 14919b707622SIlya Yanok if (sumlen > buf_size) { 14929b707622SIlya Yanok /* Need to kmalloc for this. */ 14939b707622SIlya Yanok sumptr = malloc(sumlen); 14949b707622SIlya Yanok if (!sumptr) { 14959b707622SIlya Yanok putstr("Can't get memory for summary " 14969b707622SIlya Yanok "node!\n"); 1497b644006eSIlya Yanok free(buf); 1498b644006eSIlya Yanok jffs2_free_cache(part); 14999b707622SIlya Yanok return 0; 15009b707622SIlya Yanok } 15019b707622SIlya Yanok memcpy(sumptr + sumlen - buf_len, buf + 15029b707622SIlya Yanok buf_size - buf_len, buf_len); 15039b707622SIlya Yanok } 15049b707622SIlya Yanok if (buf_len < sumlen) { 15059b707622SIlya Yanok /* Need to read more so that the entire summary 15069b707622SIlya Yanok * node is present 15079b707622SIlya Yanok */ 15089b707622SIlya Yanok get_fl_mem(part->offset + sector_ofs + 15099b707622SIlya Yanok part->sector_size - sumlen, 15109b707622SIlya Yanok sumlen - buf_len, sumptr); 15119b707622SIlya Yanok } 15129b707622SIlya Yanok } 15139b707622SIlya Yanok 15149b707622SIlya Yanok if (sumptr) { 15159b707622SIlya Yanok ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr, 15169b707622SIlya Yanok sumlen, pL); 15179b707622SIlya Yanok 15189b707622SIlya Yanok if (buf_size && sumlen > buf_size) 15199b707622SIlya Yanok free(sumptr); 1520b644006eSIlya Yanok if (ret < 0) { 1521b644006eSIlya Yanok free(buf); 1522b644006eSIlya Yanok jffs2_free_cache(part); 15239b707622SIlya Yanok return 0; 1524b644006eSIlya Yanok } 15259b707622SIlya Yanok if (ret) 15269b707622SIlya Yanok continue; 15279b707622SIlya Yanok 15289b707622SIlya Yanok } 15298cf19b9fSIlya Yanok #endif /* CONFIG_JFFS2_SUMMARY */ 15309b707622SIlya Yanok 15319b707622SIlya Yanok buf_len = EMPTY_SCAN_SIZE(part->sector_size); 15329b707622SIlya Yanok 15338a36d31fSIlya Yanok get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf); 153486d3273eSStuart Wood 15358a36d31fSIlya Yanok /* We temporarily use 'ofs' as a pointer into the buffer/jeb */ 15368a36d31fSIlya Yanok ofs = 0; 15378a36d31fSIlya Yanok 15388a36d31fSIlya Yanok /* Scan only 4KiB of 0xFF before declaring it's empty */ 15398a36d31fSIlya Yanok while (ofs < EMPTY_SCAN_SIZE(part->sector_size) && 15408a36d31fSIlya Yanok *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF) 15418a36d31fSIlya Yanok ofs += 4; 15428a36d31fSIlya Yanok 15438a36d31fSIlya Yanok if (ofs == EMPTY_SCAN_SIZE(part->sector_size)) 15448a36d31fSIlya Yanok continue; 15458a36d31fSIlya Yanok 15468a36d31fSIlya Yanok ofs += sector_ofs; 15478a36d31fSIlya Yanok prevofs = ofs - 1; 15488a36d31fSIlya Yanok 15498a36d31fSIlya Yanok scan_more: 15508a36d31fSIlya Yanok while (ofs < sector_ofs + part->sector_size) { 15518a36d31fSIlya Yanok if (ofs == prevofs) { 15528a36d31fSIlya Yanok printf("offset %08x already seen, skip\n", ofs); 15538a36d31fSIlya Yanok ofs += 4; 15548a36d31fSIlya Yanok counter4++; 15558a36d31fSIlya Yanok continue; 1556998eaaecSwdenk } 15578a36d31fSIlya Yanok prevofs = ofs; 15588a36d31fSIlya Yanok if (sector_ofs + part->sector_size < 15598a36d31fSIlya Yanok ofs + sizeof(*node)) 15608a36d31fSIlya Yanok break; 15618a36d31fSIlya Yanok if (buf_ofs + buf_len < ofs + sizeof(*node)) { 15628a36d31fSIlya Yanok buf_len = min_t(uint32_t, buf_size, sector_ofs 15638a36d31fSIlya Yanok + part->sector_size - ofs); 15648a36d31fSIlya Yanok get_fl_mem((u32)part->offset + ofs, buf_len, 15658a36d31fSIlya Yanok buf); 15668a36d31fSIlya Yanok buf_ofs = ofs; 15678a36d31fSIlya Yanok } 15688a36d31fSIlya Yanok 15698a36d31fSIlya Yanok node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs]; 15708a36d31fSIlya Yanok 15718a36d31fSIlya Yanok if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) { 15728a36d31fSIlya Yanok uint32_t inbuf_ofs; 157316b9afd2SWolfgang Denk uint32_t scan_end; 15748a36d31fSIlya Yanok 15758a36d31fSIlya Yanok ofs += 4; 15768a36d31fSIlya Yanok scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE( 15778a36d31fSIlya Yanok part->sector_size)/8, 15788a36d31fSIlya Yanok buf_len); 15798a36d31fSIlya Yanok more_empty: 15808a36d31fSIlya Yanok inbuf_ofs = ofs - buf_ofs; 15818a36d31fSIlya Yanok while (inbuf_ofs < scan_end) { 15828a36d31fSIlya Yanok if (*(uint32_t *)(&buf[inbuf_ofs]) != 15838a36d31fSIlya Yanok 0xffffffff) 15848a36d31fSIlya Yanok goto scan_more; 15858a36d31fSIlya Yanok 15868a36d31fSIlya Yanok inbuf_ofs += 4; 15878a36d31fSIlya Yanok ofs += 4; 15888a36d31fSIlya Yanok } 15898a36d31fSIlya Yanok /* Ran off end. */ 15908a36d31fSIlya Yanok 15918a36d31fSIlya Yanok /* See how much more there is to read in this 15928a36d31fSIlya Yanok * eraseblock... 15938a36d31fSIlya Yanok */ 15948a36d31fSIlya Yanok buf_len = min_t(uint32_t, buf_size, 15958a36d31fSIlya Yanok sector_ofs + 15968a36d31fSIlya Yanok part->sector_size - ofs); 15978a36d31fSIlya Yanok if (!buf_len) { 15988a36d31fSIlya Yanok /* No more to read. Break out of main 15998a36d31fSIlya Yanok * loop without marking this range of 16008a36d31fSIlya Yanok * empty space as dirty (because it's 16018a36d31fSIlya Yanok * not) 16028a36d31fSIlya Yanok */ 16038a36d31fSIlya Yanok break; 16048a36d31fSIlya Yanok } 16058a36d31fSIlya Yanok scan_end = buf_len; 16068a36d31fSIlya Yanok get_fl_mem((u32)part->offset + ofs, buf_len, 16078a36d31fSIlya Yanok buf); 16088a36d31fSIlya Yanok buf_ofs = ofs; 16098a36d31fSIlya Yanok goto more_empty; 16108a36d31fSIlya Yanok } 16118a36d31fSIlya Yanok if (node->magic != JFFS2_MAGIC_BITMASK || 16128a36d31fSIlya Yanok !hdr_crc(node)) { 16138a36d31fSIlya Yanok ofs += 4; 16148a36d31fSIlya Yanok counter4++; 16158a36d31fSIlya Yanok continue; 16168a36d31fSIlya Yanok } 16178a36d31fSIlya Yanok if (ofs + node->totlen > 16188a36d31fSIlya Yanok sector_ofs + part->sector_size) { 16198a36d31fSIlya Yanok ofs += 4; 16208a36d31fSIlya Yanok counter4++; 16218a36d31fSIlya Yanok continue; 16228a36d31fSIlya Yanok } 16238a36d31fSIlya Yanok /* if its a fragment add it */ 16248a36d31fSIlya Yanok switch (node->nodetype) { 16258a36d31fSIlya Yanok case JFFS2_NODETYPE_INODE: 16268a36d31fSIlya Yanok if (buf_ofs + buf_len < ofs + sizeof(struct 16278a36d31fSIlya Yanok jffs2_raw_inode)) { 16288a36d31fSIlya Yanok get_fl_mem((u32)part->offset + ofs, 16298a36d31fSIlya Yanok buf_len, buf); 16308a36d31fSIlya Yanok buf_ofs = ofs; 16318a36d31fSIlya Yanok node = (void *)buf; 16328a36d31fSIlya Yanok } 16338a36d31fSIlya Yanok if (!inode_crc((struct jffs2_raw_inode *) node)) 16348a36d31fSIlya Yanok break; 16358a36d31fSIlya Yanok 16368a36d31fSIlya Yanok if (insert_node(&pL->frag, (u32) part->offset + 1637b644006eSIlya Yanok ofs) == NULL) { 1638b644006eSIlya Yanok free(buf); 1639b644006eSIlya Yanok jffs2_free_cache(part); 16408a36d31fSIlya Yanok return 0; 1641b644006eSIlya Yanok } 164270741004SIlya Yanok if (max_totlen < node->totlen) 164370741004SIlya Yanok max_totlen = node->totlen; 16448a36d31fSIlya Yanok break; 16458a36d31fSIlya Yanok case JFFS2_NODETYPE_DIRENT: 16468a36d31fSIlya Yanok if (buf_ofs + buf_len < ofs + sizeof(struct 16478a36d31fSIlya Yanok jffs2_raw_dirent) + 16488a36d31fSIlya Yanok ((struct 16498a36d31fSIlya Yanok jffs2_raw_dirent *) 16508a36d31fSIlya Yanok node)->nsize) { 16518a36d31fSIlya Yanok get_fl_mem((u32)part->offset + ofs, 16528a36d31fSIlya Yanok buf_len, buf); 16538a36d31fSIlya Yanok buf_ofs = ofs; 16548a36d31fSIlya Yanok node = (void *)buf; 16558a36d31fSIlya Yanok } 16568a36d31fSIlya Yanok 16578a36d31fSIlya Yanok if (!dirent_crc((struct jffs2_raw_dirent *) 16588a36d31fSIlya Yanok node) || 16598a36d31fSIlya Yanok !dirent_name_crc( 16608a36d31fSIlya Yanok (struct 16618a36d31fSIlya Yanok jffs2_raw_dirent *) 16628a36d31fSIlya Yanok node)) 16638a36d31fSIlya Yanok break; 1664fc1cfcdbSwdenk if (! (counterN%100)) 16654b9206edSwdenk puts ("\b\b. "); 166606d01dbeSwdenk if (insert_node(&pL->dir, (u32) part->offset + 1667b644006eSIlya Yanok ofs) == NULL) { 1668b644006eSIlya Yanok free(buf); 1669b644006eSIlya Yanok jffs2_free_cache(part); 167006d01dbeSwdenk return 0; 1671b644006eSIlya Yanok } 167270741004SIlya Yanok if (max_totlen < node->totlen) 167370741004SIlya Yanok max_totlen = node->totlen; 167406d01dbeSwdenk counterN++; 16758a36d31fSIlya Yanok break; 16768a36d31fSIlya Yanok case JFFS2_NODETYPE_CLEANMARKER: 167706d01dbeSwdenk if (node->totlen != sizeof(struct jffs2_unknown_node)) 167806d01dbeSwdenk printf("OOPS Cleanmarker has bad size " 1679b64f190bSWolfgang Denk "%d != %zu\n", 1680b64f190bSWolfgang Denk node->totlen, 168106d01dbeSwdenk sizeof(struct jffs2_unknown_node)); 16828a36d31fSIlya Yanok break; 16838a36d31fSIlya Yanok case JFFS2_NODETYPE_PADDING: 16847205e407Swdenk if (node->totlen < sizeof(struct jffs2_unknown_node)) 16857205e407Swdenk printf("OOPS Padding has bad size " 1686b64f190bSWolfgang Denk "%d < %zu\n", 1687b64f190bSWolfgang Denk node->totlen, 16887205e407Swdenk sizeof(struct jffs2_unknown_node)); 16898a36d31fSIlya Yanok break; 16909b707622SIlya Yanok case JFFS2_NODETYPE_SUMMARY: 16919b707622SIlya Yanok break; 16928a36d31fSIlya Yanok default: 1693b64f190bSWolfgang Denk printf("Unknown node type: %x len %d offset 0x%x\n", 1694b64f190bSWolfgang Denk node->nodetype, 16958a36d31fSIlya Yanok node->totlen, ofs); 169606d01dbeSwdenk } 16978a36d31fSIlya Yanok ofs += ((node->totlen + 3) & ~3); 169806d01dbeSwdenk counterF++; 169906d01dbeSwdenk } 170006d01dbeSwdenk } 170106d01dbeSwdenk 17028a36d31fSIlya Yanok free(buf); 170306d01dbeSwdenk putstr("\b\b done.\r\n"); /* close off the dots */ 170470741004SIlya Yanok 170570741004SIlya Yanok /* We don't care if malloc failed - then each read operation will 170670741004SIlya Yanok * allocate its own buffer as necessary (NAND) or will read directly 170770741004SIlya Yanok * from flash (NOR). 170870741004SIlya Yanok */ 170970741004SIlya Yanok pL->readbuf = malloc(max_totlen); 171070741004SIlya Yanok 171106d01dbeSwdenk /* turn the lcd back on. */ 171206d01dbeSwdenk /* splash(); */ 171306d01dbeSwdenk 171406d01dbeSwdenk #if 0 171506d01dbeSwdenk putLabeledWord("dir entries = ", pL->dir.listCount); 171606d01dbeSwdenk putLabeledWord("frag entries = ", pL->frag.listCount); 171706d01dbeSwdenk putLabeledWord("+4 increments = ", counter4); 171806d01dbeSwdenk putLabeledWord("+file_offset increments = ", counterF); 171906d01dbeSwdenk 172006d01dbeSwdenk #endif 172106d01dbeSwdenk 172206d01dbeSwdenk #ifdef DEBUG_DIRENTS 172306d01dbeSwdenk dump_dirents(pL); 172406d01dbeSwdenk #endif 172506d01dbeSwdenk 172606d01dbeSwdenk #ifdef DEBUG_FRAGMENTS 172706d01dbeSwdenk dump_fragments(pL); 172806d01dbeSwdenk #endif 172906d01dbeSwdenk 1730fe8c2806Swdenk /* give visual feedback that we are done scanning the flash */ 1731fe8c2806Swdenk led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */ 1732fe8c2806Swdenk return 1; 1733fe8c2806Swdenk } 1734fe8c2806Swdenk 1735fe8c2806Swdenk 1736fe8c2806Swdenk static u32 1737fe8c2806Swdenk jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL) 1738fe8c2806Swdenk { 1739fe8c2806Swdenk struct b_node *b; 1740998eaaecSwdenk struct jffs2_raw_inode ojNode; 1741fe8c2806Swdenk struct jffs2_raw_inode *jNode; 1742fe8c2806Swdenk int i; 1743fe8c2806Swdenk 1744fe8c2806Swdenk for (i = 0; i < JFFS2_NUM_COMPR; i++) { 1745fe8c2806Swdenk piL->compr_info[i].num_frags = 0; 1746fe8c2806Swdenk piL->compr_info[i].compr_sum = 0; 1747fe8c2806Swdenk piL->compr_info[i].decompr_sum = 0; 1748fe8c2806Swdenk } 1749fe8c2806Swdenk 175006d01dbeSwdenk b = pL->frag.listHead; 1751fe8c2806Swdenk while (b) { 1752998eaaecSwdenk jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset, 1753998eaaecSwdenk sizeof(ojNode), &ojNode); 1754fe8c2806Swdenk if (jNode->compr < JFFS2_NUM_COMPR) { 1755fe8c2806Swdenk piL->compr_info[jNode->compr].num_frags++; 1756fe8c2806Swdenk piL->compr_info[jNode->compr].compr_sum += jNode->csize; 1757fe8c2806Swdenk piL->compr_info[jNode->compr].decompr_sum += jNode->dsize; 1758fe8c2806Swdenk } 1759fe8c2806Swdenk b = b->next; 1760fe8c2806Swdenk } 1761fe8c2806Swdenk return 0; 1762fe8c2806Swdenk } 1763fe8c2806Swdenk 1764fe8c2806Swdenk 1765fe8c2806Swdenk static struct b_lists * 1766fe8c2806Swdenk jffs2_get_list(struct part_info * part, const char *who) 1767fe8c2806Swdenk { 1768700a0c64SWolfgang Denk /* copy requested part_info struct pointer to global location */ 1769700a0c64SWolfgang Denk current_part = part; 1770700a0c64SWolfgang Denk 1771fe8c2806Swdenk if (jffs2_1pass_rescan_needed(part)) { 1772fe8c2806Swdenk if (!jffs2_1pass_build_lists(part)) { 1773fe8c2806Swdenk printf("%s: Failed to scan JFFSv2 file structure\n", who); 1774fe8c2806Swdenk return NULL; 1775fe8c2806Swdenk } 1776fe8c2806Swdenk } 1777fe8c2806Swdenk return (struct b_lists *)part->jffs2_priv; 1778fe8c2806Swdenk } 1779fe8c2806Swdenk 1780fe8c2806Swdenk 1781fe8c2806Swdenk /* Print directory / file contents */ 1782fe8c2806Swdenk u32 1783fe8c2806Swdenk jffs2_1pass_ls(struct part_info * part, const char *fname) 1784fe8c2806Swdenk { 1785fe8c2806Swdenk struct b_lists *pl; 178687b8bd5aSWolfgang Denk long ret = 1; 1787fe8c2806Swdenk u32 inode; 1788fe8c2806Swdenk 1789fe8c2806Swdenk if (! (pl = jffs2_get_list(part, "ls"))) 1790fe8c2806Swdenk return 0; 1791fe8c2806Swdenk 1792fe8c2806Swdenk if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) { 1793fe8c2806Swdenk putstr("ls: Failed to scan jffs2 file structure\r\n"); 1794fe8c2806Swdenk return 0; 1795fe8c2806Swdenk } 1796fc1cfcdbSwdenk 1797fc1cfcdbSwdenk 1798fe8c2806Swdenk #if 0 1799fe8c2806Swdenk putLabeledWord("found file at inode = ", inode); 1800fe8c2806Swdenk putLabeledWord("read_inode returns = ", ret); 1801fe8c2806Swdenk #endif 1802fc1cfcdbSwdenk 1803fc1cfcdbSwdenk return ret; 1804fe8c2806Swdenk } 1805fe8c2806Swdenk 1806fe8c2806Swdenk 1807fe8c2806Swdenk /* Load a file from flash into memory. fname can be a full path */ 1808fe8c2806Swdenk u32 1809fe8c2806Swdenk jffs2_1pass_load(char *dest, struct part_info * part, const char *fname) 1810fe8c2806Swdenk { 1811fe8c2806Swdenk 1812fe8c2806Swdenk struct b_lists *pl; 181387b8bd5aSWolfgang Denk long ret = 1; 1814fe8c2806Swdenk u32 inode; 1815fe8c2806Swdenk 1816fe8c2806Swdenk if (! (pl = jffs2_get_list(part, "load"))) 1817fe8c2806Swdenk return 0; 1818fe8c2806Swdenk 1819fe8c2806Swdenk if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) { 1820fe8c2806Swdenk putstr("load: Failed to find inode\r\n"); 1821fe8c2806Swdenk return 0; 1822fe8c2806Swdenk } 1823fe8c2806Swdenk 1824fe8c2806Swdenk /* Resolve symlinks */ 1825fe8c2806Swdenk if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) { 1826fe8c2806Swdenk putstr("load: Failed to resolve inode structure\r\n"); 1827fe8c2806Swdenk return 0; 1828fe8c2806Swdenk } 1829fe8c2806Swdenk 1830fe8c2806Swdenk if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) { 1831fe8c2806Swdenk putstr("load: Failed to read inode\r\n"); 1832fe8c2806Swdenk return 0; 1833fe8c2806Swdenk } 1834fe8c2806Swdenk 1835fe8c2806Swdenk DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname, 1836fe8c2806Swdenk (unsigned long) dest, ret); 1837fe8c2806Swdenk return ret; 1838fe8c2806Swdenk } 1839fe8c2806Swdenk 1840fe8c2806Swdenk /* Return information about the fs on this partition */ 1841fe8c2806Swdenk u32 1842fe8c2806Swdenk jffs2_1pass_info(struct part_info * part) 1843fe8c2806Swdenk { 1844fe8c2806Swdenk struct b_jffs2_info info; 1845fe8c2806Swdenk struct b_lists *pl; 1846fe8c2806Swdenk int i; 1847fe8c2806Swdenk 1848fe8c2806Swdenk if (! (pl = jffs2_get_list(part, "info"))) 1849fe8c2806Swdenk return 0; 1850fe8c2806Swdenk 1851fe8c2806Swdenk jffs2_1pass_fill_info(pl, &info); 1852fe8c2806Swdenk for (i = 0; i < JFFS2_NUM_COMPR; i++) { 18534b9206edSwdenk printf ("Compression: %s\n" 18544b9206edSwdenk "\tfrag count: %d\n" 18554b9206edSwdenk "\tcompressed sum: %d\n" 18564b9206edSwdenk "\tuncompressed sum: %d\n", 18574b9206edSwdenk compr_names[i], 18584b9206edSwdenk info.compr_info[i].num_frags, 18594b9206edSwdenk info.compr_info[i].compr_sum, 18604b9206edSwdenk info.compr_info[i].decompr_sum); 1861fe8c2806Swdenk } 1862fe8c2806Swdenk return 1; 1863fe8c2806Swdenk } 1864