2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
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.
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.
29 #ifndef __MEM_RUBY_FILTERS_MULTIBITSELBLOOMFILTER_HH__
30 #define __MEM_RUBY_FILTERS_MULTIBITSELBLOOMFILTER_HH__
36 #include "mem/ruby/common/Address.hh"
37 #include "mem/ruby/filters/AbstractBloomFilter.hh"
39 class MultiBitSelBloomFilter : public AbstractBloomFilter
42 MultiBitSelBloomFilter(std::string config);
43 ~MultiBitSelBloomFilter();
46 void increment(const Address& addr);
47 void decrement(const Address& addr);
48 void merge(AbstractBloomFilter * other_filter);
49 void set(const Address& addr);
50 void unset(const Address& addr);
52 bool isSet(const Address& addr);
53 int getCount(const Address& addr);
55 void print(std::ostream& out) const;
57 int getIndex(const Address& addr);
58 int readBit(const int index);
59 void writeBit(const int index, const int value);
62 operator[](const int index) const
64 return this->m_filter[index];
68 int get_index(const Address& addr, int hashNumber);
70 int hash_bitsel(uint64 value, int index, int jump, int maxBits,
73 std::vector<int> m_filter;
76 int m_filter_size_bits;
79 int m_par_filter_size;
80 int m_par_filter_size_bits;
85 #endif // __MEM_RUBY_FILTERS_MULTIBITSELBLOOMFILTER_HH__