Lines Matching refs:value
21 * than just using a btree since we don't store 1 key per value.
92 * Returns a pointer to a value within an array block.
107 * Utility function that calls one of the value_type methods on every value
120 * Increment every value in an array block.
131 * Decrement every value in an array block.
171 * Pad an array block out with a particular value. Every instance will
176 const void *value, unsigned new_nr)
188 vt->inc(vt->context, value);
189 memcpy(element_at(info, ab, i), value, vt->size);
195 * Remove some entries from the back of an array block. Every value
313 * when overwriting the old value.
354 const void *value, dm_block_t *root)
364 fill_ablock(info, ab, value, nr);
373 unsigned max_entries, const void *value,
379 r = insert_new_ablock(info, size_of_block, max_entries, begin_block, max_entries, value, root);
425 * The default value used when growing the array.
427 const void *value;
435 * end_index - the one-past-the-end value. ie. this block is not removed.
516 fill_ablock(resize->info, ab, resize->value, new_nr_entries);
528 resize->value, &resize->root);
547 resize->max_entries, resize->value,
576 static void block_inc(void *context, const void *value)
581 memcpy(&block_le, value, sizeof(block_le));
585 static void block_dec(void *context, const void *value)
595 memcpy(&block_le, value, sizeof(block_le));
657 const void *value, dm_block_t *new_root)
677 resize.value = value;
689 const void *value, dm_block_t *new_root)
690 __dm_written_to_disk(value)
692 int r = array_resize(info, root, old_size, new_size, value, new_root);
693 __dm_unbless_for_disk(value);
797 uint32_t index, const void *value, dm_block_t *new_root)
824 (!vt->equal || !vt->equal(vt->context, old_value, value))) {
827 vt->inc(vt->context, value);
830 memcpy(old_value, value, info->value_type.size);
838 uint32_t index, const void *value, dm_block_t *new_root)
839 __dm_written_to_disk(value)
843 r = array_set_value(info, root, index, value, new_root);
844 __dm_unbless_for_disk(value);