| /fs/f2fs/ |
| D | extent_cache.c | 127 static struct rb_entry *__lookup_rb_tree_fast(struct rb_entry *cached_re, in __lookup_rb_tree_fast()
139 static struct rb_entry *__lookup_rb_tree_slow(struct rb_root_cached *root, in __lookup_rb_tree_slow()
143 struct rb_entry *re; in __lookup_rb_tree_slow()
146 re = rb_entry(node, struct rb_entry, rb_node); in __lookup_rb_tree_slow()
158 struct rb_entry *f2fs_lookup_rb_tree(struct rb_root_cached *root, in f2fs_lookup_rb_tree()
159 struct rb_entry *cached_re, unsigned int ofs) in f2fs_lookup_rb_tree()
161 struct rb_entry *re; in f2fs_lookup_rb_tree()
176 struct rb_entry *re; in f2fs_lookup_rb_tree_ext()
180 re = rb_entry(*parent, struct rb_entry, rb_node); in f2fs_lookup_rb_tree_ext()
199 struct rb_entry *re; in f2fs_lookup_rb_tree_for_insert()
[all …]
|
| /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 …]
|
| /fs/btrfs/ |
| D | extent_map.c | 105 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()
127 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
130 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
156 entry = rb_entry(n, struct extent_map, rb_node); in __tree_search()
172 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
179 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
182 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
254 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
273 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
[all …]
|
| D | ordered-data.c | 41 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); in tree_insert()
70 entry = rb_entry(n, struct btrfs_ordered_extent, rb_node); in __tree_search()
88 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
96 prev_entry = rb_entry(prev, struct btrfs_ordered_extent, in __tree_search()
102 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
143 entry = rb_entry(tree->last, struct btrfs_ordered_extent, in tree_search()
332 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_dec_test_first_ordered_pending()
403 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_dec_test_ordered_pending()
755 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_ordered_extent()
785 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()
240 re = rb_entry(n, struct root_entry, node); in free_block_entry()
246 ref = rb_entry(n, struct ref_entry, node); in free_block_entry()
646 ref = rb_entry(n, struct ref_entry, node); in dump_block_entry()
654 re = rb_entry(n, struct root_entry, node); in dump_block_entry()
920 be = rb_entry(n, struct block_entry, node); in btrfs_free_ref_cache()
[all …]
|
| D | delayed-ref.c | 287 ins = rb_entry(node, struct btrfs_delayed_ref_head, href_node); in htree_insert()
291 entry = rb_entry(parent_node, struct btrfs_delayed_ref_head, in htree_insert()
322 entry = rb_entry(parent_node, struct btrfs_delayed_ref_node, in tree_insert()
350 entry = rb_entry(n, struct btrfs_delayed_ref_head, href_node); in find_first_ref_head()
371 entry = rb_entry(n, struct btrfs_delayed_ref_head, href_node); in find_ref_head()
385 entry = rb_entry(n, struct btrfs_delayed_ref_head, in find_ref_head()
442 next = rb_entry(node, struct btrfs_delayed_ref_node, ref_node); in merge_ref()
507 ref = rb_entry(node, struct btrfs_delayed_ref_node, ref_node); in btrfs_merge_delayed_refs()
562 head = rb_entry(node, struct btrfs_delayed_ref_head, in btrfs_select_ref_head()
|
| D | misc.h | 79 entry = rb_entry(node, struct rb_simple_node, rb_node); in rb_simple_search()
100 entry = rb_entry(parent, struct rb_simple_node, rb_node); in rb_simple_insert()
|
| D | free-space-cache.c | 645 e = rb_entry(n, struct btrfs_free_space, offset_index); in merge_space_tree()
972 e = rb_entry(node, struct btrfs_free_space, offset_index); in write_cache_extent_entries()
1474 info = rb_entry(parent, struct btrfs_free_space, offset_index); in tree_insert_offset()
1537 entry = rb_entry(n, struct btrfs_free_space, offset_index); in tree_search_offset()
1561 entry = rb_entry(n, struct btrfs_free_space, offset_index); in tree_search_offset()
1575 prev = rb_entry(n, struct btrfs_free_space, in tree_search_offset()
1593 entry = rb_entry(n, struct btrfs_free_space, in tree_search_offset()
1607 prev = rb_entry(n, struct btrfs_free_space, in tree_search_offset()
1634 entry = rb_entry(n, struct btrfs_free_space, offset_index); in tree_search_offset()
1870 entry = rb_entry(node, struct btrfs_free_space, offset_index); in find_free_space()
[all …]
|
| D | ulist.c | 124 u = rb_entry(n, struct ulist_node, rb_node); in ulist_rbtree_search()
152 cur = rb_entry(parent, struct ulist_node, rb_node); in ulist_rbtree_insert()
|
| D | extent_io.c | 306 state = rb_entry(node, struct extent_state, rb_node); in extent_io_tree_release()
375 entry = rb_entry(parent, struct tree_entry, rb_node); in tree_insert()
424 entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
444 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
451 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
454 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
502 other = rb_entry(other_node, struct extent_state, rb_node); in merge_state()
517 other = rb_entry(other_node, struct extent_state, rb_node); in merge_state()
567 found = rb_entry(node, struct extent_state, rb_node); in insert_state()
617 return rb_entry(next, struct extent_state, rb_node); in next_state()
[all …]
|
| /fs/ext4/ |
| D | extents_status.c | 191 es = rb_entry(node, struct extent_status, rb_node); in ext4_es_print_tree()
220 es = rb_entry(node, struct extent_status, rb_node); in __es_tree_search()
234 return node ? rb_entry(node, struct extent_status, rb_node) : in __es_tree_search()
288 es1 = rb_entry(node, struct extent_status, rb_node); in __es_find_extent_range()
579 es1 = rb_entry(node, struct extent_status, rb_node); in ext4_es_try_to_merge_left()
603 es1 = rb_entry(node, struct extent_status, rb_node); in ext4_es_try_to_merge_right()
798 es = rb_entry(parent, struct extent_status, rb_node); in __es_insert_extent()
1014 es1 = rb_entry(node, struct extent_status, rb_node); in ext4_es_lookup_extent()
1038 es1 = rb_entry(node, struct extent_status, in ext4_es_lookup_extent()
1095 rc->left_es = node ? rb_entry(node, in init_rsvd()
[all …]
|
| 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()
323 entry = rb_entry(n, struct ext4_system_zone, node); in ext4_sb_block_valid()
|
| /fs/ocfs2/ |
| D | reservations.c | 87 resv = rb_entry(node, struct ocfs2_alloc_reservation, r_node); in ocfs2_dump_resv()
142 resv = rb_entry(node, struct ocfs2_alloc_reservation, r_node); in ocfs2_check_resmap()
277 resv = rb_entry(node, struct ocfs2_alloc_reservation, r_node); in ocfs2_resmap_clear_all_resv()
318 tmp = rb_entry(parent, struct ocfs2_alloc_reservation, r_node); in ocfs2_resv_insert()
369 resv = rb_entry(node, struct ocfs2_alloc_reservation, r_node); in ocfs2_find_resv_lhs()
527 next_resv = rb_entry(next, struct ocfs2_alloc_reservation, in __ocfs2_resv_find_window()
564 next_resv = rb_entry(next, in __ocfs2_resv_find_window()
607 prev_resv = rb_entry(prev, struct ocfs2_alloc_reservation, in __ocfs2_resv_find_window()
|
| D | uptodate.c | 138 item = rb_entry(node, struct ocfs2_meta_cache_item, c_node); in ocfs2_purge_copied_metadata_tree()
216 item = rb_entry(n, struct ocfs2_meta_cache_item, c_node); in ocfs2_search_cache_tree()
320 tmp = rb_entry(parent, struct ocfs2_meta_cache_item, c_node); in __ocfs2_insert_cache_tree()
|
| /fs/proc/ |
| D | task_nommu.c | 30 vma = rb_entry(p, struct vm_area_struct, vm_rb); in task_mem()
91 vma = rb_entry(p, struct vm_area_struct, vm_rb); in task_vsize()
109 vma = rb_entry(p, struct vm_area_struct, vm_rb); in task_statm()
195 return nommu_vma_show(m, rb_entry(p, struct vm_area_struct, vm_rb)); in show_map()
|
| /fs/xfs/ |
| D | xfs_extent_busy.c | 51 busyp = rb_entry(parent, struct xfs_extent_busy, rb_node); in xfs_extent_busy_insert()
100 busyp = rb_entry(rbp, struct xfs_extent_busy, rb_node); in xfs_extent_busy_search()
300 rb_entry(rbp, struct xfs_extent_busy, rb_node); in xfs_extent_busy_reuse()
352 rb_entry(rbp, struct xfs_extent_busy, rb_node); in xfs_extent_busy_trim()
|
| /fs/ubifs/ |
| D | log.c | 38 bud = rb_entry(p, struct ubifs_bud, rb); in ubifs_search_bud()
71 bud = rb_entry(p, struct ubifs_bud, rb); in ubifs_get_wbuf()
122 b = rb_entry(parent, struct ubifs_bud, rb); in ubifs_add_bud()
311 bud = rb_entry(p1, struct ubifs_bud, rb); in remove_buds()
568 dr = rb_entry(parent, struct done_ref, rb); in done_already()
|
| D | orphan.c | 67 o = rb_entry(parent, struct ubifs_orphan, rb); in orphan_add()
103 o = rb_entry(p, struct ubifs_orphan, rb); in lookup_orphan()
595 o = rb_entry(parent, struct ubifs_orphan, rb); in insert_dead_orphan()
876 o = rb_entry(parent, struct check_orphan, rb); in dbg_ins_check_orphan()
898 o = rb_entry(p, struct check_orphan, rb); in dbg_find_check_orphan()
|
| /fs/ext2/ |
| D | balloc.c | 213 rsv = rb_entry(n, struct ext2_reserve_window_node, rsv_node); in __rsv_window_dump()
300 rsv = rb_entry(n, struct ext2_reserve_window_node, rsv_node); in search_reserve_window()
317 rsv = rb_entry(n, struct ext2_reserve_window_node, rsv_node); in search_reserve_window()
343 this = rb_entry(parent, struct ext2_reserve_window_node, rsv_node); in ext2_rsv_window_add()
788 rsv = rb_entry(next,struct ext2_reserve_window_node,rsv_node); in find_next_reservable_window()
1030 next_rsv = rb_entry(next, struct ext2_reserve_window_node, rsv_node); in try_to_extend_reservation()
|
| /fs/dlm/ |
| D | debug_fs.c | 455 r = rb_entry(node, struct dlm_rsb, res_hashnode); in table_seq_start()
487 r = rb_entry(node, struct dlm_rsb, res_hashnode); in table_seq_start()
521 r = rb_entry(next, struct dlm_rsb, res_hashnode); in table_seq_next()
553 r = rb_entry(next, struct dlm_rsb, res_hashnode); in table_seq_next()
|
| /fs/ |
| D | eventpoll.c | 839 epi = rb_entry(rbp, struct epitem, rbn); in ep_free()
855 epi = rb_entry(rbp, struct epitem, rbn); in ep_free()
958 struct epitem *epi = rb_entry(rbp, struct epitem, rbn); in ep_show_fdinfo()
1061 epi = rb_entry(rbp, struct epitem, rbn); in ep_find()
1083 epi = rb_entry(rbp, struct epitem, rbn); in ep_find_tfd()
1351 epic = rb_entry(parent, struct epitem, rbn); in ep_rbtree_insert()
2024 epi = rb_entry(rbp, struct epitem, rbn); in ep_loop_check_proc()
|
| /fs/ceph/ |
| D | snap.c | 94 r = rb_entry(parent, struct ceph_snap_realm, node); in __insert_snap_realm()
153 r = rb_entry(n, struct ceph_snap_realm, node); in __lookup_snap_realm()
1066 exist = rb_entry(*p, struct ceph_snapid_map, node); in ceph_get_snapid_map()
1104 exist = rb_entry(*p, struct ceph_snapid_map, node); in ceph_get_snapid_map()
1188 sm = rb_entry(p, struct ceph_snapid_map, node); in ceph_cleanup_snapid_map()
|
| /fs/fscache/ |
| D | object-list.c | 54 xobj = rb_entry(parent, struct fscache_object, objlist_link); in fscache_objlist_add()
109 obj = rb_entry(p, struct fscache_object, objlist_link); in fscache_objlist_lookup()
|
| /fs/gfs2/ |
| D | rgrp.c | 506 cur = rb_entry(n, struct gfs2_rgrpd, rd_node); in gfs2_blk2rgrpd()
543 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node); in gfs2_rgrpd_get_first()
570 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node); in gfs2_rgrpd_get_next()
694 rs = rb_entry(n, struct gfs2_blkreserv, rs_node); in return_all_reservations()
707 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node); in gfs2_clear_rgrpd()
854 struct gfs2_rgrpd *cur = rb_entry(*newn, struct gfs2_rgrpd, in rgd_insert()
1475 rb_entry(*newn, struct gfs2_blkreserv, rs_node); in rs_insert()
1599 rs = rb_entry(n, struct gfs2_blkreserv, rs_node); in gfs2_next_unreserved_block()
1615 rs = rb_entry(n, struct gfs2_blkreserv, rs_node); in gfs2_next_unreserved_block()
2244 trs = rb_entry(n, struct gfs2_blkreserv, rs_node); in gfs2_rgrp_dump()
|
| /fs/afs/ |
| D | server.c | 111 server = rb_entry(p, struct afs_server, uuid_rb); in afs_find_server_by_uuid()
157 server = rb_entry(p, struct afs_server, uuid_rb); in afs_install_server()
549 rb_entry(cursor, struct afs_server, uuid_rb); in afs_manage_servers()
|