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 /// canMoveBefore - 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 CheckPatternPredicateMatcher::
138 printImpl(raw_ostream &OS, unsigned indent) const {
139 OS.indent(indent) << "CheckPatternPredicate " << Predicate << '\n';
142 void CheckPredicateMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
143 OS.indent(indent) << "CheckPredicate " << getPredicate().getFnName() << '\n';
146 void CheckOpcodeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
147 OS.indent(indent) << "CheckOpcode " << Opcode.getEnumName() << '\n';
150 void SwitchOpcodeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
151 OS.indent(indent) << "SwitchOpcode: {\n";
152 for (unsigned i = 0, e = Cases.size(); i != e; ++i) {
153 OS.indent(indent) << "case " << Cases[i].first->getEnumName() << ":\n";
154 Cases[i].second->print(OS, indent+2);
156 OS.indent(indent) << "}\n";
160 void CheckTypeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
161 OS.indent(indent) << "CheckType " << getEnumName(Type) << ", ResNo="
165 void SwitchTypeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
166 OS.indent(indent) << "SwitchType: {\n";
167 for (unsigned i = 0, e = Cases.size(); i != e; ++i) {
168 OS.indent(indent) << "case " << getEnumName(Cases[i].first) << ":\n";
169 Cases[i].second->print(OS, indent+2);
171 OS.indent(indent) << "}\n";
174 void CheckChildTypeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
175 OS.indent(indent) << "CheckChildType " << ChildNo << " "
176 << getEnumName(Type) << '\n';
180 void CheckIntegerMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
181 OS.indent(indent) << "CheckInteger " << Value << '\n';
184 void CheckCondCodeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
185 OS.indent(indent) << "CheckCondCode ISD::" << CondCodeName << '\n';
188 void CheckValueTypeMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
189 OS.indent(indent) << "CheckValueType MVT::" << TypeName << '\n';
192 void CheckComplexPatMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
193 OS.indent(indent) << "CheckComplexPat " << Pattern.getSelectFunc() << '\n';
196 void CheckAndImmMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
197 OS.indent(indent) << "CheckAndImm " << Value << '\n';
200 void CheckOrImmMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
201 OS.indent(indent) << "CheckOrImm " << Value << '\n';
204 void CheckFoldableChainNodeMatcher::printImpl(raw_ostream &OS,
205 unsigned indent) const {
206 OS.indent(indent) << "CheckFoldableChainNode\n";
209 void EmitIntegerMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
210 OS.indent(indent) << "EmitInteger " << Val << " VT=" << VT << '\n';
213 void EmitStringIntegerMatcher::
214 printImpl(raw_ostream &OS, unsigned indent) const {
215 OS.indent(indent) << "EmitStringInteger " << Val << " VT=" << VT << '\n';
218 void EmitRegisterMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
219 OS.indent(indent) << "EmitRegister ";
221 OS << Reg->getName();
224 OS << " VT=" << VT << '\n';
227 void EmitConvertToTargetMatcher::
228 printImpl(raw_ostream &OS, unsigned indent) const {
229 OS.indent(indent) << "EmitConvertToTarget " << Slot << '\n';
232 void EmitMergeInputChainsMatcher::
233 printImpl(raw_ostream &OS, unsigned indent) const {
234 OS.indent(indent) << "EmitMergeInputChains <todo: args>\n";
237 void EmitCopyToRegMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
238 OS.indent(indent) << "EmitCopyToReg <todo: args>\n";
241 void EmitNodeXFormMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
242 OS.indent(indent) << "EmitNodeXForm " << NodeXForm->getName()
243 << " Slot=" << Slot << '\n';
247 void EmitNodeMatcherCommon::printImpl(raw_ostream &OS, unsigned indent) const {
249 OS << (isa<MorphNodeToMatcher>(this) ? "MorphNodeTo: " : "EmitNode: ")
250 << OpcodeName << ": <todo flags> ";
252 for (unsigned i = 0, e = VTs.size(); i != e; ++i)
253 OS << ' ' << getEnumName(VTs[i]);
255 for (unsigned i = 0, e = Operands.size(); i != e; ++i)
256 OS << Operands[i] << ' ';
260 void MarkGlueResultsMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
261 OS.indent(indent) << "MarkGlueResults <todo: args>\n";
264 void CompleteMatchMatcher::printImpl(raw_ostream &OS, unsigned indent) const {
265 OS.indent(indent) << "CompleteMatch <todo args>\n";
266 OS.indent(indent) << "Src = " << *Pattern.getSrcPattern() << "\n";
267 OS.indent(indent) << "Dst = " << *Pattern.getDstPattern() << "\n";
270 // getHashImpl Implementation.
272 unsigned CheckPatternPredicateMatcher::getHashImpl() const {
273 return HashString(Predicate);
276 unsigned CheckPredicateMatcher::getHashImpl() const {
277 return HashString(getPredicate().getFnName());
280 unsigned CheckOpcodeMatcher::getHashImpl() const {
281 return HashString(Opcode.getEnumName());
284 unsigned CheckCondCodeMatcher::getHashImpl() const {
285 return HashString(CondCodeName);
288 unsigned CheckValueTypeMatcher::getHashImpl() const {
289 return HashString(TypeName);
292 unsigned EmitStringIntegerMatcher::getHashImpl() const {
293 return HashString(Val) ^ VT;
296 template<typename It>
297 static unsigned HashUnsigneds(It I, It E) {
300 Result = (Result<<3) ^ *I;
304 unsigned EmitMergeInputChainsMatcher::getHashImpl() const {
305 return HashUnsigneds(ChainNodes.begin(), ChainNodes.end());
308 bool CheckOpcodeMatcher::isEqualImpl(const Matcher *M) const {
309 // Note: pointer equality isn't enough here, we have to check the enum names
310 // to ensure that the nodes are for the same opcode.
311 return cast<CheckOpcodeMatcher>(M)->Opcode.getEnumName() ==
312 Opcode.getEnumName();
315 bool EmitNodeMatcherCommon::isEqualImpl(const Matcher *m) const {
316 const EmitNodeMatcherCommon *M = cast<EmitNodeMatcherCommon>(m);
317 return M->OpcodeName == OpcodeName && M->VTs == VTs &&
318 M->Operands == Operands && M->HasChain == HasChain &&
319 M->HasInGlue == HasInGlue && M->HasOutGlue == HasOutGlue &&
320 M->HasMemRefs == HasMemRefs &&
321 M->NumFixedArityOperands == NumFixedArityOperands;
324 unsigned EmitNodeMatcherCommon::getHashImpl() const {
325 return (HashString(OpcodeName) << 4) | Operands.size();
329 void EmitNodeMatcher::anchor() { }
331 void MorphNodeToMatcher::anchor() { }
333 unsigned MarkGlueResultsMatcher::getHashImpl() const {
334 return HashUnsigneds(GlueResultNodes.begin(), GlueResultNodes.end());
337 unsigned CompleteMatchMatcher::getHashImpl() const {
338 return HashUnsigneds(Results.begin(), Results.end()) ^
339 ((unsigned)(intptr_t)&Pattern << 8);
342 // isContradictoryImpl Implementations.
344 static bool TypesAreContradictory(MVT::SimpleValueType T1,
345 MVT::SimpleValueType T2) {
346 // If the two types are the same, then they are the same, so they don't
348 if (T1 == T2) return false;
350 // If either type is about iPtr, then they don't conflict unless the other
351 // one is not a scalar integer type.
353 return !MVT(T2).isInteger() || MVT(T2).isVector();
356 return !MVT(T1).isInteger() || MVT(T1).isVector();
358 // Otherwise, they are two different non-iPTR types, they conflict.
362 bool CheckOpcodeMatcher::isContradictoryImpl(const Matcher *M) const {
363 if (const CheckOpcodeMatcher *COM = dyn_cast<CheckOpcodeMatcher>(M)) {
364 // One node can't have two different opcodes!
365 // Note: pointer equality isn't enough here, we have to check the enum names
366 // to ensure that the nodes are for the same opcode.
367 return COM->getOpcode().getEnumName() != getOpcode().getEnumName();
370 // If the node has a known type, and if the type we're checking for is
371 // different, then we know they contradict. For example, a check for
372 // ISD::STORE will never be true at the same time a check for Type i32 is.
373 if (const CheckTypeMatcher *CT = dyn_cast<CheckTypeMatcher>(M)) {
374 // If checking for a result the opcode doesn't have, it can't match.
375 if (CT->getResNo() >= getOpcode().getNumResults())
378 MVT::SimpleValueType NodeType = getOpcode().getKnownType(CT->getResNo());
379 if (NodeType != MVT::Other)
380 return TypesAreContradictory(NodeType, CT->getType());
386 bool CheckTypeMatcher::isContradictoryImpl(const Matcher *M) const {
387 if (const CheckTypeMatcher *CT = dyn_cast<CheckTypeMatcher>(M))
388 return TypesAreContradictory(getType(), CT->getType());
392 bool CheckChildTypeMatcher::isContradictoryImpl(const Matcher *M) const {
393 if (const CheckChildTypeMatcher *CC = dyn_cast<CheckChildTypeMatcher>(M)) {
394 // If the two checks are about different nodes, we don't know if they
396 if (CC->getChildNo() != getChildNo())
399 return TypesAreContradictory(getType(), CC->getType());
404 bool CheckIntegerMatcher::isContradictoryImpl(const Matcher *M) const {
405 if (const CheckIntegerMatcher *CIM = dyn_cast<CheckIntegerMatcher>(M))
406 return CIM->getValue() != getValue();
410 bool CheckValueTypeMatcher::isContradictoryImpl(const Matcher *M) const {
411 if (const CheckValueTypeMatcher *CVT = dyn_cast<CheckValueTypeMatcher>(M))
412 return CVT->getTypeName() != getTypeName();