luke/verilator
1
0
Fork 0
mirror of https://github.com/verilator/verilator.git synced 2026-10-06 10:03:44 +02:00
Code Issues Packages Projects Releases Wiki Activity

Internals: Template GraphAlg to allow const. No functional change.

Browse Source
This commit is contained in:
Wilson Snyder
2018-07-09 19:15:46 -04:00
parent 84562f98de
commit de81593e98
3 changed files with 19 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/V3GraphAlg.cpp
+6 -6
View File
@@ -74,7 +74,7 @@ void V3Graph::deleteCutableOnlyEdges() {
//######################################################################
// Algorithms - weakly connected components
class GraphRemoveRedundant : GraphAlg {
class GraphRemoveRedundant : GraphAlg<> {
bool m_sumWeights; ///< Sum, rather then maximize weights
private:
void main() {
@@ -138,7 +138,7 @@ void V3Graph::removeRedundantEdgesSum(V3EdgeFuncP edgeFuncp) {
//######################################################################
// Algorithms - weakly connected components
class GraphAlgWeakly : GraphAlg {
class GraphAlgWeakly : GraphAlg<> {
private:
void main() {
// Initialize state
@@ -183,7 +183,7 @@ void V3Graph::weaklyConnected(V3EdgeFuncP edgeFuncp) {
//######################################################################
// Algorithms - strongly connected components
class GraphAlgStrongly : GraphAlg {
class GraphAlgStrongly : GraphAlg<> {
private:
uint32_t m_currentDfs; // DFS count
std::vector<V3GraphVertex*> m_callTrace; // List of everything we hit processing so far
@@ -269,7 +269,7 @@ void V3Graph::stronglyConnected(V3EdgeFuncP edgeFuncp) {
//######################################################################
// Algorithms - ranking
class GraphAlgRank : GraphAlg {
class GraphAlgRank : GraphAlg<> {
private:
void main() {
// Rank each vertex, ignoring cutable edges
@@ -325,7 +325,7 @@ void V3Graph::rank(V3EdgeFuncP edgeFuncp) {
//######################################################################
// Algorithms - ranking
class GraphAlgRLoops : GraphAlg {
class GraphAlgRLoops : GraphAlg<> {
private:
std::vector<V3GraphVertex*> m_callTrace; // List of everything we hit processing so far
bool m_done; // Exit algorithm
@@ -381,7 +381,7 @@ void V3Graph::reportLoops(V3EdgeFuncP edgeFuncp, V3GraphVertex* vertexp) {
//######################################################################
// Algorithms - subtrees
class GraphAlgSubtrees : GraphAlg {
class GraphAlgSubtrees : GraphAlg<> {
private:
V3Graph* m_loopGraphp;