| /linux/tools/perf/tests/ |
| H A D | hists_output.c | 111 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
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()
221 he = rb_entry(node, struct hist_entry, rb_node); in test1()
227 he = rb_entry(nod in test1()
[all...] |
| /linux/Documentation/translations/zh_CN/core-api/ |
| H A D | rbtree.rst | 65 宏访问。此外，个体成员可直接用rb_entry(node, type, member)访问。
175 标准的container_of()宏访问。此外，个体成员可直接用rb_entry(node, type, member)
182 printk("key=%s\n", rb_entry(node, struct mytype, node)->keystring);
271 node = rb_entry(root->rb_node, struct interval_tree_node, rb);
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);
[all …]
|
| /linux/fs/jffs2/ |
| H A 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/drivers/block/drbd/ |
| H A D | drbd_interval.c | 12 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/tools/include/linux/ |
| H A D | rbtree_augmented.h | 82 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/net/ceph/ |
| H A D | debugfs.c | 76 rb_entry(n, struct ceph_pg_pool_info, node); in osdmap_show()
99 rb_entry(n, struct ceph_pg_mapping, node); in osdmap_show()
110 rb_entry(n, struct ceph_pg_mapping, node); in osdmap_show()
117 rb_entry(n, struct ceph_pg_mapping, node); in osdmap_show()
128 rb_entry(n, struct ceph_pg_mapping, node); in osdmap_show()
168 req = rb_entry(rp, struct ceph_mon_generic_request, node); in monc_show()
247 rb_entry(n, struct ceph_osd_request, r_node); in dump_requests()
273 rb_entry(n, struct ceph_osd_linger_request, node); in dump_linger_requests()
334 rb_entry(n, struct ceph_osd_backoff, id_node); in dump_backoffs()
359 struct ceph_osd *osd = rb_entry(n, struct ceph_osd, o_node); in osdc_show()
[all …]
|
| /linux/security/keys/ |
| H A D | proc.c | 70 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/include/linux/ |
| H A D | rbtree_augmented.h | 106 RBSTRUCT *node = rb_entry(rb, RBSTRUCT, RBFIELD); \
115 RBSTRUCT *old = rb_entry(rb_old, RBSTRUCT, RBFIELD); \
116 RBSTRUCT *new = rb_entry(rb_new, RBSTRUCT, RBFIELD); \
122 RBSTRUCT *old = rb_entry(rb_old, RBSTRUCT, RBFIELD); \
123 RBSTRUCT *new = rb_entry(rb_new, RBSTRUCT, RBFIELD); \
153 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \
158 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
|
| /linux/arch/powerpc/kernel/ |
| H A D | eeh_cache.c | 60 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/fs/btrfs/ |
| H A D | misc.h | 141 entry = rb_entry(node, struct rb_simple_node, rb_node); in rb_simple_search()
169 entry = rb_entry(node, struct rb_simple_node, rb_node); in rb_simple_search_first()
190 struct rb_simple_node *new_entry = rb_entry(new, struct rb_simple_node, rb_node); in rb_simple_node_bytenr_cmp()
191 struct rb_simple_node *existing_entry = rb_entry(existing, struct rb_simple_node, rb_node); in rb_simple_node_bytenr_cmp()
|
| H A D | ref-verify.c | 81 const struct block_entry *entry = rb_entry(node, struct block_entry, node); in block_entry_bytenr_key_cmp()
93 const struct block_entry *new_entry = rb_entry(new, struct block_entry, node); in block_entry_bytenr_cmp()
118 const struct root_entry *entry = rb_entry(node, struct root_entry, node); in root_entry_root_objectid_key_cmp()
130 const struct root_entry *new_entry = rb_entry(new, struct root_entry, node); in root_entry_root_objectid_cmp()
167 struct ref_entry *new_entry = rb_entry(new, struct ref_entry, node); in ref_entry_cmp()
168 struct ref_entry *existing_entry = rb_entry(existing, struct ref_entry, node); in ref_entry_cmp()
225 re = rb_entry(n, struct root_entry, node); in free_block_entry()
231 ref = rb_entry(n, struct ref_entry, node); in free_block_entry()
627 ref = rb_entry(n, struct ref_entry, node); in dump_block_entry()
635 re = rb_entry(n, struct root_entry, node); in dump_block_entry()
[all …]
|
| /linux/lib/ |
| H A D | rbtree_test.c | 40 if (key < rb_entry(parent, struct test_node, rb)->key) in insert()
58 if (key < rb_entry(parent, struct test_node, rb)->key) in insert_cached()
96 parent = rb_entry(rb_parent, struct test_node, rb); in RB_DECLARE_CALLBACKS_MAX()
121 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented_cached()
199 struct test_node *node = rb_entry(rb, struct test_node, rb); in check()
225 struct test_node *node = rb_entry(rb, struct test_node, rb); in check_augmented()
228 subtree = rb_entry(node->rb.rb_left, struct test_node, in check_augmented()
234 subtree = rb_entry(node->rb.rb_right, struct test_node, in check_augmented()
|
| /linux/net/netfilter/ |
| H A D | nft_set_rbtree.c | 225 rbe_prev = rb_entry(prev, struct nft_rbtree_elem, node); in nft_rbtree_gc_elem()
235 rbe_prev = rb_entry(prev, struct nft_rbtree_elem, node); in nft_rbtree_gc_elem()
250 first_elem = rb_entry(first, struct nft_rbtree_elem, node); in nft_rbtree_update_first()
269 return rb_entry(node, struct nft_rbtree_elem, node); in nft_rbtree_prev_active()
278 next_rbe = rb_entry(node, struct nft_rbtree_elem, node); in __nft_rbtree_next_active()
361 rbe = rb_entry(parent, struct nft_rbtree_elem, node); in __nft_rbtree_insert()
390 rbe = rb_entry(node, struct nft_rbtree_elem, node); in __nft_rbtree_insert()
524 rbe = rb_entry(parent, struct nft_rbtree_elem, node); in __nft_rbtree_insert()
739 next_rbe = rb_entry(node, struct nft_rbtree_elem, node); in nft_rbtree_next_inactive()
803 rbe = rb_entry(parent, struct nft_rbtree_elem, node); in nft_rbtree_deactivate()
[all …]
|
| /linux/drivers/gpu/drm/ |
| H A D | drm_vma_manager.c | 153 node = rb_entry(iter, struct drm_mm_node, rb); in drm_vma_offset_lookup_locked()
264 entry = rb_entry(*iter, struct drm_vma_offset_file, vm_rb); in vma_node_allow()
368 entry = rb_entry(iter, struct drm_vma_offset_file, vm_rb); in drm_vma_node_revoke()
409 entry = rb_entry(iter, struct drm_vma_offset_file, vm_rb); in drm_vma_node_is_allowed()
|
| /linux/fs/ceph/ |
| H A D | subvolume_metrics.c | 62 rb_entry(node, struct ceph_subvol_metric_rb_entry, node); in __lookup_entry()
85 rb_entry(*link, struct ceph_subvol_metric_rb_entry, node); in __insert_entry()
110 rb_entry(node, struct ceph_subvol_metric_rb_entry, node); in ceph_subvolume_metrics_clear_locked()
235 rb_entry(node, struct ceph_subvol_metric_rb_entry, node); in ceph_subvolume_metrics_snapshot()
258 rb_entry(node, struct ceph_subvol_metric_rb_entry, node); in ceph_subvolume_metrics_snapshot()
338 rb_entry(node, struct ceph_subvol_metric_rb_entry, node); in ceph_subvolume_metrics_dump()
|
| /linux/tools/perf/util/ |
| H A D | rb_resort.h | |
| H A D | hist.c | 275 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
437 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
480 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
496 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
510 n = rb_entry(next, struct hist_entry, rb_node); in hists__get_entry()
699 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
1641 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1764 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1848 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1921 he = rb_entry(nod in hierarchy_recalc_total_periods()
[all...] |
| H A D | srcline.c | 375 i = rb_entry(parent, struct srcline_node, rb_node); in srcline__tree_insert()
392 struct srcline_node *i = rb_entry(n, struct srcline_node,
412 pos = rb_entry(next, struct srcline_node, rb_node); in srcline__tree_delete()
466 i = rb_entry(parent, struct inline_node, rb_node); in inlines__tree_insert()
483 struct inline_node *i = rb_entry(n, struct inline_node, in inlines__tree_find()
503 pos = rb_entry(next, struct inline_node, rb_node); in inlines__tree_delete()
|
| H A D | intlist.h | 49 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; in intlist__first()
57 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; in intlist__next()
|
| H A D | strlist.h | 59 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; in strlist__first()
67 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; in strlist__next()
|
| H A D | block-range.c | 19 struct block_range *entry = rb_entry(rb, struct block_range, node); in block_range__debug()
37 entry = rb_entry(parent, struct block_range, node); in block_range__find()
86 entry = rb_entry(parent, struct block_range, node); in block_range__create()
113 next = rb_entry(n, struct block_range, node); in block_range__create()
|
| /linux/fs/ext4/ |
| H A D | block_validity.c | 79 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/mm/ |
| H A D | shmem_quota.c | 103 entry = rb_entry(node, struct quota_id, node); in shmem_free_file_info()
129 entry = rb_entry(node, struct quota_id, node); in shmem_get_next_id()
150 entry = rb_entry(node, struct quota_id, node); in shmem_get_next_id()
182 entry = rb_entry(parent, struct quota_id, node); in shmem_acquire_dquot()
281 entry = rb_entry(node, struct quota_id, node); in shmem_release_dquot()
|
| /linux/fs/ntfs3/ |
| H A D | bitmap.c | 137 rb_entry(node, struct e_node, start.node)); in wnd_close()
150 k = rb_entry(*p, struct rb_node_key, node); in rb_lookup()
176 rb_entry(parent = *p, struct e_node, count.node); in rb_insert_count()
211 k = rb_entry(parent, struct e_node, start.node); in rb_insert_start()
252 e = rb_entry(n, struct e_node, start.node); in wnd_add_free_ext()
268 e = rb_entry(n, struct e_node, start.node); in wnd_add_free_ext()
320 e = rb_entry(n, struct e_node, count.node); in wnd_add_free_ext()
328 e2 = rb_entry(n, struct e_node, count.node); in wnd_add_free_ext()
375 e = rb_entry(n, struct e_node, start.node); in wnd_remove_free_ext()
395 e3 = rb_entry(n3, struct e_node, start.node); in wnd_remove_free_ext()
[all …]
|
| /linux/arch/arm/xen/ |
| H A D | p2m.c | 42 entry = rb_entry(parent, struct xen_p2m_entry, rbnode_phys); in xen_add_phys_to_mach_entry()
73 entry = rb_entry(n, struct xen_p2m_entry, rbnode_phys); in __pfn_to_mfn()
162 p2m_entry = rb_entry(n, struct xen_p2m_entry, rbnode_phys); in __set_phys_to_machine_multi()
|