summaryrefslogtreecommitdiff
path: root/inc/storage.h
diff options
context:
space:
mode:
authorbd <bdunahu@operationnull.com>2025-03-08 15:19:57 -0500
committerbd <bdunahu@operationnull.com>2025-03-08 15:19:57 -0500
commitdcc22079fc1c455df70ab1263ea09400e4c948d6 (patch)
treea55d0f640d9eb94c58ac25cf5c551c0d7506e43e /inc/storage.h
parent8fc631090fd88a7e8e62f284c3dfd3c515d14613 (diff)
Remove queue in storage.h
Diffstat (limited to 'inc/storage.h')
-rw-r--r--inc/storage.h23
1 files changed, 3 insertions, 20 deletions
diff --git a/inc/storage.h b/inc/storage.h
index 95b6749..4bf4591 100644
--- a/inc/storage.h
+++ b/inc/storage.h
@@ -4,33 +4,16 @@
#include "response.h"
#include <algorithm>
#include <array>
-#include <deque>
#include <vector>
enum Accessor {
+ IDLE,
MEM,
FETCH,
L1CACHE,
SIDE,
};
-/**
- * Wrapper class for std::deque.
- *
- * Implements a deque that does not push duplicate objects.
- */
-template <typename T> class Deque : public std::deque<T>
-{
- public:
- using std::deque<T>::deque;
-
- void push_back(const T &value)
- {
- if (std::find(this->begin(), this->end(), value) == this->end())
- std::deque<T>::push_back(value);
- }
-};
-
class Storage
{
public:
@@ -83,9 +66,9 @@ class Storage
*/
int delay;
/**
- * The accessors currently being serviced, in first come first serve order.
+ * The accessor currently being serviced.
*/
- Deque<enum Accessor> deque;
+ enum Accessor requester;
/**
* The number of cycles until the current request is completed.
*/