Home
last modified time | relevance | path

Searched refs:leaf_tail (Results 1 – 10 of 10) sorted by relevance

/linux/fs/hfs/
H A Dbtree.h33 u32 leaf_tail; member
152 __be32 leaf_tail; /* (V) The number of the last leaf node */ member
H A Dbtree.c88 tree->leaf_tail = be32_to_cpu(head->leaf_tail); in hfs_btree_open()
180 head->leaf_tail = cpu_to_be32(tree->leaf_tail); in hfs_btree_write()
H A Dbrec.c339 } else if (node->this == tree->leaf_tail) { in hfs_bnode_split()
341 tree->leaf_tail = new_node->this; in hfs_bnode_split()
479 tree->leaf_head = tree->leaf_tail = new_node->this; in hfs_btree_inc_height()
H A Dbnode.c206 tree->leaf_tail = node->prev; in hfs_bnode_unlink()
/linux/fs/hfsplus/
H A Dbtree.c171 tree->leaf_tail = be32_to_cpu(head->leaf_tail); in hfs_btree_open()
301 head->leaf_tail = cpu_to_be32(tree->leaf_tail); in hfs_btree_write()
H A Dbrec.c343 } else if (node->this == tree->leaf_tail) { in hfs_bnode_split()
345 tree->leaf_tail = new_node->this; in hfs_bnode_split()
483 tree->leaf_head = tree->leaf_tail = new_node->this; in hfs_btree_inc_height()
H A Dhfsplus_raw.h172 __be32 leaf_tail; member
H A Dhfsplus_fs.h82 u32 leaf_tail; member
H A Dbnode.c357 tree->leaf_tail = node->prev; in hfs_bnode_unlink()
H A Dxattr.c98 desc->next = cpu_to_be32(be32_to_cpu(head->leaf_tail) + 1); in hfsplus_init_header_node()