20 	fd->bnode = NULL;  in hfs_find_init()
46 	hfs_bnode_put(fd->bnode);  in hfs_find_exit()
55 int __hfs_brec_find(struct hfs_bnode *bnode, struct hfs_find_data *fd)  in __hfs_brec_find()  argument
64 	e = bnode->num_recs - 1;  in __hfs_brec_find()
68 		len = hfs_brec_lenoff(bnode, rec, &off);  in __hfs_brec_find()
69 		keylen = hfs_brec_keylen(bnode, rec);  in __hfs_brec_find()
74 		hfs_bnode_read(bnode, fd->key, off, keylen);  in __hfs_brec_find()
75 		cmpval = bnode->tree->keycmp(fd->key, fd->search_key);  in __hfs_brec_find()
87 		len = hfs_brec_lenoff(bnode, e, &off);  in __hfs_brec_find()
88 		keylen = hfs_brec_keylen(bnode, e);  in __hfs_brec_find()
93 		hfs_bnode_read(bnode, fd->key, off, keylen);  in __hfs_brec_find()
110 	struct hfs_bnode *bnode;  in hfs_brec_find()  local
116 	if (fd->bnode)  in hfs_brec_find()
117 		hfs_bnode_put(fd->bnode);  in hfs_brec_find()
118 	fd->bnode = NULL;  in hfs_brec_find()
126 		bnode = hfs_bnode_find(tree, nidx);  in hfs_brec_find()
127 		if (IS_ERR(bnode)) {  in hfs_brec_find()
128 			res = PTR_ERR(bnode);  in hfs_brec_find()
129 			bnode = NULL;  in hfs_brec_find()
132 		if (bnode->height != height)  in hfs_brec_find()
134 		if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF))  in hfs_brec_find()
136 		bnode->parent = parent;  in hfs_brec_find()
138 		res = __hfs_brec_find(bnode, fd);  in hfs_brec_find()
145 		hfs_bnode_read(bnode, &data, fd->entryoffset, 4);  in hfs_brec_find()
147 		hfs_bnode_put(bnode);  in hfs_brec_find()
149 	fd->bnode = bnode;  in hfs_brec_find()
154 	       height, bnode->height, bnode->type, nidx, parent);  in hfs_brec_find()
157 	hfs_bnode_put(bnode);  in hfs_brec_find()
170 	hfs_bnode_read(fd->bnode, rec, fd->entryoffset, fd->entrylength);  in hfs_brec_read()
177 	struct hfs_bnode *bnode;  in hfs_brec_goto()  local
181 	bnode = fd->bnode;  in hfs_brec_goto()
182 	tree = bnode->tree;  in hfs_brec_goto()
188 			fd->record = bnode->num_recs - 1;  in hfs_brec_goto()
189 			idx = bnode->prev;  in hfs_brec_goto()
194 			hfs_bnode_put(bnode);  in hfs_brec_goto()
195 			bnode = hfs_bnode_find(tree, idx);  in hfs_brec_goto()
196 			if (IS_ERR(bnode)) {  in hfs_brec_goto()
197 				res = PTR_ERR(bnode);  in hfs_brec_goto()
198 				bnode = NULL;  in hfs_brec_goto()
204 		while (cnt >= bnode->num_recs - fd->record) {  in hfs_brec_goto()
205 			cnt -= bnode->num_recs - fd->record;  in hfs_brec_goto()
207 			idx = bnode->next;  in hfs_brec_goto()
212 			hfs_bnode_put(bnode);  in hfs_brec_goto()
213 			bnode = hfs_bnode_find(tree, idx);  in hfs_brec_goto()
214 			if (IS_ERR(bnode)) {  in hfs_brec_goto()
215 				res = PTR_ERR(bnode);  in hfs_brec_goto()
216 				bnode = NULL;  in hfs_brec_goto()
223 	len = hfs_brec_lenoff(bnode, fd->record, &off);  in hfs_brec_goto()
224 	keylen = hfs_brec_keylen(bnode, fd->record);  in hfs_brec_goto()
233 	hfs_bnode_read(bnode, fd->key, off, keylen);  in hfs_brec_goto()
235 	fd->bnode = bnode;  in hfs_brec_goto()