93 			       struct befs_btree_node *this_node,
253 	struct befs_btree_node *this_node = NULL;  in befs_btree_find()  local
266 	this_node = kmalloc(sizeof(struct befs_btree_node),  in befs_btree_find()
268 	if (!this_node) {  in befs_btree_find()
274 	this_node->bh = NULL;  in befs_btree_find()
278 	if (befs_bt_read_node(sb, ds, this_node, node_off) != BEFS_OK) {  in befs_btree_find()
284 	while (!befs_leafnode(this_node)) {  in befs_btree_find()
285 		res = befs_find_key(sb, this_node, key, &node_off);  in befs_btree_find()
287 			node_off = this_node->head.overflow;  in befs_btree_find()
289 		if (befs_bt_read_node(sb, ds, this_node, node_off) != BEFS_OK) {  in befs_btree_find()
298 	res = befs_find_key(sb, this_node, key, value);  in befs_btree_find()
300 	brelse(this_node->bh);  in befs_btree_find()
301 	kfree(this_node);  in befs_btree_find()
313 	kfree(this_node);  in befs_btree_find()
423 	struct befs_btree_node *this_node;  in befs_btree_read()  local
442 	this_node = kmalloc(sizeof(struct befs_btree_node), GFP_NOFS);  in befs_btree_read()
443 	if (this_node == NULL) {  in befs_btree_read()
450 	this_node->bh = NULL;  in befs_btree_read()
453 	res = befs_btree_seekleaf(sb, ds, &bt_super, this_node, &node_off);  in befs_btree_read()
455 		brelse(this_node->bh);  in befs_btree_read()
456 		kfree(this_node);  in befs_btree_read()
467 	while (key_sum + this_node->head.all_key_count <= key_no) {  in befs_btree_read()
470 		if (this_node->head.right == befs_bt_inval) {  in befs_btree_read()
476 				   key_sum + this_node->head.all_key_count);  in befs_btree_read()
477 			brelse(this_node->bh);  in befs_btree_read()
478 			kfree(this_node);  in befs_btree_read()
482 		key_sum += this_node->head.all_key_count;  in befs_btree_read()
483 		node_off = this_node->head.right;  in befs_btree_read()
485 		if (befs_bt_read_node(sb, ds, this_node, node_off) != BEFS_OK) {  in befs_btree_read()
496 	valarray = befs_bt_valarray(this_node);  in befs_btree_read()
498 	keystart = befs_bt_get_key(sb, this_node, cur_key, &keylen);  in befs_btree_read()
507 		brelse(this_node->bh);  in befs_btree_read()
518 	brelse(this_node->bh);  in befs_btree_read()
519 	kfree(this_node);  in befs_btree_read()
526 	kfree(this_node);  in befs_btree_read()
553 		    struct befs_btree_node *this_node,  in befs_btree_seekleaf()  argument
559 	if (befs_bt_read_node(sb, ds, this_node, *node_off) != BEFS_OK) {  in befs_btree_seekleaf()
566 	if (this_node->head.all_key_count == 0 && befs_leafnode(this_node)) {  in befs_btree_seekleaf()
571 	while (!befs_leafnode(this_node)) {  in befs_btree_seekleaf()
573 		if (this_node->head.all_key_count == 0) {  in befs_btree_seekleaf()
577 				   this_node->head.overflow);  in befs_btree_seekleaf()
578 			*node_off = this_node->head.overflow;  in befs_btree_seekleaf()
580 			fs64 *valarray = befs_bt_valarray(this_node);  in befs_btree_seekleaf()
583 		if (befs_bt_read_node(sb, ds, this_node, *node_off) != BEFS_OK) {  in befs_btree_seekleaf()