forked from pulp-platform/axi
-
Notifications
You must be signed in to change notification settings - Fork 0
/
axi_test.sv
2268 lines (2107 loc) · 74.2 KB
/
axi_test.sv
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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Copyright (c) 2014-2018 ETH Zurich, University of Bologna
//
// Copyright and related rights are licensed under the Solderpad Hardware
// License, Version 0.51 (the "License"); you may not use this file except in
// compliance with the License. You may obtain a copy of the License at
// http://solderpad.org/licenses/SHL-0.51. Unless required by applicable law
// or agreed to in writing, software, hardware and materials distributed under
// this License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
// specific language governing permissions and limitations under the License.
//
// Fabian Schuiki <[email protected]>
// Andreas Kurth <[email protected]>
//
// This file defines the interfaces we support.
/// A set of testbench utilities for AXI interfaces.
package axi_test;
import axi_pkg::*;
/// A driver for AXI4-Lite interface.
class axi_lite_driver #(
parameter int AW = 32 ,
parameter int DW = 32 ,
parameter time TA = 0ns , // stimuli application time
parameter time TT = 0ns // stimuli test time
);
virtual AXI_LITE_DV #(
.AXI_ADDR_WIDTH(AW),
.AXI_DATA_WIDTH(DW)
) axi;
function new(
virtual AXI_LITE_DV #(
.AXI_ADDR_WIDTH(AW),
.AXI_DATA_WIDTH(DW)
) axi
);
this.axi = axi;
endfunction
function void reset_master();
axi.aw_addr <= '0;
axi.aw_prot <= '0;
axi.aw_valid <= '0;
axi.w_valid <= '0;
axi.w_data <= '0;
axi.w_strb <= '0;
axi.b_ready <= '0;
axi.ar_valid <= '0;
axi.ar_prot <= '0;
axi.ar_addr <= '0;
axi.r_ready <= '0;
endfunction
function void reset_slave();
axi.aw_ready <= '0;
axi.w_ready <= '0;
axi.b_resp <= '0;
axi.b_valid <= '0;
axi.ar_ready <= '0;
axi.r_data <= '0;
axi.r_resp <= '0;
axi.r_valid <= '0;
endfunction
task cycle_start;
#TT;
endtask
task cycle_end;
@(posedge axi.clk_i);
endtask
/// Issue a beat on the AW channel.
task send_aw (
input logic [AW-1:0] addr,
input prot_t prot
);
axi.aw_addr <= #TA addr;
axi.aw_prot <= #TA prot;
axi.aw_valid <= #TA 1;
cycle_start();
while (axi.aw_ready != 1) begin cycle_end(); cycle_start(); end
cycle_end();
axi.aw_addr <= #TA '0;
axi.aw_prot <= #TA '0;
axi.aw_valid <= #TA 0;
endtask
/// Issue a beat on the W channel.
task send_w (
input logic [DW-1:0] data,
input logic [DW/8-1:0] strb
);
axi.w_data <= #TA data;
axi.w_strb <= #TA strb;
axi.w_valid <= #TA 1;
cycle_start();
while (axi.w_ready != 1) begin cycle_end(); cycle_start(); end
cycle_end();
axi.w_data <= #TA '0;
axi.w_strb <= #TA '0;
axi.w_valid <= #TA 0;
endtask
/// Issue a beat on the B channel.
task send_b (
input axi_pkg::resp_t resp
);
axi.b_resp <= #TA resp;
axi.b_valid <= #TA 1;
cycle_start();
while (axi.b_ready != 1) begin cycle_end(); cycle_start(); end
cycle_end();
axi.b_resp <= #TA '0;
axi.b_valid <= #TA 0;
endtask
/// Issue a beat on the AR channel.
task send_ar (
input logic [AW-1:0] addr,
input prot_t prot
);
axi.ar_addr <= #TA addr;
axi.ar_prot <= #TA prot;
axi.ar_valid <= #TA 1;
cycle_start();
while (axi.ar_ready != 1) begin cycle_end(); cycle_start(); end
cycle_end();
axi.ar_addr <= #TA '0;
axi.ar_prot <= #TA '0;
axi.ar_valid <= #TA 0;
endtask
/// Issue a beat on the R channel.
task send_r (
input logic [DW-1:0] data,
input axi_pkg::resp_t resp
);
axi.r_data <= #TA data;
axi.r_resp <= #TA resp;
axi.r_valid <= #TA 1;
cycle_start();
while (axi.r_ready != 1) begin cycle_end(); cycle_start(); end
cycle_end();
axi.r_data <= #TA '0;
axi.r_resp <= #TA '0;
axi.r_valid <= #TA 0;
endtask
/// Wait for a beat on the AW channel.
task recv_aw (
output [AW-1:0] addr,
output prot_t prot
);
axi.aw_ready <= #TA 1;
cycle_start();
while (axi.aw_valid != 1) begin cycle_end(); cycle_start(); end
addr = axi.aw_addr;
prot = axi.aw_prot;
cycle_end();
axi.aw_ready <= #TA 0;
endtask
/// Wait for a beat on the W channel.
task recv_w (
output [DW-1:0] data,
output [DW/8-1:0] strb
);
axi.w_ready <= #TA 1;
cycle_start();
while (axi.w_valid != 1) begin cycle_end(); cycle_start(); end
data = axi.w_data;
strb = axi.w_strb;
cycle_end();
axi.w_ready <= #TA 0;
endtask
/// Wait for a beat on the B channel.
task recv_b (
output axi_pkg::resp_t resp
);
axi.b_ready <= #TA 1;
cycle_start();
while (axi.b_valid != 1) begin cycle_end(); cycle_start(); end
resp = axi.b_resp;
cycle_end();
axi.b_ready <= #TA 0;
endtask
/// Wait for a beat on the AR channel.
task recv_ar (
output [AW-1:0] addr,
output prot_t prot
);
axi.ar_ready <= #TA 1;
cycle_start();
while (axi.ar_valid != 1) begin cycle_end(); cycle_start(); end
addr = axi.ar_addr;
prot = axi.ar_prot;
cycle_end();
axi.ar_ready <= #TA 0;
endtask
/// Wait for a beat on the R channel.
task recv_r (
output [DW-1:0] data,
output axi_pkg::resp_t resp
);
axi.r_ready <= #TA 1;
cycle_start();
while (axi.r_valid != 1) begin cycle_end(); cycle_start(); end
data = axi.r_data;
resp = axi.r_resp;
cycle_end();
axi.r_ready <= #TA 0;
endtask
endclass
/// The data transferred on a beat on the AW/AR channels.
class axi_ax_beat #(
parameter AW = 32,
parameter IW = 8 ,
parameter UW = 1
);
rand logic [IW-1:0] ax_id = '0;
rand logic [AW-1:0] ax_addr = '0;
logic [7:0] ax_len = '0;
logic [2:0] ax_size = '0;
logic [1:0] ax_burst = '0;
logic ax_lock = '0;
logic [3:0] ax_cache = '0;
logic [2:0] ax_prot = '0;
logic [3:0] ax_qos = '0;
logic [3:0] ax_region = '0;
logic [5:0] ax_atop = '0; // Only defined on the AW channel.
rand logic [UW-1:0] ax_user = '0;
endclass
/// The data transferred on a beat on the W channel.
class axi_w_beat #(
parameter DW = 32,
parameter UW = 1
);
rand logic [DW-1:0] w_data = '0;
rand logic [DW/8-1:0] w_strb = '0;
logic w_last = '0;
rand logic [UW-1:0] w_user = '0;
endclass
/// The data transferred on a beat on the B channel.
class axi_b_beat #(
parameter IW = 8,
parameter UW = 1
);
rand logic [IW-1:0] b_id = '0;
axi_pkg::resp_t b_resp = '0;
rand logic [UW-1:0] b_user = '0;
endclass
/// The data transferred on a beat on the R channel.
class axi_r_beat #(
parameter DW = 32,
parameter IW = 8 ,
parameter UW = 1
);
rand logic [IW-1:0] r_id = '0;
rand logic [DW-1:0] r_data = '0;
axi_pkg::resp_t r_resp = '0;
logic r_last = '0;
rand logic [UW-1:0] r_user = '0;
endclass
/// A driver for AXI4 interface.
class axi_driver #(
parameter int AW = 32 ,
parameter int DW = 32 ,
parameter int IW = 8 ,
parameter int UW = 1 ,
parameter time TA = 0ns , // stimuli application time
parameter time TT = 0ns // stimuli test time
);
virtual AXI_BUS_DV #(
.AXI_ADDR_WIDTH(AW),
.AXI_DATA_WIDTH(DW),
.AXI_ID_WIDTH(IW),
.AXI_USER_WIDTH(UW)
) axi;
typedef axi_ax_beat #(.AW(AW), .IW(IW), .UW(UW)) ax_beat_t;
typedef axi_w_beat #(.DW(DW), .UW(UW)) w_beat_t;
typedef axi_b_beat #(.IW(IW), .UW(UW)) b_beat_t;
typedef axi_r_beat #(.DW(DW), .IW(IW), .UW(UW)) r_beat_t;
function new(
virtual AXI_BUS_DV #(
.AXI_ADDR_WIDTH(AW),
.AXI_DATA_WIDTH(DW),
.AXI_ID_WIDTH(IW),
.AXI_USER_WIDTH(UW)
) axi
);
this.axi = axi;
endfunction
function void reset_master();
axi.aw_id <= '0;
axi.aw_addr <= '0;
axi.aw_len <= '0;
axi.aw_size <= '0;
axi.aw_burst <= '0;
axi.aw_lock <= '0;
axi.aw_cache <= '0;
axi.aw_prot <= '0;
axi.aw_qos <= '0;
axi.aw_region <= '0;
axi.aw_atop <= '0;
axi.aw_user <= '0;
axi.aw_valid <= '0;
axi.w_data <= '0;
axi.w_strb <= '0;
axi.w_last <= '0;
axi.w_user <= '0;
axi.w_valid <= '0;
axi.b_ready <= '0;
axi.ar_id <= '0;
axi.ar_addr <= '0;
axi.ar_len <= '0;
axi.ar_size <= '0;
axi.ar_burst <= '0;
axi.ar_lock <= '0;
axi.ar_cache <= '0;
axi.ar_prot <= '0;
axi.ar_qos <= '0;
axi.ar_region <= '0;
axi.ar_user <= '0;
axi.ar_valid <= '0;
axi.r_ready <= '0;
endfunction
function void reset_slave();
axi.aw_ready <= '0;
axi.w_ready <= '0;
axi.b_id <= '0;
axi.b_resp <= '0;
axi.b_user <= '0;
axi.b_valid <= '0;
axi.ar_ready <= '0;
axi.r_id <= '0;
axi.r_data <= '0;
axi.r_resp <= '0;
axi.r_last <= '0;
axi.r_user <= '0;
axi.r_valid <= '0;
endfunction
task cycle_start;
#TT;
endtask
task cycle_end;
@(posedge axi.clk_i);
endtask
/// Issue a beat on the AW channel.
task send_aw (
input ax_beat_t beat
);
axi.aw_id <= #TA beat.ax_id;
axi.aw_addr <= #TA beat.ax_addr;
axi.aw_len <= #TA beat.ax_len;
axi.aw_size <= #TA beat.ax_size;
axi.aw_burst <= #TA beat.ax_burst;
axi.aw_lock <= #TA beat.ax_lock;
axi.aw_cache <= #TA beat.ax_cache;
axi.aw_prot <= #TA beat.ax_prot;
axi.aw_qos <= #TA beat.ax_qos;
axi.aw_region <= #TA beat.ax_region;
axi.aw_atop <= #TA beat.ax_atop;
axi.aw_user <= #TA beat.ax_user;
axi.aw_valid <= #TA 1;
cycle_start();
while (axi.aw_ready != 1) begin cycle_end(); cycle_start(); end
cycle_end();
axi.aw_id <= #TA '0;
axi.aw_addr <= #TA '0;
axi.aw_len <= #TA '0;
axi.aw_size <= #TA '0;
axi.aw_burst <= #TA '0;
axi.aw_lock <= #TA '0;
axi.aw_cache <= #TA '0;
axi.aw_prot <= #TA '0;
axi.aw_qos <= #TA '0;
axi.aw_region <= #TA '0;
axi.aw_atop <= #TA '0;
axi.aw_user <= #TA '0;
axi.aw_valid <= #TA 0;
endtask
/// Issue a beat on the W channel.
task send_w (
input w_beat_t beat
);
axi.w_data <= #TA beat.w_data;
axi.w_strb <= #TA beat.w_strb;
axi.w_last <= #TA beat.w_last;
axi.w_user <= #TA beat.w_user;
axi.w_valid <= #TA 1;
cycle_start();
while (axi.w_ready != 1) begin cycle_end(); cycle_start(); end
cycle_end();
axi.w_data <= #TA '0;
axi.w_strb <= #TA '0;
axi.w_last <= #TA '0;
axi.w_user <= #TA '0;
axi.w_valid <= #TA 0;
endtask
/// Issue a beat on the B channel.
task send_b (
input b_beat_t beat
);
axi.b_id <= #TA beat.b_id;
axi.b_resp <= #TA beat.b_resp;
axi.b_user <= #TA beat.b_user;
axi.b_valid <= #TA 1;
cycle_start();
while (axi.b_ready != 1) begin cycle_end(); cycle_start(); end
cycle_end();
axi.b_id <= #TA '0;
axi.b_resp <= #TA '0;
axi.b_user <= #TA '0;
axi.b_valid <= #TA 0;
endtask
/// Issue a beat on the AR channel.
task send_ar (
input ax_beat_t beat
);
axi.ar_id <= #TA beat.ax_id;
axi.ar_addr <= #TA beat.ax_addr;
axi.ar_len <= #TA beat.ax_len;
axi.ar_size <= #TA beat.ax_size;
axi.ar_burst <= #TA beat.ax_burst;
axi.ar_lock <= #TA beat.ax_lock;
axi.ar_cache <= #TA beat.ax_cache;
axi.ar_prot <= #TA beat.ax_prot;
axi.ar_qos <= #TA beat.ax_qos;
axi.ar_region <= #TA beat.ax_region;
axi.ar_user <= #TA beat.ax_user;
axi.ar_valid <= #TA 1;
cycle_start();
while (axi.ar_ready != 1) begin cycle_end(); cycle_start(); end
cycle_end();
axi.ar_id <= #TA '0;
axi.ar_addr <= #TA '0;
axi.ar_len <= #TA '0;
axi.ar_size <= #TA '0;
axi.ar_burst <= #TA '0;
axi.ar_lock <= #TA '0;
axi.ar_cache <= #TA '0;
axi.ar_prot <= #TA '0;
axi.ar_qos <= #TA '0;
axi.ar_region <= #TA '0;
axi.ar_user <= #TA '0;
axi.ar_valid <= #TA 0;
endtask
/// Issue a beat on the R channel.
task send_r (
input r_beat_t beat
);
axi.r_id <= #TA beat.r_id;
axi.r_data <= #TA beat.r_data;
axi.r_resp <= #TA beat.r_resp;
axi.r_last <= #TA beat.r_last;
axi.r_user <= #TA beat.r_user;
axi.r_valid <= #TA 1;
cycle_start();
while (axi.r_ready != 1) begin cycle_end(); cycle_start(); end
cycle_end();
axi.r_id <= #TA '0;
axi.r_data <= #TA '0;
axi.r_resp <= #TA '0;
axi.r_last <= #TA '0;
axi.r_user <= #TA '0;
axi.r_valid <= #TA 0;
endtask
/// Wait for a beat on the AW channel.
task recv_aw (
output ax_beat_t beat
);
axi.aw_ready <= #TA 1;
cycle_start();
while (axi.aw_valid != 1) begin cycle_end(); cycle_start(); end
beat = new;
beat.ax_id = axi.aw_id;
beat.ax_addr = axi.aw_addr;
beat.ax_len = axi.aw_len;
beat.ax_size = axi.aw_size;
beat.ax_burst = axi.aw_burst;
beat.ax_lock = axi.aw_lock;
beat.ax_cache = axi.aw_cache;
beat.ax_prot = axi.aw_prot;
beat.ax_qos = axi.aw_qos;
beat.ax_region = axi.aw_region;
beat.ax_atop = axi.aw_atop;
beat.ax_user = axi.aw_user;
cycle_end();
axi.aw_ready <= #TA 0;
endtask
/// Wait for a beat on the W channel.
task recv_w (
output w_beat_t beat
);
axi.w_ready <= #TA 1;
cycle_start();
while (axi.w_valid != 1) begin cycle_end(); cycle_start(); end
beat = new;
beat.w_data = axi.w_data;
beat.w_strb = axi.w_strb;
beat.w_last = axi.w_last;
beat.w_user = axi.w_user;
cycle_end();
axi.w_ready <= #TA 0;
endtask
/// Wait for a beat on the B channel.
task recv_b (
output b_beat_t beat
);
axi.b_ready <= #TA 1;
cycle_start();
while (axi.b_valid != 1) begin cycle_end(); cycle_start(); end
beat = new;
beat.b_id = axi.b_id;
beat.b_resp = axi.b_resp;
beat.b_user = axi.b_user;
cycle_end();
axi.b_ready <= #TA 0;
endtask
/// Wait for a beat on the AR channel.
task recv_ar (
output ax_beat_t beat
);
axi.ar_ready <= #TA 1;
cycle_start();
while (axi.ar_valid != 1) begin cycle_end(); cycle_start(); end
beat = new;
beat.ax_id = axi.ar_id;
beat.ax_addr = axi.ar_addr;
beat.ax_len = axi.ar_len;
beat.ax_size = axi.ar_size;
beat.ax_burst = axi.ar_burst;
beat.ax_lock = axi.ar_lock;
beat.ax_cache = axi.ar_cache;
beat.ax_prot = axi.ar_prot;
beat.ax_qos = axi.ar_qos;
beat.ax_region = axi.ar_region;
beat.ax_atop = 'X; // Not defined on the AR channel.
beat.ax_user = axi.ar_user;
cycle_end();
axi.ar_ready <= #TA 0;
endtask
/// Wait for a beat on the R channel.
task recv_r (
output r_beat_t beat
);
axi.r_ready <= #TA 1;
cycle_start();
while (axi.r_valid != 1) begin cycle_end(); cycle_start(); end
beat = new;
beat.r_id = axi.r_id;
beat.r_data = axi.r_data;
beat.r_resp = axi.r_resp;
beat.r_last = axi.r_last;
beat.r_user = axi.r_user;
cycle_end();
axi.r_ready <= #TA 0;
endtask
endclass
class rand_axi_master #(
// AXI interface parameters
parameter int AW = 32,
parameter int DW = 32,
parameter int IW = 8,
parameter int UW = 1,
// Stimuli application and test time
parameter time TA = 0ps,
parameter time TT = 0ps,
// Maximum number of read and write transactions in flight
parameter int MAX_READ_TXNS = 1,
parameter int MAX_WRITE_TXNS = 1,
// Upper and lower bounds on wait cycles on Ax, W, and resp (R and B) channels
parameter int AX_MIN_WAIT_CYCLES = 0,
parameter int AX_MAX_WAIT_CYCLES = 100,
parameter int W_MIN_WAIT_CYCLES = 0,
parameter int W_MAX_WAIT_CYCLES = 5,
parameter int RESP_MIN_WAIT_CYCLES = 0,
parameter int RESP_MAX_WAIT_CYCLES = 20,
// AXI feature usage
parameter int AXI_MAX_BURST_LEN = 0, // maximum number of beats in burst; 0 = AXI max (256)
parameter int TRAFFIC_SHAPING = 0,
parameter bit AXI_EXCLS = 1'b0,
parameter bit AXI_ATOPS = 1'b0,
parameter bit AXI_BURST_FIXED = 1'b1,
parameter bit AXI_BURST_INCR = 1'b1,
parameter bit AXI_BURST_WRAP = 1'b0,
// Dependent parameters, do not override.
parameter int AXI_STRB_WIDTH = DW/8,
parameter int N_AXI_IDS = 2**IW
);
typedef axi_test::axi_driver #(
.AW(AW), .DW(DW), .IW(IW), .UW(UW), .TA(TA), .TT(TT)
) axi_driver_t;
typedef logic [AW-1:0] addr_t;
typedef axi_pkg::burst_t burst_t;
typedef axi_pkg::cache_t cache_t;
typedef logic [DW-1:0] data_t;
typedef logic [IW-1:0] id_t;
typedef axi_pkg::len_t len_t;
typedef axi_pkg::size_t size_t;
typedef logic [UW-1:0] user_t;
typedef axi_pkg::mem_type_t mem_type_t;
typedef axi_driver_t::ax_beat_t ax_beat_t;
typedef axi_driver_t::b_beat_t b_beat_t;
typedef axi_driver_t::r_beat_t r_beat_t;
typedef axi_driver_t::w_beat_t w_beat_t;
static addr_t PFN_MASK = '{11: 1'b0, 10: 1'b0, 9: 1'b0, 8: 1'b0, 7: 1'b0, 6: 1'b0, 5: 1'b0,
4: 1'b0, 3: 1'b0, 2: 1'b0, 1: 1'b0, 0: 1'b0, default: '1};
axi_driver_t drv;
int unsigned r_flight_cnt[N_AXI_IDS-1:0],
w_flight_cnt[N_AXI_IDS-1:0],
tot_r_flight_cnt,
tot_w_flight_cnt;
logic [N_AXI_IDS-1:0] atop_resp_b,
atop_resp_r;
len_t max_len;
burst_t allowed_bursts[$];
semaphore cnt_sem;
ax_beat_t aw_queue[$],
w_queue[$],
excl_queue[$];
typedef struct packed {
addr_t addr_begin;
addr_t addr_end;
mem_type_t mem_type;
} mem_region_t;
mem_region_t mem_map[$];
struct packed {
int unsigned len ;
int unsigned cprob;
} traffic_shape[$];
int unsigned max_cprob;
function new(
virtual AXI_BUS_DV #(
.AXI_ADDR_WIDTH(AW),
.AXI_DATA_WIDTH(DW),
.AXI_ID_WIDTH(IW),
.AXI_USER_WIDTH(UW)
) axi
);
if (AXI_MAX_BURST_LEN <= 0 || AXI_MAX_BURST_LEN > 256) begin
this.max_len = 255;
end else begin
this.max_len = AXI_MAX_BURST_LEN - 1;
end
this.drv = new(axi);
this.cnt_sem = new(1);
this.reset();
if (AXI_BURST_FIXED) begin
this.allowed_bursts.push_back(BURST_FIXED);
end
if (AXI_BURST_INCR) begin
this.allowed_bursts.push_back(BURST_INCR);
end
if (AXI_BURST_WRAP) begin
this.allowed_bursts.push_back(BURST_WRAP);
end
assert(allowed_bursts.size()) else $fatal(1, "At least one burst type has to be specified!");
endfunction
function void reset();
drv.reset_master();
r_flight_cnt = '{default: 0};
w_flight_cnt = '{default: 0};
tot_r_flight_cnt = 0;
tot_w_flight_cnt = 0;
atop_resp_b = '0;
atop_resp_r = '0;
endfunction
function void add_memory_region(input addr_t addr_begin, input addr_t addr_end, input mem_type_t mem_type);
mem_map.push_back({addr_begin, addr_end, mem_type});
endfunction
function void add_traffic_shaping(input int unsigned len, input int unsigned freq);
if (traffic_shape.size() == 0)
traffic_shape.push_back({len, freq});
else
traffic_shape.push_back({len, traffic_shape[$].cprob + freq});
max_cprob = traffic_shape[$].cprob;
endfunction : add_traffic_shaping
function ax_beat_t new_rand_burst(input logic is_read);
automatic logic rand_success;
automatic ax_beat_t ax_beat = new;
automatic addr_t addr;
automatic burst_t burst;
automatic cache_t cache;
automatic id_t id;
automatic len_t len;
automatic size_t size;
automatic int unsigned mem_region_idx;
automatic mem_region_t mem_region;
automatic int cprob;
// No memory regions defined
if (mem_map.size() == 0) begin
// Return a dummy region
mem_region = '{
addr_begin: '0,
addr_end: '1,
mem_type: axi_pkg::NORMAL_NONCACHEABLE_BUFFERABLE
};
end else begin
// Randomly pick a memory region
rand_success = std::randomize(mem_region_idx) with {
mem_region_idx < mem_map.size();
}; assert(rand_success);
mem_region = mem_map[mem_region_idx];
end
// Randomly pick burst type.
rand_success = std::randomize(burst) with {
burst inside {this.allowed_bursts};
}; assert(rand_success);
ax_beat.ax_burst = burst;
// Determine memory type.
ax_beat.ax_cache = is_read ? axi_pkg::get_arcache(mem_region.mem_type) : axi_pkg::get_awcache(mem_region.mem_type);
// Randomize beat size.
if (TRAFFIC_SHAPING) begin
rand_success = std::randomize(cprob) with {
cprob >= 0; cprob < max_cprob;
}; assert(rand_success);
for (int i = 0; i < traffic_shape.size(); i++)
if (traffic_shape[i].cprob > cprob) begin
len = traffic_shape[i].len;
assert (ax_beat.ax_burst == BURST_WRAP -> len inside {len_t'(1), len_t'(3), len_t'(7), len_t'(15)});
break;
end
// Randomize address. Make sure that the burst does not cross a 4KiB boundary.
forever begin
rand_success = std::randomize(size) with {
2**size <= AXI_STRB_WIDTH;
2**size <= len;
}; assert(rand_success);
ax_beat.ax_size = size;
ax_beat.ax_len = ((len + (1 << size) - 1) >> size) - 1;
rand_success = std::randomize(addr) with {
addr >= mem_region.addr_begin;
addr <= mem_region.addr_end;
addr + len <= mem_region.addr_end;
}; assert(rand_success);
if (ax_beat.ax_burst == axi_pkg::BURST_FIXED) begin
if (((addr + 2**ax_beat.ax_size) & PFN_MASK) == (addr & PFN_MASK)) begin
break;
end
end else begin // BURST_INCR
if (((addr + 2**ax_beat.ax_size * (ax_beat.ax_len + 1)) & PFN_MASK) == (addr & PFN_MASK)) begin
break;
end
end
end
end else begin
// Randomize address. Make sure that the burst does not cross a 4KiB boundary.
forever begin
// Randomize burst length.
rand_success = std::randomize(len) with {
len <= this.max_len;
(ax_beat.ax_burst == BURST_WRAP) ->
len inside {len_t'(1), len_t'(3), len_t'(7), len_t'(15)};
}; assert(rand_success);
rand_success = std::randomize(size) with {
2**size <= AXI_STRB_WIDTH;
}; assert(rand_success);
ax_beat.ax_size = size;
ax_beat.ax_len = len;
// Randomize address
rand_success = std::randomize(addr) with {
addr >= mem_region.addr_begin;
addr <= mem_region.addr_end;
addr + ((len + 1) << size) <= mem_region.addr_end;
}; assert(rand_success);
if (ax_beat.ax_burst == axi_pkg::BURST_FIXED) begin
if (((addr + 2**ax_beat.ax_size) & PFN_MASK) == (addr & PFN_MASK)) begin
break;
end
end else begin // BURST_INCR, BURST_WRAP
if (((addr + 2**ax_beat.ax_size * (ax_beat.ax_len + 1)) & PFN_MASK) == (addr & PFN_MASK)) begin
break;
end
end
end
end
ax_beat.ax_addr = addr;
rand_success = std::randomize(id); assert(rand_success);
ax_beat.ax_id = id;
return ax_beat;
endfunction
task rand_atop_burst(inout ax_beat_t beat);
automatic logic rand_success;
automatic id_t id;
beat.ax_atop[5:4] = $random();
if (beat.ax_atop[5:4] != 2'b00) begin // ATOP
// Determine `ax_atop`.
if (beat.ax_atop[5:4] == axi_pkg::ATOP_ATOMICSTORE ||
beat.ax_atop[5:4] == axi_pkg::ATOP_ATOMICLOAD) begin
// Endianness
beat.ax_atop[3] = $random();
// Atomic operation
beat.ax_atop[2:0] = $random();
end else begin // Atomic{Swap,Compare}
beat.ax_atop[3:1] = '0;
beat.ax_atop[0] = $random();
end
// Determine `ax_size` and `ax_len`.
if (2**beat.ax_size < AXI_STRB_WIDTH) begin
// Transaction does *not* occupy full data bus, so we must send just one beat. [E2.1.3]
beat.ax_len = '0;
end else begin
automatic int unsigned bytes;
if (beat.ax_atop == axi_pkg::ATOP_ATOMICCMP) begin
// Total data transferred in burst can be 2, 4, 8, 16, or 32 B.
automatic int unsigned log_bytes;
rand_success = std::randomize(log_bytes) with {
log_bytes > 0; 2**log_bytes >= AXI_STRB_WIDTH; 2**log_bytes <= 32;
}; assert(rand_success);
bytes = 2**log_bytes;
end else begin
// Total data transferred in burst can be 1, 2, 4, or 8 B.
if (AXI_STRB_WIDTH >= 8) begin
bytes = AXI_STRB_WIDTH;
end else begin
automatic int unsigned log_bytes;
rand_success = std::randomize(log_bytes); assert(rand_success);
log_bytes = log_bytes % (4 - $clog2(AXI_STRB_WIDTH)) - $clog2(AXI_STRB_WIDTH);
bytes = 2**log_bytes;
end
end
beat.ax_len = bytes / AXI_STRB_WIDTH - 1;
end
// Determine `ax_addr` and `ax_burst`.
if (beat.ax_atop == axi_pkg::ATOP_ATOMICCMP) begin
// The address must be aligned to half the outbound data size. [E2-337]
beat.ax_addr = beat.ax_addr & ~((1'b1 << beat.ax_size) - 1);
// If the address is aligned to the total size of outgoing data, the burst type must be
// INCR. Otherwise, it must be WRAP. [E2-338]
beat.ax_burst = (beat.ax_addr % ((beat.ax_len+1) * 2**beat.ax_size) == 0) ?
axi_pkg::BURST_INCR : axi_pkg::BURST_WRAP;
// If we are not allowed to emit WRAP bursts, align the address to the total size of
// outgoing data and fall back to INCR.
if (beat.ax_burst == axi_pkg::BURST_WRAP && !AXI_BURST_WRAP) begin
beat.ax_addr -= (beat.ax_addr % ((beat.ax_len+1) * 2**beat.ax_size));
beat.ax_burst = axi_pkg::BURST_INCR;
end
end else begin
// The address must be aligned to the data size. [E2-337]
beat.ax_addr = beat.ax_addr & ~((1'b1 << (beat.ax_size+1)) - 1);
// Only INCR allowed.
beat.ax_burst = axi_pkg::BURST_INCR;
end
// Determine `ax_id`, which must not be the same as that of any other in-flight AXI
// transaction.
forever begin
cnt_sem.get();
rand_success = std::randomize(id); assert(rand_success);
if (r_flight_cnt[id] == 0 && w_flight_cnt[id] == 0 && !atop_resp_b[id] &&
!atop_resp_r[id]) begin
break;
end else begin
// The random ID does not meet the requirements, so try another ID in the next cycle.
cnt_sem.put();
rand_wait(1, 1);
end
end
atop_resp_b[id] = 1'b1;
if (beat.ax_atop[5] == 1'b1) begin
atop_resp_r[id] = 1'b1;
end
end else begin
// Determine `ax_id`, which must not be the same as that of any in-flight ATOP.
forever begin
cnt_sem.get();
rand_success = std::randomize(id); assert(rand_success);
if (!atop_resp_b[id] && !atop_resp_r[id]) begin
break;
end else begin
// The random ID does not meet the requirements, so try another ID in the next cycle.
cnt_sem.put();
rand_wait(1, 1);
end
end
end
beat.ax_id = id;
w_flight_cnt[id]++;
cnt_sem.put();
endtask
function void rand_excl_ar(inout ax_beat_t ar_beat);
ar_beat.ax_lock = $random();
if (ar_beat.ax_lock) begin
automatic logic rand_success;
automatic int unsigned n_bytes;
automatic size_t size;
automatic addr_t addr_mask;
// In an exclusive burst, the number of bytes to be transferred must be a power of 2, i.e.,
// 1, 2, 4, 8, 16, 32, 64, or 128 bytes, and the burst length must not exceed 16 transfers.
static int unsigned ul = (AXI_STRB_WIDTH < 8) ? 4 + $clog2(AXI_STRB_WIDTH) : 7;
rand_success = std::randomize(n_bytes) with {
n_bytes >= 1;
n_bytes <= ul;
}; assert(rand_success);
n_bytes = 2**n_bytes;
rand_success = std::randomize(size) with {
size >= 0;
2**size <= n_bytes;
2**size <= AXI_STRB_WIDTH;
n_bytes / 2**size <= 16;
}; assert(rand_success);
ar_beat.ax_size = size;
ar_beat.ax_len = n_bytes / 2**size;
// The address must be aligned to the total number of bytes in the burst.
ar_beat.ax_addr = ar_beat.ax_addr & ~(n_bytes-1);
end
endfunction
// TODO: The `rand_wait` task exists in `rand_verif_pkg`, but that task cannot be called with
// `this.drv.axi.clk_i` as `clk` argument. What is the syntax for getting an assignable
// reference?
task automatic rand_wait(input int unsigned min, max);
int unsigned rand_success, cycles;
rand_success = std::randomize(cycles) with {
cycles >= min;
cycles <= max;
};
assert (rand_success) else $error("Failed to randomize wait cycles!");
repeat (cycles) @(posedge this.drv.axi.clk_i);
endtask
task send_ars(input int n_reads);
automatic logic rand_success;
repeat (n_reads) begin
automatic id_t id;
automatic ax_beat_t ar_beat = new_rand_burst(1'b1);
while (tot_r_flight_cnt >= MAX_READ_TXNS) begin
rand_wait(1, 1);
end
if (AXI_EXCLS) begin
rand_excl_ar(ar_beat);
end
if (AXI_ATOPS) begin
// The ID must not be the same as that of any in-flight ATOP.
forever begin
cnt_sem.get();
rand_success = std::randomize(id); assert(rand_success);
if (!atop_resp_b[id] && !atop_resp_r[id]) begin
break;
end else begin