You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The problem exists when there is enough storage for the literal value in the array of 32-bit chunks but the bit width is too small to contain the number (e.g. 8'd256).
I am aware that the LRM says (section 5.7.1):
If the size of the unsigned number is larger than the
size specified for the literal constant, the unsigned number shall be truncated from the left.
However, I believe this change is in line with the rest of Verilator's WIDTH class of checks.
The text was updated successfully, but these errors were encountered:
Author Name: Todd Strader (@toddstrader)
Original Redmine Issue: 1156 from https://www.veripool.org
Original Assignee: Todd Strader (@toddstrader)
Here is a test and a patch:
https://github.com/toddstrader/verilator-dev/tree/literal_range_check
The problem exists when there is enough storage for the literal value in the array of 32-bit chunks but the bit width is too small to contain the number (e.g. 8'd256).
I am aware that the LRM says (section 5.7.1):
However, I believe this change is in line with the rest of Verilator's WIDTH class of checks.
The text was updated successfully, but these errors were encountered: