| /u-boot/include/linux/ |
| A D | rbtree.h | 24 struct rb_node { struct
26 struct rb_node *rb_right; argument
27 struct rb_node *rb_left; argument
32 struct rb_node *rb_node; member
41 #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
55 extern struct rb_node *rb_next(const struct rb_node *);
56 extern struct rb_node *rb_prev(const struct rb_node *);
62 extern struct rb_node *rb_next_postorder(const struct rb_node *);
65 extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
68 static inline void rb_link_node(struct rb_node * node, struct rb_node * parent, in rb_link_node()
[all …]
|
| A D | rbtree_augmented.h | 26 void (*propagate)(struct rb_node *node, struct rb_node *stop);
27 void (*copy)(struct rb_node *old, struct rb_node *new);
28 void (*rotate)(struct rb_node *old, struct rb_node *new);
32 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
43 rbname ## _propagate(struct rb_node *rb, struct rb_node *stop) \
55 rbname ## _copy(struct rb_node *rb_old, struct rb_node *rb_new) \
62 rbname ## _rotate(struct rb_node *rb_old, struct rb_node *rb_new) \
86 static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p) in rb_set_parent()
98 __rb_change_child(struct rb_node *old, struct rb_node *new, in __rb_change_child()
107 root->rb_node = new; in __rb_change_child()
[all …]
|
| /u-boot/lib/ |
| A D | rbtree.c | 42 static inline struct rb_node *rb_red_parent(struct rb_node *red) in rb_red_parent()
53 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, in __rb_rotate_set_parents()
64 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in __rb_insert()
193 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in ____rb_erase_color()
355 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in __rb_erase_color()
399 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in __rb_insert_augmented()
410 struct rb_node *n; in rb_first()
434 struct rb_node *rb_next(const struct rb_node *node) in rb_next()
466 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev()
495 void rb_replace_node(struct rb_node *victim, struct rb_node *new, in rb_replace_node()
[all …]
|
| /u-boot/fs/btrfs/ |
| A D | extent-cache.c | 38 static int cache_tree_comp_nodes(struct rb_node *node1, struct rb_node *node2) in cache_tree_comp_nodes()
70 static int cache_tree_comp_nodes2(struct rb_node *node1, struct rb_node *node2) in cache_tree_comp_nodes2()
129 struct rb_node *node; in lookup_cache_extent()
146 struct rb_node *node; in lookup_cache_extent2()
163 struct rb_node *next; in search_cache_extent()
164 struct rb_node *node; in search_cache_extent()
183 struct rb_node *next; in search_cache_extent2()
184 struct rb_node *node; in search_cache_extent2()
221 struct rb_node *node = rb_prev(&pe->rb_node); in prev_cache_extent()
230 struct rb_node *node = rb_next(&pe->rb_node); in next_cache_extent()
[all …]
|
| A D | extent-cache.h | 19 struct rb_node rb_node; member
|
| A D | disk-io.c | 620 static void __free_fs_root(struct rb_node *node) in __free_fs_root()
624 root = container_of(node, struct btrfs_root, rb_node); in __free_fs_root()
698 static int btrfs_fs_roots_compare_objectids(struct rb_node *node, in btrfs_fs_roots_compare_objectids()
704 root = rb_entry(node, struct btrfs_root, rb_node); in btrfs_fs_roots_compare_objectids()
713 int btrfs_fs_roots_compare_roots(struct rb_node *node1, struct rb_node *node2) in btrfs_fs_roots_compare_roots()
717 root = rb_entry(node2, struct btrfs_root, rb_node); in btrfs_fs_roots_compare_roots()
725 struct rb_node *node; in btrfs_read_fs_root()
740 return container_of(node, struct btrfs_root, rb_node); in btrfs_read_fs_root()
746 ret = rb_insert(&fs_info->fs_root_tree, &root->rb_node, in btrfs_read_fs_root()
|
| A D | ctree.h | 95 struct rb_node rb_node; member
|
| /u-boot/fs/btrfs/common/ |
| A D | rbtree-utils.c | 22 int rb_insert(struct rb_root *root, struct rb_node *node, in rb_insert()
25 struct rb_node **p = &root->rb_node; in rb_insert()
26 struct rb_node *parent = NULL; in rb_insert()
46 struct rb_node *rb_search(struct rb_root *root, void *key, rb_compare_keys comp, in rb_search()
47 struct rb_node **next_ret) in rb_search()
49 struct rb_node *n = root->rb_node; in rb_search()
50 struct rb_node *parent = NULL; in rb_search()
77 struct rb_node *node; in rb_free_nodes()
|
| A D | rbtree-utils.h | 29 typedef int (*rb_compare_nodes)(struct rb_node *node1, struct rb_node *node2);
30 typedef int (*rb_compare_keys)(struct rb_node *node, void *key);
31 typedef void (*rb_free_node)(struct rb_node *node);
33 int rb_insert(struct rb_root *root, struct rb_node *node,
39 struct rb_node *rb_search(struct rb_root *root, void *key, rb_compare_keys comp,
40 struct rb_node **next_ret);
|
| /u-boot/drivers/mtd/ubi/ |
| A D | fastmap-wl.c | 35 struct rb_node *p; in find_anchor_wl_entry()
69 struct rb_node *p; in anchor_pebs_avalible()
92 if (!ubi->free.rb_node || (ubi->free_count - ubi->beb_rsvd_pebs < 1)) in ubi_wl_get_fm_peb()
135 if (!ubi->free.rb_node) in ubi_refill_pools()
148 if (!ubi->free.rb_node || in ubi_refill_pools()
185 while (!ubi->free.rb_node && ubi->works_count) { in produce_free_peb()
391 e = rb_entry(rb_next(root->rb_node), in may_reserve_for_fm()
|
| A D | wl.c | 150 p = &root->rb_node; in wl_tree_add()
245 struct rb_node *p; in in_wl_tree()
247 p = root->rb_node; in in_wl_tree()
307 struct rb_node *p; in find_wl_entry()
314 p = root->rb_node; in find_wl_entry()
696 if (!ubi->free.rb_node ||
697 (!ubi->used.rb_node && !ubi->scrub.rb_node)) {
709 !ubi->free.rb_node, !ubi->used.rb_node);
999 if (!ubi->used.rb_node || !ubi->free.rb_node)
1415 struct rb_node *rb;
[all …]
|
| A D | attach.c | 262 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL; in add_volume()
455 struct rb_node **p, *parent = NULL; in ubi_add_to_av()
475 p = &av->root.rb_node; in ubi_add_to_av()
608 struct rb_node *p = ai->volumes.rb_node; in ubi_find_av()
632 struct rb_node *rb; in ubi_remove_av()
1139 struct rb_node *this = av->root.rb_node; in destroy_av()
1170 struct rb_node *rb; in destroy_ai()
1190 rb = ai->volumes.rb_node; in destroy_ai()
1230 struct rb_node *rb1, *rb2; in scan_all()
1506 struct rb_node *rb1, *rb2; in self_check_ai()
|
| A D | fastmap.c | 193 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL; in add_vol()
242 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL; in assign_aeb_to_av()
244 p = &av->root.rb_node; in assign_aeb_to_av()
281 struct rb_node **p = &av->root.rb_node, *parent = NULL; in update_vol()
378 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL; in process_pool_aeb()
427 struct rb_node *node, *node2; in unmap_peb()
584 struct rb_node *rb1, *rb2; in count_fastmap_pebs()
1121 struct rb_node *tmp_rb; in ubi_write_fastmap()
|
| A D | ubi.h | 174 struct rb_node rb;
196 struct rb_node rb;
659 struct rb_node rb;
694 struct rb_node rb;
|
| A D | eba.c | 94 struct rb_node *p; in ltree_lookup()
96 p = ubi->ltree.rb_node; in ltree_lookup()
155 struct rb_node **p, *parent = NULL; in ltree_add_entry()
163 p = &ubi->ltree.rb_node; in ltree_add_entry()
1301 struct rb_node *rb; in self_check_eba()
1393 struct rb_node *rb; in ubi_eba_init()
|
| A D | vtbl.c | 377 struct rb_node *rb;
|
| /u-boot/fs/ubifs/ |
| A D | log.c | 37 struct rb_node *p; in ubifs_search_bud()
41 p = c->buds.rb_node; in ubifs_search_bud()
66 struct rb_node *p; in ubifs_get_wbuf()
74 p = c->buds.rb_node; in ubifs_get_wbuf()
119 struct rb_node **p, *parent = NULL; in ubifs_add_bud()
124 p = &c->buds.rb_node; in ubifs_add_bud()
295 struct rb_node *p; in remove_buds()
302 struct rb_node *p1 = p; in remove_buds()
533 struct rb_node rb;
547 struct rb_node **p = &done_tree->rb_node, *parent = NULL; in done_already()
|
| A D | orphan.c | 59 struct rb_node **p, *parent = NULL; in ubifs_add_orphan()
73 p = &c->orph_tree.rb_node; in ubifs_add_orphan()
109 struct rb_node *p; in ubifs_delete_orphan()
112 p = c->orph_tree.rb_node; in ubifs_delete_orphan()
513 p = &c->orph_tree.rb_node; in insert_dead_orphan()
725 struct rb_node rb;
741 struct rb_node *p; in dbg_find_orphan()
744 p = c->orph_tree.rb_node; in dbg_find_orphan()
770 p = &root->rb_node; in dbg_ins_check_orphan()
791 struct rb_node *p; in dbg_find_check_orphan()
[all …]
|
| A D | recovery.c | 1248 struct rb_node rb;
1267 struct rb_node **p = &c->size_tree.rb_node, *parent = NULL; in add_ino()
1301 struct rb_node *p = c->size_tree.rb_node; in find_ino()
1485 struct rb_node *this = rb_first(&c->size_tree); in ubifs_recover_size()
|
| A D | debug.c | 584 struct rb_node *rb; in ubifs_dump_budg()
657 struct rb_node *rb; in ubifs_dump_lprop()
1806 struct rb_node rb;
1844 struct rb_node **p, *parent = NULL; in add_inode()
1850 p = &fsckd->inodes.rb_node; in add_inode()
1926 struct rb_node *p; in search_inode()
1929 p = fsckd->inodes.rb_node; in search_inode()
2197 struct rb_node *this = rb_first(&fsckd->inodes); in check_inodes()
|
| A D | ubifs.h | 875 struct rb_node rb;
1315 struct rb_node rb;
1519 struct rb_node rb;
|
| A D | tnc.c | 79 struct rb_node **p, *parent = NULL; in insert_old_idx()
87 p = &c->old_idx.rb_node; in insert_old_idx()
|