Lines Matching refs:bnode
23 fd->bnode = NULL; in hfs_find_init()
49 hfs_bnode_put(fd->bnode); in hfs_find_exit()
58 int __hfs_brec_find(struct hfs_bnode *bnode, struct hfs_find_data *fd) in __hfs_brec_find() argument
67 e = bnode->num_recs - 1; in __hfs_brec_find()
71 len = hfs_brec_lenoff(bnode, rec, &off); in __hfs_brec_find()
72 keylen = hfs_brec_keylen(bnode, rec); in __hfs_brec_find()
77 hfs_bnode_read(bnode, fd->key, off, keylen); in __hfs_brec_find()
78 cmpval = bnode->tree->keycmp(fd->key, fd->search_key); in __hfs_brec_find()
90 len = hfs_brec_lenoff(bnode, e, &off); in __hfs_brec_find()
91 keylen = hfs_brec_keylen(bnode, e); in __hfs_brec_find()
96 hfs_bnode_read(bnode, fd->key, off, keylen); in __hfs_brec_find()
113 struct hfs_bnode *bnode; in hfs_brec_find() local
119 if (fd->bnode) in hfs_brec_find()
120 hfs_bnode_put(fd->bnode); in hfs_brec_find()
121 fd->bnode = NULL; in hfs_brec_find()
129 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
130 if (IS_ERR(bnode)) { in hfs_brec_find()
131 res = PTR_ERR(bnode); in hfs_brec_find()
132 bnode = NULL; in hfs_brec_find()
135 if (bnode->height != height) in hfs_brec_find()
137 if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF)) in hfs_brec_find()
139 bnode->parent = parent; in hfs_brec_find()
141 res = __hfs_brec_find(bnode, fd); in hfs_brec_find()
148 hfs_bnode_read(bnode, &data, fd->entryoffset, 4); in hfs_brec_find()
150 hfs_bnode_put(bnode); in hfs_brec_find()
152 fd->bnode = bnode; in hfs_brec_find()
157 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
160 hfs_bnode_put(bnode); in hfs_brec_find()
173 hfs_bnode_read(fd->bnode, rec, fd->entryoffset, fd->entrylength); in hfs_brec_read()
180 struct hfs_bnode *bnode; in hfs_brec_goto() local
184 bnode = fd->bnode; in hfs_brec_goto()
185 tree = bnode->tree; in hfs_brec_goto()
191 fd->record = bnode->num_recs - 1; in hfs_brec_goto()
192 idx = bnode->prev; in hfs_brec_goto()
197 hfs_bnode_put(bnode); in hfs_brec_goto()
198 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
199 if (IS_ERR(bnode)) { in hfs_brec_goto()
200 res = PTR_ERR(bnode); in hfs_brec_goto()
201 bnode = NULL; in hfs_brec_goto()
207 while (cnt >= bnode->num_recs - fd->record) { in hfs_brec_goto()
208 cnt -= bnode->num_recs - fd->record; in hfs_brec_goto()
210 idx = bnode->next; in hfs_brec_goto()
215 hfs_bnode_put(bnode); in hfs_brec_goto()
216 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
217 if (IS_ERR(bnode)) { in hfs_brec_goto()
218 res = PTR_ERR(bnode); in hfs_brec_goto()
219 bnode = NULL; in hfs_brec_goto()
226 len = hfs_brec_lenoff(bnode, fd->record, &off); in hfs_brec_goto()
227 keylen = hfs_brec_keylen(bnode, fd->record); in hfs_brec_goto()
236 hfs_bnode_read(bnode, fd->key, off, keylen); in hfs_brec_goto()
238 fd->bnode = bnode; in hfs_brec_goto()