Home
last modified time | relevance | path

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

/linux-4.4.14/fs/hfs/
Dbtree.h25 u32 leaf_tail; member
143 __be32 leaf_tail; /* (V) The number of the last leaf node */ member
Dbtree.c86 tree->leaf_tail = be32_to_cpu(head->leaf_tail); in hfs_btree_open()
176 head->leaf_tail = cpu_to_be32(tree->leaf_tail); in hfs_btree_write()
Dbrec.c337 } else if (node->this == tree->leaf_tail) { in hfs_bnode_split()
339 tree->leaf_tail = new_node->this; in hfs_bnode_split()
472 tree->leaf_head = tree->leaf_tail = new_node->this; in hfs_btree_inc_height()
Dbnode.c199 tree->leaf_tail = node->prev; in hfs_bnode_unlink()
/linux-4.4.14/fs/hfsplus/
Dbtree.c170 tree->leaf_tail = be32_to_cpu(head->leaf_tail); in hfs_btree_open()
299 head->leaf_tail = cpu_to_be32(tree->leaf_tail); in hfs_btree_write()
Dbrec.c341 } else if (node->this == tree->leaf_tail) { in hfs_bnode_split()
343 tree->leaf_tail = new_node->this; in hfs_bnode_split()
476 tree->leaf_head = tree->leaf_tail = new_node->this; in hfs_btree_inc_height()
Dhfsplus_raw.h171 __be32 leaf_tail; member
Dhfsplus_fs.h82 u32 leaf_tail; member
Dbnode.c365 tree->leaf_tail = node->prev; in hfs_bnode_unlink()
Dxattr.c103 desc->next = cpu_to_be32(be32_to_cpu(head->leaf_tail) + 1); in hfsplus_init_header_node()