"vscode:/vscode.git/clone" did not exist on "40a7b8629e6a0470b7baac2b7843ecc7e923ca93"
Commit 6b1738f3 authored by Adam Osewski's avatar Adam Osewski
Browse files

Update test cases, since KPerBlock has doubled.

parent e052dbb2
...@@ -4,7 +4,7 @@ TEST_P(RRR_F16_F16_F16, TinyCases) ...@@ -4,7 +4,7 @@ TEST_P(RRR_F16_F16_F16, TinyCases)
{ {
const std::vector<int> Ms{0, 1}; const std::vector<int> Ms{0, 1};
constexpr int N = 768; constexpr int N = 768;
constexpr int K = 544; constexpr int K = 1088;
const std::vector<int> Ns(Ms.size(), N); const std::vector<int> Ns(Ms.size(), N);
const std::vector<int> Ks(Ms.size(), K); const std::vector<int> Ks(Ms.size(), K);
...@@ -17,9 +17,9 @@ TEST_P(RRR_F16_F16_F16, TinyCases) ...@@ -17,9 +17,9 @@ TEST_P(RRR_F16_F16_F16, TinyCases)
TEST_P(RRR_F16_F16_F16, SmallCases) TEST_P(RRR_F16_F16_F16, SmallCases)
{ {
const std::vector<int> Ms{2, 1, 3, 4, 5, 0}; const std::vector<int> Ms{2, 3, 4, 5};
constexpr int N = 768; constexpr int N = 768;
constexpr int K = 544; constexpr int K = 1088;
const std::vector<int> Ns(Ms.size(), N); const std::vector<int> Ns(Ms.size(), N);
const std::vector<int> Ks(Ms.size(), K); const std::vector<int> Ks(Ms.size(), K);
...@@ -34,7 +34,7 @@ TEST_P(RRR_F16_F16_F16, MidCases) ...@@ -34,7 +34,7 @@ TEST_P(RRR_F16_F16_F16, MidCases)
{ {
const std::vector<int> Ms{167, 183, 177, 153, 139, 204}; const std::vector<int> Ms{167, 183, 177, 153, 139, 204};
constexpr int N = 768; constexpr int N = 768;
constexpr int K = 544; constexpr int K = 1088;
const std::vector<int> Ns(Ms.size(), N); const std::vector<int> Ns(Ms.size(), N);
const std::vector<int> Ks(Ms.size(), K); const std::vector<int> Ks(Ms.size(), K);
...@@ -49,7 +49,7 @@ TEST_P(RRR_F16_F16_F16, Regular) ...@@ -49,7 +49,7 @@ TEST_P(RRR_F16_F16_F16, Regular)
{ {
const std::vector<int> Ms{64, 128, 256}; const std::vector<int> Ms{64, 128, 256};
constexpr int N = 768; constexpr int N = 768;
constexpr int K = 320; constexpr int K = 640;
const std::vector<int> Ns(Ms.size(), N); const std::vector<int> Ns(Ms.size(), N);
const std::vector<int> Ks(Ms.size(), K); const std::vector<int> Ks(Ms.size(), K);
...@@ -79,7 +79,7 @@ TEST_P(RCR_F16_F16_F16, TinyCases) ...@@ -79,7 +79,7 @@ TEST_P(RCR_F16_F16_F16, TinyCases)
{ {
const std::vector<int> Ms{0, 1}; const std::vector<int> Ms{0, 1};
constexpr int N = 768; constexpr int N = 768;
constexpr int K = 544; constexpr int K = 1088;
const std::vector<int> Ns(Ms.size(), N); const std::vector<int> Ns(Ms.size(), N);
const std::vector<int> Ks(Ms.size(), K); const std::vector<int> Ks(Ms.size(), K);
...@@ -91,9 +91,9 @@ TEST_P(RCR_F16_F16_F16, TinyCases) ...@@ -91,9 +91,9 @@ TEST_P(RCR_F16_F16_F16, TinyCases)
TEST_P(RCR_F16_F16_F16, SmallCases) TEST_P(RCR_F16_F16_F16, SmallCases)
{ {
const std::vector<int> Ms{2, 1, 3, 4, 5, 0}; const std::vector<int> Ms{2, 3, 4, 5};
constexpr int N = 768; constexpr int N = 768;
constexpr int K = 544; constexpr int K = 1088;
const std::vector<int> Ns(Ms.size(), N); const std::vector<int> Ns(Ms.size(), N);
const std::vector<int> Ks(Ms.size(), K); const std::vector<int> Ks(Ms.size(), K);
...@@ -123,7 +123,7 @@ TEST_P(RCR_F16_F16_F16, Regular) ...@@ -123,7 +123,7 @@ TEST_P(RCR_F16_F16_F16, Regular)
{ {
const std::vector<int> Ms{32, 64, 128, 256}; const std::vector<int> Ms{32, 64, 128, 256};
constexpr int N = 768; constexpr int N = 768;
constexpr int K = 320; constexpr int K = 640;
const std::vector<int> Ns(Ms.size(), N); const std::vector<int> Ns(Ms.size(), N);
const std::vector<int> Ks(Ms.size(), K); const std::vector<int> Ks(Ms.size(), K);
...@@ -153,7 +153,7 @@ TEST_P(RRR_F16_F16_F16_LargeK, TestLargeKBatch) ...@@ -153,7 +153,7 @@ TEST_P(RRR_F16_F16_F16_LargeK, TestLargeKBatch)
{ {
const std::vector<int> Ms{188, 210}; const std::vector<int> Ms{188, 210};
constexpr int N = 768; constexpr int N = 768;
constexpr int K = 4096; constexpr int K = 8192;
const std::vector<int> Ns(Ms.size(), N); const std::vector<int> Ns(Ms.size(), N);
const std::vector<int> Ks(Ms.size(), K); const std::vector<int> Ks(Ms.size(), K);
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment