Home
last modified time | relevance | path

Searched refs:HFS_NODE_LEAF (Results 1 – 7 of 7) sorted by relevance

/linux/fs/hfs/
H A Dbnode.c120 if (node->type == HFS_NODE_LEAF || in hfs_bnode_read_key()
267 } else if (i && node->type == HFS_NODE_LEAF) { in hfs_bnode_dump()
292 } else if (node->type == HFS_NODE_LEAF) in hfs_bnode_unlink()
303 } else if (node->type == HFS_NODE_LEAF) in hfs_bnode_unlink()
456 case HFS_NODE_LEAF: in hfs_bnode_find()
481 node->type != HFS_NODE_LEAF) in hfs_bnode_find()
H A Dbrec.c35 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
107 if (node->type == HFS_NODE_LEAF) { in hfs_brec_insert()
190 if (node->type == HFS_NODE_LEAF) { in hfs_brec_remove()
499 new_node->type = HFS_NODE_LEAF; in hfs_btree_inc_height()
524 if (node->type == HFS_NODE_LEAF || in hfs_btree_inc_height()
H A Dbfind.c143 if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF)) in hfs_brec_find()
/linux/fs/hfsplus/
H A Dbrec.c36 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
105 if (node->type == HFS_NODE_LEAF) { in hfs_brec_insert()
191 if (node->type == HFS_NODE_LEAF) { in hfs_brec_remove()
484 new_node->type = HFS_NODE_LEAF; in hfs_btree_inc_height()
509 if (node->type == HFS_NODE_LEAF || in hfs_btree_inc_height()
H A Dbnode.c78 if (node->type == HFS_NODE_LEAF || in hfs_bnode_read_key()
375 } else if (i && node->type == HFS_NODE_LEAF) { in hfs_bnode_dump()
401 } else if (node->type == HFS_NODE_LEAF) in hfs_bnode_unlink()
413 } else if (node->type == HFS_NODE_LEAF) in hfs_bnode_unlink()
567 case HFS_NODE_LEAF: in hfs_bnode_find()
592 node->type != HFS_NODE_LEAF) in hfs_bnode_find()
H A Dbfind.c186 if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF)) in hfs_brec_find()
/linux/include/linux/
H A Dhfs_common.h477 #define HFS_NODE_LEAF 0xFF /* A leaf (ndNHeight==1) node */ macro