blob: da132155c796ecbdd713f36d8af3fb68901984a6 [file] [log] [blame]
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001/*
2 * Copyright (c) International Business Machines Corp., 2006
3 *
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.
8 *
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.
13 *
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
17 *
18 * Author: Artem Bityutskiy (Битюцкий Артём)
19 */
20
21/*
Artem Bityutskiyfbd01072012-05-17 16:12:26 +030022 * UBI attaching sub-system.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +040023 *
Artem Bityutskiyfbd01072012-05-17 16:12:26 +030024 * This sub-system is responsible for attaching MTD devices and it also
25 * implements flash media scanning.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +040026 *
Artem Bityutskiya4e60422012-05-17 13:09:08 +030027 * The attaching information is represented by a &struct ubi_attach_info'
Artem Bityutskiyfbd01072012-05-17 16:12:26 +030028 * 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.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +040031 *
Artem Bityutskiyfbd01072012-05-17 16:12:26 +030032 * 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
36 * per-LEB objects.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +040037 *
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.
Artem Bityutskiy0525dac2010-09-03 17:11:37 +030041 *
Artem Bityutskiyfef2deb2010-10-29 08:34:50 +030042 * About corruptions
43 * ~~~~~~~~~~~~~~~~~
44 *
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.
49 *
Artem Bityutskiy0525dac2010-09-03 17:11:37 +030050 * UBI tries to distinguish between 2 types of corruptions.
Artem Bityutskiyfef2deb2010-10-29 08:34:50 +030051 *
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
Artem Bityutskiyfbd01072012-05-17 16:12:26 +030054 * 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).
Artem Bityutskiyfef2deb2010-10-29 08:34:50 +030058 *
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.
Artem Bityutskiy0525dac2010-09-03 17:11:37 +030062 *
63 * 2. Unexpected corruptions which are not caused by power cuts. During
Artem Bityutskiyfbd01072012-05-17 16:12:26 +030064 * attaching, such PEBs are put to the @corr list and UBI preserves them.
Artem Bityutskiyfef2deb2010-10-29 08:34:50 +030065 * 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.
Artem Bityutskiy45aafd32010-10-20 11:54:58 +030068 *
69 * However, it is difficult to reliably distinguish between these types of
Artem Bityutskiyfbd01072012-05-17 16:12:26 +030070 * 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
75 * are as follows.
76 * o If the data area contains only 0xFFs, there are no data, and it is safe
Artem Bityutskiyfef2deb2010-10-29 08:34:50 +030077 * 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
Artem Bityutskiy45aafd32010-10-20 11:54:58 +030079 * NAND), it is probably a PEB which was being erased when power cut
Artem Bityutskiyfef2deb2010-10-29 08:34:50 +030080 * happened, so this is corruption type 1. However, this is just a guess,
81 * which might be wrong.
82 * o Otherwise this it corruption type 2.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +040083 */
84
85#include <linux/err.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090086#include <linux/slab.h>
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +040087#include <linux/crc32.h>
Artem Bityutskiy3013ee32009-01-16 19:08:43 +020088#include <linux/math64.h>
Matthieu CASTET095751a2010-06-03 16:14:27 +020089#include <linux/random.h>
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +040090#include "ubi.h"
91
Artem Bityutskiya4e60422012-05-17 13:09:08 +030092static int self_check_ai(struct ubi_device *ubi, struct ubi_attach_info *ai);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +040093
94/* Temporary variables used during scanning */
95static struct ubi_ec_hdr *ech;
96static struct ubi_vid_hdr *vidh;
97
Artem Bityutskiy941dfb02007-05-05 16:33:13 +030098/**
Artem Bityutskiy78d87c92007-05-05 11:24:02 +030099 * add_to_list - add physical eraseblock to a list.
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300100 * @ai: attaching information
Artem Bityutskiy78d87c92007-05-05 11:24:02 +0300101 * @pnum: physical eraseblock number to add
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200102 * @vol_id: the last used volume id for the PEB
103 * @lnum: the last used LEB number for the PEB
Artem Bityutskiy78d87c92007-05-05 11:24:02 +0300104 * @ec: erase counter of the physical eraseblock
Artem Bityutskiy0525dac2010-09-03 17:11:37 +0300105 * @to_head: if not zero, add to the head of the list
Artem Bityutskiy78d87c92007-05-05 11:24:02 +0300106 * @list: the list to add to
107 *
Artem Bityutskiyfbd01072012-05-17 16:12:26 +0300108 * This function allocates a 'struct ubi_ainf_peb' object for physical
109 * eraseblock @pnum and adds it to the "free", "erase", or "alien" lists.
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200110 * 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.
Artem Bityutskiy0525dac2010-09-03 17:11:37 +0300112 * 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
Artem Bityutskiy3fb34122010-09-03 15:36:12 +0300117 * failure.
Artem Bityutskiy78d87c92007-05-05 11:24:02 +0300118 */
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200119static 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)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400121{
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300122 struct ubi_ainf_peb *aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400123
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300124 if (list == &ai->free) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400125 dbg_bld("add to free: PEB %d, EC %d", pnum, ec);
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300126 } else if (list == &ai->erase) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400127 dbg_bld("add to erase: PEB %d, EC %d", pnum, ec);
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300128 } else if (list == &ai->alien) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400129 dbg_bld("add to alien: PEB %d, EC %d", pnum, ec);
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300130 ai->alien_peb_count += 1;
Artem Bityutskiy33789fb2010-04-30 12:31:26 +0300131 } else
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400132 BUG();
133
Artem Bityutskiy1fc2e3e2012-05-17 15:56:03 +0300134 aeb = kmem_cache_alloc(ai->aeb_slab_cache, GFP_KERNEL);
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300135 if (!aeb)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400136 return -ENOMEM;
137
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300138 aeb->pnum = pnum;
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200139 aeb->vol_id = vol_id;
140 aeb->lnum = lnum;
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300141 aeb->ec = ec;
Artem Bityutskiy0525dac2010-09-03 17:11:37 +0300142 if (to_head)
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300143 list_add(&aeb->u.list, list);
Artem Bityutskiy0525dac2010-09-03 17:11:37 +0300144 else
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300145 list_add_tail(&aeb->u.list, list);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400146 return 0;
147}
148
149/**
Artem Bityutskiy3fb34122010-09-03 15:36:12 +0300150 * add_corrupted - add a corrupted physical eraseblock.
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300151 * @ai: attaching information
Artem Bityutskiy3fb34122010-09-03 15:36:12 +0300152 * @pnum: physical eraseblock number to add
153 * @ec: erase counter of the physical eraseblock
154 *
Artem Bityutskiyfbd01072012-05-17 16:12:26 +0300155 * 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.
Artem Bityutskiy3fb34122010-09-03 15:36:12 +0300159 */
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300160static int add_corrupted(struct ubi_attach_info *ai, int pnum, int ec)
Artem Bityutskiy3fb34122010-09-03 15:36:12 +0300161{
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300162 struct ubi_ainf_peb *aeb;
Artem Bityutskiy3fb34122010-09-03 15:36:12 +0300163
164 dbg_bld("add to corrupted: PEB %d, EC %d", pnum, ec);
165
Artem Bityutskiy1fc2e3e2012-05-17 15:56:03 +0300166 aeb = kmem_cache_alloc(ai->aeb_slab_cache, GFP_KERNEL);
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300167 if (!aeb)
Artem Bityutskiy3fb34122010-09-03 15:36:12 +0300168 return -ENOMEM;
169
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300170 ai->corr_peb_count += 1;
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300171 aeb->pnum = pnum;
172 aeb->ec = ec;
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300173 list_add(&aeb->u.list, &ai->corr);
Artem Bityutskiy3fb34122010-09-03 15:36:12 +0300174 return 0;
175}
176
177/**
Artem Bityutskiyebaaf1a2008-07-18 13:34:32 +0300178 * validate_vid_hdr - check volume identifier header.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400179 * @vid_hdr: the volume identifier header to check
Artem Bityutskiy517af482012-05-17 14:38:34 +0300180 * @av: information about the volume this logical eraseblock belongs to
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400181 * @pnum: physical eraseblock number the VID header came from
182 *
183 * This function checks that data stored in @vid_hdr is consistent. Returns
184 * non-zero if an inconsistency was found and zero if not.
185 *
186 * Note, UBI does sanity check of everything it reads from the flash media.
Artem Bityutskiy85c6e6e2008-07-16 10:25:56 +0300187 * Most of the checks are done in the I/O sub-system. Here we check that the
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400188 * information in the VID header is consistent to the information in other VID
189 * headers of the same volume.
190 */
191static int validate_vid_hdr(const struct ubi_vid_hdr *vid_hdr,
Artem Bityutskiy517af482012-05-17 14:38:34 +0300192 const struct ubi_ainf_volume *av, int pnum)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400193{
194 int vol_type = vid_hdr->vol_type;
Christoph Hellwig3261ebd2007-05-21 17:41:46 +0300195 int vol_id = be32_to_cpu(vid_hdr->vol_id);
196 int used_ebs = be32_to_cpu(vid_hdr->used_ebs);
197 int data_pad = be32_to_cpu(vid_hdr->data_pad);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400198
Artem Bityutskiy517af482012-05-17 14:38:34 +0300199 if (av->leb_count != 0) {
200 int av_vol_type;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400201
202 /*
203 * This is not the first logical eraseblock belonging to this
204 * volume. Ensure that the data in its VID header is consistent
205 * to the data in previous logical eraseblock headers.
206 */
207
Artem Bityutskiy517af482012-05-17 14:38:34 +0300208 if (vol_id != av->vol_id) {
Artem Bityutskiye2986822012-05-16 18:39:56 +0300209 ubi_err("inconsistent vol_id");
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400210 goto bad;
211 }
212
Artem Bityutskiy517af482012-05-17 14:38:34 +0300213 if (av->vol_type == UBI_STATIC_VOLUME)
214 av_vol_type = UBI_VID_STATIC;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400215 else
Artem Bityutskiy517af482012-05-17 14:38:34 +0300216 av_vol_type = UBI_VID_DYNAMIC;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400217
Artem Bityutskiy517af482012-05-17 14:38:34 +0300218 if (vol_type != av_vol_type) {
Artem Bityutskiye2986822012-05-16 18:39:56 +0300219 ubi_err("inconsistent vol_type");
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400220 goto bad;
221 }
222
Artem Bityutskiy517af482012-05-17 14:38:34 +0300223 if (used_ebs != av->used_ebs) {
Artem Bityutskiye2986822012-05-16 18:39:56 +0300224 ubi_err("inconsistent used_ebs");
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400225 goto bad;
226 }
227
Artem Bityutskiy517af482012-05-17 14:38:34 +0300228 if (data_pad != av->data_pad) {
Artem Bityutskiye2986822012-05-16 18:39:56 +0300229 ubi_err("inconsistent data_pad");
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400230 goto bad;
231 }
232 }
233
234 return 0;
235
236bad:
237 ubi_err("inconsistent VID header at PEB %d", pnum);
Artem Bityutskiya904e3f2012-04-25 09:02:44 +0300238 ubi_dump_vid_hdr(vid_hdr);
Artem Bityutskiy517af482012-05-17 14:38:34 +0300239 ubi_dump_av(av);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400240 return -EINVAL;
241}
242
243/**
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300244 * add_volume - add volume to the attaching information.
245 * @ai: attaching information
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400246 * @vol_id: ID of the volume to add
247 * @pnum: physical eraseblock number
248 * @vid_hdr: volume identifier header
249 *
250 * If the volume corresponding to the @vid_hdr logical eraseblock is already
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300251 * present in the attaching information, this function does nothing. Otherwise
252 * it adds corresponding volume to the attaching information. Returns a pointer
Artem Bityutskiyfbd01072012-05-17 16:12:26 +0300253 * to the allocated "av" object in case of success and a negative error code in
254 * case of failure.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400255 */
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300256static struct ubi_ainf_volume *add_volume(struct ubi_attach_info *ai,
Artem Bityutskiyafc15a82012-05-17 07:46:17 +0300257 int vol_id, int pnum,
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400258 const struct ubi_vid_hdr *vid_hdr)
259{
Artem Bityutskiy517af482012-05-17 14:38:34 +0300260 struct ubi_ainf_volume *av;
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300261 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400262
Christoph Hellwig3261ebd2007-05-21 17:41:46 +0300263 ubi_assert(vol_id == be32_to_cpu(vid_hdr->vol_id));
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400264
265 /* Walk the volume RB-tree to look if this volume is already present */
266 while (*p) {
267 parent = *p;
Artem Bityutskiy517af482012-05-17 14:38:34 +0300268 av = rb_entry(parent, struct ubi_ainf_volume, rb);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400269
Artem Bityutskiy517af482012-05-17 14:38:34 +0300270 if (vol_id == av->vol_id)
271 return av;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400272
Artem Bityutskiy517af482012-05-17 14:38:34 +0300273 if (vol_id > av->vol_id)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400274 p = &(*p)->rb_left;
275 else
276 p = &(*p)->rb_right;
277 }
278
279 /* The volume is absent - add it */
Artem Bityutskiy517af482012-05-17 14:38:34 +0300280 av = kmalloc(sizeof(struct ubi_ainf_volume), GFP_KERNEL);
281 if (!av)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400282 return ERR_PTR(-ENOMEM);
283
Artem Bityutskiy517af482012-05-17 14:38:34 +0300284 av->highest_lnum = av->leb_count = 0;
285 av->vol_id = vol_id;
286 av->root = RB_ROOT;
287 av->used_ebs = be32_to_cpu(vid_hdr->used_ebs);
288 av->data_pad = be32_to_cpu(vid_hdr->data_pad);
289 av->compat = vid_hdr->compat;
290 av->vol_type = vid_hdr->vol_type == UBI_VID_DYNAMIC ? UBI_DYNAMIC_VOLUME
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400291 : UBI_STATIC_VOLUME;
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300292 if (vol_id > ai->highest_vol_id)
293 ai->highest_vol_id = vol_id;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400294
Artem Bityutskiy517af482012-05-17 14:38:34 +0300295 rb_link_node(&av->rb, parent, p);
296 rb_insert_color(&av->rb, &ai->volumes);
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300297 ai->vols_found += 1;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400298 dbg_bld("added volume %d", vol_id);
Artem Bityutskiy517af482012-05-17 14:38:34 +0300299 return av;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400300}
301
302/**
303 * compare_lebs - find out which logical eraseblock is newer.
304 * @ubi: UBI device description object
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300305 * @aeb: first logical eraseblock to compare
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400306 * @pnum: physical eraseblock number of the second logical eraseblock to
307 * compare
308 * @vid_hdr: volume identifier header of the second logical eraseblock
309 *
310 * This function compares 2 copies of a LEB and informs which one is newer. In
311 * case of success this function returns a positive value, in case of failure, a
312 * negative error code is returned. The success return codes use the following
313 * bits:
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300314 * o bit 0 is cleared: the first PEB (described by @aeb) is newer than the
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400315 * second PEB (described by @pnum and @vid_hdr);
316 * o bit 0 is set: the second PEB is newer;
317 * o bit 1 is cleared: no bit-flips were detected in the newer LEB;
318 * o bit 1 is set: bit-flips were detected in the newer LEB;
319 * o bit 2 is cleared: the older LEB is not corrupted;
320 * o bit 2 is set: the older LEB is corrupted.
321 */
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300322static int compare_lebs(struct ubi_device *ubi, const struct ubi_ainf_peb *aeb,
Artem Bityutskiye88d6e102007-08-29 14:51:52 +0300323 int pnum, const struct ubi_vid_hdr *vid_hdr)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400324{
325 void *buf;
326 int len, err, second_is_newer, bitflips = 0, corrupted = 0;
327 uint32_t data_crc, crc;
Artem Bityutskiy8bc22962007-07-22 15:25:02 +0300328 struct ubi_vid_hdr *vh = NULL;
Christoph Hellwig3261ebd2007-05-21 17:41:46 +0300329 unsigned long long sqnum2 = be64_to_cpu(vid_hdr->sqnum);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400330
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300331 if (sqnum2 == aeb->sqnum) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400332 /*
Artem Bityutskiy9869cd82008-07-18 13:53:39 +0300333 * This must be a really ancient UBI image which has been
334 * created before sequence numbers support has been added. At
335 * that times we used 32-bit LEB versions stored in logical
336 * eraseblocks. That was before UBI got into mainline. We do not
Artem Bityutskiy0525dac2010-09-03 17:11:37 +0300337 * support these images anymore. Well, those images still work,
338 * but only if no unclean reboots happened.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400339 */
Artem Bityutskiy9869cd82008-07-18 13:53:39 +0300340 ubi_err("unsupported on-flash UBI format\n");
341 return -EINVAL;
342 }
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400343
Artem Bityutskiy9869cd82008-07-18 13:53:39 +0300344 /* Obviously the LEB with lower sequence counter is older */
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300345 second_is_newer = (sqnum2 > aeb->sqnum);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400346
347 /*
348 * Now we know which copy is newer. If the copy flag of the PEB with
349 * newer version is not set, then we just return, otherwise we have to
350 * check data CRC. For the second PEB we already have the VID header,
351 * for the first one - we'll need to re-read it from flash.
352 *
Artem Bityutskiy9869cd82008-07-18 13:53:39 +0300353 * Note: this may be optimized so that we wouldn't read twice.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400354 */
355
356 if (second_is_newer) {
357 if (!vid_hdr->copy_flag) {
358 /* It is not a copy, so it is newer */
359 dbg_bld("second PEB %d is newer, copy_flag is unset",
360 pnum);
361 return 1;
362 }
363 } else {
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300364 if (!aeb->copy_flag) {
Artem Bityutskiyfb22b592010-10-19 22:00:11 +0300365 /* It is not a copy, so it is newer */
366 dbg_bld("first PEB %d is newer, copy_flag is unset",
367 pnum);
368 return bitflips << 1;
369 }
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400370
Artem Bityutskiy33818bb2007-08-28 21:29:32 +0300371 vh = ubi_zalloc_vid_hdr(ubi, GFP_KERNEL);
Artem Bityutskiy8bc22962007-07-22 15:25:02 +0300372 if (!vh)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400373 return -ENOMEM;
374
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300375 pnum = aeb->pnum;
Artem Bityutskiy8bc22962007-07-22 15:25:02 +0300376 err = ubi_io_read_vid_hdr(ubi, pnum, vh, 0);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400377 if (err) {
378 if (err == UBI_IO_BITFLIPS)
379 bitflips = 1;
380 else {
Artem Bityutskiy049333c2012-08-27 14:43:54 +0300381 ubi_err("VID of PEB %d header is bad, but it was OK earlier, err %d",
382 pnum, err);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400383 if (err > 0)
384 err = -EIO;
385
386 goto out_free_vidh;
387 }
388 }
389
Artem Bityutskiy8bc22962007-07-22 15:25:02 +0300390 vid_hdr = vh;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400391 }
392
393 /* Read the data of the copy and check the CRC */
394
Christoph Hellwig3261ebd2007-05-21 17:41:46 +0300395 len = be32_to_cpu(vid_hdr->data_size);
Artem Bityutskiy92ad8f32007-05-06 16:12:54 +0300396 buf = vmalloc(len);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400397 if (!buf) {
398 err = -ENOMEM;
399 goto out_free_vidh;
400 }
401
402 err = ubi_io_read_data(ubi, buf, pnum, 0, len);
Brian Norrisd57f40542011-09-20 18:34:25 -0700403 if (err && err != UBI_IO_BITFLIPS && !mtd_is_eccerr(err))
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400404 goto out_free_buf;
405
Christoph Hellwig3261ebd2007-05-21 17:41:46 +0300406 data_crc = be32_to_cpu(vid_hdr->data_crc);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400407 crc = crc32(UBI_CRC32_INIT, buf, len);
408 if (crc != data_crc) {
409 dbg_bld("PEB %d CRC error: calculated %#08x, must be %#08x",
410 pnum, crc, data_crc);
411 corrupted = 1;
412 bitflips = 0;
413 second_is_newer = !second_is_newer;
414 } else {
415 dbg_bld("PEB %d CRC is OK", pnum);
416 bitflips = !!err;
417 }
418
Artem Bityutskiy92ad8f32007-05-06 16:12:54 +0300419 vfree(buf);
Artem Bityutskiy8bc22962007-07-22 15:25:02 +0300420 ubi_free_vid_hdr(ubi, vh);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400421
422 if (second_is_newer)
423 dbg_bld("second PEB %d is newer, copy_flag is set", pnum);
424 else
425 dbg_bld("first PEB %d is newer, copy_flag is set", pnum);
426
427 return second_is_newer | (bitflips << 1) | (corrupted << 2);
428
429out_free_buf:
Artem Bityutskiy92ad8f32007-05-06 16:12:54 +0300430 vfree(buf);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400431out_free_vidh:
Artem Bityutskiy8bc22962007-07-22 15:25:02 +0300432 ubi_free_vid_hdr(ubi, vh);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400433 return err;
434}
435
436/**
Artem Bityutskiyfbd01072012-05-17 16:12:26 +0300437 * ubi_add_to_av - add used physical eraseblock to the attaching information.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400438 * @ubi: UBI device description object
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300439 * @ai: attaching information
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400440 * @pnum: the physical eraseblock number
441 * @ec: erase counter
442 * @vid_hdr: the volume identifier header
443 * @bitflips: if bit-flips were detected when this physical eraseblock was read
444 *
Artem Bityutskiy79b510c2007-05-05 17:36:17 +0300445 * This function adds information about a used physical eraseblock to the
446 * 'used' tree of the corresponding volume. The function is rather complex
447 * because it has to handle cases when this is not the first physical
448 * eraseblock belonging to the same logical eraseblock, and the newer one has
449 * to be picked, while the older one has to be dropped. This function returns
450 * zero in case of success and a negative error code in case of failure.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400451 */
Artem Bityutskiy35611882012-05-17 15:31:31 +0300452int ubi_add_to_av(struct ubi_device *ubi, struct ubi_attach_info *ai, int pnum,
453 int ec, const struct ubi_vid_hdr *vid_hdr, int bitflips)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400454{
455 int err, vol_id, lnum;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400456 unsigned long long sqnum;
Artem Bityutskiy517af482012-05-17 14:38:34 +0300457 struct ubi_ainf_volume *av;
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300458 struct ubi_ainf_peb *aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400459 struct rb_node **p, *parent = NULL;
460
Christoph Hellwig3261ebd2007-05-21 17:41:46 +0300461 vol_id = be32_to_cpu(vid_hdr->vol_id);
462 lnum = be32_to_cpu(vid_hdr->lnum);
463 sqnum = be64_to_cpu(vid_hdr->sqnum);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400464
Artem Bityutskiy9869cd82008-07-18 13:53:39 +0300465 dbg_bld("PEB %d, LEB %d:%d, EC %d, sqnum %llu, bitflips %d",
466 pnum, vol_id, lnum, ec, sqnum, bitflips);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400467
Artem Bityutskiy517af482012-05-17 14:38:34 +0300468 av = add_volume(ai, vol_id, pnum, vid_hdr);
469 if (IS_ERR(av))
470 return PTR_ERR(av);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400471
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300472 if (ai->max_sqnum < sqnum)
473 ai->max_sqnum = sqnum;
Brijesh Singh76eafe42007-07-06 14:35:43 +0300474
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400475 /*
476 * Walk the RB-tree of logical eraseblocks of volume @vol_id to look
477 * if this is the first instance of this logical eraseblock or not.
478 */
Artem Bityutskiy517af482012-05-17 14:38:34 +0300479 p = &av->root.rb_node;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400480 while (*p) {
481 int cmp_res;
482
483 parent = *p;
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300484 aeb = rb_entry(parent, struct ubi_ainf_peb, u.rb);
485 if (lnum != aeb->lnum) {
486 if (lnum < aeb->lnum)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400487 p = &(*p)->rb_left;
488 else
489 p = &(*p)->rb_right;
490 continue;
491 }
492
493 /*
494 * There is already a physical eraseblock describing the same
495 * logical eraseblock present.
496 */
497
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300498 dbg_bld("this LEB already exists: PEB %d, sqnum %llu, EC %d",
499 aeb->pnum, aeb->sqnum, aeb->ec);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400500
501 /*
502 * Make sure that the logical eraseblocks have different
503 * sequence numbers. Otherwise the image is bad.
504 *
Artem Bityutskiy9869cd82008-07-18 13:53:39 +0300505 * However, if the sequence number is zero, we assume it must
506 * be an ancient UBI image from the era when UBI did not have
507 * sequence numbers. We still can attach these images, unless
508 * there is a need to distinguish between old and new
509 * eraseblocks, in which case we'll refuse the image in
510 * 'compare_lebs()'. In other words, we attach old clean
511 * images, but refuse attaching old images with duplicated
512 * logical eraseblocks because there was an unclean reboot.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400513 */
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300514 if (aeb->sqnum == sqnum && sqnum != 0) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400515 ubi_err("two LEBs with same sequence number %llu",
516 sqnum);
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300517 ubi_dump_aeb(aeb, 0);
Artem Bityutskiya904e3f2012-04-25 09:02:44 +0300518 ubi_dump_vid_hdr(vid_hdr);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400519 return -EINVAL;
520 }
521
522 /*
523 * Now we have to drop the older one and preserve the newer
524 * one.
525 */
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300526 cmp_res = compare_lebs(ubi, aeb, pnum, vid_hdr);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400527 if (cmp_res < 0)
528 return cmp_res;
529
530 if (cmp_res & 1) {
531 /*
Shinya Kuribayashi3f502622010-05-06 19:21:47 +0900532 * This logical eraseblock is newer than the one
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400533 * found earlier.
534 */
Artem Bityutskiy517af482012-05-17 14:38:34 +0300535 err = validate_vid_hdr(vid_hdr, av, pnum);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400536 if (err)
537 return err;
538
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200539 err = add_to_list(ai, aeb->pnum, aeb->vol_id,
540 aeb->lnum, aeb->ec, cmp_res & 4,
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300541 &ai->erase);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400542 if (err)
543 return err;
544
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300545 aeb->ec = ec;
546 aeb->pnum = pnum;
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200547 aeb->vol_id = vol_id;
548 aeb->lnum = lnum;
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300549 aeb->scrub = ((cmp_res & 2) || bitflips);
550 aeb->copy_flag = vid_hdr->copy_flag;
551 aeb->sqnum = sqnum;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400552
Artem Bityutskiy517af482012-05-17 14:38:34 +0300553 if (av->highest_lnum == lnum)
554 av->last_data_size =
Christoph Hellwig3261ebd2007-05-21 17:41:46 +0300555 be32_to_cpu(vid_hdr->data_size);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400556
557 return 0;
558 } else {
559 /*
Frederik Schwarzer025dfda2008-10-16 19:02:37 +0200560 * This logical eraseblock is older than the one found
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400561 * previously.
562 */
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200563 return add_to_list(ai, pnum, vol_id, lnum, ec,
564 cmp_res & 4, &ai->erase);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400565 }
566 }
567
568 /*
569 * We've met this logical eraseblock for the first time, add it to the
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300570 * attaching information.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400571 */
572
Artem Bityutskiy517af482012-05-17 14:38:34 +0300573 err = validate_vid_hdr(vid_hdr, av, pnum);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400574 if (err)
575 return err;
576
Artem Bityutskiy1fc2e3e2012-05-17 15:56:03 +0300577 aeb = kmem_cache_alloc(ai->aeb_slab_cache, GFP_KERNEL);
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300578 if (!aeb)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400579 return -ENOMEM;
580
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300581 aeb->ec = ec;
582 aeb->pnum = pnum;
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200583 aeb->vol_id = vol_id;
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300584 aeb->lnum = lnum;
585 aeb->scrub = bitflips;
586 aeb->copy_flag = vid_hdr->copy_flag;
587 aeb->sqnum = sqnum;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400588
Artem Bityutskiy517af482012-05-17 14:38:34 +0300589 if (av->highest_lnum <= lnum) {
590 av->highest_lnum = lnum;
591 av->last_data_size = be32_to_cpu(vid_hdr->data_size);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400592 }
593
Artem Bityutskiy517af482012-05-17 14:38:34 +0300594 av->leb_count += 1;
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300595 rb_link_node(&aeb->u.rb, parent, p);
Artem Bityutskiy517af482012-05-17 14:38:34 +0300596 rb_insert_color(&aeb->u.rb, &av->root);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400597 return 0;
598}
599
600/**
Artem Bityutskiydcd85fd2012-05-17 15:33:20 +0300601 * ubi_find_av - find volume in the attaching information.
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300602 * @ai: attaching information
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400603 * @vol_id: the requested volume ID
604 *
605 * This function returns a pointer to the volume description or %NULL if there
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300606 * are no data about this volume in the attaching information.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400607 */
Artem Bityutskiydcd85fd2012-05-17 15:33:20 +0300608struct ubi_ainf_volume *ubi_find_av(const struct ubi_attach_info *ai,
609 int vol_id)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400610{
Artem Bityutskiy517af482012-05-17 14:38:34 +0300611 struct ubi_ainf_volume *av;
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300612 struct rb_node *p = ai->volumes.rb_node;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400613
614 while (p) {
Artem Bityutskiy517af482012-05-17 14:38:34 +0300615 av = rb_entry(p, struct ubi_ainf_volume, rb);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400616
Artem Bityutskiy517af482012-05-17 14:38:34 +0300617 if (vol_id == av->vol_id)
618 return av;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400619
Artem Bityutskiy517af482012-05-17 14:38:34 +0300620 if (vol_id > av->vol_id)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400621 p = p->rb_left;
622 else
623 p = p->rb_right;
624 }
625
626 return NULL;
627}
628
629/**
Artem Bityutskiyd717dc22012-05-17 15:36:39 +0300630 * ubi_remove_av - delete attaching information about a volume.
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300631 * @ai: attaching information
Artem Bityutskiy517af482012-05-17 14:38:34 +0300632 * @av: the volume attaching information to delete
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400633 */
Artem Bityutskiyd717dc22012-05-17 15:36:39 +0300634void ubi_remove_av(struct ubi_attach_info *ai, struct ubi_ainf_volume *av)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400635{
636 struct rb_node *rb;
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300637 struct ubi_ainf_peb *aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400638
Artem Bityutskiy517af482012-05-17 14:38:34 +0300639 dbg_bld("remove attaching information about volume %d", av->vol_id);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400640
Artem Bityutskiy517af482012-05-17 14:38:34 +0300641 while ((rb = rb_first(&av->root))) {
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300642 aeb = rb_entry(rb, struct ubi_ainf_peb, u.rb);
Artem Bityutskiy517af482012-05-17 14:38:34 +0300643 rb_erase(&aeb->u.rb, &av->root);
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300644 list_add_tail(&aeb->u.list, &ai->erase);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400645 }
646
Artem Bityutskiy517af482012-05-17 14:38:34 +0300647 rb_erase(&av->rb, &ai->volumes);
648 kfree(av);
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300649 ai->vols_found -= 1;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400650}
651
652/**
Artem Bityutskiy13d33da2012-05-17 15:20:28 +0300653 * early_erase_peb - erase a physical eraseblock.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400654 * @ubi: UBI device description object
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300655 * @ai: attaching information
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400656 * @pnum: physical eraseblock number to erase;
Artem Bityutskiy9c47fb22012-05-18 12:54:58 +0300657 * @ec: erase counter value to write (%UBI_UNKNOWN if it is unknown)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400658 *
659 * This function erases physical eraseblock 'pnum', and writes the erase
660 * counter header to it. This function should only be used on UBI device
Artem Bityutskiy85c6e6e2008-07-16 10:25:56 +0300661 * initialization stages, when the EBA sub-system had not been yet initialized.
662 * This function returns zero in case of success and a negative error code in
663 * case of failure.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400664 */
Artem Bityutskiy13d33da2012-05-17 15:20:28 +0300665static int early_erase_peb(struct ubi_device *ubi,
666 const struct ubi_attach_info *ai, int pnum, int ec)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400667{
668 int err;
669 struct ubi_ec_hdr *ec_hdr;
670
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400671 if ((long long)ec >= UBI_MAX_ERASECOUNTER) {
672 /*
673 * Erase counter overflow. Upgrade UBI and use 64-bit
674 * erase counters internally.
675 */
676 ubi_err("erase counter overflow at PEB %d, EC %d", pnum, ec);
677 return -EINVAL;
678 }
679
Florin Malitadcec4c32007-07-19 15:22:41 -0400680 ec_hdr = kzalloc(ubi->ec_hdr_alsize, GFP_KERNEL);
681 if (!ec_hdr)
682 return -ENOMEM;
683
Christoph Hellwig3261ebd2007-05-21 17:41:46 +0300684 ec_hdr->ec = cpu_to_be64(ec);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400685
686 err = ubi_io_sync_erase(ubi, pnum, 0);
687 if (err < 0)
688 goto out_free;
689
690 err = ubi_io_write_ec_hdr(ubi, pnum, ec_hdr);
691
692out_free:
693 kfree(ec_hdr);
694 return err;
695}
696
697/**
Artem Bityutskiyc87fbd72012-05-17 15:38:56 +0300698 * ubi_early_get_peb - get a free physical eraseblock.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400699 * @ubi: UBI device description object
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300700 * @ai: attaching information
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400701 *
702 * This function returns a free physical eraseblock. It is supposed to be
Artem Bityutskiy85c6e6e2008-07-16 10:25:56 +0300703 * called on the UBI initialization stages when the wear-leveling sub-system is
704 * not initialized yet. This function picks a physical eraseblocks from one of
705 * the lists, writes the EC header if it is needed, and removes it from the
706 * list.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400707 *
Artem Bityutskiyfbd01072012-05-17 16:12:26 +0300708 * This function returns a pointer to the "aeb" of the found free PEB in case
709 * of success and an error code in case of failure.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400710 */
Artem Bityutskiyc87fbd72012-05-17 15:38:56 +0300711struct ubi_ainf_peb *ubi_early_get_peb(struct ubi_device *ubi,
712 struct ubi_attach_info *ai)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400713{
Artem Bityutskiy5fc01ab2010-09-03 23:08:15 +0300714 int err = 0;
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300715 struct ubi_ainf_peb *aeb, *tmp_aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400716
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300717 if (!list_empty(&ai->free)) {
718 aeb = list_entry(ai->free.next, struct ubi_ainf_peb, u.list);
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300719 list_del(&aeb->u.list);
720 dbg_bld("return free PEB %d, EC %d", aeb->pnum, aeb->ec);
721 return aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400722 }
723
Artem Bityutskiy5fc01ab2010-09-03 23:08:15 +0300724 /*
725 * We try to erase the first physical eraseblock from the erase list
726 * and pick it if we succeed, or try to erase the next one if not. And
727 * so forth. We don't want to take care about bad eraseblocks here -
728 * they'll be handled later.
729 */
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300730 list_for_each_entry_safe(aeb, tmp_aeb, &ai->erase, u.list) {
Artem Bityutskiy9c47fb22012-05-18 12:54:58 +0300731 if (aeb->ec == UBI_UNKNOWN)
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300732 aeb->ec = ai->mean_ec;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400733
Artem Bityutskiy13d33da2012-05-17 15:20:28 +0300734 err = early_erase_peb(ubi, ai, aeb->pnum, aeb->ec+1);
Artem Bityutskiy5fc01ab2010-09-03 23:08:15 +0300735 if (err)
736 continue;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400737
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +0300738 aeb->ec += 1;
739 list_del(&aeb->u.list);
740 dbg_bld("return PEB %d, EC %d", aeb->pnum, aeb->ec);
741 return aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400742 }
743
Artem Bityutskiy5fc01ab2010-09-03 23:08:15 +0300744 ubi_err("no free eraseblocks");
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400745 return ERR_PTR(-ENOSPC);
746}
747
748/**
Artem Bityutskiy45aafd32010-10-20 11:54:58 +0300749 * check_corruption - check the data area of PEB.
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300750 * @ubi: UBI device description object
751 * @vid_hrd: the (corrupted) VID header of this PEB
752 * @pnum: the physical eraseblock number to check
753 *
754 * This is a helper function which is used to distinguish between VID header
755 * corruptions caused by power cuts and other reasons. If the PEB contains only
Artem Bityutskiy45aafd32010-10-20 11:54:58 +0300756 * 0xFF bytes in the data area, the VID header is most probably corrupted
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300757 * because of a power cut (%0 is returned in this case). Otherwise, it was
Artem Bityutskiy45aafd32010-10-20 11:54:58 +0300758 * probably corrupted for some other reasons (%1 is returned in this case). A
759 * negative error code is returned if a read error occurred.
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300760 *
761 * If the corruption reason was a power cut, UBI can safely erase this PEB.
762 * Otherwise, it should preserve it to avoid possibly destroying important
763 * information.
764 */
Artem Bityutskiy45aafd32010-10-20 11:54:58 +0300765static int check_corruption(struct ubi_device *ubi, struct ubi_vid_hdr *vid_hdr,
766 int pnum)
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300767{
768 int err;
769
770 mutex_lock(&ubi->buf_mutex);
Artem Bityutskiy0ca39d72012-03-08 15:29:37 +0200771 memset(ubi->peb_buf, 0x00, ubi->leb_size);
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300772
Artem Bityutskiy0ca39d72012-03-08 15:29:37 +0200773 err = ubi_io_read(ubi, ubi->peb_buf, pnum, ubi->leb_start,
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300774 ubi->leb_size);
Brian Norrisd57f40542011-09-20 18:34:25 -0700775 if (err == UBI_IO_BITFLIPS || mtd_is_eccerr(err)) {
Artem Bityutskiy45aafd32010-10-20 11:54:58 +0300776 /*
777 * Bit-flips or integrity errors while reading the data area.
778 * It is difficult to say for sure what type of corruption is
779 * this, but presumably a power cut happened while this PEB was
780 * erased, so it became unstable and corrupted, and should be
781 * erased.
782 */
Dan Carpenter1b1d76e2010-11-18 06:58:04 +0300783 err = 0;
784 goto out_unlock;
Artem Bityutskiy45aafd32010-10-20 11:54:58 +0300785 }
786
787 if (err)
Dan Carpenter1b1d76e2010-11-18 06:58:04 +0300788 goto out_unlock;
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300789
Artem Bityutskiy0ca39d72012-03-08 15:29:37 +0200790 if (ubi_check_pattern(ubi->peb_buf, 0xFF, ubi->leb_size))
Dan Carpenter1b1d76e2010-11-18 06:58:04 +0300791 goto out_unlock;
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300792
Artem Bityutskiy049333c2012-08-27 14:43:54 +0300793 ubi_err("PEB %d contains corrupted VID header, and the data does not contain all 0xFF",
794 pnum);
795 ubi_err("this may be a non-UBI PEB or a severe VID header corruption which requires manual inspection");
Artem Bityutskiya904e3f2012-04-25 09:02:44 +0300796 ubi_dump_vid_hdr(vid_hdr);
Artem Bityutskiy719bb842012-08-27 17:14:58 +0300797 pr_err("hexdump of PEB %d offset %d, length %d",
798 pnum, ubi->leb_start, ubi->leb_size);
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300799 ubi_dbg_print_hex_dump(KERN_DEBUG, "", DUMP_PREFIX_OFFSET, 32, 1,
Artem Bityutskiy0ca39d72012-03-08 15:29:37 +0200800 ubi->peb_buf, ubi->leb_size, 1);
Dan Carpenter1b1d76e2010-11-18 06:58:04 +0300801 err = 1;
802
803out_unlock:
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300804 mutex_unlock(&ubi->buf_mutex);
Dan Carpenter1b1d76e2010-11-18 06:58:04 +0300805 return err;
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300806}
807
808/**
Artem Bityutskiyfbd01072012-05-17 16:12:26 +0300809 * scan_peb - scan and process UBI headers of a PEB.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400810 * @ubi: UBI device description object
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300811 * @ai: attaching information
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400812 * @pnum: the physical eraseblock number
813 *
Artem Bityutskiyfbd01072012-05-17 16:12:26 +0300814 * This function reads UBI headers of PEB @pnum, checks them, and adds
815 * information about this PEB to the corresponding list or RB-tree in the
816 * "attaching info" structure. Returns zero if the physical eraseblock was
817 * successfully handled and a negative error code in case of failure.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400818 */
Artem Bityutskiyfbd01072012-05-17 16:12:26 +0300819static int scan_peb(struct ubi_device *ubi, struct ubi_attach_info *ai,
820 int pnum)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400821{
Artem Bityutskiyc18a8412008-01-24 11:19:14 +0200822 long long uninitialized_var(ec);
Artem Bityutskiye0e718c2010-09-03 14:53:23 +0300823 int err, bitflips = 0, vol_id, ec_err = 0;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400824
825 dbg_bld("scan PEB %d", pnum);
826
827 /* Skip bad physical eraseblocks */
828 err = ubi_io_is_bad(ubi, pnum);
829 if (err < 0)
830 return err;
831 else if (err) {
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300832 ai->bad_peb_count += 1;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400833 return 0;
834 }
835
836 err = ubi_io_read_ec_hdr(ubi, pnum, ech, 0);
837 if (err < 0)
838 return err;
Artem Bityutskiyb3321502010-09-03 14:40:55 +0300839 switch (err) {
840 case 0:
841 break;
842 case UBI_IO_BITFLIPS:
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400843 bitflips = 1;
Artem Bityutskiyb3321502010-09-03 14:40:55 +0300844 break;
845 case UBI_IO_FF:
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300846 ai->empty_peb_count += 1;
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200847 return add_to_list(ai, pnum, UBI_UNKNOWN, UBI_UNKNOWN,
848 UBI_UNKNOWN, 0, &ai->erase);
Artem Bityutskiyb3321502010-09-03 14:40:55 +0300849 case UBI_IO_FF_BITFLIPS:
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300850 ai->empty_peb_count += 1;
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200851 return add_to_list(ai, pnum, UBI_UNKNOWN, UBI_UNKNOWN,
852 UBI_UNKNOWN, 1, &ai->erase);
Artem Bityutskiyb3321502010-09-03 14:40:55 +0300853 case UBI_IO_BAD_HDR_EBADMSG:
Artem Bityutskiyb3321502010-09-03 14:40:55 +0300854 case UBI_IO_BAD_HDR:
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400855 /*
856 * We have to also look at the VID header, possibly it is not
857 * corrupted. Set %bitflips flag in order to make this PEB be
858 * moved and EC be re-created.
859 */
Artem Bityutskiye0e718c2010-09-03 14:53:23 +0300860 ec_err = err;
Artem Bityutskiy9c47fb22012-05-18 12:54:58 +0300861 ec = UBI_UNKNOWN;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400862 bitflips = 1;
Artem Bityutskiyb3321502010-09-03 14:40:55 +0300863 break;
864 default:
865 ubi_err("'ubi_io_read_ec_hdr()' returned unknown code %d", err);
866 return -EINVAL;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400867 }
868
Artem Bityutskiye0e718c2010-09-03 14:53:23 +0300869 if (!ec_err) {
Artem Bityutskiyfe96efc2009-06-30 16:11:59 +0300870 int image_seq;
871
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400872 /* Make sure UBI version is OK */
873 if (ech->version != UBI_VERSION) {
874 ubi_err("this UBI version is %d, image version is %d",
875 UBI_VERSION, (int)ech->version);
876 return -EINVAL;
877 }
878
Christoph Hellwig3261ebd2007-05-21 17:41:46 +0300879 ec = be64_to_cpu(ech->ec);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400880 if (ec > UBI_MAX_ERASECOUNTER) {
881 /*
882 * Erase counter overflow. The EC headers have 64 bits
883 * reserved, but we anyway make use of only 31 bit
884 * values, as this seems to be enough for any existing
885 * flash. Upgrade UBI and use 64-bit erase counters
886 * internally.
887 */
888 ubi_err("erase counter overflow, max is %d",
889 UBI_MAX_ERASECOUNTER);
Artem Bityutskiya904e3f2012-04-25 09:02:44 +0300890 ubi_dump_ec_hdr(ech);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400891 return -EINVAL;
892 }
Artem Bityutskiyfe96efc2009-06-30 16:11:59 +0300893
Adrian Hunter32bc4822009-07-24 19:16:04 +0300894 /*
895 * Make sure that all PEBs have the same image sequence number.
896 * This allows us to detect situations when users flash UBI
897 * images incorrectly, so that the flash has the new UBI image
898 * and leftovers from the old one. This feature was added
899 * relatively recently, and the sequence number was always
900 * zero, because old UBI implementations always set it to zero.
901 * For this reasons, we do not panic if some PEBs have zero
902 * sequence number, while other PEBs have non-zero sequence
903 * number.
904 */
Holger Brunck3dc948d2009-07-13 16:47:57 +0200905 image_seq = be32_to_cpu(ech->image_seq);
Artem Bityutskiy2eadaad2009-09-30 10:01:28 +0300906 if (!ubi->image_seq && image_seq)
Artem Bityutskiyfe96efc2009-06-30 16:11:59 +0300907 ubi->image_seq = image_seq;
Artem Bityutskiy2eadaad2009-09-30 10:01:28 +0300908 if (ubi->image_seq && image_seq &&
909 ubi->image_seq != image_seq) {
Artem Bityutskiy049333c2012-08-27 14:43:54 +0300910 ubi_err("bad image sequence number %d in PEB %d, expected %d",
911 image_seq, pnum, ubi->image_seq);
Artem Bityutskiya904e3f2012-04-25 09:02:44 +0300912 ubi_dump_ec_hdr(ech);
Artem Bityutskiyfe96efc2009-06-30 16:11:59 +0300913 return -EINVAL;
914 }
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400915 }
916
917 /* OK, we've done with the EC header, let's look at the VID header */
918
919 err = ubi_io_read_vid_hdr(ubi, pnum, vidh, 0);
920 if (err < 0)
921 return err;
Artem Bityutskiyb3321502010-09-03 14:40:55 +0300922 switch (err) {
923 case 0:
924 break;
925 case UBI_IO_BITFLIPS:
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400926 bitflips = 1;
Artem Bityutskiyb3321502010-09-03 14:40:55 +0300927 break;
928 case UBI_IO_BAD_HDR_EBADMSG:
Artem Bityutskiy0525dac2010-09-03 17:11:37 +0300929 if (ec_err == UBI_IO_BAD_HDR_EBADMSG)
930 /*
931 * Both EC and VID headers are corrupted and were read
932 * with data integrity error, probably this is a bad
933 * PEB, bit it is not marked as bad yet. This may also
934 * be a result of power cut during erasure.
935 */
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300936 ai->maybe_bad_peb_count += 1;
Artem Bityutskiyb3321502010-09-03 14:40:55 +0300937 case UBI_IO_BAD_HDR:
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300938 if (ec_err)
939 /*
940 * Both headers are corrupted. There is a possibility
941 * that this a valid UBI PEB which has corresponding
942 * LEB, but the headers are corrupted. However, it is
943 * impossible to distinguish it from a PEB which just
Artem Bityutskiy45aafd32010-10-20 11:54:58 +0300944 * contains garbage because of a power cut during erase
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300945 * operation. So we just schedule this PEB for erasure.
Artem Bityutskiy7ac760c2010-12-02 06:34:01 +0200946 *
Lucas De Marchi25985ed2011-03-30 22:57:33 -0300947 * Besides, in case of NOR flash, we deliberately
Artem Bityutskiy7ac760c2010-12-02 06:34:01 +0200948 * corrupt both headers because NOR flash erasure is
949 * slow and can start from the end.
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300950 */
951 err = 0;
952 else
953 /*
954 * The EC was OK, but the VID header is corrupted. We
955 * have to check what is in the data area.
956 */
Artem Bityutskiy45aafd32010-10-20 11:54:58 +0300957 err = check_corruption(ubi, vidh, pnum);
Artem Bityutskiydf3fca42010-10-20 11:51:21 +0300958
959 if (err < 0)
960 return err;
961 else if (!err)
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300962 /* This corruption is caused by a power cut */
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200963 err = add_to_list(ai, pnum, UBI_UNKNOWN,
964 UBI_UNKNOWN, ec, 1, &ai->erase);
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300965 else
966 /* This is an unexpected corruption */
Artem Bityutskiya4e60422012-05-17 13:09:08 +0300967 err = add_corrupted(ai, pnum, ec);
Artem Bityutskiyfeeba4b2010-09-03 22:50:53 +0300968 if (err)
969 return err;
970 goto adjust_mean_ec;
Artem Bityutskiyb3321502010-09-03 14:40:55 +0300971 case UBI_IO_FF_BITFLIPS:
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200972 err = add_to_list(ai, pnum, UBI_UNKNOWN, UBI_UNKNOWN,
973 ec, 1, &ai->erase);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400974 if (err)
975 return err;
976 goto adjust_mean_ec;
Artem Bityutskiyb3321502010-09-03 14:40:55 +0300977 case UBI_IO_FF:
Matthieu CASTET193819c2012-08-22 16:03:46 +0200978 if (ec_err || bitflips)
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200979 err = add_to_list(ai, pnum, UBI_UNKNOWN,
980 UBI_UNKNOWN, ec, 1, &ai->erase);
Artem Bityutskiyb3321502010-09-03 14:40:55 +0300981 else
Joel Reardon6dd3bc72012-05-16 14:20:56 +0200982 err = add_to_list(ai, pnum, UBI_UNKNOWN,
983 UBI_UNKNOWN, ec, 0, &ai->free);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400984 if (err)
985 return err;
986 goto adjust_mean_ec;
Artem Bityutskiyb3321502010-09-03 14:40:55 +0300987 default:
988 ubi_err("'ubi_io_read_vid_hdr()' returned unknown code %d",
989 err);
990 return -EINVAL;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400991 }
992
Christoph Hellwig3261ebd2007-05-21 17:41:46 +0300993 vol_id = be32_to_cpu(vidh->vol_id);
Artem Bityutskiy91f2d532008-01-24 11:23:23 +0200994 if (vol_id > UBI_MAX_VOLUMES && vol_id != UBI_LAYOUT_VOLUME_ID) {
Christoph Hellwig3261ebd2007-05-21 17:41:46 +0300995 int lnum = be32_to_cpu(vidh->lnum);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +0400996
997 /* Unsupported internal volume */
998 switch (vidh->compat) {
999 case UBI_COMPAT_DELETE:
Artem Bityutskiy049333c2012-08-27 14:43:54 +03001000 ubi_msg("\"delete\" compatible internal volume %d:%d found, will remove it",
1001 vol_id, lnum);
Joel Reardon6dd3bc72012-05-16 14:20:56 +02001002 err = add_to_list(ai, pnum, vol_id, lnum,
1003 ec, 1, &ai->erase);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001004 if (err)
1005 return err;
Brijesh Singh158132c2010-06-16 09:28:26 +03001006 return 0;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001007
1008 case UBI_COMPAT_RO:
Artem Bityutskiy049333c2012-08-27 14:43:54 +03001009 ubi_msg("read-only compatible internal volume %d:%d found, switch to read-only mode",
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001010 vol_id, lnum);
1011 ubi->ro_mode = 1;
1012 break;
1013
1014 case UBI_COMPAT_PRESERVE:
Artem Bityutskiy049333c2012-08-27 14:43:54 +03001015 ubi_msg("\"preserve\" compatible internal volume %d:%d found",
1016 vol_id, lnum);
Joel Reardon6dd3bc72012-05-16 14:20:56 +02001017 err = add_to_list(ai, pnum, vol_id, lnum,
1018 ec, 0, &ai->alien);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001019 if (err)
1020 return err;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001021 return 0;
1022
1023 case UBI_COMPAT_REJECT:
1024 ubi_err("incompatible internal volume %d:%d found",
1025 vol_id, lnum);
1026 return -EINVAL;
1027 }
1028 }
1029
Artem Bityutskiye0e718c2010-09-03 14:53:23 +03001030 if (ec_err)
Artem Bityutskiy29a88c92009-07-19 14:03:16 +03001031 ubi_warn("valid VID header but corrupted EC header at PEB %d",
1032 pnum);
Artem Bityutskiy35611882012-05-17 15:31:31 +03001033 err = ubi_add_to_av(ubi, ai, pnum, ec, vidh, bitflips);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001034 if (err)
1035 return err;
1036
1037adjust_mean_ec:
Artem Bityutskiye0e718c2010-09-03 14:53:23 +03001038 if (!ec_err) {
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001039 ai->ec_sum += ec;
1040 ai->ec_count += 1;
1041 if (ec > ai->max_ec)
1042 ai->max_ec = ec;
1043 if (ec < ai->min_ec)
1044 ai->min_ec = ec;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001045 }
1046
1047 return 0;
1048}
1049
1050/**
Artem Bityutskiyfbd01072012-05-17 16:12:26 +03001051 * late_analysis - analyze the overall situation with PEB.
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001052 * @ubi: UBI device description object
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001053 * @ai: attaching information
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001054 *
Artem Bityutskiyfbd01072012-05-17 16:12:26 +03001055 * 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.
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001060 */
Artem Bityutskiyfbd01072012-05-17 16:12:26 +03001061static int late_analysis(struct ubi_device *ubi, struct ubi_attach_info *ai)
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001062{
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001063 struct ubi_ainf_peb *aeb;
Artem Bityutskiy0525dac2010-09-03 17:11:37 +03001064 int max_corr, peb_count;
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001065
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001066 peb_count = ubi->peb_count - ai->bad_peb_count - ai->alien_peb_count;
Artem Bityutskiy0525dac2010-09-03 17:11:37 +03001067 max_corr = peb_count / 20 ?: 8;
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001068
1069 /*
Artem Bityutskiy0525dac2010-09-03 17:11:37 +03001070 * Few corrupted PEBs is not a problem and may be just a result of
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001071 * unclean reboots. However, many of them may indicate some problems
1072 * with the flash HW or driver.
1073 */
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001074 if (ai->corr_peb_count) {
Artem Bityutskiy0525dac2010-09-03 17:11:37 +03001075 ubi_err("%d PEBs are corrupted and preserved",
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001076 ai->corr_peb_count);
Artem Bityutskiye28453b2012-08-27 15:13:05 +03001077 pr_err("Corrupted PEBs are:");
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001078 list_for_each_entry(aeb, &ai->corr, u.list)
Artem Bityutskiye28453b2012-08-27 15:13:05 +03001079 pr_cont(" %d", aeb->pnum);
1080 pr_cont("\n");
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001081
1082 /*
1083 * If too many PEBs are corrupted, we refuse attaching,
1084 * otherwise, only print a warning.
1085 */
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001086 if (ai->corr_peb_count >= max_corr) {
Artem Bityutskiyfeddbb32011-03-28 10:12:25 +03001087 ubi_err("too many corrupted PEBs, refusing");
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001088 return -EINVAL;
1089 }
1090 }
1091
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001092 if (ai->empty_peb_count + ai->maybe_bad_peb_count == peb_count) {
Artem Bityutskiy0525dac2010-09-03 17:11:37 +03001093 /*
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.
1096 *
1097 * This piece of code basically tries to distinguish between
1098 * the following situations:
1099 *
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.
1104 *
1105 * 2. Flash contains non-UBI data and we do not want to format
1106 * it and destroy possibly important information.
1107 */
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001108 if (ai->maybe_bad_peb_count <= 2) {
1109 ai->is_empty = 1;
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001110 ubi_msg("empty MTD device detected");
Artem Bityutskiy0525dac2010-09-03 17:11:37 +03001111 get_random_bytes(&ubi->image_seq,
1112 sizeof(ubi->image_seq));
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001113 } else {
Artem Bityutskiy049333c2012-08-27 14:43:54 +03001114 ubi_err("MTD device is not UBI-formatted and possibly contains non-UBI data - refusing it");
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001115 return -EINVAL;
1116 }
Artem Bityutskiy0525dac2010-09-03 17:11:37 +03001117
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001118 }
1119
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001120 return 0;
1121}
1122
1123/**
Artem Bityutskiy47e1ec72012-05-18 12:41:17 +03001124 * scan_all - scan entire MTD device.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001125 * @ubi: UBI device description object
1126 *
1127 * This function does full scanning of an MTD device and returns complete
Artem Bityutskiyfbd01072012-05-17 16:12:26 +03001128 * information about it in form of a "struct ubi_attach_info" object. In case
1129 * of failure, an error code is returned.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001130 */
Artem Bityutskiy47e1ec72012-05-18 12:41:17 +03001131static struct ubi_attach_info *scan_all(struct ubi_device *ubi)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001132{
1133 int err, pnum;
1134 struct rb_node *rb1, *rb2;
Artem Bityutskiy517af482012-05-17 14:38:34 +03001135 struct ubi_ainf_volume *av;
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001136 struct ubi_ainf_peb *aeb;
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001137 struct ubi_attach_info *ai;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001138
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001139 ai = kzalloc(sizeof(struct ubi_attach_info), GFP_KERNEL);
1140 if (!ai)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001141 return ERR_PTR(-ENOMEM);
1142
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001143 INIT_LIST_HEAD(&ai->corr);
1144 INIT_LIST_HEAD(&ai->free);
1145 INIT_LIST_HEAD(&ai->erase);
1146 INIT_LIST_HEAD(&ai->alien);
1147 ai->volumes = RB_ROOT;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001148
1149 err = -ENOMEM;
Artem Bityutskiy1fc2e3e2012-05-17 15:56:03 +03001150 ai->aeb_slab_cache = kmem_cache_create("ubi_aeb_slab_cache",
1151 sizeof(struct ubi_ainf_peb),
1152 0, 0, NULL);
1153 if (!ai->aeb_slab_cache)
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001154 goto out_ai;
Artem Bityutskiy6c1e8752010-10-31 17:54:14 +02001155
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001156 ech = kzalloc(ubi->ec_hdr_alsize, GFP_KERNEL);
1157 if (!ech)
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001158 goto out_ai;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001159
Artem Bityutskiy33818bb2007-08-28 21:29:32 +03001160 vidh = ubi_zalloc_vid_hdr(ubi, GFP_KERNEL);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001161 if (!vidh)
1162 goto out_ech;
1163
1164 for (pnum = 0; pnum < ubi->peb_count; pnum++) {
1165 cond_resched();
1166
Artem Bityutskiyc8566352008-07-16 17:40:22 +03001167 dbg_gen("process PEB %d", pnum);
Artem Bityutskiyfbd01072012-05-17 16:12:26 +03001168 err = scan_peb(ubi, ai, pnum);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001169 if (err < 0)
1170 goto out_vidh;
1171 }
1172
Artem Bityutskiy719bb842012-08-27 17:14:58 +03001173 ubi_msg("scanning is finished");
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001174
Artem Bityutskiy4bc1dca2008-04-19 20:44:31 +03001175 /* Calculate mean erase counter */
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001176 if (ai->ec_count)
1177 ai->mean_ec = div_u64(ai->ec_sum, ai->ec_count);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001178
Artem Bityutskiyfbd01072012-05-17 16:12:26 +03001179 err = late_analysis(ubi, ai);
Artem Bityutskiy0798cea2010-04-30 13:02:33 +03001180 if (err)
1181 goto out_vidh;
Artem Bityutskiy4a406852009-07-19 14:33:14 +03001182
1183 /*
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001184 * In case of unknown erase counter we use the mean erase counter
1185 * value.
1186 */
Artem Bityutskiy517af482012-05-17 14:38:34 +03001187 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) {
1188 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb)
Artem Bityutskiy9c47fb22012-05-18 12:54:58 +03001189 if (aeb->ec == UBI_UNKNOWN)
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001190 aeb->ec = ai->mean_ec;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001191 }
1192
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001193 list_for_each_entry(aeb, &ai->free, u.list) {
Artem Bityutskiy9c47fb22012-05-18 12:54:58 +03001194 if (aeb->ec == UBI_UNKNOWN)
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001195 aeb->ec = ai->mean_ec;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001196 }
1197
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001198 list_for_each_entry(aeb, &ai->corr, u.list)
Artem Bityutskiy9c47fb22012-05-18 12:54:58 +03001199 if (aeb->ec == UBI_UNKNOWN)
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001200 aeb->ec = ai->mean_ec;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001201
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001202 list_for_each_entry(aeb, &ai->erase, u.list)
Artem Bityutskiy9c47fb22012-05-18 12:54:58 +03001203 if (aeb->ec == UBI_UNKNOWN)
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001204 aeb->ec = ai->mean_ec;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001205
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001206 err = self_check_ai(ubi, ai);
Artem Bityutskiyadbf05e2010-01-20 10:28:58 +02001207 if (err)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001208 goto out_vidh;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001209
1210 ubi_free_vid_hdr(ubi, vidh);
1211 kfree(ech);
1212
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001213 return ai;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001214
1215out_vidh:
1216 ubi_free_vid_hdr(ubi, vidh);
1217out_ech:
1218 kfree(ech);
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001219out_ai:
Artem Bityutskiy66a2af32012-05-17 15:41:12 +03001220 ubi_destroy_ai(ai);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001221 return ERR_PTR(err);
1222}
1223
1224/**
Artem Bityutskiy47e1ec72012-05-18 12:41:17 +03001225 * ubi_attach - attach an MTD device.
1226 * @ubi: UBI device descriptor
1227 *
1228 * This function returns zero in case of success and a negative error code in
1229 * case of failure.
1230 */
1231int ubi_attach(struct ubi_device *ubi)
1232{
1233 int err;
1234 struct ubi_attach_info *ai;
1235
1236 ai = scan_all(ubi);
1237 if (IS_ERR(ai))
1238 return PTR_ERR(ai);
1239
1240 ubi->bad_peb_count = ai->bad_peb_count;
1241 ubi->good_peb_count = ubi->peb_count - ubi->bad_peb_count;
1242 ubi->corr_peb_count = ai->corr_peb_count;
1243 ubi->max_ec = ai->max_ec;
1244 ubi->mean_ec = ai->mean_ec;
Artem Bityutskiy719bb842012-08-27 17:14:58 +03001245 dbg_gen("max. sequence number: %llu", ai->max_sqnum);
Artem Bityutskiy47e1ec72012-05-18 12:41:17 +03001246
1247 err = ubi_read_volume_table(ubi, ai);
1248 if (err)
1249 goto out_ai;
1250
1251 err = ubi_wl_init(ubi, ai);
1252 if (err)
1253 goto out_vtbl;
1254
1255 err = ubi_eba_init(ubi, ai);
1256 if (err)
1257 goto out_wl;
1258
1259 ubi_destroy_ai(ai);
1260 return 0;
1261
1262out_wl:
1263 ubi_wl_close(ubi);
1264out_vtbl:
1265 ubi_free_internal_volumes(ubi);
1266 vfree(ubi->vtbl);
1267out_ai:
1268 ubi_destroy_ai(ai);
1269 return err;
1270}
1271
1272/**
Artem Bityutskiyfbd01072012-05-17 16:12:26 +03001273 * destroy_av - free volume attaching information.
1274 * @av: volume attaching information
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001275 * @ai: attaching information
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001276 *
Artem Bityutskiyfbd01072012-05-17 16:12:26 +03001277 * This function destroys the volume attaching information.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001278 */
Artem Bityutskiy517af482012-05-17 14:38:34 +03001279static void destroy_av(struct ubi_attach_info *ai, struct ubi_ainf_volume *av)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001280{
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001281 struct ubi_ainf_peb *aeb;
Artem Bityutskiy517af482012-05-17 14:38:34 +03001282 struct rb_node *this = av->root.rb_node;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001283
1284 while (this) {
1285 if (this->rb_left)
1286 this = this->rb_left;
1287 else if (this->rb_right)
1288 this = this->rb_right;
1289 else {
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001290 aeb = rb_entry(this, struct ubi_ainf_peb, u.rb);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001291 this = rb_parent(this);
1292 if (this) {
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001293 if (this->rb_left == &aeb->u.rb)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001294 this->rb_left = NULL;
1295 else
1296 this->rb_right = NULL;
1297 }
1298
Artem Bityutskiy1fc2e3e2012-05-17 15:56:03 +03001299 kmem_cache_free(ai->aeb_slab_cache, aeb);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001300 }
1301 }
Artem Bityutskiy517af482012-05-17 14:38:34 +03001302 kfree(av);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001303}
1304
1305/**
Artem Bityutskiy66a2af32012-05-17 15:41:12 +03001306 * ubi_destroy_ai - destroy attaching information.
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001307 * @ai: attaching information
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001308 */
Artem Bityutskiy66a2af32012-05-17 15:41:12 +03001309void ubi_destroy_ai(struct ubi_attach_info *ai)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001310{
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001311 struct ubi_ainf_peb *aeb, *aeb_tmp;
Artem Bityutskiy517af482012-05-17 14:38:34 +03001312 struct ubi_ainf_volume *av;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001313 struct rb_node *rb;
1314
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001315 list_for_each_entry_safe(aeb, aeb_tmp, &ai->alien, u.list) {
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001316 list_del(&aeb->u.list);
Artem Bityutskiy1fc2e3e2012-05-17 15:56:03 +03001317 kmem_cache_free(ai->aeb_slab_cache, aeb);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001318 }
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001319 list_for_each_entry_safe(aeb, aeb_tmp, &ai->erase, u.list) {
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001320 list_del(&aeb->u.list);
Artem Bityutskiy1fc2e3e2012-05-17 15:56:03 +03001321 kmem_cache_free(ai->aeb_slab_cache, aeb);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001322 }
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001323 list_for_each_entry_safe(aeb, aeb_tmp, &ai->corr, u.list) {
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001324 list_del(&aeb->u.list);
Artem Bityutskiy1fc2e3e2012-05-17 15:56:03 +03001325 kmem_cache_free(ai->aeb_slab_cache, aeb);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001326 }
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001327 list_for_each_entry_safe(aeb, aeb_tmp, &ai->free, u.list) {
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001328 list_del(&aeb->u.list);
Artem Bityutskiy1fc2e3e2012-05-17 15:56:03 +03001329 kmem_cache_free(ai->aeb_slab_cache, aeb);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001330 }
1331
1332 /* Destroy the volume RB-tree */
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001333 rb = ai->volumes.rb_node;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001334 while (rb) {
1335 if (rb->rb_left)
1336 rb = rb->rb_left;
1337 else if (rb->rb_right)
1338 rb = rb->rb_right;
1339 else {
Artem Bityutskiy517af482012-05-17 14:38:34 +03001340 av = rb_entry(rb, struct ubi_ainf_volume, rb);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001341
1342 rb = rb_parent(rb);
1343 if (rb) {
Artem Bityutskiy517af482012-05-17 14:38:34 +03001344 if (rb->rb_left == &av->rb)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001345 rb->rb_left = NULL;
1346 else
1347 rb->rb_right = NULL;
1348 }
1349
Artem Bityutskiy517af482012-05-17 14:38:34 +03001350 destroy_av(ai, av);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001351 }
1352 }
1353
Artem Bityutskiy1fc2e3e2012-05-17 15:56:03 +03001354 if (ai->aeb_slab_cache)
1355 kmem_cache_destroy(ai->aeb_slab_cache);
Richard Weinbergera29852b2012-01-30 18:20:13 +01001356
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001357 kfree(ai);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001358}
1359
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001360/**
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001361 * self_check_ai - check the attaching information.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001362 * @ubi: UBI device description object
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001363 * @ai: attaching information
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001364 *
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001365 * This function returns zero if the attaching information is all right, and a
Artem Bityutskiyadbf05e2010-01-20 10:28:58 +02001366 * negative error code if not or if an error occurred.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001367 */
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001368static int self_check_ai(struct ubi_device *ubi, struct ubi_attach_info *ai)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001369{
1370 int pnum, err, vols_found = 0;
1371 struct rb_node *rb1, *rb2;
Artem Bityutskiy517af482012-05-17 14:38:34 +03001372 struct ubi_ainf_volume *av;
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001373 struct ubi_ainf_peb *aeb, *last_aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001374 uint8_t *buf;
1375
Artem Bityutskiy2a734bb2011-05-18 14:53:05 +03001376 if (!ubi->dbg->chk_gen)
Artem Bityutskiy92d124f2011-03-14 18:17:40 +02001377 return 0;
1378
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001379 /*
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001380 * At first, check that attaching information is OK.
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001381 */
Artem Bityutskiy517af482012-05-17 14:38:34 +03001382 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001383 int leb_count = 0;
1384
1385 cond_resched();
1386
1387 vols_found += 1;
1388
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001389 if (ai->is_empty) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001390 ubi_err("bad is_empty flag");
Artem Bityutskiy517af482012-05-17 14:38:34 +03001391 goto bad_av;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001392 }
1393
Artem Bityutskiy517af482012-05-17 14:38:34 +03001394 if (av->vol_id < 0 || av->highest_lnum < 0 ||
1395 av->leb_count < 0 || av->vol_type < 0 || av->used_ebs < 0 ||
1396 av->data_pad < 0 || av->last_data_size < 0) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001397 ubi_err("negative values");
Artem Bityutskiy517af482012-05-17 14:38:34 +03001398 goto bad_av;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001399 }
1400
Artem Bityutskiy517af482012-05-17 14:38:34 +03001401 if (av->vol_id >= UBI_MAX_VOLUMES &&
1402 av->vol_id < UBI_INTERNAL_VOL_START) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001403 ubi_err("bad vol_id");
Artem Bityutskiy517af482012-05-17 14:38:34 +03001404 goto bad_av;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001405 }
1406
Artem Bityutskiy517af482012-05-17 14:38:34 +03001407 if (av->vol_id > ai->highest_vol_id) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001408 ubi_err("highest_vol_id is %d, but vol_id %d is there",
Artem Bityutskiy517af482012-05-17 14:38:34 +03001409 ai->highest_vol_id, av->vol_id);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001410 goto out;
1411 }
1412
Artem Bityutskiy517af482012-05-17 14:38:34 +03001413 if (av->vol_type != UBI_DYNAMIC_VOLUME &&
1414 av->vol_type != UBI_STATIC_VOLUME) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001415 ubi_err("bad vol_type");
Artem Bityutskiy517af482012-05-17 14:38:34 +03001416 goto bad_av;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001417 }
1418
Artem Bityutskiy517af482012-05-17 14:38:34 +03001419 if (av->data_pad > ubi->leb_size / 2) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001420 ubi_err("bad data_pad");
Artem Bityutskiy517af482012-05-17 14:38:34 +03001421 goto bad_av;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001422 }
1423
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001424 last_aeb = NULL;
Artem Bityutskiy517af482012-05-17 14:38:34 +03001425 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001426 cond_resched();
1427
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001428 last_aeb = aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001429 leb_count += 1;
1430
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001431 if (aeb->pnum < 0 || aeb->ec < 0) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001432 ubi_err("negative values");
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001433 goto bad_aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001434 }
1435
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001436 if (aeb->ec < ai->min_ec) {
1437 ubi_err("bad ai->min_ec (%d), %d found",
1438 ai->min_ec, aeb->ec);
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001439 goto bad_aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001440 }
1441
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001442 if (aeb->ec > ai->max_ec) {
1443 ubi_err("bad ai->max_ec (%d), %d found",
1444 ai->max_ec, aeb->ec);
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001445 goto bad_aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001446 }
1447
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001448 if (aeb->pnum >= ubi->peb_count) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001449 ubi_err("too high PEB number %d, total PEBs %d",
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001450 aeb->pnum, ubi->peb_count);
1451 goto bad_aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001452 }
1453
Artem Bityutskiy517af482012-05-17 14:38:34 +03001454 if (av->vol_type == UBI_STATIC_VOLUME) {
1455 if (aeb->lnum >= av->used_ebs) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001456 ubi_err("bad lnum or used_ebs");
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001457 goto bad_aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001458 }
1459 } else {
Artem Bityutskiy517af482012-05-17 14:38:34 +03001460 if (av->used_ebs != 0) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001461 ubi_err("non-zero used_ebs");
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001462 goto bad_aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001463 }
1464 }
1465
Artem Bityutskiy517af482012-05-17 14:38:34 +03001466 if (aeb->lnum > av->highest_lnum) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001467 ubi_err("incorrect highest_lnum or lnum");
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001468 goto bad_aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001469 }
1470 }
1471
Artem Bityutskiy517af482012-05-17 14:38:34 +03001472 if (av->leb_count != leb_count) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001473 ubi_err("bad leb_count, %d objects in the tree",
1474 leb_count);
Artem Bityutskiy517af482012-05-17 14:38:34 +03001475 goto bad_av;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001476 }
1477
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001478 if (!last_aeb)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001479 continue;
1480
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001481 aeb = last_aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001482
Artem Bityutskiy517af482012-05-17 14:38:34 +03001483 if (aeb->lnum != av->highest_lnum) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001484 ubi_err("bad highest_lnum");
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001485 goto bad_aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001486 }
1487 }
1488
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001489 if (vols_found != ai->vols_found) {
1490 ubi_err("bad ai->vols_found %d, should be %d",
1491 ai->vols_found, vols_found);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001492 goto out;
1493 }
1494
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001495 /* Check that attaching information is correct */
Artem Bityutskiy517af482012-05-17 14:38:34 +03001496 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) {
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001497 last_aeb = NULL;
Artem Bityutskiy517af482012-05-17 14:38:34 +03001498 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001499 int vol_type;
1500
1501 cond_resched();
1502
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001503 last_aeb = aeb;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001504
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001505 err = ubi_io_read_vid_hdr(ubi, aeb->pnum, vidh, 1);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001506 if (err && err != UBI_IO_BITFLIPS) {
1507 ubi_err("VID header is not OK (%d)", err);
1508 if (err > 0)
1509 err = -EIO;
1510 return err;
1511 }
1512
1513 vol_type = vidh->vol_type == UBI_VID_DYNAMIC ?
1514 UBI_DYNAMIC_VOLUME : UBI_STATIC_VOLUME;
Artem Bityutskiy517af482012-05-17 14:38:34 +03001515 if (av->vol_type != vol_type) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001516 ubi_err("bad vol_type");
1517 goto bad_vid_hdr;
1518 }
1519
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001520 if (aeb->sqnum != be64_to_cpu(vidh->sqnum)) {
1521 ubi_err("bad sqnum %llu", aeb->sqnum);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001522 goto bad_vid_hdr;
1523 }
1524
Artem Bityutskiy517af482012-05-17 14:38:34 +03001525 if (av->vol_id != be32_to_cpu(vidh->vol_id)) {
1526 ubi_err("bad vol_id %d", av->vol_id);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001527 goto bad_vid_hdr;
1528 }
1529
Artem Bityutskiy517af482012-05-17 14:38:34 +03001530 if (av->compat != vidh->compat) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001531 ubi_err("bad compat %d", vidh->compat);
1532 goto bad_vid_hdr;
1533 }
1534
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001535 if (aeb->lnum != be32_to_cpu(vidh->lnum)) {
1536 ubi_err("bad lnum %d", aeb->lnum);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001537 goto bad_vid_hdr;
1538 }
1539
Artem Bityutskiy517af482012-05-17 14:38:34 +03001540 if (av->used_ebs != be32_to_cpu(vidh->used_ebs)) {
1541 ubi_err("bad used_ebs %d", av->used_ebs);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001542 goto bad_vid_hdr;
1543 }
1544
Artem Bityutskiy517af482012-05-17 14:38:34 +03001545 if (av->data_pad != be32_to_cpu(vidh->data_pad)) {
1546 ubi_err("bad data_pad %d", av->data_pad);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001547 goto bad_vid_hdr;
1548 }
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001549 }
1550
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001551 if (!last_aeb)
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001552 continue;
1553
Artem Bityutskiy517af482012-05-17 14:38:34 +03001554 if (av->highest_lnum != be32_to_cpu(vidh->lnum)) {
1555 ubi_err("bad highest_lnum %d", av->highest_lnum);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001556 goto bad_vid_hdr;
1557 }
1558
Artem Bityutskiy517af482012-05-17 14:38:34 +03001559 if (av->last_data_size != be32_to_cpu(vidh->data_size)) {
1560 ubi_err("bad last_data_size %d", av->last_data_size);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001561 goto bad_vid_hdr;
1562 }
1563 }
1564
1565 /*
1566 * Make sure that all the physical eraseblocks are in one of the lists
1567 * or trees.
1568 */
Mariusz Kozlowskid9b07442007-08-01 00:02:10 +02001569 buf = kzalloc(ubi->peb_count, GFP_KERNEL);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001570 if (!buf)
1571 return -ENOMEM;
1572
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001573 for (pnum = 0; pnum < ubi->peb_count; pnum++) {
1574 err = ubi_io_is_bad(ubi, pnum);
Artem Bityutskiy341e1a02007-05-03 11:59:51 +03001575 if (err < 0) {
1576 kfree(buf);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001577 return err;
Artem Bityutskiy9c9ec142008-07-18 13:19:52 +03001578 } else if (err)
Mariusz Kozlowskid9b07442007-08-01 00:02:10 +02001579 buf[pnum] = 1;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001580 }
1581
Artem Bityutskiy517af482012-05-17 14:38:34 +03001582 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb)
1583 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb)
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001584 buf[aeb->pnum] = 1;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001585
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001586 list_for_each_entry(aeb, &ai->free, u.list)
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001587 buf[aeb->pnum] = 1;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001588
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001589 list_for_each_entry(aeb, &ai->corr, u.list)
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001590 buf[aeb->pnum] = 1;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001591
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001592 list_for_each_entry(aeb, &ai->erase, u.list)
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001593 buf[aeb->pnum] = 1;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001594
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001595 list_for_each_entry(aeb, &ai->alien, u.list)
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001596 buf[aeb->pnum] = 1;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001597
1598 err = 0;
1599 for (pnum = 0; pnum < ubi->peb_count; pnum++)
Mariusz Kozlowskid9b07442007-08-01 00:02:10 +02001600 if (!buf[pnum]) {
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001601 ubi_err("PEB %d is not referred", pnum);
1602 err = 1;
1603 }
1604
1605 kfree(buf);
1606 if (err)
1607 goto out;
1608 return 0;
1609
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001610bad_aeb:
Artem Bityutskiya4e60422012-05-17 13:09:08 +03001611 ubi_err("bad attaching information about LEB %d", aeb->lnum);
Artem Bityutskiy2c5ec5c2012-05-17 08:26:24 +03001612 ubi_dump_aeb(aeb, 0);
Artem Bityutskiy517af482012-05-17 14:38:34 +03001613 ubi_dump_av(av);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001614 goto out;
1615
Artem Bityutskiy517af482012-05-17 14:38:34 +03001616bad_av:
1617 ubi_err("bad attaching information about volume %d", av->vol_id);
1618 ubi_dump_av(av);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001619 goto out;
1620
1621bad_vid_hdr:
Artem Bityutskiy517af482012-05-17 14:38:34 +03001622 ubi_err("bad attaching information about volume %d", av->vol_id);
1623 ubi_dump_av(av);
Artem Bityutskiya904e3f2012-04-25 09:02:44 +03001624 ubi_dump_vid_hdr(vidh);
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001625
1626out:
Artem Bityutskiy25886a32012-04-24 06:59:49 +03001627 dump_stack();
Artem Bityutskiyadbf05e2010-01-20 10:28:58 +02001628 return -EINVAL;
Artem B. Bityutskiy801c1352006-06-27 12:22:22 +04001629}