X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=utils%2FTableGen%2FDAGISelMatcher.h;h=8d01ffcc5f56e90b28c32aaf956539d65ea34f97;hb=ccbfd5b18a79a07229f11af478843eae16ac9b26;hp=757bf606588a2fd4c46a8060ef830297ce69ff53;hpb=60df53e30a7e39c884f4ca4eb03346bea5825109;p=oota-llvm.git diff --git a/utils/TableGen/DAGISelMatcher.h b/utils/TableGen/DAGISelMatcher.h index 757bf606588..8d01ffcc5f5 100644 --- a/utils/TableGen/DAGISelMatcher.h +++ b/utils/TableGen/DAGISelMatcher.h @@ -10,32 +10,39 @@ #ifndef TBLGEN_DAGISELMATCHER_H #define TBLGEN_DAGISELMATCHER_H -#include "llvm/CodeGen/ValueTypes.h" +#include "llvm/ADT/ArrayRef.h" #include "llvm/ADT/OwningPtr.h" -#include "llvm/ADT/StringRef.h" #include "llvm/ADT/SmallVector.h" +#include "llvm/ADT/StringRef.h" +#include "llvm/CodeGen/ValueTypes.h" #include "llvm/Support/Casting.h" namespace llvm { + struct CodeGenRegister; class CodeGenDAGPatterns; - class MatcherNode; + class Matcher; class PatternToMatch; class raw_ostream; class ComplexPattern; class Record; + class SDNodeInfo; + class TreePredicateFn; + class TreePattern; + +Matcher *ConvertPatternToMatcher(const PatternToMatch &Pattern,unsigned Variant, + const CodeGenDAGPatterns &CGP); +Matcher *OptimizeMatcher(Matcher *Matcher, const CodeGenDAGPatterns &CGP); +void EmitMatcherTable(const Matcher *Matcher, const CodeGenDAGPatterns &CGP, + raw_ostream &OS); -MatcherNode *ConvertPatternToMatcher(const PatternToMatch &Pattern, - const CodeGenDAGPatterns &CGP); -MatcherNode *OptimizeMatcher(MatcherNode *Matcher); -void EmitMatcherTable(const MatcherNode *Matcher, raw_ostream &OS); - -/// MatcherNode - Base class for all the the DAG ISel Matcher representation +/// Matcher - Base class for all the DAG ISel Matcher representation /// nodes. -class MatcherNode { +class Matcher { // The next matcher node that is executed after this one. Null if this is the // last stage of a match. - OwningPtr Next; + OwningPtr Next; + virtual void anchor(); public: enum KindTy { // Matcher state manipulation. @@ -43,17 +50,19 @@ public: RecordNode, // Record the current node. RecordChild, // Record a child of the current node. RecordMemRef, // Record the memref in the current node. - CaptureFlagInput, // If the current node has an input flag, save it. + CaptureGlueInput, // If the current node has an input glue, save it. MoveChild, // Move current node to specified child. MoveParent, // Move current node to parent. - + // Predicate checking. CheckSame, // Fail if not same as prev match. + CheckChildSame, // Fail if child not same as prev match. CheckPatternPredicate, CheckPredicate, // Fail if node predicate fails. CheckOpcode, // Fail if not opcode. - CheckMultiOpcode, // Fail if not in opcode list. + SwitchOpcode, // Dispatch based on opcode. CheckType, // Fail if not correct type. + SwitchType, // Dispatch based on type. CheckChildType, // Fail if child has wrong type. CheckInteger, // Fail if wrong val. CheckCondCode, // Fail if not condcode. @@ -62,8 +71,7 @@ public: CheckAndImm, CheckOrImm, CheckFoldableChainNode, - CheckChainCompatible, - + // Node creation/emisssion. EmitInteger, // Create a TargetConstant EmitStringInteger, // Create a TargetConstant from a string. @@ -73,653 +81,1066 @@ public: EmitCopyToReg, // Emit a copytoreg into a physreg. EmitNode, // Create a DAG node EmitNodeXForm, // Run a SDNodeXForm - MarkFlagResults, // Indicate which interior nodes have flag results. - CompleteMatch // Finish a match and update the results. + MarkGlueResults, // Indicate which interior nodes have glue results. + CompleteMatch, // Finish a match and update the results. + MorphNodeTo // Build a node, finish a match and update results. }; const KindTy Kind; protected: - MatcherNode(KindTy K) : Kind(K) {} + Matcher(KindTy K) : Kind(K) {} public: - virtual ~MatcherNode() {} - + virtual ~Matcher() {} + KindTy getKind() const { return Kind; } - MatcherNode *getNext() { return Next.get(); } - const MatcherNode *getNext() const { return Next.get(); } - void setNext(MatcherNode *C) { Next.reset(C); } - MatcherNode *takeNext() { return Next.take(); } + Matcher *getNext() { return Next.get(); } + const Matcher *getNext() const { return Next.get(); } + void setNext(Matcher *C) { Next.reset(C); } + Matcher *takeNext() { return Next.take(); } + + OwningPtr &getNextPtr() { return Next; } + + bool isEqual(const Matcher *M) const { + if (getKind() != M->getKind()) return false; + return isEqualImpl(M); + } + + unsigned getHash() const { + // Clear the high bit so we don't conflict with tombstones etc. + return ((getHashImpl() << 4) ^ getKind()) & (~0U>>1); + } + + /// isSafeToReorderWithPatternPredicate - Return true if it is safe to sink a + /// PatternPredicate node past this one. + virtual bool isSafeToReorderWithPatternPredicate() const { + return false; + } + + /// isSimplePredicateNode - Return true if this is a simple predicate that + /// operates on the node or its children without potential side effects or a + /// change of the current node. + bool isSimplePredicateNode() const { + switch (getKind()) { + default: return false; + case CheckSame: + case CheckChildSame: + case CheckPatternPredicate: + case CheckPredicate: + case CheckOpcode: + case CheckType: + case CheckChildType: + case CheckInteger: + case CheckCondCode: + case CheckValueType: + case CheckAndImm: + case CheckOrImm: + case CheckFoldableChainNode: + return true; + } + } - OwningPtr &getNextPtr() { return Next; } - - static inline bool classof(const MatcherNode *) { return true; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const = 0; + /// isSimplePredicateOrRecordNode - Return true if this is a record node or + /// a simple predicate. + bool isSimplePredicateOrRecordNode() const { + return isSimplePredicateNode() || + getKind() == RecordNode || getKind() == RecordChild; + } + + /// unlinkNode - Unlink the specified node from this chain. If Other == this, + /// we unlink the next pointer and return it. Otherwise we unlink Other from + /// the list and return this. + Matcher *unlinkNode(Matcher *Other); + + /// canMoveBefore - Return true if this matcher is the same as Other, or if + /// we can move this matcher past all of the nodes in-between Other and this + /// node. Other must be equal to or before this. + bool canMoveBefore(const Matcher *Other) const; + + /// canMoveBeforeNode - Return true if it is safe to move the current matcher + /// across the specified one. + bool canMoveBeforeNode(const Matcher *Other) const; + + /// isContradictory - Return true of these two matchers could never match on + /// the same node. + bool isContradictory(const Matcher *Other) const { + // Since this predicate is reflexive, we canonicalize the ordering so that + // we always match a node against nodes with kinds that are greater or equal + // to them. For example, we'll pass in a CheckType node as an argument to + // the CheckOpcode method, not the other way around. + if (getKind() < Other->getKind()) + return isContradictoryImpl(Other); + return Other->isContradictoryImpl(this); + } + + void print(raw_ostream &OS, unsigned indent = 0) const; + void printOne(raw_ostream &OS) const; void dump() const; protected: - void printNext(raw_ostream &OS, unsigned indent) const; -}; - -/// ScopeMatcherNode - This pushes a failure scope on the stack and evaluates -/// 'Check'. If 'Check' fails to match, it pops its scope and continues on to -/// 'Next'. -class ScopeMatcherNode : public MatcherNode { - OwningPtr Check; -public: - ScopeMatcherNode(MatcherNode *check = 0, MatcherNode *next = 0) - : MatcherNode(Scope), Check(check) { - setNext(next); - } - - MatcherNode *getCheck() { return Check.get(); } - const MatcherNode *getCheck() const { return Check.get(); } - void setCheck(MatcherNode *N) { Check.reset(N); } - OwningPtr &getCheckPtr() { return Check; } - - static inline bool classof(const MatcherNode *N) { + virtual void printImpl(raw_ostream &OS, unsigned indent) const = 0; + virtual bool isEqualImpl(const Matcher *M) const = 0; + virtual unsigned getHashImpl() const = 0; + virtual bool isContradictoryImpl(const Matcher *M) const { return false; } +}; + +/// ScopeMatcher - This attempts to match each of its children to find the first +/// one that successfully matches. If one child fails, it tries the next child. +/// If none of the children match then this check fails. It never has a 'next'. +class ScopeMatcher : public Matcher { + SmallVector Children; +public: + ScopeMatcher(ArrayRef children) + : Matcher(Scope), Children(children.begin(), children.end()) { + } + virtual ~ScopeMatcher(); + + unsigned getNumChildren() const { return Children.size(); } + + Matcher *getChild(unsigned i) { return Children[i]; } + const Matcher *getChild(unsigned i) const { return Children[i]; } + + void resetChild(unsigned i, Matcher *N) { + delete Children[i]; + Children[i] = N; + } + + Matcher *takeChild(unsigned i) { + Matcher *Res = Children[i]; + Children[i] = 0; + return Res; + } + + void setNumChildren(unsigned NC) { + if (NC < Children.size()) { + // delete any children we're about to lose pointers to. + for (unsigned i = NC, e = Children.size(); i != e; ++i) + delete Children[i]; + } + Children.resize(NC); + } + + static inline bool classof(const Matcher *N) { return N->getKind() == Scope; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { return false; } + virtual unsigned getHashImpl() const { return 12312; } }; -/// RecordMatcherNode - Save the current node in the operand list. -class RecordMatcherNode : public MatcherNode { +/// RecordMatcher - Save the current node in the operand list. +class RecordMatcher : public Matcher { /// WhatFor - This is a string indicating why we're recording this. This /// should only be used for comment generation not anything semantic. std::string WhatFor; + + /// ResultNo - The slot number in the RecordedNodes vector that this will be, + /// just printed as a comment. + unsigned ResultNo; public: - RecordMatcherNode(const std::string &whatfor) - : MatcherNode(RecordNode), WhatFor(whatfor) {} - + RecordMatcher(const std::string &whatfor, unsigned resultNo) + : Matcher(RecordNode), WhatFor(whatfor), ResultNo(resultNo) {} + const std::string &getWhatFor() const { return WhatFor; } - - static inline bool classof(const MatcherNode *N) { + unsigned getResultNo() const { return ResultNo; } + + static inline bool classof(const Matcher *N) { return N->getKind() == RecordNode; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { return true; } + virtual unsigned getHashImpl() const { return 0; } }; - -/// RecordChildMatcherNode - Save a numbered child of the current node, or fail + +/// RecordChildMatcher - Save a numbered child of the current node, or fail /// the match if it doesn't exist. This is logically equivalent to: /// MoveChild N + RecordNode + MoveParent. -class RecordChildMatcherNode : public MatcherNode { +class RecordChildMatcher : public Matcher { unsigned ChildNo; - + /// WhatFor - This is a string indicating why we're recording this. This /// should only be used for comment generation not anything semantic. std::string WhatFor; + + /// ResultNo - The slot number in the RecordedNodes vector that this will be, + /// just printed as a comment. + unsigned ResultNo; public: - RecordChildMatcherNode(unsigned childno, const std::string &whatfor) - : MatcherNode(RecordChild), ChildNo(childno), WhatFor(whatfor) {} - + RecordChildMatcher(unsigned childno, const std::string &whatfor, + unsigned resultNo) + : Matcher(RecordChild), ChildNo(childno), WhatFor(whatfor), + ResultNo(resultNo) {} + unsigned getChildNo() const { return ChildNo; } const std::string &getWhatFor() const { return WhatFor; } - - static inline bool classof(const MatcherNode *N) { + unsigned getResultNo() const { return ResultNo; } + + static inline bool classof(const Matcher *N) { return N->getKind() == RecordChild; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->getChildNo() == getChildNo(); + } + virtual unsigned getHashImpl() const { return getChildNo(); } }; - -/// RecordMemRefMatcherNode - Save the current node's memref. -class RecordMemRefMatcherNode : public MatcherNode { + +/// RecordMemRefMatcher - Save the current node's memref. +class RecordMemRefMatcher : public Matcher { public: - RecordMemRefMatcherNode() : MatcherNode(RecordMemRef) {} - - static inline bool classof(const MatcherNode *N) { + RecordMemRefMatcher() : Matcher(RecordMemRef) {} + + static inline bool classof(const Matcher *N) { return N->getKind() == RecordMemRef; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { return true; } + virtual unsigned getHashImpl() const { return 0; } }; - -/// CaptureFlagInputMatcherNode - If the current record has a flag input, record + +/// CaptureGlueInputMatcher - If the current record has a glue input, record /// it so that it is used as an input to the generated code. -class CaptureFlagInputMatcherNode : public MatcherNode { +class CaptureGlueInputMatcher : public Matcher { public: - CaptureFlagInputMatcherNode() - : MatcherNode(CaptureFlagInput) {} - - static inline bool classof(const MatcherNode *N) { - return N->getKind() == CaptureFlagInput; + CaptureGlueInputMatcher() : Matcher(CaptureGlueInput) {} + + static inline bool classof(const Matcher *N) { + return N->getKind() == CaptureGlueInput; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { return true; } + virtual unsigned getHashImpl() const { return 0; } }; - -/// MoveChildMatcherNode - This tells the interpreter to move into the + +/// MoveChildMatcher - This tells the interpreter to move into the /// specified child node. -class MoveChildMatcherNode : public MatcherNode { +class MoveChildMatcher : public Matcher { unsigned ChildNo; public: - MoveChildMatcherNode(unsigned childNo) - : MatcherNode(MoveChild), ChildNo(childNo) {} - + MoveChildMatcher(unsigned childNo) : Matcher(MoveChild), ChildNo(childNo) {} + unsigned getChildNo() const { return ChildNo; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == MoveChild; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->getChildNo() == getChildNo(); + } + virtual unsigned getHashImpl() const { return getChildNo(); } }; - -/// MoveParentMatcherNode - This tells the interpreter to move to the parent + +/// MoveParentMatcher - This tells the interpreter to move to the parent /// of the current node. -class MoveParentMatcherNode : public MatcherNode { +class MoveParentMatcher : public Matcher { public: - MoveParentMatcherNode() - : MatcherNode(MoveParent) {} - - static inline bool classof(const MatcherNode *N) { + MoveParentMatcher() : Matcher(MoveParent) {} + + static inline bool classof(const Matcher *N) { return N->getKind() == MoveParent; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { return true; } + virtual unsigned getHashImpl() const { return 0; } }; -/// CheckSameMatcherNode - This checks to see if this node is exactly the same +/// CheckSameMatcher - This checks to see if this node is exactly the same /// node as the specified match that was recorded with 'Record'. This is used /// when patterns have the same name in them, like '(mul GPR:$in, GPR:$in)'. -class CheckSameMatcherNode : public MatcherNode { +class CheckSameMatcher : public Matcher { unsigned MatchNumber; public: - CheckSameMatcherNode(unsigned matchnumber) - : MatcherNode(CheckSame), MatchNumber(matchnumber) {} - + CheckSameMatcher(unsigned matchnumber) + : Matcher(CheckSame), MatchNumber(matchnumber) {} + unsigned getMatchNumber() const { return MatchNumber; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == CheckSame; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->getMatchNumber() == getMatchNumber(); + } + virtual unsigned getHashImpl() const { return getMatchNumber(); } }; - -/// CheckPatternPredicateMatcherNode - This checks the target-specific predicate + +/// CheckChildSameMatcher - This checks to see if child node is exactly the same +/// node as the specified match that was recorded with 'Record'. This is used +/// when patterns have the same name in them, like '(mul GPR:$in, GPR:$in)'. +class CheckChildSameMatcher : public Matcher { + unsigned ChildNo; + unsigned MatchNumber; +public: + CheckChildSameMatcher(unsigned childno, unsigned matchnumber) + : Matcher(CheckChildSame), ChildNo(childno), MatchNumber(matchnumber) {} + + unsigned getChildNo() const { return ChildNo; } + unsigned getMatchNumber() const { return MatchNumber; } + + static inline bool classof(const Matcher *N) { + return N->getKind() == CheckChildSame; + } + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->ChildNo == ChildNo && + cast(M)->MatchNumber == MatchNumber; + } + virtual unsigned getHashImpl() const { return (MatchNumber << 2) | ChildNo; } +}; + +/// CheckPatternPredicateMatcher - This checks the target-specific predicate /// to see if the entire pattern is capable of matching. This predicate does /// not take a node as input. This is used for subtarget feature checks etc. -class CheckPatternPredicateMatcherNode : public MatcherNode { +class CheckPatternPredicateMatcher : public Matcher { std::string Predicate; public: - CheckPatternPredicateMatcherNode(StringRef predicate) - : MatcherNode(CheckPatternPredicate), Predicate(predicate) {} - + CheckPatternPredicateMatcher(StringRef predicate) + : Matcher(CheckPatternPredicate), Predicate(predicate) {} + StringRef getPredicate() const { return Predicate; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == CheckPatternPredicate; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->getPredicate() == Predicate; + } + virtual unsigned getHashImpl() const; }; - -/// CheckPredicateMatcherNode - This checks the target-specific predicate to + +/// CheckPredicateMatcher - This checks the target-specific predicate to /// see if the node is acceptable. -class CheckPredicateMatcherNode : public MatcherNode { - StringRef PredName; +class CheckPredicateMatcher : public Matcher { + TreePattern *Pred; public: - CheckPredicateMatcherNode(StringRef predname) - : MatcherNode(CheckPredicate), PredName(predname) {} - - StringRef getPredicateName() const { return PredName; } + CheckPredicateMatcher(const TreePredicateFn &pred); - static inline bool classof(const MatcherNode *N) { + TreePredicateFn getPredicate() const; + + static inline bool classof(const Matcher *N) { return N->getKind() == CheckPredicate; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + // TODO: Ok? + //virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->Pred == Pred; + } + virtual unsigned getHashImpl() const; }; - - -/// CheckOpcodeMatcherNode - This checks to see if the current node has the + + +/// CheckOpcodeMatcher - This checks to see if the current node has the /// specified opcode, if not it fails to match. -class CheckOpcodeMatcherNode : public MatcherNode { - StringRef OpcodeName; -public: - CheckOpcodeMatcherNode(StringRef opcodename) - : MatcherNode(CheckOpcode), OpcodeName(opcodename) {} - - StringRef getOpcodeName() const { return OpcodeName; } - - static inline bool classof(const MatcherNode *N) { +class CheckOpcodeMatcher : public Matcher { + const SDNodeInfo &Opcode; +public: + CheckOpcodeMatcher(const SDNodeInfo &opcode) + : Matcher(CheckOpcode), Opcode(opcode) {} + + const SDNodeInfo &getOpcode() const { return Opcode; } + + static inline bool classof(const Matcher *N) { return N->getKind() == CheckOpcode; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; -}; - -/// CheckMultiOpcodeMatcherNode - This checks to see if the current node has one -/// of the specified opcode, if not it fails to match. -class CheckMultiOpcodeMatcherNode : public MatcherNode { - SmallVector OpcodeNames; -public: - CheckMultiOpcodeMatcherNode(const StringRef *opcodes, unsigned numops) - : MatcherNode(CheckMultiOpcode), OpcodeNames(opcodes, opcodes+numops) {} - - unsigned getNumOpcodeNames() const { return OpcodeNames.size(); } - StringRef getOpcodeName(unsigned i) const { return OpcodeNames[i]; } - - static inline bool classof(const MatcherNode *N) { - return N->getKind() == CheckMultiOpcode; - } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; -}; - - - -/// CheckTypeMatcherNode - This checks to see if the current node has the -/// specified type, if not it fails to match. -class CheckTypeMatcherNode : public MatcherNode { + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const; + virtual unsigned getHashImpl() const; + virtual bool isContradictoryImpl(const Matcher *M) const; +}; + +/// SwitchOpcodeMatcher - Switch based on the current node's opcode, dispatching +/// to one matcher per opcode. If the opcode doesn't match any of the cases, +/// then the match fails. This is semantically equivalent to a Scope node where +/// every child does a CheckOpcode, but is much faster. +class SwitchOpcodeMatcher : public Matcher { + SmallVector, 8> Cases; +public: + SwitchOpcodeMatcher(ArrayRef > cases) + : Matcher(SwitchOpcode), Cases(cases.begin(), cases.end()) {} + + static inline bool classof(const Matcher *N) { + return N->getKind() == SwitchOpcode; + } + + unsigned getNumCases() const { return Cases.size(); } + + const SDNodeInfo &getCaseOpcode(unsigned i) const { return *Cases[i].first; } + Matcher *getCaseMatcher(unsigned i) { return Cases[i].second; } + const Matcher *getCaseMatcher(unsigned i) const { return Cases[i].second; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { return false; } + virtual unsigned getHashImpl() const { return 4123; } +}; + +/// CheckTypeMatcher - This checks to see if the current node has the +/// specified type at the specified result, if not it fails to match. +class CheckTypeMatcher : public Matcher { MVT::SimpleValueType Type; + unsigned ResNo; public: - CheckTypeMatcherNode(MVT::SimpleValueType type) - : MatcherNode(CheckType), Type(type) {} - + CheckTypeMatcher(MVT::SimpleValueType type, unsigned resno) + : Matcher(CheckType), Type(type), ResNo(resno) {} + MVT::SimpleValueType getType() const { return Type; } - - static inline bool classof(const MatcherNode *N) { + unsigned getResNo() const { return ResNo; } + + static inline bool classof(const Matcher *N) { return N->getKind() == CheckType; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->Type == Type; + } + virtual unsigned getHashImpl() const { return Type; } + virtual bool isContradictoryImpl(const Matcher *M) const; +}; + +/// SwitchTypeMatcher - Switch based on the current node's type, dispatching +/// to one matcher per case. If the type doesn't match any of the cases, +/// then the match fails. This is semantically equivalent to a Scope node where +/// every child does a CheckType, but is much faster. +class SwitchTypeMatcher : public Matcher { + SmallVector, 8> Cases; +public: + SwitchTypeMatcher(ArrayRef > cases) + : Matcher(SwitchType), Cases(cases.begin(), cases.end()) {} + + static inline bool classof(const Matcher *N) { + return N->getKind() == SwitchType; + } + + unsigned getNumCases() const { return Cases.size(); } + + MVT::SimpleValueType getCaseType(unsigned i) const { return Cases[i].first; } + Matcher *getCaseMatcher(unsigned i) { return Cases[i].second; } + const Matcher *getCaseMatcher(unsigned i) const { return Cases[i].second; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { return false; } + virtual unsigned getHashImpl() const { return 4123; } }; - -/// CheckChildTypeMatcherNode - This checks to see if a child node has the + + +/// CheckChildTypeMatcher - This checks to see if a child node has the /// specified type, if not it fails to match. -class CheckChildTypeMatcherNode : public MatcherNode { +class CheckChildTypeMatcher : public Matcher { unsigned ChildNo; MVT::SimpleValueType Type; public: - CheckChildTypeMatcherNode(unsigned childno, MVT::SimpleValueType type) - : MatcherNode(CheckChildType), ChildNo(childno), Type(type) {} - + CheckChildTypeMatcher(unsigned childno, MVT::SimpleValueType type) + : Matcher(CheckChildType), ChildNo(childno), Type(type) {} + unsigned getChildNo() const { return ChildNo; } MVT::SimpleValueType getType() const { return Type; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == CheckChildType; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->ChildNo == ChildNo && + cast(M)->Type == Type; + } + virtual unsigned getHashImpl() const { return (Type << 3) | ChildNo; } + virtual bool isContradictoryImpl(const Matcher *M) const; }; - -/// CheckIntegerMatcherNode - This checks to see if the current node is a + +/// CheckIntegerMatcher - This checks to see if the current node is a /// ConstantSDNode with the specified integer value, if not it fails to match. -class CheckIntegerMatcherNode : public MatcherNode { +class CheckIntegerMatcher : public Matcher { int64_t Value; public: - CheckIntegerMatcherNode(int64_t value) - : MatcherNode(CheckInteger), Value(value) {} - + CheckIntegerMatcher(int64_t value) + : Matcher(CheckInteger), Value(value) {} + int64_t getValue() const { return Value; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == CheckInteger; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->Value == Value; + } + virtual unsigned getHashImpl() const { return Value; } + virtual bool isContradictoryImpl(const Matcher *M) const; }; - -/// CheckCondCodeMatcherNode - This checks to see if the current node is a + +/// CheckCondCodeMatcher - This checks to see if the current node is a /// CondCodeSDNode with the specified condition, if not it fails to match. -class CheckCondCodeMatcherNode : public MatcherNode { +class CheckCondCodeMatcher : public Matcher { StringRef CondCodeName; public: - CheckCondCodeMatcherNode(StringRef condcodename) - : MatcherNode(CheckCondCode), CondCodeName(condcodename) {} - + CheckCondCodeMatcher(StringRef condcodename) + : Matcher(CheckCondCode), CondCodeName(condcodename) {} + StringRef getCondCodeName() const { return CondCodeName; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == CheckCondCode; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->CondCodeName == CondCodeName; + } + virtual unsigned getHashImpl() const; }; - -/// CheckValueTypeMatcherNode - This checks to see if the current node is a + +/// CheckValueTypeMatcher - This checks to see if the current node is a /// VTSDNode with the specified type, if not it fails to match. -class CheckValueTypeMatcherNode : public MatcherNode { +class CheckValueTypeMatcher : public Matcher { StringRef TypeName; public: - CheckValueTypeMatcherNode(StringRef type_name) - : MatcherNode(CheckValueType), TypeName(type_name) {} - + CheckValueTypeMatcher(StringRef type_name) + : Matcher(CheckValueType), TypeName(type_name) {} + StringRef getTypeName() const { return TypeName; } - static inline bool classof(const MatcherNode *N) { + static inline bool classof(const Matcher *N) { return N->getKind() == CheckValueType; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->TypeName == TypeName; + } + virtual unsigned getHashImpl() const; + bool isContradictoryImpl(const Matcher *M) const; }; - - - -/// CheckComplexPatMatcherNode - This node runs the specified ComplexPattern on + + + +/// CheckComplexPatMatcher - This node runs the specified ComplexPattern on /// the current node. -class CheckComplexPatMatcherNode : public MatcherNode { +class CheckComplexPatMatcher : public Matcher { const ComplexPattern &Pattern; + + /// MatchNumber - This is the recorded nodes slot that contains the node we + /// want to match against. + unsigned MatchNumber; + + /// Name - The name of the node we're matching, for comment emission. + std::string Name; + + /// FirstResult - This is the first slot in the RecordedNodes list that the + /// result of the match populates. + unsigned FirstResult; public: - CheckComplexPatMatcherNode(const ComplexPattern &pattern) - : MatcherNode(CheckComplexPat), Pattern(pattern) {} - + CheckComplexPatMatcher(const ComplexPattern &pattern, unsigned matchnumber, + const std::string &name, unsigned firstresult) + : Matcher(CheckComplexPat), Pattern(pattern), MatchNumber(matchnumber), + Name(name), FirstResult(firstresult) {} + const ComplexPattern &getPattern() const { return Pattern; } - - static inline bool classof(const MatcherNode *N) { + unsigned getMatchNumber() const { return MatchNumber; } + + const std::string getName() const { return Name; } + unsigned getFirstResult() const { return FirstResult; } + + static inline bool classof(const Matcher *N) { return N->getKind() == CheckComplexPat; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + // Not safe to move a pattern predicate past a complex pattern. + virtual bool isSafeToReorderWithPatternPredicate() const { return false; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return &cast(M)->Pattern == &Pattern && + cast(M)->MatchNumber == MatchNumber; + } + virtual unsigned getHashImpl() const { + return (unsigned)(intptr_t)&Pattern ^ MatchNumber; + } }; - -/// CheckAndImmMatcherNode - This checks to see if the current node is an 'and' + +/// CheckAndImmMatcher - This checks to see if the current node is an 'and' /// with something equivalent to the specified immediate. -class CheckAndImmMatcherNode : public MatcherNode { +class CheckAndImmMatcher : public Matcher { int64_t Value; public: - CheckAndImmMatcherNode(int64_t value) - : MatcherNode(CheckAndImm), Value(value) {} - + CheckAndImmMatcher(int64_t value) + : Matcher(CheckAndImm), Value(value) {} + int64_t getValue() const { return Value; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == CheckAndImm; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->Value == Value; + } + virtual unsigned getHashImpl() const { return Value; } }; -/// CheckOrImmMatcherNode - This checks to see if the current node is an 'and' +/// CheckOrImmMatcher - This checks to see if the current node is an 'and' /// with something equivalent to the specified immediate. -class CheckOrImmMatcherNode : public MatcherNode { +class CheckOrImmMatcher : public Matcher { int64_t Value; public: - CheckOrImmMatcherNode(int64_t value) - : MatcherNode(CheckOrImm), Value(value) {} - + CheckOrImmMatcher(int64_t value) + : Matcher(CheckOrImm), Value(value) {} + int64_t getValue() const { return Value; } - static inline bool classof(const MatcherNode *N) { + static inline bool classof(const Matcher *N) { return N->getKind() == CheckOrImm; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->Value == Value; + } + virtual unsigned getHashImpl() const { return Value; } }; -/// CheckFoldableChainNodeMatcherNode - This checks to see if the current node +/// CheckFoldableChainNodeMatcher - This checks to see if the current node /// (which defines a chain operand) is safe to fold into a larger pattern. -class CheckFoldableChainNodeMatcherNode : public MatcherNode { +class CheckFoldableChainNodeMatcher : public Matcher { public: - CheckFoldableChainNodeMatcherNode() - : MatcherNode(CheckFoldableChainNode) {} - - static inline bool classof(const MatcherNode *N) { + CheckFoldableChainNodeMatcher() + : Matcher(CheckFoldableChainNode) {} + + static inline bool classof(const Matcher *N) { return N->getKind() == CheckFoldableChainNode; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; -}; -/// CheckChainCompatibleMatcherNode - Verify that the current node's chain -/// operand is 'compatible' with the specified recorded node's. -class CheckChainCompatibleMatcherNode : public MatcherNode { - unsigned PreviousOp; -public: - CheckChainCompatibleMatcherNode(unsigned previousop) - : MatcherNode(CheckChainCompatible), PreviousOp(previousop) {} - - unsigned getPreviousOp() const { return PreviousOp; } - - static inline bool classof(const MatcherNode *N) { - return N->getKind() == CheckChainCompatible; - } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + virtual bool isSafeToReorderWithPatternPredicate() const { return true; } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { return true; } + virtual unsigned getHashImpl() const { return 0; } }; - -/// EmitIntegerMatcherNode - This creates a new TargetConstant. -class EmitIntegerMatcherNode : public MatcherNode { + +/// EmitIntegerMatcher - This creates a new TargetConstant. +class EmitIntegerMatcher : public Matcher { int64_t Val; MVT::SimpleValueType VT; public: - EmitIntegerMatcherNode(int64_t val, MVT::SimpleValueType vt) - : MatcherNode(EmitInteger), Val(val), VT(vt) {} - + EmitIntegerMatcher(int64_t val, MVT::SimpleValueType vt) + : Matcher(EmitInteger), Val(val), VT(vt) {} + int64_t getValue() const { return Val; } MVT::SimpleValueType getVT() const { return VT; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == EmitInteger; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->Val == Val && + cast(M)->VT == VT; + } + virtual unsigned getHashImpl() const { return (Val << 4) | VT; } }; -/// EmitStringIntegerMatcherNode - A target constant whose value is represented +/// EmitStringIntegerMatcher - A target constant whose value is represented /// by a string. -class EmitStringIntegerMatcherNode : public MatcherNode { +class EmitStringIntegerMatcher : public Matcher { std::string Val; MVT::SimpleValueType VT; public: - EmitStringIntegerMatcherNode(const std::string &val, MVT::SimpleValueType vt) - : MatcherNode(EmitStringInteger), Val(val), VT(vt) {} - + EmitStringIntegerMatcher(const std::string &val, MVT::SimpleValueType vt) + : Matcher(EmitStringInteger), Val(val), VT(vt) {} + const std::string &getValue() const { return Val; } MVT::SimpleValueType getVT() const { return VT; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == EmitStringInteger; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->Val == Val && + cast(M)->VT == VT; + } + virtual unsigned getHashImpl() const; }; - -/// EmitRegisterMatcherNode - This creates a new TargetConstant. -class EmitRegisterMatcherNode : public MatcherNode { + +/// EmitRegisterMatcher - This creates a new TargetConstant. +class EmitRegisterMatcher : public Matcher { /// Reg - The def for the register that we're emitting. If this is null, then /// this is a reference to zero_reg. - Record *Reg; + const CodeGenRegister *Reg; MVT::SimpleValueType VT; public: - EmitRegisterMatcherNode(Record *reg, MVT::SimpleValueType vt) - : MatcherNode(EmitRegister), Reg(reg), VT(vt) {} - - Record *getReg() const { return Reg; } + EmitRegisterMatcher(const CodeGenRegister *reg, MVT::SimpleValueType vt) + : Matcher(EmitRegister), Reg(reg), VT(vt) {} + + const CodeGenRegister *getReg() const { return Reg; } MVT::SimpleValueType getVT() const { return VT; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == EmitRegister; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->Reg == Reg && + cast(M)->VT == VT; + } + virtual unsigned getHashImpl() const { + return ((unsigned)(intptr_t)Reg) << 4 | VT; + } }; -/// EmitConvertToTargetMatcherNode - Emit an operation that reads a specified +/// EmitConvertToTargetMatcher - Emit an operation that reads a specified /// recorded node and converts it from being a ISD::Constant to /// ISD::TargetConstant, likewise for ConstantFP. -class EmitConvertToTargetMatcherNode : public MatcherNode { +class EmitConvertToTargetMatcher : public Matcher { unsigned Slot; public: - EmitConvertToTargetMatcherNode(unsigned slot) - : MatcherNode(EmitConvertToTarget), Slot(slot) {} - + EmitConvertToTargetMatcher(unsigned slot) + : Matcher(EmitConvertToTarget), Slot(slot) {} + unsigned getSlot() const { return Slot; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == EmitConvertToTarget; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->Slot == Slot; + } + virtual unsigned getHashImpl() const { return Slot; } }; - -/// EmitMergeInputChainsMatcherNode - Emit a node that merges a list of input + +/// EmitMergeInputChainsMatcher - Emit a node that merges a list of input /// chains together with a token factor. The list of nodes are the nodes in the /// matched pattern that have chain input/outputs. This node adds all input /// chains of these nodes if they are not themselves a node in the pattern. -class EmitMergeInputChainsMatcherNode : public MatcherNode { +class EmitMergeInputChainsMatcher : public Matcher { SmallVector ChainNodes; public: - EmitMergeInputChainsMatcherNode(const unsigned *nodes, unsigned NumNodes) - : MatcherNode(EmitMergeInputChains), ChainNodes(nodes, nodes+NumNodes) {} - + EmitMergeInputChainsMatcher(ArrayRef nodes) + : Matcher(EmitMergeInputChains), ChainNodes(nodes.begin(), nodes.end()) {} + unsigned getNumNodes() const { return ChainNodes.size(); } - + unsigned getNode(unsigned i) const { assert(i < ChainNodes.size()); return ChainNodes[i]; - } - - static inline bool classof(const MatcherNode *N) { + } + + static inline bool classof(const Matcher *N) { return N->getKind() == EmitMergeInputChains; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->ChainNodes == ChainNodes; + } + virtual unsigned getHashImpl() const; }; - -/// EmitCopyToRegMatcherNode - Emit a CopyToReg node from a value to a physreg, -/// pushing the chain and flag results. + +/// EmitCopyToRegMatcher - Emit a CopyToReg node from a value to a physreg, +/// pushing the chain and glue results. /// -class EmitCopyToRegMatcherNode : public MatcherNode { +class EmitCopyToRegMatcher : public Matcher { unsigned SrcSlot; // Value to copy into the physreg. Record *DestPhysReg; public: - EmitCopyToRegMatcherNode(unsigned srcSlot, Record *destPhysReg) - : MatcherNode(EmitCopyToReg), SrcSlot(srcSlot), DestPhysReg(destPhysReg) {} - + EmitCopyToRegMatcher(unsigned srcSlot, Record *destPhysReg) + : Matcher(EmitCopyToReg), SrcSlot(srcSlot), DestPhysReg(destPhysReg) {} + unsigned getSrcSlot() const { return SrcSlot; } Record *getDestPhysReg() const { return DestPhysReg; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == EmitCopyToReg; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->SrcSlot == SrcSlot && + cast(M)->DestPhysReg == DestPhysReg; + } + virtual unsigned getHashImpl() const { + return SrcSlot ^ ((unsigned)(intptr_t)DestPhysReg << 4); + } }; - - - -/// EmitNodeXFormMatcherNode - Emit an operation that runs an SDNodeXForm on a + + + +/// EmitNodeXFormMatcher - Emit an operation that runs an SDNodeXForm on a /// recorded node and records the result. -class EmitNodeXFormMatcherNode : public MatcherNode { +class EmitNodeXFormMatcher : public Matcher { unsigned Slot; Record *NodeXForm; public: - EmitNodeXFormMatcherNode(unsigned slot, Record *nodeXForm) - : MatcherNode(EmitNodeXForm), Slot(slot), NodeXForm(nodeXForm) {} - + EmitNodeXFormMatcher(unsigned slot, Record *nodeXForm) + : Matcher(EmitNodeXForm), Slot(slot), NodeXForm(nodeXForm) {} + unsigned getSlot() const { return Slot; } Record *getNodeXForm() const { return NodeXForm; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == EmitNodeXForm; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->Slot == Slot && + cast(M)->NodeXForm == NodeXForm; + } + virtual unsigned getHashImpl() const { + return Slot ^ ((unsigned)(intptr_t)NodeXForm << 4); + } }; - -/// EmitNodeMatcherNode - This signals a successful match and generates a node. -class EmitNodeMatcherNode : public MatcherNode { + +/// EmitNodeMatcherCommon - Common class shared between EmitNode and +/// MorphNodeTo. +class EmitNodeMatcherCommon : public Matcher { std::string OpcodeName; const SmallVector VTs; const SmallVector Operands; - bool HasChain, HasFlag, HasMemRefs; - + bool HasChain, HasInGlue, HasOutGlue, HasMemRefs; + /// NumFixedArityOperands - If this is a fixed arity node, this is set to -1. /// If this is a varidic node, this is set to the number of fixed arity /// operands in the root of the pattern. The rest are appended to this node. int NumFixedArityOperands; public: - EmitNodeMatcherNode(const std::string &opcodeName, - const MVT::SimpleValueType *vts, unsigned numvts, - const unsigned *operands, unsigned numops, - bool hasChain, bool hasFlag, bool hasmemrefs, - int numfixedarityoperands) - : MatcherNode(EmitNode), OpcodeName(opcodeName), - VTs(vts, vts+numvts), Operands(operands, operands+numops), - HasChain(hasChain), HasFlag(hasFlag), HasMemRefs(hasmemrefs), - NumFixedArityOperands(numfixedarityoperands) {} - + EmitNodeMatcherCommon(const std::string &opcodeName, + ArrayRef vts, + ArrayRef operands, + bool hasChain, bool hasInGlue, bool hasOutGlue, + bool hasmemrefs, + int numfixedarityoperands, bool isMorphNodeTo) + : Matcher(isMorphNodeTo ? MorphNodeTo : EmitNode), OpcodeName(opcodeName), + VTs(vts.begin(), vts.end()), Operands(operands.begin(), operands.end()), + HasChain(hasChain), HasInGlue(hasInGlue), HasOutGlue(hasOutGlue), + HasMemRefs(hasmemrefs), NumFixedArityOperands(numfixedarityoperands) {} + const std::string &getOpcodeName() const { return OpcodeName; } - + unsigned getNumVTs() const { return VTs.size(); } MVT::SimpleValueType getVT(unsigned i) const { assert(i < VTs.size()); return VTs[i]; } - + unsigned getNumOperands() const { return Operands.size(); } unsigned getOperand(unsigned i) const { assert(i < Operands.size()); return Operands[i]; - } - + } + + const SmallVectorImpl &getVTList() const { return VTs; } + const SmallVectorImpl &getOperandList() const { return Operands; } + + bool hasChain() const { return HasChain; } - bool hasFlag() const { return HasFlag; } + bool hasInFlag() const { return HasInGlue; } + bool hasOutFlag() const { return HasOutGlue; } bool hasMemRefs() const { return HasMemRefs; } int getNumFixedArityOperands() const { return NumFixedArityOperands; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { + return N->getKind() == EmitNode || N->getKind() == MorphNodeTo; + } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const; + virtual unsigned getHashImpl() const; +}; + +/// EmitNodeMatcher - This signals a successful match and generates a node. +class EmitNodeMatcher : public EmitNodeMatcherCommon { + virtual void anchor(); + unsigned FirstResultSlot; +public: + EmitNodeMatcher(const std::string &opcodeName, + ArrayRef vts, + ArrayRef operands, + bool hasChain, bool hasInFlag, bool hasOutFlag, + bool hasmemrefs, + int numfixedarityoperands, unsigned firstresultslot) + : EmitNodeMatcherCommon(opcodeName, vts, operands, hasChain, + hasInFlag, hasOutFlag, hasmemrefs, + numfixedarityoperands, false), + FirstResultSlot(firstresultslot) {} + + unsigned getFirstResultSlot() const { return FirstResultSlot; } + + static inline bool classof(const Matcher *N) { return N->getKind() == EmitNode; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; -}; - -/// MarkFlagResultsMatcherNode - This node indicates which non-root nodes in the -/// pattern produce flags. This allows CompleteMatchMatcherNode to update them -/// with the output flag of the resultant code. -class MarkFlagResultsMatcherNode : public MatcherNode { - SmallVector FlagResultNodes; -public: - MarkFlagResultsMatcherNode(const unsigned *nodes, unsigned NumNodes) - : MatcherNode(MarkFlagResults), FlagResultNodes(nodes, nodes+NumNodes) {} - - unsigned getNumNodes() const { return FlagResultNodes.size(); } - + +}; + +class MorphNodeToMatcher : public EmitNodeMatcherCommon { + virtual void anchor(); + const PatternToMatch &Pattern; +public: + MorphNodeToMatcher(const std::string &opcodeName, + ArrayRef vts, + ArrayRef operands, + bool hasChain, bool hasInFlag, bool hasOutFlag, + bool hasmemrefs, + int numfixedarityoperands, const PatternToMatch &pattern) + : EmitNodeMatcherCommon(opcodeName, vts, operands, hasChain, + hasInFlag, hasOutFlag, hasmemrefs, + numfixedarityoperands, true), + Pattern(pattern) { + } + + const PatternToMatch &getPattern() const { return Pattern; } + + static inline bool classof(const Matcher *N) { + return N->getKind() == MorphNodeTo; + } +}; + +/// MarkGlueResultsMatcher - This node indicates which non-root nodes in the +/// pattern produce glue. This allows CompleteMatchMatcher to update them +/// with the output glue of the resultant code. +class MarkGlueResultsMatcher : public Matcher { + SmallVector GlueResultNodes; +public: + MarkGlueResultsMatcher(ArrayRef nodes) + : Matcher(MarkGlueResults), GlueResultNodes(nodes.begin(), nodes.end()) {} + + unsigned getNumNodes() const { return GlueResultNodes.size(); } + unsigned getNode(unsigned i) const { - assert(i < FlagResultNodes.size()); - return FlagResultNodes[i]; - } - - static inline bool classof(const MatcherNode *N) { - return N->getKind() == MarkFlagResults; + assert(i < GlueResultNodes.size()); + return GlueResultNodes[i]; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + + static inline bool classof(const Matcher *N) { + return N->getKind() == MarkGlueResults; + } + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->GlueResultNodes == GlueResultNodes; + } + virtual unsigned getHashImpl() const; }; -/// CompleteMatchMatcherNode - Complete a match by replacing the results of the +/// CompleteMatchMatcher - Complete a match by replacing the results of the /// pattern with the newly generated nodes. This also prints a comment /// indicating the source and dest patterns. -class CompleteMatchMatcherNode : public MatcherNode { +class CompleteMatchMatcher : public Matcher { SmallVector Results; const PatternToMatch &Pattern; public: - CompleteMatchMatcherNode(const unsigned *results, unsigned numresults, - const PatternToMatch &pattern) - : MatcherNode(CompleteMatch), Results(results, results+numresults), + CompleteMatchMatcher(ArrayRef results, + const PatternToMatch &pattern) + : Matcher(CompleteMatch), Results(results.begin(), results.end()), Pattern(pattern) {} unsigned getNumResults() const { return Results.size(); } unsigned getResult(unsigned R) const { return Results[R]; } const PatternToMatch &getPattern() const { return Pattern; } - - static inline bool classof(const MatcherNode *N) { + + static inline bool classof(const Matcher *N) { return N->getKind() == CompleteMatch; } - - virtual void print(raw_ostream &OS, unsigned indent = 0) const; + +private: + virtual void printImpl(raw_ostream &OS, unsigned indent) const; + virtual bool isEqualImpl(const Matcher *M) const { + return cast(M)->Results == Results && + &cast(M)->Pattern == &Pattern; + } + virtual unsigned getHashImpl() const; }; - - + } // end namespace llvm #endif