/kernel/linux/linux-5.10/fs/jffs2/ |
H A D | jffs2_fs_i.h | 33 struct rb_root fragtree; member
|
H A D | gc.c | 358 updating to its fragtree, etc. in jffs2_garbage_collect_pass() 422 node intact, and we don't have to muck about with the fragtree etc. in jffs2_garbage_collect_pass() 534 for (frag = frag_first(&f->fragtree); frag; frag = frag_next(frag)) { in jffs2_garbage_collect_live() 804 last_frag = frag_last(&f->fragtree); in jffs2_garbage_collect_metadata() 806 /* Fetch the inode length from the fragtree rather then in jffs2_garbage_collect_metadata() 1083 frag = frag_last(&f->fragtree); in jffs2_garbage_collect_hole() 1085 /* Fetch the inode length from the fragtree rather then in jffs2_garbage_collect_hole() 1139 for (frag = jffs2_lookup_node_frag(&f->fragtree, fn->ofs); in jffs2_garbage_collect_hole() 1199 frag = jffs2_lookup_node_frag(&f->fragtree, start); in jffs2_garbage_collect_dnode() 1260 frag = jffs2_lookup_node_frag(&f->fragtree, en in jffs2_garbage_collect_dnode() [all...] |
H A D | readinode.c | 117 we build the fragtree, shortly. No need to worry about GC in check_node_data() 444 /* Build final, normal fragtree from tn tree. It doesn't matter which order 445 we add nodes to the real fragtree, as long as they don't overlap. And 514 dbg_readinode("Add %p (v %d, 0x%x-0x%x, ov %d) to fragtree\n", in jffs2_build_inode_fragtree() 759 * the inode and build the inode fragtree. We don't in read_dnode() 763 * nodes and have started building the fragtree. in read_dnode() 765 * The fragtree is being built starting with nodes in read_dnode() 1171 JFFS2_ERROR("Failed to build final fragtree for inode #%u: error %d\n", in jffs2_do_read_inode_internal() 1248 new_size = jffs2_truncate_fragtree(c, &f->fragtree, je32_to_cpu(latest_node->isize)); in jffs2_do_read_inode_internal() 1303 if (!frag_first(&f->fragtree)) { in jffs2_do_read_inode_internal() [all...] |
H A D | nodelist.c | 63 dbg_fragtree("truncating fragtree to 0x%08x bytes\n", size); in jffs2_truncate_fragtree() 167 * fragment and inserts the new fragment to the fragtree. 232 /* See if we ran off the end of the fragtree */ in jffs2_add_frag_to_fragtree() 379 ret = jffs2_add_frag_to_fragtree(c, &f->fragtree, newfrag); in jffs2_add_full_dnode_to_inode() 524 struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset) in jffs2_lookup_node_frag() argument 532 dbg_fragtree2("root %p, offset %d\n", fragtree, offset); in jffs2_lookup_node_frag() 534 next = fragtree->rb_node; in jffs2_lookup_node_frag() 558 dbg_fragtree2("returning NULL, empty fragtree\n"); in jffs2_lookup_node_frag()
|
H A D | os-linux.h | 54 f->fragtree = RB_ROOT; in jffs2_init_inode_info()
|
H A D | read.c | 167 frag = jffs2_lookup_node_frag(&f->fragtree, offset); in jffs2_read_inode_range()
|
H A D | debug.c | 64 * Check the fragtree. 80 for (frag = frag_first(&f->fragtree); frag; frag = frag_next(frag)) { in __jffs2_dbg_fragtree_paranoia_check_nolock() 115 JFFS2_ERROR("fragtree is corrupted.\n"); in __jffs2_dbg_fragtree_paranoia_check_nolock() 705 struct jffs2_node_frag *this = frag_first(&f->fragtree); in __jffs2_dbg_dump_fragtree_nolock() 709 printk(JFFS2_DBG_MSG_PREFIX " dump fragtree of ino #%u\n", f->inocache->ino); in __jffs2_dbg_dump_fragtree_nolock()
|
H A D | nodelist.h | 371 struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset);
|
H A D | fs.c | 161 jffs2_truncate_fragtree (c, &f->fragtree, iattr->ia_size); in jffs2_do_setattr()
|
H A D | wbuf.c | 202 frag = jffs2_lookup_node_frag(&f->fragtree, je32_to_cpu(node->i.offset)); in jffs2_incore_replace_raw()
|
/kernel/linux/linux-6.6/fs/jffs2/ |
H A D | jffs2_fs_i.h | 33 struct rb_root fragtree; member
|
H A D | gc.c | 358 updating to its fragtree, etc. in jffs2_garbage_collect_pass() 422 node intact, and we don't have to muck about with the fragtree etc. in jffs2_garbage_collect_pass() 534 for (frag = frag_first(&f->fragtree); frag; frag = frag_next(frag)) { in jffs2_garbage_collect_live() 804 last_frag = frag_last(&f->fragtree); in jffs2_garbage_collect_metadata() 806 /* Fetch the inode length from the fragtree rather then in jffs2_garbage_collect_metadata() 1083 frag = frag_last(&f->fragtree); in jffs2_garbage_collect_hole() 1085 /* Fetch the inode length from the fragtree rather then in jffs2_garbage_collect_hole() 1139 for (frag = jffs2_lookup_node_frag(&f->fragtree, fn->ofs); in jffs2_garbage_collect_hole() 1199 frag = jffs2_lookup_node_frag(&f->fragtree, start); in jffs2_garbage_collect_dnode() 1260 frag = jffs2_lookup_node_frag(&f->fragtree, en in jffs2_garbage_collect_dnode() [all...] |
H A D | readinode.c | 117 we build the fragtree, shortly. No need to worry about GC in check_node_data() 444 /* Build final, normal fragtree from tn tree. It doesn't matter which order 445 we add nodes to the real fragtree, as long as they don't overlap. And 514 dbg_readinode("Add %p (v %d, 0x%x-0x%x, ov %d) to fragtree\n", in jffs2_build_inode_fragtree() 759 * the inode and build the inode fragtree. We don't in read_dnode() 763 * nodes and have started building the fragtree. in read_dnode() 765 * The fragtree is being built starting with nodes in read_dnode() 1171 JFFS2_ERROR("Failed to build final fragtree for inode #%u: error %d\n", in jffs2_do_read_inode_internal() 1248 new_size = jffs2_truncate_fragtree(c, &f->fragtree, je32_to_cpu(latest_node->isize)); in jffs2_do_read_inode_internal() 1303 if (!frag_first(&f->fragtree)) { in jffs2_do_read_inode_internal() [all...] |
H A D | nodelist.c | 63 dbg_fragtree("truncating fragtree to 0x%08x bytes\n", size); in jffs2_truncate_fragtree() 167 * fragment and inserts the new fragment to the fragtree. 232 /* See if we ran off the end of the fragtree */ in jffs2_add_frag_to_fragtree() 379 ret = jffs2_add_frag_to_fragtree(c, &f->fragtree, newfrag); in jffs2_add_full_dnode_to_inode() 524 struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset) in jffs2_lookup_node_frag() argument 532 dbg_fragtree2("root %p, offset %d\n", fragtree, offset); in jffs2_lookup_node_frag() 534 next = fragtree->rb_node; in jffs2_lookup_node_frag() 558 dbg_fragtree2("returning NULL, empty fragtree\n"); in jffs2_lookup_node_frag()
|
H A D | os-linux.h | 54 f->fragtree = RB_ROOT; in jffs2_init_inode_info()
|
H A D | read.c | 167 frag = jffs2_lookup_node_frag(&f->fragtree, offset); in jffs2_read_inode_range()
|
H A D | debug.c | 64 * Check the fragtree. 80 for (frag = frag_first(&f->fragtree); frag; frag = frag_next(frag)) { in __jffs2_dbg_fragtree_paranoia_check_nolock() 115 JFFS2_ERROR("fragtree is corrupted.\n"); in __jffs2_dbg_fragtree_paranoia_check_nolock() 705 struct jffs2_node_frag *this = frag_first(&f->fragtree); in __jffs2_dbg_dump_fragtree_nolock() 709 printk(JFFS2_DBG_MSG_PREFIX " dump fragtree of ino #%u\n", f->inocache->ino); in __jffs2_dbg_dump_fragtree_nolock()
|
H A D | nodelist.h | 371 struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset);
|
H A D | fs.c | 161 jffs2_truncate_fragtree (c, &f->fragtree, iattr->ia_size); in jffs2_do_setattr()
|
H A D | wbuf.c | 202 frag = jffs2_lookup_node_frag(&f->fragtree, je32_to_cpu(node->i.offset)); in jffs2_incore_replace_raw()
|
/kernel/linux/linux-5.10/fs/ceph/ |
H A D | inode.c | 332 struct ceph_frag_tree_head *fragtree, in ceph_fill_fragtree() 343 nsplits = le32_to_cpu(fragtree->nsplits); in ceph_fill_fragtree() 348 id = le32_to_cpu(fragtree->splits[i].frag); in ceph_fill_fragtree() 366 sort(fragtree->splits, nsplits, sizeof(fragtree->splits[0]), in ceph_fill_fragtree() 373 id = le32_to_cpu(fragtree->splits[i].frag); in ceph_fill_fragtree() 374 split_by = le32_to_cpu(fragtree->splits[i].by); in ceph_fill_fragtree() 1041 ceph_fill_fragtree(inode, &info->fragtree, dirinfo); in ceph_fill_inode() 331 ceph_fill_fragtree(struct inode *inode, struct ceph_frag_tree_head *fragtree, struct ceph_mds_reply_dirfrag *dirinfo) ceph_fill_fragtree() argument
|
H A D | mds_client.c | 122 sizeof(*info->in->fragtree.splits) * in parse_reply_info_in() 123 le32_to_cpu(info->in->fragtree.nsplits); in parse_reply_info_in()
|
/kernel/linux/linux-6.6/fs/ceph/ |
H A D | inode.c | 454 struct ceph_frag_tree_head *fragtree, in ceph_fill_fragtree() 465 nsplits = le32_to_cpu(fragtree->nsplits); in ceph_fill_fragtree() 470 id = le32_to_cpu(fragtree->splits[i].frag); in ceph_fill_fragtree() 488 sort(fragtree->splits, nsplits, sizeof(fragtree->splits[0]), in ceph_fill_fragtree() 495 id = le32_to_cpu(fragtree->splits[i].frag); in ceph_fill_fragtree() 496 split_by = le32_to_cpu(fragtree->splits[i].by); in ceph_fill_fragtree() 1290 ceph_fill_fragtree(inode, &info->fragtree, dirinfo); in ceph_fill_inode() 453 ceph_fill_fragtree(struct inode *inode, struct ceph_frag_tree_head *fragtree, struct ceph_mds_reply_dirfrag *dirinfo) ceph_fill_fragtree() argument
|
/kernel/linux/linux-5.10/include/linux/ceph/ |
H A D | ceph_fs.h | 525 struct ceph_frag_tree_head fragtree; /* (must be at end of struct) */ member
|
/kernel/linux/linux-6.6/include/linux/ceph/ |
H A D | ceph_fs.h | 592 struct ceph_frag_tree_head fragtree; /* (must be at end of struct) */ member
|