Searched refs:bloom (Results 1 – 5 of 5) sorted by relevance
33 return h & bloom->bitset_mask; in hash()38 struct bpf_bloom_filter *bloom = in bloom_map_peek_elem() local44 if (!test_bit(h, bloom->bitset)) in bloom_map_peek_elem()53 struct bpf_bloom_filter *bloom = in bloom_map_push_elem() local62 set_bit(h, bloom->bitset); in bloom_map_push_elem()99 struct bpf_bloom_filter *bloom; in bloom_map_alloc() local146 bloom = bpf_map_area_alloc(sizeof(*bloom) + bitset_bytes, numa_node); in bloom_map_alloc()148 if (!bloom) in bloom_map_alloc()159 return &bloom->map; in bloom_map_alloc()167 bpf_map_area_free(bloom); in bloom_map_free()[all …]
11 ``BPF_MAP_TYPE_BLOOM_FILTER`` provides a BPF bloom filter map. Bloom13 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 bloom18 bloom filter map supports two operations:24 bloom filter map and ``bpf_map_peek_elem`` to query the map. These34 into the bloom filter than ``max_entries``, this may lead to a higher43 It is not possible to delete elements from a bloom filter map. A bloom61 A ``value`` can be added to a bloom filter using the63 ``BPF_ANY`` when adding an entry to the bloom filter. This helper112 This snippet shows how to declare a bloom filter in a BPF program:[all …]
8 hash, array, bloom filter and radix-tree. Several of the map types exist to
538 # For B2g the different scan/search algorithms and, hash and bloom540 # and bloom filter size settings. For wumanber the hash and bloom filter size
61 - Support a bloom filter that speeds up negative extended attribute lookups;