Fix infinite recursion due to recursive functions/tasks

Signed-off-by: Krzysztof Bieganski <kbieganski@antmicro.com>

Author: kbieganski

src/V3AstNodes.cpp

@@ -76,7 +76,10 @@ bool AstNodeFTaskRef::isPure() {
         // cached.
         return false;
     } else {
-        if (!m_purity.isCached()) m_purity.set(this->getPurityRecurse());
+        if (!m_purity.isCached()) {
+            m_purity.set(true);
+            m_purity.set(this->getPurityRecurse());
+        }
         return m_purity.get();
     }
 }

src/V3Hasher.cpp

@@ -38,8 +38,8 @@ class HasherVisitor final : public VNVisitorConst {
 
     V3Hash hashNodeAndIterate(AstNode* nodep, bool hashDType, bool hashChildren,
                               std::function<void()>&& f) {
-        // See comments in visit(AstCFunc) about this breaking recursion
-        if (m_cacheInUser4 && nodep->user4()) {
+        // See comments in visit(AstCFunc/AstNodeFTask) about this breaking recursion
+        if (nodep->user4()) {
             return V3Hash{nodep->user4()};
         } else {
             VL_RESTORER(m_hash);
@@ -470,7 +470,13 @@ class HasherVisitor final : public VNVisitorConst {
     }
     void visit(AstNodeFTask* nodep) override {
         m_hash += hashNodeAndIterate(nodep, HASH_DTYPE, HASH_CHILDREN, [this, nodep]() {  //
+            // We might be in a recursive function, if so on *second* call
+            // here we need to break what would be an infinite loop.
             m_hash += nodep->name();
+            nodep->user4(true);  // Set this "first" call
+            // So that a second call will then exit hashNodeAndIterate
+            // Having a constant in the hash just means the recursion will
+            // end, it shouldn't change the NodeFTask having a unique hash itself.
         });
     }
     void visit(AstModport* nodep) override {

test_regress/t/t_infinite_recursion_hasher.pl

@@ -0,0 +1,18 @@
+#!/usr/bin/env perl
+if (!$::Driver) { use FindBin; exec("$FindBin::Bin/bootstrap.pl", @ARGV, $0); die; }
+# DESCRIPTION: Verilator: Verilog Test driver/expect definition
+#
+# Copyright 2023 by Wilson Snyder. This program is free software; you
+# can redistribute it and/or modify it under the terms of either the GNU
+# Lesser General Public License Version 3 or the Perl Artistic License
+# Version 2.0.
+# SPDX-License-Identifier: LGPL-3.0-only OR Artistic-2.0
+
+scenarios(vlt => 1);
+
+lint(
+    verilator_flags2 => ["--no-unlimited-stack -Wno-lint"],
+    );
+
+ok(1);
+1;

test_regress/t/t_infinite_recursion_hasher.v

@@ -0,0 +1,11 @@
+class axi_trans;
+   function void pre_randomize();
+      pre_randomize();
+   endfunction
+endclass
+module t;
+   axi_trans axi_txn;
+   task body();
+      int _ = axi_txn.randomize() with {1 == 1;};
+   endtask
+endmodule

test_regress/t/t_infinite_recursion_purity.pl

@@ -0,0 +1,18 @@
+#!/usr/bin/env perl
+if (!$::Driver) { use FindBin; exec("$FindBin::Bin/bootstrap.pl", @ARGV, $0); die; }
+# DESCRIPTION: Verilator: Verilog Test driver/expect definition
+#
+# Copyright 2023 by Wilson Snyder. This program is free software; you
+# can redistribute it and/or modify it under the terms of either the GNU
+# Lesser General Public License Version 3 or the Perl Artistic License
+# Version 2.0.
+# SPDX-License-Identifier: LGPL-3.0-only OR Artistic-2.0
+
+scenarios(vlt => 1);
+
+lint(
+    verilator_flags2 => ["--no-unlimited-stack"],
+    );
+
+ok(1);
+1;

test_regress/t/t_infinite_recursion_purity.v

@@ -0,0 +1 @@
+task t;t;endtask