| /openbmc/u-boot/include/linux/ |
| H 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
36 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))
41 #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
50 extern void rb_insert_color(struct rb_node *, struct rb_root *);
51 extern void rb_erase(struct rb_node *, struct rb_root *);
55 extern struct rb_node *rb_next(const struct rb_node *);
56 extern struct rb_node *rb_prev(const struct rb_node *);
[all …]
|
| H 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);
31 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
32 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
34 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented()
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) \
77 #define __rb_parent(pc) ((struct rb_node *)(pc & ~3))
[all …]
|
| /openbmc/u-boot/lib/ |
| H A D | rbtree.c | 37 static inline void rb_set_black(struct rb_node *rb) in rb_set_black()
42 static inline struct rb_node *rb_red_parent(struct rb_node *red) in rb_red_parent()
44 return (struct rb_node *)red->__rb_parent_color; in rb_red_parent()
53 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, in __rb_rotate_set_parents()
56 struct rb_node *parent = rb_parent(old); in __rb_rotate_set_parents()
63 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
64 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in __rb_insert()
66 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
192 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color()
193 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in ____rb_erase_color()
[all …]
|
| /openbmc/u-boot/fs/btrfs/ |
| H A D | chunk-map.c | 12 struct rb_node node;
22 struct rb_node **new = &(btrfs_info.chunks_root.rb_node), *prnt = NULL; in add_chunk_mapping()
72 struct rb_node *node = btrfs_info.chunks_root.rb_node; in btrfs_map_logical_to_physical()
95 struct rb_node *now, *next; in btrfs_chunk_map_exit()
|
| /openbmc/u-boot/drivers/mtd/ubi/ |
| H 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()
|
| H A D | wl.c | 146 struct rb_node **p, *parent = NULL; in wl_tree_add()
148 p = &root->rb_node; in wl_tree_add()
243 struct rb_node *p; in in_wl_tree()
245 p = root->rb_node; in in_wl_tree()
305 struct rb_node *p; in find_wl_entry()
312 p = root->rb_node; in find_wl_entry()
354 e = rb_entry(root->rb_node, struct ubi_wl_entry, u.rb); in find_mean_wl_entry()
694 if (!ubi->free.rb_node ||
695 (!ubi->used.rb_node && !ubi->scrub.rb_node)) {
707 !ubi->free.rb_node, !ubi->used.rb_node);
[all …]
|
| H A D | attach.c | 258 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL; in add_volume()
451 struct rb_node **p, *parent = NULL; in ubi_add_to_av()
471 p = &av->root.rb_node; in ubi_add_to_av()
604 struct rb_node *p = ai->volumes.rb_node; in ubi_find_av()
628 struct rb_node *rb; in ubi_remove_av()
1135 struct rb_node *this = av->root.rb_node; in destroy_av()
1166 struct rb_node *rb; in destroy_ai()
1186 rb = ai->volumes.rb_node; in destroy_ai()
1226 struct rb_node *rb1, *rb2; in scan_all()
1502 struct rb_node *rb1, *rb2; in self_check_ai()
|
| H A D | fastmap.c | 188 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL; in add_vol()
237 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL; in assign_aeb_to_av()
239 p = &av->root.rb_node; in assign_aeb_to_av()
276 struct rb_node **p = &av->root.rb_node, *parent = NULL; in update_vol()
373 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL; in process_pool_aeb()
422 struct rb_node *node, *node2; in unmap_peb()
579 struct rb_node *rb1, *rb2; in count_fastmap_pebs()
1116 struct rb_node *tmp_rb; in ubi_write_fastmap()
|
| H A D | ubi.h | 174 struct rb_node rb;
196 struct rb_node rb;
655 struct rb_node rb;
690 struct rb_node rb;
|
| H A D | eba.c | 91 struct rb_node *p; in ltree_lookup()
93 p = ubi->ltree.rb_node; in ltree_lookup()
152 struct rb_node **p, *parent = NULL; in ltree_add_entry()
160 p = &ubi->ltree.rb_node; in ltree_add_entry()
1298 struct rb_node *rb; in self_check_eba()
1390 struct rb_node *rb; in ubi_eba_init()
|
| H A D | vtbl.c | 373 struct rb_node *rb;
|
| /openbmc/qemu/include/qemu/ |
| H A D | interval-tree.h | 26 RBNode *rb_node; member
53 return root->rb_root.rb_node == NULL; in interval_tree_is_empty()
|
| /openbmc/u-boot/fs/ubifs/ |
| H A D | log.c | 35 struct rb_node *p; in ubifs_search_bud()
39 p = c->buds.rb_node; in ubifs_search_bud()
64 struct rb_node *p; in ubifs_get_wbuf()
72 p = c->buds.rb_node; in ubifs_get_wbuf()
117 struct rb_node **p, *parent = NULL; in ubifs_add_bud()
122 p = &c->buds.rb_node; in ubifs_add_bud()
293 struct rb_node *p; in remove_buds()
300 struct rb_node *p1 = p; in remove_buds()
531 struct rb_node rb;
545 struct rb_node **p = &done_tree->rb_node, *parent = NULL; in done_already()
|
| H A D | orphan.c | 57 struct rb_node **p, *parent = NULL; in ubifs_add_orphan()
71 p = &c->orph_tree.rb_node; in ubifs_add_orphan()
107 struct rb_node *p; in ubifs_delete_orphan()
110 p = c->orph_tree.rb_node; in ubifs_delete_orphan()
504 struct rb_node **p, *parent = NULL; in insert_dead_orphan()
511 p = &c->orph_tree.rb_node; in insert_dead_orphan()
723 struct rb_node rb;
739 struct rb_node *p; in dbg_find_orphan()
742 p = c->orph_tree.rb_node; in dbg_find_orphan()
761 struct rb_node **p, *parent = NULL; in dbg_ins_check_orphan()
[all …]
|
| H A D | recovery.c | 1245 struct rb_node rb;
1264 struct rb_node **p = &c->size_tree.rb_node, *parent = NULL; in add_ino()
1298 struct rb_node *p = c->size_tree.rb_node; in find_ino()
1482 struct rb_node *this = rb_first(&c->size_tree); in ubifs_recover_size()
|
| H A D | debug.c | 582 struct rb_node *rb; in ubifs_dump_budg()
655 struct rb_node *rb; in ubifs_dump_lprop()
1804 struct rb_node rb;
1842 struct rb_node **p, *parent = NULL; in add_inode()
1848 p = &fsckd->inodes.rb_node; in add_inode()
1924 struct rb_node *p; in search_inode()
1927 p = fsckd->inodes.rb_node; in search_inode()
2195 struct rb_node *this = rb_first(&fsckd->inodes); in check_inodes()
|
| H A D | ubifs.h | 875 struct rb_node rb;
1315 struct rb_node rb;
1519 struct rb_node rb;
|
| H A D | tnc.c | 74 struct rb_node **p, *parent = NULL; in insert_old_idx()
82 p = &c->old_idx.rb_node; in insert_old_idx()
|
| /openbmc/qemu/tests/unit/ |
| H A D | test-interval-tree.c | 33 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 D | selfmap.c | 106 free_rbnode(root->rb_root.rb_node); in free_self_maps()
|
| H A D | interval-tree.c | 182 qatomic_set(&root->rb_node, new); in rb_change_child()
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()
|