diff --git a/src/V3Ast.cpp b/src/V3Ast.cpp index cc9fc8ee2..b3e69daf1 100644 --- a/src/V3Ast.cpp +++ b/src/V3Ast.cpp @@ -813,7 +813,7 @@ void AstNode::iterateAndNextIgnoreEdit(AstNVisitor& v, AstNUser* vup) { AstNode* AstNode::acceptSubtreeReturnEdits(AstNVisitor& v, AstNUser* vup) { // Some visitors perform tree edits (such as V3Const), and may even // replace/delete the exact nodep that the visitor is called with. If - // this happens, the parent will loose the handle to the node that was + // this happens, the parent will lose the handle to the node that was // processed. // To solve this, this function returns the pointer to the replacement node, // which in many cases is just the same node that was passed in. diff --git a/src/V3Const.cpp b/src/V3Const.cpp index 9a1040b50..42e3783f2 100644 --- a/src/V3Const.cpp +++ b/src/V3Const.cpp @@ -1106,7 +1106,7 @@ private: // Someday if lower is constant, convert to quoted "string". virtual void visit(AstAttrOf* nodep, AstNUser*) { - // Don't iterate children, don't want to loose VarRef. + // Don't iterate children, don't want to lose VarRef. if (nodep->attrType()==AstAttrType::EXPR_BITS) { if (!nodep->fromp() || !nodep->fromp()->widthMin()) nodep->v3fatalSrc("Unsized expression"); V3Number num (nodep->fileline(), 32, nodep->fromp()->widthMin()); diff --git a/src/V3LinkResolve.cpp b/src/V3LinkResolve.cpp index 2a8c5f730..2f2ae66b7 100644 --- a/src/V3LinkResolve.cpp +++ b/src/V3LinkResolve.cpp @@ -196,7 +196,7 @@ private: virtual void visit(AstNodePreSel* nodep, AstNUser*) { if (!nodep->attrp()) { nodep->iterateChildren(*this); - // Constification may change the fromp() to a constant, which will loose the + // Constification may change the fromp() to a constant, which will lose the // variable we're extracting from (to determine MSB/LSB/endianness/etc.) // So we replicate it in another node // Note that V3Param knows not to replace AstVarRef's under AstAttrOf's diff --git a/src/V3Order.cpp b/src/V3Order.cpp index b41620ecd..3b1efc953 100644 --- a/src/V3Order.cpp +++ b/src/V3Order.cpp @@ -862,7 +862,7 @@ void OrderVisitor::processInsLoopEdge(V3GraphEdge* oldEdgep) { OrderLoopEndVertex* endp = m_pmlLoopEndps[fromId]; newFromp = endp; // If it goes from(to) a cutable VarVertex inside the Begin/End block, - // we can't loose the variable, as we might need to cut that variable out + // we can't lose the variable, as we might need to cut that variable out // in the next pass of processLoops, and processBrokeLoops needs the var pointer. // We'll make another VarVertex (dup of the one "inside" the loop) // and point to it. diff --git a/src/V3PreProc.cpp b/src/V3PreProc.cpp index be6a38696..026e562f5 100644 --- a/src/V3PreProc.cpp +++ b/src/V3PreProc.cpp @@ -879,7 +879,7 @@ int V3PreProcImp::getStateToken() { if (defExists(name)) { // JOIN(DEFREF) // Put back the `` and process the defref UINFO(5,"```: define "<width()); m_modp->addStmtp(varp); - AstNode* abovep = prep->backp(); // Grab above point before loose it w/ next replace + AstNode* abovep = prep->backp(); // Grab above point before lose it w/ next replace prep->replaceWith(new AstVarRef(fl, varp, true)); AstNode* newp = new AstIf(fl, condp, (needDly diff --git a/src/V3Width.cpp b/src/V3Width.cpp index c4f7c7b84..2dfed3080 100644 --- a/src/V3Width.cpp +++ b/src/V3Width.cpp @@ -327,7 +327,7 @@ private: if (nodep->lsbp()->castConst() && nodep->msbConst() > frommsb) { // See also warning in V3Const // We need to check here, because the widthCheck may silently - // add another SEL which will loose the out-of-range check + // add another SEL which will lose the out-of-range check nodep->v3error("Selection index out of range: " <msbConst()<<":"<lsbConst() <<" outside "<dumpTreeFile(v3Global.debugFilename("widthcommit.tree")); // Coverage insertion - // Before we do dead code elimination and inlining, or we'll loose it. + // Before we do dead code elimination and inlining, or we'll lose it. if (v3Global.opt.coverage()) { V3Coverage::coverage(v3Global.rootp()); v3Global.rootp()->dumpTreeFile(v3Global.debugFilename("coverage.tree"));