Home
last modified time | relevance | path

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

/linux/fs/hfs/
H A Dcatalog.c238 s64 leaf_tail; in hfs_correct_next_unused_CNID() local
251 leaf_tail = cat_tree->leaf_tail; in hfs_correct_next_unused_CNID()
253 if (leaf_head > leaf_tail) { in hfs_correct_next_unused_CNID()
255 leaf_head, leaf_tail); in hfs_correct_next_unused_CNID()
259 node = hfs_bnode_find(cat_tree, leaf_tail); in hfs_correct_next_unused_CNID()
262 leaf_tail); in hfs_correct_next_unused_CNID()
266 node_id = leaf_tail; in hfs_correct_next_unused_CNID()
271 if (node_id != leaf_tail) { in hfs_correct_next_unused_CNID()
278 node_id, leaf_tail, leaf_head); in hfs_correct_next_unused_CNID()
H A Dbtree.c120 tree->leaf_tail = be32_to_cpu(head->leaf_tail); in hfs_btree_open()
215 head->leaf_tail = cpu_to_be32(tree->leaf_tail); in hfs_btree_write()
H A Dbrec.c358 } else if (node->this == tree->leaf_tail) { in hfs_bnode_split()
360 tree->leaf_tail = new_node->this; in hfs_bnode_split()
498 tree->leaf_head = tree->leaf_tail = new_node->this; in hfs_btree_inc_height()
H A Dbtree.h33 u32 leaf_tail; member
H A Dbnode.c304 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_fs.h49 u32 leaf_tail; member
H A Dbnode.c414 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()
/linux/include/linux/
H A Dhfs_common.h485 __be32 leaf_tail; /* (V) The number of the last leaf node */ member