#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.
	 * @param the address that must be present in cache.
	 */
	void fetch_resource(int address);
	/**
	 * An array of paired bits.
	 * If the least significant bit of an element is set, the corresponding
	 * element in `data` is invalid. If the most significant bit of an element
	 * is set, the corresponding element in `data` is dirty.
	 */
	std::array<std::bitset<2>, L1_CACHE_SIZE> stat;
};

#endif /* CACHE_H_INCLUDED */