leaf_tail         198 fs/hfs/bnode.c 		tree->leaf_tail = node->prev;
leaf_tail         339 fs/hfs/brec.c  	} else if (node->this == tree->leaf_tail) {
leaf_tail         341 fs/hfs/brec.c  		tree->leaf_tail = new_node->this;
leaf_tail         479 fs/hfs/brec.c  		tree->leaf_head = tree->leaf_tail = new_node->this;
leaf_tail          87 fs/hfs/btree.c 	tree->leaf_tail = be32_to_cpu(head->leaf_tail);
leaf_tail         177 fs/hfs/btree.c 	head->leaf_tail = cpu_to_be32(tree->leaf_tail);
leaf_tail          26 fs/hfs/btree.h 	u32 leaf_tail;
leaf_tail         145 fs/hfs/btree.h 	__be32 leaf_tail;	/* (V) The number of the last leaf node */
leaf_tail         364 fs/hfsplus/bnode.c 		tree->leaf_tail = node->prev;
leaf_tail         343 fs/hfsplus/brec.c 	} else if (node->this == tree->leaf_tail) {
leaf_tail         345 fs/hfsplus/brec.c 		tree->leaf_tail = new_node->this;
leaf_tail         483 fs/hfsplus/brec.c 		tree->leaf_head = tree->leaf_tail = new_node->this;
leaf_tail         171 fs/hfsplus/btree.c 	tree->leaf_tail = be32_to_cpu(head->leaf_tail);
leaf_tail         300 fs/hfsplus/btree.c 	head->leaf_tail = cpu_to_be32(tree->leaf_tail);
leaf_tail          82 fs/hfsplus/hfsplus_fs.h 	u32 leaf_tail;
leaf_tail         172 fs/hfsplus/hfsplus_raw.h 	__be32 leaf_tail;
leaf_tail          98 fs/hfsplus/xattr.c 		desc->next = cpu_to_be32(be32_to_cpu(head->leaf_tail) + 1);