]>
git.ipfire.org Git - people/ms/u-boot.git/blob - drivers/mtd/ubi/attach.c
9fce02ef267ae11d1e3039bbcd3d386c33e24092
2 * Copyright (c) International Business Machines Corp., 2006
4 * SPDX-License-Identifier: GPL-2.0+
6 * Author: Artem Bityutskiy (Битюцкий Артём)
10 * UBI attaching sub-system.
12 * This sub-system is responsible for attaching MTD devices and it also
13 * implements flash media scanning.
15 * The attaching information is represented by a &struct ubi_attach_info'
16 * object. Information about volumes is represented by &struct ubi_ainf_volume
17 * objects which are kept in volume RB-tree with root at the @volumes field.
18 * The RB-tree is indexed by the volume ID.
20 * Logical eraseblocks are represented by &struct ubi_ainf_peb objects. These
21 * objects are kept in per-volume RB-trees with the root at the corresponding
22 * &struct ubi_ainf_volume object. To put it differently, we keep an RB-tree of
23 * per-volume objects and each of these objects is the root of RB-tree of
26 * Corrupted physical eraseblocks are put to the @corr list, free physical
27 * eraseblocks are put to the @free list and the physical eraseblock to be
28 * erased are put to the @erase list.
33 * UBI protects EC and VID headers with CRC-32 checksums, so it can detect
34 * whether the headers are corrupted or not. Sometimes UBI also protects the
35 * data with CRC-32, e.g., when it executes the atomic LEB change operation, or
36 * when it moves the contents of a PEB for wear-leveling purposes.
38 * UBI tries to distinguish between 2 types of corruptions.
40 * 1. Corruptions caused by power cuts. These are expected corruptions and UBI
41 * tries to handle them gracefully, without printing too many warnings and
42 * error messages. The idea is that we do not lose important data in these
43 * cases - we may lose only the data which were being written to the media just
44 * before the power cut happened, and the upper layers (e.g., UBIFS) are
45 * supposed to handle such data losses (e.g., by using the FS journal).
47 * When UBI detects a corruption (CRC-32 mismatch) in a PEB, and it looks like
48 * the reason is a power cut, UBI puts this PEB to the @erase list, and all
49 * PEBs in the @erase list are scheduled for erasure later.
51 * 2. Unexpected corruptions which are not caused by power cuts. During
52 * attaching, such PEBs are put to the @corr list and UBI preserves them.
53 * Obviously, this lessens the amount of available PEBs, and if at some point
54 * UBI runs out of free PEBs, it switches to R/O mode. UBI also loudly informs
55 * about such PEBs every time the MTD device is attached.
57 * However, it is difficult to reliably distinguish between these types of
58 * corruptions and UBI's strategy is as follows (in case of attaching by
59 * scanning). UBI assumes corruption type 2 if the VID header is corrupted and
60 * the data area does not contain all 0xFFs, and there were no bit-flips or
61 * integrity errors (e.g., ECC errors in case of NAND) while reading the data
62 * area. Otherwise UBI assumes corruption type 1. So the decision criteria
64 * o If the data area contains only 0xFFs, there are no data, and it is safe
65 * to just erase this PEB - this is corruption type 1.
66 * o If the data area has bit-flips or data integrity errors (ECC errors on
67 * NAND), it is probably a PEB which was being erased when power cut
68 * happened, so this is corruption type 1. However, this is just a guess,
69 * which might be wrong.
70 * o Otherwise this is corruption type 2.
75 #include <linux/err.h>
76 #include <linux/slab.h>
77 #include <linux/crc32.h>
78 #include <linux/random.h>
81 #include <linux/err.h>
84 #include <linux/math64.h>
86 #include <ubi_uboot.h>
89 static int self_check_ai(struct ubi_device
*ubi
, struct ubi_attach_info
*ai
);
91 /* Temporary variables used during scanning */
92 static struct ubi_ec_hdr
*ech
;
93 static struct ubi_vid_hdr
*vidh
;
96 * add_to_list - add physical eraseblock to a list.
97 * @ai: attaching information
98 * @pnum: physical eraseblock number to add
99 * @vol_id: the last used volume id for the PEB
100 * @lnum: the last used LEB number for the PEB
101 * @ec: erase counter of the physical eraseblock
102 * @to_head: if not zero, add to the head of the list
103 * @list: the list to add to
105 * This function allocates a 'struct ubi_ainf_peb' object for physical
106 * eraseblock @pnum and adds it to the "free", "erase", or "alien" lists.
107 * It stores the @lnum and @vol_id alongside, which can both be
108 * %UBI_UNKNOWN if they are not available, not readable, or not assigned.
109 * If @to_head is not zero, PEB will be added to the head of the list, which
110 * basically means it will be processed first later. E.g., we add corrupted
111 * PEBs (corrupted due to power cuts) to the head of the erase list to make
112 * sure we erase them first and get rid of corruptions ASAP. This function
113 * returns zero in case of success and a negative error code in case of
116 static int add_to_list(struct ubi_attach_info
*ai
, int pnum
, int vol_id
,
117 int lnum
, int ec
, int to_head
, struct list_head
*list
)
119 struct ubi_ainf_peb
*aeb
;
121 if (list
== &ai
->free
) {
122 dbg_bld("add to free: PEB %d, EC %d", pnum
, ec
);
123 } else if (list
== &ai
->erase
) {
124 dbg_bld("add to erase: PEB %d, EC %d", pnum
, ec
);
125 } else if (list
== &ai
->alien
) {
126 dbg_bld("add to alien: PEB %d, EC %d", pnum
, ec
);
127 ai
->alien_peb_count
+= 1;
131 aeb
= kmem_cache_alloc(ai
->aeb_slab_cache
, GFP_KERNEL
);
136 aeb
->vol_id
= vol_id
;
140 list_add(&aeb
->u
.list
, list
);
142 list_add_tail(&aeb
->u
.list
, list
);
147 * add_corrupted - add a corrupted physical eraseblock.
148 * @ai: attaching information
149 * @pnum: physical eraseblock number to add
150 * @ec: erase counter of the physical eraseblock
152 * This function allocates a 'struct ubi_ainf_peb' object for a corrupted
153 * physical eraseblock @pnum and adds it to the 'corr' list. The corruption
154 * was presumably not caused by a power cut. Returns zero in case of success
155 * and a negative error code in case of failure.
157 static int add_corrupted(struct ubi_attach_info
*ai
, int pnum
, int ec
)
159 struct ubi_ainf_peb
*aeb
;
161 dbg_bld("add to corrupted: PEB %d, EC %d", pnum
, ec
);
163 aeb
= kmem_cache_alloc(ai
->aeb_slab_cache
, GFP_KERNEL
);
167 ai
->corr_peb_count
+= 1;
170 list_add(&aeb
->u
.list
, &ai
->corr
);
175 * validate_vid_hdr - check volume identifier header.
176 * @vid_hdr: the volume identifier header to check
177 * @av: information about the volume this logical eraseblock belongs to
178 * @pnum: physical eraseblock number the VID header came from
180 * This function checks that data stored in @vid_hdr is consistent. Returns
181 * non-zero if an inconsistency was found and zero if not.
183 * Note, UBI does sanity check of everything it reads from the flash media.
184 * Most of the checks are done in the I/O sub-system. Here we check that the
185 * information in the VID header is consistent to the information in other VID
186 * headers of the same volume.
188 static int validate_vid_hdr(const struct ubi_vid_hdr
*vid_hdr
,
189 const struct ubi_ainf_volume
*av
, int pnum
)
191 int vol_type
= vid_hdr
->vol_type
;
192 int vol_id
= be32_to_cpu(vid_hdr
->vol_id
);
193 int used_ebs
= be32_to_cpu(vid_hdr
->used_ebs
);
194 int data_pad
= be32_to_cpu(vid_hdr
->data_pad
);
196 if (av
->leb_count
!= 0) {
200 * This is not the first logical eraseblock belonging to this
201 * volume. Ensure that the data in its VID header is consistent
202 * to the data in previous logical eraseblock headers.
205 if (vol_id
!= av
->vol_id
) {
206 ubi_err("inconsistent vol_id");
210 if (av
->vol_type
== UBI_STATIC_VOLUME
)
211 av_vol_type
= UBI_VID_STATIC
;
213 av_vol_type
= UBI_VID_DYNAMIC
;
215 if (vol_type
!= av_vol_type
) {
216 ubi_err("inconsistent vol_type");
220 if (used_ebs
!= av
->used_ebs
) {
221 ubi_err("inconsistent used_ebs");
225 if (data_pad
!= av
->data_pad
) {
226 ubi_err("inconsistent data_pad");
234 ubi_err("inconsistent VID header at PEB %d", pnum
);
235 ubi_dump_vid_hdr(vid_hdr
);
241 * add_volume - add volume to the attaching information.
242 * @ai: attaching information
243 * @vol_id: ID of the volume to add
244 * @pnum: physical eraseblock number
245 * @vid_hdr: volume identifier header
247 * If the volume corresponding to the @vid_hdr logical eraseblock is already
248 * present in the attaching information, this function does nothing. Otherwise
249 * it adds corresponding volume to the attaching information. Returns a pointer
250 * to the allocated "av" object in case of success and a negative error code in
253 static struct ubi_ainf_volume
*add_volume(struct ubi_attach_info
*ai
,
254 int vol_id
, int pnum
,
255 const struct ubi_vid_hdr
*vid_hdr
)
257 struct ubi_ainf_volume
*av
;
258 struct rb_node
**p
= &ai
->volumes
.rb_node
, *parent
= NULL
;
260 ubi_assert(vol_id
== be32_to_cpu(vid_hdr
->vol_id
));
262 /* Walk the volume RB-tree to look if this volume is already present */
265 av
= rb_entry(parent
, struct ubi_ainf_volume
, rb
);
267 if (vol_id
== av
->vol_id
)
270 if (vol_id
> av
->vol_id
)
276 /* The volume is absent - add it */
277 av
= kmalloc(sizeof(struct ubi_ainf_volume
), GFP_KERNEL
);
279 return ERR_PTR(-ENOMEM
);
281 av
->highest_lnum
= av
->leb_count
= 0;
284 av
->used_ebs
= be32_to_cpu(vid_hdr
->used_ebs
);
285 av
->data_pad
= be32_to_cpu(vid_hdr
->data_pad
);
286 av
->compat
= vid_hdr
->compat
;
287 av
->vol_type
= vid_hdr
->vol_type
== UBI_VID_DYNAMIC
? UBI_DYNAMIC_VOLUME
289 if (vol_id
> ai
->highest_vol_id
)
290 ai
->highest_vol_id
= vol_id
;
292 rb_link_node(&av
->rb
, parent
, p
);
293 rb_insert_color(&av
->rb
, &ai
->volumes
);
295 dbg_bld("added volume %d", vol_id
);
300 * ubi_compare_lebs - find out which logical eraseblock is newer.
301 * @ubi: UBI device description object
302 * @aeb: first logical eraseblock to compare
303 * @pnum: physical eraseblock number of the second logical eraseblock to
305 * @vid_hdr: volume identifier header of the second logical eraseblock
307 * This function compares 2 copies of a LEB and informs which one is newer. In
308 * case of success this function returns a positive value, in case of failure, a
309 * negative error code is returned. The success return codes use the following
311 * o bit 0 is cleared: the first PEB (described by @aeb) is newer than the
312 * second PEB (described by @pnum and @vid_hdr);
313 * o bit 0 is set: the second PEB is newer;
314 * o bit 1 is cleared: no bit-flips were detected in the newer LEB;
315 * o bit 1 is set: bit-flips were detected in the newer LEB;
316 * o bit 2 is cleared: the older LEB is not corrupted;
317 * o bit 2 is set: the older LEB is corrupted.
319 int ubi_compare_lebs(struct ubi_device
*ubi
, const struct ubi_ainf_peb
*aeb
,
320 int pnum
, const struct ubi_vid_hdr
*vid_hdr
)
322 int len
, err
, second_is_newer
, bitflips
= 0, corrupted
= 0;
323 uint32_t data_crc
, crc
;
324 struct ubi_vid_hdr
*vh
= NULL
;
325 unsigned long long sqnum2
= be64_to_cpu(vid_hdr
->sqnum
);
327 if (sqnum2
== aeb
->sqnum
) {
329 * This must be a really ancient UBI image which has been
330 * created before sequence numbers support has been added. At
331 * that times we used 32-bit LEB versions stored in logical
332 * eraseblocks. That was before UBI got into mainline. We do not
333 * support these images anymore. Well, those images still work,
334 * but only if no unclean reboots happened.
336 ubi_err("unsupported on-flash UBI format");
340 /* Obviously the LEB with lower sequence counter is older */
341 second_is_newer
= (sqnum2
> aeb
->sqnum
);
344 * Now we know which copy is newer. If the copy flag of the PEB with
345 * newer version is not set, then we just return, otherwise we have to
346 * check data CRC. For the second PEB we already have the VID header,
347 * for the first one - we'll need to re-read it from flash.
349 * Note: this may be optimized so that we wouldn't read twice.
352 if (second_is_newer
) {
353 if (!vid_hdr
->copy_flag
) {
354 /* It is not a copy, so it is newer */
355 dbg_bld("second PEB %d is newer, copy_flag is unset",
360 if (!aeb
->copy_flag
) {
361 /* It is not a copy, so it is newer */
362 dbg_bld("first PEB %d is newer, copy_flag is unset",
364 return bitflips
<< 1;
367 vh
= ubi_zalloc_vid_hdr(ubi
, GFP_KERNEL
);
372 err
= ubi_io_read_vid_hdr(ubi
, pnum
, vh
, 0);
374 if (err
== UBI_IO_BITFLIPS
)
377 ubi_err("VID of PEB %d header is bad, but it was OK earlier, err %d",
389 /* Read the data of the copy and check the CRC */
391 len
= be32_to_cpu(vid_hdr
->data_size
);
393 mutex_lock(&ubi
->buf_mutex
);
394 err
= ubi_io_read_data(ubi
, ubi
->peb_buf
, pnum
, 0, len
);
395 if (err
&& err
!= UBI_IO_BITFLIPS
&& !mtd_is_eccerr(err
))
398 data_crc
= be32_to_cpu(vid_hdr
->data_crc
);
399 crc
= crc32(UBI_CRC32_INIT
, ubi
->peb_buf
, len
);
400 if (crc
!= data_crc
) {
401 dbg_bld("PEB %d CRC error: calculated %#08x, must be %#08x",
402 pnum
, crc
, data_crc
);
405 second_is_newer
= !second_is_newer
;
407 dbg_bld("PEB %d CRC is OK", pnum
);
410 mutex_unlock(&ubi
->buf_mutex
);
412 ubi_free_vid_hdr(ubi
, vh
);
415 dbg_bld("second PEB %d is newer, copy_flag is set", pnum
);
417 dbg_bld("first PEB %d is newer, copy_flag is set", pnum
);
419 return second_is_newer
| (bitflips
<< 1) | (corrupted
<< 2);
422 mutex_unlock(&ubi
->buf_mutex
);
424 ubi_free_vid_hdr(ubi
, vh
);
429 * ubi_add_to_av - add used physical eraseblock to the attaching information.
430 * @ubi: UBI device description object
431 * @ai: attaching information
432 * @pnum: the physical eraseblock number
434 * @vid_hdr: the volume identifier header
435 * @bitflips: if bit-flips were detected when this physical eraseblock was read
437 * This function adds information about a used physical eraseblock to the
438 * 'used' tree of the corresponding volume. The function is rather complex
439 * because it has to handle cases when this is not the first physical
440 * eraseblock belonging to the same logical eraseblock, and the newer one has
441 * to be picked, while the older one has to be dropped. This function returns
442 * zero in case of success and a negative error code in case of failure.
444 int ubi_add_to_av(struct ubi_device
*ubi
, struct ubi_attach_info
*ai
, int pnum
,
445 int ec
, const struct ubi_vid_hdr
*vid_hdr
, int bitflips
)
447 int err
, vol_id
, lnum
;
448 unsigned long long sqnum
;
449 struct ubi_ainf_volume
*av
;
450 struct ubi_ainf_peb
*aeb
;
451 struct rb_node
**p
, *parent
= NULL
;
453 vol_id
= be32_to_cpu(vid_hdr
->vol_id
);
454 lnum
= be32_to_cpu(vid_hdr
->lnum
);
455 sqnum
= be64_to_cpu(vid_hdr
->sqnum
);
457 dbg_bld("PEB %d, LEB %d:%d, EC %d, sqnum %llu, bitflips %d",
458 pnum
, vol_id
, lnum
, ec
, sqnum
, bitflips
);
460 av
= add_volume(ai
, vol_id
, pnum
, vid_hdr
);
464 if (ai
->max_sqnum
< sqnum
)
465 ai
->max_sqnum
= sqnum
;
468 * Walk the RB-tree of logical eraseblocks of volume @vol_id to look
469 * if this is the first instance of this logical eraseblock or not.
471 p
= &av
->root
.rb_node
;
476 aeb
= rb_entry(parent
, struct ubi_ainf_peb
, u
.rb
);
477 if (lnum
!= aeb
->lnum
) {
478 if (lnum
< aeb
->lnum
)
486 * There is already a physical eraseblock describing the same
487 * logical eraseblock present.
490 dbg_bld("this LEB already exists: PEB %d, sqnum %llu, EC %d",
491 aeb
->pnum
, aeb
->sqnum
, aeb
->ec
);
494 * Make sure that the logical eraseblocks have different
495 * sequence numbers. Otherwise the image is bad.
497 * However, if the sequence number is zero, we assume it must
498 * be an ancient UBI image from the era when UBI did not have
499 * sequence numbers. We still can attach these images, unless
500 * there is a need to distinguish between old and new
501 * eraseblocks, in which case we'll refuse the image in
502 * 'ubi_compare_lebs()'. In other words, we attach old clean
503 * images, but refuse attaching old images with duplicated
504 * logical eraseblocks because there was an unclean reboot.
506 if (aeb
->sqnum
== sqnum
&& sqnum
!= 0) {
507 ubi_err("two LEBs with same sequence number %llu",
509 ubi_dump_aeb(aeb
, 0);
510 ubi_dump_vid_hdr(vid_hdr
);
515 * Now we have to drop the older one and preserve the newer
518 cmp_res
= ubi_compare_lebs(ubi
, aeb
, pnum
, vid_hdr
);
524 * This logical eraseblock is newer than the one
527 err
= validate_vid_hdr(vid_hdr
, av
, pnum
);
531 err
= add_to_list(ai
, aeb
->pnum
, aeb
->vol_id
,
532 aeb
->lnum
, aeb
->ec
, cmp_res
& 4,
539 aeb
->vol_id
= vol_id
;
541 aeb
->scrub
= ((cmp_res
& 2) || bitflips
);
542 aeb
->copy_flag
= vid_hdr
->copy_flag
;
545 if (av
->highest_lnum
== lnum
)
547 be32_to_cpu(vid_hdr
->data_size
);
552 * This logical eraseblock is older than the one found
555 return add_to_list(ai
, pnum
, vol_id
, lnum
, ec
,
556 cmp_res
& 4, &ai
->erase
);
561 * We've met this logical eraseblock for the first time, add it to the
562 * attaching information.
565 err
= validate_vid_hdr(vid_hdr
, av
, pnum
);
569 aeb
= kmem_cache_alloc(ai
->aeb_slab_cache
, GFP_KERNEL
);
575 aeb
->vol_id
= vol_id
;
577 aeb
->scrub
= bitflips
;
578 aeb
->copy_flag
= vid_hdr
->copy_flag
;
581 if (av
->highest_lnum
<= lnum
) {
582 av
->highest_lnum
= lnum
;
583 av
->last_data_size
= be32_to_cpu(vid_hdr
->data_size
);
587 rb_link_node(&aeb
->u
.rb
, parent
, p
);
588 rb_insert_color(&aeb
->u
.rb
, &av
->root
);
593 * ubi_find_av - find volume in the attaching information.
594 * @ai: attaching information
595 * @vol_id: the requested volume ID
597 * This function returns a pointer to the volume description or %NULL if there
598 * are no data about this volume in the attaching information.
600 struct ubi_ainf_volume
*ubi_find_av(const struct ubi_attach_info
*ai
,
603 struct ubi_ainf_volume
*av
;
604 struct rb_node
*p
= ai
->volumes
.rb_node
;
607 av
= rb_entry(p
, struct ubi_ainf_volume
, rb
);
609 if (vol_id
== av
->vol_id
)
612 if (vol_id
> av
->vol_id
)
622 * ubi_remove_av - delete attaching information about a volume.
623 * @ai: attaching information
624 * @av: the volume attaching information to delete
626 void ubi_remove_av(struct ubi_attach_info
*ai
, struct ubi_ainf_volume
*av
)
629 struct ubi_ainf_peb
*aeb
;
631 dbg_bld("remove attaching information about volume %d", av
->vol_id
);
633 while ((rb
= rb_first(&av
->root
))) {
634 aeb
= rb_entry(rb
, struct ubi_ainf_peb
, u
.rb
);
635 rb_erase(&aeb
->u
.rb
, &av
->root
);
636 list_add_tail(&aeb
->u
.list
, &ai
->erase
);
639 rb_erase(&av
->rb
, &ai
->volumes
);
645 * early_erase_peb - erase a physical eraseblock.
646 * @ubi: UBI device description object
647 * @ai: attaching information
648 * @pnum: physical eraseblock number to erase;
649 * @ec: erase counter value to write (%UBI_UNKNOWN if it is unknown)
651 * This function erases physical eraseblock 'pnum', and writes the erase
652 * counter header to it. This function should only be used on UBI device
653 * initialization stages, when the EBA sub-system had not been yet initialized.
654 * This function returns zero in case of success and a negative error code in
657 static int early_erase_peb(struct ubi_device
*ubi
,
658 const struct ubi_attach_info
*ai
, int pnum
, int ec
)
661 struct ubi_ec_hdr
*ec_hdr
;
663 if ((long long)ec
>= UBI_MAX_ERASECOUNTER
) {
665 * Erase counter overflow. Upgrade UBI and use 64-bit
666 * erase counters internally.
668 ubi_err("erase counter overflow at PEB %d, EC %d", pnum
, ec
);
672 ec_hdr
= kzalloc(ubi
->ec_hdr_alsize
, GFP_KERNEL
);
676 ec_hdr
->ec
= cpu_to_be64(ec
);
678 err
= ubi_io_sync_erase(ubi
, pnum
, 0);
682 err
= ubi_io_write_ec_hdr(ubi
, pnum
, ec_hdr
);
690 * ubi_early_get_peb - get a free physical eraseblock.
691 * @ubi: UBI device description object
692 * @ai: attaching information
694 * This function returns a free physical eraseblock. It is supposed to be
695 * called on the UBI initialization stages when the wear-leveling sub-system is
696 * not initialized yet. This function picks a physical eraseblocks from one of
697 * the lists, writes the EC header if it is needed, and removes it from the
700 * This function returns a pointer to the "aeb" of the found free PEB in case
701 * of success and an error code in case of failure.
703 struct ubi_ainf_peb
*ubi_early_get_peb(struct ubi_device
*ubi
,
704 struct ubi_attach_info
*ai
)
707 struct ubi_ainf_peb
*aeb
, *tmp_aeb
;
709 if (!list_empty(&ai
->free
)) {
710 aeb
= list_entry(ai
->free
.next
, struct ubi_ainf_peb
, u
.list
);
711 list_del(&aeb
->u
.list
);
712 dbg_bld("return free PEB %d, EC %d", aeb
->pnum
, aeb
->ec
);
717 * We try to erase the first physical eraseblock from the erase list
718 * and pick it if we succeed, or try to erase the next one if not. And
719 * so forth. We don't want to take care about bad eraseblocks here -
720 * they'll be handled later.
722 list_for_each_entry_safe(aeb
, tmp_aeb
, &ai
->erase
, u
.list
) {
723 if (aeb
->ec
== UBI_UNKNOWN
)
724 aeb
->ec
= ai
->mean_ec
;
726 err
= early_erase_peb(ubi
, ai
, aeb
->pnum
, aeb
->ec
+1);
731 list_del(&aeb
->u
.list
);
732 dbg_bld("return PEB %d, EC %d", aeb
->pnum
, aeb
->ec
);
736 ubi_err("no free eraseblocks");
737 return ERR_PTR(-ENOSPC
);
741 * check_corruption - check the data area of PEB.
742 * @ubi: UBI device description object
743 * @vid_hdr: the (corrupted) VID header of this PEB
744 * @pnum: the physical eraseblock number to check
746 * This is a helper function which is used to distinguish between VID header
747 * corruptions caused by power cuts and other reasons. If the PEB contains only
748 * 0xFF bytes in the data area, the VID header is most probably corrupted
749 * because of a power cut (%0 is returned in this case). Otherwise, it was
750 * probably corrupted for some other reasons (%1 is returned in this case). A
751 * negative error code is returned if a read error occurred.
753 * If the corruption reason was a power cut, UBI can safely erase this PEB.
754 * Otherwise, it should preserve it to avoid possibly destroying important
757 static int check_corruption(struct ubi_device
*ubi
, struct ubi_vid_hdr
*vid_hdr
,
762 mutex_lock(&ubi
->buf_mutex
);
763 memset(ubi
->peb_buf
, 0x00, ubi
->leb_size
);
765 err
= ubi_io_read(ubi
, ubi
->peb_buf
, pnum
, ubi
->leb_start
,
767 if (err
== UBI_IO_BITFLIPS
|| mtd_is_eccerr(err
)) {
769 * Bit-flips or integrity errors while reading the data area.
770 * It is difficult to say for sure what type of corruption is
771 * this, but presumably a power cut happened while this PEB was
772 * erased, so it became unstable and corrupted, and should be
782 if (ubi_check_pattern(ubi
->peb_buf
, 0xFF, ubi
->leb_size
))
785 ubi_err("PEB %d contains corrupted VID header, and the data does not contain all 0xFF",
787 ubi_err("this may be a non-UBI PEB or a severe VID header corruption which requires manual inspection");
788 ubi_dump_vid_hdr(vid_hdr
);
789 pr_err("hexdump of PEB %d offset %d, length %d",
790 pnum
, ubi
->leb_start
, ubi
->leb_size
);
791 ubi_dbg_print_hex_dump(KERN_DEBUG
, "", DUMP_PREFIX_OFFSET
, 32, 1,
792 ubi
->peb_buf
, ubi
->leb_size
, 1);
796 mutex_unlock(&ubi
->buf_mutex
);
801 * scan_peb - scan and process UBI headers of a PEB.
802 * @ubi: UBI device description object
803 * @ai: attaching information
804 * @pnum: the physical eraseblock number
805 * @vid: The volume ID of the found volume will be stored in this pointer
806 * @sqnum: The sqnum of the found volume will be stored in this pointer
808 * This function reads UBI headers of PEB @pnum, checks them, and adds
809 * information about this PEB to the corresponding list or RB-tree in the
810 * "attaching info" structure. Returns zero if the physical eraseblock was
811 * successfully handled and a negative error code in case of failure.
813 static int scan_peb(struct ubi_device
*ubi
, struct ubi_attach_info
*ai
,
814 int pnum
, int *vid
, unsigned long long *sqnum
)
816 long long uninitialized_var(ec
);
817 int err
, bitflips
= 0, vol_id
= -1, ec_err
= 0;
819 dbg_bld("scan PEB %d", pnum
);
821 /* Skip bad physical eraseblocks */
822 err
= ubi_io_is_bad(ubi
, pnum
);
826 ai
->bad_peb_count
+= 1;
830 err
= ubi_io_read_ec_hdr(ubi
, pnum
, ech
, 0);
836 case UBI_IO_BITFLIPS
:
840 ai
->empty_peb_count
+= 1;
841 return add_to_list(ai
, pnum
, UBI_UNKNOWN
, UBI_UNKNOWN
,
842 UBI_UNKNOWN
, 0, &ai
->erase
);
843 case UBI_IO_FF_BITFLIPS
:
844 ai
->empty_peb_count
+= 1;
845 return add_to_list(ai
, pnum
, UBI_UNKNOWN
, UBI_UNKNOWN
,
846 UBI_UNKNOWN
, 1, &ai
->erase
);
847 case UBI_IO_BAD_HDR_EBADMSG
:
850 * We have to also look at the VID header, possibly it is not
851 * corrupted. Set %bitflips flag in order to make this PEB be
852 * moved and EC be re-created.
859 ubi_err("'ubi_io_read_ec_hdr()' returned unknown code %d", err
);
866 /* Make sure UBI version is OK */
867 if (ech
->version
!= UBI_VERSION
) {
868 ubi_err("this UBI version is %d, image version is %d",
869 UBI_VERSION
, (int)ech
->version
);
873 ec
= be64_to_cpu(ech
->ec
);
874 if (ec
> UBI_MAX_ERASECOUNTER
) {
876 * Erase counter overflow. The EC headers have 64 bits
877 * reserved, but we anyway make use of only 31 bit
878 * values, as this seems to be enough for any existing
879 * flash. Upgrade UBI and use 64-bit erase counters
882 ubi_err("erase counter overflow, max is %d",
883 UBI_MAX_ERASECOUNTER
);
884 ubi_dump_ec_hdr(ech
);
889 * Make sure that all PEBs have the same image sequence number.
890 * This allows us to detect situations when users flash UBI
891 * images incorrectly, so that the flash has the new UBI image
892 * and leftovers from the old one. This feature was added
893 * relatively recently, and the sequence number was always
894 * zero, because old UBI implementations always set it to zero.
895 * For this reasons, we do not panic if some PEBs have zero
896 * sequence number, while other PEBs have non-zero sequence
899 image_seq
= be32_to_cpu(ech
->image_seq
);
901 ubi
->image_seq
= image_seq
;
902 if (image_seq
&& ubi
->image_seq
!= image_seq
) {
903 ubi_err("bad image sequence number %d in PEB %d, expected %d",
904 image_seq
, pnum
, ubi
->image_seq
);
905 ubi_dump_ec_hdr(ech
);
910 /* OK, we've done with the EC header, let's look at the VID header */
912 err
= ubi_io_read_vid_hdr(ubi
, pnum
, vidh
, 0);
918 case UBI_IO_BITFLIPS
:
921 case UBI_IO_BAD_HDR_EBADMSG
:
922 if (ec_err
== UBI_IO_BAD_HDR_EBADMSG
)
924 * Both EC and VID headers are corrupted and were read
925 * with data integrity error, probably this is a bad
926 * PEB, bit it is not marked as bad yet. This may also
927 * be a result of power cut during erasure.
929 ai
->maybe_bad_peb_count
+= 1;
933 * Both headers are corrupted. There is a possibility
934 * that this a valid UBI PEB which has corresponding
935 * LEB, but the headers are corrupted. However, it is
936 * impossible to distinguish it from a PEB which just
937 * contains garbage because of a power cut during erase
938 * operation. So we just schedule this PEB for erasure.
940 * Besides, in case of NOR flash, we deliberately
941 * corrupt both headers because NOR flash erasure is
942 * slow and can start from the end.
947 * The EC was OK, but the VID header is corrupted. We
948 * have to check what is in the data area.
950 err
= check_corruption(ubi
, vidh
, pnum
);
955 /* This corruption is caused by a power cut */
956 err
= add_to_list(ai
, pnum
, UBI_UNKNOWN
,
957 UBI_UNKNOWN
, ec
, 1, &ai
->erase
);
959 /* This is an unexpected corruption */
960 err
= add_corrupted(ai
, pnum
, ec
);
964 case UBI_IO_FF_BITFLIPS
:
965 err
= add_to_list(ai
, pnum
, UBI_UNKNOWN
, UBI_UNKNOWN
,
971 if (ec_err
|| bitflips
)
972 err
= add_to_list(ai
, pnum
, UBI_UNKNOWN
,
973 UBI_UNKNOWN
, ec
, 1, &ai
->erase
);
975 err
= add_to_list(ai
, pnum
, UBI_UNKNOWN
,
976 UBI_UNKNOWN
, ec
, 0, &ai
->free
);
981 ubi_err("'ubi_io_read_vid_hdr()' returned unknown code %d",
986 vol_id
= be32_to_cpu(vidh
->vol_id
);
990 *sqnum
= be64_to_cpu(vidh
->sqnum
);
991 if (vol_id
> UBI_MAX_VOLUMES
&& vol_id
!= UBI_LAYOUT_VOLUME_ID
) {
992 int lnum
= be32_to_cpu(vidh
->lnum
);
994 /* Unsupported internal volume */
995 switch (vidh
->compat
) {
996 case UBI_COMPAT_DELETE
:
997 if (vol_id
!= UBI_FM_SB_VOLUME_ID
998 && vol_id
!= UBI_FM_DATA_VOLUME_ID
) {
999 ubi_msg("\"delete\" compatible internal volume %d:%d found, will remove it",
1002 err
= add_to_list(ai
, pnum
, vol_id
, lnum
,
1009 ubi_msg("read-only compatible internal volume %d:%d found, switch to read-only mode",
1014 case UBI_COMPAT_PRESERVE
:
1015 ubi_msg("\"preserve\" compatible internal volume %d:%d found",
1017 err
= add_to_list(ai
, pnum
, vol_id
, lnum
,
1023 case UBI_COMPAT_REJECT
:
1024 ubi_err("incompatible internal volume %d:%d found",
1031 ubi_warn("valid VID header but corrupted EC header at PEB %d",
1033 err
= ubi_add_to_av(ubi
, ai
, pnum
, ec
, vidh
, bitflips
);
1041 if (ec
> ai
->max_ec
)
1043 if (ec
< ai
->min_ec
)
1051 * late_analysis - analyze the overall situation with PEB.
1052 * @ubi: UBI device description object
1053 * @ai: attaching information
1055 * This is a helper function which takes a look what PEBs we have after we
1056 * gather information about all of them ("ai" is compete). It decides whether
1057 * the flash is empty and should be formatted of whether there are too many
1058 * corrupted PEBs and we should not attach this MTD device. Returns zero if we
1059 * should proceed with attaching the MTD device, and %-EINVAL if we should not.
1061 static int late_analysis(struct ubi_device
*ubi
, struct ubi_attach_info
*ai
)
1063 struct ubi_ainf_peb
*aeb
;
1064 int max_corr
, peb_count
;
1066 peb_count
= ubi
->peb_count
- ai
->bad_peb_count
- ai
->alien_peb_count
;
1067 max_corr
= peb_count
/ 20 ?: 8;
1070 * Few corrupted PEBs is not a problem and may be just a result of
1071 * unclean reboots. However, many of them may indicate some problems
1072 * with the flash HW or driver.
1074 if (ai
->corr_peb_count
) {
1075 ubi_err("%d PEBs are corrupted and preserved",
1076 ai
->corr_peb_count
);
1077 pr_err("Corrupted PEBs are:");
1078 list_for_each_entry(aeb
, &ai
->corr
, u
.list
)
1079 pr_cont(" %d", aeb
->pnum
);
1083 * If too many PEBs are corrupted, we refuse attaching,
1084 * otherwise, only print a warning.
1086 if (ai
->corr_peb_count
>= max_corr
) {
1087 ubi_err("too many corrupted PEBs, refusing");
1092 if (ai
->empty_peb_count
+ ai
->maybe_bad_peb_count
== peb_count
) {
1094 * All PEBs are empty, or almost all - a couple PEBs look like
1095 * they may be bad PEBs which were not marked as bad yet.
1097 * This piece of code basically tries to distinguish between
1098 * the following situations:
1100 * 1. Flash is empty, but there are few bad PEBs, which are not
1101 * marked as bad so far, and which were read with error. We
1102 * want to go ahead and format this flash. While formatting,
1103 * the faulty PEBs will probably be marked as bad.
1105 * 2. Flash contains non-UBI data and we do not want to format
1106 * it and destroy possibly important information.
1108 if (ai
->maybe_bad_peb_count
<= 2) {
1110 ubi_msg("empty MTD device detected");
1111 get_random_bytes(&ubi
->image_seq
,
1112 sizeof(ubi
->image_seq
));
1114 ubi_err("MTD device is not UBI-formatted and possibly contains non-UBI data - refusing it");
1124 * destroy_av - free volume attaching information.
1125 * @av: volume attaching information
1126 * @ai: attaching information
1128 * This function destroys the volume attaching information.
1130 static void destroy_av(struct ubi_attach_info
*ai
, struct ubi_ainf_volume
*av
)
1132 struct ubi_ainf_peb
*aeb
;
1133 struct rb_node
*this = av
->root
.rb_node
;
1137 this = this->rb_left
;
1138 else if (this->rb_right
)
1139 this = this->rb_right
;
1141 aeb
= rb_entry(this, struct ubi_ainf_peb
, u
.rb
);
1142 this = rb_parent(this);
1144 if (this->rb_left
== &aeb
->u
.rb
)
1145 this->rb_left
= NULL
;
1147 this->rb_right
= NULL
;
1150 kmem_cache_free(ai
->aeb_slab_cache
, aeb
);
1157 * destroy_ai - destroy attaching information.
1158 * @ai: attaching information
1160 static void destroy_ai(struct ubi_attach_info
*ai
)
1162 struct ubi_ainf_peb
*aeb
, *aeb_tmp
;
1163 struct ubi_ainf_volume
*av
;
1166 list_for_each_entry_safe(aeb
, aeb_tmp
, &ai
->alien
, u
.list
) {
1167 list_del(&aeb
->u
.list
);
1168 kmem_cache_free(ai
->aeb_slab_cache
, aeb
);
1170 list_for_each_entry_safe(aeb
, aeb_tmp
, &ai
->erase
, u
.list
) {
1171 list_del(&aeb
->u
.list
);
1172 kmem_cache_free(ai
->aeb_slab_cache
, aeb
);
1174 list_for_each_entry_safe(aeb
, aeb_tmp
, &ai
->corr
, u
.list
) {
1175 list_del(&aeb
->u
.list
);
1176 kmem_cache_free(ai
->aeb_slab_cache
, aeb
);
1178 list_for_each_entry_safe(aeb
, aeb_tmp
, &ai
->free
, u
.list
) {
1179 list_del(&aeb
->u
.list
);
1180 kmem_cache_free(ai
->aeb_slab_cache
, aeb
);
1183 /* Destroy the volume RB-tree */
1184 rb
= ai
->volumes
.rb_node
;
1188 else if (rb
->rb_right
)
1191 av
= rb_entry(rb
, struct ubi_ainf_volume
, rb
);
1195 if (rb
->rb_left
== &av
->rb
)
1198 rb
->rb_right
= NULL
;
1205 if (ai
->aeb_slab_cache
)
1206 kmem_cache_destroy(ai
->aeb_slab_cache
);
1212 * scan_all - scan entire MTD device.
1213 * @ubi: UBI device description object
1214 * @ai: attach info object
1215 * @start: start scanning at this PEB
1217 * This function does full scanning of an MTD device and returns complete
1218 * information about it in form of a "struct ubi_attach_info" object. In case
1219 * of failure, an error code is returned.
1221 static int scan_all(struct ubi_device
*ubi
, struct ubi_attach_info
*ai
,
1225 struct rb_node
*rb1
, *rb2
;
1226 struct ubi_ainf_volume
*av
;
1227 struct ubi_ainf_peb
*aeb
;
1231 ech
= kzalloc(ubi
->ec_hdr_alsize
, GFP_KERNEL
);
1235 vidh
= ubi_zalloc_vid_hdr(ubi
, GFP_KERNEL
);
1239 for (pnum
= start
; pnum
< ubi
->peb_count
; pnum
++) {
1242 dbg_gen("process PEB %d", pnum
);
1243 err
= scan_peb(ubi
, ai
, pnum
, NULL
, NULL
);
1248 ubi_msg("scanning is finished");
1250 /* Calculate mean erase counter */
1252 ai
->mean_ec
= div_u64(ai
->ec_sum
, ai
->ec_count
);
1254 err
= late_analysis(ubi
, ai
);
1259 * In case of unknown erase counter we use the mean erase counter
1262 ubi_rb_for_each_entry(rb1
, av
, &ai
->volumes
, rb
) {
1263 ubi_rb_for_each_entry(rb2
, aeb
, &av
->root
, u
.rb
)
1264 if (aeb
->ec
== UBI_UNKNOWN
)
1265 aeb
->ec
= ai
->mean_ec
;
1268 list_for_each_entry(aeb
, &ai
->free
, u
.list
) {
1269 if (aeb
->ec
== UBI_UNKNOWN
)
1270 aeb
->ec
= ai
->mean_ec
;
1273 list_for_each_entry(aeb
, &ai
->corr
, u
.list
)
1274 if (aeb
->ec
== UBI_UNKNOWN
)
1275 aeb
->ec
= ai
->mean_ec
;
1277 list_for_each_entry(aeb
, &ai
->erase
, u
.list
)
1278 if (aeb
->ec
== UBI_UNKNOWN
)
1279 aeb
->ec
= ai
->mean_ec
;
1281 err
= self_check_ai(ubi
, ai
);
1285 ubi_free_vid_hdr(ubi
, vidh
);
1291 ubi_free_vid_hdr(ubi
, vidh
);
1297 #ifdef CONFIG_MTD_UBI_FASTMAP
1300 * scan_fastmap - try to find a fastmap and attach from it.
1301 * @ubi: UBI device description object
1302 * @ai: attach info object
1304 * Returns 0 on success, negative return values indicate an internal
1306 * UBI_NO_FASTMAP denotes that no fastmap was found.
1307 * UBI_BAD_FASTMAP denotes that the found fastmap was invalid.
1309 static int scan_fast(struct ubi_device
*ubi
, struct ubi_attach_info
*ai
)
1311 int err
, pnum
, fm_anchor
= -1;
1312 unsigned long long max_sqnum
= 0;
1316 ech
= kzalloc(ubi
->ec_hdr_alsize
, GFP_KERNEL
);
1320 vidh
= ubi_zalloc_vid_hdr(ubi
, GFP_KERNEL
);
1324 for (pnum
= 0; pnum
< UBI_FM_MAX_START
; pnum
++) {
1326 unsigned long long sqnum
= -1;
1329 dbg_gen("process PEB %d", pnum
);
1330 err
= scan_peb(ubi
, ai
, pnum
, &vol_id
, &sqnum
);
1334 if (vol_id
== UBI_FM_SB_VOLUME_ID
&& sqnum
> max_sqnum
) {
1340 ubi_free_vid_hdr(ubi
, vidh
);
1344 return UBI_NO_FASTMAP
;
1346 return ubi_scan_fastmap(ubi
, ai
, fm_anchor
);
1349 ubi_free_vid_hdr(ubi
, vidh
);
1358 static struct ubi_attach_info
*alloc_ai(const char *slab_name
)
1360 struct ubi_attach_info
*ai
;
1362 ai
= kzalloc(sizeof(struct ubi_attach_info
), GFP_KERNEL
);
1366 INIT_LIST_HEAD(&ai
->corr
);
1367 INIT_LIST_HEAD(&ai
->free
);
1368 INIT_LIST_HEAD(&ai
->erase
);
1369 INIT_LIST_HEAD(&ai
->alien
);
1370 ai
->volumes
= RB_ROOT
;
1371 ai
->aeb_slab_cache
= kmem_cache_create(slab_name
,
1372 sizeof(struct ubi_ainf_peb
),
1374 if (!ai
->aeb_slab_cache
) {
1383 * ubi_attach - attach an MTD device.
1384 * @ubi: UBI device descriptor
1385 * @force_scan: if set to non-zero attach by scanning
1387 * This function returns zero in case of success and a negative error code in
1390 int ubi_attach(struct ubi_device
*ubi
, int force_scan
)
1393 struct ubi_attach_info
*ai
;
1395 ai
= alloc_ai("ubi_aeb_slab_cache");
1399 #ifdef CONFIG_MTD_UBI_FASTMAP
1400 /* On small flash devices we disable fastmap in any case. */
1401 if ((int)mtd_div_by_eb(ubi
->mtd
->size
, ubi
->mtd
) <= UBI_FM_MAX_START
) {
1402 ubi
->fm_disabled
= 1;
1407 err
= scan_all(ubi
, ai
, 0);
1409 err
= scan_fast(ubi
, ai
);
1411 if (err
!= UBI_NO_FASTMAP
) {
1413 ai
= alloc_ai("ubi_aeb_slab_cache2");
1417 err
= scan_all(ubi
, ai
, 0);
1419 err
= scan_all(ubi
, ai
, UBI_FM_MAX_START
);
1424 err
= scan_all(ubi
, ai
, 0);
1429 ubi
->bad_peb_count
= ai
->bad_peb_count
;
1430 ubi
->good_peb_count
= ubi
->peb_count
- ubi
->bad_peb_count
;
1431 ubi
->corr_peb_count
= ai
->corr_peb_count
;
1432 ubi
->max_ec
= ai
->max_ec
;
1433 ubi
->mean_ec
= ai
->mean_ec
;
1434 dbg_gen("max. sequence number: %llu", ai
->max_sqnum
);
1436 err
= ubi_read_volume_table(ubi
, ai
);
1440 err
= ubi_wl_init(ubi
, ai
);
1444 err
= ubi_eba_init(ubi
, ai
);
1448 #ifdef CONFIG_MTD_UBI_FASTMAP
1449 if (ubi
->fm
&& ubi_dbg_chk_gen(ubi
)) {
1450 struct ubi_attach_info
*scan_ai
;
1452 scan_ai
= alloc_ai("ubi_ckh_aeb_slab_cache");
1458 err
= scan_all(ubi
, scan_ai
, 0);
1460 destroy_ai(scan_ai
);
1464 err
= self_check_eba(ubi
, ai
, scan_ai
);
1465 destroy_ai(scan_ai
);
1478 ubi_free_internal_volumes(ubi
);
1486 * self_check_ai - check the attaching information.
1487 * @ubi: UBI device description object
1488 * @ai: attaching information
1490 * This function returns zero if the attaching information is all right, and a
1491 * negative error code if not or if an error occurred.
1493 static int self_check_ai(struct ubi_device
*ubi
, struct ubi_attach_info
*ai
)
1495 int pnum
, err
, vols_found
= 0;
1496 struct rb_node
*rb1
, *rb2
;
1497 struct ubi_ainf_volume
*av
;
1498 struct ubi_ainf_peb
*aeb
, *last_aeb
;
1501 if (!ubi_dbg_chk_gen(ubi
))
1505 * At first, check that attaching information is OK.
1507 ubi_rb_for_each_entry(rb1
, av
, &ai
->volumes
, rb
) {
1515 ubi_err("bad is_empty flag");
1519 if (av
->vol_id
< 0 || av
->highest_lnum
< 0 ||
1520 av
->leb_count
< 0 || av
->vol_type
< 0 || av
->used_ebs
< 0 ||
1521 av
->data_pad
< 0 || av
->last_data_size
< 0) {
1522 ubi_err("negative values");
1526 if (av
->vol_id
>= UBI_MAX_VOLUMES
&&
1527 av
->vol_id
< UBI_INTERNAL_VOL_START
) {
1528 ubi_err("bad vol_id");
1532 if (av
->vol_id
> ai
->highest_vol_id
) {
1533 ubi_err("highest_vol_id is %d, but vol_id %d is there",
1534 ai
->highest_vol_id
, av
->vol_id
);
1538 if (av
->vol_type
!= UBI_DYNAMIC_VOLUME
&&
1539 av
->vol_type
!= UBI_STATIC_VOLUME
) {
1540 ubi_err("bad vol_type");
1544 if (av
->data_pad
> ubi
->leb_size
/ 2) {
1545 ubi_err("bad data_pad");
1550 ubi_rb_for_each_entry(rb2
, aeb
, &av
->root
, u
.rb
) {
1556 if (aeb
->pnum
< 0 || aeb
->ec
< 0) {
1557 ubi_err("negative values");
1561 if (aeb
->ec
< ai
->min_ec
) {
1562 ubi_err("bad ai->min_ec (%d), %d found",
1563 ai
->min_ec
, aeb
->ec
);
1567 if (aeb
->ec
> ai
->max_ec
) {
1568 ubi_err("bad ai->max_ec (%d), %d found",
1569 ai
->max_ec
, aeb
->ec
);
1573 if (aeb
->pnum
>= ubi
->peb_count
) {
1574 ubi_err("too high PEB number %d, total PEBs %d",
1575 aeb
->pnum
, ubi
->peb_count
);
1579 if (av
->vol_type
== UBI_STATIC_VOLUME
) {
1580 if (aeb
->lnum
>= av
->used_ebs
) {
1581 ubi_err("bad lnum or used_ebs");
1585 if (av
->used_ebs
!= 0) {
1586 ubi_err("non-zero used_ebs");
1591 if (aeb
->lnum
> av
->highest_lnum
) {
1592 ubi_err("incorrect highest_lnum or lnum");
1597 if (av
->leb_count
!= leb_count
) {
1598 ubi_err("bad leb_count, %d objects in the tree",
1608 if (aeb
->lnum
!= av
->highest_lnum
) {
1609 ubi_err("bad highest_lnum");
1614 if (vols_found
!= ai
->vols_found
) {
1615 ubi_err("bad ai->vols_found %d, should be %d",
1616 ai
->vols_found
, vols_found
);
1620 /* Check that attaching information is correct */
1621 ubi_rb_for_each_entry(rb1
, av
, &ai
->volumes
, rb
) {
1623 ubi_rb_for_each_entry(rb2
, aeb
, &av
->root
, u
.rb
) {
1630 err
= ubi_io_read_vid_hdr(ubi
, aeb
->pnum
, vidh
, 1);
1631 if (err
&& err
!= UBI_IO_BITFLIPS
) {
1632 ubi_err("VID header is not OK (%d)", err
);
1638 vol_type
= vidh
->vol_type
== UBI_VID_DYNAMIC
?
1639 UBI_DYNAMIC_VOLUME
: UBI_STATIC_VOLUME
;
1640 if (av
->vol_type
!= vol_type
) {
1641 ubi_err("bad vol_type");
1645 if (aeb
->sqnum
!= be64_to_cpu(vidh
->sqnum
)) {
1646 ubi_err("bad sqnum %llu", aeb
->sqnum
);
1650 if (av
->vol_id
!= be32_to_cpu(vidh
->vol_id
)) {
1651 ubi_err("bad vol_id %d", av
->vol_id
);
1655 if (av
->compat
!= vidh
->compat
) {
1656 ubi_err("bad compat %d", vidh
->compat
);
1660 if (aeb
->lnum
!= be32_to_cpu(vidh
->lnum
)) {
1661 ubi_err("bad lnum %d", aeb
->lnum
);
1665 if (av
->used_ebs
!= be32_to_cpu(vidh
->used_ebs
)) {
1666 ubi_err("bad used_ebs %d", av
->used_ebs
);
1670 if (av
->data_pad
!= be32_to_cpu(vidh
->data_pad
)) {
1671 ubi_err("bad data_pad %d", av
->data_pad
);
1679 if (av
->highest_lnum
!= be32_to_cpu(vidh
->lnum
)) {
1680 ubi_err("bad highest_lnum %d", av
->highest_lnum
);
1684 if (av
->last_data_size
!= be32_to_cpu(vidh
->data_size
)) {
1685 ubi_err("bad last_data_size %d", av
->last_data_size
);
1691 * Make sure that all the physical eraseblocks are in one of the lists
1694 buf
= kzalloc(ubi
->peb_count
, GFP_KERNEL
);
1698 for (pnum
= 0; pnum
< ubi
->peb_count
; pnum
++) {
1699 err
= ubi_io_is_bad(ubi
, pnum
);
1707 ubi_rb_for_each_entry(rb1
, av
, &ai
->volumes
, rb
)
1708 ubi_rb_for_each_entry(rb2
, aeb
, &av
->root
, u
.rb
)
1711 list_for_each_entry(aeb
, &ai
->free
, u
.list
)
1714 list_for_each_entry(aeb
, &ai
->corr
, u
.list
)
1717 list_for_each_entry(aeb
, &ai
->erase
, u
.list
)
1720 list_for_each_entry(aeb
, &ai
->alien
, u
.list
)
1724 for (pnum
= 0; pnum
< ubi
->peb_count
; pnum
++)
1726 ubi_err("PEB %d is not referred", pnum
);
1736 ubi_err("bad attaching information about LEB %d", aeb
->lnum
);
1737 ubi_dump_aeb(aeb
, 0);
1742 ubi_err("bad attaching information about volume %d", av
->vol_id
);
1747 ubi_err("bad attaching information about volume %d", av
->vol_id
);
1749 ubi_dump_vid_hdr(vidh
);