return Result;
}
-/// isExtIntegerVT - Return true if the specified extended value type is
-/// integer, or isInt.
-static bool isExtIntegerVT(unsigned char VT) {
- return VT == MVT::isInt ||
- (VT < MVT::LAST_VALUETYPE && MVT::isInteger((MVT::ValueType)VT));
+template<typename T>
+static std::vector<unsigned char>
+FilterEVTs(const std::vector<unsigned char> &InVTs, T Filter) {
+ std::vector<unsigned char> Result;
+ for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
+ if (Filter((MVT::ValueType)InVTs[i]))
+ Result.push_back(InVTs[i]);
+ return Result;
+}
+
+static std::vector<unsigned char>
+ConvertVTs(const std::vector<MVT::ValueType> &InVTs) {
+ std::vector<unsigned char> Result;
+ for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
+ Result.push_back(InVTs[i]);
+ return Result;
}
-/// isExtFloatingPointVT - Return true if the specified extended value type is
-/// floating point, or isFP.
-static bool isExtFloatingPointVT(unsigned char VT) {
- return VT == MVT::isFP ||
- (VT < MVT::LAST_VALUETYPE && MVT::isFloatingPoint((MVT::ValueType)VT));
+static bool LHSIsSubsetOfRHS(const std::vector<unsigned char> &LHS,
+ const std::vector<unsigned char> &RHS) {
+ if (LHS.size() > RHS.size()) return false;
+ for (unsigned i = 0, e = LHS.size(); i != e; ++i)
+ if (std::find(RHS.begin(), RHS.end(), LHS[i]) == RHS.end())
+ return false;
+ return true;
+}
+
+/// isExtIntegerVT - Return true if the specified extended value type vector
+/// contains isInt or an integer value type.
+static bool isExtIntegerInVTs(const std::vector<unsigned char> &EVTs) {
+ assert(!EVTs.empty() && "Cannot check for integer in empty ExtVT list!");
+ return EVTs[0] == MVT::isInt || !(FilterEVTs(EVTs, MVT::isInteger).empty());
+}
+
+/// isExtFloatingPointVT - Return true if the specified extended value type
+/// vector contains isFP or a FP value type.
+static bool isExtFloatingPointInVTs(const std::vector<unsigned char> &EVTs) {
+ assert(!EVTs.empty() && "Cannot check for integer in empty ExtVT list!");
+ return EVTs[0] == MVT::isFP ||
+ !(FilterEVTs(EVTs, MVT::isFloatingPoint).empty());
}
//===----------------------------------------------------------------------===//
ConstraintType = SDTCisOpSmallerThanOp;
x.SDTCisOpSmallerThanOp_Info.BigOperandNum =
R->getValueAsInt("BigOperandNum");
+ } else if (R->isSubClassOf("SDTCisIntVectorOfSameSize")) {
+ ConstraintType = SDTCisIntVectorOfSameSize;
+ x.SDTCisIntVectorOfSameSize_Info.OtherOperandNum =
+ R->getValueAsInt("OtherOpNum");
} else {
std::cerr << "Unrecognized SDTypeConstraint '" << R->getName() << "'!\n";
exit(1);
case SDTCisSameAs: {
TreePatternNode *OtherNode =
getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NumResults);
- return NodeToApply->UpdateNodeType(OtherNode->getExtType(), TP) |
- OtherNode->UpdateNodeType(NodeToApply->getExtType(), TP);
+ return NodeToApply->UpdateNodeType(OtherNode->getExtTypes(), TP) |
+ OtherNode->UpdateNodeType(NodeToApply->getExtTypes(), TP);
}
case SDTCisVTSmallerThanOp: {
// The NodeToApply must be a leaf node that is a VT. OtherOperandNum must
bool MadeChange = false;
MadeChange |= OtherNode->UpdateNodeType(MVT::isInt, TP);
- if (OtherNode->hasTypeSet() && OtherNode->getType() <= VT)
+ // This code only handles nodes that have one type set. Assert here so
+ // that we can change this if we ever need to deal with multiple value
+ // types at this point.
+ assert(OtherNode->getExtTypes().size() == 1 && "Node has too many types!");
+ if (OtherNode->hasTypeSet() && OtherNode->getTypeNum(0) <= VT)
OtherNode->UpdateNodeType(MVT::Other, TP); // Throw an error.
return false;
}
// Both operands must be integer or FP, but we don't care which.
bool MadeChange = false;
- if (isExtIntegerVT(NodeToApply->getExtType()))
+ // This code does not currently handle nodes which have multiple types,
+ // where some types are integer, and some are fp. Assert that this is not
+ // the case.
+ assert(!(isExtIntegerInVTs(NodeToApply->getExtTypes()) &&
+ isExtFloatingPointInVTs(NodeToApply->getExtTypes())) &&
+ !(isExtIntegerInVTs(BigOperand->getExtTypes()) &&
+ isExtFloatingPointInVTs(BigOperand->getExtTypes())) &&
+ "SDTCisOpSmallerThanOp does not handle mixed int/fp types!");
+ if (isExtIntegerInVTs(NodeToApply->getExtTypes()))
MadeChange |= BigOperand->UpdateNodeType(MVT::isInt, TP);
- else if (isExtFloatingPointVT(NodeToApply->getExtType()))
+ else if (isExtFloatingPointInVTs(NodeToApply->getExtTypes()))
MadeChange |= BigOperand->UpdateNodeType(MVT::isFP, TP);
- if (isExtIntegerVT(BigOperand->getExtType()))
+ if (isExtIntegerInVTs(BigOperand->getExtTypes()))
MadeChange |= NodeToApply->UpdateNodeType(MVT::isInt, TP);
- else if (isExtFloatingPointVT(BigOperand->getExtType()))
+ else if (isExtFloatingPointInVTs(BigOperand->getExtTypes()))
MadeChange |= NodeToApply->UpdateNodeType(MVT::isFP, TP);
std::vector<MVT::ValueType> VTs = CGT.getLegalValueTypes();
- if (isExtIntegerVT(NodeToApply->getExtType())) {
+ if (isExtIntegerInVTs(NodeToApply->getExtTypes())) {
VTs = FilterVTs(VTs, MVT::isInteger);
- } else if (isExtFloatingPointVT(NodeToApply->getExtType())) {
+ } else if (isExtFloatingPointInVTs(NodeToApply->getExtTypes())) {
VTs = FilterVTs(VTs, MVT::isFloatingPoint);
} else {
VTs.clear();
}
return MadeChange;
}
+ case SDTCisIntVectorOfSameSize: {
+ TreePatternNode *OtherOperand =
+ getOperandNum(x.SDTCisIntVectorOfSameSize_Info.OtherOperandNum,
+ N, NumResults);
+ if (OtherOperand->hasTypeSet()) {
+ if (!MVT::isVector(OtherOperand->getTypeNum(0)))
+ TP.error(N->getOperator()->getName() + " VT operand must be a vector!");
+ MVT::ValueType IVT = OtherOperand->getTypeNum(0);
+ IVT = MVT::getIntVectorWithNumElements(MVT::getVectorNumElements(IVT));
+ return NodeToApply->UpdateNodeType(IVT, TP);
+ }
+ return false;
+ }
}
return false;
}
Properties |= 1 << SDNPAssociative;
} else if (PropList[i]->getName() == "SDNPHasChain") {
Properties |= 1 << SDNPHasChain;
+ } else if (PropList[i]->getName() == "SDNPOutFlag") {
+ Properties |= 1 << SDNPOutFlag;
+ } else if (PropList[i]->getName() == "SDNPInFlag") {
+ Properties |= 1 << SDNPInFlag;
+ } else if (PropList[i]->getName() == "SDNPOptInFlag") {
+ Properties |= 1 << SDNPOptInFlag;
} else {
std::cerr << "Unknown SD Node property '" << PropList[i]->getName()
<< "' on node '" << R->getName() << "'!\n";
/// information. If N already contains a conflicting type, then throw an
/// exception. This returns true if any information was updated.
///
-bool TreePatternNode::UpdateNodeType(unsigned char VT, TreePattern &TP) {
- if (VT == MVT::isUnknown || getExtType() == VT) return false;
- if (getExtType() == MVT::isUnknown) {
- setType(VT);
+bool TreePatternNode::UpdateNodeType(const std::vector<unsigned char> &ExtVTs,
+ TreePattern &TP) {
+ assert(!ExtVTs.empty() && "Cannot update node type with empty type vector!");
+
+ if (ExtVTs[0] == MVT::isUnknown || LHSIsSubsetOfRHS(getExtTypes(), ExtVTs))
+ return false;
+ if (isTypeCompletelyUnknown() || LHSIsSubsetOfRHS(ExtVTs, getExtTypes())) {
+ setTypes(ExtVTs);
return true;
}
- // If we are told this is to be an int or FP type, and it already is, ignore
- // the advice.
- if ((VT == MVT::isInt && isExtIntegerVT(getExtType())) ||
- (VT == MVT::isFP && isExtFloatingPointVT(getExtType())))
- return false;
+ if (ExtVTs[0] == MVT::isInt && isExtIntegerInVTs(getExtTypes())) {
+ assert(hasTypeSet() && "should be handled above!");
+ std::vector<unsigned char> FVTs = FilterEVTs(getExtTypes(), MVT::isInteger);
+ if (getExtTypes() == FVTs)
+ return false;
+ setTypes(FVTs);
+ return true;
+ }
+ if (ExtVTs[0] == MVT::isFP && isExtFloatingPointInVTs(getExtTypes())) {
+ assert(hasTypeSet() && "should be handled above!");
+ std::vector<unsigned char> FVTs =
+ FilterEVTs(getExtTypes(), MVT::isFloatingPoint);
+ if (getExtTypes() == FVTs)
+ return false;
+ setTypes(FVTs);
+ return true;
+ }
// If we know this is an int or fp type, and we are told it is a specific one,
// take the advice.
- if ((getExtType() == MVT::isInt && isExtIntegerVT(VT)) ||
- (getExtType() == MVT::isFP && isExtFloatingPointVT(VT))) {
- setType(VT);
+ //
+ // Similarly, we should probably set the type here to the intersection of
+ // {isInt|isFP} and ExtVTs
+ if ((getExtTypeNum(0) == MVT::isInt && isExtIntegerInVTs(ExtVTs)) ||
+ (getExtTypeNum(0) == MVT::isFP && isExtFloatingPointInVTs(ExtVTs))) {
+ setTypes(ExtVTs);
return true;
}
OS << "(" << getOperator()->getName();
}
- switch (getExtType()) {
+ // FIXME: At some point we should handle printing all the value types for
+ // nodes that are multiply typed.
+ switch (getExtTypeNum(0)) {
case MVT::Other: OS << ":Other"; break;
case MVT::isInt: OS << ":isInt"; break;
case MVT::isFP : OS << ":isFP"; break;
case MVT::isUnknown: ; /*OS << ":?";*/ break;
- default: OS << ":" << getType(); break;
+ default: OS << ":" << getTypeNum(0); break;
}
if (!isLeaf()) {
/// that are otherwise identical are considered isomorphic.
bool TreePatternNode::isIsomorphicTo(const TreePatternNode *N) const {
if (N == this) return true;
- if (N->isLeaf() != isLeaf() || getExtType() != N->getExtType() ||
+ if (N->isLeaf() != isLeaf() || getExtTypes() != N->getExtTypes() ||
getPredicateFn() != N->getPredicateFn() ||
getTransformFn() != N->getTransformFn())
return false;
New = new TreePatternNode(getOperator(), CChildren);
}
New->setName(getName());
- New->setType(getExtType());
+ New->setTypes(getExtTypes());
New->setPredicateFn(getPredicateFn());
New->setTransformFn(getTransformFn());
return New;
}
FragTree->setName(getName());
- FragTree->UpdateNodeType(getExtType(), TP);
+ FragTree->UpdateNodeType(getExtTypes(), TP);
// Get a new copy of this fragment to stitch into here.
//delete this; // FIXME: implement refcounting!
/// type which should be applied to it. This infer the type of register
/// references from the register file information, for example.
///
-static unsigned char getIntrinsicType(Record *R, bool NotRegisters,
+static std::vector<unsigned char> getIntrinsicType(Record *R, bool NotRegisters,
TreePattern &TP) {
+ // Some common return values
+ std::vector<unsigned char> Unknown(1, MVT::isUnknown);
+ std::vector<unsigned char> Other(1, MVT::Other);
+
// Check to see if this is a register or a register class...
if (R->isSubClassOf("RegisterClass")) {
- if (NotRegisters) return MVT::isUnknown;
+ if (NotRegisters)
+ return Unknown;
const CodeGenRegisterClass &RC =
TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(R);
- return RC.getValueTypeNum(0);
+ return ConvertVTs(RC.getValueTypes());
} else if (R->isSubClassOf("PatFrag")) {
// Pattern fragment types will be resolved when they are inlined.
- return MVT::isUnknown;
+ return Unknown;
} else if (R->isSubClassOf("Register")) {
+ if (NotRegisters)
+ return Unknown;
// If the register appears in exactly one regclass, and the regclass has one
// value type, use it as the known type.
const CodeGenTarget &T = TP.getDAGISelEmitter().getTargetInfo();
if (const CodeGenRegisterClass *RC = T.getRegisterClassForRegister(R))
- if (RC->getNumValueTypes() == 1)
- return RC->getValueTypeNum(0);
- return MVT::isUnknown;
+ return ConvertVTs(RC->getValueTypes());
+ return Unknown;
} else if (R->isSubClassOf("ValueType") || R->isSubClassOf("CondCode")) {
// Using a VTSDNode or CondCodeSDNode.
- return MVT::Other;
+ return Other;
} else if (R->isSubClassOf("ComplexPattern")) {
- return TP.getDAGISelEmitter().getComplexPattern(R).getValueType();
+ if (NotRegisters)
+ return Unknown;
+ std::vector<unsigned char>
+ ComplexPat(1, TP.getDAGISelEmitter().getComplexPattern(R).getValueType());
+ return ComplexPat;
} else if (R->getName() == "node" || R->getName() == "srcvalue") {
// Placeholder.
- return MVT::isUnknown;
+ return Unknown;
}
TP.error("Unknown node flavor used in pattern: " + R->getName());
- return MVT::Other;
+ return Other;
}
/// ApplyTypeConstraints - Apply all of the type constraints relevent to
/// change, false otherwise. If a type contradiction is found, throw an
/// exception.
bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
+ DAGISelEmitter &ISE = TP.getDAGISelEmitter();
if (isLeaf()) {
if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
// If it's a regclass or something else known, include the type.
bool MadeChange = UpdateNodeType(MVT::isInt, TP);
if (hasTypeSet()) {
- unsigned Size = MVT::getSizeInBits(getType());
+ // At some point, it may make sense for this tree pattern to have
+ // multiple types. Assert here that it does not, so we revisit this
+ // code when appropriate.
+ assert(getExtTypes().size() == 1 && "TreePattern has too many types!");
+
+ unsigned Size = MVT::getSizeInBits(getTypeNum(0));
// Make sure that the value is representable for this type.
if (Size < 32) {
int Val = (II->getValue() << (32-Size)) >> (32-Size);
if (Val != II->getValue())
TP.error("Sign-extended integer value '" + itostr(II->getValue()) +
"' is out of range for type 'MVT::" +
- getEnumName(getType()) + "'!");
+ getEnumName(getTypeNum(0)) + "'!");
}
}
MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters);
// Types of operands must match.
- MadeChange |= getChild(0)->UpdateNodeType(getChild(1)->getExtType(), TP);
- MadeChange |= getChild(1)->UpdateNodeType(getChild(0)->getExtType(), TP);
+ MadeChange |= getChild(0)->UpdateNodeType(getChild(1)->getExtTypes(), TP);
+ MadeChange |= getChild(1)->UpdateNodeType(getChild(0)->getExtTypes(), TP);
MadeChange |= UpdateNodeType(MVT::isVoid, TP);
return MadeChange;
+ } else if (getOperator() == ISE.get_intrinsic_void_sdnode() ||
+ getOperator() == ISE.get_intrinsic_w_chain_sdnode() ||
+ getOperator() == ISE.get_intrinsic_wo_chain_sdnode()) {
+ unsigned IID =
+ dynamic_cast<IntInit*>(getChild(0)->getLeafValue())->getValue();
+ const CodeGenIntrinsic &Int = ISE.getIntrinsicInfo(IID);
+ bool MadeChange = false;
+
+ // Apply the result type to the node.
+ MadeChange = UpdateNodeType(Int.ArgVTs[0], TP);
+
+ if (getNumChildren() != Int.ArgVTs.size())
+ TP.error("Intrinsic '" + getOperator()->getName() + " expects " +
+ utostr(Int.ArgVTs.size()-1) + " operands, not " +
+ utostr(getNumChildren()-1) + " operands!");
+
+ // Apply type info to the intrinsic ID.
+ MVT::ValueType PtrTy = ISE.getTargetInfo().getPointerType();
+ MadeChange |= getChild(0)->UpdateNodeType(PtrTy, TP);
+
+ for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
+ MVT::ValueType OpVT = Int.ArgVTs[i];
+ MadeChange |= getChild(i)->UpdateNodeType(OpVT, TP);
+ MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
+ }
+ return MadeChange;
} else if (getOperator()->isSubClassOf("SDNode")) {
- const SDNodeInfo &NI = TP.getDAGISelEmitter().getSDNodeInfo(getOperator());
+ const SDNodeInfo &NI = ISE.getSDNodeInfo(getOperator());
bool MadeChange = NI.ApplyTypeConstraints(this, TP);
for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
MadeChange |= UpdateNodeType(MVT::isVoid, TP);
return MadeChange;
} else if (getOperator()->isSubClassOf("Instruction")) {
- const DAGInstruction &Inst =
- TP.getDAGISelEmitter().getInstruction(getOperator());
+ const DAGInstruction &Inst = ISE.getInstruction(getOperator());
bool MadeChange = false;
unsigned NumResults = Inst.getNumResults();
"Operands should be register classes!");
const CodeGenRegisterClass &RC =
- TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(ResultNode);
-
- // Get the first ValueType in the RegClass, it's as good as any.
- MadeChange = UpdateNodeType(RC.getValueTypeNum(0), TP);
+ ISE.getTargetInfo().getRegisterClass(ResultNode);
+ MadeChange = UpdateNodeType(ConvertVTs(RC.getValueTypes()), TP);
}
if (getNumChildren() != Inst.getNumOperands())
MVT::ValueType VT;
if (OperandNode->isSubClassOf("RegisterClass")) {
const CodeGenRegisterClass &RC =
- TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(OperandNode);
- VT = RC.getValueTypeNum(0);
+ ISE.getTargetInfo().getRegisterClass(OperandNode);
+ //VT = RC.getValueTypeNum(0);
+ MadeChange |=getChild(i)->UpdateNodeType(ConvertVTs(RC.getValueTypes()),
+ TP);
} else if (OperandNode->isSubClassOf("Operand")) {
VT = getValueType(OperandNode->getValueAsDef("Type"));
+ MadeChange |= getChild(i)->UpdateNodeType(VT, TP);
} else {
assert(0 && "Unknown operand type!");
abort();
}
-
- MadeChange |= getChild(i)->UpdateNodeType(VT, TP);
MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
}
return MadeChange;
} else {
assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!");
- // Node transforms always take one operand, and take and return the same
- // type.
+ // Node transforms always take one operand.
if (getNumChildren() != 1)
TP.error("Node transform '" + getOperator()->getName() +
"' requires one operand!");
- bool MadeChange = UpdateNodeType(getChild(0)->getExtType(), TP);
- MadeChange |= getChild(0)->UpdateNodeType(getExtType(), TP);
- return MadeChange;
+
+ // If either the output or input of the xform does not have exact
+ // type info. We assume they must be the same. Otherwise, it is perfectly
+ // legal to transform from one type to a completely different type.
+ if (!hasTypeSet() || !getChild(0)->hasTypeSet()) {
+ bool MadeChange = UpdateNodeType(getChild(0)->getExtTypes(), TP);
+ MadeChange |= getChild(0)->UpdateNodeType(getExtTypes(), TP);
+ return MadeChange;
+ }
+ return false;
}
}
if (!getChild(i)->canPatternMatch(Reason, ISE))
return false;
+ // If this is an intrinsic, handle cases that would make it not match. For
+ // example, if an operand is required to be an immediate.
+ if (getOperator()->isSubClassOf("Intrinsic")) {
+ // TODO:
+ return true;
+ }
+
// If this node is a commutative operator, check that the LHS isn't an
// immediate.
const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(getOperator());
if (!Operator->isSubClassOf("PatFrag") && !Operator->isSubClassOf("SDNode") &&
!Operator->isSubClassOf("Instruction") &&
!Operator->isSubClassOf("SDNodeXForm") &&
+ !Operator->isSubClassOf("Intrinsic") &&
Operator->getName() != "set")
error("Unrecognized node '" + Operator->getName() + "'!");
// Check to see if this is something that is illegal in an input pattern.
if (isInputPattern && (Operator->isSubClassOf("Instruction") ||
- Operator->isSubClassOf("SDNodeXForm")))
+ Operator->isSubClassOf("SDNodeXForm")))
error("Cannot use '" + Operator->getName() + "' in an input pattern!");
std::vector<TreePatternNode*> Children;
}
}
+ // If the operator is an intrinsic, then this is just syntactic sugar for for
+ // (intrinsic_* <number>, ..children..). Pick the right intrinsic node, and
+ // convert the intrinsic name to a number.
+ if (Operator->isSubClassOf("Intrinsic")) {
+ const CodeGenIntrinsic &Int = getDAGISelEmitter().getIntrinsic(Operator);
+ unsigned IID = getDAGISelEmitter().getIntrinsicID(Operator)+1;
+
+ // If this intrinsic returns void, it must have side-effects and thus a
+ // chain.
+ if (Int.ArgVTs[0] == MVT::isVoid) {
+ Operator = getDAGISelEmitter().get_intrinsic_void_sdnode();
+ } else if (Int.ModRef != CodeGenIntrinsic::NoMem) {
+ // Has side-effects, requires chain.
+ Operator = getDAGISelEmitter().get_intrinsic_w_chain_sdnode();
+ } else {
+ // Otherwise, no chain.
+ Operator = getDAGISelEmitter().get_intrinsic_wo_chain_sdnode();
+ }
+
+ TreePatternNode *IIDNode = new TreePatternNode(new IntInit(IID));
+ Children.insert(Children.begin(), IIDNode);
+ }
+
return new TreePatternNode(Operator, Children);
}
SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
Nodes.pop_back();
}
+
+ // Get the buildin intrinsic nodes.
+ intrinsic_void_sdnode = getSDNodeNamed("intrinsic_void");
+ intrinsic_w_chain_sdnode = getSDNodeNamed("intrinsic_w_chain");
+ intrinsic_wo_chain_sdnode = getSDNodeNamed("intrinsic_wo_chain");
}
/// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
// Ensure that the inputs agree if we've already seen this input.
if (Rec != SlotRec)
I->error("All $" + Pat->getName() + " inputs must agree with each other");
- if (Slot->getExtType() != Pat->getExtType())
+ if (Slot->getExtTypes() != Pat->getExtTypes())
I->error("All $" + Pat->getName() + " inputs must agree with each other");
}
return true;
void DAGISelEmitter::
FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
std::map<std::string, TreePatternNode*> &InstInputs,
- std::map<std::string, Record*> &InstResults,
+ std::map<std::string, TreePatternNode*>&InstResults,
std::vector<Record*> &InstImpInputs,
std::vector<Record*> &InstImpResults) {
if (Pat->isLeaf()) {
// If this is not a set, verify that the children nodes are not void typed,
// and recurse.
for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
- if (Pat->getChild(i)->getExtType() == MVT::isVoid)
+ if (Pat->getChild(i)->getExtTypeNum(0) == MVT::isVoid)
I->error("Cannot have void nodes inside of patterns!");
FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
InstImpInputs, InstImpResults);
I->error("set destination must have a name!");
if (InstResults.count(Dest->getName()))
I->error("cannot set '" + Dest->getName() +"' multiple times");
- InstResults[Dest->getName()] = Val->getDef();
+ InstResults[Dest->getName()] = Dest;
} else if (Val->getDef()->isSubClassOf("Register")) {
InstImpResults.push_back(Val->getDef());
} else {
// InstResults - Keep track of all the virtual registers that are 'set'
// in the instruction, including what reg class they are.
- std::map<std::string, Record*> InstResults;
+ std::map<std::string, TreePatternNode*> InstResults;
std::vector<Record*> InstImpInputs;
std::vector<Record*> InstImpResults;
// fill in the InstResults map.
for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {
TreePatternNode *Pat = I->getTree(j);
- if (Pat->getExtType() != MVT::isVoid)
+ if (Pat->getExtTypeNum(0) != MVT::isVoid)
I->error("Top-level forms in instruction pattern should have"
" void types");
// Check that all of the results occur first in the list.
std::vector<Record*> Results;
+ TreePatternNode *Res0Node = NULL;
for (unsigned i = 0; i != NumResults; ++i) {
if (i == CGI.OperandList.size())
I->error("'" + InstResults.begin()->first +
const std::string &OpName = CGI.OperandList[i].Name;
// Check that it exists in InstResults.
- Record *R = InstResults[OpName];
+ TreePatternNode *RNode = InstResults[OpName];
+ if (i == 0)
+ Res0Node = RNode;
+ Record *R = dynamic_cast<DefInit*>(RNode->getLeafValue())->getDef();
if (R == 0)
I->error("Operand $" + OpName + " should be a set destination: all "
"outputs must occur before inputs in operand list!");
Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef();
if (CGI.OperandList[i].Rec != InRec &&
!InRec->isSubClassOf("ComplexPattern"))
- I->error("Operand $" + OpName +
- "'s register class disagrees between the operand and pattern");
+ I->error("Operand $" + OpName + "'s register class disagrees"
+ " between the operand and pattern");
}
Operands.push_back(CGI.OperandList[i].Rec);
TreePatternNode *ResultPattern =
new TreePatternNode(I->getRecord(), ResultNodeOperands);
+ // Copy fully inferred output node type to instruction result pattern.
+ if (NumResults > 0)
+ ResultPattern->setTypes(Res0Node->getExtTypes());
// Create and insert the instruction.
DAGInstruction TheInst(I, Results, Operands, InstImpResults, InstImpInputs);
// Validate that the input pattern is correct.
{
std::map<std::string, TreePatternNode*> InstInputs;
- std::map<std::string, Record*> InstResults;
+ std::map<std::string, TreePatternNode*> InstResults;
std::vector<Record*> InstImpInputs;
std::vector<Record*> InstImpResults;
FindPatternInputsAndOutputs(Pattern, Pattern->getOnlyTree(),
Result->error("Cannot handle instructions producing instructions "
"with temporaries yet!");
+ // Promote the xform function to be an explicit node if set.
+ std::vector<TreePatternNode*> ResultNodeOperands;
+ TreePatternNode *DstPattern = Result->getOnlyTree();
+ for (unsigned ii = 0, ee = DstPattern->getNumChildren(); ii != ee; ++ii) {
+ TreePatternNode *OpNode = DstPattern->getChild(ii);
+ if (Record *Xform = OpNode->getTransformFn()) {
+ OpNode->setTransformFn(0);
+ std::vector<TreePatternNode*> Children;
+ Children.push_back(OpNode);
+ OpNode = new TreePatternNode(Xform, Children);
+ }
+ ResultNodeOperands.push_back(OpNode);
+ }
+ DstPattern = Result->getOnlyTree();
+ if (!DstPattern->isLeaf())
+ DstPattern = new TreePatternNode(DstPattern->getOperator(),
+ ResultNodeOperands);
+ DstPattern->setTypes(Result->getOnlyTree()->getExtTypes());
+ TreePattern Temp(Result->getRecord(), DstPattern, false, *this);
+ Temp.InferAllTypes();
+
std::string Reason;
if (!Pattern->getOnlyTree()->canPatternMatch(Reason, *this))
Pattern->error("Pattern can never match: " + Reason);
PatternsToMatch.
push_back(PatternToMatch(Patterns[i]->getValueAsListInit("Predicates"),
Pattern->getOnlyTree(),
- Result->getOnlyTree()));
+ Temp.getOnlyTree()));
}
}
R->setName(Orig->getName());
R->setPredicateFn(Orig->getPredicateFn());
R->setTransformFn(Orig->getTransformFn());
- R->setType(Orig->getExtType());
+ R->setTypes(Orig->getExtTypes());
// If this pattern cannot every match, do not include it as a variant.
std::string ErrString;
/// patterns before small ones. This is used to determine the size of a
/// pattern.
static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
- assert(isExtIntegerVT(P->getExtType()) ||
- isExtFloatingPointVT(P->getExtType()) ||
- P->getExtType() == MVT::isVoid ||
- P->getExtType() == MVT::Flag && "Not a valid pattern node to size!");
- unsigned Size = 1; // The node itself.
+ assert(isExtIntegerInVTs(P->getExtTypes()) ||
+ isExtFloatingPointInVTs(P->getExtTypes()) ||
+ P->getExtTypeNum(0) == MVT::isVoid ||
+ P->getExtTypeNum(0) == MVT::Flag &&
+ "Not a valid pattern node to size!");
+ unsigned Size = 2; // The node itself.
+ // If the root node is a ConstantSDNode, increases its size.
+ // e.g. (set R32:$dst, 0).
+ if (P->isLeaf() && dynamic_cast<IntInit*>(P->getLeafValue()))
+ Size++;
// FIXME: This is a hack to statically increase the priority of patterns
// which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
// calculate the complexity of all patterns a dag can potentially map to.
const ComplexPattern *AM = NodeGetComplexPattern(P, ISE);
if (AM)
- Size += AM->getNumOperands();
-
+ Size += AM->getNumOperands() * 2;
+
+ // If this node has some predicate function that must match, it adds to the
+ // complexity of this node.
+ if (!P->getPredicateFn().empty())
+ ++Size;
+
// Count children in the count if they are also nodes.
for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
TreePatternNode *Child = P->getChild(i);
- if (!Child->isLeaf() && Child->getExtType() != MVT::Other)
+ if (!Child->isLeaf() && Child->getExtTypeNum(0) != MVT::Other)
Size += getPatternSize(Child, ISE);
else if (Child->isLeaf()) {
if (dynamic_cast<IntInit*>(Child->getLeafValue()))
- ++Size; // Matches a ConstantSDNode.
+ Size += 3; // Matches a ConstantSDNode (+2) and a specific value (+1).
else if (NodeIsComplexPattern(Child))
Size += getPatternSize(Child, ISE);
+ else if (!Child->getPredicateFn().empty())
+ ++Size;
}
}
/// getResultPatternCost - Compute the number of instructions for this pattern.
/// This is a temporary hack. We should really include the instruction
/// latencies in this calculation.
-static unsigned getResultPatternCost(TreePatternNode *P) {
+static unsigned getResultPatternCost(TreePatternNode *P, DAGISelEmitter &ISE) {
if (P->isLeaf()) return 0;
- unsigned Cost = P->getOperator()->isSubClassOf("Instruction");
+ unsigned Cost = 0;
+ Record *Op = P->getOperator();
+ if (Op->isSubClassOf("Instruction")) {
+ Cost++;
+ CodeGenInstruction &II = ISE.getTargetInfo().getInstruction(Op->getName());
+ if (II.usesCustomDAGSchedInserter)
+ Cost += 10;
+ }
for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
- Cost += getResultPatternCost(P->getChild(i));
+ Cost += getResultPatternCost(P->getChild(i), ISE);
return Cost;
}
if (LHSSize < RHSSize) return false;
// If the patterns have equal complexity, compare generated instruction cost
- return getResultPatternCost(LHS->getDstPattern()) <
- getResultPatternCost(RHS->getDstPattern());
+ return getResultPatternCost(LHS->getDstPattern(), ISE) <
+ getResultPatternCost(RHS->getDstPattern(), ISE);
}
};
/// RemoveAllTypes - A quick recursive walk over a pattern which removes all
/// type information from it.
static void RemoveAllTypes(TreePatternNode *N) {
- N->setType(MVT::isUnknown);
+ N->removeTypes();
if (!N->isLeaf())
for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
RemoveAllTypes(N->getChild(i));
Record *DAGISelEmitter::getSDNodeNamed(const std::string &Name) const {
Record *N = Records.getDef(Name);
- assert(N && N->isSubClassOf("SDNode") && "Bad argument");
+ if (!N || !N->isSubClassOf("SDNode")) {
+ std::cerr << "Error getting SDNode '" << Name << "'!\n";
+ exit(1);
+ }
return N;
}
-/// NodeHasChain - return true if TreePatternNode has the property
-/// 'hasChain', meaning it reads a ctrl-flow chain operand and writes
-/// a chain result.
-static bool NodeHasChain(TreePatternNode *N, DAGISelEmitter &ISE)
+/// NodeHasProperty - return true if TreePatternNode has the specified
+/// property.
+static bool NodeHasProperty(TreePatternNode *N, SDNodeInfo::SDNP Property,
+ DAGISelEmitter &ISE)
{
if (N->isLeaf()) return false;
Record *Operator = N->getOperator();
if (!Operator->isSubClassOf("SDNode")) return false;
const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(Operator);
- return NodeInfo.hasProperty(SDNodeInfo::SDNPHasChain);
+ return NodeInfo.hasProperty(Property);
}
-static bool PatternHasCtrlDep(TreePatternNode *N, DAGISelEmitter &ISE)
+static bool PatternHasProperty(TreePatternNode *N, SDNodeInfo::SDNP Property,
+ DAGISelEmitter &ISE)
{
- if (NodeHasChain(N, ISE))
+ if (NodeHasProperty(N, Property, ISE))
return true;
- else {
- for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
- TreePatternNode *Child = N->getChild(i);
- if (PatternHasCtrlDep(Child, ISE))
- return true;
- }
+
+ for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
+ TreePatternNode *Child = N->getChild(i);
+ if (PatternHasProperty(Child, Property, ISE))
+ return true;
}
return false;
TreePatternNode *Pattern;
// Matched instruction.
TreePatternNode *Instruction;
- unsigned PatternNo;
- std::ostream &OS;
+
// Node to name mapping
- std::map<std::string,std::string> VariableMap;
+ std::map<std::string, std::string> VariableMap;
+ // Node to operator mapping
+ std::map<std::string, Record*> OperatorMap;
// Names of all the folded nodes which produce chains.
std::vector<std::pair<std::string, unsigned> > FoldedChains;
+ std::set<std::string> Duplicates;
+
+ /// GeneratedCode - This is the buffer that we emit code to. The first bool
+ /// indicates whether this is an exit predicate (something that should be
+ /// tested, and if true, the match fails) [when true] or normal code to emit
+ /// [when false].
+ std::vector<std::pair<bool, std::string> > &GeneratedCode;
+ /// GeneratedDecl - This is the set of all SDOperand declarations needed for
+ /// the set of patterns for each top-level opcode.
+ std::set<std::pair<bool, std::string> > &GeneratedDecl;
+
+ std::string ChainName;
+ bool NewTF;
+ bool DoReplace;
unsigned TmpNo;
-
+
+ void emitCheck(const std::string &S) {
+ if (!S.empty())
+ GeneratedCode.push_back(std::make_pair(true, S));
+ }
+ void emitCode(const std::string &S) {
+ if (!S.empty())
+ GeneratedCode.push_back(std::make_pair(false, S));
+ }
+ void emitDecl(const std::string &S, bool isSDNode=false) {
+ assert(!S.empty() && "Invalid declaration");
+ GeneratedDecl.insert(std::make_pair(isSDNode, S));
+ }
public:
PatternCodeEmitter(DAGISelEmitter &ise, ListInit *preds,
TreePatternNode *pattern, TreePatternNode *instr,
- unsigned PatNum, std::ostream &os) :
- ISE(ise), Predicates(preds), Pattern(pattern), Instruction(instr),
- PatternNo(PatNum), OS(os), TmpNo(0) {}
-
- /// isPredeclaredSDOperand - Return true if this is one of the predeclared
- /// SDOperands.
- bool isPredeclaredSDOperand(const std::string &OpName) const {
- return OpName == "N0" || OpName == "N1" || OpName == "N2" ||
- OpName == "N00" || OpName == "N01" ||
- OpName == "N10" || OpName == "N11" ||
- OpName == "Tmp0" || OpName == "Tmp1" ||
- OpName == "Tmp2" || OpName == "Tmp3";
- }
-
- /// DeclareSDOperand - Emit "SDOperand <opname>" or "<opname>". This works
- /// around an ugly GCC bug where SelectCode is using too much stack space
- void DeclareSDOperand(const std::string &OpName) const {
- // If it's one of the common cases declared at the top of SelectCode, just
- // use the existing declaration.
- if (isPredeclaredSDOperand(OpName))
- OS << OpName;
- else
- OS << "SDOperand " << OpName;
- }
-
+ std::vector<std::pair<bool, std::string> > &gc,
+ std::set<std::pair<bool, std::string> > &gd,
+ bool dorep)
+ : ISE(ise), Predicates(preds), Pattern(pattern), Instruction(instr),
+ GeneratedCode(gc), GeneratedDecl(gd),
+ NewTF(false), DoReplace(dorep), TmpNo(0) {}
+
/// EmitMatchCode - Emit a matcher for N, going to the label for PatternNo
/// if the match fails. At this point, we already know that the opcode for N
/// matches, and the SDNode for the result has the RootName specified name.
- void EmitMatchCode(TreePatternNode *N, const std::string &RootName,
- bool &FoundChain, bool isRoot = false) {
-
+ void EmitMatchCode(TreePatternNode *N, TreePatternNode *P,
+ const std::string &RootName, const std::string &ParentName,
+ const std::string &ChainSuffix, bool &FoundChain) {
+ bool isRoot = (P == NULL);
// Emit instruction predicates. Each predicate is just a string for now.
if (isRoot) {
+ std::string PredicateCheck;
for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {
if (DefInit *Pred = dynamic_cast<DefInit*>(Predicates->getElement(i))) {
Record *Def = Pred->getDef();
- if (Def->isSubClassOf("Predicate")) {
- if (i == 0)
- OS << " if (";
- else
- OS << " && ";
- OS << "!(" << Def->getValueAsString("CondString") << ")";
- if (i == e-1)
- OS << ") goto P" << PatternNo << "Fail;\n";
- } else {
+ if (!Def->isSubClassOf("Predicate")) {
Def->dump();
assert(0 && "Unknown predicate type!");
}
+ if (!PredicateCheck.empty())
+ PredicateCheck += " || ";
+ PredicateCheck += "(" + Def->getValueAsString("CondString") + ")";
}
}
+
+ emitCheck(PredicateCheck);
}
if (N->isLeaf()) {
if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
- OS << " if (cast<ConstantSDNode>(" << RootName
- << ")->getSignExtended() != " << II->getValue() << ")\n"
- << " goto P" << PatternNo << "Fail;\n";
+ emitCheck("cast<ConstantSDNode>(" + RootName +
+ ")->getSignExtended() == " + itostr(II->getValue()));
return;
} else if (!NodeIsComplexPattern(N)) {
assert(0 && "Cannot match this as a leaf value!");
}
}
- // If this node has a name associated with it, capture it in VariableMap. If
+ // If this node has a name associated with it, capture it in VariableMap. If
// we already saw this in the pattern, emit code to verify dagness.
if (!N->getName().empty()) {
std::string &VarMapEntry = VariableMap[N->getName()];
// we already have checked that the first reference is valid, we don't
// have to recursively match it, just check that it's the same as the
// previously named thing.
- OS << " if (" << VarMapEntry << " != " << RootName
- << ") goto P" << PatternNo << "Fail;\n";
+ emitCheck(VarMapEntry + " == " + RootName);
return;
}
+
+ if (!N->isLeaf())
+ OperatorMap[N->getName()] = N->getOperator();
}
// Emit code to load the child nodes and match their contents recursively.
unsigned OpNo = 0;
- bool HasChain = NodeHasChain(N, ISE);
+ bool NodeHasChain = NodeHasProperty (N, SDNodeInfo::SDNPHasChain, ISE);
+ bool HasChain = PatternHasProperty(N, SDNodeInfo::SDNPHasChain, ISE);
+ bool HasOutFlag = PatternHasProperty(N, SDNodeInfo::SDNPOutFlag, ISE);
+ bool EmittedUseCheck = false;
+ bool EmittedSlctedCheck = false;
if (HasChain) {
- OpNo = 1;
+ if (NodeHasChain)
+ OpNo = 1;
if (!isRoot) {
const SDNodeInfo &CInfo = ISE.getSDNodeInfo(N->getOperator());
- OS << " if (!" << RootName << ".hasOneUse()) goto P"
- << PatternNo << "Fail; // Multiple uses of actual result?\n";
- OS << " if (CodeGenMap.count(" << RootName
- << ".getValue(" << CInfo.getNumResults() << "))) goto P"
- << PatternNo << "Fail; // Already selected for a chain use?\n";
+ // Multiple uses of actual result?
+ emitCheck(RootName + ".hasOneUse()");
+ EmittedUseCheck = true;
+ // hasOneUse() check is not strong enough. If the original node has
+ // already been selected, it may have been replaced with another.
+ for (unsigned j = 0; j != CInfo.getNumResults(); j++)
+ emitCheck("!CodeGenMap.count(" + RootName + ".getValue(" + utostr(j) +
+ "))");
+
+ EmittedSlctedCheck = true;
+ if (NodeHasChain) {
+ // FIXME: Don't fold if 1) the parent node writes a flag, 2) the node
+ // has a chain use.
+ // This a workaround for this problem:
+ //
+ // [ch, r : ld]
+ // ^ ^
+ // | |
+ // [XX]--/ \- [flag : cmp]
+ // ^ ^
+ // | |
+ // \---[br flag]-
+ //
+ // cmp + br should be considered as a single node as they are flagged
+ // together. So, if the ld is folded into the cmp, the XX node in the
+ // graph is now both an operand and a use of the ld/cmp/br node.
+ if (NodeHasProperty(P, SDNodeInfo::SDNPOutFlag, ISE))
+ emitCheck(ParentName + ".Val->isOnlyUse(" + RootName + ".Val)");
+
+ // If the immediate use can somehow reach this node through another
+ // path, then can't fold it either or it will create a cycle.
+ // e.g. In the following diagram, XX can reach ld through YY. If
+ // ld is folded into XX, then YY is both a predecessor and a successor
+ // of XX.
+ //
+ // [ld]
+ // ^ ^
+ // | |
+ // / \---
+ // / [YY]
+ // | ^
+ // [XX]-------|
+ const SDNodeInfo &PInfo = ISE.getSDNodeInfo(P->getOperator());
+ if (PInfo.getNumOperands() > 1 ||
+ PInfo.hasProperty(SDNodeInfo::SDNPHasChain) ||
+ PInfo.hasProperty(SDNodeInfo::SDNPInFlag) ||
+ PInfo.hasProperty(SDNodeInfo::SDNPOptInFlag))
+ if (PInfo.getNumOperands() > 1) {
+ emitCheck("!isNonImmUse(" + ParentName + ".Val, " + RootName +
+ ".Val)");
+ } else {
+ emitCheck("(" + ParentName + ".getNumOperands() == 1 || !" +
+ "isNonImmUse(" + ParentName + ".Val, " + RootName +
+ ".Val))");
+ }
+ }
}
+
+ if (NodeHasChain) {
+ ChainName = "Chain" + ChainSuffix;
+ emitDecl(ChainName);
+ if (FoundChain) {
+ // FIXME: temporary workaround for a common case where chain
+ // is a TokenFactor and the previous "inner" chain is an operand.
+ NewTF = true;
+ emitDecl("OldTF", true);
+ emitCheck("(" + ChainName + " = UpdateFoldedChain(CurDAG, " +
+ RootName + ".Val, Chain.Val, OldTF)).Val");
+ } else {
+ FoundChain = true;
+ emitCode(ChainName + " = " + RootName + ".getOperand(0);");
+ }
+ }
+ }
+
+ // Don't fold any node which reads or writes a flag and has multiple uses.
+ // FIXME: We really need to separate the concepts of flag and "glue". Those
+ // real flag results, e.g. X86CMP output, can have multiple uses.
+ // FIXME: If the optional incoming flag does not exist. Then it is ok to
+ // fold it.
+ if (!isRoot &&
+ (PatternHasProperty(N, SDNodeInfo::SDNPInFlag, ISE) ||
+ PatternHasProperty(N, SDNodeInfo::SDNPOptInFlag, ISE) ||
+ PatternHasProperty(N, SDNodeInfo::SDNPOutFlag, ISE))) {
+ const SDNodeInfo &CInfo = ISE.getSDNodeInfo(N->getOperator());
+ if (!EmittedUseCheck) {
+ // Multiple uses of actual result?
+ emitCheck(RootName + ".hasOneUse()");
+ }
+ if (!EmittedSlctedCheck)
+ // hasOneUse() check is not strong enough. If the original node has
+ // already been selected, it may have been replaced with another.
+ for (unsigned j = 0; j < CInfo.getNumResults(); j++)
+ emitCheck("!CodeGenMap.count(" + RootName + ".getValue(" + utostr(j) +
+ "))");
}
for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
- OS << " ";
- DeclareSDOperand(RootName+utostr(OpNo));
- OS << " = " << RootName << ".getOperand(" << OpNo << ");\n";
+ emitDecl(RootName + utostr(OpNo));
+ emitCode(RootName + utostr(OpNo) + " = " +
+ RootName + ".getOperand(" +utostr(OpNo) + ");");
TreePatternNode *Child = N->getChild(i);
if (!Child->isLeaf()) {
// If it's not a leaf, recursively match.
const SDNodeInfo &CInfo = ISE.getSDNodeInfo(Child->getOperator());
- OS << " if (" << RootName << OpNo << ".getOpcode() != "
- << CInfo.getEnumName() << ") goto P" << PatternNo << "Fail;\n";
- EmitMatchCode(Child, RootName + utostr(OpNo), FoundChain);
- if (NodeHasChain(Child, ISE)) {
+ emitCheck(RootName + utostr(OpNo) + ".getOpcode() == " +
+ CInfo.getEnumName());
+ EmitMatchCode(Child, N, RootName + utostr(OpNo), RootName,
+ ChainSuffix + utostr(OpNo), FoundChain);
+ if (NodeHasProperty(Child, SDNodeInfo::SDNPHasChain, ISE))
FoldedChains.push_back(std::make_pair(RootName + utostr(OpNo),
CInfo.getNumResults()));
- }
} else {
- // If this child has a name associated with it, capture it in VarMap. If
+ // If this child has a name associated with it, capture it in VarMap. If
// we already saw this in the pattern, emit code to verify dagness.
if (!Child->getName().empty()) {
std::string &VarMapEntry = VariableMap[Child->getName()];
if (VarMapEntry.empty()) {
VarMapEntry = RootName + utostr(OpNo);
} else {
- // If we get here, this is a second reference to a specific name. Since
- // we already have checked that the first reference is valid, we don't
- // have to recursively match it, just check that it's the same as the
- // previously named thing.
- OS << " if (" << VarMapEntry << " != " << RootName << OpNo
- << ") goto P" << PatternNo << "Fail;\n";
+ // If we get here, this is a second reference to a specific name.
+ // Since we already have checked that the first reference is valid,
+ // we don't have to recursively match it, just check that it's the
+ // same as the previously named thing.
+ emitCheck(VarMapEntry + " == " + RootName + utostr(OpNo));
+ Duplicates.insert(RootName + utostr(OpNo));
continue;
}
}
// Place holder for SRCVALUE nodes. Nothing to do here.
} else if (LeafRec->isSubClassOf("ValueType")) {
// Make sure this is the specified value type.
- OS << " if (cast<VTSDNode>(" << RootName << OpNo << ")->getVT() != "
- << "MVT::" << LeafRec->getName() << ") goto P" << PatternNo
- << "Fail;\n";
+ emitCheck("cast<VTSDNode>(" + RootName + utostr(OpNo) +
+ ")->getVT() == MVT::" + LeafRec->getName());
} else if (LeafRec->isSubClassOf("CondCode")) {
// Make sure this is the specified cond code.
- OS << " if (cast<CondCodeSDNode>(" << RootName << OpNo
- << ")->get() != " << "ISD::" << LeafRec->getName()
- << ") goto P" << PatternNo << "Fail;\n";
+ emitCheck("cast<CondCodeSDNode>(" + RootName + utostr(OpNo) +
+ ")->get() == ISD::" + LeafRec->getName());
} else {
Child->dump();
std::cerr << " ";
assert(0 && "Unknown leaf type!");
}
- } else if (IntInit *II = dynamic_cast<IntInit*>(Child->getLeafValue())) {
- OS << " if (!isa<ConstantSDNode>(" << RootName << OpNo << ") ||\n"
- << " cast<ConstantSDNode>(" << RootName << OpNo
- << ")->getSignExtended() != " << II->getValue() << ")\n"
- << " goto P" << PatternNo << "Fail;\n";
+ } else if (IntInit *II =
+ dynamic_cast<IntInit*>(Child->getLeafValue())) {
+ emitCheck("isa<ConstantSDNode>(" + RootName + utostr(OpNo) + ")");
+ unsigned CTmp = TmpNo++;
+ emitCode("int64_t CN"+utostr(CTmp)+" = cast<ConstantSDNode>("+
+ RootName + utostr(OpNo) + ")->getSignExtended();");
+
+ emitCheck("CN" + utostr(CTmp) + " == " +itostr(II->getValue()));
} else {
Child->dump();
assert(0 && "Unknown leaf type!");
}
}
- if (HasChain) {
- if (!FoundChain) {
- OS << " Chain = " << RootName << ".getOperand(0);\n";
- FoundChain = true;
- }
- }
-
// If there is a node predicate for this, emit the call.
if (!N->getPredicateFn().empty())
- OS << " if (!" << N->getPredicateFn() << "(" << RootName
- << ".Val)) goto P" << PatternNo << "Fail;\n";
+ emitCheck(N->getPredicateFn() + "(" + RootName + ".Val)");
}
/// EmitResultCode - Emit the action for a pattern. Now that it has matched
/// we actually have to build a DAG!
std::pair<unsigned, unsigned>
- EmitResultCode(TreePatternNode *N, bool isRoot = false) {
+ EmitResultCode(TreePatternNode *N, bool LikeLeaf = false,
+ bool isRoot = false) {
// This is something selected from the pattern we matched.
if (!N->getName().empty()) {
- assert(!isRoot && "Root of pattern cannot be a leaf!");
std::string &Val = VariableMap[N->getName()];
assert(!Val.empty() &&
"Variable referenced but not defined and not caught earlier!");
unsigned ResNo = TmpNo++;
unsigned NumRes = 1;
if (!N->isLeaf() && N->getOperator()->getName() == "imm") {
- switch (N->getType()) {
- default: assert(0 && "Unknown type for constant node!");
- case MVT::i1: OS << " bool Tmp"; break;
- case MVT::i8: OS << " unsigned char Tmp"; break;
- case MVT::i16: OS << " unsigned short Tmp"; break;
- case MVT::i32: OS << " unsigned Tmp"; break;
- case MVT::i64: OS << " uint64_t Tmp"; break;
+ assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
+ std::string CastType;
+ switch (N->getTypeNum(0)) {
+ default: assert(0 && "Unknown type for constant node!");
+ case MVT::i1: CastType = "bool"; break;
+ case MVT::i8: CastType = "unsigned char"; break;
+ case MVT::i16: CastType = "unsigned short"; break;
+ case MVT::i32: CastType = "unsigned"; break;
+ case MVT::i64: CastType = "uint64_t"; break;
+ }
+ emitCode(CastType + " Tmp" + utostr(ResNo) + "C = (" + CastType +
+ ")cast<ConstantSDNode>(" + Val + ")->getValue();");
+ emitDecl("Tmp" + utostr(ResNo));
+ emitCode("Tmp" + utostr(ResNo) +
+ " = CurDAG->getTargetConstant(Tmp" + utostr(ResNo) +
+ "C, MVT::" + getEnumName(N->getTypeNum(0)) + ");");
+ } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
+ Record *Op = OperatorMap[N->getName()];
+ // Transform ExternalSymbol to TargetExternalSymbol
+ if (Op && Op->getName() == "externalsym") {
+ emitDecl("Tmp" + utostr(ResNo));
+ emitCode("Tmp" + utostr(ResNo) + " = CurDAG->getTarget"
+ "ExternalSymbol(cast<ExternalSymbolSDNode>(" +
+ Val + ")->getSymbol(), MVT::" +
+ getEnumName(N->getTypeNum(0)) + ");");
+ } else {
+ emitDecl("Tmp" + utostr(ResNo));
+ emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
}
- OS << ResNo << "C = cast<ConstantSDNode>(" << Val << ")->getValue();\n";
- OS << " ";
- DeclareSDOperand("Tmp"+utostr(ResNo));
- OS << " = CurDAG->getTargetConstant(Tmp"
- << ResNo << "C, MVT::" << getEnumName(N->getType()) << ");\n";
} else if (!N->isLeaf() && N->getOperator()->getName() == "tglobaladdr") {
- OS << " ";
- DeclareSDOperand("Tmp"+utostr(ResNo));
- OS << " = " << Val << ";\n";
+ Record *Op = OperatorMap[N->getName()];
+ // Transform GlobalAddress to TargetGlobalAddress
+ if (Op && Op->getName() == "globaladdr") {
+ emitDecl("Tmp" + utostr(ResNo));
+ emitCode("Tmp" + utostr(ResNo) + " = CurDAG->getTarget"
+ "GlobalAddress(cast<GlobalAddressSDNode>(" + Val +
+ ")->getGlobal(), MVT::" + getEnumName(N->getTypeNum(0)) +
+ ");");
+ } else {
+ emitDecl("Tmp" + utostr(ResNo));
+ emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
+ }
+ } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
+ emitDecl("Tmp" + utostr(ResNo));
+ emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
} else if (!N->isLeaf() && N->getOperator()->getName() == "tconstpool") {
- OS << " ";
- DeclareSDOperand("Tmp"+utostr(ResNo));
- OS << " = " << Val << ";\n";
- } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym") {
- OS << " ";
- DeclareSDOperand("Tmp"+utostr(ResNo));
- OS << " = " << Val << ";\n";
+ emitDecl("Tmp" + utostr(ResNo));
+ emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
} else if (N->isLeaf() && (CP = NodeGetComplexPattern(N, ISE))) {
std::string Fn = CP->getSelectFunc();
NumRes = CP->getNumOperands();
- for (unsigned i = 0; i != NumRes; ++i) {
- if (!isPredeclaredSDOperand("Tmp" + utostr(i+ResNo))) {
- OS << " ";
- DeclareSDOperand("Tmp" + utostr(i+ResNo));
- OS << ";\n";
- }
- }
- OS << " if (!" << Fn << "(" << Val;
+ for (unsigned i = 0; i < NumRes; ++i)
+ emitDecl("Tmp" + utostr(i+ResNo));
+
+ std::string Code = Fn + "(" + Val;
for (unsigned i = 0; i < NumRes; i++)
- OS << ", Tmp" << i + ResNo;
- OS << ")) goto P" << PatternNo << "Fail;\n";
+ Code += ", Tmp" + utostr(i + ResNo);
+ emitCheck(Code + ")");
+
+ for (unsigned i = 0; i < NumRes; ++i)
+ emitCode("Select(Tmp" + utostr(i+ResNo) + ", Tmp" +
+ utostr(i+ResNo) + ");");
+
TmpNo = ResNo + NumRes;
} else {
- OS << " ";
- DeclareSDOperand("Tmp"+utostr(ResNo));
- OS << " = Select(" << Val << ");\n";
+ emitDecl("Tmp" + utostr(ResNo));
+ // This node, probably wrapped in a SDNodeXForms, behaves like a leaf
+ // node even if it isn't one. Don't select it.
+ if (LikeLeaf)
+ emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
+ else
+ emitCode("Select(Tmp" + utostr(ResNo) + ", " + Val + ");");
+
+ if (isRoot && N->isLeaf()) {
+ emitCode("Result = Tmp" + utostr(ResNo) + ";");
+ emitCode("return;");
+ }
}
// Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
// value if used multiple times by this pattern result.
Val = "Tmp"+utostr(ResNo);
return std::make_pair(NumRes, ResNo);
}
-
if (N->isLeaf()) {
// If this is an explicit register reference, handle it.
if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
unsigned ResNo = TmpNo++;
if (DI->getDef()->isSubClassOf("Register")) {
- OS << " ";
- DeclareSDOperand("Tmp"+utostr(ResNo));
- OS << " = CurDAG->getRegister("
- << ISE.getQualifiedName(DI->getDef()) << ", MVT::"
- << getEnumName(N->getType())
- << ");\n";
+ emitDecl("Tmp" + utostr(ResNo));
+ emitCode("Tmp" + utostr(ResNo) + " = CurDAG->getRegister(" +
+ ISE.getQualifiedName(DI->getDef()) + ", MVT::" +
+ getEnumName(N->getTypeNum(0)) + ");");
return std::make_pair(1, ResNo);
}
} else if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
unsigned ResNo = TmpNo++;
- OS << " ";
- DeclareSDOperand("Tmp"+utostr(ResNo));
- OS << " = CurDAG->getTargetConstant("
- << II->getValue() << ", MVT::"
- << getEnumName(N->getType())
- << ");\n";
+ assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
+ emitDecl("Tmp" + utostr(ResNo));
+ emitCode("Tmp" + utostr(ResNo) +
+ " = CurDAG->getTargetConstant(" + itostr(II->getValue()) +
+ ", MVT::" + getEnumName(N->getTypeNum(0)) + ");");
return std::make_pair(1, ResNo);
}
const DAGInstruction &Inst = ISE.getInstruction(Op);
bool HasImpInputs = Inst.getNumImpOperands() > 0;
bool HasImpResults = Inst.getNumImpResults() > 0;
- bool HasInFlag = II.hasInFlag || HasImpInputs;
- bool HasOutFlag = II.hasOutFlag || HasImpResults;
- bool HasChain = II.hasCtrlDep;
-
- if (isRoot && PatternHasCtrlDep(Pattern, ISE))
- HasChain = true;
- if (HasInFlag || HasOutFlag)
- OS << " InFlag = SDOperand(0, 0);\n";
+ bool HasOptInFlag = isRoot &&
+ PatternHasProperty(Pattern, SDNodeInfo::SDNPOptInFlag, ISE);
+ bool HasInFlag = isRoot &&
+ PatternHasProperty(Pattern, SDNodeInfo::SDNPInFlag, ISE);
+ bool NodeHasOutFlag = HasImpResults ||
+ (isRoot && PatternHasProperty(Pattern, SDNodeInfo::SDNPOutFlag, ISE));
+ bool NodeHasChain =
+ NodeHasProperty(Pattern, SDNodeInfo::SDNPHasChain, ISE);
+ bool HasChain = II.hasCtrlDep ||
+ (isRoot && PatternHasProperty(Pattern, SDNodeInfo::SDNPHasChain, ISE));
+
+ if (HasInFlag || NodeHasOutFlag || HasOptInFlag || HasImpInputs)
+ emitDecl("InFlag");
+ if (HasOptInFlag)
+ emitCode("bool HasOptInFlag = false;");
+
+ // How many results is this pattern expected to produce?
+ unsigned PatResults = 0;
+ for (unsigned i = 0, e = Pattern->getExtTypes().size(); i != e; i++) {
+ MVT::ValueType VT = Pattern->getTypeNum(i);
+ if (VT != MVT::isVoid && VT != MVT::Flag)
+ PatResults++;
+ }
// Determine operand emission order. Complex pattern first.
std::vector<std::pair<unsigned, TreePatternNode*> > EmitOrder;
}
// Emit all the chain and CopyToReg stuff.
+ bool ChainEmitted = HasChain;
if (HasChain)
- OS << " Chain = Select(Chain);\n";
- if (HasInFlag)
- EmitInFlags(Pattern, "N", HasChain, II.hasInFlag, true);
+ emitCode("Select(" + ChainName + ", " + ChainName + ");");
+ if (HasInFlag || HasOptInFlag || HasImpInputs)
+ EmitInFlagSelectCode(Pattern, "N", ChainEmitted, true);
unsigned NumResults = Inst.getNumResults();
unsigned ResNo = TmpNo++;
if (!isRoot) {
- OS << " ";
- DeclareSDOperand("Tmp"+utostr(ResNo));
- OS << " = CurDAG->getTargetNode("
- << II.Namespace << "::" << II.TheDef->getName();
- if (N->getType() != MVT::isVoid)
- OS << ", MVT::" << getEnumName(N->getType());
- if (HasOutFlag)
- OS << ", MVT::Flag";
+ emitDecl("Tmp" + utostr(ResNo));
+ std::string Code =
+ "Tmp" + utostr(ResNo) + " = SDOperand(CurDAG->getTargetNode(" +
+ II.Namespace + "::" + II.TheDef->getName();
+ if (N->getTypeNum(0) != MVT::isVoid)
+ Code += ", MVT::" + getEnumName(N->getTypeNum(0));
+ if (NodeHasOutFlag)
+ Code += ", MVT::Flag";
unsigned LastOp = 0;
for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
LastOp = Ops[i];
- OS << ", Tmp" << LastOp;
+ Code += ", Tmp" + utostr(LastOp);
}
- OS << ");\n";
+ emitCode(Code + "), 0);");
if (HasChain) {
// Must have at least one result
- OS << " Chain = Tmp" << LastOp << ".getValue("
- << NumResults << ");\n";
+ emitCode(ChainName + " = Tmp" + utostr(LastOp) + ".getValue(" +
+ utostr(NumResults) + ");");
}
- } else if (HasChain || HasOutFlag) {
- OS << " Result = CurDAG->getTargetNode("
- << II.Namespace << "::" << II.TheDef->getName();
-
- // Output order: results, chain, flags
- // Result types.
- if (NumResults > 0) {
- // TODO: multiple results?
- if (N->getType() != MVT::isVoid)
- OS << ", MVT::" << getEnumName(N->getType());
+ } else if (HasChain || NodeHasOutFlag) {
+ if (HasOptInFlag) {
+ unsigned FlagNo = (unsigned) NodeHasChain + Pattern->getNumChildren();
+ emitDecl("ResNode", true);
+ emitCode("if (HasOptInFlag)");
+ std::string Code = " ResNode = CurDAG->getTargetNode(" +
+ II.Namespace + "::" + II.TheDef->getName();
+
+ // Output order: results, chain, flags
+ // Result types.
+ if (NumResults > 0) {
+ if (N->getTypeNum(0) != MVT::isVoid)
+ Code += ", MVT::" + getEnumName(N->getTypeNum(0));
+ }
+ if (HasChain)
+ Code += ", MVT::Other";
+ if (NodeHasOutFlag)
+ Code += ", MVT::Flag";
+
+ // Inputs.
+ for (unsigned i = 0, e = Ops.size(); i != e; ++i)
+ Code += ", Tmp" + utostr(Ops[i]);
+ if (HasChain) Code += ", " + ChainName;
+ emitCode(Code + ", InFlag);");
+
+ emitCode("else");
+ Code = " ResNode = CurDAG->getTargetNode(" + II.Namespace + "::" +
+ II.TheDef->getName();
+
+ // Output order: results, chain, flags
+ // Result types.
+ if (NumResults > 0 && N->getTypeNum(0) != MVT::isVoid)
+ Code += ", MVT::" + getEnumName(N->getTypeNum(0));
+ if (HasChain)
+ Code += ", MVT::Other";
+ if (NodeHasOutFlag)
+ Code += ", MVT::Flag";
+
+ // Inputs.
+ for (unsigned i = 0, e = Ops.size(); i != e; ++i)
+ Code += ", Tmp" + utostr(Ops[i]);
+ if (HasChain) Code += ", " + ChainName + ");";
+ emitCode(Code);
+ } else {
+ emitDecl("ResNode", true);
+ std::string Code = "ResNode = CurDAG->getTargetNode(" +
+ II.Namespace + "::" + II.TheDef->getName();
+
+ // Output order: results, chain, flags
+ // Result types.
+ if (NumResults > 0 && N->getTypeNum(0) != MVT::isVoid)
+ Code += ", MVT::" + getEnumName(N->getTypeNum(0));
+ if (HasChain)
+ Code += ", MVT::Other";
+ if (NodeHasOutFlag)
+ Code += ", MVT::Flag";
+
+ // Inputs.
+ for (unsigned i = 0, e = Ops.size(); i != e; ++i)
+ Code += ", Tmp" + utostr(Ops[i]);
+ if (HasChain) Code += ", " + ChainName;
+ if (HasInFlag || HasImpInputs) Code += ", InFlag";
+ emitCode(Code + ");");
}
- if (HasChain)
- OS << ", MVT::Other";
- if (HasOutFlag)
- OS << ", MVT::Flag";
- // Inputs.
- for (unsigned i = 0, e = Ops.size(); i != e; ++i)
- OS << ", Tmp" << Ops[i];
- if (HasChain) OS << ", Chain";
- if (HasInFlag) OS << ", InFlag";
- OS << ");\n";
-
- unsigned ValNo = 0;
- for (unsigned i = 0; i < NumResults; i++) {
- OS << " CodeGenMap[N.getValue(" << ValNo << ")] = Result"
- << ".getValue(" << ValNo << ");\n";
- ValNo++;
- }
+ if (NewTF)
+ emitCode("if (OldTF) "
+ "SelectionDAG::InsertISelMapEntry(CodeGenMap, OldTF, 0, " +
+ ChainName + ".Val, 0);");
- if (HasChain)
- OS << " Chain = Result.getValue(" << ValNo << ");\n";
+ for (unsigned i = 0; i < NumResults; i++)
+ emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " +
+ utostr(i) + ", ResNode, " + utostr(i) + ");");
- if (HasOutFlag)
- OS << " InFlag = Result.getValue("
- << ValNo + (unsigned)HasChain << ");\n";
+ if (NodeHasOutFlag)
+ emitCode("InFlag = SDOperand(ResNode, " +
+ utostr(NumResults + (unsigned)HasChain) + ");");
- if (HasImpResults) {
- if (EmitCopyFromRegs(N, HasChain)) {
- OS << " CodeGenMap[N.getValue(" << ValNo << ")] = "
- << "Result.getValue(" << ValNo << ");\n";
- ValNo++;
- HasChain = true;
- }
+ if (HasImpResults && EmitCopyFromRegs(N, ChainEmitted)) {
+ emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, "
+ "0, ResNode, 0);");
+ NumResults = 1;
}
- // User does not expect that the instruction produces a chain!
- bool AddedChain = HasChain && !NodeHasChain(Pattern, ISE);
- if (NodeHasChain(Pattern, ISE))
- OS << " CodeGenMap[N.getValue(" << ValNo++ << ")] = Chain;\n";
+ if (NodeHasChain) {
+ emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " +
+ utostr(PatResults) + ", ResNode, " +
+ utostr(NumResults) + ");");
+ if (DoReplace)
+ emitCode("if (N.ResNo == 0) AddHandleReplacement(N.Val, " +
+ utostr(PatResults) + ", " + "ResNode, " +
+ utostr(NumResults) + ");");
+ }
if (FoldedChains.size() > 0) {
- OS << " ";
+ std::string Code;
for (unsigned j = 0, e = FoldedChains.size(); j < e; j++)
- OS << "CodeGenMap[" << FoldedChains[j].first << ".getValue("
- << FoldedChains[j].second << ")] = ";
- OS << "Chain;\n";
+ emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, " +
+ FoldedChains[j].first + ".Val, " +
+ utostr(FoldedChains[j].second) + ", ResNode, " +
+ utostr(NumResults) + ");");
+
+ for (unsigned j = 0, e = FoldedChains.size(); j < e; j++) {
+ std::string Code =
+ FoldedChains[j].first + ".Val, " +
+ utostr(FoldedChains[j].second) + ", ";
+ emitCode("AddHandleReplacement(" + Code + "ResNode, " +
+ utostr(NumResults) + ");");
+ }
}
- if (HasOutFlag)
- OS << " CodeGenMap[N.getValue(" << ValNo << ")] = InFlag;\n";
+ if (NodeHasOutFlag)
+ emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " +
+ utostr(PatResults + (unsigned)NodeHasChain) +
+ ", InFlag.Val, InFlag.ResNo);");
- if (AddedChain && HasOutFlag) {
- if (NumResults == 0) {
- OS << " return Result.getValue(N.ResNo+1);\n";
+ // User does not expect the instruction would produce a chain!
+ bool AddedChain = HasChain && !NodeHasChain;
+ if (AddedChain && NodeHasOutFlag) {
+ if (PatResults == 0) {
+ emitCode("Result = SDOperand(ResNode, N.ResNo+1);");
} else {
- OS << " if (N.ResNo < " << NumResults << ")\n";
- OS << " return Result.getValue(N.ResNo);\n";
- OS << " else\n";
- OS << " return Result.getValue(N.ResNo+1);\n";
+ emitCode("if (N.ResNo < " + utostr(PatResults) + ")");
+ emitCode(" Result = SDOperand(ResNode, N.ResNo);");
+ emitCode("else");
+ emitCode(" Result = SDOperand(ResNode, N.ResNo+1);");
}
} else {
- OS << " return Result.getValue(N.ResNo);\n";
+ emitCode("Result = SDOperand(ResNode, N.ResNo);");
}
} else {
// If this instruction is the root, and if there is only one use of it,
// use SelectNodeTo instead of getTargetNode to avoid an allocation.
- OS << " if (N.Val->hasOneUse()) {\n";
- OS << " return CurDAG->SelectNodeTo(N.Val, "
- << II.Namespace << "::" << II.TheDef->getName();
- if (N->getType() != MVT::isVoid)
- OS << ", MVT::" << getEnumName(N->getType());
- if (HasOutFlag)
- OS << ", MVT::Flag";
+ emitCode("if (N.Val->hasOneUse()) {");
+ std::string Code = " Result = CurDAG->SelectNodeTo(N.Val, " +
+ II.Namespace + "::" + II.TheDef->getName();
+ if (N->getTypeNum(0) != MVT::isVoid)
+ Code += ", MVT::" + getEnumName(N->getTypeNum(0));
+ if (NodeHasOutFlag)
+ Code += ", MVT::Flag";
for (unsigned i = 0, e = Ops.size(); i != e; ++i)
- OS << ", Tmp" << Ops[i];
- if (HasInFlag)
- OS << ", InFlag";
- OS << ");\n";
- OS << " } else {\n";
- OS << " return CodeGenMap[N] = CurDAG->getTargetNode("
- << II.Namespace << "::" << II.TheDef->getName();
- if (N->getType() != MVT::isVoid)
- OS << ", MVT::" << getEnumName(N->getType());
- if (HasOutFlag)
- OS << ", MVT::Flag";
+ Code += ", Tmp" + utostr(Ops[i]);
+ if (HasInFlag || HasImpInputs)
+ Code += ", InFlag";
+ emitCode(Code + ");");
+ emitCode("} else {");
+ emitDecl("ResNode", true);
+ Code = " ResNode = CurDAG->getTargetNode(" +
+ II.Namespace + "::" + II.TheDef->getName();
+ if (N->getTypeNum(0) != MVT::isVoid)
+ Code += ", MVT::" + getEnumName(N->getTypeNum(0));
+ if (NodeHasOutFlag)
+ Code += ", MVT::Flag";
for (unsigned i = 0, e = Ops.size(); i != e; ++i)
- OS << ", Tmp" << Ops[i];
- if (HasInFlag)
- OS << ", InFlag";
- OS << ");\n";
- OS << " }\n";
+ Code += ", Tmp" + utostr(Ops[i]);
+ if (HasInFlag || HasImpInputs)
+ Code += ", InFlag";
+ emitCode(Code + ");");
+ emitCode(" SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
+ "ResNode, 0);");
+ emitCode(" Result = SDOperand(ResNode, 0);");
+ emitCode("}");
}
+ if (isRoot)
+ emitCode("return;");
return std::make_pair(1, ResNo);
} else if (Op->isSubClassOf("SDNodeXForm")) {
assert(N->getNumChildren() == 1 && "node xform should have one child!");
- unsigned OpVal = EmitResultCode(N->getChild(0)).second;
+ // PatLeaf node - the operand may or may not be a leaf node. But it should
+ // behave like one.
+ unsigned OpVal = EmitResultCode(N->getChild(0), true).second;
unsigned ResNo = TmpNo++;
- OS << " ";
- DeclareSDOperand("Tmp"+utostr(ResNo));
- OS << " = Transform_" << Op->getName()
- << "(Tmp" << OpVal << ".Val);\n";
+ emitDecl("Tmp" + utostr(ResNo));
+ emitCode("Tmp" + utostr(ResNo) + " = Transform_" + Op->getName()
+ + "(Tmp" + utostr(OpVal) + ".Val);");
if (isRoot) {
- OS << " CodeGenMap[N] = Tmp" << ResNo << ";\n";
- OS << " return Tmp" << ResNo << ";\n";
+ emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val,"
+ "N.ResNo, Tmp" + utostr(ResNo) + ".Val, Tmp" +
+ utostr(ResNo) + ".ResNo);");
+ emitCode("Result = Tmp" + utostr(ResNo) + ";");
+ emitCode("return;");
}
return std::make_pair(1, ResNo);
} else {
N->dump();
- assert(0 && "Unknown node in result pattern!");
- return std::make_pair(1, ~0U);
+ std::cerr << "\n";
+ throw std::string("Unknown node in result pattern!");
}
}
- /// InsertOneTypeCheck - Insert a type-check for an unresolved type in 'Pat' and
- /// add it to the tree. 'Pat' and 'Other' are isomorphic trees except that
+ /// InsertOneTypeCheck - Insert a type-check for an unresolved type in 'Pat'
+ /// and add it to the tree. 'Pat' and 'Other' are isomorphic trees except that
/// 'Pat' may be missing types. If we find an unresolved type to add a check
/// for, this returns true otherwise false if Pat has all types.
bool InsertOneTypeCheck(TreePatternNode *Pat, TreePatternNode *Other,
// Did we find one?
if (!Pat->hasTypeSet()) {
// Move a type over from 'other' to 'pat'.
- Pat->setType(Other->getType());
- OS << " if (" << Prefix << ".Val->getValueType(0) != MVT::"
- << getName(Pat->getType()) << ") goto P" << PatternNo << "Fail;\n";
+ Pat->setTypes(Other->getExtTypes());
+ emitCheck(Prefix + ".Val->getValueType(0) == MVT::" +
+ getName(Pat->getTypeNum(0)));
return true;
}
- unsigned OpNo = (unsigned) NodeHasChain(Pat, ISE);
+ unsigned OpNo =
+ (unsigned) NodeHasProperty(Pat, SDNodeInfo::SDNPHasChain, ISE);
for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i, ++OpNo)
if (InsertOneTypeCheck(Pat->getChild(i), Other->getChild(i),
Prefix + utostr(OpNo)))
}
private:
- /// EmitInFlags - Emit the flag operands for the DAG that is
+ /// EmitInFlagSelectCode - Emit the flag operands for the DAG that is
/// being built.
- void EmitInFlags(TreePatternNode *N, const std::string &RootName,
- bool HasChain, bool HasInFlag, bool isRoot = false) {
+ void EmitInFlagSelectCode(TreePatternNode *N, const std::string &RootName,
+ bool &ChainEmitted, bool isRoot = false) {
const CodeGenTarget &T = ISE.getTargetInfo();
- unsigned OpNo = (unsigned) NodeHasChain(N, ISE);
+ unsigned OpNo =
+ (unsigned) NodeHasProperty(N, SDNodeInfo::SDNPHasChain, ISE);
+ bool HasInFlag = NodeHasProperty(N, SDNodeInfo::SDNPInFlag, ISE);
+ bool HasOptInFlag = NodeHasProperty(N, SDNodeInfo::SDNPOptInFlag, ISE);
for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
TreePatternNode *Child = N->getChild(i);
if (!Child->isLeaf()) {
- EmitInFlags(Child, RootName + utostr(OpNo), HasChain, HasInFlag);
+ EmitInFlagSelectCode(Child, RootName + utostr(OpNo), ChainEmitted);
} else {
if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
+ if (!Child->getName().empty()) {
+ std::string Name = RootName + utostr(OpNo);
+ if (Duplicates.find(Name) != Duplicates.end())
+ // A duplicate! Do not emit a copy for this node.
+ continue;
+ }
+
Record *RR = DI->getDef();
if (RR->isSubClassOf("Register")) {
MVT::ValueType RVT = getRegisterValueType(RR, T);
if (RVT == MVT::Flag) {
- OS << " InFlag = Select(" << RootName << OpNo << ");\n";
- } else if (HasChain) {
- OS << " SDOperand " << RootName << "CR" << i << ";\n";
- OS << " " << RootName << "CR" << i
- << " = CurDAG->getCopyToReg(Chain, CurDAG->getRegister("
- << ISE.getQualifiedName(RR) << ", MVT::"
- << getEnumName(RVT) << ")"
- << ", Select(" << RootName << OpNo << "), InFlag);\n";
- OS << " Chain = " << RootName << "CR" << i
- << ".getValue(0);\n";
- OS << " InFlag = " << RootName << "CR" << i
- << ".getValue(1);\n";
+ emitCode("Select(InFlag, " + RootName + utostr(OpNo) + ");");
} else {
- OS << " InFlag = CurDAG->getCopyToReg(CurDAG->getEntryNode()"
- << ", CurDAG->getRegister(" << ISE.getQualifiedName(RR)
- << ", MVT::" << getEnumName(RVT) << ")"
- << ", Select(" << RootName << OpNo
- << "), InFlag).getValue(1);\n";
+ if (!ChainEmitted) {
+ emitDecl("Chain");
+ emitCode("Chain = CurDAG->getEntryNode();");
+ ChainName = "Chain";
+ ChainEmitted = true;
+ }
+ emitCode("Select(" + RootName + utostr(OpNo) + ", " +
+ RootName + utostr(OpNo) + ");");
+ emitCode("ResNode = CurDAG->getCopyToReg(" + ChainName +
+ ", CurDAG->getRegister(" + ISE.getQualifiedName(RR) +
+ ", MVT::" + getEnumName(RVT) + "), " +
+ RootName + utostr(OpNo) + ", InFlag).Val;");
+ emitCode(ChainName + " = SDOperand(ResNode, 0);");
+ emitCode("InFlag = SDOperand(ResNode, 1);");
}
}
}
}
}
- if (isRoot && HasInFlag) {
- OS << " " << RootName << OpNo << " = " << RootName
- << ".getOperand(" << OpNo << ");\n";
- OS << " InFlag = Select(" << RootName << OpNo << ");\n";
+ if (HasInFlag || HasOptInFlag) {
+ std::string Code;
+ if (HasOptInFlag) {
+ emitCode("if (" + RootName + ".getNumOperands() == " + utostr(OpNo+1) +
+ ") {");
+ Code = " ";
+ }
+ emitCode(Code + "Select(InFlag, " + RootName +
+ ".getOperand(" + utostr(OpNo) + "));");
+ if (HasOptInFlag) {
+ emitCode(" HasOptInFlag = true;");
+ emitCode("}");
+ }
}
}
/// EmitCopyFromRegs - Emit code to copy result to physical registers
/// as specified by the instruction. It returns true if any copy is
/// emitted.
- bool EmitCopyFromRegs(TreePatternNode *N, bool HasChain) {
+ bool EmitCopyFromRegs(TreePatternNode *N, bool &ChainEmitted) {
bool RetVal = false;
Record *Op = N->getOperator();
if (Op->isSubClassOf("Instruction")) {
if (RR->isSubClassOf("Register")) {
MVT::ValueType RVT = getRegisterValueType(RR, CGT);
if (RVT != MVT::Flag) {
- if (HasChain) {
- OS << " Result = CurDAG->getCopyFromReg(Chain, "
- << ISE.getQualifiedName(RR)
- << ", MVT::" << getEnumName(RVT) << ", InFlag);\n";
- OS << " Chain = Result.getValue(1);\n";
- OS << " InFlag = Result.getValue(2);\n";
- } else {
- OS << " Chain;\n";
- OS << " Result = CurDAG->getCopyFromReg("
- << "CurDAG->getEntryNode(), ISE.getQualifiedName(RR)"
- << ", MVT::" << getEnumName(RVT) << ", InFlag);\n";
- OS << " Chain = Result.getValue(1);\n";
- OS << " InFlag = Result.getValue(2);\n";
+ if (!ChainEmitted) {
+ emitDecl("Chain");
+ emitCode("Chain = CurDAG->getEntryNode();");
+ ChainEmitted = true;
+ ChainName = "Chain";
}
+ emitCode("ResNode = CurDAG->getCopyFromReg(" + ChainName + ", " +
+ ISE.getQualifiedName(RR) + ", MVT::" + getEnumName(RVT) +
+ ", InFlag).Val;");
+ emitCode(ChainName + " = SDOperand(ResNode, 1);");
+ emitCode("InFlag = SDOperand(ResNode, 2);");
RetVal = true;
}
}
/// EmitCodeForPattern - Given a pattern to match, emit code to the specified
/// stream to match the pattern, and generate the code for the match if it
-/// succeeds.
-void DAGISelEmitter::EmitCodeForPattern(PatternToMatch &Pattern,
- std::ostream &OS) {
- static unsigned PatternCount = 0;
- unsigned PatternNo = PatternCount++;
- OS << " { // Pattern #" << PatternNo << ": ";
- Pattern.getSrcPattern()->print(OS);
- OS << "\n // Emits: ";
- Pattern.getDstPattern()->print(OS);
- OS << "\n";
- OS << " // Pattern complexity = "
- << getPatternSize(Pattern.getSrcPattern(), *this)
- << " cost = "
- << getResultPatternCost(Pattern.getDstPattern()) << "\n";
-
+/// succeeds. Returns true if the pattern is not guaranteed to match.
+void DAGISelEmitter::GenerateCodeForPattern(PatternToMatch &Pattern,
+ std::vector<std::pair<bool, std::string> > &GeneratedCode,
+ std::set<std::pair<bool, std::string> > &GeneratedDecl,
+ bool DoReplace) {
PatternCodeEmitter Emitter(*this, Pattern.getPredicates(),
Pattern.getSrcPattern(), Pattern.getDstPattern(),
- PatternNo, OS);
+ GeneratedCode, GeneratedDecl, DoReplace);
// Emit the matcher, capturing named arguments in VariableMap.
bool FoundChain = false;
- Emitter.EmitMatchCode(Pattern.getSrcPattern(), "N", FoundChain,
- true /*the root*/);
+ Emitter.EmitMatchCode(Pattern.getSrcPattern(), NULL, "N", "", "", FoundChain);
// TP - Get *SOME* tree pattern, we don't care which.
TreePattern &TP = *PatternFragments.begin()->second;
try {
bool MadeChange = true;
while (MadeChange)
- MadeChange = Pat->ApplyTypeConstraints(TP,true/*Ignore reg constraints*/);
+ MadeChange = Pat->ApplyTypeConstraints(TP,
+ true/*Ignore reg constraints*/);
} catch (...) {
assert(0 && "Error: could not find consistent types for something we"
" already decided was ok!");
// otherwise we are done.
} while (Emitter.InsertOneTypeCheck(Pat, Pattern.getSrcPattern(), "N"));
- Emitter.EmitResultCode(Pattern.getDstPattern(), true /*the root*/);
-
+ Emitter.EmitResultCode(Pattern.getDstPattern(), false, true /*the root*/);
delete Pat;
+}
+
+/// EraseCodeLine - Erase one code line from all of the patterns. If removing
+/// a line causes any of them to be empty, remove them and return true when
+/// done.
+static bool EraseCodeLine(std::vector<std::pair<PatternToMatch*,
+ std::vector<std::pair<bool, std::string> > > >
+ &Patterns) {
+ bool ErasedPatterns = false;
+ for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
+ Patterns[i].second.pop_back();
+ if (Patterns[i].second.empty()) {
+ Patterns.erase(Patterns.begin()+i);
+ --i; --e;
+ ErasedPatterns = true;
+ }
+ }
+ return ErasedPatterns;
+}
+
+/// EmitPatterns - Emit code for at least one pattern, but try to group common
+/// code together between the patterns.
+void DAGISelEmitter::EmitPatterns(std::vector<std::pair<PatternToMatch*,
+ std::vector<std::pair<bool, std::string> > > >
+ &Patterns, unsigned Indent,
+ std::ostream &OS) {
+ typedef std::pair<bool, std::string> CodeLine;
+ typedef std::vector<CodeLine> CodeList;
+ typedef std::vector<std::pair<PatternToMatch*, CodeList> > PatternList;
+
+ if (Patterns.empty()) return;
+
+ // Figure out how many patterns share the next code line. Explicitly copy
+ // FirstCodeLine so that we don't invalidate a reference when changing
+ // Patterns.
+ const CodeLine FirstCodeLine = Patterns.back().second.back();
+ unsigned LastMatch = Patterns.size()-1;
+ while (LastMatch != 0 && Patterns[LastMatch-1].second.back() == FirstCodeLine)
+ --LastMatch;
+
+ // If not all patterns share this line, split the list into two pieces. The
+ // first chunk will use this line, the second chunk won't.
+ if (LastMatch != 0) {
+ PatternList Shared(Patterns.begin()+LastMatch, Patterns.end());
+ PatternList Other(Patterns.begin(), Patterns.begin()+LastMatch);
+
+ // FIXME: Emit braces?
+ if (Shared.size() == 1) {
+ PatternToMatch &Pattern = *Shared.back().first;
+ OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
+ Pattern.getSrcPattern()->print(OS);
+ OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
+ Pattern.getDstPattern()->print(OS);
+ OS << "\n";
+ OS << std::string(Indent, ' ') << "// Pattern complexity = "
+ << getPatternSize(Pattern.getSrcPattern(), *this) << " cost = "
+ << getResultPatternCost(Pattern.getDstPattern(), *this) << "\n";
+ }
+ if (!FirstCodeLine.first) {
+ OS << std::string(Indent, ' ') << "{\n";
+ Indent += 2;
+ }
+ EmitPatterns(Shared, Indent, OS);
+ if (!FirstCodeLine.first) {
+ Indent -= 2;
+ OS << std::string(Indent, ' ') << "}\n";
+ }
+
+ if (Other.size() == 1) {
+ PatternToMatch &Pattern = *Other.back().first;
+ OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
+ Pattern.getSrcPattern()->print(OS);
+ OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
+ Pattern.getDstPattern()->print(OS);
+ OS << "\n";
+ OS << std::string(Indent, ' ') << "// Pattern complexity = "
+ << getPatternSize(Pattern.getSrcPattern(), *this) << " cost = "
+ << getResultPatternCost(Pattern.getDstPattern(), *this) << "\n";
+ }
+ EmitPatterns(Other, Indent, OS);
+ return;
+ }
- OS << " }\n P" << PatternNo << "Fail:\n";
+ // Remove this code from all of the patterns that share it.
+ bool ErasedPatterns = EraseCodeLine(Patterns);
+
+ bool isPredicate = FirstCodeLine.first;
+
+ // Otherwise, every pattern in the list has this line. Emit it.
+ if (!isPredicate) {
+ // Normal code.
+ OS << std::string(Indent, ' ') << FirstCodeLine.second << "\n";
+ } else {
+ OS << std::string(Indent, ' ') << "if (" << FirstCodeLine.second;
+
+ // If the next code line is another predicate, and if all of the pattern
+ // in this group share the same next line, emit it inline now. Do this
+ // until we run out of common predicates.
+ while (!ErasedPatterns && Patterns.back().second.back().first) {
+ // Check that all of fhe patterns in Patterns end with the same predicate.
+ bool AllEndWithSamePredicate = true;
+ for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
+ if (Patterns[i].second.back() != Patterns.back().second.back()) {
+ AllEndWithSamePredicate = false;
+ break;
+ }
+ // If all of the predicates aren't the same, we can't share them.
+ if (!AllEndWithSamePredicate) break;
+
+ // Otherwise we can. Emit it shared now.
+ OS << " &&\n" << std::string(Indent+4, ' ')
+ << Patterns.back().second.back().second;
+ ErasedPatterns = EraseCodeLine(Patterns);
+ }
+
+ OS << ") {\n";
+ Indent += 2;
+ }
+
+ EmitPatterns(Patterns, Indent, OS);
+
+ if (isPredicate)
+ OS << std::string(Indent-2, ' ') << "}\n";
}
+
namespace {
/// CompareByRecordName - An ordering predicate that implements less-than by
/// comparing the names records.
std::string InstNS = Target.inst_begin()->second.Namespace;
if (!InstNS.empty()) InstNS += "::";
+ // Group the patterns by their top-level opcodes.
+ std::map<Record*, std::vector<PatternToMatch*>,
+ CompareByRecordName> PatternsByOpcode;
+ for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
+ TreePatternNode *Node = PatternsToMatch[i].getSrcPattern();
+ if (!Node->isLeaf()) {
+ PatternsByOpcode[Node->getOperator()].push_back(&PatternsToMatch[i]);
+ } else {
+ const ComplexPattern *CP;
+ if (IntInit *II =
+ dynamic_cast<IntInit*>(Node->getLeafValue())) {
+ PatternsByOpcode[getSDNodeNamed("imm")].push_back(&PatternsToMatch[i]);
+ } else if ((CP = NodeGetComplexPattern(Node, *this))) {
+ std::vector<Record*> OpNodes = CP->getRootNodes();
+ for (unsigned j = 0, e = OpNodes.size(); j != e; j++) {
+ PatternsByOpcode[OpNodes[j]]
+ .insert(PatternsByOpcode[OpNodes[j]].begin(), &PatternsToMatch[i]);
+ }
+ } else {
+ std::cerr << "Unrecognized opcode '";
+ Node->dump();
+ std::cerr << "' on tree pattern '";
+ std::cerr <<
+ PatternsToMatch[i].getDstPattern()->getOperator()->getName();
+ std::cerr << "'!\n";
+ exit(1);
+ }
+ }
+ }
+
+ // Emit one Select_* method for each top-level opcode. We do this instead of
+ // emitting one giant switch statement to support compilers where this will
+ // result in the recursive functions taking less stack space.
+ for (std::map<Record*, std::vector<PatternToMatch*>,
+ CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
+ E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
+ const std::string &OpName = PBOI->first->getName();
+ OS << "void Select_" << OpName << "(SDOperand &Result, SDOperand N) {\n";
+
+ const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
+ bool OptSlctOrder =
+ (OpcodeInfo.hasProperty(SDNodeInfo::SDNPHasChain) &&
+ OpcodeInfo.getNumResults() > 0);
+
+ if (OptSlctOrder) {
+ OS << " if (N.ResNo == " << OpcodeInfo.getNumResults()
+ << " && N.getValue(0).hasOneUse()) {\n"
+ << " SDOperand Dummy = "
+ << "CurDAG->getNode(ISD::HANDLENODE, MVT::Other, N);\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, "
+ << OpcodeInfo.getNumResults() << ", Dummy.Val, 0);\n"
+ << " SelectionDAG::InsertISelMapEntry(HandleMap, N.Val, "
+ << OpcodeInfo.getNumResults() << ", Dummy.Val, 0);\n"
+ << " Result = Dummy;\n"
+ << " return;\n"
+ << " }\n";
+ }
+
+ std::vector<PatternToMatch*> &Patterns = PBOI->second;
+ assert(!Patterns.empty() && "No patterns but map has entry?");
+
+ // We want to emit all of the matching code now. However, we want to emit
+ // the matches in order of minimal cost. Sort the patterns so the least
+ // cost one is at the start.
+ std::stable_sort(Patterns.begin(), Patterns.end(),
+ PatternSortingPredicate(*this));
+
+ typedef std::vector<std::pair<bool, std::string> > CodeList;
+ typedef std::set<std::string> DeclSet;
+
+ std::vector<std::pair<PatternToMatch*, CodeList> > CodeForPatterns;
+ std::set<std::pair<bool, std::string> > GeneratedDecl;
+ for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
+ CodeList GeneratedCode;
+ GenerateCodeForPattern(*Patterns[i], GeneratedCode, GeneratedDecl,
+ OptSlctOrder);
+ CodeForPatterns.push_back(std::make_pair(Patterns[i], GeneratedCode));
+ }
+
+ // Scan the code to see if all of the patterns are reachable and if it is
+ // possible that the last one might not match.
+ bool mightNotMatch = true;
+ for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
+ CodeList &GeneratedCode = CodeForPatterns[i].second;
+ mightNotMatch = false;
+
+ for (unsigned j = 0, e = GeneratedCode.size(); j != e; ++j) {
+ if (GeneratedCode[j].first) { // predicate.
+ mightNotMatch = true;
+ break;
+ }
+ }
+
+ // If this pattern definitely matches, and if it isn't the last one, the
+ // patterns after it CANNOT ever match. Error out.
+ if (mightNotMatch == false && i != CodeForPatterns.size()-1) {
+ std::cerr << "Pattern '";
+ CodeForPatterns[i+1].first->getSrcPattern()->print(OS);
+ std::cerr << "' is impossible to select!\n";
+ exit(1);
+ }
+ }
+
+ // Print all declarations.
+ for (std::set<std::pair<bool, std::string> >::iterator
+ I = GeneratedDecl.begin(), E = GeneratedDecl.end(); I != E; ++I)
+ if (I->first)
+ OS << " SDNode *" << I->second << ";\n";
+ else
+ OS << " SDOperand " << I->second << "(0, 0);\n";
+
+ // Loop through and reverse all of the CodeList vectors, as we will be
+ // accessing them from their logical front, but accessing the end of a
+ // vector is more efficient.
+ for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
+ CodeList &GeneratedCode = CodeForPatterns[i].second;
+ std::reverse(GeneratedCode.begin(), GeneratedCode.end());
+ }
+
+ // Next, reverse the list of patterns itself for the same reason.
+ std::reverse(CodeForPatterns.begin(), CodeForPatterns.end());
+
+ // Emit all of the patterns now, grouped together to share code.
+ EmitPatterns(CodeForPatterns, 2, OS);
+
+ // If the last pattern has predicates (which could fail) emit code to catch
+ // the case where nothing handles a pattern.
+ if (mightNotMatch)
+ OS << " std::cerr << \"Cannot yet select: \";\n"
+ << " N.Val->dump(CurDAG);\n"
+ << " std::cerr << '\\n';\n"
+ << " abort();\n";
+
+ OS << "}\n\n";
+ }
+
// Emit boilerplate.
+ OS << "void Select_INLINEASM(SDOperand& Result, SDOperand N) {\n"
+ << " std::vector<SDOperand> Ops(N.Val->op_begin(), N.Val->op_end());\n"
+ << " Select(Ops[0], N.getOperand(0)); // Select the chain.\n\n"
+ << " // Select the flag operand.\n"
+ << " if (Ops.back().getValueType() == MVT::Flag)\n"
+ << " Select(Ops.back(), Ops.back());\n"
+ << " SelectInlineAsmMemoryOperands(Ops, *CurDAG);\n"
+ << " std::vector<MVT::ValueType> VTs;\n"
+ << " VTs.push_back(MVT::Other);\n"
+ << " VTs.push_back(MVT::Flag);\n"
+ << " SDOperand New = CurDAG->getNode(ISD::INLINEASM, VTs, Ops);\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, New.Val, 0);\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, New.Val, 1);\n"
+ << " Result = New.getValue(N.ResNo);\n"
+ << " return;\n"
+ << "}\n\n";
+
OS << "// The main instruction selector code.\n"
- << "SDOperand SelectCode(SDOperand N) {\n"
+ << "void SelectCode(SDOperand &Result, SDOperand N) {\n"
<< " if (N.getOpcode() >= ISD::BUILTIN_OP_END &&\n"
<< " N.getOpcode() < (ISD::BUILTIN_OP_END+" << InstNS
- << "INSTRUCTION_LIST_END))\n"
- << " return N; // Already selected.\n\n"
+ << "INSTRUCTION_LIST_END)) {\n"
+ << " Result = N;\n"
+ << " return; // Already selected.\n"
+ << " }\n\n"
<< " std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(N);\n"
- << " if (CGMI != CodeGenMap.end()) return CGMI->second;\n"
- << " // Work arounds for GCC stack overflow bugs.\n"
- << " SDOperand N0, N1, N2, N00, N01, N10, N11, Tmp0, Tmp1, Tmp2, Tmp3;\n"
- << " SDOperand Chain, InFlag, Result;\n"
+ << " if (CGMI != CodeGenMap.end()) {\n"
+ << " Result = CGMI->second;\n"
+ << " return;\n"
+ << " }\n\n"
<< " switch (N.getOpcode()) {\n"
<< " default: break;\n"
<< " case ISD::EntryToken: // These leaves remain the same.\n"
<< " case ISD::BasicBlock:\n"
- << " return N;\n"
+ << " case ISD::Register:\n"
+ << " case ISD::HANDLENODE:\n"
+ << " case ISD::TargetConstant:\n"
+ << " case ISD::TargetConstantPool:\n"
+ << " case ISD::TargetFrameIndex:\n"
+ << " case ISD::TargetGlobalAddress: {\n"
+ << " Result = N;\n"
+ << " return;\n"
+ << " }\n"
<< " case ISD::AssertSext:\n"
<< " case ISD::AssertZext: {\n"
- << " SDOperand Tmp0 = Select(N.getOperand(0));\n"
- << " if (!N.Val->hasOneUse()) CodeGenMap[N] = Tmp0;\n"
- << " return Tmp0;\n"
+ << " SDOperand Tmp0;\n"
+ << " Select(Tmp0, N.getOperand(0));\n"
+ << " if (!N.Val->hasOneUse())\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
+ << "Tmp0.Val, Tmp0.ResNo);\n"
+ << " Result = Tmp0;\n"
+ << " return;\n"
<< " }\n"
<< " case ISD::TokenFactor:\n"
<< " if (N.getNumOperands() == 2) {\n"
- << " SDOperand Op0 = Select(N.getOperand(0));\n"
- << " SDOperand Op1 = Select(N.getOperand(1));\n"
- << " return CodeGenMap[N] =\n"
+ << " SDOperand Op0, Op1;\n"
+ << " Select(Op0, N.getOperand(0));\n"
+ << " Select(Op1, N.getOperand(1));\n"
+ << " Result = \n"
<< " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Op0, Op1);\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
+ << "Result.Val, Result.ResNo);\n"
<< " } else {\n"
<< " std::vector<SDOperand> Ops;\n"
- << " for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i)\n"
- << " Ops.push_back(Select(N.getOperand(i)));\n"
- << " return CodeGenMap[N] = \n"
- << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Ops);\n"
+ << " for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i) {\n"
+ << " SDOperand Val;\n"
+ << " Select(Val, N.getOperand(i));\n"
+ << " Ops.push_back(Val);\n"
+ << " }\n"
+ << " Result = \n"
+ << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Ops);\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
+ << "Result.Val, Result.ResNo);\n"
<< " }\n"
+ << " return;\n"
<< " case ISD::CopyFromReg: {\n"
- << " Chain = Select(N.getOperand(0));\n"
+ << " SDOperand Chain;\n"
+ << " Select(Chain, N.getOperand(0));\n"
<< " unsigned Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();\n"
<< " MVT::ValueType VT = N.Val->getValueType(0);\n"
<< " if (N.Val->getNumValues() == 2) {\n"
- << " if (Chain == N.getOperand(0)) return N; // No change\n"
+ << " if (Chain == N.getOperand(0)) {\n"
+ << " Result = N; // No change\n"
+ << " return;\n"
+ << " }\n"
<< " SDOperand New = CurDAG->getCopyFromReg(Chain, Reg, VT);\n"
- << " CodeGenMap[N.getValue(0)] = New;\n"
- << " CodeGenMap[N.getValue(1)] = New.getValue(1);\n"
- << " return New.getValue(N.ResNo);\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
+ << "New.Val, 0);\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, "
+ << "New.Val, 1);\n"
+ << " Result = New.getValue(N.ResNo);\n"
+ << " return;\n"
<< " } else {\n"
- << " SDOperand Flag(0, 0);\n"
- << " if (N.getNumOperands() == 3) Flag = Select(N.getOperand(2));\n"
+ << " SDOperand Flag;\n"
+ << " if (N.getNumOperands() == 3) Select(Flag, N.getOperand(2));\n"
<< " if (Chain == N.getOperand(0) &&\n"
- << " (N.getNumOperands() == 2 || Flag == N.getOperand(2)))\n"
- << " return N; // No change\n"
+ << " (N.getNumOperands() == 2 || Flag == N.getOperand(2))) {\n"
+ << " Result = N; // No change\n"
+ << " return;\n"
+ << " }\n"
<< " SDOperand New = CurDAG->getCopyFromReg(Chain, Reg, VT, Flag);\n"
- << " CodeGenMap[N.getValue(0)] = New;\n"
- << " CodeGenMap[N.getValue(1)] = New.getValue(1);\n"
- << " CodeGenMap[N.getValue(2)] = New.getValue(2);\n"
- << " return New.getValue(N.ResNo);\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
+ << "New.Val, 0);\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, "
+ << "New.Val, 1);\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 2, "
+ << "New.Val, 2);\n"
+ << " Result = New.getValue(N.ResNo);\n"
+ << " return;\n"
<< " }\n"
<< " }\n"
<< " case ISD::CopyToReg: {\n"
- << " Chain = Select(N.getOperand(0));\n"
+ << " SDOperand Chain;\n"
+ << " Select(Chain, N.getOperand(0));\n"
<< " unsigned Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();\n"
- << " SDOperand Val = Select(N.getOperand(2));\n"
+ << " SDOperand Val;\n"
+ << " Select(Val, N.getOperand(2));\n"
<< " Result = N;\n"
<< " if (N.Val->getNumValues() == 1) {\n"
<< " if (Chain != N.getOperand(0) || Val != N.getOperand(2))\n"
<< " Result = CurDAG->getCopyToReg(Chain, Reg, Val);\n"
- << " return CodeGenMap[N] = Result;\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
+ << "Result.Val, 0);\n"
<< " } else {\n"
<< " SDOperand Flag(0, 0);\n"
- << " if (N.getNumOperands() == 4) Flag = Select(N.getOperand(3));\n"
+ << " if (N.getNumOperands() == 4) Select(Flag, N.getOperand(3));\n"
<< " if (Chain != N.getOperand(0) || Val != N.getOperand(2) ||\n"
<< " (N.getNumOperands() == 4 && Flag != N.getOperand(3)))\n"
<< " Result = CurDAG->getCopyToReg(Chain, Reg, Val, Flag);\n"
- << " CodeGenMap[N.getValue(0)] = Result;\n"
- << " CodeGenMap[N.getValue(1)] = Result.getValue(1);\n"
- << " return Result.getValue(N.ResNo);\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
+ << "Result.Val, 0);\n"
+ << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, "
+ << "Result.Val, 1);\n"
+ << " Result = Result.getValue(N.ResNo);\n"
<< " }\n"
- << " }\n";
+ << " return;\n"
+ << " }\n"
+ << " case ISD::INLINEASM: Select_INLINEASM(Result, N); return;\n";
+
- // Group the patterns by their top-level opcodes.
- std::map<Record*, std::vector<PatternToMatch*>,
- CompareByRecordName> PatternsByOpcode;
- for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
- TreePatternNode *Node = PatternsToMatch[i].getSrcPattern();
- if (!Node->isLeaf()) {
- PatternsByOpcode[Node->getOperator()].push_back(&PatternsToMatch[i]);
- } else {
- const ComplexPattern *CP;
- if (IntInit *II =
- dynamic_cast<IntInit*>(Node->getLeafValue())) {
- PatternsByOpcode[getSDNodeNamed("imm")].push_back(&PatternsToMatch[i]);
- } else if ((CP = NodeGetComplexPattern(Node, *this))) {
- std::vector<Record*> OpNodes = CP->getRootNodes();
- for (unsigned j = 0, e = OpNodes.size(); j != e; j++) {
- PatternsByOpcode[OpNodes[j]].insert(PatternsByOpcode[OpNodes[j]].begin(),
- &PatternsToMatch[i]);
- }
- } else {
- std::cerr << "Unrecognized opcode '";
- Node->dump();
- std::cerr << "' on tree pattern '";
- std::cerr << PatternsToMatch[i].getDstPattern()->getOperator()->getName();
- std::cerr << "'!\n";
- exit(1);
- }
- }
- }
-
- // Loop over all of the case statements.
+ // Loop over all of the case statements, emiting a call to each method we
+ // emitted above.
for (std::map<Record*, std::vector<PatternToMatch*>,
CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
- std::vector<PatternToMatch*> &Patterns = PBOI->second;
-
- OS << " case " << OpcodeInfo.getEnumName() << ":\n";
-
- // We want to emit all of the matching code now. However, we want to emit
- // the matches in order of minimal cost. Sort the patterns so the least
- // cost one is at the start.
- std::stable_sort(Patterns.begin(), Patterns.end(),
- PatternSortingPredicate(*this));
-
- for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
- EmitCodeForPattern(*Patterns[i], OS);
- OS << " break;\n\n";
+ OS << " case " << OpcodeInfo.getEnumName() << ": "
+ << std::string(std::max(0, int(24-OpcodeInfo.getEnumName().size())), ' ')
+ << "Select_" << PBOI->first->getName() << "(Result, N); return;\n";
}
-
OS << " } // end of big switch.\n\n"
<< " std::cerr << \"Cannot yet select: \";\n"
OS << "// Instance var to keep track of multiply used nodes that have \n"
<< "// already been selected.\n"
<< "std::map<SDOperand, SDOperand> CodeGenMap;\n";
+
+ OS << "// Instance var to keep track of mapping of chain generating nodes\n"
+ << "// and their place handle nodes.\n";
+ OS << "std::map<SDOperand, SDOperand> HandleMap;\n";
+ OS << "// Instance var to keep track of mapping of place handle nodes\n"
+ << "// and their replacement nodes.\n";
+ OS << "std::map<SDOperand, SDOperand> ReplaceMap;\n";
+
+ OS << "\n";
+ OS << "static void findNonImmUse(SDNode* Use, SDNode* Def, bool &found, "
+ << "std::set<SDNode *> &Visited) {\n";
+ OS << " if (found || !Visited.insert(Use).second) return;\n";
+ OS << " for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {\n";
+ OS << " SDNode *N = Use->getOperand(i).Val;\n";
+ OS << " if (N->getNodeDepth() >= Def->getNodeDepth()) {\n";
+ OS << " if (N != Def) {\n";
+ OS << " findNonImmUse(N, Def, found, Visited);\n";
+ OS << " } else {\n";
+ OS << " found = true;\n";
+ OS << " break;\n";
+ OS << " }\n";
+ OS << " }\n";
+ OS << " }\n";
+ OS << "}\n";
+
+ OS << "\n";
+ OS << "static bool isNonImmUse(SDNode* Use, SDNode* Def) {\n";
+ OS << " std::set<SDNode *> Visited;\n";
+ OS << " bool found = false;\n";
+ OS << " for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {\n";
+ OS << " SDNode *N = Use->getOperand(i).Val;\n";
+ OS << " if (N != Def) {\n";
+ OS << " findNonImmUse(N, Def, found, Visited);\n";
+ OS << " if (found) break;\n";
+ OS << " }\n";
+ OS << " }\n";
+ OS << " return found;\n";
+ OS << "}\n";
+
+ OS << "\n";
+ OS << "// AddHandleReplacement - Note the pending replacement node for a\n"
+ << "// handle node in ReplaceMap.\n";
+ OS << "void AddHandleReplacement(SDNode *H, unsigned HNum, SDNode *R, "
+ << "unsigned RNum) {\n";
+ OS << " SDOperand N(H, HNum);\n";
+ OS << " std::map<SDOperand, SDOperand>::iterator HMI = HandleMap.find(N);\n";
+ OS << " if (HMI != HandleMap.end()) {\n";
+ OS << " ReplaceMap[HMI->second] = SDOperand(R, RNum);\n";
+ OS << " HandleMap.erase(N);\n";
+ OS << " }\n";
+ OS << "}\n";
+
+ OS << "\n";
+ OS << "// SelectDanglingHandles - Select replacements for all `dangling`\n";
+ OS << "// handles.Some handles do not yet have replacements because the\n";
+ OS << "// nodes they replacements have only dead readers.\n";
+ OS << "void SelectDanglingHandles() {\n";
+ OS << " for (std::map<SDOperand, SDOperand>::iterator I = "
+ << "HandleMap.begin(),\n"
+ << " E = HandleMap.end(); I != E; ++I) {\n";
+ OS << " SDOperand N = I->first;\n";
+ OS << " SDOperand R;\n";
+ OS << " Select(R, N.getValue(0));\n";
+ OS << " AddHandleReplacement(N.Val, N.ResNo, R.Val, R.ResNo);\n";
+ OS << " }\n";
+ OS << "}\n";
+ OS << "\n";
+ OS << "// ReplaceHandles - Replace all the handles with the real target\n";
+ OS << "// specific nodes.\n";
+ OS << "void ReplaceHandles() {\n";
+ OS << " for (std::map<SDOperand, SDOperand>::iterator I = "
+ << "ReplaceMap.begin(),\n"
+ << " E = ReplaceMap.end(); I != E; ++I) {\n";
+ OS << " SDOperand From = I->first;\n";
+ OS << " SDOperand To = I->second;\n";
+ OS << " for (SDNode::use_iterator UI = From.Val->use_begin(), "
+ << "E = From.Val->use_end(); UI != E; ++UI) {\n";
+ OS << " SDNode *Use = *UI;\n";
+ OS << " std::vector<SDOperand> Ops;\n";
+ OS << " for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {\n";
+ OS << " SDOperand O = Use->getOperand(i);\n";
+ OS << " if (O.Val == From.Val)\n";
+ OS << " Ops.push_back(To);\n";
+ OS << " else\n";
+ OS << " Ops.push_back(O);\n";
+ OS << " }\n";
+ OS << " SDOperand U = SDOperand(Use, 0);\n";
+ OS << " CurDAG->UpdateNodeOperands(U, Ops);\n";
+ OS << " }\n";
+ OS << " }\n";
+ OS << "}\n";
+
+ OS << "\n";
+ OS << "// UpdateFoldedChain - return a SDOperand of the new chain created\n";
+ OS << "// if the folding were to happen. This is called when, for example,\n";
+ OS << "// a load is folded into a store. If the store's chain is the load,\n";
+ OS << "// then the resulting node's input chain would be the load's input\n";
+ OS << "// chain. If the store's chain is a TokenFactor and the load's\n";
+ OS << "// output chain feeds into in, then the new chain is a TokenFactor\n";
+ OS << "// with the other operands along with the input chain of the load.\n";
+ OS << "SDOperand UpdateFoldedChain(SelectionDAG *DAG, SDNode *N, "
+ << "SDNode *Chain, SDNode* &OldTF) {\n";
+ OS << " OldTF = NULL;\n";
+ OS << " if (N == Chain) {\n";
+ OS << " return N->getOperand(0);\n";
+ OS << " } else if (Chain->getOpcode() == ISD::TokenFactor &&\n";
+ OS << " N->isOperand(Chain)) {\n";
+ OS << " SDOperand Ch = SDOperand(Chain, 0);\n";
+ OS << " std::map<SDOperand, SDOperand>::iterator CGMI = "
+ << "CodeGenMap.find(Ch);\n";
+ OS << " if (CGMI != CodeGenMap.end())\n";
+ OS << " return SDOperand(0, 0);\n";
+ OS << " OldTF = Chain;\n";
+ OS << " std::vector<SDOperand> Ops;\n";
+ OS << " for (unsigned i = 0; i < Chain->getNumOperands(); ++i) {\n";
+ OS << " SDOperand Op = Chain->getOperand(i);\n";
+ OS << " if (Op.Val == N)\n";
+ OS << " Ops.push_back(N->getOperand(0));\n";
+ OS << " else\n";
+ OS << " Ops.push_back(Op);\n";
+ OS << " }\n";
+ OS << " return DAG->getNode(ISD::TokenFactor, MVT::Other, Ops);\n";
+ OS << " }\n";
+ OS << " return SDOperand(0, 0);\n";
+ OS << "}\n";
+
+ OS << "\n";
+ OS << "// SelectRoot - Top level entry to DAG isel.\n";
+ OS << "SDOperand SelectRoot(SDOperand N) {\n";
+ OS << " SDOperand ResNode;\n";
+ OS << " Select(ResNode, N);\n";
+ OS << " SelectDanglingHandles();\n";
+ OS << " ReplaceHandles();\n";
+ OS << " ReplaceMap.clear();\n";
+ OS << " return ResNode;\n";
+ OS << "}\n";
+ Intrinsics = LoadIntrinsics(Records);
ParseNodeInfo();
ParseNodeTransforms(OS);
ParseComplexPatterns();
projects / oota-llvm.git / blobdiff