Home
last modified time | relevance | path

Searched refs:pages_per_bnode (Results 1 – 6 of 6) sorted by relevance

/linux-6.15/fs/hfs/
H A Dbnode.c30 if (pagenum >= node->tree->pages_per_bnode) in hfs_bnode_read()
263 size = sizeof(struct hfs_bnode) + tree->pages_per_bnode * in __hfs_bnode_create()
295 for (i = 0; i < tree->pages_per_bnode; i++) { in __hfs_bnode_create()
411 for (i = 0; i < node->tree->pages_per_bnode; i++) in hfs_bnode_free()
443 for (i = 1; i < tree->pages_per_bnode; i++) { in hfs_bnode_create()
476 for (i = 0; i < tree->pages_per_bnode; i++) { in hfs_bnode_put()
H A Dbtree.h46 unsigned int pages_per_bnode; member
H A Dbtree.c121 tree->pages_per_bnode = (tree->node_size + PAGE_SIZE - 1) >> PAGE_SHIFT; in hfs_btree_open()
/linux-6.15/fs/hfsplus/
H A Dbnode.c413 size = sizeof(struct hfs_bnode) + tree->pages_per_bnode * in __hfs_bnode_create()
445 for (i = 0; i < tree->pages_per_bnode; block++, i++) { in __hfs_bnode_create()
562 for (i = 0; i < node->tree->pages_per_bnode; i++) in hfs_bnode_free()
594 for (i = 1; i < tree->pages_per_bnode; i++) { in hfs_bnode_create()
627 for (i = 0; i < tree->pages_per_bnode; i++) { in hfs_bnode_put()
H A Dbtree.c239 tree->pages_per_bnode = in hfs_btree_open()
H A Dhfsplus_fs.h95 unsigned int pages_per_bnode; member