bulk_bloom_filter.hh (14262:991410960fdb) | bulk_bloom_filter.hh (14263:4a6d5c4a0813) |
---|---|
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 --- 18 unchanged lines hidden (view full) --- 27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28 * 29 * Authors: Daniel Carvalho 30 */ 31 32#ifndef __BASE_FILTERS_BULK_BLOOM_FILTER_HH__ 33#define __BASE_FILTERS_BULK_BLOOM_FILTER_HH__ 34 | 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 --- 18 unchanged lines hidden (view full) --- 27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28 * 29 * Authors: Daniel Carvalho 30 */ 31 32#ifndef __BASE_FILTERS_BULK_BLOOM_FILTER_HH__ 33#define __BASE_FILTERS_BULK_BLOOM_FILTER_HH__ 34 |
35#include "base/filters/base.hh" | 35#include "base/filters/multi_bit_sel_bloom_filter.hh" |
36 37struct BloomFilterBulkParams; 38 39namespace BloomFilter { 40 41/** 42 * Implementation of the bloom filter, as described in "Bulk Disambiguation of 43 * Speculative Threads in Multiprocessors", by Ceze, Luis, et al. | 36 37struct BloomFilterBulkParams; 38 39namespace BloomFilter { 40 41/** 42 * Implementation of the bloom filter, as described in "Bulk Disambiguation of 43 * Speculative Threads in Multiprocessors", by Ceze, Luis, et al. |
44 * The number of hashes indicates the number of c bitfields. |
|
44 */ | 45 */ |
45class Bulk : public Base | 46class Bulk : public MultiBitSel |
46{ 47 public: 48 Bulk(const BloomFilterBulkParams* p); 49 ~Bulk(); 50 | 47{ 48 public: 49 Bulk(const BloomFilterBulkParams* p); 50 ~Bulk(); 51 |
51 void set(Addr addr) override; | 52 protected: 53 int hash(Addr addr, int hash_number) const override; |
52 | 54 |
53 bool isSet(Addr addr) const override; 54 int getCount(Addr addr) const override; 55 | |
56 private: 57 /** Permutes the address to generate its signature. */ | 55 private: 56 /** Permutes the address to generate its signature. */ |
58 Addr hash(Addr addr) const; | 57 Addr permute(Addr addr) const; |
59 | 58 |
60 // split the filter bits in half, c0 and c1 | 59 /** 60 * Number of bits used per sector. The filter is split into sectors, 61 * each of which with its own hash function. When an address is hashed 62 * all sectors are parsed to generate c indexes. These indexes are then 63 * used to find the respective v indexes in the main filter. 64 */ |
61 const int sectorBits; 62}; 63 64} // namespace BloomFilter 65 66#endif // __BASE_FILTERS_BULK_BLOOM_FILTER_HH__ | 65 const int sectorBits; 66}; 67 68} // namespace BloomFilter 69 70#endif // __BASE_FILTERS_BULK_BLOOM_FILTER_HH__ |