Home
last modified time | relevance | path

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

123456

/linux-4.19.296/include/linux/
Drbtree.h43 struct rb_root { struct
58 struct rb_root rb_root; member
64 #define RB_ROOT (struct rb_root) { NULL, }
77 extern void rb_insert_color(struct rb_node *, struct rb_root *);
78 extern void rb_erase(struct rb_node *, struct rb_root *);
84 extern struct rb_node *rb_first(const struct rb_root *);
85 extern struct rb_node *rb_last(const struct rb_root *);
94 extern struct rb_node *rb_first_postorder(const struct rb_root *);
99 struct rb_root *root);
101 struct rb_root *root);
Drbtree_augmented.h46 struct rb_root *root,
60 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented()
71 __rb_insert_augmented(node, &root->rb_root, in rb_insert_augmented_cached()
136 struct rb_node *parent, struct rb_root *root) in __rb_change_child()
149 struct rb_node *parent, struct rb_root *root) in __rb_change_child_rcu()
160 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
164 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented()
272 rb_erase_augmented(struct rb_node *node, struct rb_root *root, in rb_erase_augmented()
285 struct rb_node *rebalance = __rb_erase_augmented(node, &root->rb_root, in rb_erase_augmented_cached()
289 __rb_erase_color(rebalance, &root->rb_root, augment->rotate); in rb_erase_augmented_cached()
Dtimerqueue.h15 struct rb_root_cached rb_root; member
36 struct rb_node *leftmost = rb_first_cached(&head->rb_root); in timerqueue_getnext()
48 head->rb_root = RB_ROOT_CACHED; in timerqueue_init_head()
Dinterval_tree_generic.h71 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \
154 if (!root->rb_root.rb_node) \
170 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
Delevator.h235 extern void elv_rb_add(struct rb_root *, struct request *);
236 extern void elv_rb_del(struct rb_root *, struct request *);
237 extern struct request *elv_rb_find(struct rb_root *, sector_t);
Drbtree_latch.h46 struct rb_root tree[2];
79 struct rb_root *root = &ltr->tree[idx]; in __lt_insert()
/linux-4.19.296/lib/
Dtimerqueue.c42 struct rb_node **p = &head->rb_root.rb_root.rb_node; in timerqueue_add()
61 rb_insert_color_cached(&node->node, &head->rb_root, leftmost); in timerqueue_add()
80 rb_erase_cached(&node->node, &head->rb_root); in timerqueue_del()
83 return !RB_EMPTY_ROOT(&head->rb_root.rb_root); in timerqueue_del()
Drbtree.c88 struct rb_root *root, int color) in __rb_rotate_set_parents()
97 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
243 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color()
426 void __rb_erase_color(struct rb_node *parent, struct rb_root *root, in __rb_erase_color()
450 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
456 void rb_erase(struct rb_node *node, struct rb_root *root) in rb_erase()
469 __rb_insert(node, &root->rb_root, leftmost, in rb_insert_color_cached()
477 rebalance = __rb_erase_augmented(node, &root->rb_root, in rb_erase_cached()
480 ____rb_erase_color(rebalance, &root->rb_root, dummy_rotate); in rb_erase_cached()
491 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, in __rb_insert_augmented()
[all …]
Drbtree_test.c33 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert()
45 rb_insert_color(&node->rb, &root->rb_root); in insert()
50 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert_cached()
70 rb_erase(&node->rb, &root->rb_root); in erase()
103 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS()
121 rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks); in RB_DECLARE_CALLBACKS()
127 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in insert_augmented_cached()
155 rb_erase_augmented(&node->rb, &root->rb_root, &augment_callbacks); in erase_augmented()
190 rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb) in check_postorder_foreach()
200 for (rb = rb_first_postorder(&root.rb_root); rb; rb = rb_next_postorder(rb)) in check_postorder()
[all …]
/linux-4.19.296/block/
Dbfq-iosched.h54 struct rb_root active;
56 struct rb_root idle;
164 struct rb_root *tree;
251 struct rb_root *pos_root;
254 struct rb_root sort_list;
453 struct rb_root queue_weights_tree;
870 struct rb_root rq_pos_tree;
882 struct rb_root rq_pos_tree;
900 struct rb_root *root);
903 struct rb_root *root);
/linux-4.19.296/include/linux/ceph/
Dosd_client.h39 struct rb_root o_requests;
40 struct rb_root o_linger_requests;
41 struct rb_root o_backoff_mappings;
42 struct rb_root o_backoffs_by_id;
292 struct rb_root backoffs;
338 struct rb_root osds; /* osds */
345 struct rb_root linger_requests; /* lingering requests */
346 struct rb_root map_checks;
347 struct rb_root linger_map_checks;
Dosdmap.h172 struct rb_root pg_temp;
173 struct rb_root primary_temp;
176 struct rb_root pg_upmap; /* PG := raw set */
177 struct rb_root pg_upmap_items; /* from -> to within raw set */
181 struct rb_root pg_pools;
Dlibceph.h188 static void insert_##name(struct rb_root *root, type *t) \
212 static void erase_##name(struct rb_root *root, type *t) \
225 static type *lookup_##name(struct rb_root *root, lookup_param_type key) \
/linux-4.19.296/fs/nfs/blocklayout/
Dextent_tree.c19 ext_tree_first(struct rb_root *root) in ext_tree_first()
46 __ext_tree_search(struct rb_root *root, sector_t start) in __ext_tree_search()
95 ext_try_to_merge_left(struct rb_root *root, struct pnfs_block_extent *be) in ext_try_to_merge_left()
111 ext_try_to_merge_right(struct rb_root *root, struct pnfs_block_extent *be) in ext_try_to_merge_right()
136 __ext_tree_insert(struct rb_root *root, in __ext_tree_insert()
177 __ext_tree_remove(struct rb_root *root, in __ext_tree_remove()
258 struct rb_root *root; in ext_tree_insert()
322 __ext_tree_lookup(struct rb_root *root, sector_t isect, in __ext_tree_lookup()
380 ext_tree_split(struct rb_root *root, struct pnfs_block_extent *be, in ext_tree_split()
408 struct rb_root *root = &bl->bl_ext_rw; in ext_tree_mark_written()
[all …]
Dblocklayout.h139 struct rb_root bl_ext_rw;
140 struct rb_root bl_ext_ro;
/linux-4.19.296/fs/nfsd/
Dnetns.h71 struct rb_root conf_name_tree;
73 struct rb_root unconf_name_tree;
/linux-4.19.296/fs/btrfs/
Ddelayed-ref.h82 struct rb_root ref_tree;
151 struct rb_root href_root;
154 struct rb_root dirty_extent_root;
Ddelayed-inode.h53 struct rb_root ins_root;
54 struct rb_root del_root;
/linux-4.19.296/include/drm/
Ddrm_prime.h49 struct rb_root dmabufs;
50 struct rb_root handles;
/linux-4.19.296/fs/jffs2/
Dnodelist.h242 struct rb_root tn_root;
327 static inline struct jffs2_node_frag *frag_first(struct rb_root *root) in frag_first()
337 static inline struct jffs2_node_frag *frag_last(struct rb_root *root) in frag_last()
371 struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset);
372 void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c_delete);
374 uint32_t jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size);
Djffs2_fs_i.h33 struct rb_root fragtree;
/linux-4.19.296/include/net/
Dinet_frag.h81 struct rb_root rb_fragments; /* Used in IPv4/IPv6. */
120 unsigned int inet_frag_rbtree_purge(struct rb_root *root);
Dinetpeer.h62 struct rb_root rb_root; member
/linux-4.19.296/fs/ceph/
Dmds_client.h340 struct rb_root snap_realms;
347 struct rb_root request_tree; /* pending mds requests */
388 struct rb_root pool_perm_tree;
/linux-4.19.296/drivers/dma-buf/
Dsync_debug.h41 struct rb_root pt_tree;

123456