fastmap.c 40 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681
  1. /*
  2. * Copyright (c) 2012 Linutronix GmbH
  3. * Copyright (c) 2014 sigma star gmbh
  4. * Author: Richard Weinberger <richard@nod.at>
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation; version 2.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
  13. * the GNU General Public License for more details.
  14. *
  15. */
  16. #include <linux/crc32.h>
  17. #include <linux/bitmap.h>
  18. #include "ubi.h"
  19. /**
  20. * init_seen - allocate memory for used for debugging.
  21. * @ubi: UBI device description object
  22. */
  23. static inline unsigned long *init_seen(struct ubi_device *ubi)
  24. {
  25. unsigned long *ret;
  26. if (!ubi_dbg_chk_fastmap(ubi))
  27. return NULL;
  28. ret = kcalloc(BITS_TO_LONGS(ubi->peb_count), sizeof(unsigned long),
  29. GFP_KERNEL);
  30. if (!ret)
  31. return ERR_PTR(-ENOMEM);
  32. return ret;
  33. }
  34. /**
  35. * free_seen - free the seen logic integer array.
  36. * @seen: integer array of @ubi->peb_count size
  37. */
  38. static inline void free_seen(unsigned long *seen)
  39. {
  40. kfree(seen);
  41. }
  42. /**
  43. * set_seen - mark a PEB as seen.
  44. * @ubi: UBI device description object
  45. * @pnum: The PEB to be makred as seen
  46. * @seen: integer array of @ubi->peb_count size
  47. */
  48. static inline void set_seen(struct ubi_device *ubi, int pnum, unsigned long *seen)
  49. {
  50. if (!ubi_dbg_chk_fastmap(ubi) || !seen)
  51. return;
  52. set_bit(pnum, seen);
  53. }
  54. /**
  55. * self_check_seen - check whether all PEB have been seen by fastmap.
  56. * @ubi: UBI device description object
  57. * @seen: integer array of @ubi->peb_count size
  58. */
  59. static int self_check_seen(struct ubi_device *ubi, unsigned long *seen)
  60. {
  61. int pnum, ret = 0;
  62. if (!ubi_dbg_chk_fastmap(ubi) || !seen)
  63. return 0;
  64. for (pnum = 0; pnum < ubi->peb_count; pnum++) {
  65. if (test_bit(pnum, seen) && ubi->lookuptbl[pnum]) {
  66. ubi_err(ubi, "self-check failed for PEB %d, fastmap didn't see it", pnum);
  67. ret = -EINVAL;
  68. }
  69. }
  70. return ret;
  71. }
  72. /**
  73. * ubi_calc_fm_size - calculates the fastmap size in bytes for an UBI device.
  74. * @ubi: UBI device description object
  75. */
  76. size_t ubi_calc_fm_size(struct ubi_device *ubi)
  77. {
  78. size_t size;
  79. size = sizeof(struct ubi_fm_sb) +
  80. sizeof(struct ubi_fm_hdr) +
  81. sizeof(struct ubi_fm_scan_pool) +
  82. sizeof(struct ubi_fm_scan_pool) +
  83. (ubi->peb_count * sizeof(struct ubi_fm_ec)) +
  84. (sizeof(struct ubi_fm_eba) +
  85. (ubi->peb_count * sizeof(__be32))) +
  86. sizeof(struct ubi_fm_volhdr) * UBI_MAX_VOLUMES;
  87. return roundup(size, ubi->leb_size);
  88. }
  89. /**
  90. * new_fm_vhdr - allocate a new volume header for fastmap usage.
  91. * @ubi: UBI device description object
  92. * @vol_id: the VID of the new header
  93. *
  94. * Returns a new struct ubi_vid_hdr on success.
  95. * NULL indicates out of memory.
  96. */
  97. static struct ubi_vid_io_buf *new_fm_vbuf(struct ubi_device *ubi, int vol_id)
  98. {
  99. struct ubi_vid_io_buf *new;
  100. struct ubi_vid_hdr *vh;
  101. new = ubi_alloc_vid_buf(ubi, GFP_KERNEL);
  102. if (!new)
  103. goto out;
  104. vh = ubi_get_vid_hdr(new);
  105. vh->vol_type = UBI_VID_DYNAMIC;
  106. vh->vol_id = cpu_to_be32(vol_id);
  107. /* UBI implementations without fastmap support have to delete the
  108. * fastmap.
  109. */
  110. vh->compat = UBI_COMPAT_DELETE;
  111. out:
  112. return new;
  113. }
  114. /**
  115. * add_aeb - create and add a attach erase block to a given list.
  116. * @ai: UBI attach info object
  117. * @list: the target list
  118. * @pnum: PEB number of the new attach erase block
  119. * @ec: erease counter of the new LEB
  120. * @scrub: scrub this PEB after attaching
  121. *
  122. * Returns 0 on success, < 0 indicates an internal error.
  123. */
  124. static int add_aeb(struct ubi_attach_info *ai, struct list_head *list,
  125. int pnum, int ec, int scrub)
  126. {
  127. struct ubi_ainf_peb *aeb;
  128. aeb = ubi_alloc_aeb(ai, pnum, ec);
  129. if (!aeb)
  130. return -ENOMEM;
  131. aeb->lnum = -1;
  132. aeb->scrub = scrub;
  133. aeb->copy_flag = aeb->sqnum = 0;
  134. ai->ec_sum += aeb->ec;
  135. ai->ec_count++;
  136. if (ai->max_ec < aeb->ec)
  137. ai->max_ec = aeb->ec;
  138. if (ai->min_ec > aeb->ec)
  139. ai->min_ec = aeb->ec;
  140. list_add_tail(&aeb->u.list, list);
  141. return 0;
  142. }
  143. /**
  144. * add_vol - create and add a new volume to ubi_attach_info.
  145. * @ai: ubi_attach_info object
  146. * @vol_id: VID of the new volume
  147. * @used_ebs: number of used EBS
  148. * @data_pad: data padding value of the new volume
  149. * @vol_type: volume type
  150. * @last_eb_bytes: number of bytes in the last LEB
  151. *
  152. * Returns the new struct ubi_ainf_volume on success.
  153. * NULL indicates an error.
  154. */
  155. static struct ubi_ainf_volume *add_vol(struct ubi_attach_info *ai, int vol_id,
  156. int used_ebs, int data_pad, u8 vol_type,
  157. int last_eb_bytes)
  158. {
  159. struct ubi_ainf_volume *av;
  160. av = ubi_add_av(ai, vol_id);
  161. if (IS_ERR(av))
  162. return av;
  163. av->data_pad = data_pad;
  164. av->last_data_size = last_eb_bytes;
  165. av->compat = 0;
  166. av->vol_type = vol_type;
  167. if (av->vol_type == UBI_STATIC_VOLUME)
  168. av->used_ebs = used_ebs;
  169. dbg_bld("found volume (ID %i)", vol_id);
  170. return av;
  171. }
  172. /**
  173. * assign_aeb_to_av - assigns a SEB to a given ainf_volume and removes it
  174. * from it's original list.
  175. * @ai: ubi_attach_info object
  176. * @aeb: the to be assigned SEB
  177. * @av: target scan volume
  178. */
  179. static void assign_aeb_to_av(struct ubi_attach_info *ai,
  180. struct ubi_ainf_peb *aeb,
  181. struct ubi_ainf_volume *av)
  182. {
  183. struct ubi_ainf_peb *tmp_aeb;
  184. struct rb_node **p = &ai->volumes.rb_node, *parent = NULL;
  185. p = &av->root.rb_node;
  186. while (*p) {
  187. parent = *p;
  188. tmp_aeb = rb_entry(parent, struct ubi_ainf_peb, u.rb);
  189. if (aeb->lnum != tmp_aeb->lnum) {
  190. if (aeb->lnum < tmp_aeb->lnum)
  191. p = &(*p)->rb_left;
  192. else
  193. p = &(*p)->rb_right;
  194. continue;
  195. } else
  196. break;
  197. }
  198. list_del(&aeb->u.list);
  199. av->leb_count++;
  200. rb_link_node(&aeb->u.rb, parent, p);
  201. rb_insert_color(&aeb->u.rb, &av->root);
  202. }
  203. /**
  204. * update_vol - inserts or updates a LEB which was found a pool.
  205. * @ubi: the UBI device object
  206. * @ai: attach info object
  207. * @av: the volume this LEB belongs to
  208. * @new_vh: the volume header derived from new_aeb
  209. * @new_aeb: the AEB to be examined
  210. *
  211. * Returns 0 on success, < 0 indicates an internal error.
  212. */
  213. static int update_vol(struct ubi_device *ubi, struct ubi_attach_info *ai,
  214. struct ubi_ainf_volume *av, struct ubi_vid_hdr *new_vh,
  215. struct ubi_ainf_peb *new_aeb)
  216. {
  217. struct rb_node **p = &av->root.rb_node, *parent = NULL;
  218. struct ubi_ainf_peb *aeb, *victim;
  219. int cmp_res;
  220. while (*p) {
  221. parent = *p;
  222. aeb = rb_entry(parent, struct ubi_ainf_peb, u.rb);
  223. if (be32_to_cpu(new_vh->lnum) != aeb->lnum) {
  224. if (be32_to_cpu(new_vh->lnum) < aeb->lnum)
  225. p = &(*p)->rb_left;
  226. else
  227. p = &(*p)->rb_right;
  228. continue;
  229. }
  230. /* This case can happen if the fastmap gets written
  231. * because of a volume change (creation, deletion, ..).
  232. * Then a PEB can be within the persistent EBA and the pool.
  233. */
  234. if (aeb->pnum == new_aeb->pnum) {
  235. ubi_assert(aeb->lnum == new_aeb->lnum);
  236. ubi_free_aeb(ai, new_aeb);
  237. return 0;
  238. }
  239. cmp_res = ubi_compare_lebs(ubi, aeb, new_aeb->pnum, new_vh);
  240. if (cmp_res < 0)
  241. return cmp_res;
  242. /* new_aeb is newer */
  243. if (cmp_res & 1) {
  244. victim = ubi_alloc_aeb(ai, aeb->pnum, aeb->ec);
  245. if (!victim)
  246. return -ENOMEM;
  247. list_add_tail(&victim->u.list, &ai->erase);
  248. if (av->highest_lnum == be32_to_cpu(new_vh->lnum))
  249. av->last_data_size =
  250. be32_to_cpu(new_vh->data_size);
  251. dbg_bld("vol %i: AEB %i's PEB %i is the newer",
  252. av->vol_id, aeb->lnum, new_aeb->pnum);
  253. aeb->ec = new_aeb->ec;
  254. aeb->pnum = new_aeb->pnum;
  255. aeb->copy_flag = new_vh->copy_flag;
  256. aeb->scrub = new_aeb->scrub;
  257. aeb->sqnum = new_aeb->sqnum;
  258. ubi_free_aeb(ai, new_aeb);
  259. /* new_aeb is older */
  260. } else {
  261. dbg_bld("vol %i: AEB %i's PEB %i is old, dropping it",
  262. av->vol_id, aeb->lnum, new_aeb->pnum);
  263. list_add_tail(&new_aeb->u.list, &ai->erase);
  264. }
  265. return 0;
  266. }
  267. /* This LEB is new, let's add it to the volume */
  268. if (av->highest_lnum <= be32_to_cpu(new_vh->lnum)) {
  269. av->highest_lnum = be32_to_cpu(new_vh->lnum);
  270. av->last_data_size = be32_to_cpu(new_vh->data_size);
  271. }
  272. if (av->vol_type == UBI_STATIC_VOLUME)
  273. av->used_ebs = be32_to_cpu(new_vh->used_ebs);
  274. av->leb_count++;
  275. rb_link_node(&new_aeb->u.rb, parent, p);
  276. rb_insert_color(&new_aeb->u.rb, &av->root);
  277. return 0;
  278. }
  279. /**
  280. * process_pool_aeb - we found a non-empty PEB in a pool.
  281. * @ubi: UBI device object
  282. * @ai: attach info object
  283. * @new_vh: the volume header derived from new_aeb
  284. * @new_aeb: the AEB to be examined
  285. *
  286. * Returns 0 on success, < 0 indicates an internal error.
  287. */
  288. static int process_pool_aeb(struct ubi_device *ubi, struct ubi_attach_info *ai,
  289. struct ubi_vid_hdr *new_vh,
  290. struct ubi_ainf_peb *new_aeb)
  291. {
  292. int vol_id = be32_to_cpu(new_vh->vol_id);
  293. struct ubi_ainf_volume *av;
  294. if (vol_id == UBI_FM_SB_VOLUME_ID || vol_id == UBI_FM_DATA_VOLUME_ID) {
  295. ubi_free_aeb(ai, new_aeb);
  296. return 0;
  297. }
  298. /* Find the volume this SEB belongs to */
  299. av = ubi_find_av(ai, vol_id);
  300. if (!av) {
  301. ubi_err(ubi, "orphaned volume in fastmap pool!");
  302. ubi_free_aeb(ai, new_aeb);
  303. return UBI_BAD_FASTMAP;
  304. }
  305. ubi_assert(vol_id == av->vol_id);
  306. return update_vol(ubi, ai, av, new_vh, new_aeb);
  307. }
  308. /**
  309. * unmap_peb - unmap a PEB.
  310. * If fastmap detects a free PEB in the pool it has to check whether
  311. * this PEB has been unmapped after writing the fastmap.
  312. *
  313. * @ai: UBI attach info object
  314. * @pnum: The PEB to be unmapped
  315. */
  316. static void unmap_peb(struct ubi_attach_info *ai, int pnum)
  317. {
  318. struct ubi_ainf_volume *av;
  319. struct rb_node *node, *node2;
  320. struct ubi_ainf_peb *aeb;
  321. ubi_rb_for_each_entry(node, av, &ai->volumes, rb) {
  322. ubi_rb_for_each_entry(node2, aeb, &av->root, u.rb) {
  323. if (aeb->pnum == pnum) {
  324. rb_erase(&aeb->u.rb, &av->root);
  325. av->leb_count--;
  326. ubi_free_aeb(ai, aeb);
  327. return;
  328. }
  329. }
  330. }
  331. }
  332. /**
  333. * scan_pool - scans a pool for changed (no longer empty PEBs).
  334. * @ubi: UBI device object
  335. * @ai: attach info object
  336. * @pebs: an array of all PEB numbers in the to be scanned pool
  337. * @pool_size: size of the pool (number of entries in @pebs)
  338. * @max_sqnum: pointer to the maximal sequence number
  339. * @free: list of PEBs which are most likely free (and go into @ai->free)
  340. *
  341. * Returns 0 on success, if the pool is unusable UBI_BAD_FASTMAP is returned.
  342. * < 0 indicates an internal error.
  343. */
  344. static int scan_pool(struct ubi_device *ubi, struct ubi_attach_info *ai,
  345. __be32 *pebs, int pool_size, unsigned long long *max_sqnum,
  346. struct list_head *free)
  347. {
  348. struct ubi_vid_io_buf *vb;
  349. struct ubi_vid_hdr *vh;
  350. struct ubi_ec_hdr *ech;
  351. struct ubi_ainf_peb *new_aeb;
  352. int i, pnum, err, ret = 0;
  353. ech = kzalloc(ubi->ec_hdr_alsize, GFP_KERNEL);
  354. if (!ech)
  355. return -ENOMEM;
  356. vb = ubi_alloc_vid_buf(ubi, GFP_KERNEL);
  357. if (!vb) {
  358. kfree(ech);
  359. return -ENOMEM;
  360. }
  361. vh = ubi_get_vid_hdr(vb);
  362. dbg_bld("scanning fastmap pool: size = %i", pool_size);
  363. /*
  364. * Now scan all PEBs in the pool to find changes which have been made
  365. * after the creation of the fastmap
  366. */
  367. for (i = 0; i < pool_size; i++) {
  368. int scrub = 0;
  369. int image_seq;
  370. pnum = be32_to_cpu(pebs[i]);
  371. if (ubi_io_is_bad(ubi, pnum)) {
  372. ubi_err(ubi, "bad PEB in fastmap pool!");
  373. ret = UBI_BAD_FASTMAP;
  374. goto out;
  375. }
  376. err = ubi_io_read_ec_hdr(ubi, pnum, ech, 0);
  377. if (err && err != UBI_IO_BITFLIPS) {
  378. ubi_err(ubi, "unable to read EC header! PEB:%i err:%i",
  379. pnum, err);
  380. ret = err > 0 ? UBI_BAD_FASTMAP : err;
  381. goto out;
  382. } else if (err == UBI_IO_BITFLIPS)
  383. scrub = 1;
  384. /*
  385. * Older UBI implementations have image_seq set to zero, so
  386. * we shouldn't fail if image_seq == 0.
  387. */
  388. image_seq = be32_to_cpu(ech->image_seq);
  389. if (image_seq && (image_seq != ubi->image_seq)) {
  390. ubi_err(ubi, "bad image seq: 0x%x, expected: 0x%x",
  391. be32_to_cpu(ech->image_seq), ubi->image_seq);
  392. ret = UBI_BAD_FASTMAP;
  393. goto out;
  394. }
  395. err = ubi_io_read_vid_hdr(ubi, pnum, vb, 0);
  396. if (err == UBI_IO_FF || err == UBI_IO_FF_BITFLIPS) {
  397. unsigned long long ec = be64_to_cpu(ech->ec);
  398. unmap_peb(ai, pnum);
  399. dbg_bld("Adding PEB to free: %i", pnum);
  400. if (err == UBI_IO_FF_BITFLIPS)
  401. scrub = 1;
  402. add_aeb(ai, free, pnum, ec, scrub);
  403. continue;
  404. } else if (err == 0 || err == UBI_IO_BITFLIPS) {
  405. dbg_bld("Found non empty PEB:%i in pool", pnum);
  406. if (err == UBI_IO_BITFLIPS)
  407. scrub = 1;
  408. new_aeb = ubi_alloc_aeb(ai, pnum, be64_to_cpu(ech->ec));
  409. if (!new_aeb) {
  410. ret = -ENOMEM;
  411. goto out;
  412. }
  413. new_aeb->lnum = be32_to_cpu(vh->lnum);
  414. new_aeb->sqnum = be64_to_cpu(vh->sqnum);
  415. new_aeb->copy_flag = vh->copy_flag;
  416. new_aeb->scrub = scrub;
  417. if (*max_sqnum < new_aeb->sqnum)
  418. *max_sqnum = new_aeb->sqnum;
  419. err = process_pool_aeb(ubi, ai, vh, new_aeb);
  420. if (err) {
  421. ret = err > 0 ? UBI_BAD_FASTMAP : err;
  422. goto out;
  423. }
  424. } else {
  425. /* We are paranoid and fall back to scanning mode */
  426. ubi_err(ubi, "fastmap pool PEBs contains damaged PEBs!");
  427. ret = err > 0 ? UBI_BAD_FASTMAP : err;
  428. goto out;
  429. }
  430. }
  431. out:
  432. ubi_free_vid_buf(vb);
  433. kfree(ech);
  434. return ret;
  435. }
  436. /**
  437. * count_fastmap_pebs - Counts the PEBs found by fastmap.
  438. * @ai: The UBI attach info object
  439. */
  440. static int count_fastmap_pebs(struct ubi_attach_info *ai)
  441. {
  442. struct ubi_ainf_peb *aeb;
  443. struct ubi_ainf_volume *av;
  444. struct rb_node *rb1, *rb2;
  445. int n = 0;
  446. list_for_each_entry(aeb, &ai->erase, u.list)
  447. n++;
  448. list_for_each_entry(aeb, &ai->free, u.list)
  449. n++;
  450. ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb)
  451. ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb)
  452. n++;
  453. return n;
  454. }
  455. /**
  456. * ubi_attach_fastmap - creates ubi_attach_info from a fastmap.
  457. * @ubi: UBI device object
  458. * @ai: UBI attach info object
  459. * @fm: the fastmap to be attached
  460. *
  461. * Returns 0 on success, UBI_BAD_FASTMAP if the found fastmap was unusable.
  462. * < 0 indicates an internal error.
  463. */
  464. static int ubi_attach_fastmap(struct ubi_device *ubi,
  465. struct ubi_attach_info *ai,
  466. struct ubi_fastmap_layout *fm)
  467. {
  468. struct list_head used, free;
  469. struct ubi_ainf_volume *av;
  470. struct ubi_ainf_peb *aeb, *tmp_aeb, *_tmp_aeb;
  471. struct ubi_fm_sb *fmsb;
  472. struct ubi_fm_hdr *fmhdr;
  473. struct ubi_fm_scan_pool *fmpl, *fmpl_wl;
  474. struct ubi_fm_ec *fmec;
  475. struct ubi_fm_volhdr *fmvhdr;
  476. struct ubi_fm_eba *fm_eba;
  477. int ret, i, j, pool_size, wl_pool_size;
  478. size_t fm_pos = 0, fm_size = ubi->fm_size;
  479. unsigned long long max_sqnum = 0;
  480. void *fm_raw = ubi->fm_buf;
  481. INIT_LIST_HEAD(&used);
  482. INIT_LIST_HEAD(&free);
  483. ai->min_ec = UBI_MAX_ERASECOUNTER;
  484. fmsb = (struct ubi_fm_sb *)(fm_raw);
  485. ai->max_sqnum = fmsb->sqnum;
  486. fm_pos += sizeof(struct ubi_fm_sb);
  487. if (fm_pos >= fm_size)
  488. goto fail_bad;
  489. fmhdr = (struct ubi_fm_hdr *)(fm_raw + fm_pos);
  490. fm_pos += sizeof(*fmhdr);
  491. if (fm_pos >= fm_size)
  492. goto fail_bad;
  493. if (be32_to_cpu(fmhdr->magic) != UBI_FM_HDR_MAGIC) {
  494. ubi_err(ubi, "bad fastmap header magic: 0x%x, expected: 0x%x",
  495. be32_to_cpu(fmhdr->magic), UBI_FM_HDR_MAGIC);
  496. goto fail_bad;
  497. }
  498. fmpl = (struct ubi_fm_scan_pool *)(fm_raw + fm_pos);
  499. fm_pos += sizeof(*fmpl);
  500. if (fm_pos >= fm_size)
  501. goto fail_bad;
  502. if (be32_to_cpu(fmpl->magic) != UBI_FM_POOL_MAGIC) {
  503. ubi_err(ubi, "bad fastmap pool magic: 0x%x, expected: 0x%x",
  504. be32_to_cpu(fmpl->magic), UBI_FM_POOL_MAGIC);
  505. goto fail_bad;
  506. }
  507. fmpl_wl = (struct ubi_fm_scan_pool *)(fm_raw + fm_pos);
  508. fm_pos += sizeof(*fmpl_wl);
  509. if (fm_pos >= fm_size)
  510. goto fail_bad;
  511. if (be32_to_cpu(fmpl_wl->magic) != UBI_FM_POOL_MAGIC) {
  512. ubi_err(ubi, "bad fastmap WL pool magic: 0x%x, expected: 0x%x",
  513. be32_to_cpu(fmpl_wl->magic), UBI_FM_POOL_MAGIC);
  514. goto fail_bad;
  515. }
  516. pool_size = be16_to_cpu(fmpl->size);
  517. wl_pool_size = be16_to_cpu(fmpl_wl->size);
  518. fm->max_pool_size = be16_to_cpu(fmpl->max_size);
  519. fm->max_wl_pool_size = be16_to_cpu(fmpl_wl->max_size);
  520. if (pool_size > UBI_FM_MAX_POOL_SIZE || pool_size < 0) {
  521. ubi_err(ubi, "bad pool size: %i", pool_size);
  522. goto fail_bad;
  523. }
  524. if (wl_pool_size > UBI_FM_MAX_POOL_SIZE || wl_pool_size < 0) {
  525. ubi_err(ubi, "bad WL pool size: %i", wl_pool_size);
  526. goto fail_bad;
  527. }
  528. if (fm->max_pool_size > UBI_FM_MAX_POOL_SIZE ||
  529. fm->max_pool_size < 0) {
  530. ubi_err(ubi, "bad maximal pool size: %i", fm->max_pool_size);
  531. goto fail_bad;
  532. }
  533. if (fm->max_wl_pool_size > UBI_FM_MAX_POOL_SIZE ||
  534. fm->max_wl_pool_size < 0) {
  535. ubi_err(ubi, "bad maximal WL pool size: %i",
  536. fm->max_wl_pool_size);
  537. goto fail_bad;
  538. }
  539. /* read EC values from free list */
  540. for (i = 0; i < be32_to_cpu(fmhdr->free_peb_count); i++) {
  541. fmec = (struct ubi_fm_ec *)(fm_raw + fm_pos);
  542. fm_pos += sizeof(*fmec);
  543. if (fm_pos >= fm_size)
  544. goto fail_bad;
  545. add_aeb(ai, &ai->free, be32_to_cpu(fmec->pnum),
  546. be32_to_cpu(fmec->ec), 0);
  547. }
  548. /* read EC values from used list */
  549. for (i = 0; i < be32_to_cpu(fmhdr->used_peb_count); i++) {
  550. fmec = (struct ubi_fm_ec *)(fm_raw + fm_pos);
  551. fm_pos += sizeof(*fmec);
  552. if (fm_pos >= fm_size)
  553. goto fail_bad;
  554. add_aeb(ai, &used, be32_to_cpu(fmec->pnum),
  555. be32_to_cpu(fmec->ec), 0);
  556. }
  557. /* read EC values from scrub list */
  558. for (i = 0; i < be32_to_cpu(fmhdr->scrub_peb_count); i++) {
  559. fmec = (struct ubi_fm_ec *)(fm_raw + fm_pos);
  560. fm_pos += sizeof(*fmec);
  561. if (fm_pos >= fm_size)
  562. goto fail_bad;
  563. add_aeb(ai, &used, be32_to_cpu(fmec->pnum),
  564. be32_to_cpu(fmec->ec), 1);
  565. }
  566. /* read EC values from erase list */
  567. for (i = 0; i < be32_to_cpu(fmhdr->erase_peb_count); i++) {
  568. fmec = (struct ubi_fm_ec *)(fm_raw + fm_pos);
  569. fm_pos += sizeof(*fmec);
  570. if (fm_pos >= fm_size)
  571. goto fail_bad;
  572. add_aeb(ai, &ai->erase, be32_to_cpu(fmec->pnum),
  573. be32_to_cpu(fmec->ec), 1);
  574. }
  575. ai->mean_ec = div_u64(ai->ec_sum, ai->ec_count);
  576. ai->bad_peb_count = be32_to_cpu(fmhdr->bad_peb_count);
  577. /* Iterate over all volumes and read their EBA table */
  578. for (i = 0; i < be32_to_cpu(fmhdr->vol_count); i++) {
  579. fmvhdr = (struct ubi_fm_volhdr *)(fm_raw + fm_pos);
  580. fm_pos += sizeof(*fmvhdr);
  581. if (fm_pos >= fm_size)
  582. goto fail_bad;
  583. if (be32_to_cpu(fmvhdr->magic) != UBI_FM_VHDR_MAGIC) {
  584. ubi_err(ubi, "bad fastmap vol header magic: 0x%x, expected: 0x%x",
  585. be32_to_cpu(fmvhdr->magic), UBI_FM_VHDR_MAGIC);
  586. goto fail_bad;
  587. }
  588. av = add_vol(ai, be32_to_cpu(fmvhdr->vol_id),
  589. be32_to_cpu(fmvhdr->used_ebs),
  590. be32_to_cpu(fmvhdr->data_pad),
  591. fmvhdr->vol_type,
  592. be32_to_cpu(fmvhdr->last_eb_bytes));
  593. if (IS_ERR(av)) {
  594. if (PTR_ERR(av) == -EEXIST)
  595. ubi_err(ubi, "volume (ID %i) already exists",
  596. fmvhdr->vol_id);
  597. goto fail_bad;
  598. }
  599. ai->vols_found++;
  600. if (ai->highest_vol_id < be32_to_cpu(fmvhdr->vol_id))
  601. ai->highest_vol_id = be32_to_cpu(fmvhdr->vol_id);
  602. fm_eba = (struct ubi_fm_eba *)(fm_raw + fm_pos);
  603. fm_pos += sizeof(*fm_eba);
  604. fm_pos += (sizeof(__be32) * be32_to_cpu(fm_eba->reserved_pebs));
  605. if (fm_pos >= fm_size)
  606. goto fail_bad;
  607. if (be32_to_cpu(fm_eba->magic) != UBI_FM_EBA_MAGIC) {
  608. ubi_err(ubi, "bad fastmap EBA header magic: 0x%x, expected: 0x%x",
  609. be32_to_cpu(fm_eba->magic), UBI_FM_EBA_MAGIC);
  610. goto fail_bad;
  611. }
  612. for (j = 0; j < be32_to_cpu(fm_eba->reserved_pebs); j++) {
  613. int pnum = be32_to_cpu(fm_eba->pnum[j]);
  614. if (pnum < 0)
  615. continue;
  616. aeb = NULL;
  617. list_for_each_entry(tmp_aeb, &used, u.list) {
  618. if (tmp_aeb->pnum == pnum) {
  619. aeb = tmp_aeb;
  620. break;
  621. }
  622. }
  623. if (!aeb) {
  624. ubi_err(ubi, "PEB %i is in EBA but not in used list", pnum);
  625. goto fail_bad;
  626. }
  627. aeb->lnum = j;
  628. if (av->highest_lnum <= aeb->lnum)
  629. av->highest_lnum = aeb->lnum;
  630. assign_aeb_to_av(ai, aeb, av);
  631. dbg_bld("inserting PEB:%i (LEB %i) to vol %i",
  632. aeb->pnum, aeb->lnum, av->vol_id);
  633. }
  634. }
  635. ret = scan_pool(ubi, ai, fmpl->pebs, pool_size, &max_sqnum, &free);
  636. if (ret)
  637. goto fail;
  638. ret = scan_pool(ubi, ai, fmpl_wl->pebs, wl_pool_size, &max_sqnum, &free);
  639. if (ret)
  640. goto fail;
  641. if (max_sqnum > ai->max_sqnum)
  642. ai->max_sqnum = max_sqnum;
  643. list_for_each_entry_safe(tmp_aeb, _tmp_aeb, &free, u.list)
  644. list_move_tail(&tmp_aeb->u.list, &ai->free);
  645. list_for_each_entry_safe(tmp_aeb, _tmp_aeb, &used, u.list)
  646. list_move_tail(&tmp_aeb->u.list, &ai->erase);
  647. ubi_assert(list_empty(&free));
  648. /*
  649. * If fastmap is leaking PEBs (must not happen), raise a
  650. * fat warning and fall back to scanning mode.
  651. * We do this here because in ubi_wl_init() it's too late
  652. * and we cannot fall back to scanning.
  653. */
  654. if (WARN_ON(count_fastmap_pebs(ai) != ubi->peb_count -
  655. ai->bad_peb_count - fm->used_blocks))
  656. goto fail_bad;
  657. return 0;
  658. fail_bad:
  659. ret = UBI_BAD_FASTMAP;
  660. fail:
  661. list_for_each_entry_safe(tmp_aeb, _tmp_aeb, &used, u.list) {
  662. list_del(&tmp_aeb->u.list);
  663. ubi_free_aeb(ai, tmp_aeb);
  664. }
  665. list_for_each_entry_safe(tmp_aeb, _tmp_aeb, &free, u.list) {
  666. list_del(&tmp_aeb->u.list);
  667. ubi_free_aeb(ai, tmp_aeb);
  668. }
  669. return ret;
  670. }
  671. /**
  672. * find_fm_anchor - find the most recent Fastmap superblock (anchor)
  673. * @ai: UBI attach info to be filled
  674. */
  675. static int find_fm_anchor(struct ubi_attach_info *ai)
  676. {
  677. int ret = -1;
  678. struct ubi_ainf_peb *aeb;
  679. unsigned long long max_sqnum = 0;
  680. list_for_each_entry(aeb, &ai->fastmap, u.list) {
  681. if (aeb->vol_id == UBI_FM_SB_VOLUME_ID && aeb->sqnum > max_sqnum) {
  682. max_sqnum = aeb->sqnum;
  683. ret = aeb->pnum;
  684. }
  685. }
  686. return ret;
  687. }
  688. static struct ubi_ainf_peb *clone_aeb(struct ubi_attach_info *ai,
  689. struct ubi_ainf_peb *old)
  690. {
  691. struct ubi_ainf_peb *new;
  692. new = ubi_alloc_aeb(ai, old->pnum, old->ec);
  693. if (!new)
  694. return NULL;
  695. new->vol_id = old->vol_id;
  696. new->sqnum = old->sqnum;
  697. new->lnum = old->lnum;
  698. new->scrub = old->scrub;
  699. new->copy_flag = old->copy_flag;
  700. return new;
  701. }
  702. /**
  703. * ubi_scan_fastmap - scan the fastmap.
  704. * @ubi: UBI device object
  705. * @ai: UBI attach info to be filled
  706. * @scan_ai: UBI attach info from the first 64 PEBs,
  707. * used to find the most recent Fastmap data structure
  708. *
  709. * Returns 0 on success, UBI_NO_FASTMAP if no fastmap was found,
  710. * UBI_BAD_FASTMAP if one was found but is not usable.
  711. * < 0 indicates an internal error.
  712. */
  713. int ubi_scan_fastmap(struct ubi_device *ubi, struct ubi_attach_info *ai,
  714. struct ubi_attach_info *scan_ai)
  715. {
  716. struct ubi_fm_sb *fmsb, *fmsb2;
  717. struct ubi_vid_io_buf *vb;
  718. struct ubi_vid_hdr *vh;
  719. struct ubi_ec_hdr *ech;
  720. struct ubi_fastmap_layout *fm;
  721. struct ubi_ainf_peb *aeb;
  722. int i, used_blocks, pnum, fm_anchor, ret = 0;
  723. size_t fm_size;
  724. __be32 crc, tmp_crc;
  725. unsigned long long sqnum = 0;
  726. fm_anchor = find_fm_anchor(scan_ai);
  727. if (fm_anchor < 0)
  728. return UBI_NO_FASTMAP;
  729. /* Copy all (possible) fastmap blocks into our new attach structure. */
  730. list_for_each_entry(aeb, &scan_ai->fastmap, u.list) {
  731. struct ubi_ainf_peb *new;
  732. new = clone_aeb(ai, aeb);
  733. if (!new)
  734. return -ENOMEM;
  735. list_add(&new->u.list, &ai->fastmap);
  736. }
  737. down_write(&ubi->fm_protect);
  738. memset(ubi->fm_buf, 0, ubi->fm_size);
  739. fmsb = kmalloc(sizeof(*fmsb), GFP_KERNEL);
  740. if (!fmsb) {
  741. ret = -ENOMEM;
  742. goto out;
  743. }
  744. fm = kzalloc(sizeof(*fm), GFP_KERNEL);
  745. if (!fm) {
  746. ret = -ENOMEM;
  747. kfree(fmsb);
  748. goto out;
  749. }
  750. ret = ubi_io_read_data(ubi, fmsb, fm_anchor, 0, sizeof(*fmsb));
  751. if (ret && ret != UBI_IO_BITFLIPS)
  752. goto free_fm_sb;
  753. else if (ret == UBI_IO_BITFLIPS)
  754. fm->to_be_tortured[0] = 1;
  755. if (be32_to_cpu(fmsb->magic) != UBI_FM_SB_MAGIC) {
  756. ubi_err(ubi, "bad super block magic: 0x%x, expected: 0x%x",
  757. be32_to_cpu(fmsb->magic), UBI_FM_SB_MAGIC);
  758. ret = UBI_BAD_FASTMAP;
  759. goto free_fm_sb;
  760. }
  761. if (fmsb->version != UBI_FM_FMT_VERSION) {
  762. ubi_err(ubi, "bad fastmap version: %i, expected: %i",
  763. fmsb->version, UBI_FM_FMT_VERSION);
  764. ret = UBI_BAD_FASTMAP;
  765. goto free_fm_sb;
  766. }
  767. used_blocks = be32_to_cpu(fmsb->used_blocks);
  768. if (used_blocks > UBI_FM_MAX_BLOCKS || used_blocks < 1) {
  769. ubi_err(ubi, "number of fastmap blocks is invalid: %i",
  770. used_blocks);
  771. ret = UBI_BAD_FASTMAP;
  772. goto free_fm_sb;
  773. }
  774. fm_size = ubi->leb_size * used_blocks;
  775. if (fm_size != ubi->fm_size) {
  776. ubi_err(ubi, "bad fastmap size: %zi, expected: %zi",
  777. fm_size, ubi->fm_size);
  778. ret = UBI_BAD_FASTMAP;
  779. goto free_fm_sb;
  780. }
  781. ech = kzalloc(ubi->ec_hdr_alsize, GFP_KERNEL);
  782. if (!ech) {
  783. ret = -ENOMEM;
  784. goto free_fm_sb;
  785. }
  786. vb = ubi_alloc_vid_buf(ubi, GFP_KERNEL);
  787. if (!vb) {
  788. ret = -ENOMEM;
  789. goto free_hdr;
  790. }
  791. vh = ubi_get_vid_hdr(vb);
  792. for (i = 0; i < used_blocks; i++) {
  793. int image_seq;
  794. pnum = be32_to_cpu(fmsb->block_loc[i]);
  795. if (ubi_io_is_bad(ubi, pnum)) {
  796. ret = UBI_BAD_FASTMAP;
  797. goto free_hdr;
  798. }
  799. if (i == 0 && pnum != fm_anchor) {
  800. ubi_err(ubi, "Fastmap anchor PEB mismatch: PEB: %i vs. %i",
  801. pnum, fm_anchor);
  802. ret = UBI_BAD_FASTMAP;
  803. goto free_hdr;
  804. }
  805. ret = ubi_io_read_ec_hdr(ubi, pnum, ech, 0);
  806. if (ret && ret != UBI_IO_BITFLIPS) {
  807. ubi_err(ubi, "unable to read fastmap block# %i EC (PEB: %i)",
  808. i, pnum);
  809. if (ret > 0)
  810. ret = UBI_BAD_FASTMAP;
  811. goto free_hdr;
  812. } else if (ret == UBI_IO_BITFLIPS)
  813. fm->to_be_tortured[i] = 1;
  814. image_seq = be32_to_cpu(ech->image_seq);
  815. if (!ubi->image_seq)
  816. ubi->image_seq = image_seq;
  817. /*
  818. * Older UBI implementations have image_seq set to zero, so
  819. * we shouldn't fail if image_seq == 0.
  820. */
  821. if (image_seq && (image_seq != ubi->image_seq)) {
  822. ubi_err(ubi, "wrong image seq:%d instead of %d",
  823. be32_to_cpu(ech->image_seq), ubi->image_seq);
  824. ret = UBI_BAD_FASTMAP;
  825. goto free_hdr;
  826. }
  827. ret = ubi_io_read_vid_hdr(ubi, pnum, vb, 0);
  828. if (ret && ret != UBI_IO_BITFLIPS) {
  829. ubi_err(ubi, "unable to read fastmap block# %i (PEB: %i)",
  830. i, pnum);
  831. goto free_hdr;
  832. }
  833. if (i == 0) {
  834. if (be32_to_cpu(vh->vol_id) != UBI_FM_SB_VOLUME_ID) {
  835. ubi_err(ubi, "bad fastmap anchor vol_id: 0x%x, expected: 0x%x",
  836. be32_to_cpu(vh->vol_id),
  837. UBI_FM_SB_VOLUME_ID);
  838. ret = UBI_BAD_FASTMAP;
  839. goto free_hdr;
  840. }
  841. } else {
  842. if (be32_to_cpu(vh->vol_id) != UBI_FM_DATA_VOLUME_ID) {
  843. ubi_err(ubi, "bad fastmap data vol_id: 0x%x, expected: 0x%x",
  844. be32_to_cpu(vh->vol_id),
  845. UBI_FM_DATA_VOLUME_ID);
  846. ret = UBI_BAD_FASTMAP;
  847. goto free_hdr;
  848. }
  849. }
  850. if (sqnum < be64_to_cpu(vh->sqnum))
  851. sqnum = be64_to_cpu(vh->sqnum);
  852. ret = ubi_io_read_data(ubi, ubi->fm_buf + (ubi->leb_size * i),
  853. pnum, 0, ubi->leb_size);
  854. if (ret && ret != UBI_IO_BITFLIPS) {
  855. ubi_err(ubi, "unable to read fastmap block# %i (PEB: %i, "
  856. "err: %i)", i, pnum, ret);
  857. goto free_hdr;
  858. }
  859. }
  860. kfree(fmsb);
  861. fmsb = NULL;
  862. fmsb2 = (struct ubi_fm_sb *)(ubi->fm_buf);
  863. tmp_crc = be32_to_cpu(fmsb2->data_crc);
  864. fmsb2->data_crc = 0;
  865. crc = crc32(UBI_CRC32_INIT, ubi->fm_buf, fm_size);
  866. if (crc != tmp_crc) {
  867. ubi_err(ubi, "fastmap data CRC is invalid");
  868. ubi_err(ubi, "CRC should be: 0x%x, calc: 0x%x",
  869. tmp_crc, crc);
  870. ret = UBI_BAD_FASTMAP;
  871. goto free_hdr;
  872. }
  873. fmsb2->sqnum = sqnum;
  874. fm->used_blocks = used_blocks;
  875. ret = ubi_attach_fastmap(ubi, ai, fm);
  876. if (ret) {
  877. if (ret > 0)
  878. ret = UBI_BAD_FASTMAP;
  879. goto free_hdr;
  880. }
  881. for (i = 0; i < used_blocks; i++) {
  882. struct ubi_wl_entry *e;
  883. e = kmem_cache_alloc(ubi_wl_entry_slab, GFP_KERNEL);
  884. if (!e) {
  885. while (i--)
  886. kfree(fm->e[i]);
  887. ret = -ENOMEM;
  888. goto free_hdr;
  889. }
  890. e->pnum = be32_to_cpu(fmsb2->block_loc[i]);
  891. e->ec = be32_to_cpu(fmsb2->block_ec[i]);
  892. fm->e[i] = e;
  893. }
  894. ubi->fm = fm;
  895. ubi->fm_pool.max_size = ubi->fm->max_pool_size;
  896. ubi->fm_wl_pool.max_size = ubi->fm->max_wl_pool_size;
  897. ubi_msg(ubi, "attached by fastmap");
  898. ubi_msg(ubi, "fastmap pool size: %d", ubi->fm_pool.max_size);
  899. ubi_msg(ubi, "fastmap WL pool size: %d",
  900. ubi->fm_wl_pool.max_size);
  901. ubi->fm_disabled = 0;
  902. ubi->fast_attach = 1;
  903. ubi_free_vid_buf(vb);
  904. kfree(ech);
  905. out:
  906. up_write(&ubi->fm_protect);
  907. if (ret == UBI_BAD_FASTMAP)
  908. ubi_err(ubi, "Attach by fastmap failed, doing a full scan!");
  909. return ret;
  910. free_hdr:
  911. ubi_free_vid_buf(vb);
  912. kfree(ech);
  913. free_fm_sb:
  914. kfree(fmsb);
  915. kfree(fm);
  916. goto out;
  917. }
  918. /**
  919. * ubi_write_fastmap - writes a fastmap.
  920. * @ubi: UBI device object
  921. * @new_fm: the to be written fastmap
  922. *
  923. * Returns 0 on success, < 0 indicates an internal error.
  924. */
  925. static int ubi_write_fastmap(struct ubi_device *ubi,
  926. struct ubi_fastmap_layout *new_fm)
  927. {
  928. size_t fm_pos = 0;
  929. void *fm_raw;
  930. struct ubi_fm_sb *fmsb;
  931. struct ubi_fm_hdr *fmh;
  932. struct ubi_fm_scan_pool *fmpl, *fmpl_wl;
  933. struct ubi_fm_ec *fec;
  934. struct ubi_fm_volhdr *fvh;
  935. struct ubi_fm_eba *feba;
  936. struct ubi_wl_entry *wl_e;
  937. struct ubi_volume *vol;
  938. struct ubi_vid_io_buf *avbuf, *dvbuf;
  939. struct ubi_vid_hdr *avhdr, *dvhdr;
  940. struct ubi_work *ubi_wrk;
  941. struct rb_node *tmp_rb;
  942. int ret, i, j, free_peb_count, used_peb_count, vol_count;
  943. int scrub_peb_count, erase_peb_count;
  944. unsigned long *seen_pebs = NULL;
  945. fm_raw = ubi->fm_buf;
  946. memset(ubi->fm_buf, 0, ubi->fm_size);
  947. avbuf = new_fm_vbuf(ubi, UBI_FM_SB_VOLUME_ID);
  948. if (!avbuf) {
  949. ret = -ENOMEM;
  950. goto out;
  951. }
  952. dvbuf = new_fm_vbuf(ubi, UBI_FM_DATA_VOLUME_ID);
  953. if (!dvbuf) {
  954. ret = -ENOMEM;
  955. goto out_kfree;
  956. }
  957. avhdr = ubi_get_vid_hdr(avbuf);
  958. dvhdr = ubi_get_vid_hdr(dvbuf);
  959. seen_pebs = init_seen(ubi);
  960. if (IS_ERR(seen_pebs)) {
  961. ret = PTR_ERR(seen_pebs);
  962. goto out_kfree;
  963. }
  964. spin_lock(&ubi->volumes_lock);
  965. spin_lock(&ubi->wl_lock);
  966. fmsb = (struct ubi_fm_sb *)fm_raw;
  967. fm_pos += sizeof(*fmsb);
  968. ubi_assert(fm_pos <= ubi->fm_size);
  969. fmh = (struct ubi_fm_hdr *)(fm_raw + fm_pos);
  970. fm_pos += sizeof(*fmh);
  971. ubi_assert(fm_pos <= ubi->fm_size);
  972. fmsb->magic = cpu_to_be32(UBI_FM_SB_MAGIC);
  973. fmsb->version = UBI_FM_FMT_VERSION;
  974. fmsb->used_blocks = cpu_to_be32(new_fm->used_blocks);
  975. /* the max sqnum will be filled in while *reading* the fastmap */
  976. fmsb->sqnum = 0;
  977. fmh->magic = cpu_to_be32(UBI_FM_HDR_MAGIC);
  978. free_peb_count = 0;
  979. used_peb_count = 0;
  980. scrub_peb_count = 0;
  981. erase_peb_count = 0;
  982. vol_count = 0;
  983. fmpl = (struct ubi_fm_scan_pool *)(fm_raw + fm_pos);
  984. fm_pos += sizeof(*fmpl);
  985. fmpl->magic = cpu_to_be32(UBI_FM_POOL_MAGIC);
  986. fmpl->size = cpu_to_be16(ubi->fm_pool.size);
  987. fmpl->max_size = cpu_to_be16(ubi->fm_pool.max_size);
  988. for (i = 0; i < ubi->fm_pool.size; i++) {
  989. fmpl->pebs[i] = cpu_to_be32(ubi->fm_pool.pebs[i]);
  990. set_seen(ubi, ubi->fm_pool.pebs[i], seen_pebs);
  991. }
  992. fmpl_wl = (struct ubi_fm_scan_pool *)(fm_raw + fm_pos);
  993. fm_pos += sizeof(*fmpl_wl);
  994. fmpl_wl->magic = cpu_to_be32(UBI_FM_POOL_MAGIC);
  995. fmpl_wl->size = cpu_to_be16(ubi->fm_wl_pool.size);
  996. fmpl_wl->max_size = cpu_to_be16(ubi->fm_wl_pool.max_size);
  997. for (i = 0; i < ubi->fm_wl_pool.size; i++) {
  998. fmpl_wl->pebs[i] = cpu_to_be32(ubi->fm_wl_pool.pebs[i]);
  999. set_seen(ubi, ubi->fm_wl_pool.pebs[i], seen_pebs);
  1000. }
  1001. ubi_for_each_free_peb(ubi, wl_e, tmp_rb) {
  1002. fec = (struct ubi_fm_ec *)(fm_raw + fm_pos);
  1003. fec->pnum = cpu_to_be32(wl_e->pnum);
  1004. set_seen(ubi, wl_e->pnum, seen_pebs);
  1005. fec->ec = cpu_to_be32(wl_e->ec);
  1006. free_peb_count++;
  1007. fm_pos += sizeof(*fec);
  1008. ubi_assert(fm_pos <= ubi->fm_size);
  1009. }
  1010. fmh->free_peb_count = cpu_to_be32(free_peb_count);
  1011. ubi_for_each_used_peb(ubi, wl_e, tmp_rb) {
  1012. fec = (struct ubi_fm_ec *)(fm_raw + fm_pos);
  1013. fec->pnum = cpu_to_be32(wl_e->pnum);
  1014. set_seen(ubi, wl_e->pnum, seen_pebs);
  1015. fec->ec = cpu_to_be32(wl_e->ec);
  1016. used_peb_count++;
  1017. fm_pos += sizeof(*fec);
  1018. ubi_assert(fm_pos <= ubi->fm_size);
  1019. }
  1020. ubi_for_each_protected_peb(ubi, i, wl_e) {
  1021. fec = (struct ubi_fm_ec *)(fm_raw + fm_pos);
  1022. fec->pnum = cpu_to_be32(wl_e->pnum);
  1023. set_seen(ubi, wl_e->pnum, seen_pebs);
  1024. fec->ec = cpu_to_be32(wl_e->ec);
  1025. used_peb_count++;
  1026. fm_pos += sizeof(*fec);
  1027. ubi_assert(fm_pos <= ubi->fm_size);
  1028. }
  1029. fmh->used_peb_count = cpu_to_be32(used_peb_count);
  1030. ubi_for_each_scrub_peb(ubi, wl_e, tmp_rb) {
  1031. fec = (struct ubi_fm_ec *)(fm_raw + fm_pos);
  1032. fec->pnum = cpu_to_be32(wl_e->pnum);
  1033. set_seen(ubi, wl_e->pnum, seen_pebs);
  1034. fec->ec = cpu_to_be32(wl_e->ec);
  1035. scrub_peb_count++;
  1036. fm_pos += sizeof(*fec);
  1037. ubi_assert(fm_pos <= ubi->fm_size);
  1038. }
  1039. fmh->scrub_peb_count = cpu_to_be32(scrub_peb_count);
  1040. list_for_each_entry(ubi_wrk, &ubi->works, list) {
  1041. if (ubi_is_erase_work(ubi_wrk)) {
  1042. wl_e = ubi_wrk->e;
  1043. ubi_assert(wl_e);
  1044. fec = (struct ubi_fm_ec *)(fm_raw + fm_pos);
  1045. fec->pnum = cpu_to_be32(wl_e->pnum);
  1046. set_seen(ubi, wl_e->pnum, seen_pebs);
  1047. fec->ec = cpu_to_be32(wl_e->ec);
  1048. erase_peb_count++;
  1049. fm_pos += sizeof(*fec);
  1050. ubi_assert(fm_pos <= ubi->fm_size);
  1051. }
  1052. }
  1053. fmh->erase_peb_count = cpu_to_be32(erase_peb_count);
  1054. for (i = 0; i < UBI_MAX_VOLUMES + UBI_INT_VOL_COUNT; i++) {
  1055. vol = ubi->volumes[i];
  1056. if (!vol)
  1057. continue;
  1058. vol_count++;
  1059. fvh = (struct ubi_fm_volhdr *)(fm_raw + fm_pos);
  1060. fm_pos += sizeof(*fvh);
  1061. ubi_assert(fm_pos <= ubi->fm_size);
  1062. fvh->magic = cpu_to_be32(UBI_FM_VHDR_MAGIC);
  1063. fvh->vol_id = cpu_to_be32(vol->vol_id);
  1064. fvh->vol_type = vol->vol_type;
  1065. fvh->used_ebs = cpu_to_be32(vol->used_ebs);
  1066. fvh->data_pad = cpu_to_be32(vol->data_pad);
  1067. fvh->last_eb_bytes = cpu_to_be32(vol->last_eb_bytes);
  1068. ubi_assert(vol->vol_type == UBI_DYNAMIC_VOLUME ||
  1069. vol->vol_type == UBI_STATIC_VOLUME);
  1070. feba = (struct ubi_fm_eba *)(fm_raw + fm_pos);
  1071. fm_pos += sizeof(*feba) + (sizeof(__be32) * vol->reserved_pebs);
  1072. ubi_assert(fm_pos <= ubi->fm_size);
  1073. for (j = 0; j < vol->reserved_pebs; j++) {
  1074. struct ubi_eba_leb_desc ldesc;
  1075. ubi_eba_get_ldesc(vol, j, &ldesc);
  1076. feba->pnum[j] = cpu_to_be32(ldesc.pnum);
  1077. }
  1078. feba->reserved_pebs = cpu_to_be32(j);
  1079. feba->magic = cpu_to_be32(UBI_FM_EBA_MAGIC);
  1080. }
  1081. fmh->vol_count = cpu_to_be32(vol_count);
  1082. fmh->bad_peb_count = cpu_to_be32(ubi->bad_peb_count);
  1083. avhdr->sqnum = cpu_to_be64(ubi_next_sqnum(ubi));
  1084. avhdr->lnum = 0;
  1085. spin_unlock(&ubi->wl_lock);
  1086. spin_unlock(&ubi->volumes_lock);
  1087. dbg_bld("writing fastmap SB to PEB %i", new_fm->e[0]->pnum);
  1088. ret = ubi_io_write_vid_hdr(ubi, new_fm->e[0]->pnum, avbuf);
  1089. if (ret) {
  1090. ubi_err(ubi, "unable to write vid_hdr to fastmap SB!");
  1091. goto out_kfree;
  1092. }
  1093. for (i = 0; i < new_fm->used_blocks; i++) {
  1094. fmsb->block_loc[i] = cpu_to_be32(new_fm->e[i]->pnum);
  1095. set_seen(ubi, new_fm->e[i]->pnum, seen_pebs);
  1096. fmsb->block_ec[i] = cpu_to_be32(new_fm->e[i]->ec);
  1097. }
  1098. fmsb->data_crc = 0;
  1099. fmsb->data_crc = cpu_to_be32(crc32(UBI_CRC32_INIT, fm_raw,
  1100. ubi->fm_size));
  1101. for (i = 1; i < new_fm->used_blocks; i++) {
  1102. dvhdr->sqnum = cpu_to_be64(ubi_next_sqnum(ubi));
  1103. dvhdr->lnum = cpu_to_be32(i);
  1104. dbg_bld("writing fastmap data to PEB %i sqnum %llu",
  1105. new_fm->e[i]->pnum, be64_to_cpu(dvhdr->sqnum));
  1106. ret = ubi_io_write_vid_hdr(ubi, new_fm->e[i]->pnum, dvbuf);
  1107. if (ret) {
  1108. ubi_err(ubi, "unable to write vid_hdr to PEB %i!",
  1109. new_fm->e[i]->pnum);
  1110. goto out_kfree;
  1111. }
  1112. }
  1113. for (i = 0; i < new_fm->used_blocks; i++) {
  1114. ret = ubi_io_write_data(ubi, fm_raw + (i * ubi->leb_size),
  1115. new_fm->e[i]->pnum, 0, ubi->leb_size);
  1116. if (ret) {
  1117. ubi_err(ubi, "unable to write fastmap to PEB %i!",
  1118. new_fm->e[i]->pnum);
  1119. goto out_kfree;
  1120. }
  1121. }
  1122. ubi_assert(new_fm);
  1123. ubi->fm = new_fm;
  1124. ret = self_check_seen(ubi, seen_pebs);
  1125. dbg_bld("fastmap written!");
  1126. out_kfree:
  1127. ubi_free_vid_buf(avbuf);
  1128. ubi_free_vid_buf(dvbuf);
  1129. free_seen(seen_pebs);
  1130. out:
  1131. return ret;
  1132. }
  1133. /**
  1134. * erase_block - Manually erase a PEB.
  1135. * @ubi: UBI device object
  1136. * @pnum: PEB to be erased
  1137. *
  1138. * Returns the new EC value on success, < 0 indicates an internal error.
  1139. */
  1140. static int erase_block(struct ubi_device *ubi, int pnum)
  1141. {
  1142. int ret;
  1143. struct ubi_ec_hdr *ec_hdr;
  1144. long long ec;
  1145. ec_hdr = kzalloc(ubi->ec_hdr_alsize, GFP_KERNEL);
  1146. if (!ec_hdr)
  1147. return -ENOMEM;
  1148. ret = ubi_io_read_ec_hdr(ubi, pnum, ec_hdr, 0);
  1149. if (ret < 0)
  1150. goto out;
  1151. else if (ret && ret != UBI_IO_BITFLIPS) {
  1152. ret = -EINVAL;
  1153. goto out;
  1154. }
  1155. ret = ubi_io_sync_erase(ubi, pnum, 0);
  1156. if (ret < 0)
  1157. goto out;
  1158. ec = be64_to_cpu(ec_hdr->ec);
  1159. ec += ret;
  1160. if (ec > UBI_MAX_ERASECOUNTER) {
  1161. ret = -EINVAL;
  1162. goto out;
  1163. }
  1164. ec_hdr->ec = cpu_to_be64(ec);
  1165. ret = ubi_io_write_ec_hdr(ubi, pnum, ec_hdr);
  1166. if (ret < 0)
  1167. goto out;
  1168. ret = ec;
  1169. out:
  1170. kfree(ec_hdr);
  1171. return ret;
  1172. }
  1173. /**
  1174. * invalidate_fastmap - destroys a fastmap.
  1175. * @ubi: UBI device object
  1176. *
  1177. * This function ensures that upon next UBI attach a full scan
  1178. * is issued. We need this if UBI is about to write a new fastmap
  1179. * but is unable to do so. In this case we have two options:
  1180. * a) Make sure that the current fastmap will not be usued upon
  1181. * attach time and contine or b) fall back to RO mode to have the
  1182. * current fastmap in a valid state.
  1183. * Returns 0 on success, < 0 indicates an internal error.
  1184. */
  1185. static int invalidate_fastmap(struct ubi_device *ubi)
  1186. {
  1187. int ret;
  1188. struct ubi_fastmap_layout *fm;
  1189. struct ubi_wl_entry *e;
  1190. struct ubi_vid_io_buf *vb = NULL;
  1191. struct ubi_vid_hdr *vh;
  1192. if (!ubi->fm)
  1193. return 0;
  1194. ubi->fm = NULL;
  1195. ret = -ENOMEM;
  1196. fm = kzalloc(sizeof(*fm), GFP_KERNEL);
  1197. if (!fm)
  1198. goto out;
  1199. vb = new_fm_vbuf(ubi, UBI_FM_SB_VOLUME_ID);
  1200. if (!vb)
  1201. goto out_free_fm;
  1202. vh = ubi_get_vid_hdr(vb);
  1203. ret = -ENOSPC;
  1204. e = ubi_wl_get_fm_peb(ubi, 1);
  1205. if (!e)
  1206. goto out_free_fm;
  1207. /*
  1208. * Create fake fastmap such that UBI will fall back
  1209. * to scanning mode.
  1210. */
  1211. vh->sqnum = cpu_to_be64(ubi_next_sqnum(ubi));
  1212. ret = ubi_io_write_vid_hdr(ubi, e->pnum, vb);
  1213. if (ret < 0) {
  1214. ubi_wl_put_fm_peb(ubi, e, 0, 0);
  1215. goto out_free_fm;
  1216. }
  1217. fm->used_blocks = 1;
  1218. fm->e[0] = e;
  1219. ubi->fm = fm;
  1220. out:
  1221. ubi_free_vid_buf(vb);
  1222. return ret;
  1223. out_free_fm:
  1224. kfree(fm);
  1225. goto out;
  1226. }
  1227. /**
  1228. * return_fm_pebs - returns all PEBs used by a fastmap back to the
  1229. * WL sub-system.
  1230. * @ubi: UBI device object
  1231. * @fm: fastmap layout object
  1232. */
  1233. static void return_fm_pebs(struct ubi_device *ubi,
  1234. struct ubi_fastmap_layout *fm)
  1235. {
  1236. int i;
  1237. if (!fm)
  1238. return;
  1239. for (i = 0; i < fm->used_blocks; i++) {
  1240. if (fm->e[i]) {
  1241. ubi_wl_put_fm_peb(ubi, fm->e[i], i,
  1242. fm->to_be_tortured[i]);
  1243. fm->e[i] = NULL;
  1244. }
  1245. }
  1246. }
  1247. /**
  1248. * ubi_update_fastmap - will be called by UBI if a volume changes or
  1249. * a fastmap pool becomes full.
  1250. * @ubi: UBI device object
  1251. *
  1252. * Returns 0 on success, < 0 indicates an internal error.
  1253. */
  1254. int ubi_update_fastmap(struct ubi_device *ubi)
  1255. {
  1256. int ret, i, j;
  1257. struct ubi_fastmap_layout *new_fm, *old_fm;
  1258. struct ubi_wl_entry *tmp_e;
  1259. down_write(&ubi->fm_protect);
  1260. down_write(&ubi->work_sem);
  1261. down_write(&ubi->fm_eba_sem);
  1262. ubi_refill_pools(ubi);
  1263. if (ubi->ro_mode || ubi->fm_disabled) {
  1264. up_write(&ubi->fm_eba_sem);
  1265. up_write(&ubi->work_sem);
  1266. up_write(&ubi->fm_protect);
  1267. return 0;
  1268. }
  1269. ret = ubi_ensure_anchor_pebs(ubi);
  1270. if (ret) {
  1271. up_write(&ubi->fm_eba_sem);
  1272. up_write(&ubi->work_sem);
  1273. up_write(&ubi->fm_protect);
  1274. return ret;
  1275. }
  1276. new_fm = kzalloc(sizeof(*new_fm), GFP_KERNEL);
  1277. if (!new_fm) {
  1278. up_write(&ubi->fm_eba_sem);
  1279. up_write(&ubi->work_sem);
  1280. up_write(&ubi->fm_protect);
  1281. return -ENOMEM;
  1282. }
  1283. new_fm->used_blocks = ubi->fm_size / ubi->leb_size;
  1284. old_fm = ubi->fm;
  1285. ubi->fm = NULL;
  1286. if (new_fm->used_blocks > UBI_FM_MAX_BLOCKS) {
  1287. ubi_err(ubi, "fastmap too large");
  1288. ret = -ENOSPC;
  1289. goto err;
  1290. }
  1291. for (i = 1; i < new_fm->used_blocks; i++) {
  1292. spin_lock(&ubi->wl_lock);
  1293. tmp_e = ubi_wl_get_fm_peb(ubi, 0);
  1294. spin_unlock(&ubi->wl_lock);
  1295. if (!tmp_e) {
  1296. if (old_fm && old_fm->e[i]) {
  1297. ret = erase_block(ubi, old_fm->e[i]->pnum);
  1298. if (ret < 0) {
  1299. ubi_err(ubi, "could not erase old fastmap PEB");
  1300. for (j = 1; j < i; j++) {
  1301. ubi_wl_put_fm_peb(ubi, new_fm->e[j],
  1302. j, 0);
  1303. new_fm->e[j] = NULL;
  1304. }
  1305. goto err;
  1306. }
  1307. new_fm->e[i] = old_fm->e[i];
  1308. old_fm->e[i] = NULL;
  1309. } else {
  1310. ubi_err(ubi, "could not get any free erase block");
  1311. for (j = 1; j < i; j++) {
  1312. ubi_wl_put_fm_peb(ubi, new_fm->e[j], j, 0);
  1313. new_fm->e[j] = NULL;
  1314. }
  1315. ret = -ENOSPC;
  1316. goto err;
  1317. }
  1318. } else {
  1319. new_fm->e[i] = tmp_e;
  1320. if (old_fm && old_fm->e[i]) {
  1321. ubi_wl_put_fm_peb(ubi, old_fm->e[i], i,
  1322. old_fm->to_be_tortured[i]);
  1323. old_fm->e[i] = NULL;
  1324. }
  1325. }
  1326. }
  1327. /* Old fastmap is larger than the new one */
  1328. if (old_fm && new_fm->used_blocks < old_fm->used_blocks) {
  1329. for (i = new_fm->used_blocks; i < old_fm->used_blocks; i++) {
  1330. ubi_wl_put_fm_peb(ubi, old_fm->e[i], i,
  1331. old_fm->to_be_tortured[i]);
  1332. old_fm->e[i] = NULL;
  1333. }
  1334. }
  1335. spin_lock(&ubi->wl_lock);
  1336. tmp_e = ubi_wl_get_fm_peb(ubi, 1);
  1337. spin_unlock(&ubi->wl_lock);
  1338. if (old_fm) {
  1339. /* no fresh anchor PEB was found, reuse the old one */
  1340. if (!tmp_e) {
  1341. ret = erase_block(ubi, old_fm->e[0]->pnum);
  1342. if (ret < 0) {
  1343. ubi_err(ubi, "could not erase old anchor PEB");
  1344. for (i = 1; i < new_fm->used_blocks; i++) {
  1345. ubi_wl_put_fm_peb(ubi, new_fm->e[i],
  1346. i, 0);
  1347. new_fm->e[i] = NULL;
  1348. }
  1349. goto err;
  1350. }
  1351. new_fm->e[0] = old_fm->e[0];
  1352. new_fm->e[0]->ec = ret;
  1353. old_fm->e[0] = NULL;
  1354. } else {
  1355. /* we've got a new anchor PEB, return the old one */
  1356. ubi_wl_put_fm_peb(ubi, old_fm->e[0], 0,
  1357. old_fm->to_be_tortured[0]);
  1358. new_fm->e[0] = tmp_e;
  1359. old_fm->e[0] = NULL;
  1360. }
  1361. } else {
  1362. if (!tmp_e) {
  1363. ubi_err(ubi, "could not find any anchor PEB");
  1364. for (i = 1; i < new_fm->used_blocks; i++) {
  1365. ubi_wl_put_fm_peb(ubi, new_fm->e[i], i, 0);
  1366. new_fm->e[i] = NULL;
  1367. }
  1368. ret = -ENOSPC;
  1369. goto err;
  1370. }
  1371. new_fm->e[0] = tmp_e;
  1372. }
  1373. ret = ubi_write_fastmap(ubi, new_fm);
  1374. if (ret)
  1375. goto err;
  1376. out_unlock:
  1377. up_write(&ubi->fm_eba_sem);
  1378. up_write(&ubi->work_sem);
  1379. up_write(&ubi->fm_protect);
  1380. kfree(old_fm);
  1381. return ret;
  1382. err:
  1383. ubi_warn(ubi, "Unable to write new fastmap, err=%i", ret);
  1384. ret = invalidate_fastmap(ubi);
  1385. if (ret < 0) {
  1386. ubi_err(ubi, "Unable to invalidiate current fastmap!");
  1387. ubi_ro_mode(ubi);
  1388. } else {
  1389. return_fm_pebs(ubi, old_fm);
  1390. return_fm_pebs(ubi, new_fm);
  1391. ret = 0;
  1392. }
  1393. kfree(new_fm);
  1394. goto out_unlock;
  1395. }