forked from chipsalliance/VeeR-ISS
-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathMcm.cpp
5426 lines (4388 loc) · 147 KB
/
Mcm.cpp
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
#include <iostream>
#include <string_view>
#include "Mcm.hpp"
#include "System.hpp"
using namespace WdRiscv;
using std::cerr;
template <typename URV>
Mcm<URV>::Mcm(unsigned hartCount, unsigned pageSize, unsigned mergeBufferSize)
: pageSize_(pageSize), lineSize_(mergeBufferSize)
{
sysMemOps_.reserve(200000);
hartData_.resize(hartCount);
for (auto& hd : hartData_)
{
hd.instrVec_.resize(200000);
hd.regTime_.resize(totalRegCount_);
hd.regProducer_.resize(totalRegCount_);
}
// If no merge buffer, then memory is updated on insert messages.
writeOnInsert_ = (lineSize_ == 0);
// Enable all rules.
ppoEnabled_.resize(PpoRule::Limit, true);
// Currently Io PPO is disabled by default.
ppoEnabled_.at(unsigned(PpoRule::Io)) = false;
}
template <typename URV>
Mcm<URV>::~Mcm() = default;
template <typename URV>
inline
bool
Mcm<URV>::updateTime(const char* method, uint64_t time)
{
if (time < time_)
{
cerr << "Warning: " << method << ": Backward time: "
<< time << " < " << time_ << "\n";
return true;
}
time_ = time;
return true;
}
template <typename URV>
bool
Mcm<URV>::referenceModelRead(Hart<URV>& hart, uint64_t pa, unsigned size, uint64_t& data)
{
data = 0;
if (hart.isDeviceAddr(pa))
{
hart.deviceRead(pa, size, data);
return true;
}
if (uint64_t toHost = 0; hart.getToHostAddress(toHost) && toHost == pa)
return true; // Reading from toHost yields 0.
bool ok = true;
if (size == 1)
{
uint8_t val = 0;
ok = hart.peekMemory(pa, val, true /*usePma*/);
data = val;
}
else if (size == 2)
{
uint16_t val = 0;
ok = hart.peekMemory(pa, val, true /*usePma*/);
data = val;
}
else if (size == 4)
{
uint32_t val = 0;
ok = hart.peekMemory(pa, val, true /*usePma*/);
data = val;
}
else if (size == 8)
{
uint64_t val = 0;
ok = hart.peekMemory(pa, val, true /*usePma*/);
data = val;
}
else if (size < 8)
{
uint8_t val = 0;
for (unsigned i = 0; i < size; ++i)
if (not hart.peekMemory(pa + i, val, true))
{
ok = false;
break;
}
else
data = data | (uint64_t(val) << (8*i));
}
else
assert(0 && "invalid mcm-read size");
return ok;
}
template <typename URV>
bool
Mcm<URV>::readOp(Hart<URV>& hart, uint64_t time, uint64_t tag, uint64_t pa, unsigned size,
uint64_t rtlData, unsigned elemIx, unsigned field)
{
if (not updateTime("Mcm::readOp", time))
return false;
if (size == 0 or size > 8)
{
cerr << "Error: Mcm::readOp: hart-id=" << hart.hartId() << " time=" << time
<< " tag=" << tag << " invalid read size: " << size << '\n';
return false;
}
// Split in two ops Crossing a line boundary to avoid being too pessimistic
// when checking for overlap with stores from other harts
if (lineNum(pa) != lineNum(pa + size - 1))
{
unsigned size1 = offsetToNextLine(pa);
unsigned size2 = size - size1;
uint64_t pa2 = pa + size1;
uint64_t rtlData1 = rtlData & ((uint64_t(1) << (size1*8)) - 1);
uint64_t rtlData2 = rtlData >> (size1*8);
bool ok = readOp_(hart, time, tag, pa, size1, rtlData1, elemIx, field);
ok = readOp_(hart, time, tag, pa2, size2, rtlData2, elemIx, field) and ok;
return ok;
}
return readOp_(hart, time, tag, pa, size, rtlData, elemIx, field);
}
template <typename URV>
bool
Mcm<URV>::readOp_(Hart<URV>& hart, uint64_t time, uint64_t tag, uint64_t pa, unsigned size,
uint64_t rtlData, unsigned elemIx, unsigned field)
{
unsigned hartIx = hart.sysHartIndex();
McmInstr* instr = findOrAddInstr(hartIx, tag);
if (instr->isCanceled())
return true;
if (instr->isRetired() and not hart.getPma(pa).isIo())
cerr << "Warning: hart-id=" << hart.hartId() << " time=" << time <<
" tag=" << tag << " read-op seen after instruction retires\n";
pa = hart.clearSecureAddressSteeBits(pa);
MemoryOp op = {};
op.time_ = time;
op.pa_ = pa;
op.rtlData_ = rtlData;
op.tag_ = tag;
op.hartIx_ = hartIx;
op.size_ = size;
op.isRead_ = true;
op.canceled_ = true; // To be later marked as false if used.
op.elemIx_ = elemIx;
op.field_ = field;
op.isIo_ = hart.getPma(op.pa_).isIo();
assert(pageNum(pa) == pageNum(pa + size - 1));
instr->isLoad_ = true;
// Read Whisper memory and keep it in op, this will be updated when the load is retired
// by forwarding from preceding stores.
uint64_t refVal = 0;
if (referenceModelRead(hart, pa, size, refVal))
op.data_ = refVal;
else
op.failRead_ = true;
if (sysMemOps_.empty() or sysMemOps_.back().time_ <= time)
{
instr->addMemOp(sysMemOps_.size());
sysMemOps_.push_back(op);
}
else
{
// Sometimes the test-bench will unexpectedly send us a read-op with an out of order
// time-stamp. We hack a repair.
// Find first existing op with time > current time.
auto iter = std::upper_bound(sysMemOps_.begin(), sysMemOps_.end(), time,
[](const uint64_t& t, const MemoryOp& mop) -> bool
{ return t < mop.time_; });
// Insert new op before the found op.
assert(iter != sysMemOps_.end());
size_t ix = iter - sysMemOps_.begin();
sysMemOps_.insert(iter, op);
// Adjust indices of all the instructions referencing ops that are now after new op
// in sysMemOps_.
// One set of adjusted tags per hart.
std::vector< std::unordered_set<uint64_t> > adjustedTags(hartData_.size());
for (size_t i = ix + 1; i < sysMemOps_.size(); ++i)
{
auto& movedOp = sysMemOps_.at(i);
auto& instrVec = hartData_.at(movedOp.hartIx_).instrVec_;
auto& tagSet = adjustedTags.at(movedOp.hartIx_);
auto tag = movedOp.tag_;
if (tagSet.contains(tag))
continue;
tagSet.insert(tag);
auto& instr = instrVec.at(tag);
for (auto& instrOpIx : instr.memOps_)
if (instrOpIx >= ix)
instrOpIx++;
}
// Associate new op with instruction. This has to be done after the indices are
// adjusted otherwise we may get an "op already added" error.
instr->addMemOp(ix);
}
if (instr->retired_)
instr->complete_ = checkLoadComplete(*instr);
return true;
}
template <typename URV>
McmInstr*
Mcm<URV>::findInstr(unsigned hartIx, uint32_t tag)
{
auto& vec = hartData_.at(hartIx).instrVec_;
if (tag < vec.size() and vec.at(tag).tag_ == tag)
return &(vec.at(tag));
return nullptr;
}
template <typename URV>
McmInstr*
Mcm<URV>::findOrAddInstr(unsigned hartIx, uint32_t tag)
{
auto ptr = findInstr(hartIx, tag);
if (ptr)
return ptr;
auto& vec = hartData_.at(hartIx).instrVec_;
if (tag >= vec.size())
{
if (tag > 500000000)
{
cerr << "MCM: Instruction tag way too large: " << tag << '\n';
cerr << "MCM: Code expects dense consecutive tags starting at 0\n";
assert(0);
}
McmInstr instr;
instr.tag_ = tag;
instr.hartIx_ = hartIx;
vec.resize(tag + 1);
vec.at(tag) = instr;
return &vec.at(tag);
}
if (vec.at(tag).tag_ != 0)
{
cerr << "Mcm::findOrAddInstr: Error: Instr tag already in use\n";
assert(0 && "Mcm::findOrAddInstr: Instr tag already in use");
}
vec.at(tag).tag_ = tag;
vec.at(tag).hartIx_ = hartIx;
return &vec.at(tag);
}
template <typename URV>
void
Mcm<URV>::setBranchMemTime(const Hart<URV>& hart, const McmInstr& instr)
{
const DecodedInst& di = instr.di_;
if (not di.isBranch())
return;
unsigned hartIx = hart.sysHartIndex();
auto& regTimeVec = hartData_.at(hartIx).regTime_;
auto& branchTime = hartData_.at(hartIx).branchTime_;
auto& branchProducer = hartData_.at(hartIx).branchProducer_;
auto& regProducer = hartData_.at(hartIx).regProducer_;
std::vector<unsigned> sourceRegs, destRegs;
identifyRegisters(hart, di, sourceRegs, destRegs);
branchTime = 0;
branchProducer = 0;
if (sourceRegs.empty())
return;
for (auto regIx : sourceRegs)
{
if (regTimeVec.at(regIx) > branchTime)
{
branchTime = regTimeVec.at(regIx);
branchProducer = regProducer.at(regIx);
}
}
}
template <typename URV>
unsigned
Mcm<URV>::getLdStDataVectors(const Hart<URV>& hart, const McmInstr& instr,
std::array<std::pair<unsigned,VecKind>, 32>& vecs) const
{
if (not instr.di_.isVectorLoad() and not instr.di_.isVectorStore())
return 0;
auto& info = hart.getLastVectorMemory();
auto& elems = info.elems_;
unsigned elemSize = info.elemSize_;
assert(elemSize != 0);
unsigned elemsPerVec = hart.vecRegSize() / elemSize;
std::array<bool, 32> referenced; for (auto& x : referenced) x = false;
std::array<bool, 32> active; for (auto& x : active) x = false;
std::array<bool, 32> preserve; for (auto& x : preserve) x = true;
bool maskAgn = hart.isVectorMaskAgnostic();
bool tailAgn = hart.isVectorTailAgnostic();
for (auto& elem : elems)
{
unsigned regNum = info.vec_ + elem.field_*info.group_ + elem.ix_ / elemsPerVec;
referenced.at(regNum) = true; // Vector covers one or more element of instr.
if (elem.skip_)
{
bool masked = elem.ix_ < info.elemCount_;
bool drop = masked ? maskAgn : tailAgn;
preserve.at(regNum) = preserve.at(regNum) and not drop;
}
else
active.at(regNum) = true; // Vector has one or more active element.
}
unsigned count = 0;
for (unsigned regNum = 0; regNum < 32; ++regNum)
if (referenced.at(regNum))
{
VecKind kind = VecKind::Skip;
if (active.at(regNum))
kind = VecKind::Active;
else if (preserve.at(regNum))
kind = VecKind::Preserve;
vecs.at(count++) = std::pair<unsigned, VecKind>{regNum, kind};
}
return count;
}
template <typename URV>
unsigned
Mcm<URV>::getLdStIndexVectors(const Hart<URV>& hart, const McmInstr& instr,
std::array<std::pair<unsigned,VecKind>, 32>& vecs) const
{
if (not instr.di_.isVectorLoad() and not instr.di_.isVectorStore())
return 0;
auto& info = hart.getLastVectorMemory();
if (not info.isIndexed_)
return 0;
auto& elems = info.elems_;
unsigned ixElemSize = hart.vecLdStIndexElemSize(instr.di_);
assert(ixElemSize != 0);
unsigned elemsPerVec = hart.vecRegSize() / ixElemSize;
std::array<bool, 32> referenced; for (auto& x : referenced) x = false;
std::array<bool, 32> active; for (auto& x : active) x = false;
for (auto& elem : elems)
{
unsigned regNum = info.ixVec_ + elem.ix_ / elemsPerVec;
// It's possible tail extends past the number of registers. This is because
// we do not perform a read for indices part of the tail.
if (elem.ix_ >= info.elemCount_)
continue;
if (not elem.skip_)
active.at(regNum) = true;
referenced.at(regNum) = true;
}
unsigned count = 0;
for (unsigned regNum = 0; regNum < 32; ++regNum)
if (referenced.at(regNum))
{
VecKind kind = active.at(regNum)? VecKind::Active : VecKind::Skip;
vecs.at(count++) = std::pair<unsigned, VecKind>{regNum, kind};
}
return count;
}
static bool isUnitStride(const VecLdStInfo& info)
{
if (info.isIndexed_)
return false;
if (not info.isStrided_)
return true;
unsigned nf = info.fields_ == 0 ? 1 : info.fields_;
return nf * info.elemSize_ == info.stride_;
}
template <typename URV>
void
Mcm<URV>::updateVecLoadDependencies(const Hart<URV>& hart, const McmInstr& instr)
{
assert(instr.di_.isVectorLoad());
auto& info = hart.getLastVectorMemory();
auto& elems = info.elems_;
unsigned elemSize = info.elemSize_;
assert(elemSize != 0);
unsigned elemsPerVec = hart.vecRegSize() / elemSize;
bool unitStride = isUnitStride(info);
bool stride0 = info.isStrided_ and info.stride_ == 0 and info.fields_ == 0;
unsigned hartIx = hart.sysHartIndex();
// Initialize producer/time to 0 unless whole vector is preserved.
std::array<std::pair<unsigned, VecKind>, 32> dataRegs;
unsigned count = getLdStDataVectors(hart, instr, dataRegs);
for (unsigned i = 0; i < count; ++i)
{
auto [regNum, kind] = dataRegs.at(i);
if (kind != VecKind::Preserve)
{
setVecRegTime(hartIx, regNum, 0);
setVecRegProducer(hartIx, regNum, 0);
}
}
if (elemSize == 0 or elems.empty())
return; // Should not happen.
for (auto& elem : elems)
{
if (elem.skip_)
continue; // Non active element
uint64_t pa1 = elem.pa_, pa2 = elem.pa2_;
unsigned size = elemSize, size1 = elemSize;
if (pa1 != pa2)
{
size1 = offsetToNextPage(pa1);
assert(size1 > 0 and size1 < 8);
}
unsigned regNum = info.vec_ + elem.field_*info.group_ + elem.ix_ / elemsPerVec;
auto regTime = vecRegTime(hartIx, regNum);
for (unsigned i = 0; i < size; ++i)
{
uint64_t addr = i < size1 ? pa1 + i : pa2 + i - size1;
uint64_t byteTime = 0;
// For strided with stride=0, test-bench sends one read for all indices.
// Don't use element index for that case.
if (unitStride or stride0)
byteTime = latestByteTime(instr, addr);
else
byteTime = latestByteTime(instr, addr, elem.ix_);
regTime = std::max(byteTime, regTime);
}
setVecRegTime(hartIx, regNum, regTime);
McmInstrIx regProd = (regTime == 0)? 0 : instr.tag_;
setVecRegProducer(hartIx, regNum, regProd);
}
}
template <typename URV>
void
Mcm<URV>::updateDependencies(const Hart<URV>& hart, const McmInstr& instr)
{
assert(instr.retired_);
const DecodedInst& di = instr.di_;
assert(di.isValid());
if (di.operandCount() == 0)
return; // No registers.
if (di.isVectorLoad())
{
updateVecLoadDependencies(hart, instr);
return;
}
if ((di.isStore() and not di.isSc()) or di.isVectorStore())
return; // No destination register.
uint64_t time = 0, tag = 0, csrTime = 0, csrTag = 0;
if (di.isSc())
{
if (URV val = 0; hart.peekIntReg(di.op0(), val) and val == 1)
return; // store-conditional failed.
if (instr.memOps_.empty())
time = ~uint64_t(0); // Will be updated when SC drains to memory.
}
if (not instr.memOps_.empty())
{
// At this point only load/amo/sc instructions should have memory ops.
assert(di.isLoad() or di.isAmo() or di.isSc());
for (const auto& opIx : instr.memOps_)
if (opIx < sysMemOps_.size() and sysMemOps_.at(opIx).time_ > time)
time = sysMemOps_.at(opIx).time_;
}
unsigned hartIx = hart.sysHartIndex();
auto& regTimeVec = hartData_.at(hartIx).regTime_;
auto& regProducer = hartData_.at(hartIx).regProducer_;
// Load/amo/sc/branch/mop do not carry dependencies to dest register: Update time of dest.
if (di.isLoad() or di.isAmo() or di.isSc() or di.isBranch() or di.isMop())
{
auto regIx = effectiveRegIx(di, 0);
if (di.ithOperandMode(0) == OperandMode::Write and regIx != 0)
{
regProducer.at(regIx) = instr.tag_;
regTimeVec.at(regIx) = time;
}
return;
}
// Propagate times from source to destination registers.
auto id = di.instId();
bool isVset = (id == InstId::vsetvl or id == InstId::vsetvli or id == InstId::vsetivli);
if (di.isVector() and not isVset)
{
updateVecRegTimes(hart, instr);
return;
}
bool updatesVl = (id == InstId::vsetvl or id == InstId::vsetvli) and (di.op0() or di.op1());
auto& vlTime = hartData_.at(hartIx).vlTime_;
auto& vlProducer = hartData_.at(hartIx).vlProducer_;
std::vector<unsigned> sourceRegs, destRegs;
identifyRegisters(hart, di, sourceRegs, destRegs);
for (auto regIx : sourceRegs)
{
bool isCsr = regIx >= csRegOffset_;
if (isCsr)
{
csrTime = regTimeVec.at(regIx);
csrTag = regProducer.at(regIx);
continue;
}
if (regTimeVec.at(regIx) > time)
{
time = regTimeVec.at(regIx);
tag = regProducer.at(regIx);
}
if (updatesVl and regTimeVec.at(regIx) > vlTime)
{
vlTime = regTimeVec.at(regIx);
vlProducer = regProducer.at(regIx);
}
}
unsigned vlIx = csRegOffset_ + unsigned(CsrNumber::VL);
for (auto regIx : destRegs)
{
if (regIx == 0)
continue; // Destination is X0
if (not instr.di_.isCsr() or regIx >= csRegOffset_)
{ // Non-CSR instruction or destination is a CSR register.
regTimeVec.at(regIx) = time;
regProducer.at(regIx) = tag;
if (regIx == vlIx and time > vlTime)
{
vlTime = time;
vlProducer = tag;
}
}
else
{ // Integer destination register of a CSR instruction.
regTimeVec.at(regIx) = csrTime;
regProducer.at(regIx) = csrTag;
}
}
}
template <typename URV>
void
Mcm<URV>::updateVecRegTimes(const Hart<URV>& hart, const McmInstr& instr)
{
auto& di = instr.di_;
auto opCount = di.operandCount();
if (opCount == 0)
return;
auto id = di.instId();
bool isVset = (id == InstId::vsetvl or id == InstId::vsetvli or id == InstId::vsetivli);
if (isVset)
{
assert(0);
return;
}
auto hartIx = instr.hartIx_;
auto& regProducer = hartData_.at(hartIx).regProducer_;
auto& regTimeVec = hartData_.at(hartIx).regTime_;
uint64_t time = 0, tag = 0;
assert(di.ithOperandMode(0) == OperandMode::Write); // 1st operand must be the destination
if (di.ithOperandType(0) != OperandType::VecReg)
{
// Destination register is scalar: vcpop.m, vfirst.m, vmv.x.s, or vmv.f.s
assert(id == InstId::vcpop_m or id == InstId::vfirst_m or id == InstId::vmv_x_s or
id == InstId::vfmv_f_s);
assert(opCount == 2);
assert(di.ithOperandType(1) == OperandType::VecReg); // 2nd operand must be vec
auto destIx = effectiveRegIx(di, 0);
if (destIx == 0)
return; // Destination is X0
// Get group multiplier of vector register.
unsigned lmul = 1; // vmv instructions ignore LMUL
if (id == InstId::vcpop_m or id == InstId::vfirst_m)
lmul = hart.vecOpEmul(1);
unsigned baseRegIx = effectiveRegIx(di, 1);
for (unsigned i = 0; i < lmul; ++i)
{
unsigned srcIx = baseRegIx + i;
auto srcTime = regTimeVec.at(srcIx);
if (srcTime > time)
{
time = srcTime;
tag = regProducer.at(srcIx);
}
}
regProducer.at(destIx) = tag;
regTimeVec.at(destIx) = time;
return;
}
auto destEmul = hart.vecOpEmul(0);
unsigned baseDestIx = effectiveRegIx(di, 0);
for (unsigned ii = 0; ii < destEmul; ++ii)
{
time = 0;
tag = 0;
auto destIx = baseDestIx + ii;
// Process all source operands.
for (unsigned so = 1; so < opCount; ++so)
{
if (di.ithOperandType(so) == OperandType::Imm)
continue;
assert(di.ithOperandMode(so) == OperandMode::Read);
if (di.ithOperandType(so) != OperandType::VecReg)
{
// Scalar source operand. Affects all vec regs in dest group.
auto srcIx = effectiveRegIx(di, so);
auto srcTime = regTimeVec.at(srcIx);
if (srcTime > time)
{
time = srcTime;
tag = regProducer.at(srcIx);
}
}
else
{
// Vector source operand.
// We propagate times at the vector register level. In the future we will do
// this at the element or at the byte level.
auto baseSrcIx = effectiveRegIx(di, so);
auto srcEmul = hart.vecOpEmul(so);
if (srcEmul <= destEmul)
{
assert((destEmul % srcEmul) == 0);
// Determine number of dest vec regs per source reg
unsigned ndest = destEmul / srcEmul;
auto jj = ii / ndest; // jj is the index of the source vec reg in its group.
auto srcIx = baseSrcIx + jj; // Source vec reg corresponding to dest.
auto srcTime = regTimeVec.at(srcIx);
if (srcTime > time)
{
time = srcTime;
tag = regProducer.at(srcIx);
}
}
else
{
assert((srcEmul % destEmul) == 0);
// Determine number of src vec regs per dest reg.
unsigned nsrc = srcEmul / destEmul;
unsigned jj = ii*nsrc; // jj is the index of a source vec reg in its group
for (unsigned i = 0; i < nsrc; ++i)
{
auto srcIx = baseSrcIx + jj + i;
auto srcTime = regTimeVec.at(srcIx);
if (srcTime > time)
{
time = srcTime;
tag = regProducer.at(srcIx);
}
}
}
}
}
regProducer.at(destIx) = tag;
regTimeVec.at(destIx) = time;
}
}
template <typename URV>
void
Mcm<URV>::setProducerTime(const Hart<URV>& hart, McmInstr& instr)
{
auto& di = instr.di_;
unsigned hartIx = hart.sysHartIndex();
auto& regProducer = hartData_.at(hartIx).regProducer_;
auto& regTime = hartData_.at(hartIx).regTime_;
// Set producer of address register.
if (di.isLoad() or di.isAmo() or di.isStore() or di.isVectorLoad() or di.isVectorStore())
{
unsigned addrReg = effectiveRegIx(di, 1); // Addr reg is operand 1 of instr.
instr.addrProducer_ = regProducer.at(addrReg);
instr.addrTime_ = regTime.at(addrReg);
}
if (di.isVectorLoadStrided() or di.isVectorStoreStrided())
{
unsigned strideReg = effectiveRegIx(di, 2);
uint64_t addrTime = regTime.at(strideReg);
if (addrTime >= instr.addrTime_)
{
instr.addrProducer_ = regProducer.at(strideReg);
instr.addrTime_ = addrTime;
}
}
// Set producer of data register.
if (di.isStore() or di.isAmo())
{
unsigned doi = di.isAmo()? 2 : 0; // Data-register operand index
unsigned dataReg = effectiveRegIx(di, doi); // Data operand may be integer/fp/csr
instr.dataProducer_ = regProducer.at(dataReg);
instr.dataTime_ = regTime.at(dataReg);
}
if (di.isVectorStore())
{
std::array<std::pair<unsigned, VecKind>, 32> dataVecs; // reg-num/masked pairs
unsigned count = getLdStDataVectors(hart, instr, dataVecs);
unsigned active = 0;
for (unsigned i = 0; i < count; ++i)
{
auto [dataReg, kind] = dataVecs.at(i);
if (kind != VecKind::Active)
continue; // Preserve does not apply to store.
auto time = vecRegTime(hartIx, dataReg);
auto producer = vecRegProducer(hartIx, dataReg);
if (time >= instr.dataTime_)
{
instr.dataProducer_ = producer;
instr.dataTime_ = time;
}
instr.vecProdTimes_.at(active++) = McmInstr::VecProdTime{dataReg, producer, time};
}
}
if (di.isVectorLoadIndexed() or di.isVectorStoreIndexed())
{
std::array<std::pair<unsigned, VecKind>, 32> ixRegs; // reg-num/masked pairs
unsigned count = getLdStIndexVectors(hart, instr, ixRegs);
unsigned active = 0;
for (unsigned i = 0; i < count; ++i)
{
auto [ixReg, kind] = ixRegs.at(i);
if (kind != VecKind::Active) // If we preserve data reg, index reg is not used.
continue;
auto time = regTime.at(ixReg);
auto producer = regProducer.at(ixReg);
// We do not update addrProducer_ and addrTime_: those are for the scalar
// address register.
instr.ixProdTimes_.at(active++) = McmInstr::VecProdTime{ixReg, producer, time};
}
}
}
template <typename URV>
static bool
pokeHartMemory(Hart<URV>& hart, uint64_t physAddr, uint64_t data, unsigned size)
{
bool usePma = true;
bool skipFetch = true;
if (size == 1)
return hart.pokeMemory(physAddr, uint8_t(data), usePma, skipFetch);
if (size == 2)
return hart.pokeMemory(physAddr, uint16_t(data), usePma, skipFetch);
if (size == 4)
return hart.pokeMemory(physAddr, uint32_t(data), usePma, skipFetch);
if (size == 8)
return hart.pokeMemory(physAddr, uint64_t(data), usePma, skipFetch);
if (size < 8)
{
for (unsigned i = 0; i < size; ++i)
if (not hart.pokeMemory(physAddr + i, uint8_t(data >> (8*i)), usePma, skipFetch))
return false;
return true;
}
cerr << "MCM pokeHartMemory: " << "Invalid data size (" << size << ")\n";
return false;
}
template <typename URV>
bool
Mcm<URV>::mergeBufferInsert(Hart<URV>& hart, uint64_t time, uint64_t tag, uint64_t pa,
unsigned size, uint64_t rtlData, unsigned elemIx, unsigned field)
{
if (not updateTime("Mcm::mergeBufferInsert", time))
return false;
assert(size <= 8);
unsigned hartIx = hart.sysHartIndex();
pa = hart.clearSecureAddressSteeBits(pa);
MemoryOp op = {};
op.time_ = time;
op.insertTime_ = time;
op.pa_ = pa;
op.rtlData_ = rtlData;
op.tag_ = tag;
op.hartIx_ = hartIx;
op.size_ = size;
op.isRead_ = false;
op.elemIx_ = elemIx;
op.field_ = field;
op.isIo_ = hart.getPma(op.pa_).isIo();
if (not writeOnInsert_)
hartData_.at(hartIx).pendingWrites_.push_back(op);
McmInstr* instr = findOrAddInstr(hartIx, tag);
if (not instr)
{
cerr << "Mcm::MergeBufferInsertScalar: Error: Unknown instr tag\n";
assert(0 && "Mcm::MergeBufferInsertScalar: Unknown instr tag");
return false;
}
auto& undrained = hartData_.at(hartIx).undrainedStores_;
undrained.insert(tag);
bool result = true;
if (writeOnInsert_)
{
// Associate write op with instruction.
instr->addMemOp(sysMemOps_.size());
sysMemOps_.push_back(op);
instr->complete_ = checkStoreComplete(hartIx, *instr);
if (instr->complete_)
{
undrained.erase(tag);
hartData_.at(hartIx).storeInsertCount_.erase(tag);
checkStoreData(hart, *instr);
}
if (not instr->retired_)
{
cerr << "Mcm::MergeBufferInsertScalar: Error: Merge buffer write for a non-retired store\n";
return false;
}
if (isEnabled(PpoRule::R1))
result = ppoRule1(hart, *instr) and result;
if (instr->di_.isAmo() and isEnabled(PpoRule::R3))
result = ppoRule3(hart, *instr) and result;
// We commit the RTL data to memory but we check them against whisper data (in
// checkStoreData). This is simpler than committing part of whisper instruction
// data.
if (not pokeHartMemory(hart, pa, rtlData, op.size_))
result = false;
}
return result;
}
template <typename URV>
bool
Mcm<URV>::bypassOp(Hart<URV>& hart, uint64_t time, uint64_t tag, uint64_t pa,
unsigned size, uint64_t rtlData, unsigned elemIx, unsigned field)
{
if (not updateTime("Mcm::writeOp", time))
return false;
unsigned hartIx = hart.sysHartIndex();
McmInstr* instr = findOrAddInstr(hartIx, tag);
if (not instr)
{
cerr << "Mcm::bypassOp: Error: hart-id=" << hart.hartId() << " time=" << time
<< " tag=" << tag << " unknown instr tag\n";
return false;
}
if (instr->canceled_)
{
cerr << "Mcm::bypassOp: Error: hart-id=" << hart.hartId() << " time=" << time
<< " tag=" << tag << " bypass op with cancelled instruction\n";
return false;
}
auto& undrained = hartData_.at(hartIx).undrainedStores_;
undrained.insert(tag);
bool result = true;