2005-09-03 01:14:03 +00:00
|
|
|
//===- DAGISelEmitter.h - Generate an instruction selector ------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file was developed by Chris Lattner and is distributed under
|
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This tablegen backend emits a DAG instruction selector.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef DAGISEL_EMITTER_H
|
|
|
|
#define DAGISEL_EMITTER_H
|
|
|
|
|
|
|
|
#include "TableGenBackend.h"
|
|
|
|
#include "CodeGenTarget.h"
|
|
|
|
|
|
|
|
namespace llvm {
|
2005-09-07 23:44:43 +00:00
|
|
|
class Record;
|
2005-09-10 02:00:02 +00:00
|
|
|
struct Init;
|
2005-09-07 23:44:43 +00:00
|
|
|
class DagInit;
|
Implement a complete type inference system for dag patterns, based on the
constraints defined in the DAG node definitions in the .td files. This
allows us to infer (and check!) the types for all nodes in the current
ppc .td file. For example, instead of:
Inst pattern EQV: (set GPRC:i32:$rT, (xor (xor GPRC:i32:$rA, GPRC:i32:$rB), (imm)<<Predicate_immAllOnes>>))
we now fully infer:
Inst pattern EQV: (set:void GPRC:i32:$rT, (xor:i32 (xor:i32 GPRC:i32:$rA, GPRC:i32:$rB), (imm:i32)<<Predicate_immAllOnes>>))
from: (set GPRC:$rT, (not (xor GPRC:$rA, GPRC:$rB)))
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23284 91177308-0d34-0410-b5e6-96231b3b80d8
2005-09-08 23:22:48 +00:00
|
|
|
class SDNodeInfo;
|
2005-09-07 23:44:43 +00:00
|
|
|
class TreePattern;
|
Implement a complete type inference system for dag patterns, based on the
constraints defined in the DAG node definitions in the .td files. This
allows us to infer (and check!) the types for all nodes in the current
ppc .td file. For example, instead of:
Inst pattern EQV: (set GPRC:i32:$rT, (xor (xor GPRC:i32:$rA, GPRC:i32:$rB), (imm)<<Predicate_immAllOnes>>))
we now fully infer:
Inst pattern EQV: (set:void GPRC:i32:$rT, (xor:i32 (xor:i32 GPRC:i32:$rA, GPRC:i32:$rB), (imm:i32)<<Predicate_immAllOnes>>))
from: (set GPRC:$rT, (not (xor GPRC:$rA, GPRC:$rB)))
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23284 91177308-0d34-0410-b5e6-96231b3b80d8
2005-09-08 23:22:48 +00:00
|
|
|
class TreePatternNode;
|
2005-09-07 23:44:43 +00:00
|
|
|
class DAGISelEmitter;
|
2005-09-08 21:03:01 +00:00
|
|
|
|
2005-09-08 21:27:15 +00:00
|
|
|
/// SDTypeConstraint - This is a discriminated union of constraints,
|
|
|
|
/// corresponding to the SDTypeConstraint tablegen class in Target.td.
|
|
|
|
struct SDTypeConstraint {
|
|
|
|
SDTypeConstraint(Record *R);
|
|
|
|
|
|
|
|
unsigned OperandNo; // The operand # this constraint applies to.
|
|
|
|
enum {
|
|
|
|
SDTCisVT, SDTCisInt, SDTCisFP, SDTCisSameAs, SDTCisVTSmallerThanOp
|
|
|
|
} ConstraintType;
|
|
|
|
|
|
|
|
union { // The discriminated union.
|
|
|
|
struct {
|
|
|
|
MVT::ValueType VT;
|
|
|
|
} SDTCisVT_Info;
|
|
|
|
struct {
|
|
|
|
unsigned OtherOperandNum;
|
|
|
|
} SDTCisSameAs_Info;
|
|
|
|
struct {
|
|
|
|
unsigned OtherOperandNum;
|
|
|
|
} SDTCisVTSmallerThanOp_Info;
|
|
|
|
} x;
|
Implement a complete type inference system for dag patterns, based on the
constraints defined in the DAG node definitions in the .td files. This
allows us to infer (and check!) the types for all nodes in the current
ppc .td file. For example, instead of:
Inst pattern EQV: (set GPRC:i32:$rT, (xor (xor GPRC:i32:$rA, GPRC:i32:$rB), (imm)<<Predicate_immAllOnes>>))
we now fully infer:
Inst pattern EQV: (set:void GPRC:i32:$rT, (xor:i32 (xor:i32 GPRC:i32:$rA, GPRC:i32:$rB), (imm:i32)<<Predicate_immAllOnes>>))
from: (set GPRC:$rT, (not (xor GPRC:$rA, GPRC:$rB)))
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23284 91177308-0d34-0410-b5e6-96231b3b80d8
2005-09-08 23:22:48 +00:00
|
|
|
|
|
|
|
/// ApplyTypeConstraint - Given a node in a pattern, apply this type
|
|
|
|
/// constraint to the nodes operands. This returns true if it makes a
|
|
|
|
/// change, false otherwise. If a type contradiction is found, throw an
|
|
|
|
/// exception.
|
|
|
|
bool ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo,
|
|
|
|
TreePattern &TP) const;
|
|
|
|
|
|
|
|
/// getOperandNum - Return the node corresponding to operand #OpNo in tree
|
|
|
|
/// N, which has NumResults results.
|
|
|
|
TreePatternNode *getOperandNum(unsigned OpNo, TreePatternNode *N,
|
|
|
|
unsigned NumResults) const;
|
2005-09-08 21:27:15 +00:00
|
|
|
};
|
|
|
|
|
2005-09-08 21:03:01 +00:00
|
|
|
/// SDNodeInfo - One of these records is created for each SDNode instance in
|
|
|
|
/// the target .td file. This represents the various dag nodes we will be
|
|
|
|
/// processing.
|
|
|
|
class SDNodeInfo {
|
|
|
|
Record *Def;
|
|
|
|
std::string EnumName;
|
|
|
|
std::string SDClassName;
|
Implement a complete type inference system for dag patterns, based on the
constraints defined in the DAG node definitions in the .td files. This
allows us to infer (and check!) the types for all nodes in the current
ppc .td file. For example, instead of:
Inst pattern EQV: (set GPRC:i32:$rT, (xor (xor GPRC:i32:$rA, GPRC:i32:$rB), (imm)<<Predicate_immAllOnes>>))
we now fully infer:
Inst pattern EQV: (set:void GPRC:i32:$rT, (xor:i32 (xor:i32 GPRC:i32:$rA, GPRC:i32:$rB), (imm:i32)<<Predicate_immAllOnes>>))
from: (set GPRC:$rT, (not (xor GPRC:$rA, GPRC:$rB)))
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23284 91177308-0d34-0410-b5e6-96231b3b80d8
2005-09-08 23:22:48 +00:00
|
|
|
unsigned NumResults;
|
|
|
|
int NumOperands;
|
2005-09-08 21:27:15 +00:00
|
|
|
std::vector<SDTypeConstraint> TypeConstraints;
|
2005-09-08 21:03:01 +00:00
|
|
|
public:
|
|
|
|
SDNodeInfo(Record *R); // Parse the specified record.
|
|
|
|
|
Implement a complete type inference system for dag patterns, based on the
constraints defined in the DAG node definitions in the .td files. This
allows us to infer (and check!) the types for all nodes in the current
ppc .td file. For example, instead of:
Inst pattern EQV: (set GPRC:i32:$rT, (xor (xor GPRC:i32:$rA, GPRC:i32:$rB), (imm)<<Predicate_immAllOnes>>))
we now fully infer:
Inst pattern EQV: (set:void GPRC:i32:$rT, (xor:i32 (xor:i32 GPRC:i32:$rA, GPRC:i32:$rB), (imm:i32)<<Predicate_immAllOnes>>))
from: (set GPRC:$rT, (not (xor GPRC:$rA, GPRC:$rB)))
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23284 91177308-0d34-0410-b5e6-96231b3b80d8
2005-09-08 23:22:48 +00:00
|
|
|
unsigned getNumResults() const { return NumResults; }
|
2005-09-08 21:27:15 +00:00
|
|
|
int getNumOperands() const { return NumOperands; }
|
2005-09-08 21:03:01 +00:00
|
|
|
Record *getRecord() const { return Def; }
|
|
|
|
const std::string &getEnumName() const { return EnumName; }
|
|
|
|
const std::string &getSDClassName() const { return SDClassName; }
|
2005-09-08 21:27:15 +00:00
|
|
|
|
Implement a complete type inference system for dag patterns, based on the
constraints defined in the DAG node definitions in the .td files. This
allows us to infer (and check!) the types for all nodes in the current
ppc .td file. For example, instead of:
Inst pattern EQV: (set GPRC:i32:$rT, (xor (xor GPRC:i32:$rA, GPRC:i32:$rB), (imm)<<Predicate_immAllOnes>>))
we now fully infer:
Inst pattern EQV: (set:void GPRC:i32:$rT, (xor:i32 (xor:i32 GPRC:i32:$rA, GPRC:i32:$rB), (imm:i32)<<Predicate_immAllOnes>>))
from: (set GPRC:$rT, (not (xor GPRC:$rA, GPRC:$rB)))
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23284 91177308-0d34-0410-b5e6-96231b3b80d8
2005-09-08 23:22:48 +00:00
|
|
|
const std::vector<SDTypeConstraint> &getTypeConstraints() const {
|
2005-09-08 21:27:15 +00:00
|
|
|
return TypeConstraints;
|
|
|
|
}
|
Implement a complete type inference system for dag patterns, based on the
constraints defined in the DAG node definitions in the .td files. This
allows us to infer (and check!) the types for all nodes in the current
ppc .td file. For example, instead of:
Inst pattern EQV: (set GPRC:i32:$rT, (xor (xor GPRC:i32:$rA, GPRC:i32:$rB), (imm)<<Predicate_immAllOnes>>))
we now fully infer:
Inst pattern EQV: (set:void GPRC:i32:$rT, (xor:i32 (xor:i32 GPRC:i32:$rA, GPRC:i32:$rB), (imm:i32)<<Predicate_immAllOnes>>))
from: (set GPRC:$rT, (not (xor GPRC:$rA, GPRC:$rB)))
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23284 91177308-0d34-0410-b5e6-96231b3b80d8
2005-09-08 23:22:48 +00:00
|
|
|
|
|
|
|
/// ApplyTypeConstraints - Given a node in a pattern, apply the type
|
|
|
|
/// constraints for this node to the operands of the node. This returns
|
|
|
|
/// true if it makes a change, false otherwise. If a type contradiction is
|
|
|
|
/// found, throw an exception.
|
|
|
|
bool ApplyTypeConstraints(TreePatternNode *N, TreePattern &TP) const {
|
|
|
|
bool MadeChange = false;
|
|
|
|
for (unsigned i = 0, e = TypeConstraints.size(); i != e; ++i)
|
|
|
|
MadeChange |= TypeConstraints[i].ApplyTypeConstraint(N, *this, TP);
|
|
|
|
return MadeChange;
|
|
|
|
}
|
2005-09-08 21:03:01 +00:00
|
|
|
};
|
2005-09-03 01:14:03 +00:00
|
|
|
|
2005-09-07 23:44:43 +00:00
|
|
|
/// FIXME: TreePatternNode's can be shared in some cases (due to dag-shaped
|
|
|
|
/// patterns), and as such should be ref counted. We currently just leak all
|
|
|
|
/// TreePatternNode objects!
|
|
|
|
class TreePatternNode {
|
|
|
|
/// The inferred type for this node, or MVT::LAST_VALUETYPE if it hasn't
|
|
|
|
/// been determined yet.
|
|
|
|
MVT::ValueType Ty;
|
|
|
|
|
|
|
|
/// Operator - The Record for the operator if this is an interior node (not
|
|
|
|
/// a leaf).
|
|
|
|
Record *Operator;
|
|
|
|
|
|
|
|
/// Val - The init value (e.g. the "GPRC" record, or "7") for a leaf.
|
|
|
|
///
|
|
|
|
Init *Val;
|
|
|
|
|
|
|
|
/// Name - The name given to this node with the :$foo notation.
|
|
|
|
///
|
|
|
|
std::string Name;
|
|
|
|
|
|
|
|
/// PredicateFn - The predicate function to execute on this node to check
|
|
|
|
/// for a match. If this string is empty, no predicate is involved.
|
|
|
|
std::string PredicateFn;
|
|
|
|
|
2005-09-13 21:51:00 +00:00
|
|
|
/// TransformFn - The transformation function to execute on this node before
|
|
|
|
/// it can be substituted into the resulting instruction on a pattern match.
|
|
|
|
std::string TransformFn;
|
|
|
|
|
2005-09-07 23:44:43 +00:00
|
|
|
std::vector<TreePatternNode*> Children;
|
|
|
|
public:
|
|
|
|
TreePatternNode(Record *Op, const std::vector<TreePatternNode*> &Ch)
|
|
|
|
: Ty(MVT::LAST_VALUETYPE), Operator(Op), Val(0), Children(Ch) {}
|
|
|
|
TreePatternNode(Init *val) // leaf ctor
|
|
|
|
: Ty(MVT::LAST_VALUETYPE), Operator(0), Val(val) {}
|
|
|
|
~TreePatternNode();
|
|
|
|
|
|
|
|
const std::string &getName() const { return Name; }
|
|
|
|
void setName(const std::string &N) { Name = N; }
|
|
|
|
|
|
|
|
bool isLeaf() const { return Val != 0; }
|
Implement a complete type inference system for dag patterns, based on the
constraints defined in the DAG node definitions in the .td files. This
allows us to infer (and check!) the types for all nodes in the current
ppc .td file. For example, instead of:
Inst pattern EQV: (set GPRC:i32:$rT, (xor (xor GPRC:i32:$rA, GPRC:i32:$rB), (imm)<<Predicate_immAllOnes>>))
we now fully infer:
Inst pattern EQV: (set:void GPRC:i32:$rT, (xor:i32 (xor:i32 GPRC:i32:$rA, GPRC:i32:$rB), (imm:i32)<<Predicate_immAllOnes>>))
from: (set GPRC:$rT, (not (xor GPRC:$rA, GPRC:$rB)))
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23284 91177308-0d34-0410-b5e6-96231b3b80d8
2005-09-08 23:22:48 +00:00
|
|
|
bool hasTypeSet() const { return Ty != MVT::LAST_VALUETYPE; }
|
2005-09-07 23:44:43 +00:00
|
|
|
MVT::ValueType getType() const { return Ty; }
|
|
|
|
void setType(MVT::ValueType VT) { Ty = VT; }
|
|
|
|
|
|
|
|
Init *getLeafValue() const { assert(isLeaf()); return Val; }
|
|
|
|
Record *getOperator() const { assert(!isLeaf()); return Operator; }
|
|
|
|
|
|
|
|
unsigned getNumChildren() const { return Children.size(); }
|
|
|
|
TreePatternNode *getChild(unsigned N) const { return Children[N]; }
|
|
|
|
void setChild(unsigned i, TreePatternNode *N) {
|
|
|
|
Children[i] = N;
|
|
|
|
}
|
|
|
|
|
|
|
|
const std::string &getPredicateFn() const { return PredicateFn; }
|
|
|
|
void setPredicateFn(const std::string &Fn) { PredicateFn = Fn; }
|
2005-09-13 21:51:00 +00:00
|
|
|
|
|
|
|
const std::string &getTransformFn() const { return TransformFn; }
|
|
|
|
void setTransformFn(const std::string &Fn) { TransformFn = Fn; }
|
2005-09-07 23:44:43 +00:00
|
|
|
|
|
|
|
void print(std::ostream &OS) const;
|
|
|
|
void dump() const;
|
|
|
|
|
|
|
|
public: // Higher level manipulation routines.
|
|
|
|
|
|
|
|
/// clone - Return a new copy of this tree.
|
|
|
|
///
|
|
|
|
TreePatternNode *clone() const;
|
|
|
|
|
Implement a complete type inference system for dag patterns, based on the
constraints defined in the DAG node definitions in the .td files. This
allows us to infer (and check!) the types for all nodes in the current
ppc .td file. For example, instead of:
Inst pattern EQV: (set GPRC:i32:$rT, (xor (xor GPRC:i32:$rA, GPRC:i32:$rB), (imm)<<Predicate_immAllOnes>>))
we now fully infer:
Inst pattern EQV: (set:void GPRC:i32:$rT, (xor:i32 (xor:i32 GPRC:i32:$rA, GPRC:i32:$rB), (imm:i32)<<Predicate_immAllOnes>>))
from: (set GPRC:$rT, (not (xor GPRC:$rA, GPRC:$rB)))
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23284 91177308-0d34-0410-b5e6-96231b3b80d8
2005-09-08 23:22:48 +00:00
|
|
|
/// SubstituteFormalArguments - Replace the formal arguments in this tree
|
|
|
|
/// with actual values specified by ArgMap.
|
2005-09-07 23:44:43 +00:00
|
|
|
void SubstituteFormalArguments(std::map<std::string,
|
|
|
|
TreePatternNode*> &ArgMap);
|
|
|
|
|
|
|
|
/// InlinePatternFragments - If this pattern refers to any pattern
|
|
|
|
/// fragments, inline them into place, giving us a pattern without any
|
|
|
|
/// PatFrag references.
|
|
|
|
TreePatternNode *InlinePatternFragments(TreePattern &TP);
|
Implement a complete type inference system for dag patterns, based on the
constraints defined in the DAG node definitions in the .td files. This
allows us to infer (and check!) the types for all nodes in the current
ppc .td file. For example, instead of:
Inst pattern EQV: (set GPRC:i32:$rT, (xor (xor GPRC:i32:$rA, GPRC:i32:$rB), (imm)<<Predicate_immAllOnes>>))
we now fully infer:
Inst pattern EQV: (set:void GPRC:i32:$rT, (xor:i32 (xor:i32 GPRC:i32:$rA, GPRC:i32:$rB), (imm:i32)<<Predicate_immAllOnes>>))
from: (set GPRC:$rT, (not (xor GPRC:$rA, GPRC:$rB)))
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23284 91177308-0d34-0410-b5e6-96231b3b80d8
2005-09-08 23:22:48 +00:00
|
|
|
|
|
|
|
/// ApplyTypeConstraints - Apply all of the type constraints relevent to
|
|
|
|
/// this node and its children in the tree. This returns true if it makes a
|
|
|
|
/// change, false otherwise. If a type contradiction is found, throw an
|
|
|
|
/// exception.
|
|
|
|
bool ApplyTypeConstraints(TreePattern &TP);
|
|
|
|
|
|
|
|
/// UpdateNodeType - Set the node type of N to VT if VT contains
|
|
|
|
/// information. If N already contains a conflicting type, then throw an
|
|
|
|
/// exception. This returns true if any information was updated.
|
|
|
|
///
|
|
|
|
bool UpdateNodeType(MVT::ValueType VT, TreePattern &TP);
|
|
|
|
|
|
|
|
/// ContainsUnresolvedType - Return true if this tree contains any
|
|
|
|
/// unresolved types.
|
|
|
|
bool ContainsUnresolvedType() const {
|
|
|
|
if (Ty == MVT::LAST_VALUETYPE) return true;
|
|
|
|
for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
|
|
|
|
if (getChild(i)->ContainsUnresolvedType()) return true;
|
|
|
|
return false;
|
|
|
|
}
|
2005-09-07 23:44:43 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
2005-09-13 21:20:49 +00:00
|
|
|
/// TreePattern - Represent a pattern, used for instructions, pattern
|
|
|
|
/// fragments, etc.
|
2005-09-07 23:44:43 +00:00
|
|
|
///
|
|
|
|
class TreePattern {
|
|
|
|
/// Trees - The list of pattern trees which corresponds to this pattern.
|
|
|
|
/// Note that PatFrag's only have a single tree.
|
|
|
|
///
|
|
|
|
std::vector<TreePatternNode*> Trees;
|
|
|
|
|
|
|
|
/// TheRecord - The actual TableGen record corresponding to this pattern.
|
|
|
|
///
|
|
|
|
Record *TheRecord;
|
|
|
|
|
|
|
|
/// Args - This is a list of all of the arguments to this pattern (for
|
|
|
|
/// PatFrag patterns), which are the 'node' markers in this pattern.
|
|
|
|
std::vector<std::string> Args;
|
|
|
|
|
|
|
|
/// ISE - the DAG isel emitter coordinating this madness.
|
|
|
|
///
|
|
|
|
DAGISelEmitter &ISE;
|
|
|
|
public:
|
|
|
|
|
|
|
|
/// TreePattern constructor - Parse the specified DagInits into the
|
|
|
|
/// current record.
|
2005-09-13 21:20:49 +00:00
|
|
|
TreePattern(Record *TheRec,
|
2005-09-07 23:44:43 +00:00
|
|
|
const std::vector<DagInit *> &RawPat, DAGISelEmitter &ise);
|
|
|
|
|
|
|
|
/// getTrees - Return the tree patterns which corresponds to this pattern.
|
|
|
|
///
|
|
|
|
const std::vector<TreePatternNode*> &getTrees() const { return Trees; }
|
2005-09-09 01:11:17 +00:00
|
|
|
unsigned getNumTrees() const { return Trees.size(); }
|
|
|
|
TreePatternNode *getTree(unsigned i) const { return Trees[i]; }
|
2005-09-09 01:15:01 +00:00
|
|
|
TreePatternNode *getOnlyTree() const {
|
|
|
|
assert(Trees.size() == 1 && "Doesn't have exactly one pattern!");
|
|
|
|
return Trees[0];
|
|
|
|
}
|
2005-09-07 23:44:43 +00:00
|
|
|
|
|
|
|
/// getRecord - Return the actual TableGen record corresponding to this
|
|
|
|
/// pattern.
|
|
|
|
///
|
|
|
|
Record *getRecord() const { return TheRecord; }
|
|
|
|
|
|
|
|
unsigned getNumArgs() const { return Args.size(); }
|
|
|
|
const std::string &getArgName(unsigned i) const {
|
|
|
|
assert(i < Args.size() && "Argument reference out of range!");
|
|
|
|
return Args[i];
|
|
|
|
}
|
2005-09-13 21:20:49 +00:00
|
|
|
std::vector<std::string> &getArgList() { return Args; }
|
2005-09-07 23:44:43 +00:00
|
|
|
|
|
|
|
DAGISelEmitter &getDAGISelEmitter() const { return ISE; }
|
|
|
|
|
|
|
|
/// InlinePatternFragments - If this pattern refers to any pattern
|
|
|
|
/// fragments, inline them into place, giving us a pattern without any
|
|
|
|
/// PatFrag references.
|
|
|
|
void InlinePatternFragments() {
|
|
|
|
for (unsigned i = 0, e = Trees.size(); i != e; ++i)
|
|
|
|
Trees[i] = Trees[i]->InlinePatternFragments(*this);
|
|
|
|
}
|
|
|
|
|
Implement a complete type inference system for dag patterns, based on the
constraints defined in the DAG node definitions in the .td files. This
allows us to infer (and check!) the types for all nodes in the current
ppc .td file. For example, instead of:
Inst pattern EQV: (set GPRC:i32:$rT, (xor (xor GPRC:i32:$rA, GPRC:i32:$rB), (imm)<<Predicate_immAllOnes>>))
we now fully infer:
Inst pattern EQV: (set:void GPRC:i32:$rT, (xor:i32 (xor:i32 GPRC:i32:$rA, GPRC:i32:$rB), (imm:i32)<<Predicate_immAllOnes>>))
from: (set GPRC:$rT, (not (xor GPRC:$rA, GPRC:$rB)))
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23284 91177308-0d34-0410-b5e6-96231b3b80d8
2005-09-08 23:22:48 +00:00
|
|
|
/// InferAllTypes - Infer/propagate as many types throughout the expression
|
|
|
|
/// patterns as possible. Return true if all types are infered, false
|
|
|
|
/// otherwise. Throw an exception if a type contradiction is found.
|
|
|
|
bool InferAllTypes();
|
|
|
|
|
2005-09-07 23:44:43 +00:00
|
|
|
/// error - Throw an exception, prefixing it with information about this
|
|
|
|
/// pattern.
|
|
|
|
void error(const std::string &Msg) const;
|
|
|
|
|
|
|
|
void print(std::ostream &OS) const;
|
|
|
|
void dump() const;
|
|
|
|
|
|
|
|
private:
|
|
|
|
MVT::ValueType getIntrinsicType(Record *R) const;
|
|
|
|
TreePatternNode *ParseTreePattern(DagInit *DI);
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-09-03 01:14:03 +00:00
|
|
|
/// InstrSelectorEmitter - The top-level class which coordinates construction
|
|
|
|
/// and emission of the instruction selector.
|
|
|
|
///
|
|
|
|
class DAGISelEmitter : public TableGenBackend {
|
|
|
|
RecordKeeper &Records;
|
|
|
|
CodeGenTarget Target;
|
|
|
|
|
2005-09-08 21:03:01 +00:00
|
|
|
std::map<Record*, SDNodeInfo> SDNodes;
|
2005-09-13 21:51:00 +00:00
|
|
|
std::map<Record*, std::pair<Record*, std::string> > SDNodeXForms;
|
2005-09-07 23:44:43 +00:00
|
|
|
std::map<Record*, TreePattern*> PatternFragments;
|
|
|
|
std::vector<TreePattern*> Instructions;
|
2005-09-03 01:14:03 +00:00
|
|
|
public:
|
|
|
|
DAGISelEmitter(RecordKeeper &R) : Records(R) {}
|
|
|
|
|
|
|
|
// run - Output the isel, returning true on failure.
|
2005-09-07 23:44:43 +00:00
|
|
|
void run(std::ostream &OS);
|
2005-09-08 21:03:01 +00:00
|
|
|
|
|
|
|
const SDNodeInfo &getSDNodeInfo(Record *R) const {
|
|
|
|
assert(SDNodes.count(R) && "Unknown node!");
|
|
|
|
return SDNodes.find(R)->second;
|
|
|
|
}
|
2005-09-07 23:44:43 +00:00
|
|
|
|
|
|
|
TreePattern *getPatternFragment(Record *R) const {
|
|
|
|
assert(PatternFragments.count(R) && "Invalid pattern fragment request!");
|
|
|
|
return PatternFragments.find(R)->second;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2005-09-08 21:03:01 +00:00
|
|
|
void ParseNodeInfo();
|
2005-09-13 21:51:00 +00:00
|
|
|
void ParseNodeTransforms(std::ostream &OS);
|
2005-09-07 23:44:43 +00:00
|
|
|
void ParseAndResolvePatternFragments(std::ostream &OS);
|
|
|
|
void ParseAndResolveInstructions();
|
|
|
|
void EmitInstructionSelector(std::ostream &OS);
|
2005-09-03 01:14:03 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
} // End llvm namespace
|
|
|
|
|
|
|
|
#endif
|