Searched refs:rb_node (Results 1 - 25 of 466) sorted by relevance

1234567891011>>

/linux-master/include/linux/
H A Drbtree_types.h5 struct rb_node { struct
7 struct rb_node *rb_right;
8 struct rb_node *rb_left;
13 struct rb_node *rb_node; member in struct:rb_root
28 struct rb_node *rb_leftmost;
H A Drbtree.h26 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))
30 #define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL)
39 extern void rb_insert_color(struct rb_node *, struct rb_root *);
40 extern void rb_erase(struct rb_node *, struct rb_root *);
44 extern struct rb_node *rb_next(const struct rb_node *);
45 extern struct rb_node *rb_prev(const struct rb_node *);
46 extern struct rb_node *rb_first(const struct rb_root *);
47 extern struct rb_node *rb_las
[all...]
H A Drbtree_augmented.h28 void (*propagate)(struct rb_node *node, struct rb_node *stop);
29 void (*copy)(struct rb_node *old, struct rb_node *new);
30 void (*rotate)(struct rb_node *old, struct rb_node *new);
33 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
34 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
47 rb_insert_augmented(struct rb_node *nod
[all...]
H A Dtimerqueue_types.h9 struct rb_node node;
H A Drbtree_latch.h41 struct rb_node node[2];
70 __lt_from_rb(struct rb_node *node, int idx)
80 struct rb_node **link = &root->rb_node;
81 struct rb_node *node = &ltn->node[idx];
82 struct rb_node *parent = NULL;
109 struct rb_node *node = rcu_dereference_raw(ltr->tree[idx].rb_node);
/linux-master/tools/include/linux/
H A Drbtree.h23 struct rb_node { struct
25 struct rb_node *rb_right;
26 struct rb_node *rb_left;
31 struct rb_node *rb_node; member in struct:rb_root
34 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))
39 #define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL)
48 extern void rb_insert_color(struct rb_node *, struct rb_root *);
49 extern void rb_erase(struct rb_node *, struct rb_root *);
53 extern struct rb_node *rb_nex
[all...]
H A Drbtree_augmented.h30 void (*propagate)(struct rb_node *node, struct rb_node *stop);
31 void (*copy)(struct rb_node *old, struct rb_node *new);
32 void (*rotate)(struct rb_node *old, struct rb_node *new);
35 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
36 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
49 rb_insert_augmented(struct rb_node *nod
[all...]
/linux-master/tools/perf/util/
H A Dintlist.c13 static struct rb_node *intlist__node_new(struct rblist *rblist __maybe_unused,
17 struct rb_node *rc = NULL;
23 rc = &node->rb_node;
35 struct rb_node *rb_node)
37 struct int_node *node = container_of(rb_node, struct int_node, rb_node);
42 static int intlist__node_cmp(struct rb_node *rb_node, const void *entry) argument
45 struct int_node *node = container_of(rb_node, struc
34 intlist__node_delete(struct rblist *rblist __maybe_unused, struct rb_node *rb_node) argument
69 struct rb_node *rb_node; local
143 struct rb_node *rb_node; local
[all...]
H A Drblist.h11 * struct rb_node rb_node;
26 int (*node_cmp)(struct rb_node *rbn, const void *entry);
27 struct rb_node *(*node_new)(struct rblist *rlist, const void *new_entry);
28 void (*node_delete)(struct rblist *rblist, struct rb_node *rb_node);
35 void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node);
36 struct rb_node *rblist__find(struct rblist *rblist, const void *entry);
37 struct rb_node *rblist__findne
[all...]
H A Drblist.c15 struct rb_node **p = &rblist->entries.rb_root.rb_node;
16 struct rb_node *parent = NULL, *new_node;
46 void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node) argument
48 rb_erase_cached(rb_node, &rblist->entries);
50 rblist->node_delete(rblist, rb_node);
53 static struct rb_node *__rblist__findnew(struct rblist *rblist,
57 struct rb_node **p = &rblist->entries.rb_root.rb_node;
[all...]
H A Drb_resort.h26 entry->thread = rb_entry(nd, struct thread, rb_node);
37 struct rb_node *nd;
57 struct rb_node rb_node; \
60 static void __name##_sorted__init_entry(struct rb_node *nd, \
63 static int __name##_sorted__cmp(struct rb_node *nda, struct rb_node *ndb) \
66 a = rb_entry(nda, struct __name##_sorted_entry, rb_node); \
67 b = rb_entry(ndb, struct __name##_sorted_entry, rb_node); \
77 struct rb_node *sorted_n
[all...]
H A Dintlist.h11 struct rb_node rb_node; member in struct:int_node
48 struct rb_node *rn = rb_first_cached(&ilist->rblist.entries);
49 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
53 struct rb_node *rn;
56 rn = rb_next(&in->rb_node);
57 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
H A Dstrlist.c15 struct rb_node *strlist__node_new(struct rblist *rblist, const void *entry)
18 struct rb_node *rc = NULL;
29 rc = &snode->rb_node;
47 void strlist__node_delete(struct rblist *rblist, struct rb_node *rb_node) argument
50 struct str_node *snode = container_of(rb_node, struct str_node, rb_node);
55 static int strlist__node_cmp(struct rb_node *rb_node, const void *entry) argument
58 struct str_node *snode = container_of(rb_node, struc
103 struct rb_node *rb_node = rblist__find(&slist->rblist, entry); local
201 struct rb_node *rb_node; local
[all...]
H A Dstrlist.h11 struct rb_node rb_node; member in struct:str_node
60 struct rb_node *rn = rb_first_cached(&slist->rblist.entries);
61 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL;
65 struct rb_node *rn;
68 rn = rb_next(&sn->rb_node);
69 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL;
H A Dcomm.c14 struct rb_node rb_node; member in struct:comm_str
34 rb_erase(&cs->rb_node, &comm_str_root);
63 struct rb_node **p = &root->rb_node;
64 struct rb_node *parent = NULL;
70 iter = rb_entry(parent, struct comm_str, rb_node);
91 rb_link_node(&new->rb_node, parent, p);
92 rb_insert_color(&new->rb_node, root);
H A Dmem2node.c12 struct rb_node rb_node; member in struct:phys_entry
20 struct rb_node **p = &root->rb_node;
21 struct rb_node *parent = NULL;
26 e = rb_entry(parent, struct phys_entry, rb_node);
34 rb_link_node(&entry->rb_node, parent, p);
35 rb_insert_color(&entry->rb_node, root);
44 RB_CLEAR_NODE(&entry->rb_node);
121 struct rb_node **
[all...]
H A Dbpf-event.h22 struct rb_node rb_node; member in struct:bpf_prog_info_node
26 struct rb_node rb_node; member in struct:btf_node
H A Dcall-path.c22 RB_CLEAR_NODE(&cp->rb_node);
81 struct rb_node **p;
82 struct rb_node *node_parent = NULL;
92 p = &parent->children.rb_node;
95 cp = rb_entry(node_parent, struct call_path, rb_node);
110 rb_link_node(&cp->rb_node, node_parent, p);
111 rb_insert_color(&cp->rb_node, &parent->children);
/linux-master/fs/btrfs/
H A Dmisc.h65 struct rb_node rb_node; member in struct:rb_simple_node
69 static inline struct rb_node *rb_simple_search(struct rb_root *root, u64 bytenr)
71 struct rb_node *node = root->rb_node;
75 entry = rb_entry(node, struct rb_simple_node, rb_node);
93 * Return the rb_node that start at or after @bytenr. If there is no entry at
96 static inline struct rb_node *rb_simple_search_first(struct rb_root *root,
99 struct rb_node *node = root->rb_node, *re
[all...]
/linux-master/lib/
H A Drbtree.c59 static inline void rb_set_black(struct rb_node *rb)
64 static inline struct rb_node *rb_red_parent(struct rb_node *red)
66 return (struct rb_node *)red->__rb_parent_color;
75 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new,
78 struct rb_node *parent = rb_parent(old);
85 __rb_insert(struct rb_node *node, struct rb_root *root,
86 void (*augment_rotate)(struct rb_node *old, struct rb_node *ne
[all...]
/linux-master/tools/lib/
H A Drbtree.c59 static inline void rb_set_black(struct rb_node *rb)
64 static inline struct rb_node *rb_red_parent(struct rb_node *red)
66 return (struct rb_node *)red->__rb_parent_color;
75 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new,
78 struct rb_node *parent = rb_parent(old);
85 __rb_insert(struct rb_node *node, struct rb_root *root,
86 void (*augment_rotate)(struct rb_node *old, struct rb_node *ne
[all...]
/linux-master/net/bridge/
H A Dbr_private_mcast_eht.h18 struct rb_node rb_node; member in struct:net_bridge_group_eht_host
29 struct rb_node rb_node; member in struct:net_bridge_group_eht_set_entry
42 struct rb_node rb_node; member in struct:net_bridge_group_eht_set
/linux-master/arch/powerpc/kernel/
H A Deeh_cache.c41 struct rb_node rb_node; member in struct:pci_io_addr_range
56 struct rb_node *n = pci_io_addr_cache_root.rb_root.rb_node;
60 piar = rb_entry(n, struct pci_io_addr_range, rb_node);
100 struct rb_node *n;
106 piar = rb_entry(n, struct pci_io_addr_range, rb_node);
121 struct rb_node **p = &pci_io_addr_cache_root.rb_root.rb_node;
122 struct rb_node *paren
[all...]
/linux-master/tools/perf/tests/
H A Dhists_output.c100 struct rb_node *node;
112 he = rb_entry(node, struct hist_entry, rb_node);
144 struct rb_node *node;
180 he = rb_entry(node, struct hist_entry, rb_node);
186 he = rb_entry(node, struct hist_entry, rb_node);
192 he = rb_entry(node, struct hist_entry, rb_node);
198 he = rb_entry(node, struct hist_entry, rb_node);
204 he = rb_entry(node, struct hist_entry, rb_node);
210 he = rb_entry(node, struct hist_entry, rb_node);
216 he = rb_entry(node, struct hist_entry, rb_node);
[all...]
/linux-master/drivers/gpu/drm/i915/
H A Di915_priolist_types.h43 struct rb_node node;

Completed in 194 milliseconds

1234567891011>>