19 	fd->bnode = NULL;  in hfs_find_init()
33 	hfs_bnode_put(fd->bnode);  in hfs_find_exit()
42 int __hfs_brec_find(struct hfs_bnode *bnode, struct hfs_find_data *fd)  in __hfs_brec_find()  argument
51 	e = bnode->num_recs - 1;  in __hfs_brec_find()
55 		len = hfs_brec_lenoff(bnode, rec, &off);  in __hfs_brec_find()
56 		keylen = hfs_brec_keylen(bnode, rec);  in __hfs_brec_find()
61 		hfs_bnode_read(bnode, fd->key, off, keylen);  in __hfs_brec_find()
62 		cmpval = bnode->tree->keycmp(fd->key, fd->search_key);  in __hfs_brec_find()
74 		len = hfs_brec_lenoff(bnode, e, &off);  in __hfs_brec_find()
75 		keylen = hfs_brec_keylen(bnode, e);  in __hfs_brec_find()
80 		hfs_bnode_read(bnode, fd->key, off, keylen);  in __hfs_brec_find()
97 	struct hfs_bnode *bnode;  in hfs_brec_find()  local
103 	if (fd->bnode)  in hfs_brec_find()
104 		hfs_bnode_put(fd->bnode);  in hfs_brec_find()
105 	fd->bnode = NULL;  in hfs_brec_find()
113 		bnode = hfs_bnode_find(tree, nidx);  in hfs_brec_find()
114 		if (IS_ERR(bnode)) {  in hfs_brec_find()
115 			res = PTR_ERR(bnode);  in hfs_brec_find()
116 			bnode = NULL;  in hfs_brec_find()
119 		if (bnode->height != height)  in hfs_brec_find()
121 		if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF))  in hfs_brec_find()
123 		bnode->parent = parent;  in hfs_brec_find()
125 		res = __hfs_brec_find(bnode, fd);  in hfs_brec_find()
132 		hfs_bnode_read(bnode, &data, fd->entryoffset, 4);  in hfs_brec_find()
134 		hfs_bnode_put(bnode);  in hfs_brec_find()
136 	fd->bnode = bnode;  in hfs_brec_find()
141 	       height, bnode->height, bnode->type, nidx, parent);  in hfs_brec_find()
144 	hfs_bnode_put(bnode);  in hfs_brec_find()
157 	hfs_bnode_read(fd->bnode, rec, fd->entryoffset, fd->entrylength);  in hfs_brec_read()
164 	struct hfs_bnode *bnode;  in hfs_brec_goto()  local
168 	bnode = fd->bnode;  in hfs_brec_goto()
169 	tree = bnode->tree;  in hfs_brec_goto()
175 			fd->record = bnode->num_recs - 1;  in hfs_brec_goto()
176 			idx = bnode->prev;  in hfs_brec_goto()
181 			hfs_bnode_put(bnode);  in hfs_brec_goto()
182 			bnode = hfs_bnode_find(tree, idx);  in hfs_brec_goto()
183 			if (IS_ERR(bnode)) {  in hfs_brec_goto()
184 				res = PTR_ERR(bnode);  in hfs_brec_goto()
185 				bnode = NULL;  in hfs_brec_goto()
191 		while (cnt >= bnode->num_recs - fd->record) {  in hfs_brec_goto()
192 			cnt -= bnode->num_recs - fd->record;  in hfs_brec_goto()
194 			idx = bnode->next;  in hfs_brec_goto()
199 			hfs_bnode_put(bnode);  in hfs_brec_goto()
200 			bnode = hfs_bnode_find(tree, idx);  in hfs_brec_goto()
201 			if (IS_ERR(bnode)) {  in hfs_brec_goto()
202 				res = PTR_ERR(bnode);  in hfs_brec_goto()
203 				bnode = NULL;  in hfs_brec_goto()
210 	len = hfs_brec_lenoff(bnode, fd->record, &off);  in hfs_brec_goto()
211 	keylen = hfs_brec_keylen(bnode, fd->record);  in hfs_brec_goto()
220 	hfs_bnode_read(bnode, fd->key, off, keylen);  in hfs_brec_goto()
222 	fd->bnode = bnode;  in hfs_brec_goto()