Searched defs:value_size (Results 1 - 4 of 4) sorted by relevance

/drivers/md/persistent-data/
H A Ddm-btree-internal.h35 __le32 value_size; member in struct:node_header
113 uint32_t value_size = le32_to_cpu(n->header.value_size); local
114 return value_base(n) + (value_size * index);
H A Ddm-btree-spine.c43 size_t value_size; local
62 value_size = le32_to_cpu(h->value_size);
65 (sizeof(__le64) + value_size) * le32_to_cpu(h->max_entries) > block_size) {
H A Ddm-btree-remove.c59 uint32_t value_size = le32_to_cpu(n->header.value_size); local
70 (nr_entries - shift) * value_size);
78 nr_entries * value_size); local
85 uint32_t value_size = le32_to_cpu(left->header.value_size); local
86 BUG_ON(value_size != le32_to_cpu(right->header.value_size));
96 shift * value_size); local
104 shift * value_size); local
115 uint32_t value_size = le32_to_cpu(n->header.value_size); local
125 nr_to_copy * value_size); local
[all...]
H A Ddm-btree.c80 static int insert_at(size_t value_size, struct node *node, unsigned index,
97 array_insert(value_base(node), value_size, nr_entries, index, value); local
109 static uint32_t calc_max_entries(size_t value_size, size_t block_size) argument
112 size_t elt_size = sizeof(uint64_t) + value_size; /* key + value */
141 n->header.value_size = cpu_to_le32(info->value_type.size);
299 uint64_t *result_key, void *v, size_t value_size)
322 memcpy(v, value_ptr(ro_node(s), i), value_size);
429 rn->header.value_size = ln->header.value_size;
519 ln->header.value_size
297 btree_lookup_raw(struct ro_spine *s, dm_block_t block, uint64_t key, int (*search_fn)(struct node *, uint64_t), uint64_t *result_key, void *v, size_t value_size) argument
[all...]

Completed in 63 milliseconds