nodelist.h 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484
  1. /*
  2. * JFFS2 -- Journalling Flash File System, Version 2.
  3. *
  4. * Copyright © 2001-2007 Red Hat, Inc.
  5. *
  6. * Created by David Woodhouse <dwmw2@infradead.org>
  7. *
  8. * For licensing information, see the file 'LICENCE' in this directory.
  9. *
  10. */
  11. #ifndef __JFFS2_NODELIST_H__
  12. #define __JFFS2_NODELIST_H__
  13. #include <linux/fs.h>
  14. #include <linux/types.h>
  15. #include <linux/jffs2.h>
  16. #include "jffs2_fs_sb.h"
  17. #include "jffs2_fs_i.h"
  18. #include "xattr.h"
  19. #include "acl.h"
  20. #include "summary.h"
  21. #ifdef __ECOS
  22. #include "os-ecos.h"
  23. #else
  24. #include "os-linux.h"
  25. #endif
  26. #define JFFS2_NATIVE_ENDIAN
  27. /* Note we handle mode bits conversion from JFFS2 (i.e. Linux) to/from
  28. whatever OS we're actually running on here too. */
  29. #if defined(JFFS2_NATIVE_ENDIAN)
  30. #define cpu_to_je16(x) ((jint16_t){x})
  31. #define cpu_to_je32(x) ((jint32_t){x})
  32. #define cpu_to_jemode(x) ((jmode_t){os_to_jffs2_mode(x)})
  33. #define constant_cpu_to_je16(x) ((jint16_t){x})
  34. #define constant_cpu_to_je32(x) ((jint32_t){x})
  35. #define je16_to_cpu(x) ((x).v16)
  36. #define je32_to_cpu(x) ((x).v32)
  37. #define jemode_to_cpu(x) (jffs2_to_os_mode((x).m))
  38. #elif defined(JFFS2_BIG_ENDIAN)
  39. #define cpu_to_je16(x) ((jint16_t){cpu_to_be16(x)})
  40. #define cpu_to_je32(x) ((jint32_t){cpu_to_be32(x)})
  41. #define cpu_to_jemode(x) ((jmode_t){cpu_to_be32(os_to_jffs2_mode(x))})
  42. #define constant_cpu_to_je16(x) ((jint16_t){__constant_cpu_to_be16(x)})
  43. #define constant_cpu_to_je32(x) ((jint32_t){__constant_cpu_to_be32(x)})
  44. #define je16_to_cpu(x) (be16_to_cpu(x.v16))
  45. #define je32_to_cpu(x) (be32_to_cpu(x.v32))
  46. #define jemode_to_cpu(x) (be32_to_cpu(jffs2_to_os_mode((x).m)))
  47. #elif defined(JFFS2_LITTLE_ENDIAN)
  48. #define cpu_to_je16(x) ((jint16_t){cpu_to_le16(x)})
  49. #define cpu_to_je32(x) ((jint32_t){cpu_to_le32(x)})
  50. #define cpu_to_jemode(x) ((jmode_t){cpu_to_le32(os_to_jffs2_mode(x))})
  51. #define constant_cpu_to_je16(x) ((jint16_t){__constant_cpu_to_le16(x)})
  52. #define constant_cpu_to_je32(x) ((jint32_t){__constant_cpu_to_le32(x)})
  53. #define je16_to_cpu(x) (le16_to_cpu(x.v16))
  54. #define je32_to_cpu(x) (le32_to_cpu(x.v32))
  55. #define jemode_to_cpu(x) (le32_to_cpu(jffs2_to_os_mode((x).m)))
  56. #else
  57. #error wibble
  58. #endif
  59. /* The minimal node header size */
  60. #define JFFS2_MIN_NODE_HEADER sizeof(struct jffs2_raw_dirent)
  61. /*
  62. This is all we need to keep in-core for each raw node during normal
  63. operation. As and when we do read_inode on a particular inode, we can
  64. scan the nodes which are listed for it and build up a proper map of
  65. which nodes are currently valid. JFFSv1 always used to keep that whole
  66. map in core for each inode.
  67. */
  68. struct jffs2_raw_node_ref
  69. {
  70. struct jffs2_raw_node_ref *next_in_ino; /* Points to the next raw_node_ref
  71. for this object. If this _is_ the last, it points to the inode_cache,
  72. xattr_ref or xattr_datum instead. The common part of those structures
  73. has NULL in the first word. See jffs2_raw_ref_to_ic() below */
  74. uint32_t flash_offset;
  75. #undef TEST_TOTLEN
  76. #ifdef TEST_TOTLEN
  77. uint32_t __totlen; /* This may die; use ref_totlen(c, jeb, ) below */
  78. #endif
  79. };
  80. #define REF_LINK_NODE ((int32_t)-1)
  81. #define REF_EMPTY_NODE ((int32_t)-2)
  82. /* Use blocks of about 256 bytes */
  83. #define REFS_PER_BLOCK ((255/sizeof(struct jffs2_raw_node_ref))-1)
  84. static inline struct jffs2_raw_node_ref *ref_next(struct jffs2_raw_node_ref *ref)
  85. {
  86. ref++;
  87. /* Link to another block of refs */
  88. if (ref->flash_offset == REF_LINK_NODE) {
  89. ref = ref->next_in_ino;
  90. if (!ref)
  91. return ref;
  92. }
  93. /* End of chain */
  94. if (ref->flash_offset == REF_EMPTY_NODE)
  95. return NULL;
  96. return ref;
  97. }
  98. static inline struct jffs2_inode_cache *jffs2_raw_ref_to_ic(struct jffs2_raw_node_ref *raw)
  99. {
  100. while(raw->next_in_ino)
  101. raw = raw->next_in_ino;
  102. /* NB. This can be a jffs2_xattr_datum or jffs2_xattr_ref and
  103. not actually a jffs2_inode_cache. Check ->class */
  104. return ((struct jffs2_inode_cache *)raw);
  105. }
  106. /* flash_offset & 3 always has to be zero, because nodes are
  107. always aligned at 4 bytes. So we have a couple of extra bits
  108. to play with, which indicate the node's status; see below: */
  109. #define REF_UNCHECKED 0 /* We haven't yet checked the CRC or built its inode */
  110. #define REF_OBSOLETE 1 /* Obsolete, can be completely ignored */
  111. #define REF_PRISTINE 2 /* Completely clean. GC without looking */
  112. #define REF_NORMAL 3 /* Possibly overlapped. Read the page and write again on GC */
  113. #define ref_flags(ref) ((ref)->flash_offset & 3)
  114. #define ref_offset(ref) ((ref)->flash_offset & ~3)
  115. #define ref_obsolete(ref) (((ref)->flash_offset & 3) == REF_OBSOLETE)
  116. #define mark_ref_normal(ref) do { (ref)->flash_offset = ref_offset(ref) | REF_NORMAL; } while(0)
  117. /* Dirent nodes should be REF_PRISTINE only if they are not a deletion
  118. dirent. Deletion dirents should be REF_NORMAL so that GC gets to
  119. throw them away when appropriate */
  120. #define dirent_node_state(rd) ( (je32_to_cpu((rd)->ino)?REF_PRISTINE:REF_NORMAL) )
  121. /* NB: REF_PRISTINE for an inode-less node (ref->next_in_ino == NULL) indicates
  122. it is an unknown node of type JFFS2_NODETYPE_RWCOMPAT_COPY, so it'll get
  123. copied. If you need to do anything different to GC inode-less nodes, then
  124. you need to modify gc.c accordingly. */
  125. /* For each inode in the filesystem, we need to keep a record of
  126. nlink, because it would be a PITA to scan the whole directory tree
  127. at read_inode() time to calculate it, and to keep sufficient information
  128. in the raw_node_ref (basically both parent and child inode number for
  129. dirent nodes) would take more space than this does. We also keep
  130. a pointer to the first physical node which is part of this inode, too.
  131. */
  132. struct jffs2_inode_cache {
  133. /* First part of structure is shared with other objects which
  134. can terminate the raw node refs' next_in_ino list -- which
  135. currently struct jffs2_xattr_datum and struct jffs2_xattr_ref. */
  136. struct jffs2_full_dirent *scan_dents; /* Used during scan to hold
  137. temporary lists of dirents, and later must be set to
  138. NULL to mark the end of the raw_node_ref->next_in_ino
  139. chain. */
  140. struct jffs2_raw_node_ref *nodes;
  141. uint8_t class; /* It's used for identification */
  142. /* end of shared structure */
  143. uint8_t flags;
  144. uint16_t state;
  145. uint32_t ino;
  146. struct jffs2_inode_cache *next;
  147. #ifdef CONFIG_JFFS2_FS_XATTR
  148. struct jffs2_xattr_ref *xref;
  149. #endif
  150. uint32_t pino_nlink; /* Directories store parent inode
  151. here; other inodes store nlink.
  152. Zero always means that it's
  153. completely unlinked. */
  154. };
  155. /* Inode states for 'state' above. We need the 'GC' state to prevent
  156. someone from doing a read_inode() while we're moving a 'REF_PRISTINE'
  157. node without going through all the iget() nonsense */
  158. #define INO_STATE_UNCHECKED 0 /* CRC checks not yet done */
  159. #define INO_STATE_CHECKING 1 /* CRC checks in progress */
  160. #define INO_STATE_PRESENT 2 /* In core */
  161. #define INO_STATE_CHECKEDABSENT 3 /* Checked, cleared again */
  162. #define INO_STATE_GC 4 /* GCing a 'pristine' node */
  163. #define INO_STATE_READING 5 /* In read_inode() */
  164. #define INO_STATE_CLEARING 6 /* In clear_inode() */
  165. #define INO_FLAGS_XATTR_CHECKED 0x01 /* has no duplicate xattr_ref */
  166. #define INO_FLAGS_IS_DIR 0x02 /* is a directory */
  167. #define RAWNODE_CLASS_INODE_CACHE 0
  168. #define RAWNODE_CLASS_XATTR_DATUM 1
  169. #define RAWNODE_CLASS_XATTR_REF 2
  170. #define INOCACHE_HASHSIZE_MIN 128
  171. #define INOCACHE_HASHSIZE_MAX 1024
  172. #define write_ofs(c) ((c)->nextblock->offset + (c)->sector_size - (c)->nextblock->free_size)
  173. /*
  174. Larger representation of a raw node, kept in-core only when the
  175. struct inode for this particular ino is instantiated.
  176. */
  177. struct jffs2_full_dnode
  178. {
  179. struct jffs2_raw_node_ref *raw;
  180. uint32_t ofs; /* The offset to which the data of this node belongs */
  181. uint32_t size;
  182. uint32_t frags; /* Number of fragments which currently refer
  183. to this node. When this reaches zero,
  184. the node is obsolete. */
  185. };
  186. /*
  187. Even larger representation of a raw node, kept in-core only while
  188. we're actually building up the original map of which nodes go where,
  189. in read_inode()
  190. */
  191. struct jffs2_tmp_dnode_info
  192. {
  193. struct rb_node rb;
  194. struct jffs2_full_dnode *fn;
  195. uint32_t version;
  196. uint32_t data_crc;
  197. uint32_t partial_crc;
  198. uint32_t csize;
  199. uint16_t overlapped;
  200. };
  201. /* Temporary data structure used during readinode. */
  202. struct jffs2_readinode_info
  203. {
  204. struct rb_root tn_root;
  205. struct jffs2_tmp_dnode_info *mdata_tn;
  206. uint32_t highest_version;
  207. uint32_t latest_mctime;
  208. uint32_t mctime_ver;
  209. struct jffs2_full_dirent *fds;
  210. struct jffs2_raw_node_ref *latest_ref;
  211. };
  212. struct jffs2_full_dirent
  213. {
  214. union {
  215. struct jffs2_raw_node_ref *raw;
  216. struct jffs2_inode_cache *ic; /* Just during part of build */
  217. };
  218. struct jffs2_full_dirent *next;
  219. uint32_t version;
  220. uint32_t ino; /* == zero for unlink */
  221. unsigned int nhash;
  222. unsigned char type;
  223. unsigned char name[0];
  224. };
  225. /*
  226. Fragments - used to build a map of which raw node to obtain
  227. data from for each part of the ino
  228. */
  229. struct jffs2_node_frag
  230. {
  231. struct rb_node rb;
  232. struct jffs2_full_dnode *node; /* NULL for holes */
  233. uint32_t size;
  234. uint32_t ofs; /* The offset to which this fragment belongs */
  235. };
  236. struct jffs2_eraseblock
  237. {
  238. struct list_head list;
  239. int bad_count;
  240. uint32_t offset; /* of this block in the MTD */
  241. uint32_t unchecked_size;
  242. uint32_t used_size;
  243. uint32_t dirty_size;
  244. uint32_t wasted_size;
  245. uint32_t free_size; /* Note that sector_size - free_size
  246. is the address of the first free space */
  247. uint32_t allocated_refs;
  248. struct jffs2_raw_node_ref *first_node;
  249. struct jffs2_raw_node_ref *last_node;
  250. struct jffs2_raw_node_ref *gc_node; /* Next node to be garbage collected */
  251. };
  252. static inline int jffs2_blocks_use_vmalloc(struct jffs2_sb_info *c)
  253. {
  254. return ((c->flash_size / c->sector_size) * sizeof (struct jffs2_eraseblock)) > (128 * 1024);
  255. }
  256. #define ref_totlen(a, b, c) __jffs2_ref_totlen((a), (b), (c))
  257. #define ALLOC_NORMAL 0 /* Normal allocation */
  258. #define ALLOC_DELETION 1 /* Deletion node. Best to allow it */
  259. #define ALLOC_GC 2 /* Space requested for GC. Give it or die */
  260. #define ALLOC_NORETRY 3 /* For jffs2_write_dnode: On failure, return -EAGAIN instead of retrying */
  261. /* How much dirty space before it goes on the very_dirty_list */
  262. #define VERYDIRTY(c, size) ((size) >= ((c)->sector_size / 2))
  263. /* check if dirty space is more than 255 Byte */
  264. #define ISDIRTY(size) ((size) > sizeof (struct jffs2_raw_inode) + JFFS2_MIN_DATA_LEN)
  265. #define PAD(x) (((x)+3)&~3)
  266. static inline int jffs2_encode_dev(union jffs2_device_node *jdev, dev_t rdev)
  267. {
  268. if (old_valid_dev(rdev)) {
  269. jdev->old_id = cpu_to_je16(old_encode_dev(rdev));
  270. return sizeof(jdev->old_id);
  271. } else {
  272. jdev->new_id = cpu_to_je32(new_encode_dev(rdev));
  273. return sizeof(jdev->new_id);
  274. }
  275. }
  276. static inline struct jffs2_node_frag *frag_first(struct rb_root *root)
  277. {
  278. struct rb_node *node = rb_first(root);
  279. if (!node)
  280. return NULL;
  281. return rb_entry(node, struct jffs2_node_frag, rb);
  282. }
  283. static inline struct jffs2_node_frag *frag_last(struct rb_root *root)
  284. {
  285. struct rb_node *node = rb_last(root);
  286. if (!node)
  287. return NULL;
  288. return rb_entry(node, struct jffs2_node_frag, rb);
  289. }
  290. #define frag_next(frag) rb_entry(rb_next(&(frag)->rb), struct jffs2_node_frag, rb)
  291. #define frag_prev(frag) rb_entry(rb_prev(&(frag)->rb), struct jffs2_node_frag, rb)
  292. #define frag_parent(frag) rb_entry(rb_parent(&(frag)->rb), struct jffs2_node_frag, rb)
  293. #define frag_left(frag) rb_entry((frag)->rb.rb_left, struct jffs2_node_frag, rb)
  294. #define frag_right(frag) rb_entry((frag)->rb.rb_right, struct jffs2_node_frag, rb)
  295. #define frag_erase(frag, list) rb_erase(&frag->rb, list);
  296. #define tn_next(tn) rb_entry(rb_next(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
  297. #define tn_prev(tn) rb_entry(rb_prev(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
  298. #define tn_parent(tn) rb_entry(rb_parent(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
  299. #define tn_left(tn) rb_entry((tn)->rb.rb_left, struct jffs2_tmp_dnode_info, rb)
  300. #define tn_right(tn) rb_entry((tn)->rb.rb_right, struct jffs2_tmp_dnode_info, rb)
  301. #define tn_erase(tn, list) rb_erase(&tn->rb, list);
  302. #define tn_last(list) rb_entry(rb_last(list), struct jffs2_tmp_dnode_info, rb)
  303. #define tn_first(list) rb_entry(rb_first(list), struct jffs2_tmp_dnode_info, rb)
  304. /* nodelist.c */
  305. void jffs2_add_fd_to_list(struct jffs2_sb_info *c, struct jffs2_full_dirent *new, struct jffs2_full_dirent **list);
  306. void jffs2_set_inocache_state(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, int state);
  307. struct jffs2_inode_cache *jffs2_get_ino_cache(struct jffs2_sb_info *c, uint32_t ino);
  308. void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new);
  309. void jffs2_del_ino_cache(struct jffs2_sb_info *c, struct jffs2_inode_cache *old);
  310. void jffs2_free_ino_caches(struct jffs2_sb_info *c);
  311. void jffs2_free_raw_node_refs(struct jffs2_sb_info *c);
  312. struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset);
  313. void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c_delete);
  314. int jffs2_add_full_dnode_to_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_full_dnode *fn);
  315. uint32_t jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size);
  316. struct jffs2_raw_node_ref *jffs2_link_node_ref(struct jffs2_sb_info *c,
  317. struct jffs2_eraseblock *jeb,
  318. uint32_t ofs, uint32_t len,
  319. struct jffs2_inode_cache *ic);
  320. extern uint32_t __jffs2_ref_totlen(struct jffs2_sb_info *c,
  321. struct jffs2_eraseblock *jeb,
  322. struct jffs2_raw_node_ref *ref);
  323. /* nodemgmt.c */
  324. int jffs2_thread_should_wake(struct jffs2_sb_info *c);
  325. int jffs2_reserve_space(struct jffs2_sb_info *c, uint32_t minsize,
  326. uint32_t *len, int prio, uint32_t sumsize);
  327. int jffs2_reserve_space_gc(struct jffs2_sb_info *c, uint32_t minsize,
  328. uint32_t *len, uint32_t sumsize);
  329. struct jffs2_raw_node_ref *jffs2_add_physical_node_ref(struct jffs2_sb_info *c,
  330. uint32_t ofs, uint32_t len,
  331. struct jffs2_inode_cache *ic);
  332. void jffs2_complete_reservation(struct jffs2_sb_info *c);
  333. void jffs2_mark_node_obsolete(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *raw);
  334. /* write.c */
  335. int jffs2_do_new_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, uint32_t mode, struct jffs2_raw_inode *ri);
  336. struct jffs2_full_dnode *jffs2_write_dnode(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
  337. struct jffs2_raw_inode *ri, const unsigned char *data,
  338. uint32_t datalen, int alloc_mode);
  339. struct jffs2_full_dirent *jffs2_write_dirent(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
  340. struct jffs2_raw_dirent *rd, const unsigned char *name,
  341. uint32_t namelen, int alloc_mode);
  342. int jffs2_write_inode_range(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
  343. struct jffs2_raw_inode *ri, unsigned char *buf,
  344. uint32_t offset, uint32_t writelen, uint32_t *retlen);
  345. int jffs2_do_create(struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, struct jffs2_inode_info *f,
  346. struct jffs2_raw_inode *ri, const struct qstr *qstr);
  347. int jffs2_do_unlink(struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, const char *name,
  348. int namelen, struct jffs2_inode_info *dead_f, uint32_t time);
  349. int jffs2_do_link(struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, uint32_t ino,
  350. uint8_t type, const char *name, int namelen, uint32_t time);
  351. /* readinode.c */
  352. int jffs2_do_read_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
  353. uint32_t ino, struct jffs2_raw_inode *latest_node);
  354. int jffs2_do_crccheck_inode(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic);
  355. void jffs2_do_clear_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f);
  356. /* malloc.c */
  357. int jffs2_create_slab_caches(void);
  358. void jffs2_destroy_slab_caches(void);
  359. struct jffs2_full_dirent *jffs2_alloc_full_dirent(int namesize);
  360. void jffs2_free_full_dirent(struct jffs2_full_dirent *);
  361. struct jffs2_full_dnode *jffs2_alloc_full_dnode(void);
  362. void jffs2_free_full_dnode(struct jffs2_full_dnode *);
  363. struct jffs2_raw_dirent *jffs2_alloc_raw_dirent(void);
  364. void jffs2_free_raw_dirent(struct jffs2_raw_dirent *);
  365. struct jffs2_raw_inode *jffs2_alloc_raw_inode(void);
  366. void jffs2_free_raw_inode(struct jffs2_raw_inode *);
  367. struct jffs2_tmp_dnode_info *jffs2_alloc_tmp_dnode_info(void);
  368. void jffs2_free_tmp_dnode_info(struct jffs2_tmp_dnode_info *);
  369. int jffs2_prealloc_raw_node_refs(struct jffs2_sb_info *c,
  370. struct jffs2_eraseblock *jeb, int nr);
  371. void jffs2_free_refblock(struct jffs2_raw_node_ref *);
  372. struct jffs2_node_frag *jffs2_alloc_node_frag(void);
  373. void jffs2_free_node_frag(struct jffs2_node_frag *);
  374. struct jffs2_inode_cache *jffs2_alloc_inode_cache(void);
  375. void jffs2_free_inode_cache(struct jffs2_inode_cache *);
  376. #ifdef CONFIG_JFFS2_FS_XATTR
  377. struct jffs2_xattr_datum *jffs2_alloc_xattr_datum(void);
  378. void jffs2_free_xattr_datum(struct jffs2_xattr_datum *);
  379. struct jffs2_xattr_ref *jffs2_alloc_xattr_ref(void);
  380. void jffs2_free_xattr_ref(struct jffs2_xattr_ref *);
  381. #endif
  382. /* gc.c */
  383. int jffs2_garbage_collect_pass(struct jffs2_sb_info *c);
  384. /* read.c */
  385. int jffs2_read_dnode(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
  386. struct jffs2_full_dnode *fd, unsigned char *buf,
  387. int ofs, int len);
  388. int jffs2_read_inode_range(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
  389. unsigned char *buf, uint32_t offset, uint32_t len);
  390. char *jffs2_getlink(struct jffs2_sb_info *c, struct jffs2_inode_info *f);
  391. /* scan.c */
  392. int jffs2_scan_medium(struct jffs2_sb_info *c);
  393. void jffs2_rotate_lists(struct jffs2_sb_info *c);
  394. struct jffs2_inode_cache *jffs2_scan_make_ino_cache(struct jffs2_sb_info *c, uint32_t ino);
  395. int jffs2_scan_classify_jeb(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
  396. int jffs2_scan_dirty_space(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t size);
  397. /* build.c */
  398. int jffs2_do_mount_fs(struct jffs2_sb_info *c);
  399. /* erase.c */
  400. int jffs2_erase_pending_blocks(struct jffs2_sb_info *c, int count);
  401. void jffs2_free_jeb_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
  402. #ifdef CONFIG_JFFS2_FS_WRITEBUFFER
  403. /* wbuf.c */
  404. int jffs2_flush_wbuf_gc(struct jffs2_sb_info *c, uint32_t ino);
  405. int jffs2_flush_wbuf_pad(struct jffs2_sb_info *c);
  406. int jffs2_check_nand_cleanmarker(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
  407. int jffs2_write_nand_cleanmarker(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
  408. #endif
  409. #include "debug.h"
  410. #endif /* __JFFS2_NODELIST_H__ */