Home
last modified time | relevance | path

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

/linux/kernel/bpf/
A Dbloom_filter.c34 if (bloom->aligned_u32_count) in hash()
36 bloom->hash_seed + index); in hash()
40 return h & bloom->bitset_mask; in hash()
45 struct bpf_bloom_filter *bloom = in bloom_map_peek_elem() local
69 set_bit(h, bloom->bitset); in bloom_map_push_elem()
89 struct bpf_bloom_filter *bloom; in bloom_map_alloc() local
139 bloom = bpf_map_area_alloc(sizeof(*bloom) + bitset_bytes, numa_node); in bloom_map_alloc()
141 if (!bloom) in bloom_map_alloc()
151 bloom->aligned_u32_count = in bloom_map_alloc()
157 return &bloom->map; in bloom_map_alloc()
[all …]
/linux/Documentation/networking/
A Dfilter.rst1437 maps can have different types: hash, array, bloom filter, radix-tree, etc.

Completed in 5 milliseconds