Home
last modified time | relevance | path

Searched refs:fragtree (Results 1 – 11 of 11) sorted by relevance

/linux/fs/jffs2/ !
H A Djffs2_fs_i.h33 struct rb_root fragtree; member
H A Dreadinode.c117 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 Dnodelist.c63 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 Dread.c167 frag = jffs2_lookup_node_frag(&f->fragtree, offset); in jffs2_read_inode_range()
H A Ddebug.c64 * 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 Dnodelist.h371 struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset);
H A Dfs.c161 jffs2_truncate_fragtree (c, &f->fragtree, iattr->ia_size); in jffs2_do_setattr()
H A Dwbuf.c202 frag = jffs2_lookup_node_frag(&f->fragtree, je32_to_cpu(node->i.offset)); in jffs2_incore_replace_raw()
/linux/fs/ceph/ !
H A Dinode.c464 struct ceph_frag_tree_head *fragtree, in ceph_fill_fragtree() argument
476 nsplits = le32_to_cpu(fragtree->nsplits); in ceph_fill_fragtree()
481 id = le32_to_cpu(fragtree->splits[i].frag); in ceph_fill_fragtree()
499 sort(fragtree->splits, nsplits, sizeof(fragtree->splits[0]), in ceph_fill_fragtree()
506 id = le32_to_cpu(fragtree->splits[i].frag); in ceph_fill_fragtree()
507 split_by = le32_to_cpu(fragtree->splits[i].by); in ceph_fill_fragtree()
1323 ceph_fill_fragtree(inode, &info->fragtree, dirinfo); in ceph_fill_inode()
H A Dmds_client.c125 sizeof(*info->in->fragtree.splits) * in parse_reply_info_in()
126 le32_to_cpu(info->in->fragtree.nsplits); in parse_reply_info_in()
/linux/include/linux/ceph/ !
H A Dceph_fs.h586 struct ceph_frag_tree_head fragtree; /* (must be at end of struct) */ member