1 //===- DAGISelMatcher.h - Representation of DAG pattern matcher -*- C++ -*-===//
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
9 #ifndef LLVM_UTILS_TABLEGEN_DAGISELMATCHER_H
10 #define LLVM_UTILS_TABLEGEN_DAGISELMATCHER_H
12 #include "llvm/ADT/ArrayRef.h"
13 #include "llvm/ADT/SmallVector.h"
14 #include "llvm/ADT/StringRef.h"
15 #include "llvm/CodeGen/MachineValueType.h"
16 #include "llvm/Support/Casting.h"
24 class CodeGenRegister
;
25 class CodeGenDAGPatterns
;
26 class CodeGenInstruction
;
33 class TreePredicateFn
;
36 Matcher
*ConvertPatternToMatcher(const PatternToMatch
&Pattern
,unsigned Variant
,
37 const CodeGenDAGPatterns
&CGP
);
38 void OptimizeMatcher(std::unique_ptr
<Matcher
> &Matcher
,
39 const CodeGenDAGPatterns
&CGP
);
40 void EmitMatcherTable(Matcher
*Matcher
, const CodeGenDAGPatterns
&CGP
,
44 /// Matcher - Base class for all the DAG ISel Matcher representation
47 // The next matcher node that is executed after this one. Null if this is the
48 // last stage of a match.
49 std::unique_ptr
<Matcher
> Next
;
50 size_t Size
= 0; // Size in bytes of matcher and all its children (if any).
51 virtual void anchor();
54 // Matcher state manipulation.
55 Scope
, // Push a checking scope.
56 RecordNode
, // Record the current node.
57 RecordChild
, // Record a child of the current node.
58 RecordMemRef
, // Record the memref in the current node.
59 CaptureGlueInput
, // If the current node has an input glue, save it.
60 MoveChild
, // Move current node to specified child.
61 MoveParent
, // Move current node to parent.
63 // Predicate checking.
64 CheckSame
, // Fail if not same as prev match.
65 CheckChildSame
, // Fail if child not same as prev match.
66 CheckPatternPredicate
,
67 CheckPredicate
, // Fail if node predicate fails.
68 CheckOpcode
, // Fail if not opcode.
69 SwitchOpcode
, // Dispatch based on opcode.
70 CheckType
, // Fail if not correct type.
71 SwitchType
, // Dispatch based on type.
72 CheckChildType
, // Fail if child has wrong type.
73 CheckInteger
, // Fail if wrong val.
74 CheckChildInteger
, // Fail if child is wrong val.
75 CheckCondCode
, // Fail if not condcode.
76 CheckChild2CondCode
, // Fail if child is wrong condcode.
83 CheckFoldableChainNode
,
85 // Node creation/emisssion.
86 EmitInteger
, // Create a TargetConstant
87 EmitStringInteger
, // Create a TargetConstant from a string.
88 EmitRegister
, // Create a register.
89 EmitConvertToTarget
, // Convert a imm/fpimm to target imm/fpimm
90 EmitMergeInputChains
, // Merge together a chains for an input.
91 EmitCopyToReg
, // Emit a copytoreg into a physreg.
92 EmitNode
, // Create a DAG node
93 EmitNodeXForm
, // Run a SDNodeXForm
94 CompleteMatch
, // Finish a match and update the results.
95 MorphNodeTo
, // Build a node, finish a match and update results.
97 // Highest enum value; watch out when adding more.
98 HighestKind
= MorphNodeTo
103 Matcher(KindTy K
) : Kind(K
) {}
105 virtual ~Matcher() {}
107 unsigned getSize() const { return Size
; }
108 void setSize(unsigned sz
) { Size
= sz
; }
109 KindTy
getKind() const { return Kind
; }
111 Matcher
*getNext() { return Next
.get(); }
112 const Matcher
*getNext() const { return Next
.get(); }
113 void setNext(Matcher
*C
) { Next
.reset(C
); }
114 Matcher
*takeNext() { return Next
.release(); }
116 std::unique_ptr
<Matcher
> &getNextPtr() { return Next
; }
118 bool isEqual(const Matcher
*M
) const {
119 if (getKind() != M
->getKind()) return false;
120 return isEqualImpl(M
);
123 /// isSimplePredicateNode - Return true if this is a simple predicate that
124 /// operates on the node or its children without potential side effects or a
125 /// change of the current node.
126 bool isSimplePredicateNode() const {
128 default: return false;
131 case CheckPatternPredicate
:
137 case CheckChildInteger
:
139 case CheckChild2CondCode
:
143 case CheckImmAllOnesV
:
144 case CheckImmAllZerosV
:
145 case CheckFoldableChainNode
:
150 /// isSimplePredicateOrRecordNode - Return true if this is a record node or
151 /// a simple predicate.
152 bool isSimplePredicateOrRecordNode() const {
153 return isSimplePredicateNode() ||
154 getKind() == RecordNode
|| getKind() == RecordChild
;
157 /// unlinkNode - Unlink the specified node from this chain. If Other == this,
158 /// we unlink the next pointer and return it. Otherwise we unlink Other from
159 /// the list and return this.
160 Matcher
*unlinkNode(Matcher
*Other
);
162 /// canMoveBefore - Return true if this matcher is the same as Other, or if
163 /// we can move this matcher past all of the nodes in-between Other and this
164 /// node. Other must be equal to or before this.
165 bool canMoveBefore(const Matcher
*Other
) const;
167 /// canMoveBeforeNode - Return true if it is safe to move the current matcher
168 /// across the specified one.
169 bool canMoveBeforeNode(const Matcher
*Other
) const;
171 /// isContradictory - Return true of these two matchers could never match on
173 bool isContradictory(const Matcher
*Other
) const {
174 // Since this predicate is reflexive, we canonicalize the ordering so that
175 // we always match a node against nodes with kinds that are greater or equal
176 // to them. For example, we'll pass in a CheckType node as an argument to
177 // the CheckOpcode method, not the other way around.
178 if (getKind() < Other
->getKind())
179 return isContradictoryImpl(Other
);
180 return Other
->isContradictoryImpl(this);
183 void print(raw_ostream
&OS
, unsigned indent
= 0) const;
184 void printOne(raw_ostream
&OS
) const;
187 virtual void printImpl(raw_ostream
&OS
, unsigned indent
) const = 0;
188 virtual bool isEqualImpl(const Matcher
*M
) const = 0;
189 virtual bool isContradictoryImpl(const Matcher
*M
) const { return false; }
192 /// ScopeMatcher - This attempts to match each of its children to find the first
193 /// one that successfully matches. If one child fails, it tries the next child.
194 /// If none of the children match then this check fails. It never has a 'next'.
195 class ScopeMatcher
: public Matcher
{
196 SmallVector
<Matcher
*, 4> Children
;
198 ScopeMatcher(SmallVectorImpl
<Matcher
*> &&children
)
199 : Matcher(Scope
), Children(std::move(children
)) {}
200 ~ScopeMatcher() override
;
202 unsigned getNumChildren() const { return Children
.size(); }
204 Matcher
*getChild(unsigned i
) { return Children
[i
]; }
205 const Matcher
*getChild(unsigned i
) const { return Children
[i
]; }
207 void resetChild(unsigned i
, Matcher
*N
) {
212 Matcher
*takeChild(unsigned i
) {
213 Matcher
*Res
= Children
[i
];
214 Children
[i
] = nullptr;
218 void setNumChildren(unsigned NC
) {
219 if (NC
< Children
.size()) {
220 // delete any children we're about to lose pointers to.
221 for (unsigned i
= NC
, e
= Children
.size(); i
!= e
; ++i
)
227 static bool classof(const Matcher
*N
) {
228 return N
->getKind() == Scope
;
232 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
233 bool isEqualImpl(const Matcher
*M
) const override
{ return false; }
236 /// RecordMatcher - Save the current node in the operand list.
237 class RecordMatcher
: public Matcher
{
238 /// WhatFor - This is a string indicating why we're recording this. This
239 /// should only be used for comment generation not anything semantic.
242 /// ResultNo - The slot number in the RecordedNodes vector that this will be,
243 /// just printed as a comment.
246 RecordMatcher(const std::string
&whatfor
, unsigned resultNo
)
247 : Matcher(RecordNode
), WhatFor(whatfor
), ResultNo(resultNo
) {}
249 const std::string
&getWhatFor() const { return WhatFor
; }
250 unsigned getResultNo() const { return ResultNo
; }
252 static bool classof(const Matcher
*N
) {
253 return N
->getKind() == RecordNode
;
257 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
258 bool isEqualImpl(const Matcher
*M
) const override
{ return true; }
261 /// RecordChildMatcher - Save a numbered child of the current node, or fail
262 /// the match if it doesn't exist. This is logically equivalent to:
263 /// MoveChild N + RecordNode + MoveParent.
264 class RecordChildMatcher
: public Matcher
{
267 /// WhatFor - This is a string indicating why we're recording this. This
268 /// should only be used for comment generation not anything semantic.
271 /// ResultNo - The slot number in the RecordedNodes vector that this will be,
272 /// just printed as a comment.
275 RecordChildMatcher(unsigned childno
, const std::string
&whatfor
,
277 : Matcher(RecordChild
), ChildNo(childno
), WhatFor(whatfor
),
278 ResultNo(resultNo
) {}
280 unsigned getChildNo() const { return ChildNo
; }
281 const std::string
&getWhatFor() const { return WhatFor
; }
282 unsigned getResultNo() const { return ResultNo
; }
284 static bool classof(const Matcher
*N
) {
285 return N
->getKind() == RecordChild
;
289 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
290 bool isEqualImpl(const Matcher
*M
) const override
{
291 return cast
<RecordChildMatcher
>(M
)->getChildNo() == getChildNo();
295 /// RecordMemRefMatcher - Save the current node's memref.
296 class RecordMemRefMatcher
: public Matcher
{
298 RecordMemRefMatcher() : Matcher(RecordMemRef
) {}
300 static bool classof(const Matcher
*N
) {
301 return N
->getKind() == RecordMemRef
;
305 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
306 bool isEqualImpl(const Matcher
*M
) const override
{ return true; }
310 /// CaptureGlueInputMatcher - If the current record has a glue input, record
311 /// it so that it is used as an input to the generated code.
312 class CaptureGlueInputMatcher
: public Matcher
{
314 CaptureGlueInputMatcher() : Matcher(CaptureGlueInput
) {}
316 static bool classof(const Matcher
*N
) {
317 return N
->getKind() == CaptureGlueInput
;
321 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
322 bool isEqualImpl(const Matcher
*M
) const override
{ return true; }
325 /// MoveChildMatcher - This tells the interpreter to move into the
326 /// specified child node.
327 class MoveChildMatcher
: public Matcher
{
330 MoveChildMatcher(unsigned childNo
) : Matcher(MoveChild
), ChildNo(childNo
) {}
332 unsigned getChildNo() const { return ChildNo
; }
334 static bool classof(const Matcher
*N
) {
335 return N
->getKind() == MoveChild
;
339 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
340 bool isEqualImpl(const Matcher
*M
) const override
{
341 return cast
<MoveChildMatcher
>(M
)->getChildNo() == getChildNo();
345 /// MoveParentMatcher - This tells the interpreter to move to the parent
346 /// of the current node.
347 class MoveParentMatcher
: public Matcher
{
349 MoveParentMatcher() : Matcher(MoveParent
) {}
351 static bool classof(const Matcher
*N
) {
352 return N
->getKind() == MoveParent
;
356 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
357 bool isEqualImpl(const Matcher
*M
) const override
{ return true; }
360 /// CheckSameMatcher - This checks to see if this node is exactly the same
361 /// node as the specified match that was recorded with 'Record'. This is used
362 /// when patterns have the same name in them, like '(mul GPR:$in, GPR:$in)'.
363 class CheckSameMatcher
: public Matcher
{
364 unsigned MatchNumber
;
366 CheckSameMatcher(unsigned matchnumber
)
367 : Matcher(CheckSame
), MatchNumber(matchnumber
) {}
369 unsigned getMatchNumber() const { return MatchNumber
; }
371 static bool classof(const Matcher
*N
) {
372 return N
->getKind() == CheckSame
;
376 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
377 bool isEqualImpl(const Matcher
*M
) const override
{
378 return cast
<CheckSameMatcher
>(M
)->getMatchNumber() == getMatchNumber();
382 /// CheckChildSameMatcher - This checks to see if child node is exactly the same
383 /// node as the specified match that was recorded with 'Record'. This is used
384 /// when patterns have the same name in them, like '(mul GPR:$in, GPR:$in)'.
385 class CheckChildSameMatcher
: public Matcher
{
387 unsigned MatchNumber
;
389 CheckChildSameMatcher(unsigned childno
, unsigned matchnumber
)
390 : Matcher(CheckChildSame
), ChildNo(childno
), MatchNumber(matchnumber
) {}
392 unsigned getChildNo() const { return ChildNo
; }
393 unsigned getMatchNumber() const { return MatchNumber
; }
395 static bool classof(const Matcher
*N
) {
396 return N
->getKind() == CheckChildSame
;
400 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
401 bool isEqualImpl(const Matcher
*M
) const override
{
402 return cast
<CheckChildSameMatcher
>(M
)->ChildNo
== ChildNo
&&
403 cast
<CheckChildSameMatcher
>(M
)->MatchNumber
== MatchNumber
;
407 /// CheckPatternPredicateMatcher - This checks the target-specific predicate
408 /// to see if the entire pattern is capable of matching. This predicate does
409 /// not take a node as input. This is used for subtarget feature checks etc.
410 class CheckPatternPredicateMatcher
: public Matcher
{
411 std::string Predicate
;
413 CheckPatternPredicateMatcher(StringRef predicate
)
414 : Matcher(CheckPatternPredicate
), Predicate(predicate
) {}
416 StringRef
getPredicate() const { return Predicate
; }
418 static bool classof(const Matcher
*N
) {
419 return N
->getKind() == CheckPatternPredicate
;
423 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
424 bool isEqualImpl(const Matcher
*M
) const override
{
425 return cast
<CheckPatternPredicateMatcher
>(M
)->getPredicate() == Predicate
;
429 /// CheckPredicateMatcher - This checks the target-specific predicate to
430 /// see if the node is acceptable.
431 class CheckPredicateMatcher
: public Matcher
{
433 const SmallVector
<unsigned, 4> Operands
;
435 CheckPredicateMatcher(const TreePredicateFn
&pred
,
436 const SmallVectorImpl
<unsigned> &Operands
);
438 TreePredicateFn
getPredicate() const;
439 unsigned getNumOperands() const;
440 unsigned getOperandNo(unsigned i
) const;
442 static bool classof(const Matcher
*N
) {
443 return N
->getKind() == CheckPredicate
;
447 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
448 bool isEqualImpl(const Matcher
*M
) const override
{
449 return cast
<CheckPredicateMatcher
>(M
)->Pred
== Pred
;
454 /// CheckOpcodeMatcher - This checks to see if the current node has the
455 /// specified opcode, if not it fails to match.
456 class CheckOpcodeMatcher
: public Matcher
{
457 const SDNodeInfo
&Opcode
;
459 CheckOpcodeMatcher(const SDNodeInfo
&opcode
)
460 : Matcher(CheckOpcode
), Opcode(opcode
) {}
462 const SDNodeInfo
&getOpcode() const { return Opcode
; }
464 static bool classof(const Matcher
*N
) {
465 return N
->getKind() == CheckOpcode
;
469 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
470 bool isEqualImpl(const Matcher
*M
) const override
;
471 bool isContradictoryImpl(const Matcher
*M
) const override
;
474 /// SwitchOpcodeMatcher - Switch based on the current node's opcode, dispatching
475 /// to one matcher per opcode. If the opcode doesn't match any of the cases,
476 /// then the match fails. This is semantically equivalent to a Scope node where
477 /// every child does a CheckOpcode, but is much faster.
478 class SwitchOpcodeMatcher
: public Matcher
{
479 SmallVector
<std::pair
<const SDNodeInfo
*, Matcher
*>, 8> Cases
;
482 SmallVectorImpl
<std::pair
<const SDNodeInfo
*, Matcher
*>> &&cases
)
483 : Matcher(SwitchOpcode
), Cases(std::move(cases
)) {}
484 ~SwitchOpcodeMatcher() override
;
486 static bool classof(const Matcher
*N
) {
487 return N
->getKind() == SwitchOpcode
;
490 unsigned getNumCases() const { return Cases
.size(); }
492 const SDNodeInfo
&getCaseOpcode(unsigned i
) const { return *Cases
[i
].first
; }
493 Matcher
*getCaseMatcher(unsigned i
) { return Cases
[i
].second
; }
494 const Matcher
*getCaseMatcher(unsigned i
) const { return Cases
[i
].second
; }
497 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
498 bool isEqualImpl(const Matcher
*M
) const override
{ return false; }
501 /// CheckTypeMatcher - This checks to see if the current node has the
502 /// specified type at the specified result, if not it fails to match.
503 class CheckTypeMatcher
: public Matcher
{
504 MVT::SimpleValueType Type
;
507 CheckTypeMatcher(MVT::SimpleValueType type
, unsigned resno
)
508 : Matcher(CheckType
), Type(type
), ResNo(resno
) {}
510 MVT::SimpleValueType
getType() const { return Type
; }
511 unsigned getResNo() const { return ResNo
; }
513 static bool classof(const Matcher
*N
) {
514 return N
->getKind() == CheckType
;
518 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
519 bool isEqualImpl(const Matcher
*M
) const override
{
520 return cast
<CheckTypeMatcher
>(M
)->Type
== Type
;
522 bool isContradictoryImpl(const Matcher
*M
) const override
;
525 /// SwitchTypeMatcher - Switch based on the current node's type, dispatching
526 /// to one matcher per case. If the type doesn't match any of the cases,
527 /// then the match fails. This is semantically equivalent to a Scope node where
528 /// every child does a CheckType, but is much faster.
529 class SwitchTypeMatcher
: public Matcher
{
530 SmallVector
<std::pair
<MVT::SimpleValueType
, Matcher
*>, 8> Cases
;
533 SmallVectorImpl
<std::pair
<MVT::SimpleValueType
, Matcher
*>> &&cases
)
534 : Matcher(SwitchType
), Cases(std::move(cases
)) {}
535 ~SwitchTypeMatcher() override
;
537 static bool classof(const Matcher
*N
) {
538 return N
->getKind() == SwitchType
;
541 unsigned getNumCases() const { return Cases
.size(); }
543 MVT::SimpleValueType
getCaseType(unsigned i
) const { return Cases
[i
].first
; }
544 Matcher
*getCaseMatcher(unsigned i
) { return Cases
[i
].second
; }
545 const Matcher
*getCaseMatcher(unsigned i
) const { return Cases
[i
].second
; }
548 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
549 bool isEqualImpl(const Matcher
*M
) const override
{ return false; }
553 /// CheckChildTypeMatcher - This checks to see if a child node has the
554 /// specified type, if not it fails to match.
555 class CheckChildTypeMatcher
: public Matcher
{
557 MVT::SimpleValueType Type
;
559 CheckChildTypeMatcher(unsigned childno
, MVT::SimpleValueType type
)
560 : Matcher(CheckChildType
), ChildNo(childno
), Type(type
) {}
562 unsigned getChildNo() const { return ChildNo
; }
563 MVT::SimpleValueType
getType() const { return Type
; }
565 static bool classof(const Matcher
*N
) {
566 return N
->getKind() == CheckChildType
;
570 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
571 bool isEqualImpl(const Matcher
*M
) const override
{
572 return cast
<CheckChildTypeMatcher
>(M
)->ChildNo
== ChildNo
&&
573 cast
<CheckChildTypeMatcher
>(M
)->Type
== Type
;
575 bool isContradictoryImpl(const Matcher
*M
) const override
;
579 /// CheckIntegerMatcher - This checks to see if the current node is a
580 /// ConstantSDNode with the specified integer value, if not it fails to match.
581 class CheckIntegerMatcher
: public Matcher
{
584 CheckIntegerMatcher(int64_t value
)
585 : Matcher(CheckInteger
), Value(value
) {}
587 int64_t getValue() const { return Value
; }
589 static bool classof(const Matcher
*N
) {
590 return N
->getKind() == CheckInteger
;
594 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
595 bool isEqualImpl(const Matcher
*M
) const override
{
596 return cast
<CheckIntegerMatcher
>(M
)->Value
== Value
;
598 bool isContradictoryImpl(const Matcher
*M
) const override
;
601 /// CheckChildIntegerMatcher - This checks to see if the child node is a
602 /// ConstantSDNode with a specified integer value, if not it fails to match.
603 class CheckChildIntegerMatcher
: public Matcher
{
607 CheckChildIntegerMatcher(unsigned childno
, int64_t value
)
608 : Matcher(CheckChildInteger
), ChildNo(childno
), Value(value
) {}
610 unsigned getChildNo() const { return ChildNo
; }
611 int64_t getValue() const { return Value
; }
613 static bool classof(const Matcher
*N
) {
614 return N
->getKind() == CheckChildInteger
;
618 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
619 bool isEqualImpl(const Matcher
*M
) const override
{
620 return cast
<CheckChildIntegerMatcher
>(M
)->ChildNo
== ChildNo
&&
621 cast
<CheckChildIntegerMatcher
>(M
)->Value
== Value
;
623 bool isContradictoryImpl(const Matcher
*M
) const override
;
626 /// CheckCondCodeMatcher - This checks to see if the current node is a
627 /// CondCodeSDNode with the specified condition, if not it fails to match.
628 class CheckCondCodeMatcher
: public Matcher
{
629 StringRef CondCodeName
;
631 CheckCondCodeMatcher(StringRef condcodename
)
632 : Matcher(CheckCondCode
), CondCodeName(condcodename
) {}
634 StringRef
getCondCodeName() const { return CondCodeName
; }
636 static bool classof(const Matcher
*N
) {
637 return N
->getKind() == CheckCondCode
;
641 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
642 bool isEqualImpl(const Matcher
*M
) const override
{
643 return cast
<CheckCondCodeMatcher
>(M
)->CondCodeName
== CondCodeName
;
645 bool isContradictoryImpl(const Matcher
*M
) const override
;
648 /// CheckChild2CondCodeMatcher - This checks to see if child 2 node is a
649 /// CondCodeSDNode with the specified condition, if not it fails to match.
650 class CheckChild2CondCodeMatcher
: public Matcher
{
651 StringRef CondCodeName
;
653 CheckChild2CondCodeMatcher(StringRef condcodename
)
654 : Matcher(CheckChild2CondCode
), CondCodeName(condcodename
) {}
656 StringRef
getCondCodeName() const { return CondCodeName
; }
658 static bool classof(const Matcher
*N
) {
659 return N
->getKind() == CheckChild2CondCode
;
663 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
664 bool isEqualImpl(const Matcher
*M
) const override
{
665 return cast
<CheckChild2CondCodeMatcher
>(M
)->CondCodeName
== CondCodeName
;
667 bool isContradictoryImpl(const Matcher
*M
) const override
;
670 /// CheckValueTypeMatcher - This checks to see if the current node is a
671 /// VTSDNode with the specified type, if not it fails to match.
672 class CheckValueTypeMatcher
: public Matcher
{
675 CheckValueTypeMatcher(StringRef type_name
)
676 : Matcher(CheckValueType
), TypeName(type_name
) {}
678 StringRef
getTypeName() const { return TypeName
; }
680 static bool classof(const Matcher
*N
) {
681 return N
->getKind() == CheckValueType
;
685 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
686 bool isEqualImpl(const Matcher
*M
) const override
{
687 return cast
<CheckValueTypeMatcher
>(M
)->TypeName
== TypeName
;
689 bool isContradictoryImpl(const Matcher
*M
) const override
;
694 /// CheckComplexPatMatcher - This node runs the specified ComplexPattern on
695 /// the current node.
696 class CheckComplexPatMatcher
: public Matcher
{
697 const ComplexPattern
&Pattern
;
699 /// MatchNumber - This is the recorded nodes slot that contains the node we
700 /// want to match against.
701 unsigned MatchNumber
;
703 /// Name - The name of the node we're matching, for comment emission.
706 /// FirstResult - This is the first slot in the RecordedNodes list that the
707 /// result of the match populates.
708 unsigned FirstResult
;
710 CheckComplexPatMatcher(const ComplexPattern
&pattern
, unsigned matchnumber
,
711 const std::string
&name
, unsigned firstresult
)
712 : Matcher(CheckComplexPat
), Pattern(pattern
), MatchNumber(matchnumber
),
713 Name(name
), FirstResult(firstresult
) {}
715 const ComplexPattern
&getPattern() const { return Pattern
; }
716 unsigned getMatchNumber() const { return MatchNumber
; }
718 std::string
getName() const { return Name
; }
719 unsigned getFirstResult() const { return FirstResult
; }
721 static bool classof(const Matcher
*N
) {
722 return N
->getKind() == CheckComplexPat
;
726 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
727 bool isEqualImpl(const Matcher
*M
) const override
{
728 return &cast
<CheckComplexPatMatcher
>(M
)->Pattern
== &Pattern
&&
729 cast
<CheckComplexPatMatcher
>(M
)->MatchNumber
== MatchNumber
;
733 /// CheckAndImmMatcher - This checks to see if the current node is an 'and'
734 /// with something equivalent to the specified immediate.
735 class CheckAndImmMatcher
: public Matcher
{
738 CheckAndImmMatcher(int64_t value
)
739 : Matcher(CheckAndImm
), Value(value
) {}
741 int64_t getValue() const { return Value
; }
743 static bool classof(const Matcher
*N
) {
744 return N
->getKind() == CheckAndImm
;
748 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
749 bool isEqualImpl(const Matcher
*M
) const override
{
750 return cast
<CheckAndImmMatcher
>(M
)->Value
== Value
;
754 /// CheckOrImmMatcher - This checks to see if the current node is an 'and'
755 /// with something equivalent to the specified immediate.
756 class CheckOrImmMatcher
: public Matcher
{
759 CheckOrImmMatcher(int64_t value
)
760 : Matcher(CheckOrImm
), Value(value
) {}
762 int64_t getValue() const { return Value
; }
764 static bool classof(const Matcher
*N
) {
765 return N
->getKind() == CheckOrImm
;
769 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
770 bool isEqualImpl(const Matcher
*M
) const override
{
771 return cast
<CheckOrImmMatcher
>(M
)->Value
== Value
;
775 /// CheckImmAllOnesVMatcher - This checks if the current node is a build_vector
776 /// or splat_vector of all ones.
777 class CheckImmAllOnesVMatcher
: public Matcher
{
779 CheckImmAllOnesVMatcher() : Matcher(CheckImmAllOnesV
) {}
781 static bool classof(const Matcher
*N
) {
782 return N
->getKind() == CheckImmAllOnesV
;
786 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
787 bool isEqualImpl(const Matcher
*M
) const override
{ return true; }
788 bool isContradictoryImpl(const Matcher
*M
) const override
;
791 /// CheckImmAllZerosVMatcher - This checks if the current node is a
792 /// build_vector or splat_vector of all zeros.
793 class CheckImmAllZerosVMatcher
: public Matcher
{
795 CheckImmAllZerosVMatcher() : Matcher(CheckImmAllZerosV
) {}
797 static bool classof(const Matcher
*N
) {
798 return N
->getKind() == CheckImmAllZerosV
;
802 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
803 bool isEqualImpl(const Matcher
*M
) const override
{ return true; }
804 bool isContradictoryImpl(const Matcher
*M
) const override
;
807 /// CheckFoldableChainNodeMatcher - This checks to see if the current node
808 /// (which defines a chain operand) is safe to fold into a larger pattern.
809 class CheckFoldableChainNodeMatcher
: public Matcher
{
811 CheckFoldableChainNodeMatcher()
812 : Matcher(CheckFoldableChainNode
) {}
814 static bool classof(const Matcher
*N
) {
815 return N
->getKind() == CheckFoldableChainNode
;
819 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
820 bool isEqualImpl(const Matcher
*M
) const override
{ return true; }
823 /// EmitIntegerMatcher - This creates a new TargetConstant.
824 class EmitIntegerMatcher
: public Matcher
{
826 MVT::SimpleValueType VT
;
828 EmitIntegerMatcher(int64_t val
, MVT::SimpleValueType vt
)
829 : Matcher(EmitInteger
), Val(val
), VT(vt
) {}
831 int64_t getValue() const { return Val
; }
832 MVT::SimpleValueType
getVT() const { return VT
; }
834 static bool classof(const Matcher
*N
) {
835 return N
->getKind() == EmitInteger
;
839 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
840 bool isEqualImpl(const Matcher
*M
) const override
{
841 return cast
<EmitIntegerMatcher
>(M
)->Val
== Val
&&
842 cast
<EmitIntegerMatcher
>(M
)->VT
== VT
;
846 /// EmitStringIntegerMatcher - A target constant whose value is represented
848 class EmitStringIntegerMatcher
: public Matcher
{
850 MVT::SimpleValueType VT
;
852 EmitStringIntegerMatcher(const std::string
&val
, MVT::SimpleValueType vt
)
853 : Matcher(EmitStringInteger
), Val(val
), VT(vt
) {}
855 const std::string
&getValue() const { return Val
; }
856 MVT::SimpleValueType
getVT() const { return VT
; }
858 static bool classof(const Matcher
*N
) {
859 return N
->getKind() == EmitStringInteger
;
863 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
864 bool isEqualImpl(const Matcher
*M
) const override
{
865 return cast
<EmitStringIntegerMatcher
>(M
)->Val
== Val
&&
866 cast
<EmitStringIntegerMatcher
>(M
)->VT
== VT
;
870 /// EmitRegisterMatcher - This creates a new TargetConstant.
871 class EmitRegisterMatcher
: public Matcher
{
872 /// Reg - The def for the register that we're emitting. If this is null, then
873 /// this is a reference to zero_reg.
874 const CodeGenRegister
*Reg
;
875 MVT::SimpleValueType VT
;
877 EmitRegisterMatcher(const CodeGenRegister
*reg
, MVT::SimpleValueType vt
)
878 : Matcher(EmitRegister
), Reg(reg
), VT(vt
) {}
880 const CodeGenRegister
*getReg() const { return Reg
; }
881 MVT::SimpleValueType
getVT() const { return VT
; }
883 static bool classof(const Matcher
*N
) {
884 return N
->getKind() == EmitRegister
;
888 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
889 bool isEqualImpl(const Matcher
*M
) const override
{
890 return cast
<EmitRegisterMatcher
>(M
)->Reg
== Reg
&&
891 cast
<EmitRegisterMatcher
>(M
)->VT
== VT
;
895 /// EmitConvertToTargetMatcher - Emit an operation that reads a specified
896 /// recorded node and converts it from being a ISD::Constant to
897 /// ISD::TargetConstant, likewise for ConstantFP.
898 class EmitConvertToTargetMatcher
: public Matcher
{
901 EmitConvertToTargetMatcher(unsigned slot
)
902 : Matcher(EmitConvertToTarget
), Slot(slot
) {}
904 unsigned getSlot() const { return Slot
; }
906 static bool classof(const Matcher
*N
) {
907 return N
->getKind() == EmitConvertToTarget
;
911 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
912 bool isEqualImpl(const Matcher
*M
) const override
{
913 return cast
<EmitConvertToTargetMatcher
>(M
)->Slot
== Slot
;
917 /// EmitMergeInputChainsMatcher - Emit a node that merges a list of input
918 /// chains together with a token factor. The list of nodes are the nodes in the
919 /// matched pattern that have chain input/outputs. This node adds all input
920 /// chains of these nodes if they are not themselves a node in the pattern.
921 class EmitMergeInputChainsMatcher
: public Matcher
{
922 SmallVector
<unsigned, 3> ChainNodes
;
924 EmitMergeInputChainsMatcher(ArrayRef
<unsigned> nodes
)
925 : Matcher(EmitMergeInputChains
), ChainNodes(nodes
.begin(), nodes
.end()) {}
927 unsigned getNumNodes() const { return ChainNodes
.size(); }
929 unsigned getNode(unsigned i
) const {
930 assert(i
< ChainNodes
.size());
931 return ChainNodes
[i
];
934 static bool classof(const Matcher
*N
) {
935 return N
->getKind() == EmitMergeInputChains
;
939 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
940 bool isEqualImpl(const Matcher
*M
) const override
{
941 return cast
<EmitMergeInputChainsMatcher
>(M
)->ChainNodes
== ChainNodes
;
945 /// EmitCopyToRegMatcher - Emit a CopyToReg node from a value to a physreg,
946 /// pushing the chain and glue results.
948 class EmitCopyToRegMatcher
: public Matcher
{
949 unsigned SrcSlot
; // Value to copy into the physreg.
950 const CodeGenRegister
*DestPhysReg
;
953 EmitCopyToRegMatcher(unsigned srcSlot
,
954 const CodeGenRegister
*destPhysReg
)
955 : Matcher(EmitCopyToReg
), SrcSlot(srcSlot
), DestPhysReg(destPhysReg
) {}
957 unsigned getSrcSlot() const { return SrcSlot
; }
958 const CodeGenRegister
*getDestPhysReg() const { return DestPhysReg
; }
960 static bool classof(const Matcher
*N
) {
961 return N
->getKind() == EmitCopyToReg
;
965 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
966 bool isEqualImpl(const Matcher
*M
) const override
{
967 return cast
<EmitCopyToRegMatcher
>(M
)->SrcSlot
== SrcSlot
&&
968 cast
<EmitCopyToRegMatcher
>(M
)->DestPhysReg
== DestPhysReg
;
974 /// EmitNodeXFormMatcher - Emit an operation that runs an SDNodeXForm on a
975 /// recorded node and records the result.
976 class EmitNodeXFormMatcher
: public Matcher
{
980 EmitNodeXFormMatcher(unsigned slot
, Record
*nodeXForm
)
981 : Matcher(EmitNodeXForm
), Slot(slot
), NodeXForm(nodeXForm
) {}
983 unsigned getSlot() const { return Slot
; }
984 Record
*getNodeXForm() const { return NodeXForm
; }
986 static bool classof(const Matcher
*N
) {
987 return N
->getKind() == EmitNodeXForm
;
991 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
992 bool isEqualImpl(const Matcher
*M
) const override
{
993 return cast
<EmitNodeXFormMatcher
>(M
)->Slot
== Slot
&&
994 cast
<EmitNodeXFormMatcher
>(M
)->NodeXForm
== NodeXForm
;
998 /// EmitNodeMatcherCommon - Common class shared between EmitNode and
1000 class EmitNodeMatcherCommon
: public Matcher
{
1001 const CodeGenInstruction
&CGI
;
1002 const SmallVector
<MVT::SimpleValueType
, 3> VTs
;
1003 const SmallVector
<unsigned, 6> Operands
;
1004 bool HasChain
, HasInGlue
, HasOutGlue
, HasMemRefs
;
1006 /// NumFixedArityOperands - If this is a fixed arity node, this is set to -1.
1007 /// If this is a varidic node, this is set to the number of fixed arity
1008 /// operands in the root of the pattern. The rest are appended to this node.
1009 int NumFixedArityOperands
;
1011 EmitNodeMatcherCommon(const CodeGenInstruction
&cgi
,
1012 ArrayRef
<MVT::SimpleValueType
> vts
,
1013 ArrayRef
<unsigned> operands
, bool hasChain
,
1014 bool hasInGlue
, bool hasOutGlue
, bool hasmemrefs
,
1015 int numfixedarityoperands
, bool isMorphNodeTo
)
1016 : Matcher(isMorphNodeTo
? MorphNodeTo
: EmitNode
), CGI(cgi
),
1017 VTs(vts
.begin(), vts
.end()), Operands(operands
.begin(), operands
.end()),
1018 HasChain(hasChain
), HasInGlue(hasInGlue
), HasOutGlue(hasOutGlue
),
1019 HasMemRefs(hasmemrefs
), NumFixedArityOperands(numfixedarityoperands
) {}
1021 const CodeGenInstruction
&getInstruction() const { return CGI
; }
1023 unsigned getNumVTs() const { return VTs
.size(); }
1024 MVT::SimpleValueType
getVT(unsigned i
) const {
1025 assert(i
< VTs
.size());
1029 unsigned getNumOperands() const { return Operands
.size(); }
1030 unsigned getOperand(unsigned i
) const {
1031 assert(i
< Operands
.size());
1035 const SmallVectorImpl
<MVT::SimpleValueType
> &getVTList() const { return VTs
; }
1036 const SmallVectorImpl
<unsigned> &getOperandList() const { return Operands
; }
1039 bool hasChain() const { return HasChain
; }
1040 bool hasInGlue() const { return HasInGlue
; }
1041 bool hasOutGlue() const { return HasOutGlue
; }
1042 bool hasMemRefs() const { return HasMemRefs
; }
1043 int getNumFixedArityOperands() const { return NumFixedArityOperands
; }
1045 static bool classof(const Matcher
*N
) {
1046 return N
->getKind() == EmitNode
|| N
->getKind() == MorphNodeTo
;
1050 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
1051 bool isEqualImpl(const Matcher
*M
) const override
;
1054 /// EmitNodeMatcher - This signals a successful match and generates a node.
1055 class EmitNodeMatcher
: public EmitNodeMatcherCommon
{
1056 void anchor() override
;
1057 unsigned FirstResultSlot
;
1059 EmitNodeMatcher(const CodeGenInstruction
&cgi
,
1060 ArrayRef
<MVT::SimpleValueType
> vts
,
1061 ArrayRef
<unsigned> operands
, bool hasChain
, bool hasInGlue
,
1062 bool hasOutGlue
, bool hasmemrefs
, int numfixedarityoperands
,
1063 unsigned firstresultslot
)
1064 : EmitNodeMatcherCommon(cgi
, vts
, operands
, hasChain
, hasInGlue
,
1065 hasOutGlue
, hasmemrefs
, numfixedarityoperands
,
1067 FirstResultSlot(firstresultslot
) {}
1069 unsigned getFirstResultSlot() const { return FirstResultSlot
; }
1071 static bool classof(const Matcher
*N
) {
1072 return N
->getKind() == EmitNode
;
1077 class MorphNodeToMatcher
: public EmitNodeMatcherCommon
{
1078 void anchor() override
;
1079 const PatternToMatch
&Pattern
;
1081 MorphNodeToMatcher(const CodeGenInstruction
&cgi
,
1082 ArrayRef
<MVT::SimpleValueType
> vts
,
1083 ArrayRef
<unsigned> operands
, bool hasChain
, bool hasInGlue
,
1084 bool hasOutGlue
, bool hasmemrefs
,
1085 int numfixedarityoperands
, const PatternToMatch
&pattern
)
1086 : EmitNodeMatcherCommon(cgi
, vts
, operands
, hasChain
, hasInGlue
,
1087 hasOutGlue
, hasmemrefs
, numfixedarityoperands
,
1091 const PatternToMatch
&getPattern() const { return Pattern
; }
1093 static bool classof(const Matcher
*N
) {
1094 return N
->getKind() == MorphNodeTo
;
1098 /// CompleteMatchMatcher - Complete a match by replacing the results of the
1099 /// pattern with the newly generated nodes. This also prints a comment
1100 /// indicating the source and dest patterns.
1101 class CompleteMatchMatcher
: public Matcher
{
1102 SmallVector
<unsigned, 2> Results
;
1103 const PatternToMatch
&Pattern
;
1105 CompleteMatchMatcher(ArrayRef
<unsigned> results
,
1106 const PatternToMatch
&pattern
)
1107 : Matcher(CompleteMatch
), Results(results
.begin(), results
.end()),
1110 unsigned getNumResults() const { return Results
.size(); }
1111 unsigned getResult(unsigned R
) const { return Results
[R
]; }
1112 const PatternToMatch
&getPattern() const { return Pattern
; }
1114 static bool classof(const Matcher
*N
) {
1115 return N
->getKind() == CompleteMatch
;
1119 void printImpl(raw_ostream
&OS
, unsigned indent
) const override
;
1120 bool isEqualImpl(const Matcher
*M
) const override
{
1121 return cast
<CompleteMatchMatcher
>(M
)->Results
== Results
&&
1122 &cast
<CompleteMatchMatcher
>(M
)->Pattern
== &Pattern
;
1126 } // end namespace llvm