Home
last modified time | relevance | path

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

/linux/fs/hfs/
H A Dcatalog.c237 s64 leaf_head; in hfs_correct_next_unused_CNID() local
250 leaf_head = cat_tree->leaf_head; 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()
278 node_id, leaf_tail, leaf_head); in hfs_correct_next_unused_CNID()
328 } while (node_id >= leaf_head); in hfs_correct_next_unused_CNID()
H A Dbtree.c119 tree->leaf_head = be32_to_cpu(head->leaf_head); in hfs_btree_open()
214 head->leaf_head = cpu_to_be32(tree->leaf_head); in hfs_btree_write()
H A Dbtree.h32 u32 leaf_head; member
H A Dbrec.c78 node = hfs_bnode_find(tree, tree->leaf_head); in hfs_brec_insert()
498 tree->leaf_head = tree->leaf_tail = new_node->this; in hfs_btree_inc_height()
H A Dbnode.c293 tree->leaf_head = node->next; in hfs_bnode_unlink()
/linux/fs/hfsplus/
H A Dbtree.c170 tree->leaf_head = be32_to_cpu(head->leaf_head); in hfs_btree_open()
300 head->leaf_head = cpu_to_be32(tree->leaf_head); in hfs_btree_write()
H A Dbrec.c76 node = hfs_bnode_find(tree, tree->leaf_head); in hfs_brec_insert()
483 tree->leaf_head = tree->leaf_tail = new_node->this; in hfs_btree_inc_height()
H A Dhfsplus_fs.h48 u32 leaf_head; member
H A Dbnode.c402 tree->leaf_head = node->next; in hfs_bnode_unlink()
/linux/include/linux/
H A Dhfs_common.h484 __be32 leaf_head; /* (V) The number of the first leaf node */ member
/linux/drivers/infiniband/hw/hns/
H A Dhns_roce_hem.c1212 struct list_head *leaf_head) in alloc_fake_root_bt() argument
1230 list_add(&hem->sibling, leaf_head); in alloc_fake_root_bt()