CacheMemory.hh revision 11019:fc1e41e88fd3 
1/*
2 * Copyright (c) 1999-2012 Mark D. Hill and David A. Wood
3 * Copyright (c) 2013 Advanced Micro Devices, Inc.
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
9 * notice, this list of conditions and the following disclaimer;
10 * redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution;
13 * neither the name of the copyright holders nor the names of its
14 * contributors may be used to endorse or promote products derived from
15 * this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 */
29
30#ifndef __MEM_RUBY_STRUCTURES_CACHEMEMORY_HH__
31#define __MEM_RUBY_STRUCTURES_CACHEMEMORY_HH__
32
33#include <string>
34#include <vector>
35
36#include "base/hashmap.hh"
37#include "base/statistics.hh"
38#include "mem/protocol/CacheRequestType.hh"
39#include "mem/protocol/CacheResourceType.hh"
40#include "mem/protocol/RubyRequest.hh"
41#include "mem/ruby/common/DataBlock.hh"
42#include "mem/ruby/slicc_interface/AbstractCacheEntry.hh"
43#include "mem/ruby/slicc_interface/RubySlicc_ComponentMapping.hh"
44#include "mem/ruby/structures/AbstractReplacementPolicy.hh"
45#include "mem/ruby/structures/BankedArray.hh"
46#include "mem/ruby/system/CacheRecorder.hh"
47#include "params/RubyCache.hh"
48#include "sim/sim_object.hh"
49
50class CacheMemory : public SimObject
51{
52  public:
53    typedef RubyCacheParams Params;
54    CacheMemory(const Params *p);
55    ~CacheMemory();
56
57    void init();
58
59    // Public Methods
60    // perform a cache access and see if we hit or not.  Return true on a hit.
61    bool tryCacheAccess(const Address& address, RubyRequestType type,
62                        DataBlock*& data_ptr);
63
64    // similar to above, but doesn't require full access check
65    bool testCacheAccess(const Address& address, RubyRequestType type,
66                         DataBlock*& data_ptr);
67
68    // tests to see if an address is present in the cache
69    bool isTagPresent(const Address& address) const;
70
71    // Returns true if there is:
72    //   a) a tag match on this address or there is
73    //   b) an unused line in the same cache "way"
74    bool cacheAvail(const Address& address) const;
75
76    // find an unused entry and sets the tag appropriate for the address
77    AbstractCacheEntry* allocate(const Address& address,
78                                 AbstractCacheEntry* new_entry, bool touch);
79    AbstractCacheEntry* allocate(const Address& address,
80                                 AbstractCacheEntry* new_entry)
81    {
82        return allocate(address, new_entry, true);
83    }
84    void allocateVoid(const Address& address, AbstractCacheEntry* new_entry)
85    {
86        allocate(address, new_entry, true);
87    }
88
89    // Explicitly free up this address
90    void deallocate(const Address& address);
91
92    // Returns with the physical address of the conflicting cache line
93    Address cacheProbe(const Address& address) const;
94
95    // looks an address up in the cache
96    AbstractCacheEntry* lookup(const Address& address);
97    const AbstractCacheEntry* lookup(const Address& address) const;
98
99    Cycles getTagLatency() const { return tagArray.getLatency(); }
100    Cycles getDataLatency() const { return dataArray.getLatency(); }
101
102    bool isBlockInvalid(int64 cache_set, int64 loc);
103    bool isBlockNotBusy(int64 cache_set, int64 loc);
104
105    // Hook for checkpointing the contents of the cache
106    void recordCacheContents(int cntrl, CacheRecorder* tr) const;
107
108    // Set this address to most recently used
109    void setMRU(const Address& address);
110
111    void setLocked (const Address& addr, int context);
112    void clearLocked (const Address& addr);
113    bool isLocked (const Address& addr, int context);
114
115    // Print cache contents
116    void print(std::ostream& out) const;
117    void printData(std::ostream& out) const;
118
119    void regStats();
120    bool checkResourceAvailable(CacheResourceType res, Address addr);
121    void recordRequestType(CacheRequestType requestType, Address addr);
122
123  public:
124    Stats::Scalar m_demand_hits;
125    Stats::Scalar m_demand_misses;
126    Stats::Formula m_demand_accesses;
127
128    Stats::Scalar m_sw_prefetches;
129    Stats::Scalar m_hw_prefetches;
130    Stats::Formula m_prefetches;
131
132    Stats::Vector m_accessModeType;
133
134    Stats::Scalar numDataArrayReads;
135    Stats::Scalar numDataArrayWrites;
136    Stats::Scalar numTagArrayReads;
137    Stats::Scalar numTagArrayWrites;
138
139    Stats::Scalar numTagArrayStalls;
140    Stats::Scalar numDataArrayStalls;
141
142    int getCacheSize() const { return m_cache_size; }
143    int getNumBlocks() const { return m_cache_num_sets * m_cache_assoc; }
144    Address getAddressAtIdx(int idx) const;
145
146  private:
147    // convert a Address to its location in the cache
148    int64 addressToCacheSet(const Address& address) const;
149
150    // Given a cache tag: returns the index of the tag in a set.
151    // returns -1 if the tag is not found.
152    int findTagInSet(int64 line, const Address& tag) const;
153    int findTagInSetIgnorePermissions(int64 cacheSet,
154                                      const Address& tag) const;
155
156    // Private copy constructor and assignment operator
157    CacheMemory(const CacheMemory& obj);
158    CacheMemory& operator=(const CacheMemory& obj);
159
160  private:
161    // Data Members (m_prefix)
162    bool m_is_instruction_only_cache;
163
164    // The first index is the # of cache lines.
165    // The second index is the the amount associativity.
166    m5::hash_map<Address, int> m_tag_index;
167    std::vector<std::vector<AbstractCacheEntry*> > m_cache;
168
169    AbstractReplacementPolicy *m_replacementPolicy_ptr;
170
171    BankedArray dataArray;
172    BankedArray tagArray;
173
174    int m_cache_size;
175    int m_cache_num_sets;
176    int m_cache_num_set_bits;
177    int m_cache_assoc;
178    int m_start_index_bit;
179    bool m_resource_stalls;
180};
181
182std::ostream& operator<<(std::ostream& out, const CacheMemory& obj);
183
184#endif // __MEM_RUBY_STRUCTURES_CACHEMEMORY_HH__
185