/linux-4.1.27/include/linux/ |
D | rbtree.h | 42 struct rb_root { struct 49 #define RB_ROOT (struct rb_root) { NULL, } argument 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);
|
D | interval_tree.h | 14 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,
|
D | rbtree_augmented.h | 44 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, in rb_insert_augmented() 122 struct rb_node *parent, struct rb_root *root) in __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, in __rb_erase_augmented() 234 rb_erase_augmented(struct rb_node *node, struct rb_root *root, in rb_erase_augmented()
|
D | interval_tree_generic.h | 68 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) \
|
D | elevator.h | 171 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);
|
D | rmap.h | 57 struct rb_root rb_root; /* Interval tree of private "related" vmas */ member
|
D | timerqueue.h | 14 struct rb_root head;
|
D | rtmutex.h | 31 struct rb_root waiters;
|
D | iova.h | 29 struct rb_root rbroot; /* iova domain rbtree root */
|
D | mm.h | 103 extern struct rb_root nommu_region_tree; 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);
|
D | pktcdvd.h | 184 struct rb_root bio_queue; /* Work queue of bios we need to handle */
|
D | nfs_fs_sb.h | 192 struct rb_root state_owners;
|
D | sysctl.h | 147 struct rb_root root;
|
D | mempolicy.h | 124 struct rb_root root;
|
D | mm_types.h | 343 struct rb_root mm_rb;
|
D | kernfs.h | 77 struct rb_root children;
|
D | nfs_fs.h | 156 struct rb_root access_cache;
|
/linux-4.1.27/drivers/infiniband/hw/usnic/ |
D | usnic_uiom_interval_tree.h | 36 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,
|
D | usnic_uiom.h | 43 struct rb_root rb_root; member
|
D | usnic_uiom_interval_tree.c | 88 find_intervals_intersection_sorted(struct rb_root *root, unsigned long start, in find_intervals_intersection_sorted() 106 struct rb_root *root, in usnic_uiom_get_intervals_diff() 163 int usnic_uiom_insert_interval(struct rb_root *root, unsigned long start, in usnic_uiom_insert_interval() 234 void usnic_uiom_remove_interval(struct rb_root *root, unsigned long start, in usnic_uiom_remove_interval()
|
D | usnic_uiom.c | 231 usnic_uiom_remove_interval(&pd->rb_root, vpn_start, in __usnic_uiom_reg_release() 383 &pd->rb_root, in usnic_uiom_reg_get() 399 err = usnic_uiom_insert_interval(&pd->rb_root, vpn_start, vpn_last, in usnic_uiom_reg_get()
|
/linux-4.1.27/drivers/block/drbd/ |
D | drbd_interval.h | 28 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,
|
D | drbd_interval.c | 47 drbd_insert_interval(struct rb_root *root, struct drbd_interval *this) in drbd_insert_interval() 90 drbd_contains_interval(struct rb_root *root, sector_t sector, in drbd_contains_interval() 117 drbd_remove_interval(struct rb_root *root, struct drbd_interval *this) in drbd_remove_interval() 134 drbd_find_overlap(struct rb_root *root, sector_t sector, unsigned int size) in drbd_find_overlap()
|
D | drbd_req.c | 84 static void drbd_remove_request_interval(struct rb_root *root, in drbd_remove_request_interval() 125 struct rb_root *root; in drbd_req_destroy()
|
D | drbd_int.h | 877 struct rb_root read_requests; 878 struct rb_root write_requests;
|
/linux-4.1.27/drivers/mtd/ubi/ |
D | wl.h | 4 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) { in may_reserve_for_fm()
|
D | ubi.h | 560 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;
|
D | fastmap-wl.c | 35 static struct ubi_wl_entry *find_anchor_wl_entry(struct rb_root *root) in find_anchor_wl_entry() 69 static int anchor_pebs_avalible(struct rb_root *root) in anchor_pebs_avalible() 355 struct rb_root *root) { in may_reserve_for_fm()
|
D | wl.c | 140 struct ubi_wl_entry *e, struct rb_root *root); 152 static void wl_tree_add(struct ubi_wl_entry *e, struct rb_root *root) in wl_tree_add() 249 static int in_wl_tree(struct ubi_wl_entry *e, struct rb_root *root) in in_wl_tree() 311 struct rb_root *root, int diff) in find_wl_entry() 354 struct rb_root *root) in find_mean_wl_entry() 1379 static void tree_destroy(struct ubi_device *ubi, struct rb_root *root) 1714 struct ubi_wl_entry *e, struct rb_root *root)
|
/linux-4.1.27/arch/powerpc/kernel/ |
D | eeh_cache.c | 59 struct rb_root rb_root; member 65 struct rb_node *n = pci_io_addr_cache_root.rb_root.rb_node; in __eeh_addr_cache_get_device() 113 n = rb_first(&cache->rb_root); in eeh_addr_cache_print() 131 struct rb_node **p = &pci_io_addr_cache_root.rb_root.rb_node; in eeh_addr_cache_insert() 167 rb_insert_color(&piar->rb_node, &pci_io_addr_cache_root.rb_root); in eeh_addr_cache_insert() 239 n = rb_first(&pci_io_addr_cache_root.rb_root); in __eeh_addr_cache_rmv_dev() 245 rb_erase(n, &pci_io_addr_cache_root.rb_root); in __eeh_addr_cache_rmv_dev()
|
/linux-4.1.27/tools/perf/util/ |
D | callchain.c | 255 rb_insert_callchain(struct rb_root *root, struct callchain_node *chain, in rb_insert_callchain() 295 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, in __sort_chain_flat() argument 306 __sort_chain_flat(rb_root, child, min_hit); in __sort_chain_flat() 310 rb_insert_callchain(rb_root, node, CHAIN_FLAT); in __sort_chain_flat() 318 sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root, in sort_chain_flat() argument 321 __sort_chain_flat(rb_root, &root->node, min_hit); in sort_chain_flat() 330 node->rb_root = RB_ROOT; in __sort_chain_graph_abs() 339 rb_insert_callchain(&node->rb_root, child, in __sort_chain_graph_abs() 345 sort_chain_graph_abs(struct rb_root *rb_root, struct callchain_root *chain_root, in sort_chain_graph_abs() argument 349 rb_root->rb_node = chain_root->node.rb_root.rb_node; in sort_chain_graph_abs() [all …]
|
D | callchain.h | 35 struct rb_root rb_root_in; /* input tree of children */ 36 struct rb_root rb_root; /* sorted output tree of children */ member 49 typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
|
D | map.h | 61 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);
|
D | symbol.c | 146 void symbols__fixup_duplicate(struct rb_root *symbols) in symbols__fixup_duplicate() 177 void symbols__fixup_end(struct rb_root *symbols) in symbols__fixup_end() 285 void symbols__delete(struct rb_root *symbols) in symbols__delete() 298 void symbols__insert(struct rb_root *symbols, struct symbol *sym) in symbols__insert() 317 static struct symbol *symbols__find(struct rb_root *symbols, u64 ip) in symbols__find() 340 static struct symbol *symbols__first(struct rb_root *symbols) in symbols__first() 365 static void symbols__insert_by_name(struct rb_root *symbols, struct symbol *sym) in symbols__insert_by_name() 385 static void symbols__sort_by_name(struct rb_root *symbols, in symbols__sort_by_name() 386 struct rb_root *source) in symbols__sort_by_name() 396 static struct symbol *symbols__find_by_name(struct rb_root *symbols, in symbols__find_by_name() [all …]
|
D | dso.h | 126 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;
|
D | symbol.h | 62 void symbols__delete(struct rb_root *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);
|
D | map.c | 231 struct rb_root *symbols = &map->dso->symbols[map->type]; in map__fixup_start() 241 struct rb_root *symbols = &map->dso->symbols[map->type]; in map__fixup_end() 427 static void maps__delete(struct rb_root *maps) in maps__delete() 501 struct rb_root *root = &mg->maps[type]; in map_groups__flush() 637 struct rb_root *root = &mg->maps[map->type]; in map_groups__fixup_overlappings() 719 void maps__insert(struct rb_root *maps, struct map *map) in maps__insert() 739 void maps__remove(struct rb_root *maps, struct map *map) in maps__remove() 744 struct map *maps__find(struct rb_root *maps, u64 ip) in maps__find() 764 struct map *maps__first(struct rb_root *maps) in maps__first()
|
D | comm.c | 13 static struct rb_root comm_str_root; 46 static struct comm_str *comm_str__findnew(const char *str, struct rb_root *root) in comm_str__findnew()
|
D | hist.h | 57 struct rb_root entries_in_array[2]; 58 struct rb_root *entries_in; 59 struct rb_root entries; 60 struct rb_root entries_collapsed;
|
D | rblist.h | 22 struct rb_root entries;
|
D | hist.c | 956 struct rb_root *root, in hists__collapse_insert_entry() 997 static struct rb_root *hists__get_rotate_entries_in(struct hists *hists) in hists__get_rotate_entries_in() 999 struct rb_root *root; in hists__get_rotate_entries_in() 1021 struct rb_root *root; in hists__collapse_resort() 1100 static void __hists__insert_output_entry(struct rb_root *entries, in __hists__insert_output_entry() 1128 struct rb_root *root; in hists__output_resort() 1298 struct rb_root *root; in hists__add_dummy_entry() 1369 struct rb_root *root; in hists__match() 1394 struct rb_root *root; in hists__link()
|
D | dso.c | 497 dso_cache__free(struct rb_root *root) in dso_cache__free() 511 static struct dso_cache *dso_cache__find(const struct rb_root *root, u64 offset) in dso_cache__find() 535 dso_cache__insert(struct rb_root *root, struct dso_cache *new) in dso_cache__insert() 779 static struct dso *dso__findlink_by_longname(struct rb_root *root, in dso__findlink_by_longname() 828 dso__find_by_longname(const struct rb_root *root, const char *name) in dso__find_by_longname() 830 return dso__findlink_by_longname((struct rb_root *)root, NULL, name); in dso__find_by_longname()
|
D | thread-stack.h | 91 struct rb_root children;
|
D | machine.h | 32 struct rb_root threads; 95 struct rb_root guests;
|
D | annotate.c | 1085 static void insert_source_line(struct rb_root *root, struct source_line *src_line) in insert_source_line() 1129 static void __resort_source_line(struct rb_root *root, struct source_line *src_line) in __resort_source_line() 1149 static void resort_source_line(struct rb_root *dest_root, struct rb_root *src_root) in resort_source_line() 1188 struct rb_root *root, int len) in symbol__get_source_line() 1196 struct rb_root tmp_root = RB_ROOT; in symbol__get_source_line() 1248 static void print_summary(struct rb_root *root, const char *filename) in print_summary() 1448 struct rb_root source_line = RB_ROOT; in symbol__tty_annotate()
|
D | kvm-stat.h | 97 struct rb_root result;
|
D | sort.h | 110 struct rb_root sorted_chain;
|
/linux-4.1.27/lib/ |
D | rbtree.c | 64 struct rb_root *root, int color) in __rb_rotate_set_parents() 73 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() 202 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color() 364 void __rb_erase_color(struct rb_node *parent, struct rb_root *root, in __rb_erase_color() 386 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color() 392 void rb_erase(struct rb_node *node, struct rb_root *root) in rb_erase() 408 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, in __rb_insert_augmented() 418 struct rb_node *rb_first(const struct rb_root *root) in rb_first() 431 struct rb_node *rb_last(const struct rb_root *root) in rb_last() 506 struct rb_root *root) in rb_replace_node() [all …]
|
D | rbtree_test.c | 19 static struct rb_root root = RB_ROOT; 24 static void insert(struct test_node *node, struct rb_root *root) in insert() 41 static inline void erase(struct test_node *node, struct rb_root *root) in erase() 67 static void insert_augmented(struct test_node *node, struct rb_root *root) in RB_DECLARE_CALLBACKS() 90 static void erase_augmented(struct test_node *node, struct rb_root *root) in erase_augmented()
|
D | interval_tree_test.c | 11 static struct rb_root root = RB_ROOT; 18 search(unsigned long query, struct rb_root *root) in search()
|
/linux-4.1.27/include/rdma/ |
D | ib_umem_odp.h | 109 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/net/6lowpan/ |
D | nhc.c | 20 static struct rb_root rb_root = RB_ROOT; variable 26 struct rb_node **new = &rb_root.rb_node, *parent = NULL; in lowpan_nhc_insert() 56 rb_insert_color(&nhc->node, &rb_root); in lowpan_nhc_insert() 63 rb_erase(&nhc->node, &rb_root); in lowpan_nhc_remove() 68 struct rb_node *node = rb_root.rb_node; in lowpan_nhc_by_nhcid()
|
/linux-4.1.27/mm/ |
D | interval_tree.c | 31 struct rb_root *root) in vma_interval_tree_insert_after() 77 struct rb_root *root) in INTERVAL_TREE_DEFINE() 87 struct rb_root *root) in anon_vma_interval_tree_remove() 93 anon_vma_interval_tree_iter_first(struct rb_root *root, in anon_vma_interval_tree_iter_first()
|
D | zswap.c | 197 struct rb_root rbroot; 238 static struct zswap_entry *zswap_rb_search(struct rb_root *root, pgoff_t offset) in zswap_rb_search() 259 static int zswap_rb_insert(struct rb_root *root, struct zswap_entry *entry, in zswap_rb_insert() 282 static void zswap_rb_erase(struct rb_root *root, struct zswap_entry *entry) in zswap_rb_erase() 324 static struct zswap_entry *zswap_entry_find_get(struct rb_root *root, in zswap_entry_find_get()
|
D | ksm.c | 186 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; in stable_tree_search() 1255 struct rb_root *root; in stable_tree_insert() 1327 struct rb_root *root; in unstable_tree_search_insert() 1918 anon_vma_interval_tree_foreach(vmac, &anon_vma->rb_root, in rmap_walk_ksm() 2204 struct rb_root *buf; in merge_across_nodes_store()
|
D | rmap.c | 134 anon_vma_interval_tree_insert(avc, &anon_vma->rb_root); in anon_vma_chain_link() 380 anon_vma_interval_tree_remove(avc, &anon_vma->rb_root); in unlink_anon_vmas() 386 if (RB_EMPTY_ROOT(&anon_vma->rb_root)) { in unlink_anon_vmas() 420 anon_vma->rb_root = RB_ROOT; in anon_vma_ctor() 1477 anon_vma_interval_tree_foreach(avc, &anon_vma->rb_root, pgoff, pgoff) { in rmap_walk_anon()
|
D | mmap.c | 377 static int browse_rb(struct rb_root *root) in browse_rb() 422 static void validate_mm_rb(struct rb_root *root, struct vm_area_struct *ignore) in validate_mm_rb() 497 struct rb_root *root) in vma_rb_insert() 505 static void vma_rb_erase(struct vm_area_struct *vma, struct rb_root *root) in vma_rb_erase() 541 anon_vma_interval_tree_remove(avc, &avc->anon_vma->rb_root); in anon_vma_interval_tree_pre_update_vma() 550 anon_vma_interval_tree_insert(avc, &avc->anon_vma->rb_root); in anon_vma_interval_tree_post_update_vma() 733 struct rb_root *root = NULL; in vma_adjust() 3134 if (!test_bit(0, (unsigned long *) &anon_vma->root->rb_root.rb_node)) { in vm_lock_anon_vma() 3150 &anon_vma->root->rb_root.rb_node)) in vm_lock_anon_vma() 3237 if (test_bit(0, (unsigned long *) &anon_vma->root->rb_root.rb_node)) { in vm_unlock_anon_vma() [all …]
|
D | memcontrol.c | 168 struct rb_root rb_root; member 627 struct rb_node **p = &mctz->rb_root.rb_node; in __mem_cgroup_insert_exceeded() 651 rb_insert_color(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_insert_exceeded() 660 rb_erase(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_remove_exceeded() 744 rightmost = rb_last(&mctz->rb_root); in __mem_cgroup_largest_soft_limit_node() 5802 rtpz->rb_root = RB_ROOT; in mem_cgroup_init()
|
/linux-4.1.27/fs/nfs/blocklayout/ |
D | extent_tree.c | 18 ext_tree_first(struct rb_root *root) in ext_tree_first() 45 __ext_tree_search(struct rb_root *root, sector_t start) in __ext_tree_search() 94 ext_try_to_merge_left(struct rb_root *root, struct pnfs_block_extent *be) in ext_try_to_merge_left() 110 ext_try_to_merge_right(struct rb_root *root, struct pnfs_block_extent *be) in ext_try_to_merge_right() 125 __ext_tree_insert(struct rb_root *root, in __ext_tree_insert() 166 __ext_tree_remove(struct rb_root *root, sector_t start, sector_t end) in __ext_tree_remove() 247 struct rb_root *root; in ext_tree_insert() 311 __ext_tree_lookup(struct rb_root *root, sector_t isect, in __ext_tree_lookup() 367 ext_tree_split(struct rb_root *root, struct pnfs_block_extent *be, in ext_tree_split() 395 struct rb_root *root = &bl->bl_ext_rw; in ext_tree_mark_written() [all …]
|
D | blocklayout.h | 148 struct rb_root bl_ext_rw; 149 struct rb_root bl_ext_ro;
|
/linux-4.1.27/arch/x86/mm/ |
D | pat_rbtree.c | 37 static struct rb_root memtype_rbroot = RB_ROOT; 76 static struct memtype *memtype_rb_lowest_match(struct rb_root *root, in RB_DECLARE_CALLBACKS() 101 static struct memtype *memtype_rb_exact_match(struct rb_root *root, in memtype_rb_exact_match() 123 static int memtype_rb_check_conflict(struct rb_root *root, in memtype_rb_check_conflict() 169 static void memtype_rb_insert(struct rb_root *root, struct memtype *newdata) in memtype_rb_insert()
|
/linux-4.1.27/tools/perf/ |
D | builtin-kmem.c | 54 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, in 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, in __print_slab_result() 579 static void __print_page_result(struct rb_root *root, in __print_page_result() [all …]
|
D | builtin-lock.c | 116 static struct rb_root thread_stats; 244 static struct rb_root result; /* place to store sorted data */
|
D | builtin-diff.c | 426 struct rb_root *root; in hists__baseline_only() 448 struct rb_root *root; in hists__precompute()
|
D | builtin-sched.c | 171 struct rb_root atom_root, sorted_atom_root; 811 thread_atoms_search(struct rb_root *root, struct thread *thread, in thread_atoms_search() 837 __thread_latency_insert(struct rb_root *root, struct work_atoms *data, in __thread_latency_insert()
|
D | builtin-kvm.c | 477 static void insert_to_result(struct rb_root *result, struct kvm_event *event, in insert_to_result() 530 static struct kvm_event *pop_from_result(struct rb_root *result) in pop_from_result()
|
/linux-4.1.27/fs/nfsd/ |
D | netns.h | 71 struct rb_root conf_name_tree; 73 struct rb_root unconf_name_tree;
|
/linux-4.1.27/net/netfilter/ |
D | xt_connlimit.c | 61 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, in tree_nodes_free() 201 count_tree(struct net *net, struct rb_root *root, in count_tree() 295 struct rb_root *root; in count_them() 398 static void destroy_tree(struct rb_root *r) in destroy_tree()
|
D | nft_rbtree.c | 24 struct rb_root root;
|
/linux-4.1.27/include/linux/ceph/ |
D | osdmap.h | 100 struct rb_root pg_temp; 101 struct rb_root primary_temp; 105 struct rb_root pg_pools;
|
D | osd_client.h | 211 struct rb_root osds; /* osds */ 215 struct rb_root requests; /* pending requests */ 233 struct rb_root event_tree;
|
D | mon_client.h | 75 struct rb_root generic_request_tree;
|
/linux-4.1.27/net/sched/ |
D | sch_fq.c | 87 struct rb_root delayed; /* for rate limited flows */ 97 struct rb_root *fq_root; 177 struct rb_root *root, in fq_gc() 220 struct rb_root *root; in fq_classify() 518 struct rb_root *root; in fq_reset() 551 struct rb_root *old_array, u32 old_log, in fq_rehash() 552 struct rb_root *new_array, u32 new_log) in fq_rehash() 555 struct rb_root *oroot, *nroot; in fq_rehash() 613 struct rb_root *array; in fq_resize() 621 array = fq_alloc_node(sizeof(struct rb_root) << log, in fq_resize()
|
D | sch_htb.c | 81 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, in htb_add_to_id_tree() 350 static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root) in htb_safe_rb_erase() 697 struct rb_root *wait_pq = &q->hlevel[level].wait_pq; in htb_do_events()
|
D | sch_hfsc.c | 129 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/include/drm/ |
D | drm_vma_manager.h | 44 struct rb_root vm_files; 49 struct rb_root vm_addr_space_rb;
|
/linux-4.1.27/fs/jffs2/ |
D | nodelist.h | 242 struct rb_root tn_root; 327 static inline struct jffs2_node_frag *frag_first(struct rb_root *root) in frag_first() 337 static inline struct jffs2_node_frag *frag_last(struct rb_root *root) in frag_last() 371 struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset); 372 void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c_delete); 374 uint32_t jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size);
|
D | jffs2_fs_i.h | 33 struct rb_root fragtree;
|
D | nodelist.c | 59 uint32_t jffs2_truncate_fragtree(struct jffs2_sb_info *c, struct rb_root *list, uint32_t size) in jffs2_truncate_fragtree() 169 static int no_overlapping_node(struct jffs2_sb_info *c, struct rb_root *root, in no_overlapping_node() 215 static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *root, struct jffs2_n… in jffs2_add_frag_to_fragtree() 524 struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset) in jffs2_lookup_node_frag() 565 void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c) in jffs2_kill_fragtree()
|
D | readinode.c | 175 static struct jffs2_tmp_dnode_info *jffs2_lookup_tn(struct rb_root *tn_root, uint32_t offset) in jffs2_lookup_tn() 402 static void eat_last(struct rb_root *root, struct rb_node *node) in eat_last() 424 static void ver_insert(struct rb_root *ver_root, struct jffs2_tmp_dnode_info *tn) in ver_insert() 456 struct rb_root ver_root = RB_ROOT; in jffs2_build_inode_fragtree() 544 static void jffs2_free_tmp_dnode_info_list(struct rb_root *list) in jffs2_free_tmp_dnode_info_list()
|
/linux-4.1.27/Documentation/ |
D | rbtree.txt | 70 At the root of each rbtree is an rb_root structure, which is initialized to be 73 struct rb_root mytree = RB_ROOT; 83 struct mytype *my_search(struct rb_root *root, char *string) 115 int my_insert(struct rb_root *root, struct mytype *data) 145 void rb_erase(struct rb_node *victim, struct rb_root *tree); 159 struct rb_root *tree); 171 struct rb_node *rb_first(struct rb_root *tree); 172 struct rb_node *rb_last(struct rb_root *tree); 265 interval_tree_first_match(struct rb_root *root, 366 struct rb_root *root) [all …]
|
/linux-4.1.27/fs/btrfs/ |
D | delayed-inode.h | 66 struct rb_root ins_root; 67 struct rb_root del_root;
|
D | delayed-ref.h | 86 struct rb_root ref_root; 133 struct rb_root href_root;
|
D | relocation.c | 101 struct rb_root rb_root; member 133 struct rb_root rb_root; member 203 tree->rb_root = RB_ROOT; in mapping_tree_init() 210 cache->rb_root = RB_ROOT; in backref_cache_init() 241 BUG_ON(!RB_EMPTY_ROOT(&cache->rb_root)); in backref_cache_cleanup() 289 static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, in tree_insert() 313 static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) in tree_search() 417 rb_erase(&node->rb_node, &tree->rb_root); in drop_backref_node() 466 rb_erase(&node->rb_node, &cache->rb_root); in update_backref_node() 468 rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); in update_backref_node() [all …]
|
D | ulist.h | 50 struct rb_root root;
|
D | extent_map.h | 42 struct rb_root map;
|
D | free-space-cache.h | 32 struct rb_root free_space_offset;
|
D | ordered-data.h | 25 struct rb_root tree;
|
D | extent_map.c | 92 static int tree_insert(struct rb_root *root, struct extent_map *em) in tree_insert() 140 static struct rb_node *__tree_search(struct rb_root *root, u64 offset, in __tree_search()
|
D | delayed-ref.c | 139 static struct btrfs_delayed_ref_node *tree_insert(struct rb_root *root, in tree_insert() 169 static struct btrfs_delayed_ref_head *htree_insert(struct rb_root *root, in htree_insert() 205 find_ref_head(struct rb_root *root, u64 bytenr, in find_ref_head()
|
D | ordered-data.c | 41 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset, in tree_insert() 77 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset, in __tree_search() 154 struct rb_root *root = &tree->tree; in tree_search()
|
D | ctree.h | 1223 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;
|
D | inode-map.c | 248 struct rb_root *rbroot = &root->free_ino_pinned->free_space_offset; in btrfs_unpin_free_ino()
|
D | extent_io.h | 95 struct rb_root state;
|
D | delayed-inode.c | 340 struct rb_root *root, in __btrfs_lookup_delayed_item() 407 struct rb_root *root; in __btrfs_add_delayed_item() 474 struct rb_root *root; in __btrfs_remove_delayed_item()
|
/linux-4.1.27/tools/perf/tests/ |
D | hists_output.c | 92 struct rb_root *root_in; in del_hist_entries() 93 struct rb_root *root_out; in del_hist_entries() 127 struct rb_root *root; in test1() 229 struct rb_root *root; in test2() 285 struct rb_root *root; in test3() 359 struct rb_root *root; in test4() 461 struct rb_root *root; in test5()
|
D | hists_cumulate.c | 126 struct rb_root *root_in; in del_hist_entries() 127 struct rb_root *root_out; in del_hist_entries() 180 struct rb_root *root; in do_test() 219 root = &he->callchain->node.rb_root; in do_test()
|
D | hists_common.c | 156 struct rb_root *root; in print_hists_in() 186 struct rb_root *root; in print_hists_out()
|
D | hists_link.c | 150 struct rb_root *root; in __validate_match() 200 struct rb_root *root; in __validate_link()
|
/linux-4.1.27/tools/perf/ui/stdio/ |
D | hist.c | 80 static size_t __callchain__fprintf_graph(FILE *fp, struct rb_root *root, in __callchain__fprintf_graph() 135 ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total, in __callchain__fprintf_graph() 159 static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root, in callchain__fprintf_graph() 204 root = &cnode->rb_root; in callchain__fprintf_graph() 237 static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree, in callchain__fprintf_flat()
|
/linux-4.1.27/drivers/infiniband/hw/mlx4/ |
D | cm.c | 146 struct rb_root *sl_id_map = &to_mdev(ibdev)->sriov.sl_id_map; in id_map_find_by_sl_id() 174 struct rb_root *sl_id_map = &sriov->sl_id_map; in id_map_ent_timeout() 195 struct rb_root *sl_id_map = &sriov->sl_id_map; in id_map_find_del() 212 struct rb_root *sl_id_map = &to_mdev(ibdev)->sriov.sl_id_map; in sl_id_map_add() 416 struct rb_root *sl_id_map = &sriov->sl_id_map; in mlx4_ib_cm_paravirt_clean()
|
D | mlx4_ib.h | 434 struct rb_root mcg_table; 455 struct rb_root sl_id_map;
|
/linux-4.1.27/kernel/trace/ |
D | trace_stat.c | 34 struct rb_root stat_root; 76 static int insert_stat(struct rb_root *root, void *stat, cmp_stat_t cmp) in insert_stat() 127 struct rb_root *root = &session->stat_root; in stat_seq_init()
|
/linux-4.1.27/net/rxrpc/ |
D | ar-internal.h | 65 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/net/ceph/ |
D | auth_x.h | 44 struct rb_root ticket_handlers;
|
D | osdmap.c | 392 struct rb_root *root) in __insert_pg_mapping() 417 static struct ceph_pg_mapping *__lookup_pg_mapping(struct rb_root *root, in __lookup_pg_mapping() 440 static int __remove_pg_mapping(struct rb_root *root, struct ceph_pg pgid) in __remove_pg_mapping() 458 static int __insert_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *new) in __insert_pg_pool() 480 static struct ceph_pg_pool_info *__lookup_pg_pool(struct rb_root *root, u64 id) in __lookup_pg_pool() 532 static void __remove_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *pi) in __remove_pg_pool()
|
/linux-4.1.27/fs/cifs/ |
D | cifs_fs_sb.h | 51 struct rb_root tlink_tree;
|
D | cifsglob.h | 1587 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;
|
D | connect.c | 287 static void tlink_rb_insert(struct rb_root *root, struct tcon_link *new_tlink); 3811 struct rb_root *root = &cifs_sb->tlink_tree; in cifs_umount() 3964 tlink_rb_search(struct rb_root *root, kuid_t uid) in tlink_rb_search() 3984 tlink_rb_insert(struct rb_root *root, struct tcon_link *new_tlink) in tlink_rb_insert() 4101 struct rb_root *root = &cifs_sb->tlink_tree; in cifs_prune_tlinks()
|
/linux-4.1.27/block/ |
D | deadline-iosched.c | 34 struct rb_root sort_list[2]; 56 static inline struct rb_root * 79 struct rb_root *root = deadline_rb_root(dd, rq); in deadline_add_rq_rb()
|
D | elevator.c | 297 void elv_rb_add(struct rb_root *root, struct request *rq) in elv_rb_add() 318 void elv_rb_del(struct rb_root *root, struct request *rq) in elv_rb_del() 326 struct request *elv_rb_find(struct rb_root *root, sector_t sector) in elv_rb_find()
|
D | cfq-iosched.c | 85 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) in rb_erase_init() 2101 cfq_prio_tree_lookup(struct cfq_data *cfqd, struct rb_root *root, in cfq_prio_tree_lookup() 2589 struct rb_root *root = &cfqd->prio_trees[cur_cfqq->org_ioprio]; in cfqq_close()
|
D | blk-throttle.c | 72 struct rb_root pending_tree; /* RB tree of active tgs */ 568 static void rb_erase_init(struct rb_node *n, struct rb_root *root) in rb_erase_init()
|
/linux-4.1.27/fs/ocfs2/cluster/ |
D | nodemanager.h | 63 struct rb_root cl_node_ip_tree;
|
/linux-4.1.27/fs/ocfs2/ |
D | reservations.h | 49 struct rb_root m_reservations;
|
D | uptodate.c | 145 static unsigned int ocfs2_purge_copied_metadata_tree(struct rb_root *root) in ocfs2_purge_copied_metadata_tree() 174 struct rb_root root = RB_ROOT; in ocfs2_metadata_cache_purge()
|
D | reservations.c | 317 struct rb_root *root = &resmap->m_reservations; in ocfs2_resv_insert() 474 struct rb_root *root = &resmap->m_reservations; in __ocfs2_resv_find_window()
|
D | ocfs2.h | 89 struct rb_root ci_tree; 461 struct rb_root osb_rf_lock_tree;
|
/linux-4.1.27/drivers/infiniband/core/ |
D | umem_rbtree.c | 75 int rbt_ib_umem_for_each_in_range(struct rb_root *root, in rbt_ib_umem_for_each_in_range()
|
D | uverbs.h | 95 struct rb_root xrcd_tree;
|
D | multicast.c | 63 struct rb_root table;
|
/linux-4.1.27/tools/perf/ui/browsers/ |
D | hists.c | 164 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__count_rows_rb_tree() 201 static int callchain__count_rows(struct rb_root *chain) in callchain__count_rows() 228 struct rb_node *nd = rb_first(&node->rb_root); in callchain_node__init_have_children_rb_tree() 230 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__init_have_children_rb_tree() 239 !RB_EMPTY_ROOT(&child->rb_root); in callchain_node__init_have_children_rb_tree() 242 !RB_EMPTY_ROOT(&child->rb_root); in callchain_node__init_have_children_rb_tree() 259 chain->ms.has_children = !RB_EMPTY_ROOT(&node->rb_root); in callchain_node__init_have_children() 265 static void callchain__init_have_children(struct rb_root *root) in callchain__init_have_children() 314 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__set_folding_rb_tree() 350 static int callchain__set_folding(struct rb_root *chain, bool unfold) in callchain__set_folding() [all …]
|
D | annotate.c | 39 struct rb_root entries; 283 static void disasm_rb_tree__insert(struct rb_root *root, struct browser_disasm_line *bdl, in disasm_rb_tree__insert()
|
/linux-4.1.27/drivers/mtd/ |
D | mtdswap.c | 84 struct rb_root *root; 98 struct rb_root root; 218 static void __mtdswap_rb_add(struct rb_root *root, struct swap_eb *eb) in __mtdswap_rb_add() 239 struct rb_root *root; in mtdswap_rb_add() 251 static struct rb_node *mtdswap_rb_index(struct rb_root *root, unsigned int idx) in mtdswap_rb_index() 433 struct rb_root hist_root = RB_ROOT; in mtdswap_check_counts() 616 struct rb_root *clean_root; in mtdswap_map_free_block() 854 struct rb_root *root; in mtdswap_choose_wl_tree() 897 struct rb_root *rp = NULL; in mtdswap_pick_gc_eblk() 1234 struct rb_root *root = &d->trees[i].root; in mtdswap_show()
|
/linux-4.1.27/security/keys/ |
D | internal.h | 62 extern struct rb_root key_user_tree; 82 extern struct rb_root key_serial_tree;
|
D | proc.c | 288 static struct rb_node *key_user_first(struct user_namespace *user_ns, struct rb_root *r) in key_user_first()
|
D | key.c | 24 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/fs/ceph/ |
D | mds_client.h | 288 struct rb_root snap_realms; 293 struct rb_root request_tree; /* pending mds requests */
|
D | super.h | 241 struct rb_root index; 275 struct rb_root i_fragtree; 282 struct rb_root i_caps; /* cap list */
|
D | snap.c | 80 static void __insert_snap_realm(struct rb_root *root, in __insert_snap_realm()
|
/linux-4.1.27/fs/xfs/ |
D | xfs_mount.h | 292 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/include/net/ |
D | garp.h | 106 struct rb_root gid;
|
D | mrp.h | 120 struct rb_root mad;
|
/linux-4.1.27/arch/arm/include/asm/xen/ |
D | page.h | 36 extern struct rb_root phys_to_mach;
|
/linux-4.1.27/tools/perf/ui/gtk/ |
D | hists.c | 92 static void perf_gtk__add_callchain(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain() 141 perf_gtk__add_callchain(&node->rb_root, store, &iter, col, in perf_gtk__add_callchain()
|
/linux-4.1.27/fs/ubifs/ |
D | orphan.c | 744 struct rb_root root; 769 static int dbg_ins_check_orphan(struct rb_root *root, ino_t inum) in dbg_ins_check_orphan() 797 static int dbg_find_check_orphan(struct rb_root *root, ino_t inum) in dbg_find_check_orphan() 815 static void dbg_free_check_tree(struct rb_root *root) in dbg_free_check_tree()
|
D | log.c | 552 static int done_already(struct rb_root *done_tree, int lnum) in done_already() 584 static void destroy_done_tree(struct rb_root *done_tree) in destroy_done_tree() 637 struct rb_root done_tree = RB_ROOT; in ubifs_consolidate_log()
|
D | ubifs.h | 1257 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/dlm/ |
D | lock.h | 35 int dlm_search_rsb_tree(struct rb_root *tree, char *name, int len,
|
D | dlm_internal.h | 104 struct rb_root keep; 105 struct rb_root toss;
|
D | debug_fs.c | 424 struct rb_root *tree; in table_seq_start() 506 struct rb_root *tree; in table_seq_next()
|
/linux-4.1.27/net/netfilter/ipset/ |
D | ip_set_hash_netiface.c | 50 rbtree_destroy(struct rb_root *root) in rbtree_destroy() 61 iface_test(struct rb_root *root, const char **iface) in iface_test() 82 iface_add(struct rb_root *root, const char **iface) in iface_add()
|
/linux-4.1.27/fs/ext4/ |
D | extents_status.h | 66 struct rb_root root;
|
D | dir.c | 383 static void free_rb_tree_fname(struct rb_root *root) in free_rb_tree_fname()
|
D | ext4.h | 1311 struct rb_root system_blks; 1895 struct rb_root root; 2673 struct rb_root bb_free_root;
|
/linux-4.1.27/arch/arm/xen/ |
D | p2m.c | 28 struct rb_root phys_to_mach = RB_ROOT;
|
/linux-4.1.27/fs/ext2/ |
D | balloc.c | 199 static void __rsv_window_dump(struct rb_root *root, int verbose, in __rsv_window_dump() 291 search_reserve_window(struct rb_root *root, ext2_fsblk_t goal) in search_reserve_window() 332 struct rb_root *root = &EXT2_SB(sb)->s_rsv_window_root; in ext2_rsv_window_add() 905 struct rb_root *fs_rsv_root = &EXT2_SB(sb)->s_rsv_window_root; in alloc_new_reservation()
|
D | ext2.h | 103 struct rb_root s_rsv_window_root;
|
/linux-4.1.27/security/integrity/ |
D | iint.c | 26 static struct rb_root integrity_iint_tree = RB_ROOT;
|
/linux-4.1.27/kernel/sched/ |
D | sched.h | 347 struct rb_root tasks_timeline; 476 struct rb_root rb_root; member 501 struct rb_root pushable_dl_tasks_root;
|
D | deadline.c | 74 dl_rq->rb_root = RB_ROOT; in init_dl_rq() 825 struct rb_node **link = &dl_rq->rb_root.rb_node; in __enqueue_dl_entity() 847 rb_insert_color(&dl_se->rb_node, &dl_rq->rb_root); in __enqueue_dl_entity() 866 rb_erase(&dl_se->rb_node, &dl_rq->rb_root); in __dequeue_dl_entity()
|
/linux-4.1.27/drivers/base/regmap/ |
D | internal.h | 144 struct rb_root range_tree;
|
D | regcache-rbtree.c | 39 struct rb_root root; 100 static int regcache_rbtree_insert(struct regmap *map, struct rb_root *root, in regcache_rbtree_insert()
|
/linux-4.1.27/fs/proc/ |
D | internal.h | 41 struct rb_root subdir;
|
D | generic.c | 78 struct rb_root *root = &dir->subdir; in pde_subdir_insert()
|
/linux-4.1.27/drivers/net/ethernet/mellanox/mlx5/core/ |
D | pagealloc.c | 107 struct rb_root *root = &dev->priv.page_root; in insert_page() 145 struct rb_root *root = &dev->priv.page_root; in find_fw_page()
|
/linux-4.1.27/kernel/power/ |
D | wakelock.c | 34 static struct rb_root wakelocks_tree = RB_ROOT;
|
/linux-4.1.27/fs/gfs2/ |
D | incore.h | 103 struct rb_root rd_rstree; /* multi-block reservation tree */ 726 struct rb_root sd_rindex_tree;
|
/linux-4.1.27/drivers/infiniband/hw/qib/ |
D | qib_user_sdma.c | 58 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) in qib_user_sdma_rb_search() 160 qib_user_sdma_rb_insert(struct rb_root *root, struct qib_user_sdma_rb_node *new) in qib_user_sdma_rb_insert()
|
D | qib_verbs.h | 682 struct rb_root mcast_tree;
|
/linux-4.1.27/arch/x86/platform/uv/ |
D | uv_irq.c | 29 static struct rb_root uv_irq_root;
|
/linux-4.1.27/net/core/ |
D | gen_estimator.c | 110 static struct rb_root est_root = RB_ROOT;
|
/linux-4.1.27/drivers/infiniband/ulp/ipoib/ |
D | ipoib.h | 322 struct rb_root path_tree; 329 struct rb_root multicast_tree;
|
/linux-4.1.27/fs/overlayfs/ |
D | readdir.c | 40 struct rb_root root; 62 static struct ovl_cache_entry *ovl_cache_entry_find(struct rb_root *root, in ovl_cache_entry_find()
|
/linux-4.1.27/drivers/infiniband/hw/ipath/ |
D | ipath_verbs_mcast.c | 46 static struct rb_root mcast_tree;
|
D | ipath_user_sdma.c | 94 struct rb_root dma_pages_root;
|
/linux-4.1.27/fs/nilfs2/ |
D | the_nilfs.h | 166 struct rb_root ns_cptree;
|
/linux-4.1.27/fs/afs/ |
D | internal.h | 283 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) */
|
D | server.c | 21 static struct rb_root afs_servers = RB_ROOT;
|
/linux-4.1.27/arch/powerpc/perf/ |
D | hv-24x7.c | 526 static int event_uniq_add(struct rb_root *root, const char *name, int nl, in event_uniq_add() 573 static void event_uniq_destroy(struct rb_root *root) in event_uniq_destroy() 667 struct rb_root ev_uniq = RB_ROOT; in create_events_from_catalog()
|
/linux-4.1.27/fs/ext3/ |
D | balloc.c | 207 static void __rsv_window_dump(struct rb_root *root, int verbose, in __rsv_window_dump() 299 search_reserve_window(struct rb_root *root, ext3_fsblk_t goal) in search_reserve_window() 340 struct rb_root *root = &EXT3_SB(sb)->s_rsv_window_root; in ext3_rsv_window_add() 1119 struct rb_root *fs_rsv_root = &EXT3_SB(sb)->s_rsv_window_root; in alloc_new_reservation()
|
D | ext3.h | 666 struct rb_root s_rsv_window_root; 962 struct rb_root root;
|
D | dir.c | 310 static void free_rb_tree_fname(struct rb_root *root) in free_rb_tree_fname()
|
/linux-4.1.27/drivers/gpu/drm/radeon/ |
D | radeon_mn.c | 53 struct rb_root objects;
|
/linux-4.1.27/fs/cachefiles/ |
D | internal.h | 67 struct rb_root active_nodes; /* active nodes (can't be culled) */
|
/linux-4.1.27/drivers/staging/android/ion/ |
D | ion.c | 55 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, in ion_get_client_serial()
|
/linux-4.1.27/net/rds/ |
D | cong.c | 102 static struct rb_root rds_cong_tree = RB_ROOT;
|
D | rds.h | 511 struct rb_root rs_rdma_keys;
|
D | rdma.c | 66 static struct rds_mr *rds_mr_tree_walk(struct rb_root *root, u64 key, in rds_mr_tree_walk()
|
/linux-4.1.27/tools/lib/lockdep/ |
D | preload.c | 37 static struct rb_root locks = RB_ROOT;
|
/linux-4.1.27/fs/fscache/ |
D | object-list.c | 20 static struct rb_root fscache_object_list;
|
/linux-4.1.27/arch/sh/kernel/ |
D | dwarf.c | 44 static struct rb_root cie_root; 47 static struct rb_root fde_root;
|
/linux-4.1.27/drivers/staging/lustre/lustre/osc/ |
D | osc_cl_internal.h | 143 struct rb_root oo_root;
|
/linux-4.1.27/fs/nfs/ |
D | fscache.c | 28 static struct rb_root nfs_fscache_keys = RB_ROOT;
|
/linux-4.1.27/drivers/md/ |
D | dm-bio-prison.c | 22 struct rb_root cells;
|
D | dm-crypt.c | 138 struct rb_root write_tree; 1182 struct rb_root write_tree; in dmcrypt_write()
|
/linux-4.1.27/fs/fuse/ |
D | fuse_i.h | 439 struct rb_root polled_files;
|
/linux-4.1.27/drivers/block/xen-blkback/ |
D | common.h | 290 struct rb_root persistent_gnts;
|
D | blkback.c | 268 static void free_persistent_gnts(struct xen_blkif *blkif, struct rb_root *root, in free_persistent_gnts() 357 struct rb_root *root; in purge_persistent_gnt()
|
/linux-4.1.27/drivers/iommu/ |
D | iova.c | 224 iova_insert_rbtree(struct rb_root *root, struct iova *iova) in iova_insert_rbtree()
|
/linux-4.1.27/drivers/xen/ |
D | evtchn.c | 60 struct rb_root evtchns;
|
/linux-4.1.27/drivers/md/bcache/ |
D | bcache.h | 240 struct rb_root keys;
|
/linux-4.1.27/net/wireless/ |
D | core.h | 69 struct rb_root bss_tree;
|
/linux-4.1.27/drivers/android/ |
D | binder.c | 297 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/tools/perf/ui/ |
D | browser.c | 112 struct rb_root *root = browser->entries; in ui_browser__rb_tree_seek()
|
/linux-4.1.27/include/linux/mlx5/ |
D | driver.h | 478 struct rb_root page_root;
|
/linux-4.1.27/drivers/char/ |
D | mmtimer.c | 244 struct rb_root timer_head;
|
/linux-4.1.27/drivers/gpu/drm/i915/ |
D | i915_gem_userptr.c | 51 struct rb_root objects;
|
/linux-4.1.27/fs/logfs/ |
D | logfs.h | 167 struct rb_root rb_tree;
|
/linux-4.1.27/drivers/vfio/ |
D | vfio_iommu_type1.c | 59 struct rb_root dma_list;
|