1
//===- CodeGenDAGPatterns.cpp - Read DAG patterns from .td file -----------===//
3
// The LLVM Compiler Infrastructure
5
// This file is distributed under the University of Illinois Open Source
6
// License. See LICENSE.TXT for details.
8
//===----------------------------------------------------------------------===//
10
// This file implements the CodeGenDAGPatterns class, which is used to read and
11
// represent the patterns present in a .td file for instructions.
13
//===----------------------------------------------------------------------===//
15
#include "CodeGenDAGPatterns.h"
17
#include "llvm/ADT/StringExtras.h"
18
#include "llvm/Support/Debug.h"
24
//===----------------------------------------------------------------------===//
25
// Helpers for working with extended types.
27
/// FilterVTs - Filter a list of VT's according to a predicate.
30
static std::vector<MVT::SimpleValueType>
31
FilterVTs(const std::vector<MVT::SimpleValueType> &InVTs, T Filter) {
32
std::vector<MVT::SimpleValueType> Result;
33
for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
35
Result.push_back(InVTs[i]);
40
static std::vector<unsigned char>
41
FilterEVTs(const std::vector<unsigned char> &InVTs, T Filter) {
42
std::vector<unsigned char> Result;
43
for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
44
if (Filter((MVT::SimpleValueType)InVTs[i]))
45
Result.push_back(InVTs[i]);
49
static std::vector<unsigned char>
50
ConvertVTs(const std::vector<MVT::SimpleValueType> &InVTs) {
51
std::vector<unsigned char> Result;
52
for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
53
Result.push_back(InVTs[i]);
57
static inline bool isInteger(MVT::SimpleValueType VT) {
58
return EVT(VT).isInteger();
61
static inline bool isFloatingPoint(MVT::SimpleValueType VT) {
62
return EVT(VT).isFloatingPoint();
65
static inline bool isVector(MVT::SimpleValueType VT) {
66
return EVT(VT).isVector();
69
static bool LHSIsSubsetOfRHS(const std::vector<unsigned char> &LHS,
70
const std::vector<unsigned char> &RHS) {
71
if (LHS.size() > RHS.size()) return false;
72
for (unsigned i = 0, e = LHS.size(); i != e; ++i)
73
if (std::find(RHS.begin(), RHS.end(), LHS[i]) == RHS.end())
80
/// isExtIntegerInVTs - Return true if the specified extended value type vector
81
/// contains iAny or an integer value type.
82
bool isExtIntegerInVTs(const std::vector<unsigned char> &EVTs) {
83
assert(!EVTs.empty() && "Cannot check for integer in empty ExtVT list!");
84
return EVTs[0] == MVT::iAny || !(FilterEVTs(EVTs, isInteger).empty());
87
/// isExtFloatingPointInVTs - Return true if the specified extended value type
88
/// vector contains fAny or a FP value type.
89
bool isExtFloatingPointInVTs(const std::vector<unsigned char> &EVTs) {
90
assert(!EVTs.empty() && "Cannot check for FP in empty ExtVT list!");
91
return EVTs[0] == MVT::fAny || !(FilterEVTs(EVTs, isFloatingPoint).empty());
94
/// isExtVectorInVTs - Return true if the specified extended value type
95
/// vector contains vAny or a vector value type.
96
bool isExtVectorInVTs(const std::vector<unsigned char> &EVTs) {
97
assert(!EVTs.empty() && "Cannot check for vector in empty ExtVT list!");
98
return EVTs[0] == MVT::vAny || !(FilterEVTs(EVTs, isVector).empty());
100
} // end namespace EEVT.
101
} // end namespace llvm.
103
bool RecordPtrCmp::operator()(const Record *LHS, const Record *RHS) const {
104
return LHS->getID() < RHS->getID();
107
/// Dependent variable map for CodeGenDAGPattern variant generation
108
typedef std::map<std::string, int> DepVarMap;
110
/// Const iterator shorthand for DepVarMap
111
typedef DepVarMap::const_iterator DepVarMap_citer;
114
void FindDepVarsOf(TreePatternNode *N, DepVarMap &DepMap) {
116
if (dynamic_cast<DefInit*>(N->getLeafValue()) != NULL) {
117
DepMap[N->getName()]++;
120
for (size_t i = 0, e = N->getNumChildren(); i != e; ++i)
121
FindDepVarsOf(N->getChild(i), DepMap);
125
//! Find dependent variables within child patterns
128
void FindDepVars(TreePatternNode *N, MultipleUseVarSet &DepVars) {
130
FindDepVarsOf(N, depcounts);
131
for (DepVarMap_citer i = depcounts.begin(); i != depcounts.end(); ++i) {
132
if (i->second > 1) { // std::pair<std::string, int>
133
DepVars.insert(i->first);
138
//! Dump the dependent variable set:
139
void DumpDepVars(MultipleUseVarSet &DepVars) {
140
if (DepVars.empty()) {
141
DEBUG(errs() << "<empty set>");
143
DEBUG(errs() << "[ ");
144
for (MultipleUseVarSet::const_iterator i = DepVars.begin(), e = DepVars.end();
146
DEBUG(errs() << (*i) << " ");
148
DEBUG(errs() << "]");
153
//===----------------------------------------------------------------------===//
154
// PatternToMatch implementation
157
/// getPredicateCheck - Return a single string containing all of this
158
/// pattern's predicates concatenated with "&&" operators.
160
std::string PatternToMatch::getPredicateCheck() const {
161
std::string PredicateCheck;
162
for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {
163
if (DefInit *Pred = dynamic_cast<DefInit*>(Predicates->getElement(i))) {
164
Record *Def = Pred->getDef();
165
if (!Def->isSubClassOf("Predicate")) {
169
assert(0 && "Unknown predicate type!");
171
if (!PredicateCheck.empty())
172
PredicateCheck += " && ";
173
PredicateCheck += "(" + Def->getValueAsString("CondString") + ")";
177
return PredicateCheck;
180
//===----------------------------------------------------------------------===//
181
// SDTypeConstraint implementation
184
SDTypeConstraint::SDTypeConstraint(Record *R) {
185
OperandNo = R->getValueAsInt("OperandNum");
187
if (R->isSubClassOf("SDTCisVT")) {
188
ConstraintType = SDTCisVT;
189
x.SDTCisVT_Info.VT = getValueType(R->getValueAsDef("VT"));
190
} else if (R->isSubClassOf("SDTCisPtrTy")) {
191
ConstraintType = SDTCisPtrTy;
192
} else if (R->isSubClassOf("SDTCisInt")) {
193
ConstraintType = SDTCisInt;
194
} else if (R->isSubClassOf("SDTCisFP")) {
195
ConstraintType = SDTCisFP;
196
} else if (R->isSubClassOf("SDTCisVec")) {
197
ConstraintType = SDTCisVec;
198
} else if (R->isSubClassOf("SDTCisSameAs")) {
199
ConstraintType = SDTCisSameAs;
200
x.SDTCisSameAs_Info.OtherOperandNum = R->getValueAsInt("OtherOperandNum");
201
} else if (R->isSubClassOf("SDTCisVTSmallerThanOp")) {
202
ConstraintType = SDTCisVTSmallerThanOp;
203
x.SDTCisVTSmallerThanOp_Info.OtherOperandNum =
204
R->getValueAsInt("OtherOperandNum");
205
} else if (R->isSubClassOf("SDTCisOpSmallerThanOp")) {
206
ConstraintType = SDTCisOpSmallerThanOp;
207
x.SDTCisOpSmallerThanOp_Info.BigOperandNum =
208
R->getValueAsInt("BigOperandNum");
209
} else if (R->isSubClassOf("SDTCisEltOfVec")) {
210
ConstraintType = SDTCisEltOfVec;
211
x.SDTCisEltOfVec_Info.OtherOperandNum =
212
R->getValueAsInt("OtherOpNum");
214
errs() << "Unrecognized SDTypeConstraint '" << R->getName() << "'!\n";
219
/// getOperandNum - Return the node corresponding to operand #OpNo in tree
220
/// N, which has NumResults results.
221
TreePatternNode *SDTypeConstraint::getOperandNum(unsigned OpNo,
223
unsigned NumResults) const {
224
assert(NumResults <= 1 &&
225
"We only work with nodes with zero or one result so far!");
227
if (OpNo >= (NumResults + N->getNumChildren())) {
228
errs() << "Invalid operand number " << OpNo << " ";
234
if (OpNo < NumResults)
235
return N; // FIXME: need value #
237
return N->getChild(OpNo-NumResults);
240
/// ApplyTypeConstraint - Given a node in a pattern, apply this type
241
/// constraint to the nodes operands. This returns true if it makes a
242
/// change, false otherwise. If a type contradiction is found, throw an
244
bool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N,
245
const SDNodeInfo &NodeInfo,
246
TreePattern &TP) const {
247
unsigned NumResults = NodeInfo.getNumResults();
248
assert(NumResults <= 1 &&
249
"We only work with nodes with zero or one result so far!");
251
// Check that the number of operands is sane. Negative operands -> varargs.
252
if (NodeInfo.getNumOperands() >= 0) {
253
if (N->getNumChildren() != (unsigned)NodeInfo.getNumOperands())
254
TP.error(N->getOperator()->getName() + " node requires exactly " +
255
itostr(NodeInfo.getNumOperands()) + " operands!");
258
const CodeGenTarget &CGT = TP.getDAGPatterns().getTargetInfo();
260
TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NumResults);
262
switch (ConstraintType) {
263
default: assert(0 && "Unknown constraint type!");
265
// Operand must be a particular type.
266
return NodeToApply->UpdateNodeType(x.SDTCisVT_Info.VT, TP);
268
// Operand must be same as target pointer type.
269
return NodeToApply->UpdateNodeType(MVT::iPTR, TP);
272
// If there is only one integer type supported, this must be it.
273
std::vector<MVT::SimpleValueType> IntVTs =
274
FilterVTs(CGT.getLegalValueTypes(), isInteger);
276
// If we found exactly one supported integer type, apply it.
277
if (IntVTs.size() == 1)
278
return NodeToApply->UpdateNodeType(IntVTs[0], TP);
279
return NodeToApply->UpdateNodeType(MVT::iAny, TP);
282
// If there is only one FP type supported, this must be it.
283
std::vector<MVT::SimpleValueType> FPVTs =
284
FilterVTs(CGT.getLegalValueTypes(), isFloatingPoint);
286
// If we found exactly one supported FP type, apply it.
287
if (FPVTs.size() == 1)
288
return NodeToApply->UpdateNodeType(FPVTs[0], TP);
289
return NodeToApply->UpdateNodeType(MVT::fAny, TP);
292
// If there is only one vector type supported, this must be it.
293
std::vector<MVT::SimpleValueType> VecVTs =
294
FilterVTs(CGT.getLegalValueTypes(), isVector);
296
// If we found exactly one supported vector type, apply it.
297
if (VecVTs.size() == 1)
298
return NodeToApply->UpdateNodeType(VecVTs[0], TP);
299
return NodeToApply->UpdateNodeType(MVT::vAny, TP);
302
TreePatternNode *OtherNode =
303
getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NumResults);
304
return NodeToApply->UpdateNodeType(OtherNode->getExtTypes(), TP) |
305
OtherNode->UpdateNodeType(NodeToApply->getExtTypes(), TP);
307
case SDTCisVTSmallerThanOp: {
308
// The NodeToApply must be a leaf node that is a VT. OtherOperandNum must
309
// have an integer type that is smaller than the VT.
310
if (!NodeToApply->isLeaf() ||
311
!dynamic_cast<DefInit*>(NodeToApply->getLeafValue()) ||
312
!static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef()
313
->isSubClassOf("ValueType"))
314
TP.error(N->getOperator()->getName() + " expects a VT operand!");
315
MVT::SimpleValueType VT =
316
getValueType(static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef());
318
TP.error(N->getOperator()->getName() + " VT operand must be integer!");
320
TreePatternNode *OtherNode =
321
getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N,NumResults);
323
// It must be integer.
324
bool MadeChange = OtherNode->UpdateNodeType(MVT::iAny, TP);
326
// This code only handles nodes that have one type set. Assert here so
327
// that we can change this if we ever need to deal with multiple value
328
// types at this point.
329
assert(OtherNode->getExtTypes().size() == 1 && "Node has too many types!");
330
if (OtherNode->hasTypeSet() && OtherNode->getTypeNum(0) <= VT)
331
OtherNode->UpdateNodeType(MVT::Other, TP); // Throw an error.
334
case SDTCisOpSmallerThanOp: {
335
TreePatternNode *BigOperand =
336
getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NumResults);
338
// Both operands must be integer or FP, but we don't care which.
339
bool MadeChange = false;
341
// This code does not currently handle nodes which have multiple types,
342
// where some types are integer, and some are fp. Assert that this is not
344
assert(!(EEVT::isExtIntegerInVTs(NodeToApply->getExtTypes()) &&
345
EEVT::isExtFloatingPointInVTs(NodeToApply->getExtTypes())) &&
346
!(EEVT::isExtIntegerInVTs(BigOperand->getExtTypes()) &&
347
EEVT::isExtFloatingPointInVTs(BigOperand->getExtTypes())) &&
348
"SDTCisOpSmallerThanOp does not handle mixed int/fp types!");
349
if (EEVT::isExtIntegerInVTs(NodeToApply->getExtTypes()))
350
MadeChange |= BigOperand->UpdateNodeType(MVT::iAny, TP);
351
else if (EEVT::isExtFloatingPointInVTs(NodeToApply->getExtTypes()))
352
MadeChange |= BigOperand->UpdateNodeType(MVT::fAny, TP);
353
if (EEVT::isExtIntegerInVTs(BigOperand->getExtTypes()))
354
MadeChange |= NodeToApply->UpdateNodeType(MVT::iAny, TP);
355
else if (EEVT::isExtFloatingPointInVTs(BigOperand->getExtTypes()))
356
MadeChange |= NodeToApply->UpdateNodeType(MVT::fAny, TP);
358
std::vector<MVT::SimpleValueType> VTs = CGT.getLegalValueTypes();
360
if (EEVT::isExtIntegerInVTs(NodeToApply->getExtTypes())) {
361
VTs = FilterVTs(VTs, isInteger);
362
} else if (EEVT::isExtFloatingPointInVTs(NodeToApply->getExtTypes())) {
363
VTs = FilterVTs(VTs, isFloatingPoint);
368
switch (VTs.size()) {
369
default: // Too many VT's to pick from.
370
case 0: break; // No info yet.
372
// Only one VT of this flavor. Cannot ever satisfy the constraints.
373
return NodeToApply->UpdateNodeType(MVT::Other, TP); // throw
375
// If we have exactly two possible types, the little operand must be the
376
// small one, the big operand should be the big one. Common with
377
// float/double for example.
378
assert(VTs[0] < VTs[1] && "Should be sorted!");
379
MadeChange |= NodeToApply->UpdateNodeType(VTs[0], TP);
380
MadeChange |= BigOperand->UpdateNodeType(VTs[1], TP);
385
case SDTCisEltOfVec: {
386
TreePatternNode *OtherOperand =
387
getOperandNum(x.SDTCisEltOfVec_Info.OtherOperandNum,
389
if (OtherOperand->hasTypeSet()) {
390
if (!isVector(OtherOperand->getTypeNum(0)))
391
TP.error(N->getOperator()->getName() + " VT operand must be a vector!");
392
EVT IVT = OtherOperand->getTypeNum(0);
393
IVT = IVT.getVectorElementType();
394
return NodeToApply->UpdateNodeType(IVT.getSimpleVT().SimpleTy, TP);
402
//===----------------------------------------------------------------------===//
403
// SDNodeInfo implementation
405
SDNodeInfo::SDNodeInfo(Record *R) : Def(R) {
406
EnumName = R->getValueAsString("Opcode");
407
SDClassName = R->getValueAsString("SDClass");
408
Record *TypeProfile = R->getValueAsDef("TypeProfile");
409
NumResults = TypeProfile->getValueAsInt("NumResults");
410
NumOperands = TypeProfile->getValueAsInt("NumOperands");
412
// Parse the properties.
414
std::vector<Record*> PropList = R->getValueAsListOfDefs("Properties");
415
for (unsigned i = 0, e = PropList.size(); i != e; ++i) {
416
if (PropList[i]->getName() == "SDNPCommutative") {
417
Properties |= 1 << SDNPCommutative;
418
} else if (PropList[i]->getName() == "SDNPAssociative") {
419
Properties |= 1 << SDNPAssociative;
420
} else if (PropList[i]->getName() == "SDNPHasChain") {
421
Properties |= 1 << SDNPHasChain;
422
} else if (PropList[i]->getName() == "SDNPOutFlag") {
423
Properties |= 1 << SDNPOutFlag;
424
} else if (PropList[i]->getName() == "SDNPInFlag") {
425
Properties |= 1 << SDNPInFlag;
426
} else if (PropList[i]->getName() == "SDNPOptInFlag") {
427
Properties |= 1 << SDNPOptInFlag;
428
} else if (PropList[i]->getName() == "SDNPMayStore") {
429
Properties |= 1 << SDNPMayStore;
430
} else if (PropList[i]->getName() == "SDNPMayLoad") {
431
Properties |= 1 << SDNPMayLoad;
432
} else if (PropList[i]->getName() == "SDNPSideEffect") {
433
Properties |= 1 << SDNPSideEffect;
434
} else if (PropList[i]->getName() == "SDNPMemOperand") {
435
Properties |= 1 << SDNPMemOperand;
437
errs() << "Unknown SD Node property '" << PropList[i]->getName()
438
<< "' on node '" << R->getName() << "'!\n";
444
// Parse the type constraints.
445
std::vector<Record*> ConstraintList =
446
TypeProfile->getValueAsListOfDefs("Constraints");
447
TypeConstraints.assign(ConstraintList.begin(), ConstraintList.end());
450
/// getKnownType - If the type constraints on this node imply a fixed type
451
/// (e.g. all stores return void, etc), then return it as an
452
/// MVT::SimpleValueType. Otherwise, return EEVT::isUnknown.
453
unsigned SDNodeInfo::getKnownType() const {
454
unsigned NumResults = getNumResults();
455
assert(NumResults <= 1 &&
456
"We only work with nodes with zero or one result so far!");
458
for (unsigned i = 0, e = TypeConstraints.size(); i != e; ++i) {
459
// Make sure that this applies to the correct node result.
460
if (TypeConstraints[i].OperandNo >= NumResults) // FIXME: need value #
463
switch (TypeConstraints[i].ConstraintType) {
465
case SDTypeConstraint::SDTCisVT:
466
return TypeConstraints[i].x.SDTCisVT_Info.VT;
467
case SDTypeConstraint::SDTCisPtrTy:
471
return EEVT::isUnknown;
474
//===----------------------------------------------------------------------===//
475
// TreePatternNode implementation
478
TreePatternNode::~TreePatternNode() {
479
#if 0 // FIXME: implement refcounted tree nodes!
480
for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
485
/// UpdateNodeType - Set the node type of N to VT if VT contains
486
/// information. If N already contains a conflicting type, then throw an
487
/// exception. This returns true if any information was updated.
489
bool TreePatternNode::UpdateNodeType(const std::vector<unsigned char> &ExtVTs,
491
assert(!ExtVTs.empty() && "Cannot update node type with empty type vector!");
493
if (ExtVTs[0] == EEVT::isUnknown || LHSIsSubsetOfRHS(getExtTypes(), ExtVTs))
495
if (isTypeCompletelyUnknown() || LHSIsSubsetOfRHS(ExtVTs, getExtTypes())) {
500
if (getExtTypeNum(0) == MVT::iPTR || getExtTypeNum(0) == MVT::iPTRAny) {
501
if (ExtVTs[0] == MVT::iPTR || ExtVTs[0] == MVT::iPTRAny ||
502
ExtVTs[0] == MVT::iAny)
504
if (EEVT::isExtIntegerInVTs(ExtVTs)) {
505
std::vector<unsigned char> FVTs = FilterEVTs(ExtVTs, isInteger);
513
// Merge vAny with iAny/fAny. The latter include vector types so keep them
514
// as the more specific information.
515
if (ExtVTs[0] == MVT::vAny &&
516
(getExtTypeNum(0) == MVT::iAny || getExtTypeNum(0) == MVT::fAny))
518
if (getExtTypeNum(0) == MVT::vAny &&
519
(ExtVTs[0] == MVT::iAny || ExtVTs[0] == MVT::fAny)) {
524
if (ExtVTs[0] == MVT::iAny &&
525
EEVT::isExtIntegerInVTs(getExtTypes())) {
526
assert(hasTypeSet() && "should be handled above!");
527
std::vector<unsigned char> FVTs = FilterEVTs(getExtTypes(), isInteger);
528
if (getExtTypes() == FVTs)
533
if ((ExtVTs[0] == MVT::iPTR || ExtVTs[0] == MVT::iPTRAny) &&
534
EEVT::isExtIntegerInVTs(getExtTypes())) {
535
//assert(hasTypeSet() && "should be handled above!");
536
std::vector<unsigned char> FVTs = FilterEVTs(getExtTypes(), isInteger);
537
if (getExtTypes() == FVTs)
544
if (ExtVTs[0] == MVT::fAny &&
545
EEVT::isExtFloatingPointInVTs(getExtTypes())) {
546
assert(hasTypeSet() && "should be handled above!");
547
std::vector<unsigned char> FVTs =
548
FilterEVTs(getExtTypes(), isFloatingPoint);
549
if (getExtTypes() == FVTs)
554
if (ExtVTs[0] == MVT::vAny &&
555
EEVT::isExtVectorInVTs(getExtTypes())) {
556
assert(hasTypeSet() && "should be handled above!");
557
std::vector<unsigned char> FVTs = FilterEVTs(getExtTypes(), isVector);
558
if (getExtTypes() == FVTs)
564
// If we know this is an int, FP, or vector type, and we are told it is a
565
// specific one, take the advice.
567
// Similarly, we should probably set the type here to the intersection of
568
// {iAny|fAny|vAny} and ExtVTs
569
if ((getExtTypeNum(0) == MVT::iAny &&
570
EEVT::isExtIntegerInVTs(ExtVTs)) ||
571
(getExtTypeNum(0) == MVT::fAny &&
572
EEVT::isExtFloatingPointInVTs(ExtVTs)) ||
573
(getExtTypeNum(0) == MVT::vAny &&
574
EEVT::isExtVectorInVTs(ExtVTs))) {
578
if (getExtTypeNum(0) == MVT::iAny &&
579
(ExtVTs[0] == MVT::iPTR || ExtVTs[0] == MVT::iPTRAny)) {
587
TP.error("Type inference contradiction found in node!");
589
TP.error("Type inference contradiction found in node " +
590
getOperator()->getName() + "!");
592
return true; // unreachable
595
static std::string GetTypeName(unsigned char TypeID) {
597
case MVT::Other: return "Other";
598
case MVT::iAny: return "iAny";
599
case MVT::fAny: return "fAny";
600
case MVT::vAny: return "vAny";
601
case EEVT::isUnknown: return "isUnknown";
602
case MVT::iPTR: return "iPTR";
603
case MVT::iPTRAny: return "iPTRAny";
605
std::string VTName = llvm::getName((MVT::SimpleValueType)TypeID);
606
// Strip off EVT:: prefix if present.
607
if (VTName.substr(0,5) == "MVT::")
608
VTName = VTName.substr(5);
614
void TreePatternNode::print(raw_ostream &OS) const {
616
OS << *getLeafValue();
618
OS << '(' << getOperator()->getName();
621
// FIXME: At some point we should handle printing all the value types for
622
// nodes that are multiply typed.
623
if (getExtTypeNum(0) != EEVT::isUnknown)
624
OS << ':' << GetTypeName(getExtTypeNum(0));
627
if (getNumChildren() != 0) {
629
getChild(0)->print(OS);
630
for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
632
getChild(i)->print(OS);
638
for (unsigned i = 0, e = PredicateFns.size(); i != e; ++i)
639
OS << "<<P:" << PredicateFns[i] << ">>";
641
OS << "<<X:" << TransformFn->getName() << ">>";
642
if (!getName().empty())
643
OS << ":$" << getName();
646
void TreePatternNode::dump() const {
650
/// isIsomorphicTo - Return true if this node is recursively
651
/// isomorphic to the specified node. For this comparison, the node's
652
/// entire state is considered. The assigned name is ignored, since
653
/// nodes with differing names are considered isomorphic. However, if
654
/// the assigned name is present in the dependent variable set, then
655
/// the assigned name is considered significant and the node is
656
/// isomorphic if the names match.
657
bool TreePatternNode::isIsomorphicTo(const TreePatternNode *N,
658
const MultipleUseVarSet &DepVars) const {
659
if (N == this) return true;
660
if (N->isLeaf() != isLeaf() || getExtTypes() != N->getExtTypes() ||
661
getPredicateFns() != N->getPredicateFns() ||
662
getTransformFn() != N->getTransformFn())
666
if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
667
if (DefInit *NDI = dynamic_cast<DefInit*>(N->getLeafValue())) {
668
return ((DI->getDef() == NDI->getDef())
669
&& (DepVars.find(getName()) == DepVars.end()
670
|| getName() == N->getName()));
673
return getLeafValue() == N->getLeafValue();
676
if (N->getOperator() != getOperator() ||
677
N->getNumChildren() != getNumChildren()) return false;
678
for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
679
if (!getChild(i)->isIsomorphicTo(N->getChild(i), DepVars))
684
/// clone - Make a copy of this tree and all of its children.
686
TreePatternNode *TreePatternNode::clone() const {
687
TreePatternNode *New;
689
New = new TreePatternNode(getLeafValue());
691
std::vector<TreePatternNode*> CChildren;
692
CChildren.reserve(Children.size());
693
for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
694
CChildren.push_back(getChild(i)->clone());
695
New = new TreePatternNode(getOperator(), CChildren);
697
New->setName(getName());
698
New->setTypes(getExtTypes());
699
New->setPredicateFns(getPredicateFns());
700
New->setTransformFn(getTransformFn());
704
/// RemoveAllTypes - Recursively strip all the types of this tree.
705
void TreePatternNode::RemoveAllTypes() {
707
if (isLeaf()) return;
708
for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
709
getChild(i)->RemoveAllTypes();
713
/// SubstituteFormalArguments - Replace the formal arguments in this tree
714
/// with actual values specified by ArgMap.
715
void TreePatternNode::
716
SubstituteFormalArguments(std::map<std::string, TreePatternNode*> &ArgMap) {
717
if (isLeaf()) return;
719
for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
720
TreePatternNode *Child = getChild(i);
721
if (Child->isLeaf()) {
722
Init *Val = Child->getLeafValue();
723
if (dynamic_cast<DefInit*>(Val) &&
724
static_cast<DefInit*>(Val)->getDef()->getName() == "node") {
725
// We found a use of a formal argument, replace it with its value.
726
TreePatternNode *NewChild = ArgMap[Child->getName()];
727
assert(NewChild && "Couldn't find formal argument!");
728
assert((Child->getPredicateFns().empty() ||
729
NewChild->getPredicateFns() == Child->getPredicateFns()) &&
730
"Non-empty child predicate clobbered!");
731
setChild(i, NewChild);
734
getChild(i)->SubstituteFormalArguments(ArgMap);
740
/// InlinePatternFragments - If this pattern refers to any pattern
741
/// fragments, inline them into place, giving us a pattern without any
742
/// PatFrag references.
743
TreePatternNode *TreePatternNode::InlinePatternFragments(TreePattern &TP) {
744
if (isLeaf()) return this; // nothing to do.
745
Record *Op = getOperator();
747
if (!Op->isSubClassOf("PatFrag")) {
748
// Just recursively inline children nodes.
749
for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
750
TreePatternNode *Child = getChild(i);
751
TreePatternNode *NewChild = Child->InlinePatternFragments(TP);
753
assert((Child->getPredicateFns().empty() ||
754
NewChild->getPredicateFns() == Child->getPredicateFns()) &&
755
"Non-empty child predicate clobbered!");
757
setChild(i, NewChild);
762
// Otherwise, we found a reference to a fragment. First, look up its
763
// TreePattern record.
764
TreePattern *Frag = TP.getDAGPatterns().getPatternFragment(Op);
766
// Verify that we are passing the right number of operands.
767
if (Frag->getNumArgs() != Children.size())
768
TP.error("'" + Op->getName() + "' fragment requires " +
769
utostr(Frag->getNumArgs()) + " operands!");
771
TreePatternNode *FragTree = Frag->getOnlyTree()->clone();
773
std::string Code = Op->getValueAsCode("Predicate");
775
FragTree->addPredicateFn("Predicate_"+Op->getName());
777
// Resolve formal arguments to their actual value.
778
if (Frag->getNumArgs()) {
779
// Compute the map of formal to actual arguments.
780
std::map<std::string, TreePatternNode*> ArgMap;
781
for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i)
782
ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
784
FragTree->SubstituteFormalArguments(ArgMap);
787
FragTree->setName(getName());
788
FragTree->UpdateNodeType(getExtTypes(), TP);
790
// Transfer in the old predicates.
791
for (unsigned i = 0, e = getPredicateFns().size(); i != e; ++i)
792
FragTree->addPredicateFn(getPredicateFns()[i]);
794
// Get a new copy of this fragment to stitch into here.
795
//delete this; // FIXME: implement refcounting!
797
// The fragment we inlined could have recursive inlining that is needed. See
798
// if there are any pattern fragments in it and inline them as needed.
799
return FragTree->InlinePatternFragments(TP);
802
/// getImplicitType - Check to see if the specified record has an implicit
803
/// type which should be applied to it. This will infer the type of register
804
/// references from the register file information, for example.
806
static std::vector<unsigned char> getImplicitType(Record *R, bool NotRegisters,
808
// Some common return values
809
std::vector<unsigned char> Unknown(1, EEVT::isUnknown);
810
std::vector<unsigned char> Other(1, MVT::Other);
812
// Check to see if this is a register or a register class...
813
if (R->isSubClassOf("RegisterClass")) {
816
const CodeGenRegisterClass &RC =
817
TP.getDAGPatterns().getTargetInfo().getRegisterClass(R);
818
return ConvertVTs(RC.getValueTypes());
819
} else if (R->isSubClassOf("PatFrag")) {
820
// Pattern fragment types will be resolved when they are inlined.
822
} else if (R->isSubClassOf("Register")) {
825
const CodeGenTarget &T = TP.getDAGPatterns().getTargetInfo();
826
return T.getRegisterVTs(R);
827
} else if (R->isSubClassOf("ValueType") || R->isSubClassOf("CondCode")) {
828
// Using a VTSDNode or CondCodeSDNode.
830
} else if (R->isSubClassOf("ComplexPattern")) {
833
std::vector<unsigned char>
834
ComplexPat(1, TP.getDAGPatterns().getComplexPattern(R).getValueType());
836
} else if (R->isSubClassOf("PointerLikeRegClass")) {
837
Other[0] = MVT::iPTR;
839
} else if (R->getName() == "node" || R->getName() == "srcvalue" ||
840
R->getName() == "zero_reg") {
845
TP.error("Unknown node flavor used in pattern: " + R->getName());
850
/// getIntrinsicInfo - If this node corresponds to an intrinsic, return the
851
/// CodeGenIntrinsic information for it, otherwise return a null pointer.
852
const CodeGenIntrinsic *TreePatternNode::
853
getIntrinsicInfo(const CodeGenDAGPatterns &CDP) const {
854
if (getOperator() != CDP.get_intrinsic_void_sdnode() &&
855
getOperator() != CDP.get_intrinsic_w_chain_sdnode() &&
856
getOperator() != CDP.get_intrinsic_wo_chain_sdnode())
860
dynamic_cast<IntInit*>(getChild(0)->getLeafValue())->getValue();
861
return &CDP.getIntrinsicInfo(IID);
864
/// getComplexPatternInfo - If this node corresponds to a ComplexPattern,
865
/// return the ComplexPattern information, otherwise return null.
866
const ComplexPattern *
867
TreePatternNode::getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const {
868
if (!isLeaf()) return 0;
870
DefInit *DI = dynamic_cast<DefInit*>(getLeafValue());
871
if (DI && DI->getDef()->isSubClassOf("ComplexPattern"))
872
return &CGP.getComplexPattern(DI->getDef());
876
/// NodeHasProperty - Return true if this node has the specified property.
877
bool TreePatternNode::NodeHasProperty(SDNP Property,
878
const CodeGenDAGPatterns &CGP) const {
880
if (const ComplexPattern *CP = getComplexPatternInfo(CGP))
881
return CP->hasProperty(Property);
885
Record *Operator = getOperator();
886
if (!Operator->isSubClassOf("SDNode")) return false;
888
return CGP.getSDNodeInfo(Operator).hasProperty(Property);
894
/// TreeHasProperty - Return true if any node in this tree has the specified
896
bool TreePatternNode::TreeHasProperty(SDNP Property,
897
const CodeGenDAGPatterns &CGP) const {
898
if (NodeHasProperty(Property, CGP))
900
for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
901
if (getChild(i)->TreeHasProperty(Property, CGP))
906
/// isCommutativeIntrinsic - Return true if the node corresponds to a
907
/// commutative intrinsic.
909
TreePatternNode::isCommutativeIntrinsic(const CodeGenDAGPatterns &CDP) const {
910
if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CDP))
911
return Int->isCommutative;
916
/// ApplyTypeConstraints - Apply all of the type constraints relevant to
917
/// this node and its children in the tree. This returns true if it makes a
918
/// change, false otherwise. If a type contradiction is found, throw an
920
bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
921
CodeGenDAGPatterns &CDP = TP.getDAGPatterns();
923
if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
924
// If it's a regclass or something else known, include the type.
925
return UpdateNodeType(getImplicitType(DI->getDef(), NotRegisters, TP),TP);
928
if (IntInit *II = dynamic_cast<IntInit*>(getLeafValue())) {
929
// Int inits are always integers. :)
930
bool MadeChange = UpdateNodeType(MVT::iAny, TP);
933
// At some point, it may make sense for this tree pattern to have
934
// multiple types. Assert here that it does not, so we revisit this
935
// code when appropriate.
936
assert(getExtTypes().size() >= 1 && "TreePattern doesn't have a type!");
937
MVT::SimpleValueType VT = getTypeNum(0);
938
for (unsigned i = 1, e = getExtTypes().size(); i != e; ++i)
939
assert(getTypeNum(i) == VT && "TreePattern has too many types!");
942
if (VT != MVT::iPTR && VT != MVT::iPTRAny) {
943
unsigned Size = EVT(VT).getSizeInBits();
944
// Make sure that the value is representable for this type.
946
int Val = (II->getValue() << (32-Size)) >> (32-Size);
947
if (Val != II->getValue()) {
948
// If sign-extended doesn't fit, does it fit as unsigned?
950
unsigned UnsignedVal;
951
ValueMask = unsigned(~uint32_t(0UL) >> (32-Size));
952
UnsignedVal = unsigned(II->getValue());
954
if ((ValueMask & UnsignedVal) != UnsignedVal) {
955
TP.error("Integer value '" + itostr(II->getValue())+
956
"' is out of range for type '" +
957
getEnumName(getTypeNum(0)) + "'!");
969
// special handling for set, which isn't really an SDNode.
970
if (getOperator()->getName() == "set") {
971
assert (getNumChildren() >= 2 && "Missing RHS of a set?");
972
unsigned NC = getNumChildren();
973
bool MadeChange = false;
974
for (unsigned i = 0; i < NC-1; ++i) {
975
MadeChange = getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
976
MadeChange |= getChild(NC-1)->ApplyTypeConstraints(TP, NotRegisters);
978
// Types of operands must match.
979
MadeChange |= getChild(i)->UpdateNodeType(getChild(NC-1)->getExtTypes(),
981
MadeChange |= getChild(NC-1)->UpdateNodeType(getChild(i)->getExtTypes(),
983
MadeChange |= UpdateNodeType(MVT::isVoid, TP);
988
if (getOperator()->getName() == "implicit" ||
989
getOperator()->getName() == "parallel") {
990
bool MadeChange = false;
991
for (unsigned i = 0; i < getNumChildren(); ++i)
992
MadeChange = getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
993
MadeChange |= UpdateNodeType(MVT::isVoid, TP);
997
if (getOperator()->getName() == "COPY_TO_REGCLASS") {
998
bool MadeChange = false;
999
MadeChange |= getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
1000
MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters);
1004
if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CDP)) {
1005
bool MadeChange = false;
1007
// Apply the result type to the node.
1008
unsigned NumRetVTs = Int->IS.RetVTs.size();
1009
unsigned NumParamVTs = Int->IS.ParamVTs.size();
1011
for (unsigned i = 0, e = NumRetVTs; i != e; ++i)
1012
MadeChange |= UpdateNodeType(Int->IS.RetVTs[i], TP);
1014
if (getNumChildren() != NumParamVTs + NumRetVTs)
1015
TP.error("Intrinsic '" + Int->Name + "' expects " +
1016
utostr(NumParamVTs + NumRetVTs - 1) + " operands, not " +
1017
utostr(getNumChildren() - 1) + " operands!");
1019
// Apply type info to the intrinsic ID.
1020
MadeChange |= getChild(0)->UpdateNodeType(MVT::iPTR, TP);
1022
for (unsigned i = NumRetVTs, e = getNumChildren(); i != e; ++i) {
1023
MVT::SimpleValueType OpVT = Int->IS.ParamVTs[i - NumRetVTs];
1024
MadeChange |= getChild(i)->UpdateNodeType(OpVT, TP);
1025
MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1030
if (getOperator()->isSubClassOf("SDNode")) {
1031
const SDNodeInfo &NI = CDP.getSDNodeInfo(getOperator());
1033
bool MadeChange = NI.ApplyTypeConstraints(this, TP);
1034
for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1035
MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1036
// Branch, etc. do not produce results and top-level forms in instr pattern
1037
// must have void types.
1038
if (NI.getNumResults() == 0)
1039
MadeChange |= UpdateNodeType(MVT::isVoid, TP);
1044
if (getOperator()->isSubClassOf("Instruction")) {
1045
const DAGInstruction &Inst = CDP.getInstruction(getOperator());
1046
bool MadeChange = false;
1047
unsigned NumResults = Inst.getNumResults();
1049
assert(NumResults <= 1 &&
1050
"Only supports zero or one result instrs!");
1052
CodeGenInstruction &InstInfo =
1053
CDP.getTargetInfo().getInstruction(getOperator()->getName());
1054
// Apply the result type to the node
1055
if (NumResults == 0 || InstInfo.NumDefs == 0) {
1056
MadeChange = UpdateNodeType(MVT::isVoid, TP);
1058
Record *ResultNode = Inst.getResult(0);
1060
if (ResultNode->isSubClassOf("PointerLikeRegClass")) {
1061
std::vector<unsigned char> VT;
1062
VT.push_back(MVT::iPTR);
1063
MadeChange = UpdateNodeType(VT, TP);
1064
} else if (ResultNode->getName() == "unknown") {
1065
std::vector<unsigned char> VT;
1066
VT.push_back(EEVT::isUnknown);
1067
MadeChange = UpdateNodeType(VT, TP);
1069
assert(ResultNode->isSubClassOf("RegisterClass") &&
1070
"Operands should be register classes!");
1072
const CodeGenRegisterClass &RC =
1073
CDP.getTargetInfo().getRegisterClass(ResultNode);
1074
MadeChange = UpdateNodeType(ConvertVTs(RC.getValueTypes()), TP);
1078
unsigned ChildNo = 0;
1079
for (unsigned i = 0, e = Inst.getNumOperands(); i != e; ++i) {
1080
Record *OperandNode = Inst.getOperand(i);
1082
// If the instruction expects a predicate or optional def operand, we
1083
// codegen this by setting the operand to it's default value if it has a
1084
// non-empty DefaultOps field.
1085
if ((OperandNode->isSubClassOf("PredicateOperand") ||
1086
OperandNode->isSubClassOf("OptionalDefOperand")) &&
1087
!CDP.getDefaultOperand(OperandNode).DefaultOps.empty())
1090
// Verify that we didn't run out of provided operands.
1091
if (ChildNo >= getNumChildren())
1092
TP.error("Instruction '" + getOperator()->getName() +
1093
"' expects more operands than were provided.");
1095
MVT::SimpleValueType VT;
1096
TreePatternNode *Child = getChild(ChildNo++);
1097
if (OperandNode->isSubClassOf("RegisterClass")) {
1098
const CodeGenRegisterClass &RC =
1099
CDP.getTargetInfo().getRegisterClass(OperandNode);
1100
MadeChange |= Child->UpdateNodeType(ConvertVTs(RC.getValueTypes()), TP);
1101
} else if (OperandNode->isSubClassOf("Operand")) {
1102
VT = getValueType(OperandNode->getValueAsDef("Type"));
1103
MadeChange |= Child->UpdateNodeType(VT, TP);
1104
} else if (OperandNode->isSubClassOf("PointerLikeRegClass")) {
1105
MadeChange |= Child->UpdateNodeType(MVT::iPTR, TP);
1106
} else if (OperandNode->getName() == "unknown") {
1107
MadeChange |= Child->UpdateNodeType(EEVT::isUnknown, TP);
1109
assert(0 && "Unknown operand type!");
1112
MadeChange |= Child->ApplyTypeConstraints(TP, NotRegisters);
1115
if (ChildNo != getNumChildren())
1116
TP.error("Instruction '" + getOperator()->getName() +
1117
"' was provided too many operands!");
1122
assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!");
1124
// Node transforms always take one operand.
1125
if (getNumChildren() != 1)
1126
TP.error("Node transform '" + getOperator()->getName() +
1127
"' requires one operand!");
1129
// If either the output or input of the xform does not have exact
1130
// type info. We assume they must be the same. Otherwise, it is perfectly
1131
// legal to transform from one type to a completely different type.
1132
if (!hasTypeSet() || !getChild(0)->hasTypeSet()) {
1133
bool MadeChange = UpdateNodeType(getChild(0)->getExtTypes(), TP);
1134
MadeChange |= getChild(0)->UpdateNodeType(getExtTypes(), TP);
1140
/// OnlyOnRHSOfCommutative - Return true if this value is only allowed on the
1141
/// RHS of a commutative operation, not the on LHS.
1142
static bool OnlyOnRHSOfCommutative(TreePatternNode *N) {
1143
if (!N->isLeaf() && N->getOperator()->getName() == "imm")
1145
if (N->isLeaf() && dynamic_cast<IntInit*>(N->getLeafValue()))
1151
/// canPatternMatch - If it is impossible for this pattern to match on this
1152
/// target, fill in Reason and return false. Otherwise, return true. This is
1153
/// used as a sanity check for .td files (to prevent people from writing stuff
1154
/// that can never possibly work), and to prevent the pattern permuter from
1155
/// generating stuff that is useless.
1156
bool TreePatternNode::canPatternMatch(std::string &Reason,
1157
const CodeGenDAGPatterns &CDP) {
1158
if (isLeaf()) return true;
1160
for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1161
if (!getChild(i)->canPatternMatch(Reason, CDP))
1164
// If this is an intrinsic, handle cases that would make it not match. For
1165
// example, if an operand is required to be an immediate.
1166
if (getOperator()->isSubClassOf("Intrinsic")) {
1171
// If this node is a commutative operator, check that the LHS isn't an
1173
const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(getOperator());
1174
bool isCommIntrinsic = isCommutativeIntrinsic(CDP);
1175
if (NodeInfo.hasProperty(SDNPCommutative) || isCommIntrinsic) {
1176
// Scan all of the operands of the node and make sure that only the last one
1177
// is a constant node, unless the RHS also is.
1178
if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {
1179
bool Skip = isCommIntrinsic ? 1 : 0; // First operand is intrinsic id.
1180
for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i)
1181
if (OnlyOnRHSOfCommutative(getChild(i))) {
1182
Reason="Immediate value must be on the RHS of commutative operators!";
1191
//===----------------------------------------------------------------------===//
1192
// TreePattern implementation
1195
TreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
1196
CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp){
1197
isInputPattern = isInput;
1198
for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i)
1199
Trees.push_back(ParseTreePattern((DagInit*)RawPat->getElement(i)));
1202
TreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
1203
CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp){
1204
isInputPattern = isInput;
1205
Trees.push_back(ParseTreePattern(Pat));
1208
TreePattern::TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
1209
CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp){
1210
isInputPattern = isInput;
1211
Trees.push_back(Pat);
1216
void TreePattern::error(const std::string &Msg) const {
1218
throw TGError(TheRecord->getLoc(), "In " + TheRecord->getName() + ": " + Msg);
1221
TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) {
1222
DefInit *OpDef = dynamic_cast<DefInit*>(Dag->getOperator());
1223
if (!OpDef) error("Pattern has unexpected operator type!");
1224
Record *Operator = OpDef->getDef();
1226
if (Operator->isSubClassOf("ValueType")) {
1227
// If the operator is a ValueType, then this must be "type cast" of a leaf
1229
if (Dag->getNumArgs() != 1)
1230
error("Type cast only takes one operand!");
1232
Init *Arg = Dag->getArg(0);
1233
TreePatternNode *New;
1234
if (DefInit *DI = dynamic_cast<DefInit*>(Arg)) {
1235
Record *R = DI->getDef();
1236
if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
1237
Dag->setArg(0, new DagInit(DI, "",
1238
std::vector<std::pair<Init*, std::string> >()));
1239
return ParseTreePattern(Dag);
1241
New = new TreePatternNode(DI);
1242
} else if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
1243
New = ParseTreePattern(DI);
1244
} else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
1245
New = new TreePatternNode(II);
1246
if (!Dag->getArgName(0).empty())
1247
error("Constant int argument should not have a name!");
1248
} else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
1249
// Turn this into an IntInit.
1250
Init *II = BI->convertInitializerTo(new IntRecTy());
1251
if (II == 0 || !dynamic_cast<IntInit*>(II))
1252
error("Bits value must be constants!");
1254
New = new TreePatternNode(dynamic_cast<IntInit*>(II));
1255
if (!Dag->getArgName(0).empty())
1256
error("Constant int argument should not have a name!");
1259
error("Unknown leaf value for tree pattern!");
1263
// Apply the type cast.
1264
New->UpdateNodeType(getValueType(Operator), *this);
1265
if (New->getNumChildren() == 0)
1266
New->setName(Dag->getArgName(0));
1270
// Verify that this is something that makes sense for an operator.
1271
if (!Operator->isSubClassOf("PatFrag") &&
1272
!Operator->isSubClassOf("SDNode") &&
1273
!Operator->isSubClassOf("Instruction") &&
1274
!Operator->isSubClassOf("SDNodeXForm") &&
1275
!Operator->isSubClassOf("Intrinsic") &&
1276
Operator->getName() != "set" &&
1277
Operator->getName() != "implicit" &&
1278
Operator->getName() != "parallel")
1279
error("Unrecognized node '" + Operator->getName() + "'!");
1281
// Check to see if this is something that is illegal in an input pattern.
1282
if (isInputPattern && (Operator->isSubClassOf("Instruction") ||
1283
Operator->isSubClassOf("SDNodeXForm")))
1284
error("Cannot use '" + Operator->getName() + "' in an input pattern!");
1286
std::vector<TreePatternNode*> Children;
1288
for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
1289
Init *Arg = Dag->getArg(i);
1290
if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
1291
Children.push_back(ParseTreePattern(DI));
1292
if (Children.back()->getName().empty())
1293
Children.back()->setName(Dag->getArgName(i));
1294
} else if (DefInit *DefI = dynamic_cast<DefInit*>(Arg)) {
1295
Record *R = DefI->getDef();
1296
// Direct reference to a leaf DagNode or PatFrag? Turn it into a
1297
// TreePatternNode if its own.
1298
if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
1299
Dag->setArg(i, new DagInit(DefI, "",
1300
std::vector<std::pair<Init*, std::string> >()));
1301
--i; // Revisit this node...
1303
TreePatternNode *Node = new TreePatternNode(DefI);
1304
Node->setName(Dag->getArgName(i));
1305
Children.push_back(Node);
1308
if (R->getName() == "node") {
1309
if (Dag->getArgName(i).empty())
1310
error("'node' argument requires a name to match with operand list");
1311
Args.push_back(Dag->getArgName(i));
1314
} else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
1315
TreePatternNode *Node = new TreePatternNode(II);
1316
if (!Dag->getArgName(i).empty())
1317
error("Constant int argument should not have a name!");
1318
Children.push_back(Node);
1319
} else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
1320
// Turn this into an IntInit.
1321
Init *II = BI->convertInitializerTo(new IntRecTy());
1322
if (II == 0 || !dynamic_cast<IntInit*>(II))
1323
error("Bits value must be constants!");
1325
TreePatternNode *Node = new TreePatternNode(dynamic_cast<IntInit*>(II));
1326
if (!Dag->getArgName(i).empty())
1327
error("Constant int argument should not have a name!");
1328
Children.push_back(Node);
1333
error("Unknown leaf value for tree pattern!");
1337
// If the operator is an intrinsic, then this is just syntactic sugar for for
1338
// (intrinsic_* <number>, ..children..). Pick the right intrinsic node, and
1339
// convert the intrinsic name to a number.
1340
if (Operator->isSubClassOf("Intrinsic")) {
1341
const CodeGenIntrinsic &Int = getDAGPatterns().getIntrinsic(Operator);
1342
unsigned IID = getDAGPatterns().getIntrinsicID(Operator)+1;
1344
// If this intrinsic returns void, it must have side-effects and thus a
1346
if (Int.IS.RetVTs[0] == MVT::isVoid) {
1347
Operator = getDAGPatterns().get_intrinsic_void_sdnode();
1348
} else if (Int.ModRef != CodeGenIntrinsic::NoMem) {
1349
// Has side-effects, requires chain.
1350
Operator = getDAGPatterns().get_intrinsic_w_chain_sdnode();
1352
// Otherwise, no chain.
1353
Operator = getDAGPatterns().get_intrinsic_wo_chain_sdnode();
1356
TreePatternNode *IIDNode = new TreePatternNode(new IntInit(IID));
1357
Children.insert(Children.begin(), IIDNode);
1360
TreePatternNode *Result = new TreePatternNode(Operator, Children);
1361
Result->setName(Dag->getName());
1365
/// InferAllTypes - Infer/propagate as many types throughout the expression
1366
/// patterns as possible. Return true if all types are inferred, false
1367
/// otherwise. Throw an exception if a type contradiction is found.
1368
bool TreePattern::InferAllTypes() {
1369
bool MadeChange = true;
1370
while (MadeChange) {
1372
for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1373
MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false);
1376
bool HasUnresolvedTypes = false;
1377
for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1378
HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType();
1379
return !HasUnresolvedTypes;
1382
void TreePattern::print(raw_ostream &OS) const {
1383
OS << getRecord()->getName();
1384
if (!Args.empty()) {
1385
OS << "(" << Args[0];
1386
for (unsigned i = 1, e = Args.size(); i != e; ++i)
1387
OS << ", " << Args[i];
1392
if (Trees.size() > 1)
1394
for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
1396
Trees[i]->print(OS);
1400
if (Trees.size() > 1)
1404
void TreePattern::dump() const { print(errs()); }
1406
//===----------------------------------------------------------------------===//
1407
// CodeGenDAGPatterns implementation
1410
CodeGenDAGPatterns::CodeGenDAGPatterns(RecordKeeper &R) : Records(R) {
1411
Intrinsics = LoadIntrinsics(Records, false);
1412
TgtIntrinsics = LoadIntrinsics(Records, true);
1414
ParseNodeTransforms();
1415
ParseComplexPatterns();
1416
ParsePatternFragments();
1417
ParseDefaultOperands();
1418
ParseInstructions();
1421
// Generate variants. For example, commutative patterns can match
1422
// multiple ways. Add them to PatternsToMatch as well.
1425
// Infer instruction flags. For example, we can detect loads,
1426
// stores, and side effects in many cases by examining an
1427
// instruction's pattern.
1428
InferInstructionFlags();
1431
CodeGenDAGPatterns::~CodeGenDAGPatterns() {
1432
for (pf_iterator I = PatternFragments.begin(),
1433
E = PatternFragments.end(); I != E; ++I)
1438
Record *CodeGenDAGPatterns::getSDNodeNamed(const std::string &Name) const {
1439
Record *N = Records.getDef(Name);
1440
if (!N || !N->isSubClassOf("SDNode")) {
1441
errs() << "Error getting SDNode '" << Name << "'!\n";
1447
// Parse all of the SDNode definitions for the target, populating SDNodes.
1448
void CodeGenDAGPatterns::ParseNodeInfo() {
1449
std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode");
1450
while (!Nodes.empty()) {
1451
SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
1455
// Get the builtin intrinsic nodes.
1456
intrinsic_void_sdnode = getSDNodeNamed("intrinsic_void");
1457
intrinsic_w_chain_sdnode = getSDNodeNamed("intrinsic_w_chain");
1458
intrinsic_wo_chain_sdnode = getSDNodeNamed("intrinsic_wo_chain");
1461
/// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
1462
/// map, and emit them to the file as functions.
1463
void CodeGenDAGPatterns::ParseNodeTransforms() {
1464
std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm");
1465
while (!Xforms.empty()) {
1466
Record *XFormNode = Xforms.back();
1467
Record *SDNode = XFormNode->getValueAsDef("Opcode");
1468
std::string Code = XFormNode->getValueAsCode("XFormFunction");
1469
SDNodeXForms.insert(std::make_pair(XFormNode, NodeXForm(SDNode, Code)));
1475
void CodeGenDAGPatterns::ParseComplexPatterns() {
1476
std::vector<Record*> AMs = Records.getAllDerivedDefinitions("ComplexPattern");
1477
while (!AMs.empty()) {
1478
ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));
1484
/// ParsePatternFragments - Parse all of the PatFrag definitions in the .td
1485
/// file, building up the PatternFragments map. After we've collected them all,
1486
/// inline fragments together as necessary, so that there are no references left
1487
/// inside a pattern fragment to a pattern fragment.
1489
void CodeGenDAGPatterns::ParsePatternFragments() {
1490
std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrag");
1492
// First step, parse all of the fragments.
1493
for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
1494
DagInit *Tree = Fragments[i]->getValueAsDag("Fragment");
1495
TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
1496
PatternFragments[Fragments[i]] = P;
1498
// Validate the argument list, converting it to set, to discard duplicates.
1499
std::vector<std::string> &Args = P->getArgList();
1500
std::set<std::string> OperandsSet(Args.begin(), Args.end());
1502
if (OperandsSet.count(""))
1503
P->error("Cannot have unnamed 'node' values in pattern fragment!");
1505
// Parse the operands list.
1506
DagInit *OpsList = Fragments[i]->getValueAsDag("Operands");
1507
DefInit *OpsOp = dynamic_cast<DefInit*>(OpsList->getOperator());
1508
// Special cases: ops == outs == ins. Different names are used to
1509
// improve readability.
1511
(OpsOp->getDef()->getName() != "ops" &&
1512
OpsOp->getDef()->getName() != "outs" &&
1513
OpsOp->getDef()->getName() != "ins"))
1514
P->error("Operands list should start with '(ops ... '!");
1516
// Copy over the arguments.
1518
for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {
1519
if (!dynamic_cast<DefInit*>(OpsList->getArg(j)) ||
1520
static_cast<DefInit*>(OpsList->getArg(j))->
1521
getDef()->getName() != "node")
1522
P->error("Operands list should all be 'node' values.");
1523
if (OpsList->getArgName(j).empty())
1524
P->error("Operands list should have names for each operand!");
1525
if (!OperandsSet.count(OpsList->getArgName(j)))
1526
P->error("'" + OpsList->getArgName(j) +
1527
"' does not occur in pattern or was multiply specified!");
1528
OperandsSet.erase(OpsList->getArgName(j));
1529
Args.push_back(OpsList->getArgName(j));
1532
if (!OperandsSet.empty())
1533
P->error("Operands list does not contain an entry for operand '" +
1534
*OperandsSet.begin() + "'!");
1536
// If there is a code init for this fragment, keep track of the fact that
1537
// this fragment uses it.
1538
std::string Code = Fragments[i]->getValueAsCode("Predicate");
1540
P->getOnlyTree()->addPredicateFn("Predicate_"+Fragments[i]->getName());
1542
// If there is a node transformation corresponding to this, keep track of
1544
Record *Transform = Fragments[i]->getValueAsDef("OperandTransform");
1545
if (!getSDNodeTransform(Transform).second.empty()) // not noop xform?
1546
P->getOnlyTree()->setTransformFn(Transform);
1549
// Now that we've parsed all of the tree fragments, do a closure on them so
1550
// that there are not references to PatFrags left inside of them.
1551
for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
1552
TreePattern *ThePat = PatternFragments[Fragments[i]];
1553
ThePat->InlinePatternFragments();
1555
// Infer as many types as possible. Don't worry about it if we don't infer
1556
// all of them, some may depend on the inputs of the pattern.
1558
ThePat->InferAllTypes();
1560
// If this pattern fragment is not supported by this target (no types can
1561
// satisfy its constraints), just ignore it. If the bogus pattern is
1562
// actually used by instructions, the type consistency error will be
1566
// If debugging, print out the pattern fragment result.
1567
DEBUG(ThePat->dump());
1571
void CodeGenDAGPatterns::ParseDefaultOperands() {
1572
std::vector<Record*> DefaultOps[2];
1573
DefaultOps[0] = Records.getAllDerivedDefinitions("PredicateOperand");
1574
DefaultOps[1] = Records.getAllDerivedDefinitions("OptionalDefOperand");
1576
// Find some SDNode.
1577
assert(!SDNodes.empty() && "No SDNodes parsed?");
1578
Init *SomeSDNode = new DefInit(SDNodes.begin()->first);
1580
for (unsigned iter = 0; iter != 2; ++iter) {
1581
for (unsigned i = 0, e = DefaultOps[iter].size(); i != e; ++i) {
1582
DagInit *DefaultInfo = DefaultOps[iter][i]->getValueAsDag("DefaultOps");
1584
// Clone the DefaultInfo dag node, changing the operator from 'ops' to
1585
// SomeSDnode so that we can parse this.
1586
std::vector<std::pair<Init*, std::string> > Ops;
1587
for (unsigned op = 0, e = DefaultInfo->getNumArgs(); op != e; ++op)
1588
Ops.push_back(std::make_pair(DefaultInfo->getArg(op),
1589
DefaultInfo->getArgName(op)));
1590
DagInit *DI = new DagInit(SomeSDNode, "", Ops);
1592
// Create a TreePattern to parse this.
1593
TreePattern P(DefaultOps[iter][i], DI, false, *this);
1594
assert(P.getNumTrees() == 1 && "This ctor can only produce one tree!");
1596
// Copy the operands over into a DAGDefaultOperand.
1597
DAGDefaultOperand DefaultOpInfo;
1599
TreePatternNode *T = P.getTree(0);
1600
for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {
1601
TreePatternNode *TPN = T->getChild(op);
1602
while (TPN->ApplyTypeConstraints(P, false))
1603
/* Resolve all types */;
1605
if (TPN->ContainsUnresolvedType()) {
1607
throw "Value #" + utostr(i) + " of PredicateOperand '" +
1608
DefaultOps[iter][i]->getName() +"' doesn't have a concrete type!";
1610
throw "Value #" + utostr(i) + " of OptionalDefOperand '" +
1611
DefaultOps[iter][i]->getName() +"' doesn't have a concrete type!";
1613
DefaultOpInfo.DefaultOps.push_back(TPN);
1616
// Insert it into the DefaultOperands map so we can find it later.
1617
DefaultOperands[DefaultOps[iter][i]] = DefaultOpInfo;
1622
/// HandleUse - Given "Pat" a leaf in the pattern, check to see if it is an
1623
/// instruction input. Return true if this is a real use.
1624
static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
1625
std::map<std::string, TreePatternNode*> &InstInputs,
1626
std::vector<Record*> &InstImpInputs) {
1627
// No name -> not interesting.
1628
if (Pat->getName().empty()) {
1629
if (Pat->isLeaf()) {
1630
DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1631
if (DI && DI->getDef()->isSubClassOf("RegisterClass"))
1632
I->error("Input " + DI->getDef()->getName() + " must be named!");
1633
else if (DI && DI->getDef()->isSubClassOf("Register"))
1634
InstImpInputs.push_back(DI->getDef());
1640
if (Pat->isLeaf()) {
1641
DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1642
if (!DI) I->error("Input $" + Pat->getName() + " must be an identifier!");
1645
Rec = Pat->getOperator();
1648
// SRCVALUE nodes are ignored.
1649
if (Rec->getName() == "srcvalue")
1652
TreePatternNode *&Slot = InstInputs[Pat->getName()];
1658
if (Slot->isLeaf()) {
1659
SlotRec = dynamic_cast<DefInit*>(Slot->getLeafValue())->getDef();
1661
assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
1662
SlotRec = Slot->getOperator();
1665
// Ensure that the inputs agree if we've already seen this input.
1667
I->error("All $" + Pat->getName() + " inputs must agree with each other");
1668
if (Slot->getExtTypes() != Pat->getExtTypes())
1669
I->error("All $" + Pat->getName() + " inputs must agree with each other");
1673
/// FindPatternInputsAndOutputs - Scan the specified TreePatternNode (which is
1674
/// part of "I", the instruction), computing the set of inputs and outputs of
1675
/// the pattern. Report errors if we see anything naughty.
1676
void CodeGenDAGPatterns::
1677
FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
1678
std::map<std::string, TreePatternNode*> &InstInputs,
1679
std::map<std::string, TreePatternNode*>&InstResults,
1680
std::vector<Record*> &InstImpInputs,
1681
std::vector<Record*> &InstImpResults) {
1682
if (Pat->isLeaf()) {
1683
bool isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1684
if (!isUse && Pat->getTransformFn())
1685
I->error("Cannot specify a transform function for a non-input value!");
1689
if (Pat->getOperator()->getName() == "implicit") {
1690
for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
1691
TreePatternNode *Dest = Pat->getChild(i);
1692
if (!Dest->isLeaf())
1693
I->error("implicitly defined value should be a register!");
1695
DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
1696
if (!Val || !Val->getDef()->isSubClassOf("Register"))
1697
I->error("implicitly defined value should be a register!");
1698
InstImpResults.push_back(Val->getDef());
1703
if (Pat->getOperator()->getName() != "set") {
1704
// If this is not a set, verify that the children nodes are not void typed,
1706
for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
1707
if (Pat->getChild(i)->getExtTypeNum(0) == MVT::isVoid)
1708
I->error("Cannot have void nodes inside of patterns!");
1709
FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
1710
InstImpInputs, InstImpResults);
1713
// If this is a non-leaf node with no children, treat it basically as if
1714
// it were a leaf. This handles nodes like (imm).
1715
bool isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1717
if (!isUse && Pat->getTransformFn())
1718
I->error("Cannot specify a transform function for a non-input value!");
1722
// Otherwise, this is a set, validate and collect instruction results.
1723
if (Pat->getNumChildren() == 0)
1724
I->error("set requires operands!");
1726
if (Pat->getTransformFn())
1727
I->error("Cannot specify a transform function on a set node!");
1729
// Check the set destinations.
1730
unsigned NumDests = Pat->getNumChildren()-1;
1731
for (unsigned i = 0; i != NumDests; ++i) {
1732
TreePatternNode *Dest = Pat->getChild(i);
1733
if (!Dest->isLeaf())
1734
I->error("set destination should be a register!");
1736
DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
1738
I->error("set destination should be a register!");
1740
if (Val->getDef()->isSubClassOf("RegisterClass") ||
1741
Val->getDef()->isSubClassOf("PointerLikeRegClass")) {
1742
if (Dest->getName().empty())
1743
I->error("set destination must have a name!");
1744
if (InstResults.count(Dest->getName()))
1745
I->error("cannot set '" + Dest->getName() +"' multiple times");
1746
InstResults[Dest->getName()] = Dest;
1747
} else if (Val->getDef()->isSubClassOf("Register")) {
1748
InstImpResults.push_back(Val->getDef());
1750
I->error("set destination should be a register!");
1754
// Verify and collect info from the computation.
1755
FindPatternInputsAndOutputs(I, Pat->getChild(NumDests),
1756
InstInputs, InstResults,
1757
InstImpInputs, InstImpResults);
1760
//===----------------------------------------------------------------------===//
1761
// Instruction Analysis
1762
//===----------------------------------------------------------------------===//
1764
class InstAnalyzer {
1765
const CodeGenDAGPatterns &CDP;
1768
bool &HasSideEffects;
1770
InstAnalyzer(const CodeGenDAGPatterns &cdp,
1771
bool &maystore, bool &mayload, bool &hse)
1772
: CDP(cdp), mayStore(maystore), mayLoad(mayload), HasSideEffects(hse){
1775
/// Analyze - Analyze the specified instruction, returning true if the
1776
/// instruction had a pattern.
1777
bool Analyze(Record *InstRecord) {
1778
const TreePattern *Pattern = CDP.getInstruction(InstRecord).getPattern();
1781
return false; // No pattern.
1784
// FIXME: Assume only the first tree is the pattern. The others are clobber
1786
AnalyzeNode(Pattern->getTree(0));
1791
void AnalyzeNode(const TreePatternNode *N) {
1793
if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
1794
Record *LeafRec = DI->getDef();
1795
// Handle ComplexPattern leaves.
1796
if (LeafRec->isSubClassOf("ComplexPattern")) {
1797
const ComplexPattern &CP = CDP.getComplexPattern(LeafRec);
1798
if (CP.hasProperty(SDNPMayStore)) mayStore = true;
1799
if (CP.hasProperty(SDNPMayLoad)) mayLoad = true;
1800
if (CP.hasProperty(SDNPSideEffect)) HasSideEffects = true;
1806
// Analyze children.
1807
for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1808
AnalyzeNode(N->getChild(i));
1810
// Ignore set nodes, which are not SDNodes.
1811
if (N->getOperator()->getName() == "set")
1814
// Get information about the SDNode for the operator.
1815
const SDNodeInfo &OpInfo = CDP.getSDNodeInfo(N->getOperator());
1817
// Notice properties of the node.
1818
if (OpInfo.hasProperty(SDNPMayStore)) mayStore = true;
1819
if (OpInfo.hasProperty(SDNPMayLoad)) mayLoad = true;
1820
if (OpInfo.hasProperty(SDNPSideEffect)) HasSideEffects = true;
1822
if (const CodeGenIntrinsic *IntInfo = N->getIntrinsicInfo(CDP)) {
1823
// If this is an intrinsic, analyze it.
1824
if (IntInfo->ModRef >= CodeGenIntrinsic::ReadArgMem)
1825
mayLoad = true;// These may load memory.
1827
if (IntInfo->ModRef >= CodeGenIntrinsic::WriteArgMem)
1828
mayStore = true;// Intrinsics that can write to memory are 'mayStore'.
1830
if (IntInfo->ModRef >= CodeGenIntrinsic::WriteMem)
1831
// WriteMem intrinsics can have other strange effects.
1832
HasSideEffects = true;
1838
static void InferFromPattern(const CodeGenInstruction &Inst,
1839
bool &MayStore, bool &MayLoad,
1840
bool &HasSideEffects,
1841
const CodeGenDAGPatterns &CDP) {
1842
MayStore = MayLoad = HasSideEffects = false;
1845
InstAnalyzer(CDP, MayStore, MayLoad, HasSideEffects).Analyze(Inst.TheDef);
1847
// InstAnalyzer only correctly analyzes mayStore/mayLoad so far.
1848
if (Inst.mayStore) { // If the .td file explicitly sets mayStore, use it.
1849
// If we decided that this is a store from the pattern, then the .td file
1850
// entry is redundant.
1853
"Warning: mayStore flag explicitly set on instruction '%s'"
1854
" but flag already inferred from pattern.\n",
1855
Inst.TheDef->getName().c_str());
1859
if (Inst.mayLoad) { // If the .td file explicitly sets mayLoad, use it.
1860
// If we decided that this is a load from the pattern, then the .td file
1861
// entry is redundant.
1864
"Warning: mayLoad flag explicitly set on instruction '%s'"
1865
" but flag already inferred from pattern.\n",
1866
Inst.TheDef->getName().c_str());
1870
if (Inst.neverHasSideEffects) {
1872
fprintf(stderr, "Warning: neverHasSideEffects set on instruction '%s' "
1873
"which already has a pattern\n", Inst.TheDef->getName().c_str());
1874
HasSideEffects = false;
1877
if (Inst.hasSideEffects) {
1879
fprintf(stderr, "Warning: hasSideEffects set on instruction '%s' "
1880
"which already inferred this.\n", Inst.TheDef->getName().c_str());
1881
HasSideEffects = true;
1885
/// ParseInstructions - Parse all of the instructions, inlining and resolving
1886
/// any fragments involved. This populates the Instructions list with fully
1887
/// resolved instructions.
1888
void CodeGenDAGPatterns::ParseInstructions() {
1889
std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction");
1891
for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
1894
if (dynamic_cast<ListInit*>(Instrs[i]->getValueInit("Pattern")))
1895
LI = Instrs[i]->getValueAsListInit("Pattern");
1897
// If there is no pattern, only collect minimal information about the
1898
// instruction for its operand list. We have to assume that there is one
1899
// result, as we have no detailed info.
1900
if (!LI || LI->getSize() == 0) {
1901
std::vector<Record*> Results;
1902
std::vector<Record*> Operands;
1904
CodeGenInstruction &InstInfo =Target.getInstruction(Instrs[i]->getName());
1906
if (InstInfo.OperandList.size() != 0) {
1907
if (InstInfo.NumDefs == 0) {
1908
// These produce no results
1909
for (unsigned j = 0, e = InstInfo.OperandList.size(); j < e; ++j)
1910
Operands.push_back(InstInfo.OperandList[j].Rec);
1912
// Assume the first operand is the result.
1913
Results.push_back(InstInfo.OperandList[0].Rec);
1915
// The rest are inputs.
1916
for (unsigned j = 1, e = InstInfo.OperandList.size(); j < e; ++j)
1917
Operands.push_back(InstInfo.OperandList[j].Rec);
1921
// Create and insert the instruction.
1922
std::vector<Record*> ImpResults;
1923
std::vector<Record*> ImpOperands;
1924
Instructions.insert(std::make_pair(Instrs[i],
1925
DAGInstruction(0, Results, Operands, ImpResults,
1927
continue; // no pattern.
1930
// Parse the instruction.
1931
TreePattern *I = new TreePattern(Instrs[i], LI, true, *this);
1932
// Inline pattern fragments into it.
1933
I->InlinePatternFragments();
1935
// Infer as many types as possible. If we cannot infer all of them, we can
1936
// never do anything with this instruction pattern: report it to the user.
1937
if (!I->InferAllTypes())
1938
I->error("Could not infer all types in pattern!");
1940
// InstInputs - Keep track of all of the inputs of the instruction, along
1941
// with the record they are declared as.
1942
std::map<std::string, TreePatternNode*> InstInputs;
1944
// InstResults - Keep track of all the virtual registers that are 'set'
1945
// in the instruction, including what reg class they are.
1946
std::map<std::string, TreePatternNode*> InstResults;
1948
std::vector<Record*> InstImpInputs;
1949
std::vector<Record*> InstImpResults;
1951
// Verify that the top-level forms in the instruction are of void type, and
1952
// fill in the InstResults map.
1953
for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {
1954
TreePatternNode *Pat = I->getTree(j);
1955
if (Pat->getExtTypeNum(0) != MVT::isVoid)
1956
I->error("Top-level forms in instruction pattern should have"
1959
// Find inputs and outputs, and verify the structure of the uses/defs.
1960
FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults,
1961
InstImpInputs, InstImpResults);
1964
// Now that we have inputs and outputs of the pattern, inspect the operands
1965
// list for the instruction. This determines the order that operands are
1966
// added to the machine instruction the node corresponds to.
1967
unsigned NumResults = InstResults.size();
1969
// Parse the operands list from the (ops) list, validating it.
1970
assert(I->getArgList().empty() && "Args list should still be empty here!");
1971
CodeGenInstruction &CGI = Target.getInstruction(Instrs[i]->getName());
1973
// Check that all of the results occur first in the list.
1974
std::vector<Record*> Results;
1975
TreePatternNode *Res0Node = NULL;
1976
for (unsigned i = 0; i != NumResults; ++i) {
1977
if (i == CGI.OperandList.size())
1978
I->error("'" + InstResults.begin()->first +
1979
"' set but does not appear in operand list!");
1980
const std::string &OpName = CGI.OperandList[i].Name;
1982
// Check that it exists in InstResults.
1983
TreePatternNode *RNode = InstResults[OpName];
1985
I->error("Operand $" + OpName + " does not exist in operand list!");
1989
Record *R = dynamic_cast<DefInit*>(RNode->getLeafValue())->getDef();
1991
I->error("Operand $" + OpName + " should be a set destination: all "
1992
"outputs must occur before inputs in operand list!");
1994
if (CGI.OperandList[i].Rec != R)
1995
I->error("Operand $" + OpName + " class mismatch!");
1997
// Remember the return type.
1998
Results.push_back(CGI.OperandList[i].Rec);
2000
// Okay, this one checks out.
2001
InstResults.erase(OpName);
2004
// Loop over the inputs next. Make a copy of InstInputs so we can destroy
2005
// the copy while we're checking the inputs.
2006
std::map<std::string, TreePatternNode*> InstInputsCheck(InstInputs);
2008
std::vector<TreePatternNode*> ResultNodeOperands;
2009
std::vector<Record*> Operands;
2010
for (unsigned i = NumResults, e = CGI.OperandList.size(); i != e; ++i) {
2011
CodeGenInstruction::OperandInfo &Op = CGI.OperandList[i];
2012
const std::string &OpName = Op.Name;
2014
I->error("Operand #" + utostr(i) + " in operands list has no name!");
2016
if (!InstInputsCheck.count(OpName)) {
2017
// If this is an predicate operand or optional def operand with an
2018
// DefaultOps set filled in, we can ignore this. When we codegen it,
2019
// we will do so as always executed.
2020
if (Op.Rec->isSubClassOf("PredicateOperand") ||
2021
Op.Rec->isSubClassOf("OptionalDefOperand")) {
2022
// Does it have a non-empty DefaultOps field? If so, ignore this
2024
if (!getDefaultOperand(Op.Rec).DefaultOps.empty())
2027
I->error("Operand $" + OpName +
2028
" does not appear in the instruction pattern");
2030
TreePatternNode *InVal = InstInputsCheck[OpName];
2031
InstInputsCheck.erase(OpName); // It occurred, remove from map.
2033
if (InVal->isLeaf() &&
2034
dynamic_cast<DefInit*>(InVal->getLeafValue())) {
2035
Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef();
2036
if (Op.Rec != InRec && !InRec->isSubClassOf("ComplexPattern"))
2037
I->error("Operand $" + OpName + "'s register class disagrees"
2038
" between the operand and pattern");
2040
Operands.push_back(Op.Rec);
2042
// Construct the result for the dest-pattern operand list.
2043
TreePatternNode *OpNode = InVal->clone();
2045
// No predicate is useful on the result.
2046
OpNode->clearPredicateFns();
2048
// Promote the xform function to be an explicit node if set.
2049
if (Record *Xform = OpNode->getTransformFn()) {
2050
OpNode->setTransformFn(0);
2051
std::vector<TreePatternNode*> Children;
2052
Children.push_back(OpNode);
2053
OpNode = new TreePatternNode(Xform, Children);
2056
ResultNodeOperands.push_back(OpNode);
2059
if (!InstInputsCheck.empty())
2060
I->error("Input operand $" + InstInputsCheck.begin()->first +
2061
" occurs in pattern but not in operands list!");
2063
TreePatternNode *ResultPattern =
2064
new TreePatternNode(I->getRecord(), ResultNodeOperands);
2065
// Copy fully inferred output node type to instruction result pattern.
2067
ResultPattern->setTypes(Res0Node->getExtTypes());
2069
// Create and insert the instruction.
2070
// FIXME: InstImpResults and InstImpInputs should not be part of
2072
DAGInstruction TheInst(I, Results, Operands, InstImpResults, InstImpInputs);
2073
Instructions.insert(std::make_pair(I->getRecord(), TheInst));
2075
// Use a temporary tree pattern to infer all types and make sure that the
2076
// constructed result is correct. This depends on the instruction already
2077
// being inserted into the Instructions map.
2078
TreePattern Temp(I->getRecord(), ResultPattern, false, *this);
2079
Temp.InferAllTypes();
2081
DAGInstruction &TheInsertedInst = Instructions.find(I->getRecord())->second;
2082
TheInsertedInst.setResultPattern(Temp.getOnlyTree());
2087
// If we can, convert the instructions to be patterns that are matched!
2088
for (std::map<Record*, DAGInstruction, RecordPtrCmp>::iterator II =
2089
Instructions.begin(),
2090
E = Instructions.end(); II != E; ++II) {
2091
DAGInstruction &TheInst = II->second;
2092
const TreePattern *I = TheInst.getPattern();
2093
if (I == 0) continue; // No pattern.
2095
// FIXME: Assume only the first tree is the pattern. The others are clobber
2097
TreePatternNode *Pattern = I->getTree(0);
2098
TreePatternNode *SrcPattern;
2099
if (Pattern->getOperator()->getName() == "set") {
2100
SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();
2102
// Not a set (store or something?)
2103
SrcPattern = Pattern;
2106
Record *Instr = II->first;
2107
AddPatternToMatch(I,
2108
PatternToMatch(Instr->getValueAsListInit("Predicates"),
2110
TheInst.getResultPattern(),
2111
TheInst.getImpResults(),
2112
Instr->getValueAsInt("AddedComplexity"),
2118
typedef std::pair<const TreePatternNode*, unsigned> NameRecord;
2120
static void FindNames(const TreePatternNode *P,
2121
std::map<std::string, NameRecord> &Names,
2122
const TreePattern *PatternTop) {
2123
if (!P->getName().empty()) {
2124
NameRecord &Rec = Names[P->getName()];
2125
// If this is the first instance of the name, remember the node.
2126
if (Rec.second++ == 0)
2128
else if (Rec.first->getExtTypes() != P->getExtTypes())
2129
PatternTop->error("repetition of value: $" + P->getName() +
2130
" where different uses have different types!");
2134
for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
2135
FindNames(P->getChild(i), Names, PatternTop);
2139
void CodeGenDAGPatterns::AddPatternToMatch(const TreePattern *Pattern,
2140
const PatternToMatch &PTM) {
2141
// Do some sanity checking on the pattern we're about to match.
2143
if (!PTM.getSrcPattern()->canPatternMatch(Reason, *this))
2144
Pattern->error("Pattern can never match: " + Reason);
2146
// If the source pattern's root is a complex pattern, that complex pattern
2147
// must specify the nodes it can potentially match.
2148
if (const ComplexPattern *CP =
2149
PTM.getSrcPattern()->getComplexPatternInfo(*this))
2150
if (CP->getRootNodes().empty())
2151
Pattern->error("ComplexPattern at root must specify list of opcodes it"
2155
// Find all of the named values in the input and output, ensure they have the
2157
std::map<std::string, NameRecord> SrcNames, DstNames;
2158
FindNames(PTM.getSrcPattern(), SrcNames, Pattern);
2159
FindNames(PTM.getDstPattern(), DstNames, Pattern);
2161
// Scan all of the named values in the destination pattern, rejecting them if
2162
// they don't exist in the input pattern.
2163
for (std::map<std::string, NameRecord>::iterator
2164
I = DstNames.begin(), E = DstNames.end(); I != E; ++I) {
2165
if (SrcNames[I->first].first == 0)
2166
Pattern->error("Pattern has input without matching name in output: $" +
2170
const std::vector<unsigned char> &SrcTypeVec =
2171
SrcNames[I->first].first->getExtTypes();
2172
const std::vector<unsigned char> &DstTypeVec =
2173
I->second.first->getExtTypes();
2174
if (SrcTypeVec == DstTypeVec) continue;
2176
std::string SrcType, DstType;
2177
for (unsigned i = 0, e = SrcTypeVec.size(); i != e; ++i)
2178
SrcType += ":" + GetTypeName(SrcTypeVec[i]);
2179
for (unsigned i = 0, e = DstTypeVec.size(); i != e; ++i)
2180
DstType += ":" + GetTypeName(DstTypeVec[i]);
2182
Pattern->error("Variable $" + I->first +
2183
" has different types in source (" + SrcType +
2184
") and dest (" + DstType + ") pattern!");
2188
// Scan all of the named values in the source pattern, rejecting them if the
2189
// name isn't used in the dest, and isn't used to tie two values together.
2190
for (std::map<std::string, NameRecord>::iterator
2191
I = SrcNames.begin(), E = SrcNames.end(); I != E; ++I)
2192
if (DstNames[I->first].first == 0 && SrcNames[I->first].second == 1)
2193
Pattern->error("Pattern has dead named input: $" + I->first);
2195
PatternsToMatch.push_back(PTM);
2200
void CodeGenDAGPatterns::InferInstructionFlags() {
2201
std::map<std::string, CodeGenInstruction> &InstrDescs =
2202
Target.getInstructions();
2203
for (std::map<std::string, CodeGenInstruction>::iterator
2204
II = InstrDescs.begin(), E = InstrDescs.end(); II != E; ++II) {
2205
CodeGenInstruction &InstInfo = II->second;
2206
// Determine properties of the instruction from its pattern.
2207
bool MayStore, MayLoad, HasSideEffects;
2208
InferFromPattern(InstInfo, MayStore, MayLoad, HasSideEffects, *this);
2209
InstInfo.mayStore = MayStore;
2210
InstInfo.mayLoad = MayLoad;
2211
InstInfo.hasSideEffects = HasSideEffects;
2215
void CodeGenDAGPatterns::ParsePatterns() {
2216
std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern");
2218
for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
2219
DagInit *Tree = Patterns[i]->getValueAsDag("PatternToMatch");
2220
DefInit *OpDef = dynamic_cast<DefInit*>(Tree->getOperator());
2221
Record *Operator = OpDef->getDef();
2222
TreePattern *Pattern;
2223
if (Operator->getName() != "parallel")
2224
Pattern = new TreePattern(Patterns[i], Tree, true, *this);
2226
std::vector<Init*> Values;
2228
for (unsigned j = 0, ee = Tree->getNumArgs(); j != ee; ++j) {
2229
Values.push_back(Tree->getArg(j));
2230
TypedInit *TArg = dynamic_cast<TypedInit*>(Tree->getArg(j));
2232
errs() << "In dag: " << Tree->getAsString();
2233
errs() << " -- Untyped argument in pattern\n";
2234
assert(0 && "Untyped argument in pattern");
2237
ListTy = resolveTypes(ListTy, TArg->getType());
2239
errs() << "In dag: " << Tree->getAsString();
2240
errs() << " -- Incompatible types in pattern arguments\n";
2241
assert(0 && "Incompatible types in pattern arguments");
2245
ListTy = TArg->getType();
2248
ListInit *LI = new ListInit(Values, new ListRecTy(ListTy));
2249
Pattern = new TreePattern(Patterns[i], LI, true, *this);
2252
// Inline pattern fragments into it.
2253
Pattern->InlinePatternFragments();
2255
ListInit *LI = Patterns[i]->getValueAsListInit("ResultInstrs");
2256
if (LI->getSize() == 0) continue; // no pattern.
2258
// Parse the instruction.
2259
TreePattern *Result = new TreePattern(Patterns[i], LI, false, *this);
2261
// Inline pattern fragments into it.
2262
Result->InlinePatternFragments();
2264
if (Result->getNumTrees() != 1)
2265
Result->error("Cannot handle instructions producing instructions "
2266
"with temporaries yet!");
2268
bool IterateInference;
2269
bool InferredAllPatternTypes, InferredAllResultTypes;
2271
// Infer as many types as possible. If we cannot infer all of them, we
2272
// can never do anything with this pattern: report it to the user.
2273
InferredAllPatternTypes = Pattern->InferAllTypes();
2275
// Infer as many types as possible. If we cannot infer all of them, we
2276
// can never do anything with this pattern: report it to the user.
2277
InferredAllResultTypes = Result->InferAllTypes();
2279
// Apply the type of the result to the source pattern. This helps us
2280
// resolve cases where the input type is known to be a pointer type (which
2281
// is considered resolved), but the result knows it needs to be 32- or
2282
// 64-bits. Infer the other way for good measure.
2283
IterateInference = Pattern->getTree(0)->
2284
UpdateNodeType(Result->getTree(0)->getExtTypes(), *Result);
2285
IterateInference |= Result->getTree(0)->
2286
UpdateNodeType(Pattern->getTree(0)->getExtTypes(), *Result);
2287
} while (IterateInference);
2289
// Verify that we inferred enough types that we can do something with the
2290
// pattern and result. If these fire the user has to add type casts.
2291
if (!InferredAllPatternTypes)
2292
Pattern->error("Could not infer all types in pattern!");
2293
if (!InferredAllResultTypes)
2294
Result->error("Could not infer all types in pattern result!");
2296
// Validate that the input pattern is correct.
2297
std::map<std::string, TreePatternNode*> InstInputs;
2298
std::map<std::string, TreePatternNode*> InstResults;
2299
std::vector<Record*> InstImpInputs;
2300
std::vector<Record*> InstImpResults;
2301
for (unsigned j = 0, ee = Pattern->getNumTrees(); j != ee; ++j)
2302
FindPatternInputsAndOutputs(Pattern, Pattern->getTree(j),
2303
InstInputs, InstResults,
2304
InstImpInputs, InstImpResults);
2306
// Promote the xform function to be an explicit node if set.
2307
TreePatternNode *DstPattern = Result->getOnlyTree();
2308
std::vector<TreePatternNode*> ResultNodeOperands;
2309
for (unsigned ii = 0, ee = DstPattern->getNumChildren(); ii != ee; ++ii) {
2310
TreePatternNode *OpNode = DstPattern->getChild(ii);
2311
if (Record *Xform = OpNode->getTransformFn()) {
2312
OpNode->setTransformFn(0);
2313
std::vector<TreePatternNode*> Children;
2314
Children.push_back(OpNode);
2315
OpNode = new TreePatternNode(Xform, Children);
2317
ResultNodeOperands.push_back(OpNode);
2319
DstPattern = Result->getOnlyTree();
2320
if (!DstPattern->isLeaf())
2321
DstPattern = new TreePatternNode(DstPattern->getOperator(),
2322
ResultNodeOperands);
2323
DstPattern->setTypes(Result->getOnlyTree()->getExtTypes());
2324
TreePattern Temp(Result->getRecord(), DstPattern, false, *this);
2325
Temp.InferAllTypes();
2328
AddPatternToMatch(Pattern,
2329
PatternToMatch(Patterns[i]->getValueAsListInit("Predicates"),
2330
Pattern->getTree(0),
2331
Temp.getOnlyTree(), InstImpResults,
2332
Patterns[i]->getValueAsInt("AddedComplexity"),
2333
Patterns[i]->getID()));
2337
/// CombineChildVariants - Given a bunch of permutations of each child of the
2338
/// 'operator' node, put them together in all possible ways.
2339
static void CombineChildVariants(TreePatternNode *Orig,
2340
const std::vector<std::vector<TreePatternNode*> > &ChildVariants,
2341
std::vector<TreePatternNode*> &OutVariants,
2342
CodeGenDAGPatterns &CDP,
2343
const MultipleUseVarSet &DepVars) {
2344
// Make sure that each operand has at least one variant to choose from.
2345
for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
2346
if (ChildVariants[i].empty())
2349
// The end result is an all-pairs construction of the resultant pattern.
2350
std::vector<unsigned> Idxs;
2351
Idxs.resize(ChildVariants.size());
2355
DEBUG(if (!Idxs.empty()) {
2356
errs() << Orig->getOperator()->getName() << ": Idxs = [ ";
2357
for (unsigned i = 0; i < Idxs.size(); ++i) {
2358
errs() << Idxs[i] << " ";
2363
// Create the variant and add it to the output list.
2364
std::vector<TreePatternNode*> NewChildren;
2365
for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
2366
NewChildren.push_back(ChildVariants[i][Idxs[i]]);
2367
TreePatternNode *R = new TreePatternNode(Orig->getOperator(), NewChildren);
2369
// Copy over properties.
2370
R->setName(Orig->getName());
2371
R->setPredicateFns(Orig->getPredicateFns());
2372
R->setTransformFn(Orig->getTransformFn());
2373
R->setTypes(Orig->getExtTypes());
2375
// If this pattern cannot match, do not include it as a variant.
2376
std::string ErrString;
2377
if (!R->canPatternMatch(ErrString, CDP)) {
2380
bool AlreadyExists = false;
2382
// Scan to see if this pattern has already been emitted. We can get
2383
// duplication due to things like commuting:
2384
// (and GPRC:$a, GPRC:$b) -> (and GPRC:$b, GPRC:$a)
2385
// which are the same pattern. Ignore the dups.
2386
for (unsigned i = 0, e = OutVariants.size(); i != e; ++i)
2387
if (R->isIsomorphicTo(OutVariants[i], DepVars)) {
2388
AlreadyExists = true;
2395
OutVariants.push_back(R);
2398
// Increment indices to the next permutation by incrementing the
2399
// indicies from last index backward, e.g., generate the sequence
2400
// [0, 0], [0, 1], [1, 0], [1, 1].
2402
for (IdxsIdx = Idxs.size() - 1; IdxsIdx >= 0; --IdxsIdx) {
2403
if (++Idxs[IdxsIdx] == ChildVariants[IdxsIdx].size())
2408
NotDone = (IdxsIdx >= 0);
2412
/// CombineChildVariants - A helper function for binary operators.
2414
static void CombineChildVariants(TreePatternNode *Orig,
2415
const std::vector<TreePatternNode*> &LHS,
2416
const std::vector<TreePatternNode*> &RHS,
2417
std::vector<TreePatternNode*> &OutVariants,
2418
CodeGenDAGPatterns &CDP,
2419
const MultipleUseVarSet &DepVars) {
2420
std::vector<std::vector<TreePatternNode*> > ChildVariants;
2421
ChildVariants.push_back(LHS);
2422
ChildVariants.push_back(RHS);
2423
CombineChildVariants(Orig, ChildVariants, OutVariants, CDP, DepVars);
2427
static void GatherChildrenOfAssociativeOpcode(TreePatternNode *N,
2428
std::vector<TreePatternNode *> &Children) {
2429
assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
2430
Record *Operator = N->getOperator();
2432
// Only permit raw nodes.
2433
if (!N->getName().empty() || !N->getPredicateFns().empty() ||
2434
N->getTransformFn()) {
2435
Children.push_back(N);
2439
if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
2440
Children.push_back(N->getChild(0));
2442
GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
2444
if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
2445
Children.push_back(N->getChild(1));
2447
GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
2450
/// GenerateVariantsOf - Given a pattern N, generate all permutations we can of
2451
/// the (potentially recursive) pattern by using algebraic laws.
2453
static void GenerateVariantsOf(TreePatternNode *N,
2454
std::vector<TreePatternNode*> &OutVariants,
2455
CodeGenDAGPatterns &CDP,
2456
const MultipleUseVarSet &DepVars) {
2457
// We cannot permute leaves.
2459
OutVariants.push_back(N);
2463
// Look up interesting info about the node.
2464
const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(N->getOperator());
2466
// If this node is associative, re-associate.
2467
if (NodeInfo.hasProperty(SDNPAssociative)) {
2468
// Re-associate by pulling together all of the linked operators
2469
std::vector<TreePatternNode*> MaximalChildren;
2470
GatherChildrenOfAssociativeOpcode(N, MaximalChildren);
2472
// Only handle child sizes of 3. Otherwise we'll end up trying too many
2474
if (MaximalChildren.size() == 3) {
2475
// Find the variants of all of our maximal children.
2476
std::vector<TreePatternNode*> AVariants, BVariants, CVariants;
2477
GenerateVariantsOf(MaximalChildren[0], AVariants, CDP, DepVars);
2478
GenerateVariantsOf(MaximalChildren[1], BVariants, CDP, DepVars);
2479
GenerateVariantsOf(MaximalChildren[2], CVariants, CDP, DepVars);
2481
// There are only two ways we can permute the tree:
2482
// (A op B) op C and A op (B op C)
2483
// Within these forms, we can also permute A/B/C.
2485
// Generate legal pair permutations of A/B/C.
2486
std::vector<TreePatternNode*> ABVariants;
2487
std::vector<TreePatternNode*> BAVariants;
2488
std::vector<TreePatternNode*> ACVariants;
2489
std::vector<TreePatternNode*> CAVariants;
2490
std::vector<TreePatternNode*> BCVariants;
2491
std::vector<TreePatternNode*> CBVariants;
2492
CombineChildVariants(N, AVariants, BVariants, ABVariants, CDP, DepVars);
2493
CombineChildVariants(N, BVariants, AVariants, BAVariants, CDP, DepVars);
2494
CombineChildVariants(N, AVariants, CVariants, ACVariants, CDP, DepVars);
2495
CombineChildVariants(N, CVariants, AVariants, CAVariants, CDP, DepVars);
2496
CombineChildVariants(N, BVariants, CVariants, BCVariants, CDP, DepVars);
2497
CombineChildVariants(N, CVariants, BVariants, CBVariants, CDP, DepVars);
2499
// Combine those into the result: (x op x) op x
2500
CombineChildVariants(N, ABVariants, CVariants, OutVariants, CDP, DepVars);
2501
CombineChildVariants(N, BAVariants, CVariants, OutVariants, CDP, DepVars);
2502
CombineChildVariants(N, ACVariants, BVariants, OutVariants, CDP, DepVars);
2503
CombineChildVariants(N, CAVariants, BVariants, OutVariants, CDP, DepVars);
2504
CombineChildVariants(N, BCVariants, AVariants, OutVariants, CDP, DepVars);
2505
CombineChildVariants(N, CBVariants, AVariants, OutVariants, CDP, DepVars);
2507
// Combine those into the result: x op (x op x)
2508
CombineChildVariants(N, CVariants, ABVariants, OutVariants, CDP, DepVars);
2509
CombineChildVariants(N, CVariants, BAVariants, OutVariants, CDP, DepVars);
2510
CombineChildVariants(N, BVariants, ACVariants, OutVariants, CDP, DepVars);
2511
CombineChildVariants(N, BVariants, CAVariants, OutVariants, CDP, DepVars);
2512
CombineChildVariants(N, AVariants, BCVariants, OutVariants, CDP, DepVars);
2513
CombineChildVariants(N, AVariants, CBVariants, OutVariants, CDP, DepVars);
2518
// Compute permutations of all children.
2519
std::vector<std::vector<TreePatternNode*> > ChildVariants;
2520
ChildVariants.resize(N->getNumChildren());
2521
for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
2522
GenerateVariantsOf(N->getChild(i), ChildVariants[i], CDP, DepVars);
2524
// Build all permutations based on how the children were formed.
2525
CombineChildVariants(N, ChildVariants, OutVariants, CDP, DepVars);
2527
// If this node is commutative, consider the commuted order.
2528
bool isCommIntrinsic = N->isCommutativeIntrinsic(CDP);
2529
if (NodeInfo.hasProperty(SDNPCommutative) || isCommIntrinsic) {
2530
assert((N->getNumChildren()==2 || isCommIntrinsic) &&
2531
"Commutative but doesn't have 2 children!");
2532
// Don't count children which are actually register references.
2534
for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
2535
TreePatternNode *Child = N->getChild(i);
2536
if (Child->isLeaf())
2537
if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
2538
Record *RR = DI->getDef();
2539
if (RR->isSubClassOf("Register"))
2544
// Consider the commuted order.
2545
if (isCommIntrinsic) {
2546
// Commutative intrinsic. First operand is the intrinsic id, 2nd and 3rd
2547
// operands are the commutative operands, and there might be more operands
2550
"Commutative intrinsic should have at least 3 childrean!");
2551
std::vector<std::vector<TreePatternNode*> > Variants;
2552
Variants.push_back(ChildVariants[0]); // Intrinsic id.
2553
Variants.push_back(ChildVariants[2]);
2554
Variants.push_back(ChildVariants[1]);
2555
for (unsigned i = 3; i != NC; ++i)
2556
Variants.push_back(ChildVariants[i]);
2557
CombineChildVariants(N, Variants, OutVariants, CDP, DepVars);
2559
CombineChildVariants(N, ChildVariants[1], ChildVariants[0],
2560
OutVariants, CDP, DepVars);
2565
// GenerateVariants - Generate variants. For example, commutative patterns can
2566
// match multiple ways. Add them to PatternsToMatch as well.
2567
void CodeGenDAGPatterns::GenerateVariants() {
2568
DEBUG(errs() << "Generating instruction variants.\n");
2570
// Loop over all of the patterns we've collected, checking to see if we can
2571
// generate variants of the instruction, through the exploitation of
2572
// identities. This permits the target to provide aggressive matching without
2573
// the .td file having to contain tons of variants of instructions.
2575
// Note that this loop adds new patterns to the PatternsToMatch list, but we
2576
// intentionally do not reconsider these. Any variants of added patterns have
2577
// already been added.
2579
for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
2580
MultipleUseVarSet DepVars;
2581
std::vector<TreePatternNode*> Variants;
2582
FindDepVars(PatternsToMatch[i].getSrcPattern(), DepVars);
2583
DEBUG(errs() << "Dependent/multiply used variables: ");
2584
DEBUG(DumpDepVars(DepVars));
2585
DEBUG(errs() << "\n");
2586
GenerateVariantsOf(PatternsToMatch[i].getSrcPattern(), Variants, *this, DepVars);
2588
assert(!Variants.empty() && "Must create at least original variant!");
2589
Variants.erase(Variants.begin()); // Remove the original pattern.
2591
if (Variants.empty()) // No variants for this pattern.
2594
DEBUG(errs() << "FOUND VARIANTS OF: ";
2595
PatternsToMatch[i].getSrcPattern()->dump();
2598
for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
2599
TreePatternNode *Variant = Variants[v];
2601
DEBUG(errs() << " VAR#" << v << ": ";
2605
// Scan to see if an instruction or explicit pattern already matches this.
2606
bool AlreadyExists = false;
2607
for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {
2608
// Skip if the top level predicates do not match.
2609
if (PatternsToMatch[i].getPredicates() !=
2610
PatternsToMatch[p].getPredicates())
2612
// Check to see if this variant already exists.
2613
if (Variant->isIsomorphicTo(PatternsToMatch[p].getSrcPattern(), DepVars)) {
2614
DEBUG(errs() << " *** ALREADY EXISTS, ignoring variant.\n");
2615
AlreadyExists = true;
2619
// If we already have it, ignore the variant.
2620
if (AlreadyExists) continue;
2622
// Otherwise, add it to the list of patterns we have.
2624
push_back(PatternToMatch(PatternsToMatch[i].getPredicates(),
2625
Variant, PatternsToMatch[i].getDstPattern(),
2626
PatternsToMatch[i].getDstRegs(),
2627
PatternsToMatch[i].getAddedComplexity(),
2628
Record::getNewUID()));
2631
DEBUG(errs() << "\n");
added
removed
libclamav/c++/llvm/utils/TableGen/CodeGenDAGPatterns.cpp
