Lines Matching defs:bnode

23 	fd->bnode = NULL;
49 	hfs_bnode_put(fd->bnode);
57 /* Find the record in bnode that best matches key (not greater than...)*/
58 int __hfs_brec_find(struct hfs_bnode *bnode, struct hfs_find_data *fd)
67 	e = bnode->num_recs - 1;
71 		len = hfs_brec_lenoff(bnode, rec, &off);
72 		keylen = hfs_brec_keylen(bnode, rec);
77 		hfs_bnode_read(bnode, fd->key, off, keylen);
78 		cmpval = bnode->tree->keycmp(fd->key, fd->search_key);
90 		len = hfs_brec_lenoff(bnode, e, &off);
91 		keylen = hfs_brec_keylen(bnode, e);
96 		hfs_bnode_read(bnode, fd->key, off, keylen);
113 	struct hfs_bnode *bnode;
125 	if (fd->bnode)
126 		hfs_bnode_put(fd->bnode);
127 	fd->bnode = NULL;
135 		bnode = hfs_bnode_find(tree, nidx);
136 		if (IS_ERR(bnode)) {
137 			res = PTR_ERR(bnode);
138 			bnode = NULL;
141 		if (bnode->height != height)
143 		if (bnode->type != (--height ? HFS_NODE_INDEX : HFS_NODE_LEAF))
145 		bnode->parent = parent;
147 		res = __hfs_brec_find(bnode, fd);
154 		hfs_bnode_read(bnode, &data, fd->entryoffset, 4);
156 		hfs_bnode_put(bnode);
158 	fd->bnode = bnode;
163 	       height, bnode->height, bnode->type, nidx, parent);
166 	hfs_bnode_put(bnode);
179 	hfs_bnode_read(fd->bnode, rec, fd->entryoffset, fd->entrylength);
186 	struct hfs_bnode *bnode;
190 	bnode = fd->bnode;
191 	tree = bnode->tree;
197 			fd->record = bnode->num_recs - 1;
198 			idx = bnode->prev;
203 			hfs_bnode_put(bnode);
204 			bnode = hfs_bnode_find(tree, idx);
205 			if (IS_ERR(bnode)) {
206 				res = PTR_ERR(bnode);
207 				bnode = NULL;
213 		while (cnt >= bnode->num_recs - fd->record) {
214 			cnt -= bnode->num_recs - fd->record;
216 			idx = bnode->next;
221 			hfs_bnode_put(bnode);
222 			bnode = hfs_bnode_find(tree, idx);
223 			if (IS_ERR(bnode)) {
224 				res = PTR_ERR(bnode);
225 				bnode = NULL;
232 	len = hfs_brec_lenoff(bnode, fd->record, &off);
233 	keylen = hfs_brec_keylen(bnode, fd->record);
242 	hfs_bnode_read(bnode, fd->key, off, keylen);
244 	fd->bnode = bnode;