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"
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 */
45class Bulk : public Base
46{
47 public:
48 Bulk(const BloomFilterBulkParams* p);
49 ~Bulk();
50
51 void set(Addr addr) override;
52
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. */
58 Addr hash(Addr addr) const;
59
60 // split the filter bits in half, c0 and c1
61 const int sectorBits;
62};
63
64} // namespace BloomFilter
65
66#endif // __BASE_FILTERS_BULK_BLOOM_FILTER_HH__