1472 	struct btree_node *bn = dm_block_data(n->b);  in prefetch_values()  local
1477 	nr = le32_to_cpu(bn->header.nr_entries);  in prefetch_values()
1479 		memcpy(&value_le, value_ptr(bn, i), sizeof(value_le));  in prefetch_values()
1487 	struct btree_node *bn = dm_block_data(n->b);  in leaf_node()  local
1489 	return le32_to_cpu(bn->header.flags) & LEAF_NODE;  in leaf_node()
1524 	struct btree_node *bn;  in inc_or_backtrack()  local
1531 		bn = dm_block_data(n->b);  in inc_or_backtrack()
1534 		if (n->index < le32_to_cpu(bn->header.nr_entries))  in inc_or_backtrack()
1547 	struct btree_node *bn;  in find_leaf()  local
1552 		bn = dm_block_data(n->b);  in find_leaf()
1554 		if (le32_to_cpu(bn->header.flags) & LEAF_NODE)  in find_leaf()
1557 		memcpy(&value_le, value_ptr(bn, n->index), sizeof(value_le));  in find_leaf()
1565 	if (!r && (le32_to_cpu(bn->header.nr_entries) == 0))  in find_leaf()
1625 		struct btree_node *bn = dm_block_data(n->b);  in dm_btree_cursor_get_value()  local
1627 		if (le32_to_cpu(bn->header.flags) & INTERNAL_NODE)  in dm_btree_cursor_get_value()
1630 		*key = le64_to_cpu(*key_ptr(bn, n->index));  in dm_btree_cursor_get_value()
1631 		memcpy(value_le, value_ptr(bn, n->index), c->info->value_type.size);  in dm_btree_cursor_get_value()