ruby: bloom filters: refactor code
[gem5.git] / src / mem / ruby / filters / NonCountingBloomFilter.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_NONCOUNTINGBLOOMFILTER_HH__
30 #define __MEM_RUBY_FILTERS_NONCOUNTINGBLOOMFILTER_HH__
31
32 #include <iostream>
33 #include <vector>
34
35 #include "mem/ruby/common/Address.hh"
36 #include "mem/ruby/filters/AbstractBloomFilter.hh"
37
38 class NonCountingBloomFilter : public AbstractBloomFilter
39 {
40 public:
41 NonCountingBloomFilter(int head, int tail);
42 ~NonCountingBloomFilter();
43
44 void clear();
45 void increment(Addr addr);
46 void decrement(Addr addr);
47 void merge(AbstractBloomFilter * other_filter);
48 void set(Addr addr);
49 void unset(Addr addr);
50
51 bool isSet(Addr addr);
52 int getCount(Addr addr);
53 int getTotalCount();
54
55 int getIndex(Addr addr);
56 int readBit(const int index);
57 void writeBit(const int index, const int value);
58
59 void print(std::ostream& out) const;
60
61 int
62 operator[](const int index) const
63 {
64 return this->m_filter[index];
65 }
66
67 private:
68 int get_index(Addr addr);
69
70 std::vector<int> m_filter;
71 int m_filter_size;
72 int m_offset;
73 int m_filter_size_bits;
74 };
75
76 #endif // __MEM_RUBY_FILTERS_NONCOUNTINGBLOOMFILTER_HH__