/linux-master/tools/perf/tests/ |
H A D | hists_output.c | 112 he = rb_entry(node, struct hist_entry, rb_node); 180 he = rb_entry(node, struct hist_entry, rb_node); 186 he = rb_entry(node, struct hist_entry, rb_node); 192 he = rb_entry(node, struct hist_entry, rb_node); 198 he = rb_entry(node, struct hist_entry, rb_node); 204 he = rb_entry(node, struct hist_entry, rb_node); 210 he = rb_entry(node, struct hist_entry, rb_node); 216 he = rb_entry(node, struct hist_entry, rb_node); 222 he = rb_entry(node, struct hist_entry, rb_node); 228 he = rb_entry(nod [all...] |
/linux-master/include/linux/ |
H A D | interval_tree_generic.h | 48 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); \
|
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-master/tools/include/linux/ |
H A D | interval_tree_generic.h | 48 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); \
|
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-master/tools/perf/util/ |
H A D | intlist.h | 49 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; 57 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
|
H A D | rb_resort.h | 26 entry->thread = rb_entry(nd, struct thread, rb_node); 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, \
|
H A D | strlist.h | 61 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; 69 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL;
|
H A D | block-range.h | 43 return rb_entry(n, struct block_range, node);
|
H A D | block-range.c | 19 struct block_range *entry = rb_entry(rb, struct block_range, node); 37 entry = rb_entry(parent, struct block_range, node); 86 entry = rb_entry(parent, struct block_range, node); 113 next = rb_entry(n, struct block_range, node);
|
/linux-master/fs/jffs2/ |
H A D | nodelist.h | 334 return rb_entry(node, struct jffs2_node_frag, rb); 344 return rb_entry(node, struct jffs2_node_frag, rb); 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_paren [all...] |
/linux-master/drivers/block/drbd/ |
H A D | drbd_interval.c | 12 struct drbd_interval *this = rb_entry(node, struct drbd_interval, rb); 34 rb_entry(*new, struct drbd_interval, rb); 76 rb_entry(node, struct drbd_interval, rb); 128 rb_entry(node, struct drbd_interval, rb); 157 i = rb_entry(node, struct drbd_interval, rb);
|
/linux-master/fs/btrfs/ |
H A D | misc.h | 75 entry = rb_entry(node, struct rb_simple_node, rb_node); 103 entry = rb_entry(node, struct rb_simple_node, rb_node); 131 entry = rb_entry(parent, struct rb_simple_node, rb_node);
|
H A D | ordered-data.c | 44 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); 73 entry = rb_entry(n, struct btrfs_ordered_extent, rb_node); 91 prev_entry = rb_entry(test, struct btrfs_ordered_extent, 99 prev_entry = rb_entry(prev, struct btrfs_ordered_extent, 105 prev_entry = rb_entry(test, struct btrfs_ordered_extent, 134 entry = rb_entry(inode->ordered_tree_last, struct btrfs_ordered_extent, 427 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); 439 entry = rb_entry(node, struct btrfs_ordered_extent, 514 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); 885 entry = rb_entry(nod [all...] |
/linux-master/security/keys/ |
H A D | proc.c | 70 struct key *key = rb_entry(n, struct key, serial_node); 85 struct key *key = rb_entry(n, struct key, serial_node); 108 minkey = rb_entry(n, struct key, serial_node); 131 struct key *key = rb_entry(n, struct key, serial_node); 156 struct key *key = rb_entry(_p, struct key, serial_node); 255 struct key_user *user = rb_entry(n, struct key_user, node); 306 struct key_user *user = rb_entry(_p, struct key_user, node);
|
/linux-master/arch/powerpc/kernel/ |
H A D | eeh_cache.c | 60 piar = rb_entry(n, struct pci_io_addr_range, rb_node); 106 piar = rb_entry(n, struct pci_io_addr_range, rb_node); 128 piar = rb_entry(parent, struct pci_io_addr_range, rb_node); 221 piar = rb_entry(n, struct pci_io_addr_range, rb_node); 271 piar = rb_entry(n, struct pci_io_addr_range, rb_node);
|
/linux-master/net/ceph/ |
H A D | debugfs.c | 71 rb_entry(n, struct ceph_pg_pool_info, node); 94 rb_entry(n, struct ceph_pg_mapping, node); 105 rb_entry(n, struct ceph_pg_mapping, node); 112 rb_entry(n, struct ceph_pg_mapping, node); 123 rb_entry(n, struct ceph_pg_mapping, node); 162 req = rb_entry(rp, struct ceph_mon_generic_request, node); 241 rb_entry(n, struct ceph_osd_request, r_node); 267 rb_entry(n, struct ceph_osd_linger_request, node); 328 rb_entry(n, struct ceph_osd_backoff, id_node); 353 struct ceph_osd *osd = rb_entry( [all...] |
H A D | string_table.c | 21 exist = rb_entry(*p, struct ceph_string, node); 56 exist = rb_entry(*p, struct ceph_string, node);
|
/linux-master/kernel/locking/ |
H A D | rtmutex_common.h | 125 return rb_entry(leftmost, struct rt_mutex_waiter, tree.entry) == waiter; 136 w = rb_entry(leftmost, struct rt_mutex_waiter, tree.entry); 151 return rb_entry(p->pi_waiters.rb_leftmost, struct rt_mutex_waiter,
|
/linux-master/lib/ |
H A D | rbtree_test.c | 39 if (key < rb_entry(parent, struct test_node, rb)->key) 57 if (key < rb_entry(parent, struct test_node, rb)->key) 95 parent = rb_entry(rb_parent, struct test_node, rb); 120 parent = rb_entry(rb_parent, struct test_node, rb); 198 struct test_node *node = rb_entry(rb, struct test_node, rb); 224 struct test_node *node = rb_entry(rb, struct test_node, rb); 227 subtree = rb_entry(node->rb.rb_left, struct test_node, 233 subtree = rb_entry(node->rb.rb_right, struct test_node,
|
H A D | timerqueue.c | 18 rb_entry((_n), struct timerqueue_node, node)
|
/linux-master/mm/ |
H A D | interval_tree.c | 42 parent = rb_entry(prev->shared.rb.rb_right, 47 parent = rb_entry(parent->shared.rb.rb_left,
|
H A D | shmem_quota.c | 105 entry = rb_entry(node, struct quota_id, node); 131 entry = rb_entry(node, struct quota_id, node); 152 entry = rb_entry(node, struct quota_id, node); 184 entry = rb_entry(parent, struct quota_id, node); 283 entry = rb_entry(node, struct quota_id, node);
|
/linux-master/drivers/gpu/drm/ |
H A D | drm_vma_manager.c | 152 node = rb_entry(iter, struct drm_mm_node, rb); 263 entry = rb_entry(*iter, struct drm_vma_offset_file, vm_rb); 367 entry = rb_entry(iter, struct drm_vma_offset_file, vm_rb); 408 entry = rb_entry(iter, struct drm_vma_offset_file, vm_rb);
|
/linux-master/fs/ext4/ |
H A D | block_validity.c | 79 entry = rb_entry(parent, struct ext4_system_zone, node); 103 entry = rb_entry(node, struct ext4_system_zone, node); 115 entry = rb_entry(node, struct ext4_system_zone, node); 137 entry = rb_entry(node, struct ext4_system_zone, node); 321 entry = rb_entry(n, struct ext4_system_zone, node);
|