Home
last modified time | relevance | path

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

/linux-2.6.39/fs/hfs/
Dbtree.h25 u32 leaf_tail; member
143 __be32 leaf_tail; /* (V) The number of the last leaf node */ member
Dbtree.c77 tree->leaf_tail = be32_to_cpu(head->leaf_tail); in hfs_btree_open()
166 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()
469 tree->leaf_head = tree->leaf_tail = new_node->this; in hfs_btree_inc_height()
Dbnode.c198 tree->leaf_tail = node->prev; in hfs_bnode_unlink()
/linux-2.6.39/fs/hfsplus/
Dbtree.c59 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()
Dbrec.c335 } else if (node->this == tree->leaf_tail) { in hfs_bnode_split()
337 tree->leaf_tail = new_node->this; in hfs_bnode_split()
467 tree->leaf_head = tree->leaf_tail = new_node->this; in hfs_btree_inc_height()
Dhfsplus_raw.h160 __be32 leaf_tail; member
Dhfsplus_fs.h58 u32 leaf_tail; member
Dbnode.c363 tree->leaf_tail = node->prev; in hfs_bnode_unlink()