| /Linux-v4.19/tools/perf/tests/ |
| D | hists_output.c | 108 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
166 he = rb_entry(node, struct hist_entry, rb_node); in test1()
172 he = rb_entry(node, struct hist_entry, rb_node); in test1()
178 he = rb_entry(node, struct hist_entry, rb_node); in test1()
184 he = rb_entry(node, struct hist_entry, rb_node); in test1()
190 he = rb_entry(node, struct hist_entry, rb_node); in test1()
196 he = rb_entry(node, struct hist_entry, rb_node); in test1()
202 he = rb_entry(node, struct hist_entry, rb_node); in test1()
208 he = rb_entry(node, struct hist_entry, rb_node); in test1()
214 he = rb_entry(node, struct hist_entry, rb_node); in test1()
[all …]
|
| /Linux-v4.19/fs/f2fs/ |
| D | extent_cache.c | 21 static struct rb_entry *__lookup_rb_tree_fast(struct rb_entry *cached_re, in __lookup_rb_tree_fast()
33 static struct rb_entry *__lookup_rb_tree_slow(struct rb_root *root, in __lookup_rb_tree_slow()
37 struct rb_entry *re; in __lookup_rb_tree_slow()
40 re = rb_entry(node, struct rb_entry, rb_node); in __lookup_rb_tree_slow()
52 struct rb_entry *f2fs_lookup_rb_tree(struct rb_root *root, in f2fs_lookup_rb_tree()
53 struct rb_entry *cached_re, unsigned int ofs) in f2fs_lookup_rb_tree()
55 struct rb_entry *re; in f2fs_lookup_rb_tree()
69 struct rb_entry *re; in f2fs_lookup_rb_tree_for_insert()
73 re = rb_entry(*parent, struct rb_entry, rb_node); in f2fs_lookup_rb_tree_for_insert()
95 struct rb_entry *f2fs_lookup_rb_tree_ret(struct rb_root *root, in f2fs_lookup_rb_tree_ret()
[all …]
|
| /Linux-v4.19/include/linux/ |
| D | interval_tree_generic.h | 49 subtree_last = rb_entry(node->ITRB.rb_left, \
55 subtree_last = rb_entry(node->ITRB.rb_right, \
78 parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \
119 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
138 node = rb_entry(node->ITRB.rb_right, \
170 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
174 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \
195 ITSTRUCT *right = rb_entry(rb, ITSTRUCT, ITRB); \
207 node = rb_entry(rb, ITSTRUCT, ITRB); \
|
| D | rbtree_augmented.h | 81 rbstruct *node = rb_entry(rb, rbstruct, rbfield); \
92 rbstruct *old = rb_entry(rb_old, rbstruct, rbfield); \
93 rbstruct *new = rb_entry(rb_new, rbstruct, rbfield); \
99 rbstruct *old = rb_entry(rb_old, rbstruct, rbfield); \
100 rbstruct *new = rb_entry(rb_new, rbstruct, rbfield); \
|
| /Linux-v4.19/fs/jffs2/ |
| D | nodelist.h | 334 return rb_entry(node, struct jffs2_node_frag, rb); in frag_first()
344 return rb_entry(node, struct jffs2_node_frag, rb); in frag_last()
347 #define frag_next(frag) rb_entry(rb_next(&(frag)->rb), struct jffs2_node_frag, rb)
348 #define frag_prev(frag) rb_entry(rb_prev(&(frag)->rb), struct jffs2_node_frag, rb)
349 #define frag_parent(frag) rb_entry(rb_parent(&(frag)->rb), struct jffs2_node_frag, rb)
350 #define frag_left(frag) rb_entry((frag)->rb.rb_left, struct jffs2_node_frag, rb)
351 #define frag_right(frag) rb_entry((frag)->rb.rb_right, struct jffs2_node_frag, rb)
354 #define tn_next(tn) rb_entry(rb_next(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
355 #define tn_prev(tn) rb_entry(rb_prev(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
356 #define tn_parent(tn) rb_entry(rb_parent(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
[all …]
|
| /Linux-v4.19/drivers/block/drbd/ |
| D | drbd_interval.c | 12 struct drbd_interval *this = rb_entry(node, struct drbd_interval, rb); in interval_end()
57 rb_entry(*new, struct drbd_interval, rb); in drbd_insert_interval()
98 rb_entry(node, struct drbd_interval, rb); in drbd_contains_interval()
145 rb_entry(node, struct drbd_interval, rb); in drbd_find_overlap()
174 i = rb_entry(node, struct drbd_interval, rb); in drbd_next_overlap()
|
| /Linux-v4.19/fs/ext4/ |
| D | block_validity.c | 67 entry = rb_entry(parent, struct ext4_system_zone, node); in add_system_zone()
78 new_entry = rb_entry(new_node, struct ext4_system_zone, in add_system_zone()
100 entry = rb_entry(node, struct ext4_system_zone, node); in add_system_zone()
112 entry = rb_entry(node, struct ext4_system_zone, node); in add_system_zone()
131 entry = rb_entry(node, struct ext4_system_zone, node); in debug_print_tree()
210 entry = rb_entry(n, struct ext4_system_zone, node); in ext4_data_block_valid()
|
| /Linux-v4.19/net/ceph/ |
| D | debugfs.c | 71 rb_entry(n, struct ceph_pg_pool_info, node); in osdmap_show()
92 rb_entry(n, struct ceph_pg_mapping, node); in osdmap_show()
103 rb_entry(n, struct ceph_pg_mapping, node); in osdmap_show()
110 rb_entry(n, struct ceph_pg_mapping, node); in osdmap_show()
121 rb_entry(n, struct ceph_pg_mapping, node); in osdmap_show()
160 req = rb_entry(rp, struct ceph_mon_generic_request, node); in monc_show()
236 rb_entry(n, struct ceph_osd_request, r_node); in dump_requests()
262 rb_entry(n, struct ceph_osd_linger_request, node); in dump_linger_requests()
323 rb_entry(n, struct ceph_osd_backoff, id_node); in dump_backoffs()
348 struct ceph_osd *osd = rb_entry(n, struct ceph_osd, o_node); in osdc_show()
[all …]
|
| /Linux-v4.19/fs/btrfs/ |
| D | extent_map.c | 103 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
116 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
123 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
126 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
152 entry = rb_entry(n, struct extent_map, rb_node); in __tree_search()
168 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
175 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
178 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
234 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
253 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
[all …]
|
| D | ordered-data.c | 37 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); in tree_insert()
74 entry = rb_entry(n, struct btrfs_ordered_extent, rb_node); in __tree_search()
92 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
100 prev_entry = rb_entry(prev, struct btrfs_ordered_extent, in __tree_search()
106 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
147 entry = rb_entry(tree->last, struct btrfs_ordered_extent, in tree_search()
319 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_dec_test_first_ordered_pending()
391 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_dec_test_ordered_pending()
742 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_ordered_extent()
772 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_ordered_range()
[all …]
|
| D | ref-verify.c | 84 entry = rb_entry(parent_node, struct block_entry, node); in insert_block_entry()
105 entry = rb_entry(n, struct block_entry, node); in lookup_block_entry()
125 entry = rb_entry(parent_node, struct root_entry, node); in insert_root_entry()
171 entry = rb_entry(parent_node, struct ref_entry, node); in insert_ref_entry()
194 entry = rb_entry(n, struct root_entry, node); in lookup_root_entry()
251 re = rb_entry(n, struct root_entry, node); in free_block_entry()
257 ref = rb_entry(n, struct ref_entry, node); in free_block_entry()
654 ref = rb_entry(n, struct ref_entry, node); in dump_block_entry()
662 re = rb_entry(n, struct root_entry, node); in dump_block_entry()
902 be = rb_entry(n, struct block_entry, node); in btrfs_free_ref_cache()
[all …]
|
| /Linux-v4.19/arch/x86/mm/ |
| D | pat_rbtree.c | 51 struct memtype *data = rb_entry(node, struct memtype, rb); in get_subtree_max_end()
83 struct memtype *data = rb_entry(node, struct memtype, rb); in RB_DECLARE_CALLBACKS()
125 match = rb_entry(node, struct memtype, rb); in memtype_rb_match()
154 match = rb_entry(node, struct memtype, rb); in memtype_rb_check_conflict()
185 struct memtype *data = rb_entry(*node, struct memtype, rb); in memtype_rb_insert()
274 struct memtype *this = rb_entry(node, struct memtype, rb); in rbt_memtype_copy_nth_element()
|
| /Linux-v4.19/security/keys/ |
| D | proc.c | 75 struct key *key = rb_entry(n, struct key, serial_node); in key_serial_next()
90 struct key *key = rb_entry(n, struct key, serial_node); in find_ge_key()
113 minkey = rb_entry(n, struct key, serial_node); in find_ge_key()
136 struct key *key = rb_entry(n, struct key, serial_node); in key_node_serial()
159 struct key *key = rb_entry(_p, struct key, serial_node); in proc_keys_show()
256 struct key_user *user = rb_entry(n, struct key_user, node); in __key_user_next()
307 struct key_user *user = rb_entry(_p, struct key_user, node); in proc_key_users_show()
|
| /Linux-v4.19/tools/include/linux/ |
| D | rbtree_augmented.h | 72 rbstruct *node = rb_entry(rb, rbstruct, rbfield); \
83 rbstruct *old = rb_entry(rb_old, rbstruct, rbfield); \
84 rbstruct *new = rb_entry(rb_new, rbstruct, rbfield); \
90 rbstruct *old = rb_entry(rb_old, rbstruct, rbfield); \
91 rbstruct *new = rb_entry(rb_new, rbstruct, rbfield); \
|
| /Linux-v4.19/drivers/gpu/drm/ |
| D | drm_vma_manager.c | 155 node = rb_entry(iter, struct drm_mm_node, rb); in drm_vma_offset_lookup_locked()
285 entry = rb_entry(*iter, struct drm_vma_offset_file, vm_rb); in drm_vma_node_allow()
338 entry = rb_entry(iter, struct drm_vma_offset_file, vm_rb); in drm_vma_node_revoke()
379 entry = rb_entry(iter, struct drm_vma_offset_file, vm_rb); in drm_vma_node_is_allowed()
|
| /Linux-v4.19/lib/ |
| D | rbtree_test.c | 38 if (key < rb_entry(parent, struct test_node, rb)->key) in insert()
56 if (key < rb_entry(parent, struct test_node, rb)->key) in insert_cached()
83 child_augmented = rb_entry(node->rb.rb_left, struct test_node, in augment_recompute()
89 child_augmented = rb_entry(node->rb.rb_right, struct test_node, in augment_recompute()
110 parent = rb_entry(rb_parent, struct test_node, rb); in RB_DECLARE_CALLBACKS()
135 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented_cached()
213 struct test_node *node = rb_entry(rb, struct test_node, rb); in check()
239 struct test_node *node = rb_entry(rb, struct test_node, rb); in check_augmented()
|
| /Linux-v4.19/tools/perf/util/ |
| D | hist.c | 219 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
301 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
344 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
360 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
521 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
1295 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1411 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1487 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1572 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1591 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
[all …]
|
| D | rb_resort.h | 66 a = rb_entry(nda, struct __name##_sorted_entry, rb_node); \
67 b = rb_entry(ndb, struct __name##_sorted_entry, rb_node); \
129 __name##_entry = rb_entry(__nd, struct __name##_sorted_entry, \
|
| D | map.c | 290 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_start()
300 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_end()
517 struct map *pos = rb_entry(next, struct map, rb_node); in __maps__purge()
595 struct map *pos = rb_entry(nd, struct map, rb_node); in maps__find_symbol_by_name()
647 struct map *pos = rb_entry(nd, struct map, rb_node); in maps__fprintf()
689 struct map *pos = rb_entry(next, struct map, rb_node); in maps__fixup_overlappings()
702 struct map *pos = rb_entry(next, struct map, rb_node); in maps__fixup_overlappings()
818 m = rb_entry(parent, struct map, rb_node); in __maps__insert()
860 m = rb_entry(parent, struct map, rb_node); in maps__find()
880 return rb_entry(first, struct map, rb_node); in maps__first()
[all …]
|
| D | symbol.c | 177 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
180 next = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
208 curr = rb_entry(prevnd, struct symbol, rb_node); in symbols__fixup_end()
212 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_end()
291 pos = rb_entry(next, struct symbol, rb_node); in symbols__delete()
318 s = rb_entry(parent, struct symbol, rb_node); in __symbols__insert()
343 struct symbol *s = rb_entry(n, struct symbol, rb_node); in symbols__find()
361 return rb_entry(n, struct symbol, rb_node); in symbols__first()
371 return rb_entry(n, struct symbol, rb_node); in symbols__last()
381 return rb_entry(n, struct symbol, rb_node); in symbols__next()
[all …]
|
| /Linux-v4.19/arch/powerpc/kernel/ |
| D | eeh_cache.c | 69 piar = rb_entry(n, struct pci_io_addr_range, rb_node); in __eeh_addr_cache_get_device()
115 piar = rb_entry(n, struct pci_io_addr_range, rb_node); in eeh_addr_cache_print()
137 piar = rb_entry(parent, struct pci_io_addr_range, rb_node); in eeh_addr_cache_insert()
240 piar = rb_entry(n, struct pci_io_addr_range, rb_node); in __eeh_addr_cache_rmv_dev()
|
| /Linux-v4.19/drivers/net/ethernet/mellanox/mlx5/core/ |
| D | fs_counters.c | 80 struct mlx5_fc *this = rb_entry(*new, struct mlx5_fc, node); in mlx5_fc_stats_insert()
134 struct mlx5_fc *counter = rb_entry(node, struct mlx5_fc, node); in mlx5_fc_stats_query()
185 counter = rb_entry(node, struct mlx5_fc, node); in mlx5_fc_stats_work()
206 counter = rb_entry(node, struct mlx5_fc, node); in mlx5_fc_stats_work()
305 counter = rb_entry(node, struct mlx5_fc, node); in mlx5_cleanup_fc_stats()
|
| /Linux-v4.19/fs/ocfs2/ |
| D | reservations.c | 98 resv = rb_entry(node, struct ocfs2_alloc_reservation, r_node); in ocfs2_dump_resv()
153 resv = rb_entry(node, struct ocfs2_alloc_reservation, r_node); in ocfs2_check_resmap()
288 resv = rb_entry(node, struct ocfs2_alloc_reservation, r_node); in ocfs2_resmap_clear_all_resv()
329 tmp = rb_entry(parent, struct ocfs2_alloc_reservation, r_node); in ocfs2_resv_insert()
380 resv = rb_entry(node, struct ocfs2_alloc_reservation, r_node); in ocfs2_find_resv_lhs()
538 next_resv = rb_entry(next, struct ocfs2_alloc_reservation, in __ocfs2_resv_find_window()
575 next_resv = rb_entry(next, in __ocfs2_resv_find_window()
618 prev_resv = rb_entry(prev, struct ocfs2_alloc_reservation, in __ocfs2_resv_find_window()
|
| /Linux-v4.19/Documentation/ |
| D | rbtree.txt | 71 individual members may be accessed directly via rb_entry(node, type, member).
188 rb_entry(node, type, member).
194 printk("key=%s\n", rb_entry(node, struct mytype, node)->keystring);
309 node = rb_entry(root->rb_node, struct interval_tree_node, rb);
314 rb_entry(node->rb.rb_left,
333 node = rb_entry(node->rb.rb_right,
350 subtree_last = rb_entry(node->rb.rb_left,
356 subtree_last = rb_entry(node->rb.rb_right,
368 rb_entry(rb, struct interval_tree_node, rb);
380 rb_entry(rb_old, struct interval_tree_node, rb);
[all …]
|
| /Linux-v4.19/arch/arm/xen/ |
| D | p2m.c | 40 entry = rb_entry(parent, struct xen_p2m_entry, rbnode_phys); in xen_add_phys_to_mach_entry()
70 entry = rb_entry(n, struct xen_p2m_entry, rbnode_phys); in __pfn_to_mfn()
130 p2m_entry = rb_entry(n, struct xen_p2m_entry, rbnode_phys); in __set_phys_to_machine_multi()
|
