100 			     befs_btree_node * node, befs_off_t node_off);
102 static int befs_leafnode(befs_btree_node * node);
104 static u16 *befs_bt_keylen_index(befs_btree_node * node);
106 static befs_off_t *befs_bt_valarray(befs_btree_node * node);
108 static char *befs_bt_keydata(befs_btree_node * node);
110 static int befs_find_key(struct super_block *sb, befs_btree_node * node,
113 static char *befs_bt_get_key(struct super_block *sb, befs_btree_node * node,
194 		  befs_btree_node * node, befs_off_t node_off)  in befs_bt_read_node()  argument
200 	if (node->bh)  in befs_bt_read_node()
201 		brelse(node->bh);  in befs_bt_read_node()
203 	node->bh = befs_read_datastream(sb, ds, node_off, &off);  in befs_bt_read_node()
204 	if (!node->bh) {  in befs_bt_read_node()
211 	node->od_node =  in befs_bt_read_node()
212 	    (befs_btree_nodehead *) ((void *) node->bh->b_data + off);  in befs_bt_read_node()
214 	befs_dump_index_node(sb, node->od_node);  in befs_bt_read_node()
216 	node->head.left = fs64_to_cpu(sb, node->od_node->left);  in befs_bt_read_node()
217 	node->head.right = fs64_to_cpu(sb, node->od_node->right);  in befs_bt_read_node()
218 	node->head.overflow = fs64_to_cpu(sb, node->od_node->overflow);  in befs_bt_read_node()
219 	node->head.all_key_count =  in befs_bt_read_node()
220 	    fs16_to_cpu(sb, node->od_node->all_key_count);  in befs_bt_read_node()
221 	node->head.all_key_length =  in befs_bt_read_node()
222 	    fs16_to_cpu(sb, node->od_node->all_key_length);  in befs_bt_read_node()
336 befs_find_key(struct super_block *sb, befs_btree_node * node,  in befs_find_key()  argument
353 	last = node->head.all_key_count - 1;  in befs_find_key()
354 	thiskey = befs_bt_get_key(sb, node, last, &keylen);  in befs_find_key()
362 	valarray = befs_bt_valarray(node);  in befs_find_key()
371 		thiskey = befs_bt_get_key(sb, node, mid, &keylen);  in befs_find_key()
600 befs_leafnode(befs_btree_node * node)  in befs_leafnode()  argument
603 	if (node->head.overflow == befs_bt_inval)  in befs_leafnode()
623 befs_bt_keylen_index(befs_btree_node * node)  in befs_bt_keylen_index()  argument
627 	    (sizeof (befs_btree_nodehead) + node->head.all_key_length);  in befs_bt_keylen_index()
633 	return (u16 *) ((void *) node->od_node + off);  in befs_bt_keylen_index()
644 befs_bt_valarray(befs_btree_node * node)  in befs_bt_valarray()  argument
646 	void *keylen_index_start = (void *) befs_bt_keylen_index(node);  in befs_bt_valarray()
647 	size_t keylen_index_size = node->head.all_key_count * sizeof (u16);  in befs_bt_valarray()
660 befs_bt_keydata(befs_btree_node * node)  in befs_bt_keydata()  argument
662 	return (char *) ((void *) node->od_node + sizeof (befs_btree_nodehead));  in befs_bt_keydata()
676 befs_bt_get_key(struct super_block *sb, befs_btree_node * node,  in befs_bt_get_key()  argument
683 	if (index < 0 || index > node->head.all_key_count) {  in befs_bt_get_key()
688 	keystart = befs_bt_keydata(node);  in befs_bt_get_key()
689 	keylen_index = befs_bt_keylen_index(node);  in befs_bt_get_key()