Home
last modified time | relevance | path

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

/u-boot/include/linux/
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);
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()
/u-boot/fs/btrfs/common/
A Drbtree-utils.h33 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,
41 void rb_free_nodes(struct rb_root *root, rb_free_node free_node);
44 static void free_##name##_tree(struct rb_root *root) \
A Drbtree-utils.c22 int rb_insert(struct rb_root *root, struct rb_node *node, in rb_insert()
46 struct rb_node *rb_search(struct rb_root *root, void *key, rb_compare_keys comp, in rb_search()
75 void rb_free_nodes(struct rb_root *root, rb_free_node free_node) in rb_free_nodes()
/u-boot/drivers/mtd/ubi/
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()
A Dubi.h563 struct rb_root ltree;
581 struct rb_root used;
582 struct rb_root erroneous;
583 struct rb_root free;
585 struct rb_root scrub;
695 struct rb_root root;
729 struct rb_root volumes;
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()
A Dwl.c134 struct ubi_wl_entry *e, struct rb_root *root);
146 static void wl_tree_add(struct ubi_wl_entry *e, struct rb_root *root) in wl_tree_add()
243 static int in_wl_tree(struct ubi_wl_entry *e, struct rb_root *root) in in_wl_tree()
305 struct rb_root *root, int diff) in find_wl_entry()
348 struct rb_root *root) in find_mean_wl_entry()
1413 static void tree_destroy(struct ubi_device *ubi, struct rb_root *root)
1751 struct ubi_wl_entry *e, struct rb_root *root)
/u-boot/lib/
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 …]
/u-boot/fs/btrfs/
A Dextent-cache.h15 struct rb_root root;
A Dctree.h109 struct rb_root fs_root_tree;
/u-boot/fs/ubifs/
A Dorphan.c735 struct rb_root root;
760 static int dbg_ins_check_orphan(struct rb_root *root, ino_t inum) in dbg_ins_check_orphan()
788 static int dbg_find_check_orphan(struct rb_root *root, ino_t inum) in dbg_find_check_orphan()
806 static void dbg_free_check_tree(struct rb_root *root) in dbg_free_check_tree()
A Dlog.c545 static int done_already(struct rb_root *done_tree, int lnum) in done_already()
577 static void destroy_done_tree(struct rb_root *done_tree) in destroy_done_tree()
630 struct rb_root done_tree = RB_ROOT; in ubifs_consolidate_log()
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;
A Ddebug.c719 for (rb = rb_first((struct rb_root *)&c->buds); rb; rb = rb_next(rb)) { in ubifs_dump_lprop()
1827 struct rb_root inodes;

Completed in 41 milliseconds