Apply 'make format'

include/verilated_funcs.h

@@ -237,8 +237,7 @@ static inline std::string VL_CVT_N_CSTR(const char* lhsp) VL_PURE {
 template <typename T, std::size_t N_Depth>
 static inline VlQueue<T> VL_CVT_UNPACK_TO_Q(const VlUnpacked<T, N_Depth>& q) VL_PURE {
     VlQueue<T> ret;
-    for (size_t i = 0; i < N_Depth; ++i)
-        ret.push_back(q[i]);
+    for (size_t i = 0; i < N_Depth; ++i) ret.push_back(q[i]);
     return ret;
 }
 

src/V3Width.cpp

@@ -7075,11 +7075,12 @@ class WidthVisitor final : public VNVisitor {
             nodep->v3error(side << " expects a " << lhsClassRefp->prettyTypeName() << ", got "
                                 << rhsDtypep->prettyTypeName());
         }
-        if (VN_IS(lhsDTypep->skipRefp(), DynArrayDType) && VN_IS(rhsp->dtypep()->skipRefp(), UnpackArrayDType)){
+        if (VN_IS(lhsDTypep->skipRefp(), DynArrayDType)
+            && VN_IS(rhsp->dtypep()->skipRefp(), UnpackArrayDType)) {
             VNRelinker relinker;
             rhsp->unlinkFrBack(&relinker);
-            relinker.relink(new AstCvtUnpackedToQueue{
-                    rhsp->fileline(), VN_AS(rhsp, NodeExpr), lhsDTypep});
+            relinker.relink(
+                new AstCvtUnpackedToQueue{rhsp->fileline(), VN_AS(rhsp, NodeExpr), lhsDTypep});
         }
     }
     static bool similarDTypeRecurse(const AstNodeDType* const node1p,