Home
last modified time | relevance | path

Searched refs:height (Results 1 – 18 of 18) sorted by relevance

/fs/gfs2/
Dbmap.c42 __be64 *bottom, unsigned int height,
240 struct metapath *mp, unsigned int height) in find_metapath() argument
244 for (i = height; i--;) in find_metapath()
266 static inline __be64 *metapointer(unsigned int height, const struct metapath *mp) in metapointer() argument
268 struct buffer_head *bh = mp->mp_bh[height]; in metapointer()
269 unsigned int head_size = (height > 0) ? in metapointer()
271 return ((__be64 *)(bh->b_data + head_size)) + mp->mp_list[height]; in metapointer()
428 const unsigned int height, in gfs2_bmap_alloc() argument
438 const unsigned end_of_metadata = height - 1; in gfs2_bmap_alloc()
449 if (height == sheight) { in gfs2_bmap_alloc()
[all …]
Dmeta_io.c375 int gfs2_meta_indirect_buffer(struct gfs2_inode *ip, int height, u64 num, in gfs2_meta_indirect_buffer() argument
384 BUG_ON(height == 0); in gfs2_meta_indirect_buffer()
390 u32 mtype = height ? GFS2_METATYPE_IN : GFS2_METATYPE_DI; in gfs2_meta_indirect_buffer()
Dmeta_io.h60 int gfs2_meta_indirect_buffer(struct gfs2_inode *ip, int height, u64 num,
Dinode.c252 u16 height, depth; in gfs2_dinode_in() local
292 height = be16_to_cpu(str->di_height); in gfs2_dinode_in()
293 if (unlikely(height > GFS2_MAX_META_HEIGHT)) in gfs2_dinode_in()
295 ip->i_height = (u8)height; in gfs2_dinode_in()
/fs/hfsplus/
Dbfind.c89 int height, res; in hfs_brec_find() local
98 height = tree->depth; in hfs_brec_find()
108 if (bnode->height != height) in hfs_brec_find()
110 if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF)) in hfs_brec_find()
115 if (!height) in hfs_brec_find()
130 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
Dbrec.c236 new_node->height = node->height; in hfs_bnode_split()
292 node_desc.height = new_node->height; in hfs_bnode_split()
452 new_node->height = ++tree->depth; in hfs_btree_inc_height()
457 node_desc.height = new_node->height; in hfs_btree_inc_height()
Dbnode.c304 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
505 node->height = desc->height; in hfs_bnode_find()
511 if (node->height != 0) in hfs_bnode_find()
515 if (node->height != 1) in hfs_bnode_find()
519 if (node->height <= 1 || node->height > tree->depth) in hfs_bnode_find()
Dhfsplus_raw.h142 u8 height; member
Dhfsplus_fs.h86 u8 height; member
Dbtree.c171 desc.height = 0; in hfs_bmap_new_bmap()
/fs/hfs/
Dbfind.c98 int height, res; in hfs_brec_find() local
107 height = tree->depth; in hfs_brec_find()
117 if (bnode->height != height) in hfs_brec_find()
119 if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF)) in hfs_brec_find()
124 if (!height) in hfs_brec_find()
139 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
Dbnode.c144 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
345 node->height = desc->height; in hfs_bnode_find()
351 if (node->height != 0) in hfs_bnode_find()
355 if (node->height != 1) in hfs_bnode_find()
359 if (node->height <= 1 || node->height > tree->depth) in hfs_bnode_find()
Dbrec.c249 new_node->height = node->height; in hfs_bnode_split()
318 node_desc.height = new_node->height; in hfs_bnode_split()
479 new_node->height = ++tree->depth; in hfs_btree_inc_height()
484 node_desc.height = new_node->height; in hfs_btree_inc_height()
Dbtree.h55 u8 height; member
128 u8 height; /* (F) The level of this node (leaves=1) */ member
Dbtree.c195 desc.height = 0; in hfs_bmap_new_bmap()
/fs/jfs/
Djfs_dmap.h151 __le32 height; /* 4: height of the tree */ member
179 __le32 height; /* 4: height of tree */ member
197 #define dmt_height t1.height
Djfs_dmap.c3759 tp->height = cpu_to_le32(4); in dbInitDmapTree()
3876 dcp->height = cpu_to_le32(5); in dbInitDmapCtl()
/fs/
Dcompat_ioctl.c1096 if (get_user(op.height, &user_cfd->charheight) || in do_fontx_ioctl()
1106 if (get_user(op.height, &user_cfd->charheight) || in do_fontx_ioctl()
1116 if (put_user(op.height, &user_cfd->charheight) || in do_fontx_ioctl()
1129 compat_uint_t width, height; /* font size */ member