Home
last modified time | relevance | path

Searched refs:rb_root (Results 1 – 16 of 16) sorted by relevance

/openbmc/u-boot/include/linux/
H A Drbtree.h31 struct rb_root { struct
38 #define RB_ROOT (struct rb_root) { NULL, } argument
50 extern void rb_insert_color(struct rb_node *, struct rb_root *);
51 extern void rb_erase(struct rb_node *, struct rb_root *);
57 extern struct rb_node *rb_first(const struct rb_root *);
58 extern struct rb_node *rb_last(const struct rb_root *);
61 extern struct rb_node *rb_first_postorder(const struct rb_root *);
66 struct rb_root *root);
H A Drbtree_augmented.h31 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
34 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented()
99 struct rb_node *parent, struct rb_root *root) in __rb_change_child()
110 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
114 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented()
211 rb_erase_augmented(struct rb_node *node, struct rb_root *root, in rb_erase_augmented()
/openbmc/u-boot/drivers/mtd/ubi/
H A Dwl.h4 static int anchor_pebs_avalible(struct rb_root *root);
10 static struct ubi_wl_entry *find_anchor_wl_entry(struct rb_root *root);
23 struct rb_root *root);
30 struct rb_root *root) { in may_reserve_for_fm()
H A Dubi.h559 struct rb_root ltree;
577 struct rb_root used;
578 struct rb_root erroneous;
579 struct rb_root free;
581 struct rb_root scrub;
691 struct rb_root root;
725 struct rb_root volumes;
H A Dfastmap-wl.c33 static struct ubi_wl_entry *find_anchor_wl_entry(struct rb_root *root) in find_anchor_wl_entry()
67 static int anchor_pebs_avalible(struct rb_root *root) in anchor_pebs_avalible()
388 struct rb_root *root) { in may_reserve_for_fm()
H A Dwl.c132 struct ubi_wl_entry *e, struct rb_root *root);
144 static void wl_tree_add(struct ubi_wl_entry *e, struct rb_root *root) in wl_tree_add()
241 static int in_wl_tree(struct ubi_wl_entry *e, struct rb_root *root) in in_wl_tree()
303 struct rb_root *root, int diff) in find_wl_entry()
346 struct rb_root *root) in find_mean_wl_entry()
1411 static void tree_destroy(struct ubi_device *ubi, struct rb_root *root)
1749 struct ubi_wl_entry *e, struct rb_root *root)
/openbmc/u-boot/lib/
H A Drbtree.c54 struct rb_root *root, int color) in __rb_rotate_set_parents()
63 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
192 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color()
354 void __rb_erase_color(struct rb_node *parent, struct rb_root *root, in __rb_erase_color()
376 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
382 void rb_erase(struct rb_node *node, struct rb_root *root) in rb_erase()
398 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, in __rb_insert_augmented()
408 struct rb_node *rb_first(const struct rb_root *root) in rb_first()
421 struct rb_node *rb_last(const struct rb_root *root) in rb_last()
496 struct rb_root *root) in rb_replace_node()
[all …]
/openbmc/qemu/include/qemu/
H A Dinterval-tree.h30 RBRoot rb_root; member
53 return root->rb_root.rb_node == NULL; in interval_tree_is_empty()
/openbmc/u-boot/fs/btrfs/
H A Dbtrfs.h21 struct rb_root chunks_root;
/openbmc/qemu/tests/unit/
H A Dtest-interval-tree.c33 g_assert(root.rb_root.rb_node == NULL); in test_empty()
56 g_assert(root.rb_root.rb_node == NULL); in test_find_one_point()
/openbmc/qemu/util/
H A Dinterval-tree.c345 rb_insert_augmented(node, &root->rb_root, augment); in rb_insert_augmented_cached()
639 rb_erase_augmented(node, &root->rb_root, augment); in rb_erase_augmented_cached()
713 RBNode **link = &root->rb_root.rb_node, *rb_parent = NULL; in interval_tree_insert()
800 if (!root || !root->rb_root.rb_node) { in interval_tree_iter_first()
817 node = rb_to_itree(root->rb_root.rb_node); in interval_tree_iter_first()
H A Dselfmap.c106 free_rbnode(root->rb_root.rb_node); in free_self_maps()
/openbmc/u-boot/fs/ubifs/
H A Dorphan.c733 struct rb_root root;
758 static int dbg_ins_check_orphan(struct rb_root *root, ino_t inum) in dbg_ins_check_orphan()
786 static int dbg_find_check_orphan(struct rb_root *root, ino_t inum) in dbg_find_check_orphan()
804 static void dbg_free_check_tree(struct rb_root *root) in dbg_free_check_tree()
H A Dlog.c543 static int done_already(struct rb_root *done_tree, int lnum) in done_already()
575 static void destroy_done_tree(struct rb_root *done_tree) in destroy_done_tree()
628 struct rb_root done_tree = RB_ROOT; in ubifs_consolidate_log()
H A Dubifs.h142 struct rb_root i_mmap; /* tree of private and shared mappings */
1855 struct rb_root buds;
1890 struct rb_root old_idx;
1963 struct rb_root orph_tree;
2060 struct rb_root size_tree;
H A Ddebug.c717 for (rb = rb_first((struct rb_root *)&c->buds); rb; rb = rb_next(rb)) { in ubifs_dump_lprop()
1825 struct rb_root inodes;