Home
last modified time | relevance | path

Searched refs:ubi_rb_for_each_entry (Results 1 - 14 of 14) sorted by relevance

/kernel/linux/linux-5.10/drivers/mtd/ubi/
H A Dattach.c1415 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) { in scan_all()
1416 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) in scan_all()
1674 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) { in self_check_ai()
1717 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) { in self_check_ai()
1788 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) { in self_check_ai()
1790 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) { in self_check_ai()
1876 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) in self_check_ai()
1877 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) in self_check_ai()
H A Dubi.h1004 ubi_rb_for_each_entry((tmp_rb), (e), &(ubi)->free, u.rb)
1013 ubi_rb_for_each_entry((tmp_rb), (e), &(ubi)->used, u.rb)
1022 ubi_rb_for_each_entry((tmp_rb), (e), &(ubi)->scrub, u.rb)
1035 * ubi_rb_for_each_entry - walk an RB-tree.
1041 #define ubi_rb_for_each_entry(rb, pos, root, member) \ macro
H A Dfastmap-wl.c32 ubi_rb_for_each_entry(p, e, root, u.rb) { in find_anchor_wl_entry() function
H A Deba.c1573 ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb) in self_check_eba()
1580 ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb) in self_check_eba()
1657 ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb) { in ubi_eba_init()
H A Dfastmap.c376 ubi_rb_for_each_entry(node, av, &ai->volumes, rb) { in unmap_peb()
377 ubi_rb_for_each_entry(node2, aeb, &av->root, u.rb) { in unmap_peb()
532 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) in count_fastmap_pebs()
533 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) in count_fastmap_pebs()
H A Dvtbl.c399 ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb) { in process_lvol()
H A Dwl.c1828 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) {
1829 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) {
/kernel/linux/linux-6.6/drivers/mtd/ubi/
H A Dattach.c1415 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) { in scan_all()
1416 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) in scan_all()
1674 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) { in self_check_ai()
1717 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) { in self_check_ai()
1788 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) { in self_check_ai()
1790 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) { in self_check_ai()
1876 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) in self_check_ai()
1877 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) in self_check_ai()
H A Dubi.h1003 ubi_rb_for_each_entry((tmp_rb), (e), &(ubi)->free, u.rb)
1012 ubi_rb_for_each_entry((tmp_rb), (e), &(ubi)->used, u.rb)
1021 ubi_rb_for_each_entry((tmp_rb), (e), &(ubi)->scrub, u.rb)
1034 * ubi_rb_for_each_entry - walk an RB-tree.
1040 #define ubi_rb_for_each_entry(rb, pos, root, member) \ macro
H A Deba.c1573 ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb) in self_check_eba()
1580 ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb) in self_check_eba()
1657 ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb) { in ubi_eba_init()
H A Dfastmap.c376 ubi_rb_for_each_entry(node, av, &ai->volumes, rb) { in unmap_peb()
377 ubi_rb_for_each_entry(node2, aeb, &av->root, u.rb) { in unmap_peb()
532 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) in count_fastmap_pebs()
533 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) in count_fastmap_pebs()
H A Dfastmap-wl.c32 ubi_rb_for_each_entry(p, e, root, u.rb) { in find_anchor_wl_entry() function
H A Dvtbl.c399 ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb) { in process_lvol()
H A Dwl.c1838 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) {
1839 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) {

Completed in 23 milliseconds