143 	n = dm_block_data(b);  in dm_btree_empty()
241 		f->n = dm_block_data(f->b);  in push_frame()
434 	n = dm_block_data(node);  in dm_btree_lookup_next_single()
551 	ln = dm_block_data(left);  in btree_split_sibling()
552 	rn = dm_block_data(right);  in btree_split_sibling()
575 	pn = dm_block_data(parent);  in btree_split_sibling()
634 	pn = dm_block_data(new_parent);  in btree_split_beneath()
643 	ln = dm_block_data(left);  in btree_split_beneath()
660 	rn = dm_block_data(right);  in btree_split_beneath()
707 		node = dm_block_data(shadow_current(s));  in btree_insert_raw()
718 			memcpy_disk(value_ptr(dm_block_data(shadow_parent(s)), i),  in btree_insert_raw()
722 		node = dm_block_data(shadow_current(s));  in btree_insert_raw()
734 		node = dm_block_data(shadow_current(s));  in btree_insert_raw()
785 		n = dm_block_data(shadow_current(&spine));  in insert()
813 	n = dm_block_data(shadow_current(&spine));  in insert()
966 	n = dm_block_data(node);  in walk_node()
1003 	struct btree_node *bn = dm_block_data(n->b);  in prefetch_values()
1018 	struct btree_node *bn = dm_block_data(n->b);  in leaf_node()
1062 		bn = dm_block_data(n->b);  in inc_or_backtrack()
1083 		bn = dm_block_data(n->b);  in find_leaf()
1155 		struct btree_node *bn = dm_block_data(n->b);  in dm_btree_cursor_get_value()