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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
|
// SPDX-License-Identifier: GPL-3.0-or-later
#include "rcc/CodeGen/GlobalISel/GIMatchTableExecutor.h"
#include "rcc/CodeGen/GenericOpcodes.h"
#include "rcc/CodeGen/GlobalISel/Utils.h"
#include "rcc/CodeGen/LowLevelType.h"
#include "rcc/CodeGen/MachineFunction.h"
#include "rcc/CodeGen/MachineIRBuilder.h"
#include "rcc/CodeGen/MachineInstr.h"
#include "rcc/CodeGen/MachineOperand.h"
#include "rcc/CodeGen/MachineRegisterInfo.h"
#include "rcc/CodeGen/TargetDescription.h"
#include <algorithm>
#include <charconv>
#include <cstddef>
#include <cstdint>
#include <limits>
#include <optional>
#include <ranges>
#include <string>
#include <utility>
#include <vector>
namespace rcc {
namespace {
[[nodiscard]] Expected<std::optional<LowLevelType>> operandType(const MachineInstr &Instruction,
const MachineFunction &Function,
std::size_t OperandIndex) {
const MachineOperand *Operand = Instruction.operandAt(OperandIndex);
const Register *Reg = Operand == nullptr ? nullptr : Operand->getIf<Register>();
if (Reg == nullptr || !Reg->isVirtual())
return std::optional<LowLevelType>{};
auto Info = Function.registerInfo().virtualRegisterInfo(*Reg);
if (!Info)
return std::unexpected(Info.error());
return Info->get().Type;
}
[[nodiscard]] Expected<bool> matchesType(const MachineInstr &Instruction,
const MachineFunction &Function,
const GIMatchTableInstruction &Step) {
auto Type = operandType(Instruction, Function, Step.OperandIndex);
if (!Type)
return std::unexpected(Type.error());
if (!*Type)
return false;
const auto Kind = static_cast<GIMatchTypeKind>(Step.Auxiliary);
switch (Kind) {
case GIMatchTypeKind::Any:
return Step.Value == 0 || (*Type)->scalarBitWidth() == Step.Value;
case GIMatchTypeKind::Scalar:
return (*Type)->isCategoryNeutralScalar() && (*Type)->scalarBitWidth() == Step.Value;
case GIMatchTypeKind::Pointer:
return (*Type)->isPointer() && (*Type)->scalarBitWidth() == Step.Value;
}
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid type predicate");
}
[[nodiscard]] Expected<bool> matchesBank(const MachineInstr &Instruction,
const MachineFunction &Function,
const GIMatchTableInstruction &Step) {
const MachineOperand *Operand = Instruction.operandAt(Step.OperandIndex);
const Register *Reg = Operand == nullptr ? nullptr : Operand->getIf<Register>();
if (Reg == nullptr || !Reg->isVirtual())
return false;
auto Info = Function.registerInfo().virtualRegisterInfo(*Reg);
if (!Info)
return std::unexpected(Info.error());
const VirtualRegisterInfo &RegisterInfo = Info->get();
if (!RegisterInfo.Bank)
return false;
return RegisterInfo.Bank->value() == Step.Value;
}
[[nodiscard]] Expected<bool> matchesClass(const MachineInstr &Instruction,
const MachineFunction &Function,
const GIMatchTableInstruction &Step) {
const MachineOperand *Operand = Instruction.operandAt(Step.OperandIndex);
const Register *Reg = Operand == nullptr ? nullptr : Operand->getIf<Register>();
if (Reg == nullptr || !Reg->isVirtual())
return false;
auto Info = Function.registerInfo().virtualRegisterInfo(*Reg);
if (!Info)
return std::unexpected(Info.error());
const VirtualRegisterInfo &RegisterInfo = Info->get();
if (!RegisterInfo.RegClass)
return false;
return RegisterInfo.RegClass->value() == Step.Value;
}
[[nodiscard]] Expected<bool> matchesIntegerPredicate(const MachineInstr &Instruction,
std::size_t OperandIndex,
std::uint32_t PredicateValue) {
if (PredicateValue >= static_cast<std::uint32_t>(IntegerPredicate::Count)) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid integer predicate");
}
const MachineOperand *Operand = Instruction.operandAt(OperandIndex);
const auto *Predicate = Operand == nullptr ? nullptr : Operand->getIf<PredicateOperand>();
const IntegerPredicate *Integer = Predicate == nullptr ? nullptr : Predicate->integerPredicate();
return Integer != nullptr && static_cast<std::uint32_t>(*Integer) == PredicateValue;
}
[[nodiscard]] Expected<bool> matchesFloatingPredicate(const MachineInstr &Instruction,
std::size_t OperandIndex,
std::uint32_t PredicateValue) {
if (PredicateValue >= static_cast<std::uint32_t>(FloatingPredicate::Count)) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid floating predicate");
}
const MachineOperand *Operand = Instruction.operandAt(OperandIndex);
const auto *Predicate = Operand == nullptr ? nullptr : Operand->getIf<PredicateOperand>();
const FloatingPredicate *Floating =
Predicate == nullptr ? nullptr : Predicate->floatingPredicate();
return Floating != nullptr && static_cast<std::uint32_t>(*Floating) == PredicateValue;
}
[[nodiscard]] std::optional<std::int64_t> immediateValue(const MachineOperand &Operand) {
if (const std::int64_t *Immediate = Operand.getIf<std::int64_t>())
return *Immediate;
const auto *Integer = Operand.getIf<IntegerImmediateOperand>();
if (Integer == nullptr)
return std::optional<std::int64_t>{};
const std::string Text = Integer->Value.toSignedDecimal();
std::int64_t Parsed = 0;
const auto [End, Error] = std::from_chars(Text.data(), Text.data() + Text.size(), Parsed);
if (Error != std::errc{} || End != Text.data() + Text.size())
return std::optional<std::int64_t>{};
return Parsed;
}
[[nodiscard]] Expected<std::optional<std::int64_t>>
operandDefConstantValue(const MachineInstr &Instruction, const MachineFunction &Function,
std::size_t OperandIndex) {
const MachineOperand *Operand = Instruction.operandAt(OperandIndex);
const Register *Reg = Operand == nullptr ? nullptr : Operand->getIf<Register>();
if (Reg == nullptr || !Reg->isVirtual())
return std::optional<std::int64_t>{};
const MachineInstr *Definition = Function.registerInfo().getVRegDef(*Reg);
if (Definition == nullptr || Definition->opcode() != opcode(GenericOpcode::G_CONSTANT))
return std::optional<std::int64_t>{};
const MachineOperand *Value = Definition->operandAt(1);
if (Value == nullptr)
return std::optional<std::int64_t>{};
return immediateValue(*Value);
}
[[nodiscard]] Expected<std::optional<std::int64_t>>
operandOrDefConstantValue(const MachineInstr &Instruction, const MachineFunction &Function,
std::size_t OperandIndex) {
const MachineOperand *Operand = Instruction.operandAt(OperandIndex);
if (Operand == nullptr)
return std::optional<std::int64_t>{};
if (const auto Value = immediateValue(*Operand))
return Value;
return operandDefConstantValue(Instruction, Function, OperandIndex);
}
[[nodiscard]] Expected<bool> matchesConstantRanges(const GIMatchTable &Table, std::size_t First,
std::size_t Count,
std::optional<std::int64_t> Value) {
if (Count == 0 || First > Table.ConstantRanges.size() ||
Count > Table.ConstantRanges.size() - First) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid constant range");
}
if (!Value)
return false;
for (std::size_t Index = First; Index < First + Count; ++Index) {
const GIMatchTableConstantRange &Range = Table.ConstantRanges[Index];
if (Range.Minimum > Range.Maximum) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an inverted constant range");
}
if (*Value >= Range.Minimum && *Value <= Range.Maximum)
return true;
}
return false;
}
[[nodiscard]] Expected<bool> matchesOperandImmediateRanges(const GIMatchTable &Table,
const MachineInstr &Instruction,
const GIMatchTableInstruction &Step) {
const MachineOperand *Operand = Instruction.operandAt(Step.OperandIndex);
const std::optional<std::int64_t> Value =
Operand == nullptr ? std::optional<std::int64_t>{} : immediateValue(*Operand);
return matchesConstantRanges(Table, Step.Value, Step.Auxiliary, Value);
}
[[nodiscard]] Expected<bool> matchesOperandDefConstantRanges(const GIMatchTable &Table,
const MachineInstr &Instruction,
const MachineFunction &Function,
const GIMatchTableInstruction &Step) {
auto Value = operandDefConstantValue(Instruction, Function, Step.OperandIndex);
if (!Value)
return std::unexpected(Value.error());
return matchesConstantRanges(Table, Step.Value, Step.Auxiliary, *Value);
}
[[nodiscard]] const MachineInstr *operandDefinition(const MachineInstr &Instruction,
const MachineFunction &Function,
std::size_t OperandIndex) {
const MachineOperand *Operand = Instruction.operandAt(OperandIndex);
const Register *Reg = Operand == nullptr ? nullptr : Operand->getIf<Register>();
return Reg != nullptr && Reg->isVirtual() ? Function.registerInfo().getVRegDef(*Reg) : nullptr;
}
[[nodiscard]] Expected<bool> matchesOperandDefOpcode(const MachineInstr &Instruction,
const MachineFunction &Function,
const GIMatchTableInstruction &Step) {
if (Step.Value == 0)
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid def-use opcode");
const MachineInstr *Definition = operandDefinition(Instruction, Function, Step.OperandIndex);
return Definition != nullptr && Definition->opcode().value() == Step.Value;
}
[[nodiscard]] Expected<bool>
matchesOperandDefIntegerPredicate(const MachineInstr &Instruction, const MachineFunction &Function,
const GIMatchTableInstruction &Step) {
const MachineInstr *Definition = operandDefinition(Instruction, Function, Step.OperandIndex);
if (Definition == nullptr)
return false;
return matchesIntegerPredicate(*Definition, Step.Auxiliary, Step.Value);
}
[[nodiscard]] Expected<bool>
matchesOperandDefOperandConstantRanges(const GIMatchTable &Table, const MachineInstr &Instruction,
const MachineFunction &Function,
const GIMatchTableInstruction &Step) {
if (Step.Immediate <= 0 ||
static_cast<std::uint64_t>(Step.Immediate) > std::numeric_limits<std::uint32_t>::max()) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid def-use constant range count");
}
const std::size_t Count = static_cast<std::size_t>(Step.Immediate);
const MachineInstr *Definition = operandDefinition(Instruction, Function, Step.OperandIndex);
if (Definition == nullptr)
return false;
auto Value = operandOrDefConstantValue(*Definition, Function, Step.Auxiliary);
if (!Value)
return std::unexpected(Value.error());
return matchesConstantRanges(Table, Step.Value, Count, *Value);
}
[[nodiscard]] Expected<RegisterOperandFlags> registerFlagsFromRaw(std::uint32_t Raw) {
constexpr std::uint32_t ValidBits =
(std::uint32_t{1} << static_cast<std::uint16_t>(RegisterOperandFlag::Count)) - 1U;
if ((Raw & ~ValidBits) != 0) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has invalid register flags");
}
RegisterOperandFlags Flags;
for (std::uint16_t Index = 0; Index < static_cast<std::uint16_t>(RegisterOperandFlag::Count);
++Index) {
if ((Raw & (std::uint32_t{1} << Index)) != 0)
Flags.set(static_cast<RegisterOperandFlag>(Index));
}
return Flags;
}
struct MatchedRule final {
struct CapturedOperand final {
std::uint32_t ID = 0;
MachineOperand Operand;
};
struct Temporary final {
std::uint32_t ID = 0;
std::uint32_t TypeFromOperand = 0;
};
struct RenderedOperand final {
enum class Kind : std::uint8_t {
RootOperand,
ComplexOperand,
CapturedOperand,
PhysicalRegister,
Temporary,
CapturedImmediate,
Immediate,
};
Kind SourceKind = Kind::RootOperand;
std::uint32_t Value = 0;
std::uint32_t Flags = 0;
std::string_view ComplexRenderer;
GIMatchImmediateTransform Transform = GIMatchImmediateTransform::Identity;
std::int64_t Immediate = 0;
};
struct Instruction final {
Opcode ResultOpcode;
bool ReplacesRoot = false;
std::vector<RenderedOperand> Operands;
};
std::vector<Temporary> Temporaries;
std::vector<CapturedOperand> CapturedOperands;
std::vector<Instruction> Instructions;
std::vector<Register> EraseOperandDefinitions;
};
[[nodiscard]] bool hasTemporary(const MatchedRule &Rule, std::uint32_t ID) {
return std::ranges::any_of(Rule.Temporaries, [ID](const MatchedRule::Temporary &Temporary) {
return Temporary.ID == ID;
});
}
[[nodiscard]] bool hasCapturedOperand(const MatchedRule &Rule, std::uint32_t ID) {
return std::ranges::any_of(
Rule.CapturedOperands,
[ID](const MatchedRule::CapturedOperand &Capture) { return Capture.ID == ID; });
}
[[nodiscard]] const MatchedRule::CapturedOperand *
findCapturedOperand(const std::vector<MatchedRule::CapturedOperand> &Captures, std::uint32_t ID) {
const auto Position = std::ranges::find(Captures, ID, &MatchedRule::CapturedOperand::ID);
return Position == Captures.end() ? nullptr : &*Position;
}
template <typename TargetPredicateMatcher>
[[nodiscard]] Expected<std::optional<MatchedRule>>
matchRule(const GIMatchTable &Table, const GIMatchTableRule &Rule, const MachineInstr &Instruction,
const MachineFunction &Function, const TargetDescription &Target,
TargetPredicateMatcher &&MatchesTargetPredicate) {
const std::size_t First = Rule.FirstInstruction;
const std::size_t Count = Rule.InstructionCount;
if (First > Table.Instructions.size() || Count > Table.Instructions.size() - First) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table rule has an invalid instruction range");
}
MatchedRule Result;
bool Applying = false;
bool Complete = false;
for (std::size_t Index = First; Index < First + Count; ++Index) {
const GIMatchTableInstruction &Step = Table.Instructions[Index];
switch (Step.Opcode) {
case GIMatchTableOpcode::CheckOpcode:
if (Applying) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table performs a predicate after an action");
}
if (Instruction.opcode().value() != Step.Value)
return std::optional<MatchedRule>{};
break;
case GIMatchTableOpcode::CheckOperandType: {
if (Applying) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table performs a predicate after an action");
}
auto Matched = matchesType(Instruction, Function, Step);
if (!Matched)
return std::unexpected(Matched.error());
if (!*Matched)
return std::optional<MatchedRule>{};
break;
}
case GIMatchTableOpcode::CheckOperandBank: {
if (Applying) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table performs a predicate after an action");
}
auto Matched = matchesBank(Instruction, Function, Step);
if (!Matched)
return std::unexpected(Matched.error());
if (!*Matched)
return std::optional<MatchedRule>{};
break;
}
case GIMatchTableOpcode::CheckOperandClass: {
if (Applying) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table performs a predicate after an action");
}
auto Matched = matchesClass(Instruction, Function, Step);
if (!Matched)
return std::unexpected(Matched.error());
if (!*Matched)
return std::optional<MatchedRule>{};
break;
}
case GIMatchTableOpcode::CheckIntegerPredicate: {
if (Applying) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table performs a predicate after an action");
}
auto Matched = matchesIntegerPredicate(Instruction, Step.OperandIndex, Step.Value);
if (!Matched)
return std::unexpected(Matched.error());
if (!*Matched)
return std::optional<MatchedRule>{};
break;
}
case GIMatchTableOpcode::CheckFloatingPredicate: {
if (Applying) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table performs a predicate after an action");
}
auto Matched = matchesFloatingPredicate(Instruction, Step.OperandIndex, Step.Value);
if (!Matched)
return std::unexpected(Matched.error());
if (!*Matched)
return std::optional<MatchedRule>{};
break;
}
case GIMatchTableOpcode::CheckTargetPredicate: {
if (Applying || Step.Symbol.empty()) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid target predicate");
}
auto Matched = MatchesTargetPredicate(Step.Symbol, Instruction, Function, Target);
if (!Matched)
return std::unexpected(Matched.error());
if (!*Matched)
return std::optional<MatchedRule>{};
break;
}
case GIMatchTableOpcode::CheckOperandImmediateRanges: {
if (Applying) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table performs a predicate after an action");
}
auto Matched = matchesOperandImmediateRanges(Table, Instruction, Step);
if (!Matched)
return std::unexpected(Matched.error());
if (!*Matched)
return std::optional<MatchedRule>{};
break;
}
case GIMatchTableOpcode::CheckOperandDefConstantRanges: {
if (Applying) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table performs a predicate after an action");
}
auto Matched = matchesOperandDefConstantRanges(Table, Instruction, Function, Step);
if (!Matched)
return std::unexpected(Matched.error());
if (!*Matched)
return std::optional<MatchedRule>{};
break;
}
case GIMatchTableOpcode::CheckOperandDefOpcode: {
if (Applying) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table performs a predicate after an action");
}
auto Matched = matchesOperandDefOpcode(Instruction, Function, Step);
if (!Matched)
return std::unexpected(Matched.error());
if (!*Matched)
return std::optional<MatchedRule>{};
break;
}
case GIMatchTableOpcode::CheckOperandDefIntegerPredicate: {
if (Applying) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table performs a predicate after an action");
}
auto Matched = matchesOperandDefIntegerPredicate(Instruction, Function, Step);
if (!Matched)
return std::unexpected(Matched.error());
if (!*Matched)
return std::optional<MatchedRule>{};
break;
}
case GIMatchTableOpcode::CheckOperandDefOperandConstantRanges: {
if (Applying) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table performs a predicate after an action");
}
auto Matched = matchesOperandDefOperandConstantRanges(Table, Instruction, Function, Step);
if (!Matched)
return std::unexpected(Matched.error());
if (!*Matched)
return std::optional<MatchedRule>{};
break;
}
case GIMatchTableOpcode::CaptureDefOperand: {
if (Applying || Complete || Step.Value == 0 || hasCapturedOperand(Result, Step.Value)) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid def-use capture");
}
const MachineInstr *Definition = operandDefinition(Instruction, Function, Step.OperandIndex);
const MachineOperand *Operand =
Definition == nullptr ? nullptr : Definition->operandAt(Step.Auxiliary);
if (Operand == nullptr || Operand->isImplicit())
return std::optional<MatchedRule>{};
Result.CapturedOperands.push_back({
.ID = Step.Value,
.Operand = Operand->cloneDetached(),
});
break;
}
case GIMatchTableOpcode::CreateTemporary: {
if (Complete || Step.Value == 0 || hasTemporary(Result, Step.Value)) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid temporary");
}
auto Type = operandType(Instruction, Function, Step.OperandIndex);
if (!Type)
return std::unexpected(Type.error());
if (!*Type) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table temporary has no type source");
}
Applying = true;
Result.Temporaries.push_back({
.ID = Step.Value,
.TypeFromOperand = Step.OperandIndex,
});
break;
}
case GIMatchTableOpcode::MutateOpcode:
if (Complete || Step.Value == 0 || !Result.Instructions.empty()) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid root mutation");
}
Applying = true;
Result.Instructions.push_back({
.ResultOpcode = Opcode::fromValue(Step.Value),
.ReplacesRoot = true,
.Operands = {},
});
break;
case GIMatchTableOpcode::BuildInstruction:
if (Complete || Step.Value == 0 || Result.Instructions.empty()) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid instruction action");
}
Applying = true;
Result.Instructions.push_back({
.ResultOpcode = Opcode::fromValue(Step.Value),
.ReplacesRoot = false,
.Operands = {},
});
break;
case GIMatchTableOpcode::RenderOperand:
if (Complete || Result.Instructions.empty() ||
Instruction.operandAt(Step.OperandIndex) == nullptr ||
Instruction.operandAt(Step.OperandIndex)->isImplicit()) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid operand renderer");
}
Result.Instructions.back().Operands.push_back({
.SourceKind = MatchedRule::RenderedOperand::Kind::RootOperand,
.Value = Step.OperandIndex,
.ComplexRenderer = {},
});
break;
case GIMatchTableOpcode::RenderComplexOperand:
if (Complete || Result.Instructions.empty() || Step.Symbol.empty() ||
Instruction.operandAt(Step.OperandIndex) == nullptr ||
Instruction.operandAt(Step.OperandIndex)->isImplicit()) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid complex operand renderer");
}
Result.Instructions.back().Operands.push_back({
.SourceKind = MatchedRule::RenderedOperand::Kind::ComplexOperand,
.Value = Step.OperandIndex,
.ComplexRenderer = Step.Symbol,
});
break;
case GIMatchTableOpcode::RenderCapturedOperand:
if (Complete || Result.Instructions.empty() || Step.Value == 0 ||
!hasCapturedOperand(Result, Step.Value)) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid captured operand renderer");
}
Result.Instructions.back().Operands.push_back({
.SourceKind = MatchedRule::RenderedOperand::Kind::CapturedOperand,
.Value = Step.Value,
.ComplexRenderer = {},
});
break;
case GIMatchTableOpcode::RenderPhysicalRegister:
if (Complete || Result.Instructions.empty() || Step.Value == 0) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid physical register renderer");
}
Result.Instructions.back().Operands.push_back({
.SourceKind = MatchedRule::RenderedOperand::Kind::PhysicalRegister,
.Value = Step.Value,
.Flags = Step.Auxiliary,
.ComplexRenderer = {},
});
break;
case GIMatchTableOpcode::RenderTemporary:
if (Complete || Result.Instructions.empty() || !hasTemporary(Result, Step.Value)) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid temporary renderer");
}
Result.Instructions.back().Operands.push_back({
.SourceKind = MatchedRule::RenderedOperand::Kind::Temporary,
.Value = Step.Value,
.Flags = Step.Auxiliary,
.ComplexRenderer = {},
});
break;
case GIMatchTableOpcode::RenderCapturedImmediate: {
if (Complete || Result.Instructions.empty() ||
Step.Value > static_cast<std::uint32_t>(GIMatchImmediateTransform::PlusOne)) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid captured immediate renderer");
}
auto Value = operandDefConstantValue(Instruction, Function, Step.OperandIndex);
if (!Value)
return std::unexpected(Value.error());
if (!*Value) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table lost a captured constant");
}
Result.Instructions.back().Operands.push_back({
.SourceKind = MatchedRule::RenderedOperand::Kind::CapturedImmediate,
.Value = Step.OperandIndex,
.ComplexRenderer = {},
.Transform = static_cast<GIMatchImmediateTransform>(Step.Value),
});
break;
}
case GIMatchTableOpcode::RenderImmediate:
if (Complete || Result.Instructions.empty()) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid immediate renderer");
}
Result.Instructions.back().Operands.push_back({
.SourceKind = MatchedRule::RenderedOperand::Kind::Immediate,
.ComplexRenderer = {},
.Immediate = Step.Immediate,
});
break;
case GIMatchTableOpcode::EraseOperandDefinition: {
if (Complete || Result.Instructions.empty()) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid erased definition");
}
const MachineOperand *Operand = Instruction.operandAt(Step.OperandIndex);
const Register *Reg = Operand == nullptr ? nullptr : Operand->getIf<Register>();
if (Reg == nullptr || !Reg->isVirtual()) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table erases a non-virtual operand definition");
}
Result.EraseOperandDefinitions.push_back(*Reg);
break;
}
case GIMatchTableOpcode::Complete:
if (Complete || Result.Instructions.empty() || Index + 1 != First + Count) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid completion action");
}
Complete = true;
break;
}
}
if (!Complete || Result.Instructions.empty() || !Result.Instructions.front().ReplacesRoot) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table rule does not complete rendering");
}
return std::optional<MatchedRule>(std::move(Result));
}
template <typename ComplexRenderer>
[[nodiscard]] Expected<bool>
complexRenderersMatch(const MatchedRule &Rule, const MachineInstr &Instruction,
const MachineFunction &Function, const TargetDescription &Target,
ComplexRenderer &&RenderComplex) {
for (const MatchedRule::Instruction &Action : Rule.Instructions) {
for (const MatchedRule::RenderedOperand &Rendered : Action.Operands) {
if (Rendered.SourceKind != MatchedRule::RenderedOperand::Kind::ComplexOperand)
continue;
auto Complex =
RenderComplex(Rendered.ComplexRenderer, Instruction, Function, Target, Rendered.Value);
if (!Complex)
return std::unexpected(Complex.error());
if (!*Complex)
return false;
}
}
return true;
}
[[nodiscard]] std::size_t explicitOperandCount(const MachineInstr &Instruction) noexcept {
std::size_t Count = 0;
while (Count < Instruction.operandCount() && !Instruction.operandAt(Count)->isImplicit())
++Count;
return Count;
}
[[nodiscard]] Expected<void>
restoreInstruction(MachineInstr &Instruction, Opcode OriginalOpcode,
const std::vector<MachineOperand> &OriginalOperands,
const std::vector<std::pair<std::size_t, std::size_t>> &Ties) {
while (Instruction.operandCount() != 0) {
auto Erased = Instruction.eraseOperand(Instruction.operandCount() - 1U);
if (!Erased)
return std::unexpected(Erased.error());
}
auto RestoredOpcode = Instruction.setOpcode(OriginalOpcode);
if (!RestoredOpcode)
return std::unexpected(RestoredOpcode.error());
for (const MachineOperand &Operand : OriginalOperands) {
auto Added = Instruction.addOperand(Operand.cloneDetached());
if (!Added)
return std::unexpected(Added.error());
}
for (const auto [DefIndex, UseIndex] : Ties) {
auto Tied = Instruction.tieOperands(DefIndex, UseIndex);
if (!Tied)
return std::unexpected(Tied.error());
}
return {};
}
struct MaterializedTemporary final {
std::uint32_t ID = 0;
Register Reg;
};
struct RegisterConstraintSnapshot final {
Register Reg;
std::optional<RegisterBankID> Bank;
std::optional<RegisterClassID> RegClass;
};
[[nodiscard]] const MaterializedTemporary *
findTemporary(const std::vector<MaterializedTemporary> &Temporaries, std::uint32_t ID) {
const auto Position = std::ranges::find(Temporaries, ID, &MaterializedTemporary::ID);
return Position == Temporaries.end() ? nullptr : &*Position;
}
[[nodiscard]] Expected<void>
eraseTemporaries(MachineRegisterInfo &Registers,
const std::vector<MaterializedTemporary> &Temporaries) {
for (auto Iterator = Temporaries.rbegin(); Iterator != Temporaries.rend(); ++Iterator) {
if (!Registers.isKnownVirtualRegister(Iterator->Reg))
continue;
auto Erased = Registers.eraseVirtualRegister(Iterator->Reg);
if (!Erased)
return std::unexpected(Erased.error());
}
return {};
}
[[nodiscard]] Expected<void> eraseRegisters(MachineRegisterInfo &Registers,
const std::vector<Register> &RegistersToErase) {
for (auto Iterator = RegistersToErase.rbegin(); Iterator != RegistersToErase.rend(); ++Iterator) {
if (!Registers.isKnownVirtualRegister(*Iterator))
continue;
auto Erased = Registers.eraseVirtualRegister(*Iterator);
if (!Erased)
return std::unexpected(Erased.error());
}
return {};
}
[[nodiscard]] Expected<void>
restoreRegisterConstraints(MachineRegisterInfo &Registers,
const std::vector<RegisterConstraintSnapshot> &Snapshots) {
for (auto Iterator = Snapshots.rbegin(); Iterator != Snapshots.rend(); ++Iterator) {
if (!Registers.isKnownVirtualRegister(Iterator->Reg))
continue;
if (Iterator->Bank) {
auto Restored = Registers.setRegisterBank(Iterator->Reg, *Iterator->Bank);
if (!Restored)
return std::unexpected(Restored.error());
} else {
auto Cleared = Registers.clearRegisterBank(Iterator->Reg);
if (!Cleared)
return std::unexpected(Cleared.error());
}
if (Iterator->RegClass) {
auto Restored = Registers.setRegisterClass(Iterator->Reg, *Iterator->RegClass);
if (!Restored)
return std::unexpected(Restored.error());
} else {
auto Cleared = Registers.clearRegisterClass(Iterator->Reg);
if (!Cleared)
return std::unexpected(Cleared.error());
}
}
return {};
}
[[nodiscard]] Expected<void>
constrainRenderedInstruction(const InstructionDescriptor &Descriptor,
std::span<const MachineOperand> Operands, MachineFunction &Function,
const TargetDescription &Target,
std::vector<RegisterConstraintSnapshot> &Snapshots) {
if (Descriptor.Operands.empty() && !Operands.empty()) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table result has no operand descriptors");
}
MachineRegisterInfo &Registers = Function.registerInfo();
const auto Remember = [&Snapshots](Register Reg, const VirtualRegisterInfo &Info) {
if (std::ranges::find(Snapshots, Reg, &RegisterConstraintSnapshot::Reg) == Snapshots.end())
Snapshots.push_back({.Reg = Reg, .Bank = Info.Bank, .RegClass = Info.RegClass});
};
for (std::size_t Index = 0; Index < Operands.size(); ++Index) {
const Register *Reg = Operands[Index].getIf<Register>();
if (Reg == nullptr || !Reg->isVirtual())
continue;
const OperandDescriptor &OperandDescriptor = Index < Descriptor.Operands.size()
? Descriptor.Operands[Index]
: Descriptor.Operands.back();
if (!OperandDescriptor.RegBank && !OperandDescriptor.RegClass)
continue;
auto Info = Registers.virtualRegisterInfo(*Reg);
if (!Info)
return std::unexpected(Info.error());
if (OperandDescriptor.RegBank) {
if (Info->get().Bank && *Info->get().Bank != *OperandDescriptor.RegBank) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table result has an incompatible register bank");
}
if (!Info->get().Bank) {
Remember(*Reg, Info->get());
auto SetBank = Registers.setRegisterBank(*Reg, *OperandDescriptor.RegBank);
if (!SetBank)
return std::unexpected(SetBank.error());
}
}
if (OperandDescriptor.RegClass) {
if (Info->get().RegClass &&
!Target.registers().isSubclass(*Info->get().RegClass, *OperandDescriptor.RegClass)) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table result has an incompatible register class");
}
if (!Info->get().RegClass) {
Remember(*Reg, Info->get());
auto SetClass = Registers.setRegisterClass(*Reg, *OperandDescriptor.RegClass);
if (!SetClass)
return std::unexpected(SetClass.error());
}
}
}
return {};
}
[[nodiscard]] Expected<MachineOperand>
renderOperand(const MatchedRule::RenderedOperand &Rendered, const MachineInstr &Instruction,
const MachineFunction &Function, const TargetDescription &Target,
const std::vector<MaterializedTemporary> &Temporaries,
const std::vector<MatchedRule::CapturedOperand> &CapturedOperands,
std::size_t OriginalExplicitCount) {
switch (Rendered.SourceKind) {
case MatchedRule::RenderedOperand::Kind::RootOperand:
if (Rendered.Value >= OriginalExplicitCount) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table renders an implicit or missing operand");
}
return Instruction.operandAt(Rendered.Value)->cloneDetached();
case MatchedRule::RenderedOperand::Kind::ComplexOperand:
return makeUnexpected(ErrorCode::VerificationError,
"generated match table did not resolve a complex operand renderer");
case MatchedRule::RenderedOperand::Kind::CapturedOperand: {
const MatchedRule::CapturedOperand *Captured =
findCapturedOperand(CapturedOperands, Rendered.Value);
if (Captured == nullptr) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table renders an unknown captured operand");
}
return Captured->Operand.cloneDetached();
}
case MatchedRule::RenderedOperand::Kind::PhysicalRegister: {
auto Physical = PhysicalRegister::create(Rendered.Value);
if (!Physical || Target.registers().physicalRegister(*Physical) == nullptr) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table renders an unknown physical register");
}
auto Flags = registerFlagsFromRaw(Rendered.Flags);
if (!Flags)
return std::unexpected(Flags.error());
return MachineOperand::registerOperand(Register::fromPhysical(*Physical), *Flags);
}
case MatchedRule::RenderedOperand::Kind::Temporary: {
const MaterializedTemporary *Temporary = findTemporary(Temporaries, Rendered.Value);
if (Temporary == nullptr) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table renders an unknown temporary");
}
auto Flags = registerFlagsFromRaw(Rendered.Flags);
if (!Flags)
return std::unexpected(Flags.error());
return MachineOperand::registerOperand(Temporary->Reg, *Flags);
}
case MatchedRule::RenderedOperand::Kind::CapturedImmediate: {
auto Captured = operandDefConstantValue(Instruction, Function, Rendered.Value);
if (!Captured)
return std::unexpected(Captured.error());
if (!*Captured) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table lost a captured constant");
}
std::int64_t Value = **Captured;
switch (Rendered.Transform) {
case GIMatchImmediateTransform::Identity:
break;
case GIMatchImmediateTransform::Negate:
if (Value == std::numeric_limits<std::int64_t>::min()) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table immediate negation overflows");
}
Value = -Value;
break;
case GIMatchImmediateTransform::PlusOne:
if (Value == std::numeric_limits<std::int64_t>::max()) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table immediate increment overflows");
}
++Value;
break;
}
return MachineOperand::immediate(Value);
}
case MatchedRule::RenderedOperand::Kind::Immediate:
return MachineOperand::immediate(Rendered.Immediate);
}
return makeUnexpected(ErrorCode::VerificationError,
"generated match table has an invalid operand renderer");
}
template <typename Finalizer, typename ComplexRenderer>
[[nodiscard]] Expected<void> applyRule(const MatchedRule &Rule, MachineInstr &Instruction,
MachineFunction &Function, const TargetDescription &Target,
Finalizer &&Finalize, ComplexRenderer &&RenderComplex) {
const InstructionDescriptor *InputDescriptor = Target.instructionDescriptor(Instruction.opcode());
if (InputDescriptor == nullptr) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table input has no instruction descriptor");
}
const MachineInstrFlags InputFlags = Instruction.flags();
const bool InputMayRaiseFPException =
InputDescriptor->Flags.has(InstructionFlag::MayRaiseFPException);
const std::size_t OriginalExplicitCount = explicitOperandCount(Instruction);
const std::size_t OriginalOperandCount = Instruction.operandCount();
const Opcode OriginalOpcode = Instruction.opcode();
std::vector<MachineOperand> OriginalOperands;
OriginalOperands.reserve(OriginalOperandCount);
for (const MachineOperand &Operand : Instruction.operands())
OriginalOperands.push_back(Operand.cloneDetached());
std::vector<std::pair<std::size_t, std::size_t>> Ties;
for (std::size_t Index = 0; Index < OriginalOperandCount; ++Index) {
const std::optional<std::size_t> Other = Instruction.operandAt(Index)->tiedOperandIndex();
if (Other && Index < *Other)
Ties.emplace_back(Index, *Other);
}
std::vector<MaterializedTemporary> Temporaries;
Temporaries.reserve(Rule.Temporaries.size());
for (const MatchedRule::Temporary &Temporary : Rule.Temporaries) {
const MachineOperand *SourceOperand = Instruction.operandAt(Temporary.TypeFromOperand);
const Register *Source = SourceOperand == nullptr ? nullptr : SourceOperand->getIf<Register>();
if (Source == nullptr || !Source->isVirtual()) {
auto Cleanup = eraseTemporaries(Function.registerInfo(), Temporaries);
if (!Cleanup)
return std::unexpected(Cleanup.error());
return makeUnexpected(ErrorCode::VerificationError,
"generated match table temporary has an invalid type source");
}
auto SourceInfo = Function.registerInfo().virtualRegisterInfo(*Source);
if (!SourceInfo) {
auto Cleanup = eraseTemporaries(Function.registerInfo(), Temporaries);
if (!Cleanup)
return std::unexpected(Cleanup.error());
return std::unexpected(SourceInfo.error());
}
const std::optional<LowLevelType> Type = SourceInfo->get().Type;
if (!Type) {
auto Cleanup = eraseTemporaries(Function.registerInfo(), Temporaries);
if (!Cleanup)
return std::unexpected(Cleanup.error());
return makeUnexpected(ErrorCode::VerificationError,
"generated match table temporary type source has no type");
}
auto Reg = Function.registerInfo().createVirtualRegister(*Type);
if (!Reg) {
auto Cleanup = eraseTemporaries(Function.registerInfo(), Temporaries);
if (!Cleanup)
return std::unexpected(Cleanup.error());
return std::unexpected(Reg.error());
}
Temporaries.push_back({.ID = Temporary.ID, .Reg = *Reg});
}
struct PendingComplexInstruction final {
Opcode ResultOpcode;
std::vector<MachineOperand> Operands;
};
std::vector<Register> ComplexRegisters;
std::vector<PendingComplexInstruction> PendingComplexInstructions;
std::vector<MachineInstr *> AddedInstructions;
const auto CleanupGeneratedRegisters = [&]() -> Expected<void> {
auto ErasedTemporaries = eraseTemporaries(Function.registerInfo(), Temporaries);
if (!ErasedTemporaries)
return std::unexpected(ErasedTemporaries.error());
return eraseRegisters(Function.registerInfo(), ComplexRegisters);
};
std::vector<std::vector<MachineOperand>> RenderedInstructions;
RenderedInstructions.reserve(Rule.Instructions.size());
std::vector<std::optional<std::size_t>> SourceToOutput(OriginalOperandCount);
for (std::size_t InstructionIndex = 0; InstructionIndex < Rule.Instructions.size();
++InstructionIndex) {
const MatchedRule::Instruction &Planned = Rule.Instructions[InstructionIndex];
const InstructionDescriptor *Descriptor = Target.instructionDescriptor(Planned.ResultOpcode);
if (Descriptor == nullptr ||
(!Descriptor->Variadic && Descriptor->Operands.size() != Planned.Operands.size())) {
auto Cleanup = CleanupGeneratedRegisters();
if (!Cleanup)
return std::unexpected(Cleanup.error());
return makeUnexpected(ErrorCode::VerificationError,
"generated match table result has an incompatible descriptor");
}
std::vector<MachineOperand> Operands;
Operands.reserve(Planned.Operands.size());
for (const MatchedRule::RenderedOperand &Rendered : Planned.Operands) {
Expected<MachineOperand> Operand = [&]() -> Expected<MachineOperand> {
if (Rendered.SourceKind != MatchedRule::RenderedOperand::Kind::ComplexOperand)
return renderOperand(Rendered, Instruction, Function, Target, Temporaries,
Rule.CapturedOperands, OriginalExplicitCount);
auto Complex =
RenderComplex(Rendered.ComplexRenderer, Instruction, Function, Target, Rendered.Value);
if (!Complex)
return std::unexpected(Complex.error());
if (!*Complex)
return makeUnexpected(ErrorCode::VerificationError,
"generated match table complex operand unexpectedly did not match");
if ((*Complex)->Operand && (*Complex)->Instruction)
return makeUnexpected(ErrorCode::VerificationError,
"generated match table complex operand has two renderings");
if ((*Complex)->Operand)
return std::move(*(*Complex)->Operand);
if (!(*Complex)->Instruction)
return makeUnexpected(ErrorCode::VerificationError,
"generated match table complex operand has no rendering");
GIMatchComplexInstruction &Plan = *(*Complex)->Instruction;
if (!Plan.ResultType.isValid())
return makeUnexpected(ErrorCode::VerificationError,
"generated match table complex instruction has no result type");
auto Result = Function.registerInfo().createVirtualRegister(Plan.ResultType);
if (!Result)
return std::unexpected(Result.error());
ComplexRegisters.push_back(*Result);
auto Definition = MachineOperand::registerOperand(*Result, {RegisterOperandFlag::Define});
if (!Definition)
return std::unexpected(Definition.error());
std::vector<MachineOperand> PlannedOperands;
PlannedOperands.reserve(Plan.Operands.size() + 1U);
PlannedOperands.push_back(std::move(*Definition));
for (MachineOperand &PlanOperand : Plan.Operands)
PlannedOperands.push_back(std::move(PlanOperand));
PendingComplexInstructions.push_back({
.ResultOpcode = Plan.ResultOpcode,
.Operands = std::move(PlannedOperands),
});
return MachineOperand::registerOperand(*Result, {RegisterOperandFlag::Use});
}();
if (!Operand) {
auto Cleanup = CleanupGeneratedRegisters();
if (!Cleanup)
return std::unexpected(Cleanup.error());
return std::unexpected(Operand.error());
}
if (InstructionIndex == 0 &&
Rendered.SourceKind == MatchedRule::RenderedOperand::Kind::RootOperand) {
if (SourceToOutput[Rendered.Value] &&
Instruction.operandAt(Rendered.Value)->tiedOperandIndex()) {
auto Cleanup = CleanupGeneratedRegisters();
if (!Cleanup)
return std::unexpected(Cleanup.error());
return makeUnexpected(ErrorCode::VerificationError,
"generated match table duplicates a tied operand");
}
SourceToOutput[Rendered.Value] = Operands.size();
}
Operands.push_back(std::move(*Operand));
}
RenderedInstructions.push_back(std::move(Operands));
}
std::vector<RegisterConstraintSnapshot> ConstraintSnapshots;
bool RootModified = false;
const auto Rollback = [&](Error Failure) -> Expected<void> {
for (auto Iterator = AddedInstructions.rbegin(); Iterator != AddedInstructions.rend();
++Iterator) {
if ((*Iterator)->parent() == nullptr)
continue;
auto Erased = eraseInstr(**Iterator, Function.registerInfo(), Target);
if (!Erased)
return std::unexpected(Erased.error());
}
if (RootModified) {
auto Restored = restoreInstruction(Instruction, OriginalOpcode, OriginalOperands, Ties);
if (!Restored)
return std::unexpected(Restored.error());
}
auto RestoredConstraints =
restoreRegisterConstraints(Function.registerInfo(), ConstraintSnapshots);
if (!RestoredConstraints)
return std::unexpected(RestoredConstraints.error());
auto ErasedGenerated = CleanupGeneratedRegisters();
if (!ErasedGenerated)
return std::unexpected(ErasedGenerated.error());
return std::unexpected(std::move(Failure));
};
for (const PendingComplexInstruction &Pending : PendingComplexInstructions) {
const InstructionDescriptor *Descriptor = Target.instructionDescriptor(Pending.ResultOpcode);
if (Descriptor == nullptr ||
(!Descriptor->Variadic && Descriptor->Operands.size() != Pending.Operands.size())) {
return Rollback(Error(ErrorCode::VerificationError,
"generated match table complex renderer has an incompatible result"));
}
auto Constraint = constrainRenderedInstruction(*Descriptor, Pending.Operands, Function, Target,
ConstraintSnapshots);
if (!Constraint)
return Rollback(Constraint.error());
}
for (std::size_t Index = 0; Index < Rule.Instructions.size(); ++Index) {
const InstructionDescriptor *Descriptor =
Target.instructionDescriptor(Rule.Instructions[Index].ResultOpcode);
if (Descriptor == nullptr)
return Rollback(Error(ErrorCode::VerificationError,
"generated match table selects an unknown instruction opcode"));
auto Constraint = constrainRenderedInstruction(*Descriptor, RenderedInstructions[Index],
Function, Target, ConstraintSnapshots);
if (!Constraint)
return Rollback(Constraint.error());
}
MachineIRBuilder Builder(Function, Target);
MachineInstr *ComplexAnchor = nullptr;
for (PendingComplexInstruction &Pending : PendingComplexInstructions) {
auto Point = ComplexAnchor == nullptr ? Builder.setInsertPointBefore(Instruction)
: Builder.setInsertPointAfter(*ComplexAnchor);
if (!Point)
return Rollback(Point.error());
auto Built = Builder.buildInstr(Pending.ResultOpcode);
if (!Built)
return Rollback(Built.error());
for (MachineOperand &Operand : Pending.Operands) {
auto Added = Built->addOperand(std::move(Operand));
if (!Added)
return Rollback(Added.error());
}
auto Complete = Built->build();
if (!Complete)
return Rollback(Complete.error());
AddedInstructions.push_back(*Complete);
auto Finalized = Finalize(**Complete, InputFlags, InputMayRaiseFPException);
if (!Finalized)
return Rollback(Finalized.error());
ComplexAnchor = *Complete;
}
MachineInstr *Anchor = &Instruction;
for (std::size_t Index = 1; Index < Rule.Instructions.size(); ++Index) {
auto Point = Builder.setInsertPointAfter(*Anchor);
if (!Point)
return Rollback(Point.error());
auto Pending = Builder.buildInstr(Rule.Instructions[Index].ResultOpcode);
if (!Pending)
return Rollback(Pending.error());
for (MachineOperand &Operand : RenderedInstructions[Index]) {
auto Added = Pending->addOperand(std::move(Operand));
if (!Added)
return Rollback(Added.error());
}
auto Built = Pending->build();
if (!Built)
return Rollback(Built.error());
AddedInstructions.push_back(*Built);
auto Finalized = Finalize(**Built, InputFlags, InputMayRaiseFPException);
if (!Finalized)
return Rollback(Finalized.error());
Anchor = *Built;
}
const MatchedRule::Instruction &RootAction = Rule.Instructions.front();
RootModified = true;
auto SetOpcode = Instruction.setOpcode(RootAction.ResultOpcode);
if (!SetOpcode)
return Rollback(SetOpcode.error());
while (Instruction.operandCount() != 0) {
auto Erased = Instruction.eraseOperand(Instruction.operandCount() - 1U);
if (!Erased)
return Rollback(Erased.error());
}
for (MachineOperand &Operand : RenderedInstructions.front()) {
auto Added = Instruction.addOperand(std::move(Operand));
if (!Added)
return Rollback(Added.error());
}
for (std::size_t Index = OriginalExplicitCount; Index < OriginalOperandCount; ++Index) {
SourceToOutput[Index] = Instruction.operandCount();
auto Added = Instruction.addOperand(OriginalOperands[Index].cloneDetached());
if (!Added)
return Rollback(Added.error());
}
for (const auto [OldDef, OldUse] : Ties) {
const std::optional<std::size_t> &NewDef = SourceToOutput[OldDef];
const std::optional<std::size_t> &NewUse = SourceToOutput[OldUse];
if (!NewDef || !NewUse)
continue;
auto Tied = Instruction.tieOperands(*NewDef, *NewUse);
if (!Tied)
return Rollback(Tied.error());
}
for (const Register Reg : Rule.EraseOperandDefinitions) {
MachineInstr *Definition = Function.registerInfo().getVRegDef(Reg);
if (Definition == nullptr || Definition == &Instruction ||
!isTriviallyDead(*Definition, Function.registerInfo(), Target)) {
continue;
}
auto Erased = eraseInstr(*Definition, Function.registerInfo(), Target);
if (!Erased)
return Rollback(Erased.error());
}
return {};
}
} // namespace
Expected<void> GIMatchTableExecutor::finalizeGeneratedInstruction(MachineInstr &, MachineFunction &,
const TargetDescription &,
MachineInstrFlags, bool) const {
return {};
}
Expected<bool> GIMatchTableExecutor::matchesTargetPredicate(std::string_view Name,
const MachineInstr &,
const MachineFunction &,
const TargetDescription &) const {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table uses unknown target predicate '" +
std::string(Name) + "'");
}
Expected<std::optional<GIMatchComplexOperand>>
GIMatchTableExecutor::renderComplexOperand(std::string_view, const MachineInstr &,
const MachineFunction &, const TargetDescription &,
std::uint32_t) const {
return std::optional<GIMatchComplexOperand>{};
}
Expected<bool> GIMatchTableExecutor::match(const GIMatchTable &Table,
const MachineInstr &Instruction,
const MachineFunction &Function,
const TargetDescription &Target) const {
for (const GIMatchTableRule &Rule : Table.Rules) {
auto Match = matchRule(Table, Rule, Instruction, Function, Target,
[this](std::string_view Name, const MachineInstr &Input,
const MachineFunction &InputFunction,
const TargetDescription &InputTarget) {
return matchesTargetPredicate(Name, Input, InputFunction, InputTarget);
});
if (!Match)
return std::unexpected(Match.error());
if (!*Match)
continue;
auto Complex = complexRenderersMatch(
**Match, Instruction, Function, Target,
[this](std::string_view Name, const MachineInstr &Input,
const MachineFunction &InputFunction, const TargetDescription &InputTarget,
std::uint32_t OperandIndex) {
return renderComplexOperand(Name, Input, InputFunction, InputTarget, OperandIndex);
});
if (!Complex)
return std::unexpected(Complex.error());
if (!*Complex)
continue;
for (const MatchedRule::Instruction &Action : (*Match)->Instructions) {
if (Target.instructionDescriptor(Action.ResultOpcode) == nullptr) {
return makeUnexpected(ErrorCode::VerificationError,
"generated match table selects an unknown instruction opcode");
}
}
return true;
}
return false;
}
Expected<bool> GIMatchTableExecutor::select(const GIMatchTable &Table, MachineInstr &Instruction,
MachineFunction &Function,
const TargetDescription &Target) const {
for (const GIMatchTableRule &Rule : Table.Rules) {
auto Match = matchRule(Table, Rule, Instruction, Function, Target,
[this](std::string_view Name, const MachineInstr &Input,
const MachineFunction &InputFunction,
const TargetDescription &InputTarget) {
return matchesTargetPredicate(Name, Input, InputFunction, InputTarget);
});
if (!Match)
return std::unexpected(Match.error());
if (!*Match)
continue;
auto Complex = complexRenderersMatch(
**Match, Instruction, Function, Target,
[this](std::string_view Name, const MachineInstr &Input,
const MachineFunction &InputFunction, const TargetDescription &InputTarget,
std::uint32_t OperandIndex) {
return renderComplexOperand(Name, Input, InputFunction, InputTarget, OperandIndex);
});
if (!Complex)
return std::unexpected(Complex.error());
if (!*Complex)
continue;
auto Applied = applyRule(
**Match, Instruction, Function, Target,
[this, &Function, &Target](MachineInstr &Output, MachineInstrFlags InputFlags,
bool InputMayRaiseFPException) {
return finalizeGeneratedInstruction(Output, Function, Target, InputFlags,
InputMayRaiseFPException);
},
[this](std::string_view Name, const MachineInstr &Input,
const MachineFunction &InputFunction, const TargetDescription &InputTarget,
std::uint32_t OperandIndex) {
return renderComplexOperand(Name, Input, InputFunction, InputTarget, OperandIndex);
});
if (!Applied)
return std::unexpected(Applied.error());
return true;
}
return false;
}
} // namespace rcc
|