summary.c 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843
  1. /*
  2. * JFFS2 -- Journalling Flash File System, Version 2.
  3. *
  4. * Copyright © 2004 Ferenc Havasi <havasi@inf.u-szeged.hu>,
  5. * Zoltan Sogor <weth@inf.u-szeged.hu>,
  6. * Patrik Kluba <pajko@halom.u-szeged.hu>,
  7. * University of Szeged, Hungary
  8. * 2006 KaiGai Kohei <kaigai@ak.jp.nec.com>
  9. *
  10. * For licensing information, see the file 'LICENCE' in this directory.
  11. *
  12. */
  13. #include <linux/kernel.h>
  14. #include <linux/slab.h>
  15. #include <linux/mtd/mtd.h>
  16. #include <linux/pagemap.h>
  17. #include <linux/crc32.h>
  18. #include <linux/compiler.h>
  19. #include <linux/vmalloc.h>
  20. #include "nodelist.h"
  21. #include "debug.h"
  22. int jffs2_sum_init(struct jffs2_sb_info *c)
  23. {
  24. c->summary = kzalloc(sizeof(struct jffs2_summary), GFP_KERNEL);
  25. if (!c->summary) {
  26. JFFS2_WARNING("Can't allocate memory for summary information!\n");
  27. return -ENOMEM;
  28. }
  29. c->summary->sum_buf = vmalloc(c->sector_size);
  30. if (!c->summary->sum_buf) {
  31. JFFS2_WARNING("Can't allocate buffer for writing out summary information!\n");
  32. kfree(c->summary);
  33. return -ENOMEM;
  34. }
  35. dbg_summary("returned successfully\n");
  36. return 0;
  37. }
  38. void jffs2_sum_exit(struct jffs2_sb_info *c)
  39. {
  40. dbg_summary("called\n");
  41. jffs2_sum_disable_collecting(c->summary);
  42. vfree(c->summary->sum_buf);
  43. c->summary->sum_buf = NULL;
  44. kfree(c->summary);
  45. c->summary = NULL;
  46. }
  47. static int jffs2_sum_add_mem(struct jffs2_summary *s, union jffs2_sum_mem *item)
  48. {
  49. if (!s->sum_list_head)
  50. s->sum_list_head = (union jffs2_sum_mem *) item;
  51. if (s->sum_list_tail)
  52. s->sum_list_tail->u.next = (union jffs2_sum_mem *) item;
  53. s->sum_list_tail = (union jffs2_sum_mem *) item;
  54. switch (je16_to_cpu(item->u.nodetype)) {
  55. case JFFS2_NODETYPE_INODE:
  56. s->sum_size += JFFS2_SUMMARY_INODE_SIZE;
  57. s->sum_num++;
  58. dbg_summary("inode (%u) added to summary\n",
  59. je32_to_cpu(item->i.inode));
  60. break;
  61. case JFFS2_NODETYPE_DIRENT:
  62. s->sum_size += JFFS2_SUMMARY_DIRENT_SIZE(item->d.nsize);
  63. s->sum_num++;
  64. dbg_summary("dirent (%u) added to summary\n",
  65. je32_to_cpu(item->d.ino));
  66. break;
  67. #ifdef CONFIG_JFFS2_FS_XATTR
  68. case JFFS2_NODETYPE_XATTR:
  69. s->sum_size += JFFS2_SUMMARY_XATTR_SIZE;
  70. s->sum_num++;
  71. dbg_summary("xattr (xid=%u, version=%u) added to summary\n",
  72. je32_to_cpu(item->x.xid), je32_to_cpu(item->x.version));
  73. break;
  74. case JFFS2_NODETYPE_XREF:
  75. s->sum_size += JFFS2_SUMMARY_XREF_SIZE;
  76. s->sum_num++;
  77. dbg_summary("xref added to summary\n");
  78. break;
  79. #endif
  80. default:
  81. JFFS2_WARNING("UNKNOWN node type %u\n",
  82. je16_to_cpu(item->u.nodetype));
  83. return 1;
  84. }
  85. return 0;
  86. }
  87. /* The following 3 functions are called from scan.c to collect summary info for not closed jeb */
  88. int jffs2_sum_add_padding_mem(struct jffs2_summary *s, uint32_t size)
  89. {
  90. dbg_summary("called with %u\n", size);
  91. s->sum_padded += size;
  92. return 0;
  93. }
  94. int jffs2_sum_add_inode_mem(struct jffs2_summary *s, struct jffs2_raw_inode *ri,
  95. uint32_t ofs)
  96. {
  97. struct jffs2_sum_inode_mem *temp = kmalloc(sizeof(struct jffs2_sum_inode_mem), GFP_KERNEL);
  98. if (!temp)
  99. return -ENOMEM;
  100. temp->nodetype = ri->nodetype;
  101. temp->inode = ri->ino;
  102. temp->version = ri->version;
  103. temp->offset = cpu_to_je32(ofs); /* relative offset from the begining of the jeb */
  104. temp->totlen = ri->totlen;
  105. temp->next = NULL;
  106. return jffs2_sum_add_mem(s, (union jffs2_sum_mem *)temp);
  107. }
  108. int jffs2_sum_add_dirent_mem(struct jffs2_summary *s, struct jffs2_raw_dirent *rd,
  109. uint32_t ofs)
  110. {
  111. struct jffs2_sum_dirent_mem *temp =
  112. kmalloc(sizeof(struct jffs2_sum_dirent_mem) + rd->nsize, GFP_KERNEL);
  113. if (!temp)
  114. return -ENOMEM;
  115. temp->nodetype = rd->nodetype;
  116. temp->totlen = rd->totlen;
  117. temp->offset = cpu_to_je32(ofs); /* relative from the begining of the jeb */
  118. temp->pino = rd->pino;
  119. temp->version = rd->version;
  120. temp->ino = rd->ino;
  121. temp->nsize = rd->nsize;
  122. temp->type = rd->type;
  123. temp->next = NULL;
  124. memcpy(temp->name, rd->name, rd->nsize);
  125. return jffs2_sum_add_mem(s, (union jffs2_sum_mem *)temp);
  126. }
  127. #ifdef CONFIG_JFFS2_FS_XATTR
  128. int jffs2_sum_add_xattr_mem(struct jffs2_summary *s, struct jffs2_raw_xattr *rx, uint32_t ofs)
  129. {
  130. struct jffs2_sum_xattr_mem *temp;
  131. temp = kmalloc(sizeof(struct jffs2_sum_xattr_mem), GFP_KERNEL);
  132. if (!temp)
  133. return -ENOMEM;
  134. temp->nodetype = rx->nodetype;
  135. temp->xid = rx->xid;
  136. temp->version = rx->version;
  137. temp->offset = cpu_to_je32(ofs);
  138. temp->totlen = rx->totlen;
  139. temp->next = NULL;
  140. return jffs2_sum_add_mem(s, (union jffs2_sum_mem *)temp);
  141. }
  142. int jffs2_sum_add_xref_mem(struct jffs2_summary *s, struct jffs2_raw_xref *rr, uint32_t ofs)
  143. {
  144. struct jffs2_sum_xref_mem *temp;
  145. temp = kmalloc(sizeof(struct jffs2_sum_xref_mem), GFP_KERNEL);
  146. if (!temp)
  147. return -ENOMEM;
  148. temp->nodetype = rr->nodetype;
  149. temp->offset = cpu_to_je32(ofs);
  150. temp->next = NULL;
  151. return jffs2_sum_add_mem(s, (union jffs2_sum_mem *)temp);
  152. }
  153. #endif
  154. /* Cleanup every collected summary information */
  155. static void jffs2_sum_clean_collected(struct jffs2_summary *s)
  156. {
  157. union jffs2_sum_mem *temp;
  158. if (!s->sum_list_head) {
  159. dbg_summary("already empty\n");
  160. }
  161. while (s->sum_list_head) {
  162. temp = s->sum_list_head;
  163. s->sum_list_head = s->sum_list_head->u.next;
  164. kfree(temp);
  165. }
  166. s->sum_list_tail = NULL;
  167. s->sum_padded = 0;
  168. s->sum_num = 0;
  169. }
  170. void jffs2_sum_reset_collected(struct jffs2_summary *s)
  171. {
  172. dbg_summary("called\n");
  173. jffs2_sum_clean_collected(s);
  174. s->sum_size = 0;
  175. }
  176. void jffs2_sum_disable_collecting(struct jffs2_summary *s)
  177. {
  178. dbg_summary("called\n");
  179. jffs2_sum_clean_collected(s);
  180. s->sum_size = JFFS2_SUMMARY_NOSUM_SIZE;
  181. }
  182. int jffs2_sum_is_disabled(struct jffs2_summary *s)
  183. {
  184. return (s->sum_size == JFFS2_SUMMARY_NOSUM_SIZE);
  185. }
  186. /* Move the collected summary information into sb (called from scan.c) */
  187. void jffs2_sum_move_collected(struct jffs2_sb_info *c, struct jffs2_summary *s)
  188. {
  189. dbg_summary("oldsize=0x%x oldnum=%u => newsize=0x%x newnum=%u\n",
  190. c->summary->sum_size, c->summary->sum_num,
  191. s->sum_size, s->sum_num);
  192. c->summary->sum_size = s->sum_size;
  193. c->summary->sum_num = s->sum_num;
  194. c->summary->sum_padded = s->sum_padded;
  195. c->summary->sum_list_head = s->sum_list_head;
  196. c->summary->sum_list_tail = s->sum_list_tail;
  197. s->sum_list_head = s->sum_list_tail = NULL;
  198. }
  199. /* Called from wbuf.c to collect writed node info */
  200. int jffs2_sum_add_kvec(struct jffs2_sb_info *c, const struct kvec *invecs,
  201. unsigned long count, uint32_t ofs)
  202. {
  203. union jffs2_node_union *node;
  204. struct jffs2_eraseblock *jeb;
  205. if (c->summary->sum_size == JFFS2_SUMMARY_NOSUM_SIZE) {
  206. dbg_summary("Summary is disabled for this jeb! Skipping summary info!\n");
  207. return 0;
  208. }
  209. node = invecs[0].iov_base;
  210. jeb = &c->blocks[ofs / c->sector_size];
  211. ofs -= jeb->offset;
  212. switch (je16_to_cpu(node->u.nodetype)) {
  213. case JFFS2_NODETYPE_INODE: {
  214. struct jffs2_sum_inode_mem *temp =
  215. kmalloc(sizeof(struct jffs2_sum_inode_mem), GFP_KERNEL);
  216. if (!temp)
  217. goto no_mem;
  218. temp->nodetype = node->i.nodetype;
  219. temp->inode = node->i.ino;
  220. temp->version = node->i.version;
  221. temp->offset = cpu_to_je32(ofs);
  222. temp->totlen = node->i.totlen;
  223. temp->next = NULL;
  224. return jffs2_sum_add_mem(c->summary, (union jffs2_sum_mem *)temp);
  225. }
  226. case JFFS2_NODETYPE_DIRENT: {
  227. struct jffs2_sum_dirent_mem *temp =
  228. kmalloc(sizeof(struct jffs2_sum_dirent_mem) + node->d.nsize, GFP_KERNEL);
  229. if (!temp)
  230. goto no_mem;
  231. temp->nodetype = node->d.nodetype;
  232. temp->totlen = node->d.totlen;
  233. temp->offset = cpu_to_je32(ofs);
  234. temp->pino = node->d.pino;
  235. temp->version = node->d.version;
  236. temp->ino = node->d.ino;
  237. temp->nsize = node->d.nsize;
  238. temp->type = node->d.type;
  239. temp->next = NULL;
  240. switch (count) {
  241. case 1:
  242. memcpy(temp->name,node->d.name,node->d.nsize);
  243. break;
  244. case 2:
  245. memcpy(temp->name,invecs[1].iov_base,node->d.nsize);
  246. break;
  247. default:
  248. BUG(); /* impossible count value */
  249. break;
  250. }
  251. return jffs2_sum_add_mem(c->summary, (union jffs2_sum_mem *)temp);
  252. }
  253. #ifdef CONFIG_JFFS2_FS_XATTR
  254. case JFFS2_NODETYPE_XATTR: {
  255. struct jffs2_sum_xattr_mem *temp;
  256. temp = kmalloc(sizeof(struct jffs2_sum_xattr_mem), GFP_KERNEL);
  257. if (!temp)
  258. goto no_mem;
  259. temp->nodetype = node->x.nodetype;
  260. temp->xid = node->x.xid;
  261. temp->version = node->x.version;
  262. temp->totlen = node->x.totlen;
  263. temp->offset = cpu_to_je32(ofs);
  264. temp->next = NULL;
  265. return jffs2_sum_add_mem(c->summary, (union jffs2_sum_mem *)temp);
  266. }
  267. case JFFS2_NODETYPE_XREF: {
  268. struct jffs2_sum_xref_mem *temp;
  269. temp = kmalloc(sizeof(struct jffs2_sum_xref_mem), GFP_KERNEL);
  270. if (!temp)
  271. goto no_mem;
  272. temp->nodetype = node->r.nodetype;
  273. temp->offset = cpu_to_je32(ofs);
  274. temp->next = NULL;
  275. return jffs2_sum_add_mem(c->summary, (union jffs2_sum_mem *)temp);
  276. }
  277. #endif
  278. case JFFS2_NODETYPE_PADDING:
  279. dbg_summary("node PADDING\n");
  280. c->summary->sum_padded += je32_to_cpu(node->u.totlen);
  281. break;
  282. case JFFS2_NODETYPE_CLEANMARKER:
  283. dbg_summary("node CLEANMARKER\n");
  284. break;
  285. case JFFS2_NODETYPE_SUMMARY:
  286. dbg_summary("node SUMMARY\n");
  287. break;
  288. default:
  289. /* If you implement a new node type you should also implement
  290. summary support for it or disable summary.
  291. */
  292. BUG();
  293. break;
  294. }
  295. return 0;
  296. no_mem:
  297. JFFS2_WARNING("MEMORY ALLOCATION ERROR!");
  298. return -ENOMEM;
  299. }
  300. static struct jffs2_raw_node_ref *sum_link_node_ref(struct jffs2_sb_info *c,
  301. struct jffs2_eraseblock *jeb,
  302. uint32_t ofs, uint32_t len,
  303. struct jffs2_inode_cache *ic)
  304. {
  305. /* If there was a gap, mark it dirty */
  306. if ((ofs & ~3) > c->sector_size - jeb->free_size) {
  307. /* Ew. Summary doesn't actually tell us explicitly about dirty space */
  308. jffs2_scan_dirty_space(c, jeb, (ofs & ~3) - (c->sector_size - jeb->free_size));
  309. }
  310. return jffs2_link_node_ref(c, jeb, jeb->offset + ofs, len, ic);
  311. }
  312. /* Process the stored summary information - helper function for jffs2_sum_scan_sumnode() */
  313. static int jffs2_sum_process_sum_data(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
  314. struct jffs2_raw_summary *summary, uint32_t *pseudo_random)
  315. {
  316. struct jffs2_inode_cache *ic;
  317. struct jffs2_full_dirent *fd;
  318. void *sp;
  319. int i, ino;
  320. int err;
  321. sp = summary->sum;
  322. for (i=0; i<je32_to_cpu(summary->sum_num); i++) {
  323. dbg_summary("processing summary index %d\n", i);
  324. cond_resched();
  325. /* Make sure there's a spare ref for dirty space */
  326. err = jffs2_prealloc_raw_node_refs(c, jeb, 2);
  327. if (err)
  328. return err;
  329. switch (je16_to_cpu(((struct jffs2_sum_unknown_flash *)sp)->nodetype)) {
  330. case JFFS2_NODETYPE_INODE: {
  331. struct jffs2_sum_inode_flash *spi;
  332. spi = sp;
  333. ino = je32_to_cpu(spi->inode);
  334. dbg_summary("Inode at 0x%08x-0x%08x\n",
  335. jeb->offset + je32_to_cpu(spi->offset),
  336. jeb->offset + je32_to_cpu(spi->offset) + je32_to_cpu(spi->totlen));
  337. ic = jffs2_scan_make_ino_cache(c, ino);
  338. if (!ic) {
  339. JFFS2_NOTICE("scan_make_ino_cache failed\n");
  340. return -ENOMEM;
  341. }
  342. sum_link_node_ref(c, jeb, je32_to_cpu(spi->offset) | REF_UNCHECKED,
  343. PAD(je32_to_cpu(spi->totlen)), ic);
  344. *pseudo_random += je32_to_cpu(spi->version);
  345. sp += JFFS2_SUMMARY_INODE_SIZE;
  346. break;
  347. }
  348. case JFFS2_NODETYPE_DIRENT: {
  349. struct jffs2_sum_dirent_flash *spd;
  350. spd = sp;
  351. dbg_summary("Dirent at 0x%08x-0x%08x\n",
  352. jeb->offset + je32_to_cpu(spd->offset),
  353. jeb->offset + je32_to_cpu(spd->offset) + je32_to_cpu(spd->totlen));
  354. fd = jffs2_alloc_full_dirent(spd->nsize+1);
  355. if (!fd)
  356. return -ENOMEM;
  357. memcpy(&fd->name, spd->name, spd->nsize);
  358. fd->name[spd->nsize] = 0;
  359. ic = jffs2_scan_make_ino_cache(c, je32_to_cpu(spd->pino));
  360. if (!ic) {
  361. jffs2_free_full_dirent(fd);
  362. return -ENOMEM;
  363. }
  364. fd->raw = sum_link_node_ref(c, jeb, je32_to_cpu(spd->offset) | REF_UNCHECKED,
  365. PAD(je32_to_cpu(spd->totlen)), ic);
  366. fd->next = NULL;
  367. fd->version = je32_to_cpu(spd->version);
  368. fd->ino = je32_to_cpu(spd->ino);
  369. fd->nhash = full_name_hash(fd->name, spd->nsize);
  370. fd->type = spd->type;
  371. jffs2_add_fd_to_list(c, fd, &ic->scan_dents);
  372. *pseudo_random += je32_to_cpu(spd->version);
  373. sp += JFFS2_SUMMARY_DIRENT_SIZE(spd->nsize);
  374. break;
  375. }
  376. #ifdef CONFIG_JFFS2_FS_XATTR
  377. case JFFS2_NODETYPE_XATTR: {
  378. struct jffs2_xattr_datum *xd;
  379. struct jffs2_sum_xattr_flash *spx;
  380. spx = (struct jffs2_sum_xattr_flash *)sp;
  381. dbg_summary("xattr at %#08x-%#08x (xid=%u, version=%u)\n",
  382. jeb->offset + je32_to_cpu(spx->offset),
  383. jeb->offset + je32_to_cpu(spx->offset) + je32_to_cpu(spx->totlen),
  384. je32_to_cpu(spx->xid), je32_to_cpu(spx->version));
  385. xd = jffs2_setup_xattr_datum(c, je32_to_cpu(spx->xid),
  386. je32_to_cpu(spx->version));
  387. if (IS_ERR(xd))
  388. return PTR_ERR(xd);
  389. if (xd->version > je32_to_cpu(spx->version)) {
  390. /* node is not the newest one */
  391. struct jffs2_raw_node_ref *raw
  392. = sum_link_node_ref(c, jeb, je32_to_cpu(spx->offset) | REF_UNCHECKED,
  393. PAD(je32_to_cpu(spx->totlen)), NULL);
  394. raw->next_in_ino = xd->node->next_in_ino;
  395. xd->node->next_in_ino = raw;
  396. } else {
  397. xd->version = je32_to_cpu(spx->version);
  398. sum_link_node_ref(c, jeb, je32_to_cpu(spx->offset) | REF_UNCHECKED,
  399. PAD(je32_to_cpu(spx->totlen)), (void *)xd);
  400. }
  401. *pseudo_random += je32_to_cpu(spx->xid);
  402. sp += JFFS2_SUMMARY_XATTR_SIZE;
  403. break;
  404. }
  405. case JFFS2_NODETYPE_XREF: {
  406. struct jffs2_xattr_ref *ref;
  407. struct jffs2_sum_xref_flash *spr;
  408. spr = (struct jffs2_sum_xref_flash *)sp;
  409. dbg_summary("xref at %#08x-%#08x\n",
  410. jeb->offset + je32_to_cpu(spr->offset),
  411. jeb->offset + je32_to_cpu(spr->offset) +
  412. (uint32_t)PAD(sizeof(struct jffs2_raw_xref)));
  413. ref = jffs2_alloc_xattr_ref();
  414. if (!ref) {
  415. JFFS2_NOTICE("allocation of xattr_datum failed\n");
  416. return -ENOMEM;
  417. }
  418. ref->next = c->xref_temp;
  419. c->xref_temp = ref;
  420. sum_link_node_ref(c, jeb, je32_to_cpu(spr->offset) | REF_UNCHECKED,
  421. PAD(sizeof(struct jffs2_raw_xref)), (void *)ref);
  422. *pseudo_random += ref->node->flash_offset;
  423. sp += JFFS2_SUMMARY_XREF_SIZE;
  424. break;
  425. }
  426. #endif
  427. default : {
  428. uint16_t nodetype = je16_to_cpu(((struct jffs2_sum_unknown_flash *)sp)->nodetype);
  429. JFFS2_WARNING("Unsupported node type %x found in summary! Exiting...\n", nodetype);
  430. if ((nodetype & JFFS2_COMPAT_MASK) == JFFS2_FEATURE_INCOMPAT)
  431. return -EIO;
  432. /* For compatible node types, just fall back to the full scan */
  433. c->wasted_size -= jeb->wasted_size;
  434. c->free_size += c->sector_size - jeb->free_size;
  435. c->used_size -= jeb->used_size;
  436. c->dirty_size -= jeb->dirty_size;
  437. jeb->wasted_size = jeb->used_size = jeb->dirty_size = 0;
  438. jeb->free_size = c->sector_size;
  439. jffs2_free_jeb_node_refs(c, jeb);
  440. return -ENOTRECOVERABLE;
  441. }
  442. }
  443. }
  444. return 0;
  445. }
  446. /* Process the summary node - called from jffs2_scan_eraseblock() */
  447. int jffs2_sum_scan_sumnode(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
  448. struct jffs2_raw_summary *summary, uint32_t sumsize,
  449. uint32_t *pseudo_random)
  450. {
  451. struct jffs2_unknown_node crcnode;
  452. int ret, ofs;
  453. uint32_t crc;
  454. ofs = c->sector_size - sumsize;
  455. dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
  456. jeb->offset, jeb->offset + ofs, sumsize);
  457. /* OK, now check for node validity and CRC */
  458. crcnode.magic = cpu_to_je16(JFFS2_MAGIC_BITMASK);
  459. crcnode.nodetype = cpu_to_je16(JFFS2_NODETYPE_SUMMARY);
  460. crcnode.totlen = summary->totlen;
  461. crc = crc32(0, &crcnode, sizeof(crcnode)-4);
  462. if (je32_to_cpu(summary->hdr_crc) != crc) {
  463. dbg_summary("Summary node header is corrupt (bad CRC or "
  464. "no summary at all)\n");
  465. goto crc_err;
  466. }
  467. if (je32_to_cpu(summary->totlen) != sumsize) {
  468. dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
  469. goto crc_err;
  470. }
  471. crc = crc32(0, summary, sizeof(struct jffs2_raw_summary)-8);
  472. if (je32_to_cpu(summary->node_crc) != crc) {
  473. dbg_summary("Summary node is corrupt (bad CRC)\n");
  474. goto crc_err;
  475. }
  476. crc = crc32(0, summary->sum, sumsize - sizeof(struct jffs2_raw_summary));
  477. if (je32_to_cpu(summary->sum_crc) != crc) {
  478. dbg_summary("Summary node data is corrupt (bad CRC)\n");
  479. goto crc_err;
  480. }
  481. if ( je32_to_cpu(summary->cln_mkr) ) {
  482. dbg_summary("Summary : CLEANMARKER node \n");
  483. ret = jffs2_prealloc_raw_node_refs(c, jeb, 1);
  484. if (ret)
  485. return ret;
  486. if (je32_to_cpu(summary->cln_mkr) != c->cleanmarker_size) {
  487. dbg_summary("CLEANMARKER node has totlen 0x%x != normal 0x%x\n",
  488. je32_to_cpu(summary->cln_mkr), c->cleanmarker_size);
  489. if ((ret = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(summary->cln_mkr)))))
  490. return ret;
  491. } else if (jeb->first_node) {
  492. dbg_summary("CLEANMARKER node not first node in block "
  493. "(0x%08x)\n", jeb->offset);
  494. if ((ret = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(summary->cln_mkr)))))
  495. return ret;
  496. } else {
  497. jffs2_link_node_ref(c, jeb, jeb->offset | REF_NORMAL,
  498. je32_to_cpu(summary->cln_mkr), NULL);
  499. }
  500. }
  501. ret = jffs2_sum_process_sum_data(c, jeb, summary, pseudo_random);
  502. /* -ENOTRECOVERABLE isn't a fatal error -- it means we should do a full
  503. scan of this eraseblock. So return zero */
  504. if (ret == -ENOTRECOVERABLE)
  505. return 0;
  506. if (ret)
  507. return ret; /* real error */
  508. /* for PARANOIA_CHECK */
  509. ret = jffs2_prealloc_raw_node_refs(c, jeb, 2);
  510. if (ret)
  511. return ret;
  512. sum_link_node_ref(c, jeb, ofs | REF_NORMAL, sumsize, NULL);
  513. if (unlikely(jeb->free_size)) {
  514. JFFS2_WARNING("Free size 0x%x bytes in eraseblock @0x%08x with summary?\n",
  515. jeb->free_size, jeb->offset);
  516. jeb->wasted_size += jeb->free_size;
  517. c->wasted_size += jeb->free_size;
  518. c->free_size -= jeb->free_size;
  519. jeb->free_size = 0;
  520. }
  521. return jffs2_scan_classify_jeb(c, jeb);
  522. crc_err:
  523. JFFS2_WARNING("Summary node crc error, skipping summary information.\n");
  524. return 0;
  525. }
  526. /* Write summary data to flash - helper function for jffs2_sum_write_sumnode() */
  527. static int jffs2_sum_write_data(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
  528. uint32_t infosize, uint32_t datasize, int padsize)
  529. {
  530. struct jffs2_raw_summary isum;
  531. union jffs2_sum_mem *temp;
  532. struct jffs2_sum_marker *sm;
  533. struct kvec vecs[2];
  534. uint32_t sum_ofs;
  535. void *wpage;
  536. int ret;
  537. size_t retlen;
  538. memset(c->summary->sum_buf, 0xff, datasize);
  539. memset(&isum, 0, sizeof(isum));
  540. isum.magic = cpu_to_je16(JFFS2_MAGIC_BITMASK);
  541. isum.nodetype = cpu_to_je16(JFFS2_NODETYPE_SUMMARY);
  542. isum.totlen = cpu_to_je32(infosize);
  543. isum.hdr_crc = cpu_to_je32(crc32(0, &isum, sizeof(struct jffs2_unknown_node) - 4));
  544. isum.padded = cpu_to_je32(c->summary->sum_padded);
  545. isum.cln_mkr = cpu_to_je32(c->cleanmarker_size);
  546. isum.sum_num = cpu_to_je32(c->summary->sum_num);
  547. wpage = c->summary->sum_buf;
  548. while (c->summary->sum_num) {
  549. temp = c->summary->sum_list_head;
  550. switch (je16_to_cpu(temp->u.nodetype)) {
  551. case JFFS2_NODETYPE_INODE: {
  552. struct jffs2_sum_inode_flash *sino_ptr = wpage;
  553. sino_ptr->nodetype = temp->i.nodetype;
  554. sino_ptr->inode = temp->i.inode;
  555. sino_ptr->version = temp->i.version;
  556. sino_ptr->offset = temp->i.offset;
  557. sino_ptr->totlen = temp->i.totlen;
  558. wpage += JFFS2_SUMMARY_INODE_SIZE;
  559. break;
  560. }
  561. case JFFS2_NODETYPE_DIRENT: {
  562. struct jffs2_sum_dirent_flash *sdrnt_ptr = wpage;
  563. sdrnt_ptr->nodetype = temp->d.nodetype;
  564. sdrnt_ptr->totlen = temp->d.totlen;
  565. sdrnt_ptr->offset = temp->d.offset;
  566. sdrnt_ptr->pino = temp->d.pino;
  567. sdrnt_ptr->version = temp->d.version;
  568. sdrnt_ptr->ino = temp->d.ino;
  569. sdrnt_ptr->nsize = temp->d.nsize;
  570. sdrnt_ptr->type = temp->d.type;
  571. memcpy(sdrnt_ptr->name, temp->d.name,
  572. temp->d.nsize);
  573. wpage += JFFS2_SUMMARY_DIRENT_SIZE(temp->d.nsize);
  574. break;
  575. }
  576. #ifdef CONFIG_JFFS2_FS_XATTR
  577. case JFFS2_NODETYPE_XATTR: {
  578. struct jffs2_sum_xattr_flash *sxattr_ptr = wpage;
  579. temp = c->summary->sum_list_head;
  580. sxattr_ptr->nodetype = temp->x.nodetype;
  581. sxattr_ptr->xid = temp->x.xid;
  582. sxattr_ptr->version = temp->x.version;
  583. sxattr_ptr->offset = temp->x.offset;
  584. sxattr_ptr->totlen = temp->x.totlen;
  585. wpage += JFFS2_SUMMARY_XATTR_SIZE;
  586. break;
  587. }
  588. case JFFS2_NODETYPE_XREF: {
  589. struct jffs2_sum_xref_flash *sxref_ptr = wpage;
  590. temp = c->summary->sum_list_head;
  591. sxref_ptr->nodetype = temp->r.nodetype;
  592. sxref_ptr->offset = temp->r.offset;
  593. wpage += JFFS2_SUMMARY_XREF_SIZE;
  594. break;
  595. }
  596. #endif
  597. default : {
  598. if ((je16_to_cpu(temp->u.nodetype) & JFFS2_COMPAT_MASK)
  599. == JFFS2_FEATURE_RWCOMPAT_COPY) {
  600. dbg_summary("Writing unknown RWCOMPAT_COPY node type %x\n",
  601. je16_to_cpu(temp->u.nodetype));
  602. jffs2_sum_disable_collecting(c->summary);
  603. } else {
  604. BUG(); /* unknown node in summary information */
  605. }
  606. }
  607. }
  608. c->summary->sum_list_head = temp->u.next;
  609. kfree(temp);
  610. c->summary->sum_num--;
  611. }
  612. jffs2_sum_reset_collected(c->summary);
  613. wpage += padsize;
  614. sm = wpage;
  615. sm->offset = cpu_to_je32(c->sector_size - jeb->free_size);
  616. sm->magic = cpu_to_je32(JFFS2_SUM_MAGIC);
  617. isum.sum_crc = cpu_to_je32(crc32(0, c->summary->sum_buf, datasize));
  618. isum.node_crc = cpu_to_je32(crc32(0, &isum, sizeof(isum) - 8));
  619. vecs[0].iov_base = &isum;
  620. vecs[0].iov_len = sizeof(isum);
  621. vecs[1].iov_base = c->summary->sum_buf;
  622. vecs[1].iov_len = datasize;
  623. sum_ofs = jeb->offset + c->sector_size - jeb->free_size;
  624. dbg_summary("JFFS2: writing out data to flash to pos : 0x%08x\n",
  625. sum_ofs);
  626. ret = jffs2_flash_writev(c, vecs, 2, sum_ofs, &retlen, 0);
  627. if (ret || (retlen != infosize)) {
  628. JFFS2_WARNING("Write of %u bytes at 0x%08x failed. returned %d, retlen %zd\n",
  629. infosize, sum_ofs, ret, retlen);
  630. if (retlen) {
  631. /* Waste remaining space */
  632. spin_lock(&c->erase_completion_lock);
  633. jffs2_link_node_ref(c, jeb, sum_ofs | REF_OBSOLETE, infosize, NULL);
  634. spin_unlock(&c->erase_completion_lock);
  635. }
  636. c->summary->sum_size = JFFS2_SUMMARY_NOSUM_SIZE;
  637. return 0;
  638. }
  639. spin_lock(&c->erase_completion_lock);
  640. jffs2_link_node_ref(c, jeb, sum_ofs | REF_NORMAL, infosize, NULL);
  641. spin_unlock(&c->erase_completion_lock);
  642. return 0;
  643. }
  644. /* Write out summary information - called from jffs2_do_reserve_space */
  645. int jffs2_sum_write_sumnode(struct jffs2_sb_info *c)
  646. {
  647. int datasize, infosize, padsize;
  648. struct jffs2_eraseblock *jeb;
  649. int ret;
  650. dbg_summary("called\n");
  651. spin_unlock(&c->erase_completion_lock);
  652. jeb = c->nextblock;
  653. jffs2_prealloc_raw_node_refs(c, jeb, 1);
  654. if (!c->summary->sum_num || !c->summary->sum_list_head) {
  655. JFFS2_WARNING("Empty summary info!!!\n");
  656. BUG();
  657. }
  658. datasize = c->summary->sum_size + sizeof(struct jffs2_sum_marker);
  659. infosize = sizeof(struct jffs2_raw_summary) + datasize;
  660. padsize = jeb->free_size - infosize;
  661. infosize += padsize;
  662. datasize += padsize;
  663. /* Is there enough space for summary? */
  664. if (padsize < 0) {
  665. /* don't try to write out summary for this jeb */
  666. jffs2_sum_disable_collecting(c->summary);
  667. JFFS2_WARNING("Not enough space for summary, padsize = %d\n", padsize);
  668. spin_lock(&c->erase_completion_lock);
  669. return 0;
  670. }
  671. ret = jffs2_sum_write_data(c, jeb, infosize, datasize, padsize);
  672. spin_lock(&c->erase_completion_lock);
  673. return ret;
  674. }