File size: 2,674 Bytes
f61bac1
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include <cstdint>

#include "ScanArchitect.hh"
#include "ScanArchitectConfig.hh"
#include "gtest/gtest.h"

namespace dft {
namespace {

bool operator!=(const ScanArchitect::HashDomainLimits& lhs,
                const ScanArchitect::HashDomainLimits& rhs)
{
  return lhs.chain_count != rhs.chain_count || lhs.max_length != rhs.max_length;
}

template <typename T>
bool CompareUnordered(const T& u1, const T& u2)
{
  for (const auto& [key, value] : u1) {
    auto it = u2.find(key);
    if (it == u2.end()) {
      return false;
    }
    if (it->second != value) {
      return false;
    }
  }
  return true;
}

ScanArchitect::HashDomainLimits CreateTestHashDomainLimits(uint64_t chain_count,
                                                           uint64_t max_length)
{
  ScanArchitect::HashDomainLimits limits;
  limits.chain_count = chain_count;
  limits.max_length = max_length;
  return limits;
}

// Check if we are correctly calculating the limits of the hash domains
TEST(TestScanArchitect, CalculatesChainCountAndMaxLength)
{
  // For 1 hash domain (1) with 10 bits and a max length of 5, we need to have a
  // chain count of 2 in that hash domain (1)
  EXPECT_TRUE(CompareUnordered(
      ScanArchitect::inferChainCountFromMaxLength({{1, 10}}, 5, {}),
      {{1, CreateTestHashDomainLimits(2, 5)}}));
  // Unbalance cases
  // We create 2 chains with max_length of 4
  EXPECT_TRUE(CompareUnordered(
      ScanArchitect::inferChainCountFromMaxLength({{1, 9}}, 5, {}),
      {{1, CreateTestHashDomainLimits(2, 5)}}));
  // We create 2 chains with max_length of 3
  EXPECT_TRUE(CompareUnordered(
      ScanArchitect::inferChainCountFromMaxLength({{1, 6}}, 5, {}),
      {{1, CreateTestHashDomainLimits(2, 3)}}));

  // Two hash domains, balance case
  EXPECT_TRUE(CompareUnordered(
      ScanArchitect::inferChainCountFromMaxLength({{1, 10}, {2, 10}}, 5, {}),
      {{1, CreateTestHashDomainLimits(2, 5)},
       {2, CreateTestHashDomainLimits(2, 5)}}));
  // Unbalance
  EXPECT_TRUE(CompareUnordered(
      ScanArchitect::inferChainCountFromMaxLength({{1, 10}, {2, 9}}, 5, {}),
      {{1, CreateTestHashDomainLimits(2, 5)},
       {2, CreateTestHashDomainLimits(2, 5)}}));

  //// Two hash domains with different number of cells
  EXPECT_TRUE(CompareUnordered(
      ScanArchitect::inferChainCountFromMaxLength({{1, 10}, {2, 15}}, 5, {}),
      {{1, CreateTestHashDomainLimits(2, 5)},
       {2, CreateTestHashDomainLimits(3, 5)}}));

  // Constrained max chain count
  EXPECT_TRUE(CompareUnordered(
      ScanArchitect::inferChainCountFromMaxLength({{1, 10}}, 5, {1}),
      {{1, CreateTestHashDomainLimits(1, 10)}}));
}

}  // namespace
}  // namespace dft