82 			vt->inc(vt->context, value_ptr(n, i));  in inc_children()
328 							     value_ptr(f->n, i));  in dm_btree_del()
372 		memcpy(v, value_ptr(ro_node(s), i), value_size);  in btree_lookup_raw()
466 		memcpy(value_le, value_ptr(n, i), info->value_type.size);  in dm_btree_lookup_next_single()
567 	memcpy(value_ptr(rn, 0), value_ptr(ln, nr_left),  in btree_split_sibling()
578 	memcpy_disk(value_ptr(pn, parent_index),  in btree_split_sibling()
651 	memcpy(value_ptr(ln, 0), value_ptr(pn, 0), nr_left * size);  in btree_split_beneath()
668 	memcpy(value_ptr(rn, 0), value_ptr(pn, nr_left),  in btree_split_beneath()
683 	memcpy_disk(value_ptr(pn, 0), &val, sizeof(__le64));  in btree_split_beneath()
688 	memcpy_disk(value_ptr(pn, 1), &val, sizeof(__le64));  in btree_split_beneath()
718 			memcpy_disk(value_ptr(dm_block_data(shadow_parent(s)), i),  in btree_insert_raw()
831 			     value_ptr(n, index),  in insert()
834 					     value_ptr(n, index));  in insert()
836 		memcpy_disk(value_ptr(n, index),  in insert()
976 			r = fn(context, &keys, value_ptr(n, i));  in walk_node()
1010 		memcpy(&value_le, value_ptr(bn, i), sizeof(value_le));  in prefetch_values()
1088 		memcpy(&value_le, value_ptr(bn, n->index), sizeof(value_le));  in find_leaf()
1161 		memcpy(value_le, value_ptr(bn, n->index), c->info->value_type.size);  in dm_btree_cursor_get_value()