2020-06-06 15:37:29 -05:00
|
|
|
/*
|
|
|
|
* yosys -- Yosys Open SYnthesis Suite
|
|
|
|
*
|
|
|
|
* Copyright (C) 2020 whitequark <whitequark@whitequark.org>
|
|
|
|
*
|
|
|
|
* Permission to use, copy, modify, and/or distribute this software for any
|
|
|
|
* purpose with or without fee is hereby granted.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
|
|
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
|
|
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
|
|
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
|
|
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef CXXRTL_VCD_H
|
|
|
|
#define CXXRTL_VCD_H
|
|
|
|
|
|
|
|
#include <backends/cxxrtl/cxxrtl.h>
|
|
|
|
|
|
|
|
namespace cxxrtl {
|
|
|
|
|
|
|
|
class vcd_writer {
|
|
|
|
struct variable {
|
|
|
|
size_t ident;
|
|
|
|
size_t width;
|
|
|
|
chunk_t *curr;
|
2020-06-06 16:55:53 -05:00
|
|
|
size_t prev_off;
|
2020-06-06 15:37:29 -05:00
|
|
|
};
|
|
|
|
|
|
|
|
std::vector<std::string> current_scope;
|
|
|
|
std::vector<variable> variables;
|
2020-06-06 16:55:53 -05:00
|
|
|
std::vector<chunk_t> cache;
|
2020-06-08 11:36:26 -05:00
|
|
|
std::map<chunk_t*, size_t> aliases;
|
2020-06-06 15:37:29 -05:00
|
|
|
bool streaming = false;
|
|
|
|
|
|
|
|
void emit_timescale(unsigned number, const std::string &unit) {
|
|
|
|
assert(!streaming);
|
|
|
|
assert(number == 1 || number == 10 || number == 100);
|
|
|
|
assert(unit == "s" || unit == "ms" || unit == "us" ||
|
|
|
|
unit == "ns" || unit == "ps" || unit == "fs");
|
|
|
|
buffer += "$timescale " + std::to_string(number) + " " + unit + " $end\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
void emit_scope(const std::vector<std::string> &scope) {
|
|
|
|
assert(!streaming);
|
|
|
|
while (current_scope.size() > scope.size() ||
|
|
|
|
(current_scope.size() > 0 &&
|
|
|
|
current_scope[current_scope.size() - 1] != scope[current_scope.size() - 1])) {
|
|
|
|
buffer += "$upscope $end\n";
|
|
|
|
current_scope.pop_back();
|
|
|
|
}
|
|
|
|
while (current_scope.size() < scope.size()) {
|
|
|
|
buffer += "$scope module " + scope[current_scope.size()] + " $end\n";
|
|
|
|
current_scope.push_back(scope[current_scope.size()]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void emit_ident(size_t ident) {
|
|
|
|
do {
|
|
|
|
buffer += '!' + ident % 94; // "base94"
|
|
|
|
ident /= 94;
|
|
|
|
} while (ident != 0);
|
|
|
|
}
|
|
|
|
|
2020-06-11 08:31:16 -05:00
|
|
|
void emit_var(const variable &var, const std::string &type, const std::string &name,
|
|
|
|
size_t lsb_at, bool multipart) {
|
2020-06-06 15:37:29 -05:00
|
|
|
assert(!streaming);
|
|
|
|
buffer += "$var " + type + " " + std::to_string(var.width) + " ";
|
|
|
|
emit_ident(var.ident);
|
2020-06-11 08:31:16 -05:00
|
|
|
buffer += " " + name;
|
|
|
|
if (multipart || name.back() == ']' || lsb_at != 0) {
|
|
|
|
if (var.width == 1)
|
|
|
|
buffer += " [" + std::to_string(lsb_at) + "]";
|
|
|
|
else
|
|
|
|
buffer += " [" + std::to_string(lsb_at + var.width - 1) + ":" + std::to_string(lsb_at) + "]";
|
|
|
|
}
|
|
|
|
buffer += " $end\n";
|
2020-06-06 15:37:29 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
void emit_enddefinitions() {
|
|
|
|
assert(!streaming);
|
|
|
|
buffer += "$enddefinitions $end\n";
|
|
|
|
streaming = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void emit_time(uint64_t timestamp) {
|
|
|
|
assert(streaming);
|
|
|
|
buffer += "#" + std::to_string(timestamp) + "\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
void emit_scalar(const variable &var) {
|
|
|
|
assert(streaming);
|
|
|
|
assert(var.width == 1);
|
|
|
|
buffer += (*var.curr ? '1' : '0');
|
|
|
|
emit_ident(var.ident);
|
|
|
|
buffer += '\n';
|
|
|
|
}
|
|
|
|
|
|
|
|
void emit_vector(const variable &var) {
|
|
|
|
assert(streaming);
|
|
|
|
buffer += 'b';
|
|
|
|
for (size_t bit = var.width - 1; bit != (size_t)-1; bit--) {
|
|
|
|
bool bit_curr = var.curr[bit / (8 * sizeof(chunk_t))] & (1 << (bit % (8 * sizeof(chunk_t))));
|
|
|
|
buffer += (bit_curr ? '1' : '0');
|
|
|
|
}
|
|
|
|
buffer += ' ';
|
|
|
|
emit_ident(var.ident);
|
|
|
|
buffer += '\n';
|
|
|
|
}
|
|
|
|
|
2020-06-10 09:39:45 -05:00
|
|
|
const variable ®ister_variable(size_t width, chunk_t *curr, bool constant = false) {
|
2020-06-08 11:36:26 -05:00
|
|
|
if (aliases.count(curr)) {
|
|
|
|
return variables[aliases[curr]];
|
|
|
|
} else {
|
|
|
|
const size_t chunks = (width + (sizeof(chunk_t) * 8 - 1)) / (sizeof(chunk_t) * 8);
|
|
|
|
aliases[curr] = variables.size();
|
2020-06-10 09:39:45 -05:00
|
|
|
if (constant) {
|
2020-06-08 12:38:11 -05:00
|
|
|
variables.emplace_back(variable { variables.size(), width, curr, (size_t)-1 });
|
|
|
|
} else {
|
|
|
|
variables.emplace_back(variable { variables.size(), width, curr, cache.size() });
|
|
|
|
cache.insert(cache.end(), &curr[0], &curr[chunks]);
|
|
|
|
}
|
2020-06-08 11:36:26 -05:00
|
|
|
return variables.back();
|
|
|
|
}
|
2020-06-06 16:55:53 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
bool test_variable(const variable &var) {
|
2020-06-08 12:38:11 -05:00
|
|
|
if (var.prev_off == (size_t)-1)
|
2020-06-10 09:39:45 -05:00
|
|
|
return false; // constant
|
2020-06-06 16:55:53 -05:00
|
|
|
const size_t chunks = (var.width + (sizeof(chunk_t) * 8 - 1)) / (sizeof(chunk_t) * 8);
|
|
|
|
if (std::equal(&var.curr[0], &var.curr[chunks], &cache[var.prev_off])) {
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
std::copy(&var.curr[0], &var.curr[chunks], &cache[var.prev_off]);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-06-06 15:37:29 -05:00
|
|
|
static std::vector<std::string> split_hierarchy(const std::string &hier_name) {
|
|
|
|
std::vector<std::string> hierarchy;
|
|
|
|
size_t prev = 0;
|
|
|
|
while (true) {
|
2020-06-09 06:05:35 -05:00
|
|
|
size_t curr = hier_name.find_first_of(' ', prev);
|
|
|
|
if (curr == std::string::npos) {
|
|
|
|
hierarchy.push_back(hier_name.substr(prev));
|
2020-06-06 15:37:29 -05:00
|
|
|
break;
|
2020-06-09 06:05:35 -05:00
|
|
|
} else {
|
|
|
|
hierarchy.push_back(hier_name.substr(prev, curr - prev));
|
|
|
|
prev = curr + 1;
|
|
|
|
}
|
2020-06-06 15:37:29 -05:00
|
|
|
}
|
|
|
|
return hierarchy;
|
|
|
|
}
|
|
|
|
|
|
|
|
public:
|
|
|
|
std::string buffer;
|
|
|
|
|
|
|
|
void timescale(unsigned number, const std::string &unit) {
|
|
|
|
emit_timescale(number, unit);
|
|
|
|
}
|
|
|
|
|
2020-06-11 08:31:16 -05:00
|
|
|
void add(const std::string &hier_name, const debug_item &item, bool multipart = false) {
|
2020-06-06 15:37:29 -05:00
|
|
|
std::vector<std::string> scope = split_hierarchy(hier_name);
|
|
|
|
std::string name = scope.back();
|
|
|
|
scope.pop_back();
|
|
|
|
|
|
|
|
emit_scope(scope);
|
|
|
|
switch (item.type) {
|
|
|
|
// Not the best naming but oh well...
|
|
|
|
case debug_item::VALUE:
|
2020-06-11 08:31:16 -05:00
|
|
|
emit_var(register_variable(item.width, item.curr, /*constant=*/item.next == nullptr),
|
|
|
|
"wire", name, item.lsb_at, multipart);
|
2020-06-06 15:37:29 -05:00
|
|
|
break;
|
|
|
|
case debug_item::WIRE:
|
2020-06-11 08:31:16 -05:00
|
|
|
emit_var(register_variable(item.width, item.curr),
|
|
|
|
"reg", name, item.lsb_at, multipart);
|
2020-06-06 15:37:29 -05:00
|
|
|
break;
|
|
|
|
case debug_item::MEMORY: {
|
|
|
|
const size_t stride = (item.width + (sizeof(chunk_t) * 8 - 1)) / (sizeof(chunk_t) * 8);
|
|
|
|
for (size_t index = 0; index < item.depth; index++) {
|
|
|
|
chunk_t *nth_curr = &item.curr[stride * index];
|
|
|
|
std::string nth_name = name + '[' + std::to_string(index) + ']';
|
2020-06-11 08:31:16 -05:00
|
|
|
emit_var(register_variable(item.width, nth_curr),
|
|
|
|
"reg", nth_name, item.lsb_at, multipart);
|
2020-06-06 15:37:29 -05:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
2020-06-10 09:39:45 -05:00
|
|
|
case debug_item::ALIAS:
|
|
|
|
// Like VALUE, but, even though `item.next == nullptr` always holds, the underlying value
|
|
|
|
// can actually change, and must be tracked. In most cases the VCD identifier will be
|
|
|
|
// unified with the aliased reg, but we should handle the case where only the alias is
|
|
|
|
// added to the VCD writer, too.
|
2020-06-11 08:31:16 -05:00
|
|
|
emit_var(register_variable(item.width, item.curr),
|
|
|
|
"wire", name, item.lsb_at, multipart);
|
2020-06-10 09:39:45 -05:00
|
|
|
break;
|
2020-06-06 15:37:29 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
template<class Filter>
|
|
|
|
void add(const debug_items &items, const Filter &filter) {
|
|
|
|
// `debug_items` is a map, so the items are already sorted in an order optimal for emitting
|
|
|
|
// VCD scope sections.
|
2020-06-11 08:31:16 -05:00
|
|
|
for (auto &it : items.table)
|
|
|
|
for (auto &part : it.second)
|
|
|
|
if (filter(it.first, part))
|
|
|
|
add(it.first, part, it.second.size() > 1);
|
2020-06-06 15:37:29 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
void add(const debug_items &items) {
|
|
|
|
this->template add(items, [](const std::string &, const debug_item &) {
|
|
|
|
return true;
|
|
|
|
});
|
|
|
|
}
|
|
|
|
|
|
|
|
void add_without_memories(const debug_items &items) {
|
|
|
|
this->template add(items, [](const std::string &, const debug_item &item) {
|
2020-06-10 09:39:45 -05:00
|
|
|
return item.type != debug_item::MEMORY;
|
2020-06-06 15:37:29 -05:00
|
|
|
});
|
|
|
|
}
|
|
|
|
|
|
|
|
void sample(uint64_t timestamp) {
|
2020-06-06 16:55:53 -05:00
|
|
|
bool first_sample = !streaming;
|
|
|
|
if (first_sample) {
|
2020-06-06 15:37:29 -05:00
|
|
|
emit_scope({});
|
|
|
|
emit_enddefinitions();
|
|
|
|
}
|
|
|
|
emit_time(timestamp);
|
2020-06-06 16:55:53 -05:00
|
|
|
for (auto var : variables)
|
|
|
|
if (test_variable(var) || first_sample) {
|
|
|
|
if (var.width == 1)
|
|
|
|
emit_scalar(var);
|
|
|
|
else
|
|
|
|
emit_vector(var);
|
|
|
|
}
|
2020-06-06 15:37:29 -05:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|