Home
last modified time | relevance | path

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

/fs/hfs/
Dbnode.c51 if (node->type == HFS_NODE_LEAF || in hfs_bnode_read_key()
162 } else if (i && node->type == HFS_NODE_LEAF) { in hfs_bnode_dump()
187 } else if (node->type == HFS_NODE_LEAF) in hfs_bnode_unlink()
198 } else if (node->type == HFS_NODE_LEAF) in hfs_bnode_unlink()
355 case HFS_NODE_LEAF: in hfs_bnode_find()
380 node->type != HFS_NODE_LEAF) in hfs_bnode_find()
Dbrec.c34 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()
187 if (node->type == HFS_NODE_LEAF) { in hfs_brec_remove()
473 new_node->type = HFS_NODE_LEAF; in hfs_btree_inc_height()
498 if (node->type == HFS_NODE_LEAF || in hfs_btree_inc_height()
Dbtree.h136 #define HFS_NODE_LEAF 0xFF /* A leaf (ndNHeight==1) node */ macro
Dbfind.c121 if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF)) in hfs_brec_find()
/fs/hfsplus/
Dbnode.c64 if (node->type == HFS_NODE_LEAF || in hfs_bnode_read_key()
326 } else if (i && node->type == HFS_NODE_LEAF) { in hfs_bnode_dump()
352 } else if (node->type == HFS_NODE_LEAF) in hfs_bnode_unlink()
364 } else if (node->type == HFS_NODE_LEAF) in hfs_bnode_unlink()
523 case HFS_NODE_LEAF: in hfs_bnode_find()
548 node->type != HFS_NODE_LEAF) in hfs_bnode_find()
Dbrec.c35 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
103 if (node->type == HFS_NODE_LEAF) { in hfs_brec_insert()
189 if (node->type == HFS_NODE_LEAF) { in hfs_brec_remove()
477 new_node->type = HFS_NODE_LEAF; in hfs_btree_inc_height()
502 if (node->type == HFS_NODE_LEAF || in hfs_btree_inc_height()
Dhfsplus_raw.h163 #define HFS_NODE_LEAF 0xFF /* A leaf (ndNHeight==1) node */ macro
Dbfind.c192 if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF)) in hfs_brec_find()