MEM: Introduce the master/slave port sub-classes in C++
[gem5.git] / src / mem / ruby / filters / H3BloomFilter.hh
1 /*
2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29 #ifndef __MEM_RUBY_FILTERS_H3BLOOMFILTER_HH__
30 #define __MEM_RUBY_FILTERS_H3BLOOMFILTER_HH__
31
32 #include <iostream>
33 #include <string>
34 #include <vector>
35
36 #include "mem/ruby/common/Address.hh"
37 #include "mem/ruby/common/Global.hh"
38 #include "mem/ruby/filters/AbstractBloomFilter.hh"
39 #include "mem/ruby/profiler/Profiler.hh"
40 #include "mem/ruby/system/System.hh"
41
42 class H3BloomFilter : public AbstractBloomFilter
43 {
44 public:
45 H3BloomFilter(std::string config);
46 ~H3BloomFilter();
47
48 void clear();
49 void increment(const Address& addr);
50 void decrement(const Address& addr);
51 void merge(AbstractBloomFilter * other_filter);
52 void set(const Address& addr);
53 void unset(const Address& addr);
54
55 bool isSet(const Address& addr);
56 int getCount(const Address& addr);
57 int getTotalCount();
58 void print(std::ostream& out) const;
59
60 int getIndex(const Address& addr);
61 int readBit(const int index);
62 void writeBit(const int index, const int value);
63
64 int
65 operator[](const int index) const
66 {
67 return this->m_filter[index];
68 }
69
70 private:
71 int get_index(const Address& addr, int hashNumber);
72
73 int hash_H3(uint64 value, int index);
74
75 std::vector<int> m_filter;
76 int m_filter_size;
77 int m_num_hashes;
78 int m_filter_size_bits;
79
80 int m_par_filter_size;
81 int m_par_filter_size_bits;
82
83 int m_count_bits;
84 int m_count;
85
86 int primes_list[6];// = {9323,11279,10247,30637,25717,43711};
87 int mults_list[6]; //= {255,29,51,3,77,43};
88 int adds_list[6]; //= {841,627,1555,241,7777,65391};
89
90 bool isParallel;
91 };
92
93 #endif // __MEM_RUBY_FILTERS_H3BLOOMFILTER_HH__