15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd)  in hfs_find_init()  argument
19 	fd->tree = tree;  in hfs_find_init()
20 	fd->bnode = NULL;  in hfs_find_init()
24 	fd->search_key = ptr;  in hfs_find_init()
25 	fd->key = ptr + tree->max_key_len + 2;  in hfs_find_init()
44 void hfs_find_exit(struct hfs_find_data *fd)  in hfs_find_exit()  argument
46 	hfs_bnode_put(fd->bnode);  in hfs_find_exit()
47 	kfree(fd->search_key);  in hfs_find_exit()
49 		fd->tree->cnid, __builtin_return_address(0));  in hfs_find_exit()
50 	mutex_unlock(&fd->tree->tree_lock);  in hfs_find_exit()
51 	fd->tree = NULL;  in hfs_find_exit()
55 				struct hfs_find_data *fd,  in hfs_find_1st_rec_by_cnid()  argument
64 		cur_cnid = fd->key->ext.cnid;  in hfs_find_1st_rec_by_cnid()
65 		search_cnid = fd->search_key->ext.cnid;  in hfs_find_1st_rec_by_cnid()
67 		cur_cnid = fd->key->cat.parent;  in hfs_find_1st_rec_by_cnid()
68 		search_cnid = fd->search_key->cat.parent;  in hfs_find_1st_rec_by_cnid()
70 		cur_cnid = fd->key->attr.cnid;  in hfs_find_1st_rec_by_cnid()
71 		search_cnid = fd->search_key->attr.cnid;  in hfs_find_1st_rec_by_cnid()
93 				struct hfs_find_data *fd,  in hfs_find_rec_by_key()  argument
100 	cmpval = bnode->tree->keycmp(fd->key, fd->search_key);  in hfs_find_rec_by_key()
114 int __hfs_brec_find(struct hfs_bnode *bnode, struct hfs_find_data *fd,  in __hfs_brec_find()  argument
134 		hfs_bnode_read(bnode, fd->key, off, keylen);  in __hfs_brec_find()
135 		if (rec_found(bnode, fd, &b, &e, &rec)) {  in __hfs_brec_find()
148 		hfs_bnode_read(bnode, fd->key, off, keylen);  in __hfs_brec_find()
152 	fd->record = e;  in __hfs_brec_find()
153 	fd->keyoffset = off;  in __hfs_brec_find()
154 	fd->keylength = keylen;  in __hfs_brec_find()
155 	fd->entryoffset = off + keylen;  in __hfs_brec_find()
156 	fd->entrylength = len - keylen;  in __hfs_brec_find()
164 int hfs_brec_find(struct hfs_find_data *fd, search_strategy_t do_key_compare)  in hfs_brec_find()  argument
172 	tree = fd->tree;  in hfs_brec_find()
173 	if (fd->bnode)  in hfs_brec_find()
174 		hfs_bnode_put(fd->bnode);  in hfs_brec_find()
175 	fd->bnode = NULL;  in hfs_brec_find()
195 		res = __hfs_brec_find(bnode, fd, do_key_compare);  in hfs_brec_find()
198 		if (fd->record < 0)  in hfs_brec_find()
202 		hfs_bnode_read(bnode, &data, fd->entryoffset, 4);  in hfs_brec_find()
206 	fd->bnode = bnode;  in hfs_brec_find()
218 int hfs_brec_read(struct hfs_find_data *fd, void *rec, int rec_len)  in hfs_brec_read()  argument
222 	res = hfs_brec_find(fd, hfs_find_rec_by_key);  in hfs_brec_read()
225 	if (fd->entrylength > rec_len)  in hfs_brec_read()
227 	hfs_bnode_read(fd->bnode, rec, fd->entryoffset, fd->entrylength);  in hfs_brec_read()
231 int hfs_brec_goto(struct hfs_find_data *fd, int cnt)  in hfs_brec_goto()  argument
238 	bnode = fd->bnode;  in hfs_brec_goto()
243 		while (cnt > fd->record) {  in hfs_brec_goto()
244 			cnt -= fd->record + 1;  in hfs_brec_goto()
245 			fd->record = bnode->num_recs - 1;  in hfs_brec_goto()
259 		fd->record -= cnt;  in hfs_brec_goto()
261 		while (cnt >= bnode->num_recs - fd->record) {  in hfs_brec_goto()
262 			cnt -= bnode->num_recs - fd->record;  in hfs_brec_goto()
263 			fd->record = 0;  in hfs_brec_goto()
277 		fd->record += cnt;  in hfs_brec_goto()
280 	len = hfs_brec_lenoff(bnode, fd->record, &off);  in hfs_brec_goto()
281 	keylen = hfs_brec_keylen(bnode, fd->record);  in hfs_brec_goto()
286 	fd->keyoffset = off;  in hfs_brec_goto()
287 	fd->keylength = keylen;  in hfs_brec_goto()
288 	fd->entryoffset = off + keylen;  in hfs_brec_goto()
289 	fd->entrylength = len - keylen;  in hfs_brec_goto()
290 	hfs_bnode_read(bnode, fd->key, off, keylen);  in hfs_brec_goto()
292 	fd->bnode = bnode;  in hfs_brec_goto()