1
//===- DAGISelMatcher.cpp - Representation of DAG pattern matcher ---------===//
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
#include "DAGISelMatcher.h"
11
#include "CodeGenDAGPatterns.h"
12
#include "CodeGenTarget.h"
14
#include "llvm/Support/raw_ostream.h"
15
#include "llvm/ADT/StringExtras.h"
18
void Matcher::dump() const {
22
void Matcher::print(raw_ostream &OS, unsigned indent) const {
23
printImpl(OS, indent);
25
return Next->print(OS, indent);
28
void Matcher::printOne(raw_ostream &OS) const {
32
/// unlinkNode - Unlink the specified node from this chain. If Other == this,
33
/// we unlink the next pointer and return it. Otherwise we unlink Other from
34
/// the list and return this.
35
Matcher *Matcher::unlinkNode(Matcher *Other) {
39
// Scan until we find the predecessor of Other.
41
for (; Cur && Cur->getNext() != Other; Cur = Cur->getNext())
44
if (Cur == 0) return 0;
46
Cur->setNext(Other->takeNext());
50
/// canMoveBefore - Return true if this matcher is the same as Other, or if
51
/// we can move this matcher past all of the nodes in-between Other and this
52
/// node. Other must be equal to or before this.
53
bool Matcher::canMoveBefore(const Matcher *Other) const {
54
for (;; Other = Other->getNext()) {
55
assert(Other && "Other didn't come before 'this'?");
56
if (this == Other) return true;
58
// We have to be able to move this node across the Other node.
59
if (!canMoveBeforeNode(Other))
64
/// canMoveBefore - Return true if it is safe to move the current matcher
65
/// across the specified one.
66
bool Matcher::canMoveBeforeNode(const Matcher *Other) const {
67
// We can move simple predicates before record nodes.
68
if (isSimplePredicateNode())
69
return Other->isSimplePredicateOrRecordNode();
71
// We can move record nodes across simple predicates.
72
if (isSimplePredicateOrRecordNode())
73
return isSimplePredicateNode();
75
// We can't move record nodes across each other etc.
80
ScopeMatcher::~ScopeMatcher() {
81
for (unsigned i = 0, e = Children.size(); i != e; ++i)
88
void ScopeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
89
OS.indent(indent) << "Scope\n";
90
for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
92
OS.indent(indent+1) << "NULL POINTER\n";
94
getChild(i)->print(OS, indent+2);
98
void RecordMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
99
OS.indent(indent) << "Record\n";
102
void RecordChildMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
103
OS.indent(indent) << "RecordChild: " << ChildNo << '\n';
106
void RecordMemRefMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
107
OS.indent(indent) << "RecordMemRef\n";
110
void CaptureFlagInputMatcher::printImpl(raw_ostream &OS, unsigned indent) const{
111
OS.indent(indent) << "CaptureFlagInput\n";
114
void MoveChildMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
115
OS.indent(indent) << "MoveChild " << ChildNo << '\n';
118
void MoveParentMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
119
OS.indent(indent) << "MoveParent\n";
122
void CheckSameMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
123
OS.indent(indent) << "CheckSame " << MatchNumber << '\n';
126
void CheckPatternPredicateMatcher::
127
printImpl(raw_ostream &OS, unsigned indent) const {
128
OS.indent(indent) << "CheckPatternPredicate " << Predicate << '\n';
131
void CheckPredicateMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
132
OS.indent(indent) << "CheckPredicate " << PredName << '\n';
135
void CheckOpcodeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
136
OS.indent(indent) << "CheckOpcode " << Opcode.getEnumName() << '\n';
139
void SwitchOpcodeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
140
OS.indent(indent) << "SwitchOpcode: {\n";
141
for (unsigned i = 0, e = Cases.size(); i != e; ++i) {
142
OS.indent(indent) << "case " << Cases[i].first->getEnumName() << ":\n";
143
Cases[i].second->print(OS, indent+2);
145
OS.indent(indent) << "}\n";
149
void CheckTypeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
150
OS.indent(indent) << "CheckType " << getEnumName(Type) << ", ResNo="
154
void SwitchTypeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
155
OS.indent(indent) << "SwitchType: {\n";
156
for (unsigned i = 0, e = Cases.size(); i != e; ++i) {
157
OS.indent(indent) << "case " << getEnumName(Cases[i].first) << ":\n";
158
Cases[i].second->print(OS, indent+2);
160
OS.indent(indent) << "}\n";
163
void CheckChildTypeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
164
OS.indent(indent) << "CheckChildType " << ChildNo << " "
165
<< getEnumName(Type) << '\n';
169
void CheckIntegerMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
170
OS.indent(indent) << "CheckInteger " << Value << '\n';
173
void CheckCondCodeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
174
OS.indent(indent) << "CheckCondCode ISD::" << CondCodeName << '\n';
177
void CheckValueTypeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
178
OS.indent(indent) << "CheckValueType MVT::" << TypeName << '\n';
181
void CheckComplexPatMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
182
OS.indent(indent) << "CheckComplexPat " << Pattern.getSelectFunc() << '\n';
185
void CheckAndImmMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
186
OS.indent(indent) << "CheckAndImm " << Value << '\n';
189
void CheckOrImmMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
190
OS.indent(indent) << "CheckOrImm " << Value << '\n';
193
void CheckFoldableChainNodeMatcher::printImpl(raw_ostream &OS,
194
unsigned indent) const {
195
OS.indent(indent) << "CheckFoldableChainNode\n";
198
void EmitIntegerMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
199
OS.indent(indent) << "EmitInteger " << Val << " VT=" << VT << '\n';
202
void EmitStringIntegerMatcher::
203
printImpl(raw_ostream &OS, unsigned indent) const {
204
OS.indent(indent) << "EmitStringInteger " << Val << " VT=" << VT << '\n';
207
void EmitRegisterMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
208
OS.indent(indent) << "EmitRegister ";
210
OS << Reg->getName();
213
OS << " VT=" << VT << '\n';
216
void EmitConvertToTargetMatcher::
217
printImpl(raw_ostream &OS, unsigned indent) const {
218
OS.indent(indent) << "EmitConvertToTarget " << Slot << '\n';
221
void EmitMergeInputChainsMatcher::
222
printImpl(raw_ostream &OS, unsigned indent) const {
223
OS.indent(indent) << "EmitMergeInputChains <todo: args>\n";
226
void EmitCopyToRegMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
227
OS.indent(indent) << "EmitCopyToReg <todo: args>\n";
230
void EmitNodeXFormMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
231
OS.indent(indent) << "EmitNodeXForm " << NodeXForm->getName()
232
<< " Slot=" << Slot << '\n';
236
void EmitNodeMatcherCommon::printImpl(raw_ostream &OS, unsigned indent) const {
238
OS << (isa<MorphNodeToMatcher>(this) ? "MorphNodeTo: " : "EmitNode: ")
239
<< OpcodeName << ": <todo flags> ";
241
for (unsigned i = 0, e = VTs.size(); i != e; ++i)
242
OS << ' ' << getEnumName(VTs[i]);
244
for (unsigned i = 0, e = Operands.size(); i != e; ++i)
245
OS << Operands[i] << ' ';
249
void MarkFlagResultsMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
250
OS.indent(indent) << "MarkFlagResults <todo: args>\n";
253
void CompleteMatchMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
254
OS.indent(indent) << "CompleteMatch <todo args>\n";
255
OS.indent(indent) << "Src = " << *Pattern.getSrcPattern() << "\n";
256
OS.indent(indent) << "Dst = " << *Pattern.getDstPattern() << "\n";
259
// getHashImpl Implementation.
261
unsigned CheckPatternPredicateMatcher::getHashImpl() const {
262
return HashString(Predicate);
265
unsigned CheckPredicateMatcher::getHashImpl() const {
266
return HashString(PredName);
269
unsigned CheckOpcodeMatcher::getHashImpl() const {
270
return HashString(Opcode.getEnumName());
273
unsigned CheckCondCodeMatcher::getHashImpl() const {
274
return HashString(CondCodeName);
277
unsigned CheckValueTypeMatcher::getHashImpl() const {
278
return HashString(TypeName);
281
unsigned EmitStringIntegerMatcher::getHashImpl() const {
282
return HashString(Val) ^ VT;
285
template<typename It>
286
static unsigned HashUnsigneds(It I, It E) {
289
Result = (Result<<3) ^ *I;
293
unsigned EmitMergeInputChainsMatcher::getHashImpl() const {
294
return HashUnsigneds(ChainNodes.begin(), ChainNodes.end());
297
bool CheckOpcodeMatcher::isEqualImpl(const Matcher *M) const {
298
// Note: pointer equality isn't enough here, we have to check the enum names
299
// to ensure that the nodes are for the same opcode.
300
return cast<CheckOpcodeMatcher>(M)->Opcode.getEnumName() ==
301
Opcode.getEnumName();
305
bool EmitNodeMatcherCommon::isEqualImpl(const Matcher *m) const {
306
const EmitNodeMatcherCommon *M = cast<EmitNodeMatcherCommon>(m);
307
return M->OpcodeName == OpcodeName && M->VTs == VTs &&
308
M->Operands == Operands && M->HasChain == HasChain &&
309
M->HasInFlag == HasInFlag && M->HasOutFlag == HasOutFlag &&
310
M->HasMemRefs == HasMemRefs &&
311
M->NumFixedArityOperands == NumFixedArityOperands;
314
unsigned EmitNodeMatcherCommon::getHashImpl() const {
315
return (HashString(OpcodeName) << 4) | Operands.size();
319
unsigned MarkFlagResultsMatcher::getHashImpl() const {
320
return HashUnsigneds(FlagResultNodes.begin(), FlagResultNodes.end());
323
unsigned CompleteMatchMatcher::getHashImpl() const {
324
return HashUnsigneds(Results.begin(), Results.end()) ^
325
((unsigned)(intptr_t)&Pattern << 8);
328
// isContradictoryImpl Implementations.
330
static bool TypesAreContradictory(MVT::SimpleValueType T1,
331
MVT::SimpleValueType T2) {
332
// If the two types are the same, then they are the same, so they don't
334
if (T1 == T2) return false;
336
// If either type is about iPtr, then they don't conflict unless the other
337
// one is not a scalar integer type.
339
return !MVT(T2).isInteger() || MVT(T2).isVector();
342
return !MVT(T1).isInteger() || MVT(T1).isVector();
344
// Otherwise, they are two different non-iPTR types, they conflict.
348
bool CheckOpcodeMatcher::isContradictoryImpl(const Matcher *M) const {
349
if (const CheckOpcodeMatcher *COM = dyn_cast<CheckOpcodeMatcher>(M)) {
350
// One node can't have two different opcodes!
351
// Note: pointer equality isn't enough here, we have to check the enum names
352
// to ensure that the nodes are for the same opcode.
353
return COM->getOpcode().getEnumName() != getOpcode().getEnumName();
356
// If the node has a known type, and if the type we're checking for is
357
// different, then we know they contradict. For example, a check for
358
// ISD::STORE will never be true at the same time a check for Type i32 is.
359
if (const CheckTypeMatcher *CT = dyn_cast<CheckTypeMatcher>(M)) {
360
// If checking for a result the opcode doesn't have, it can't match.
361
if (CT->getResNo() >= getOpcode().getNumResults())
364
MVT::SimpleValueType NodeType = getOpcode().getKnownType(CT->getResNo());
365
if (NodeType != MVT::Other)
366
return TypesAreContradictory(NodeType, CT->getType());
372
bool CheckTypeMatcher::isContradictoryImpl(const Matcher *M) const {
373
if (const CheckTypeMatcher *CT = dyn_cast<CheckTypeMatcher>(M))
374
return TypesAreContradictory(getType(), CT->getType());
378
bool CheckChildTypeMatcher::isContradictoryImpl(const Matcher *M) const {
379
if (const CheckChildTypeMatcher *CC = dyn_cast<CheckChildTypeMatcher>(M)) {
380
// If the two checks are about different nodes, we don't know if they
382
if (CC->getChildNo() != getChildNo())
385
return TypesAreContradictory(getType(), CC->getType());
390
bool CheckIntegerMatcher::isContradictoryImpl(const Matcher *M) const {
391
if (const CheckIntegerMatcher *CIM = dyn_cast<CheckIntegerMatcher>(M))
392
return CIM->getValue() != getValue();
396
bool CheckValueTypeMatcher::isContradictoryImpl(const Matcher *M) const {
397
if (const CheckValueTypeMatcher *CVT = dyn_cast<CheckValueTypeMatcher>(M))
398
return CVT->getTypeName() != getTypeName();