Home
last modified time | relevance | path

Searched refs:hfs_bnode_desc (Results 1 – 8 of 8) sorted by relevance

/linux/fs/hfsplus/
H A Dxattr.c57 struct hfs_bnode_desc *desc; in hfsplus_init_header_node()
74 desc = (struct hfs_bnode_desc *)buf; in hfsplus_init_header_node()
77 offset = sizeof(struct hfs_bnode_desc); in hfsplus_init_header_node()
99 map_node_bits = 8 * (node_size - sizeof(struct hfs_bnode_desc) - in hfsplus_init_header_node()
128 struct hfs_bnode_desc *desc; in hfsplus_init_map_node()
135 desc = (struct hfs_bnode_desc *)buf; in hfsplus_init_map_node()
160 offset = sizeof(struct hfs_bnode_desc); in hfsplus_init_map_node()
203 struct hfs_bnode_desc *desc; in hfsplus_create_attributes_file()
296 desc = (struct hfs_bnode_desc *)buf; in hfsplus_create_attributes_file()
H A Dbrec.c112 offsetof(struct hfs_bnode_desc, num_recs), in hfs_brec_insert()
212 offsetof(struct hfs_bnode_desc, num_recs), in hfs_brec_remove()
239 struct hfs_bnode_desc node_desc; in hfs_bnode_split()
243 size_t node_desc_size = sizeof(struct hfs_bnode_desc); in hfs_bnode_split()
473 struct hfs_bnode_desc node_desc; in hfs_btree_inc_height()
H A Dbnode.c350 struct hfs_bnode_desc desc; in hfs_bnode_dump()
399 offsetof(struct hfs_bnode_desc, next), 4); in hfs_bnode_unlink()
411 offsetof(struct hfs_bnode_desc, prev), 4); in hfs_bnode_unlink()
531 struct hfs_bnode_desc *desc; in hfs_bnode_find()
555 desc = (struct hfs_bnode_desc *)(kmap_local_page(node->page[0]) + in hfs_bnode_find()
584 if (off != sizeof(struct hfs_bnode_desc)) in hfs_bnode_find()
H A Dbtree.c303 sizeof(struct hfs_bnode_desc)); in hfs_btree_open()
446 sizeof(struct hfs_bnode_desc)); in hfs_btree_write()
467 struct hfs_bnode_desc desc; in hfs_bmap_new_bmap()
477 hfs_bnode_write(prev, &cnid, offsetof(struct hfs_bnode_desc, next), 4); in hfs_bmap_new_bmap()
/linux/fs/hfs/
H A Dbnode.c242 struct hfs_bnode_desc desc; in hfs_bnode_dump()
290 hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, next), 4); in hfs_bnode_unlink()
301 hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, prev), 4); in hfs_bnode_unlink()
418 struct hfs_bnode_desc *desc; in hfs_bnode_find()
441 desc = (struct hfs_bnode_desc *)(kmap_local_page(node->page[0]) + in hfs_bnode_find()
470 if (off != sizeof(struct hfs_bnode_desc)) in hfs_bnode_find()
H A Dbtree.c116 sizeof(struct hfs_bnode_desc)); in hfs_btree_open()
210 sizeof(struct hfs_bnode_desc)); in hfs_btree_write()
230 struct hfs_bnode_desc desc; in hfs_bmap_new_bmap()
242 hfs_bnode_write(prev, &cnid, offsetof(struct hfs_bnode_desc, next), 4); in hfs_bmap_new_bmap()
H A Dbrec.c113 hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs); in hfs_brec_insert()
210 hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs); in hfs_brec_remove()
254 struct hfs_bnode_desc node_desc; in hfs_bnode_split()
480 struct hfs_bnode_desc node_desc; in hfs_btree_inc_height()
/linux/include/linux/
H A Dhfs_common.h469 struct hfs_bnode_desc { struct