2 * Copyright (c) International Business Machines Corp., 2006
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
12 * the GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18 * Author: Artem Bityutskiy (Битюцкий Артём)
22 * UBI attaching sub-system.
24 * This sub-system is responsible for attaching MTD devices and it also
25 * implements flash media scanning.
27 * The attaching information is represented by a &struct ubi_attach_info'
28 * object. Information about volumes is represented by &struct ubi_ainf_volume
29 * objects which are kept in volume RB-tree with root at the @volumes field.
30 * The RB-tree is indexed by the volume ID.
32 * Logical eraseblocks are represented by &struct ubi_ainf_peb objects. These
33 * objects are kept in per-volume RB-trees with the root at the corresponding
34 * &struct ubi_ainf_volume object. To put it differently, we keep an RB-tree of
35 * per-volume objects and each of these objects is the root of RB-tree of
38 * Corrupted physical eraseblocks are put to the @corr list, free physical
39 * eraseblocks are put to the @free list and the physical eraseblock to be
40 * erased are put to the @erase list.
45 * UBI protects EC and VID headers with CRC-32 checksums, so it can detect
46 * whether the headers are corrupted or not. Sometimes UBI also protects the
47 * data with CRC-32, e.g., when it executes the atomic LEB change operation, or
48 * when it moves the contents of a PEB for wear-leveling purposes.
50 * UBI tries to distinguish between 2 types of corruptions.
52 * 1. Corruptions caused by power cuts. These are expected corruptions and UBI
53 * tries to handle them gracefully, without printing too many warnings and
54 * error messages. The idea is that we do not lose important data in these
55 * cases - we may lose only the data which were being written to the media just
56 * before the power cut happened, and the upper layers (e.g., UBIFS) are
57 * supposed to handle such data losses (e.g., by using the FS journal).
59 * When UBI detects a corruption (CRC-32 mismatch) in a PEB, and it looks like
60 * the reason is a power cut, UBI puts this PEB to the @erase list, and all
61 * PEBs in the @erase list are scheduled for erasure later.
63 * 2. Unexpected corruptions which are not caused by power cuts. During
64 * attaching, such PEBs are put to the @corr list and UBI preserves them.
65 * Obviously, this lessens the amount of available PEBs, and if at some point
66 * UBI runs out of free PEBs, it switches to R/O mode. UBI also loudly informs
67 * about such PEBs every time the MTD device is attached.
69 * However, it is difficult to reliably distinguish between these types of
70 * corruptions and UBI's strategy is as follows (in case of attaching by
71 * scanning). UBI assumes corruption type 2 if the VID header is corrupted and
72 * the data area does not contain all 0xFFs, and there were no bit-flips or
73 * integrity errors (e.g., ECC errors in case of NAND) while reading the data
74 * area. Otherwise UBI assumes corruption type 1. So the decision criteria
76 * o If the data area contains only 0xFFs, there are no data, and it is safe
77 * to just erase this PEB - this is corruption type 1.
78 * o If the data area has bit-flips or data integrity errors (ECC errors on
79 * NAND), it is probably a PEB which was being erased when power cut
80 * happened, so this is corruption type 1. However, this is just a guess,
81 * which might be wrong.
82 * o Otherwise this is corruption type 2.
85 #include <linux/err.h>
86 #include <linux/slab.h>
87 #include <linux/crc32.h>
88 #include <linux/math64.h>
89 #include <linux/random.h>
92 static int self_check_ai(struct ubi_device *ubi, struct ubi_attach_info *ai);
94 /* Temporary variables used during scanning */
95 static struct ubi_ec_hdr *ech;
96 static struct ubi_vid_hdr *vidh;
99 * add_to_list - add physical eraseblock to a list.
100 * @ai: attaching information
101 * @pnum: physical eraseblock number to add
102 * @vol_id: the last used volume id for the PEB
103 * @lnum: the last used LEB number for the PEB
104 * @ec: erase counter of the physical eraseblock
105 * @to_head: if not zero, add to the head of the list
106 * @list: the list to add to
108 * This function allocates a 'struct ubi_ainf_peb' object for physical
109 * eraseblock @pnum and adds it to the "free", "erase", or "alien" lists.
110 * It stores the @lnum and @vol_id alongside, which can both be
111 * %UBI_UNKNOWN if they are not available, not readable, or not assigned.
112 * If @to_head is not zero, PEB will be added to the head of the list, which
113 * basically means it will be processed first later. E.g., we add corrupted
114 * PEBs (corrupted due to power cuts) to the head of the erase list to make
115 * sure we erase them first and get rid of corruptions ASAP. This function
116 * returns zero in case of success and a negative error code in case of
119 static int add_to_list(struct ubi_attach_info *ai, int pnum, int vol_id,
120 int lnum, int ec, int to_head, struct list_head *list)
122 struct ubi_ainf_peb *aeb;
124 if (list == &ai->free) {
125 dbg_bld("add to free: PEB %d, EC %d", pnum, ec);
126 } else if (list == &ai->erase) {
127 dbg_bld("add to erase: PEB %d, EC %d", pnum, ec);
128 } else if (list == &ai->alien) {
129 dbg_bld("add to alien: PEB %d, EC %d", pnum, ec);
130 ai->alien_peb_count += 1;
134 aeb = kmem_cache_alloc(ai->aeb_slab_cache, GFP_KERNEL);
139 aeb->vol_id = vol_id;
143 list_add(&aeb->u.list, list);
145 list_add_tail(&aeb->u.list, list);
150 * add_corrupted - add a corrupted physical eraseblock.
151 * @ai: attaching information
152 * @pnum: physical eraseblock number to add
153 * @ec: erase counter of the physical eraseblock
155 * This function allocates a 'struct ubi_ainf_peb' object for a corrupted
156 * physical eraseblock @pnum and adds it to the 'corr' list. The corruption
157 * was presumably not caused by a power cut. Returns zero in case of success
158 * and a negative error code in case of failure.
160 static int add_corrupted(struct ubi_attach_info *ai, int pnum, int ec)
162 struct ubi_ainf_peb *aeb;
164 dbg_bld("add to corrupted: PEB %d, EC %d", pnum, ec);
166 aeb = kmem_cache_alloc(ai->aeb_slab_cache, GFP_KERNEL);
170 ai->corr_peb_count += 1;
173 list_add(&aeb->u.list, &ai->corr);
178 * add_fastmap - add a Fastmap related physical eraseblock.
179 * @ai: attaching information
180 * @pnum: physical eraseblock number the VID header came from
181 * @vid_hdr: the volume identifier header
182 * @ec: erase counter of the physical eraseblock
184 * This function allocates a 'struct ubi_ainf_peb' object for a Fastamp
185 * physical eraseblock @pnum and adds it to the 'fastmap' list.
186 * Such blocks can be Fastmap super and data blocks from both the most
187 * recent Fastmap we're attaching from or from old Fastmaps which will
190 static int add_fastmap(struct ubi_attach_info *ai, int pnum,
191 struct ubi_vid_hdr *vid_hdr, int ec)
193 struct ubi_ainf_peb *aeb;
195 aeb = kmem_cache_alloc(ai->aeb_slab_cache, GFP_KERNEL);
200 aeb->vol_id = be32_to_cpu(vidh->vol_id);
201 aeb->sqnum = be64_to_cpu(vidh->sqnum);
203 list_add(&aeb->u.list, &ai->fastmap);
205 dbg_bld("add to fastmap list: PEB %d, vol_id %d, sqnum: %llu", pnum,
206 aeb->vol_id, aeb->sqnum);
212 * validate_vid_hdr - check volume identifier header.
213 * @ubi: UBI device description object
214 * @vid_hdr: the volume identifier header to check
215 * @av: information about the volume this logical eraseblock belongs to
216 * @pnum: physical eraseblock number the VID header came from
218 * This function checks that data stored in @vid_hdr is consistent. Returns
219 * non-zero if an inconsistency was found and zero if not.
221 * Note, UBI does sanity check of everything it reads from the flash media.
222 * Most of the checks are done in the I/O sub-system. Here we check that the
223 * information in the VID header is consistent to the information in other VID
224 * headers of the same volume.
226 static int validate_vid_hdr(const struct ubi_device *ubi,
227 const struct ubi_vid_hdr *vid_hdr,
228 const struct ubi_ainf_volume *av, int pnum)
230 int vol_type = vid_hdr->vol_type;
231 int vol_id = be32_to_cpu(vid_hdr->vol_id);
232 int used_ebs = be32_to_cpu(vid_hdr->used_ebs);
233 int data_pad = be32_to_cpu(vid_hdr->data_pad);
235 if (av->leb_count != 0) {
239 * This is not the first logical eraseblock belonging to this
240 * volume. Ensure that the data in its VID header is consistent
241 * to the data in previous logical eraseblock headers.
244 if (vol_id != av->vol_id) {
245 ubi_err(ubi, "inconsistent vol_id");
249 if (av->vol_type == UBI_STATIC_VOLUME)
250 av_vol_type = UBI_VID_STATIC;
252 av_vol_type = UBI_VID_DYNAMIC;
254 if (vol_type != av_vol_type) {
255 ubi_err(ubi, "inconsistent vol_type");
259 if (used_ebs != av->used_ebs) {
260 ubi_err(ubi, "inconsistent used_ebs");
264 if (data_pad != av->data_pad) {
265 ubi_err(ubi, "inconsistent data_pad");
273 ubi_err(ubi, "inconsistent VID header at PEB %d", pnum);
274 ubi_dump_vid_hdr(vid_hdr);
280 * add_volume - add volume to the attaching information.
281 * @ai: attaching information
282 * @vol_id: ID of the volume to add
283 * @pnum: physical eraseblock number
284 * @vid_hdr: volume identifier header
286 * If the volume corresponding to the @vid_hdr logical eraseblock is already
287 * present in the attaching information, this function does nothing. Otherwise
288 * it adds corresponding volume to the attaching information. Returns a pointer
289 * to the allocated "av" object in case of success and a negative error code in
292 static struct ubi_ainf_volume *add_volume(struct ubi_attach_info *ai,
293 int vol_id, int pnum,
294 const struct ubi_vid_hdr *vid_hdr)
296 struct ubi_ainf_volume *av;
297 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL;
299 ubi_assert(vol_id == be32_to_cpu(vid_hdr->vol_id));
301 /* Walk the volume RB-tree to look if this volume is already present */
304 av = rb_entry(parent, struct ubi_ainf_volume, rb);
306 if (vol_id == av->vol_id)
309 if (vol_id > av->vol_id)
315 /* The volume is absent - add it */
316 av = kmalloc(sizeof(struct ubi_ainf_volume), GFP_KERNEL);
318 return ERR_PTR(-ENOMEM);
320 av->highest_lnum = av->leb_count = 0;
323 av->used_ebs = be32_to_cpu(vid_hdr->used_ebs);
324 av->data_pad = be32_to_cpu(vid_hdr->data_pad);
325 av->compat = vid_hdr->compat;
326 av->vol_type = vid_hdr->vol_type == UBI_VID_DYNAMIC ? UBI_DYNAMIC_VOLUME
328 if (vol_id > ai->highest_vol_id)
329 ai->highest_vol_id = vol_id;
331 rb_link_node(&av->rb, parent, p);
332 rb_insert_color(&av->rb, &ai->volumes);
334 dbg_bld("added volume %d", vol_id);
339 * ubi_compare_lebs - find out which logical eraseblock is newer.
340 * @ubi: UBI device description object
341 * @aeb: first logical eraseblock to compare
342 * @pnum: physical eraseblock number of the second logical eraseblock to
344 * @vid_hdr: volume identifier header of the second logical eraseblock
346 * This function compares 2 copies of a LEB and informs which one is newer. In
347 * case of success this function returns a positive value, in case of failure, a
348 * negative error code is returned. The success return codes use the following
350 * o bit 0 is cleared: the first PEB (described by @aeb) is newer than the
351 * second PEB (described by @pnum and @vid_hdr);
352 * o bit 0 is set: the second PEB is newer;
353 * o bit 1 is cleared: no bit-flips were detected in the newer LEB;
354 * o bit 1 is set: bit-flips were detected in the newer LEB;
355 * o bit 2 is cleared: the older LEB is not corrupted;
356 * o bit 2 is set: the older LEB is corrupted.
358 int ubi_compare_lebs(struct ubi_device *ubi, const struct ubi_ainf_peb *aeb,
359 int pnum, const struct ubi_vid_hdr *vid_hdr)
361 int len, err, second_is_newer, bitflips = 0, corrupted = 0;
362 uint32_t data_crc, crc;
363 struct ubi_vid_hdr *vh = NULL;
364 unsigned long long sqnum2 = be64_to_cpu(vid_hdr->sqnum);
366 if (sqnum2 == aeb->sqnum) {
368 * This must be a really ancient UBI image which has been
369 * created before sequence numbers support has been added. At
370 * that times we used 32-bit LEB versions stored in logical
371 * eraseblocks. That was before UBI got into mainline. We do not
372 * support these images anymore. Well, those images still work,
373 * but only if no unclean reboots happened.
375 ubi_err(ubi, "unsupported on-flash UBI format");
379 /* Obviously the LEB with lower sequence counter is older */
380 second_is_newer = (sqnum2 > aeb->sqnum);
383 * Now we know which copy is newer. If the copy flag of the PEB with
384 * newer version is not set, then we just return, otherwise we have to
385 * check data CRC. For the second PEB we already have the VID header,
386 * for the first one - we'll need to re-read it from flash.
388 * Note: this may be optimized so that we wouldn't read twice.
391 if (second_is_newer) {
392 if (!vid_hdr->copy_flag) {
393 /* It is not a copy, so it is newer */
394 dbg_bld("second PEB %d is newer, copy_flag is unset",
399 if (!aeb->copy_flag) {
400 /* It is not a copy, so it is newer */
401 dbg_bld("first PEB %d is newer, copy_flag is unset",
403 return bitflips << 1;
406 vh = ubi_zalloc_vid_hdr(ubi, GFP_KERNEL);
411 err = ubi_io_read_vid_hdr(ubi, pnum, vh, 0);
413 if (err == UBI_IO_BITFLIPS)
416 ubi_err(ubi, "VID of PEB %d header is bad, but it was OK earlier, err %d",
428 /* Read the data of the copy and check the CRC */
430 len = be32_to_cpu(vid_hdr->data_size);
432 mutex_lock(&ubi->buf_mutex);
433 err = ubi_io_read_data(ubi, ubi->peb_buf, pnum, 0, len);
434 if (err && err != UBI_IO_BITFLIPS && !mtd_is_eccerr(err))
437 data_crc = be32_to_cpu(vid_hdr->data_crc);
438 crc = crc32(UBI_CRC32_INIT, ubi->peb_buf, len);
439 if (crc != data_crc) {
440 dbg_bld("PEB %d CRC error: calculated %#08x, must be %#08x",
441 pnum, crc, data_crc);
444 second_is_newer = !second_is_newer;
446 dbg_bld("PEB %d CRC is OK", pnum);
449 mutex_unlock(&ubi->buf_mutex);
451 ubi_free_vid_hdr(ubi, vh);
454 dbg_bld("second PEB %d is newer, copy_flag is set", pnum);
456 dbg_bld("first PEB %d is newer, copy_flag is set", pnum);
458 return second_is_newer | (bitflips << 1) | (corrupted << 2);
461 mutex_unlock(&ubi->buf_mutex);
463 ubi_free_vid_hdr(ubi, vh);
468 * ubi_add_to_av - add used physical eraseblock to the attaching information.
469 * @ubi: UBI device description object
470 * @ai: attaching information
471 * @pnum: the physical eraseblock number
473 * @vid_hdr: the volume identifier header
474 * @bitflips: if bit-flips were detected when this physical eraseblock was read
476 * This function adds information about a used physical eraseblock to the
477 * 'used' tree of the corresponding volume. The function is rather complex
478 * because it has to handle cases when this is not the first physical
479 * eraseblock belonging to the same logical eraseblock, and the newer one has
480 * to be picked, while the older one has to be dropped. This function returns
481 * zero in case of success and a negative error code in case of failure.
483 int ubi_add_to_av(struct ubi_device *ubi, struct ubi_attach_info *ai, int pnum,
484 int ec, const struct ubi_vid_hdr *vid_hdr, int bitflips)
486 int err, vol_id, lnum;
487 unsigned long long sqnum;
488 struct ubi_ainf_volume *av;
489 struct ubi_ainf_peb *aeb;
490 struct rb_node **p, *parent = NULL;
492 vol_id = be32_to_cpu(vid_hdr->vol_id);
493 lnum = be32_to_cpu(vid_hdr->lnum);
494 sqnum = be64_to_cpu(vid_hdr->sqnum);
496 dbg_bld("PEB %d, LEB %d:%d, EC %d, sqnum %llu, bitflips %d",
497 pnum, vol_id, lnum, ec, sqnum, bitflips);
499 av = add_volume(ai, vol_id, pnum, vid_hdr);
503 if (ai->max_sqnum < sqnum)
504 ai->max_sqnum = sqnum;
507 * Walk the RB-tree of logical eraseblocks of volume @vol_id to look
508 * if this is the first instance of this logical eraseblock or not.
510 p = &av->root.rb_node;
515 aeb = rb_entry(parent, struct ubi_ainf_peb, u.rb);
516 if (lnum != aeb->lnum) {
517 if (lnum < aeb->lnum)
525 * There is already a physical eraseblock describing the same
526 * logical eraseblock present.
529 dbg_bld("this LEB already exists: PEB %d, sqnum %llu, EC %d",
530 aeb->pnum, aeb->sqnum, aeb->ec);
533 * Make sure that the logical eraseblocks have different
534 * sequence numbers. Otherwise the image is bad.
536 * However, if the sequence number is zero, we assume it must
537 * be an ancient UBI image from the era when UBI did not have
538 * sequence numbers. We still can attach these images, unless
539 * there is a need to distinguish between old and new
540 * eraseblocks, in which case we'll refuse the image in
541 * 'ubi_compare_lebs()'. In other words, we attach old clean
542 * images, but refuse attaching old images with duplicated
543 * logical eraseblocks because there was an unclean reboot.
545 if (aeb->sqnum == sqnum && sqnum != 0) {
546 ubi_err(ubi, "two LEBs with same sequence number %llu",
548 ubi_dump_aeb(aeb, 0);
549 ubi_dump_vid_hdr(vid_hdr);
554 * Now we have to drop the older one and preserve the newer
557 cmp_res = ubi_compare_lebs(ubi, aeb, pnum, vid_hdr);
563 * This logical eraseblock is newer than the one
566 err = validate_vid_hdr(ubi, vid_hdr, av, pnum);
570 err = add_to_list(ai, aeb->pnum, aeb->vol_id,
571 aeb->lnum, aeb->ec, cmp_res & 4,
578 aeb->vol_id = vol_id;
580 aeb->scrub = ((cmp_res & 2) || bitflips);
581 aeb->copy_flag = vid_hdr->copy_flag;
584 if (av->highest_lnum == lnum)
586 be32_to_cpu(vid_hdr->data_size);
591 * This logical eraseblock is older than the one found
594 return add_to_list(ai, pnum, vol_id, lnum, ec,
595 cmp_res & 4, &ai->erase);
600 * We've met this logical eraseblock for the first time, add it to the
601 * attaching information.
604 err = validate_vid_hdr(ubi, vid_hdr, av, pnum);
608 aeb = kmem_cache_alloc(ai->aeb_slab_cache, GFP_KERNEL);
614 aeb->vol_id = vol_id;
616 aeb->scrub = bitflips;
617 aeb->copy_flag = vid_hdr->copy_flag;
620 if (av->highest_lnum <= lnum) {
621 av->highest_lnum = lnum;
622 av->last_data_size = be32_to_cpu(vid_hdr->data_size);
626 rb_link_node(&aeb->u.rb, parent, p);
627 rb_insert_color(&aeb->u.rb, &av->root);
632 * ubi_find_av - find volume in the attaching information.
633 * @ai: attaching information
634 * @vol_id: the requested volume ID
636 * This function returns a pointer to the volume description or %NULL if there
637 * are no data about this volume in the attaching information.
639 struct ubi_ainf_volume *ubi_find_av(const struct ubi_attach_info *ai,
642 struct ubi_ainf_volume *av;
643 struct rb_node *p = ai->volumes.rb_node;
646 av = rb_entry(p, struct ubi_ainf_volume, rb);
648 if (vol_id == av->vol_id)
651 if (vol_id > av->vol_id)
661 * ubi_remove_av - delete attaching information about a volume.
662 * @ai: attaching information
663 * @av: the volume attaching information to delete
665 void ubi_remove_av(struct ubi_attach_info *ai, struct ubi_ainf_volume *av)
668 struct ubi_ainf_peb *aeb;
670 dbg_bld("remove attaching information about volume %d", av->vol_id);
672 while ((rb = rb_first(&av->root))) {
673 aeb = rb_entry(rb, struct ubi_ainf_peb, u.rb);
674 rb_erase(&aeb->u.rb, &av->root);
675 list_add_tail(&aeb->u.list, &ai->erase);
678 rb_erase(&av->rb, &ai->volumes);
684 * early_erase_peb - erase a physical eraseblock.
685 * @ubi: UBI device description object
686 * @ai: attaching information
687 * @pnum: physical eraseblock number to erase;
688 * @ec: erase counter value to write (%UBI_UNKNOWN if it is unknown)
690 * This function erases physical eraseblock 'pnum', and writes the erase
691 * counter header to it. This function should only be used on UBI device
692 * initialization stages, when the EBA sub-system had not been yet initialized.
693 * This function returns zero in case of success and a negative error code in
696 static int early_erase_peb(struct ubi_device *ubi,
697 const struct ubi_attach_info *ai, int pnum, int ec)
700 struct ubi_ec_hdr *ec_hdr;
702 if ((long long)ec >= UBI_MAX_ERASECOUNTER) {
704 * Erase counter overflow. Upgrade UBI and use 64-bit
705 * erase counters internally.
707 ubi_err(ubi, "erase counter overflow at PEB %d, EC %d",
712 ec_hdr = kzalloc(ubi->ec_hdr_alsize, GFP_KERNEL);
716 ec_hdr->ec = cpu_to_be64(ec);
718 err = ubi_io_sync_erase(ubi, pnum, 0);
722 err = ubi_io_write_ec_hdr(ubi, pnum, ec_hdr);
730 * ubi_early_get_peb - get a free physical eraseblock.
731 * @ubi: UBI device description object
732 * @ai: attaching information
734 * This function returns a free physical eraseblock. It is supposed to be
735 * called on the UBI initialization stages when the wear-leveling sub-system is
736 * not initialized yet. This function picks a physical eraseblocks from one of
737 * the lists, writes the EC header if it is needed, and removes it from the
740 * This function returns a pointer to the "aeb" of the found free PEB in case
741 * of success and an error code in case of failure.
743 struct ubi_ainf_peb *ubi_early_get_peb(struct ubi_device *ubi,
744 struct ubi_attach_info *ai)
747 struct ubi_ainf_peb *aeb, *tmp_aeb;
749 if (!list_empty(&ai->free)) {
750 aeb = list_entry(ai->free.next, struct ubi_ainf_peb, u.list);
751 list_del(&aeb->u.list);
752 dbg_bld("return free PEB %d, EC %d", aeb->pnum, aeb->ec);
757 * We try to erase the first physical eraseblock from the erase list
758 * and pick it if we succeed, or try to erase the next one if not. And
759 * so forth. We don't want to take care about bad eraseblocks here -
760 * they'll be handled later.
762 list_for_each_entry_safe(aeb, tmp_aeb, &ai->erase, u.list) {
763 if (aeb->ec == UBI_UNKNOWN)
764 aeb->ec = ai->mean_ec;
766 err = early_erase_peb(ubi, ai, aeb->pnum, aeb->ec+1);
771 list_del(&aeb->u.list);
772 dbg_bld("return PEB %d, EC %d", aeb->pnum, aeb->ec);
776 ubi_err(ubi, "no free eraseblocks");
777 return ERR_PTR(-ENOSPC);
781 * check_corruption - check the data area of PEB.
782 * @ubi: UBI device description object
783 * @vid_hdr: the (corrupted) VID header of this PEB
784 * @pnum: the physical eraseblock number to check
786 * This is a helper function which is used to distinguish between VID header
787 * corruptions caused by power cuts and other reasons. If the PEB contains only
788 * 0xFF bytes in the data area, the VID header is most probably corrupted
789 * because of a power cut (%0 is returned in this case). Otherwise, it was
790 * probably corrupted for some other reasons (%1 is returned in this case). A
791 * negative error code is returned if a read error occurred.
793 * If the corruption reason was a power cut, UBI can safely erase this PEB.
794 * Otherwise, it should preserve it to avoid possibly destroying important
797 static int check_corruption(struct ubi_device *ubi, struct ubi_vid_hdr *vid_hdr,
802 mutex_lock(&ubi->buf_mutex);
803 memset(ubi->peb_buf, 0x00, ubi->leb_size);
805 err = ubi_io_read(ubi, ubi->peb_buf, pnum, ubi->leb_start,
807 if (err == UBI_IO_BITFLIPS || mtd_is_eccerr(err)) {
809 * Bit-flips or integrity errors while reading the data area.
810 * It is difficult to say for sure what type of corruption is
811 * this, but presumably a power cut happened while this PEB was
812 * erased, so it became unstable and corrupted, and should be
822 if (ubi_check_pattern(ubi->peb_buf, 0xFF, ubi->leb_size))
825 ubi_err(ubi, "PEB %d contains corrupted VID header, and the data does not contain all 0xFF",
827 ubi_err(ubi, "this may be a non-UBI PEB or a severe VID header corruption which requires manual inspection");
828 ubi_dump_vid_hdr(vid_hdr);
829 pr_err("hexdump of PEB %d offset %d, length %d",
830 pnum, ubi->leb_start, ubi->leb_size);
831 ubi_dbg_print_hex_dump(KERN_DEBUG, "", DUMP_PREFIX_OFFSET, 32, 1,
832 ubi->peb_buf, ubi->leb_size, 1);
836 mutex_unlock(&ubi->buf_mutex);
840 static bool vol_ignored(int vol_id)
843 case UBI_LAYOUT_VOLUME_ID:
847 #ifdef CONFIG_MTD_UBI_FASTMAP
848 return ubi_is_fm_vol(vol_id);
855 * scan_peb - scan and process UBI headers of a PEB.
856 * @ubi: UBI device description object
857 * @ai: attaching information
858 * @pnum: the physical eraseblock number
859 * @fast: true if we're scanning for a Fastmap
861 * This function reads UBI headers of PEB @pnum, checks them, and adds
862 * information about this PEB to the corresponding list or RB-tree in the
863 * "attaching info" structure. Returns zero if the physical eraseblock was
864 * successfully handled and a negative error code in case of failure.
866 static int scan_peb(struct ubi_device *ubi, struct ubi_attach_info *ai,
870 int err, bitflips = 0, vol_id = -1, ec_err = 0;
872 dbg_bld("scan PEB %d", pnum);
874 /* Skip bad physical eraseblocks */
875 err = ubi_io_is_bad(ubi, pnum);
879 ai->bad_peb_count += 1;
883 err = ubi_io_read_ec_hdr(ubi, pnum, ech, 0);
889 case UBI_IO_BITFLIPS:
893 ai->empty_peb_count += 1;
894 return add_to_list(ai, pnum, UBI_UNKNOWN, UBI_UNKNOWN,
895 UBI_UNKNOWN, 0, &ai->erase);
896 case UBI_IO_FF_BITFLIPS:
897 ai->empty_peb_count += 1;
898 return add_to_list(ai, pnum, UBI_UNKNOWN, UBI_UNKNOWN,
899 UBI_UNKNOWN, 1, &ai->erase);
900 case UBI_IO_BAD_HDR_EBADMSG:
903 * We have to also look at the VID header, possibly it is not
904 * corrupted. Set %bitflips flag in order to make this PEB be
905 * moved and EC be re-created.
912 ubi_err(ubi, "'ubi_io_read_ec_hdr()' returned unknown code %d",
920 /* Make sure UBI version is OK */
921 if (ech->version != UBI_VERSION) {
922 ubi_err(ubi, "this UBI version is %d, image version is %d",
923 UBI_VERSION, (int)ech->version);
927 ec = be64_to_cpu(ech->ec);
928 if (ec > UBI_MAX_ERASECOUNTER) {
930 * Erase counter overflow. The EC headers have 64 bits
931 * reserved, but we anyway make use of only 31 bit
932 * values, as this seems to be enough for any existing
933 * flash. Upgrade UBI and use 64-bit erase counters
936 ubi_err(ubi, "erase counter overflow, max is %d",
937 UBI_MAX_ERASECOUNTER);
938 ubi_dump_ec_hdr(ech);
943 * Make sure that all PEBs have the same image sequence number.
944 * This allows us to detect situations when users flash UBI
945 * images incorrectly, so that the flash has the new UBI image
946 * and leftovers from the old one. This feature was added
947 * relatively recently, and the sequence number was always
948 * zero, because old UBI implementations always set it to zero.
949 * For this reasons, we do not panic if some PEBs have zero
950 * sequence number, while other PEBs have non-zero sequence
953 image_seq = be32_to_cpu(ech->image_seq);
955 ubi->image_seq = image_seq;
956 if (image_seq && ubi->image_seq != image_seq) {
957 ubi_err(ubi, "bad image sequence number %d in PEB %d, expected %d",
958 image_seq, pnum, ubi->image_seq);
959 ubi_dump_ec_hdr(ech);
964 /* OK, we've done with the EC header, let's look at the VID header */
966 err = ubi_io_read_vid_hdr(ubi, pnum, vidh, 0);
972 case UBI_IO_BITFLIPS:
975 case UBI_IO_BAD_HDR_EBADMSG:
976 if (ec_err == UBI_IO_BAD_HDR_EBADMSG)
978 * Both EC and VID headers are corrupted and were read
979 * with data integrity error, probably this is a bad
980 * PEB, bit it is not marked as bad yet. This may also
981 * be a result of power cut during erasure.
983 ai->maybe_bad_peb_count += 1;
986 * If we're facing a bad VID header we have to drop *all*
987 * Fastmap data structures we find. The most recent Fastmap
988 * could be bad and therefore there is a chance that we attach
989 * from an old one. On a fine MTD stack a PEB must not render
990 * bad all of a sudden, but the reality is different.
991 * So, let's be paranoid and help finding the root cause by
992 * falling back to scanning mode instead of attaching with a
993 * bad EBA table and cause data corruption which is hard to
997 ai->force_full_scan = 1;
1001 * Both headers are corrupted. There is a possibility
1002 * that this a valid UBI PEB which has corresponding
1003 * LEB, but the headers are corrupted. However, it is
1004 * impossible to distinguish it from a PEB which just
1005 * contains garbage because of a power cut during erase
1006 * operation. So we just schedule this PEB for erasure.
1008 * Besides, in case of NOR flash, we deliberately
1009 * corrupt both headers because NOR flash erasure is
1010 * slow and can start from the end.
1015 * The EC was OK, but the VID header is corrupted. We
1016 * have to check what is in the data area.
1018 err = check_corruption(ubi, vidh, pnum);
1023 /* This corruption is caused by a power cut */
1024 err = add_to_list(ai, pnum, UBI_UNKNOWN,
1025 UBI_UNKNOWN, ec, 1, &ai->erase);
1027 /* This is an unexpected corruption */
1028 err = add_corrupted(ai, pnum, ec);
1031 goto adjust_mean_ec;
1032 case UBI_IO_FF_BITFLIPS:
1033 err = add_to_list(ai, pnum, UBI_UNKNOWN, UBI_UNKNOWN,
1037 goto adjust_mean_ec;
1039 if (ec_err || bitflips)
1040 err = add_to_list(ai, pnum, UBI_UNKNOWN,
1041 UBI_UNKNOWN, ec, 1, &ai->erase);
1043 err = add_to_list(ai, pnum, UBI_UNKNOWN,
1044 UBI_UNKNOWN, ec, 0, &ai->free);
1047 goto adjust_mean_ec;
1049 ubi_err(ubi, "'ubi_io_read_vid_hdr()' returned unknown code %d",
1054 vol_id = be32_to_cpu(vidh->vol_id);
1055 if (vol_id > UBI_MAX_VOLUMES && !vol_ignored(vol_id)) {
1056 int lnum = be32_to_cpu(vidh->lnum);
1058 /* Unsupported internal volume */
1059 switch (vidh->compat) {
1060 case UBI_COMPAT_DELETE:
1061 ubi_msg(ubi, "\"delete\" compatible internal volume %d:%d found, will remove it",
1064 err = add_to_list(ai, pnum, vol_id, lnum,
1071 ubi_msg(ubi, "read-only compatible internal volume %d:%d found, switch to read-only mode",
1076 case UBI_COMPAT_PRESERVE:
1077 ubi_msg(ubi, "\"preserve\" compatible internal volume %d:%d found",
1079 err = add_to_list(ai, pnum, vol_id, lnum,
1085 case UBI_COMPAT_REJECT:
1086 ubi_err(ubi, "incompatible internal volume %d:%d found",
1093 ubi_warn(ubi, "valid VID header but corrupted EC header at PEB %d",
1096 if (ubi_is_fm_vol(vol_id))
1097 err = add_fastmap(ai, pnum, vidh, ec);
1099 err = ubi_add_to_av(ubi, ai, pnum, ec, vidh, bitflips);
1108 if (ec > ai->max_ec)
1110 if (ec < ai->min_ec)
1118 * late_analysis - analyze the overall situation with PEB.
1119 * @ubi: UBI device description object
1120 * @ai: attaching information
1122 * This is a helper function which takes a look what PEBs we have after we
1123 * gather information about all of them ("ai" is compete). It decides whether
1124 * the flash is empty and should be formatted of whether there are too many
1125 * corrupted PEBs and we should not attach this MTD device. Returns zero if we
1126 * should proceed with attaching the MTD device, and %-EINVAL if we should not.
1128 static int late_analysis(struct ubi_device *ubi, struct ubi_attach_info *ai)
1130 struct ubi_ainf_peb *aeb;
1131 int max_corr, peb_count;
1133 peb_count = ubi->peb_count - ai->bad_peb_count - ai->alien_peb_count;
1134 max_corr = peb_count / 20 ?: 8;
1137 * Few corrupted PEBs is not a problem and may be just a result of
1138 * unclean reboots. However, many of them may indicate some problems
1139 * with the flash HW or driver.
1141 if (ai->corr_peb_count) {
1142 ubi_err(ubi, "%d PEBs are corrupted and preserved",
1143 ai->corr_peb_count);
1144 pr_err("Corrupted PEBs are:");
1145 list_for_each_entry(aeb, &ai->corr, u.list)
1146 pr_cont(" %d", aeb->pnum);
1150 * If too many PEBs are corrupted, we refuse attaching,
1151 * otherwise, only print a warning.
1153 if (ai->corr_peb_count >= max_corr) {
1154 ubi_err(ubi, "too many corrupted PEBs, refusing");
1159 if (ai->empty_peb_count + ai->maybe_bad_peb_count == peb_count) {
1161 * All PEBs are empty, or almost all - a couple PEBs look like
1162 * they may be bad PEBs which were not marked as bad yet.
1164 * This piece of code basically tries to distinguish between
1165 * the following situations:
1167 * 1. Flash is empty, but there are few bad PEBs, which are not
1168 * marked as bad so far, and which were read with error. We
1169 * want to go ahead and format this flash. While formatting,
1170 * the faulty PEBs will probably be marked as bad.
1172 * 2. Flash contains non-UBI data and we do not want to format
1173 * it and destroy possibly important information.
1175 if (ai->maybe_bad_peb_count <= 2) {
1177 ubi_msg(ubi, "empty MTD device detected");
1178 get_random_bytes(&ubi->image_seq,
1179 sizeof(ubi->image_seq));
1181 ubi_err(ubi, "MTD device is not UBI-formatted and possibly contains non-UBI data - refusing it");
1191 * destroy_av - free volume attaching information.
1192 * @av: volume attaching information
1193 * @ai: attaching information
1195 * This function destroys the volume attaching information.
1197 static void destroy_av(struct ubi_attach_info *ai, struct ubi_ainf_volume *av)
1199 struct ubi_ainf_peb *aeb;
1200 struct rb_node *this = av->root.rb_node;
1204 this = this->rb_left;
1205 else if (this->rb_right)
1206 this = this->rb_right;
1208 aeb = rb_entry(this, struct ubi_ainf_peb, u.rb);
1209 this = rb_parent(this);
1211 if (this->rb_left == &aeb->u.rb)
1212 this->rb_left = NULL;
1214 this->rb_right = NULL;
1217 kmem_cache_free(ai->aeb_slab_cache, aeb);
1224 * destroy_ai - destroy attaching information.
1225 * @ai: attaching information
1227 static void destroy_ai(struct ubi_attach_info *ai)
1229 struct ubi_ainf_peb *aeb, *aeb_tmp;
1230 struct ubi_ainf_volume *av;
1233 list_for_each_entry_safe(aeb, aeb_tmp, &ai->alien, u.list) {
1234 list_del(&aeb->u.list);
1235 kmem_cache_free(ai->aeb_slab_cache, aeb);
1237 list_for_each_entry_safe(aeb, aeb_tmp, &ai->erase, u.list) {
1238 list_del(&aeb->u.list);
1239 kmem_cache_free(ai->aeb_slab_cache, aeb);
1241 list_for_each_entry_safe(aeb, aeb_tmp, &ai->corr, u.list) {
1242 list_del(&aeb->u.list);
1243 kmem_cache_free(ai->aeb_slab_cache, aeb);
1245 list_for_each_entry_safe(aeb, aeb_tmp, &ai->free, u.list) {
1246 list_del(&aeb->u.list);
1247 kmem_cache_free(ai->aeb_slab_cache, aeb);
1249 list_for_each_entry_safe(aeb, aeb_tmp, &ai->fastmap, u.list) {
1250 list_del(&aeb->u.list);
1251 kmem_cache_free(ai->aeb_slab_cache, aeb);
1254 /* Destroy the volume RB-tree */
1255 rb = ai->volumes.rb_node;
1259 else if (rb->rb_right)
1262 av = rb_entry(rb, struct ubi_ainf_volume, rb);
1266 if (rb->rb_left == &av->rb)
1269 rb->rb_right = NULL;
1276 kmem_cache_destroy(ai->aeb_slab_cache);
1281 * scan_all - scan entire MTD device.
1282 * @ubi: UBI device description object
1283 * @ai: attach info object
1284 * @start: start scanning at this PEB
1286 * This function does full scanning of an MTD device and returns complete
1287 * information about it in form of a "struct ubi_attach_info" object. In case
1288 * of failure, an error code is returned.
1290 static int scan_all(struct ubi_device *ubi, struct ubi_attach_info *ai,
1294 struct rb_node *rb1, *rb2;
1295 struct ubi_ainf_volume *av;
1296 struct ubi_ainf_peb *aeb;
1300 ech = kzalloc(ubi->ec_hdr_alsize, GFP_KERNEL);
1304 vidh = ubi_zalloc_vid_hdr(ubi, GFP_KERNEL);
1308 for (pnum = start; pnum < ubi->peb_count; pnum++) {
1311 dbg_gen("process PEB %d", pnum);
1312 err = scan_peb(ubi, ai, pnum, false);
1317 ubi_msg(ubi, "scanning is finished");
1319 /* Calculate mean erase counter */
1321 ai->mean_ec = div_u64(ai->ec_sum, ai->ec_count);
1323 err = late_analysis(ubi, ai);
1328 * In case of unknown erase counter we use the mean erase counter
1331 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) {
1332 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb)
1333 if (aeb->ec == UBI_UNKNOWN)
1334 aeb->ec = ai->mean_ec;
1337 list_for_each_entry(aeb, &ai->free, u.list) {
1338 if (aeb->ec == UBI_UNKNOWN)
1339 aeb->ec = ai->mean_ec;
1342 list_for_each_entry(aeb, &ai->corr, u.list)
1343 if (aeb->ec == UBI_UNKNOWN)
1344 aeb->ec = ai->mean_ec;
1346 list_for_each_entry(aeb, &ai->erase, u.list)
1347 if (aeb->ec == UBI_UNKNOWN)
1348 aeb->ec = ai->mean_ec;
1350 err = self_check_ai(ubi, ai);
1354 ubi_free_vid_hdr(ubi, vidh);
1360 ubi_free_vid_hdr(ubi, vidh);
1366 static struct ubi_attach_info *alloc_ai(void)
1368 struct ubi_attach_info *ai;
1370 ai = kzalloc(sizeof(struct ubi_attach_info), GFP_KERNEL);
1374 INIT_LIST_HEAD(&ai->corr);
1375 INIT_LIST_HEAD(&ai->free);
1376 INIT_LIST_HEAD(&ai->erase);
1377 INIT_LIST_HEAD(&ai->alien);
1378 INIT_LIST_HEAD(&ai->fastmap);
1379 ai->volumes = RB_ROOT;
1380 ai->aeb_slab_cache = kmem_cache_create("ubi_aeb_slab_cache",
1381 sizeof(struct ubi_ainf_peb),
1383 if (!ai->aeb_slab_cache) {
1391 #ifdef CONFIG_MTD_UBI_FASTMAP
1394 * scan_fastmap - try to find a fastmap and attach from it.
1395 * @ubi: UBI device description object
1396 * @ai: attach info object
1398 * Returns 0 on success, negative return values indicate an internal
1400 * UBI_NO_FASTMAP denotes that no fastmap was found.
1401 * UBI_BAD_FASTMAP denotes that the found fastmap was invalid.
1403 static int scan_fast(struct ubi_device *ubi, struct ubi_attach_info **ai)
1406 struct ubi_attach_info *scan_ai;
1410 scan_ai = alloc_ai();
1414 ech = kzalloc(ubi->ec_hdr_alsize, GFP_KERNEL);
1418 vidh = ubi_zalloc_vid_hdr(ubi, GFP_KERNEL);
1422 for (pnum = 0; pnum < UBI_FM_MAX_START; pnum++) {
1425 dbg_gen("process PEB %d", pnum);
1426 err = scan_peb(ubi, scan_ai, pnum, true);
1431 ubi_free_vid_hdr(ubi, vidh);
1434 if (scan_ai->force_full_scan)
1435 err = UBI_NO_FASTMAP;
1437 err = ubi_scan_fastmap(ubi, *ai, scan_ai);
1441 * Didn't attach via fastmap, do a full scan but reuse what
1442 * we've aready scanned.
1447 destroy_ai(scan_ai);
1452 ubi_free_vid_hdr(ubi, vidh);
1456 destroy_ai(scan_ai);
1464 * ubi_attach - attach an MTD device.
1465 * @ubi: UBI device descriptor
1466 * @force_scan: if set to non-zero attach by scanning
1468 * This function returns zero in case of success and a negative error code in
1471 int ubi_attach(struct ubi_device *ubi, int force_scan)
1474 struct ubi_attach_info *ai;
1480 #ifdef CONFIG_MTD_UBI_FASTMAP
1481 /* On small flash devices we disable fastmap in any case. */
1482 if ((int)mtd_div_by_eb(ubi->mtd->size, ubi->mtd) <= UBI_FM_MAX_START) {
1483 ubi->fm_disabled = 1;
1488 err = scan_all(ubi, ai, 0);
1490 err = scan_fast(ubi, &ai);
1491 if (err > 0 || mtd_is_eccerr(err)) {
1492 if (err != UBI_NO_FASTMAP) {
1498 err = scan_all(ubi, ai, 0);
1500 err = scan_all(ubi, ai, UBI_FM_MAX_START);
1505 err = scan_all(ubi, ai, 0);
1510 ubi->bad_peb_count = ai->bad_peb_count;
1511 ubi->good_peb_count = ubi->peb_count - ubi->bad_peb_count;
1512 ubi->corr_peb_count = ai->corr_peb_count;
1513 ubi->max_ec = ai->max_ec;
1514 ubi->mean_ec = ai->mean_ec;
1515 dbg_gen("max. sequence number: %llu", ai->max_sqnum);
1517 err = ubi_read_volume_table(ubi, ai);
1521 err = ubi_wl_init(ubi, ai);
1525 err = ubi_eba_init(ubi, ai);
1529 #ifdef CONFIG_MTD_UBI_FASTMAP
1530 if (ubi->fm && ubi_dbg_chk_fastmap(ubi)) {
1531 struct ubi_attach_info *scan_ai;
1533 scan_ai = alloc_ai();
1539 err = scan_all(ubi, scan_ai, 0);
1541 destroy_ai(scan_ai);
1545 err = self_check_eba(ubi, ai, scan_ai);
1546 destroy_ai(scan_ai);
1559 ubi_free_internal_volumes(ubi);
1567 * self_check_ai - check the attaching information.
1568 * @ubi: UBI device description object
1569 * @ai: attaching information
1571 * This function returns zero if the attaching information is all right, and a
1572 * negative error code if not or if an error occurred.
1574 static int self_check_ai(struct ubi_device *ubi, struct ubi_attach_info *ai)
1576 int pnum, err, vols_found = 0;
1577 struct rb_node *rb1, *rb2;
1578 struct ubi_ainf_volume *av;
1579 struct ubi_ainf_peb *aeb, *last_aeb;
1582 if (!ubi_dbg_chk_gen(ubi))
1586 * At first, check that attaching information is OK.
1588 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) {
1596 ubi_err(ubi, "bad is_empty flag");
1600 if (av->vol_id < 0 || av->highest_lnum < 0 ||
1601 av->leb_count < 0 || av->vol_type < 0 || av->used_ebs < 0 ||
1602 av->data_pad < 0 || av->last_data_size < 0) {
1603 ubi_err(ubi, "negative values");
1607 if (av->vol_id >= UBI_MAX_VOLUMES &&
1608 av->vol_id < UBI_INTERNAL_VOL_START) {
1609 ubi_err(ubi, "bad vol_id");
1613 if (av->vol_id > ai->highest_vol_id) {
1614 ubi_err(ubi, "highest_vol_id is %d, but vol_id %d is there",
1615 ai->highest_vol_id, av->vol_id);
1619 if (av->vol_type != UBI_DYNAMIC_VOLUME &&
1620 av->vol_type != UBI_STATIC_VOLUME) {
1621 ubi_err(ubi, "bad vol_type");
1625 if (av->data_pad > ubi->leb_size / 2) {
1626 ubi_err(ubi, "bad data_pad");
1631 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) {
1637 if (aeb->pnum < 0 || aeb->ec < 0) {
1638 ubi_err(ubi, "negative values");
1642 if (aeb->ec < ai->min_ec) {
1643 ubi_err(ubi, "bad ai->min_ec (%d), %d found",
1644 ai->min_ec, aeb->ec);
1648 if (aeb->ec > ai->max_ec) {
1649 ubi_err(ubi, "bad ai->max_ec (%d), %d found",
1650 ai->max_ec, aeb->ec);
1654 if (aeb->pnum >= ubi->peb_count) {
1655 ubi_err(ubi, "too high PEB number %d, total PEBs %d",
1656 aeb->pnum, ubi->peb_count);
1660 if (av->vol_type == UBI_STATIC_VOLUME) {
1661 if (aeb->lnum >= av->used_ebs) {
1662 ubi_err(ubi, "bad lnum or used_ebs");
1666 if (av->used_ebs != 0) {
1667 ubi_err(ubi, "non-zero used_ebs");
1672 if (aeb->lnum > av->highest_lnum) {
1673 ubi_err(ubi, "incorrect highest_lnum or lnum");
1678 if (av->leb_count != leb_count) {
1679 ubi_err(ubi, "bad leb_count, %d objects in the tree",
1689 if (aeb->lnum != av->highest_lnum) {
1690 ubi_err(ubi, "bad highest_lnum");
1695 if (vols_found != ai->vols_found) {
1696 ubi_err(ubi, "bad ai->vols_found %d, should be %d",
1697 ai->vols_found, vols_found);
1701 /* Check that attaching information is correct */
1702 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) {
1704 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) {
1711 err = ubi_io_read_vid_hdr(ubi, aeb->pnum, vidh, 1);
1712 if (err && err != UBI_IO_BITFLIPS) {
1713 ubi_err(ubi, "VID header is not OK (%d)",
1720 vol_type = vidh->vol_type == UBI_VID_DYNAMIC ?
1721 UBI_DYNAMIC_VOLUME : UBI_STATIC_VOLUME;
1722 if (av->vol_type != vol_type) {
1723 ubi_err(ubi, "bad vol_type");
1727 if (aeb->sqnum != be64_to_cpu(vidh->sqnum)) {
1728 ubi_err(ubi, "bad sqnum %llu", aeb->sqnum);
1732 if (av->vol_id != be32_to_cpu(vidh->vol_id)) {
1733 ubi_err(ubi, "bad vol_id %d", av->vol_id);
1737 if (av->compat != vidh->compat) {
1738 ubi_err(ubi, "bad compat %d", vidh->compat);
1742 if (aeb->lnum != be32_to_cpu(vidh->lnum)) {
1743 ubi_err(ubi, "bad lnum %d", aeb->lnum);
1747 if (av->used_ebs != be32_to_cpu(vidh->used_ebs)) {
1748 ubi_err(ubi, "bad used_ebs %d", av->used_ebs);
1752 if (av->data_pad != be32_to_cpu(vidh->data_pad)) {
1753 ubi_err(ubi, "bad data_pad %d", av->data_pad);
1761 if (av->highest_lnum != be32_to_cpu(vidh->lnum)) {
1762 ubi_err(ubi, "bad highest_lnum %d", av->highest_lnum);
1766 if (av->last_data_size != be32_to_cpu(vidh->data_size)) {
1767 ubi_err(ubi, "bad last_data_size %d",
1768 av->last_data_size);
1774 * Make sure that all the physical eraseblocks are in one of the lists
1777 buf = kzalloc(ubi->peb_count, GFP_KERNEL);
1781 for (pnum = 0; pnum < ubi->peb_count; pnum++) {
1782 err = ubi_io_is_bad(ubi, pnum);
1790 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb)
1791 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb)
1794 list_for_each_entry(aeb, &ai->free, u.list)
1797 list_for_each_entry(aeb, &ai->corr, u.list)
1800 list_for_each_entry(aeb, &ai->erase, u.list)
1803 list_for_each_entry(aeb, &ai->alien, u.list)
1807 for (pnum = 0; pnum < ubi->peb_count; pnum++)
1809 ubi_err(ubi, "PEB %d is not referred", pnum);
1819 ubi_err(ubi, "bad attaching information about LEB %d", aeb->lnum);
1820 ubi_dump_aeb(aeb, 0);
1825 ubi_err(ubi, "bad attaching information about volume %d", av->vol_id);
1830 ubi_err(ubi, "bad attaching information about volume %d", av->vol_id);
1832 ubi_dump_vid_hdr(vidh);