Home
last modified time | relevance | path

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

12

/include/linux/
Drbtree.h31 struct rb_root { struct
37 #define RB_ROOT (struct rb_root) { NULL, } argument
49 extern void rb_insert_color(struct rb_node *, struct rb_root *);
50 extern void rb_erase(struct rb_node *, struct rb_root *);
56 extern struct rb_node *rb_first(const struct rb_root *);
57 extern struct rb_node *rb_last(const struct rb_root *);
60 extern struct rb_node *rb_first_postorder(const struct rb_root *);
65 struct rb_root *root);
67 struct rb_root *root);
126 struct rb_root rb_root; member
[all …]
Dtimerqueue.h15 struct rb_root_cached rb_root; member
36 struct rb_node *leftmost = rb_first_cached(&head->rb_root); in timerqueue_getnext()
58 head->rb_root = RB_ROOT_CACHED; in timerqueue_init_head()
Drbtree_augmented.h33 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
47 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented()
60 rb_insert_augmented(node, &root->rb_root, augment); in rb_insert_augmented_cached()
170 struct rb_node *parent, struct rb_root *root) in __rb_change_child()
183 struct rb_node *parent, struct rb_root *root) in __rb_change_child_rcu()
194 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
198 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented()
302 rb_erase_augmented(struct rb_node *node, struct rb_root *root, in rb_erase_augmented()
316 rb_erase_augmented(node, &root->rb_root, augment); in rb_erase_augmented_cached()
Dinterval_tree_generic.h41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \
124 if (!root->rb_root.rb_node) \
140 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
Delevator.h170 extern void elv_rb_add(struct rb_root *, struct request *);
171 extern void elv_rb_del(struct rb_root *, struct request *);
172 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()
Dpktcdvd.h184 struct rb_root bio_queue; /* Work queue of bios we need to handle */
Dnfs_fs_sb.h216 struct rb_root state_owners;
Dbacking-dev-defs.h214 struct rb_root cgwb_congested_tree; /* their congested states */
Drmap.h55 struct rb_root_cached rb_root; member
Dmempolicy.h126 struct rb_root root;
Dsysctl.h166 struct rb_root root;
/include/net/netns/
Dnexthop.h12 struct rb_root rb_root; /* tree of nexthops by id */ member
/include/drm/
Ddrm_prime.h48 struct rb_root dmabufs;
49 struct rb_root handles;
Ddrm_vma_manager.h55 struct rb_root vm_files;
/include/linux/ceph/
Dosdmap.h171 struct rb_root pg_temp;
172 struct rb_root primary_temp;
175 struct rb_root pg_upmap; /* PG := raw set */
176 struct rb_root pg_upmap_items; /* from -> to within raw set */
180 struct rb_root pg_pools;
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;
299 struct rb_root backoffs;
345 struct rb_root osds; /* osds */
352 struct rb_root linger_requests; /* lingering requests */
353 struct rb_root map_checks;
354 struct rb_root linger_map_checks;
Dlibceph.h191 static void insert_##name(struct rb_root *root, type *t) \
215 static void erase_##name(struct rb_root *root, type *t) \
228 static type *lookup_##name(struct rb_root *root, lookup_param_type key) \
Dmon_client.h91 struct rb_root generic_request_tree;
/include/net/
Dinetpeer.h62 struct rb_root rb_root; member
Dinet_frag.h86 struct rb_root rb_fragments;
136 unsigned int inet_frag_rbtree_purge(struct rb_root *root);
Dgarp.h107 struct rb_root gid;
Dmrp.h121 struct rb_root mad;
/include/xen/arm/
Dpage.h44 extern struct rb_root phys_to_mach;
/include/linux/crush/
Dcrush.h305 struct rb_root choose_args;

12