aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
-rw-r--r--drivers/mtd/ubi/debug.c4
-rw-r--r--drivers/mtd/ubi/debug.h2
-rw-r--r--drivers/mtd/ubi/eba.c2
-rw-r--r--drivers/mtd/ubi/scan.c36
-rw-r--r--drivers/mtd/ubi/scan.h12
-rw-r--r--drivers/mtd/ubi/vtbl.c10
-rw-r--r--drivers/mtd/ubi/wl.c2
7 files changed, 34 insertions, 34 deletions
diff --git a/drivers/mtd/ubi/debug.c b/drivers/mtd/ubi/debug.c
index a07ce2dcb968..4885fd2526bb 100644
--- a/drivers/mtd/ubi/debug.c
+++ b/drivers/mtd/ubi/debug.c
@@ -171,10 +171,10 @@ void ubi_dump_vtbl_record(const struct ubi_vtbl_record *r, int idx)
171} 171}
172 172
173/** 173/**
174 * ubi_dump_sv - dump a &struct ubi_scan_volume object. 174 * ubi_dump_sv - dump a &struct ubi_ainf_volume object.
175 * @sv: the object to dump 175 * @sv: the object to dump
176 */ 176 */
177void ubi_dump_sv(const struct ubi_scan_volume *sv) 177void ubi_dump_sv(const struct ubi_ainf_volume *sv)
178{ 178{
179 printk(KERN_DEBUG "Volume scanning information dump:\n"); 179 printk(KERN_DEBUG "Volume scanning information dump:\n");
180 printk(KERN_DEBUG "\tvol_id %d\n", sv->vol_id); 180 printk(KERN_DEBUG "\tvol_id %d\n", sv->vol_id);
diff --git a/drivers/mtd/ubi/debug.h b/drivers/mtd/ubi/debug.h
index c6729ff0caa5..041ee4d43dec 100644
--- a/drivers/mtd/ubi/debug.h
+++ b/drivers/mtd/ubi/debug.h
@@ -59,7 +59,7 @@ void ubi_dump_vid_hdr(const struct ubi_vid_hdr *vid_hdr);
59 59
60void ubi_dump_vol_info(const struct ubi_volume *vol); 60void ubi_dump_vol_info(const struct ubi_volume *vol);
61void ubi_dump_vtbl_record(const struct ubi_vtbl_record *r, int idx); 61void ubi_dump_vtbl_record(const struct ubi_vtbl_record *r, int idx);
62void ubi_dump_sv(const struct ubi_scan_volume *sv); 62void ubi_dump_sv(const struct ubi_ainf_volume *sv);
63void ubi_dump_seb(const struct ubi_ainf_peb *seb, int type); 63void ubi_dump_seb(const struct ubi_ainf_peb *seb, int type);
64void ubi_dump_mkvol_req(const struct ubi_mkvol_req *req); 64void ubi_dump_mkvol_req(const struct ubi_mkvol_req *req);
65int ubi_self_check_all_ff(struct ubi_device *ubi, int pnum, int offset, 65int ubi_self_check_all_ff(struct ubi_device *ubi, int pnum, int offset,
diff --git a/drivers/mtd/ubi/eba.c b/drivers/mtd/ubi/eba.c
index ac0e0efba8a5..c8500cb9aaf4 100644
--- a/drivers/mtd/ubi/eba.c
+++ b/drivers/mtd/ubi/eba.c
@@ -1215,7 +1215,7 @@ static void print_rsvd_warning(struct ubi_device *ubi,
1215int ubi_eba_init_scan(struct ubi_device *ubi, struct ubi_scan_info *si) 1215int ubi_eba_init_scan(struct ubi_device *ubi, struct ubi_scan_info *si)
1216{ 1216{
1217 int i, j, err, num_volumes; 1217 int i, j, err, num_volumes;
1218 struct ubi_scan_volume *sv; 1218 struct ubi_ainf_volume *sv;
1219 struct ubi_volume *vol; 1219 struct ubi_volume *vol;
1220 struct ubi_ainf_peb *seb; 1220 struct ubi_ainf_peb *seb;
1221 struct rb_node *rb; 1221 struct rb_node *rb;
diff --git a/drivers/mtd/ubi/scan.c b/drivers/mtd/ubi/scan.c
index cddb60c5defe..5a2a0175a770 100644
--- a/drivers/mtd/ubi/scan.c
+++ b/drivers/mtd/ubi/scan.c
@@ -25,13 +25,13 @@
25 * headers and providing complete information about the UBI flash image. 25 * headers and providing complete information about the UBI flash image.
26 * 26 *
27 * The scanning information is represented by a &struct ubi_scan_info' object. 27 * The scanning information is represented by a &struct ubi_scan_info' object.
28 * Information about found volumes is represented by &struct ubi_scan_volume 28 * Information about found volumes is represented by &struct ubi_ainf_volume
29 * objects which are kept in volume RB-tree with root at the @volumes field. 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. 30 * The RB-tree is indexed by the volume ID.
31 * 31 *
32 * Scanned logical eraseblocks are represented by &struct ubi_ainf_peb objects. 32 * Scanned logical eraseblocks are represented by &struct ubi_ainf_peb objects.
33 * These objects are kept in per-volume RB-trees with the root at the 33 * These objects are kept in per-volume RB-trees with the root at the
34 * corresponding &struct ubi_scan_volume object. To put it differently, we keep 34 * corresponding &struct ubi_ainf_volume object. To put it differently, we keep
35 * an RB-tree of per-volume objects and each of these objects is the root of 35 * an RB-tree of per-volume objects and each of these objects is the root of
36 * RB-tree of per-eraseblock objects. 36 * RB-tree of per-eraseblock objects.
37 * 37 *
@@ -180,7 +180,7 @@ static int add_corrupted(struct ubi_scan_info *si, int pnum, int ec)
180 * headers of the same volume. 180 * headers of the same volume.
181 */ 181 */
182static int validate_vid_hdr(const struct ubi_vid_hdr *vid_hdr, 182static int validate_vid_hdr(const struct ubi_vid_hdr *vid_hdr,
183 const struct ubi_scan_volume *sv, int pnum) 183 const struct ubi_ainf_volume *sv, int pnum)
184{ 184{
185 int vol_type = vid_hdr->vol_type; 185 int vol_type = vid_hdr->vol_type;
186 int vol_id = be32_to_cpu(vid_hdr->vol_id); 186 int vol_id = be32_to_cpu(vid_hdr->vol_id);
@@ -244,11 +244,11 @@ bad:
244 * to the scanning volume object in case of success and a negative error code 244 * to the scanning volume object in case of success and a negative error code
245 * in case of failure. 245 * in case of failure.
246 */ 246 */
247static struct ubi_scan_volume *add_volume(struct ubi_scan_info *si, int vol_id, 247static struct ubi_ainf_volume *add_volume(struct ubi_scan_info *si, int vol_id,
248 int pnum, 248 int pnum,
249 const struct ubi_vid_hdr *vid_hdr) 249 const struct ubi_vid_hdr *vid_hdr)
250{ 250{
251 struct ubi_scan_volume *sv; 251 struct ubi_ainf_volume *sv;
252 struct rb_node **p = &si->volumes.rb_node, *parent = NULL; 252 struct rb_node **p = &si->volumes.rb_node, *parent = NULL;
253 253
254 ubi_assert(vol_id == be32_to_cpu(vid_hdr->vol_id)); 254 ubi_assert(vol_id == be32_to_cpu(vid_hdr->vol_id));
@@ -256,7 +256,7 @@ static struct ubi_scan_volume *add_volume(struct ubi_scan_info *si, int vol_id,
256 /* Walk the volume RB-tree to look if this volume is already present */ 256 /* Walk the volume RB-tree to look if this volume is already present */
257 while (*p) { 257 while (*p) {
258 parent = *p; 258 parent = *p;
259 sv = rb_entry(parent, struct ubi_scan_volume, rb); 259 sv = rb_entry(parent, struct ubi_ainf_volume, rb);
260 260
261 if (vol_id == sv->vol_id) 261 if (vol_id == sv->vol_id)
262 return sv; 262 return sv;
@@ -268,7 +268,7 @@ static struct ubi_scan_volume *add_volume(struct ubi_scan_info *si, int vol_id,
268 } 268 }
269 269
270 /* The volume is absent - add it */ 270 /* The volume is absent - add it */
271 sv = kmalloc(sizeof(struct ubi_scan_volume), GFP_KERNEL); 271 sv = kmalloc(sizeof(struct ubi_ainf_volume), GFP_KERNEL);
272 if (!sv) 272 if (!sv)
273 return ERR_PTR(-ENOMEM); 273 return ERR_PTR(-ENOMEM);
274 274
@@ -446,7 +446,7 @@ int ubi_scan_add_used(struct ubi_device *ubi, struct ubi_scan_info *si,
446{ 446{
447 int err, vol_id, lnum; 447 int err, vol_id, lnum;
448 unsigned long long sqnum; 448 unsigned long long sqnum;
449 struct ubi_scan_volume *sv; 449 struct ubi_ainf_volume *sv;
450 struct ubi_ainf_peb *seb; 450 struct ubi_ainf_peb *seb;
451 struct rb_node **p, *parent = NULL; 451 struct rb_node **p, *parent = NULL;
452 452
@@ -593,14 +593,14 @@ int ubi_scan_add_used(struct ubi_device *ubi, struct ubi_scan_info *si,
593 * This function returns a pointer to the volume description or %NULL if there 593 * This function returns a pointer to the volume description or %NULL if there
594 * are no data about this volume in the scanning information. 594 * are no data about this volume in the scanning information.
595 */ 595 */
596struct ubi_scan_volume *ubi_scan_find_sv(const struct ubi_scan_info *si, 596struct ubi_ainf_volume *ubi_scan_find_sv(const struct ubi_scan_info *si,
597 int vol_id) 597 int vol_id)
598{ 598{
599 struct ubi_scan_volume *sv; 599 struct ubi_ainf_volume *sv;
600 struct rb_node *p = si->volumes.rb_node; 600 struct rb_node *p = si->volumes.rb_node;
601 601
602 while (p) { 602 while (p) {
603 sv = rb_entry(p, struct ubi_scan_volume, rb); 603 sv = rb_entry(p, struct ubi_ainf_volume, rb);
604 604
605 if (vol_id == sv->vol_id) 605 if (vol_id == sv->vol_id)
606 return sv; 606 return sv;
@@ -622,7 +622,7 @@ struct ubi_scan_volume *ubi_scan_find_sv(const struct ubi_scan_info *si,
622 * This function returns a pointer to the scanning logical eraseblock or %NULL 622 * This function returns a pointer to the scanning logical eraseblock or %NULL
623 * if there are no data about it in the scanning volume information. 623 * if there are no data about it in the scanning volume information.
624 */ 624 */
625struct ubi_ainf_peb *ubi_scan_find_seb(const struct ubi_scan_volume *sv, 625struct ubi_ainf_peb *ubi_scan_find_seb(const struct ubi_ainf_volume *sv,
626 int lnum) 626 int lnum)
627{ 627{
628 struct ubi_ainf_peb *seb; 628 struct ubi_ainf_peb *seb;
@@ -648,7 +648,7 @@ struct ubi_ainf_peb *ubi_scan_find_seb(const struct ubi_scan_volume *sv,
648 * @si: scanning information 648 * @si: scanning information
649 * @sv: the volume scanning information to delete 649 * @sv: the volume scanning information to delete
650 */ 650 */
651void ubi_scan_rm_volume(struct ubi_scan_info *si, struct ubi_scan_volume *sv) 651void ubi_scan_rm_volume(struct ubi_scan_info *si, struct ubi_ainf_volume *sv)
652{ 652{
653 struct rb_node *rb; 653 struct rb_node *rb;
654 struct ubi_ainf_peb *seb; 654 struct ubi_ainf_peb *seb;
@@ -1147,7 +1147,7 @@ struct ubi_scan_info *ubi_scan(struct ubi_device *ubi)
1147{ 1147{
1148 int err, pnum; 1148 int err, pnum;
1149 struct rb_node *rb1, *rb2; 1149 struct rb_node *rb1, *rb2;
1150 struct ubi_scan_volume *sv; 1150 struct ubi_ainf_volume *sv;
1151 struct ubi_ainf_peb *seb; 1151 struct ubi_ainf_peb *seb;
1152 struct ubi_scan_info *si; 1152 struct ubi_scan_info *si;
1153 1153
@@ -1244,7 +1244,7 @@ out_si:
1244 * This function destroys the volume RB-tree (@sv->root) and the scanning 1244 * This function destroys the volume RB-tree (@sv->root) and the scanning
1245 * volume information. 1245 * volume information.
1246 */ 1246 */
1247static void destroy_sv(struct ubi_scan_info *si, struct ubi_scan_volume *sv) 1247static void destroy_sv(struct ubi_scan_info *si, struct ubi_ainf_volume *sv)
1248{ 1248{
1249 struct ubi_ainf_peb *seb; 1249 struct ubi_ainf_peb *seb;
1250 struct rb_node *this = sv->root.rb_node; 1250 struct rb_node *this = sv->root.rb_node;
@@ -1277,7 +1277,7 @@ static void destroy_sv(struct ubi_scan_info *si, struct ubi_scan_volume *sv)
1277void ubi_scan_destroy_si(struct ubi_scan_info *si) 1277void ubi_scan_destroy_si(struct ubi_scan_info *si)
1278{ 1278{
1279 struct ubi_ainf_peb *seb, *seb_tmp; 1279 struct ubi_ainf_peb *seb, *seb_tmp;
1280 struct ubi_scan_volume *sv; 1280 struct ubi_ainf_volume *sv;
1281 struct rb_node *rb; 1281 struct rb_node *rb;
1282 1282
1283 list_for_each_entry_safe(seb, seb_tmp, &si->alien, u.list) { 1283 list_for_each_entry_safe(seb, seb_tmp, &si->alien, u.list) {
@@ -1305,7 +1305,7 @@ void ubi_scan_destroy_si(struct ubi_scan_info *si)
1305 else if (rb->rb_right) 1305 else if (rb->rb_right)
1306 rb = rb->rb_right; 1306 rb = rb->rb_right;
1307 else { 1307 else {
1308 sv = rb_entry(rb, struct ubi_scan_volume, rb); 1308 sv = rb_entry(rb, struct ubi_ainf_volume, rb);
1309 1309
1310 rb = rb_parent(rb); 1310 rb = rb_parent(rb);
1311 if (rb) { 1311 if (rb) {
@@ -1337,7 +1337,7 @@ static int self_check_si(struct ubi_device *ubi, struct ubi_scan_info *si)
1337{ 1337{
1338 int pnum, err, vols_found = 0; 1338 int pnum, err, vols_found = 0;
1339 struct rb_node *rb1, *rb2; 1339 struct rb_node *rb1, *rb2;
1340 struct ubi_scan_volume *sv; 1340 struct ubi_ainf_volume *sv;
1341 struct ubi_ainf_peb *seb, *last_seb; 1341 struct ubi_ainf_peb *seb, *last_seb;
1342 uint8_t *buf; 1342 uint8_t *buf;
1343 1343
diff --git a/drivers/mtd/ubi/scan.h b/drivers/mtd/ubi/scan.h
index 2cd66624dfa1..5523f0b0fe1d 100644
--- a/drivers/mtd/ubi/scan.h
+++ b/drivers/mtd/ubi/scan.h
@@ -53,7 +53,7 @@ struct ubi_ainf_peb {
53}; 53};
54 54
55/** 55/**
56 * struct ubi_scan_volume - scanning information about a volume. 56 * struct ubi_ainf_volume - scanning information about a volume.
57 * @vol_id: volume ID 57 * @vol_id: volume ID
58 * @highest_lnum: highest logical eraseblock number in this volume 58 * @highest_lnum: highest logical eraseblock number in this volume
59 * @leb_count: number of logical eraseblocks in this volume 59 * @leb_count: number of logical eraseblocks in this volume
@@ -72,7 +72,7 @@ struct ubi_ainf_peb {
72 * 72 *
73 * One object of this type is allocated for each volume during scanning. 73 * One object of this type is allocated for each volume during scanning.
74 */ 74 */
75struct ubi_scan_volume { 75struct ubi_ainf_volume {
76 int vol_id; 76 int vol_id;
77 int highest_lnum; 77 int highest_lnum;
78 int leb_count; 78 int leb_count;
@@ -148,7 +148,7 @@ struct ubi_vid_hdr;
148 * @seb: scanning eraseblock information 148 * @seb: scanning eraseblock information
149 * @list: the list to move to 149 * @list: the list to move to
150 */ 150 */
151static inline void ubi_scan_move_to_list(struct ubi_scan_volume *sv, 151static inline void ubi_scan_move_to_list(struct ubi_ainf_volume *sv,
152 struct ubi_ainf_peb *seb, 152 struct ubi_ainf_peb *seb,
153 struct list_head *list) 153 struct list_head *list)
154{ 154{
@@ -159,11 +159,11 @@ static inline void ubi_scan_move_to_list(struct ubi_scan_volume *sv,
159int ubi_scan_add_used(struct ubi_device *ubi, struct ubi_scan_info *si, 159int ubi_scan_add_used(struct ubi_device *ubi, struct ubi_scan_info *si,
160 int pnum, int ec, const struct ubi_vid_hdr *vid_hdr, 160 int pnum, int ec, const struct ubi_vid_hdr *vid_hdr,
161 int bitflips); 161 int bitflips);
162struct ubi_scan_volume *ubi_scan_find_sv(const struct ubi_scan_info *si, 162struct ubi_ainf_volume *ubi_scan_find_sv(const struct ubi_scan_info *si,
163 int vol_id); 163 int vol_id);
164struct ubi_ainf_peb *ubi_scan_find_seb(const struct ubi_scan_volume *sv, 164struct ubi_ainf_peb *ubi_scan_find_seb(const struct ubi_ainf_volume *sv,
165 int lnum); 165 int lnum);
166void ubi_scan_rm_volume(struct ubi_scan_info *si, struct ubi_scan_volume *sv); 166void ubi_scan_rm_volume(struct ubi_scan_info *si, struct ubi_ainf_volume *sv);
167struct ubi_ainf_peb *ubi_scan_get_free_peb(struct ubi_device *ubi, 167struct ubi_ainf_peb *ubi_scan_get_free_peb(struct ubi_device *ubi,
168 struct ubi_scan_info *si); 168 struct ubi_scan_info *si);
169int ubi_scan_erase_peb(struct ubi_device *ubi, const struct ubi_scan_info *si, 169int ubi_scan_erase_peb(struct ubi_device *ubi, const struct ubi_scan_info *si,
diff --git a/drivers/mtd/ubi/vtbl.c b/drivers/mtd/ubi/vtbl.c
index c9b828a69609..379f6203783a 100644
--- a/drivers/mtd/ubi/vtbl.c
+++ b/drivers/mtd/ubi/vtbl.c
@@ -374,7 +374,7 @@ out_free:
374 */ 374 */
375static struct ubi_vtbl_record *process_lvol(struct ubi_device *ubi, 375static struct ubi_vtbl_record *process_lvol(struct ubi_device *ubi,
376 struct ubi_scan_info *si, 376 struct ubi_scan_info *si,
377 struct ubi_scan_volume *sv) 377 struct ubi_ainf_volume *sv)
378{ 378{
379 int err; 379 int err;
380 struct rb_node *rb; 380 struct rb_node *rb;
@@ -535,7 +535,7 @@ static int init_volumes(struct ubi_device *ubi, const struct ubi_scan_info *si,
535 const struct ubi_vtbl_record *vtbl) 535 const struct ubi_vtbl_record *vtbl)
536{ 536{
537 int i, reserved_pebs = 0; 537 int i, reserved_pebs = 0;
538 struct ubi_scan_volume *sv; 538 struct ubi_ainf_volume *sv;
539 struct ubi_volume *vol; 539 struct ubi_volume *vol;
540 540
541 for (i = 0; i < ubi->vtbl_slots; i++) { 541 for (i = 0; i < ubi->vtbl_slots; i++) {
@@ -668,7 +668,7 @@ static int init_volumes(struct ubi_device *ubi, const struct ubi_scan_info *si,
668 * to the data read from the volume tabla, and %-EINVAL if not. 668 * to the data read from the volume tabla, and %-EINVAL if not.
669 */ 669 */
670static int check_sv(const struct ubi_volume *vol, 670static int check_sv(const struct ubi_volume *vol,
671 const struct ubi_scan_volume *sv) 671 const struct ubi_ainf_volume *sv)
672{ 672{
673 int err; 673 int err;
674 674
@@ -715,7 +715,7 @@ static int check_scanning_info(const struct ubi_device *ubi,
715 struct ubi_scan_info *si) 715 struct ubi_scan_info *si)
716{ 716{
717 int err, i; 717 int err, i;
718 struct ubi_scan_volume *sv; 718 struct ubi_ainf_volume *sv;
719 struct ubi_volume *vol; 719 struct ubi_volume *vol;
720 720
721 if (si->vols_found > UBI_INT_VOL_COUNT + ubi->vtbl_slots) { 721 if (si->vols_found > UBI_INT_VOL_COUNT + ubi->vtbl_slots) {
@@ -779,7 +779,7 @@ static int check_scanning_info(const struct ubi_device *ubi,
779int ubi_read_volume_table(struct ubi_device *ubi, struct ubi_scan_info *si) 779int ubi_read_volume_table(struct ubi_device *ubi, struct ubi_scan_info *si)
780{ 780{
781 int i, err; 781 int i, err;
782 struct ubi_scan_volume *sv; 782 struct ubi_ainf_volume *sv;
783 783
784 empty_vtbl_record.crc = cpu_to_be32(0xf116c36b); 784 empty_vtbl_record.crc = cpu_to_be32(0xf116c36b);
785 785
diff --git a/drivers/mtd/ubi/wl.c b/drivers/mtd/ubi/wl.c
index 91869e8d2a90..53ef24b48211 100644
--- a/drivers/mtd/ubi/wl.c
+++ b/drivers/mtd/ubi/wl.c
@@ -1384,7 +1384,7 @@ int ubi_wl_init_scan(struct ubi_device *ubi, struct ubi_scan_info *si)
1384{ 1384{
1385 int err, i; 1385 int err, i;
1386 struct rb_node *rb1, *rb2; 1386 struct rb_node *rb1, *rb2;
1387 struct ubi_scan_volume *sv; 1387 struct ubi_ainf_volume *sv;
1388 struct ubi_ainf_peb *seb, *tmp; 1388 struct ubi_ainf_peb *seb, *tmp;
1389 struct ubi_wl_entry *e; 1389 struct ubi_wl_entry *e;
1390 1390