11da177e4SLinus Torvalds /* 21da177e4SLinus Torvalds * JFFS2 -- Journalling Flash File System, Version 2. 31da177e4SLinus Torvalds * 41da177e4SLinus Torvalds * Copyright (C) 2001-2003 Red Hat, Inc. 51da177e4SLinus Torvalds * 61da177e4SLinus Torvalds * Created by David Woodhouse <dwmw2@infradead.org> 71da177e4SLinus Torvalds * 81da177e4SLinus Torvalds * For licensing information, see the file 'LICENCE' in this directory. 91da177e4SLinus Torvalds * 103a69e0cdSArtem B. Bityutskiy * $Id: nodelist.h,v 1.138 2005/08/17 13:46:23 dedekind Exp $ 111da177e4SLinus Torvalds * 121da177e4SLinus Torvalds */ 131da177e4SLinus Torvalds 141da177e4SLinus Torvalds #ifndef __JFFS2_NODELIST_H__ 151da177e4SLinus Torvalds #define __JFFS2_NODELIST_H__ 161da177e4SLinus Torvalds 171da177e4SLinus Torvalds #include <linux/config.h> 181da177e4SLinus Torvalds #include <linux/fs.h> 191da177e4SLinus Torvalds #include <linux/types.h> 201da177e4SLinus Torvalds #include <linux/jffs2.h> 211da177e4SLinus Torvalds #include <linux/jffs2_fs_sb.h> 221da177e4SLinus Torvalds #include <linux/jffs2_fs_i.h> 231da177e4SLinus Torvalds 241da177e4SLinus Torvalds #ifdef __ECOS 251da177e4SLinus Torvalds #include "os-ecos.h" 261da177e4SLinus Torvalds #else 27730554d9SArtem B. Bityutskiy #include <linux/mtd/compatmac.h> /* For compatibility with older kernels */ 281da177e4SLinus Torvalds #include "os-linux.h" 291da177e4SLinus Torvalds #endif 301da177e4SLinus Torvalds 311da177e4SLinus Torvalds #define JFFS2_NATIVE_ENDIAN 321da177e4SLinus Torvalds 331da177e4SLinus Torvalds /* Note we handle mode bits conversion from JFFS2 (i.e. Linux) to/from 341da177e4SLinus Torvalds whatever OS we're actually running on here too. */ 351da177e4SLinus Torvalds 361da177e4SLinus Torvalds #if defined(JFFS2_NATIVE_ENDIAN) 371da177e4SLinus Torvalds #define cpu_to_je16(x) ((jint16_t){x}) 381da177e4SLinus Torvalds #define cpu_to_je32(x) ((jint32_t){x}) 391da177e4SLinus Torvalds #define cpu_to_jemode(x) ((jmode_t){os_to_jffs2_mode(x)}) 401da177e4SLinus Torvalds 411da177e4SLinus Torvalds #define je16_to_cpu(x) ((x).v16) 421da177e4SLinus Torvalds #define je32_to_cpu(x) ((x).v32) 431da177e4SLinus Torvalds #define jemode_to_cpu(x) (jffs2_to_os_mode((x).m)) 441da177e4SLinus Torvalds #elif defined(JFFS2_BIG_ENDIAN) 451da177e4SLinus Torvalds #define cpu_to_je16(x) ((jint16_t){cpu_to_be16(x)}) 461da177e4SLinus Torvalds #define cpu_to_je32(x) ((jint32_t){cpu_to_be32(x)}) 471da177e4SLinus Torvalds #define cpu_to_jemode(x) ((jmode_t){cpu_to_be32(os_to_jffs2_mode(x))}) 481da177e4SLinus Torvalds 491da177e4SLinus Torvalds #define je16_to_cpu(x) (be16_to_cpu(x.v16)) 501da177e4SLinus Torvalds #define je32_to_cpu(x) (be32_to_cpu(x.v32)) 511da177e4SLinus Torvalds #define jemode_to_cpu(x) (be32_to_cpu(jffs2_to_os_mode((x).m))) 521da177e4SLinus Torvalds #elif defined(JFFS2_LITTLE_ENDIAN) 531da177e4SLinus Torvalds #define cpu_to_je16(x) ((jint16_t){cpu_to_le16(x)}) 541da177e4SLinus Torvalds #define cpu_to_je32(x) ((jint32_t){cpu_to_le32(x)}) 551da177e4SLinus Torvalds #define cpu_to_jemode(x) ((jmode_t){cpu_to_le32(os_to_jffs2_mode(x))}) 561da177e4SLinus Torvalds 571da177e4SLinus Torvalds #define je16_to_cpu(x) (le16_to_cpu(x.v16)) 581da177e4SLinus Torvalds #define je32_to_cpu(x) (le32_to_cpu(x.v32)) 591da177e4SLinus Torvalds #define jemode_to_cpu(x) (le32_to_cpu(jffs2_to_os_mode((x).m))) 601da177e4SLinus Torvalds #else 611da177e4SLinus Torvalds #error wibble 621da177e4SLinus Torvalds #endif 631da177e4SLinus Torvalds 641e0da3cbSArtem B. Bityutskiy /* The minimal node header size */ 651e0da3cbSArtem B. Bityutskiy #define JFFS2_MIN_NODE_HEADER sizeof(struct jffs2_raw_dirent) 661e0da3cbSArtem B. Bityutskiy 671da177e4SLinus Torvalds /* 681da177e4SLinus Torvalds This is all we need to keep in-core for each raw node during normal 691da177e4SLinus Torvalds operation. As and when we do read_inode on a particular inode, we can 701da177e4SLinus Torvalds scan the nodes which are listed for it and build up a proper map of 711da177e4SLinus Torvalds which nodes are currently valid. JFFSv1 always used to keep that whole 721da177e4SLinus Torvalds map in core for each inode. 731da177e4SLinus Torvalds */ 741da177e4SLinus Torvalds struct jffs2_raw_node_ref 751da177e4SLinus Torvalds { 761da177e4SLinus Torvalds struct jffs2_raw_node_ref *next_in_ino; /* Points to the next raw_node_ref 771da177e4SLinus Torvalds for this inode. If this is the last, it points to the inode_cache 781da177e4SLinus Torvalds for this inode instead. The inode_cache will have NULL in the first 791da177e4SLinus Torvalds word so you know when you've got there :) */ 801da177e4SLinus Torvalds struct jffs2_raw_node_ref *next_phys; 811da177e4SLinus Torvalds uint32_t flash_offset; 821da177e4SLinus Torvalds uint32_t __totlen; /* This may die; use ref_totlen(c, jeb, ) below */ 831da177e4SLinus Torvalds }; 841da177e4SLinus Torvalds 851da177e4SLinus Torvalds /* flash_offset & 3 always has to be zero, because nodes are 861da177e4SLinus Torvalds always aligned at 4 bytes. So we have a couple of extra bits 871da177e4SLinus Torvalds to play with, which indicate the node's status; see below: */ 881da177e4SLinus Torvalds #define REF_UNCHECKED 0 /* We haven't yet checked the CRC or built its inode */ 891da177e4SLinus Torvalds #define REF_OBSOLETE 1 /* Obsolete, can be completely ignored */ 901da177e4SLinus Torvalds #define REF_PRISTINE 2 /* Completely clean. GC without looking */ 911da177e4SLinus Torvalds #define REF_NORMAL 3 /* Possibly overlapped. Read the page and write again on GC */ 921da177e4SLinus Torvalds #define ref_flags(ref) ((ref)->flash_offset & 3) 931da177e4SLinus Torvalds #define ref_offset(ref) ((ref)->flash_offset & ~3) 941da177e4SLinus Torvalds #define ref_obsolete(ref) (((ref)->flash_offset & 3) == REF_OBSOLETE) 951da177e4SLinus Torvalds #define mark_ref_normal(ref) do { (ref)->flash_offset = ref_offset(ref) | REF_NORMAL; } while(0) 961da177e4SLinus Torvalds 971da177e4SLinus Torvalds /* For each inode in the filesystem, we need to keep a record of 981da177e4SLinus Torvalds nlink, because it would be a PITA to scan the whole directory tree 991da177e4SLinus Torvalds at read_inode() time to calculate it, and to keep sufficient information 1001da177e4SLinus Torvalds in the raw_node_ref (basically both parent and child inode number for 1011da177e4SLinus Torvalds dirent nodes) would take more space than this does. We also keep 1021da177e4SLinus Torvalds a pointer to the first physical node which is part of this inode, too. 1031da177e4SLinus Torvalds */ 1041da177e4SLinus Torvalds struct jffs2_inode_cache { 1051da177e4SLinus Torvalds struct jffs2_full_dirent *scan_dents; /* Used during scan to hold 1061da177e4SLinus Torvalds temporary lists of dirents, and later must be set to 1071da177e4SLinus Torvalds NULL to mark the end of the raw_node_ref->next_in_ino 1081da177e4SLinus Torvalds chain. */ 1091da177e4SLinus Torvalds struct jffs2_inode_cache *next; 1101da177e4SLinus Torvalds struct jffs2_raw_node_ref *nodes; 1111da177e4SLinus Torvalds uint32_t ino; 1121da177e4SLinus Torvalds int nlink; 1131da177e4SLinus Torvalds int state; 1141da177e4SLinus Torvalds }; 1151da177e4SLinus Torvalds 1161da177e4SLinus Torvalds /* Inode states for 'state' above. We need the 'GC' state to prevent 1171da177e4SLinus Torvalds someone from doing a read_inode() while we're moving a 'REF_PRISTINE' 1181da177e4SLinus Torvalds node without going through all the iget() nonsense */ 1191da177e4SLinus Torvalds #define INO_STATE_UNCHECKED 0 /* CRC checks not yet done */ 1201da177e4SLinus Torvalds #define INO_STATE_CHECKING 1 /* CRC checks in progress */ 1211da177e4SLinus Torvalds #define INO_STATE_PRESENT 2 /* In core */ 1221da177e4SLinus Torvalds #define INO_STATE_CHECKEDABSENT 3 /* Checked, cleared again */ 1231da177e4SLinus Torvalds #define INO_STATE_GC 4 /* GCing a 'pristine' node */ 1241da177e4SLinus Torvalds #define INO_STATE_READING 5 /* In read_inode() */ 12567e345d1SDavid Woodhouse #define INO_STATE_CLEARING 6 /* In clear_inode() */ 1261da177e4SLinus Torvalds 1271da177e4SLinus Torvalds #define INOCACHE_HASHSIZE 128 1281da177e4SLinus Torvalds 1291da177e4SLinus Torvalds /* 1301da177e4SLinus Torvalds Larger representation of a raw node, kept in-core only when the 1311da177e4SLinus Torvalds struct inode for this particular ino is instantiated. 1321da177e4SLinus Torvalds */ 1331da177e4SLinus Torvalds 1341da177e4SLinus Torvalds struct jffs2_full_dnode 1351da177e4SLinus Torvalds { 1361da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw; 1371da177e4SLinus Torvalds uint32_t ofs; /* The offset to which the data of this node belongs */ 1381da177e4SLinus Torvalds uint32_t size; 1391da177e4SLinus Torvalds uint32_t frags; /* Number of fragments which currently refer 1401da177e4SLinus Torvalds to this node. When this reaches zero, 1411da177e4SLinus Torvalds the node is obsolete. */ 1421da177e4SLinus Torvalds }; 1431da177e4SLinus Torvalds 1441da177e4SLinus Torvalds /* 1451da177e4SLinus Torvalds Even larger representation of a raw node, kept in-core only while 1461da177e4SLinus Torvalds we're actually building up the original map of which nodes go where, 1471da177e4SLinus Torvalds in read_inode() 1481da177e4SLinus Torvalds */ 1491da177e4SLinus Torvalds struct jffs2_tmp_dnode_info 1501da177e4SLinus Torvalds { 1519dee7503SDavid Woodhouse struct rb_node rb; 1521da177e4SLinus Torvalds struct jffs2_full_dnode *fn; 1531da177e4SLinus Torvalds uint32_t version; 1541e0da3cbSArtem B. Bityutskiy uint32_t data_crc; 1551e0da3cbSArtem B. Bityutskiy uint32_t partial_crc; 1561e0da3cbSArtem B. Bityutskiy uint32_t csize; 1571da177e4SLinus Torvalds }; 1581da177e4SLinus Torvalds 1591da177e4SLinus Torvalds struct jffs2_full_dirent 1601da177e4SLinus Torvalds { 1611da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw; 1621da177e4SLinus Torvalds struct jffs2_full_dirent *next; 1631da177e4SLinus Torvalds uint32_t version; 1641da177e4SLinus Torvalds uint32_t ino; /* == zero for unlink */ 1651da177e4SLinus Torvalds unsigned int nhash; 1661da177e4SLinus Torvalds unsigned char type; 1671da177e4SLinus Torvalds unsigned char name[0]; 1681da177e4SLinus Torvalds }; 1691da177e4SLinus Torvalds 1701da177e4SLinus Torvalds /* 1711da177e4SLinus Torvalds Fragments - used to build a map of which raw node to obtain 1721da177e4SLinus Torvalds data from for each part of the ino 1731da177e4SLinus Torvalds */ 1741da177e4SLinus Torvalds struct jffs2_node_frag 1751da177e4SLinus Torvalds { 1761da177e4SLinus Torvalds struct rb_node rb; 1771da177e4SLinus Torvalds struct jffs2_full_dnode *node; /* NULL for holes */ 1781da177e4SLinus Torvalds uint32_t size; 1791da177e4SLinus Torvalds uint32_t ofs; /* The offset to which this fragment belongs */ 1801da177e4SLinus Torvalds }; 1811da177e4SLinus Torvalds 1821da177e4SLinus Torvalds struct jffs2_eraseblock 1831da177e4SLinus Torvalds { 1841da177e4SLinus Torvalds struct list_head list; 1851da177e4SLinus Torvalds int bad_count; 1861da177e4SLinus Torvalds uint32_t offset; /* of this block in the MTD */ 1871da177e4SLinus Torvalds 1881da177e4SLinus Torvalds uint32_t unchecked_size; 1891da177e4SLinus Torvalds uint32_t used_size; 1901da177e4SLinus Torvalds uint32_t dirty_size; 1911da177e4SLinus Torvalds uint32_t wasted_size; 1921da177e4SLinus Torvalds uint32_t free_size; /* Note that sector_size - free_size 1931da177e4SLinus Torvalds is the address of the first free space */ 1941da177e4SLinus Torvalds struct jffs2_raw_node_ref *first_node; 1951da177e4SLinus Torvalds struct jffs2_raw_node_ref *last_node; 1961da177e4SLinus Torvalds 1971da177e4SLinus Torvalds struct jffs2_raw_node_ref *gc_node; /* Next node to be garbage collected */ 1981da177e4SLinus Torvalds }; 1991da177e4SLinus Torvalds 2001da177e4SLinus Torvalds /* Calculate totlen from surrounding nodes or eraseblock */ 2011da177e4SLinus Torvalds static inline uint32_t __ref_totlen(struct jffs2_sb_info *c, 2021da177e4SLinus Torvalds struct jffs2_eraseblock *jeb, 2031da177e4SLinus Torvalds struct jffs2_raw_node_ref *ref) 2041da177e4SLinus Torvalds { 2051da177e4SLinus Torvalds uint32_t ref_end; 2061da177e4SLinus Torvalds 2071da177e4SLinus Torvalds if (ref->next_phys) 2081da177e4SLinus Torvalds ref_end = ref_offset(ref->next_phys); 2091da177e4SLinus Torvalds else { 2101da177e4SLinus Torvalds if (!jeb) 2111da177e4SLinus Torvalds jeb = &c->blocks[ref->flash_offset / c->sector_size]; 2121da177e4SLinus Torvalds 2131da177e4SLinus Torvalds /* Last node in block. Use free_space */ 2141da177e4SLinus Torvalds BUG_ON(ref != jeb->last_node); 2151da177e4SLinus Torvalds ref_end = jeb->offset + c->sector_size - jeb->free_size; 2161da177e4SLinus Torvalds } 2171da177e4SLinus Torvalds return ref_end - ref_offset(ref); 2181da177e4SLinus Torvalds } 2191da177e4SLinus Torvalds 2201da177e4SLinus Torvalds static inline uint32_t ref_totlen(struct jffs2_sb_info *c, 2211da177e4SLinus Torvalds struct jffs2_eraseblock *jeb, 2221da177e4SLinus Torvalds struct jffs2_raw_node_ref *ref) 2231da177e4SLinus Torvalds { 2241da177e4SLinus Torvalds uint32_t ret; 2251da177e4SLinus Torvalds 226730554d9SArtem B. Bityutskiy #if CONFIG_JFFS2_FS_DEBUG > 0 227730554d9SArtem B. Bityutskiy if (jeb && jeb != &c->blocks[ref->flash_offset / c->sector_size]) { 2281da177e4SLinus Torvalds printk(KERN_CRIT "ref_totlen called with wrong block -- at 0x%08x instead of 0x%08x; ref 0x%08x\n", 2291da177e4SLinus Torvalds jeb->offset, c->blocks[ref->flash_offset / c->sector_size].offset, ref_offset(ref)); 2301da177e4SLinus Torvalds BUG(); 231730554d9SArtem B. Bityutskiy } 232730554d9SArtem B. Bityutskiy #endif 2331da177e4SLinus Torvalds 2341da177e4SLinus Torvalds #if 1 2351da177e4SLinus Torvalds ret = ref->__totlen; 2361da177e4SLinus Torvalds #else 2371da177e4SLinus Torvalds /* This doesn't actually work yet */ 2381da177e4SLinus Torvalds ret = __ref_totlen(c, jeb, ref); 2391da177e4SLinus Torvalds if (ret != ref->__totlen) { 2401da177e4SLinus Torvalds printk(KERN_CRIT "Totlen for ref at %p (0x%08x-0x%08x) miscalculated as 0x%x instead of %x\n", 2411da177e4SLinus Torvalds ref, ref_offset(ref), ref_offset(ref)+ref->__totlen, 2421da177e4SLinus Torvalds ret, ref->__totlen); 2431da177e4SLinus Torvalds if (!jeb) 2441da177e4SLinus Torvalds jeb = &c->blocks[ref->flash_offset / c->sector_size]; 245e0c8e42fSArtem B. Bityutskiy jffs2_dbg_dump_node_refs_nolock(c, jeb); 2461da177e4SLinus Torvalds BUG(); 2471da177e4SLinus Torvalds } 2481da177e4SLinus Torvalds #endif 2491da177e4SLinus Torvalds return ret; 2501da177e4SLinus Torvalds } 2511da177e4SLinus Torvalds 2521da177e4SLinus Torvalds #define ALLOC_NORMAL 0 /* Normal allocation */ 2531da177e4SLinus Torvalds #define ALLOC_DELETION 1 /* Deletion node. Best to allow it */ 2541da177e4SLinus Torvalds #define ALLOC_GC 2 /* Space requested for GC. Give it or die */ 2551da177e4SLinus Torvalds #define ALLOC_NORETRY 3 /* For jffs2_write_dnode: On failure, return -EAGAIN instead of retrying */ 2561da177e4SLinus Torvalds 2571da177e4SLinus Torvalds /* How much dirty space before it goes on the very_dirty_list */ 2581da177e4SLinus Torvalds #define VERYDIRTY(c, size) ((size) >= ((c)->sector_size / 2)) 2591da177e4SLinus Torvalds 2601da177e4SLinus Torvalds /* check if dirty space is more than 255 Byte */ 2611da177e4SLinus Torvalds #define ISDIRTY(size) ((size) > sizeof (struct jffs2_raw_inode) + JFFS2_MIN_DATA_LEN) 2621da177e4SLinus Torvalds 2631da177e4SLinus Torvalds #define PAD(x) (((x)+3)&~3) 2641da177e4SLinus Torvalds 2651da177e4SLinus Torvalds static inline struct jffs2_inode_cache *jffs2_raw_ref_to_ic(struct jffs2_raw_node_ref *raw) 2661da177e4SLinus Torvalds { 2671da177e4SLinus Torvalds while(raw->next_in_ino) { 2681da177e4SLinus Torvalds raw = raw->next_in_ino; 2691da177e4SLinus Torvalds } 2701da177e4SLinus Torvalds 2711da177e4SLinus Torvalds return ((struct jffs2_inode_cache *)raw); 2721da177e4SLinus Torvalds } 2731da177e4SLinus Torvalds 2741da177e4SLinus Torvalds static inline struct jffs2_node_frag *frag_first(struct rb_root *root) 2751da177e4SLinus Torvalds { 2761da177e4SLinus Torvalds struct rb_node *node = root->rb_node; 2771da177e4SLinus Torvalds 2781da177e4SLinus Torvalds if (!node) 2791da177e4SLinus Torvalds return NULL; 2801da177e4SLinus Torvalds while(node->rb_left) 2811da177e4SLinus Torvalds node = node->rb_left; 2821da177e4SLinus Torvalds return rb_entry(node, struct jffs2_node_frag, rb); 2831da177e4SLinus Torvalds } 2848557fd51SArtem B. Bityuckiy 2858557fd51SArtem B. Bityuckiy static inline struct jffs2_node_frag *frag_last(struct rb_root *root) 2868557fd51SArtem B. Bityuckiy { 2878557fd51SArtem B. Bityuckiy struct rb_node *node = root->rb_node; 2888557fd51SArtem B. Bityuckiy 2898557fd51SArtem B. Bityuckiy if (!node) 2908557fd51SArtem B. Bityuckiy return NULL; 2918557fd51SArtem B. Bityuckiy while(node->rb_right) 2928557fd51SArtem B. Bityuckiy node = node->rb_right; 2938557fd51SArtem B. Bityuckiy return rb_entry(node, struct jffs2_node_frag, rb); 2948557fd51SArtem B. Bityuckiy } 2958557fd51SArtem B. Bityuckiy 2961da177e4SLinus Torvalds #define rb_parent(rb) ((rb)->rb_parent) 2971da177e4SLinus Torvalds #define frag_next(frag) rb_entry(rb_next(&(frag)->rb), struct jffs2_node_frag, rb) 2981da177e4SLinus Torvalds #define frag_prev(frag) rb_entry(rb_prev(&(frag)->rb), struct jffs2_node_frag, rb) 2991da177e4SLinus Torvalds #define frag_parent(frag) rb_entry(rb_parent(&(frag)->rb), struct jffs2_node_frag, rb) 3001da177e4SLinus Torvalds #define frag_left(frag) rb_entry((frag)->rb.rb_left, struct jffs2_node_frag, rb) 3011da177e4SLinus Torvalds #define frag_right(frag) rb_entry((frag)->rb.rb_right, struct jffs2_node_frag, rb) 3021da177e4SLinus Torvalds #define frag_erase(frag, list) rb_erase(&frag->rb, list); 3031da177e4SLinus Torvalds 3041da177e4SLinus Torvalds /* nodelist.c */ 3051da177e4SLinus Torvalds void jffs2_add_fd_to_list(struct jffs2_sb_info *c, struct jffs2_full_dirent *new, struct jffs2_full_dirent **list); 3061da177e4SLinus Torvalds void jffs2_set_inocache_state(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, int state); 3071da177e4SLinus Torvalds struct jffs2_inode_cache *jffs2_get_ino_cache(struct jffs2_sb_info *c, uint32_t ino); 3081da177e4SLinus Torvalds void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new); 3091da177e4SLinus Torvalds void jffs2_del_ino_cache(struct jffs2_sb_info *c, struct jffs2_inode_cache *old); 3101da177e4SLinus Torvalds void jffs2_free_ino_caches(struct jffs2_sb_info *c); 3111da177e4SLinus Torvalds void jffs2_free_raw_node_refs(struct jffs2_sb_info *c); 3121da177e4SLinus Torvalds struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset); 3131da177e4SLinus Torvalds void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c_delete); 3141da177e4SLinus Torvalds struct rb_node *rb_next(struct rb_node *); 3151da177e4SLinus Torvalds struct rb_node *rb_prev(struct rb_node *); 3161da177e4SLinus Torvalds void rb_replace_node(struct rb_node *victim, struct rb_node *new, struct rb_root *root); 317f97117d1SArtem B. Bityutskiy void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, struct jffs2_node_frag *this); 318f97117d1SArtem B. Bityutskiy int jffs2_add_full_dnode_to_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_full_dnode *fn); 3191e900979SArtem B. Bityutskiy void jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size); 3201e0da3cbSArtem B. Bityutskiy int jffs2_add_older_frag_to_fragtree(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_tmp_dnode_info *tn); 3211da177e4SLinus Torvalds 3221da177e4SLinus Torvalds /* nodemgmt.c */ 3231da177e4SLinus Torvalds int jffs2_thread_should_wake(struct jffs2_sb_info *c); 3241da177e4SLinus Torvalds int jffs2_reserve_space(struct jffs2_sb_info *c, uint32_t minsize, uint32_t *ofs, uint32_t *len, int prio); 3251da177e4SLinus Torvalds int jffs2_reserve_space_gc(struct jffs2_sb_info *c, uint32_t minsize, uint32_t *ofs, uint32_t *len); 3261da177e4SLinus Torvalds int jffs2_add_physical_node_ref(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *new); 3271da177e4SLinus Torvalds void jffs2_complete_reservation(struct jffs2_sb_info *c); 3281da177e4SLinus Torvalds void jffs2_mark_node_obsolete(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *raw); 3291da177e4SLinus Torvalds 3301da177e4SLinus Torvalds /* write.c */ 3311da177e4SLinus Torvalds int jffs2_do_new_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, uint32_t mode, struct jffs2_raw_inode *ri); 3321da177e4SLinus Torvalds 3331da177e4SLinus Torvalds struct jffs2_full_dnode *jffs2_write_dnode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_raw_inode *ri, const unsigned char *data, uint32_t datalen, uint32_t flash_ofs, int alloc_mode); 3341da177e4SLinus Torvalds struct jffs2_full_dirent *jffs2_write_dirent(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_raw_dirent *rd, const unsigned char *name, uint32_t namelen, uint32_t flash_ofs, int alloc_mode); 3351da177e4SLinus Torvalds int jffs2_write_inode_range(struct jffs2_sb_info *c, struct jffs2_inode_info *f, 3361da177e4SLinus Torvalds struct jffs2_raw_inode *ri, unsigned char *buf, 3371da177e4SLinus Torvalds uint32_t offset, uint32_t writelen, uint32_t *retlen); 3381da177e4SLinus Torvalds int jffs2_do_create(struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, struct jffs2_inode_info *f, struct jffs2_raw_inode *ri, const char *name, int namelen); 3393a69e0cdSArtem B. Bityutskiy int jffs2_do_unlink(struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, const char *name, int namelen, struct jffs2_inode_info *dead_f, uint32_t time); 3403a69e0cdSArtem B. Bityutskiy int jffs2_do_link (struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, uint32_t ino, uint8_t type, const char *name, int namelen, uint32_t time); 3411da177e4SLinus Torvalds 3421da177e4SLinus Torvalds 3431da177e4SLinus Torvalds /* readinode.c */ 3441da177e4SLinus Torvalds int jffs2_do_read_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, 3451da177e4SLinus Torvalds uint32_t ino, struct jffs2_raw_inode *latest_node); 3461da177e4SLinus Torvalds int jffs2_do_crccheck_inode(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic); 3471da177e4SLinus Torvalds void jffs2_do_clear_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f); 3481da177e4SLinus Torvalds 3491da177e4SLinus Torvalds /* malloc.c */ 3501da177e4SLinus Torvalds int jffs2_create_slab_caches(void); 3511da177e4SLinus Torvalds void jffs2_destroy_slab_caches(void); 3521da177e4SLinus Torvalds 3531da177e4SLinus Torvalds struct jffs2_full_dirent *jffs2_alloc_full_dirent(int namesize); 3541da177e4SLinus Torvalds void jffs2_free_full_dirent(struct jffs2_full_dirent *); 3551da177e4SLinus Torvalds struct jffs2_full_dnode *jffs2_alloc_full_dnode(void); 3561da177e4SLinus Torvalds void jffs2_free_full_dnode(struct jffs2_full_dnode *); 3571da177e4SLinus Torvalds struct jffs2_raw_dirent *jffs2_alloc_raw_dirent(void); 3581da177e4SLinus Torvalds void jffs2_free_raw_dirent(struct jffs2_raw_dirent *); 3591da177e4SLinus Torvalds struct jffs2_raw_inode *jffs2_alloc_raw_inode(void); 3601da177e4SLinus Torvalds void jffs2_free_raw_inode(struct jffs2_raw_inode *); 3611da177e4SLinus Torvalds struct jffs2_tmp_dnode_info *jffs2_alloc_tmp_dnode_info(void); 3621da177e4SLinus Torvalds void jffs2_free_tmp_dnode_info(struct jffs2_tmp_dnode_info *); 3631da177e4SLinus Torvalds struct jffs2_raw_node_ref *jffs2_alloc_raw_node_ref(void); 3641da177e4SLinus Torvalds void jffs2_free_raw_node_ref(struct jffs2_raw_node_ref *); 3651da177e4SLinus Torvalds struct jffs2_node_frag *jffs2_alloc_node_frag(void); 3661da177e4SLinus Torvalds void jffs2_free_node_frag(struct jffs2_node_frag *); 3671da177e4SLinus Torvalds struct jffs2_inode_cache *jffs2_alloc_inode_cache(void); 3681da177e4SLinus Torvalds void jffs2_free_inode_cache(struct jffs2_inode_cache *); 3691da177e4SLinus Torvalds 3701da177e4SLinus Torvalds /* gc.c */ 3711da177e4SLinus Torvalds int jffs2_garbage_collect_pass(struct jffs2_sb_info *c); 3721da177e4SLinus Torvalds 3731da177e4SLinus Torvalds /* read.c */ 3741da177e4SLinus Torvalds int jffs2_read_dnode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, 3751da177e4SLinus Torvalds struct jffs2_full_dnode *fd, unsigned char *buf, 3761da177e4SLinus Torvalds int ofs, int len); 3771da177e4SLinus Torvalds int jffs2_read_inode_range(struct jffs2_sb_info *c, struct jffs2_inode_info *f, 3781da177e4SLinus Torvalds unsigned char *buf, uint32_t offset, uint32_t len); 3791da177e4SLinus Torvalds char *jffs2_getlink(struct jffs2_sb_info *c, struct jffs2_inode_info *f); 3801da177e4SLinus Torvalds 3811da177e4SLinus Torvalds /* scan.c */ 3821da177e4SLinus Torvalds int jffs2_scan_medium(struct jffs2_sb_info *c); 3831da177e4SLinus Torvalds void jffs2_rotate_lists(struct jffs2_sb_info *c); 3841da177e4SLinus Torvalds 3851da177e4SLinus Torvalds /* build.c */ 3861da177e4SLinus Torvalds int jffs2_do_mount_fs(struct jffs2_sb_info *c); 3871da177e4SLinus Torvalds 3881da177e4SLinus Torvalds /* erase.c */ 3891da177e4SLinus Torvalds void jffs2_erase_pending_blocks(struct jffs2_sb_info *c, int count); 3901da177e4SLinus Torvalds 3912f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 3921da177e4SLinus Torvalds /* wbuf.c */ 3931da177e4SLinus Torvalds int jffs2_flush_wbuf_gc(struct jffs2_sb_info *c, uint32_t ino); 3941da177e4SLinus Torvalds int jffs2_flush_wbuf_pad(struct jffs2_sb_info *c); 3951da177e4SLinus Torvalds int jffs2_check_nand_cleanmarker(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb); 3961da177e4SLinus Torvalds int jffs2_write_nand_cleanmarker(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb); 3971da177e4SLinus Torvalds #endif 3981da177e4SLinus Torvalds 399730554d9SArtem B. Bityutskiy #include "debug.h" 400730554d9SArtem B. Bityutskiy 4011da177e4SLinus Torvalds #endif /* __JFFS2_NODELIST_H__ */ 402