blob: c8c9736be1da9f2e9f90fd8029bf4abe4409bbbd (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
#ifndef CACHE_H
#define CACHE_H
#include "definitions.h"
#include "storage.h"
#include <array>
#include <bitset>
class Cache : public Storage
{
public:
/**
* Constructor.
* @param The number of `lines` contained in memory. The total number of
* words is this number multiplied by LINE_SIZE.
* @param The next lowest level in storage. Methods from this object are
* called in case of a cache miss.
* @param The number of clock cycles each access takes.
* @return A new cache object.
*/
Cache(int lines, Storage *lower, int delay);
~Cache();
Response write(Accessor accessor, signed int data, int address) override;
Response read(
Accessor accessor,
int address,
std::array<signed int, LINE_SIZE> &data) override;
private:
/**
* Fetches `address` from a lower level of storage if it is not already
* present. If it is not, temporarily sets the is_blocked attribute of this
* cache level to true, and the victim line is chosen/written back.
* @param the address that must be present in cache.
*/
void fetch_resource(int address);
/**
* An array of metadata about elements in `data`.
* If the first value of an element is negative, the corresponding
* element in `data` is invalid. If the most second value of an element
* is nonzero, the corresponding element in `data` is dirty.
*/
std::array<std::array<int, 2>, L1_CACHE_SIZE> meta;
};
#endif /* CACHE_H_INCLUDED */
|
