hfsplus_fs.h (472475000979a156bc32cd75caa59737f5a1caa5) | hfsplus_fs.h (d92915c35bfaf763d78bf1d5ac7f183420e3bd99) |
---|---|
1/* SPDX-License-Identifier: GPL-2.0 */ 2/* 3 * linux/include/linux/hfsplus_fs.h 4 * 5 * Copyright (C) 1999 6 * Brad Boyer (flar@pants.nu) 7 * (C) 2003 Ardis Technologies <roman@ardistech.com> 8 * --- 297 unchanged lines hidden (view full) --- 306{ 307 return max_t(unsigned short, bdev_logical_block_size(sb->s_bdev), 308 HFSPLUS_SECTOR_SIZE); 309} 310 311#define hfs_btree_open hfsplus_btree_open 312#define hfs_btree_close hfsplus_btree_close 313#define hfs_btree_write hfsplus_btree_write | 1/* SPDX-License-Identifier: GPL-2.0 */ 2/* 3 * linux/include/linux/hfsplus_fs.h 4 * 5 * Copyright (C) 1999 6 * Brad Boyer (flar@pants.nu) 7 * (C) 2003 Ardis Technologies <roman@ardistech.com> 8 * --- 297 unchanged lines hidden (view full) --- 306{ 307 return max_t(unsigned short, bdev_logical_block_size(sb->s_bdev), 308 HFSPLUS_SECTOR_SIZE); 309} 310 311#define hfs_btree_open hfsplus_btree_open 312#define hfs_btree_close hfsplus_btree_close 313#define hfs_btree_write hfsplus_btree_write |
314#define hfs_bmap_reserve hfsplus_bmap_reserve |
|
314#define hfs_bmap_alloc hfsplus_bmap_alloc 315#define hfs_bmap_free hfsplus_bmap_free 316#define hfs_bnode_read hfsplus_bnode_read 317#define hfs_bnode_read_u16 hfsplus_bnode_read_u16 318#define hfs_bnode_read_u8 hfsplus_bnode_read_u8 319#define hfs_bnode_read_key hfsplus_bnode_read_key 320#define hfs_bnode_write hfsplus_bnode_write 321#define hfs_bnode_write_u16 hfsplus_bnode_write_u16 --- 68 unchanged lines hidden (view full) --- 390int hfsplus_block_free(struct super_block *sb, u32 offset, u32 count); 391 392/* btree.c */ 393u32 hfsplus_calc_btree_clump_size(u32 block_size, u32 node_size, u64 sectors, 394 int file_id); 395struct hfs_btree *hfs_btree_open(struct super_block *sb, u32 id); 396void hfs_btree_close(struct hfs_btree *tree); 397int hfs_btree_write(struct hfs_btree *tree); | 315#define hfs_bmap_alloc hfsplus_bmap_alloc 316#define hfs_bmap_free hfsplus_bmap_free 317#define hfs_bnode_read hfsplus_bnode_read 318#define hfs_bnode_read_u16 hfsplus_bnode_read_u16 319#define hfs_bnode_read_u8 hfsplus_bnode_read_u8 320#define hfs_bnode_read_key hfsplus_bnode_read_key 321#define hfs_bnode_write hfsplus_bnode_write 322#define hfs_bnode_write_u16 hfsplus_bnode_write_u16 --- 68 unchanged lines hidden (view full) --- 391int hfsplus_block_free(struct super_block *sb, u32 offset, u32 count); 392 393/* btree.c */ 394u32 hfsplus_calc_btree_clump_size(u32 block_size, u32 node_size, u64 sectors, 395 int file_id); 396struct hfs_btree *hfs_btree_open(struct super_block *sb, u32 id); 397void hfs_btree_close(struct hfs_btree *tree); 398int hfs_btree_write(struct hfs_btree *tree); |
399int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes); |
|
398struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree); 399void hfs_bmap_free(struct hfs_bnode *node); 400 401/* bnode.c */ 402void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len); 403u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off); 404u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off); 405void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off); --- 136 unchanged lines hidden --- | 400struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree); 401void hfs_bmap_free(struct hfs_bnode *node); 402 403/* bnode.c */ 404void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len); 405u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off); 406u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off); 407void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off); --- 136 unchanged lines hidden --- |