Home
last modified time | relevance | path

Searched refs:bloom (Results 1 – 2 of 2) sorted by relevance

/Linux-v6.1/kernel/bpf/
Dbloom_filter.c30 static u32 hash(struct bpf_bloom_filter *bloom, void *value, in hash() argument
35 if (bloom->aligned_u32_count) in hash()
36 h = jhash2(value, bloom->aligned_u32_count, in hash()
37 bloom->hash_seed + index); in hash()
39 h = jhash(value, value_size, bloom->hash_seed + index); in hash()
41 return h & bloom->bitset_mask; in hash()
46 struct bpf_bloom_filter *bloom = in bloom_map_peek_elem() local
50 for (i = 0; i < bloom->nr_hash_funcs; i++) { in bloom_map_peek_elem()
51 h = hash(bloom, value, map->value_size, i); in bloom_map_peek_elem()
52 if (!test_bit(h, bloom->bitset)) in bloom_map_peek_elem()
[all …]
/Linux-v6.1/Documentation/bpf/
Dmaps.rst36 maps can have different types: hash, array, bloom filter, radix-tree, etc.