Commentary - Spelling fixes

README.pod

@@ -32,7 +32,7 @@ The resulting executable will perform the actual simulation.
 
 Verilator is developed and has primary testing on Ubuntu.  Versions have
 also built on Redhat Linux, Macs OS-X, HPUX and Solaris.  It should run
-with minor porting on any Linix-ish platform.  Verilator also works on
+with minor porting on any Linux-ish platform.  Verilator also works on
 Windows under Cygwin, and Windows under MinGW (gcc -mno-cygwin).  Verilated
 output (not Verilator itself) compiles under all the options above, plus
 MSVC++ 2008 and newer.
@@ -100,7 +100,7 @@ To use Verilator you will need the C<perl>, C<make> (or C<gmake>), and
 C<g++> (or C<clang>) packages. To compile Verilator in addition to the above you need the C<flex>,
 C<bison> and C<texi2html> packages installed.
 
-  sudo apt-get install git make autoconf g++ flex bisonz   # First time prerequisites
+  sudo apt-get install git make autoconf g++ flex bison   # First time prerequisites
   sudo apt-get install libgz   # Non-Ubuntu (ignore if gives error)
   sudo apt-get install libfl2 libfl-dev zlibc zlib1g zlib1g-dev  # Ubuntu only (ignore if gives error)
 
@@ -166,7 +166,7 @@ needed files.
 
 =item 2.
 
-You may eventually be instaling onto a project/company-wide "CAD" tools
+You may eventually be installing onto a project/company-wide "CAD" tools
 disk that may support multiple versions of every tool.
 
     unset VERILATOR_ROOT      # if your shell is bash

src/V3Active.cpp

