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

Performance optimization in subcircuit mining

This commit is contained in:
Clifford Wolf 2013-03-03 23:17:58 +01:00
parent 441e5fbfca
commit f9a5fbf283
1 changed files with 47 additions and 26 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

73
libs/subcircuit/subcircuit.cc
View File

@ -1316,37 +1316,58 @@ class SubCircuit::SolverWorker
if (verbose) if (verbose)
my_printf("\nMining for frequent subcircuits of size %d using increment %d:\n", oldSetSize+increment, increment); my_printf("\nMining for frequent subcircuits of size %d using increment %d:\n", oldSetSize+increment, increment);
std::set<NodeSet> usedSets;
for (auto &it : poolPerGraph) for (auto &it : poolPerGraph)
for (int idx1 = 0; idx1 < int(it.second.size()); idx1++)
for (int idx2 = idx1; idx2 < int(it.second.size()); idx2++)
{ {
if (it.second[idx1]->extendCandidate(*it.second[idx2]) != increment) std::map<int, std::set<int>> node2sets;
continue; std::set<NodeSet> usedSets;
NodeSet mergedSet = *it.second[idx1]; for (int idx = 0; idx < int(it.second.size()); idx++) {
mergedSet.extend(*it.second[idx2]); for (int node : it.second[idx]->nodes)
node2sets[node].insert(idx);
if (usedSets.count(mergedSet) > 0)
continue;
const std::string &graphId = it.first;
const auto &graph = graphData[it.first].graph;
int matches = testForMining(results, usedSets, nextPool, mergedSet, graphId, graph, minNodes, minMatches, limitMatchesPerGraph);
if (verbose) {
my_printf("Set %s[", graphId.c_str());
bool first = true;
for (int nodeIdx : mergedSet.nodes) {
my_printf("%s%s", first ? "" : ",", graph.nodes[nodeIdx].nodeId.c_str());
first = false;
}
my_printf("] -> %d%s\n", matches, matches < minMatches ? " *purge*" : "");
} }
if (minMatches <= matches) for (int idx1 = 0; idx1 < int(it.second.size()); idx1++)
groupCounter++; {
std::set<int> idx2set;
for (int node : it.second[idx1]->nodes)
for (int idx2 : node2sets[node])
if (idx2 > idx1)
idx2set.insert(idx2);
for (int idx2 : idx2set)
{
if (it.second[idx1]->extendCandidate(*it.second[idx2]) != increment)
continue;
NodeSet mergedSet = *it.second[idx1];
mergedSet.extend(*it.second[idx2]);
if (usedSets.count(mergedSet) > 0)
continue;
const std::string &graphId = it.first;
const auto &graph = graphData[it.first].graph;
if (verbose) {
my_printf("Set %s[", graphId.c_str());
bool first = true;
for (int nodeIdx : mergedSet.nodes) {
my_printf("%s%s", first ? "" : ",", graph.nodes[nodeIdx].nodeId.c_str());
first = false;
}
my_printf("] ->");
}
int matches = testForMining(results, usedSets, nextPool, mergedSet, graphId, graph, minNodes, minMatches, limitMatchesPerGraph);
if (verbose)
my_printf(" %d%s\n", matches, matches < minMatches ? " *purge*" : "");
if (minMatches <= matches)
groupCounter++;
}
}
} }
pool.swap(nextPool); pool.swap(nextPool);