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"
13 #include "llvm/ADT/StringExtras.h"
14 #include "llvm/Support/raw_ostream.h"
15 #include "llvm/TableGen/Record.h"
18 void Matcher::anchor() { }
20 void Matcher::dump() const {
24 void Matcher::print(raw_ostream &OS, unsigned indent) const {
25 printImpl(OS, indent);
27 return Next->print(OS, indent);
30 void Matcher::printOne(raw_ostream &OS) const {
34 /// unlinkNode - Unlink the specified node from this chain. If Other == this,
35 /// we unlink the next pointer and return it. Otherwise we unlink Other from
36 /// the list and return this.
37 Matcher *Matcher::unlinkNode(Matcher *Other) {
41 // Scan until we find the predecessor of Other.
43 for (; Cur && Cur->getNext() != Other; Cur = Cur->getNext())
46 if (Cur == 0) return 0;
48 Cur->setNext(Other->takeNext());
52 /// canMoveBefore - Return true if this matcher is the same as Other, or if
53 /// we can move this matcher past all of the nodes in-between Other and this
54 /// node. Other must be equal to or before this.
55 bool Matcher::canMoveBefore(const Matcher *Other) const {
56 for (;; Other = Other->getNext()) {
57 assert(Other && "Other didn't come before 'this'?");
58 if (this == Other) return true;
60 // We have to be able to move this node across the Other node.
61 if (!canMoveBeforeNode(Other))
66 /// canMoveBeforeNode - Return true if it is safe to move the current matcher
67 /// across the specified one.
68 bool Matcher::canMoveBeforeNode(const Matcher *Other) const {
69 // We can move simple predicates before record nodes.
70 if (isSimplePredicateNode())
71 return Other->isSimplePredicateOrRecordNode();
73 // We can move record nodes across simple predicates.
74 if (isSimplePredicateOrRecordNode())
75 return isSimplePredicateNode();
77 // We can't move record nodes across each other etc.
82 ScopeMatcher::~ScopeMatcher() {
83 for (unsigned i = 0, e = Children.size(); i != e; ++i)
88 CheckPredicateMatcher::CheckPredicateMatcher(const TreePredicateFn &pred)
89 : Matcher(CheckPredicate), Pred(pred.getOrigPatFragRecord()) {}
91 TreePredicateFn CheckPredicateMatcher::getPredicate() const {
92 return TreePredicateFn(Pred);
99 void ScopeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
100 OS.indent(indent) << "Scope\n";
101 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
102 if (getChild(i) == 0)
103 OS.indent(indent+1) << "NULL POINTER\n";
105 getChild(i)->print(OS, indent+2);
109 void RecordMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
110 OS.indent(indent) << "Record\n";
113 void RecordChildMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
114 OS.indent(indent) << "RecordChild: " << ChildNo << '\n';
117 void RecordMemRefMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
118 OS.indent(indent) << "RecordMemRef\n";
121 void CaptureGlueInputMatcher::printImpl(raw_ostream &OS, unsigned indent) const{
122 OS.indent(indent) << "CaptureGlueInput\n";
125 void MoveChildMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
126 OS.indent(indent) << "MoveChild " << ChildNo << '\n';
129 void MoveParentMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
130 OS.indent(indent) << "MoveParent\n";
133 void CheckSameMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
134 OS.indent(indent) << "CheckSame " << MatchNumber << '\n';
137 void CheckChildSameMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
138 OS.indent(indent) << "CheckChild" << ChildNo << "Same\n";
141 void CheckPatternPredicateMatcher::
142 printImpl(raw_ostream &OS, unsigned indent) const {
143 OS.indent(indent) << "CheckPatternPredicate " << Predicate << '\n';
146 void CheckPredicateMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
147 OS.indent(indent) << "CheckPredicate " << getPredicate().getFnName() << '\n';
150 void CheckOpcodeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
151 OS.indent(indent) << "CheckOpcode " << Opcode.getEnumName() << '\n';
154 void SwitchOpcodeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
155 OS.indent(indent) << "SwitchOpcode: {\n";
156 for (unsigned i = 0, e = Cases.size(); i != e; ++i) {
157 OS.indent(indent) << "case " << Cases[i].first->getEnumName() << ":\n";
158 Cases[i].second->print(OS, indent+2);
160 OS.indent(indent) << "}\n";
164 void CheckTypeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
165 OS.indent(indent) << "CheckType " << getEnumName(Type) << ", ResNo="
169 void SwitchTypeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
170 OS.indent(indent) << "SwitchType: {\n";
171 for (unsigned i = 0, e = Cases.size(); i != e; ++i) {
172 OS.indent(indent) << "case " << getEnumName(Cases[i].first) << ":\n";
173 Cases[i].second->print(OS, indent+2);
175 OS.indent(indent) << "}\n";
178 void CheckChildTypeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
179 OS.indent(indent) << "CheckChildType " << ChildNo << " "
180 << getEnumName(Type) << '\n';
184 void CheckIntegerMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
185 OS.indent(indent) << "CheckInteger " << Value << '\n';
188 void CheckCondCodeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
189 OS.indent(indent) << "CheckCondCode ISD::" << CondCodeName << '\n';
192 void CheckValueTypeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
193 OS.indent(indent) << "CheckValueType MVT::" << TypeName << '\n';
196 void CheckComplexPatMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
197 OS.indent(indent) << "CheckComplexPat " << Pattern.getSelectFunc() << '\n';
200 void CheckAndImmMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
201 OS.indent(indent) << "CheckAndImm " << Value << '\n';
204 void CheckOrImmMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
205 OS.indent(indent) << "CheckOrImm " << Value << '\n';
208 void CheckFoldableChainNodeMatcher::printImpl(raw_ostream &OS,
209 unsigned indent) const {
210 OS.indent(indent) << "CheckFoldableChainNode\n";
213 void EmitIntegerMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
214 OS.indent(indent) << "EmitInteger " << Val << " VT=" << VT << '\n';
217 void EmitStringIntegerMatcher::
218 printImpl(raw_ostream &OS, unsigned indent) const {
219 OS.indent(indent) << "EmitStringInteger " << Val << " VT=" << VT << '\n';
222 void EmitRegisterMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
223 OS.indent(indent) << "EmitRegister ";
225 OS << Reg->getName();
228 OS << " VT=" << VT << '\n';
231 void EmitConvertToTargetMatcher::
232 printImpl(raw_ostream &OS, unsigned indent) const {
233 OS.indent(indent) << "EmitConvertToTarget " << Slot << '\n';
236 void EmitMergeInputChainsMatcher::
237 printImpl(raw_ostream &OS, unsigned indent) const {
238 OS.indent(indent) << "EmitMergeInputChains <todo: args>\n";
241 void EmitCopyToRegMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
242 OS.indent(indent) << "EmitCopyToReg <todo: args>\n";
245 void EmitNodeXFormMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
246 OS.indent(indent) << "EmitNodeXForm " << NodeXForm->getName()
247 << " Slot=" << Slot << '\n';
251 void EmitNodeMatcherCommon::printImpl(raw_ostream &OS, unsigned indent) const {
253 OS << (isa<MorphNodeToMatcher>(this) ? "MorphNodeTo: " : "EmitNode: ")
254 << OpcodeName << ": <todo flags> ";
256 for (unsigned i = 0, e = VTs.size(); i != e; ++i)
257 OS << ' ' << getEnumName(VTs[i]);
259 for (unsigned i = 0, e = Operands.size(); i != e; ++i)
260 OS << Operands[i] << ' ';
264 void MarkGlueResultsMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
265 OS.indent(indent) << "MarkGlueResults <todo: args>\n";
268 void CompleteMatchMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
269 OS.indent(indent) << "CompleteMatch <todo args>\n";
270 OS.indent(indent) << "Src = " << *Pattern.getSrcPattern() << "\n";
271 OS.indent(indent) << "Dst = " << *Pattern.getDstPattern() << "\n";
274 // getHashImpl Implementation.
276 unsigned CheckPatternPredicateMatcher::getHashImpl() const {
277 return HashString(Predicate);
280 unsigned CheckPredicateMatcher::getHashImpl() const {
281 return HashString(getPredicate().getFnName());
284 unsigned CheckOpcodeMatcher::getHashImpl() const {
285 return HashString(Opcode.getEnumName());
288 unsigned CheckCondCodeMatcher::getHashImpl() const {
289 return HashString(CondCodeName);
292 unsigned CheckValueTypeMatcher::getHashImpl() const {
293 return HashString(TypeName);
296 unsigned EmitStringIntegerMatcher::getHashImpl() const {
297 return HashString(Val) ^ VT;
300 template<typename It>
301 static unsigned HashUnsigneds(It I, It E) {
304 Result = (Result<<3) ^ *I;
308 unsigned EmitMergeInputChainsMatcher::getHashImpl() const {
309 return HashUnsigneds(ChainNodes.begin(), ChainNodes.end());
312 bool CheckOpcodeMatcher::isEqualImpl(const Matcher *M) const {
313 // Note: pointer equality isn't enough here, we have to check the enum names
314 // to ensure that the nodes are for the same opcode.
315 return cast<CheckOpcodeMatcher>(M)->Opcode.getEnumName() ==
316 Opcode.getEnumName();
319 bool EmitNodeMatcherCommon::isEqualImpl(const Matcher *m) const {
320 const EmitNodeMatcherCommon *M = cast<EmitNodeMatcherCommon>(m);
321 return M->OpcodeName == OpcodeName && M->VTs == VTs &&
322 M->Operands == Operands && M->HasChain == HasChain &&
323 M->HasInGlue == HasInGlue && M->HasOutGlue == HasOutGlue &&
324 M->HasMemRefs == HasMemRefs &&
325 M->NumFixedArityOperands == NumFixedArityOperands;
328 unsigned EmitNodeMatcherCommon::getHashImpl() const {
329 return (HashString(OpcodeName) << 4) | Operands.size();
333 void EmitNodeMatcher::anchor() { }
335 void MorphNodeToMatcher::anchor() { }
337 unsigned MarkGlueResultsMatcher::getHashImpl() const {
338 return HashUnsigneds(GlueResultNodes.begin(), GlueResultNodes.end());
341 unsigned CompleteMatchMatcher::getHashImpl() const {
342 return HashUnsigneds(Results.begin(), Results.end()) ^
343 ((unsigned)(intptr_t)&Pattern << 8);
346 // isContradictoryImpl Implementations.
348 static bool TypesAreContradictory(MVT::SimpleValueType T1,
349 MVT::SimpleValueType T2) {
350 // If the two types are the same, then they are the same, so they don't
352 if (T1 == T2) return false;
354 // If either type is about iPtr, then they don't conflict unless the other
355 // one is not a scalar integer type.
357 return !MVT(T2).isInteger() || MVT(T2).isVector();
360 return !MVT(T1).isInteger() || MVT(T1).isVector();
362 // Otherwise, they are two different non-iPTR types, they conflict.
366 bool CheckOpcodeMatcher::isContradictoryImpl(const Matcher *M) const {
367 if (const CheckOpcodeMatcher *COM = dyn_cast<CheckOpcodeMatcher>(M)) {
368 // One node can't have two different opcodes!
369 // Note: pointer equality isn't enough here, we have to check the enum names
370 // to ensure that the nodes are for the same opcode.
371 return COM->getOpcode().getEnumName() != getOpcode().getEnumName();
374 // If the node has a known type, and if the type we're checking for is
375 // different, then we know they contradict. For example, a check for
376 // ISD::STORE will never be true at the same time a check for Type i32 is.
377 if (const CheckTypeMatcher *CT = dyn_cast<CheckTypeMatcher>(M)) {
378 // If checking for a result the opcode doesn't have, it can't match.
379 if (CT->getResNo() >= getOpcode().getNumResults())
382 MVT::SimpleValueType NodeType = getOpcode().getKnownType(CT->getResNo());
383 if (NodeType != MVT::Other)
384 return TypesAreContradictory(NodeType, CT->getType());
390 bool CheckTypeMatcher::isContradictoryImpl(const Matcher *M) const {
391 if (const CheckTypeMatcher *CT = dyn_cast<CheckTypeMatcher>(M))
392 return TypesAreContradictory(getType(), CT->getType());
396 bool CheckChildTypeMatcher::isContradictoryImpl(const Matcher *M) const {
397 if (const CheckChildTypeMatcher *CC = dyn_cast<CheckChildTypeMatcher>(M)) {
398 // If the two checks are about different nodes, we don't know if they
400 if (CC->getChildNo() != getChildNo())
403 return TypesAreContradictory(getType(), CC->getType());
408 bool CheckIntegerMatcher::isContradictoryImpl(const Matcher *M) const {
409 if (const CheckIntegerMatcher *CIM = dyn_cast<CheckIntegerMatcher>(M))
410 return CIM->getValue() != getValue();
414 bool CheckValueTypeMatcher::isContradictoryImpl(const Matcher *M) const {
415 if (const CheckValueTypeMatcher *CVT = dyn_cast<CheckValueTypeMatcher>(M))
416 return CVT->getTypeName() != getTypeName();