Home
last modified time | relevance | path

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

/fs/hfs/
Dbnode.c50 if (node->type == HFS_NODE_LEAF || in hfs_bnode_read_key()
160 } else if (i && node->type == HFS_NODE_LEAF) { in hfs_bnode_dump()
185 } else if (node->type == HFS_NODE_LEAF) in hfs_bnode_unlink()
196 } else if (node->type == HFS_NODE_LEAF) in hfs_bnode_unlink()
354 case HFS_NODE_LEAF: in hfs_bnode_find()
379 node->type != HFS_NODE_LEAF) in hfs_bnode_find()
Dbtree.h136 #define HFS_NODE_LEAF 0xFF /* A leaf (ndNHeight==1) node */ macro
159 #define HFS_NODE_LEAF 0xFF /* A leaf (ndNHeight==1) node */ macro
Dbrec.c34 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
106 if (node->type == HFS_NODE_LEAF) { in hfs_brec_insert()
188 if (node->type == HFS_NODE_LEAF) { in hfs_brec_remove()
470 new_node->type = HFS_NODE_LEAF; in hfs_btree_inc_height()
495 if (node->type == HFS_NODE_LEAF || in hfs_btree_inc_height()
Dbfind.c119 if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF)) in hfs_brec_find()
/fs/hfsplus/
Dbrec.c35 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
93 if (node->type == HFS_NODE_LEAF) { in hfs_brec_insert()
175 if (node->type == HFS_NODE_LEAF) { in hfs_brec_remove()
443 new_node->type = HFS_NODE_LEAF; in hfs_btree_inc_height()
468 if (node->type == HFS_NODE_LEAF || in hfs_btree_inc_height()
Dbnode.c64 if (node->type == HFS_NODE_LEAF || in hfs_bnode_read_key()
320 } else if (i && node->type == HFS_NODE_LEAF) { in hfs_bnode_dump()
345 } else if (node->type == HFS_NODE_LEAF) in hfs_bnode_unlink()
356 } else if (node->type == HFS_NODE_LEAF) in hfs_bnode_unlink()
514 case HFS_NODE_LEAF: in hfs_bnode_find()
539 node->type != HFS_NODE_LEAF) in hfs_bnode_find()
Dbfind.c110 if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF)) in hfs_brec_find()
Dhfsplus_raw.h151 #define HFS_NODE_LEAF 0xFF macro