Home
last modified time | relevance | path

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

/linux-6.3-rc2/kernel/bpf/
A Dbloom_filter.c35 if (bloom->aligned_u32_count) in hash()
37 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
70 set_bit(h, bloom->bitset); in bloom_map_push_elem()
95 struct bpf_bloom_filter *bloom; in bloom_map_alloc() local
145 bloom = bpf_map_area_alloc(sizeof(*bloom) + bitset_bytes, numa_node); in bloom_map_alloc()
147 if (!bloom) in bloom_map_alloc()
157 bloom->aligned_u32_count = in bloom_map_alloc()
163 return &bloom->map; in bloom_map_alloc()
[all …]
/linux-6.3-rc2/Documentation/bpf/
A Dmap_bloom_filter.rst11 ``BPF_MAP_TYPE_BLOOM_FILTER`` provides a BPF bloom filter map. Bloom
13 quickly test whether an element exists in a set. In a bloom filter,
16 The bloom filter map does not have keys, only values. When the bloom
18 bloom filter map supports two operations:
24 bloom filter map and ``bpf_map_peek_elem`` to query the map. These
34 into the bloom filter than ``max_entries``, this may lead to a higher
43 It is not possible to delete elements from a bloom filter map. A bloom
61 A ``value`` can be added to a bloom filter using the
63 ``BPF_ANY`` when adding an entry to the bloom filter. This helper
112 This snippet shows how to declare a bloom filter in a BPF program:
[all …]
A Dmaps.rst8 hash, array, bloom filter and radix-tree. Several of the map types exist to

Completed in 8 milliseconds