summaryrefslogtreecommitdiff
path: root/tests
diff options
context:
space:
mode:
authorbd <bdunahu@operationnull.com>2025-03-06 01:15:31 -0500
committerbd <bdunahu@operationnull.com>2025-03-06 01:15:31 -0500
commitc38c0858ad4c9158a8d4361069309a9f0ff3aed8 (patch)
treeaa84162d707090a4ca2c741ff2e6e9799bc612c9 /tests
parent3322aa0845f7fe9cc98aa4e429bd5ecf72a5c27e (diff)
dram implement delay and conflicting request logic
Diffstat (limited to 'tests')
-rw-r--r--tests/dram.cc204
1 files changed, 202 insertions, 2 deletions
diff --git a/tests/dram.cc b/tests/dram.cc
index 15e2990..be69263 100644
--- a/tests/dram.cc
+++ b/tests/dram.cc
@@ -1,7 +1,7 @@
#include "dram.h"
#include "definitions.h"
-#include <catch2/catch_test_macros.hpp>
#include <array>
+#include <catch2/catch_test_macros.hpp>
TEST_CASE("Construct singleton dram", "[dram]")
{
@@ -12,7 +12,8 @@ TEST_CASE("Construct singleton dram", "[dram]")
delete d;
}
-TEST_CASE("Construct ingleton dram, store 0th element in zero cycles", "[dram]")
+TEST_CASE(
+ "Construct singleton dram, store 0th element in zero cycles", "[dram]")
{
Dram *d = new Dram(1, 0);
std::array<signed int, LINE_SIZE> expected = {0, 0, 0, 0};
@@ -24,11 +25,210 @@ TEST_CASE("Construct ingleton dram, store 0th element in zero cycles", "[dram]")
Response *r = d->write(MEMORY, w, 0x00000000);
REQUIRE(r->status == OK);
+ expected.at(0) = w;
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+
+ delete r;
+ delete d;
+}
+
+TEST_CASE(
+ "Construct singleton dram, store 0th element in three cycles", "[dram]")
+{
+ Dram *d = new Dram(1, 3);
+ std::array<signed int, LINE_SIZE> expected = {0, 0, 0, 0};
+ std::array<signed int, LINE_SIZE> actual = d->view(0, 1)[0];
+ CHECK(expected == actual);
+
+ signed int w = 0x11223344;
+
+ // MEMORY CYCLE 1
+ Response *r = d->write(MEMORY, w, 0x00000000);
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+ REQUIRE(r->status == WAIT);
+
+ // MEMORY CYCLE 2
+ r = d->write(MEMORY, w, 0x00000000);
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+ REQUIRE(r->status == WAIT);
+ delete r;
+
+ // MEMORY CYCLE 3
+ r = d->write(MEMORY, w, 0x00000000);
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+ REQUIRE(r->status == WAIT);
+ delete r;
+
+ // MEMORY CYCLE 4
+ r = d->write(MEMORY, w, 0x00000000);
+ REQUIRE(r->status == OK);
+ delete r;
expected.at(0) = w;
actual = d->view(0, 1)[0];
REQUIRE(expected == actual);
+ delete d;
+}
+
+TEST_CASE(
+ "Construct singleton dram, store 0, 1th element in three cycles no "
+ "conflict",
+ "[dram]")
+{
+ Dram *d = new Dram(1, 3);
+ std::array<signed int, LINE_SIZE> expected = {0, 0, 0, 0};
+ std::array<signed int, LINE_SIZE> actual = d->view(0, 1)[0];
+ CHECK(expected == actual);
+
+ signed int w1 = 0x11223344;
+ signed int w2 = 0x55667788;
+
+ // MEMORY CYCLE 1
+ Response *r = d->write(MEMORY, w1, 0x00000000);
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+ REQUIRE(r->status == WAIT);
+ delete r;
+
+ // MEMORY CYCLE 2
+ actual = d->view(0, 1)[0];
+ r = d->write(MEMORY, w1, 0x00000000);
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+ REQUIRE(r->status == WAIT);
delete r;
+
+ // MEMORY CYCLE 3
+ r = d->write(MEMORY, w1, 0x00000000);
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+ REQUIRE(r->status == WAIT);
+ delete r;
+
+ // MEMORY CYCLE 4
+ r = d->write(MEMORY, w1, 0x00000000);
+ REQUIRE(r->status == OK);
+ delete r;
+ // NOTE: servicing on the same clock cycle should probably not be allowed
+ // FETCH CYCLE 1
+ r = d->write(FETCH, w2, 0x00000001);
+ actual = d->view(0, 1)[0];
+ REQUIRE(r->status == WAIT);
+ delete r;
+
+ expected.at(0) = w1;
+ actual = d->view(0, 1)[0];
+ CHECK(expected == actual);
+
+ // FETCH CYCLE 2
+ r = d->write(FETCH, w2, 0x00000001);
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+ REQUIRE(r->status == WAIT);
+ delete r;
+
+ // FETCH CYCLE 3
+ r = d->write(FETCH, w2, 0x00000001);
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+ REQUIRE(r->status == WAIT);
+ delete r;
+
+ // FETCH CYCLE 4
+ r = d->write(FETCH, w2, 0x00000001);
+ actual = d->view(0, 1)[0];
+ REQUIRE(r->status == OK);
+ delete r;
+
+ expected.at(1) = w2;
+ actual = d->view(0, 1)[0];
+ CHECK(expected == actual);
+
+ delete d;
+}
+
+TEST_CASE(
+ "Construct singleton dram, store 0, 1th element in three cycles much "
+ "conflict",
+ "[dram]")
+{
+ Dram *d = new Dram(1, 3);
+ std::array<signed int, LINE_SIZE> expected = {0, 0, 0, 0};
+ std::array<signed int, LINE_SIZE> actual = d->view(0, 1)[0];
+ CHECK(expected == actual);
+
+ signed int w1 = 0x11223344;
+ signed int w2 = 0x55667788;
+
+ // MEMORY CYCLE 1
+ Response *r = d->write(MEMORY, w1, 0x00000000);
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+ REQUIRE(r->status == WAIT);
+
+ // MEMORY CYCLE 2
+ actual = d->view(0, 1)[0];
+ r = d->write(MEMORY, w1, 0x00000000);
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+ REQUIRE(r->status == WAIT);
+ delete r;
+ // FETCH CYCLE 1
+ r = d->write(FETCH, w2, 0x00000001);
+ actual = d->view(0, 1)[0];
+ REQUIRE(r->status == WAIT);
+ delete r;
+
+ r = d->write(MEMORY, w1, 0x00000000);
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+ REQUIRE(r->status == WAIT);
+ delete r;
+ // FETCH CYCLE 1
+ r = d->write(FETCH, w2, 0x00000001);
+ actual = d->view(0, 1)[0];
+ REQUIRE(r->status == WAIT);
+ delete r;
+
+ r = d->write(MEMORY, w1, 0x00000000);
+ REQUIRE(r->status == OK);
+ delete r;
+ // NOTE: servicing on the same clock cycle should probably not be allowed
+ // FETCH CYCLE 1
+ r = d->write(FETCH, w2, 0x00000001);
+ actual = d->view(0, 1)[0];
+ REQUIRE(r->status == WAIT);
+ delete r;
+
+ expected.at(0) = w1;
+ actual = d->view(0, 1)[0];
+ CHECK(expected == actual);
+
+ r = d->write(FETCH, w2, 0x00000001);
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+ REQUIRE(r->status == WAIT);
+ delete r;
+
+ r = d->write(FETCH, w2, 0x00000001);
+ actual = d->view(0, 1)[0];
+ REQUIRE(expected == actual);
+ REQUIRE(r->status == WAIT);
+ delete r;
+
+ r = d->write(FETCH, w2, 0x00000001);
+ actual = d->view(0, 1)[0];
+ REQUIRE(r->status == OK);
+ delete r;
+
+ expected.at(1) = w2;
+ actual = d->view(0, 1)[0];
+ CHECK(expected == actual);
+
delete d;
}