2020-10-17 19:23:27 -04:00
// DESCRIPTION: Verilator: Verilog Test module
//
// This file ONLY is placed under the Creative Commons Public Domain, for
// any use, without warranty, 2019 by Wilson Snyder.
// SPDX-License-Identifier: CC0-1.0
`define stop $stop
`define checkh(gotv,expv) do if ((gotv) !== (expv)) begin $write("%%Error: %s:%0d: got='h%x exp='h%x\n", `__FILE__,`__LINE__, (gotv), (expv)); `stop; end while(0);
2024-07-20 06:51:50 -04:00
`define checkp(gotv,expv_s) do begin string gotv_s; gotv_s = $sformatf("%p", gotv); if ((gotv_s) !== (expv_s)) begin $write("%%Error: %s:%0d: got='%s' exp='%s'\n", `__FILE__,`__LINE__, (gotv_s), (expv_s)); `stop; end end while(0);
2020-10-17 19:23:27 -04:00
module t ( /*AUTOARG*/ );
initial begin
int q [ 5 ];
2020-10-24 18:00:40 -04:00
int qv [ $ ]; // Value returns
int qi [ $ ]; // Index returns
2020-10-17 19:23:27 -04:00
int i ;
string v ;
q = '{ 1 , 2 , 2 , 4 , 3 };
2024-07-20 06:51:50 -04:00
`checkp ( q , "'{'h1, 'h2, 'h2, 'h4, 'h3} " );
2020-10-17 19:23:27 -04:00
// NOT tested: with ... selectors
q . sort ;
2024-07-20 06:51:50 -04:00
`checkp ( q , "'{'h1, 'h2, 'h2, 'h3, 'h4} " );
2020-10-17 19:23:27 -04:00
q . sort with ( item == 2 );
2024-07-20 06:51:50 -04:00
`checkp ( q , "'{'h1, 'h3, 'h4, 'h2, 'h2} " );
2020-10-17 19:23:27 -04:00
q . sort ( x ) with ( x == 3 );
2024-07-20 06:51:50 -04:00
`checkp ( q , "'{'h1, 'h4, 'h2, 'h2, 'h3} " );
2020-10-17 19:23:27 -04:00
q . rsort ;
2024-07-20 06:51:50 -04:00
`checkp ( q , "'{'h4, 'h3, 'h2, 'h2, 'h1} " );
2020-10-17 19:23:27 -04:00
q . rsort with ( item == 2 );
2024-07-20 06:51:50 -04:00
`checkp ( q , "'{'h2, 'h2, 'h4, 'h3, 'h1} " );
2020-10-17 19:23:27 -04:00
qv = q . unique ;
2024-07-20 06:51:50 -04:00
`checkp ( qv , "'{'h2, 'h4, 'h3, 'h1} " );
2020-10-24 18:00:40 -04:00
qi = q . unique_index ; qi . sort ;
2024-07-20 06:51:50 -04:00
`checkp ( qi , "'{'h0, 'h2, 'h3, 'h4} " );
2020-10-17 19:23:27 -04:00
q . reverse ;
2024-07-20 06:51:50 -04:00
`checkp ( q , "'{'h1, 'h3, 'h4, 'h2, 'h2} " );
2020-10-17 19:23:27 -04:00
q . shuffle (); q . sort ;
2024-07-20 06:51:50 -04:00
`checkp ( q , "'{'h1, 'h2, 'h2, 'h3, 'h4} " );
2020-10-17 19:23:27 -04:00
// These require an with clause or are illegal
// TODO add a lint check that with clause is provided
qv = q . find with ( item == 2 );
2024-07-20 06:51:50 -04:00
`checkp ( qv , "'{'h2, 'h2} " );
2020-10-17 19:23:27 -04:00
qv = q . find_first with ( item == 2 );
2024-07-20 06:51:50 -04:00
`checkp ( qv , "'{'h2} " );
2020-10-17 19:23:27 -04:00
qv = q . find_last with ( item == 2 );
2024-07-20 06:51:50 -04:00
`checkp ( qv , "'{'h2} " );
2020-10-17 19:23:27 -04:00
qv = q . find with ( item == 20 );
2024-07-20 06:51:50 -04:00
`checkp ( qv , "'{}" );
2020-10-17 19:23:27 -04:00
qv = q . find_first with ( item == 20 );
2024-07-20 06:51:50 -04:00
`checkp ( qv , "'{}" );
2020-10-17 19:23:27 -04:00
qv = q . find_last with ( item == 20 );
2024-07-20 06:51:50 -04:00
`checkp ( qv , "'{}" );
2020-10-24 18:00:40 -04:00
qi = q . find_index with ( item == 2 ); qi . sort ;
2024-07-20 06:51:50 -04:00
`checkp ( qi , "'{'h1, 'h2} " );
2020-10-24 18:00:40 -04:00
qi = q . find_first_index with ( item == 2 );
2024-07-20 06:51:50 -04:00
`checkp ( qi , "'{'h1} " );
2020-10-24 18:00:40 -04:00
qi = q . find_last_index with ( item == 2 );
2024-07-20 06:51:50 -04:00
`checkp ( qi , "'{'h2} " );
2020-10-24 18:00:40 -04:00
qi = q . find_index with ( item == 20 ); qi . sort ;
2024-07-20 06:51:50 -04:00
`checkp ( qi , "'{}" );
2020-10-24 18:00:40 -04:00
qi = q . find_first_index with ( item == 20 );
2024-07-20 06:51:50 -04:00
`checkp ( qi , "'{}" );
2020-10-24 18:00:40 -04:00
qi = q . find_last_index with ( item == 20 );
2024-07-20 06:51:50 -04:00
`checkp ( qi , "'{}" );
2020-10-17 19:23:27 -04:00
qv = q . min ;
2024-07-20 06:51:50 -04:00
`checkp ( qv , "'{'h1} " );
2020-10-17 19:23:27 -04:00
qv = q . max ;
2024-07-20 06:51:50 -04:00
`checkp ( qv , "'{'h4} " );
2020-10-17 19:23:27 -04:00
// Reduction methods
i = q . sum ; `checkh ( i , 32'hc );
i = q . product ; `checkh ( i , 32'h30 );
q = '{ 32 'b1100 , 32 'b1010 , 32 'b1100 , 32 'b1010 , 32 'b1010 };
i = q . and ; `checkh ( i , 32 'b1000 );
i = q . or ; `checkh ( i , 32 'b1110 );
i = q . xor ; `checkh ( i , 32'ha );
$write ( "*-* All Finished *-* \n " );
$finish ;
end
endmodule