luke
/
verilator
mirror of https://github.com/verilator/verilator.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

[#72179] fix implementation of emitting words

This commit is contained in:
Mateusz Gancarz 2025-02-10 15:01:00 +01:00
parent 5ee6fc8191
commit 51af6ed413
1 changed files with 14 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
include/verilated_saif_c.cpp
View File

@ -563,25 +563,32 @@ void VerilatedSaifBuffer::emitQData(uint32_t code, QData newval, int bits) {
VL_ATTR_ALWINLINE VL_ATTR_ALWINLINE
void VerilatedSaifBuffer::emitWData(uint32_t code, const WData* newvalp, int bits) { void VerilatedSaifBuffer::emitWData(uint32_t code, const WData* newvalp, int bits) {
const int bitsInMSW = VL_BITBIT_E(bits) ? VL_BITBIT_E(bits) : VL_EDATASIZE;
auto& activity = m_owner.m_activity[m_owner.m_codeToActivity[code]]; auto& activity = m_owner.m_activity[m_owner.m_codeToActivity[code]];
fprintf(stdout, "Emitting wide - name: %s, code: %d, bits: %d, activity.width: %d\n", activity.name, code, bits, activity.width); fprintf(stdout, "Emitting words - name: %s, code: %d, bits: %d, activity.width: %d\n", activity.name, code, bits, activity.width);
if (bits > activity.width) { if (bits > activity.width) {
fprintf(stdout, "Trying to emit more bits than activity width\n"); fprintf(stdout, "Trying to emit more bits than activity width\n");
} }
const int bitsInMSW = VL_BITBIT_E(bits) ? VL_BITBIT_E(bits) : VL_EDATASIZE;
int numOfWords = VL_WORDS_I(bits);
fprintf(stdout, "Number of bits in most significant word: %d\n", bitsInMSW);
fprintf(stdout, "Number of bits in a word: %d\n", VL_EDATASIZE);
fprintf(stdout, "Number of words: %d\n", numOfWords);
auto dt = m_owner.m_time - activity.lastTime; auto dt = m_owner.m_time - activity.lastTime;
//NOTE: is (i = bitsInMSW; i < bitsInMSW) intentional for (std::size_t i = 0; i < bitsInMSW; ++i) {
for (size_t i = bitsInMSW; i < bitsInMSW; i++) {
activity.bits[i].aggregateVal(dt, (newvalp[0] >> VL_BITBIT_E(i)) & 1); activity.bits[i].aggregateVal(dt, (newvalp[0] >> VL_BITBIT_E(i)) & 1);
} }
for (size_t i = bitsInMSW; i < activity.width; i++) {
size_t j = VL_WORDS_I(i); for (std::size_t i = bitsInMSW; i < activity.width; ++i) {
activity.bits[i].aggregateVal(dt, (newvalp[j] >> VL_BITBIT_E(i)) & 1); size_t wordIndex = VL_WORDS_I(i);
activity.bits[i].aggregateVal(dt, (newvalp[wordIndex] >> VL_BITBIT_E(i)) & 1);
} }
activity.lastTime = m_owner.m_time; activity.lastTime = m_owner.m_time;
} }