Home
last modified time | relevance | path

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

/linux-2.6.39/fs/nilfs2/
Dbtree.h59 #define NILFS_BTREE_NODE_NCHILDREN_MAX(nodesize) \ argument
60 (((nodesize) - sizeof(struct nilfs_btree_node) - \
63 #define NILFS_BTREE_NODE_NCHILDREN_MIN(nodesize) \ argument
64 ((NILFS_BTREE_NODE_NCHILDREN_MAX(nodesize) - 1) / 2 + 1)
/linux-2.6.39/fs/btrfs/
Ddisk-io.c1037 static int __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize, in __setup_root() argument
1045 root->nodesize = nodesize; in __setup_root()
1111 __setup_root(tree_root->nodesize, tree_root->leafsize, in find_and_setup_root()
1143 __setup_root(tree_root->nodesize, tree_root->leafsize, in alloc_log_tree()
1246 __setup_root(tree_root->nodesize, tree_root->leafsize, in btrfs_read_fs_root_no_radix()
1601 u32 nodesize; in open_ctree() local
1890 nodesize = btrfs_super_nodesize(disk_super); in open_ctree()
1894 tree_root->nodesize = nodesize; in open_ctree()
1921 __setup_root(nodesize, leafsize, sectorsize, stripesize, in open_ctree()
2045 __setup_root(nodesize, leafsize, sectorsize, stripesize, in open_ctree()
Dctree.h337 #define BTRFS_NODEPTRS_PER_BLOCK(r) (((r)->nodesize - \
382 __le32 nodesize; member
1128 u32 nodesize; member
1964 nodesize, 32);
2078 return root->nodesize; in btrfs_level_size()
Dctree.c1973 c = btrfs_alloc_free_block(trans, root, root->nodesize, 0, in insert_new_root()
1979 root_add_used(root, root->nodesize); in insert_new_root()
2100 split = btrfs_alloc_free_block(trans, root, root->nodesize, 0, in split_node()
2106 root_add_used(root, root->nodesize); in split_node()
Drelocation.c2028 min_reserved = root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2;
2140 rc->merging_rsv_size += root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2;
3629 rc->extent_root->nodesize * 256);
Dextent-tree.c3978 return (root->leafsize + root->nodesize * (BTRFS_MAX_LEVEL - 1)) * in calc_trans_metadata_size()