Lines Matching refs:bnode
20 fd->bnode = NULL; in hfs_find_init()
35 hfs_bnode_put(fd->bnode); in hfs_find_exit()
43 int hfs_find_1st_rec_by_cnid(struct hfs_bnode *bnode, in hfs_find_1st_rec_by_cnid() argument
52 if (bnode->tree->cnid == HFSPLUS_EXT_CNID) { in hfs_find_1st_rec_by_cnid()
55 } else if (bnode->tree->cnid == HFSPLUS_CAT_CNID) { in hfs_find_1st_rec_by_cnid()
58 } else if (bnode->tree->cnid == HFSPLUS_ATTR_CNID) { in hfs_find_1st_rec_by_cnid()
81 int hfs_find_rec_by_key(struct hfs_bnode *bnode, in hfs_find_rec_by_key() argument
89 cmpval = bnode->tree->keycmp(fd->key, fd->search_key); in hfs_find_rec_by_key()
103 int __hfs_brec_find(struct hfs_bnode *bnode, struct hfs_find_data *fd, in __hfs_brec_find() argument
113 e = bnode->num_recs - 1; in __hfs_brec_find()
117 len = hfs_brec_lenoff(bnode, rec, &off); in __hfs_brec_find()
118 keylen = hfs_brec_keylen(bnode, rec); in __hfs_brec_find()
123 hfs_bnode_read(bnode, fd->key, off, keylen); in __hfs_brec_find()
124 if (rec_found(bnode, fd, &b, &e, &rec)) { in __hfs_brec_find()
131 len = hfs_brec_lenoff(bnode, e, &off); in __hfs_brec_find()
132 keylen = hfs_brec_keylen(bnode, e); in __hfs_brec_find()
137 hfs_bnode_read(bnode, fd->key, off, keylen); in __hfs_brec_find()
156 struct hfs_bnode *bnode; in hfs_brec_find() local
162 if (fd->bnode) in hfs_brec_find()
163 hfs_bnode_put(fd->bnode); in hfs_brec_find()
164 fd->bnode = NULL; in hfs_brec_find()
172 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
173 if (IS_ERR(bnode)) { in hfs_brec_find()
174 res = PTR_ERR(bnode); in hfs_brec_find()
175 bnode = NULL; in hfs_brec_find()
178 if (bnode->height != height) in hfs_brec_find()
180 if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF)) in hfs_brec_find()
182 bnode->parent = parent; in hfs_brec_find()
184 res = __hfs_brec_find(bnode, fd, do_key_compare); in hfs_brec_find()
191 hfs_bnode_read(bnode, &data, fd->entryoffset, 4); in hfs_brec_find()
193 hfs_bnode_put(bnode); in hfs_brec_find()
195 fd->bnode = bnode; in hfs_brec_find()
200 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
203 hfs_bnode_put(bnode); in hfs_brec_find()
216 hfs_bnode_read(fd->bnode, rec, fd->entryoffset, fd->entrylength); in hfs_brec_read()
223 struct hfs_bnode *bnode; in hfs_brec_goto() local
227 bnode = fd->bnode; in hfs_brec_goto()
228 tree = bnode->tree; in hfs_brec_goto()
234 fd->record = bnode->num_recs - 1; in hfs_brec_goto()
235 idx = bnode->prev; in hfs_brec_goto()
240 hfs_bnode_put(bnode); in hfs_brec_goto()
241 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
242 if (IS_ERR(bnode)) { in hfs_brec_goto()
243 res = PTR_ERR(bnode); in hfs_brec_goto()
244 bnode = NULL; in hfs_brec_goto()
250 while (cnt >= bnode->num_recs - fd->record) { in hfs_brec_goto()
251 cnt -= bnode->num_recs - fd->record; in hfs_brec_goto()
253 idx = bnode->next; in hfs_brec_goto()
258 hfs_bnode_put(bnode); in hfs_brec_goto()
259 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
260 if (IS_ERR(bnode)) { in hfs_brec_goto()
261 res = PTR_ERR(bnode); in hfs_brec_goto()
262 bnode = NULL; in hfs_brec_goto()
269 len = hfs_brec_lenoff(bnode, fd->record, &off); in hfs_brec_goto()
270 keylen = hfs_brec_keylen(bnode, fd->record); in hfs_brec_goto()
279 hfs_bnode_read(bnode, fd->key, off, keylen); in hfs_brec_goto()
281 fd->bnode = bnode; in hfs_brec_goto()