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

Apply 'make format'

This commit is contained in:
github action 2026-05-30 19:36:22 +00:00
parent 57fa98e52c
commit e2063e7ac0
1 changed files with 15 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
src/V3VariableOrder.cpp
View File

@ -148,23 +148,23 @@ class VariableOrder final {
varps.clear();
// Helper function to sort given vector, then append to 'varps'
const auto sortAndAppend = [this, &varps](std::vector<AstVar*>& subVarps,
bool alignFirst) {
simpleSortVars(subVarps);
bool aligned = !alignFirst;
for (AstVar* const varp : subVarps) {
if (!aligned && !varp->isStatic()) {
varp->mtaskCacheLineAlign(true);
V3Stats::addStatSum("VariableOrder, MTask aligned group starts", 1);
aligned = true;
}
varps.push_back(varp);
}
};
const auto sortAndAppend
= [this, &varps](std::vector<AstVar*>& subVarps, bool alignFirst) {
simpleSortVars(subVarps);
bool aligned = !alignFirst;
for (AstVar* const varp : subVarps) {
if (!aligned && !varp->isStatic()) {
varp->mtaskCacheLineAlign(true);
V3Stats::addStatSum("VariableOrder, MTask aligned group starts", 1);
aligned = true;
}
varps.push_back(varp);
}
};
// Sort non-empty MTask affinity groups in the map's deterministic key order. This keeps
// memory linear in the number of affinity groups, unlike the old complete pairwise-distance
// ordering.
// memory linear in the number of affinity groups, unlike the old complete
// pairwise-distance ordering.
size_t affinityGroups = 0;
for (auto& pair : m2v) {
if (emptyAffinity(pair.first)) continue;