Home
last modified time | relevance | path

Searched refs:result_key (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-5.10/samples/bpf/
H A Dtest_map_in_map_user.c75 uint32_t result_key = 0, port_key; in test_map_in_map() local
95 ret = bpf_map_lookup_elem(REG_RESULT_H, &result_key, &result); in test_map_in_map()
98 ret = bpf_map_lookup_elem(INLINE_RESULT_H, &result_key, in test_map_in_map()
108 bpf_map_delete_elem(REG_RESULT_H, &result_key); in test_map_in_map()
109 bpf_map_delete_elem(INLINE_RESULT_H, &result_key); in test_map_in_map()
/kernel/linux/linux-6.6/samples/bpf/
H A Dtest_map_in_map_user.c76 uint32_t result_key = 0, port_key; in test_map_in_map() local
96 ret = bpf_map_lookup_elem(REG_RESULT_H, &result_key, &result); in test_map_in_map()
99 ret = bpf_map_lookup_elem(INLINE_RESULT_H, &result_key, in test_map_in_map()
109 bpf_map_delete_elem(REG_RESULT_H, &result_key); in test_map_in_map()
110 bpf_map_delete_elem(INLINE_RESULT_H, &result_key); in test_map_in_map()
/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A Ddm-btree.c348 uint64_t *result_key, void *v, size_t value_size) in btree_lookup_raw()
370 *result_key = le64_to_cpu(ro_node(s)->keys[i]); in btree_lookup_raw()
872 uint64_t *result_key, dm_block_t *next_block) in find_key()
890 *result_key = le64_to_cpu(ro_node(s)->keys[i]); in find_key()
892 *result_key = le64_to_cpu(ro_node(s)->keys[0]); in find_key()
346 btree_lookup_raw(struct ro_spine *s, dm_block_t block, uint64_t key, int (*search_fn)(struct btree_node *, uint64_t), uint64_t *result_key, void *v, size_t value_size) btree_lookup_raw() argument
871 find_key(struct ro_spine *s, dm_block_t block, bool find_highest, uint64_t *result_key, dm_block_t *next_block) find_key() argument
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A Ddm-btree.c345 uint64_t *result_key, void *v, size_t value_size) in btree_lookup_raw()
367 *result_key = le64_to_cpu(ro_node(s)->keys[i]); in btree_lookup_raw()
1341 uint64_t *result_key, dm_block_t *next_block) in find_key()
1359 *result_key = le64_to_cpu(ro_node(s)->keys[i]); in find_key()
1361 *result_key = le64_to_cpu(ro_node(s)->keys[0]); in find_key()
343 btree_lookup_raw(struct ro_spine *s, dm_block_t block, uint64_t key, int (*search_fn)(struct btree_node *, uint64_t), uint64_t *result_key, void *v, size_t value_size) btree_lookup_raw() argument
1340 find_key(struct ro_spine *s, dm_block_t block, bool find_highest, uint64_t *result_key, dm_block_t *next_block) find_key() argument

Completed in 6 milliseconds