/* * JFFS2 -- Journalling Flash File System, Version 2. * * Copyright © 2001-2007 Red Hat, Inc. * * Created by David Woodhouse <[email protected]> * * For licensing information, see the file 'LICENCE' in this directory. * */ #ifndef __JFFS2_NODELIST_H__ #define __JFFS2_NODELIST_H__ #include <linux/fs.h> #include <linux/types.h> #include <linux/jffs2.h> #include "jffs2_fs_sb.h" #include "jffs2_fs_i.h" #include "xattr.h" #include "acl.h" #include "summary.h" #ifdef __ECOS #include "os-ecos.h" #else #include "os-linux.h" #endif #define JFFS2_NATIVE_ENDIAN /* Note we handle mode bits conversion from JFFS2 (i.e. Linux) to/from whatever OS we're actually running on here too. */ #if defined(JFFS2_NATIVE_ENDIAN) #define cpu_to_je16(x) … #define cpu_to_je32(x) … #define cpu_to_jemode(x) … #define constant_cpu_to_je16(x) … #define constant_cpu_to_je32(x) … #define je16_to_cpu(x) … #define je32_to_cpu(x) … #define jemode_to_cpu(x) … #elif defined(JFFS2_BIG_ENDIAN) #define cpu_to_je16 … #define cpu_to_je32 … #define cpu_to_jemode … #define constant_cpu_to_je16 … #define constant_cpu_to_je32 … #define je16_to_cpu … #define je32_to_cpu … #define jemode_to_cpu … #elif defined(JFFS2_LITTLE_ENDIAN) #define cpu_to_je16 … #define cpu_to_je32 … #define cpu_to_jemode … #define constant_cpu_to_je16 … #define constant_cpu_to_je32 … #define je16_to_cpu … #define je32_to_cpu … #define jemode_to_cpu … #else #error wibble #endif /* The minimal node header size */ #define JFFS2_MIN_NODE_HEADER … /* This is all we need to keep in-core for each raw node during normal operation. As and when we do read_inode on a particular inode, we can scan the nodes which are listed for it and build up a proper map of which nodes are currently valid. JFFSv1 always used to keep that whole map in core for each inode. */ struct jffs2_raw_node_ref { … }; #define REF_LINK_NODE … #define REF_EMPTY_NODE … /* Use blocks of about 256 bytes */ #define REFS_PER_BLOCK … static inline struct jffs2_raw_node_ref *ref_next(struct jffs2_raw_node_ref *ref) { … } static inline struct jffs2_inode_cache *jffs2_raw_ref_to_ic(struct jffs2_raw_node_ref *raw) { … } /* flash_offset & 3 always has to be zero, because nodes are always aligned at 4 bytes. So we have a couple of extra bits to play with, which indicate the node's status; see below: */ #define REF_UNCHECKED … #define REF_OBSOLETE … #define REF_PRISTINE … #define REF_NORMAL … #define ref_flags(ref) … #define ref_offset(ref) … #define ref_obsolete(ref) … #define mark_ref_normal(ref) … /* Dirent nodes should be REF_PRISTINE only if they are not a deletion dirent. Deletion dirents should be REF_NORMAL so that GC gets to throw them away when appropriate */ #define dirent_node_state(rd) … /* NB: REF_PRISTINE for an inode-less node (ref->next_in_ino == NULL) indicates it is an unknown node of type JFFS2_NODETYPE_RWCOMPAT_COPY, so it'll get copied. If you need to do anything different to GC inode-less nodes, then you need to modify gc.c accordingly. */ /* For each inode in the filesystem, we need to keep a record of nlink, because it would be a PITA to scan the whole directory tree at read_inode() time to calculate it, and to keep sufficient information in the raw_node_ref (basically both parent and child inode number for dirent nodes) would take more space than this does. We also keep a pointer to the first physical node which is part of this inode, too. */ struct jffs2_inode_cache { … }; /* Inode states for 'state' above. We need the 'GC' state to prevent someone from doing a read_inode() while we're moving a 'REF_PRISTINE' node without going through all the iget() nonsense */ #define INO_STATE_UNCHECKED … #define INO_STATE_CHECKING … #define INO_STATE_PRESENT … #define INO_STATE_CHECKEDABSENT … #define INO_STATE_GC … #define INO_STATE_READING … #define INO_STATE_CLEARING … #define INO_FLAGS_XATTR_CHECKED … #define INO_FLAGS_IS_DIR … #define RAWNODE_CLASS_INODE_CACHE … #define RAWNODE_CLASS_XATTR_DATUM … #define RAWNODE_CLASS_XATTR_REF … #define INOCACHE_HASHSIZE_MIN … #define INOCACHE_HASHSIZE_MAX … #define write_ofs(c) … /* Larger representation of a raw node, kept in-core only when the struct inode for this particular ino is instantiated. */ struct jffs2_full_dnode { … }; /* Even larger representation of a raw node, kept in-core only while we're actually building up the original map of which nodes go where, in read_inode() */ struct jffs2_tmp_dnode_info { … }; /* Temporary data structure used during readinode. */ struct jffs2_readinode_info { … }; struct jffs2_full_dirent { … }; /* Fragments - used to build a map of which raw node to obtain data from for each part of the ino */ struct jffs2_node_frag { … }; struct jffs2_eraseblock { … }; static inline int jffs2_blocks_use_vmalloc(struct jffs2_sb_info *c) { … } #define ref_totlen(a, b, c) … #define ALLOC_NORMAL … #define ALLOC_DELETION … #define ALLOC_GC … #define ALLOC_NORETRY … /* How much dirty space before it goes on the very_dirty_list */ #define VERYDIRTY(c, size) … /* check if dirty space is more than 255 Byte */ #define ISDIRTY(size) … #define PAD(x) … static inline int jffs2_encode_dev(union jffs2_device_node *jdev, dev_t rdev) { … } static inline struct jffs2_node_frag *frag_first(struct rb_root *root) { … } static inline struct jffs2_node_frag *frag_last(struct rb_root *root) { … } #define frag_next(frag) … #define frag_prev(frag) … #define frag_parent(frag) … #define frag_left(frag) … #define frag_right(frag) … #define frag_erase(frag, list) … #define tn_next(tn) … #define tn_prev(tn) … #define tn_parent(tn) … #define tn_left(tn) … #define tn_right(tn) … #define tn_erase(tn, list) … #define tn_last(list) … #define tn_first(list) … /* nodelist.c */ void jffs2_add_fd_to_list(struct jffs2_sb_info *c, struct jffs2_full_dirent *new, struct jffs2_full_dirent **list); void jffs2_set_inocache_state(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, int state); struct jffs2_inode_cache *jffs2_get_ino_cache(struct jffs2_sb_info *c, uint32_t ino); void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new); void jffs2_del_ino_cache(struct jffs2_sb_info *c, struct jffs2_inode_cache *old); void jffs2_free_ino_caches(struct jffs2_sb_info *c); void jffs2_free_raw_node_refs(struct jffs2_sb_info *c); struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset); void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c_delete); int jffs2_add_full_dnode_to_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_full_dnode *fn); uint32_t jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size); struct jffs2_raw_node_ref *jffs2_link_node_ref(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t ofs, uint32_t len, struct jffs2_inode_cache *ic); extern uint32_t __jffs2_ref_totlen(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, struct jffs2_raw_node_ref *ref); /* nodemgmt.c */ int jffs2_thread_should_wake(struct jffs2_sb_info *c); int jffs2_reserve_space(struct jffs2_sb_info *c, uint32_t minsize, uint32_t *len, int prio, uint32_t sumsize); int jffs2_reserve_space_gc(struct jffs2_sb_info *c, uint32_t minsize, uint32_t *len, uint32_t sumsize); struct jffs2_raw_node_ref *jffs2_add_physical_node_ref(struct jffs2_sb_info *c, uint32_t ofs, uint32_t len, struct jffs2_inode_cache *ic); void jffs2_complete_reservation(struct jffs2_sb_info *c); void jffs2_mark_node_obsolete(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *raw); /* write.c */ int jffs2_do_new_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, uint32_t mode, struct jffs2_raw_inode *ri); 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, int alloc_mode); 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, int alloc_mode); int jffs2_write_inode_range(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_raw_inode *ri, unsigned char *buf, uint32_t offset, uint32_t writelen, uint32_t *retlen); 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 struct qstr *qstr); 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); 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); /* readinode.c */ int jffs2_do_read_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, uint32_t ino, struct jffs2_raw_inode *latest_node); int jffs2_do_crccheck_inode(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic); void jffs2_do_clear_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f); /* malloc.c */ int jffs2_create_slab_caches(void); void jffs2_destroy_slab_caches(void); struct jffs2_full_dirent *jffs2_alloc_full_dirent(int namesize); void jffs2_free_full_dirent(struct jffs2_full_dirent *); struct jffs2_full_dnode *jffs2_alloc_full_dnode(void); void jffs2_free_full_dnode(struct jffs2_full_dnode *); struct jffs2_raw_dirent *jffs2_alloc_raw_dirent(void); void jffs2_free_raw_dirent(struct jffs2_raw_dirent *); struct jffs2_raw_inode *jffs2_alloc_raw_inode(void); void jffs2_free_raw_inode(struct jffs2_raw_inode *); struct jffs2_tmp_dnode_info *jffs2_alloc_tmp_dnode_info(void); void jffs2_free_tmp_dnode_info(struct jffs2_tmp_dnode_info *); int jffs2_prealloc_raw_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, int nr); void jffs2_free_refblock(struct jffs2_raw_node_ref *); struct jffs2_node_frag *jffs2_alloc_node_frag(void); void jffs2_free_node_frag(struct jffs2_node_frag *); struct jffs2_inode_cache *jffs2_alloc_inode_cache(void); void jffs2_free_inode_cache(struct jffs2_inode_cache *); #ifdef CONFIG_JFFS2_FS_XATTR struct jffs2_xattr_datum *jffs2_alloc_xattr_datum(void); void jffs2_free_xattr_datum(struct jffs2_xattr_datum *); struct jffs2_xattr_ref *jffs2_alloc_xattr_ref(void); void jffs2_free_xattr_ref(struct jffs2_xattr_ref *); #endif /* gc.c */ int jffs2_garbage_collect_pass(struct jffs2_sb_info *c); /* read.c */ int jffs2_read_dnode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_full_dnode *fd, unsigned char *buf, int ofs, int len); int jffs2_read_inode_range(struct jffs2_sb_info *c, struct jffs2_inode_info *f, unsigned char *buf, uint32_t offset, uint32_t len); char *jffs2_getlink(struct jffs2_sb_info *c, struct jffs2_inode_info *f); /* scan.c */ int jffs2_scan_medium(struct jffs2_sb_info *c); void jffs2_rotate_lists(struct jffs2_sb_info *c); struct jffs2_inode_cache *jffs2_scan_make_ino_cache(struct jffs2_sb_info *c, uint32_t ino); int jffs2_scan_classify_jeb(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb); int jffs2_scan_dirty_space(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t size); /* build.c */ int jffs2_do_mount_fs(struct jffs2_sb_info *c); /* erase.c */ int jffs2_erase_pending_blocks(struct jffs2_sb_info *c, int count); void jffs2_free_jeb_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb); #ifdef CONFIG_JFFS2_FS_WRITEBUFFER /* wbuf.c */ int jffs2_flush_wbuf_gc(struct jffs2_sb_info *c, uint32_t ino); int jffs2_flush_wbuf_pad(struct jffs2_sb_info *c); int jffs2_check_nand_cleanmarker(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb); int jffs2_write_nand_cleanmarker(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb); #endif #include "debug.h" #endif /* __JFFS2_NODELIST_H__ */
Codebase Browser
linux