fastmap.c 40 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655
  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. /**
  689. * ubi_scan_fastmap - scan the fastmap.
  690. * @ubi: UBI device object
  691. * @ai: UBI attach info to be filled
  692. * @scan_ai: UBI attach info from the first 64 PEBs,
  693. * used to find the most recent Fastmap data structure
  694. *
  695. * Returns 0 on success, UBI_NO_FASTMAP if no fastmap was found,
  696. * UBI_BAD_FASTMAP if one was found but is not usable.
  697. * < 0 indicates an internal error.
  698. */
  699. int ubi_scan_fastmap(struct ubi_device *ubi, struct ubi_attach_info *ai,
  700. struct ubi_attach_info *scan_ai)
  701. {
  702. struct ubi_fm_sb *fmsb, *fmsb2;
  703. struct ubi_vid_io_buf *vb;
  704. struct ubi_vid_hdr *vh;
  705. struct ubi_ec_hdr *ech;
  706. struct ubi_fastmap_layout *fm;
  707. struct ubi_ainf_peb *tmp_aeb, *aeb;
  708. int i, used_blocks, pnum, fm_anchor, ret = 0;
  709. size_t fm_size;
  710. __be32 crc, tmp_crc;
  711. unsigned long long sqnum = 0;
  712. fm_anchor = find_fm_anchor(scan_ai);
  713. if (fm_anchor < 0)
  714. return UBI_NO_FASTMAP;
  715. /* Move all (possible) fastmap blocks into our new attach structure. */
  716. list_for_each_entry_safe(aeb, tmp_aeb, &scan_ai->fastmap, u.list)
  717. list_move_tail(&aeb->u.list, &ai->fastmap);
  718. down_write(&ubi->fm_protect);
  719. memset(ubi->fm_buf, 0, ubi->fm_size);
  720. fmsb = kmalloc(sizeof(*fmsb), GFP_KERNEL);
  721. if (!fmsb) {
  722. ret = -ENOMEM;
  723. goto out;
  724. }
  725. fm = kzalloc(sizeof(*fm), GFP_KERNEL);
  726. if (!fm) {
  727. ret = -ENOMEM;
  728. kfree(fmsb);
  729. goto out;
  730. }
  731. ret = ubi_io_read_data(ubi, fmsb, fm_anchor, 0, sizeof(*fmsb));
  732. if (ret && ret != UBI_IO_BITFLIPS)
  733. goto free_fm_sb;
  734. else if (ret == UBI_IO_BITFLIPS)
  735. fm->to_be_tortured[0] = 1;
  736. if (be32_to_cpu(fmsb->magic) != UBI_FM_SB_MAGIC) {
  737. ubi_err(ubi, "bad super block magic: 0x%x, expected: 0x%x",
  738. be32_to_cpu(fmsb->magic), UBI_FM_SB_MAGIC);
  739. ret = UBI_BAD_FASTMAP;
  740. goto free_fm_sb;
  741. }
  742. if (fmsb->version != UBI_FM_FMT_VERSION) {
  743. ubi_err(ubi, "bad fastmap version: %i, expected: %i",
  744. fmsb->version, UBI_FM_FMT_VERSION);
  745. ret = UBI_BAD_FASTMAP;
  746. goto free_fm_sb;
  747. }
  748. used_blocks = be32_to_cpu(fmsb->used_blocks);
  749. if (used_blocks > UBI_FM_MAX_BLOCKS || used_blocks < 1) {
  750. ubi_err(ubi, "number of fastmap blocks is invalid: %i",
  751. used_blocks);
  752. ret = UBI_BAD_FASTMAP;
  753. goto free_fm_sb;
  754. }
  755. fm_size = ubi->leb_size * used_blocks;
  756. if (fm_size != ubi->fm_size) {
  757. ubi_err(ubi, "bad fastmap size: %zi, expected: %zi",
  758. fm_size, ubi->fm_size);
  759. ret = UBI_BAD_FASTMAP;
  760. goto free_fm_sb;
  761. }
  762. ech = kzalloc(ubi->ec_hdr_alsize, GFP_KERNEL);
  763. if (!ech) {
  764. ret = -ENOMEM;
  765. goto free_fm_sb;
  766. }
  767. vb = ubi_alloc_vid_buf(ubi, GFP_KERNEL);
  768. if (!vb) {
  769. ret = -ENOMEM;
  770. goto free_hdr;
  771. }
  772. vh = ubi_get_vid_hdr(vb);
  773. for (i = 0; i < used_blocks; i++) {
  774. int image_seq;
  775. pnum = be32_to_cpu(fmsb->block_loc[i]);
  776. if (ubi_io_is_bad(ubi, pnum)) {
  777. ret = UBI_BAD_FASTMAP;
  778. goto free_hdr;
  779. }
  780. if (i == 0 && pnum != fm_anchor) {
  781. ubi_err(ubi, "Fastmap anchor PEB mismatch: PEB: %i vs. %i",
  782. pnum, fm_anchor);
  783. ret = UBI_BAD_FASTMAP;
  784. goto free_hdr;
  785. }
  786. ret = ubi_io_read_ec_hdr(ubi, pnum, ech, 0);
  787. if (ret && ret != UBI_IO_BITFLIPS) {
  788. ubi_err(ubi, "unable to read fastmap block# %i EC (PEB: %i)",
  789. i, pnum);
  790. if (ret > 0)
  791. ret = UBI_BAD_FASTMAP;
  792. goto free_hdr;
  793. } else if (ret == UBI_IO_BITFLIPS)
  794. fm->to_be_tortured[i] = 1;
  795. image_seq = be32_to_cpu(ech->image_seq);
  796. if (!ubi->image_seq)
  797. ubi->image_seq = image_seq;
  798. /*
  799. * Older UBI implementations have image_seq set to zero, so
  800. * we shouldn't fail if image_seq == 0.
  801. */
  802. if (image_seq && (image_seq != ubi->image_seq)) {
  803. ubi_err(ubi, "wrong image seq:%d instead of %d",
  804. be32_to_cpu(ech->image_seq), ubi->image_seq);
  805. ret = UBI_BAD_FASTMAP;
  806. goto free_hdr;
  807. }
  808. ret = ubi_io_read_vid_hdr(ubi, pnum, vb, 0);
  809. if (ret && ret != UBI_IO_BITFLIPS) {
  810. ubi_err(ubi, "unable to read fastmap block# %i (PEB: %i)",
  811. i, pnum);
  812. goto free_hdr;
  813. }
  814. if (i == 0) {
  815. if (be32_to_cpu(vh->vol_id) != UBI_FM_SB_VOLUME_ID) {
  816. ubi_err(ubi, "bad fastmap anchor vol_id: 0x%x, expected: 0x%x",
  817. be32_to_cpu(vh->vol_id),
  818. UBI_FM_SB_VOLUME_ID);
  819. ret = UBI_BAD_FASTMAP;
  820. goto free_hdr;
  821. }
  822. } else {
  823. if (be32_to_cpu(vh->vol_id) != UBI_FM_DATA_VOLUME_ID) {
  824. ubi_err(ubi, "bad fastmap data vol_id: 0x%x, expected: 0x%x",
  825. be32_to_cpu(vh->vol_id),
  826. UBI_FM_DATA_VOLUME_ID);
  827. ret = UBI_BAD_FASTMAP;
  828. goto free_hdr;
  829. }
  830. }
  831. if (sqnum < be64_to_cpu(vh->sqnum))
  832. sqnum = be64_to_cpu(vh->sqnum);
  833. ret = ubi_io_read_data(ubi, ubi->fm_buf + (ubi->leb_size * i),
  834. pnum, 0, ubi->leb_size);
  835. if (ret && ret != UBI_IO_BITFLIPS) {
  836. ubi_err(ubi, "unable to read fastmap block# %i (PEB: %i, "
  837. "err: %i)", i, pnum, ret);
  838. goto free_hdr;
  839. }
  840. }
  841. kfree(fmsb);
  842. fmsb = NULL;
  843. fmsb2 = (struct ubi_fm_sb *)(ubi->fm_buf);
  844. tmp_crc = be32_to_cpu(fmsb2->data_crc);
  845. fmsb2->data_crc = 0;
  846. crc = crc32(UBI_CRC32_INIT, ubi->fm_buf, fm_size);
  847. if (crc != tmp_crc) {
  848. ubi_err(ubi, "fastmap data CRC is invalid");
  849. ubi_err(ubi, "CRC should be: 0x%x, calc: 0x%x",
  850. tmp_crc, crc);
  851. ret = UBI_BAD_FASTMAP;
  852. goto free_hdr;
  853. }
  854. fmsb2->sqnum = sqnum;
  855. fm->used_blocks = used_blocks;
  856. ret = ubi_attach_fastmap(ubi, ai, fm);
  857. if (ret) {
  858. if (ret > 0)
  859. ret = UBI_BAD_FASTMAP;
  860. goto free_hdr;
  861. }
  862. for (i = 0; i < used_blocks; i++) {
  863. struct ubi_wl_entry *e;
  864. e = kmem_cache_alloc(ubi_wl_entry_slab, GFP_KERNEL);
  865. if (!e) {
  866. while (i--)
  867. kfree(fm->e[i]);
  868. ret = -ENOMEM;
  869. goto free_hdr;
  870. }
  871. e->pnum = be32_to_cpu(fmsb2->block_loc[i]);
  872. e->ec = be32_to_cpu(fmsb2->block_ec[i]);
  873. fm->e[i] = e;
  874. }
  875. ubi->fm = fm;
  876. ubi->fm_pool.max_size = ubi->fm->max_pool_size;
  877. ubi->fm_wl_pool.max_size = ubi->fm->max_wl_pool_size;
  878. ubi_msg(ubi, "attached by fastmap");
  879. ubi_msg(ubi, "fastmap pool size: %d", ubi->fm_pool.max_size);
  880. ubi_msg(ubi, "fastmap WL pool size: %d",
  881. ubi->fm_wl_pool.max_size);
  882. ubi->fm_disabled = 0;
  883. ubi->fast_attach = 1;
  884. ubi_free_vid_buf(vb);
  885. kfree(ech);
  886. out:
  887. up_write(&ubi->fm_protect);
  888. if (ret == UBI_BAD_FASTMAP)
  889. ubi_err(ubi, "Attach by fastmap failed, doing a full scan!");
  890. return ret;
  891. free_hdr:
  892. ubi_free_vid_buf(vb);
  893. kfree(ech);
  894. free_fm_sb:
  895. kfree(fmsb);
  896. kfree(fm);
  897. goto out;
  898. }
  899. /**
  900. * ubi_write_fastmap - writes a fastmap.
  901. * @ubi: UBI device object
  902. * @new_fm: the to be written fastmap
  903. *
  904. * Returns 0 on success, < 0 indicates an internal error.
  905. */
  906. static int ubi_write_fastmap(struct ubi_device *ubi,
  907. struct ubi_fastmap_layout *new_fm)
  908. {
  909. size_t fm_pos = 0;
  910. void *fm_raw;
  911. struct ubi_fm_sb *fmsb;
  912. struct ubi_fm_hdr *fmh;
  913. struct ubi_fm_scan_pool *fmpl, *fmpl_wl;
  914. struct ubi_fm_ec *fec;
  915. struct ubi_fm_volhdr *fvh;
  916. struct ubi_fm_eba *feba;
  917. struct ubi_wl_entry *wl_e;
  918. struct ubi_volume *vol;
  919. struct ubi_vid_io_buf *avbuf, *dvbuf;
  920. struct ubi_vid_hdr *avhdr, *dvhdr;
  921. struct ubi_work *ubi_wrk;
  922. struct rb_node *tmp_rb;
  923. int ret, i, j, free_peb_count, used_peb_count, vol_count;
  924. int scrub_peb_count, erase_peb_count;
  925. unsigned long *seen_pebs = NULL;
  926. fm_raw = ubi->fm_buf;
  927. memset(ubi->fm_buf, 0, ubi->fm_size);
  928. avbuf = new_fm_vbuf(ubi, UBI_FM_SB_VOLUME_ID);
  929. if (!avbuf) {
  930. ret = -ENOMEM;
  931. goto out;
  932. }
  933. dvbuf = new_fm_vbuf(ubi, UBI_FM_DATA_VOLUME_ID);
  934. if (!dvbuf) {
  935. ret = -ENOMEM;
  936. goto out_kfree;
  937. }
  938. avhdr = ubi_get_vid_hdr(avbuf);
  939. dvhdr = ubi_get_vid_hdr(dvbuf);
  940. seen_pebs = init_seen(ubi);
  941. if (IS_ERR(seen_pebs)) {
  942. ret = PTR_ERR(seen_pebs);
  943. goto out_kfree;
  944. }
  945. spin_lock(&ubi->volumes_lock);
  946. spin_lock(&ubi->wl_lock);
  947. fmsb = (struct ubi_fm_sb *)fm_raw;
  948. fm_pos += sizeof(*fmsb);
  949. ubi_assert(fm_pos <= ubi->fm_size);
  950. fmh = (struct ubi_fm_hdr *)(fm_raw + fm_pos);
  951. fm_pos += sizeof(*fmh);
  952. ubi_assert(fm_pos <= ubi->fm_size);
  953. fmsb->magic = cpu_to_be32(UBI_FM_SB_MAGIC);
  954. fmsb->version = UBI_FM_FMT_VERSION;
  955. fmsb->used_blocks = cpu_to_be32(new_fm->used_blocks);
  956. /* the max sqnum will be filled in while *reading* the fastmap */
  957. fmsb->sqnum = 0;
  958. fmh->magic = cpu_to_be32(UBI_FM_HDR_MAGIC);
  959. free_peb_count = 0;
  960. used_peb_count = 0;
  961. scrub_peb_count = 0;
  962. erase_peb_count = 0;
  963. vol_count = 0;
  964. fmpl = (struct ubi_fm_scan_pool *)(fm_raw + fm_pos);
  965. fm_pos += sizeof(*fmpl);
  966. fmpl->magic = cpu_to_be32(UBI_FM_POOL_MAGIC);
  967. fmpl->size = cpu_to_be16(ubi->fm_pool.size);
  968. fmpl->max_size = cpu_to_be16(ubi->fm_pool.max_size);
  969. for (i = 0; i < ubi->fm_pool.size; i++) {
  970. fmpl->pebs[i] = cpu_to_be32(ubi->fm_pool.pebs[i]);
  971. set_seen(ubi, ubi->fm_pool.pebs[i], seen_pebs);
  972. }
  973. fmpl_wl = (struct ubi_fm_scan_pool *)(fm_raw + fm_pos);
  974. fm_pos += sizeof(*fmpl_wl);
  975. fmpl_wl->magic = cpu_to_be32(UBI_FM_POOL_MAGIC);
  976. fmpl_wl->size = cpu_to_be16(ubi->fm_wl_pool.size);
  977. fmpl_wl->max_size = cpu_to_be16(ubi->fm_wl_pool.max_size);
  978. for (i = 0; i < ubi->fm_wl_pool.size; i++) {
  979. fmpl_wl->pebs[i] = cpu_to_be32(ubi->fm_wl_pool.pebs[i]);
  980. set_seen(ubi, ubi->fm_wl_pool.pebs[i], seen_pebs);
  981. }
  982. ubi_for_each_free_peb(ubi, wl_e, tmp_rb) {
  983. fec = (struct ubi_fm_ec *)(fm_raw + fm_pos);
  984. fec->pnum = cpu_to_be32(wl_e->pnum);
  985. set_seen(ubi, wl_e->pnum, seen_pebs);
  986. fec->ec = cpu_to_be32(wl_e->ec);
  987. free_peb_count++;
  988. fm_pos += sizeof(*fec);
  989. ubi_assert(fm_pos <= ubi->fm_size);
  990. }
  991. fmh->free_peb_count = cpu_to_be32(free_peb_count);
  992. ubi_for_each_used_peb(ubi, wl_e, tmp_rb) {
  993. fec = (struct ubi_fm_ec *)(fm_raw + fm_pos);
  994. fec->pnum = cpu_to_be32(wl_e->pnum);
  995. set_seen(ubi, wl_e->pnum, seen_pebs);
  996. fec->ec = cpu_to_be32(wl_e->ec);
  997. used_peb_count++;
  998. fm_pos += sizeof(*fec);
  999. ubi_assert(fm_pos <= ubi->fm_size);
  1000. }
  1001. ubi_for_each_protected_peb(ubi, i, wl_e) {
  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. used_peb_count++;
  1007. fm_pos += sizeof(*fec);
  1008. ubi_assert(fm_pos <= ubi->fm_size);
  1009. }
  1010. fmh->used_peb_count = cpu_to_be32(used_peb_count);
  1011. ubi_for_each_scrub_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. scrub_peb_count++;
  1017. fm_pos += sizeof(*fec);
  1018. ubi_assert(fm_pos <= ubi->fm_size);
  1019. }
  1020. fmh->scrub_peb_count = cpu_to_be32(scrub_peb_count);
  1021. list_for_each_entry(ubi_wrk, &ubi->works, list) {
  1022. if (ubi_is_erase_work(ubi_wrk)) {
  1023. wl_e = ubi_wrk->e;
  1024. ubi_assert(wl_e);
  1025. fec = (struct ubi_fm_ec *)(fm_raw + fm_pos);
  1026. fec->pnum = cpu_to_be32(wl_e->pnum);
  1027. set_seen(ubi, wl_e->pnum, seen_pebs);
  1028. fec->ec = cpu_to_be32(wl_e->ec);
  1029. erase_peb_count++;
  1030. fm_pos += sizeof(*fec);
  1031. ubi_assert(fm_pos <= ubi->fm_size);
  1032. }
  1033. }
  1034. fmh->erase_peb_count = cpu_to_be32(erase_peb_count);
  1035. for (i = 0; i < UBI_MAX_VOLUMES + UBI_INT_VOL_COUNT; i++) {
  1036. vol = ubi->volumes[i];
  1037. if (!vol)
  1038. continue;
  1039. vol_count++;
  1040. fvh = (struct ubi_fm_volhdr *)(fm_raw + fm_pos);
  1041. fm_pos += sizeof(*fvh);
  1042. ubi_assert(fm_pos <= ubi->fm_size);
  1043. fvh->magic = cpu_to_be32(UBI_FM_VHDR_MAGIC);
  1044. fvh->vol_id = cpu_to_be32(vol->vol_id);
  1045. fvh->vol_type = vol->vol_type;
  1046. fvh->used_ebs = cpu_to_be32(vol->used_ebs);
  1047. fvh->data_pad = cpu_to_be32(vol->data_pad);
  1048. fvh->last_eb_bytes = cpu_to_be32(vol->last_eb_bytes);
  1049. ubi_assert(vol->vol_type == UBI_DYNAMIC_VOLUME ||
  1050. vol->vol_type == UBI_STATIC_VOLUME);
  1051. feba = (struct ubi_fm_eba *)(fm_raw + fm_pos);
  1052. fm_pos += sizeof(*feba) + (sizeof(__be32) * vol->reserved_pebs);
  1053. ubi_assert(fm_pos <= ubi->fm_size);
  1054. for (j = 0; j < vol->reserved_pebs; j++) {
  1055. struct ubi_eba_leb_desc ldesc;
  1056. ubi_eba_get_ldesc(vol, j, &ldesc);
  1057. feba->pnum[j] = cpu_to_be32(ldesc.pnum);
  1058. }
  1059. feba->reserved_pebs = cpu_to_be32(j);
  1060. feba->magic = cpu_to_be32(UBI_FM_EBA_MAGIC);
  1061. }
  1062. fmh->vol_count = cpu_to_be32(vol_count);
  1063. fmh->bad_peb_count = cpu_to_be32(ubi->bad_peb_count);
  1064. avhdr->sqnum = cpu_to_be64(ubi_next_sqnum(ubi));
  1065. avhdr->lnum = 0;
  1066. spin_unlock(&ubi->wl_lock);
  1067. spin_unlock(&ubi->volumes_lock);
  1068. dbg_bld("writing fastmap SB to PEB %i", new_fm->e[0]->pnum);
  1069. ret = ubi_io_write_vid_hdr(ubi, new_fm->e[0]->pnum, avbuf);
  1070. if (ret) {
  1071. ubi_err(ubi, "unable to write vid_hdr to fastmap SB!");
  1072. goto out_kfree;
  1073. }
  1074. for (i = 0; i < new_fm->used_blocks; i++) {
  1075. fmsb->block_loc[i] = cpu_to_be32(new_fm->e[i]->pnum);
  1076. set_seen(ubi, new_fm->e[i]->pnum, seen_pebs);
  1077. fmsb->block_ec[i] = cpu_to_be32(new_fm->e[i]->ec);
  1078. }
  1079. fmsb->data_crc = 0;
  1080. fmsb->data_crc = cpu_to_be32(crc32(UBI_CRC32_INIT, fm_raw,
  1081. ubi->fm_size));
  1082. for (i = 1; i < new_fm->used_blocks; i++) {
  1083. dvhdr->sqnum = cpu_to_be64(ubi_next_sqnum(ubi));
  1084. dvhdr->lnum = cpu_to_be32(i);
  1085. dbg_bld("writing fastmap data to PEB %i sqnum %llu",
  1086. new_fm->e[i]->pnum, be64_to_cpu(dvhdr->sqnum));
  1087. ret = ubi_io_write_vid_hdr(ubi, new_fm->e[i]->pnum, dvbuf);
  1088. if (ret) {
  1089. ubi_err(ubi, "unable to write vid_hdr to PEB %i!",
  1090. new_fm->e[i]->pnum);
  1091. goto out_kfree;
  1092. }
  1093. }
  1094. for (i = 0; i < new_fm->used_blocks; i++) {
  1095. ret = ubi_io_write_data(ubi, fm_raw + (i * ubi->leb_size),
  1096. new_fm->e[i]->pnum, 0, ubi->leb_size);
  1097. if (ret) {
  1098. ubi_err(ubi, "unable to write fastmap to PEB %i!",
  1099. new_fm->e[i]->pnum);
  1100. goto out_kfree;
  1101. }
  1102. }
  1103. ubi_assert(new_fm);
  1104. ubi->fm = new_fm;
  1105. ret = self_check_seen(ubi, seen_pebs);
  1106. dbg_bld("fastmap written!");
  1107. out_kfree:
  1108. ubi_free_vid_buf(avbuf);
  1109. ubi_free_vid_buf(dvbuf);
  1110. free_seen(seen_pebs);
  1111. out:
  1112. return ret;
  1113. }
  1114. /**
  1115. * erase_block - Manually erase a PEB.
  1116. * @ubi: UBI device object
  1117. * @pnum: PEB to be erased
  1118. *
  1119. * Returns the new EC value on success, < 0 indicates an internal error.
  1120. */
  1121. static int erase_block(struct ubi_device *ubi, int pnum)
  1122. {
  1123. int ret;
  1124. struct ubi_ec_hdr *ec_hdr;
  1125. long long ec;
  1126. ec_hdr = kzalloc(ubi->ec_hdr_alsize, GFP_KERNEL);
  1127. if (!ec_hdr)
  1128. return -ENOMEM;
  1129. ret = ubi_io_read_ec_hdr(ubi, pnum, ec_hdr, 0);
  1130. if (ret < 0)
  1131. goto out;
  1132. else if (ret && ret != UBI_IO_BITFLIPS) {
  1133. ret = -EINVAL;
  1134. goto out;
  1135. }
  1136. ret = ubi_io_sync_erase(ubi, pnum, 0);
  1137. if (ret < 0)
  1138. goto out;
  1139. ec = be64_to_cpu(ec_hdr->ec);
  1140. ec += ret;
  1141. if (ec > UBI_MAX_ERASECOUNTER) {
  1142. ret = -EINVAL;
  1143. goto out;
  1144. }
  1145. ec_hdr->ec = cpu_to_be64(ec);
  1146. ret = ubi_io_write_ec_hdr(ubi, pnum, ec_hdr);
  1147. if (ret < 0)
  1148. goto out;
  1149. ret = ec;
  1150. out:
  1151. kfree(ec_hdr);
  1152. return ret;
  1153. }
  1154. /**
  1155. * invalidate_fastmap - destroys a fastmap.
  1156. * @ubi: UBI device object
  1157. *
  1158. * This function ensures that upon next UBI attach a full scan
  1159. * is issued. We need this if UBI is about to write a new fastmap
  1160. * but is unable to do so. In this case we have two options:
  1161. * a) Make sure that the current fastmap will not be usued upon
  1162. * attach time and contine or b) fall back to RO mode to have the
  1163. * current fastmap in a valid state.
  1164. * Returns 0 on success, < 0 indicates an internal error.
  1165. */
  1166. static int invalidate_fastmap(struct ubi_device *ubi)
  1167. {
  1168. int ret;
  1169. struct ubi_fastmap_layout *fm;
  1170. struct ubi_wl_entry *e;
  1171. struct ubi_vid_io_buf *vb = NULL;
  1172. struct ubi_vid_hdr *vh;
  1173. if (!ubi->fm)
  1174. return 0;
  1175. ubi->fm = NULL;
  1176. ret = -ENOMEM;
  1177. fm = kzalloc(sizeof(*fm), GFP_KERNEL);
  1178. if (!fm)
  1179. goto out;
  1180. vb = new_fm_vbuf(ubi, UBI_FM_SB_VOLUME_ID);
  1181. if (!vb)
  1182. goto out_free_fm;
  1183. vh = ubi_get_vid_hdr(vb);
  1184. ret = -ENOSPC;
  1185. e = ubi_wl_get_fm_peb(ubi, 1);
  1186. if (!e)
  1187. goto out_free_fm;
  1188. /*
  1189. * Create fake fastmap such that UBI will fall back
  1190. * to scanning mode.
  1191. */
  1192. vh->sqnum = cpu_to_be64(ubi_next_sqnum(ubi));
  1193. ret = ubi_io_write_vid_hdr(ubi, e->pnum, vb);
  1194. if (ret < 0) {
  1195. ubi_wl_put_fm_peb(ubi, e, 0, 0);
  1196. goto out_free_fm;
  1197. }
  1198. fm->used_blocks = 1;
  1199. fm->e[0] = e;
  1200. ubi->fm = fm;
  1201. out:
  1202. ubi_free_vid_buf(vb);
  1203. return ret;
  1204. out_free_fm:
  1205. kfree(fm);
  1206. goto out;
  1207. }
  1208. /**
  1209. * return_fm_pebs - returns all PEBs used by a fastmap back to the
  1210. * WL sub-system.
  1211. * @ubi: UBI device object
  1212. * @fm: fastmap layout object
  1213. */
  1214. static void return_fm_pebs(struct ubi_device *ubi,
  1215. struct ubi_fastmap_layout *fm)
  1216. {
  1217. int i;
  1218. if (!fm)
  1219. return;
  1220. for (i = 0; i < fm->used_blocks; i++) {
  1221. if (fm->e[i]) {
  1222. ubi_wl_put_fm_peb(ubi, fm->e[i], i,
  1223. fm->to_be_tortured[i]);
  1224. fm->e[i] = NULL;
  1225. }
  1226. }
  1227. }
  1228. /**
  1229. * ubi_update_fastmap - will be called by UBI if a volume changes or
  1230. * a fastmap pool becomes full.
  1231. * @ubi: UBI device object
  1232. *
  1233. * Returns 0 on success, < 0 indicates an internal error.
  1234. */
  1235. int ubi_update_fastmap(struct ubi_device *ubi)
  1236. {
  1237. int ret, i, j;
  1238. struct ubi_fastmap_layout *new_fm, *old_fm;
  1239. struct ubi_wl_entry *tmp_e;
  1240. down_write(&ubi->fm_protect);
  1241. down_write(&ubi->work_sem);
  1242. down_write(&ubi->fm_eba_sem);
  1243. ubi_refill_pools(ubi);
  1244. if (ubi->ro_mode || ubi->fm_disabled) {
  1245. up_write(&ubi->fm_eba_sem);
  1246. up_write(&ubi->work_sem);
  1247. up_write(&ubi->fm_protect);
  1248. return 0;
  1249. }
  1250. ret = ubi_ensure_anchor_pebs(ubi);
  1251. if (ret) {
  1252. up_write(&ubi->fm_eba_sem);
  1253. up_write(&ubi->work_sem);
  1254. up_write(&ubi->fm_protect);
  1255. return ret;
  1256. }
  1257. new_fm = kzalloc(sizeof(*new_fm), GFP_KERNEL);
  1258. if (!new_fm) {
  1259. up_write(&ubi->fm_eba_sem);
  1260. up_write(&ubi->work_sem);
  1261. up_write(&ubi->fm_protect);
  1262. return -ENOMEM;
  1263. }
  1264. new_fm->used_blocks = ubi->fm_size / ubi->leb_size;
  1265. old_fm = ubi->fm;
  1266. ubi->fm = NULL;
  1267. if (new_fm->used_blocks > UBI_FM_MAX_BLOCKS) {
  1268. ubi_err(ubi, "fastmap too large");
  1269. ret = -ENOSPC;
  1270. goto err;
  1271. }
  1272. for (i = 1; i < new_fm->used_blocks; i++) {
  1273. spin_lock(&ubi->wl_lock);
  1274. tmp_e = ubi_wl_get_fm_peb(ubi, 0);
  1275. spin_unlock(&ubi->wl_lock);
  1276. if (!tmp_e) {
  1277. if (old_fm && old_fm->e[i]) {
  1278. ret = erase_block(ubi, old_fm->e[i]->pnum);
  1279. if (ret < 0) {
  1280. ubi_err(ubi, "could not erase old fastmap PEB");
  1281. for (j = 1; j < i; j++) {
  1282. ubi_wl_put_fm_peb(ubi, new_fm->e[j],
  1283. j, 0);
  1284. new_fm->e[j] = NULL;
  1285. }
  1286. goto err;
  1287. }
  1288. new_fm->e[i] = old_fm->e[i];
  1289. old_fm->e[i] = NULL;
  1290. } else {
  1291. ubi_err(ubi, "could not get any free erase block");
  1292. for (j = 1; j < i; j++) {
  1293. ubi_wl_put_fm_peb(ubi, new_fm->e[j], j, 0);
  1294. new_fm->e[j] = NULL;
  1295. }
  1296. ret = -ENOSPC;
  1297. goto err;
  1298. }
  1299. } else {
  1300. new_fm->e[i] = tmp_e;
  1301. if (old_fm && old_fm->e[i]) {
  1302. ubi_wl_put_fm_peb(ubi, old_fm->e[i], i,
  1303. old_fm->to_be_tortured[i]);
  1304. old_fm->e[i] = NULL;
  1305. }
  1306. }
  1307. }
  1308. /* Old fastmap is larger than the new one */
  1309. if (old_fm && new_fm->used_blocks < old_fm->used_blocks) {
  1310. for (i = new_fm->used_blocks; i < old_fm->used_blocks; i++) {
  1311. ubi_wl_put_fm_peb(ubi, old_fm->e[i], i,
  1312. old_fm->to_be_tortured[i]);
  1313. old_fm->e[i] = NULL;
  1314. }
  1315. }
  1316. spin_lock(&ubi->wl_lock);
  1317. tmp_e = ubi_wl_get_fm_peb(ubi, 1);
  1318. spin_unlock(&ubi->wl_lock);
  1319. if (old_fm) {
  1320. /* no fresh anchor PEB was found, reuse the old one */
  1321. if (!tmp_e) {
  1322. ret = erase_block(ubi, old_fm->e[0]->pnum);
  1323. if (ret < 0) {
  1324. ubi_err(ubi, "could not erase old anchor PEB");
  1325. for (i = 1; i < new_fm->used_blocks; i++) {
  1326. ubi_wl_put_fm_peb(ubi, new_fm->e[i],
  1327. i, 0);
  1328. new_fm->e[i] = NULL;
  1329. }
  1330. goto err;
  1331. }
  1332. new_fm->e[0] = old_fm->e[0];
  1333. new_fm->e[0]->ec = ret;
  1334. old_fm->e[0] = NULL;
  1335. } else {
  1336. /* we've got a new anchor PEB, return the old one */
  1337. ubi_wl_put_fm_peb(ubi, old_fm->e[0], 0,
  1338. old_fm->to_be_tortured[0]);
  1339. new_fm->e[0] = tmp_e;
  1340. old_fm->e[0] = NULL;
  1341. }
  1342. } else {
  1343. if (!tmp_e) {
  1344. ubi_err(ubi, "could not find any anchor PEB");
  1345. for (i = 1; i < new_fm->used_blocks; i++) {
  1346. ubi_wl_put_fm_peb(ubi, new_fm->e[i], i, 0);
  1347. new_fm->e[i] = NULL;
  1348. }
  1349. ret = -ENOSPC;
  1350. goto err;
  1351. }
  1352. new_fm->e[0] = tmp_e;
  1353. }
  1354. ret = ubi_write_fastmap(ubi, new_fm);
  1355. if (ret)
  1356. goto err;
  1357. out_unlock:
  1358. up_write(&ubi->fm_eba_sem);
  1359. up_write(&ubi->work_sem);
  1360. up_write(&ubi->fm_protect);
  1361. kfree(old_fm);
  1362. return ret;
  1363. err:
  1364. ubi_warn(ubi, "Unable to write new fastmap, err=%i", ret);
  1365. ret = invalidate_fastmap(ubi);
  1366. if (ret < 0) {
  1367. ubi_err(ubi, "Unable to invalidiate current fastmap!");
  1368. ubi_ro_mode(ubi);
  1369. } else {
  1370. return_fm_pebs(ubi, old_fm);
  1371. return_fm_pebs(ubi, new_fm);
  1372. ret = 0;
  1373. }
  1374. kfree(new_fm);
  1375. goto out_unlock;
  1376. }