Merge pull request #3801 from alainmarcel/alainmarcel-patch-1

tests

tests/FuncInModule/FuncInModule.sl

@@ -0,0 +1 @@
+-parse -d uhdm -d coveruhdm -elabuhdm -d ast dut.sv -nobuiltin

tests/FuncInModule/dut.sv

@@ -0,0 +1,71 @@
+
+module rggen_or_reducer #(
+  parameter int WIDTH = 2,
+  parameter int N     = 4
+)(
+ // input   logic [N-1:0][WIDTH-1:0]  i_data,
+//  output  logic [WIDTH-1:0]         o_result
+);
+
+  function automatic bit [N-1:0][15:0] get_sub_n_list(int n);
+    bit [N-1:0][15:0] list;
+    int               list_index;
+    bit [15:0]        current_n;
+    bit [15:0]        half_n;
+
+    list        = '0;
+    list_index  = 0;
+    current_n   = 16'(n);
+    while (current_n > 0) begin
+      half_n  = current_n / 2;
+      if ((current_n > 4) && (half_n <= 4)) begin
+        list[list_index]  = half_n;
+      end
+      else if (current_n >= 4) begin
+        list[list_index]  = 4;
+      end
+      else begin
+        list[list_index]  = current_n;
+      end
+
+      current_n   -= list[list_index];
+      list_index  += 1;
+    end
+
+    return list;
+  endfunction
+
+
+  function automatic bit [N-1:0][15:0] get_offset_list(bit [N-1:0][15:0] sub_n_list);
+    bit [N-1:0][15:0] list;
+
+    for (int i = 0;i < N;++i) begin
+      if (i == 0) begin
+        list[i] = 0;
+      end
+      else begin
+        list[i] = sub_n_list[i-1] + list[i-1];
+      end
+    end
+
+    return list;
+  endfunction
+
+  function automatic int get_next_n(bit [N-1:0][15:0] sub_n_list);
+    int next_n;
+
+    next_n  = 0;
+    for (int i = 0;i < N;++i) begin
+      next_n  += ((sub_n_list[i] != 0) ? 1 : 0);
+    end
+
+    return next_n;
+  endfunction
+
+  localparam  bit [N-1:0][15:0] SUB_N_LIST_P  = get_sub_n_list(N);
+  localparam  bit [N-1:0][15:0] OFFSET_LIST = get_offset_list(SUB_N_LIST_P);
+  localparam  int               NEXT_N      = get_next_n(OFFSET_LIST);
+
+  logic [NEXT_N-1:0][WIDTH-1:0] next_data;
+
+endmodule