Home
last modified time | relevance | path

Searched refs:rb_entry (Results 1 – 14 of 14) sorted by relevance

/u-boot/fs/btrfs/
A Dextent-cache.c28 entry = rb_entry(node, struct cache_extent, rb_node); in cache_tree_comp_range()
43 entry = rb_entry(node2, struct cache_extent, rb_node); in cache_tree_comp_nodes()
56 entry = rb_entry(node, struct cache_extent, rb_node); in cache_tree_comp_range2()
75 entry = rb_entry(node2, struct cache_extent, rb_node); in cache_tree_comp_nodes2()
139 entry = rb_entry(node, struct cache_extent, rb_node); in lookup_cache_extent()
157 entry = rb_entry(node, struct cache_extent, rb_node); in lookup_cache_extent2()
176 entry = rb_entry(node, struct cache_extent, rb_node); in search_cache_extent()
207 return rb_entry(node, struct cache_extent, rb_node); in first_cache_extent()
216 return rb_entry(node, struct cache_extent, rb_node); in last_cache_extent()
225 return rb_entry(node, struct cache_extent, rb_node); in prev_cache_extent()
[all …]
A Ddisk-io.c704 root = rb_entry(node, struct btrfs_root, rb_node); in btrfs_fs_roots_compare_objectids()
717 root = rb_entry(node2, struct btrfs_root, rb_node); in btrfs_fs_roots_compare_roots()
/u-boot/include/linux/
A Drbtree_augmented.h46 rbstruct *node = rb_entry(rb, rbstruct, rbfield); \
57 rbstruct *old = rb_entry(rb_old, rbstruct, rbfield); \
58 rbstruct *new = rb_entry(rb_new, rbstruct, rbfield); \
64 rbstruct *old = rb_entry(rb_old, rbstruct, rbfield); \
65 rbstruct *new = rb_entry(rb_new, rbstruct, rbfield); \
A Drbtree.h39 #define rb_entry(ptr, type, member) container_of(ptr, type, member) macro
79 ____ptr ? rb_entry(____ptr, type, member) : NULL; \
/u-boot/drivers/mtd/ubi/
A Dwl.c155 e1 = rb_entry(parent, struct ubi_wl_entry, u.rb); in wl_tree_add()
251 e1 = rb_entry(p, struct ubi_wl_entry, u.rb); in in_wl_tree()
311 e = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb); in find_wl_entry()
318 e1 = rb_entry(p, struct ubi_wl_entry, u.rb); in find_wl_entry()
352 first = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb); in find_mean_wl_entry()
353 last = rb_entry(rb_last(root), struct ubi_wl_entry, u.rb); in find_mean_wl_entry()
356 e = rb_entry(root->rb_node, struct ubi_wl_entry, u.rb); in find_mean_wl_entry()
738 e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
759 e1 = rb_entry(rb_first(&ubi->scrub), struct ubi_wl_entry, u.rb);
1009 e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
[all …]
A Dattach.c269 av = rb_entry(parent, struct ubi_ainf_volume, rb); in add_volume()
480 aeb = rb_entry(parent, struct ubi_ainf_peb, u.rb); in ubi_add_to_av()
611 av = rb_entry(p, struct ubi_ainf_volume, rb); in ubi_find_av()
638 aeb = rb_entry(rb, struct ubi_ainf_peb, u.rb); in ubi_remove_av()
1147 aeb = rb_entry(this, struct ubi_ainf_peb, u.rb); in destroy_av()
1197 av = rb_entry(rb, struct ubi_ainf_volume, rb); in destroy_ai()
A Dfastmap.c197 av = rb_entry(parent, struct ubi_ainf_volume, rb); in add_vol()
248 tmp_aeb = rb_entry(parent, struct ubi_ainf_peb, u.rb); in assign_aeb_to_av()
287 aeb = rb_entry(parent, struct ubi_ainf_peb, u.rb); in update_vol()
391 tmp_av = rb_entry(parent, struct ubi_ainf_volume, rb); in process_pool_aeb()
431 av = rb_entry(node, struct ubi_ainf_volume, rb); in unmap_peb()
435 aeb = rb_entry(node2, struct ubi_ainf_peb, u.rb); in unmap_peb()
A Dfastmap-wl.c391 e = rb_entry(rb_next(root->rb_node), in may_reserve_for_fm()
A Deba.c100 le = rb_entry(p, struct ubi_ltree_entry, rb); in ltree_lookup()
166 le1 = rb_entry(parent, struct ubi_ltree_entry, rb); in ltree_add_entry()
/u-boot/fs/ubifs/
A Dlog.c43 bud = rb_entry(p, struct ubifs_bud, rb); in ubifs_search_bud()
76 bud = rb_entry(p, struct ubifs_bud, rb); in ubifs_get_wbuf()
127 b = rb_entry(parent, struct ubifs_bud, rb); in ubifs_add_bud()
307 bud = rb_entry(p1, struct ubifs_bud, rb); in remove_buds()
552 dr = rb_entry(parent, struct done_ref, rb); in done_already()
A Dorphan.c76 o = rb_entry(parent, struct ubifs_orphan, rb); in ubifs_add_orphan()
114 o = rb_entry(p, struct ubifs_orphan, rb); in ubifs_delete_orphan()
516 o = rb_entry(parent, struct ubifs_orphan, rb); in insert_dead_orphan()
746 o = rb_entry(p, struct ubifs_orphan, rb); in dbg_find_orphan()
773 o = rb_entry(parent, struct check_orphan, rb); in dbg_ins_check_orphan()
795 o = rb_entry(p, struct check_orphan, rb); in dbg_find_check_orphan()
A Drecovery.c1272 e = rb_entry(parent, struct size_entry, rb); in add_ino()
1305 e = rb_entry(p, struct size_entry, rb); in find_ino()
1491 e = rb_entry(this, struct size_entry, rb); in ubifs_recover_size()
A Ddebug.c627 bud = rb_entry(rb, struct ubifs_bud, rb); in ubifs_dump_budg()
720 bud = rb_entry(rb, struct ubifs_bud, rb); in ubifs_dump_lprop()
1853 fscki = rb_entry(parent, struct fsck_inode, rb); in add_inode()
1931 fscki = rb_entry(p, struct fsck_inode, rb); in search_inode()
2200 fscki = rb_entry(this, struct fsck_inode, rb); in check_inodes()
A Dtnc.c90 o = rb_entry(parent, struct ubifs_old_idx, rb); in insert_old_idx()

Completed in 36 milliseconds