2 * Copyright (c) International Business Machines Corp., 2006
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
12 * the GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18 * Authors: Artem Bityutskiy (Битюцкий Артём), Thomas Gleixner
22 * UBI wear-leveling sub-system.
24 * This sub-system is responsible for wear-leveling. It works in terms of
25 * physical eraseblocks and erase counters and knows nothing about logical
26 * eraseblocks, volumes, etc. From this sub-system's perspective all physical
27 * eraseblocks are of two types - used and free. Used physical eraseblocks are
28 * those that were "get" by the 'ubi_wl_get_peb()' function, and free physical
29 * eraseblocks are those that were put by the 'ubi_wl_put_peb()' function.
31 * Physical eraseblocks returned by 'ubi_wl_get_peb()' have only erase counter
32 * header. The rest of the physical eraseblock contains only %0xFF bytes.
34 * When physical eraseblocks are returned to the WL sub-system by means of the
35 * 'ubi_wl_put_peb()' function, they are scheduled for erasure. The erasure is
36 * done asynchronously in context of the per-UBI device background thread,
37 * which is also managed by the WL sub-system.
39 * The wear-leveling is ensured by means of moving the contents of used
40 * physical eraseblocks with low erase counter to free physical eraseblocks
41 * with high erase counter.
43 * If the WL sub-system fails to erase a physical eraseblock, it marks it as
46 * This sub-system is also responsible for scrubbing. If a bit-flip is detected
47 * in a physical eraseblock, it has to be moved. Technically this is the same
48 * as moving it for wear-leveling reasons.
50 * As it was said, for the UBI sub-system all physical eraseblocks are either
51 * "free" or "used". Free eraseblock are kept in the @wl->free RB-tree, while
52 * used eraseblocks are kept in @wl->used, @wl->erroneous, or @wl->scrub
53 * RB-trees, as well as (temporarily) in the @wl->pq queue.
55 * When the WL sub-system returns a physical eraseblock, the physical
56 * eraseblock is protected from being moved for some "time". For this reason,
57 * the physical eraseblock is not directly moved from the @wl->free tree to the
58 * @wl->used tree. There is a protection queue in between where this
59 * physical eraseblock is temporarily stored (@wl->pq).
61 * All this protection stuff is needed because:
62 * o we don't want to move physical eraseblocks just after we have given them
63 * to the user; instead, we first want to let users fill them up with data;
65 * o there is a chance that the user will put the physical eraseblock very
66 * soon, so it makes sense not to move it for some time, but wait.
68 * Physical eraseblocks stay protected only for limited time. But the "time" is
69 * measured in erase cycles in this case. This is implemented with help of the
70 * protection queue. Eraseblocks are put to the tail of this queue when they
71 * are returned by the 'ubi_wl_get_peb()', and eraseblocks are removed from the
72 * head of the queue on each erase operation (for any eraseblock). So the
73 * length of the queue defines how may (global) erase cycles PEBs are protected.
75 * To put it differently, each physical eraseblock has 2 main states: free and
76 * used. The former state corresponds to the @wl->free tree. The latter state
77 * is split up on several sub-states:
78 * o the WL movement is allowed (@wl->used tree);
79 * o the WL movement is disallowed (@wl->erroneous) because the PEB is
80 * erroneous - e.g., there was a read error;
81 * o the WL movement is temporarily prohibited (@wl->pq queue);
82 * o scrubbing is needed (@wl->scrub tree).
84 * Depending on the sub-state, wear-leveling entries of the used physical
85 * eraseblocks may be kept in one of those structures.
87 * Note, in this implementation, we keep a small in-RAM object for each physical
88 * eraseblock. This is surely not a scalable solution. But it appears to be good
89 * enough for moderately large flashes and it is simple. In future, one may
90 * re-work this sub-system and make it more scalable.
92 * At the moment this sub-system does not utilize the sequence number, which
93 * was introduced relatively recently. But it would be wise to do this because
94 * the sequence number of a logical eraseblock characterizes how old is it. For
95 * example, when we move a PEB with low erase counter, and we need to pick the
96 * target PEB, we pick a PEB with the highest EC if our PEB is "old" and we
97 * pick target PEB with an average EC if our PEB is not very "old". This is a
98 * room for future re-works of the WL sub-system.
101 #include <linux/slab.h>
102 #include <linux/crc32.h>
103 #include <linux/freezer.h>
104 #include <linux/kthread.h>
108 /* Number of physical eraseblocks reserved for wear-leveling purposes */
109 #define WL_RESERVED_PEBS 1
112 * Maximum difference between two erase counters. If this threshold is
113 * exceeded, the WL sub-system starts moving data from used physical
114 * eraseblocks with low erase counter to free physical eraseblocks with high
117 #define UBI_WL_THRESHOLD CONFIG_MTD_UBI_WL_THRESHOLD
120 * When a physical eraseblock is moved, the WL sub-system has to pick the target
121 * physical eraseblock to move to. The simplest way would be just to pick the
122 * one with the highest erase counter. But in certain workloads this could lead
123 * to an unlimited wear of one or few physical eraseblock. Indeed, imagine a
124 * situation when the picked physical eraseblock is constantly erased after the
125 * data is written to it. So, we have a constant which limits the highest erase
126 * counter of the free physical eraseblock to pick. Namely, the WL sub-system
127 * does not pick eraseblocks with erase counter greater than the lowest erase
128 * counter plus %WL_FREE_MAX_DIFF.
130 #define WL_FREE_MAX_DIFF (2*UBI_WL_THRESHOLD)
133 * Maximum number of consecutive background thread failures which is enough to
134 * switch to read-only mode.
136 #define WL_MAX_FAILURES 32
138 static int self_check_ec(struct ubi_device *ubi, int pnum, int ec);
139 static int self_check_in_wl_tree(const struct ubi_device *ubi,
140 struct ubi_wl_entry *e, struct rb_root *root);
141 static int self_check_in_pq(const struct ubi_device *ubi,
142 struct ubi_wl_entry *e);
145 * wl_tree_add - add a wear-leveling entry to a WL RB-tree.
146 * @e: the wear-leveling entry to add
147 * @root: the root of the tree
149 * Note, we use (erase counter, physical eraseblock number) pairs as keys in
150 * the @ubi->used and @ubi->free RB-trees.
152 static void wl_tree_add(struct ubi_wl_entry *e, struct rb_root *root)
154 struct rb_node **p, *parent = NULL;
158 struct ubi_wl_entry *e1;
161 e1 = rb_entry(parent, struct ubi_wl_entry, u.rb);
165 else if (e->ec > e1->ec)
168 ubi_assert(e->pnum != e1->pnum);
169 if (e->pnum < e1->pnum)
176 rb_link_node(&e->u.rb, parent, p);
177 rb_insert_color(&e->u.rb, root);
181 * wl_tree_destroy - destroy a wear-leveling entry.
182 * @ubi: UBI device description object
183 * @e: the wear-leveling entry to add
185 * This function destroys a wear leveling entry and removes
186 * the reference from the lookup table.
188 static void wl_entry_destroy(struct ubi_device *ubi, struct ubi_wl_entry *e)
190 ubi->lookuptbl[e->pnum] = NULL;
191 kmem_cache_free(ubi_wl_entry_slab, e);
195 * do_work - do one pending work.
196 * @ubi: UBI device description object
198 * This function returns zero in case of success and a negative error code in
201 static int do_work(struct ubi_device *ubi)
204 struct ubi_work *wrk;
209 * @ubi->work_sem is used to synchronize with the workers. Workers take
210 * it in read mode, so many of them may be doing works at a time. But
211 * the queue flush code has to be sure the whole queue of works is
212 * done, and it takes the mutex in write mode.
214 down_read(&ubi->work_sem);
215 spin_lock(&ubi->wl_lock);
216 if (list_empty(&ubi->works)) {
217 spin_unlock(&ubi->wl_lock);
218 up_read(&ubi->work_sem);
222 wrk = list_entry(ubi->works.next, struct ubi_work, list);
223 list_del(&wrk->list);
224 ubi->works_count -= 1;
225 ubi_assert(ubi->works_count >= 0);
226 spin_unlock(&ubi->wl_lock);
229 * Call the worker function. Do not touch the work structure
230 * after this call as it will have been freed or reused by that
231 * time by the worker function.
233 err = wrk->func(ubi, wrk, 0);
235 ubi_err(ubi, "work failed with error code %d", err);
236 up_read(&ubi->work_sem);
242 * in_wl_tree - check if wear-leveling entry is present in a WL RB-tree.
243 * @e: the wear-leveling entry to check
244 * @root: the root of the tree
246 * This function returns non-zero if @e is in the @root RB-tree and zero if it
249 static int in_wl_tree(struct ubi_wl_entry *e, struct rb_root *root)
255 struct ubi_wl_entry *e1;
257 e1 = rb_entry(p, struct ubi_wl_entry, u.rb);
259 if (e->pnum == e1->pnum) {
266 else if (e->ec > e1->ec)
269 ubi_assert(e->pnum != e1->pnum);
270 if (e->pnum < e1->pnum)
281 * prot_queue_add - add physical eraseblock to the protection queue.
282 * @ubi: UBI device description object
283 * @e: the physical eraseblock to add
285 * This function adds @e to the tail of the protection queue @ubi->pq, where
286 * @e will stay for %UBI_PROT_QUEUE_LEN erase operations and will be
287 * temporarily protected from the wear-leveling worker. Note, @wl->lock has to
290 static void prot_queue_add(struct ubi_device *ubi, struct ubi_wl_entry *e)
292 int pq_tail = ubi->pq_head - 1;
295 pq_tail = UBI_PROT_QUEUE_LEN - 1;
296 ubi_assert(pq_tail >= 0 && pq_tail < UBI_PROT_QUEUE_LEN);
297 list_add_tail(&e->u.list, &ubi->pq[pq_tail]);
298 dbg_wl("added PEB %d EC %d to the protection queue", e->pnum, e->ec);
302 * find_wl_entry - find wear-leveling entry closest to certain erase counter.
303 * @ubi: UBI device description object
304 * @root: the RB-tree where to look for
305 * @diff: maximum possible difference from the smallest erase counter
307 * This function looks for a wear leveling entry with erase counter closest to
308 * min + @diff, where min is the smallest erase counter.
310 static struct ubi_wl_entry *find_wl_entry(struct ubi_device *ubi,
311 struct rb_root *root, int diff)
314 struct ubi_wl_entry *e, *prev_e = NULL;
317 e = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb);
322 struct ubi_wl_entry *e1;
324 e1 = rb_entry(p, struct ubi_wl_entry, u.rb);
334 /* If no fastmap has been written and this WL entry can be used
335 * as anchor PEB, hold it back and return the second best WL entry
336 * such that fastmap can use the anchor PEB later. */
337 if (prev_e && !ubi->fm_disabled &&
338 !ubi->fm && e->pnum < UBI_FM_MAX_START)
345 * find_mean_wl_entry - find wear-leveling entry with medium erase counter.
346 * @ubi: UBI device description object
347 * @root: the RB-tree where to look for
349 * This function looks for a wear leveling entry with medium erase counter,
350 * but not greater or equivalent than the lowest erase counter plus
351 * %WL_FREE_MAX_DIFF/2.
353 static struct ubi_wl_entry *find_mean_wl_entry(struct ubi_device *ubi,
354 struct rb_root *root)
356 struct ubi_wl_entry *e, *first, *last;
358 first = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb);
359 last = rb_entry(rb_last(root), struct ubi_wl_entry, u.rb);
361 if (last->ec - first->ec < WL_FREE_MAX_DIFF) {
362 e = rb_entry(root->rb_node, struct ubi_wl_entry, u.rb);
364 /* If no fastmap has been written and this WL entry can be used
365 * as anchor PEB, hold it back and return the second best
366 * WL entry such that fastmap can use the anchor PEB later. */
367 e = may_reserve_for_fm(ubi, e, root);
369 e = find_wl_entry(ubi, root, WL_FREE_MAX_DIFF/2);
375 * wl_get_wle - get a mean wl entry to be used by ubi_wl_get_peb() or
376 * refill_wl_user_pool().
377 * @ubi: UBI device description object
379 * This function returns a a wear leveling entry in case of success and
380 * NULL in case of failure.
382 static struct ubi_wl_entry *wl_get_wle(struct ubi_device *ubi)
384 struct ubi_wl_entry *e;
386 e = find_mean_wl_entry(ubi, &ubi->free);
388 ubi_err(ubi, "no free eraseblocks");
392 self_check_in_wl_tree(ubi, e, &ubi->free);
395 * Move the physical eraseblock to the protection queue where it will
396 * be protected from being moved for some time.
398 rb_erase(&e->u.rb, &ubi->free);
400 dbg_wl("PEB %d EC %d", e->pnum, e->ec);
406 * prot_queue_del - remove a physical eraseblock from the protection queue.
407 * @ubi: UBI device description object
408 * @pnum: the physical eraseblock to remove
410 * This function deletes PEB @pnum from the protection queue and returns zero
411 * in case of success and %-ENODEV if the PEB was not found.
413 static int prot_queue_del(struct ubi_device *ubi, int pnum)
415 struct ubi_wl_entry *e;
417 e = ubi->lookuptbl[pnum];
421 if (self_check_in_pq(ubi, e))
424 list_del(&e->u.list);
425 dbg_wl("deleted PEB %d from the protection queue", e->pnum);
430 * sync_erase - synchronously erase a physical eraseblock.
431 * @ubi: UBI device description object
432 * @e: the the physical eraseblock to erase
433 * @torture: if the physical eraseblock has to be tortured
435 * This function returns zero in case of success and a negative error code in
438 static int sync_erase(struct ubi_device *ubi, struct ubi_wl_entry *e,
442 struct ubi_ec_hdr *ec_hdr;
443 unsigned long long ec = e->ec;
445 dbg_wl("erase PEB %d, old EC %llu", e->pnum, ec);
447 err = self_check_ec(ubi, e->pnum, e->ec);
451 ec_hdr = kzalloc(ubi->ec_hdr_alsize, GFP_NOFS);
455 err = ubi_io_sync_erase(ubi, e->pnum, torture);
460 if (ec > UBI_MAX_ERASECOUNTER) {
462 * Erase counter overflow. Upgrade UBI and use 64-bit
463 * erase counters internally.
465 ubi_err(ubi, "erase counter overflow at PEB %d, EC %llu",
471 dbg_wl("erased PEB %d, new EC %llu", e->pnum, ec);
473 ec_hdr->ec = cpu_to_be64(ec);
475 err = ubi_io_write_ec_hdr(ubi, e->pnum, ec_hdr);
480 spin_lock(&ubi->wl_lock);
481 if (e->ec > ubi->max_ec)
483 spin_unlock(&ubi->wl_lock);
491 * serve_prot_queue - check if it is time to stop protecting PEBs.
492 * @ubi: UBI device description object
494 * This function is called after each erase operation and removes PEBs from the
495 * tail of the protection queue. These PEBs have been protected for long enough
496 * and should be moved to the used tree.
498 static void serve_prot_queue(struct ubi_device *ubi)
500 struct ubi_wl_entry *e, *tmp;
504 * There may be several protected physical eraseblock to remove,
509 spin_lock(&ubi->wl_lock);
510 list_for_each_entry_safe(e, tmp, &ubi->pq[ubi->pq_head], u.list) {
511 dbg_wl("PEB %d EC %d protection over, move to used tree",
514 list_del(&e->u.list);
515 wl_tree_add(e, &ubi->used);
518 * Let's be nice and avoid holding the spinlock for
521 spin_unlock(&ubi->wl_lock);
528 if (ubi->pq_head == UBI_PROT_QUEUE_LEN)
530 ubi_assert(ubi->pq_head >= 0 && ubi->pq_head < UBI_PROT_QUEUE_LEN);
531 spin_unlock(&ubi->wl_lock);
535 * __schedule_ubi_work - schedule a work.
536 * @ubi: UBI device description object
537 * @wrk: the work to schedule
539 * This function adds a work defined by @wrk to the tail of the pending works
540 * list. Can only be used if ubi->work_sem is already held in read mode!
542 static void __schedule_ubi_work(struct ubi_device *ubi, struct ubi_work *wrk)
544 spin_lock(&ubi->wl_lock);
545 list_add_tail(&wrk->list, &ubi->works);
546 ubi_assert(ubi->works_count >= 0);
547 ubi->works_count += 1;
548 if (ubi->thread_enabled && !ubi_dbg_is_bgt_disabled(ubi))
549 wake_up_process(ubi->bgt_thread);
550 spin_unlock(&ubi->wl_lock);
554 * schedule_ubi_work - schedule a work.
555 * @ubi: UBI device description object
556 * @wrk: the work to schedule
558 * This function adds a work defined by @wrk to the tail of the pending works
561 static void schedule_ubi_work(struct ubi_device *ubi, struct ubi_work *wrk)
563 down_read(&ubi->work_sem);
564 __schedule_ubi_work(ubi, wrk);
565 up_read(&ubi->work_sem);
568 static int erase_worker(struct ubi_device *ubi, struct ubi_work *wl_wrk,
572 * schedule_erase - schedule an erase work.
573 * @ubi: UBI device description object
574 * @e: the WL entry of the physical eraseblock to erase
575 * @vol_id: the volume ID that last used this PEB
576 * @lnum: the last used logical eraseblock number for the PEB
577 * @torture: if the physical eraseblock has to be tortured
579 * This function returns zero in case of success and a %-ENOMEM in case of
582 static int schedule_erase(struct ubi_device *ubi, struct ubi_wl_entry *e,
583 int vol_id, int lnum, int torture)
585 struct ubi_work *wl_wrk;
589 dbg_wl("schedule erasure of PEB %d, EC %d, torture %d",
590 e->pnum, e->ec, torture);
592 wl_wrk = kmalloc(sizeof(struct ubi_work), GFP_NOFS);
596 wl_wrk->func = &erase_worker;
598 wl_wrk->vol_id = vol_id;
600 wl_wrk->torture = torture;
602 schedule_ubi_work(ubi, wl_wrk);
606 static int __erase_worker(struct ubi_device *ubi, struct ubi_work *wl_wrk);
608 * do_sync_erase - run the erase worker synchronously.
609 * @ubi: UBI device description object
610 * @e: the WL entry of the physical eraseblock to erase
611 * @vol_id: the volume ID that last used this PEB
612 * @lnum: the last used logical eraseblock number for the PEB
613 * @torture: if the physical eraseblock has to be tortured
616 static int do_sync_erase(struct ubi_device *ubi, struct ubi_wl_entry *e,
617 int vol_id, int lnum, int torture)
619 struct ubi_work wl_wrk;
621 dbg_wl("sync erase of PEB %i", e->pnum);
624 wl_wrk.vol_id = vol_id;
626 wl_wrk.torture = torture;
628 return __erase_worker(ubi, &wl_wrk);
632 * wear_leveling_worker - wear-leveling worker function.
633 * @ubi: UBI device description object
634 * @wrk: the work object
635 * @shutdown: non-zero if the worker has to free memory and exit
636 * because the WL-subsystem is shutting down
638 * This function copies a more worn out physical eraseblock to a less worn out
639 * one. Returns zero in case of success and a negative error code in case of
642 static int wear_leveling_worker(struct ubi_device *ubi, struct ubi_work *wrk,
645 int err, scrubbing = 0, torture = 0, protect = 0, erroneous = 0;
646 int vol_id = -1, lnum = -1;
647 #ifdef CONFIG_MTD_UBI_FASTMAP
648 int anchor = wrk->anchor;
650 struct ubi_wl_entry *e1, *e2;
651 struct ubi_vid_hdr *vid_hdr;
657 vid_hdr = ubi_zalloc_vid_hdr(ubi, GFP_NOFS);
661 mutex_lock(&ubi->move_mutex);
662 spin_lock(&ubi->wl_lock);
663 ubi_assert(!ubi->move_from && !ubi->move_to);
664 ubi_assert(!ubi->move_to_put);
666 if (!ubi->free.rb_node ||
667 (!ubi->used.rb_node && !ubi->scrub.rb_node)) {
669 * No free physical eraseblocks? Well, they must be waiting in
670 * the queue to be erased. Cancel movement - it will be
671 * triggered again when a free physical eraseblock appears.
673 * No used physical eraseblocks? They must be temporarily
674 * protected from being moved. They will be moved to the
675 * @ubi->used tree later and the wear-leveling will be
678 dbg_wl("cancel WL, a list is empty: free %d, used %d",
679 !ubi->free.rb_node, !ubi->used.rb_node);
683 #ifdef CONFIG_MTD_UBI_FASTMAP
684 /* Check whether we need to produce an anchor PEB */
686 anchor = !anchor_pebs_avalible(&ubi->free);
689 e1 = find_anchor_wl_entry(&ubi->used);
692 e2 = get_peb_for_wl(ubi);
696 self_check_in_wl_tree(ubi, e1, &ubi->used);
697 rb_erase(&e1->u.rb, &ubi->used);
698 dbg_wl("anchor-move PEB %d to PEB %d", e1->pnum, e2->pnum);
699 } else if (!ubi->scrub.rb_node) {
701 if (!ubi->scrub.rb_node) {
704 * Now pick the least worn-out used physical eraseblock and a
705 * highly worn-out free physical eraseblock. If the erase
706 * counters differ much enough, start wear-leveling.
708 e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
709 e2 = get_peb_for_wl(ubi);
713 if (!(e2->ec - e1->ec >= UBI_WL_THRESHOLD)) {
714 dbg_wl("no WL needed: min used EC %d, max free EC %d",
717 /* Give the unused PEB back */
718 wl_tree_add(e2, &ubi->free);
722 self_check_in_wl_tree(ubi, e1, &ubi->used);
723 rb_erase(&e1->u.rb, &ubi->used);
724 dbg_wl("move PEB %d EC %d to PEB %d EC %d",
725 e1->pnum, e1->ec, e2->pnum, e2->ec);
727 /* Perform scrubbing */
729 e1 = rb_entry(rb_first(&ubi->scrub), struct ubi_wl_entry, u.rb);
730 e2 = get_peb_for_wl(ubi);
734 self_check_in_wl_tree(ubi, e1, &ubi->scrub);
735 rb_erase(&e1->u.rb, &ubi->scrub);
736 dbg_wl("scrub PEB %d to PEB %d", e1->pnum, e2->pnum);
741 spin_unlock(&ubi->wl_lock);
744 * Now we are going to copy physical eraseblock @e1->pnum to @e2->pnum.
745 * We so far do not know which logical eraseblock our physical
746 * eraseblock (@e1) belongs to. We have to read the volume identifier
749 * Note, we are protected from this PEB being unmapped and erased. The
750 * 'ubi_wl_put_peb()' would wait for moving to be finished if the PEB
751 * which is being moved was unmapped.
754 err = ubi_io_read_vid_hdr(ubi, e1->pnum, vid_hdr, 0);
755 if (err && err != UBI_IO_BITFLIPS) {
756 if (err == UBI_IO_FF) {
758 * We are trying to move PEB without a VID header. UBI
759 * always write VID headers shortly after the PEB was
760 * given, so we have a situation when it has not yet
761 * had a chance to write it, because it was preempted.
762 * So add this PEB to the protection queue so far,
763 * because presumably more data will be written there
764 * (including the missing VID header), and then we'll
767 dbg_wl("PEB %d has no VID header", e1->pnum);
770 } else if (err == UBI_IO_FF_BITFLIPS) {
772 * The same situation as %UBI_IO_FF, but bit-flips were
773 * detected. It is better to schedule this PEB for
776 dbg_wl("PEB %d has no VID header but has bit-flips",
782 ubi_err(ubi, "error %d while reading VID header from PEB %d",
787 vol_id = be32_to_cpu(vid_hdr->vol_id);
788 lnum = be32_to_cpu(vid_hdr->lnum);
790 err = ubi_eba_copy_leb(ubi, e1->pnum, e2->pnum, vid_hdr);
792 if (err == MOVE_CANCEL_RACE) {
794 * The LEB has not been moved because the volume is
795 * being deleted or the PEB has been put meanwhile. We
796 * should prevent this PEB from being selected for
797 * wear-leveling movement again, so put it to the
803 if (err == MOVE_RETRY) {
807 if (err == MOVE_TARGET_BITFLIPS || err == MOVE_TARGET_WR_ERR ||
808 err == MOVE_TARGET_RD_ERR) {
810 * Target PEB had bit-flips or write error - torture it.
816 if (err == MOVE_SOURCE_RD_ERR) {
818 * An error happened while reading the source PEB. Do
819 * not switch to R/O mode in this case, and give the
820 * upper layers a possibility to recover from this,
821 * e.g. by unmapping corresponding LEB. Instead, just
822 * put this PEB to the @ubi->erroneous list to prevent
823 * UBI from trying to move it over and over again.
825 if (ubi->erroneous_peb_count > ubi->max_erroneous) {
826 ubi_err(ubi, "too many erroneous eraseblocks (%d)",
827 ubi->erroneous_peb_count);
840 /* The PEB has been successfully moved */
842 ubi_msg(ubi, "scrubbed PEB %d (LEB %d:%d), data moved to PEB %d",
843 e1->pnum, vol_id, lnum, e2->pnum);
844 ubi_free_vid_hdr(ubi, vid_hdr);
846 spin_lock(&ubi->wl_lock);
847 if (!ubi->move_to_put) {
848 wl_tree_add(e2, &ubi->used);
851 ubi->move_from = ubi->move_to = NULL;
852 ubi->move_to_put = ubi->wl_scheduled = 0;
853 spin_unlock(&ubi->wl_lock);
855 err = do_sync_erase(ubi, e1, vol_id, lnum, 0);
858 wl_entry_destroy(ubi, e2);
864 * Well, the target PEB was put meanwhile, schedule it for
867 dbg_wl("PEB %d (LEB %d:%d) was put meanwhile, erase",
868 e2->pnum, vol_id, lnum);
869 err = do_sync_erase(ubi, e2, vol_id, lnum, 0);
875 mutex_unlock(&ubi->move_mutex);
879 * For some reasons the LEB was not moved, might be an error, might be
880 * something else. @e1 was not changed, so return it back. @e2 might
881 * have been changed, schedule it for erasure.
885 dbg_wl("cancel moving PEB %d (LEB %d:%d) to PEB %d (%d)",
886 e1->pnum, vol_id, lnum, e2->pnum, err);
888 dbg_wl("cancel moving PEB %d to PEB %d (%d)",
889 e1->pnum, e2->pnum, err);
890 spin_lock(&ubi->wl_lock);
892 prot_queue_add(ubi, e1);
893 else if (erroneous) {
894 wl_tree_add(e1, &ubi->erroneous);
895 ubi->erroneous_peb_count += 1;
896 } else if (scrubbing)
897 wl_tree_add(e1, &ubi->scrub);
899 wl_tree_add(e1, &ubi->used);
900 ubi_assert(!ubi->move_to_put);
901 ubi->move_from = ubi->move_to = NULL;
902 ubi->wl_scheduled = 0;
903 spin_unlock(&ubi->wl_lock);
905 ubi_free_vid_hdr(ubi, vid_hdr);
906 err = do_sync_erase(ubi, e2, vol_id, lnum, torture);
910 mutex_unlock(&ubi->move_mutex);
915 ubi_err(ubi, "error %d while moving PEB %d to PEB %d",
916 err, e1->pnum, e2->pnum);
918 ubi_err(ubi, "error %d while moving PEB %d (LEB %d:%d) to PEB %d",
919 err, e1->pnum, vol_id, lnum, e2->pnum);
920 spin_lock(&ubi->wl_lock);
921 ubi->move_from = ubi->move_to = NULL;
922 ubi->move_to_put = ubi->wl_scheduled = 0;
923 spin_unlock(&ubi->wl_lock);
925 ubi_free_vid_hdr(ubi, vid_hdr);
926 wl_entry_destroy(ubi, e1);
927 wl_entry_destroy(ubi, e2);
931 mutex_unlock(&ubi->move_mutex);
932 ubi_assert(err != 0);
933 return err < 0 ? err : -EIO;
936 ubi->wl_scheduled = 0;
937 spin_unlock(&ubi->wl_lock);
938 mutex_unlock(&ubi->move_mutex);
939 ubi_free_vid_hdr(ubi, vid_hdr);
944 * ensure_wear_leveling - schedule wear-leveling if it is needed.
945 * @ubi: UBI device description object
946 * @nested: set to non-zero if this function is called from UBI worker
948 * This function checks if it is time to start wear-leveling and schedules it
949 * if yes. This function returns zero in case of success and a negative error
950 * code in case of failure.
952 static int ensure_wear_leveling(struct ubi_device *ubi, int nested)
955 struct ubi_wl_entry *e1;
956 struct ubi_wl_entry *e2;
957 struct ubi_work *wrk;
959 spin_lock(&ubi->wl_lock);
960 if (ubi->wl_scheduled)
961 /* Wear-leveling is already in the work queue */
965 * If the ubi->scrub tree is not empty, scrubbing is needed, and the
966 * the WL worker has to be scheduled anyway.
968 if (!ubi->scrub.rb_node) {
969 if (!ubi->used.rb_node || !ubi->free.rb_node)
970 /* No physical eraseblocks - no deal */
974 * We schedule wear-leveling only if the difference between the
975 * lowest erase counter of used physical eraseblocks and a high
976 * erase counter of free physical eraseblocks is greater than
979 e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
980 e2 = find_wl_entry(ubi, &ubi->free, WL_FREE_MAX_DIFF);
982 if (!(e2->ec - e1->ec >= UBI_WL_THRESHOLD))
984 dbg_wl("schedule wear-leveling");
986 dbg_wl("schedule scrubbing");
988 ubi->wl_scheduled = 1;
989 spin_unlock(&ubi->wl_lock);
991 wrk = kmalloc(sizeof(struct ubi_work), GFP_NOFS);
998 wrk->func = &wear_leveling_worker;
1000 __schedule_ubi_work(ubi, wrk);
1002 schedule_ubi_work(ubi, wrk);
1006 spin_lock(&ubi->wl_lock);
1007 ubi->wl_scheduled = 0;
1009 spin_unlock(&ubi->wl_lock);
1014 * __erase_worker - physical eraseblock erase worker function.
1015 * @ubi: UBI device description object
1016 * @wl_wrk: the work object
1017 * @shutdown: non-zero if the worker has to free memory and exit
1018 * because the WL sub-system is shutting down
1020 * This function erases a physical eraseblock and perform torture testing if
1021 * needed. It also takes care about marking the physical eraseblock bad if
1022 * needed. Returns zero in case of success and a negative error code in case of
1025 static int __erase_worker(struct ubi_device *ubi, struct ubi_work *wl_wrk)
1027 struct ubi_wl_entry *e = wl_wrk->e;
1029 int vol_id = wl_wrk->vol_id;
1030 int lnum = wl_wrk->lnum;
1031 int err, available_consumed = 0;
1033 dbg_wl("erase PEB %d EC %d LEB %d:%d",
1034 pnum, e->ec, wl_wrk->vol_id, wl_wrk->lnum);
1036 err = sync_erase(ubi, e, wl_wrk->torture);
1038 spin_lock(&ubi->wl_lock);
1039 wl_tree_add(e, &ubi->free);
1041 spin_unlock(&ubi->wl_lock);
1044 * One more erase operation has happened, take care about
1045 * protected physical eraseblocks.
1047 serve_prot_queue(ubi);
1049 /* And take care about wear-leveling */
1050 err = ensure_wear_leveling(ubi, 1);
1054 ubi_err(ubi, "failed to erase PEB %d, error %d", pnum, err);
1056 if (err == -EINTR || err == -ENOMEM || err == -EAGAIN ||
1060 /* Re-schedule the LEB for erasure */
1061 err1 = schedule_erase(ubi, e, vol_id, lnum, 0);
1063 wl_entry_destroy(ubi, e);
1070 wl_entry_destroy(ubi, e);
1073 * If this is not %-EIO, we have no idea what to do. Scheduling
1074 * this physical eraseblock for erasure again would cause
1075 * errors again and again. Well, lets switch to R/O mode.
1079 /* It is %-EIO, the PEB went bad */
1081 if (!ubi->bad_allowed) {
1082 ubi_err(ubi, "bad physical eraseblock %d detected", pnum);
1086 spin_lock(&ubi->volumes_lock);
1087 if (ubi->beb_rsvd_pebs == 0) {
1088 if (ubi->avail_pebs == 0) {
1089 spin_unlock(&ubi->volumes_lock);
1090 ubi_err(ubi, "no reserved/available physical eraseblocks");
1093 ubi->avail_pebs -= 1;
1094 available_consumed = 1;
1096 spin_unlock(&ubi->volumes_lock);
1098 ubi_msg(ubi, "mark PEB %d as bad", pnum);
1099 err = ubi_io_mark_bad(ubi, pnum);
1103 spin_lock(&ubi->volumes_lock);
1104 if (ubi->beb_rsvd_pebs > 0) {
1105 if (available_consumed) {
1107 * The amount of reserved PEBs increased since we last
1110 ubi->avail_pebs += 1;
1111 available_consumed = 0;
1113 ubi->beb_rsvd_pebs -= 1;
1115 ubi->bad_peb_count += 1;
1116 ubi->good_peb_count -= 1;
1117 ubi_calculate_reserved(ubi);
1118 if (available_consumed)
1119 ubi_warn(ubi, "no PEBs in the reserved pool, used an available PEB");
1120 else if (ubi->beb_rsvd_pebs)
1121 ubi_msg(ubi, "%d PEBs left in the reserve",
1122 ubi->beb_rsvd_pebs);
1124 ubi_warn(ubi, "last PEB from the reserve was used");
1125 spin_unlock(&ubi->volumes_lock);
1130 if (available_consumed) {
1131 spin_lock(&ubi->volumes_lock);
1132 ubi->avail_pebs += 1;
1133 spin_unlock(&ubi->volumes_lock);
1139 static int erase_worker(struct ubi_device *ubi, struct ubi_work *wl_wrk,
1145 struct ubi_wl_entry *e = wl_wrk->e;
1147 dbg_wl("cancel erasure of PEB %d EC %d", e->pnum, e->ec);
1149 wl_entry_destroy(ubi, e);
1153 ret = __erase_worker(ubi, wl_wrk);
1159 * ubi_wl_put_peb - return a PEB to the wear-leveling sub-system.
1160 * @ubi: UBI device description object
1161 * @vol_id: the volume ID that last used this PEB
1162 * @lnum: the last used logical eraseblock number for the PEB
1163 * @pnum: physical eraseblock to return
1164 * @torture: if this physical eraseblock has to be tortured
1166 * This function is called to return physical eraseblock @pnum to the pool of
1167 * free physical eraseblocks. The @torture flag has to be set if an I/O error
1168 * occurred to this @pnum and it has to be tested. This function returns zero
1169 * in case of success, and a negative error code in case of failure.
1171 int ubi_wl_put_peb(struct ubi_device *ubi, int vol_id, int lnum,
1172 int pnum, int torture)
1175 struct ubi_wl_entry *e;
1177 dbg_wl("PEB %d", pnum);
1178 ubi_assert(pnum >= 0);
1179 ubi_assert(pnum < ubi->peb_count);
1181 down_read(&ubi->fm_protect);
1184 spin_lock(&ubi->wl_lock);
1185 e = ubi->lookuptbl[pnum];
1186 if (e == ubi->move_from) {
1188 * User is putting the physical eraseblock which was selected to
1189 * be moved. It will be scheduled for erasure in the
1190 * wear-leveling worker.
1192 dbg_wl("PEB %d is being moved, wait", pnum);
1193 spin_unlock(&ubi->wl_lock);
1195 /* Wait for the WL worker by taking the @ubi->move_mutex */
1196 mutex_lock(&ubi->move_mutex);
1197 mutex_unlock(&ubi->move_mutex);
1199 } else if (e == ubi->move_to) {
1201 * User is putting the physical eraseblock which was selected
1202 * as the target the data is moved to. It may happen if the EBA
1203 * sub-system already re-mapped the LEB in 'ubi_eba_copy_leb()'
1204 * but the WL sub-system has not put the PEB to the "used" tree
1205 * yet, but it is about to do this. So we just set a flag which
1206 * will tell the WL worker that the PEB is not needed anymore
1207 * and should be scheduled for erasure.
1209 dbg_wl("PEB %d is the target of data moving", pnum);
1210 ubi_assert(!ubi->move_to_put);
1211 ubi->move_to_put = 1;
1212 spin_unlock(&ubi->wl_lock);
1213 up_read(&ubi->fm_protect);
1216 if (in_wl_tree(e, &ubi->used)) {
1217 self_check_in_wl_tree(ubi, e, &ubi->used);
1218 rb_erase(&e->u.rb, &ubi->used);
1219 } else if (in_wl_tree(e, &ubi->scrub)) {
1220 self_check_in_wl_tree(ubi, e, &ubi->scrub);
1221 rb_erase(&e->u.rb, &ubi->scrub);
1222 } else if (in_wl_tree(e, &ubi->erroneous)) {
1223 self_check_in_wl_tree(ubi, e, &ubi->erroneous);
1224 rb_erase(&e->u.rb, &ubi->erroneous);
1225 ubi->erroneous_peb_count -= 1;
1226 ubi_assert(ubi->erroneous_peb_count >= 0);
1227 /* Erroneous PEBs should be tortured */
1230 err = prot_queue_del(ubi, e->pnum);
1232 ubi_err(ubi, "PEB %d not found", pnum);
1234 spin_unlock(&ubi->wl_lock);
1235 up_read(&ubi->fm_protect);
1240 spin_unlock(&ubi->wl_lock);
1242 err = schedule_erase(ubi, e, vol_id, lnum, torture);
1244 spin_lock(&ubi->wl_lock);
1245 wl_tree_add(e, &ubi->used);
1246 spin_unlock(&ubi->wl_lock);
1249 up_read(&ubi->fm_protect);
1254 * ubi_wl_scrub_peb - schedule a physical eraseblock for scrubbing.
1255 * @ubi: UBI device description object
1256 * @pnum: the physical eraseblock to schedule
1258 * If a bit-flip in a physical eraseblock is detected, this physical eraseblock
1259 * needs scrubbing. This function schedules a physical eraseblock for
1260 * scrubbing which is done in background. This function returns zero in case of
1261 * success and a negative error code in case of failure.
1263 int ubi_wl_scrub_peb(struct ubi_device *ubi, int pnum)
1265 struct ubi_wl_entry *e;
1267 ubi_msg(ubi, "schedule PEB %d for scrubbing", pnum);
1270 spin_lock(&ubi->wl_lock);
1271 e = ubi->lookuptbl[pnum];
1272 if (e == ubi->move_from || in_wl_tree(e, &ubi->scrub) ||
1273 in_wl_tree(e, &ubi->erroneous)) {
1274 spin_unlock(&ubi->wl_lock);
1278 if (e == ubi->move_to) {
1280 * This physical eraseblock was used to move data to. The data
1281 * was moved but the PEB was not yet inserted to the proper
1282 * tree. We should just wait a little and let the WL worker
1285 spin_unlock(&ubi->wl_lock);
1286 dbg_wl("the PEB %d is not in proper tree, retry", pnum);
1291 if (in_wl_tree(e, &ubi->used)) {
1292 self_check_in_wl_tree(ubi, e, &ubi->used);
1293 rb_erase(&e->u.rb, &ubi->used);
1297 err = prot_queue_del(ubi, e->pnum);
1299 ubi_err(ubi, "PEB %d not found", pnum);
1301 spin_unlock(&ubi->wl_lock);
1306 wl_tree_add(e, &ubi->scrub);
1307 spin_unlock(&ubi->wl_lock);
1310 * Technically scrubbing is the same as wear-leveling, so it is done
1313 return ensure_wear_leveling(ubi, 0);
1317 * ubi_wl_flush - flush all pending works.
1318 * @ubi: UBI device description object
1319 * @vol_id: the volume id to flush for
1320 * @lnum: the logical eraseblock number to flush for
1322 * This function executes all pending works for a particular volume id /
1323 * logical eraseblock number pair. If either value is set to %UBI_ALL, then it
1324 * acts as a wildcard for all of the corresponding volume numbers or logical
1325 * eraseblock numbers. It returns zero in case of success and a negative error
1326 * code in case of failure.
1328 int ubi_wl_flush(struct ubi_device *ubi, int vol_id, int lnum)
1334 * Erase while the pending works queue is not empty, but not more than
1335 * the number of currently pending works.
1337 dbg_wl("flush pending work for LEB %d:%d (%d pending works)",
1338 vol_id, lnum, ubi->works_count);
1341 struct ubi_work *wrk, *tmp;
1344 down_read(&ubi->work_sem);
1345 spin_lock(&ubi->wl_lock);
1346 list_for_each_entry_safe(wrk, tmp, &ubi->works, list) {
1347 if ((vol_id == UBI_ALL || wrk->vol_id == vol_id) &&
1348 (lnum == UBI_ALL || wrk->lnum == lnum)) {
1349 list_del(&wrk->list);
1350 ubi->works_count -= 1;
1351 ubi_assert(ubi->works_count >= 0);
1352 spin_unlock(&ubi->wl_lock);
1354 err = wrk->func(ubi, wrk, 0);
1356 up_read(&ubi->work_sem);
1360 spin_lock(&ubi->wl_lock);
1365 spin_unlock(&ubi->wl_lock);
1366 up_read(&ubi->work_sem);
1370 * Make sure all the works which have been done in parallel are
1373 down_write(&ubi->work_sem);
1374 up_write(&ubi->work_sem);
1380 * tree_destroy - destroy an RB-tree.
1381 * @ubi: UBI device description object
1382 * @root: the root of the tree to destroy
1384 static void tree_destroy(struct ubi_device *ubi, struct rb_root *root)
1387 struct ubi_wl_entry *e;
1393 else if (rb->rb_right)
1396 e = rb_entry(rb, struct ubi_wl_entry, u.rb);
1400 if (rb->rb_left == &e->u.rb)
1403 rb->rb_right = NULL;
1406 wl_entry_destroy(ubi, e);
1412 * ubi_thread - UBI background thread.
1413 * @u: the UBI device description object pointer
1415 int ubi_thread(void *u)
1418 struct ubi_device *ubi = u;
1420 ubi_msg(ubi, "background thread \"%s\" started, PID %d",
1421 ubi->bgt_name, task_pid_nr(current));
1427 if (kthread_should_stop())
1430 if (try_to_freeze())
1433 spin_lock(&ubi->wl_lock);
1434 if (list_empty(&ubi->works) || ubi->ro_mode ||
1435 !ubi->thread_enabled || ubi_dbg_is_bgt_disabled(ubi)) {
1436 set_current_state(TASK_INTERRUPTIBLE);
1437 spin_unlock(&ubi->wl_lock);
1441 spin_unlock(&ubi->wl_lock);
1445 ubi_err(ubi, "%s: work failed with error code %d",
1446 ubi->bgt_name, err);
1447 if (failures++ > WL_MAX_FAILURES) {
1449 * Too many failures, disable the thread and
1450 * switch to read-only mode.
1452 ubi_msg(ubi, "%s: %d consecutive failures",
1453 ubi->bgt_name, WL_MAX_FAILURES);
1455 ubi->thread_enabled = 0;
1464 dbg_wl("background thread \"%s\" is killed", ubi->bgt_name);
1469 * shutdown_work - shutdown all pending works.
1470 * @ubi: UBI device description object
1472 static void shutdown_work(struct ubi_device *ubi)
1474 #ifdef CONFIG_MTD_UBI_FASTMAP
1475 flush_work(&ubi->fm_work);
1477 while (!list_empty(&ubi->works)) {
1478 struct ubi_work *wrk;
1480 wrk = list_entry(ubi->works.next, struct ubi_work, list);
1481 list_del(&wrk->list);
1482 wrk->func(ubi, wrk, 1);
1483 ubi->works_count -= 1;
1484 ubi_assert(ubi->works_count >= 0);
1489 * ubi_wl_init - initialize the WL sub-system using attaching information.
1490 * @ubi: UBI device description object
1491 * @ai: attaching information
1493 * This function returns zero in case of success, and a negative error code in
1496 int ubi_wl_init(struct ubi_device *ubi, struct ubi_attach_info *ai)
1498 int err, i, reserved_pebs, found_pebs = 0;
1499 struct rb_node *rb1, *rb2;
1500 struct ubi_ainf_volume *av;
1501 struct ubi_ainf_peb *aeb, *tmp;
1502 struct ubi_wl_entry *e;
1504 ubi->used = ubi->erroneous = ubi->free = ubi->scrub = RB_ROOT;
1505 spin_lock_init(&ubi->wl_lock);
1506 mutex_init(&ubi->move_mutex);
1507 init_rwsem(&ubi->work_sem);
1508 ubi->max_ec = ai->max_ec;
1509 INIT_LIST_HEAD(&ubi->works);
1511 sprintf(ubi->bgt_name, UBI_BGT_NAME_PATTERN, ubi->ubi_num);
1514 ubi->lookuptbl = kzalloc(ubi->peb_count * sizeof(void *), GFP_KERNEL);
1515 if (!ubi->lookuptbl)
1518 for (i = 0; i < UBI_PROT_QUEUE_LEN; i++)
1519 INIT_LIST_HEAD(&ubi->pq[i]);
1522 list_for_each_entry_safe(aeb, tmp, &ai->erase, u.list) {
1525 e = kmem_cache_alloc(ubi_wl_entry_slab, GFP_KERNEL);
1529 e->pnum = aeb->pnum;
1531 ubi->lookuptbl[e->pnum] = e;
1532 if (schedule_erase(ubi, e, aeb->vol_id, aeb->lnum, 0)) {
1533 wl_entry_destroy(ubi, e);
1540 ubi->free_count = 0;
1541 list_for_each_entry(aeb, &ai->free, u.list) {
1544 e = kmem_cache_alloc(ubi_wl_entry_slab, GFP_KERNEL);
1548 e->pnum = aeb->pnum;
1550 ubi_assert(e->ec >= 0);
1552 wl_tree_add(e, &ubi->free);
1555 ubi->lookuptbl[e->pnum] = e;
1560 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) {
1561 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) {
1564 e = kmem_cache_alloc(ubi_wl_entry_slab, GFP_KERNEL);
1568 e->pnum = aeb->pnum;
1570 ubi->lookuptbl[e->pnum] = e;
1573 dbg_wl("add PEB %d EC %d to the used tree",
1575 wl_tree_add(e, &ubi->used);
1577 dbg_wl("add PEB %d EC %d to the scrub tree",
1579 wl_tree_add(e, &ubi->scrub);
1586 dbg_wl("found %i PEBs", found_pebs);
1589 ubi_assert(ubi->good_peb_count ==
1590 found_pebs + ubi->fm->used_blocks);
1592 for (i = 0; i < ubi->fm->used_blocks; i++) {
1594 ubi->lookuptbl[e->pnum] = e;
1598 ubi_assert(ubi->good_peb_count == found_pebs);
1600 reserved_pebs = WL_RESERVED_PEBS;
1601 ubi_fastmap_init(ubi, &reserved_pebs);
1603 if (ubi->avail_pebs < reserved_pebs) {
1604 ubi_err(ubi, "no enough physical eraseblocks (%d, need %d)",
1605 ubi->avail_pebs, reserved_pebs);
1606 if (ubi->corr_peb_count)
1607 ubi_err(ubi, "%d PEBs are corrupted and not used",
1608 ubi->corr_peb_count);
1612 ubi->avail_pebs -= reserved_pebs;
1613 ubi->rsvd_pebs += reserved_pebs;
1615 /* Schedule wear-leveling if needed */
1616 err = ensure_wear_leveling(ubi, 0);
1624 tree_destroy(ubi, &ubi->used);
1625 tree_destroy(ubi, &ubi->free);
1626 tree_destroy(ubi, &ubi->scrub);
1627 kfree(ubi->lookuptbl);
1632 * protection_queue_destroy - destroy the protection queue.
1633 * @ubi: UBI device description object
1635 static void protection_queue_destroy(struct ubi_device *ubi)
1638 struct ubi_wl_entry *e, *tmp;
1640 for (i = 0; i < UBI_PROT_QUEUE_LEN; ++i) {
1641 list_for_each_entry_safe(e, tmp, &ubi->pq[i], u.list) {
1642 list_del(&e->u.list);
1643 wl_entry_destroy(ubi, e);
1649 * ubi_wl_close - close the wear-leveling sub-system.
1650 * @ubi: UBI device description object
1652 void ubi_wl_close(struct ubi_device *ubi)
1654 dbg_wl("close the WL sub-system");
1655 ubi_fastmap_close(ubi);
1657 protection_queue_destroy(ubi);
1658 tree_destroy(ubi, &ubi->used);
1659 tree_destroy(ubi, &ubi->erroneous);
1660 tree_destroy(ubi, &ubi->free);
1661 tree_destroy(ubi, &ubi->scrub);
1662 kfree(ubi->lookuptbl);
1666 * self_check_ec - make sure that the erase counter of a PEB is correct.
1667 * @ubi: UBI device description object
1668 * @pnum: the physical eraseblock number to check
1669 * @ec: the erase counter to check
1671 * This function returns zero if the erase counter of physical eraseblock @pnum
1672 * is equivalent to @ec, and a negative error code if not or if an error
1675 static int self_check_ec(struct ubi_device *ubi, int pnum, int ec)
1679 struct ubi_ec_hdr *ec_hdr;
1681 if (!ubi_dbg_chk_gen(ubi))
1684 ec_hdr = kzalloc(ubi->ec_hdr_alsize, GFP_NOFS);
1688 err = ubi_io_read_ec_hdr(ubi, pnum, ec_hdr, 0);
1689 if (err && err != UBI_IO_BITFLIPS) {
1690 /* The header does not have to exist */
1695 read_ec = be64_to_cpu(ec_hdr->ec);
1696 if (ec != read_ec && read_ec - ec > 1) {
1697 ubi_err(ubi, "self-check failed for PEB %d", pnum);
1698 ubi_err(ubi, "read EC is %lld, should be %d", read_ec, ec);
1710 * self_check_in_wl_tree - check that wear-leveling entry is in WL RB-tree.
1711 * @ubi: UBI device description object
1712 * @e: the wear-leveling entry to check
1713 * @root: the root of the tree
1715 * This function returns zero if @e is in the @root RB-tree and %-EINVAL if it
1718 static int self_check_in_wl_tree(const struct ubi_device *ubi,
1719 struct ubi_wl_entry *e, struct rb_root *root)
1721 if (!ubi_dbg_chk_gen(ubi))
1724 if (in_wl_tree(e, root))
1727 ubi_err(ubi, "self-check failed for PEB %d, EC %d, RB-tree %p ",
1728 e->pnum, e->ec, root);
1734 * self_check_in_pq - check if wear-leveling entry is in the protection
1736 * @ubi: UBI device description object
1737 * @e: the wear-leveling entry to check
1739 * This function returns zero if @e is in @ubi->pq and %-EINVAL if it is not.
1741 static int self_check_in_pq(const struct ubi_device *ubi,
1742 struct ubi_wl_entry *e)
1744 struct ubi_wl_entry *p;
1747 if (!ubi_dbg_chk_gen(ubi))
1750 for (i = 0; i < UBI_PROT_QUEUE_LEN; ++i)
1751 list_for_each_entry(p, &ubi->pq[i], u.list)
1755 ubi_err(ubi, "self-check failed for PEB %d, EC %d, Protect queue",
1760 #ifndef CONFIG_MTD_UBI_FASTMAP
1761 static struct ubi_wl_entry *get_peb_for_wl(struct ubi_device *ubi)
1763 struct ubi_wl_entry *e;
1765 e = find_wl_entry(ubi, &ubi->free, WL_FREE_MAX_DIFF);
1766 self_check_in_wl_tree(ubi, e, &ubi->free);
1768 ubi_assert(ubi->free_count >= 0);
1769 rb_erase(&e->u.rb, &ubi->free);
1775 * produce_free_peb - produce a free physical eraseblock.
1776 * @ubi: UBI device description object
1778 * This function tries to make a free PEB by means of synchronous execution of
1779 * pending works. This may be needed if, for example the background thread is
1780 * disabled. Returns zero in case of success and a negative error code in case
1783 static int produce_free_peb(struct ubi_device *ubi)
1787 while (!ubi->free.rb_node && ubi->works_count) {
1788 spin_unlock(&ubi->wl_lock);
1790 dbg_wl("do one work synchronously");
1793 spin_lock(&ubi->wl_lock);
1802 * ubi_wl_get_peb - get a physical eraseblock.
1803 * @ubi: UBI device description object
1805 * This function returns a physical eraseblock in case of success and a
1806 * negative error code in case of failure.
1807 * Returns with ubi->fm_eba_sem held in read mode!
1809 int ubi_wl_get_peb(struct ubi_device *ubi)
1812 struct ubi_wl_entry *e;
1815 down_read(&ubi->fm_eba_sem);
1816 spin_lock(&ubi->wl_lock);
1817 if (!ubi->free.rb_node) {
1818 if (ubi->works_count == 0) {
1819 ubi_err(ubi, "no free eraseblocks");
1820 ubi_assert(list_empty(&ubi->works));
1821 spin_unlock(&ubi->wl_lock);
1825 err = produce_free_peb(ubi);
1827 spin_unlock(&ubi->wl_lock);
1830 spin_unlock(&ubi->wl_lock);
1831 up_read(&ubi->fm_eba_sem);
1835 e = wl_get_wle(ubi);
1836 prot_queue_add(ubi, e);
1837 spin_unlock(&ubi->wl_lock);
1839 err = ubi_self_check_all_ff(ubi, e->pnum, ubi->vid_hdr_aloffset,
1840 ubi->peb_size - ubi->vid_hdr_aloffset);
1842 ubi_err(ubi, "new PEB %d does not contain all 0xFF bytes", e->pnum);
1849 #include "fastmap-wl.c"