| /linux-6.6.21/fs/hfs/ |
| D | btree.h | 48 struct hfs_bnode *node_hash[NODE_HASH_SIZE];
53 struct hfs_bnode { struct
65 struct hfs_bnode *next_hash; argument
81 struct hfs_bnode *bnode; argument
93 extern struct hfs_bnode * hfs_bmap_alloc(struct hfs_btree *);
94 extern void hfs_bmap_free(struct hfs_bnode *node);
97 extern void hfs_bnode_read(struct hfs_bnode *, void *, int, int);
98 extern u16 hfs_bnode_read_u16(struct hfs_bnode *, int);
99 extern u8 hfs_bnode_read_u8(struct hfs_bnode *, int);
100 extern void hfs_bnode_read_key(struct hfs_bnode *, void *, int);
[all …]
|
| D | bnode.c | 18 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read()
42 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16()
50 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8()
58 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key()
73 void hfs_bnode_write(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_write()
84 void hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data) in hfs_bnode_write_u16()
91 void hfs_bnode_write_u8(struct hfs_bnode *node, int off, u8 data) in hfs_bnode_write_u8()
97 void hfs_bnode_clear(struct hfs_bnode *node, int off, int len) in hfs_bnode_clear()
108 void hfs_bnode_copy(struct hfs_bnode *dst_node, int dst, in hfs_bnode_copy()
109 struct hfs_bnode *src_node, int src, int len) in hfs_bnode_copy()
[all …]
|
| D | btree.c | 141 struct hfs_bnode *node; in hfs_btree_close()
165 struct hfs_bnode *node; in hfs_btree_write()
191 static struct hfs_bnode *hfs_bmap_new_bmap(struct hfs_bnode *prev, u32 idx) in hfs_bmap_new_bmap()
194 struct hfs_bnode *node; in hfs_bmap_new_bmap()
250 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) in hfs_bmap_alloc()
252 struct hfs_bnode *node, *next_node; in hfs_bmap_alloc()
324 void hfs_bmap_free(struct hfs_bnode *node) in hfs_bmap_free()
|
| D | brec.c | 14 static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd);
19 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) in hfs_brec_lenoff()
31 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) in hfs_brec_keylen()
68 struct hfs_bnode *node, *new_node; in hfs_brec_insert()
180 struct hfs_bnode *node, *parent; in hfs_brec_remove()
231 static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd) in hfs_bnode_split()
234 struct hfs_bnode *node, *new_node, *next_node; in hfs_bnode_split()
355 struct hfs_bnode *node, *new_node, *parent; in hfs_brec_update_parent()
460 struct hfs_bnode *node, *new_node; in hfs_btree_inc_height()
|
| D | bfind.c | 55 int __hfs_brec_find(struct hfs_bnode *bnode, struct hfs_find_data *fd) in __hfs_brec_find()
110 struct hfs_bnode *bnode; in hfs_brec_find()
177 struct hfs_bnode *bnode; in hfs_brec_goto()
|
| D | inode.c | 77 struct hfs_bnode *node; in hfs_release_folio()
|
| /linux-6.6.21/fs/hfsplus/ |
| D | hfsplus_fs.h | 96 struct hfs_bnode *node_hash[NODE_HASH_SIZE];
103 struct hfs_bnode { struct
115 struct hfs_bnode *next_hash; argument
291 struct hfs_bnode *bnode;
354 typedef int (*search_strategy_t)(struct hfs_bnode *,
391 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree);
392 void hfs_bmap_free(struct hfs_bnode *node);
395 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len);
396 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off);
397 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off);
[all …]
|
| D | bnode.c | 22 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read()
41 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16()
49 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8()
57 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key()
73 void hfs_bnode_write(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_write()
94 void hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data) in hfs_bnode_write_u16()
101 void hfs_bnode_clear(struct hfs_bnode *node, int off, int len) in hfs_bnode_clear()
121 void hfs_bnode_copy(struct hfs_bnode *dst_node, int dst, in hfs_bnode_copy()
122 struct hfs_bnode *src_node, int src, int len) in hfs_bnode_copy()
175 void hfs_bnode_move(struct hfs_bnode *node, int dst, int src, int len) in hfs_bnode_move()
[all …]
|
| D | btree.c | 261 struct hfs_bnode *node; in hfs_btree_close()
286 struct hfs_bnode *node; in hfs_btree_write()
313 static struct hfs_bnode *hfs_bmap_new_bmap(struct hfs_bnode *prev, u32 idx) in hfs_bmap_new_bmap()
316 struct hfs_bnode *node; in hfs_bmap_new_bmap()
374 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) in hfs_bmap_alloc()
376 struct hfs_bnode *node, *next_node; in hfs_bmap_alloc()
449 void hfs_bmap_free(struct hfs_bnode *node) in hfs_bmap_free()
|
| D | brec.c | 15 static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd);
20 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) in hfs_brec_lenoff()
32 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) in hfs_brec_keylen()
66 struct hfs_bnode *node, *new_node; in hfs_brec_insert()
182 struct hfs_bnode *node, *parent; in hfs_brec_remove()
235 static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd) in hfs_bnode_split()
238 struct hfs_bnode *node, *new_node, *next_node; in hfs_bnode_split()
359 struct hfs_bnode *node, *new_node, *parent; in hfs_brec_update_parent()
464 struct hfs_bnode *node, *new_node; in hfs_btree_inc_height()
|
| D | bfind.c | 54 int hfs_find_1st_rec_by_cnid(struct hfs_bnode *bnode, in hfs_find_1st_rec_by_cnid()
92 int hfs_find_rec_by_key(struct hfs_bnode *bnode, in hfs_find_rec_by_key()
114 int __hfs_brec_find(struct hfs_bnode *bnode, struct hfs_find_data *fd, in __hfs_brec_find()
167 struct hfs_bnode *bnode; in hfs_brec_find()
234 struct hfs_bnode *bnode; in hfs_brec_goto()
|
| D | inode.c | 71 struct hfs_bnode *node; in hfsplus_release_folio()
|