Lines Matching refs:e
127 struct ubi_wl_entry *e, struct rb_root *root);
129 struct ubi_wl_entry *e);
139 static void wl_tree_add(struct ubi_wl_entry *e, struct rb_root *root) in wl_tree_add() argument
150 if (e->ec < e1->ec) in wl_tree_add()
152 else if (e->ec > e1->ec) in wl_tree_add()
155 ubi_assert(e->pnum != e1->pnum); in wl_tree_add()
156 if (e->pnum < e1->pnum) in wl_tree_add()
163 rb_link_node(&e->u.rb, parent, p); in wl_tree_add()
164 rb_insert_color(&e->u.rb, root); in wl_tree_add()
175 static void wl_entry_destroy(struct ubi_device *ubi, struct ubi_wl_entry *e) in wl_entry_destroy() argument
177 ubi->lookuptbl[e->pnum] = NULL; in wl_entry_destroy()
178 kmem_cache_free(ubi_wl_entry_slab, e); in wl_entry_destroy()
236 static int in_wl_tree(struct ubi_wl_entry *e, struct rb_root *root) in in_wl_tree() argument
246 if (e->pnum == e1->pnum) { in in_wl_tree()
247 ubi_assert(e == e1); in in_wl_tree()
251 if (e->ec < e1->ec) in in_wl_tree()
253 else if (e->ec > e1->ec) in in_wl_tree()
256 ubi_assert(e->pnum != e1->pnum); in in_wl_tree()
257 if (e->pnum < e1->pnum) in in_wl_tree()
275 static inline int in_pq(const struct ubi_device *ubi, struct ubi_wl_entry *e) in in_pq() argument
282 if (p == e) in in_pq()
298 static void prot_queue_add(struct ubi_device *ubi, struct ubi_wl_entry *e) in prot_queue_add() argument
305 list_add_tail(&e->u.list, &ubi->pq[pq_tail]); in prot_queue_add()
306 dbg_wl("added PEB %d EC %d to the protection queue", e->pnum, e->ec); in prot_queue_add()
322 struct ubi_wl_entry *e; in find_wl_entry() local
325 e = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb); in find_wl_entry()
326 max = e->ec + diff; in find_wl_entry()
337 e = e1; in find_wl_entry()
341 return e; in find_wl_entry()
356 struct ubi_wl_entry *e, *first, *last; in find_mean_wl_entry() local
362 e = rb_entry(root->rb_node, struct ubi_wl_entry, u.rb); in find_mean_wl_entry()
367 e = may_reserve_for_fm(ubi, e, root); in find_mean_wl_entry()
369 e = find_wl_entry(ubi, root, WL_FREE_MAX_DIFF/2); in find_mean_wl_entry()
371 return e; in find_mean_wl_entry()
384 struct ubi_wl_entry *e; in wl_get_wle() local
386 e = find_mean_wl_entry(ubi, &ubi->free); in wl_get_wle()
387 if (!e) { in wl_get_wle()
392 self_check_in_wl_tree(ubi, e, &ubi->free); in wl_get_wle()
398 rb_erase(&e->u.rb, &ubi->free); in wl_get_wle()
400 dbg_wl("PEB %d EC %d", e->pnum, e->ec); in wl_get_wle()
402 return e; in wl_get_wle()
415 struct ubi_wl_entry *e; in prot_queue_del() local
417 e = ubi->lookuptbl[pnum]; in prot_queue_del()
418 if (!e) in prot_queue_del()
421 if (self_check_in_pq(ubi, e)) in prot_queue_del()
424 list_del(&e->u.list); in prot_queue_del()
425 dbg_wl("deleted PEB %d from the protection queue", e->pnum); in prot_queue_del()
438 static int sync_erase(struct ubi_device *ubi, struct ubi_wl_entry *e, in sync_erase() argument
443 unsigned long long ec = e->ec; in sync_erase()
445 dbg_wl("erase PEB %d, old EC %llu", e->pnum, ec); in sync_erase()
447 err = self_check_ec(ubi, e->pnum, e->ec); in sync_erase()
455 err = ubi_io_sync_erase(ubi, e->pnum, torture); in sync_erase()
466 e->pnum, ec); in sync_erase()
471 dbg_wl("erased PEB %d, new EC %llu", e->pnum, ec); in sync_erase()
475 err = ubi_io_write_ec_hdr(ubi, e->pnum, ec_hdr); in sync_erase()
479 e->ec = ec; in sync_erase()
481 if (e->ec > ubi->max_ec) in sync_erase()
482 ubi->max_ec = e->ec; in sync_erase()
500 struct ubi_wl_entry *e, *tmp; in serve_prot_queue() local
510 list_for_each_entry_safe(e, tmp, &ubi->pq[ubi->pq_head], u.list) { in serve_prot_queue()
512 e->pnum, e->ec); in serve_prot_queue()
514 list_del(&e->u.list); in serve_prot_queue()
515 wl_tree_add(e, &ubi->used); in serve_prot_queue()
583 static int schedule_erase(struct ubi_device *ubi, struct ubi_wl_entry *e, in schedule_erase() argument
588 ubi_assert(e); in schedule_erase()
591 e->pnum, e->ec, torture); in schedule_erase()
598 wl_wrk->e = e; in schedule_erase()
620 static int do_sync_erase(struct ubi_device *ubi, struct ubi_wl_entry *e, in do_sync_erase() argument
625 dbg_wl("sync erase of PEB %i", e->pnum); in do_sync_erase()
627 wl_wrk.e = e; in do_sync_erase()
1075 struct ubi_wl_entry *e = wl_wrk->e; local
1076 int pnum = e->pnum;
1082 pnum, e->ec, wl_wrk->vol_id, wl_wrk->lnum);
1084 err = sync_erase(ubi, e, wl_wrk->torture);
1089 e->pnum < UBI_FM_MAX_START) {
1093 ubi->fm_next_anchor = e;
1096 wl_tree_add(e, &ubi->free);
1120 err1 = schedule_erase(ubi, e, vol_id, lnum, 0, false);
1122 wl_entry_destroy(ubi, e);
1129 wl_entry_destroy(ubi, e);
1204 struct ubi_wl_entry *e = wl_wrk->e; local
1206 dbg_wl("cancel erasure of PEB %d EC %d", e->pnum, e->ec);
1208 wl_entry_destroy(ubi, e);
1234 struct ubi_wl_entry *e; local
1244 e = ubi->lookuptbl[pnum];
1245 if (e == ubi->move_from) {
1258 } else if (e == ubi->move_to) {
1275 if (in_wl_tree(e, &ubi->used)) {
1276 self_check_in_wl_tree(ubi, e, &ubi->used);
1277 rb_erase(&e->u.rb, &ubi->used);
1278 } else if (in_wl_tree(e, &ubi->scrub)) {
1279 self_check_in_wl_tree(ubi, e, &ubi->scrub);
1280 rb_erase(&e->u.rb, &ubi->scrub);
1281 } else if (in_wl_tree(e, &ubi->erroneous)) {
1282 self_check_in_wl_tree(ubi, e, &ubi->erroneous);
1283 rb_erase(&e->u.rb, &ubi->erroneous);
1289 err = prot_queue_del(ubi, e->pnum);
1301 err = schedule_erase(ubi, e, vol_id, lnum, torture, false);
1304 wl_tree_add(e, &ubi->used);
1324 struct ubi_wl_entry *e; local
1330 e = ubi->lookuptbl[pnum];
1331 if (e == ubi->move_from || in_wl_tree(e, &ubi->scrub) ||
1332 in_wl_tree(e, &ubi->erroneous)) {
1337 if (e == ubi->move_to) {
1350 if (in_wl_tree(e, &ubi->used)) {
1351 self_check_in_wl_tree(ubi, e, &ubi->used);
1352 rb_erase(&e->u.rb, &ubi->used);
1356 err = prot_queue_del(ubi, e->pnum);
1365 wl_tree_add(e, &ubi->scrub);
1438 static bool scrub_possible(struct ubi_device *ubi, struct ubi_wl_entry *e) argument
1440 if (in_wl_tree(e, &ubi->scrub))
1442 else if (in_wl_tree(e, &ubi->erroneous))
1444 else if (ubi->move_from == e)
1446 else if (ubi->move_to == e)
1474 struct ubi_wl_entry *e; local
1492 e = ubi->lookuptbl[pnum];
1493 if (!e) {
1502 if (!scrub_possible(ubi, e)) {
1525 e = ubi->lookuptbl[pnum];
1526 if (!e) {
1535 if (!scrub_possible(ubi, e)) {
1541 if (in_pq(ubi, e)) {
1542 prot_queue_del(ubi, e->pnum);
1543 wl_tree_add(e, &ubi->scrub);
1547 } else if (in_wl_tree(e, &ubi->used)) {
1548 rb_erase(&e->u.rb, &ubi->used);
1549 wl_tree_add(e, &ubi->scrub);
1553 } else if (in_wl_tree(e, &ubi->free)) {
1554 rb_erase(&e->u.rb, &ubi->free);
1562 err = schedule_erase(ubi, e, UBI_UNKNOWN, UBI_UNKNOWN,
1590 struct ubi_wl_entry *e; local
1599 e = rb_entry(rb, struct ubi_wl_entry, u.rb);
1603 if (rb->rb_left == &e->u.rb)
1609 wl_entry_destroy(ubi, e);
1710 struct ubi_wl_entry *e; local
1713 e = kmem_cache_alloc(ubi_wl_entry_slab, GFP_KERNEL);
1714 if (!e)
1717 e->pnum = aeb->pnum;
1718 e->ec = aeb->ec;
1719 ubi->lookuptbl[e->pnum] = e;
1722 err = sync_erase(ubi, e, false);
1726 wl_tree_add(e, &ubi->free);
1729 err = schedule_erase(ubi, e, aeb->vol_id, aeb->lnum, 0, false);
1737 wl_entry_destroy(ubi, e);
1756 struct ubi_wl_entry *e; local
1790 e = kmem_cache_alloc(ubi_wl_entry_slab, GFP_KERNEL);
1791 if (!e) {
1796 e->pnum = aeb->pnum;
1797 e->ec = aeb->ec;
1798 ubi_assert(e->ec >= 0);
1800 wl_tree_add(e, &ubi->free);
1803 ubi->lookuptbl[e->pnum] = e;
1812 e = kmem_cache_alloc(ubi_wl_entry_slab, GFP_KERNEL);
1813 if (!e) {
1818 e->pnum = aeb->pnum;
1819 e->ec = aeb->ec;
1820 ubi->lookuptbl[e->pnum] = e;
1824 e->pnum, e->ec);
1825 wl_tree_add(e, &ubi->used);
1828 e->pnum, e->ec);
1829 wl_tree_add(e, &ubi->scrub);
1839 e = ubi_find_fm_block(ubi, aeb->pnum);
1841 if (e) {
1842 ubi_assert(!ubi->lookuptbl[e->pnum]);
1843 ubi->lookuptbl[e->pnum] = e;
1922 struct ubi_wl_entry *e, *tmp; local
1925 list_for_each_entry_safe(e, tmp, &ubi->pq[i], u.list) {
1926 list_del(&e->u.list);
1927 wl_entry_destroy(ubi, e);
2003 struct ubi_wl_entry *e, struct rb_root *root) argument
2008 if (in_wl_tree(e, root))
2012 e->pnum, e->ec, root);
2026 struct ubi_wl_entry *e) argument
2031 if (in_pq(ubi, e))
2035 e->pnum, e->ec);
2042 struct ubi_wl_entry *e; local
2044 e = find_wl_entry(ubi, &ubi->free, WL_FREE_MAX_DIFF);
2045 self_check_in_wl_tree(ubi, e, &ubi->free);
2048 rb_erase(&e->u.rb, &ubi->free);
2050 return e;
2091 struct ubi_wl_entry *e; local
2114 e = wl_get_wle(ubi);
2115 prot_queue_add(ubi, e);
2118 err = ubi_self_check_all_ff(ubi, e->pnum, ubi->vid_hdr_aloffset,
2121 ubi_err(ubi, "new PEB %d does not contain all 0xFF bytes", e->pnum);
2125 return e->pnum;