1003 	struct btree_node *bn = dm_block_data(n->b);  in prefetch_values()  local
1008 	nr = le32_to_cpu(bn->header.nr_entries);  in prefetch_values()
1010 		memcpy(&value_le, value_ptr(bn, i), sizeof(value_le));  in prefetch_values()
1018 	struct btree_node *bn = dm_block_data(n->b);  in leaf_node()  local
1020 	return le32_to_cpu(bn->header.flags) & LEAF_NODE;  in leaf_node()
1055 	struct btree_node *bn;  in inc_or_backtrack()  local
1062 		bn = dm_block_data(n->b);  in inc_or_backtrack()
1065 		if (n->index < le32_to_cpu(bn->header.nr_entries))  in inc_or_backtrack()
1078 	struct btree_node *bn;  in find_leaf()  local
1083 		bn = dm_block_data(n->b);  in find_leaf()
1085 		if (le32_to_cpu(bn->header.flags) & LEAF_NODE)  in find_leaf()
1088 		memcpy(&value_le, value_ptr(bn, n->index), sizeof(value_le));  in find_leaf()
1096 	if (!r && (le32_to_cpu(bn->header.nr_entries) == 0))  in find_leaf()
1155 		struct btree_node *bn = dm_block_data(n->b);  in dm_btree_cursor_get_value()  local
1157 		if (le32_to_cpu(bn->header.flags) & INTERNAL_NODE)  in dm_btree_cursor_get_value()
1160 		*key = le64_to_cpu(*key_ptr(bn, n->index));  in dm_btree_cursor_get_value()
1161 		memcpy(value_le, value_ptr(bn, n->index), c->info->value_type.size);  in dm_btree_cursor_get_value()