Home
last modified time | relevance | path

Searched refs:hfs_btree (Results 1 – 15 of 15) sorted by relevance

/linux/fs/hfs/
H A Dbtree.h24 struct hfs_btree { struct
54 struct hfs_btree *tree; argument
80 struct hfs_btree *tree;
89 extern struct hfs_btree *hfs_btree_open(struct super_block *sb, u32 id,
91 extern void hfs_btree_close(struct hfs_btree *tree);
92 extern void hfs_btree_write(struct hfs_btree *tree);
93 extern int hfs_bmap_reserve(struct hfs_btree *tree, u32 rsvd_nodes);
94 extern struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree);
111 extern struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid);
112 extern struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num);
[all …]
H A Dbtree.c19 struct hfs_btree *hfs_btree_open(struct super_block *sb, u32 id, btree_keycmp keycmp) in hfs_btree_open()
21 struct hfs_btree *tree; in hfs_btree_open()
174 void hfs_btree_close(struct hfs_btree *tree) in hfs_btree_close()
197 void hfs_btree_write(struct hfs_btree *tree) in hfs_btree_write()
228 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap()
262 int hfs_bmap_reserve(struct hfs_btree *tree, u32 rsvd_nodes) in hfs_bmap_reserve()
285 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) in hfs_bmap_alloc()
361 struct hfs_btree *tree; in hfs_bmap_free()
H A Dbnode.c116 struct hfs_btree *tree; in hfs_bnode_read_key()
279 struct hfs_btree *tree; in hfs_bnode_unlink()
324 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) in hfs_bnode_findhash()
342 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) in __hfs_bnode_create()
415 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find()
509 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) in hfs_bnode_create()
559 struct hfs_btree *tree = node->tree; in hfs_bnode_put()
H A Dbrec.c16 static int hfs_btree_inc_height(struct hfs_btree *tree);
67 struct hfs_btree *tree; in hfs_brec_insert()
179 struct hfs_btree *tree; in hfs_brec_remove()
252 struct hfs_btree *tree; in hfs_bnode_split()
373 struct hfs_btree *tree; in hfs_brec_update_parent()
477 static int hfs_btree_inc_height(struct hfs_btree *tree) in hfs_btree_inc_height()
H A Dbfind.c15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) in hfs_find_init()
112 struct hfs_btree *tree; in hfs_brec_find()
185 struct hfs_btree *tree; in hfs_brec_goto()
H A Dhfs_fs.h79 struct hfs_btree *ext_tree; /* Information about
81 struct hfs_btree *cat_tree; /* Information about
H A Dcatalog.c235 struct hfs_btree *cat_tree; in hfs_correct_next_unused_CNID()
H A Dinode.c71 struct hfs_btree *tree; in hfs_release_folio()
/linux/fs/hfsplus/
H A Dhfsplus_fs.h40 struct hfs_btree { struct
71 struct hfs_btree *tree; argument
109 struct hfs_btree;
116 struct hfs_btree *ext_tree;
117 struct hfs_btree *cat_tree;
118 struct hfs_btree *attr_tree;
259 struct hfs_btree *tree;
359 struct hfs_btree *hfs_btree_open(struct super_block *sb, u32 id);
360 void hfs_btree_close(struct hfs_btree *tree);
361 int hfs_btree_write(struct hfs_btree *tree);
[all …]
H A Dbtree.c133 struct hfs_btree *hfs_btree_open(struct super_block *sb, u32 id) in hfs_btree_open()
135 struct hfs_btree *tree; in hfs_btree_open()
259 void hfs_btree_close(struct hfs_btree *tree) in hfs_btree_close()
283 int hfs_btree_write(struct hfs_btree *tree) in hfs_btree_write()
315 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap()
347 int hfs_bmap_reserve(struct hfs_btree *tree, u32 rsvd_nodes) in hfs_bmap_reserve()
374 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) in hfs_bmap_alloc()
457 struct hfs_btree *tree; in hfs_bmap_free()
H A Dbnode.c74 struct hfs_btree *tree; in hfs_bnode_read_key()
387 struct hfs_btree *tree; in hfs_bnode_unlink()
433 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) in hfs_bnode_findhash()
450 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) in __hfs_bnode_create()
525 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find()
620 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) in hfs_bnode_create()
670 struct hfs_btree *tree = node->tree; in hfs_bnode_put()
702 bool hfs_bnode_need_zeroout(struct hfs_btree *tree) in hfs_bnode_need_zeroout()
H A Dbrec.c17 static int hfs_btree_inc_height(struct hfs_btree *);
65 struct hfs_btree *tree; in hfs_brec_insert()
181 struct hfs_btree *tree; in hfs_brec_remove()
237 struct hfs_btree *tree; in hfs_bnode_split()
358 struct hfs_btree *tree; in hfs_brec_update_parent()
462 static int hfs_btree_inc_height(struct hfs_btree *tree) in hfs_btree_inc_height()
H A Dbfind.c15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) in hfs_find_init()
155 struct hfs_btree *tree; in hfs_brec_find()
228 struct hfs_btree *tree; in hfs_brec_goto()
H A Dinode.c66 struct hfs_btree *tree; in hfsplus_release_folio()
637 struct hfs_btree *tree = HFSPLUS_SB(inode->i_sb)->cat_tree; in hfsplus_cat_write_inode()
H A Dsuper.c125 struct hfs_btree *tree = NULL; in hfsplus_system_write_inode()