mirror of
https://github.com/verilator/verilator.git
synced 2025-04-05 20:22:41 +00:00
5acced1e33
* Refactor V3Delay for extensibility Introduce the concept of an "NBA Scheme", which is the lowering pattern we can use for various variables that are the targets of NBAs. E.g.: - ShadowVariable (old default scheme) - FlagShared (old array set flag scheme) - ValueQueueWhole (recent dynamic commit queue) We now analyse all AstAssignDly before making any decisions on which scheme to apply. We then choose a specific scheme for each variable that is the target of an NBA, and then all NBAs targeting that variable use the same scheme. This enables easy mix and match of schemes as needed, while remaining consistent by design after extensions. Output is perturbed due to node insertion order, but no functional or performance change is intended.
31 lines
658 B
Systemverilog
31 lines
658 B
Systemverilog
// DESCRIPTION: Verilator: Test of select from constant
|
|
//
|
|
// This file ONLY is placed under the Creative Commons Public Domain, for
|
|
// any use, without warranty, 2020 by Wilson Snyder.
|
|
// SPDX-License-Identifier: CC0-1.0
|
|
|
|
// verilator lint_off MULTIDRIVEN
|
|
|
|
module t (/*AUTOARG*/
|
|
// Outputs
|
|
o,
|
|
// Inputs
|
|
clk
|
|
);
|
|
input clk;
|
|
output int o;
|
|
|
|
localparam SIZE = 65536;
|
|
|
|
// Unsupported case 1: Array NBA to compund type
|
|
class C; endclass
|
|
C array2[SIZE];
|
|
always @ (negedge clk) begin
|
|
o <= int'(array2[1] == null);
|
|
for (int i=0; i<SIZE; i++) begin
|
|
array2[i] <= null; // BLKLOOPINIT
|
|
end
|
|
end
|
|
|
|
endmodule
|