Commentary: spelling

This commit is contained in:
Wilson Snyder 2025-12-28 21:30:16 -05:00
parent a0798eb838
commit 4775399716
10 changed files with 14 additions and 14 deletions

View File

@ -259,7 +259,7 @@ class CfgGraph final : public V3Graph {
void addUntknEdge(CfgBlock* srcp, CfgBlock* dstp) {
UASSERT_OBJ(srcp->m_cfgp == this, srcp, "'srcp' is not in this graph");
UASSERT_OBJ(dstp->m_cfgp == this, dstp, "'dstp' is not in this graph");
UASSERT_OBJ(srcp->takenEdgep(), srcp, "Untaken edge shold be added second");
UASSERT_OBJ(srcp->takenEdgep(), srcp, "Untaken edge should be added second");
UASSERT_OBJ(srcp->takenp() != dstp, srcp, "Untaken branch targets the same block");
//
UASSERT_OBJ(dstp != m_enterp, dstp, "Enter block cannot have a predecessor");

View File

@ -589,7 +589,7 @@ protected:
explicit DfgUserMapBase(const DfgGraph* dfgp)
: m_dfgp{dfgp}
, m_currentGeneration{++m_dfgp->m_vertexUserGeneration} {
UASSERT(m_currentGeneration, "DfgGraph user data genartion number overflow");
UASSERT(m_currentGeneration, "DfgGraph user data generation number overflow");
UASSERT(!m_dfgp->m_vertexUserInUse, "DfgUserMap already in use for this DfgGraph");
m_dfgp->m_vertexUserInUse = true;
}

View File

@ -27,7 +27,7 @@
#include <vector>
class ColorStronglyConnectedComponents final {
static_assert(sizeof(uint32_t[2]) == sizeof(uint64_t), "Incorrect ovverlay size");
static_assert(sizeof(uint32_t[2]) == sizeof(uint64_t), "Incorrect overlay size");
// CONSTANTS
static constexpr uint32_t UNASSIGNED = std::numeric_limits<uint32_t>::max();

View File

@ -136,7 +136,7 @@ class AstToDfgConverter final : public VNVisitor {
// Traversal set user2p to the equivalent vertex
DfgVertex* const vtxp = nodep->user2u().to<DfgVertex*>();
UASSERT_OBJ(vtxp, nodep, "Missing Dfg vertex after covnersion");
UASSERT_OBJ(vtxp, nodep, "Missing Dfg vertex after conversion");
return vtxp;
}

View File

@ -158,7 +158,7 @@ class BalanceConcatTree final {
// Sentinel term
terms2.emplace_back(nullptr, offset);
// should have ended up with the same number of bits at least...
UASSERT(terms2.back().offset == terms.back().offset, "Inconsitent terms");
UASSERT(terms2.back().offset == terms.back().offset, "Inconsistent terms");
}
// Round 2: Combine the partial terms

View File

@ -492,7 +492,7 @@ void connectPort(AstNodeModule* modp, AstVar* nodep, AstNodeExpr* pinExprp) {
// If it is being inlined, create the alias for it
if (inlineIt) {
UINFO(6, "Inlning port variable: " << nodep);
UINFO(6, "Inlining port variable: " << nodep);
if (nodep->isIfaceRef()) {
modp->addStmtsp(
new AstAliasScope{flp, portRef(VAccess::WRITE), pinRef(VAccess::READ)});
@ -510,7 +510,7 @@ void connectPort(AstNodeModule* modp, AstVar* nodep, AstNodeExpr* pinExprp) {
}
// Otherwise create the continuous assignment between the port var and the pin expression
UINFO(6, "Not inlning port variable: " << nodep);
UINFO(6, "Not inlining port variable: " << nodep);
if (nodep->direction() == VDirection::INPUT) {
AstAssignW* const ap = new AstAssignW{flp, portRef(VAccess::WRITE), pinRef(VAccess::READ)};
modp->addStmtsp(new AstAlways{ap});

View File

@ -81,26 +81,26 @@ public:
}
void simpleAssign(AstNodeAssign* nodep) { // New simple A=.... assignment
UASSERT_OBJ(!m_isNew, nodep, "Uninitialzized new entry");
UASSERT_OBJ(!m_isNew, nodep, "Uninitialized new entry");
m_assignp = nodep;
m_constp = nullptr;
m_everSet = true;
if (VN_IS(nodep->rhsp(), Const)) m_constp = VN_AS(nodep->rhsp(), Const);
}
void resetStatement(AstCReset* nodep) { // New CReset(A) assignment
UASSERT_OBJ(!m_isNew, nodep, "Uninitialzized new entry");
UASSERT_OBJ(!m_isNew, nodep, "Uninitialized new entry");
m_assignp = nodep;
m_constp = nullptr;
m_everSet = true;
}
void complexAssign() { // A[x]=... or some complicated assignment
UASSERT(!m_isNew, "Uninitialzized new entry");
UASSERT(!m_isNew, "Uninitialized new entry");
m_assignp = nullptr;
m_constp = nullptr;
m_everSet = true;
}
void consumed() { // Rvalue read of A
UASSERT(!m_isNew, "Uninitialzized new entry");
UASSERT(!m_isNew, "Uninitialized new entry");
m_assignp = nullptr;
}
AstNodeStmt* assignp() const { return m_assignp; }

View File

@ -315,7 +315,7 @@ class RandSequenceVisitor final : public VNVisitor {
new AstConst{fl, AstConst::BitFalse{}}});
}
// "// Number of eligible lists left before hit _Vjoin_pciked one"
// "// Number of eligible lists left before hit _Vjoin_picked one"
// "int _Vjoin_sel_elist = _Vjoin_picked_elist;"
AstVar* const selVarp
= new AstVar{fl, VVarType::VAR, "_Vjoin_sel_elist", VFlagBitPacked{}, 32};

View File

@ -6569,7 +6569,7 @@ class WidthVisitor final : public VNVisitor {
void visit(AstFuncRef* nodep) override {
visit(static_cast<AstNodeFTaskRef*>(nodep));
if (nodep->taskp() && VN_IS(nodep->taskp(), Task)) {
UASSERT_OBJ(m_vup, nodep, "Function reference where widthed expression expection");
UASSERT_OBJ(m_vup, nodep, "Function reference where widthed expression expectation");
if (m_vup->prelim() && !VN_IS(nodep->backp(), StmtExpr))
nodep->v3error(
"Cannot call a task/void-function as a function: " << nodep->prettyNameQ());

View File

@ -43,7 +43,7 @@ module t (/*AUTOARG*/
end else begin
// not driving b
// a should be 1 (pullup)
// y and yfix shold be 1
// y and yfix should be 1
if (a!=1 || y != 1 || y_fixed != 1) begin
$display( "Expected a,y,yfix == 1");
$stop;