| /linux-4.1.27/include/linux/ |
| D | rbtree.h | 35 struct rb_node { struct
37 struct rb_node *rb_right; argument
38 struct rb_node *rb_left; argument
43 struct rb_node *rb_node; member
47 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))
52 #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
61 extern void rb_insert_color(struct rb_node *, struct rb_root *);
62 extern void rb_erase(struct rb_node *, struct rb_root *);
66 extern struct rb_node *rb_next(const struct rb_node *);
67 extern struct rb_node *rb_prev(const struct rb_node *);
[all …]
|
| D | rbtree_augmented.h | 39 void (*propagate)(struct rb_node *node, struct rb_node *stop);
40 void (*copy)(struct rb_node *old, struct rb_node *new);
41 void (*rotate)(struct rb_node *old, struct rb_node *new);
44 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
45 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
57 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented()
66 rbname ## _propagate(struct rb_node *rb, struct rb_node *stop) \
78 rbname ## _copy(struct rb_node *rb_old, struct rb_node *rb_new) \
85 rbname ## _rotate(struct rb_node *rb_old, struct rb_node *rb_new) \
100 #define __rb_parent(pc) ((struct rb_node *)(pc & ~3))
[all …]
|
| D | interval_tree_generic.h | 70 struct rb_node **link = &root->rb_node, *rb_parent = NULL; \
147 if (!root->rb_node) \
149 node = rb_entry(root->rb_node, ITSTRUCT, ITRB); \
158 struct rb_node *rb = node->ITRB.rb_right, *prev; \
|
| D | iova.h | 21 struct rb_node node;
30 struct rb_node *cached32_node; /* Save last alloced node */
|
| D | mm_types.h | 228 struct rb_node vm_rb; /* link in global region tree */
257 struct rb_node vm_rb;
278 struct rb_node rb;
|
| D | pktcdvd.h | 144 struct rb_node rb_node; member
|
| D | interval_tree.h | 7 struct rb_node rb;
|
| D | vmalloc.h | 46 struct rb_node rb_node; /* address sorted rbtree */ member
|
| D | timerqueue.h | 9 struct rb_node node;
|
| D | rtmutex.h | 32 struct rb_node *waiters_leftmost;
|
| /linux-4.1.27/lib/ |
| D | rbtree.c | 47 static inline void rb_set_black(struct rb_node *rb) in rb_set_black()
52 static inline struct rb_node *rb_red_parent(struct rb_node *red) in rb_red_parent()
54 return (struct rb_node *)red->__rb_parent_color; in rb_red_parent()
63 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, in __rb_rotate_set_parents()
66 struct rb_node *parent = rb_parent(old); in __rb_rotate_set_parents()
73 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
74 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in __rb_insert()
76 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
202 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color()
203 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in ____rb_erase_color()
[all …]
|
| D | timerqueue.c | 41 struct rb_node **p = &head->head.rb_node; in timerqueue_add()
42 struct rb_node *parent = NULL; in timerqueue_add()
78 struct rb_node *rbn = rb_next(&node->node); in timerqueue_del()
99 struct rb_node *next; in timerqueue_iterate_next()
|
| D | rbtree_test.c | 12 struct rb_node rb;
26 struct rb_node **new = &root->rb_node, *parent = NULL; in insert()
69 struct rb_node **new = &root->rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS()
104 static bool is_red(struct rb_node *rb) in is_red()
109 static int black_path_count(struct rb_node *rb) in black_path_count()
129 struct rb_node *rb; in check_postorder()
139 struct rb_node *rb; in check()
166 struct rb_node *rb; in check_augmented()
|
| /linux-4.1.27/tools/perf/util/ |
| D | intlist.c | 14 static struct rb_node *intlist__node_new(struct rblist *rblist __maybe_unused, in intlist__node_new()
18 struct rb_node *rc = NULL; in intlist__node_new()
24 rc = &node->rb_node; in intlist__node_new()
36 struct rb_node *rb_node) in intlist__node_delete() argument
38 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_delete()
43 static int intlist__node_cmp(struct rb_node *rb_node, const void *entry) in intlist__node_cmp() argument
46 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_cmp()
58 rblist__remove_node(&ilist->rblist, &node->rb_node); in intlist__remove()
65 struct rb_node *rb_node; in __intlist__findnew() local
71 rb_node = rblist__findnew(&ilist->rblist, (void *)((long)i)); in __intlist__findnew()
[all …]
|
| D | strlist.c | 15 struct rb_node *strlist__node_new(struct rblist *rblist, const void *entry) in strlist__node_new()
18 struct rb_node *rc = NULL; in strlist__node_new()
29 rc = &snode->rb_node; in strlist__node_new()
47 void strlist__node_delete(struct rblist *rblist, struct rb_node *rb_node) in strlist__node_delete() argument
50 struct str_node *snode = container_of(rb_node, struct str_node, rb_node); in strlist__node_delete()
55 static int strlist__node_cmp(struct rb_node *rb_node, const void *entry) in strlist__node_cmp() argument
58 struct str_node *snode = container_of(rb_node, struct str_node, rb_node); in strlist__node_cmp()
97 rblist__remove_node(&slist->rblist, &snode->rb_node); in strlist__remove()
103 struct rb_node *rb_node = rblist__find(&slist->rblist, entry); in strlist__find() local
105 if (rb_node) in strlist__find()
[all …]
|
| D | rblist.c | 16 struct rb_node **p = &rblist->entries.rb_node; in rblist__add_node()
17 struct rb_node *parent = NULL, *new_node; in rblist__add_node()
44 void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node) in rblist__remove_node() argument
46 rb_erase(rb_node, &rblist->entries); in rblist__remove_node()
48 rblist->node_delete(rblist, rb_node); in rblist__remove_node()
51 static struct rb_node *__rblist__findnew(struct rblist *rblist, in __rblist__findnew()
55 struct rb_node **p = &rblist->entries.rb_node; in __rblist__findnew()
56 struct rb_node *parent = NULL, *new_node = NULL; in __rblist__findnew()
84 struct rb_node *rblist__find(struct rblist *rblist, const void *entry) in rblist__find()
89 struct rb_node *rblist__findnew(struct rblist *rblist, const void *entry) in rblist__findnew()
[all …]
|
| D | rblist.h | 25 int (*node_cmp)(struct rb_node *rbn, const void *entry);
26 struct rb_node *(*node_new)(struct rblist *rlist, const void *new_entry);
27 void (*node_delete)(struct rblist *rblist, struct rb_node *rb_node);
33 void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node);
34 struct rb_node *rblist__find(struct rblist *rblist, const void *entry);
35 struct rb_node *rblist__findnew(struct rblist *rblist, const void *entry);
36 struct rb_node *rblist__entry(const struct rblist *rblist, unsigned int idx);
|
| D | symbol.c | 148 struct rb_node *nd; in symbols__fixup_duplicate()
154 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
156 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
157 next = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
166 rb_erase(&next->rb_node, symbols); in symbols__fixup_duplicate()
170 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
171 rb_erase(&curr->rb_node, symbols); in symbols__fixup_duplicate()
179 struct rb_node *nd, *prevnd = rb_first(symbols); in symbols__fixup_end()
185 curr = rb_entry(prevnd, struct symbol, rb_node); in symbols__fixup_end()
189 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_end()
[all …]
|
| D | map.c | 136 RB_CLEAR_NODE(&map->rb_node); in map__init()
232 struct rb_node *nd = rb_first(symbols); in map__fixup_start()
234 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_start()
242 struct rb_node *nd = rb_last(symbols); in map__fixup_end()
244 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_end()
429 struct rb_node *next = rb_first(maps); in maps__delete()
432 struct map *pos = rb_entry(next, struct map, rb_node); in maps__delete()
434 next = rb_next(&pos->rb_node); in maps__delete()
435 rb_erase(&pos->rb_node, maps); in maps__delete()
502 struct rb_node *next = rb_first(root); in map_groups__flush()
[all …]
|
| D | comm.c | 8 struct rb_node rb_node; member
23 rb_erase(&cs->rb_node, &comm_str_root); in comm_str__put()
48 struct rb_node **p = &root->rb_node; in comm_str__findnew()
49 struct rb_node *parent = NULL; in comm_str__findnew()
55 iter = rb_entry(parent, struct comm_str, rb_node); in comm_str__findnew()
71 rb_link_node(&new->rb_node, parent, p); in comm_str__findnew()
72 rb_insert_color(&new->rb_node, root); in comm_str__findnew()
|
| D | strlist.h | 10 struct rb_node rb_node; member
47 struct rb_node *rn = rb_first(&slist->rblist.entries); in strlist__first()
48 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; in strlist__first()
52 struct rb_node *rn; in strlist__next()
55 rn = rb_next(&sn->rb_node); in strlist__next()
56 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; in strlist__next()
|
| D | intlist.h | 10 struct rb_node rb_node; member
47 struct rb_node *rn = rb_first(&ilist->rblist.entries); in intlist__first()
48 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; in intlist__first()
52 struct rb_node *rn; in intlist__next()
55 rn = rb_next(&in->rb_node); in intlist__next()
56 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; in intlist__next()
|
| D | hist.c | 164 struct rb_node *next = rb_first(&hists->entries); in hists__output_recalc_col_len()
171 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
174 next = rb_next(&n->rb_node); in hists__output_recalc_col_len()
249 rb_erase(&he->rb_node, &hists->entries); in hists__delete_entry()
263 struct rb_node *next = rb_first(&hists->entries); in hists__decay_entries()
267 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
268 next = rb_next(&n->rb_node); in hists__decay_entries()
279 struct rb_node *next = rb_first(&hists->entries); in hists__delete_entries()
283 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
284 next = rb_next(&n->rb_node); in hists__delete_entries()
[all …]
|
| D | callchain.c | 258 struct rb_node **p = &root->rb_node; in rb_insert_callchain()
259 struct rb_node *parent = NULL; in rb_insert_callchain()
267 rnode = rb_entry(parent, struct callchain_node, rb_node); in rb_insert_callchain()
290 rb_link_node(&chain->rb_node, parent, p); in rb_insert_callchain()
291 rb_insert_color(&chain->rb_node, root); in rb_insert_callchain()
298 struct rb_node *n; in __sort_chain_flat()
327 struct rb_node *n; in __sort_chain_graph_abs()
349 rb_root->rb_node = chain_root->node.rb_root.rb_node; in sort_chain_graph_abs()
355 struct rb_node *n; in __sort_chain_graph_rel()
379 rb_root->rb_node = chain_root->node.rb_root.rb_node; in sort_chain_graph_rel()
[all …]
|
| D | machine.c | 26 RB_CLEAR_NODE(&machine->rb_node); in machine__init()
86 RB_CLEAR_NODE(&pos->rb_node); in dsos__delete()
94 struct rb_node *nd = rb_first(&machine->threads); in machine__delete_threads()
97 struct thread *t = rb_entry(nd, struct thread, rb_node); in machine__delete_threads()
136 struct rb_node **p = &machines->guests.rb_node; in machines__add()
137 struct rb_node *parent = NULL; in machines__add()
152 pos = rb_entry(parent, struct machine, rb_node); in machines__add()
159 rb_link_node(&machine->rb_node, parent, p); in machines__add()
160 rb_insert_color(&machine->rb_node, &machines->guests); in machines__add()
168 struct rb_node *nd; in machines__set_symbol_filter()
[all …]
|
| D | dso.c | 499 struct rb_node *next = rb_first(root); in dso_cache__free()
504 cache = rb_entry(next, struct dso_cache, rb_node); in dso_cache__free()
505 next = rb_next(&cache->rb_node); in dso_cache__free()
506 rb_erase(&cache->rb_node, root); in dso_cache__free()
513 struct rb_node * const *p = &root->rb_node; in dso_cache__find()
514 const struct rb_node *parent = NULL; in dso_cache__find()
521 cache = rb_entry(parent, struct dso_cache, rb_node); in dso_cache__find()
537 struct rb_node **p = &root->rb_node; in dso_cache__insert()
538 struct rb_node *parent = NULL; in dso_cache__insert()
546 cache = rb_entry(parent, struct dso_cache, rb_node); in dso_cache__insert()
[all …]
|
| D | build-id.c | 220 struct rb_node *nd; in perf_session__write_buildid_table()
227 struct machine *pos = rb_entry(nd, struct machine, rb_node); in perf_session__write_buildid_table()
258 struct rb_node *nd; in dsos__hit_all()
266 struct machine *pos = rb_entry(nd, struct machine, rb_node); in dsos__hit_all()
500 struct rb_node *nd; in perf_session__cache_build_ids()
512 struct machine *pos = rb_entry(nd, struct machine, rb_node); in perf_session__cache_build_ids()
529 struct rb_node *nd; in perf_session__read_build_ids()
533 struct machine *pos = rb_entry(nd, struct machine, rb_node); in perf_session__read_build_ids()
|
| D | thread-stack.h | 90 struct rb_node rb_node; member
|
| D | sort.h | 79 struct rb_node rb_node_in;
80 struct rb_node rb_node; member
|
| D | callchain.h | 33 struct rb_node rb_node_in; /* to insert nodes in an rbtree */
34 struct rb_node rb_node; /* to sort nodes in an output tree */ member
|
| D | dso.h | 114 struct rb_node rb_node; member
131 struct rb_node rb_node; /* rbtree node sorted by long name */ member
|
| D | thread.h | 16 struct rb_node rb_node; member
|
| D | thread-stack.c | 338 RB_CLEAR_NODE(&cp->rb_node); in call_path__init()
397 struct rb_node **p; in call_path__findnew()
398 struct rb_node *node_parent = NULL; in call_path__findnew()
408 p = &parent->children.rb_node; in call_path__findnew()
411 cp = rb_entry(node_parent, struct call_path, rb_node); in call_path__findnew()
426 rb_link_node(&cp->rb_node, node_parent, p); in call_path__findnew()
427 rb_insert_color(&cp->rb_node, &parent->children); in call_path__findnew()
|
| D | symbol.h | 52 struct rb_node rb_node; member
72 nd && (pos = rb_entry(nd, struct symbol, rb_node)); \
|
| D | annotate.c | 1088 struct rb_node **p = &root->rb_node; in insert_source_line()
1089 struct rb_node *parent = NULL; in insert_source_line()
1132 struct rb_node **p = &root->rb_node; in __resort_source_line()
1133 struct rb_node *parent = NULL; in __resort_source_line()
1152 struct rb_node *node; in resort_source_line()
1156 struct rb_node *next; in resort_source_line()
1251 struct rb_node *node; in print_summary()
|
| D | machine.h | 27 struct rb_node rb_node; member
|
| D | map.h | 29 struct rb_node rb_node; member
|
| D | kvm-stat.h | 25 struct rb_node rb;
|
| /linux-4.1.27/fs/btrfs/ |
| D | extent_map.c | 54 RB_CLEAR_NODE(&em->rb_node); in alloc_extent_map()
94 struct rb_node **p = &root->rb_node; in tree_insert()
95 struct rb_node *parent = NULL; in tree_insert()
97 struct rb_node *orig_parent = NULL; in tree_insert()
102 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
115 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
122 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
125 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
131 rb_link_node(&em->rb_node, orig_parent, p); in tree_insert()
132 rb_insert_color(&em->rb_node, root); in tree_insert()
[all …]
|
| D | ordered-data.c | 41 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset, in tree_insert()
42 struct rb_node *node) in tree_insert()
44 struct rb_node **p = &root->rb_node; in tree_insert()
45 struct rb_node *parent = NULL; in tree_insert()
50 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); in tree_insert()
77 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset, in __tree_search()
78 struct rb_node **prev_ret) in __tree_search()
80 struct rb_node *n = root->rb_node; in __tree_search()
81 struct rb_node *prev = NULL; in __tree_search()
82 struct rb_node *test; in __tree_search()
[all …]
|
| D | ulist.c | 120 struct rb_node *n = ulist->root.rb_node; in ulist_rbtree_search()
124 u = rb_entry(n, struct ulist_node, rb_node); in ulist_rbtree_search()
137 struct rb_node **p = &ulist->root.rb_node; in ulist_rbtree_insert()
138 struct rb_node *parent = NULL; in ulist_rbtree_insert()
143 cur = rb_entry(parent, struct ulist_node, rb_node); in ulist_rbtree_insert()
152 rb_link_node(&ins->rb_node, parent, p); in ulist_rbtree_insert()
153 rb_insert_color(&ins->rb_node, &ulist->root); in ulist_rbtree_insert()
|
| D | relocation.c | 39 struct rb_node rb_node; member
47 struct rb_node rb_node; member
127 struct rb_node rb_node; member
141 struct rb_node rb_node; member
255 RB_CLEAR_NODE(&node->rb_node); in alloc_backref_node()
289 static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, in tree_insert()
290 struct rb_node *node) in tree_insert()
292 struct rb_node **p = &root->rb_node; in tree_insert()
293 struct rb_node *parent = NULL; in tree_insert()
298 entry = rb_entry(parent, struct tree_entry, rb_node); in tree_insert()
[all …]
|
| D | delayed-ref.c | 140 struct rb_node *node) in tree_insert()
142 struct rb_node **p = &root->rb_node; in tree_insert()
143 struct rb_node *parent_node = NULL; in tree_insert()
148 ins = rb_entry(node, struct btrfs_delayed_ref_node, rb_node); in tree_insert()
152 rb_node); in tree_insert()
170 struct rb_node *node) in htree_insert()
172 struct rb_node **p = &root->rb_node; in htree_insert()
173 struct rb_node *parent_node = NULL; in htree_insert()
208 struct rb_node *n; in find_ref_head()
211 n = root->rb_node; in find_ref_head()
[all …]
|
| D | extent_io.c | 30 return !RB_EMPTY_NODE(&state->rb_node); in extent_state_in_tree()
116 struct rb_node rb_node; member
217 RB_CLEAR_NODE(&state->rb_node); in alloc_extent_state()
237 static struct rb_node *tree_insert(struct rb_root *root, in tree_insert()
238 struct rb_node *search_start, in tree_insert()
240 struct rb_node *node, in tree_insert()
241 struct rb_node ***p_in, in tree_insert()
242 struct rb_node **parent_in) in tree_insert()
244 struct rb_node **p; in tree_insert()
245 struct rb_node *parent = NULL; in tree_insert()
[all …]
|
| D | extent_map.h | 21 struct rb_node rb_node; member
49 return !RB_EMPTY_NODE(&em->rb_node); in extent_map_in_tree()
|
| D | ulist.h | 40 struct rb_node rb_node; /* used to speed up search */ member
|
| D | ordered-data.h | 26 struct rb_node *last;
133 struct rb_node rb_node; member
|
| D | delayed-ref.h | 28 struct rb_node rb_node; member
88 struct rb_node href_node;
|
| D | delayed-inode.c | 345 struct rb_node *node, *prev_node = NULL; in __btrfs_lookup_delayed_item()
349 node = root->rb_node; in __btrfs_lookup_delayed_item()
353 rb_node); in __btrfs_lookup_delayed_item()
371 rb_node); in __btrfs_lookup_delayed_item()
383 rb_node); in __btrfs_lookup_delayed_item()
405 struct rb_node **p, *node; in __btrfs_add_delayed_item()
406 struct rb_node *parent_node = NULL; in __btrfs_add_delayed_item()
417 p = &root->rb_node; in __btrfs_add_delayed_item()
418 node = &ins->rb_node; in __btrfs_add_delayed_item()
423 rb_node); in __btrfs_add_delayed_item()
[all …]
|
| D | delayed-inode.h | 77 struct rb_node rb_node; member
|
| D | btrfs_inode.h | 103 struct rb_node rb_node; member
|
| D | file.c | 52 struct rb_node rb_node; member
100 struct rb_node **p; in __btrfs_add_inode_defrag()
101 struct rb_node *parent = NULL; in __btrfs_add_inode_defrag()
104 p = &root->fs_info->defrag_inodes.rb_node; in __btrfs_add_inode_defrag()
107 entry = rb_entry(parent, struct inode_defrag, rb_node); in __btrfs_add_inode_defrag()
127 rb_link_node(&defrag->rb_node, parent, p); in __btrfs_add_inode_defrag()
128 rb_insert_color(&defrag->rb_node, &root->fs_info->defrag_inodes); in __btrfs_add_inode_defrag()
228 struct rb_node *p; in btrfs_pick_defrag_inode()
229 struct rb_node *parent = NULL; in btrfs_pick_defrag_inode()
236 p = fs_info->defrag_inodes.rb_node; in btrfs_pick_defrag_inode()
[all …]
|
| D | free-space-cache.c | 644 struct rb_node *n; in merge_space_tree()
914 struct rb_node *node = rb_first(&ctl->free_space_offset); in write_cache_extent_entries()
1438 struct rb_node *node, int bitmap) in tree_insert_offset()
1440 struct rb_node **p = &root->rb_node; in tree_insert_offset()
1441 struct rb_node *parent = NULL; in tree_insert_offset()
1499 struct rb_node *n = ctl->free_space_offset.rb_node; in tree_search_offset()
1776 struct rb_node *node; in find_free_space()
1781 if (!ctl->free_space_offset.rb_node) in find_free_space()
1894 struct rb_node *next = rb_next(&bitmap_info->offset_index); in remove_from_bitmap()
2021 struct rb_node *node; in insert_into_bitmap()
[all …]
|
| D | qgroup.c | 83 struct rb_node node; /* tree of qgroups */
114 struct rb_node *n = fs_info->qgroup_tree.rb_node; in find_qgroup_rb()
133 struct rb_node **p = &fs_info->qgroup_tree.rb_node; in add_qgroup_rb()
134 struct rb_node *parent = NULL; in add_qgroup_rb()
460 struct rb_node *n; in btrfs_free_qgroup_config()
1380 struct rb_node *n; in qgroup_oper_exists()
1385 n = fs_info->qgroup_op_tree.rb_node; in qgroup_oper_exists()
1427 struct rb_node **p; in insert_qgroup_oper()
1428 struct rb_node *parent = NULL; in insert_qgroup_oper()
1433 p = &fs_info->qgroup_op_tree.rb_node; in insert_qgroup_oper()
[all …]
|
| D | qgroup.h | 57 struct rb_node n;
|
| /linux-4.1.27/tools/perf/tests/ |
| D | hists_output.c | 94 struct rb_node *node; in del_hist_entries()
106 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
128 struct rb_node *node; in test1()
164 he = rb_entry(node, struct hist_entry, rb_node); in test1()
170 he = rb_entry(node, struct hist_entry, rb_node); in test1()
176 he = rb_entry(node, struct hist_entry, rb_node); in test1()
182 he = rb_entry(node, struct hist_entry, rb_node); in test1()
188 he = rb_entry(node, struct hist_entry, rb_node); in test1()
194 he = rb_entry(node, struct hist_entry, rb_node); in test1()
200 he = rb_entry(node, struct hist_entry, rb_node); in test1()
[all …]
|
| D | vmlinux-kallsyms.c | 24 struct rb_node *nd; in test__vmlinux_matches_kallsyms()
114 sym = rb_entry(nd, struct symbol, rb_node); in test__vmlinux_matches_kallsyms()
153 struct rb_node *nnd; in test__vmlinux_matches_kallsyms()
155 nnd = backwards ? rb_prev(&pair->rb_node) : in test__vmlinux_matches_kallsyms()
156 rb_next(&pair->rb_node); in test__vmlinux_matches_kallsyms()
158 struct symbol *next = rb_entry(nnd, struct symbol, rb_node); in test__vmlinux_matches_kallsyms()
188 struct map *pos = rb_entry(nd, struct map, rb_node), *pair; in test__vmlinux_matches_kallsyms()
208 struct map *pos = rb_entry(nd, struct map, rb_node), *pair; in test__vmlinux_matches_kallsyms()
233 struct map *pos = rb_entry(nd, struct map, rb_node); in test__vmlinux_matches_kallsyms()
|
| D | hists_cumulate.c | 128 struct rb_node *node; in del_hist_entries()
140 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
181 struct rb_node *node; in do_test()
201 node && (he = rb_entry(node, struct hist_entry, rb_node)); in do_test()
220 cnode = rb_entry(rb_first(root), struct callchain_node, rb_node); in do_test()
|
| D | hists_common.c | 157 struct rb_node *node; in print_hists_in()
187 struct rb_node *node; in print_hists_out()
196 he = rb_entry(node, struct hist_entry, rb_node); in print_hists_out()
|
| D | hists_link.c | 151 struct rb_node *node; in __validate_match()
201 struct rb_node *node; in __validate_link()
|
| /linux-4.1.27/arch/powerpc/kernel/ |
| D | eeh_cache.c | 50 struct rb_node rb_node; member
65 struct rb_node *n = pci_io_addr_cache_root.rb_root.rb_node; in __eeh_addr_cache_get_device()
69 piar = rb_entry(n, struct pci_io_addr_range, rb_node); in __eeh_addr_cache_get_device()
110 struct rb_node *n; in eeh_addr_cache_print()
116 piar = rb_entry(n, struct pci_io_addr_range, rb_node); in eeh_addr_cache_print()
131 struct rb_node **p = &pci_io_addr_cache_root.rb_root.rb_node; in eeh_addr_cache_insert()
132 struct rb_node *parent = NULL; in eeh_addr_cache_insert()
138 piar = rb_entry(parent, struct pci_io_addr_range, rb_node); in eeh_addr_cache_insert()
166 rb_link_node(&piar->rb_node, parent, p); in eeh_addr_cache_insert()
167 rb_insert_color(&piar->rb_node, &pci_io_addr_cache_root.rb_root); in eeh_addr_cache_insert()
[all …]
|
| /linux-4.1.27/arch/sh/kernel/ |
| D | dwarf.c | 308 struct rb_node **rb_node = &cie_root.rb_node; in dwarf_lookup_cie() local
323 while (*rb_node) { in dwarf_lookup_cie()
326 cie_tmp = rb_entry(*rb_node, struct dwarf_cie, node); in dwarf_lookup_cie()
335 rb_node = &(*rb_node)->rb_left; in dwarf_lookup_cie()
337 rb_node = &(*rb_node)->rb_right; in dwarf_lookup_cie()
352 struct rb_node **rb_node = &fde_root.rb_node; in dwarf_lookup_fde() local
358 while (*rb_node) { in dwarf_lookup_fde()
362 fde_tmp = rb_entry(*rb_node, struct dwarf_fde, node); in dwarf_lookup_fde()
369 rb_node = &(*rb_node)->rb_left; in dwarf_lookup_fde()
375 rb_node = &(*rb_node)->rb_right; in dwarf_lookup_fde()
[all …]
|
| /linux-4.1.27/drivers/infiniband/hw/ipath/ |
| D | ipath_verbs_mcast.c | 123 struct rb_node *n; in ipath_mcast_find()
128 n = mcast_tree.rb_node; in ipath_mcast_find()
132 mcast = rb_entry(n, struct ipath_mcast, rb_node); in ipath_mcast_find()
167 struct rb_node **n = &mcast_tree.rb_node; in ipath_mcast_add()
168 struct rb_node *pn = NULL; in ipath_mcast_add()
178 tmcast = rb_entry(pn, struct ipath_mcast, rb_node); in ipath_mcast_add()
225 rb_link_node(&mcast->rb_node, pn, n); in ipath_mcast_add()
226 rb_insert_color(&mcast->rb_node, &mcast_tree); in ipath_mcast_add()
291 struct rb_node *n; in ipath_multicast_detach()
298 n = mcast_tree.rb_node; in ipath_multicast_detach()
[all …]
|
| /linux-4.1.27/security/keys/ |
| D | proc.c | 85 static struct rb_node *key_serial_next(struct seq_file *p, struct rb_node *n) in key_serial_next()
107 struct rb_node *n = key_serial_tree.rb_node; in find_ge_key()
155 static inline key_serial_t key_node_serial(struct rb_node *n) in key_node_serial()
163 struct rb_node *n; in proc_keys_next()
179 struct rb_node *_p = v; in proc_keys_show()
272 static struct rb_node *__key_user_next(struct user_namespace *user_ns, struct rb_node *n) in __key_user_next()
283 static struct rb_node *key_user_next(struct user_namespace *user_ns, struct rb_node *n) in key_user_next()
288 static struct rb_node *key_user_first(struct user_namespace *user_ns, struct rb_root *r) in key_user_first()
290 struct rb_node *n = rb_first(r); in key_user_first()
306 struct rb_node *_p; in proc_key_users_start()
[all …]
|
| D | key.c | 57 struct rb_node *parent = NULL; in key_user_lookup()
58 struct rb_node **p; in key_user_lookup()
61 p = &key_user_tree.rb_node; in key_user_lookup()
139 struct rb_node *parent, **p; in key_alloc_serial()
154 p = &key_serial_tree.rb_node; in key_alloc_serial()
616 struct rb_node *n; in key_lookup()
622 n = key_serial_tree.rb_node; in key_lookup()
1136 &key_user_tree.rb_node); in key_init()
|
| /linux-4.1.27/fs/xfs/ |
| D | xfs_extent_busy.c | 45 struct rb_node **rbp; in xfs_extent_busy_insert()
46 struct rb_node *parent = NULL; in xfs_extent_busy_insert()
71 rbp = &pag->pagb_tree.rb_node; in xfs_extent_busy_insert()
74 busyp = rb_entry(parent, struct xfs_extent_busy, rb_node); in xfs_extent_busy_insert()
87 rb_link_node(&new->rb_node, parent, rbp); in xfs_extent_busy_insert()
88 rb_insert_color(&new->rb_node, &pag->pagb_tree); in xfs_extent_busy_insert()
112 struct rb_node *rbp; in xfs_extent_busy_search()
119 rbp = pag->pagb_tree.rb_node; in xfs_extent_busy_search()
123 busyp = rb_entry(rbp, struct xfs_extent_busy, rb_node); in xfs_extent_busy_search()
251 rb_erase(&busyp->rb_node, &pag->pagb_tree); in xfs_extent_busy_update_extent()
[all …]
|
| D | xfs_extent_busy.h | 35 struct rb_node rb_node; /* ag by-bno indexed search tree */ member
|
| /linux-4.1.27/drivers/gpu/drm/ |
| D | drm_vma_manager.c | 162 struct rb_node *iter; in drm_vma_offset_lookup_locked()
165 iter = mgr->vm_addr_space_rb.rb_node; in drm_vma_offset_lookup_locked()
196 struct rb_node **iter = &mgr->vm_addr_space_rb.rb_node; in _drm_vma_offset_add_rb()
197 struct rb_node *parent = NULL; in _drm_vma_offset_add_rb()
312 struct rb_node **iter; in drm_vma_node_allow()
313 struct rb_node *parent = NULL; in drm_vma_node_allow()
325 iter = &node->vm_files.rb_node; in drm_vma_node_allow()
375 struct rb_node *iter; in drm_vma_node_revoke()
379 iter = node->vm_files.rb_node; in drm_vma_node_revoke()
416 struct rb_node *iter; in drm_vma_node_is_allowed()
[all …]
|
| /linux-4.1.27/drivers/infiniband/hw/qib/ |
| D | qib_verbs_mcast.c | 113 struct rb_node *n; in qib_mcast_find()
118 n = ibp->mcast_tree.rb_node; in qib_mcast_find()
122 mcast = rb_entry(n, struct qib_mcast, rb_node); in qib_mcast_find()
156 struct rb_node **n = &ibp->mcast_tree.rb_node; in qib_mcast_add()
157 struct rb_node *pn = NULL; in qib_mcast_add()
167 tmcast = rb_entry(pn, struct qib_mcast, rb_node); in qib_mcast_add()
214 rb_link_node(&mcast->rb_node, pn, n); in qib_mcast_add()
215 rb_insert_color(&mcast->rb_node, &ibp->mcast_tree); in qib_mcast_add()
290 struct rb_node *n; in qib_multicast_detach()
300 n = ibp->mcast_tree.rb_node; in qib_multicast_detach()
[all …]
|
| /linux-4.1.27/security/integrity/ |
| D | iint.c | 36 struct rb_node *n = integrity_iint_tree.rb_node; in __integrity_iint_find()
39 iint = rb_entry(n, struct integrity_iint_cache, rb_node); in __integrity_iint_find()
94 struct rb_node **p; in integrity_inode_get()
95 struct rb_node *node, *parent = NULL; in integrity_inode_get()
108 p = &integrity_iint_tree.rb_node; in integrity_inode_get()
112 rb_node); in integrity_inode_get()
120 node = &iint->rb_node; in integrity_inode_get()
144 rb_erase(&iint->rb_node, &integrity_iint_tree); in integrity_inode_free()
|
| D | integrity.h | 105 struct rb_node rb_node; /* rooted in integrity_iint_tree */ member
|
| /linux-4.1.27/arch/arm/xen/ |
| D | p2m.c | 24 struct rb_node rbnode_phys;
33 struct rb_node **link = &phys_to_mach.rb_node; in xen_add_phys_to_mach_entry()
34 struct rb_node *parent = NULL; in xen_add_phys_to_mach_entry()
64 struct rb_node *n = phys_to_mach.rb_node; in __pfn_to_mfn()
125 struct rb_node *n = phys_to_mach.rb_node; in __set_phys_to_machine_multi()
|
| /linux-4.1.27/drivers/block/drbd/ |
| D | drbd_interval.c | 9 sector_t interval_end(struct rb_node *node) in interval_end()
49 struct rb_node **new = &root->rb_node, *parent = NULL; in drbd_insert_interval()
93 struct rb_node *node = root->rb_node; in drbd_contains_interval()
136 struct rb_node *node = root->rb_node; in drbd_find_overlap()
167 struct rb_node *node; in drbd_next_overlap()
|
| D | drbd_interval.h | 8 struct rb_node rb;
|
| /linux-4.1.27/fs/ext4/ |
| D | extents_status.c | 178 struct rb_node *node; in ext4_es_print_tree()
185 es = rb_entry(node, struct extent_status, rb_node); in ext4_es_print_tree()
210 struct rb_node *node = root->rb_node; in __es_tree_search()
214 es = rb_entry(node, struct extent_status, rb_node); in __es_tree_search()
227 node = rb_next(&es->rb_node); in __es_tree_search()
228 return node ? rb_entry(node, struct extent_status, rb_node) : in __es_tree_search()
250 struct rb_node *node; in ext4_es_find_delayed_extent_range()
275 while ((node = rb_next(&es1->rb_node)) != NULL) { in ext4_es_find_delayed_extent_range()
276 es1 = rb_entry(node, struct extent_status, rb_node); in ext4_es_find_delayed_extent_range()
417 struct rb_node *node; in ext4_es_try_to_merge_left()
[all …]
|
| D | block_validity.c | 23 struct rb_node node;
61 struct rb_node **n = &sbi->system_blks.rb_node, *node; in add_system_zone()
62 struct rb_node *parent = NULL, *new_node = NULL; in add_system_zone()
123 struct rb_node *node; in debug_print_tree()
149 if (EXT4_SB(sb)->system_blks.rb_node) in ext4_setup_system_zone()
153 if (EXT4_SB(sb)->system_blks.rb_node) in ext4_setup_system_zone()
200 struct rb_node *n = sbi->system_blks.rb_node; in ext4_data_block_valid()
|
| D | extents_status.h | 59 struct rb_node rb_node; member
|
| /linux-4.1.27/drivers/iommu/ |
| D | iova.c | 76 static struct rb_node *
83 struct rb_node *prev_node = rb_prev(iovad->cached32_node); in __get_cached_rbnode()
104 struct rb_node *curr; in __cached_rbnode_delete_update()
112 struct rb_node *node = rb_next(&free->node); in __cached_rbnode_delete_update()
142 struct rb_node *prev, *curr = NULL; in __alloc_and_insert_iova_range()
188 struct rb_node **entry, *parent = NULL; in __alloc_and_insert_iova_range()
195 entry = &iovad->rbroot.rb_node; in __alloc_and_insert_iova_range()
226 struct rb_node **new = &(root->rb_node), *parent = NULL; in iova_insert_rbtree()
294 struct rb_node *node; in find_iova()
298 node = iovad->rbroot.rb_node; in find_iova()
[all …]
|
| /linux-4.1.27/arch/x86/mm/ |
| D | pat_rbtree.c | 47 static u64 get_subtree_max_end(struct rb_node *node) in get_subtree_max_end()
79 struct rb_node *node = root->rb_node; in RB_DECLARE_CALLBACKS()
108 struct rb_node *node; in memtype_rb_exact_match()
128 struct rb_node *node; in memtype_rb_check_conflict()
171 struct rb_node **node = &(root->rb_node); in memtype_rb_insert()
172 struct rb_node *parent = NULL; in memtype_rb_insert()
232 struct rb_node *node; in rbt_memtype_copy_nth_element()
|
| D | pat_internal.h | 14 struct rb_node rb;
|
| /linux-4.1.27/net/netfilter/ |
| D | nft_rbtree.c | 28 struct rb_node node;
38 const struct rb_node *parent; in nft_rbtree_lookup()
43 parent = priv->root.rb_node; in nft_rbtree_lookup()
84 struct rb_node *parent, **p; in __nft_rbtree_insert()
89 p = &priv->root.rb_node; in __nft_rbtree_insert()
147 const struct rb_node *parent = priv->root.rb_node; in nft_rbtree_deactivate()
180 struct rb_node *node; in nft_rbtree_walk()
224 struct rb_node *node; in nft_rbtree_destroy()
226 while ((node = priv->root.rb_node) != NULL) { in nft_rbtree_destroy()
|
| D | xt_connlimit.c | 53 struct rb_node node;
207 struct rb_node **rbnode, *parent; in count_tree()
216 rbnode = &(root->rb_node); in count_tree()
403 struct rb_node *node; in destroy_tree()
|
| /linux-4.1.27/Documentation/ |
| D | rbtree.txt | 49 tree implementations. Instead of using pointers to separate rb_node and data
50 structures, each instance of struct rb_node is embedded in the data structure
59 Data nodes in an rbtree tree are structures containing a struct rb_node member:
62 struct rb_node node;
66 When dealing with a pointer to the embedded struct rb_node, the containing data
85 struct rb_node *node = root->rb_node;
117 struct rb_node **new = &(root->rb_node), *parent = NULL;
145 void rb_erase(struct rb_node *victim, struct rb_root *tree);
158 void rb_replace_node(struct rb_node *old, struct rb_node *new,
171 struct rb_node *rb_first(struct rb_root *tree);
[all …]
|
| /linux-4.1.27/arch/x86/platform/uv/ |
| D | uv_irq.c | 22 struct rb_node list;
54 struct rb_node **link = &uv_irq_root.rb_node; in uv_set_irq_2_mmr_info()
55 struct rb_node *parent = NULL; in uv_set_irq_2_mmr_info()
101 struct rb_node *n; in uv_irq_2_mmr_info()
105 n = uv_irq_root.rb_node; in uv_irq_2_mmr_info()
267 struct rb_node *n; in uv_teardown_irq()
271 n = uv_irq_root.rb_node; in uv_teardown_irq()
|
| /linux-4.1.27/tools/perf/ |
| D | builtin-kmem.c | 51 struct rb_node node;
65 struct rb_node **node = &root_alloc_stat.rb_node; in insert_alloc_stat()
66 struct rb_node *parent = NULL; in insert_alloc_stat()
108 struct rb_node **node = &root_caller_stat.rb_node; in insert_caller_stat()
109 struct rb_node *parent = NULL; in insert_caller_stat()
190 struct rb_node *node = root->rb_node; in search_alloc_stat()
251 struct rb_node node;
268 struct rb_node **node = &page_tree.rb_node; in search_page()
269 struct rb_node *parent = NULL; in search_page()
324 struct rb_node **node = &page_alloc_tree.rb_node; in search_page_alloc_stat()
[all …]
|
| D | builtin-lock.c | 43 struct rb_node rb; /* used for sorting */
110 struct rb_node rb;
120 struct rb_node *node; in thread_stat_find()
123 node = thread_stats.rb_node; in thread_stat_find()
139 struct rb_node **rb = &thread_stats.rb_node; in thread_stat_insert()
140 struct rb_node *parent = NULL; in thread_stat_insert()
197 rb_link_node(&st->rb, NULL, &thread_stats.rb_node); in thread_stat_findnew_first()
280 struct rb_node **rb = &result.rb_node; in insert_to_result()
281 struct rb_node *parent = NULL; in insert_to_result()
301 struct rb_node *node = result.rb_node; in pop_from_result()
[all …]
|
| D | builtin-annotate.c | 63 rb_erase(&al->sym->rb_node, in perf_evsel__add_sample()
118 struct rb_node *nd = rb_first(&hists->entries), *next; in hists__find_annotations()
122 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); in hists__find_annotations()
|
| /linux-4.1.27/drivers/net/ethernet/mellanox/mlx5/core/ |
| D | pagealloc.c | 60 struct rb_node rb_node; member
108 struct rb_node **new = &root->rb_node; in insert_page()
109 struct rb_node *parent = NULL; in insert_page()
116 tfp = rb_entry(parent, struct fw_page, rb_node); in insert_page()
136 rb_link_node(&nfp->rb_node, parent, new); in insert_page()
137 rb_insert_color(&nfp->rb_node, root); in insert_page()
146 struct rb_node *tmp = root->rb_node; in find_fw_page()
151 tfp = rb_entry(tmp, struct fw_page, rb_node); in find_fw_page()
231 rb_erase(&fwp->rb_node, &dev->priv.page_root); in free_4k()
483 struct rb_node *p; in mlx5_reclaim_startup_pages()
[all …]
|
| /linux-4.1.27/tools/perf/ui/stdio/ |
| D | hist.c | 84 struct rb_node *node, *next; in __callchain__fprintf_graph()
100 child = rb_entry(node, struct callchain_node, rb_node); in __callchain__fprintf_graph()
166 struct rb_node *node; in callchain__fprintf_graph()
178 cnode = rb_entry(node, struct callchain_node, rb_node); in callchain__fprintf_graph()
243 struct rb_node *rb_node = rb_first(tree); in callchain__fprintf_flat() local
245 while (rb_node) { in callchain__fprintf_flat()
248 chain = rb_entry(rb_node, struct callchain_node, rb_node); in callchain__fprintf_flat()
257 rb_node = rb_next(rb_node); in callchain__fprintf_flat()
377 struct rb_node *nd; in hists__fprintf()
462 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__fprintf()
|
| /linux-4.1.27/tools/perf/ui/browsers/ |
| D | map.c | 23 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map_browser__write()
41 return ((void *)browser) - sizeof(struct rb_node) - sizeof(u32); in symbol__browser_index()
63 browser->b.top = &sym->rb_node; in map_browser__search()
112 struct rb_node *nd; in map__browse()
117 struct symbol *pos = rb_entry(nd, struct symbol, rb_node); in map__browse()
|
| D | hists.c | 43 static struct rb_node *hists__filter_entries(struct rb_node *nd,
53 struct rb_node *nd; in hist_browser__get_folding()
61 rb_entry(nd, struct hist_entry, rb_node); in hist_browser__get_folding()
162 struct rb_node *nd; in callchain_node__count_rows_rb_tree()
165 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__count_rows_rb_tree()
203 struct rb_node *nd; in callchain__count_rows()
207 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__count_rows()
228 struct rb_node *nd = rb_first(&node->rb_root); in callchain_node__init_have_children_rb_tree()
231 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__init_have_children_rb_tree()
267 struct rb_node *nd = rb_first(root); in callchain__init_have_children()
[all …]
|
| D | annotate.c | 15 struct rb_node rb_node; member
40 struct rb_node *curr_hot;
286 struct rb_node **p = &root->rb_node; in disasm_rb_tree__insert()
287 struct rb_node *parent = NULL; in disasm_rb_tree__insert()
292 l = rb_entry(parent, struct browser_disasm_line, rb_node); in disasm_rb_tree__insert()
299 rb_link_node(&bdl->rb_node, parent, p); in disasm_rb_tree__insert()
300 rb_insert_color(&bdl->rb_node, root); in disasm_rb_tree__insert()
327 struct rb_node *nd) in annotate_browser__set_rb_top()
333 bpos = rb_entry(nd, struct browser_disasm_line, rb_node); in annotate_browser__set_rb_top()
362 RB_CLEAR_NODE(&bpos->rb_node); in annotate_browser__calc_percent()
[all …]
|
| /linux-4.1.27/fs/logfs/ |
| D | gc.c | 185 struct rb_node **p = &list->rb_tree.rb_node; in add_list()
186 struct rb_node *parent = NULL; in add_list()
193 cur = rb_entry(parent, struct gc_candidate, rb_node); in add_list()
205 rb_link_node(&cand->rb_node, parent, p); in add_list()
206 rb_insert_color(&cand->rb_node, &list->rb_tree); in add_list()
212 cand = rb_entry(rb_last(&list->rb_tree), struct gc_candidate, rb_node); in add_list()
213 rb_erase(&cand->rb_node, &list->rb_tree); in add_list()
222 rb_erase(&cand->rb_node, &list->rb_tree); in remove_from_list()
241 cand = rb_entry(rb_first(&list->rb_tree), struct gc_candidate, rb_node); in get_best_cand()
352 return rb_entry(rb_first(&list->rb_tree), struct gc_candidate, rb_node); in first_in_list()
[all …]
|
| /linux-4.1.27/kernel/sched/ |
| D | deadline.c | 43 return !RB_EMPTY_NODE(&dl_se->rb_node); in on_dl_rq()
50 return dl_rq->rb_leftmost == &dl_se->rb_node; in is_leftmost()
160 struct rb_node **link = &dl_rq->pushable_dl_tasks_root.rb_node; in enqueue_pushable_dl_task()
161 struct rb_node *parent = NULL; in enqueue_pushable_dl_task()
194 struct rb_node *next_node; in dequeue_pushable_dl_task()
777 struct rb_node *leftmost = dl_rq->rb_leftmost; in dec_dl_deadline()
780 entry = rb_entry(leftmost, struct sched_dl_entity, rb_node); in dec_dl_deadline()
825 struct rb_node **link = &dl_rq->rb_root.rb_node; in __enqueue_dl_entity()
826 struct rb_node *parent = NULL; in __enqueue_dl_entity()
830 BUG_ON(!RB_EMPTY_NODE(&dl_se->rb_node)); in __enqueue_dl_entity()
[all …]
|
| /linux-4.1.27/drivers/android/ |
| D | binder.c | 230 struct rb_node rb_node; member
261 struct rb_node rb_node_desc;
262 struct rb_node rb_node_node;
274 struct rb_node rb_node; /* free entry by size or allocated entry */ member
342 struct rb_node rb_node; member
469 struct rb_node **p = &proc->free_buffers.rb_node; in binder_insert_free_buffer()
470 struct rb_node *parent = NULL; in binder_insert_free_buffer()
485 buffer = rb_entry(parent, struct binder_buffer, rb_node); in binder_insert_free_buffer()
495 rb_link_node(&new_buffer->rb_node, parent, p); in binder_insert_free_buffer()
496 rb_insert_color(&new_buffer->rb_node, &proc->free_buffers); in binder_insert_free_buffer()
[all …]
|
| /linux-4.1.27/block/ |
| D | elevator.c | 299 struct rb_node **p = &root->rb_node; in elv_rb_add()
300 struct rb_node *parent = NULL; in elv_rb_add()
305 __rq = rb_entry(parent, struct request, rb_node); in elv_rb_add()
313 rb_link_node(&rq->rb_node, parent, p); in elv_rb_add()
314 rb_insert_color(&rq->rb_node, root); in elv_rb_add()
320 BUG_ON(RB_EMPTY_NODE(&rq->rb_node)); in elv_rb_del()
321 rb_erase(&rq->rb_node, root); in elv_rb_del()
322 RB_CLEAR_NODE(&rq->rb_node); in elv_rb_del()
328 struct rb_node *n = root->rb_node; in elv_rb_find()
332 rq = rb_entry(n, struct request, rb_node); in elv_rb_find()
[all …]
|
| D | cfq-iosched.c | 68 #define rb_entry_cfqg(node) rb_entry((node), struct cfq_group, rb_node)
86 struct rb_node *left;
105 struct rb_node rb_node; member
109 struct rb_node p_node;
221 struct rb_node rb_node; member
1174 return rb_entry(root->left, struct cfq_queue, rb_node); in cfq_rb_first()
1190 static void rb_erase_init(struct rb_node *n, struct rb_root *root) in rb_erase_init()
1196 static void cfq_rb_erase(struct rb_node *n, struct cfq_rb_root *root) in cfq_rb_erase()
1211 struct rb_node *rbnext = rb_next(&last->rb_node); in cfq_find_next_rq()
1212 struct rb_node *rbprev = rb_prev(&last->rb_node); in cfq_find_next_rq()
[all …]
|
| D | blk-throttle.c | 73 struct rb_node *first_pending; /* first node in the tree */
84 #define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node)
99 struct rb_node rb_node; member
439 RB_CLEAR_NODE(&tg->rb_node); in throtl_pd_init()
568 static void rb_erase_init(struct rb_node *n, struct rb_root *root) in rb_erase_init()
574 static void throtl_rb_erase(struct rb_node *n, in throtl_rb_erase()
597 struct rb_node **node = &parent_sq->pending_tree.rb_node; in tg_service_queue_add()
598 struct rb_node *parent = NULL; in tg_service_queue_add()
616 parent_sq->first_pending = &tg->rb_node; in tg_service_queue_add()
618 rb_link_node(&tg->rb_node, parent, node); in tg_service_queue_add()
[all …]
|
| /linux-4.1.27/drivers/base/regmap/ |
| D | regcache-rbtree.c | 35 struct rb_node node;
70 struct rb_node *node; in regcache_rbtree_lookup()
82 node = rbtree_ctx->root.rb_node; in regcache_rbtree_lookup()
103 struct rb_node **new, *parent; in regcache_rbtree_insert()
109 new = &root->rb_node; in regcache_rbtree_insert()
142 struct rb_node *node; in rbtree_show()
230 struct rb_node *next; in regcache_rbtree_exit()
388 struct rb_node *node; in regcache_rbtree_write()
460 struct rb_node *node; in regcache_rbtree_sync()
502 struct rb_node *node; in regcache_rbtree_drop()
|
| /linux-4.1.27/mm/ |
| D | vmalloc.c | 285 static struct rb_node *free_vmap_cache;
294 struct rb_node *n = vmap_area_root.rb_node; in __find_vmap_area()
299 va = rb_entry(n, struct vmap_area, rb_node); in __find_vmap_area()
313 struct rb_node **p = &vmap_area_root.rb_node; in __insert_vmap_area()
314 struct rb_node *parent = NULL; in __insert_vmap_area()
315 struct rb_node *tmp; in __insert_vmap_area()
321 tmp_va = rb_entry(parent, struct vmap_area, rb_node); in __insert_vmap_area()
330 rb_link_node(&va->rb_node, parent, p); in __insert_vmap_area()
331 rb_insert_color(&va->rb_node, &vmap_area_root); in __insert_vmap_area()
334 tmp = rb_prev(&va->rb_node); in __insert_vmap_area()
[all …]
|
| D | mmap.c | 380 struct rb_node *nd, *pn = NULL; in browse_rb()
424 struct rb_node *nd; in validate_mm_rb()
555 struct rb_node ***rb_link, struct rb_node **rb_parent) in find_vma_links()
557 struct rb_node **__rb_link, *__rb_parent, *rb_prev; in find_vma_links()
559 __rb_link = &mm->mm_rb.rb_node; in find_vma_links()
616 struct rb_node **rb_link, struct rb_node *rb_parent) in __vma_link_rb()
660 struct vm_area_struct *prev, struct rb_node **rb_link, in __vma_link()
661 struct rb_node *rb_parent) in __vma_link()
668 struct vm_area_struct *prev, struct rb_node **rb_link, in vma_link()
669 struct rb_node *rb_parent) in vma_link()
[all …]
|
| D | kmemleak.c | 146 struct rb_node rb_node; member
407 struct rb_node *rb = object_tree_root.rb_node; in lookup_object()
411 rb_entry(rb, struct kmemleak_object, rb_node); in lookup_object()
413 rb = object->rb_node.rb_left; in lookup_object()
415 rb = object->rb_node.rb_right; in lookup_object()
525 struct rb_node **link, *rb_parent; in create_object()
572 link = &object_tree_root.rb_node; in create_object()
576 parent = rb_entry(rb_parent, struct kmemleak_object, rb_node); in create_object()
578 link = &parent->rb_node.rb_left; in create_object()
580 link = &parent->rb_node.rb_right; in create_object()
[all …]
|
| D | ksm.c | 136 struct rb_node node; /* when node of stable tree */
173 struct rb_node node; /* when node of unstable tree */
748 while (root_stable_tree[nid].rb_node) { in remove_all_stable_nodes()
749 stable_node = rb_entry(root_stable_tree[nid].rb_node, in remove_all_stable_nodes()
1155 struct rb_node **new; in stable_tree_search()
1156 struct rb_node *parent; in stable_tree_search()
1170 new = &root->rb_node; in stable_tree_search()
1256 struct rb_node **new; in stable_tree_insert()
1257 struct rb_node *parent = NULL; in stable_tree_insert()
1263 new = &root->rb_node; in stable_tree_insert()
[all …]
|
| D | zswap.c | 180 struct rb_node rbnode;
240 struct rb_node *node = root->rb_node; in zswap_rb_search()
262 struct rb_node **link = &root->rb_node, *parent = NULL; in zswap_rb_insert()
|
| D | nommu.c | 590 struct rb_node *p, *lastp; in validate_nommu_regions()
623 struct rb_node **p, *parent; in add_nommu_region()
628 p = &nommu_region_tree.rb_node; in add_nommu_region()
653 BUG_ON(!nommu_region_tree.rb_node); in delete_nommu_region()
688 BUG_ON(!nommu_region_tree.rb_node); in __put_nommu_region()
745 struct rb_node **p, *parent, *rb_prev; in add_vma_to_mm()
769 p = &mm->mm_rb.rb_node; in add_vma_to_mm()
1284 struct rb_node *rb; in do_mmap_pgoff()
|
| /linux-4.1.27/kernel/power/ |
| D | wakelock.c | 27 struct rb_node node;
38 struct rb_node *node; in pm_show_wakelocks()
140 struct rb_node **node = &wakelocks_tree.rb_node; in wakelock_lookup_add()
141 struct rb_node *parent = *node; in wakelock_lookup_add()
|
| D | swap.c | 115 struct rb_node node;
124 struct rb_node **new = &(swsusp_extents.rb_node); in swsusp_extents_insert()
125 struct rb_node *parent = NULL; in swsusp_extents_insert()
190 struct rb_node *node; in free_all_swap_pages()
192 while ((node = swsusp_extents.rb_node)) { in free_all_swap_pages()
207 return (swsusp_extents.rb_node != NULL); in swsusp_swap_in_use()
|
| /linux-4.1.27/drivers/mtd/ubi/ |
| D | fastmap-wl.c | 37 struct rb_node *p; in find_anchor_wl_entry()
71 struct rb_node *p; in anchor_pebs_avalible()
94 if (!ubi->free.rb_node || (ubi->free_count - ubi->beb_rsvd_pebs < 1)) in ubi_wl_get_fm_peb()
137 if (!ubi->free.rb_node) in ubi_refill_pools()
150 if (!ubi->free.rb_node || in ubi_refill_pools()
358 e = rb_entry(rb_next(root->rb_node), in may_reserve_for_fm()
|
| D | wl.c | 154 struct rb_node **p, *parent = NULL; in wl_tree_add()
156 p = &root->rb_node; in wl_tree_add()
251 struct rb_node *p; in in_wl_tree()
253 p = root->rb_node; in in_wl_tree()
313 struct rb_node *p; in find_wl_entry()
320 p = root->rb_node; in find_wl_entry()
362 e = rb_entry(root->rb_node, struct ubi_wl_entry, u.rb); in find_mean_wl_entry()
669 if (!ubi->free.rb_node ||
670 (!ubi->used.rb_node && !ubi->scrub.rb_node)) {
682 !ubi->free.rb_node, !ubi->used.rb_node);
[all …]
|
| D | attach.c | 263 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL; in add_volume()
456 struct rb_node **p, *parent = NULL; in ubi_add_to_av()
476 p = &av->root.rb_node; in ubi_add_to_av()
609 struct rb_node *p = ai->volumes.rb_node; in ubi_find_av()
633 struct rb_node *rb; in ubi_remove_av()
1140 struct rb_node *this = av->root.rb_node; in destroy_av()
1171 struct rb_node *rb; in destroy_ai()
1191 rb = ai->volumes.rb_node; in destroy_ai()
1232 struct rb_node *rb1, *rb2; in scan_all()
1508 struct rb_node *rb1, *rb2; in self_check_ai()
|
| D | fastmap.c | 187 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL; in add_vol()
234 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL; in assign_aeb_to_av()
236 p = &av->root.rb_node; in assign_aeb_to_av()
273 struct rb_node **p = &av->root.rb_node, *parent = NULL; in update_vol()
370 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL; in process_pool_aeb()
419 struct rb_node *node, *node2; in unmap_peb()
570 struct rb_node *rb1, *rb2; in count_fastmap_pebs()
1095 struct rb_node *tmp_rb; in ubi_write_fastmap()
|
| D | ubi.h | 178 struct rb_node rb;
200 struct rb_node rb;
655 struct rb_node rb;
690 struct rb_node rb;
|
| D | eba.c | 99 struct rb_node *p; in ltree_lookup()
101 p = ubi->ltree.rb_node; in ltree_lookup()
160 struct rb_node **p, *parent = NULL; in ltree_add_entry()
168 p = &ubi->ltree.rb_node; in ltree_add_entry()
1321 struct rb_node *rb; in self_check_eba()
1413 struct rb_node *rb; in ubi_eba_init()
|
| /linux-4.1.27/fs/afs/ |
| D | server.c | 35 struct rb_node **pp, *p; in afs_install_server()
43 pp = &afs_servers.rb_node; in afs_install_server()
184 struct rb_node *p; in afs_find_server()
191 p = afs_servers.rb_node; in afs_find_server()
258 ASSERTCMP(server->fs_vnodes.rb_node, ==, NULL); in afs_destroy_server()
259 ASSERTCMP(server->cb_promises.rb_node, ==, NULL); in afs_destroy_server()
|
| D | callback.c | 48 vnode = rb_entry(server->cb_promises.rb_node, in afs_init_callback_state()
147 struct rb_node *p; in afs_break_one_callback()
151 p = server->fs_vnodes.rb_node; in afs_break_one_callback()
253 ASSERT(server->cb_promises.rb_node != NULL); in afs_do_give_up_callback()
277 ASSERT(server->cb_promises.rb_node != NULL); in afs_discard_callback_on_delete()
|
| D | vnode.c | 20 static noinline bool dump_tree_aux(struct rb_node *node, struct rb_node *parent,
51 if (dump_tree_aux(server->cb_promises.rb_node, NULL, 0, '-'))
64 struct rb_node *parent, **p; in afs_install_vnode()
82 p = &server->fs_vnodes.rb_node; in afs_install_vnode()
118 struct rb_node *parent, **p; in afs_vnode_note_promise()
153 p = &server->cb_promises.rb_node; in afs_vnode_note_promise()
|
| /linux-4.1.27/fs/ubifs/ |
| D | log.c | 44 struct rb_node *p; in ubifs_search_bud()
48 p = c->buds.rb_node; in ubifs_search_bud()
73 struct rb_node *p; in ubifs_get_wbuf()
81 p = c->buds.rb_node; in ubifs_get_wbuf()
126 struct rb_node **p, *parent = NULL; in ubifs_add_bud()
131 p = &c->buds.rb_node; in ubifs_add_bud()
302 struct rb_node *p; in remove_buds()
309 struct rb_node *p1 = p; in remove_buds()
540 struct rb_node rb;
554 struct rb_node **p = &done_tree->rb_node, *parent = NULL; in done_already()
|
| D | orphan.c | 68 struct rb_node **p, *parent = NULL; in ubifs_add_orphan()
82 p = &c->orph_tree.rb_node; in ubifs_add_orphan()
118 struct rb_node *p; in ubifs_delete_orphan()
121 p = c->orph_tree.rb_node; in ubifs_delete_orphan()
515 struct rb_node **p, *parent = NULL; in insert_dead_orphan()
522 p = &c->orph_tree.rb_node; in insert_dead_orphan()
734 struct rb_node rb;
750 struct rb_node *p; in dbg_find_orphan()
753 p = c->orph_tree.rb_node; in dbg_find_orphan()
772 struct rb_node **p, *parent = NULL; in dbg_ins_check_orphan()
[all …]
|
| D | recovery.c | 1242 struct rb_node rb;
1261 struct rb_node **p = &c->size_tree.rb_node, *parent = NULL; in add_ino()
1295 struct rb_node *p = c->size_tree.rb_node; in find_ino()
1477 struct rb_node *this = rb_first(&c->size_tree); in ubifs_recover_size()
|
| /linux-4.1.27/net/core/ |
| D | gen_estimator.c | 93 struct rb_node node;
152 struct rb_node **p = &est_root.rb_node, *parent = NULL; in gen_add_node()
173 struct rb_node *p = est_root.rb_node; in gen_find_node()
|
| /linux-4.1.27/fs/proc/ |
| D | nommu.c | 80 struct rb_node *p = _p; in nommu_region_list_show()
87 struct rb_node *p; in nommu_region_list_start()
106 return rb_next((struct rb_node *) v); in nommu_region_list_next()
|
| D | task_nommu.c | 22 struct rb_node *p; in task_mem()
83 struct rb_node *p; in task_vsize()
101 struct rb_node *p; in task_statm()
210 struct rb_node *p = _p; in show_map()
230 struct rb_node *p; in m_start()
269 struct rb_node *p = _p; in m_next()
|
| D | generic.c | 57 struct rb_node *node = dir->subdir.rb_node; in pde_subdir_find()
79 struct rb_node **new = &root->rb_node, *parent = NULL; in pde_subdir_insert()
|
| D | proc_sysctl.c | 107 struct rb_node *node = dir->root.rb_node; in find_entry()
135 struct rb_node *node = &head->node[entry - head->ctl_table].node; in insert_entry()
136 struct rb_node **p = &head->parent->root.rb_node; in insert_entry()
137 struct rb_node *parent = NULL; in insert_entry()
174 struct rb_node *node = &head->node[entry - head->ctl_table].node; in erase_entry()
347 static struct ctl_node *first_usable_entry(struct rb_node *node) in first_usable_entry()
|
| /linux-4.1.27/tools/lib/lockdep/ |
| D | preload.c | 31 struct rb_node node;
99 static struct rb_node **__get_lock_node(void *lock, struct rb_node **parent) in __get_lock_node()
101 struct rb_node **node = &locks.rb_node; in __get_lock_node()
177 struct rb_node **node, *parent; in __get_lock()
|
| /linux-4.1.27/fs/nfs/blocklayout/ |
| D | extent_tree.c | 12 ext_node(struct rb_node *node) in ext_node()
20 struct rb_node *node = rb_first(root); in ext_tree_first()
27 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
34 struct rb_node *node = rb_next(&be->be_node); in ext_tree_next()
47 struct rb_node *node = root->rb_node; in __ext_tree_search()
128 struct rb_node **p = &root->rb_node, *parent = NULL; in __ext_tree_insert()
314 struct rb_node *node; in __ext_tree_lookup()
317 node = root->rb_node; in __ext_tree_lookup()
|
| /linux-4.1.27/drivers/infiniband/ulp/ipoib/ |
| D | ipoib_multicast.c | 159 struct rb_node *n = priv->multicast_tree.rb_node; in __ipoib_mcast_find()
165 mcast = rb_entry(n, struct ipoib_mcast, rb_node); in __ipoib_mcast_find()
183 struct rb_node **n = &priv->multicast_tree.rb_node, *pn = NULL; in __ipoib_mcast_add()
190 tmcast = rb_entry(pn, struct ipoib_mcast, rb_node); in __ipoib_mcast_add()
202 rb_link_node(&mcast->rb_node, pn, n); in __ipoib_mcast_add()
203 rb_insert_color(&mcast->rb_node, &priv->multicast_tree); in __ipoib_mcast_add()
767 rb_erase(&mcast->rb_node, &priv->multicast_tree); in ipoib_mcast_dev_flush()
772 rb_erase(&priv->broadcast->rb_node, &priv->multicast_tree); in ipoib_mcast_dev_flush()
877 rb_replace_node(&mcast->rb_node, in ipoib_mcast_restart_task()
878 &nmcast->rb_node, in ipoib_mcast_restart_task()
[all …]
|
| D | ipoib_main.c | 259 struct rb_node *n = priv->path_tree.rb_node; in __path_find()
264 path = rb_entry(n, struct ipoib_path, rb_node); in __path_find()
283 struct rb_node **n = &priv->path_tree.rb_node; in __path_add()
284 struct rb_node *pn = NULL; in __path_add()
290 tpath = rb_entry(pn, struct ipoib_path, rb_node); in __path_add()
302 rb_link_node(&path->rb_node, pn, n); in __path_add()
303 rb_insert_color(&path->rb_node, &priv->path_tree); in __path_add()
352 struct rb_node *n; in ipoib_path_iter_next()
361 path = rb_entry(n, struct ipoib_path, rb_node); in ipoib_path_iter_next()
416 rb_erase(&path->rb_node, &priv->path_tree); in ipoib_flush_paths()
|
| D | ipoib.h | 151 struct rb_node rb_node; member
416 struct rb_node rb_node; member
|
| /linux-4.1.27/kernel/events/ |
| D | uprobes.c | 66 struct rb_node rb_node; /* node in the rb tree */ member
389 struct rb_node *n = uprobes_tree.rb_node; in __find_uprobe()
394 uprobe = rb_entry(n, struct uprobe, rb_node); in __find_uprobe()
426 struct rb_node **p = &uprobes_tree.rb_node; in __insert_uprobe()
427 struct rb_node *parent = NULL; in __insert_uprobe()
433 u = rb_entry(parent, struct uprobe, rb_node); in __insert_uprobe()
448 rb_link_node(&uprobe->rb_node, parent, p); in __insert_uprobe()
449 rb_insert_color(&uprobe->rb_node, &uprobes_tree); in __insert_uprobe()
683 return !RB_EMPTY_NODE(&uprobe->rb_node); in uprobe_is_active()
696 rb_erase(&uprobe->rb_node, &uprobes_tree); in delete_uprobe()
[all …]
|
| /linux-4.1.27/net/6lowpan/ |
| D | nhc.c | 26 struct rb_node **new = &rb_root.rb_node, *parent = NULL; in lowpan_nhc_insert()
68 struct rb_node *node = rb_root.rb_node; in lowpan_nhc_by_nhcid()
|
| D | nhc.h | 69 struct rb_node node;
|
| /linux-4.1.27/kernel/trace/ |
| D | trace_stat.c | 26 struct rb_node node;
78 struct rb_node **new = &(root->rb_node), *parent = NULL; in insert_stat()
175 struct rb_node *node; in stat_seq_start()
199 struct rb_node *node = p; in stat_seq_next()
|
| /linux-4.1.27/fs/ocfs2/ |
| D | reservations.c | 89 struct rb_node *node; in ocfs2_dump_resv()
148 struct rb_node *node; in ocfs2_check_resmap()
282 struct rb_node *node; in ocfs2_resmap_clear_all_resv()
318 struct rb_node *parent = NULL; in ocfs2_resv_insert()
319 struct rb_node **p = &root->rb_node; in ocfs2_resv_insert()
371 struct rb_node *node = resmap->m_reservations.rb_node; in ocfs2_find_resv_lhs()
477 struct rb_node *prev, *next; in __ocfs2_resv_find_window()
|
| D | uptodate.c | 66 struct rb_node c_node;
148 struct rb_node *node; in ocfs2_purge_copied_metadata_tree()
226 struct rb_node * n = ci->ci_cache.ci_tree.rb_node; in ocfs2_search_cache_tree()
323 struct rb_node *parent = NULL; in __ocfs2_insert_cache_tree()
324 struct rb_node **p = &ci->ci_cache.ci_tree.rb_node; in __ocfs2_insert_cache_tree()
|
| D | reservations.h | 30 struct rb_node r_node;
|
| /linux-4.1.27/net/rxrpc/ |
| D | ar-connection.c | 76 struct rb_node *p, *parent, **pp; in rxrpc_get_bundle()
90 p = trans->bundles.rb_node; in rxrpc_get_bundle()
117 pp = &trans->bundles.rb_node; in rxrpc_get_bundle()
231 struct rb_node *parent, **p; in rxrpc_assign_connection_id()
248 p = &conn->trans->client_conns.rb_node; in rxrpc_assign_connection_id()
306 struct rb_node *parent, **p; in rxrpc_add_call_ID_to_conn()
312 p = &conn->calls.rb_node; in rxrpc_add_call_ID_to_conn()
627 struct rb_node *p, **pp; in rxrpc_incoming_connection()
642 p = trans->server_conns.rb_node; in rxrpc_incoming_connection()
683 pp = &trans->server_conns.rb_node; in rxrpc_incoming_connection()
[all …]
|
| D | ar-call.c | 323 struct rb_node *p, *parent, **pp; in rxrpc_get_client_call()
333 p = rx->calls.rb_node; in rxrpc_get_client_call()
363 pp = &rx->calls.rb_node; in rxrpc_get_client_call()
421 struct rb_node **p, *parent; in rxrpc_incoming_call()
486 p = &conn->calls.rb_node; in rxrpc_incoming_call()
578 struct rb_node *p; in rxrpc_find_server_call()
586 p = rx->calls.rb_node; in rxrpc_find_server_call()
783 struct rb_node *p; in rxrpc_release_calls_on_socket()
|
| D | ar-internal.h | 224 struct rb_node node; /* node in transport's lookup tree */
246 struct rb_node node; /* node in transport's lookup tree */
311 struct rb_node sock_node; /* node in socket call tree */
312 struct rb_node conn_node; /* node in connection call tree */
|
| /linux-4.1.27/net/sched/ |
| D | sch_fq.c | 66 struct rb_node fq_node; /* anchor in fq_root[] trees */
73 struct rb_node rate_node; /* anchor in q->delayed tree */
131 struct rb_node **p = &q->delayed.rb_node, *parent = NULL; in fq_flow_set_throttled()
181 struct rb_node **p, *parent; in fq_gc()
184 p = &root->rb_node; in fq_gc()
218 struct rb_node **p, *parent; in fq_classify()
249 p = &root->rb_node; in fq_classify()
406 struct rb_node *p; in fq_check_throttled()
520 struct rb_node *p; in fq_reset()
554 struct rb_node *op, **np, *parent; in fq_rehash()
[all …]
|
| D | sch_htb.c | 84 struct rb_node *ptr;
141 struct rb_node pq_node; /* node for event queue */
142 struct rb_node node[TC_HTB_NUMPRIO]; /* node for self or feed tree */
272 struct rb_node **p = &root->rb_node, *parent = NULL; in htb_add_to_id_tree()
298 struct rb_node **p = &q->hlevel[cl->level].wait_pq.rb_node, *parent = NULL; in htb_add_to_wait_tree()
327 static inline void htb_next_rb_node(struct rb_node **n) in htb_next_rb_node()
350 static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root) in htb_safe_rb_erase()
382 if (!hprio->row.rb_node) in htb_remove_class_from_row()
406 if (p->un.inner.clprio[prio].feed.rb_node) in htb_activate_prios()
454 if (!p->un.inner.clprio[prio].feed.rb_node) in htb_deactivate_prios()
[all …]
|
| D | sch_hfsc.c | 128 struct rb_node el_node; /* qdisc's eligible tree member */
130 struct rb_node vt_node; /* parent's vt_tree member */
132 struct rb_node cf_node; /* parent's cf_heap member */
196 struct rb_node **p = &cl->sched->eligible.rb_node; in eltree_insert()
197 struct rb_node *parent = NULL; in eltree_insert()
230 struct rb_node *n; in eltree_get_mindl()
246 struct rb_node *n; in eltree_get_minel()
261 struct rb_node **p = &cl->cl_parent->vt_tree.rb_node; in vttree_insert()
262 struct rb_node *parent = NULL; in vttree_insert()
294 struct rb_node *n; in vttree_firstfit()
[all …]
|
| D | sch_netem.c | 153 static struct sk_buff *netem_rb_to_skb(struct rb_node *rb) in netem_rb_to_skb()
365 struct rb_node *p; in tfifo_reset()
381 struct rb_node **p = &q->t_root.rb_node, *parent = NULL; in tfifo_enqueue()
530 struct rb_node *p = rb_first(&q->t_root); in netem_drop()
555 struct rb_node *p; in netem_dequeue()
|
| /linux-4.1.27/drivers/xen/ |
| D | evtchn.c | 77 struct rb_node node;
85 struct rb_node **new = &(u->evtchns.rb_node), *parent = NULL; in add_evtchn()
116 struct rb_node *node = u->evtchns.rb_node; in find_evtchn()
525 struct rb_node *node; in evtchn_release()
527 while ((node = u->evtchns.rb_node)) { in evtchn_release()
|
| /linux-4.1.27/fs/nilfs2/ |
| D | the_nilfs.c | 721 struct rb_node *n; in nilfs_lookup_root()
725 n = nilfs->ns_cptree.rb_node; in nilfs_lookup_root()
727 root = rb_entry(n, struct nilfs_root, rb_node); in nilfs_lookup_root()
747 struct rb_node **p, *parent; in nilfs_find_or_create_root()
761 p = &nilfs->ns_cptree.rb_node; in nilfs_find_or_create_root()
766 root = rb_entry(parent, struct nilfs_root, rb_node); in nilfs_find_or_create_root()
787 rb_link_node(&new->rb_node, parent, p); in nilfs_find_or_create_root()
788 rb_insert_color(&new->rb_node, &nilfs->ns_cptree); in nilfs_find_or_create_root()
809 rb_erase(&root->rb_node, &nilfs->ns_cptree); in nilfs_put_root()
|
| D | the_nilfs.h | 253 struct rb_node rb_node; member
|
| /linux-4.1.27/drivers/staging/android/ion/ |
| D | ion.c | 84 struct rb_node node;
113 struct rb_node node;
153 struct rb_node **p = &dev->buffers.rb_node; in ion_buffer_add()
154 struct rb_node *parent = NULL; in ion_buffer_add()
405 struct rb_node *n = client->handles.rb_node; in ion_handle_lookup()
444 struct rb_node **p = &client->handles.rb_node; in ion_handle_add()
445 struct rb_node *parent = NULL; in ion_handle_add()
683 struct rb_node *n; in ion_debug_client_show()
725 struct rb_node *node; in ion_get_client_serial()
743 struct rb_node **p; in ion_client_create()
[all …]
|
| /linux-4.1.27/kernel/locking/ |
| D | rtmutex_common.h | 48 struct rb_node tree_entry;
49 struct rb_node pi_tree_entry;
|
| D | rtmutex.c | 169 struct rb_node **link = &lock->waiters.rb_node; in rt_mutex_enqueue()
170 struct rb_node *parent = NULL; in rt_mutex_enqueue()
208 struct rb_node **link = &task->pi_waiters.rb_node; in rt_mutex_enqueue_pi()
209 struct rb_node *parent = NULL; in rt_mutex_enqueue_pi()
|
| /linux-4.1.27/drivers/char/ |
| D | mmtimer.c | 237 struct rb_node list;
245 struct rb_node *next;
264 struct rb_node **link = &timers[nodeid].timer_head.rb_node; in mmtimer_add_list()
265 struct rb_node *parent = NULL; in mmtimer_add_list()
618 struct rb_node *n = timers[nodeid].timer_head.rb_node; in sgi_timer_del()
684 struct rb_node *n; in sgi_timer_set()
|
| /linux-4.1.27/fs/f2fs/ |
| D | data.c | 366 struct rb_node *parent, struct rb_node **p) in __attach_extent_node()
377 rb_link_node(&en->rb_node, parent, p); in __attach_extent_node()
378 rb_insert_color(&en->rb_node, &et->root); in __attach_extent_node()
387 rb_erase(&en->rb_node, &et->root); in __detach_extent_node()
441 struct rb_node *node = et->root.rb_node; in __lookup_extent_tree()
452 en = rb_entry(node, struct extent_node, rb_node); in __lookup_extent_tree()
470 struct rb_node *node; in __try_back_merge()
472 node = rb_prev(&en->rb_node); in __try_back_merge()
476 prev = rb_entry(node, struct extent_node, rb_node); in __try_back_merge()
491 struct rb_node *node; in __try_front_merge()
[all …]
|
| /linux-4.1.27/fs/overlayfs/ |
| D | readdir.c | 25 struct rb_node node;
57 static struct ovl_cache_entry *ovl_cache_entry_from_node(struct rb_node *n) in ovl_cache_entry_from_node()
65 struct rb_node *node = root->rb_node; in ovl_cache_entry_find()
112 struct rb_node **newp = &rdd->root.rb_node; in ovl_cache_entry_add_rb()
113 struct rb_node *parent = NULL; in ovl_cache_entry_add_rb()
|
| /linux-4.1.27/fs/kernfs/ |
| D | dir.c | 236 struct rb_node **node = &kn->parent->dir.children.rb_node; in kernfs_link_sibling()
237 struct rb_node *parent = NULL; in kernfs_link_sibling()
645 struct rb_node *node = parent->dir.children.rb_node; in kernfs_find_ns()
943 struct rb_node *rbn; in kernfs_leftmost_descendant()
972 struct rb_node *rbn; in kernfs_next_descendant_post()
1370 struct rb_node *node = parent->dir.children.rb_node; in kernfs_dir_pos()
1384 struct rb_node *node = rb_next(&pos->rb); in kernfs_dir_pos()
1399 struct rb_node *node = rb_next(&pos->rb); in kernfs_dir_next_pos()
|
| /linux-4.1.27/fs/ceph/ |
| D | inode.c | 119 struct rb_node **p; in __get_or_create_frag()
120 struct rb_node *parent = NULL; in __get_or_create_frag()
124 p = &ci->i_fragtree.rb_node; in __get_or_create_frag()
162 struct rb_node *n = ci->i_fragtree.rb_node; in __ceph_find_frag()
309 struct rb_node *rb_node; in ceph_fill_fragtree() local
322 rb_node = rb_first(&ci->i_fragtree); in ceph_fill_fragtree()
323 frag = rb_entry(rb_node, struct ceph_inode_frag, node); in ceph_fill_fragtree()
324 if (frag->frag != ceph_frag_make(0, 0) || rb_next(rb_node)) in ceph_fill_fragtree()
336 rb_node = rb_first(&ci->i_fragtree); in ceph_fill_fragtree()
340 while (rb_node) { in ceph_fill_fragtree()
[all …]
|
| D | xattr.c | 344 struct rb_node **p; in __set_xattr()
345 struct rb_node *parent = NULL; in __set_xattr()
350 p = &ci->i_xattrs.index.rb_node; in __set_xattr()
437 struct rb_node **p; in __get_xattr()
438 struct rb_node *parent = NULL; in __get_xattr()
443 p = &ci->i_xattrs.index.rb_node; in __get_xattr()
502 struct rb_node **p; in __remove_xattr_by_name()
506 p = &ci->i_xattrs.index.rb_node; in __remove_xattr_by_name()
515 struct rb_node *p; in __copy_xattr_names()
538 struct rb_node *p, *tmp; in __ceph_destroy_xattrs()
[all …]
|
| D | snap.c | 83 struct rb_node **p = &root->rb_node; in __insert_snap_realm()
84 struct rb_node *parent = NULL; in __insert_snap_realm()
138 struct rb_node *n = mdsc->snap_realms.rb_node; in __lookup_snap_realm()
|
| /linux-4.1.27/include/drm/ |
| D | drm_vma_manager.h | 35 struct rb_node vm_rb;
43 struct rb_node vm_rb;
|
| /linux-4.1.27/net/rds/ |
| D | cong.c | 107 struct rb_node **p = &rds_cong_tree.rb_node; in rds_cong_tree_walk()
108 struct rb_node *parent = NULL; in rds_cong_tree_walk()
393 struct rb_node *node; in rds_cong_exit()
|
| /linux-4.1.27/drivers/infiniband/hw/mlx4/ |
| D | cm.c | 45 struct rb_node node;
147 struct rb_node *node = sl_id_map->rb_node; in id_map_find_by_sl_id()
213 struct rb_node **link = &sl_id_map->rb_node, *parent = NULL; in sl_id_map_add()
418 struct rb_node *nd; in mlx4_ib_cm_paravirt_clean()
|
| D | mcg.c | 99 struct rb_node node;
161 struct rb_node *node = ctx->mcg_table.rb_node; in mcast_find()
182 struct rb_node **link = &ctx->mcg_table.rb_node; in mcast_insert()
183 struct rb_node *parent = NULL; in mcast_insert()
1075 struct rb_node *p; in _mlx4_ib_mcg_port_cleanup()
1229 struct rb_node *p; in clean_vf_mcast()
|
| /linux-4.1.27/tools/perf/ui/gtk/ |
| D | hists.c | 95 struct rb_node *nd; in perf_gtk__add_callchain()
106 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain()
165 struct rb_node *nd; in perf_gtk__show_hists()
224 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in perf_gtk__show_hists()
|
| /linux-4.1.27/fs/fscache/ |
| D | object-list.c | 51 struct rb_node **p = &fscache_object_list.rb_node, *parent = NULL; in fscache_objlist_add()
97 struct rb_node *p; in fscache_objlist_lookup()
112 p = fscache_object_list.rb_node; in fscache_objlist_lookup()
|
| /linux-4.1.27/drivers/md/bcache/ |
| D | util.h | 488 struct rb_node **n = &(root)->rb_node, *parent = NULL; \
512 struct rb_node *n = (root)->rb_node; \
532 struct rb_node *n = (root)->rb_node; \
|
| /linux-4.1.27/fs/ext2/ |
| D | balloc.c | 202 struct rb_node *n; in __rsv_window_dump()
293 struct rb_node *n = root->rb_node; in search_reserve_window()
333 struct rb_node *node = &rsv->rsv_node; in ext2_rsv_window_add()
336 struct rb_node ** p = &root->rb_node; in ext2_rsv_window_add()
337 struct rb_node * parent = NULL; in ext2_rsv_window_add()
783 struct rb_node *next; in find_next_reservable_window()
1044 struct rb_node *next; in try_to_extend_reservation()
|
| /linux-4.1.27/ipc/ |
| D | mqueue.c | 54 struct rb_node rb_node; member
123 struct rb_node **p, *parent = NULL; in msg_insert()
126 p = &info->msg_tree.rb_node; in msg_insert()
129 leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node); in msg_insert()
148 rb_link_node(&leaf->rb_node, parent, p); in msg_insert()
149 rb_insert_color(&leaf->rb_node, &info->msg_tree); in msg_insert()
159 struct rb_node **p, *parent = NULL; in msg_get()
164 p = &info->msg_tree.rb_node; in msg_get()
183 leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node); in msg_get()
188 rb_erase(&leaf->rb_node, &info->msg_tree); in msg_get()
[all …]
|
| /linux-4.1.27/fs/jffs2/ |
| D | readinode.c | 177 struct rb_node *next; in jffs2_lookup_tn()
182 next = tn_root->rb_node; in jffs2_lookup_tn()
338 struct rb_node *parent; in jffs2_add_tn_to_tree()
339 struct rb_node **link = &rii->tn_root.rb_node; in jffs2_add_tn_to_tree()
402 static void eat_last(struct rb_root *root, struct rb_node *node) in eat_last()
404 struct rb_node *parent = rb_parent(node); in eat_last()
405 struct rb_node **link; in eat_last()
411 link = &root->rb_node; in eat_last()
426 struct rb_node **link = &ver_root->rb_node; in ver_insert()
427 struct rb_node *parent = NULL; in ver_insert()
|
| D | nodelist.c | 124 struct rb_node *parent = &base->rb; in jffs2_fragtree_insert()
125 struct rb_node **link = &parent; in jffs2_fragtree_insert()
193 rb_link_node(&holefrag->rb, NULL, &root->rb_node); in no_overlapping_node()
207 rb_link_node(&newfrag->rb, NULL, &root->rb_node); in no_overlapping_node()
528 struct rb_node *next; in jffs2_lookup_node_frag()
534 next = fragtree->rb_node; in jffs2_lookup_node_frag()
|
| D | nodelist.h | 230 struct rb_node rb;
271 struct rb_node rb;
329 struct rb_node *node = rb_first(root); in frag_first()
339 struct rb_node *node = rb_last(root); in frag_last()
|
| /linux-4.1.27/drivers/vfio/ |
| D | vfio_iommu_type1.c | 73 struct rb_node node;
93 struct rb_node *node = iommu->dma_list.rb_node; in vfio_find_dma()
111 struct rb_node **link = &iommu->dma_list.rb_node, *parent = NULL; in vfio_link_dma()
645 struct rb_node *n; in vfio_iommu_replay()
843 struct rb_node *node; in vfio_iommu_unmap_unpin_all()
|
| /linux-4.1.27/net/ceph/ |
| D | debugfs.c | 58 struct rb_node *n; in osdmap_show()
114 struct rb_node *rp; in monc_show()
145 struct rb_node *p; in osdc_show()
|
| D | auth_x.h | 15 struct rb_node node;
|
| D | osd_client.c | 822 struct rb_node **p = &osdc->requests.rb_node; in __insert_request()
823 struct rb_node *parent = NULL; in __insert_request()
845 struct rb_node *n = osdc->requests.rb_node; in __lookup_request()
864 struct rb_node *n = osdc->requests.rb_node; in __lookup_request_ge()
1162 struct rb_node **p = &osdc->osds.rb_node; in __insert_osd()
1163 struct rb_node *parent = NULL; in __insert_osd()
1185 struct rb_node *n = osdc->osds.rb_node; in __lookup_osd()
1935 struct rb_node *p, *n; in reset_changed_osds()
1961 struct rb_node *p; in kick_requests()
2219 struct rb_node **p = &osdc->event_tree.rb_node; in __insert_event()
[all …]
|
| D | osdmap.c | 394 struct rb_node **p = &root->rb_node; in __insert_pg_mapping()
395 struct rb_node *parent = NULL; in __insert_pg_mapping()
420 struct rb_node *n = root->rb_node; in __lookup_pg_mapping()
460 struct rb_node **p = &root->rb_node; in __insert_pg_pool()
461 struct rb_node *parent = NULL; in __insert_pg_pool()
483 struct rb_node *n = root->rb_node; in __lookup_pg_pool()
520 struct rb_node *rbp; in ceph_pg_poolid_by_name()
|
| D | mon_client.c | 419 struct rb_node *n = monc->generic_request_tree.rb_node; in __lookup_generic_req()
436 struct rb_node **p = &monc->generic_request_tree.rb_node; in __insert_generic_request()
437 struct rb_node *parent = NULL; in __insert_generic_request()
713 struct rb_node *p; in __resend_generic_request()
|
| /linux-4.1.27/include/linux/ceph/ |
| D | osdmap.h | 30 struct rb_node node;
73 struct rb_node node;
|
| D | osd_client.h | 34 struct rb_node o_node;
123 struct rb_node r_node;
189 struct rb_node node;
|
| D | mon_client.h | 50 struct rb_node node;
|
| /linux-4.1.27/net/netfilter/ipset/ |
| D | ip_set_hash_netiface.c | 43 struct rb_node node;
63 struct rb_node *n = root->rb_node; in iface_test()
84 struct rb_node **n = &(root->rb_node), *p = NULL; in iface_add()
|
| /linux-4.1.27/fs/cachefiles/ |
| D | namei.c | 103 struct rb_node *p; in cachefiles_mark_object_buried()
109 p = cache->active_nodes.rb_node; in cachefiles_mark_object_buried()
150 struct rb_node **_p, *_parent = NULL; in cachefiles_mark_object_active()
165 _p = &cache->active_nodes.rb_node; in cachefiles_mark_object_active()
821 struct rb_node *_n; in cachefiles_check_active()
854 _n = cache->active_nodes.rb_node; in cachefiles_check_active()
|
| /linux-4.1.27/drivers/infiniband/core/ |
| D | multicast.c | 98 struct rb_node node;
133 struct rb_node *node = port->table.rb_node; in mcast_find()
155 struct rb_node **link = &port->table.rb_node; in mcast_insert()
156 struct rb_node *parent = NULL; in mcast_insert()
758 struct rb_node *node; in mcast_groups_event()
|
| /linux-4.1.27/drivers/infiniband/hw/usnic/ |
| D | usnic_uiom_interval_tree.h | 25 struct rb_node rb;
|
| /linux-4.1.27/arch/sh/include/asm/ |
| D | dwarf.h | 252 struct rb_node node;
270 struct rb_node node;
|
| /linux-4.1.27/fs/ocfs2/cluster/ |
| D | nodemanager.h | 50 struct rb_node nd_ip_node;
|
| D | nodemanager.c | 79 struct rb_node ***ret_p, in o2nm_node_ip_tree_lookup()
80 struct rb_node **ret_parent) in o2nm_node_ip_tree_lookup()
82 struct rb_node **p = &cluster->cl_node_ip_tree.rb_node; in o2nm_node_ip_tree_lookup()
83 struct rb_node *parent = NULL; in o2nm_node_ip_tree_lookup()
266 struct rb_node **p, *parent; in o2nm_node_ipv4_address_write()
|
| D | tcp_internal.h | 194 struct rb_node nh_node;
|
| /linux-4.1.27/fs/nfs/ |
| D | dir.c | 2135 rb_erase(&cache->rb_node, &nfsi->access_cache); in nfs_do_access_cache_scan()
2191 struct rb_node *n; in __nfs_access_zap_cache()
2196 entry = rb_entry(n, struct nfs_access_entry, rb_node); in __nfs_access_zap_cache()
2224 struct rb_node *n = NFS_I(inode)->access_cache.rb_node; in nfs_access_search_rbtree()
2228 entry = rb_entry(n, struct nfs_access_entry, rb_node); in nfs_access_search_rbtree()
2264 rb_erase(&cache->rb_node, &nfsi->access_cache); in nfs_access_get_cached()
2311 struct rb_node **p = &root_node->rb_node; in nfs_access_add_rbtree()
2312 struct rb_node *parent = NULL; in nfs_access_add_rbtree()
2318 entry = rb_entry(parent, struct nfs_access_entry, rb_node); in nfs_access_add_rbtree()
2327 rb_link_node(&set->rb_node, parent, p); in nfs_access_add_rbtree()
[all …]
|
| D | nfs4state.c | 175 struct rb_node *pos; in nfs4_get_renew_cred_server_locked()
389 struct rb_node **p = &server->state_owners.rb_node, in nfs4_find_state_owner_locked()
415 struct rb_node **p = &server->state_owners.rb_node, in nfs4_insert_state_owner_locked()
500 struct rb_node *rb_node = &sp->so_server_node; in nfs4_drop_state_owner() local
502 if (!RB_EMPTY_NODE(rb_node)) { in nfs4_drop_state_owner()
507 if (!RB_EMPTY_NODE(rb_node)) { in nfs4_drop_state_owner()
508 rb_erase(rb_node, &server->state_owners); in nfs4_drop_state_owner()
509 RB_CLEAR_NODE(rb_node); in nfs4_drop_state_owner()
1556 struct rb_node *pos; in nfs4_reset_seqids()
1606 struct rb_node *pos; in nfs4_clear_reclaim_server()
[all …]
|
| /linux-4.1.27/net/802/ |
| D | garp.c | 153 struct rb_node *parent = app->gid.rb_node; in garp_attr_lookup()
173 struct rb_node *parent = NULL, **p = &app->gid.rb_node; in garp_attr_create()
385 struct rb_node *node, *next; in garp_gid_event()
|
| D | mrp.c | 242 struct rb_node *parent = app->mad.rb_node; in mrp_attr_lookup()
262 struct rb_node *parent = NULL, **p = &app->mad.rb_node; in mrp_attr_create()
571 struct rb_node *node, *next; in mrp_mad_event()
|
| /linux-4.1.27/drivers/mtd/ |
| D | mtdswap.c | 83 struct rb_node rb;
176 #define TREE_EMPTY(d, name) (TREE_ROOT(d, name)->rb_node == NULL)
220 struct rb_node **p, *parent = NULL; in __mtdswap_rb_add()
223 p = &root->rb_node; in __mtdswap_rb_add()
251 static struct rb_node *mtdswap_rb_index(struct rb_root *root, unsigned int idx) in mtdswap_rb_index()
253 struct rb_node *p; in mtdswap_rb_index()
434 struct rb_node *medrb; in mtdswap_check_counts()
816 if (d->trees[idx].root.rb_node != NULL) in __mtdswap_choose_gc_tree()
859 if (root->rb_node == NULL) in mtdswap_choose_wl_tree()
1236 if (root->rb_node) { in mtdswap_show()
|
| /linux-4.1.27/fs/ext3/ |
| D | balloc.c | 210 struct rb_node *n; in __rsv_window_dump()
301 struct rb_node *n = root->rb_node; in search_reserve_window()
341 struct rb_node *node = &rsv->rsv_node; in ext3_rsv_window_add()
344 struct rb_node ** p = &root->rb_node; in ext3_rsv_window_add()
345 struct rb_node * parent = NULL; in ext3_rsv_window_add()
997 struct rb_node *next; in find_next_reservable_window()
1264 struct rb_node *next; in try_to_extend_reservation()
|
| D | dir.c | 298 struct rb_node rb_hash;
350 struct rb_node **p, *parent = NULL; in ext3_htree_store_dirent()
356 p = &info->root.rb_node; in ext3_htree_store_dirent()
|
| /linux-4.1.27/fs/ |
| D | eventpoll.c | 139 struct rb_node rbn;
736 struct rb_node *rbp; in ep_free()
876 struct rb_node *rbp; in ep_show_fdinfo()
973 struct rb_node *rbp; in ep_find()
978 for (rbp = ep->rbr.rb_node; rbp; ) { in ep_find()
1110 struct rb_node **p = &ep->rbr.rb_node, *parent = NULL; in ep_rbtree_insert()
1685 struct rb_node *rbp; in ep_loop_check_proc()
|
| /linux-4.1.27/drivers/block/ |
| D | pktcdvd.c | 624 struct rb_node *n = rb_next(&node->rb_node); in pkt_rbtree_next()
627 return rb_entry(n, struct pkt_rb_node, rb_node); in pkt_rbtree_next()
632 rb_erase(&node->rb_node, &pd->bio_queue); in pkt_rbtree_erase()
643 struct rb_node *n = pd->bio_queue.rb_node; in pkt_rbtree_find()
644 struct rb_node *next; in pkt_rbtree_find()
653 tmp = rb_entry(n, struct pkt_rb_node, rb_node); in pkt_rbtree_find()
677 struct rb_node **p = &pd->bio_queue.rb_node; in pkt_rbtree_insert()
678 struct rb_node *parent = NULL; in pkt_rbtree_insert()
684 tmp = rb_entry(parent, struct pkt_rb_node, rb_node); in pkt_rbtree_insert()
690 rb_link_node(&node->rb_node, parent, p); in pkt_rbtree_insert()
[all …]
|
| /linux-4.1.27/drivers/md/ |
| D | dm-bio-prison.h | 42 struct rb_node node;
|
| /linux-4.1.27/include/rdma/ |
| D | ib_umem_odp.h | 42 struct rb_node rb;
|
| /linux-4.1.27/drivers/staging/lustre/lustre/osc/ |
| D | osc_object.c | 89 osc->oo_root.rb_node = NULL; in osc_object_init()
116 LASSERT(osc->oo_root.rb_node == NULL); in osc_object_free()
|
| /linux-4.1.27/fs/gfs2/ |
| D | rgrp.c | 505 struct rb_node *n, *next; in gfs2_blk2rgrpd()
509 n = sdp->sd_rindex_tree.rb_node; in gfs2_blk2rgrpd()
543 const struct rb_node *n; in gfs2_rgrpd_get_first()
564 const struct rb_node *n; in gfs2_rgrpd_get_next()
708 struct rb_node *n; in return_all_reservations()
721 struct rb_node *n; in gfs2_clear_rgrpd()
866 struct rb_node **newn = &sdp->sd_rindex_tree.rb_node, *parent = NULL; in rgd_insert()
1441 struct rb_node **newn, *parent = NULL; in rs_insert()
1450 newn = &rgd->rd_rstree.rb_node; in rs_insert()
1544 struct rb_node *n; in gfs2_next_unreserved_block()
[all …]
|
| /linux-4.1.27/include/net/ |
| D | garp.h | 79 struct rb_node node;
|
| /linux-4.1.27/arch/arm/include/asm/xen/ |
| D | page.h | 42 if (phys_to_mach.rb_node != NULL) { in pfn_to_mfn()
|