riscv
/
yosys
mirror of https://github.com/YosysHQ/yosys.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Since $_ANDNOT_ is not symmetric, do not sort leaves

This commit is contained in:
Eddie Hung 2019-08-12 11:17:15 -07:00
parent 78b30bbb11
commit e4a0971581
1 changed files with 4 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
passes/techmap/extract_fa.cc
View File

@ -153,12 +153,10 @@ struct ExtractFaWorker
}
}
void check_partition(SigBit root, pool<SigBit> &leaves)
void check_partition(SigBit root, const pool<SigBit> &leaves)
{
if (config.enable_ha && GetSize(leaves) == 2)
{
leaves.sort();
SigBit A = SigSpec(leaves)[0];
SigBit B = SigSpec(leaves)[1];
@ -196,8 +194,6 @@ struct ExtractFaWorker
if (config.enable_fa && GetSize(leaves) == 3)
{
leaves.sort();
SigBit A = SigSpec(leaves)[0];
SigBit B = SigSpec(leaves)[1];
SigBit C = SigSpec(leaves)[2];
@ -237,7 +233,7 @@ struct ExtractFaWorker
}
}
void find_partitions(SigBit root, pool<SigBit> &leaves, pool<pool<SigBit>> &cache, int maxdepth, int maxbreadth)
void find_partitions(SigBit root, const pool<SigBit> &leaves, pool<const pool<SigBit>> &cache, int maxdepth, int maxbreadth)
{
if (cache.count(leaves))
return;
@ -293,8 +289,8 @@ struct ExtractFaWorker
continue;
SigBit root = it.first;
pool<SigBit> leaves = { root };
pool<pool<SigBit>> cache;
const pool<SigBit> leaves = { root };
pool<const pool<SigBit>> cache;
if (config.verbose)
log(" checking %s\n", log_signal(it.first));