| /fs/jffs2/ |
| D | nodelist.h | 230 struct rb_node rb; member
271 struct rb_node rb; member
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)
352 #define frag_erase(frag, list) rb_erase(&frag->rb, list);
[all …]
|
| D | nodelist.c | 124 struct rb_node *parent = &base->rb; in jffs2_fragtree_insert()
131 base = rb_entry(parent, struct jffs2_node_frag, rb); in jffs2_fragtree_insert()
134 link = &base->rb.rb_right; in jffs2_fragtree_insert()
136 link = &base->rb.rb_left; in jffs2_fragtree_insert()
143 rb_link_node(&newfrag->rb, &base->rb, link); in jffs2_fragtree_insert()
189 rb_link_node(&holefrag->rb, &this->rb, &this->rb.rb_right); in no_overlapping_node()
193 rb_link_node(&holefrag->rb, NULL, &root->rb_node); in no_overlapping_node()
195 rb_insert_color(&holefrag->rb, root); in no_overlapping_node()
204 rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right); in no_overlapping_node()
207 rb_link_node(&newfrag->rb, NULL, &root->rb_node); in no_overlapping_node()
[all …]
|
| D | readinode.c | 185 tn = rb_entry(next, struct jffs2_tmp_dnode_info, rb); in jffs2_lookup_tn()
188 next = tn->rb.rb_right; in jffs2_lookup_tn()
190 next = tn->rb.rb_left; in jffs2_lookup_tn()
286 rb_replace_node(&this->rb, &tn->rb, &rii->tn_root); in jffs2_add_tn_to_tree()
344 insert_point = rb_entry(parent, struct jffs2_tmp_dnode_info, rb); in jffs2_add_tn_to_tree()
346 link = &insert_point->rb.rb_right; in jffs2_add_tn_to_tree()
349 link = &insert_point->rb.rb_left; in jffs2_add_tn_to_tree()
351 link = &insert_point->rb.rb_right; in jffs2_add_tn_to_tree()
353 rb_link_node(&tn->rb, &insert_point->rb, link); in jffs2_add_tn_to_tree()
354 rb_insert_color(&tn->rb, &rii->tn_root); in jffs2_add_tn_to_tree()
[all …]
|
| /fs/ocfs2/ |
| D | refcounttree.c | 77 struct ocfs2_refcount_block *rb = in ocfs2_validate_refcount_block() local
89 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &rb->rf_check); in ocfs2_validate_refcount_block()
97 if (!OCFS2_IS_VALID_REFCOUNT_BLOCK(rb)) { in ocfs2_validate_refcount_block()
101 rb->rf_signature); in ocfs2_validate_refcount_block()
105 if (le64_to_cpu(rb->rf_blkno) != bh->b_blocknr) { in ocfs2_validate_refcount_block()
109 (unsigned long long)le64_to_cpu(rb->rf_blkno)); in ocfs2_validate_refcount_block()
113 if (le32_to_cpu(rb->rf_fs_generation) != OCFS2_SB(sb)->fs_generation) { in ocfs2_validate_refcount_block()
117 le32_to_cpu(rb->rf_fs_generation)); in ocfs2_validate_refcount_block()
453 struct ocfs2_refcount_block *rb; in ocfs2_lock_refcount_tree() local
479 rb = (struct ocfs2_refcount_block *)ref_root_bh->b_data; in ocfs2_lock_refcount_tree()
[all …]
|
| D | xattr.c | 6289 struct ocfs2_refcount_block *rb = in ocfs2_reflink_lock_xattr_allocators() local
6313 if (le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL) in ocfs2_reflink_lock_xattr_allocators()
6314 *credits += le16_to_cpu(rb->rf_list.l_tree_depth) * in ocfs2_reflink_lock_xattr_allocators()
6315 le16_to_cpu(rb->rf_list.l_next_free_rec) + 1; in ocfs2_reflink_lock_xattr_allocators()
6757 struct ocfs2_refcount_block *rb; in ocfs2_lock_reflink_xattr_rec_allocators() local
6781 rb = (struct ocfs2_refcount_block *)args->reflink->ref_root_bh->b_data; in ocfs2_lock_reflink_xattr_rec_allocators()
6788 if (le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL) in ocfs2_lock_reflink_xattr_rec_allocators()
6789 *credits += le16_to_cpu(rb->rf_list.l_tree_depth) * in ocfs2_lock_reflink_xattr_rec_allocators()
6790 le16_to_cpu(rb->rf_list.l_next_free_rec) + 1; in ocfs2_lock_reflink_xattr_rec_allocators()
|
| D | alloc.c | 386 struct ocfs2_refcount_block *rb = et->et_object; in ocfs2_refcount_tree_fill_root_el() local
388 et->et_root_el = &rb->rf_list; in ocfs2_refcount_tree_fill_root_el()
394 struct ocfs2_refcount_block *rb = et->et_object; in ocfs2_refcount_tree_set_last_eb_blk() local
396 rb->rf_last_eb_blk = cpu_to_le64(blkno); in ocfs2_refcount_tree_set_last_eb_blk()
401 struct ocfs2_refcount_block *rb = et->et_object; in ocfs2_refcount_tree_get_last_eb_blk() local
403 return le64_to_cpu(rb->rf_last_eb_blk); in ocfs2_refcount_tree_get_last_eb_blk()
409 struct ocfs2_refcount_block *rb = et->et_object; in ocfs2_refcount_tree_update_clusters() local
411 le32_add_cpu(&rb->rf_clusters, clusters); in ocfs2_refcount_tree_update_clusters()
|
| /fs/nilfs2/ |
| D | recovery.c | 341 struct nilfs_recovery_block *rb; in nilfs_scan_dsync_log() local
349 rb = kmalloc(sizeof(*rb), GFP_NOFS); in nilfs_scan_dsync_log()
350 if (unlikely(!rb)) { in nilfs_scan_dsync_log()
354 rb->ino = ino; in nilfs_scan_dsync_log()
355 rb->blocknr = blocknr++; in nilfs_scan_dsync_log()
356 rb->vblocknr = le64_to_cpu(binfo->bi_vblocknr); in nilfs_scan_dsync_log()
357 rb->blkoff = le64_to_cpu(binfo->bi_blkoff); in nilfs_scan_dsync_log()
359 list_add_tail(&rb->list, head); in nilfs_scan_dsync_log()
378 struct nilfs_recovery_block *rb; in dispose_recovery_list() local
380 rb = list_first_entry(head, struct nilfs_recovery_block, list); in dispose_recovery_list()
[all …]
|
| /fs/ubifs/ |
| D | orphan.c | 67 o = rb_entry(parent, struct ubifs_orphan, rb); in orphan_add()
81 rb_link_node(&orphan->rb, parent, p); in orphan_add()
82 rb_insert_color(&orphan->rb, &c->orph_tree); in orphan_add()
103 o = rb_entry(p, struct ubifs_orphan, rb); in lookup_orphan()
117 rb_erase(&o->rb, &c->orph_tree); in __orphan_drop()
521 rb_erase(&orphan->rb, &c->orph_tree); in erase_deleted()
595 o = rb_entry(parent, struct ubifs_orphan, rb); in insert_dead_orphan()
607 rb_link_node(&orphan->rb, parent, p); in insert_dead_orphan()
608 rb_insert_color(&orphan->rb, &c->orph_tree); in insert_dead_orphan()
839 struct rb_node rb; member
[all …]
|
| 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()
130 rb_link_node(&bud->rb, parent, p); in ubifs_add_bud()
131 rb_insert_color(&bud->rb, &c->buds); in ubifs_add_bud()
311 bud = rb_entry(p1, struct ubifs_bud, rb); in remove_buds()
549 struct rb_node rb; member
568 dr = rb_entry(parent, struct done_ref, rb); in done_already()
583 rb_link_node(&dr->rb, parent, p); in done_already()
584 rb_insert_color(&dr->rb, done_tree); in done_already()
[all …]
|
| D | recovery.c | 1230 struct rb_node rb; member
1254 e = rb_entry(parent, struct size_entry, rb); in add_ino()
1270 rb_link_node(&e->rb, parent, p); in add_ino()
1271 rb_insert_color(&e->rb, &c->size_tree); in add_ino()
1287 e = rb_entry(p, struct size_entry, rb); in find_ino()
1309 rb_erase(&e->rb, &c->size_tree); in remove_ino()
1321 rbtree_postorder_for_each_entry_safe(e, n, &c->size_tree, rb) { in ubifs_destroy_size_tree()
1512 rb_erase(&e->rb, &c->size_tree); in inode_fix_size()
1536 e = rb_entry(this, struct size_entry, rb); in ubifs_recover_size()
1583 rb_erase(&e->rb, &c->size_tree); in ubifs_recover_size()
|
| D | debug.c | 578 struct rb_node *rb; in ubifs_dump_budg() local
620 for (rb = rb_first(&c->buds); rb; rb = rb_next(rb)) { in ubifs_dump_budg()
621 bud = rb_entry(rb, struct ubifs_bud, rb); in ubifs_dump_budg()
646 struct rb_node *rb; in ubifs_dump_lprop() local
708 for (rb = rb_first((struct rb_root *)&c->buds); rb; rb = rb_next(rb)) { in ubifs_dump_lprop()
709 bud = rb_entry(rb, struct ubifs_bud, rb); in ubifs_dump_lprop()
1758 struct rb_node rb; member
1805 fscki = rb_entry(parent, struct fsck_inode, rb); in add_inode()
1861 rb_link_node(&fscki->rb, parent, p); in add_inode()
1862 rb_insert_color(&fscki->rb, &fsckd->inodes); in add_inode()
[all …]
|
| D | replay.c | 306 struct replay_entry *ra, *rb; in replay_entries_cmp() local
313 rb = list_entry(b, struct replay_entry, list); in replay_entries_cmp()
314 ubifs_assert(c, ra->sqnum != rb->sqnum); in replay_entries_cmp()
315 if (ra->sqnum > rb->sqnum) in replay_entries_cmp()
|
| D | ubifs.h | 278 struct rb_node rb; member
716 struct rb_node rb; member
927 struct rb_node rb; member
|
| D | tnc.c | 56 o = rb_entry(parent, struct ubifs_old_idx, rb); in do_insert_old_idx()
70 rb_link_node(&old_idx->rb, parent, p); in do_insert_old_idx()
71 rb_insert_color(&old_idx->rb, &c->old_idx); in do_insert_old_idx()
183 rbtree_postorder_for_each_entry_safe(old_idx, n, &c->old_idx, rb) in destroy_old_idx()
|
| D | tnc_commit.c | 170 o = rb_entry(p, struct ubifs_old_idx, rb); in find_old_idx()
|
| D | super.c | 926 rbtree_postorder_for_each_entry_safe(bud, n, &c->buds, rb) in free_buds()
|
| /fs/kernfs/ |
| D | dir.c | 32 #define rb_to_kn(X) rb_entry((X), struct kernfs_node, rb)
73 struct kernfs_root *ra = kernfs_root(a), *rb = kernfs_root(b); in kernfs_common_ancestor() local
75 if (ra != rb) in kernfs_common_ancestor()
79 db = kernfs_depth(rb->kn, b); in kernfs_common_ancestor()
368 node = &pos->rb.rb_left; in kernfs_link_sibling()
370 node = &pos->rb.rb_right; in kernfs_link_sibling()
376 rb_link_node(&kn->rb, parent, node); in kernfs_link_sibling()
377 rb_insert_color(&kn->rb, &kn->parent->dir.children); in kernfs_link_sibling()
400 if (RB_EMPTY_NODE(&kn->rb)) in kernfs_unlink_sibling()
407 rb_erase(&kn->rb, &kn->parent->dir.children); in kernfs_unlink_sibling()
[all …]
|
| /fs/btrfs/ |
| D | extent_map.c | 238 struct rb_node *rb; in try_merge_map() local
252 rb = rb_prev(&em->rb_node); in try_merge_map()
253 if (rb) in try_merge_map()
254 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
255 if (rb && mergable_maps(merge, em)) { in try_merge_map()
271 rb = rb_next(&em->rb_node); in try_merge_map()
272 if (rb) in try_merge_map()
273 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
274 if (rb && mergable_maps(em, merge)) { in try_merge_map()
|
| D | raid56.c | 1676 struct btrfs_raid_bio *rb = container_of(b, struct btrfs_raid_bio, in plug_cmp() local
1679 u64 b_sector = rb->bio_list.head->bi_iter.bi_sector; in plug_cmp()
|
| /fs/xfs/ |
| D | xfs_rtalloc.h | 139 # define xfs_rtallocate_extent(t,b,min,max,l,f,p,rb) (ENOSYS) argument
141 # define xfs_rtpick_extent(m,t,l,rb) (ENOSYS) argument
|
| D | xfs_rmap_item.c | 345 struct xfs_rmap_intent *rb; in xfs_rmap_update_diff_items() local
348 rb = container_of(b, struct xfs_rmap_intent, ri_list); in xfs_rmap_update_diff_items()
350 XFS_FSB_TO_AGNO(mp, rb->ri_bmap.br_startblock); in xfs_rmap_update_diff_items()
|
| D | xfs_refcount_item.c | 277 struct xfs_refcount_intent *rb; in xfs_refcount_update_diff_items() local
280 rb = container_of(b, struct xfs_refcount_intent, ri_list); in xfs_refcount_update_diff_items()
282 XFS_FSB_TO_AGNO(mp, rb->ri_startblock); in xfs_refcount_update_diff_items()
|
| D | xfs_extfree_item.c | 405 struct xfs_extent_free_item *rb; in xfs_extent_free_diff_items() local
408 rb = container_of(b, struct xfs_extent_free_item, xefi_list); in xfs_extent_free_diff_items()
410 XFS_FSB_TO_AGNO(mp, rb->xefi_startblock); in xfs_extent_free_diff_items()
|
| /fs/reiserfs/ |
| D | fix_node.c | 622 int rnum, int blk_num, short *s012, int lb, int rb) in set_parameters() argument
639 tb->rbytes = rb; in set_parameters()
645 PROC_INFO_ADD(tb->tb_sb, rbytes[h], rb); in set_parameters()
|