summary.c 24 KB

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