summary.c 23 KB

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