Home
last modified time | relevance | path

Searched refs:key_ptr (Results 1 – 6 of 6) sorted by relevance

/linux/drivers/md/persistent-data/
H A Ddm-btree-remove.c68 BUG_ON((void *) key_ptr(n, shift) >= value_ptr(n, shift)); in node_shift()
69 memmove(key_ptr(n, 0), in node_shift()
70 key_ptr(n, shift), in node_shift()
77 memmove(key_ptr(n, shift), in node_shift()
78 key_ptr(n, 0), in node_shift()
104 memcpy(key_ptr(left, nr_left), in node_copy()
105 key_ptr(right, 0), in node_copy()
116 memcpy(key_ptr(right, 0), in node_copy()
117 key_ptr(left, nr_left - shift), in node_copy()
138 memmove(key_ptr(n, index), in delete_at()
[all …]
H A Ddm-btree-internal.h109 static inline __le64 *key_ptr(struct btree_node *n, uint32_t index) in key_ptr() function
H A Ddm-btree.c929 *key_ptr(parent, parent_index) = right->keys[0]; in rebalance_left()
958 *key_ptr(parent, parent_index + 1) = right->keys[0]; in rebalance_right()
1444 keys = le64_to_cpu(*key_ptr(n, i)); in walk_node()
1630 *key = le64_to_cpu(*key_ptr(bn, n->index)); in dm_btree_cursor_get_value()
/linux/drivers/md/dm-vdo/indexer/
H A Dradix-sort.c124 sort_key_t *key_ptr; in measure_bins() local
134 for (key_ptr = task.first_key; key_ptr <= task.last_key; key_ptr++) { in measure_bins()
136 u8 bin = (*key_ptr)[task.offset]; in measure_bins()
/linux/drivers/misc/altera-stapl/
H A Daltera.c2110 char *key_ptr; in altera_get_note() local
2138 key_ptr = &p[note_strings + in altera_get_note()
2141 if (key && !strncasecmp(key, key_ptr, strlen(key_ptr))) { in altera_get_note()
/linux/tools/testing/selftests/bpf/
H A Dtest_maps.c336 void *key_ptr = !i ? NULL : &key; in test_hashmap_zero_seed() local
338 if (bpf_map_get_next_key(first, key_ptr, &next_first) != 0) in test_hashmap_zero_seed()
341 CHECK(bpf_map_get_next_key(second, key_ptr, &next_second) != 0, in test_hashmap_zero_seed()
343 "key_ptr: %p", key_ptr); in test_hashmap_zero_seed()