gem5  v20.0.0.2
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
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 
35 namespace BloomFilter {
36 
37 Multi::Multi(const BloomFilterMultiParams* p)
38  : Base(p), filters(p->filters)
39 {
40 }
41 
43 {
44 }
45 
46 void
48 {
49  for (auto& sub_filter : filters) {
50  sub_filter->clear();
51  }
52 }
53 
54 void
55 Multi::merge(const Base* other)
56 {
57  auto* cast_other = static_cast<const Multi*>(other);
58  assert(filters.size() == cast_other->filters.size());
59  for (int i = 0; i < filters.size(); ++i){
60  filters[i]->merge(cast_other->filters[i]);
61  }
62 }
63 
64 void
66 {
67  for (auto& sub_filter : filters) {
68  sub_filter->set(addr);
69  }
70 }
71 
72 void
74 {
75  for (auto& sub_filter : filters) {
76  sub_filter->unset(addr);
77  }
78 }
79 
80 bool
82 {
83  int count = 0;
84  for (const auto& sub_filter : filters) {
85  if (sub_filter->isSet(addr)) {
86  count++;
87  }
88  }
89  return count >= setThreshold;
90 }
91 
92 int
94 {
95  int count = 0;
96  for (const auto& sub_filter : filters) {
97  count += sub_filter->getCount(addr);
98  }
99  return count;
100 }
101 
102 int
104 {
105  int count = 0;
106  for (const auto& sub_filter : filters) {
107  count += sub_filter->getTotalCount();
108  }
109  return count;
110 }
111 
112 } // namespace BloomFilter
113 
115 BloomFilterMultiParams::create()
116 {
117  return new BloomFilter::Multi(this);
118 }
119 
count
Definition: misc.hh:703
Bitfield< 7 > i
ip6_addr_t addr
Definition: inet.hh:330
void clear() override
Clear the filter by resetting all values.
void set(Addr addr) override
Perform the filter specific function to set the corresponding entries (can be multiple) of an address...
Multi(const BloomFilterMultiParams *p)
int getTotalCount() const override
Get the total value stored in the filter entries.
uint64_t Addr
Address type This will probably be moved somewhere else in the near future.
Definition: types.hh:140
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.
void merge(const Base *other) override
Merges the contents of both filters into this&#39; (Bloom Filter union).
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.
const int setThreshold
Threshold at which a filter entry starts being considered as set.
Definition: base.hh:56
void unset(Addr addr) override
Perform the filter specific function to clear the corresponding entries (can be multiple) of an addre...
Bitfield< 0 > p

Generated on Mon Jun 8 2020 15:45:07 for gem5 by doxygen 1.8.13