Home
last modified time | relevance | path

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

/linux-6.14.4/kernel/bpf/
Dbloom_filter.c23 static u32 hash(struct bpf_bloom_filter *bloom, void *value, in hash() argument
29 h = jhash2(value, value_size / 4, bloom->hash_seed + index); in hash()
31 h = jhash(value, value_size, bloom->hash_seed + index); in hash()
33 return h & bloom->bitset_mask; in hash()
38 struct bpf_bloom_filter *bloom = in bloom_map_peek_elem() local
42 for (i = 0; i < bloom->nr_hash_funcs; i++) { in bloom_map_peek_elem()
43 h = hash(bloom, value, map->value_size, i); in bloom_map_peek_elem()
44 if (!test_bit(h, bloom->bitset)) in bloom_map_peek_elem()
53 struct bpf_bloom_filter *bloom = in bloom_map_push_elem() local
60 for (i = 0; i < bloom->nr_hash_funcs; i++) { in bloom_map_push_elem()
[all …]
/linux-6.14.4/Documentation/bpf/
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
32 to approximate a reasonable bitmap size for the bloom filter, and is not
34 into the bloom filter than ``max_entries``, this may lead to a higher
37 The number of hashes to use for the bloom filter is configurable using
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
[all …]
Dmaps.rst8 hash, array, bloom filter and radix-tree. Several of the map types exist to
/linux-6.14.4/Documentation/filesystems/
Derofs.rst61 - Support a bloom filter that speeds up negative extended attribute lookups;