gem5  v19.0.0.0
•All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
set_associative.hh
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2018 Inria
3  * Copyright (c) 2012-2014,2017 ARM Limited
4  * All rights reserved.
5  *
6  * The license below extends only to copyright in the software and shall
7  * not be construed as granting a license to any other intellectual
8  * property including but not limited to intellectual property relating
9  * to a hardware implementation of the functionality of the software
10  * licensed hereunder. You may use the software subject to the license
11  * terms below provided that you ensure that this notice is replicated
12  * unmodified and in its entirety in all distributions of the software,
13  * modified or unmodified, in source code or in binary form.
14  *
15  * Copyright (c) 2003-2005,2014 The Regents of The University of Michigan
16  * All rights reserved.
17  *
18  * Redistribution and use in source and binary forms, with or without
19  * modification, are permitted provided that the following conditions are
20  * met: redistributions of source code must retain the above copyright
21  * notice, this list of conditions and the following disclaimer;
22  * redistributions in binary form must reproduce the above copyright
23  * notice, this list of conditions and the following disclaimer in the
24  * documentation and/or other materials provided with the distribution;
25  * neither the name of the copyright holders nor the names of its
26  * contributors may be used to endorse or promote products derived from
27  * this software without specific prior written permission.
28  *
29  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
30  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
31  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
32  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
33  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
34  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
35  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
36  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
37  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
38  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
39  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
40  *
41  * Authors: Daniel Carvalho
42  * Erik Hallnor
43  */
44 
50 #ifndef __MEM_CACHE_INDEXING_POLICIES_SET_ASSOCIATIVE_HH__
51 #define __MEM_CACHE_INDEXING_POLICIES_SET_ASSOCIATIVE_HH__
52 
53 #include <vector>
54 
55 #include "mem/cache/tags/indexing_policies/base.hh"
56 #include "params/SetAssociative.hh"
57 
58 class ReplaceableEntry;
59 
82 class SetAssociative : public BaseIndexingPolicy
83 {
84  private:
91  uint32_t extractSet(const Addr addr) const;
92 
93  public:
97  typedef SetAssociativeParams Params;
98 
102  SetAssociative(const Params *p);
103 
107  ~SetAssociative() {};
108 
118  std::vector<ReplaceableEntry*> getPossibleEntries(const Addr addr) const
119  override;
120 
128  Addr regenerateAddr(const Addr tag, const ReplaceableEntry* entry) const
129  override;
130 };
131 
132 #endif //__MEM_CACHE_INDEXING_POLICIES_SET_ASSOCIATIVE_HH__
addr
ip6_addr_t addr
Definition: inet.hh:335
std::vector
STL vector class.
Definition: stl.hh:40
SetAssociative::getPossibleEntries
std::vector< ReplaceableEntry * > getPossibleEntries(const Addr addr) const override
Find all possible entries for insertion and replacement of an address.
Definition: set_associative.cc:73
SetAssociative::extractSet
uint32_t extractSet(const Addr addr) const
Apply a hash function to calculate address set.
Definition: set_associative.cc:60
SetAssociative::SetAssociative
SetAssociative(const Params *p)
Construct and initialize this policy.
Definition: set_associative.cc:54
Addr
uint64_t Addr
Address type This will probably be moved somewhere else in the near future.
Definition: types.hh:142
SetAssociative::~SetAssociative
~SetAssociative()
Destructor.
Definition: set_associative.hh:107
ReplaceableEntry
A replaceable entry is a basic entry in a 2d table-like structure that needs to have replacement func...
Definition: replaceable_entry.hh:55
SetAssociative::Params
SetAssociativeParams Params
Convenience typedef.
Definition: set_associative.hh:97
SetAssociative::regenerateAddr
Addr regenerateAddr(const Addr tag, const ReplaceableEntry *entry) const override
Regenerate an entry&#39;s address from its tag and assigned set and way.
Definition: set_associative.cc:66
BaseIndexingPolicy
A common base class for indexing table locations.
Definition: base.hh:66
SetAssociative
A set associative indexing policy.
Definition: set_associative.hh:82
MipsISA::p
Bitfield< 0 > p
Definition: pra_constants.hh:325
base.hh
Declaration of a common framework for indexing policies.
Generated on Fri Feb 28 2020 16:27:02 for gem5 by doxygen 1.8.13