1*4882a593Smuzhiyun // SPDX-License-Identifier: GPL-2.0-or-later
2*4882a593Smuzhiyun /*
3*4882a593Smuzhiyun * Copyright (c) International Business Machines Corp., 2006
4*4882a593Smuzhiyun * Copyright (c) Nokia Corporation, 2006, 2007
5*4882a593Smuzhiyun *
6*4882a593Smuzhiyun * Author: Artem Bityutskiy (Битюцкий Артём)
7*4882a593Smuzhiyun */
8*4882a593Smuzhiyun
9*4882a593Smuzhiyun /*
10*4882a593Smuzhiyun * This file includes volume table manipulation code. The volume table is an
11*4882a593Smuzhiyun * on-flash table containing volume meta-data like name, number of reserved
12*4882a593Smuzhiyun * physical eraseblocks, type, etc. The volume table is stored in the so-called
13*4882a593Smuzhiyun * "layout volume".
14*4882a593Smuzhiyun *
15*4882a593Smuzhiyun * The layout volume is an internal volume which is organized as follows. It
16*4882a593Smuzhiyun * consists of two logical eraseblocks - LEB 0 and LEB 1. Each logical
17*4882a593Smuzhiyun * eraseblock stores one volume table copy, i.e. LEB 0 and LEB 1 duplicate each
18*4882a593Smuzhiyun * other. This redundancy guarantees robustness to unclean reboots. The volume
19*4882a593Smuzhiyun * table is basically an array of volume table records. Each record contains
20*4882a593Smuzhiyun * full information about the volume and protected by a CRC checksum. Note,
21*4882a593Smuzhiyun * nowadays we use the atomic LEB change operation when updating the volume
22*4882a593Smuzhiyun * table, so we do not really need 2 LEBs anymore, but we preserve the older
23*4882a593Smuzhiyun * design for the backward compatibility reasons.
24*4882a593Smuzhiyun *
25*4882a593Smuzhiyun * When the volume table is changed, it is first changed in RAM. Then LEB 0 is
26*4882a593Smuzhiyun * erased, and the updated volume table is written back to LEB 0. Then same for
27*4882a593Smuzhiyun * LEB 1. This scheme guarantees recoverability from unclean reboots.
28*4882a593Smuzhiyun *
29*4882a593Smuzhiyun * In this UBI implementation the on-flash volume table does not contain any
30*4882a593Smuzhiyun * information about how much data static volumes contain.
31*4882a593Smuzhiyun *
32*4882a593Smuzhiyun * But it would still be beneficial to store this information in the volume
33*4882a593Smuzhiyun * table. For example, suppose we have a static volume X, and all its physical
34*4882a593Smuzhiyun * eraseblocks became bad for some reasons. Suppose we are attaching the
35*4882a593Smuzhiyun * corresponding MTD device, for some reason we find no logical eraseblocks
36*4882a593Smuzhiyun * corresponding to the volume X. According to the volume table volume X does
37*4882a593Smuzhiyun * exist. So we don't know whether it is just empty or all its physical
38*4882a593Smuzhiyun * eraseblocks went bad. So we cannot alarm the user properly.
39*4882a593Smuzhiyun *
40*4882a593Smuzhiyun * The volume table also stores so-called "update marker", which is used for
41*4882a593Smuzhiyun * volume updates. Before updating the volume, the update marker is set, and
42*4882a593Smuzhiyun * after the update operation is finished, the update marker is cleared. So if
43*4882a593Smuzhiyun * the update operation was interrupted (e.g. by an unclean reboot) - the
44*4882a593Smuzhiyun * update marker is still there and we know that the volume's contents is
45*4882a593Smuzhiyun * damaged.
46*4882a593Smuzhiyun */
47*4882a593Smuzhiyun
48*4882a593Smuzhiyun #include <linux/crc32.h>
49*4882a593Smuzhiyun #include <linux/err.h>
50*4882a593Smuzhiyun #include <linux/slab.h>
51*4882a593Smuzhiyun #include <asm/div64.h>
52*4882a593Smuzhiyun #include "ubi.h"
53*4882a593Smuzhiyun
54*4882a593Smuzhiyun static void self_vtbl_check(const struct ubi_device *ubi);
55*4882a593Smuzhiyun
56*4882a593Smuzhiyun /* Empty volume table record */
57*4882a593Smuzhiyun static struct ubi_vtbl_record empty_vtbl_record;
58*4882a593Smuzhiyun
59*4882a593Smuzhiyun /**
60*4882a593Smuzhiyun * ubi_update_layout_vol - helper for updatting layout volumes on flash
61*4882a593Smuzhiyun * @ubi: UBI device description object
62*4882a593Smuzhiyun */
ubi_update_layout_vol(struct ubi_device * ubi)63*4882a593Smuzhiyun static int ubi_update_layout_vol(struct ubi_device *ubi)
64*4882a593Smuzhiyun {
65*4882a593Smuzhiyun struct ubi_volume *layout_vol;
66*4882a593Smuzhiyun int i, err;
67*4882a593Smuzhiyun
68*4882a593Smuzhiyun layout_vol = ubi->volumes[vol_id2idx(ubi, UBI_LAYOUT_VOLUME_ID)];
69*4882a593Smuzhiyun for (i = 0; i < UBI_LAYOUT_VOLUME_EBS; i++) {
70*4882a593Smuzhiyun err = ubi_eba_atomic_leb_change(ubi, layout_vol, i, ubi->vtbl,
71*4882a593Smuzhiyun ubi->vtbl_size);
72*4882a593Smuzhiyun if (err)
73*4882a593Smuzhiyun return err;
74*4882a593Smuzhiyun }
75*4882a593Smuzhiyun
76*4882a593Smuzhiyun return 0;
77*4882a593Smuzhiyun }
78*4882a593Smuzhiyun
79*4882a593Smuzhiyun /**
80*4882a593Smuzhiyun * ubi_change_vtbl_record - change volume table record.
81*4882a593Smuzhiyun * @ubi: UBI device description object
82*4882a593Smuzhiyun * @idx: table index to change
83*4882a593Smuzhiyun * @vtbl_rec: new volume table record
84*4882a593Smuzhiyun *
85*4882a593Smuzhiyun * This function changes volume table record @idx. If @vtbl_rec is %NULL, empty
86*4882a593Smuzhiyun * volume table record is written. The caller does not have to calculate CRC of
87*4882a593Smuzhiyun * the record as it is done by this function. Returns zero in case of success
88*4882a593Smuzhiyun * and a negative error code in case of failure.
89*4882a593Smuzhiyun */
ubi_change_vtbl_record(struct ubi_device * ubi,int idx,struct ubi_vtbl_record * vtbl_rec)90*4882a593Smuzhiyun int ubi_change_vtbl_record(struct ubi_device *ubi, int idx,
91*4882a593Smuzhiyun struct ubi_vtbl_record *vtbl_rec)
92*4882a593Smuzhiyun {
93*4882a593Smuzhiyun int err;
94*4882a593Smuzhiyun uint32_t crc;
95*4882a593Smuzhiyun
96*4882a593Smuzhiyun ubi_assert(idx >= 0 && idx < ubi->vtbl_slots);
97*4882a593Smuzhiyun
98*4882a593Smuzhiyun if (!vtbl_rec)
99*4882a593Smuzhiyun vtbl_rec = &empty_vtbl_record;
100*4882a593Smuzhiyun else {
101*4882a593Smuzhiyun crc = crc32(UBI_CRC32_INIT, vtbl_rec, UBI_VTBL_RECORD_SIZE_CRC);
102*4882a593Smuzhiyun vtbl_rec->crc = cpu_to_be32(crc);
103*4882a593Smuzhiyun }
104*4882a593Smuzhiyun
105*4882a593Smuzhiyun memcpy(&ubi->vtbl[idx], vtbl_rec, sizeof(struct ubi_vtbl_record));
106*4882a593Smuzhiyun err = ubi_update_layout_vol(ubi);
107*4882a593Smuzhiyun
108*4882a593Smuzhiyun self_vtbl_check(ubi);
109*4882a593Smuzhiyun return err ? err : 0;
110*4882a593Smuzhiyun }
111*4882a593Smuzhiyun
112*4882a593Smuzhiyun /**
113*4882a593Smuzhiyun * ubi_vtbl_rename_volumes - rename UBI volumes in the volume table.
114*4882a593Smuzhiyun * @ubi: UBI device description object
115*4882a593Smuzhiyun * @rename_list: list of &struct ubi_rename_entry objects
116*4882a593Smuzhiyun *
117*4882a593Smuzhiyun * This function re-names multiple volumes specified in @req in the volume
118*4882a593Smuzhiyun * table. Returns zero in case of success and a negative error code in case of
119*4882a593Smuzhiyun * failure.
120*4882a593Smuzhiyun */
ubi_vtbl_rename_volumes(struct ubi_device * ubi,struct list_head * rename_list)121*4882a593Smuzhiyun int ubi_vtbl_rename_volumes(struct ubi_device *ubi,
122*4882a593Smuzhiyun struct list_head *rename_list)
123*4882a593Smuzhiyun {
124*4882a593Smuzhiyun struct ubi_rename_entry *re;
125*4882a593Smuzhiyun
126*4882a593Smuzhiyun list_for_each_entry(re, rename_list, list) {
127*4882a593Smuzhiyun uint32_t crc;
128*4882a593Smuzhiyun struct ubi_volume *vol = re->desc->vol;
129*4882a593Smuzhiyun struct ubi_vtbl_record *vtbl_rec = &ubi->vtbl[vol->vol_id];
130*4882a593Smuzhiyun
131*4882a593Smuzhiyun if (re->remove) {
132*4882a593Smuzhiyun memcpy(vtbl_rec, &empty_vtbl_record,
133*4882a593Smuzhiyun sizeof(struct ubi_vtbl_record));
134*4882a593Smuzhiyun continue;
135*4882a593Smuzhiyun }
136*4882a593Smuzhiyun
137*4882a593Smuzhiyun vtbl_rec->name_len = cpu_to_be16(re->new_name_len);
138*4882a593Smuzhiyun memcpy(vtbl_rec->name, re->new_name, re->new_name_len);
139*4882a593Smuzhiyun memset(vtbl_rec->name + re->new_name_len, 0,
140*4882a593Smuzhiyun UBI_VOL_NAME_MAX + 1 - re->new_name_len);
141*4882a593Smuzhiyun crc = crc32(UBI_CRC32_INIT, vtbl_rec,
142*4882a593Smuzhiyun UBI_VTBL_RECORD_SIZE_CRC);
143*4882a593Smuzhiyun vtbl_rec->crc = cpu_to_be32(crc);
144*4882a593Smuzhiyun }
145*4882a593Smuzhiyun
146*4882a593Smuzhiyun return ubi_update_layout_vol(ubi);
147*4882a593Smuzhiyun }
148*4882a593Smuzhiyun
149*4882a593Smuzhiyun /**
150*4882a593Smuzhiyun * vtbl_check - check if volume table is not corrupted and sensible.
151*4882a593Smuzhiyun * @ubi: UBI device description object
152*4882a593Smuzhiyun * @vtbl: volume table
153*4882a593Smuzhiyun *
154*4882a593Smuzhiyun * This function returns zero if @vtbl is all right, %1 if CRC is incorrect,
155*4882a593Smuzhiyun * and %-EINVAL if it contains inconsistent data.
156*4882a593Smuzhiyun */
vtbl_check(const struct ubi_device * ubi,const struct ubi_vtbl_record * vtbl)157*4882a593Smuzhiyun static int vtbl_check(const struct ubi_device *ubi,
158*4882a593Smuzhiyun const struct ubi_vtbl_record *vtbl)
159*4882a593Smuzhiyun {
160*4882a593Smuzhiyun int i, n, reserved_pebs, alignment, data_pad, vol_type, name_len;
161*4882a593Smuzhiyun int upd_marker, err;
162*4882a593Smuzhiyun uint32_t crc;
163*4882a593Smuzhiyun const char *name;
164*4882a593Smuzhiyun
165*4882a593Smuzhiyun for (i = 0; i < ubi->vtbl_slots; i++) {
166*4882a593Smuzhiyun cond_resched();
167*4882a593Smuzhiyun
168*4882a593Smuzhiyun reserved_pebs = be32_to_cpu(vtbl[i].reserved_pebs);
169*4882a593Smuzhiyun alignment = be32_to_cpu(vtbl[i].alignment);
170*4882a593Smuzhiyun data_pad = be32_to_cpu(vtbl[i].data_pad);
171*4882a593Smuzhiyun upd_marker = vtbl[i].upd_marker;
172*4882a593Smuzhiyun vol_type = vtbl[i].vol_type;
173*4882a593Smuzhiyun name_len = be16_to_cpu(vtbl[i].name_len);
174*4882a593Smuzhiyun name = &vtbl[i].name[0];
175*4882a593Smuzhiyun
176*4882a593Smuzhiyun crc = crc32(UBI_CRC32_INIT, &vtbl[i], UBI_VTBL_RECORD_SIZE_CRC);
177*4882a593Smuzhiyun if (be32_to_cpu(vtbl[i].crc) != crc) {
178*4882a593Smuzhiyun ubi_err(ubi, "bad CRC at record %u: %#08x, not %#08x",
179*4882a593Smuzhiyun i, crc, be32_to_cpu(vtbl[i].crc));
180*4882a593Smuzhiyun ubi_dump_vtbl_record(&vtbl[i], i);
181*4882a593Smuzhiyun return 1;
182*4882a593Smuzhiyun }
183*4882a593Smuzhiyun
184*4882a593Smuzhiyun if (reserved_pebs == 0) {
185*4882a593Smuzhiyun if (memcmp(&vtbl[i], &empty_vtbl_record,
186*4882a593Smuzhiyun UBI_VTBL_RECORD_SIZE)) {
187*4882a593Smuzhiyun err = 2;
188*4882a593Smuzhiyun goto bad;
189*4882a593Smuzhiyun }
190*4882a593Smuzhiyun continue;
191*4882a593Smuzhiyun }
192*4882a593Smuzhiyun
193*4882a593Smuzhiyun if (reserved_pebs < 0 || alignment < 0 || data_pad < 0 ||
194*4882a593Smuzhiyun name_len < 0) {
195*4882a593Smuzhiyun err = 3;
196*4882a593Smuzhiyun goto bad;
197*4882a593Smuzhiyun }
198*4882a593Smuzhiyun
199*4882a593Smuzhiyun if (alignment > ubi->leb_size || alignment == 0) {
200*4882a593Smuzhiyun err = 4;
201*4882a593Smuzhiyun goto bad;
202*4882a593Smuzhiyun }
203*4882a593Smuzhiyun
204*4882a593Smuzhiyun n = alignment & (ubi->min_io_size - 1);
205*4882a593Smuzhiyun if (alignment != 1 && n) {
206*4882a593Smuzhiyun err = 5;
207*4882a593Smuzhiyun goto bad;
208*4882a593Smuzhiyun }
209*4882a593Smuzhiyun
210*4882a593Smuzhiyun n = ubi->leb_size % alignment;
211*4882a593Smuzhiyun if (data_pad != n) {
212*4882a593Smuzhiyun ubi_err(ubi, "bad data_pad, has to be %d", n);
213*4882a593Smuzhiyun err = 6;
214*4882a593Smuzhiyun goto bad;
215*4882a593Smuzhiyun }
216*4882a593Smuzhiyun
217*4882a593Smuzhiyun if (vol_type != UBI_VID_DYNAMIC && vol_type != UBI_VID_STATIC) {
218*4882a593Smuzhiyun err = 7;
219*4882a593Smuzhiyun goto bad;
220*4882a593Smuzhiyun }
221*4882a593Smuzhiyun
222*4882a593Smuzhiyun if (upd_marker != 0 && upd_marker != 1) {
223*4882a593Smuzhiyun err = 8;
224*4882a593Smuzhiyun goto bad;
225*4882a593Smuzhiyun }
226*4882a593Smuzhiyun
227*4882a593Smuzhiyun if (reserved_pebs > ubi->good_peb_count) {
228*4882a593Smuzhiyun ubi_err(ubi, "too large reserved_pebs %d, good PEBs %d",
229*4882a593Smuzhiyun reserved_pebs, ubi->good_peb_count);
230*4882a593Smuzhiyun err = 9;
231*4882a593Smuzhiyun goto bad;
232*4882a593Smuzhiyun }
233*4882a593Smuzhiyun
234*4882a593Smuzhiyun if (name_len > UBI_VOL_NAME_MAX) {
235*4882a593Smuzhiyun err = 10;
236*4882a593Smuzhiyun goto bad;
237*4882a593Smuzhiyun }
238*4882a593Smuzhiyun
239*4882a593Smuzhiyun if (name[0] == '\0') {
240*4882a593Smuzhiyun err = 11;
241*4882a593Smuzhiyun goto bad;
242*4882a593Smuzhiyun }
243*4882a593Smuzhiyun
244*4882a593Smuzhiyun if (name_len != strnlen(name, name_len + 1)) {
245*4882a593Smuzhiyun err = 12;
246*4882a593Smuzhiyun goto bad;
247*4882a593Smuzhiyun }
248*4882a593Smuzhiyun }
249*4882a593Smuzhiyun
250*4882a593Smuzhiyun /* Checks that all names are unique */
251*4882a593Smuzhiyun for (i = 0; i < ubi->vtbl_slots - 1; i++) {
252*4882a593Smuzhiyun for (n = i + 1; n < ubi->vtbl_slots; n++) {
253*4882a593Smuzhiyun int len1 = be16_to_cpu(vtbl[i].name_len);
254*4882a593Smuzhiyun int len2 = be16_to_cpu(vtbl[n].name_len);
255*4882a593Smuzhiyun
256*4882a593Smuzhiyun if (len1 > 0 && len1 == len2 &&
257*4882a593Smuzhiyun !strncmp(vtbl[i].name, vtbl[n].name, len1)) {
258*4882a593Smuzhiyun ubi_err(ubi, "volumes %d and %d have the same name \"%s\"",
259*4882a593Smuzhiyun i, n, vtbl[i].name);
260*4882a593Smuzhiyun ubi_dump_vtbl_record(&vtbl[i], i);
261*4882a593Smuzhiyun ubi_dump_vtbl_record(&vtbl[n], n);
262*4882a593Smuzhiyun return -EINVAL;
263*4882a593Smuzhiyun }
264*4882a593Smuzhiyun }
265*4882a593Smuzhiyun }
266*4882a593Smuzhiyun
267*4882a593Smuzhiyun return 0;
268*4882a593Smuzhiyun
269*4882a593Smuzhiyun bad:
270*4882a593Smuzhiyun ubi_err(ubi, "volume table check failed: record %d, error %d", i, err);
271*4882a593Smuzhiyun ubi_dump_vtbl_record(&vtbl[i], i);
272*4882a593Smuzhiyun return -EINVAL;
273*4882a593Smuzhiyun }
274*4882a593Smuzhiyun
275*4882a593Smuzhiyun /**
276*4882a593Smuzhiyun * create_vtbl - create a copy of volume table.
277*4882a593Smuzhiyun * @ubi: UBI device description object
278*4882a593Smuzhiyun * @ai: attaching information
279*4882a593Smuzhiyun * @copy: number of the volume table copy
280*4882a593Smuzhiyun * @vtbl: contents of the volume table
281*4882a593Smuzhiyun *
282*4882a593Smuzhiyun * This function returns zero in case of success and a negative error code in
283*4882a593Smuzhiyun * case of failure.
284*4882a593Smuzhiyun */
create_vtbl(struct ubi_device * ubi,struct ubi_attach_info * ai,int copy,void * vtbl)285*4882a593Smuzhiyun static int create_vtbl(struct ubi_device *ubi, struct ubi_attach_info *ai,
286*4882a593Smuzhiyun int copy, void *vtbl)
287*4882a593Smuzhiyun {
288*4882a593Smuzhiyun int err, tries = 0;
289*4882a593Smuzhiyun struct ubi_vid_io_buf *vidb;
290*4882a593Smuzhiyun struct ubi_vid_hdr *vid_hdr;
291*4882a593Smuzhiyun struct ubi_ainf_peb *new_aeb;
292*4882a593Smuzhiyun
293*4882a593Smuzhiyun dbg_gen("create volume table (copy #%d)", copy + 1);
294*4882a593Smuzhiyun
295*4882a593Smuzhiyun vidb = ubi_alloc_vid_buf(ubi, GFP_KERNEL);
296*4882a593Smuzhiyun if (!vidb)
297*4882a593Smuzhiyun return -ENOMEM;
298*4882a593Smuzhiyun
299*4882a593Smuzhiyun vid_hdr = ubi_get_vid_hdr(vidb);
300*4882a593Smuzhiyun
301*4882a593Smuzhiyun retry:
302*4882a593Smuzhiyun new_aeb = ubi_early_get_peb(ubi, ai);
303*4882a593Smuzhiyun if (IS_ERR(new_aeb)) {
304*4882a593Smuzhiyun err = PTR_ERR(new_aeb);
305*4882a593Smuzhiyun goto out_free;
306*4882a593Smuzhiyun }
307*4882a593Smuzhiyun
308*4882a593Smuzhiyun vid_hdr->vol_type = UBI_LAYOUT_VOLUME_TYPE;
309*4882a593Smuzhiyun vid_hdr->vol_id = cpu_to_be32(UBI_LAYOUT_VOLUME_ID);
310*4882a593Smuzhiyun vid_hdr->compat = UBI_LAYOUT_VOLUME_COMPAT;
311*4882a593Smuzhiyun vid_hdr->data_size = vid_hdr->used_ebs =
312*4882a593Smuzhiyun vid_hdr->data_pad = cpu_to_be32(0);
313*4882a593Smuzhiyun vid_hdr->lnum = cpu_to_be32(copy);
314*4882a593Smuzhiyun vid_hdr->sqnum = cpu_to_be64(++ai->max_sqnum);
315*4882a593Smuzhiyun
316*4882a593Smuzhiyun /* The EC header is already there, write the VID header */
317*4882a593Smuzhiyun err = ubi_io_write_vid_hdr(ubi, new_aeb->pnum, vidb);
318*4882a593Smuzhiyun if (err)
319*4882a593Smuzhiyun goto write_error;
320*4882a593Smuzhiyun
321*4882a593Smuzhiyun /* Write the layout volume contents */
322*4882a593Smuzhiyun err = ubi_io_write_data(ubi, vtbl, new_aeb->pnum, 0, ubi->vtbl_size);
323*4882a593Smuzhiyun if (err)
324*4882a593Smuzhiyun goto write_error;
325*4882a593Smuzhiyun
326*4882a593Smuzhiyun /*
327*4882a593Smuzhiyun * And add it to the attaching information. Don't delete the old version
328*4882a593Smuzhiyun * of this LEB as it will be deleted and freed in 'ubi_add_to_av()'.
329*4882a593Smuzhiyun */
330*4882a593Smuzhiyun err = ubi_add_to_av(ubi, ai, new_aeb->pnum, new_aeb->ec, vid_hdr, 0);
331*4882a593Smuzhiyun ubi_free_aeb(ai, new_aeb);
332*4882a593Smuzhiyun ubi_free_vid_buf(vidb);
333*4882a593Smuzhiyun return err;
334*4882a593Smuzhiyun
335*4882a593Smuzhiyun write_error:
336*4882a593Smuzhiyun if (err == -EIO && ++tries <= 5) {
337*4882a593Smuzhiyun /*
338*4882a593Smuzhiyun * Probably this physical eraseblock went bad, try to pick
339*4882a593Smuzhiyun * another one.
340*4882a593Smuzhiyun */
341*4882a593Smuzhiyun list_add(&new_aeb->u.list, &ai->erase);
342*4882a593Smuzhiyun goto retry;
343*4882a593Smuzhiyun }
344*4882a593Smuzhiyun ubi_free_aeb(ai, new_aeb);
345*4882a593Smuzhiyun out_free:
346*4882a593Smuzhiyun ubi_free_vid_buf(vidb);
347*4882a593Smuzhiyun return err;
348*4882a593Smuzhiyun
349*4882a593Smuzhiyun }
350*4882a593Smuzhiyun
351*4882a593Smuzhiyun /**
352*4882a593Smuzhiyun * process_lvol - process the layout volume.
353*4882a593Smuzhiyun * @ubi: UBI device description object
354*4882a593Smuzhiyun * @ai: attaching information
355*4882a593Smuzhiyun * @av: layout volume attaching information
356*4882a593Smuzhiyun *
357*4882a593Smuzhiyun * This function is responsible for reading the layout volume, ensuring it is
358*4882a593Smuzhiyun * not corrupted, and recovering from corruptions if needed. Returns volume
359*4882a593Smuzhiyun * table in case of success and a negative error code in case of failure.
360*4882a593Smuzhiyun */
process_lvol(struct ubi_device * ubi,struct ubi_attach_info * ai,struct ubi_ainf_volume * av)361*4882a593Smuzhiyun static struct ubi_vtbl_record *process_lvol(struct ubi_device *ubi,
362*4882a593Smuzhiyun struct ubi_attach_info *ai,
363*4882a593Smuzhiyun struct ubi_ainf_volume *av)
364*4882a593Smuzhiyun {
365*4882a593Smuzhiyun int err;
366*4882a593Smuzhiyun struct rb_node *rb;
367*4882a593Smuzhiyun struct ubi_ainf_peb *aeb;
368*4882a593Smuzhiyun struct ubi_vtbl_record *leb[UBI_LAYOUT_VOLUME_EBS] = { NULL, NULL };
369*4882a593Smuzhiyun int leb_corrupted[UBI_LAYOUT_VOLUME_EBS] = {1, 1};
370*4882a593Smuzhiyun
371*4882a593Smuzhiyun /*
372*4882a593Smuzhiyun * UBI goes through the following steps when it changes the layout
373*4882a593Smuzhiyun * volume:
374*4882a593Smuzhiyun * a. erase LEB 0;
375*4882a593Smuzhiyun * b. write new data to LEB 0;
376*4882a593Smuzhiyun * c. erase LEB 1;
377*4882a593Smuzhiyun * d. write new data to LEB 1.
378*4882a593Smuzhiyun *
379*4882a593Smuzhiyun * Before the change, both LEBs contain the same data.
380*4882a593Smuzhiyun *
381*4882a593Smuzhiyun * Due to unclean reboots, the contents of LEB 0 may be lost, but there
382*4882a593Smuzhiyun * should LEB 1. So it is OK if LEB 0 is corrupted while LEB 1 is not.
383*4882a593Smuzhiyun * Similarly, LEB 1 may be lost, but there should be LEB 0. And
384*4882a593Smuzhiyun * finally, unclean reboots may result in a situation when neither LEB
385*4882a593Smuzhiyun * 0 nor LEB 1 are corrupted, but they are different. In this case, LEB
386*4882a593Smuzhiyun * 0 contains more recent information.
387*4882a593Smuzhiyun *
388*4882a593Smuzhiyun * So the plan is to first check LEB 0. Then
389*4882a593Smuzhiyun * a. if LEB 0 is OK, it must be containing the most recent data; then
390*4882a593Smuzhiyun * we compare it with LEB 1, and if they are different, we copy LEB
391*4882a593Smuzhiyun * 0 to LEB 1;
392*4882a593Smuzhiyun * b. if LEB 0 is corrupted, but LEB 1 has to be OK, and we copy LEB 1
393*4882a593Smuzhiyun * to LEB 0.
394*4882a593Smuzhiyun */
395*4882a593Smuzhiyun
396*4882a593Smuzhiyun dbg_gen("check layout volume");
397*4882a593Smuzhiyun
398*4882a593Smuzhiyun /* Read both LEB 0 and LEB 1 into memory */
399*4882a593Smuzhiyun ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb) {
400*4882a593Smuzhiyun leb[aeb->lnum] = vzalloc(ubi->vtbl_size);
401*4882a593Smuzhiyun if (!leb[aeb->lnum]) {
402*4882a593Smuzhiyun err = -ENOMEM;
403*4882a593Smuzhiyun goto out_free;
404*4882a593Smuzhiyun }
405*4882a593Smuzhiyun
406*4882a593Smuzhiyun err = ubi_io_read_data(ubi, leb[aeb->lnum], aeb->pnum, 0,
407*4882a593Smuzhiyun ubi->vtbl_size);
408*4882a593Smuzhiyun if (err == UBI_IO_BITFLIPS || mtd_is_eccerr(err))
409*4882a593Smuzhiyun /*
410*4882a593Smuzhiyun * Scrub the PEB later. Note, -EBADMSG indicates an
411*4882a593Smuzhiyun * uncorrectable ECC error, but we have our own CRC and
412*4882a593Smuzhiyun * the data will be checked later. If the data is OK,
413*4882a593Smuzhiyun * the PEB will be scrubbed (because we set
414*4882a593Smuzhiyun * aeb->scrub). If the data is not OK, the contents of
415*4882a593Smuzhiyun * the PEB will be recovered from the second copy, and
416*4882a593Smuzhiyun * aeb->scrub will be cleared in
417*4882a593Smuzhiyun * 'ubi_add_to_av()'.
418*4882a593Smuzhiyun */
419*4882a593Smuzhiyun aeb->scrub = 1;
420*4882a593Smuzhiyun else if (err)
421*4882a593Smuzhiyun goto out_free;
422*4882a593Smuzhiyun }
423*4882a593Smuzhiyun
424*4882a593Smuzhiyun err = -EINVAL;
425*4882a593Smuzhiyun if (leb[0]) {
426*4882a593Smuzhiyun leb_corrupted[0] = vtbl_check(ubi, leb[0]);
427*4882a593Smuzhiyun if (leb_corrupted[0] < 0)
428*4882a593Smuzhiyun goto out_free;
429*4882a593Smuzhiyun }
430*4882a593Smuzhiyun
431*4882a593Smuzhiyun if (!leb_corrupted[0]) {
432*4882a593Smuzhiyun /* LEB 0 is OK */
433*4882a593Smuzhiyun if (leb[1])
434*4882a593Smuzhiyun leb_corrupted[1] = memcmp(leb[0], leb[1],
435*4882a593Smuzhiyun ubi->vtbl_size);
436*4882a593Smuzhiyun if (leb_corrupted[1]) {
437*4882a593Smuzhiyun ubi_warn(ubi, "volume table copy #2 is corrupted");
438*4882a593Smuzhiyun err = create_vtbl(ubi, ai, 1, leb[0]);
439*4882a593Smuzhiyun if (err)
440*4882a593Smuzhiyun goto out_free;
441*4882a593Smuzhiyun ubi_msg(ubi, "volume table was restored");
442*4882a593Smuzhiyun }
443*4882a593Smuzhiyun
444*4882a593Smuzhiyun /* Both LEB 1 and LEB 2 are OK and consistent */
445*4882a593Smuzhiyun vfree(leb[1]);
446*4882a593Smuzhiyun return leb[0];
447*4882a593Smuzhiyun } else {
448*4882a593Smuzhiyun /* LEB 0 is corrupted or does not exist */
449*4882a593Smuzhiyun if (leb[1]) {
450*4882a593Smuzhiyun leb_corrupted[1] = vtbl_check(ubi, leb[1]);
451*4882a593Smuzhiyun if (leb_corrupted[1] < 0)
452*4882a593Smuzhiyun goto out_free;
453*4882a593Smuzhiyun }
454*4882a593Smuzhiyun if (leb_corrupted[1]) {
455*4882a593Smuzhiyun /* Both LEB 0 and LEB 1 are corrupted */
456*4882a593Smuzhiyun ubi_err(ubi, "both volume tables are corrupted");
457*4882a593Smuzhiyun goto out_free;
458*4882a593Smuzhiyun }
459*4882a593Smuzhiyun
460*4882a593Smuzhiyun ubi_warn(ubi, "volume table copy #1 is corrupted");
461*4882a593Smuzhiyun err = create_vtbl(ubi, ai, 0, leb[1]);
462*4882a593Smuzhiyun if (err)
463*4882a593Smuzhiyun goto out_free;
464*4882a593Smuzhiyun ubi_msg(ubi, "volume table was restored");
465*4882a593Smuzhiyun
466*4882a593Smuzhiyun vfree(leb[0]);
467*4882a593Smuzhiyun return leb[1];
468*4882a593Smuzhiyun }
469*4882a593Smuzhiyun
470*4882a593Smuzhiyun out_free:
471*4882a593Smuzhiyun vfree(leb[0]);
472*4882a593Smuzhiyun vfree(leb[1]);
473*4882a593Smuzhiyun return ERR_PTR(err);
474*4882a593Smuzhiyun }
475*4882a593Smuzhiyun
476*4882a593Smuzhiyun /**
477*4882a593Smuzhiyun * create_empty_lvol - create empty layout volume.
478*4882a593Smuzhiyun * @ubi: UBI device description object
479*4882a593Smuzhiyun * @ai: attaching information
480*4882a593Smuzhiyun *
481*4882a593Smuzhiyun * This function returns volume table contents in case of success and a
482*4882a593Smuzhiyun * negative error code in case of failure.
483*4882a593Smuzhiyun */
create_empty_lvol(struct ubi_device * ubi,struct ubi_attach_info * ai)484*4882a593Smuzhiyun static struct ubi_vtbl_record *create_empty_lvol(struct ubi_device *ubi,
485*4882a593Smuzhiyun struct ubi_attach_info *ai)
486*4882a593Smuzhiyun {
487*4882a593Smuzhiyun int i;
488*4882a593Smuzhiyun struct ubi_vtbl_record *vtbl;
489*4882a593Smuzhiyun
490*4882a593Smuzhiyun vtbl = vzalloc(ubi->vtbl_size);
491*4882a593Smuzhiyun if (!vtbl)
492*4882a593Smuzhiyun return ERR_PTR(-ENOMEM);
493*4882a593Smuzhiyun
494*4882a593Smuzhiyun for (i = 0; i < ubi->vtbl_slots; i++)
495*4882a593Smuzhiyun memcpy(&vtbl[i], &empty_vtbl_record, UBI_VTBL_RECORD_SIZE);
496*4882a593Smuzhiyun
497*4882a593Smuzhiyun for (i = 0; i < UBI_LAYOUT_VOLUME_EBS; i++) {
498*4882a593Smuzhiyun int err;
499*4882a593Smuzhiyun
500*4882a593Smuzhiyun err = create_vtbl(ubi, ai, i, vtbl);
501*4882a593Smuzhiyun if (err) {
502*4882a593Smuzhiyun vfree(vtbl);
503*4882a593Smuzhiyun return ERR_PTR(err);
504*4882a593Smuzhiyun }
505*4882a593Smuzhiyun }
506*4882a593Smuzhiyun
507*4882a593Smuzhiyun return vtbl;
508*4882a593Smuzhiyun }
509*4882a593Smuzhiyun
510*4882a593Smuzhiyun /**
511*4882a593Smuzhiyun * init_volumes - initialize volume information for existing volumes.
512*4882a593Smuzhiyun * @ubi: UBI device description object
513*4882a593Smuzhiyun * @ai: scanning information
514*4882a593Smuzhiyun * @vtbl: volume table
515*4882a593Smuzhiyun *
516*4882a593Smuzhiyun * This function allocates volume description objects for existing volumes.
517*4882a593Smuzhiyun * Returns zero in case of success and a negative error code in case of
518*4882a593Smuzhiyun * failure.
519*4882a593Smuzhiyun */
init_volumes(struct ubi_device * ubi,const struct ubi_attach_info * ai,const struct ubi_vtbl_record * vtbl)520*4882a593Smuzhiyun static int init_volumes(struct ubi_device *ubi,
521*4882a593Smuzhiyun const struct ubi_attach_info *ai,
522*4882a593Smuzhiyun const struct ubi_vtbl_record *vtbl)
523*4882a593Smuzhiyun {
524*4882a593Smuzhiyun int i, err, reserved_pebs = 0;
525*4882a593Smuzhiyun struct ubi_ainf_volume *av;
526*4882a593Smuzhiyun struct ubi_volume *vol;
527*4882a593Smuzhiyun
528*4882a593Smuzhiyun for (i = 0; i < ubi->vtbl_slots; i++) {
529*4882a593Smuzhiyun cond_resched();
530*4882a593Smuzhiyun
531*4882a593Smuzhiyun if (be32_to_cpu(vtbl[i].reserved_pebs) == 0)
532*4882a593Smuzhiyun continue; /* Empty record */
533*4882a593Smuzhiyun
534*4882a593Smuzhiyun vol = kzalloc(sizeof(struct ubi_volume), GFP_KERNEL);
535*4882a593Smuzhiyun if (!vol)
536*4882a593Smuzhiyun return -ENOMEM;
537*4882a593Smuzhiyun
538*4882a593Smuzhiyun vol->reserved_pebs = be32_to_cpu(vtbl[i].reserved_pebs);
539*4882a593Smuzhiyun vol->alignment = be32_to_cpu(vtbl[i].alignment);
540*4882a593Smuzhiyun vol->data_pad = be32_to_cpu(vtbl[i].data_pad);
541*4882a593Smuzhiyun vol->upd_marker = vtbl[i].upd_marker;
542*4882a593Smuzhiyun vol->vol_type = vtbl[i].vol_type == UBI_VID_DYNAMIC ?
543*4882a593Smuzhiyun UBI_DYNAMIC_VOLUME : UBI_STATIC_VOLUME;
544*4882a593Smuzhiyun vol->name_len = be16_to_cpu(vtbl[i].name_len);
545*4882a593Smuzhiyun vol->usable_leb_size = ubi->leb_size - vol->data_pad;
546*4882a593Smuzhiyun memcpy(vol->name, vtbl[i].name, vol->name_len);
547*4882a593Smuzhiyun vol->name[vol->name_len] = '\0';
548*4882a593Smuzhiyun vol->vol_id = i;
549*4882a593Smuzhiyun
550*4882a593Smuzhiyun if (vtbl[i].flags & UBI_VTBL_SKIP_CRC_CHECK_FLG)
551*4882a593Smuzhiyun vol->skip_check = 1;
552*4882a593Smuzhiyun
553*4882a593Smuzhiyun if (vtbl[i].flags & UBI_VTBL_AUTORESIZE_FLG) {
554*4882a593Smuzhiyun /* Auto re-size flag may be set only for one volume */
555*4882a593Smuzhiyun if (ubi->autoresize_vol_id != -1) {
556*4882a593Smuzhiyun ubi_err(ubi, "more than one auto-resize volume (%d and %d)",
557*4882a593Smuzhiyun ubi->autoresize_vol_id, i);
558*4882a593Smuzhiyun kfree(vol);
559*4882a593Smuzhiyun return -EINVAL;
560*4882a593Smuzhiyun }
561*4882a593Smuzhiyun
562*4882a593Smuzhiyun ubi->autoresize_vol_id = i;
563*4882a593Smuzhiyun }
564*4882a593Smuzhiyun
565*4882a593Smuzhiyun ubi_assert(!ubi->volumes[i]);
566*4882a593Smuzhiyun ubi->volumes[i] = vol;
567*4882a593Smuzhiyun ubi->vol_count += 1;
568*4882a593Smuzhiyun vol->ubi = ubi;
569*4882a593Smuzhiyun reserved_pebs += vol->reserved_pebs;
570*4882a593Smuzhiyun
571*4882a593Smuzhiyun /*
572*4882a593Smuzhiyun * We use ubi->peb_count and not vol->reserved_pebs because
573*4882a593Smuzhiyun * we want to keep the code simple. Otherwise we'd have to
574*4882a593Smuzhiyun * resize/check the bitmap upon volume resize too.
575*4882a593Smuzhiyun * Allocating a few bytes more does not hurt.
576*4882a593Smuzhiyun */
577*4882a593Smuzhiyun err = ubi_fastmap_init_checkmap(vol, ubi->peb_count);
578*4882a593Smuzhiyun if (err)
579*4882a593Smuzhiyun return err;
580*4882a593Smuzhiyun
581*4882a593Smuzhiyun /*
582*4882a593Smuzhiyun * In case of dynamic volume UBI knows nothing about how many
583*4882a593Smuzhiyun * data is stored there. So assume the whole volume is used.
584*4882a593Smuzhiyun */
585*4882a593Smuzhiyun if (vol->vol_type == UBI_DYNAMIC_VOLUME) {
586*4882a593Smuzhiyun vol->used_ebs = vol->reserved_pebs;
587*4882a593Smuzhiyun vol->last_eb_bytes = vol->usable_leb_size;
588*4882a593Smuzhiyun vol->used_bytes =
589*4882a593Smuzhiyun (long long)vol->used_ebs * vol->usable_leb_size;
590*4882a593Smuzhiyun continue;
591*4882a593Smuzhiyun }
592*4882a593Smuzhiyun
593*4882a593Smuzhiyun /* Static volumes only */
594*4882a593Smuzhiyun av = ubi_find_av(ai, i);
595*4882a593Smuzhiyun if (!av || !av->leb_count) {
596*4882a593Smuzhiyun /*
597*4882a593Smuzhiyun * No eraseblocks belonging to this volume found. We
598*4882a593Smuzhiyun * don't actually know whether this static volume is
599*4882a593Smuzhiyun * completely corrupted or just contains no data. And
600*4882a593Smuzhiyun * we cannot know this as long as data size is not
601*4882a593Smuzhiyun * stored on flash. So we just assume the volume is
602*4882a593Smuzhiyun * empty. FIXME: this should be handled.
603*4882a593Smuzhiyun */
604*4882a593Smuzhiyun continue;
605*4882a593Smuzhiyun }
606*4882a593Smuzhiyun
607*4882a593Smuzhiyun if (av->leb_count != av->used_ebs) {
608*4882a593Smuzhiyun /*
609*4882a593Smuzhiyun * We found a static volume which misses several
610*4882a593Smuzhiyun * eraseblocks. Treat it as corrupted.
611*4882a593Smuzhiyun */
612*4882a593Smuzhiyun ubi_warn(ubi, "static volume %d misses %d LEBs - corrupted",
613*4882a593Smuzhiyun av->vol_id, av->used_ebs - av->leb_count);
614*4882a593Smuzhiyun vol->corrupted = 1;
615*4882a593Smuzhiyun continue;
616*4882a593Smuzhiyun }
617*4882a593Smuzhiyun
618*4882a593Smuzhiyun vol->used_ebs = av->used_ebs;
619*4882a593Smuzhiyun vol->used_bytes =
620*4882a593Smuzhiyun (long long)(vol->used_ebs - 1) * vol->usable_leb_size;
621*4882a593Smuzhiyun vol->used_bytes += av->last_data_size;
622*4882a593Smuzhiyun vol->last_eb_bytes = av->last_data_size;
623*4882a593Smuzhiyun }
624*4882a593Smuzhiyun
625*4882a593Smuzhiyun /* And add the layout volume */
626*4882a593Smuzhiyun vol = kzalloc(sizeof(struct ubi_volume), GFP_KERNEL);
627*4882a593Smuzhiyun if (!vol)
628*4882a593Smuzhiyun return -ENOMEM;
629*4882a593Smuzhiyun
630*4882a593Smuzhiyun vol->reserved_pebs = UBI_LAYOUT_VOLUME_EBS;
631*4882a593Smuzhiyun vol->alignment = UBI_LAYOUT_VOLUME_ALIGN;
632*4882a593Smuzhiyun vol->vol_type = UBI_DYNAMIC_VOLUME;
633*4882a593Smuzhiyun vol->name_len = sizeof(UBI_LAYOUT_VOLUME_NAME) - 1;
634*4882a593Smuzhiyun memcpy(vol->name, UBI_LAYOUT_VOLUME_NAME, vol->name_len + 1);
635*4882a593Smuzhiyun vol->usable_leb_size = ubi->leb_size;
636*4882a593Smuzhiyun vol->used_ebs = vol->reserved_pebs;
637*4882a593Smuzhiyun vol->last_eb_bytes = vol->reserved_pebs;
638*4882a593Smuzhiyun vol->used_bytes =
639*4882a593Smuzhiyun (long long)vol->used_ebs * (ubi->leb_size - vol->data_pad);
640*4882a593Smuzhiyun vol->vol_id = UBI_LAYOUT_VOLUME_ID;
641*4882a593Smuzhiyun vol->ref_count = 1;
642*4882a593Smuzhiyun
643*4882a593Smuzhiyun ubi_assert(!ubi->volumes[i]);
644*4882a593Smuzhiyun ubi->volumes[vol_id2idx(ubi, vol->vol_id)] = vol;
645*4882a593Smuzhiyun reserved_pebs += vol->reserved_pebs;
646*4882a593Smuzhiyun ubi->vol_count += 1;
647*4882a593Smuzhiyun vol->ubi = ubi;
648*4882a593Smuzhiyun err = ubi_fastmap_init_checkmap(vol, UBI_LAYOUT_VOLUME_EBS);
649*4882a593Smuzhiyun if (err)
650*4882a593Smuzhiyun return err;
651*4882a593Smuzhiyun
652*4882a593Smuzhiyun if (reserved_pebs > ubi->avail_pebs) {
653*4882a593Smuzhiyun ubi_err(ubi, "not enough PEBs, required %d, available %d",
654*4882a593Smuzhiyun reserved_pebs, ubi->avail_pebs);
655*4882a593Smuzhiyun if (ubi->corr_peb_count)
656*4882a593Smuzhiyun ubi_err(ubi, "%d PEBs are corrupted and not used",
657*4882a593Smuzhiyun ubi->corr_peb_count);
658*4882a593Smuzhiyun return -ENOSPC;
659*4882a593Smuzhiyun }
660*4882a593Smuzhiyun ubi->rsvd_pebs += reserved_pebs;
661*4882a593Smuzhiyun ubi->avail_pebs -= reserved_pebs;
662*4882a593Smuzhiyun
663*4882a593Smuzhiyun return 0;
664*4882a593Smuzhiyun }
665*4882a593Smuzhiyun
666*4882a593Smuzhiyun /**
667*4882a593Smuzhiyun * check_av - check volume attaching information.
668*4882a593Smuzhiyun * @vol: UBI volume description object
669*4882a593Smuzhiyun * @av: volume attaching information
670*4882a593Smuzhiyun *
671*4882a593Smuzhiyun * This function returns zero if the volume attaching information is consistent
672*4882a593Smuzhiyun * to the data read from the volume tabla, and %-EINVAL if not.
673*4882a593Smuzhiyun */
check_av(const struct ubi_volume * vol,const struct ubi_ainf_volume * av)674*4882a593Smuzhiyun static int check_av(const struct ubi_volume *vol,
675*4882a593Smuzhiyun const struct ubi_ainf_volume *av)
676*4882a593Smuzhiyun {
677*4882a593Smuzhiyun int err;
678*4882a593Smuzhiyun
679*4882a593Smuzhiyun if (av->highest_lnum >= vol->reserved_pebs) {
680*4882a593Smuzhiyun err = 1;
681*4882a593Smuzhiyun goto bad;
682*4882a593Smuzhiyun }
683*4882a593Smuzhiyun if (av->leb_count > vol->reserved_pebs) {
684*4882a593Smuzhiyun err = 2;
685*4882a593Smuzhiyun goto bad;
686*4882a593Smuzhiyun }
687*4882a593Smuzhiyun if (av->vol_type != vol->vol_type) {
688*4882a593Smuzhiyun err = 3;
689*4882a593Smuzhiyun goto bad;
690*4882a593Smuzhiyun }
691*4882a593Smuzhiyun if (av->used_ebs > vol->reserved_pebs) {
692*4882a593Smuzhiyun err = 4;
693*4882a593Smuzhiyun goto bad;
694*4882a593Smuzhiyun }
695*4882a593Smuzhiyun if (av->data_pad != vol->data_pad) {
696*4882a593Smuzhiyun err = 5;
697*4882a593Smuzhiyun goto bad;
698*4882a593Smuzhiyun }
699*4882a593Smuzhiyun return 0;
700*4882a593Smuzhiyun
701*4882a593Smuzhiyun bad:
702*4882a593Smuzhiyun ubi_err(vol->ubi, "bad attaching information, error %d", err);
703*4882a593Smuzhiyun ubi_dump_av(av);
704*4882a593Smuzhiyun ubi_dump_vol_info(vol);
705*4882a593Smuzhiyun return -EINVAL;
706*4882a593Smuzhiyun }
707*4882a593Smuzhiyun
708*4882a593Smuzhiyun /**
709*4882a593Smuzhiyun * check_attaching_info - check that attaching information.
710*4882a593Smuzhiyun * @ubi: UBI device description object
711*4882a593Smuzhiyun * @ai: attaching information
712*4882a593Smuzhiyun *
713*4882a593Smuzhiyun * Even though we protect on-flash data by CRC checksums, we still don't trust
714*4882a593Smuzhiyun * the media. This function ensures that attaching information is consistent to
715*4882a593Smuzhiyun * the information read from the volume table. Returns zero if the attaching
716*4882a593Smuzhiyun * information is OK and %-EINVAL if it is not.
717*4882a593Smuzhiyun */
check_attaching_info(const struct ubi_device * ubi,struct ubi_attach_info * ai)718*4882a593Smuzhiyun static int check_attaching_info(const struct ubi_device *ubi,
719*4882a593Smuzhiyun struct ubi_attach_info *ai)
720*4882a593Smuzhiyun {
721*4882a593Smuzhiyun int err, i;
722*4882a593Smuzhiyun struct ubi_ainf_volume *av;
723*4882a593Smuzhiyun struct ubi_volume *vol;
724*4882a593Smuzhiyun
725*4882a593Smuzhiyun if (ai->vols_found > UBI_INT_VOL_COUNT + ubi->vtbl_slots) {
726*4882a593Smuzhiyun ubi_err(ubi, "found %d volumes while attaching, maximum is %d + %d",
727*4882a593Smuzhiyun ai->vols_found, UBI_INT_VOL_COUNT, ubi->vtbl_slots);
728*4882a593Smuzhiyun return -EINVAL;
729*4882a593Smuzhiyun }
730*4882a593Smuzhiyun
731*4882a593Smuzhiyun if (ai->highest_vol_id >= ubi->vtbl_slots + UBI_INT_VOL_COUNT &&
732*4882a593Smuzhiyun ai->highest_vol_id < UBI_INTERNAL_VOL_START) {
733*4882a593Smuzhiyun ubi_err(ubi, "too large volume ID %d found",
734*4882a593Smuzhiyun ai->highest_vol_id);
735*4882a593Smuzhiyun return -EINVAL;
736*4882a593Smuzhiyun }
737*4882a593Smuzhiyun
738*4882a593Smuzhiyun for (i = 0; i < ubi->vtbl_slots + UBI_INT_VOL_COUNT; i++) {
739*4882a593Smuzhiyun cond_resched();
740*4882a593Smuzhiyun
741*4882a593Smuzhiyun av = ubi_find_av(ai, i);
742*4882a593Smuzhiyun vol = ubi->volumes[i];
743*4882a593Smuzhiyun if (!vol) {
744*4882a593Smuzhiyun if (av)
745*4882a593Smuzhiyun ubi_remove_av(ai, av);
746*4882a593Smuzhiyun continue;
747*4882a593Smuzhiyun }
748*4882a593Smuzhiyun
749*4882a593Smuzhiyun if (vol->reserved_pebs == 0) {
750*4882a593Smuzhiyun ubi_assert(i < ubi->vtbl_slots);
751*4882a593Smuzhiyun
752*4882a593Smuzhiyun if (!av)
753*4882a593Smuzhiyun continue;
754*4882a593Smuzhiyun
755*4882a593Smuzhiyun /*
756*4882a593Smuzhiyun * During attaching we found a volume which does not
757*4882a593Smuzhiyun * exist according to the information in the volume
758*4882a593Smuzhiyun * table. This must have happened due to an unclean
759*4882a593Smuzhiyun * reboot while the volume was being removed. Discard
760*4882a593Smuzhiyun * these eraseblocks.
761*4882a593Smuzhiyun */
762*4882a593Smuzhiyun ubi_msg(ubi, "finish volume %d removal", av->vol_id);
763*4882a593Smuzhiyun ubi_remove_av(ai, av);
764*4882a593Smuzhiyun } else if (av) {
765*4882a593Smuzhiyun err = check_av(vol, av);
766*4882a593Smuzhiyun if (err)
767*4882a593Smuzhiyun return err;
768*4882a593Smuzhiyun }
769*4882a593Smuzhiyun }
770*4882a593Smuzhiyun
771*4882a593Smuzhiyun return 0;
772*4882a593Smuzhiyun }
773*4882a593Smuzhiyun
774*4882a593Smuzhiyun /**
775*4882a593Smuzhiyun * ubi_read_volume_table - read the volume table.
776*4882a593Smuzhiyun * @ubi: UBI device description object
777*4882a593Smuzhiyun * @ai: attaching information
778*4882a593Smuzhiyun *
779*4882a593Smuzhiyun * This function reads volume table, checks it, recover from errors if needed,
780*4882a593Smuzhiyun * or creates it if needed. Returns zero in case of success and a negative
781*4882a593Smuzhiyun * error code in case of failure.
782*4882a593Smuzhiyun */
ubi_read_volume_table(struct ubi_device * ubi,struct ubi_attach_info * ai)783*4882a593Smuzhiyun int ubi_read_volume_table(struct ubi_device *ubi, struct ubi_attach_info *ai)
784*4882a593Smuzhiyun {
785*4882a593Smuzhiyun int err;
786*4882a593Smuzhiyun struct ubi_ainf_volume *av;
787*4882a593Smuzhiyun
788*4882a593Smuzhiyun empty_vtbl_record.crc = cpu_to_be32(0xf116c36b);
789*4882a593Smuzhiyun
790*4882a593Smuzhiyun /*
791*4882a593Smuzhiyun * The number of supported volumes is limited by the eraseblock size
792*4882a593Smuzhiyun * and by the UBI_MAX_VOLUMES constant.
793*4882a593Smuzhiyun */
794*4882a593Smuzhiyun ubi->vtbl_slots = ubi->leb_size / UBI_VTBL_RECORD_SIZE;
795*4882a593Smuzhiyun if (ubi->vtbl_slots > UBI_MAX_VOLUMES)
796*4882a593Smuzhiyun ubi->vtbl_slots = UBI_MAX_VOLUMES;
797*4882a593Smuzhiyun
798*4882a593Smuzhiyun ubi->vtbl_size = ubi->vtbl_slots * UBI_VTBL_RECORD_SIZE;
799*4882a593Smuzhiyun ubi->vtbl_size = ALIGN(ubi->vtbl_size, ubi->min_io_size);
800*4882a593Smuzhiyun
801*4882a593Smuzhiyun av = ubi_find_av(ai, UBI_LAYOUT_VOLUME_ID);
802*4882a593Smuzhiyun if (!av) {
803*4882a593Smuzhiyun /*
804*4882a593Smuzhiyun * No logical eraseblocks belonging to the layout volume were
805*4882a593Smuzhiyun * found. This could mean that the flash is just empty. In
806*4882a593Smuzhiyun * this case we create empty layout volume.
807*4882a593Smuzhiyun *
808*4882a593Smuzhiyun * But if flash is not empty this must be a corruption or the
809*4882a593Smuzhiyun * MTD device just contains garbage.
810*4882a593Smuzhiyun */
811*4882a593Smuzhiyun if (ai->is_empty) {
812*4882a593Smuzhiyun ubi->vtbl = create_empty_lvol(ubi, ai);
813*4882a593Smuzhiyun if (IS_ERR(ubi->vtbl))
814*4882a593Smuzhiyun return PTR_ERR(ubi->vtbl);
815*4882a593Smuzhiyun } else {
816*4882a593Smuzhiyun ubi_err(ubi, "the layout volume was not found");
817*4882a593Smuzhiyun return -EINVAL;
818*4882a593Smuzhiyun }
819*4882a593Smuzhiyun } else {
820*4882a593Smuzhiyun if (av->leb_count > UBI_LAYOUT_VOLUME_EBS) {
821*4882a593Smuzhiyun /* This must not happen with proper UBI images */
822*4882a593Smuzhiyun ubi_err(ubi, "too many LEBs (%d) in layout volume",
823*4882a593Smuzhiyun av->leb_count);
824*4882a593Smuzhiyun return -EINVAL;
825*4882a593Smuzhiyun }
826*4882a593Smuzhiyun
827*4882a593Smuzhiyun ubi->vtbl = process_lvol(ubi, ai, av);
828*4882a593Smuzhiyun if (IS_ERR(ubi->vtbl))
829*4882a593Smuzhiyun return PTR_ERR(ubi->vtbl);
830*4882a593Smuzhiyun }
831*4882a593Smuzhiyun
832*4882a593Smuzhiyun ubi->avail_pebs = ubi->good_peb_count - ubi->corr_peb_count;
833*4882a593Smuzhiyun
834*4882a593Smuzhiyun /*
835*4882a593Smuzhiyun * The layout volume is OK, initialize the corresponding in-RAM data
836*4882a593Smuzhiyun * structures.
837*4882a593Smuzhiyun */
838*4882a593Smuzhiyun err = init_volumes(ubi, ai, ubi->vtbl);
839*4882a593Smuzhiyun if (err)
840*4882a593Smuzhiyun goto out_free;
841*4882a593Smuzhiyun
842*4882a593Smuzhiyun /*
843*4882a593Smuzhiyun * Make sure that the attaching information is consistent to the
844*4882a593Smuzhiyun * information stored in the volume table.
845*4882a593Smuzhiyun */
846*4882a593Smuzhiyun err = check_attaching_info(ubi, ai);
847*4882a593Smuzhiyun if (err)
848*4882a593Smuzhiyun goto out_free;
849*4882a593Smuzhiyun
850*4882a593Smuzhiyun return 0;
851*4882a593Smuzhiyun
852*4882a593Smuzhiyun out_free:
853*4882a593Smuzhiyun vfree(ubi->vtbl);
854*4882a593Smuzhiyun ubi_free_all_volumes(ubi);
855*4882a593Smuzhiyun return err;
856*4882a593Smuzhiyun }
857*4882a593Smuzhiyun
858*4882a593Smuzhiyun /**
859*4882a593Smuzhiyun * self_vtbl_check - check volume table.
860*4882a593Smuzhiyun * @ubi: UBI device description object
861*4882a593Smuzhiyun */
self_vtbl_check(const struct ubi_device * ubi)862*4882a593Smuzhiyun static void self_vtbl_check(const struct ubi_device *ubi)
863*4882a593Smuzhiyun {
864*4882a593Smuzhiyun if (!ubi_dbg_chk_gen(ubi))
865*4882a593Smuzhiyun return;
866*4882a593Smuzhiyun
867*4882a593Smuzhiyun if (vtbl_check(ubi, ubi->vtbl)) {
868*4882a593Smuzhiyun ubi_err(ubi, "self-check failed");
869*4882a593Smuzhiyun BUG();
870*4882a593Smuzhiyun }
871*4882a593Smuzhiyun }
872