erase.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453
  1. /*
  2. * JFFS2 -- Journalling Flash File System, Version 2.
  3. *
  4. * Copyright (C) 2001-2003 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. * $Id: erase.c,v 1.1.1.1 2007/06/12 07:27:13 eyryu Exp $
  11. *
  12. */
  13. #include <linux/kernel.h>
  14. #include <linux/slab.h>
  15. #include <linux/mtd/mtd.h>
  16. #include <linux/compiler.h>
  17. #include <linux/crc32.h>
  18. #include <linux/sched.h>
  19. #include <linux/pagemap.h>
  20. #include "nodelist.h"
  21. struct erase_priv_struct {
  22. struct jffs2_eraseblock *jeb;
  23. struct jffs2_sb_info *c;
  24. };
  25. #ifndef __ECOS
  26. static void jffs2_erase_callback(struct erase_info *);
  27. #endif
  28. static void jffs2_erase_failed(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset);
  29. static void jffs2_erase_succeeded(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
  30. static void jffs2_mark_erased_block(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
  31. static void jffs2_erase_block(struct jffs2_sb_info *c,
  32. struct jffs2_eraseblock *jeb)
  33. {
  34. int ret;
  35. uint32_t bad_offset;
  36. #ifdef __ECOS
  37. ret = jffs2_flash_erase(c, jeb);
  38. if (!ret) {
  39. jffs2_erase_succeeded(c, jeb);
  40. return;
  41. }
  42. bad_offset = jeb->offset;
  43. #else /* Linux */
  44. struct erase_info *instr;
  45. D1(printk(KERN_DEBUG "jffs2_erase_block(): erase block %#08x (range %#08x-%#08x)\n",
  46. jeb->offset, jeb->offset, jeb->offset + c->sector_size));
  47. instr = kmalloc(sizeof(struct erase_info) + sizeof(struct erase_priv_struct), GFP_KERNEL);
  48. if (!instr) {
  49. printk(KERN_WARNING "kmalloc for struct erase_info in jffs2_erase_block failed. Refiling block for later\n");
  50. spin_lock(&c->erase_completion_lock);
  51. list_move(&jeb->list, &c->erase_pending_list);
  52. c->erasing_size -= c->sector_size;
  53. c->dirty_size += c->sector_size;
  54. jeb->dirty_size = c->sector_size;
  55. spin_unlock(&c->erase_completion_lock);
  56. return;
  57. }
  58. memset(instr, 0, sizeof(*instr));
  59. instr->mtd = c->mtd;
  60. instr->addr = jeb->offset;
  61. instr->len = c->sector_size;
  62. instr->callback = jffs2_erase_callback;
  63. instr->priv = (unsigned long)(&instr[1]);
  64. instr->fail_addr = 0xffffffff;
  65. ((struct erase_priv_struct *)instr->priv)->jeb = jeb;
  66. ((struct erase_priv_struct *)instr->priv)->c = c;
  67. ret = c->mtd->erase(c->mtd, instr);
  68. if (!ret)
  69. return;
  70. bad_offset = instr->fail_addr;
  71. kfree(instr);
  72. #endif /* __ECOS */
  73. if (ret == -ENOMEM || ret == -EAGAIN) {
  74. /* Erase failed immediately. Refile it on the list */
  75. D1(printk(KERN_DEBUG "Erase at 0x%08x failed: %d. Refiling on erase_pending_list\n", jeb->offset, ret));
  76. spin_lock(&c->erase_completion_lock);
  77. list_move(&jeb->list, &c->erase_pending_list);
  78. c->erasing_size -= c->sector_size;
  79. c->dirty_size += c->sector_size;
  80. jeb->dirty_size = c->sector_size;
  81. spin_unlock(&c->erase_completion_lock);
  82. return;
  83. }
  84. if (ret == -EROFS)
  85. printk(KERN_WARNING "Erase at 0x%08x failed immediately: -EROFS. Is the sector locked?\n", jeb->offset);
  86. else
  87. printk(KERN_WARNING "Erase at 0x%08x failed immediately: errno %d\n", jeb->offset, ret);
  88. jffs2_erase_failed(c, jeb, bad_offset);
  89. }
  90. void jffs2_erase_pending_blocks(struct jffs2_sb_info *c, int count)
  91. {
  92. struct jffs2_eraseblock *jeb;
  93. down(&c->erase_free_sem);
  94. spin_lock(&c->erase_completion_lock);
  95. while (!list_empty(&c->erase_complete_list) ||
  96. !list_empty(&c->erase_pending_list)) {
  97. if (!list_empty(&c->erase_complete_list)) {
  98. jeb = list_entry(c->erase_complete_list.next, struct jffs2_eraseblock, list);
  99. list_del(&jeb->list);
  100. spin_unlock(&c->erase_completion_lock);
  101. jffs2_mark_erased_block(c, jeb);
  102. if (!--count) {
  103. D1(printk(KERN_DEBUG "Count reached. jffs2_erase_pending_blocks leaving\n"));
  104. goto done;
  105. }
  106. } else if (!list_empty(&c->erase_pending_list)) {
  107. jeb = list_entry(c->erase_pending_list.next, struct jffs2_eraseblock, list);
  108. D1(printk(KERN_DEBUG "Starting erase of pending block 0x%08x\n", jeb->offset));
  109. list_del(&jeb->list);
  110. c->erasing_size += c->sector_size;
  111. c->wasted_size -= jeb->wasted_size;
  112. c->free_size -= jeb->free_size;
  113. c->used_size -= jeb->used_size;
  114. c->dirty_size -= jeb->dirty_size;
  115. jeb->wasted_size = jeb->used_size = jeb->dirty_size = jeb->free_size = 0;
  116. jffs2_free_jeb_node_refs(c, jeb);
  117. list_add(&jeb->list, &c->erasing_list);
  118. spin_unlock(&c->erase_completion_lock);
  119. jffs2_erase_block(c, jeb);
  120. } else {
  121. BUG();
  122. }
  123. /* Be nice */
  124. cond_resched();
  125. spin_lock(&c->erase_completion_lock);
  126. }
  127. spin_unlock(&c->erase_completion_lock);
  128. done:
  129. D1(printk(KERN_DEBUG "jffs2_erase_pending_blocks completed\n"));
  130. up(&c->erase_free_sem);
  131. }
  132. static void jffs2_erase_succeeded(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
  133. {
  134. D1(printk(KERN_DEBUG "Erase completed successfully at 0x%08x\n", jeb->offset));
  135. spin_lock(&c->erase_completion_lock);
  136. list_move_tail(&jeb->list, &c->erase_complete_list);
  137. spin_unlock(&c->erase_completion_lock);
  138. /* Ensure that kupdated calls us again to mark them clean */
  139. jffs2_erase_pending_trigger(c);
  140. }
  141. static void jffs2_erase_failed(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset)
  142. {
  143. /* For NAND, if the failure did not occur at the device level for a
  144. specific physical page, don't bother updating the bad block table. */
  145. if (jffs2_cleanmarker_oob(c) && (bad_offset != 0xffffffff)) {
  146. /* We had a device-level failure to erase. Let's see if we've
  147. failed too many times. */
  148. if (!jffs2_write_nand_badblock(c, jeb, bad_offset)) {
  149. /* We'd like to give this block another try. */
  150. spin_lock(&c->erase_completion_lock);
  151. list_move(&jeb->list, &c->erase_pending_list);
  152. c->erasing_size -= c->sector_size;
  153. c->dirty_size += c->sector_size;
  154. jeb->dirty_size = c->sector_size;
  155. spin_unlock(&c->erase_completion_lock);
  156. return;
  157. }
  158. }
  159. spin_lock(&c->erase_completion_lock);
  160. c->erasing_size -= c->sector_size;
  161. c->bad_size += c->sector_size;
  162. list_move(&jeb->list, &c->bad_list);
  163. c->nr_erasing_blocks--;
  164. spin_unlock(&c->erase_completion_lock);
  165. wake_up(&c->erase_wait);
  166. }
  167. #ifndef __ECOS
  168. static void jffs2_erase_callback(struct erase_info *instr)
  169. {
  170. struct erase_priv_struct *priv = (void *)instr->priv;
  171. if(instr->state != MTD_ERASE_DONE) {
  172. printk(KERN_WARNING "Erase at 0x%08x finished, but state != MTD_ERASE_DONE. State is 0x%x instead.\n", instr->addr, instr->state);
  173. jffs2_erase_failed(priv->c, priv->jeb, instr->fail_addr);
  174. } else {
  175. jffs2_erase_succeeded(priv->c, priv->jeb);
  176. }
  177. kfree(instr);
  178. }
  179. #endif /* !__ECOS */
  180. /* Hmmm. Maybe we should accept the extra space it takes and make
  181. this a standard doubly-linked list? */
  182. static inline void jffs2_remove_node_refs_from_ino_list(struct jffs2_sb_info *c,
  183. struct jffs2_raw_node_ref *ref, struct jffs2_eraseblock *jeb)
  184. {
  185. struct jffs2_inode_cache *ic = NULL;
  186. struct jffs2_raw_node_ref **prev;
  187. prev = &ref->next_in_ino;
  188. /* Walk the inode's list once, removing any nodes from this eraseblock */
  189. while (1) {
  190. if (!(*prev)->next_in_ino) {
  191. /* We're looking at the jffs2_inode_cache, which is
  192. at the end of the linked list. Stash it and continue
  193. from the beginning of the list */
  194. ic = (struct jffs2_inode_cache *)(*prev);
  195. prev = &ic->nodes;
  196. continue;
  197. }
  198. if (SECTOR_ADDR((*prev)->flash_offset) == jeb->offset) {
  199. /* It's in the block we're erasing */
  200. struct jffs2_raw_node_ref *this;
  201. this = *prev;
  202. *prev = this->next_in_ino;
  203. this->next_in_ino = NULL;
  204. if (this == ref)
  205. break;
  206. continue;
  207. }
  208. /* Not to be deleted. Skip */
  209. prev = &((*prev)->next_in_ino);
  210. }
  211. /* PARANOIA */
  212. if (!ic) {
  213. JFFS2_WARNING("inode_cache/xattr_datum/xattr_ref"
  214. " not found in remove_node_refs()!!\n");
  215. return;
  216. }
  217. D1(printk(KERN_DEBUG "Removed nodes in range 0x%08x-0x%08x from ino #%u\n",
  218. jeb->offset, jeb->offset + c->sector_size, ic->ino));
  219. D2({
  220. int i=0;
  221. struct jffs2_raw_node_ref *this;
  222. printk(KERN_DEBUG "After remove_node_refs_from_ino_list: \n" KERN_DEBUG);
  223. this = ic->nodes;
  224. while(this) {
  225. printk( "0x%08x(%d)->", ref_offset(this), ref_flags(this));
  226. if (++i == 5) {
  227. printk("\n" KERN_DEBUG);
  228. i=0;
  229. }
  230. this = this->next_in_ino;
  231. }
  232. printk("\n");
  233. });
  234. switch (ic->class) {
  235. #ifdef CONFIG_JFFS2_FS_XATTR
  236. case RAWNODE_CLASS_XATTR_DATUM:
  237. jffs2_release_xattr_datum(c, (struct jffs2_xattr_datum *)ic);
  238. break;
  239. case RAWNODE_CLASS_XATTR_REF:
  240. jffs2_release_xattr_ref(c, (struct jffs2_xattr_ref *)ic);
  241. break;
  242. #endif
  243. default:
  244. if (ic->nodes == (void *)ic && ic->nlink == 0)
  245. jffs2_del_ino_cache(c, ic);
  246. }
  247. }
  248. void jffs2_free_jeb_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
  249. {
  250. struct jffs2_raw_node_ref *block, *ref;
  251. D1(printk(KERN_DEBUG "Freeing all node refs for eraseblock offset 0x%08x\n", jeb->offset));
  252. block = ref = jeb->first_node;
  253. while (ref) {
  254. if (ref->flash_offset == REF_LINK_NODE) {
  255. ref = ref->next_in_ino;
  256. jffs2_free_refblock(block);
  257. block = ref;
  258. continue;
  259. }
  260. if (ref->flash_offset != REF_EMPTY_NODE && ref->next_in_ino)
  261. jffs2_remove_node_refs_from_ino_list(c, ref, jeb);
  262. /* else it was a non-inode node or already removed, so don't bother */
  263. ref++;
  264. }
  265. jeb->first_node = jeb->last_node = NULL;
  266. }
  267. static int jffs2_block_check_erase(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t *bad_offset)
  268. {
  269. void *ebuf;
  270. uint32_t ofs;
  271. size_t retlen;
  272. int ret = -EIO;
  273. ebuf = kmalloc(PAGE_SIZE, GFP_KERNEL);
  274. if (!ebuf) {
  275. printk(KERN_WARNING "Failed to allocate page buffer for verifying erase at 0x%08x. Refiling\n", jeb->offset);
  276. return -EAGAIN;
  277. }
  278. D1(printk(KERN_DEBUG "Verifying erase at 0x%08x\n", jeb->offset));
  279. for (ofs = jeb->offset; ofs < jeb->offset + c->sector_size; ) {
  280. uint32_t readlen = min((uint32_t)PAGE_SIZE, jeb->offset + c->sector_size - ofs);
  281. int i;
  282. *bad_offset = ofs;
  283. ret = jffs2_flash_read(c, ofs, readlen, &retlen, ebuf);
  284. if (ret) {
  285. printk(KERN_WARNING "Read of newly-erased block at 0x%08x failed: %d. Putting on bad_list\n", ofs, ret);
  286. goto fail;
  287. }
  288. if (retlen != readlen) {
  289. printk(KERN_WARNING "Short read from newly-erased block at 0x%08x. Wanted %d, got %zd\n", ofs, readlen, retlen);
  290. goto fail;
  291. }
  292. for (i=0; i<readlen; i += sizeof(unsigned long)) {
  293. /* It's OK. We know it's properly aligned */
  294. unsigned long *datum = ebuf + i;
  295. if (*datum + 1) {
  296. *bad_offset += i;
  297. printk(KERN_WARNING "Newly-erased block contained word 0x%lx at offset 0x%08x\n", *datum, *bad_offset);
  298. goto fail;
  299. }
  300. }
  301. ofs += readlen;
  302. cond_resched();
  303. }
  304. ret = 0;
  305. fail:
  306. kfree(ebuf);
  307. return ret;
  308. }
  309. static void jffs2_mark_erased_block(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
  310. {
  311. size_t retlen;
  312. int ret;
  313. uint32_t bad_offset;
  314. switch (jffs2_block_check_erase(c, jeb, &bad_offset)) {
  315. case -EAGAIN: goto refile;
  316. case -EIO: goto filebad;
  317. }
  318. /* Write the erase complete marker */
  319. D1(printk(KERN_DEBUG "Writing erased marker to block at 0x%08x\n", jeb->offset));
  320. bad_offset = jeb->offset;
  321. /* Cleanmarker in oob area or no cleanmarker at all ? */
  322. if (jffs2_cleanmarker_oob(c) || c->cleanmarker_size == 0) {
  323. if (jffs2_cleanmarker_oob(c)) {
  324. if (jffs2_write_nand_cleanmarker(c, jeb))
  325. goto filebad;
  326. }
  327. /* Everything else got zeroed before the erase */
  328. jeb->free_size = c->sector_size;
  329. } else {
  330. struct kvec vecs[1];
  331. struct jffs2_unknown_node marker = {
  332. .magic = cpu_to_je16(JFFS2_MAGIC_BITMASK),
  333. .nodetype = cpu_to_je16(JFFS2_NODETYPE_CLEANMARKER),
  334. .totlen = cpu_to_je32(c->cleanmarker_size)
  335. };
  336. jffs2_prealloc_raw_node_refs(c, jeb, 1);
  337. marker.hdr_crc = cpu_to_je32(crc32(0, &marker, sizeof(struct jffs2_unknown_node)-4));
  338. vecs[0].iov_base = (unsigned char *) &marker;
  339. vecs[0].iov_len = sizeof(marker);
  340. ret = jffs2_flash_direct_writev(c, vecs, 1, jeb->offset, &retlen);
  341. if (ret || retlen != sizeof(marker)) {
  342. if (ret)
  343. printk(KERN_WARNING "Write clean marker to block at 0x%08x failed: %d\n",
  344. jeb->offset, ret);
  345. else
  346. printk(KERN_WARNING "Short write to newly-erased block at 0x%08x: Wanted %zd, got %zd\n",
  347. jeb->offset, sizeof(marker), retlen);
  348. goto filebad;
  349. }
  350. /* Everything else got zeroed before the erase */
  351. jeb->free_size = c->sector_size;
  352. /* FIXME Special case for cleanmarker in empty block */
  353. jffs2_link_node_ref(c, jeb, jeb->offset | REF_NORMAL, c->cleanmarker_size, NULL);
  354. }
  355. spin_lock(&c->erase_completion_lock);
  356. c->erasing_size -= c->sector_size;
  357. c->free_size += jeb->free_size;
  358. c->used_size += jeb->used_size;
  359. jffs2_dbg_acct_sanity_check_nolock(c,jeb);
  360. jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
  361. list_add_tail(&jeb->list, &c->free_list);
  362. c->nr_erasing_blocks--;
  363. c->nr_free_blocks++;
  364. spin_unlock(&c->erase_completion_lock);
  365. wake_up(&c->erase_wait);
  366. return;
  367. filebad:
  368. spin_lock(&c->erase_completion_lock);
  369. /* Stick it on a list (any list) so erase_failed can take it
  370. right off again. Silly, but shouldn't happen often. */
  371. list_add(&jeb->list, &c->erasing_list);
  372. spin_unlock(&c->erase_completion_lock);
  373. jffs2_erase_failed(c, jeb, bad_offset);
  374. return;
  375. refile:
  376. /* Stick it back on the list from whence it came and come back later */
  377. jffs2_erase_pending_trigger(c);
  378. spin_lock(&c->erase_completion_lock);
  379. list_add(&jeb->list, &c->erase_complete_list);
  380. spin_unlock(&c->erase_completion_lock);
  381. return;
  382. }