Home
last modified time | relevance | path

Searched refs:rb_entry (Results 1 – 25 of 271) sorted by relevance

1234567891011

/linux-6.3-rc2/tools/perf/tests/
A Dhists_output.c109 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
167 he = rb_entry(node, struct hist_entry, rb_node); in test1()
173 he = rb_entry(node, struct hist_entry, rb_node); in test1()
179 he = rb_entry(node, struct hist_entry, rb_node); in test1()
185 he = rb_entry(node, struct hist_entry, rb_node); in test1()
191 he = rb_entry(node, struct hist_entry, rb_node); in test1()
197 he = rb_entry(node, struct hist_entry, rb_node); in test1()
203 he = rb_entry(node, struct hist_entry, rb_node); in test1()
209 he = rb_entry(node, struct hist_entry, rb_node); in test1()
215 he = rb_entry(node, struct hist_entry, rb_node); in test1()
[all …]
/linux-6.3-rc2/fs/f2fs/
A Dextent_cache.c164 static struct rb_entry *__lookup_rb_tree_fast(struct rb_entry *cached_re, in __lookup_rb_tree_fast()
180 struct rb_entry *re; in __lookup_rb_tree_slow()
183 re = rb_entry(node, struct rb_entry, rb_node); in __lookup_rb_tree_slow()
198 struct rb_entry *re; in f2fs_lookup_rb_tree()
213 struct rb_entry *re; in f2fs_lookup_rb_tree_ext()
217 re = rb_entry(*parent, struct rb_entry, rb_node); in f2fs_lookup_rb_tree_ext()
240 re = rb_entry(*parent, struct rb_entry, rb_node); in f2fs_lookup_rb_tree_for_insert()
295 re = rb_entry(*pnode, struct rb_entry, rb_node); in f2fs_lookup_rb_tree_ret()
311 re = rb_entry(parent, struct rb_entry, rb_node); in f2fs_lookup_rb_tree_ret()
352 cur_re = rb_entry(cur, struct rb_entry, rb_node); in f2fs_check_rb_tree_consistence()
[all …]
/linux-6.3-rc2/tools/include/linux/
A Dinterval_tree_generic.h48 parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \
89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
108 node = rb_entry(node->ITRB.rb_right, \
140 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
144 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \
165 ITSTRUCT *right = rb_entry(rb, ITSTRUCT, ITRB); \
177 node = rb_entry(rb, ITSTRUCT, ITRB); \
A Drbtree_augmented.h82 RBSTRUCT *node = rb_entry(rb, RBSTRUCT, RBFIELD); \
91 RBSTRUCT *old = rb_entry(rb_old, RBSTRUCT, RBFIELD); \
92 RBSTRUCT *new = rb_entry(rb_new, RBSTRUCT, RBFIELD); \
98 RBSTRUCT *old = rb_entry(rb_old, RBSTRUCT, RBFIELD); \
99 RBSTRUCT *new = rb_entry(rb_new, RBSTRUCT, RBFIELD); \
129 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \
134 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
/linux-6.3-rc2/include/linux/
A Dinterval_tree_generic.h48 parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \
89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
108 node = rb_entry(node->ITRB.rb_right, \
140 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
144 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \
165 ITSTRUCT *right = rb_entry(rb, ITSTRUCT, ITRB); \
177 node = rb_entry(rb, ITSTRUCT, ITRB); \
A Drbtree_augmented.h80 RBSTRUCT *node = rb_entry(rb, RBSTRUCT, RBFIELD); \
89 RBSTRUCT *old = rb_entry(rb_old, RBSTRUCT, RBFIELD); \
90 RBSTRUCT *new = rb_entry(rb_new, RBSTRUCT, RBFIELD); \
96 RBSTRUCT *old = rb_entry(rb_old, RBSTRUCT, RBFIELD); \
97 RBSTRUCT *new = rb_entry(rb_new, RBSTRUCT, RBFIELD); \
127 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \
132 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
/linux-6.3-rc2/Documentation/translations/zh_CN/core-api/
A Drbtree.rst65 宏访问。此外，个体成员可直接用rb_entry(node, type, member)访问。
175 标准的container_of()宏访问。此外，个体成员可直接用rb_entry(node, type, member)
276 rb_entry(node->rb.rb_left,
295 node = rb_entry(node->rb.rb_right,
312 subtree_last = rb_entry(node->rb.rb_left,
318 subtree_last = rb_entry(node->rb.rb_right,
330 rb_entry(rb, struct interval_tree_node, rb);
342 rb_entry(rb_old, struct interval_tree_node, rb);
344 rb_entry(rb_new, struct interval_tree_node, rb);
352 rb_entry(rb_old, struct interval_tree_node, rb);
[all …]
/linux-6.3-rc2/fs/jffs2/
A Dnodelist.h334 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)
350 #define frag_left(frag) rb_entry((frag)->rb.rb_left, 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)
357 #define tn_left(tn) rb_entry((tn)->rb.rb_left, struct jffs2_tmp_dnode_info, rb)
358 #define tn_right(tn) rb_entry((tn)->rb.rb_right, struct jffs2_tmp_dnode_info, rb)
360 #define tn_last(list) rb_entry(rb_last(list), struct jffs2_tmp_dnode_info, rb)
[all …]
/linux-6.3-rc2/drivers/block/drbd/
A Ddrbd_interval.c12 struct drbd_interval *this = rb_entry(node, struct drbd_interval, rb); in interval_end()
34 rb_entry(*new, struct drbd_interval, rb); in drbd_insert_interval()
76 rb_entry(node, struct drbd_interval, rb); in drbd_contains_interval()
128 rb_entry(node, struct drbd_interval, rb); in drbd_find_overlap()
157 i = rb_entry(node, struct drbd_interval, rb); in drbd_next_overlap()
/linux-6.3-rc2/net/ceph/
A Ddebugfs.c71 rb_entry(n, struct ceph_pg_pool_info, node); in osdmap_show()
94 rb_entry(n, struct ceph_pg_mapping, node); in osdmap_show()
105 rb_entry(n, struct ceph_pg_mapping, node); in osdmap_show()
112 rb_entry(n, struct ceph_pg_mapping, node); in osdmap_show()
123 rb_entry(n, struct ceph_pg_mapping, node); in osdmap_show()
162 req = rb_entry(rp, struct ceph_mon_generic_request, node); in monc_show()
241 rb_entry(n, struct ceph_osd_request, r_node); in dump_requests()
267 rb_entry(n, struct ceph_osd_linger_request, node); in dump_linger_requests()
328 rb_entry(n, struct ceph_osd_backoff, id_node); in dump_backoffs()
353 struct ceph_osd *osd = rb_entry(n, struct ceph_osd, o_node); in osdc_show()
[all …]
/linux-6.3-rc2/security/keys/
A Dproc.c70 struct key *key = rb_entry(n, struct key, serial_node); in key_serial_next()
85 struct key *key = rb_entry(n, struct key, serial_node); in find_ge_key()
108 minkey = rb_entry(n, struct key, serial_node); in find_ge_key()
131 struct key *key = rb_entry(n, struct key, serial_node); in key_node_serial()
156 struct key *key = rb_entry(_p, struct key, serial_node); in proc_keys_show()
255 struct key_user *user = rb_entry(n, struct key_user, node); in __key_user_next()
306 struct key_user *user = rb_entry(_p, struct key_user, node); in proc_key_users_show()
/linux-6.3-rc2/arch/powerpc/kernel/
A Deeh_cache.c60 piar = rb_entry(n, struct pci_io_addr_range, rb_node); in __eeh_addr_cache_get_device()
106 piar = rb_entry(n, struct pci_io_addr_range, rb_node); in eeh_addr_cache_print()
128 piar = rb_entry(parent, struct pci_io_addr_range, rb_node); in eeh_addr_cache_insert()
221 piar = rb_entry(n, struct pci_io_addr_range, rb_node); in __eeh_addr_cache_rmv_dev()
271 piar = rb_entry(n, struct pci_io_addr_range, rb_node); in eeh_addr_cache_show()
/linux-6.3-rc2/lib/
A Drbtree_test.c39 if (key < rb_entry(parent, struct test_node, rb)->key) in insert()
57 if (key < rb_entry(parent, struct test_node, rb)->key) in insert_cached()
95 parent = rb_entry(rb_parent, struct test_node, rb); in RB_DECLARE_CALLBACKS_MAX()
120 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented_cached()
198 struct test_node *node = rb_entry(rb, struct test_node, rb); in check()
224 struct test_node *node = rb_entry(rb, struct test_node, rb); in check_augmented()
227 subtree = rb_entry(node->rb.rb_left, struct test_node, in check_augmented()
233 subtree = rb_entry(node->rb.rb_right, struct test_node, in check_augmented()
/linux-6.3-rc2/net/netfilter/
A Dnft_set_rbtree.c64 rbe = rb_entry(parent, struct nft_rbtree_elem, node); in __nft_rbtree_lookup()
145 rbe = rb_entry(parent, struct nft_rbtree_elem, node); in __nft_rbtree_get()
233 rbe_prev = rb_entry(prev, struct nft_rbtree_elem, node); in nft_rbtree_gc_elem()
256 first_elem = rb_entry(first, struct nft_rbtree_elem, node); in nft_rbtree_update_first()
284 rbe = rb_entry(parent, struct nft_rbtree_elem, node); in __nft_rbtree_insert()
311 rbe = rb_entry(node, struct nft_rbtree_elem, node); in __nft_rbtree_insert()
415 rbe = rb_entry(parent, struct nft_rbtree_elem, node); in __nft_rbtree_insert()
498 rbe = rb_entry(parent, struct nft_rbtree_elem, node); in nft_rbtree_deactivate()
537 rbe = rb_entry(node, struct nft_rbtree_elem, node); in nft_rbtree_walk()
577 rbe = rb_entry(node, struct nft_rbtree_elem, node); in nft_rbtree_gc()
[all …]
/linux-6.3-rc2/fs/btrfs/
A Dordered-data.c45 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()
136 entry = rb_entry(tree->last, struct btrfs_ordered_extent, in tree_search()
331 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_mark_ordered_io_finished()
343 entry = rb_entry(node, struct btrfs_ordered_extent, in btrfs_mark_ordered_io_finished()
460 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_dec_test_ordered_pending()
835 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_ordered_extent()
[all …]
A Dmisc.h75 entry = rb_entry(node, struct rb_simple_node, rb_node); in rb_simple_search()
103 entry = rb_entry(node, struct rb_simple_node, rb_node); in rb_simple_search_first()
131 entry = rb_entry(parent, struct rb_simple_node, rb_node); in rb_simple_insert()
A Dextent_map.c95 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
110 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
117 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
120 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
147 entry = rb_entry(n, struct extent_map, rb_node); in __tree_search()
162 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()
250 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
270 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
438 em = rb_entry(rb_node, struct extent_map, rb_node); in __lookup_extent_mapping()
[all …]
/linux-6.3-rc2/drivers/gpu/drm/
A Ddrm_vma_manager.c152 node = rb_entry(iter, struct drm_mm_node, rb); in drm_vma_offset_lookup_locked()
263 entry = rb_entry(*iter, struct drm_vma_offset_file, vm_rb); in vma_node_allow()
367 entry = rb_entry(iter, struct drm_vma_offset_file, vm_rb); in drm_vma_node_revoke()
408 entry = rb_entry(iter, struct drm_vma_offset_file, vm_rb); in drm_vma_node_is_allowed()
/linux-6.3-rc2/fs/ext4/
A Dextents_status.c186 es = rb_entry(node, struct extent_status, rb_node); in ext4_es_print_tree()
215 es = rb_entry(node, struct extent_status, rb_node); in __es_tree_search()
285 es1 = rb_entry(node, struct extent_status, rb_node); in __es_find_extent_range()
546 es1 = rb_entry(node, struct extent_status, rb_node); in ext4_es_try_to_merge_left()
570 es1 = rb_entry(node, struct extent_status, rb_node); in ext4_es_try_to_merge_right()
970 es1 = rb_entry(node, struct extent_status, in ext4_es_lookup_extent()
1027 rc->left_es = node ? rb_entry(node, in init_rsvd()
1220 es = node ? rb_entry(node, struct extent_status, in get_rsvd()
1233 es = rb_entry(node, struct extent_status, in get_rsvd()
1278 pr = rb_entry(node, struct pending_reservation, in get_rsvd()
[all …]
A Dblock_validity.c79 entry = rb_entry(parent, struct ext4_system_zone, node); in add_system_zone()
103 entry = rb_entry(node, struct ext4_system_zone, node); in add_system_zone()
115 entry = rb_entry(node, struct ext4_system_zone, node); in add_system_zone()
137 entry = rb_entry(node, struct ext4_system_zone, node); in debug_print_tree()
321 entry = rb_entry(n, struct ext4_system_zone, node); in ext4_sb_block_valid()
/linux-6.3-rc2/tools/perf/util/
A Dhist.c261 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
347 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
390 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
406 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
420 n = rb_entry(next, struct hist_entry, rb_node); in hists__get_entry()
1664 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1749 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1927 n = rb_entry(next, struct hist_entry, rb_node_in); in output_resort()
1992 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2041 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
[all …]
A Drb_resort.h66 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, \
/linux-6.3-rc2/fs/ocfs2/
A Dreservations.c85 resv = rb_entry(node, struct ocfs2_alloc_reservation, r_node); in ocfs2_dump_resv()
140 resv = rb_entry(node, struct ocfs2_alloc_reservation, r_node); in ocfs2_check_resmap()
273 resv = rb_entry(node, struct ocfs2_alloc_reservation, r_node); in ocfs2_resmap_clear_all_resv()
314 tmp = rb_entry(parent, struct ocfs2_alloc_reservation, r_node); in ocfs2_resv_insert()
365 resv = rb_entry(node, struct ocfs2_alloc_reservation, r_node); in ocfs2_find_resv_lhs()
523 next_resv = rb_entry(next, struct ocfs2_alloc_reservation, in __ocfs2_resv_find_window()
560 next_resv = rb_entry(next, in __ocfs2_resv_find_window()
603 prev_resv = rb_entry(prev, struct ocfs2_alloc_reservation, in __ocfs2_resv_find_window()
/linux-6.3-rc2/kernel/locking/
A Drtmutex_common.h108 return rb_entry(leftmost, struct rt_mutex_waiter, tree_entry) == waiter; in rt_mutex_waiter_is_top_waiter()
117 w = rb_entry(leftmost, struct rt_mutex_waiter, tree_entry); in rt_mutex_top_waiter()
130 return rb_entry(p->pi_waiters.rb_leftmost, struct rt_mutex_waiter, in task_top_pi_waiter()
/linux-6.3-rc2/drivers/base/regmap/
A Dregcache-rbtree.c80 rbnode = rb_entry(node, struct regcache_rbtree_node, node); in regcache_rbtree_lookup()
107 rbnode_tmp = rb_entry(*new, struct regcache_rbtree_node, node); in regcache_rbtree_insert()
150 n = rb_entry(node, struct regcache_rbtree_node, node); in rbtree_show()
227 rbtree_node = rb_entry(next, struct regcache_rbtree_node, node); in regcache_rbtree_exit()
404 rbnode_tmp = rb_entry(node, struct regcache_rbtree_node, in regcache_rbtree_write()
476 rbnode = rb_entry(node, struct regcache_rbtree_node, node); in regcache_rbtree_sync()
516 rbnode = rb_entry(node, struct regcache_rbtree_node, node); in regcache_rbtree_drop()

Completed in 60 milliseconds

1234567891011