luke/verilator
1
0
Fork 0
mirror of https://github.com/verilator/verilator.git synced 2026-09-02 18:58:51 +02:00
Code Issues Packages Projects Releases Wiki Activity

Internals: Use and enforce class final for ~5% performance boost.

Browse Source
This commit is contained in:
Wilson Snyder
2020-11-18 21:32:16 -05:00
parent c0888c1b0f
commit b6ded59c2b
224 changed files with 976 additions and 949 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/V3GraphAcyc.cpp
+3 -3
View File
@@ -29,7 +29,7 @@
// Algorithms - acyclic
// Break the minimal number of backward edges to make the graph acyclic
class GraphAcycVertex : public V3GraphVertex {
class GraphAcycVertex final : public V3GraphVertex {
// user() is used for various sub-algorithm pieces
V3GraphVertex* m_origVertexp; // Pointer to first vertex this represents
protected:
@@ -53,7 +53,7 @@ public:
//--------------------------------------------------------------------
class GraphAcycEdge : public V3GraphEdge {
class GraphAcycEdge final : public V3GraphEdge {
// userp() is always used to point to the head original graph edge
private:
typedef std::list<V3GraphEdge*> OrigEdgeList; // List of orig edges, see also GraphAcyc's decl
@@ -87,7 +87,7 @@ struct GraphAcycEdgeCmp {
//--------------------------------------------------------------------
// CLASSES
class GraphAcyc {
class GraphAcyc final {
private:
typedef std::list<V3GraphEdge*>
OrigEdgeList; // List of orig edges, see also GraphAcycEdge's decl