gem5 v24.0.0.0
Loading...
Searching...
No Matches
multi_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 "base/logging.hh"
33#include "params/BloomFilterMulti.hh"
34
35namespace gem5
36{
37
38namespace bloom_filter
39{
40
41Multi::Multi(const BloomFilterMultiParams &p)
42 : Base(p), filters(p.filters)
43{
44}
45
47{
48}
49
50void
52{
53 for (auto& sub_filter : filters) {
54 sub_filter->clear();
55 }
56}
57
58void
59Multi::merge(const Base* other)
60{
61 auto* cast_other = static_cast<const Multi*>(other);
62 assert(filters.size() == cast_other->filters.size());
63 for (int i = 0; i < filters.size(); ++i){
64 filters[i]->merge(cast_other->filters[i]);
65 }
66}
67
68void
70{
71 for (auto& sub_filter : filters) {
72 sub_filter->set(addr);
73 }
74}
75
76void
78{
79 for (auto& sub_filter : filters) {
80 sub_filter->unset(addr);
81 }
82}
83
84bool
86{
87 int count = 0;
88 for (const auto& sub_filter : filters) {
89 if (sub_filter->isSet(addr)) {
90 count++;
91 }
92 }
93 return count >= setThreshold;
94}
95
96int
98{
99 int count = 0;
100 for (const auto& sub_filter : filters) {
101 count += sub_filter->getCount(addr);
102 }
103 return count;
104}
105
106int
108{
109 int count = 0;
110 for (const auto& sub_filter : filters) {
111 count += sub_filter->getTotalCount();
112 }
113 return count;
114}
115
116} // namespace bloom_filter
117} // namespace gem5
const int setThreshold
Threshold at which a filter entry starts being considered as set.
Definition base.hh:61
virtual void clear()
Clear the filter by resetting all values.
Definition base.hh:79
This BloomFilter has multiple sub-filters, each with its own hashing functionality.
bool isSet(Addr addr) const override
Check if the corresponding filter entries of an address should be considered as set.
void unset(Addr addr) override
Perform the filter specific function to clear the corresponding entries (can be multiple) of an addre...
std::vector< Base * > filters
Sub-filters used by this filter.
int getCount(Addr addr) const override
Get the value stored in the corresponding filter entry of an address.
int getTotalCount() const override
Get the total value stored in the filter entries.
void merge(const Base *other) override
Merges the contents of both filters into this' (Bloom Filter union).
void clear() override
Clear the filter by resetting all values.
Multi(const BloomFilterMultiParams &p)
void set(Addr addr) override
Perform the filter specific function to set the corresponding entries (can be multiple) of an address...
Bitfield< 7 > i
Definition misc_types.hh:67
Bitfield< 0 > p
Bitfield< 3 > addr
Definition types.hh:84
Copyright (c) 2024 - Pranith Kumar Copyright (c) 2020 Inria 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 Tue Jun 18 2024 16:24:00 for gem5 by doxygen 1.11.0