Home
last modified time | relevance | path

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

/linux-2.4.37.9/fs/hfs/
Dbinsert.c139 root->ndFLink = 0; in add_root()
222 if (left->ndFLink) { in insert_empty_bnode()
223 right = hfs_bnode_find(tree, left->ndFLink, HFS_LOCK_WRITE); in insert_empty_bnode()
237 retval.bn->ndFLink = left->ndFLink; in insert_empty_bnode()
243 left->ndFLink = retval.bn->node; in insert_empty_bnode()
384 if (left.bn->ndFLink && in binsert()
385 hfs_bnode_in_brec(left.bn->ndFLink, brec)) { in binsert()
Dbnode.c156 bnode->ndFLink = hfs_get_hl(nd->ndFLink); in hfs_bnode_read()
516 bn->ndBLink, bn->ndFLink, bn->ndNRecs); in hfs_bnode_find()
534 hfs_put_hl(bn->ndFLink, nd->ndFLink); in hfs_bnode_commit()
Dhfs_btree.h109 hfs_lword_t ndFLink; /* (V) Number of the next node at this level */ member
166 hfs_u32 ndFLink; member
Dballoc.c168 retval->ndFLink = 0; in init_mapnode()
179 bn->ndFLink = node; in init_mapnode()
Dbdelete.c210 left->bn->ndFLink = right_node; in delete_empty_bnode()
323 right_node = bnode->ndFLink; in bdelete()
Dbfind.c289 if (!(node = bn->ndFLink)) { in hfs_bsucc()
Dbtree.c208 while ((next = tmp->ndFLink)) { in hfs_btree_init()