Searched refs:rb_root (Results 1 - 200 of 238) sorted by relevance

12

/linux-4.1.27/include/linux/
H A Dinterval_tree.h14 interval_tree_insert(struct interval_tree_node *node, struct rb_root *root);
17 interval_tree_remove(struct interval_tree_node *node, struct rb_root *root);
20 interval_tree_iter_first(struct rb_root *root,
H A Drbtree.h42 struct rb_root { struct
49 #define RB_ROOT (struct rb_root) { NULL, }
61 extern void rb_insert_color(struct rb_node *, struct rb_root *);
62 extern void rb_erase(struct rb_node *, struct rb_root *);
68 extern struct rb_node *rb_first(const struct rb_root *);
69 extern struct rb_node *rb_last(const struct rb_root *);
72 extern struct rb_node *rb_first_postorder(const struct rb_root *);
77 struct rb_root *root);
94 * rbtree_postorder_for_each_entry_safe - iterate over rb_root in post order of
99 * @root: 'rb_root *' of the rbtree.
H A Dtimerqueue.h14 struct rb_root head;
H A Drbtree_augmented.h44 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
57 rb_insert_augmented(struct rb_node *node, struct rb_root *root, rb_insert_augmented()
122 struct rb_node *parent, struct rb_root *root) __rb_change_child()
133 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
137 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, __rb_erase_augmented()
234 rb_erase_augmented(struct rb_node *node, struct rb_root *root, rb_erase_augmented()
H A Delevator.h171 extern void elv_rb_add(struct rb_root *, struct request *);
172 extern void elv_rb_del(struct rb_root *, struct request *);
173 extern struct request *elv_rb_find(struct rb_root *, sector_t);
H A Drmap.h50 * NOTE: the LSB of the rb_root.rb_node is set by
52 * rb_root must only be read/written after taking the above lock
57 struct rb_root rb_root; /* Interval tree of private "related" vmas */ member in struct:anon_vma
H A Drtmutex.h31 struct rb_root waiters;
H A Diova.h29 struct rb_root rbroot; /* iova domain rbtree root */
H A Dinterval_tree_generic.h68 ITSTATIC void ITPREFIX ## _insert(ITSTRUCT *node, struct rb_root *root) \
90 ITSTATIC void ITPREFIX ## _remove(ITSTRUCT *node, struct rb_root *root) \
143 ITPREFIX ## _iter_first(struct rb_root *root, ITTYPE start, ITTYPE last) \
H A Dnfs_fs_sb.h192 struct rb_root state_owners;
H A Dpktcdvd.h184 struct rb_root bio_queue; /* Work queue of bios we need to handle */
H A Dsysctl.h147 struct rb_root root;
H A Dmempolicy.h124 struct rb_root root;
H A Dmm.h103 extern struct rb_root nommu_region_tree; set_max_mapnr()
1791 struct rb_root *root);
1794 struct rb_root *root);
1796 struct rb_root *root);
1797 struct vm_area_struct *vma_interval_tree_iter_first(struct rb_root *root,
1807 struct rb_root *root);
1809 struct rb_root *root);
1811 struct rb_root *root, unsigned long start, unsigned long last);
H A Dnfs_fs.h156 struct rb_root access_cache;
H A Dkernfs.h77 struct rb_root children;
H A Dmm_types.h343 struct rb_root mm_rb;
/linux-4.1.27/drivers/mtd/ubi/
H A Dwl.h4 static int anchor_pebs_avalible(struct rb_root *root);
6 static struct ubi_wl_entry *find_anchor_wl_entry(struct rb_root *root);
17 struct rb_root *root);
24 struct rb_root *root) { may_reserve_for_fm()
H A Dfastmap-wl.c35 static struct ubi_wl_entry *find_anchor_wl_entry(struct rb_root *root) find_anchor_wl_entry()
69 static int anchor_pebs_avalible(struct rb_root *root) anchor_pebs_avalible()
355 struct rb_root *root) { may_reserve_for_fm()
H A Dubi.h560 struct rb_root ltree;
577 struct rb_root used;
578 struct rb_root erroneous;
579 struct rb_root free;
581 struct rb_root scrub;
691 struct rb_root root;
725 struct rb_root volumes;
H A Dwl.c140 struct ubi_wl_entry *e, struct rb_root *root);
152 static void wl_tree_add(struct ubi_wl_entry *e, struct rb_root *root) wl_tree_add()
249 static int in_wl_tree(struct ubi_wl_entry *e, struct rb_root *root) in_wl_tree()
311 struct rb_root *root, int diff) find_wl_entry()
354 struct rb_root *root) find_mean_wl_entry()
1379 static void tree_destroy(struct ubi_device *ubi, struct rb_root *root) tree_destroy()
1714 struct ubi_wl_entry *e, struct rb_root *root) self_check_in_wl_tree()
/linux-4.1.27/drivers/block/drbd/
H A Ddrbd_interval.h28 extern bool drbd_insert_interval(struct rb_root *, struct drbd_interval *);
29 extern bool drbd_contains_interval(struct rb_root *, sector_t,
31 extern void drbd_remove_interval(struct rb_root *, struct drbd_interval *);
32 extern struct drbd_interval *drbd_find_overlap(struct rb_root *, sector_t,
H A Ddrbd_interval.c47 drbd_insert_interval(struct rb_root *root, struct drbd_interval *this) drbd_insert_interval()
90 drbd_contains_interval(struct rb_root *root, sector_t sector, drbd_contains_interval()
117 drbd_remove_interval(struct rb_root *root, struct drbd_interval *this) drbd_remove_interval()
134 drbd_find_overlap(struct rb_root *root, sector_t sector, unsigned int size) drbd_find_overlap()
H A Ddrbd_req.c84 static void drbd_remove_request_interval(struct rb_root *root, drbd_remove_request_interval()
125 struct rb_root *root; drbd_req_destroy()
/linux-4.1.27/drivers/infiniband/hw/usnic/
H A Dusnic_uiom_interval_tree.h36 struct rb_root *root);
39 struct rb_root *root);
41 usnic_uiom_interval_tree_iter_first(struct rb_root *root,
51 int usnic_uiom_insert_interval(struct rb_root *root,
59 void usnic_uiom_remove_interval(struct rb_root *root,
69 struct rb_root *root,
H A Dusnic_uiom.h43 struct rb_root rb_root; member in struct:usnic_uiom_pd
H A Dusnic_uiom_interval_tree.c88 find_intervals_intersection_sorted(struct rb_root *root, unsigned long start, find_intervals_intersection_sorted()
106 struct rb_root *root, usnic_uiom_get_intervals_diff()
163 int usnic_uiom_insert_interval(struct rb_root *root, unsigned long start, usnic_uiom_insert_interval()
234 void usnic_uiom_remove_interval(struct rb_root *root, unsigned long start, usnic_uiom_remove_interval()
H A Dusnic_uiom.c231 usnic_uiom_remove_interval(&pd->rb_root, vpn_start, __usnic_uiom_reg_release()
383 &pd->rb_root, usnic_uiom_reg_get()
399 err = usnic_uiom_insert_interval(&pd->rb_root, vpn_start, vpn_last, usnic_uiom_reg_get()
/linux-4.1.27/mm/
H A Dinterval_tree.c31 struct rb_root *root) vma_interval_tree_insert_after()
77 struct rb_root *root) anon_vma_interval_tree_insert()
87 struct rb_root *root) anon_vma_interval_tree_remove()
93 anon_vma_interval_tree_iter_first(struct rb_root *root, anon_vma_interval_tree_iter_first()
H A Dzswap.c197 struct rb_root rbroot;
238 static struct zswap_entry *zswap_rb_search(struct rb_root *root, pgoff_t offset) zswap_rb_search()
259 static int zswap_rb_insert(struct rb_root *root, struct zswap_entry *entry, zswap_rb_insert()
282 static void zswap_rb_erase(struct rb_root *root, struct zswap_entry *entry) zswap_rb_erase()
324 static struct zswap_entry *zswap_entry_find_get(struct rb_root *root, zswap_entry_find_get()
H A Drmap.c134 anon_vma_interval_tree_insert(avc, &anon_vma->rb_root); anon_vma_chain_link()
380 anon_vma_interval_tree_remove(avc, &anon_vma->rb_root); unlink_anon_vmas()
386 if (RB_EMPTY_ROOT(&anon_vma->rb_root)) { unlink_anon_vmas()
420 anon_vma->rb_root = RB_ROOT; anon_vma_ctor()
1477 anon_vma_interval_tree_foreach(avc, &anon_vma->rb_root, pgoff, pgoff) { rmap_walk_anon()
H A Dksm.c186 static struct rb_root one_stable_tree[1] = { RB_ROOT };
187 static struct rb_root one_unstable_tree[1] = { RB_ROOT };
188 static struct rb_root *root_stable_tree = one_stable_tree;
189 static struct rb_root *root_unstable_tree = one_unstable_tree;
1154 struct rb_root *root; stable_tree_search()
1255 struct rb_root *root; stable_tree_insert()
1327 struct rb_root *root; unstable_tree_search_insert()
1918 anon_vma_interval_tree_foreach(vmac, &anon_vma->rb_root, rmap_walk_ksm()
2204 struct rb_root *buf; merge_across_nodes_store()
H A Dmmap.c377 static int browse_rb(struct rb_root *root) browse_rb()
422 static void validate_mm_rb(struct rb_root *root, struct vm_area_struct *ignore) validate_mm_rb()
497 struct rb_root *root) vma_rb_insert()
505 static void vma_rb_erase(struct vm_area_struct *vma, struct rb_root *root) vma_rb_erase()
541 anon_vma_interval_tree_remove(avc, &avc->anon_vma->rb_root); anon_vma_interval_tree_pre_update_vma()
550 anon_vma_interval_tree_insert(avc, &avc->anon_vma->rb_root); anon_vma_interval_tree_post_update_vma()
733 struct rb_root *root = NULL; vma_adjust()
3134 if (!test_bit(0, (unsigned long *) &anon_vma->root->rb_root.rb_node)) { vm_lock_anon_vma()
3150 &anon_vma->root->rb_root.rb_node)) vm_lock_anon_vma()
3190 * The LSB in anon_vma->rb_root.rb_node and the AS_MM_ALL_LOCKS bitflag in
3237 if (test_bit(0, (unsigned long *) &anon_vma->root->rb_root.rb_node)) { vm_unlock_anon_vma()
3243 * the vma so the users using the anon_vma->rb_root will vm_unlock_anon_vma()
3251 &anon_vma->root->rb_root.rb_node)) vm_unlock_anon_vma()
H A Dmemcontrol.c168 struct rb_root rb_root; member in struct:mem_cgroup_tree_per_zone
627 struct rb_node **p = &mctz->rb_root.rb_node; __mem_cgroup_insert_exceeded()
651 rb_insert_color(&mz->tree_node, &mctz->rb_root); __mem_cgroup_insert_exceeded()
660 rb_erase(&mz->tree_node, &mctz->rb_root); __mem_cgroup_remove_exceeded()
744 rightmost = rb_last(&mctz->rb_root); __mem_cgroup_largest_soft_limit_node()
5802 rtpz->rb_root = RB_ROOT; mem_cgroup_init()
/linux-4.1.27/net/6lowpan/
H A Dnhc.c20 static struct rb_root rb_root = RB_ROOT; variable in typeref:struct:rb_root
26 struct rb_node **new = &rb_root.rb_node, *parent = NULL; lowpan_nhc_insert()
56 rb_insert_color(&nhc->node, &rb_root); lowpan_nhc_insert()
63 rb_erase(&nhc->node, &rb_root); lowpan_nhc_remove()
68 struct rb_node *node = rb_root.rb_node; lowpan_nhc_by_nhcid()
/linux-4.1.27/net/ceph/
H A Dauth_x.h44 struct rb_root ticket_handlers;
H A Dosdmap.c392 struct rb_root *root) __insert_pg_mapping()
417 static struct ceph_pg_mapping *__lookup_pg_mapping(struct rb_root *root, __lookup_pg_mapping()
440 static int __remove_pg_mapping(struct rb_root *root, struct ceph_pg pgid) __remove_pg_mapping()
458 static int __insert_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *new) __insert_pg_pool()
480 static struct ceph_pg_pool_info *__lookup_pg_pool(struct rb_root *root, u64 id) __lookup_pg_pool()
532 static void __remove_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *pi) __remove_pg_pool()
/linux-4.1.27/lib/
H A Dinterval_tree_test.c11 static struct rb_root root = RB_ROOT;
18 search(unsigned long query, struct rb_root *root) search()
H A Drbtree_test.c19 static struct rb_root root = RB_ROOT;
24 static void insert(struct test_node *node, struct rb_root *root) insert()
41 static inline void erase(struct test_node *node, struct rb_root *root) erase()
67 static void insert_augmented(struct test_node *node, struct rb_root *root) insert_augmented()
90 static void erase_augmented(struct test_node *node, struct rb_root *root) erase_augmented()
H A Drbtree.c64 struct rb_root *root, int color) __rb_rotate_set_parents()
73 __rb_insert(struct rb_node *node, struct rb_root *root, __rb_insert()
202 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, ____rb_erase_color()
364 void __rb_erase_color(struct rb_node *parent, struct rb_root *root, __rb_erase_color()
386 void rb_insert_color(struct rb_node *node, struct rb_root *root) rb_insert_color()
392 void rb_erase(struct rb_node *node, struct rb_root *root) rb_erase()
408 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, __rb_insert_augmented()
418 struct rb_node *rb_first(const struct rb_root *root) rb_first()
431 struct rb_node *rb_last(const struct rb_root *root) rb_last()
506 struct rb_root *root) rb_replace_node()
553 struct rb_node *rb_first_postorder(const struct rb_root *root) rb_first_postorder()
/linux-4.1.27/tools/perf/util/
H A Dcomm.c13 static struct rb_root comm_str_root;
46 static struct comm_str *comm_str__findnew(const char *str, struct rb_root *root) comm_str__findnew()
H A Dcallchain.c255 rb_insert_callchain(struct rb_root *root, struct callchain_node *chain, rb_insert_callchain()
295 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, __sort_chain_flat() argument
306 __sort_chain_flat(rb_root, child, min_hit); __sort_chain_flat()
310 rb_insert_callchain(rb_root, node, CHAIN_FLAT); __sort_chain_flat()
318 sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root, sort_chain_flat() argument
321 __sort_chain_flat(rb_root, &root->node, min_hit); sort_chain_flat()
330 node->rb_root = RB_ROOT; __sort_chain_graph_abs()
339 rb_insert_callchain(&node->rb_root, child, __sort_chain_graph_abs()
345 sort_chain_graph_abs(struct rb_root *rb_root, struct callchain_root *chain_root, sort_chain_graph_abs() argument
349 rb_root->rb_node = chain_root->node.rb_root.rb_node; sort_chain_graph_abs()
359 node->rb_root = RB_ROOT; __sort_chain_graph_rel()
369 rb_insert_callchain(&node->rb_root, child, __sort_chain_graph_rel()
375 sort_chain_graph_rel(struct rb_root *rb_root, struct callchain_root *chain_root, sort_chain_graph_rel() argument
379 rb_root->rb_node = chain_root->node.rb_root.rb_node; sort_chain_graph_rel()
H A Dcallchain.h35 struct rb_root rb_root_in; /* input tree of children */
36 struct rb_root rb_root; /* sorted output tree of children */ member in struct:callchain_node
49 typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
H A Drblist.h22 struct rb_root entries;
H A Dsymbol.h62 void symbols__delete(struct rb_root *symbols);
64 /* symbols__for_each_entry - iterate over symbols (rb_root)
66 * @symbols: the rb_root of symbols
276 void symbols__insert(struct rb_root *symbols, struct symbol *sym);
277 void symbols__fixup_duplicate(struct rb_root *symbols);
278 void symbols__fixup_end(struct rb_root *symbols);
H A Dmap.h61 struct rb_root maps[MAP__NR_TYPES];
162 void maps__insert(struct rb_root *maps, struct map *map);
163 void maps__remove(struct rb_root *maps, struct map *map);
164 struct map *maps__find(struct rb_root *maps, u64 addr);
165 struct map *maps__first(struct rb_root *maps);
H A Dsymbol.c146 void symbols__fixup_duplicate(struct rb_root *symbols) symbols__fixup_duplicate()
177 void symbols__fixup_end(struct rb_root *symbols) symbols__fixup_end()
285 void symbols__delete(struct rb_root *symbols) symbols__delete()
298 void symbols__insert(struct rb_root *symbols, struct symbol *sym) symbols__insert()
317 static struct symbol *symbols__find(struct rb_root *symbols, u64 ip) symbols__find()
340 static struct symbol *symbols__first(struct rb_root *symbols) symbols__first()
365 static void symbols__insert_by_name(struct rb_root *symbols, struct symbol *sym) symbols__insert_by_name()
385 static void symbols__sort_by_name(struct rb_root *symbols, symbols__sort_by_name()
386 struct rb_root *source) symbols__sort_by_name()
396 static struct symbol *symbols__find_by_name(struct rb_root *symbols, symbols__find_by_name()
596 struct rb_root *root = &a->dso->symbols[a->map->type]; map__process_kallsym_symbol()
637 struct rb_root *root = &dso->symbols[map->type]; dso__split_kallsyms_for_kcore()
693 struct rb_root *root = &dso->symbols[map->type]; dso__split_kallsyms()
842 static void add_module(struct module_info *mi, struct rb_root *modules) add_module()
860 static void delete_modules(struct rb_root *modules) delete_modules()
875 struct rb_root *modules) find_module()
898 struct rb_root *modules = arg; __read_proc_modules()
918 static int read_proc_modules(const char *filename, struct rb_root *modules) read_proc_modules()
933 struct rb_root from_modules = RB_ROOT; compare_proc_modules()
934 struct rb_root to_modules = RB_ROOT; compare_proc_modules()
975 struct rb_root modules = RB_ROOT; do_validate_kcore_modules()
H A Ddso.h126 struct rb_root root; /* rbtree root sorted by long name */
132 struct rb_root symbols[MAP__NR_TYPES];
133 struct rb_root symbol_names[MAP__NR_TYPES];
162 struct rb_root cache;
H A Dhist.h57 struct rb_root entries_in_array[2];
58 struct rb_root *entries_in;
59 struct rb_root entries;
60 struct rb_root entries_collapsed;
H A Dmap.c231 struct rb_root *symbols = &map->dso->symbols[map->type]; map__fixup_start()
241 struct rb_root *symbols = &map->dso->symbols[map->type]; map__fixup_end()
427 static void maps__delete(struct rb_root *maps) maps__delete()
501 struct rb_root *root = &mg->maps[type]; map_groups__flush()
637 struct rb_root *root = &mg->maps[map->type]; map_groups__fixup_overlappings()
719 void maps__insert(struct rb_root *maps, struct map *map) maps__insert()
739 void maps__remove(struct rb_root *maps, struct map *map) maps__remove()
744 struct map *maps__find(struct rb_root *maps, u64 ip) maps__find()
764 struct map *maps__first(struct rb_root *maps) maps__first()
H A Dkvm-stat.h97 struct rb_root result;
H A Dhist.c956 struct rb_root *root, hists__collapse_insert_entry()
997 static struct rb_root *hists__get_rotate_entries_in(struct hists *hists) hists__get_rotate_entries_in()
999 struct rb_root *root; hists__get_rotate_entries_in()
1021 struct rb_root *root; hists__collapse_resort()
1100 static void __hists__insert_output_entry(struct rb_root *entries, __hists__insert_output_entry()
1128 struct rb_root *root; hists__output_resort()
1298 struct rb_root *root; hists__add_dummy_entry()
1369 struct rb_root *root; hists__match()
1394 struct rb_root *root; hists__link()
H A Dthread-stack.h91 struct rb_root children;
H A Dannotate.c1085 static void insert_source_line(struct rb_root *root, struct source_line *src_line) insert_source_line()
1129 static void __resort_source_line(struct rb_root *root, struct source_line *src_line) __resort_source_line()
1149 static void resort_source_line(struct rb_root *dest_root, struct rb_root *src_root) resort_source_line()
1188 struct rb_root *root, int len) symbol__get_source_line()
1196 struct rb_root tmp_root = RB_ROOT; symbol__get_source_line()
1248 static void print_summary(struct rb_root *root, const char *filename) print_summary()
1448 struct rb_root source_line = RB_ROOT; symbol__tty_annotate()
H A Dmachine.h32 struct rb_root threads;
95 struct rb_root guests;
H A Dsort.h110 struct rb_root sorted_chain;
H A Ddso.c497 dso_cache__free(struct rb_root *root) dso_cache__free()
511 static struct dso_cache *dso_cache__find(const struct rb_root *root, u64 offset) dso_cache__find()
535 dso_cache__insert(struct rb_root *root, struct dso_cache *new) dso_cache__insert()
779 static struct dso *dso__findlink_by_longname(struct rb_root *root, dso__findlink_by_longname()
828 dso__find_by_longname(const struct rb_root *root, const char *name) dso__find_by_longname()
830 return dso__findlink_by_longname((struct rb_root *)root, NULL, name); dso__find_by_longname()
/linux-4.1.27/include/rdma/
H A Dib_umem_odp.h109 void rbt_ib_umem_insert(struct umem_odp_node *node, struct rb_root *root);
110 void rbt_ib_umem_remove(struct umem_odp_node *node, struct rb_root *root);
117 int rbt_ib_umem_for_each_in_range(struct rb_root *root, u64 start, u64 end,
120 struct umem_odp_node *rbt_ib_umem_iter_first(struct rb_root *root,
/linux-4.1.27/fs/nfs/blocklayout/
H A Dextent_tree.c18 ext_tree_first(struct rb_root *root) ext_tree_first()
45 __ext_tree_search(struct rb_root *root, sector_t start) __ext_tree_search()
94 ext_try_to_merge_left(struct rb_root *root, struct pnfs_block_extent *be) ext_try_to_merge_left()
110 ext_try_to_merge_right(struct rb_root *root, struct pnfs_block_extent *be) ext_try_to_merge_right()
125 __ext_tree_insert(struct rb_root *root, __ext_tree_insert()
166 __ext_tree_remove(struct rb_root *root, sector_t start, sector_t end) __ext_tree_remove()
247 struct rb_root *root; ext_tree_insert()
311 __ext_tree_lookup(struct rb_root *root, sector_t isect, __ext_tree_lookup()
367 ext_tree_split(struct rb_root *root, struct pnfs_block_extent *be, ext_tree_split()
395 struct rb_root *root = &bl->bl_ext_rw; ext_tree_mark_written()
573 struct rb_root *root = &bl->bl_ext_rw; ext_tree_mark_committed()
H A Dblocklayout.h148 struct rb_root bl_ext_rw;
149 struct rb_root bl_ext_ro;
/linux-4.1.27/arch/powerpc/kernel/
H A Deeh_cache.c59 struct rb_root rb_root; member in struct:pci_io_addr_cache
65 struct rb_node *n = pci_io_addr_cache_root.rb_root.rb_node; __eeh_addr_cache_get_device()
113 n = rb_first(&cache->rb_root); eeh_addr_cache_print()
131 struct rb_node **p = &pci_io_addr_cache_root.rb_root.rb_node; eeh_addr_cache_insert()
167 rb_insert_color(&piar->rb_node, &pci_io_addr_cache_root.rb_root); eeh_addr_cache_insert()
239 n = rb_first(&pci_io_addr_cache_root.rb_root); __eeh_addr_cache_rmv_dev()
245 rb_erase(n, &pci_io_addr_cache_root.rb_root); __eeh_addr_cache_rmv_dev()
/linux-4.1.27/arch/x86/mm/
H A Dpat_rbtree.c37 static struct rb_root memtype_rbroot = RB_ROOT;
76 static struct memtype *memtype_rb_lowest_match(struct rb_root *root, memtype_rb_lowest_match()
101 static struct memtype *memtype_rb_exact_match(struct rb_root *root, memtype_rb_exact_match()
123 static int memtype_rb_check_conflict(struct rb_root *root, memtype_rb_check_conflict()
169 static void memtype_rb_insert(struct rb_root *root, struct memtype *newdata) memtype_rb_insert()
/linux-4.1.27/include/linux/ceph/
H A Dosdmap.h100 struct rb_root pg_temp;
101 struct rb_root primary_temp;
105 struct rb_root pg_pools;
H A Dosd_client.h211 struct rb_root osds; /* osds */
215 struct rb_root requests; /* pending requests */
233 struct rb_root event_tree;
H A Dmon_client.h75 struct rb_root generic_request_tree;
/linux-4.1.27/net/netfilter/
H A Dxt_connlimit.c61 struct rb_root climit_root4[CONNLIMIT_SLOTS];
62 struct rb_root climit_root6[CONNLIMIT_SLOTS];
187 static void tree_nodes_free(struct rb_root *root, tree_nodes_free()
201 count_tree(struct net *net, struct rb_root *root, count_tree()
295 struct rb_root *root; count_them()
398 static void destroy_tree(struct rb_root *r) destroy_tree()
H A Dnft_rbtree.c24 struct rb_root root;
/linux-4.1.27/fs/nfsd/
H A Dnetns.h71 struct rb_root conf_name_tree;
73 struct rb_root unconf_name_tree;
/linux-4.1.27/tools/perf/tests/
H A Dhists_common.c156 struct rb_root *root; print_hists_in()
186 struct rb_root *root; print_hists_out()
H A Dhists_output.c92 struct rb_root *root_in; del_hist_entries()
93 struct rb_root *root_out; del_hist_entries()
127 struct rb_root *root; test1()
229 struct rb_root *root; test2()
285 struct rb_root *root; test3()
359 struct rb_root *root; test4()
461 struct rb_root *root; test5()
H A Dhists_cumulate.c126 struct rb_root *root_in; del_hist_entries()
127 struct rb_root *root_out; del_hist_entries()
180 struct rb_root *root; do_test()
219 root = &he->callchain->node.rb_root; do_test()
H A Dhists_link.c150 struct rb_root *root; __validate_match()
200 struct rb_root *root; __validate_link()
/linux-4.1.27/fs/jffs2/
H A Djffs2_fs_i.h33 struct rb_root fragtree;
H A Dnodelist.h242 struct rb_root tn_root;
327 static inline struct jffs2_node_frag *frag_first(struct rb_root *root) frag_first()
337 static inline struct jffs2_node_frag *frag_last(struct rb_root *root) frag_last()
371 struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset);
372 void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c_delete);
374 uint32_t jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size);
H A Dnodelist.c59 uint32_t jffs2_truncate_fragtree(struct jffs2_sb_info *c, struct rb_root *list, uint32_t size) jffs2_truncate_fragtree()
169 static int no_overlapping_node(struct jffs2_sb_info *c, struct rb_root *root, no_overlapping_node()
215 static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *root, struct jffs2_node_frag *newfrag) jffs2_add_frag_to_fragtree()
524 struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset) jffs2_lookup_node_frag()
565 void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c) jffs2_kill_fragtree()
H A Dreadinode.c175 static struct jffs2_tmp_dnode_info *jffs2_lookup_tn(struct rb_root *tn_root, uint32_t offset) jffs2_lookup_tn()
402 static void eat_last(struct rb_root *root, struct rb_node *node) eat_last()
424 static void ver_insert(struct rb_root *ver_root, struct jffs2_tmp_dnode_info *tn) ver_insert()
456 struct rb_root ver_root = RB_ROOT; jffs2_build_inode_fragtree()
544 static void jffs2_free_tmp_dnode_info_list(struct rb_root *list) jffs2_free_tmp_dnode_info_list()
/linux-4.1.27/include/net/
H A Dgarp.h106 struct rb_root gid;
H A Dmrp.h120 struct rb_root mad;
/linux-4.1.27/tools/perf/
H A Dbuiltin-kmem.c54 static struct rb_root root_alloc_stat;
55 static struct rb_root root_alloc_sorted;
56 static struct rb_root root_caller_stat;
57 static struct rb_root root_caller_sorted;
187 struct rb_root *root, search_alloc_stat()
262 static struct rb_root page_tree;
263 static struct rb_root page_alloc_tree;
264 static struct rb_root page_alloc_sorted;
516 static void __print_slab_result(struct rb_root *root, __print_slab_result()
579 static void __print_page_result(struct rb_root *root, __print_page_result()
707 static void sort_slab_insert(struct rb_root *root, struct alloc_stat *data, sort_slab_insert()
737 static void __sort_slab_result(struct rb_root *root, struct rb_root *root_sorted, __sort_slab_result()
754 static void sort_page_insert(struct rb_root *root, struct page_stat *data) sort_page_insert()
779 static void __sort_page_result(struct rb_root *root, struct rb_root *root_sorted) __sort_page_result()
H A Dbuiltin-lock.c116 static struct rb_root thread_stats;
244 static struct rb_root result; /* place to store sorted data */
H A Dbuiltin-sched.c171 struct rb_root atom_root, sorted_atom_root;
811 thread_atoms_search(struct rb_root *root, struct thread *thread, thread_atoms_search()
837 __thread_latency_insert(struct rb_root *root, struct work_atoms *data, __thread_latency_insert()
H A Dbuiltin-diff.c426 struct rb_root *root; hists__baseline_only()
448 struct rb_root *root; hists__precompute()
H A Dbuiltin-kvm.c477 static void insert_to_result(struct rb_root *result, struct kvm_event *event, insert_to_result()
530 static struct kvm_event *pop_from_result(struct rb_root *result) pop_from_result()
/linux-4.1.27/net/sched/
H A Dsch_fq.c87 struct rb_root delayed; /* for rate limited flows */
97 struct rb_root *fq_root;
177 struct rb_root *root, fq_gc()
220 struct rb_root *root; fq_classify()
518 struct rb_root *root; fq_reset()
551 struct rb_root *old_array, u32 old_log, fq_rehash()
552 struct rb_root *new_array, u32 new_log) fq_rehash()
555 struct rb_root *oroot, *nroot; fq_rehash()
613 struct rb_root *array; fq_resize()
621 array = fq_alloc_node(sizeof(struct rb_root) << log, fq_resize()
H A Dsch_htb.c81 struct rb_root row;
82 struct rb_root feed;
146 struct rb_root wait_pq;
269 static void htb_add_to_id_tree(struct rb_root *root, htb_add_to_id_tree()
350 static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root) htb_safe_rb_erase()
697 struct rb_root *wait_pq = &q->hlevel[level].wait_pq; htb_do_events()
H A Dsch_hfsc.c129 struct rb_root vt_tree; /* active children sorted by cl_vt */
131 struct rb_root cf_tree; /* active children sorted by cl_f */
179 struct rb_root eligible; /* eligible tree */
/linux-4.1.27/tools/perf/ui/stdio/
H A Dhist.c80 static size_t __callchain__fprintf_graph(FILE *fp, struct rb_root *root, __callchain__fprintf_graph()
135 ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total, __callchain__fprintf_graph()
159 static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root, callchain__fprintf_graph()
204 root = &cnode->rb_root; callchain__fprintf_graph()
237 static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree, callchain__fprintf_flat()
/linux-4.1.27/fs/btrfs/
H A Ddelayed-inode.h66 struct rb_root ins_root;
67 struct rb_root del_root;
H A Dextent_map.h42 struct rb_root map;
H A Dulist.h50 struct rb_root root;
H A Drelocation.c101 struct rb_root rb_root; member in struct:backref_cache
133 struct rb_root rb_root; member in struct:mapping_tree
203 tree->rb_root = RB_ROOT; mapping_tree_init()
210 cache->rb_root = RB_ROOT; backref_cache_init()
241 BUG_ON(!RB_EMPTY_ROOT(&cache->rb_root)); backref_cache_cleanup()
289 static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, tree_insert()
313 static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) tree_search()
417 rb_erase(&node->rb_node, &tree->rb_root); drop_backref_node()
466 rb_erase(&node->rb_node, &cache->rb_root); update_backref_node()
468 rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); update_backref_node()
560 rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); find_reloc_root()
854 rb_node = tree_search(&cache->rb_root, key.offset);
947 rb_node = tree_search(&cache->rb_root, eb->start);
1036 rb_node = tree_insert(&cache->rb_root, node->bytenr,
1085 rb_node = tree_insert(&cache->rb_root, upper->bytenr,
1129 rb_erase(&upper->rb_node, &cache->rb_root);
1202 rb_node = tree_search(&cache->rb_root, src->commit_root->start); clone_backref_node()
1212 rb_node = tree_search(&cache->rb_root, clone_backref_node()
1249 rb_node = tree_insert(&cache->rb_root, new_node->bytenr, clone_backref_node()
1289 rb_node = tree_insert(&rc->reloc_root_tree.rb_root, __add_reloc_root()
1315 rb_node = tree_search(&rc->reloc_root_tree.rb_root, __del_reloc_root()
1319 rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); __del_reloc_root()
1344 rb_node = tree_search(&rc->reloc_root_tree.rb_root, __update_reloc_root()
1348 rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); __update_reloc_root()
1358 rb_node = tree_insert(&rc->reloc_root_tree.rb_root, __update_reloc_root()
2429 BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); merge_reloc_roots()
2432 static void free_block_list(struct rb_root *blocks) free_block_list()
2950 struct reloc_control *rc, struct rb_root *blocks) relocate_tree_blocks()
3278 struct rb_root *blocks) add_tree_block()
3348 struct rb_root *blocks) __add_tree_block()
3485 struct rb_root *blocks) find_data_references()
3653 struct rb_root *blocks)
3901 struct rb_root blocks = RB_ROOT; relocate_block_group()
H A Ddelayed-ref.h86 struct rb_root ref_root;
133 struct rb_root href_root;
H A Dfree-space-cache.h32 struct rb_root free_space_offset;
H A Dextent_map.c92 static int tree_insert(struct rb_root *root, struct extent_map *em) tree_insert()
140 static struct rb_node *__tree_search(struct rb_root *root, u64 offset, __tree_search()
H A Dordered-data.h25 struct rb_root tree;
H A Ddelayed-ref.c139 static struct btrfs_delayed_ref_node *tree_insert(struct rb_root *root, tree_insert()
169 static struct btrfs_delayed_ref_head *htree_insert(struct rb_root *root, htree_insert()
205 find_ref_head(struct rb_root *root, u64 bytenr, find_ref_head()
H A Dordered-data.c41 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset, tree_insert()
77 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset, __tree_search()
154 struct rb_root *root = &tree->tree; tree_search()
H A Ddelayed-inode.c340 struct rb_root *root, __btrfs_lookup_delayed_item()
407 struct rb_root *root; __btrfs_add_delayed_item()
474 struct rb_root *root; __btrfs_remove_delayed_item()
H A Dextent_io.h95 struct rb_root state;
H A Dinode-map.c248 struct rb_root *rbroot = &root->free_ino_pinned->free_space_offset; btrfs_unpin_free_ino()
H A Dctree.h1223 struct rb_root root;
1408 struct rb_root block_group_cache_tree;
1556 struct rb_root tree_mod_log;
1662 struct rb_root defrag_inodes;
1720 struct rb_root qgroup_tree;
1721 struct rb_root qgroup_op_tree;
1903 struct rb_root inode_tree;
/linux-4.1.27/fs/ocfs2/cluster/
H A Dnodemanager.h63 struct rb_root cl_node_ip_tree;
/linux-4.1.27/fs/dlm/
H A Dlock.h35 int dlm_search_rsb_tree(struct rb_root *tree, char *name, int len,
H A Ddebug_fs.c424 struct rb_root *tree; table_seq_start()
506 struct rb_root *tree; table_seq_next()
H A Ddlm_internal.h104 struct rb_root keep;
105 struct rb_root toss;
/linux-4.1.27/kernel/trace/
H A Dtrace_stat.c34 struct rb_root stat_root;
76 static int insert_stat(struct rb_root *root, void *stat, cmp_stat_t cmp) insert_stat()
127 struct rb_root *root = &session->stat_root; stat_seq_init()
/linux-4.1.27/drivers/infiniband/hw/mlx4/
H A Dcm.c146 struct rb_root *sl_id_map = &to_mdev(ibdev)->sriov.sl_id_map; id_map_find_by_sl_id()
174 struct rb_root *sl_id_map = &sriov->sl_id_map; id_map_ent_timeout()
195 struct rb_root *sl_id_map = &sriov->sl_id_map; id_map_find_del()
212 struct rb_root *sl_id_map = &to_mdev(ibdev)->sriov.sl_id_map; sl_id_map_add()
416 struct rb_root *sl_id_map = &sriov->sl_id_map; mlx4_ib_cm_paravirt_clean()
H A Dmlx4_ib.h434 struct rb_root mcg_table;
455 struct rb_root sl_id_map;
/linux-4.1.27/drivers/mtd/
H A Dmtdswap.c84 struct rb_root *root;
98 struct rb_root root;
218 static void __mtdswap_rb_add(struct rb_root *root, struct swap_eb *eb) __mtdswap_rb_add()
239 struct rb_root *root; mtdswap_rb_add()
251 static struct rb_node *mtdswap_rb_index(struct rb_root *root, unsigned int idx) mtdswap_rb_index()
433 struct rb_root hist_root = RB_ROOT; mtdswap_check_counts()
616 struct rb_root *clean_root; mtdswap_map_free_block()
854 struct rb_root *root; mtdswap_choose_wl_tree()
897 struct rb_root *rp = NULL; mtdswap_pick_gc_eblk()
1234 struct rb_root *root = &d->trees[i].root; mtdswap_show()
/linux-4.1.27/block/
H A Ddeadline-iosched.c34 struct rb_root sort_list[2];
56 static inline struct rb_root * deadline_rb_root()
79 struct rb_root *root = deadline_rb_root(dd, rq); deadline_add_rq_rb()
H A Delevator.c297 void elv_rb_add(struct rb_root *root, struct request *rq) elv_rb_add()
318 void elv_rb_del(struct rb_root *root, struct request *rq) elv_rb_del()
326 struct request *elv_rb_find(struct rb_root *root, sector_t sector) elv_rb_find()
H A Dcfq-iosched.c85 struct rb_root rb;
111 struct rb_root *p_root;
113 struct rb_root sort_list;
328 struct rb_root prio_trees[CFQ_PRIO_LISTS];
1190 static void rb_erase_init(struct rb_node *n, struct rb_root *root) rb_erase_init()
2101 cfq_prio_tree_lookup(struct cfq_data *cfqd, struct rb_root *root, cfq_prio_tree_lookup()
2589 struct rb_root *root = &cfqd->prio_trees[cur_cfqq->org_ioprio]; cfqq_close()
H A Dblk-throttle.c72 struct rb_root pending_tree; /* RB tree of active tgs */
568 static void rb_erase_init(struct rb_node *n, struct rb_root *root) rb_erase_init()
/linux-4.1.27/tools/perf/ui/browsers/
H A Dhists.c164 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { callchain_node__count_rows_rb_tree()
201 static int callchain__count_rows(struct rb_root *chain) callchain__count_rows()
228 struct rb_node *nd = rb_first(&node->rb_root); callchain_node__init_have_children_rb_tree()
230 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { callchain_node__init_have_children_rb_tree()
239 !RB_EMPTY_ROOT(&child->rb_root); callchain_node__init_have_children_rb_tree()
242 !RB_EMPTY_ROOT(&child->rb_root); callchain_node__init_have_children_rb_tree()
259 chain->ms.has_children = !RB_EMPTY_ROOT(&node->rb_root); callchain_node__init_have_children()
265 static void callchain__init_have_children(struct rb_root *root) callchain__init_have_children()
314 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { callchain_node__set_folding_rb_tree()
350 static int callchain__set_folding(struct rb_root *chain, bool unfold) callchain__set_folding()
562 struct rb_root *root, int level, hist_browser__show_callchain()
633 row += hist_browser__show_callchain(browser, &child->rb_root, hist_browser__show_callchain()
H A Dannotate.c39 struct rb_root entries;
283 static void disasm_rb_tree__insert(struct rb_root *root, struct browser_disasm_line *bdl, disasm_rb_tree__insert()
/linux-4.1.27/drivers/infiniband/core/
H A Dumem_rbtree.c75 int rbt_ib_umem_for_each_in_range(struct rb_root *root, rbt_ib_umem_for_each_in_range()
H A Duverbs.h95 struct rb_root xrcd_tree;
H A Dcm.c73 struct rb_root listen_service_table;
75 /* struct rb_root peer_service_table; todo: fix peer to peer */
76 struct rb_root remote_qp_table;
77 struct rb_root remote_id_table;
78 struct rb_root remote_sidr_table;
H A Dmulticast.c63 struct rb_root table;
/linux-4.1.27/arch/arm/xen/
H A Dp2m.c28 struct rb_root phys_to_mach = RB_ROOT;
/linux-4.1.27/arch/arm/include/asm/xen/
H A Dpage.h36 extern struct rb_root phys_to_mach;
/linux-4.1.27/fs/cifs/
H A Dcifs_fs_sb.h51 struct rb_root tlink_tree;
H A Dcifsglob.h1587 GLOBAL_EXTERN struct rb_root uidtree;
1588 GLOBAL_EXTERN struct rb_root gidtree;
1591 GLOBAL_EXTERN struct rb_root siduidtree;
1592 GLOBAL_EXTERN struct rb_root sidgidtree;
H A Dconnect.c287 static void tlink_rb_insert(struct rb_root *root, struct tcon_link *new_tlink);
3811 struct rb_root *root = &cifs_sb->tlink_tree; cifs_umount()
3964 tlink_rb_search(struct rb_root *root, kuid_t uid) tlink_rb_search()
3984 tlink_rb_insert(struct rb_root *root, struct tcon_link *new_tlink) tlink_rb_insert()
4101 struct rb_root *root = &cifs_sb->tlink_tree; cifs_prune_tlinks()
/linux-4.1.27/fs/ext4/
H A Dextents_status.h66 struct rb_root root;
H A Ddir.c383 static void free_rb_tree_fname(struct rb_root *root) free_rb_tree_fname()
/linux-4.1.27/security/keys/
H A Dinternal.h62 extern struct rb_root key_user_tree;
82 extern struct rb_root key_serial_tree;
H A Dproc.c288 static struct rb_node *key_user_first(struct user_namespace *user_ns, struct rb_root *r) key_user_first()
H A Dkey.c24 struct rb_root key_serial_tree; /* tree of keys indexed by serial */
27 struct rb_root key_user_tree; /* tree of quota records indexed by UID */
/linux-4.1.27/tools/perf/ui/gtk/
H A Dhists.c92 static void perf_gtk__add_callchain(struct rb_root *root, GtkTreeStore *store, perf_gtk__add_callchain()
141 perf_gtk__add_callchain(&node->rb_root, store, &iter, col, perf_gtk__add_callchain()
/linux-4.1.27/include/drm/
H A Ddrm_vma_manager.h44 struct rb_root vm_files;
49 struct rb_root vm_addr_space_rb;
/linux-4.1.27/net/netfilter/ipset/
H A Dip_set_hash_netiface.c50 rbtree_destroy(struct rb_root *root) rbtree_destroy()
61 iface_test(struct rb_root *root, const char **iface) iface_test()
82 iface_add(struct rb_root *root, const char **iface) iface_add()
/linux-4.1.27/fs/ocfs2/
H A Dreservations.h49 struct rb_root m_reservations;
H A Docfs2.h89 struct rb_root ci_tree;
461 struct rb_root osb_rf_lock_tree;
H A Dreservations.c317 struct rb_root *root = &resmap->m_reservations; ocfs2_resv_insert()
474 struct rb_root *root = &resmap->m_reservations; __ocfs2_resv_find_window()
H A Duptodate.c145 static unsigned int ocfs2_purge_copied_metadata_tree(struct rb_root *root) ocfs2_purge_copied_metadata_tree()
174 struct rb_root root = RB_ROOT; ocfs2_metadata_cache_purge()
/linux-4.1.27/kernel/power/
H A Dwakelock.c34 static struct rb_root wakelocks_tree = RB_ROOT;
/linux-4.1.27/security/integrity/
H A Diint.c26 static struct rb_root integrity_iint_tree = RB_ROOT;
/linux-4.1.27/fs/ceph/
H A Dmds_client.h288 struct rb_root snap_realms;
293 struct rb_root request_tree; /* pending mds requests */
H A Dsuper.h241 struct rb_root index;
275 struct rb_root i_fragtree;
282 struct rb_root i_caps; /* cap list */
H A Dsnap.c80 static void __insert_snap_realm(struct rb_root *root, __insert_snap_realm()
/linux-4.1.27/net/rxrpc/
H A Dar-internal.h65 struct rb_root calls; /* outstanding calls on this socket */
206 struct rb_root bundles; /* client connection bundles on this transport */
207 struct rb_root client_conns; /* client connections on this transport */
208 struct rb_root server_conns; /* server connections on this transport */
249 struct rb_root calls; /* calls on this connection */
/linux-4.1.27/fs/ubifs/
H A Dlog.c552 static int done_already(struct rb_root *done_tree, int lnum) done_already()
584 static void destroy_done_tree(struct rb_root *done_tree) destroy_done_tree()
637 struct rb_root done_tree = RB_ROOT; ubifs_consolidate_log()
H A Dorphan.c744 struct rb_root root;
769 static int dbg_ins_check_orphan(struct rb_root *root, ino_t inum) dbg_ins_check_orphan()
797 static int dbg_find_check_orphan(struct rb_root *root, ino_t inum) dbg_find_check_orphan()
815 static void dbg_free_check_tree(struct rb_root *root) dbg_free_check_tree()
H A Dubifs.h1257 struct rb_root buds;
1292 struct rb_root old_idx;
1365 struct rb_root orph_tree;
1462 struct rb_root size_tree;
/linux-4.1.27/fs/ext2/
H A Dballoc.c190 * @rb_root: root of per-filesystem reservation rb tree
199 static void __rsv_window_dump(struct rb_root *root, int verbose, __rsv_window_dump()
283 * @rb_root: root of reservation tree
291 search_reserve_window(struct rb_root *root, ext2_fsblk_t goal) search_reserve_window()
332 struct rb_root *root = &EXT2_SB(sb)->s_rsv_window_root; ext2_rsv_window_add()
905 struct rb_root *fs_rsv_root = &EXT2_SB(sb)->s_rsv_window_root; alloc_new_reservation()
H A Dext2.h103 struct rb_root s_rsv_window_root;
/linux-4.1.27/drivers/net/ethernet/mellanox/mlx5/core/
H A Dpagealloc.c107 struct rb_root *root = &dev->priv.page_root; insert_page()
145 struct rb_root *root = &dev->priv.page_root; find_fw_page()
/linux-4.1.27/drivers/base/regmap/
H A Dregcache-rbtree.c39 struct rb_root root;
100 static int regcache_rbtree_insert(struct regmap *map, struct rb_root *root, regcache_rbtree_insert()
H A Dinternal.h144 struct rb_root range_tree;
/linux-4.1.27/fs/overlayfs/
H A Dreaddir.c40 struct rb_root root;
62 static struct ovl_cache_entry *ovl_cache_entry_find(struct rb_root *root, ovl_cache_entry_find()
/linux-4.1.27/fs/xfs/
H A Dxfs_mount.h292 struct rb_root pagb_tree; /* ordered tree of busy extents */
304 struct rb_root pag_buf_tree; /* ordered tree of active buffers */
/linux-4.1.27/drivers/md/
H A Ddm-bio-prison.c22 struct rb_root cells;
H A Ddm-crypt.c138 struct rb_root write_tree;
1182 struct rb_root write_tree; dmcrypt_write()
/linux-4.1.27/drivers/infiniband/hw/ipath/
H A Dipath_verbs_mcast.c46 static struct rb_root mcast_tree;
H A Dipath_user_sdma.c94 struct rb_root dma_pages_root;
/linux-4.1.27/arch/x86/platform/uv/
H A Duv_irq.c29 static struct rb_root uv_irq_root;
/linux-4.1.27/drivers/gpu/drm/radeon/
H A Dradeon_mn.c53 struct rb_root objects;
/linux-4.1.27/fs/proc/
H A Dinternal.h41 struct rb_root subdir;
H A Dgeneric.c78 struct rb_root *root = &dir->subdir; pde_subdir_insert()
/linux-4.1.27/fs/afs/
H A Dserver.c21 static struct rb_root afs_servers = RB_ROOT;
H A Dinternal.h283 struct rb_root fs_vnodes; /* vnodes backed by this server (ordered by FID) */
290 struct rb_root cb_promises; /* vnode expiration list (ordered earliest first) */
/linux-4.1.27/net/core/
H A Dgen_estimator.c110 static struct rb_root est_root = RB_ROOT;
/linux-4.1.27/fs/ext3/
H A Dballoc.c198 * @rb_root: root of per-filesystem reservation rb tree
207 static void __rsv_window_dump(struct rb_root *root, int verbose, __rsv_window_dump()
291 * @rb_root: root of reservation tree
299 search_reserve_window(struct rb_root *root, ext3_fsblk_t goal) search_reserve_window()
340 struct rb_root *root = &EXT3_SB(sb)->s_rsv_window_root; ext3_rsv_window_add()
1119 struct rb_root *fs_rsv_root = &EXT3_SB(sb)->s_rsv_window_root; alloc_new_reservation()
H A Ddir.c310 static void free_rb_tree_fname(struct rb_root *root) free_rb_tree_fname()
H A Dext3.h666 struct rb_root s_rsv_window_root;
962 struct rb_root root;
/linux-4.1.27/drivers/infiniband/ulp/ipoib/
H A Dipoib.h322 struct rb_root path_tree;
329 struct rb_root multicast_tree;
/linux-4.1.27/fs/gfs2/
H A Dincore.h103 struct rb_root rd_rstree; /* multi-block reservation tree */
726 struct rb_root sd_rindex_tree;
/linux-4.1.27/drivers/staging/android/ion/
H A Dion.c55 struct rb_root buffers;
61 struct rb_root clients;
86 struct rb_root handles;
721 static int ion_get_client_serial(const struct rb_root *root, ion_get_client_serial()
/linux-4.1.27/drivers/infiniband/hw/qib/
H A Dqib_user_sdma.c58 static struct rb_root qib_user_sdma_rb_root = RB_ROOT;
132 struct rb_root dma_pages_root;
141 qib_user_sdma_rb_search(struct rb_root *root, pid_t pid) qib_user_sdma_rb_search()
160 qib_user_sdma_rb_insert(struct rb_root *root, struct qib_user_sdma_rb_node *new) qib_user_sdma_rb_insert()
H A Dqib_verbs.h682 struct rb_root mcast_tree;
/linux-4.1.27/fs/nfs/
H A Dfscache.c28 static struct rb_root nfs_fscache_keys = RB_ROOT;
H A Ddir.c2190 struct rb_root *root_node = &nfsi->access_cache; __nfs_access_zap_cache()
2310 struct rb_root *root_node = &nfsi->access_cache; nfs_access_add_rbtree()
/linux-4.1.27/fs/nilfs2/
H A Dthe_nilfs.h166 struct rb_root ns_cptree;
/linux-4.1.27/fs/cachefiles/
H A Dinternal.h67 struct rb_root active_nodes; /* active nodes (can't be culled) */
/linux-4.1.27/fs/fscache/
H A Dobject-list.c20 static struct rb_root fscache_object_list;
/linux-4.1.27/kernel/sched/
H A Dsched.h347 struct rb_root tasks_timeline;
476 struct rb_root rb_root; member in struct:dl_rq
501 struct rb_root pushable_dl_tasks_root;
H A Ddeadline.c74 dl_rq->rb_root = RB_ROOT; init_dl_rq()
825 struct rb_node **link = &dl_rq->rb_root.rb_node; __enqueue_dl_entity()
847 rb_insert_color(&dl_se->rb_node, &dl_rq->rb_root); __enqueue_dl_entity()
866 rb_erase(&dl_se->rb_node, &dl_rq->rb_root); __dequeue_dl_entity()
/linux-4.1.27/tools/lib/lockdep/
H A Dpreload.c37 static struct rb_root locks = RB_ROOT;
/linux-4.1.27/arch/powerpc/perf/
H A Dhv-24x7.c526 static int event_uniq_add(struct rb_root *root, const char *name, int nl, event_uniq_add()
573 static void event_uniq_destroy(struct rb_root *root) event_uniq_destroy()
667 struct rb_root ev_uniq = RB_ROOT; create_events_from_catalog()
/linux-4.1.27/drivers/android/
H A Dbinder.c297 struct rb_root threads;
298 struct rb_root nodes;
299 struct rb_root refs_by_desc;
300 struct rb_root refs_by_node;
312 struct rb_root free_buffers;
313 struct rb_root allocated_buffers;
/linux-4.1.27/drivers/iommu/
H A Diova.c224 iova_insert_rbtree(struct rb_root *root, struct iova *iova) iova_insert_rbtree()
/linux-4.1.27/drivers/block/xen-blkback/
H A Dcommon.h290 struct rb_root persistent_gnts;
H A Dblkback.c268 static void free_persistent_gnts(struct xen_blkif *blkif, struct rb_root *root, free_persistent_gnts()
357 struct rb_root *root; purge_persistent_gnt()
/linux-4.1.27/net/rds/
H A Dcong.c102 static struct rb_root rds_cong_tree = RB_ROOT;
/linux-4.1.27/net/wireless/
H A Dcore.h69 struct rb_root bss_tree;
/linux-4.1.27/tools/perf/ui/
H A Dbrowser.c112 struct rb_root *root = browser->entries; ui_browser__rb_tree_seek()
/linux-4.1.27/drivers/xen/
H A Devtchn.c60 struct rb_root evtchns;
/linux-4.1.27/arch/sh/kernel/
H A Ddwarf.c44 static struct rb_root cie_root;
47 static struct rb_root fde_root;
/linux-4.1.27/drivers/staging/lustre/lustre/osc/
H A Dosc_cl_internal.h143 struct rb_root oo_root;
/linux-4.1.27/drivers/char/
H A Dmmtimer.c244 struct rb_root timer_head;
/linux-4.1.27/fs/fuse/
H A Dfuse_i.h439 struct rb_root polled_files;
/linux-4.1.27/include/linux/mlx5/
H A Ddriver.h478 struct rb_root page_root;
/linux-4.1.27/drivers/md/bcache/
H A Dbcache.h240 struct rb_root keys;
/linux-4.1.27/drivers/net/ethernet/mellanox/mlx4/
H A Dmlx4.h544 struct rb_root res_tree[MLX4_NUM_OF_RESOURCE_TYPE];
/linux-4.1.27/drivers/gpu/drm/i915/
H A Di915_gem_userptr.c51 struct rb_root objects;
/linux-4.1.27/drivers/vfio/
H A Dvfio_iommu_type1.c59 struct rb_root dma_list;
/linux-4.1.27/fs/hugetlbfs/
H A Dinode.c353 hugetlb_vmtruncate_list(struct rb_root *root, pgoff_t pgoff) hugetlb_vmtruncate_list()
/linux-4.1.27/fs/logfs/
H A Dlogfs.h167 struct rb_root rb_tree;
/linux-4.1.27/ipc/
H A Dmqueue.c71 struct rb_root msg_tree;

Completed in 4320 milliseconds

12