summary.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706
  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. *
  9. * For licensing information, see the file 'LICENCE' in this directory.
  10. *
  11. * $Id: summary.c,v 1.4 2005/09/26 11:37:21 havasi Exp $
  12. *
  13. */
  14. #include <linux/kernel.h>
  15. #include <linux/sched.h>
  16. #include <linux/slab.h>
  17. #include <linux/mtd/mtd.h>
  18. #include <linux/pagemap.h>
  19. #include <linux/crc32.h>
  20. #include <linux/compiler.h>
  21. #include <linux/vmalloc.h>
  22. #include "nodelist.h"
  23. #include "debug.h"
  24. int jffs2_sum_init(struct jffs2_sb_info *c)
  25. {
  26. c->summary = kmalloc(sizeof(struct jffs2_summary), GFP_KERNEL);
  27. if (!c->summary) {
  28. JFFS2_WARNING("Can't allocate memory for summary information!\n");
  29. return -ENOMEM;
  30. }
  31. memset(c->summary, 0, sizeof(struct jffs2_summary));
  32. c->summary->sum_buf = vmalloc(c->sector_size);
  33. if (!c->summary->sum_buf) {
  34. JFFS2_WARNING("Can't allocate buffer for writing out summary information!\n");
  35. kfree(c->summary);
  36. return -ENOMEM;
  37. }
  38. dbg_summary("returned succesfully\n");
  39. return 0;
  40. }
  41. void jffs2_sum_exit(struct jffs2_sb_info *c)
  42. {
  43. dbg_summary("called\n");
  44. jffs2_sum_disable_collecting(c->summary);
  45. vfree(c->summary->sum_buf);
  46. c->summary->sum_buf = NULL;
  47. kfree(c->summary);
  48. c->summary = NULL;
  49. }
  50. static int jffs2_sum_add_mem(struct jffs2_summary *s, union jffs2_sum_mem *item)
  51. {
  52. if (!s->sum_list_head)
  53. s->sum_list_head = (union jffs2_sum_mem *) item;
  54. if (s->sum_list_tail)
  55. s->sum_list_tail->u.next = (union jffs2_sum_mem *) item;
  56. s->sum_list_tail = (union jffs2_sum_mem *) item;
  57. switch (je16_to_cpu(item->u.nodetype)) {
  58. case JFFS2_NODETYPE_INODE:
  59. s->sum_size += JFFS2_SUMMARY_INODE_SIZE;
  60. s->sum_num++;
  61. dbg_summary("inode (%u) added to summary\n",
  62. je32_to_cpu(item->i.inode));
  63. break;
  64. case JFFS2_NODETYPE_DIRENT:
  65. s->sum_size += JFFS2_SUMMARY_DIRENT_SIZE(item->d.nsize);
  66. s->sum_num++;
  67. dbg_summary("dirent (%u) added to summary\n",
  68. je32_to_cpu(item->d.ino));
  69. break;
  70. default:
  71. JFFS2_WARNING("UNKNOWN node type %u\n",
  72. je16_to_cpu(item->u.nodetype));
  73. return 1;
  74. }
  75. return 0;
  76. }
  77. /* The following 3 functions are called from scan.c to collect summary info for not closed jeb */
  78. int jffs2_sum_add_padding_mem(struct jffs2_summary *s, uint32_t size)
  79. {
  80. dbg_summary("called with %u\n", size);
  81. s->sum_padded += size;
  82. return 0;
  83. }
  84. int jffs2_sum_add_inode_mem(struct jffs2_summary *s, struct jffs2_raw_inode *ri,
  85. uint32_t ofs)
  86. {
  87. struct jffs2_sum_inode_mem *temp = kmalloc(sizeof(struct jffs2_sum_inode_mem), GFP_KERNEL);
  88. if (!temp)
  89. return -ENOMEM;
  90. temp->nodetype = ri->nodetype;
  91. temp->inode = ri->ino;
  92. temp->version = ri->version;
  93. temp->offset = cpu_to_je32(ofs); /* relative offset from the begining of the jeb */
  94. temp->totlen = ri->totlen;
  95. temp->next = NULL;
  96. return jffs2_sum_add_mem(s, (union jffs2_sum_mem *)temp);
  97. }
  98. int jffs2_sum_add_dirent_mem(struct jffs2_summary *s, struct jffs2_raw_dirent *rd,
  99. uint32_t ofs)
  100. {
  101. struct jffs2_sum_dirent_mem *temp =
  102. kmalloc(sizeof(struct jffs2_sum_dirent_mem) + rd->nsize, GFP_KERNEL);
  103. if (!temp)
  104. return -ENOMEM;
  105. temp->nodetype = rd->nodetype;
  106. temp->totlen = rd->totlen;
  107. temp->offset = cpu_to_je32(ofs); /* relative from the begining of the jeb */
  108. temp->pino = rd->pino;
  109. temp->version = rd->version;
  110. temp->ino = rd->ino;
  111. temp->nsize = rd->nsize;
  112. temp->type = rd->type;
  113. temp->next = NULL;
  114. memcpy(temp->name, rd->name, rd->nsize);
  115. return jffs2_sum_add_mem(s, (union jffs2_sum_mem *)temp);
  116. }
  117. /* Cleanup every collected summary information */
  118. static void jffs2_sum_clean_collected(struct jffs2_summary *s)
  119. {
  120. union jffs2_sum_mem *temp;
  121. if (!s->sum_list_head) {
  122. dbg_summary("already empty\n");
  123. }
  124. while (s->sum_list_head) {
  125. temp = s->sum_list_head;
  126. s->sum_list_head = s->sum_list_head->u.next;
  127. kfree(temp);
  128. }
  129. s->sum_list_tail = NULL;
  130. s->sum_padded = 0;
  131. s->sum_num = 0;
  132. }
  133. void jffs2_sum_reset_collected(struct jffs2_summary *s)
  134. {
  135. dbg_summary("called\n");
  136. jffs2_sum_clean_collected(s);
  137. s->sum_size = 0;
  138. }
  139. void jffs2_sum_disable_collecting(struct jffs2_summary *s)
  140. {
  141. dbg_summary("called\n");
  142. jffs2_sum_clean_collected(s);
  143. s->sum_size = JFFS2_SUMMARY_NOSUM_SIZE;
  144. }
  145. int jffs2_sum_is_disabled(struct jffs2_summary *s)
  146. {
  147. return (s->sum_size == JFFS2_SUMMARY_NOSUM_SIZE);
  148. }
  149. /* Move the collected summary information into sb (called from scan.c) */
  150. void jffs2_sum_move_collected(struct jffs2_sb_info *c, struct jffs2_summary *s)
  151. {
  152. dbg_summary("oldsize=0x%x oldnum=%u => newsize=0x%x newnum=%u\n",
  153. c->summary->sum_size, c->summary->sum_num,
  154. s->sum_size, s->sum_num);
  155. c->summary->sum_size = s->sum_size;
  156. c->summary->sum_num = s->sum_num;
  157. c->summary->sum_padded = s->sum_padded;
  158. c->summary->sum_list_head = s->sum_list_head;
  159. c->summary->sum_list_tail = s->sum_list_tail;
  160. s->sum_list_head = s->sum_list_tail = NULL;
  161. }
  162. /* Called from wbuf.c to collect writed node info */
  163. int jffs2_sum_add_kvec(struct jffs2_sb_info *c, const struct kvec *invecs,
  164. unsigned long count, uint32_t ofs)
  165. {
  166. union jffs2_node_union *node;
  167. struct jffs2_eraseblock *jeb;
  168. node = invecs[0].iov_base;
  169. jeb = &c->blocks[ofs / c->sector_size];
  170. ofs -= jeb->offset;
  171. switch (je16_to_cpu(node->u.nodetype)) {
  172. case JFFS2_NODETYPE_INODE: {
  173. struct jffs2_sum_inode_mem *temp =
  174. kmalloc(sizeof(struct jffs2_sum_inode_mem), GFP_KERNEL);
  175. if (!temp)
  176. goto no_mem;
  177. temp->nodetype = node->i.nodetype;
  178. temp->inode = node->i.ino;
  179. temp->version = node->i.version;
  180. temp->offset = cpu_to_je32(ofs);
  181. temp->totlen = node->i.totlen;
  182. temp->next = NULL;
  183. return jffs2_sum_add_mem(c->summary, (union jffs2_sum_mem *)temp);
  184. }
  185. case JFFS2_NODETYPE_DIRENT: {
  186. struct jffs2_sum_dirent_mem *temp =
  187. kmalloc(sizeof(struct jffs2_sum_dirent_mem) + node->d.nsize, GFP_KERNEL);
  188. if (!temp)
  189. goto no_mem;
  190. temp->nodetype = node->d.nodetype;
  191. temp->totlen = node->d.totlen;
  192. temp->offset = cpu_to_je32(ofs);
  193. temp->pino = node->d.pino;
  194. temp->version = node->d.version;
  195. temp->ino = node->d.ino;
  196. temp->nsize = node->d.nsize;
  197. temp->type = node->d.type;
  198. temp->next = NULL;
  199. switch (count) {
  200. case 1:
  201. memcpy(temp->name,node->d.name,node->d.nsize);
  202. break;
  203. case 2:
  204. memcpy(temp->name,invecs[1].iov_base,node->d.nsize);
  205. break;
  206. default:
  207. BUG(); /* impossible count value */
  208. break;
  209. }
  210. return jffs2_sum_add_mem(c->summary, (union jffs2_sum_mem *)temp);
  211. }
  212. case JFFS2_NODETYPE_PADDING:
  213. dbg_summary("node PADDING\n");
  214. c->summary->sum_padded += je32_to_cpu(node->u.totlen);
  215. break;
  216. case JFFS2_NODETYPE_CLEANMARKER:
  217. dbg_summary("node CLEANMARKER\n");
  218. break;
  219. case JFFS2_NODETYPE_SUMMARY:
  220. dbg_summary("node SUMMARY\n");
  221. break;
  222. default:
  223. /* If you implement a new node type you should also implement
  224. summary support for it or disable summary.
  225. */
  226. BUG();
  227. break;
  228. }
  229. return 0;
  230. no_mem:
  231. JFFS2_WARNING("MEMORY ALLOCATION ERROR!");
  232. return -ENOMEM;
  233. }
  234. /* Process the stored summary information - helper function for jffs2_sum_scan_sumnode() */
  235. static int jffs2_sum_process_sum_data(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
  236. struct jffs2_raw_summary *summary, uint32_t *pseudo_random)
  237. {
  238. struct jffs2_raw_node_ref *raw;
  239. struct jffs2_inode_cache *ic;
  240. struct jffs2_full_dirent *fd;
  241. void *sp;
  242. int i, ino;
  243. sp = summary->sum;
  244. for (i=0; i<je32_to_cpu(summary->sum_num); i++) {
  245. dbg_summary("processing summary index %d\n", i);
  246. switch (je16_to_cpu(((struct jffs2_sum_unknown_flash *)sp)->nodetype)) {
  247. case JFFS2_NODETYPE_INODE: {
  248. struct jffs2_sum_inode_flash *spi;
  249. spi = sp;
  250. ino = je32_to_cpu(spi->inode);
  251. dbg_summary("Inode at 0x%08x\n",
  252. jeb->offset + je32_to_cpu(spi->offset));
  253. raw = jffs2_alloc_raw_node_ref();
  254. if (!raw) {
  255. JFFS2_NOTICE("allocation of node reference failed\n");
  256. return -ENOMEM;
  257. }
  258. ic = jffs2_scan_make_ino_cache(c, ino);
  259. if (!ic) {
  260. JFFS2_NOTICE("scan_make_ino_cache failed\n");
  261. jffs2_free_raw_node_ref(raw);
  262. return -ENOMEM;
  263. }
  264. raw->flash_offset = (jeb->offset + je32_to_cpu(spi->offset)) | REF_UNCHECKED;
  265. raw->__totlen = PAD(je32_to_cpu(spi->totlen));
  266. raw->next_phys = NULL;
  267. raw->next_in_ino = ic->nodes;
  268. ic->nodes = raw;
  269. if (!jeb->first_node)
  270. jeb->first_node = raw;
  271. if (jeb->last_node)
  272. jeb->last_node->next_phys = raw;
  273. jeb->last_node = raw;
  274. *pseudo_random += je32_to_cpu(spi->version);
  275. UNCHECKED_SPACE(PAD(je32_to_cpu(spi->totlen)));
  276. sp += JFFS2_SUMMARY_INODE_SIZE;
  277. break;
  278. }
  279. case JFFS2_NODETYPE_DIRENT: {
  280. struct jffs2_sum_dirent_flash *spd;
  281. spd = sp;
  282. dbg_summary("Dirent at 0x%08x\n",
  283. jeb->offset + je32_to_cpu(spd->offset));
  284. fd = jffs2_alloc_full_dirent(spd->nsize+1);
  285. if (!fd)
  286. return -ENOMEM;
  287. memcpy(&fd->name, spd->name, spd->nsize);
  288. fd->name[spd->nsize] = 0;
  289. raw = jffs2_alloc_raw_node_ref();
  290. if (!raw) {
  291. jffs2_free_full_dirent(fd);
  292. JFFS2_NOTICE("allocation of node reference failed\n");
  293. return -ENOMEM;
  294. }
  295. ic = jffs2_scan_make_ino_cache(c, je32_to_cpu(spd->pino));
  296. if (!ic) {
  297. jffs2_free_full_dirent(fd);
  298. jffs2_free_raw_node_ref(raw);
  299. return -ENOMEM;
  300. }
  301. raw->__totlen = PAD(je32_to_cpu(spd->totlen));
  302. raw->flash_offset = (jeb->offset + je32_to_cpu(spd->offset)) | REF_PRISTINE;
  303. raw->next_phys = NULL;
  304. raw->next_in_ino = ic->nodes;
  305. ic->nodes = raw;
  306. if (!jeb->first_node)
  307. jeb->first_node = raw;
  308. if (jeb->last_node)
  309. jeb->last_node->next_phys = raw;
  310. jeb->last_node = raw;
  311. fd->raw = raw;
  312. fd->next = NULL;
  313. fd->version = je32_to_cpu(spd->version);
  314. fd->ino = je32_to_cpu(spd->ino);
  315. fd->nhash = full_name_hash(fd->name, spd->nsize);
  316. fd->type = spd->type;
  317. USED_SPACE(PAD(je32_to_cpu(spd->totlen)));
  318. jffs2_add_fd_to_list(c, fd, &ic->scan_dents);
  319. *pseudo_random += je32_to_cpu(spd->version);
  320. sp += JFFS2_SUMMARY_DIRENT_SIZE(spd->nsize);
  321. break;
  322. }
  323. default : {
  324. JFFS2_WARNING("Unsupported node type found in summary! Exiting...");
  325. return -EIO;
  326. }
  327. }
  328. }
  329. return 0;
  330. }
  331. /* Process the summary node - called from jffs2_scan_eraseblock() */
  332. int jffs2_sum_scan_sumnode(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
  333. struct jffs2_raw_summary *summary, uint32_t sumsize,
  334. uint32_t *pseudo_random)
  335. {
  336. struct jffs2_unknown_node crcnode;
  337. struct jffs2_raw_node_ref *cache_ref;
  338. int ret, ofs;
  339. uint32_t crc;
  340. ofs = jeb->offset + c->sector_size - sumsize;
  341. dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
  342. jeb->offset, ofs, sumsize);
  343. /* OK, now check for node validity and CRC */
  344. crcnode.magic = cpu_to_je16(JFFS2_MAGIC_BITMASK);
  345. crcnode.nodetype = cpu_to_je16(JFFS2_NODETYPE_SUMMARY);
  346. crcnode.totlen = summary->totlen;
  347. crc = crc32(0, &crcnode, sizeof(crcnode)-4);
  348. if (je32_to_cpu(summary->hdr_crc) != crc) {
  349. dbg_summary("Summary node header is corrupt (bad CRC or "
  350. "no summary at all)\n");
  351. goto crc_err;
  352. }
  353. if (je32_to_cpu(summary->totlen) != sumsize) {
  354. dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
  355. goto crc_err;
  356. }
  357. crc = crc32(0, summary, sizeof(struct jffs2_raw_summary)-8);
  358. if (je32_to_cpu(summary->node_crc) != crc) {
  359. dbg_summary("Summary node is corrupt (bad CRC)\n");
  360. goto crc_err;
  361. }
  362. crc = crc32(0, summary->sum, sumsize - sizeof(struct jffs2_raw_summary));
  363. if (je32_to_cpu(summary->sum_crc) != crc) {
  364. dbg_summary("Summary node data is corrupt (bad CRC)\n");
  365. goto crc_err;
  366. }
  367. if ( je32_to_cpu(summary->cln_mkr) ) {
  368. dbg_summary("Summary : CLEANMARKER node \n");
  369. if (je32_to_cpu(summary->cln_mkr) != c->cleanmarker_size) {
  370. dbg_summary("CLEANMARKER node has totlen 0x%x != normal 0x%x\n",
  371. je32_to_cpu(summary->cln_mkr), c->cleanmarker_size);
  372. UNCHECKED_SPACE(PAD(je32_to_cpu(summary->cln_mkr)));
  373. } else if (jeb->first_node) {
  374. dbg_summary("CLEANMARKER node not first node in block "
  375. "(0x%08x)\n", jeb->offset);
  376. UNCHECKED_SPACE(PAD(je32_to_cpu(summary->cln_mkr)));
  377. } else {
  378. struct jffs2_raw_node_ref *marker_ref = jffs2_alloc_raw_node_ref();
  379. if (!marker_ref) {
  380. JFFS2_NOTICE("Failed to allocate node ref for clean marker\n");
  381. return -ENOMEM;
  382. }
  383. marker_ref->next_in_ino = NULL;
  384. marker_ref->next_phys = NULL;
  385. marker_ref->flash_offset = jeb->offset | REF_NORMAL;
  386. marker_ref->__totlen = je32_to_cpu(summary->cln_mkr);
  387. jeb->first_node = jeb->last_node = marker_ref;
  388. USED_SPACE( PAD(je32_to_cpu(summary->cln_mkr)) );
  389. }
  390. }
  391. if (je32_to_cpu(summary->padded)) {
  392. DIRTY_SPACE(je32_to_cpu(summary->padded));
  393. }
  394. ret = jffs2_sum_process_sum_data(c, jeb, summary, pseudo_random);
  395. if (ret)
  396. return ret;
  397. /* for PARANOIA_CHECK */
  398. cache_ref = jffs2_alloc_raw_node_ref();
  399. if (!cache_ref) {
  400. JFFS2_NOTICE("Failed to allocate node ref for cache\n");
  401. return -ENOMEM;
  402. }
  403. cache_ref->next_in_ino = NULL;
  404. cache_ref->next_phys = NULL;
  405. cache_ref->flash_offset = ofs | REF_NORMAL;
  406. cache_ref->__totlen = sumsize;
  407. if (!jeb->first_node)
  408. jeb->first_node = cache_ref;
  409. if (jeb->last_node)
  410. jeb->last_node->next_phys = cache_ref;
  411. jeb->last_node = cache_ref;
  412. USED_SPACE(sumsize);
  413. jeb->wasted_size += jeb->free_size;
  414. c->wasted_size += jeb->free_size;
  415. c->free_size -= jeb->free_size;
  416. jeb->free_size = 0;
  417. return jffs2_scan_classify_jeb(c, jeb);
  418. crc_err:
  419. JFFS2_WARNING("Summary node crc error, skipping summary information.\n");
  420. return 0;
  421. }
  422. /* Write summary data to flash - helper function for jffs2_sum_write_sumnode() */
  423. static int jffs2_sum_write_data(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
  424. uint32_t infosize, uint32_t datasize, int padsize)
  425. {
  426. struct jffs2_raw_summary isum;
  427. union jffs2_sum_mem *temp;
  428. struct jffs2_sum_marker *sm;
  429. struct kvec vecs[2];
  430. void *wpage;
  431. int ret;
  432. size_t retlen;
  433. memset(c->summary->sum_buf, 0xff, datasize);
  434. memset(&isum, 0, sizeof(isum));
  435. isum.magic = cpu_to_je16(JFFS2_MAGIC_BITMASK);
  436. isum.nodetype = cpu_to_je16(JFFS2_NODETYPE_SUMMARY);
  437. isum.totlen = cpu_to_je32(infosize);
  438. isum.hdr_crc = cpu_to_je32(crc32(0, &isum, sizeof(struct jffs2_unknown_node) - 4));
  439. isum.padded = cpu_to_je32(c->summary->sum_padded);
  440. isum.cln_mkr = cpu_to_je32(c->cleanmarker_size);
  441. isum.sum_num = cpu_to_je32(c->summary->sum_num);
  442. wpage = c->summary->sum_buf;
  443. while (c->summary->sum_num) {
  444. temp = c->summary->sum_list_head;
  445. switch (je16_to_cpu(temp->u.nodetype)) {
  446. case JFFS2_NODETYPE_INODE: {
  447. struct jffs2_sum_inode_flash *sino_ptr = wpage;
  448. sino_ptr->nodetype = temp->i.nodetype;
  449. sino_ptr->inode = temp->i.inode;
  450. sino_ptr->version = temp->i.version;
  451. sino_ptr->offset = temp->i.offset;
  452. sino_ptr->totlen = temp->i.totlen;
  453. wpage += JFFS2_SUMMARY_INODE_SIZE;
  454. break;
  455. }
  456. case JFFS2_NODETYPE_DIRENT: {
  457. struct jffs2_sum_dirent_flash *sdrnt_ptr = wpage;
  458. sdrnt_ptr->nodetype = temp->d.nodetype;
  459. sdrnt_ptr->totlen = temp->d.totlen;
  460. sdrnt_ptr->offset = temp->d.offset;
  461. sdrnt_ptr->pino = temp->d.pino;
  462. sdrnt_ptr->version = temp->d.version;
  463. sdrnt_ptr->ino = temp->d.ino;
  464. sdrnt_ptr->nsize = temp->d.nsize;
  465. sdrnt_ptr->type = temp->d.type;
  466. memcpy(sdrnt_ptr->name, temp->d.name,
  467. temp->d.nsize);
  468. wpage += JFFS2_SUMMARY_DIRENT_SIZE(temp->d.nsize);
  469. break;
  470. }
  471. default : {
  472. BUG(); /* unknown node in summary information */
  473. }
  474. }
  475. c->summary->sum_list_head = temp->u.next;
  476. kfree(temp);
  477. c->summary->sum_num--;
  478. }
  479. jffs2_sum_reset_collected(c->summary);
  480. wpage += padsize;
  481. sm = wpage;
  482. sm->offset = cpu_to_je32(c->sector_size - jeb->free_size);
  483. sm->magic = cpu_to_je32(JFFS2_SUM_MAGIC);
  484. isum.sum_crc = cpu_to_je32(crc32(0, c->summary->sum_buf, datasize));
  485. isum.node_crc = cpu_to_je32(crc32(0, &isum, sizeof(isum) - 8));
  486. vecs[0].iov_base = &isum;
  487. vecs[0].iov_len = sizeof(isum);
  488. vecs[1].iov_base = c->summary->sum_buf;
  489. vecs[1].iov_len = datasize;
  490. dbg_summary("JFFS2: writing out data to flash to pos : 0x%08x\n",
  491. jeb->offset + c->sector_size - jeb->free_size);
  492. spin_unlock(&c->erase_completion_lock);
  493. ret = jffs2_flash_writev(c, vecs, 2, jeb->offset + c->sector_size -
  494. jeb->free_size, &retlen, 0);
  495. spin_lock(&c->erase_completion_lock);
  496. if (ret || (retlen != infosize)) {
  497. JFFS2_WARNING("Write of %u bytes at 0x%08x failed. returned %d, retlen %zd\n",
  498. infosize, jeb->offset + c->sector_size - jeb->free_size, ret, retlen);
  499. c->summary->sum_size = JFFS2_SUMMARY_NOSUM_SIZE;
  500. WASTED_SPACE(infosize);
  501. return 1;
  502. }
  503. return 0;
  504. }
  505. /* Write out summary information - called from jffs2_do_reserve_space */
  506. int jffs2_sum_write_sumnode(struct jffs2_sb_info *c)
  507. {
  508. struct jffs2_raw_node_ref *summary_ref;
  509. int datasize, infosize, padsize, ret;
  510. struct jffs2_eraseblock *jeb;
  511. dbg_summary("called\n");
  512. jeb = c->nextblock;
  513. if (!c->summary->sum_num || !c->summary->sum_list_head) {
  514. JFFS2_WARNING("Empty summary info!!!\n");
  515. BUG();
  516. }
  517. datasize = c->summary->sum_size + sizeof(struct jffs2_sum_marker);
  518. infosize = sizeof(struct jffs2_raw_summary) + datasize;
  519. padsize = jeb->free_size - infosize;
  520. infosize += padsize;
  521. datasize += padsize;
  522. /* Is there enough space for summary? */
  523. if (padsize < 0) {
  524. /* don't try to write out summary for this jeb */
  525. jffs2_sum_disable_collecting(c->summary);
  526. JFFS2_WARNING("Not enough space for summary, padsize = %d\n", padsize);
  527. return 0;
  528. }
  529. ret = jffs2_sum_write_data(c, jeb, infosize, datasize, padsize);
  530. if (ret)
  531. return 0; /* can't write out summary, block is marked as NOSUM_SIZE */
  532. /* for ACCT_PARANOIA_CHECK */
  533. spin_unlock(&c->erase_completion_lock);
  534. summary_ref = jffs2_alloc_raw_node_ref();
  535. spin_lock(&c->erase_completion_lock);
  536. if (!summary_ref) {
  537. JFFS2_NOTICE("Failed to allocate node ref for summary\n");
  538. return -ENOMEM;
  539. }
  540. summary_ref->next_in_ino = NULL;
  541. summary_ref->next_phys = NULL;
  542. summary_ref->flash_offset = (jeb->offset + c->sector_size - jeb->free_size) | REF_NORMAL;
  543. summary_ref->__totlen = infosize;
  544. if (!jeb->first_node)
  545. jeb->first_node = summary_ref;
  546. if (jeb->last_node)
  547. jeb->last_node->next_phys = summary_ref;
  548. jeb->last_node = summary_ref;
  549. USED_SPACE(infosize);
  550. return 0;
  551. }