diff options
author | Polina Dudnik <pdudnik@gmail.com> | 2009-05-11 10:38:46 -0700 |
---|---|---|
committer | Polina Dudnik <pdudnik@gmail.com> | 2009-05-11 10:38:46 -0700 |
commit | 7769cc9092ccfd8c6c2286762631f0d0f1f16d04 (patch) | |
tree | c9fb119589da4bdc928a94e879f9cf2415a074fd /src/mem/ruby/system/NonCountingBloomFilter.cc | |
parent | 0ccf8f35a57001bab2da39ea24afd288244e0dcd (diff) | |
download | gem5-7769cc9092ccfd8c6c2286762631f0d0f1f16d04.tar.xz |
ruby: decommission code
1. Set.* and BigSet.* are replaced with OptBigSet.* which was renamed Set.*
2. Decomissioned all bloom filters
3. Decomissioned ruby/simics directory
Diffstat (limited to 'src/mem/ruby/system/NonCountingBloomFilter.cc')
-rw-r--r-- | src/mem/ruby/system/NonCountingBloomFilter.cc | 145 |
1 files changed, 0 insertions, 145 deletions
diff --git a/src/mem/ruby/system/NonCountingBloomFilter.cc b/src/mem/ruby/system/NonCountingBloomFilter.cc deleted file mode 100644 index b8f35322d..000000000 --- a/src/mem/ruby/system/NonCountingBloomFilter.cc +++ /dev/null @@ -1,145 +0,0 @@ - -/* - * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood - * All rights reserved. - * - * Redistribution and use in source and binary forms, with or without - * modification, are permitted provided that the following conditions are - * met: redistributions of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer; - * redistributions in binary form must reproduce the above copyright - * notice, this list of conditions and the following disclaimer in the - * documentation and/or other materials provided with the distribution; - * neither the name of the copyright holders nor the names of its - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS - * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT - * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR - * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT - * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, - * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT - * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, - * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY - * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE - * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - */ - -/* - * NonCountingBloomFilter.C - * - * Description: - * - * - */ - -#include "mem/ruby/system/NonCountingBloomFilter.hh" -#include "mem/gems_common/Map.hh" -#include "mem/ruby/common/Address.hh" - -NonCountingBloomFilter::NonCountingBloomFilter(string str) -{ - string tail(str); - string head = string_split(tail, '_'); - - // head contains filter size, tail contains bit offset from block number - int smt_threads = RubyConfig::numberofSMTThreads(); - m_filter_size = atoi(head.c_str()); - m_offset = atoi(tail.c_str()); - m_filter_size_bits = log_int(m_filter_size); - - - m_filter.setSize(m_filter_size); - clear(); -} - -NonCountingBloomFilter::~NonCountingBloomFilter(){ -} - -void NonCountingBloomFilter::clear() -{ - for (int i = 0; i < m_filter_size; i++) { - m_filter[i] = 0; - } -} - -void NonCountingBloomFilter::increment(const Address& addr) -{ - // Not used -} - - -void NonCountingBloomFilter::decrement(const Address& addr) -{ - // Not used -} - -void NonCountingBloomFilter::merge(AbstractBloomFilter * other_filter){ - // assumes both filters are the same size! - NonCountingBloomFilter * temp = (NonCountingBloomFilter*) other_filter; - for(int i=0; i < m_filter_size; ++i){ - m_filter[i] |= (*temp)[i]; - } - -} - -void NonCountingBloomFilter::set(const Address& addr) -{ - int i = get_index(addr); - m_filter[i] = 1; -} - -void NonCountingBloomFilter::unset(const Address& addr) -{ - int i = get_index(addr); - m_filter[i] = 0; -} - -bool NonCountingBloomFilter::isSet(const Address& addr) -{ - int i = get_index(addr); - return (m_filter[i]); -} - - -int NonCountingBloomFilter::getCount(const Address& addr) -{ - return m_filter[get_index(addr)]; -} - -int NonCountingBloomFilter::getTotalCount() -{ - int count = 0; - - for (int i = 0; i < m_filter_size; i++) { - count += m_filter[i]; - } - return count; -} - -void NonCountingBloomFilter::print(ostream& out) const -{ -} - -int NonCountingBloomFilter::getIndex(const Address& addr) -{ - return get_index(addr); -} - -int NonCountingBloomFilter::readBit(const int index) { - return m_filter[index]; -} - -void NonCountingBloomFilter::writeBit(const int index, const int value) { - m_filter[index] = value; -} - -int NonCountingBloomFilter::get_index(const Address& addr) -{ - return addr.bitSelect( RubyConfig::dataBlockBits() + m_offset, - RubyConfig::dataBlockBits() + m_offset + m_filter_size_bits - 1); -} - - |