| /fs/hfs/ |
| A D | bfind.c | 116 int height, res; in hfs_brec_find() local
125 height = tree->depth; in hfs_brec_find()
135 if (bnode->height != height) in hfs_brec_find()
137 if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF)) in hfs_brec_find()
142 if (!height) in hfs_brec_find()
157 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
|
| A D | bnode.c | 27 node->this, node->type, node->height, in is_bnode_offset_valid()
51 node->this, node->type, node->height, in check_and_correct_requested_length()
74 node->this, node->type, node->height, in hfs_bnode_read()
146 node->this, node->type, node->height, in hfs_bnode_write()
184 node->this, node->type, node->height, in hfs_bnode_clear()
250 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
447 node->height = desc->height; in hfs_bnode_find()
453 if (node->height != 0) in hfs_bnode_find()
457 if (node->height != 1) in hfs_bnode_find()
461 if (node->height <= 1 || node->height > tree->depth) in hfs_bnode_find()
|
| A D | brec.c | 251 new_node->height = node->height; in hfs_bnode_split()
320 node_desc.height = new_node->height; in hfs_bnode_split()
489 new_node->height = ++tree->depth; in hfs_btree_inc_height()
494 node_desc.height = new_node->height; in hfs_btree_inc_height()
|
| A D | btree.h | 63 u8 height; member
137 u8 height; /* (F) The level of this node (leaves=1) */ member
|
| A D | btree.c | 250 desc.height = 0; in hfs_bmap_new_bmap()
|
| /fs/hfsplus/ |
| A D | bfind.c | 159 int height, res; in hfs_brec_find() local
168 height = tree->depth; in hfs_brec_find()
178 if (bnode->height != height) in hfs_brec_find()
180 if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF)) in hfs_brec_find()
185 if (!height) in hfs_brec_find()
200 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
|
| A D | bnode.c | 30 node->this, node->type, node->height, in is_bnode_offset_valid()
54 node->this, node->type, node->height, in check_and_correct_requested_length()
76 node->this, node->type, node->height, in hfs_bnode_read()
147 node->this, node->type, node->height, in hfs_bnode_write()
189 node->this, node->type, node->height, in hfs_bnode_clear()
399 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
598 node->height = desc->height; in hfs_bnode_find()
604 if (node->height != 0) in hfs_bnode_find()
608 if (node->height != 1) in hfs_bnode_find()
612 if (node->height <= 1 || node->height > tree->depth) in hfs_bnode_find()
|
| A D | brec.c | 255 new_node->height = node->height; in hfs_bnode_split()
324 node_desc.height = new_node->height; in hfs_bnode_split()
493 new_node->height = ++tree->depth; in hfs_btree_inc_height()
498 node_desc.height = new_node->height; in hfs_btree_inc_height()
|
| A D | hfsplus_raw.h | 155 u8 height; member
|
| A D | btree.c | 335 desc.height = 0; in hfs_bmap_new_bmap()
|
| A D | hfsplus_fs.h | 114 u8 height; member
|
| /fs/gfs2/ |
| A D | bmap.c | 238 mp->mp_fheight = height; in find_metapath()
239 for (i = height; i--;) in find_metapath()
258 if (height == 0) in metaptr1()
275 __be64 *p = metaptr1(height, mp); in metapointer()
276 return p + mp->mp_list[height]; in metapointer()
854 u8 height; in __gfs2_iomap_get() local
900 height = ip->i_height; in __gfs2_iomap_get()
902 height++; in __gfs2_iomap_get()
1675 first = metaptr1(height, mp); in metapointer_range()
1922 height--; in punch_hole()
[all …]
|
| A D | glops.c | 394 u16 height, depth; in gfs2_dinode_in() local
442 height = be16_to_cpu(str->di_height); in gfs2_dinode_in()
443 if (unlikely(height > sdp->sd_max_height)) { in gfs2_dinode_in()
447 ip->i_height = (u8)height; in gfs2_dinode_in()
|
| /fs/xfs/libxfs/ |
| A D | xfs_iext_tree.c | 162 int height; in xfs_iext_find_first_leaf() local
167 for (height = ifp->if_height; height > 1; height--) { in xfs_iext_find_first_leaf()
180 int height, i; in xfs_iext_find_last_leaf() local
185 for (height = ifp->if_height; height > 1; height--) { in xfs_iext_find_last_leaf()
310 int height, i; in xfs_iext_find_level() local
315 for (height = ifp->if_height; height > level; height--) { in xfs_iext_find_level()
441 int height, i; in xfs_iext_update_node() local
443 for (height = ifp->if_height; height > level; height--) { in xfs_iext_update_node()
|
| A D | xfs_btree.c | 4974 unsigned int height = 1; in xfs_btree_compute_maxlevels() local
4978 height++; in xfs_btree_compute_maxlevels()
4981 return height; in xfs_btree_compute_maxlevels()
5028 unsigned int height = 1; in xfs_btree_space_to_height() local
5036 height++; in xfs_btree_space_to_height()
5039 return height; in xfs_btree_space_to_height()
|
| /fs/jfs/ |
| A D | jfs_dmap.h | 138 __le32 height; /* 4: height of the tree */ member
166 __le32 height; /* 4: height of tree */ member
184 #define dmt_height t1.height
|
| A D | jfs_dmap.c | 3843 tp->height = cpu_to_le32(4); in dbInitDmapTree()
3960 dcp->height = cpu_to_le32(5); in dbInitDmapCtl()
|
| /fs/xfs/scrub/ |
| A D | repair.c | 633 if (block_level + 1 == fab->height) { in xrep_findroot_block()
636 } else if (block_level < fab->height) { in xrep_findroot_block()
645 fab->height = block_level + 1; in xrep_findroot_block()
659 be32_to_cpu(btblock->bb_magic), fab->height - 1); in xrep_findroot_block()
729 fab->height = 0; in xrep_find_ag_btree_roots()
|
| A D | agheader_repair.c | 145 fab->height <= fab->maxlevels; in xrep_check_btree_root()
232 agf->agf_bno_level = cpu_to_be32(fab[XREP_AGF_BNOBT].height); in xrep_agf_set_roots()
235 agf->agf_cnt_level = cpu_to_be32(fab[XREP_AGF_CNTBT].height); in xrep_agf_set_roots()
238 agf->agf_rmap_level = cpu_to_be32(fab[XREP_AGF_RMAPBT].height); in xrep_agf_set_roots()
244 cpu_to_be32(fab[XREP_AGF_REFCOUNTBT].height); in xrep_agf_set_roots()
922 agi->agi_level = cpu_to_be32(fab[XREP_AGI_INOBT].height); in xrep_agi_set_roots()
926 agi->agi_free_level = cpu_to_be32(fab[XREP_AGI_FINOBT].height); in xrep_agi_set_roots()
|
| A D | repair.h | 71 unsigned int height; member
|