1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
// 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
// verilog_format: off
`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);
`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);
// verilog_format: on
module t;
initial begin
int q[5];
int qv[$]; // Value returns
int qi[$]; // Index returns
int i;
string v;
q = '{1, 2, 2, 4, 3};
`checkp(q, "'{'h1, 'h2, 'h2, 'h4, 'h3}");
// NOT tested: with ... selectors
q.sort;
`checkp(q, "'{'h1, 'h2, 'h2, 'h3, 'h4}");
q.sort with (item == 2);
`checkp(q, "'{'h1, 'h3, 'h4, 'h2, 'h2}");
q.sort(x) with (x == 3);
`checkp(q, "'{'h1, 'h4, 'h2, 'h2, 'h3}");
q.rsort;
`checkp(q, "'{'h4, 'h3, 'h2, 'h2, 'h1}");
q.rsort with (item == 2);
`checkp(q, "'{'h2, 'h2, 'h4, 'h3, 'h1}");
qv = q.unique;
`checkp(qv, "'{'h2, 'h4, 'h3, 'h1}");
qi = q.unique_index;
qi.sort;
`checkp(qi, "'{'h0, 'h2, 'h3, 'h4}");
q.reverse;
`checkp(q, "'{'h1, 'h3, 'h4, 'h2, 'h2}");
q.shuffle();
q.sort;
`checkp(q, "'{'h1, 'h2, 'h2, 'h3, 'h4}");
// These require an with clause or are illegal
// TODO add a lint check that with clause is provided
qv = q.find with (item == 2);
`checkp(qv, "'{'h2, 'h2}");
qv = q.find_first with (item == 2);
`checkp(qv, "'{'h2}");
qv = q.find_last with (item == 2);
`checkp(qv, "'{'h2}");
qv = q.find with (item == 20);
`checkp(qv, "'{}");
qv = q.find_first with (item == 20);
`checkp(qv, "'{}");
qv = q.find_last with (item == 20);
`checkp(qv, "'{}");
qi = q.find_index with (item == 2);
qi.sort;
`checkp(qi, "'{'h1, 'h2}");
qi = q.find_first_index with (item == 2);
`checkp(qi, "'{'h1}");
qi = q.find_last_index with (item == 2);
`checkp(qi, "'{'h2}");
qi = q.find_index with (item == 20);
qi.sort;
`checkp(qi, "'{}");
qi = q.find_first_index with (item == 20);
`checkp(qi, "'{}");
qi = q.find_last_index with (item == 20);
`checkp(qi, "'{}");
qv = q.min;
`checkp(qv, "'{'h1}");
qv = q.max;
`checkp(qv, "'{'h4}");
// 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);
q = '{1, 2, 2, 4, 3};
// `checkp(q, "'{1, 2, 2, 4, 3}");
i = q.sum with (item + 1);
`checkh(i, 32'h11);
i = q.product with (item + 1);
`checkh(i, 32'h168);
q = '{32'b1100, 32'b1010, 32'b1100, 32'b1010, 32'b1010};
i = q.and with (item + 1);
`checkh(i, 32'b1001);
i = q.or with (item + 1);
`checkh(i, 32'b1111);
i = q.xor with (item + 1);
`checkh(i, 32'hb);
$write("*-* All Finished *-*\n");
$finish;
end
endmodule
|
