gem5 [DEVELOP-FOR-25.0]
Loading...
Searching...
No Matches
bulk_bloom_filter.cc
Go to the documentation of this file.
1/*
2 * Copyright (c) 2019 Inria
3 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are
8 * met: redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer;
10 * redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution;
13 * neither the name of the copyright holders nor the names of its
14 * contributors may be used to endorse or promote products derived from
15 * this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 */
29
31
32#include <limits>
33
34#include "base/bitfield.hh"
35#include "base/logging.hh"
36#include "params/BloomFilterBulk.hh"
37
38namespace gem5
39{
40
41namespace bloom_filter
42{
43
44Bulk::Bulk(const BloomFilterBulkParams &p)
46{
48 (std::numeric_limits<Addr>::digits - offsetBits),
49 "Sectors need more bits than available");
50}
51
53{
54}
55
56int
57Bulk::hash(Addr addr, int hash_number) const
58{
59 addr = permute(addr);
60
61 // Get the sector-based c index
62 int c = bits(addr, (offsetBits + (hash_number + 1) * sectorBits) - 1,
63 offsetBits + hash_number * sectorBits);
64 assert(c < filter.size()/numHashes);
65
66 // Transform the sector-based c index into a filder index (v)
67 c += (numHashes - 1 - hash_number) * (filter.size()/numHashes);
68 assert(c < filter.size());
69
70 return c;
71}
72
73Addr
75{
76 // permutes the original address bits according to Table 5
77 Addr part1 = bits(addr, offsetBits + 6, offsetBits),
78 part2 = bits(addr, offsetBits + 9),
79 part3 = bits(addr, offsetBits + 11),
80 part4 = bits(addr, offsetBits + 17),
81 part5 = bits(addr, offsetBits + 8, offsetBits + 7),
82 part6 = bits(addr, offsetBits + 10),
83 part7 = bits(addr, offsetBits + 12),
84 part8 = bits(addr, offsetBits + 13),
85 part9 = bits(addr, offsetBits + 16, offsetBits + 15),
86 part10 = bits(addr, offsetBits + 20, offsetBits + 18),
87 part11 = bits(addr, offsetBits + 14);
88
89 Addr result =
90 (part1 << 14) | (part2 << 13) | (part3 << 12) | (part4 << 11) |
91 (part5 << 9) | (part6 << 8) | (part7 << 7) | (part8 << 6) |
92 (part9 << 4) | (part10 << 1) | (part11);
93
94 // Select the remaining high-order bits
95 Addr remaining_bits = bits(addr, std::numeric_limits<Addr>::digits - 1,
96 offsetBits + 21) << 21;
97 result = result | remaining_bits;
98
99 return result;
100}
101
102} // namespace bloom_filter
103} // namespace gem5
std::vector< SatCounter8 > filter
The filter itself.
Definition base.hh:55
const unsigned offsetBits
Number of LSB bits to ignore from the the addresses.
Definition base.hh:52
int hash(Addr addr, int hash_number) const override
Apply the selected the hash functions to an address.
Bulk(const BloomFilterBulkParams &p)
Addr permute(Addr addr) const
Permutes the address to generate its signature.
const int sectorBits
Number of bits used per sector.
MultiBitSel(const BloomFilterMultiBitSelParams &p)
const int parFilterSize
Size of the filter when doing parallel hashing.
static constexpr std::enable_if_t< std::is_integral_v< T >, int > floorLog2(T x)
Definition intmath.hh:59
constexpr T bits(T val, unsigned first, unsigned last)
Extract the bitfield from position 'first' to 'last' (inclusive) from 'val' and right justify it.
Definition bitfield.hh:79
#define fatal_if(cond,...)
Conditional fatal macro that checks the supplied condition and only causes a fatal error if the condi...
Definition logging.hh:268
Bitfield< 29 > c
Definition misc_types.hh:53
Bitfield< 0 > p
Bitfield< 3 > addr
Definition types.hh:84
Copyright (c) 2024 Arm Limited All rights reserved.
Definition binary32.hh:36
uint64_t Addr
Address type This will probably be moved somewhere else in the near future.
Definition types.hh:147

Generated on Mon May 26 2025 09:19:06 for gem5 by doxygen 1.13.2