@@ -140,7 +140,7 @@ public:
         return activep;
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     ActiveNamer() {
         m_scopep = NULL;
         m_iActivep = NULL;
@@ -214,7 +214,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     ActiveDlyVisitor(AstNode* nodep, CheckType check) {
         m_alwaysp = nodep;
         m_check = check;
@@ -423,7 +423,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit ActiveVisitor(AstNetlist* nodep) {
         m_scopeFinalp = NULL;
         m_itemCombo = false;

src/V3ActiveTop.cpp

@@ -139,7 +139,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit ActiveTopVisitor(AstNetlist* nodep) {
         m_topscopep = NULL;
         iterate(nodep);

src/V3Ast.h

@@ -1198,7 +1198,7 @@ public:
     void        debugTreeChange(const char* prefix, int lineno, bool next);
 
 protected:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     AstNode() {init(); }
     explicit AstNode(FileLine* fileline) {init(); m_fileline = fileline; }
     virtual AstNode* clone() = 0;  // Generally, cloneTree is what you want instead

src/V3Begin.cpp

@@ -227,7 +227,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     BeginVisitor(AstNetlist* nodep, BeginState* statep) {
         m_statep = statep;
         m_modp = NULL;
@@ -276,7 +276,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     BeginRelinkVisitor(AstNetlist* nodep, BeginState*) {
         iterate(nodep);
     }

src/V3Branch.cpp

@@ -122,7 +122,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit BranchVisitor(AstNetlist* nodep) {
         reset();
         iterateChildren(nodep);

src/V3Broken.cpp

@@ -179,7 +179,7 @@ public:
         }
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     BrokenTable() {}
     virtual ~BrokenTable() {}
 };
@@ -213,7 +213,7 @@ private:
         processAndIterate(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit BrokenMarkVisitor(AstNetlist* nodep) {
         iterate(nodep);
     }
@@ -269,7 +269,7 @@ private:
         processAndIterate(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit BrokenCheckVisitor(AstNetlist* nodep) {
         iterate(nodep);
     }

src/V3Case.cpp

@@ -110,7 +110,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit CaseLintVisitor(AstNodeCase* nodep) {
         m_caseExprp = NULL;
         iterate(nodep);
@@ -474,7 +474,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit CaseVisitor(AstNetlist* nodep) {
         m_caseWidth = 0;
         m_caseItems = 0;

src/V3Cast.cpp

@@ -170,7 +170,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit CastVisitor(AstNetlist* nodep) {
         iterate(nodep);
     }

src/V3Cdc.cpp

@@ -154,7 +154,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     CdcDumpVisitor(AstNode* nodep, std::ofstream* ofp, const string& prefix) {
         m_ofp = ofp;
         m_prefix = prefix;
@@ -181,7 +181,7 @@ private:
         }
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit CdcWidthVisitor(AstNode* nodep) {
         m_maxLineno = 0;
         m_maxFilenameLen = 0;
@@ -729,7 +729,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit CdcVisitor(AstNode* nodep) {
         m_logicVertexp = NULL;
         m_scopep = NULL;

src/V3Changed.cpp

@@ -193,7 +193,7 @@ private:
                        <<m_vscp->varp()->prettyNameQ());
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     ChangedInsertVisitor(AstVarScope* vscp, ChangedState* statep) {
         m_statep = statep;
         m_vscp = vscp;
@@ -296,7 +296,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     ChangedVisitor(AstNetlist* nodep, ChangedState* statep) {
         m_statep = statep;
         iterate(nodep);

src/V3Clean.cpp

@@ -285,7 +285,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit CleanVisitor(AstNetlist* nodep) {
         m_modp = NULL;
         iterate(nodep);

src/V3Clock.cpp

@@ -431,7 +431,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit ClockVisitor(AstNetlist* nodep) {
         m_modp = NULL;
         m_evalFuncp = NULL;

src/V3Combine.cpp

@@ -461,7 +461,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit CombineVisitor(AstNetlist* nodep) {
         m_state = STATE_IDLE;
         m_modp = NULL;

src/V3Const.cpp

@@ -53,7 +53,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit ConstVarMarkVisitor(AstNode* nodep) {
         AstNode::user4ClearTree();  // Check marked InUse before we're called
         iterate(nodep);
@@ -75,7 +75,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit ConstVarFindVisitor(AstNode* nodep) {
         m_found = false;
         iterateAndNextNull(nodep);
@@ -1268,7 +1268,7 @@ private:
     }
 
     void swapSides(AstNodeBiCom* nodep) {
-        // COMMUNATIVE({a},CONST) -> COMMUNATIVE(CONST,{a})
+        // COMMUTATIVE({a},CONST) -> COMMUTATIVE(CONST,{a})
         // This simplifies later optimizations
         AstNode* lhsp = nodep->lhsp()->unlinkFrBackWithNext();
         AstNode* rhsp = nodep->rhsp()->unlinkFrBackWithNext();
@@ -1597,7 +1597,7 @@ private:
                             if (initarp->defaultp()) {
                                 itemp = initarp->defaultp();
                             } else {
-                                initarp->v3fatalSrc("Not enough values in array initalizement");
+                                initarp->v3fatalSrc("Not enough values in array initialization");
                             }
                         }
                     }
@@ -2518,7 +2518,7 @@ public:
         PROC_CPP
     };
 
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit ConstVisitor(ProcMode pmode) {
         m_params = false;
         m_required = false;

src/V3Coverage.cpp

@@ -380,7 +380,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit CoverageVisitor(AstNetlist* rootp) {
         // Operate on all modules
         m_checkBlock = true;

src/V3CoverageJoin.cpp

@@ -119,7 +119,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit CoverageJoinVisitor(AstNetlist* nodep) {
         iterate(nodep);
     }

src/V3Delayed.cpp

@@ -461,7 +461,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit DelayedVisitor(AstNetlist* nodep) {
         m_inDly = false;
         m_activep = NULL;

src/V3Depth.cpp

@@ -157,7 +157,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit DepthVisitor(AstNetlist* nodep) {
         m_modp = NULL;
         m_funcp = NULL;

src/V3DepthBlock.cpp

@@ -123,7 +123,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit DepthBlockVisitor(AstNetlist* nodep) {
         m_modp = NULL;
         m_funcp = NULL;

src/V3EmitC.cpp

@@ -1723,7 +1723,7 @@ void EmitCImp::emitVarReset(AstVar* varp) {
             for (AstNode* itemp = initarp->initsp(); itemp; ++pos, itemp=itemp->nextp()) {
                 int index = initarp->posIndex(pos);
                 UASSERT_OBJ(initarp->defaultp() || index==pos, initarp,
-                            "Not enough values in array initalizement");
+                            "Not enough values in array initialization");
                 emitSetVarConstant(varp->name()+"["+cvtToStr(index)+"]", VN_CAST(itemp, Const));
             }
         } else {

src/V3EmitCBase.h

@@ -105,7 +105,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit EmitCBaseCounterVisitor(AstNode* nodep) {
         m_count = 0;
         iterate(nodep);

src/V3Expand.cpp

@@ -956,7 +956,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit ExpandVisitor(AstNetlist* nodep) {
         m_stmtp = NULL;
         iterate(nodep);

src/V3Gate.cpp

@@ -217,7 +217,7 @@ private:
         } else {
             if (m_rhsVarRefs.size()>1) {
                 AstNodeVarRef* lastRefp = m_rhsVarRefs.back();
-                if (0) {  // Diable the multiple-input optimization
+                if (0) {  // Disable the multiple-input optimization
                     clearSimple(">1 rhs varRefs");
                 } else {
                     if (m_buffersOnly) clearSimple(">1 rhs varRefs");
@@ -269,7 +269,7 @@ private:
         else iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     GateOkVisitor(AstNode* nodep, bool buffersOnly, bool dedupe) {
         m_isSimple = true;
         m_substTreep = NULL;
@@ -523,7 +523,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit GateVisitor(AstNode* nodep) {
         AstNode::user1ClearTree();
         m_logicVertexp = NULL;
@@ -881,7 +881,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     virtual ~GateElimVisitor() {}
     GateElimVisitor(AstNode* nodep, AstVarScope* varscp, AstNode* replaceTreep,
                     GateDedupeVarVisitor* varVisp) {
@@ -1097,7 +1097,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     GateDedupeVarVisitor() {
         m_assignp = NULL;
         m_ifCondp = NULL;
@@ -1429,7 +1429,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     GateConcatVisitor() {
         m_vscp = NULL;
         m_offset = 0;
@@ -1616,7 +1616,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit GateDeassignVisitor(AstNode* nodep) {
         iterate(nodep);
     }

src/V3Hashed.cpp

@@ -96,7 +96,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit HashedVisitor(AstNode* nodep) {
         m_cacheInUser4 = true;
         nodeHashIterate(nodep);

src/V3Inline.cpp

@@ -212,7 +212,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit InlineMarkVisitor(AstNode* nodep) {
         m_modp = NULL;
         iterate(nodep);
@@ -251,7 +251,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit InlineCollectVisitor(AstNodeModule* nodep) {  // passed OLD module, not new one
         iterate(nodep);
     }
@@ -462,7 +462,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     InlineRelinkVisitor(AstNodeModule* cloneModp, AstNodeModule* oldModp, AstCell* cellp) {
         m_modp = oldModp;
         m_cellp = cellp;
@@ -603,7 +603,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit InlineVisitor(AstNode* nodep) {
         m_modp = NULL;
         iterate(nodep);

src/V3Inst.cpp

@@ -134,7 +134,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit InstVisitor(AstNetlist* nodep) {
         m_cellp = NULL;
         //
@@ -188,7 +188,7 @@ public:
         }
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit InstDeModVarVisitor() {}
     void main(AstNodeModule* nodep) {
         UINFO(8,"  dmMODULE    "<<nodep<<endl);
@@ -450,7 +450,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit InstDeVisitor(AstNetlist* nodep) {
         m_cellRangep = NULL;
         m_instSelNum = 0;

src/V3LinkCells.cpp

@@ -479,7 +479,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     LinkCellsVisitor(AstNetlist* nodep, V3InFilter* filterp, V3ParseSym* parseSymp)
         : m_mods(nodep) {
         m_filterp = filterp;

src/V3LinkDot.cpp

@@ -1187,7 +1187,7 @@ class LinkDotFindVisitor : public AstNVisitor {
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     LinkDotFindVisitor(AstNetlist* rootp, LinkDotState* statep) {
         UINFO(4,__FUNCTION__<<": "<<endl);
         m_packagep = NULL;
@@ -1353,7 +1353,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     LinkDotParamVisitor(AstNetlist* rootp, LinkDotState* statep) {
         UINFO(4,__FUNCTION__<<": "<<endl);
         m_statep = statep;
@@ -1503,7 +1503,7 @@ class LinkDotScopeVisitor : public AstNVisitor {
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     LinkDotScopeVisitor(AstNetlist* rootp, LinkDotState* statep) {
         UINFO(4,__FUNCTION__<<": "<<endl);
         m_modSymp = NULL;
@@ -1591,7 +1591,7 @@ class LinkDotIfaceVisitor : public AstNVisitor {
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     LinkDotIfaceVisitor(AstIface* nodep, VSymEnt* curSymp, LinkDotState* statep) {
         UINFO(4,__FUNCTION__<<": "<<endl);
         m_curSymp = curSymp;
@@ -2544,7 +2544,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     LinkDotResolveVisitor(AstNetlist* rootp, LinkDotState* statep) {
         UINFO(4,__FUNCTION__<<": "<<endl);
         m_statep = statep;

src/V3LinkJump.cpp

@@ -248,7 +248,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit LinkJumpVisitor(AstNetlist* nodep) {
         m_modp = NULL;
         m_ftaskp = NULL;

src/V3LinkLValue.cpp

@@ -268,7 +268,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     LinkLValueVisitor(AstNode* nodep, bool start) {
         m_setRefLvalue = start;
         m_ftaskp = NULL;

src/V3LinkParse.cpp

@@ -461,7 +461,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit LinkParseVisitor(AstNetlist* rootp) {
         m_varp = NULL;
         m_modp = NULL;

src/V3LinkResolve.cpp

@@ -458,7 +458,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit LinkResolveVisitor(AstNetlist* rootp) {
         m_ftaskp = NULL;
         m_modp = NULL;
@@ -506,7 +506,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit LinkBotupVisitor(AstNetlist* rootp) {
         m_modp = NULL;
         //

src/V3Name.cpp

@@ -132,7 +132,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit NameVisitor(AstNetlist* nodep) {
         m_modp = NULL;
         iterate(nodep);

src/V3Order.cpp

@@ -370,7 +370,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit OrderClkMarkVisitor(AstNode* nodep) {
         m_hasClk    = false;
         m_inClocked = false;
@@ -412,7 +412,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit OrderClkAssVisitor(AstNode* nodep) {
         m_clkAss = false;
         iterate(nodep);
@@ -1238,7 +1238,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     OrderVisitor() {
         m_topScopep = NULL;
         m_scopetopp = NULL;

src/V3Param.cpp

@@ -562,7 +562,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit ParamVisitor(AstNetlist* nodep) {
         m_longId = 0;
         m_modp = NULL;

src/V3Partition.cpp

@@ -1788,7 +1788,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit DpiImportCallVisitor(AstNode* nodep)
         : m_hasDpiHazard(false)
         , m_tracingCall(false) {

src/V3PreProc.h

@@ -99,7 +99,7 @@ public:
     virtual void candidateDefines(VSpellCheck* spellerp) = 0;  ///< Spell check candidate defines
 
 protected:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     V3PreProc() {
         m_debug=0;
     };

src/V3Premit.cpp

@@ -403,7 +403,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit PremitVisitor(AstNetlist* nodep) {
         m_modp = NULL;
         m_funcp = NULL;

src/V3Reloop.cpp

@@ -233,7 +233,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit ReloopVisitor(AstNetlist* nodep) {
         m_cfuncp = NULL;
         m_mgCfuncp = NULL;

src/V3Scope.cpp

@@ -295,7 +295,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit ScopeVisitor(AstNetlist* nodep) {
         m_aboveCellp = NULL;
         m_aboveScopep = NULL;
@@ -401,7 +401,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit ScopeCleanupVisitor(AstNetlist* nodep) {
         m_scopep = NULL;
         iterate(nodep);

src/V3SenTree.h

@@ -151,7 +151,7 @@ public:
         return treep;
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     SenTreeFinder() {
         clear();
     }

src/V3Slice.cpp

@@ -228,7 +228,7 @@ class SliceVisitor : public AstNVisitor {
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit SliceVisitor(AstNetlist* nodep) {
         m_assignp = NULL;
         m_assignError = false;

src/V3Split.cpp

@@ -265,7 +265,7 @@ protected:
     bool                m_inDly;        // Inside ASSIGNDLY
     V3Double0           m_statSplits;   // Statistic tracking
 
-    // CONSTUCTORS
+    // CONSTRUCTORS
 public:
     SplitReorderBaseVisitor() {
         scoreboardClear();

src/V3SplitAs.cpp

@@ -65,7 +65,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit SplitAsFindVisitor(AstAlways* nodep) {
         m_splitVscp = NULL;
         iterate(nodep);
@@ -125,7 +125,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     SplitAsCleanVisitor(AstAlways* nodep, AstVarScope* vscp, bool modeMatch) {
         m_splitVscp = vscp;
         m_modeMatch = modeMatch;
@@ -201,7 +201,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit SplitAsVisitor(AstNetlist* nodep) {
         m_splitVscp = NULL;
         AstNode::user1ClearTree();  // user1p() used on entire tree

src/V3String.h

@@ -108,7 +108,7 @@ public:
     void name(const string& name) { m_name = name; m_hashed = ""; }
     string name() const { return m_name; }
     string hashedName();
-    // CONFIG STATIC METHORS
+    // CONFIG STATIC METHODS
     // Length at which to start hashing, 0=disable
     static void maxLength(size_t flag) { s_maxLength = flag; }
     static size_t maxLength() { return s_maxLength; }

src/V3Subst.cpp

@@ -211,7 +211,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     SubstUseVisitor(AstNode* nodep, int origStep) {
         UINFO(9, "        SubstUseVisitor "<<origStep<<" "<<nodep<<endl);
         m_ok = true;
@@ -376,7 +376,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit SubstVisitor(AstNode* nodep) {
         AstNode::user1ClearTree();  // user1p() used on entire tree
         AstNode::user2ClearTree();  // user2p() used on entire tree

src/V3Task.cpp

@@ -239,7 +239,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit TaskStateVisitor(AstNetlist* nodep) {
         m_assignwp = NULL;
         m_curVxp = new TaskCodeVertex(&m_callGraph);
@@ -282,7 +282,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit TaskRelinkVisitor(AstBegin* nodep) {  // Passed temporary tree
         iterate(nodep);
     }
@@ -1324,7 +1324,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     TaskVisitor(AstNetlist* nodep, TaskStateVisitor* statep)
         : m_statep(statep) {
         m_modp = NULL;

src/V3Trace.cpp

@@ -737,7 +737,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit TraceVisitor(AstNetlist* nodep) {
         m_funcp = NULL;
         m_tracep = NULL;

src/V3TraceDecl.cpp

@@ -307,7 +307,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit TraceDeclVisitor(AstNetlist* nodep) {
         m_scopetopp = NULL;
         m_initFuncp = NULL;

src/V3Tristate.cpp

@@ -133,7 +133,7 @@ private:
     V3Graph m_graph;  // Logic graph
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     TristateGraph() { clear(); }
     virtual ~TristateGraph() { clear(); }
 
@@ -312,7 +312,7 @@ class TristatePinVisitor : public TristateBaseVisitor {
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     TristatePinVisitor(AstNode* nodep, TristateGraph& tgraph, bool lvalue)
         : m_tgraph(tgraph), m_lvalue(lvalue) {
         iterate(nodep);
@@ -1355,7 +1355,7 @@ class TristateVisitor : public TristateBaseVisitor {
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit TristateVisitor(AstNode* nodep) {
         m_graphing = false;
         m_modp  = NULL;

src/V3Undriven.cpp

@@ -428,7 +428,7 @@ private:
         iterateChildren(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit UndrivenVisitor(AstNetlist* nodep) {
         m_inBBox = false;
         m_inContAssign = false;

src/V3Unknown.cpp

@@ -458,7 +458,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit UnknownVisitor(AstNetlist* nodep) {
         m_modp = NULL;
         m_assigndlyp = NULL;

src/V3Unroll.cpp

@@ -458,13 +458,13 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     UnrollVisitor() { init(false, ""); }
     virtual ~UnrollVisitor() {
         V3Stats::addStatSum("Optimizations, Unrolled Loops", m_statLoops);
         V3Stats::addStatSum("Optimizations, Unrolled Iterations", m_statIters);
     }
-    // METHORS
+    // METHODS
     void init(bool generate, const string& beginName) {
         m_forVarp = NULL;
         m_forVscp = NULL;

src/V3Width.cpp

@@ -166,7 +166,7 @@ class WidthClearVisitor {
         }
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit WidthClearVisitor(AstNetlist* nodep) {
         clearWidthRecurse(nodep);
     }
@@ -4171,7 +4171,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     WidthVisitor(bool paramsOnly,  // [in] TRUE if we are considering parameters only.
                  bool doGenerate) {  // [in] TRUE if we are inside a generate statement and
         //                           // don't wish to trigger errors

src/V3WidthCommit.h

@@ -161,7 +161,7 @@ private:
         editDType(nodep);
     }
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     explicit WidthCommitVisitor(AstNetlist* nodep) {
         // Were changing widthMin's, so the table is now somewhat trashed
         nodep->typeTablep()->clearCache();

src/V3WidthSel.cpp

@@ -486,7 +486,7 @@ private:
     }
 
 public:
-    // CONSTUCTORS
+    // CONSTRUCTORS
     WidthSelVisitor() {}
     AstNode* mainAcceptEdit(AstNode* nodep) {
         return iterateSubtreeReturnEdits(nodep);

src/verilog.y

@@ -1978,7 +1978,7 @@ loop_generate_construct<nodep>:	// ==IEEE: loop_generate_construct
 			}
 	;
 
-genvar_initialization<nodep>:	// ==IEEE: genvar_initalization
+genvar_initialization<nodep>:	// ==IEEE: genvar_initialization
 		varRefBase '=' expr			{ $$ = new AstAssign($2,$1,$3); }
 	|	yGENVAR genvar_identifierDecl '=' constExpr	{ $$ = $2; $2->addNext(new AstAssign($3,new AstVarRef($2->fileline(),$2,true), $4)); }
 	;
@@ -2511,7 +2511,7 @@ statement_item<nodep>:		// IEEE: statement_item
 	|	yFOREVER stmtBlock			{ $$ = new AstWhile($1,new AstConst($1,AstConst::LogicTrue()),$2); }
 	|	yREPEAT '(' expr ')' stmtBlock		{ $$ = new AstRepeat($1,$3,$5);}
 	|	yWHILE '(' expr ')' stmtBlock		{ $$ = new AstWhile($1,$3,$5);}
-	//			// for's first ';' is in for_initalization
+	//			// for's first ';' is in for_initialization
 	|	statementFor				{ $$ = $1; }
 	|	yDO stmtBlock yWHILE '(' expr ')' ';'	{ if ($2) {
 							     $$ = $2->cloneTree(true);