Home
last modified time | relevance | path

Searched refs:rsvd_nodes (Results 1 - 6 of 6) sorted by relevance

/kernel/linux/linux-5.10/fs/hfsplus/
H A Dbtree.c345 /* Make sure @tree has enough space for the @rsvd_nodes */
346 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) in hfs_bmap_reserve() argument
353 if (rsvd_nodes <= 0) in hfs_bmap_reserve()
356 while (tree->free_nodes < rsvd_nodes) { in hfs_bmap_reserve()
H A Dhfsplus_fs.h401 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes);
/kernel/linux/linux-6.6/fs/hfsplus/
H A Dbtree.c346 /* Make sure @tree has enough space for the @rsvd_nodes */
347 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) in hfs_bmap_reserve() argument
354 if (rsvd_nodes <= 0) in hfs_bmap_reserve()
357 while (tree->free_nodes < rsvd_nodes) { in hfs_bmap_reserve()
H A Dhfsplus_fs.h390 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes);
/kernel/linux/linux-5.10/fs/hfs/
H A Dbtree.c223 /* Make sure @tree has enough space for the @rsvd_nodes */
224 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) in hfs_bmap_reserve() argument
230 while (tree->free_nodes < rsvd_nodes) { in hfs_bmap_reserve()
/kernel/linux/linux-6.6/fs/hfs/
H A Dbtree.c226 /* Make sure @tree has enough space for the @rsvd_nodes */
227 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) in hfs_bmap_reserve() argument
233 while (tree->free_nodes < rsvd_nodes) { in hfs_bmap_reserve()

Completed in 6 milliseconds