File size: 6,077 Bytes
5cdf637 | 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 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 | #include <cstdint>
#include <memory>
#include <sstream>
#include <string>
#include <string_view>
#include <unordered_set>
#include <utility>
#include <vector>
#include "ClockDomain.hh"
#include "ScanArchitect.hh"
#include "ScanArchitectConfig.hh"
#include "ScanCell.hh"
#include "ScanCellMock.hh"
#include "ScanChain.hh"
#include "gtest/gtest.h"
#include "utl/Logger.h"
namespace dft::test {
namespace {
TEST(TestScanArchitectHeuristic, ArchitectWithOneClockDomainNoMix)
{
utl::Logger* logger = new utl::Logger();
ScanArchitectConfig config;
config.setClockMixing(ScanArchitectConfig::ClockMixing::NoMix);
config.setMaxLength(10);
std::vector<std::unique_ptr<ScanCell>> scan_cells;
std::vector<std::string> scan_cell_names;
for (uint64_t i = 0; i < 20; ++i) {
std::stringstream ss;
ss << "scan_cell" << i;
scan_cell_names.push_back(ss.str());
scan_cells.push_back(std::make_unique<ScanCellMock>(
ss.str(),
std::make_unique<ClockDomain>("clk1", ClockEdge::Rising),
logger));
}
std::unique_ptr<ScanCellsBucket> scan_cells_bucket
= std::make_unique<ScanCellsBucket>(logger);
scan_cells_bucket->init(config, scan_cells);
std::unique_ptr<ScanArchitect> scan_architect
= ScanArchitect::ConstructScanScanArchitect(
config, std::move(scan_cells_bucket), logger);
scan_architect->init();
scan_architect->architect();
std::vector<std::unique_ptr<ScanChain>> scan_chains
= scan_architect->getScanChains();
// There should be 2 chains
EXPECT_EQ(scan_chains.size(), 2);
// All the scan cells should be in the chains
std::unordered_set<std::string_view> scan_cells_in_chains_names;
for (const std::unique_ptr<ScanChain>& scan_chain : scan_chains) {
EXPECT_FALSE(scan_chain->empty()); // All the chains should have cells
for (const auto& scan_cell : scan_chain->getScanCells()) {
scan_cells_in_chains_names.insert(scan_cell->getName());
}
}
for (const std::string& name : scan_cell_names) {
const bool test = scan_cells_in_chains_names.find(name)
!= scan_cells_in_chains_names.end();
EXPECT_TRUE(test); // Was the cell included?
}
}
TEST(TestScanArchitectHeuristic, ArchitectWithTwoClockDomainNoMix)
{
utl::Logger* logger = new utl::Logger();
ScanArchitectConfig config;
config.setClockMixing(ScanArchitectConfig::ClockMixing::NoMix);
config.setMaxLength(10);
std::vector<std::unique_ptr<ScanCell>> scan_cells;
std::vector<std::string> scan_cell_names;
uint64_t name_number = 0;
for (uint64_t i = 0; i < 20; ++i) {
std::stringstream ss;
ss << "scan_cell" << name_number;
++name_number;
scan_cell_names.push_back(ss.str());
scan_cells.push_back(std::make_unique<ScanCellMock>(
ss.str(),
std::make_unique<ClockDomain>("clk1", ClockEdge::Rising),
logger));
}
for (uint64_t i = 0; i < 15; ++i) {
std::stringstream ss;
ss << "scan_cell" << name_number;
++name_number;
scan_cell_names.push_back(ss.str());
scan_cells.push_back(std::make_unique<ScanCellMock>(
ss.str(),
std::make_unique<ClockDomain>("clk2", ClockEdge::Rising),
logger));
}
std::unique_ptr<ScanCellsBucket> scan_cells_bucket
= std::make_unique<ScanCellsBucket>(logger);
scan_cells_bucket->init(config, scan_cells);
std::unique_ptr<ScanArchitect> scan_architect
= ScanArchitect::ConstructScanScanArchitect(
config, std::move(scan_cells_bucket), logger);
scan_architect->init();
scan_architect->architect();
std::vector<std::unique_ptr<ScanChain>> scan_chains
= scan_architect->getScanChains();
// There should be 4 chains
EXPECT_EQ(scan_chains.size(), 4);
uint64_t total_bits = 0;
for (const auto& scan_chain : scan_chains) {
for (const auto& scan_cell : scan_chain->getScanCells()) {
total_bits += scan_cell->getBits();
}
}
EXPECT_EQ(total_bits, 20 + 15);
}
TEST(TestScanArchitectHeuristic, ArchitectWithTwoEdgesNoMix)
{
utl::Logger* logger = new utl::Logger();
ScanArchitectConfig config;
config.setClockMixing(ScanArchitectConfig::ClockMixing::NoMix);
config.setMaxLength(10);
std::vector<std::unique_ptr<ScanCell>> scan_cells;
std::vector<std::string> scan_cell_names;
uint64_t name_number = 0;
for (uint64_t i = 0; i < 20; ++i) {
std::stringstream ss;
ss << "scan_cell" << name_number;
++name_number;
scan_cell_names.push_back(ss.str());
scan_cells.push_back(std::make_unique<ScanCellMock>(
ss.str(),
std::make_unique<ClockDomain>("clk1", ClockEdge::Rising),
logger));
}
for (uint64_t i = 0; i < 15; ++i) {
std::stringstream ss;
ss << "scan_cell" << name_number;
++name_number;
scan_cell_names.push_back(ss.str());
scan_cells.push_back(std::make_unique<ScanCellMock>(
ss.str(),
std::make_unique<ClockDomain>("clk1", ClockEdge::Falling),
logger));
}
std::unique_ptr<ScanCellsBucket> scan_cells_bucket
= std::make_unique<ScanCellsBucket>(logger);
scan_cells_bucket->init(config, scan_cells);
std::unique_ptr<ScanArchitect> scan_architect
= ScanArchitect::ConstructScanScanArchitect(
config, std::move(scan_cells_bucket), logger);
scan_architect->init();
scan_architect->architect();
std::vector<std::unique_ptr<ScanChain>> scan_chains
= scan_architect->getScanChains();
// There should be 4 chains
EXPECT_EQ(scan_chains.size(), 4);
uint64_t total_bits_rising = 0;
uint64_t total_bits_falling = 0;
for (const auto& scan_chain : scan_chains) {
for (const auto& scan_cell : scan_chain->getScanCells()) {
switch (scan_cell->getClockDomain().getClockEdge()) {
case ClockEdge::Falling:
total_bits_falling += scan_cell->getBits();
break;
case ClockEdge::Rising:
total_bits_rising += scan_cell->getBits();
break;
}
}
}
EXPECT_EQ(total_bits_rising, 20);
EXPECT_EQ(total_bits_falling, 15);
}
} // namespace
} // namespace dft::test
|