82 	befs_host_btree_nodehead head;	/* head of node converted to cpu byteorder */  member
214 	node->head.left = fs64_to_cpu(sb, node->od_node->left);  in befs_bt_read_node()
215 	node->head.right = fs64_to_cpu(sb, node->od_node->right);  in befs_bt_read_node()
216 	node->head.overflow = fs64_to_cpu(sb, node->od_node->overflow);  in befs_bt_read_node()
217 	node->head.all_key_count =  in befs_bt_read_node()
219 	node->head.all_key_length =  in befs_bt_read_node()
283 			node_off = this_node->head.overflow;  in befs_btree_find()
345 	last = node->head.all_key_count - 1;  in befs_find_key()
459 	while (key_sum + this_node->head.all_key_count <= key_no) {  in befs_btree_read()
462 		if (this_node->head.right == BEFS_BT_INVAL) {  in befs_btree_read()
468 				   key_sum + this_node->head.all_key_count);  in befs_btree_read()
474 		key_sum += this_node->head.all_key_count;  in befs_btree_read()
475 		node_off = this_node->head.right;  in befs_btree_read()
557 	if (this_node->head.all_key_count == 0 && befs_leafnode(this_node)) {  in befs_btree_seekleaf()
564 		if (this_node->head.all_key_count == 0) {  in befs_btree_seekleaf()
568 				   this_node->head.overflow);  in befs_btree_seekleaf()
569 			*node_off = this_node->head.overflow;  in befs_btree_seekleaf()
602 	if (node->head.overflow == BEFS_BT_INVAL)  in befs_leafnode()
626 	    (sizeof (befs_btree_nodehead) + node->head.all_key_length);  in befs_bt_keylen_index()
646 	size_t keylen_index_size = node->head.all_key_count * sizeof (fs16);  in befs_bt_valarray()
682 	if (index < 0 || index > node->head.all_key_count) {  in befs_bt_get_key()