X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=utils%2FTableGen%2FDAGISelEmitter.cpp;h=4a399cdfc03155bbd695ab7bea8e1ae7edf91ed6;hb=d386e55e33c600d1a9af9317764f6b3415e3b922;hp=228f6bff5faee7a2de4124ffb34412e6895236e4;hpb=8020a5233cbdc20f5262467831256b97803f8e57;p=oota-llvm.git diff --git a/utils/TableGen/DAGISelEmitter.cpp b/utils/TableGen/DAGISelEmitter.cpp index 228f6bff5fa..4a399cdfc03 100644 --- a/utils/TableGen/DAGISelEmitter.cpp +++ b/utils/TableGen/DAGISelEmitter.cpp @@ -63,16 +63,17 @@ static bool LHSIsSubsetOfRHS(const std::vector &LHS, /// isExtIntegerVT - Return true if the specified extended value type vector /// contains isInt or an integer value type. -static bool isExtIntegerInVTs(std::vector EVTs) { +static bool isExtIntegerInVTs(const std::vector &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(std::vector EVTs) { +static bool isExtFloatingPointInVTs(const std::vector &EVTs) { assert(!EVTs.empty() && "Cannot check for integer in empty ExtVT list!"); - return EVTs[0] == MVT::isFP || !(FilterEVTs(EVTs, MVT::isFloatingPoint).empty()); + return EVTs[0] == MVT::isFP || + !(FilterEVTs(EVTs, MVT::isFloatingPoint).empty()); } //===----------------------------------------------------------------------===// @@ -102,6 +103,10 @@ SDTypeConstraint::SDTypeConstraint(Record *R) { 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); @@ -151,7 +156,7 @@ bool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N, return NodeToApply->UpdateNodeType(x.SDTCisVT_Info.VT, TP); case SDTCisPtrTy: { // Operand must be same as target pointer type. - return NodeToApply->UpdateNodeType(CGT.getPointerType(), TP); + return NodeToApply->UpdateNodeType(MVT::iPTR, TP); } case SDTCisInt: { // If there is only one integer type supported, this must be it. @@ -258,6 +263,19 @@ bool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N, } 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; } @@ -328,6 +346,18 @@ bool TreePatternNode::UpdateNodeType(const std::vector &ExtVTs, setTypes(ExtVTs); return true; } + + if (getExtTypeNum(0) == MVT::iPTR) { + if (ExtVTs[0] == MVT::iPTR || ExtVTs[0] == MVT::isInt) + return false; + if (isExtIntegerInVTs(ExtVTs)) { + std::vector FVTs = FilterEVTs(ExtVTs, MVT::isInteger); + if (FVTs.size()) { + setTypes(ExtVTs); + return true; + } + } + } if (ExtVTs[0] == MVT::isInt && isExtIntegerInVTs(getExtTypes())) { assert(hasTypeSet() && "should be handled above!"); @@ -337,9 +367,20 @@ bool TreePatternNode::UpdateNodeType(const std::vector &ExtVTs, setTypes(FVTs); return true; } + if (ExtVTs[0] == MVT::iPTR && isExtIntegerInVTs(getExtTypes())) { + //assert(hasTypeSet() && "should be handled above!"); + std::vector FVTs = FilterEVTs(getExtTypes(), MVT::isInteger); + if (getExtTypes() == FVTs) + return false; + if (FVTs.size()) { + setTypes(FVTs); + return true; + } + } if (ExtVTs[0] == MVT::isFP && isExtFloatingPointInVTs(getExtTypes())) { assert(hasTypeSet() && "should be handled above!"); - std::vector FVTs = FilterEVTs(getExtTypes(), MVT::isFloatingPoint); + std::vector FVTs = + FilterEVTs(getExtTypes(), MVT::isFloatingPoint); if (getExtTypes() == FVTs) return false; setTypes(FVTs); @@ -355,7 +396,11 @@ bool TreePatternNode::UpdateNodeType(const std::vector &ExtVTs, (getExtTypeNum(0) == MVT::isFP && isExtFloatingPointInVTs(ExtVTs))) { setTypes(ExtVTs); return true; - } + } + if (getExtTypeNum(0) == MVT::isInt && ExtVTs[0] == MVT::iPTR) { + setTypes(ExtVTs); + return true; + } if (isLeaf()) { dump(); @@ -383,6 +428,7 @@ void TreePatternNode::print(std::ostream &OS) const { case MVT::isInt: OS << ":isInt"; break; case MVT::isFP : OS << ":isFP"; break; case MVT::isUnknown: ; /*OS << ":?";*/ break; + case MVT::iPTR: OS << ":iPTR"; break; default: OS << ":" << getTypeNum(0); break; } @@ -523,11 +569,11 @@ TreePatternNode *TreePatternNode::InlinePatternFragments(TreePattern &TP) { return FragTree; } -/// getIntrinsicType - Check to see if the specified record has an intrinsic +/// getImplicitType - Check to see if the specified record has an implicit /// type which should be applied to it. This infer the type of register /// references from the register file information, for example. /// -static std::vector getIntrinsicType(Record *R, bool NotRegisters, +static std::vector getImplicitType(Record *R, bool NotRegisters, TreePattern &TP) { // Some common return values std::vector Unknown(1, MVT::isUnknown); @@ -544,16 +590,16 @@ static std::vector getIntrinsicType(Record *R, bool NotRegisters, // Pattern fragment types will be resolved when they are inlined. return Unknown; } else if (R->isSubClassOf("Register")) { - // If the register appears in exactly one regclass, and the regclass has one - // value type, use it as the known type. + if (NotRegisters) + return Unknown; const CodeGenTarget &T = TP.getDAGISelEmitter().getTargetInfo(); - if (const CodeGenRegisterClass *RC = T.getRegisterClassForRegister(R)) - return ConvertVTs(RC->getValueTypes()); - return Unknown; + return T.getRegisterVTs(R); } else if (R->isSubClassOf("ValueType") || R->isSubClassOf("CondCode")) { // Using a VTSDNode or CondCodeSDNode. return Other; } else if (R->isSubClassOf("ComplexPattern")) { + if (NotRegisters) + return Unknown; std::vector ComplexPat(1, TP.getDAGISelEmitter().getComplexPattern(R).getValueType()); return ComplexPat; @@ -571,11 +617,11 @@ static std::vector getIntrinsicType(Record *R, bool NotRegisters, /// 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(getLeafValue())) { // If it's a regclass or something else known, include the type. - return UpdateNodeType(getIntrinsicType(DI->getDef(), NotRegisters, TP), - TP); + return UpdateNodeType(getImplicitType(DI->getDef(), NotRegisters, TP),TP); } else if (IntInit *II = dynamic_cast(getLeafValue())) { // Int inits are always integers. :) bool MadeChange = UpdateNodeType(MVT::isInt, TP); @@ -584,16 +630,22 @@ bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) { // 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!"); + assert(getExtTypes().size() >= 1 && "TreePattern doesn't have a type!"); + MVT::ValueType VT = getTypeNum(0); + for (unsigned i = 1, e = getExtTypes().size(); i != e; ++i) + assert(getTypeNum(i) == VT && "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(getTypeNum(0)) + "'!"); + VT = getTypeNum(0); + if (VT != MVT::iPTR) { + unsigned Size = MVT::getSizeInBits(VT); + // 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 '" + + getEnumName(getTypeNum(0)) + "'!"); + } } } @@ -613,8 +665,33 @@ bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) { 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(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 '" + Int.Name + "' expects " + + utostr(Int.ArgVTs.size()-1) + " operands, not " + + utostr(getNumChildren()-1) + " operands!"); + + // Apply type info to the intrinsic ID. + MadeChange |= getChild(0)->UpdateNodeType(MVT::iPTR, 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) @@ -623,10 +700,29 @@ bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) { // must have void types. if (NI.getNumResults() == 0) MadeChange |= UpdateNodeType(MVT::isVoid, TP); + + // If this is a vector_shuffle operation, apply types to the build_vector + // operation. The types of the integers don't matter, but this ensures they + // won't get checked. + if (getOperator()->getName() == "vector_shuffle" && + getChild(2)->getOperator()->getName() == "build_vector") { + TreePatternNode *BV = getChild(2); + const std::vector &LegalVTs + = ISE.getTargetInfo().getLegalValueTypes(); + MVT::ValueType LegalIntVT = MVT::Other; + for (unsigned i = 0, e = LegalVTs.size(); i != e; ++i) + if (MVT::isInteger(LegalVTs[i]) && !MVT::isVector(LegalVTs[i])) { + LegalIntVT = LegalVTs[i]; + break; + } + assert(LegalIntVT != MVT::Other && "No legal integer VT?"); + + for (unsigned i = 0, e = BV->getNumChildren(); i != e; ++i) + MadeChange |= BV->getChild(i)->UpdateNodeType(LegalIntVT, 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(); @@ -641,7 +737,7 @@ bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) { "Operands should be register classes!"); const CodeGenRegisterClass &RC = - TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(ResultNode); + ISE.getTargetInfo().getRegisterClass(ResultNode); MadeChange = UpdateNodeType(ConvertVTs(RC.getValueTypes()), TP); } @@ -654,7 +750,7 @@ bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) { MVT::ValueType VT; if (OperandNode->isSubClassOf("RegisterClass")) { const CodeGenRegisterClass &RC = - TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(OperandNode); + ISE.getTargetInfo().getRegisterClass(OperandNode); //VT = RC.getValueTypeNum(0); MadeChange |=getChild(i)->UpdateNodeType(ConvertVTs(RC.getValueTypes()), TP); @@ -671,14 +767,20 @@ bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) { } 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)->getExtTypes(), TP); - MadeChange |= getChild(0)->UpdateNodeType(getExtTypes(), 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; } } @@ -694,6 +796,13 @@ bool TreePatternNode::canPatternMatch(std::string &Reason, DAGISelEmitter &ISE){ 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()); @@ -742,7 +851,9 @@ void TreePattern::error(const std::string &Msg) const { } TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) { - Record *Operator = Dag->getNodeType(); + DefInit *OpDef = dynamic_cast(Dag->getOperator()); + if (!OpDef) error("Pattern has unexpected operator type!"); + Record *Operator = OpDef->getDef(); if (Operator->isSubClassOf("ValueType")) { // If the operator is a ValueType, then this must be "type cast" of a leaf @@ -755,7 +866,7 @@ TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) { if (DefInit *DI = dynamic_cast(Arg)) { Record *R = DI->getDef(); if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) { - Dag->setArg(0, new DagInit(R, + Dag->setArg(0, new DagInit(DI, std::vector >())); return ParseTreePattern(Dag); } @@ -766,6 +877,15 @@ TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) { New = new TreePatternNode(II); if (!Dag->getArgName(0).empty()) error("Constant int argument should not have a name!"); + } else if (BitsInit *BI = dynamic_cast(Arg)) { + // Turn this into an IntInit. + Init *II = BI->convertInitializerTo(new IntRecTy()); + if (II == 0 || !dynamic_cast(II)) + error("Bits value must be constants!"); + + New = new TreePatternNode(dynamic_cast(II)); + if (!Dag->getArgName(0).empty()) + error("Constant int argument should not have a name!"); } else { Arg->dump(); error("Unknown leaf value for tree pattern!"); @@ -782,12 +902,13 @@ TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) { 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 Children; @@ -803,7 +924,7 @@ TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) { // Direct reference to a leaf DagNode or PatFrag? Turn it into a // TreePatternNode if its own. if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) { - Dag->setArg(i, new DagInit(R, + Dag->setArg(i, new DagInit(DefI, std::vector >())); --i; // Revisit this node... } else { @@ -823,6 +944,16 @@ TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) { if (!Dag->getArgName(i).empty()) error("Constant int argument should not have a name!"); Children.push_back(Node); + } else if (BitsInit *BI = dynamic_cast(Arg)) { + // Turn this into an IntInit. + Init *II = BI->convertInitializerTo(new IntRecTy()); + if (II == 0 || !dynamic_cast(II)) + error("Bits value must be constants!"); + + TreePatternNode *Node = new TreePatternNode(dynamic_cast(II)); + if (!Dag->getArgName(i).empty()) + error("Constant int argument should not have a name!"); + Children.push_back(Node); } else { std::cerr << '"'; Arg->dump(); @@ -831,6 +962,29 @@ TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) { } } + // If the operator is an intrinsic, then this is just syntactic sugar for for + // (intrinsic_* , ..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); } @@ -888,6 +1042,11 @@ void DAGISelEmitter::ParseNodeInfo() { 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 @@ -952,7 +1111,8 @@ void DAGISelEmitter::ParsePatternFragments(std::ostream &OS) { // Parse the operands list. DagInit *OpsList = Fragments[i]->getValueAsDag("Operands"); - if (OpsList->getNodeType()->getName() != "ops") + DefInit *OpsOp = dynamic_cast(OpsList->getOperator()); + if (!OpsOp || OpsOp->getDef()->getName() != "ops") P->error("Operands list should start with '(ops ... '!"); // Copy over the arguments. @@ -1082,7 +1242,7 @@ static bool HandleUse(TreePattern *I, TreePatternNode *Pat, void DAGISelEmitter:: FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat, std::map &InstInputs, - std::map &InstResults, + std::map&InstResults, std::vector &InstImpInputs, std::vector &InstImpResults) { if (Pat->isLeaf()) { @@ -1136,7 +1296,7 @@ FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat, 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 { @@ -1212,7 +1372,7 @@ void DAGISelEmitter::ParseInstructions() { // InstResults - Keep track of all the virtual registers that are 'set' // in the instruction, including what reg class they are. - std::map InstResults; + std::map InstResults; std::vector InstImpInputs; std::vector InstImpResults; @@ -1242,6 +1402,7 @@ void DAGISelEmitter::ParseInstructions() { // Check that all of the results occur first in the list. std::vector Results; + TreePatternNode *Res0Node = NULL; for (unsigned i = 0; i != NumResults; ++i) { if (i == CGI.OperandList.size()) I->error("'" + InstResults.begin()->first + @@ -1249,7 +1410,13 @@ void DAGISelEmitter::ParseInstructions() { const std::string &OpName = CGI.OperandList[i].Name; // Check that it exists in InstResults. - Record *R = InstResults[OpName]; + TreePatternNode *RNode = InstResults[OpName]; + if (RNode == 0) + I->error("Operand $" + OpName + " does not exist in operand list!"); + + if (i == 0) + Res0Node = RNode; + Record *R = dynamic_cast(RNode->getLeafValue())->getDef(); if (R == 0) I->error("Operand $" + OpName + " should be a set destination: all " "outputs must occur before inputs in operand list!"); @@ -1286,8 +1453,8 @@ void DAGISelEmitter::ParseInstructions() { Record *InRec = static_cast(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); @@ -1314,6 +1481,9 @@ void DAGISelEmitter::ParseInstructions() { 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); @@ -1362,7 +1532,8 @@ void DAGISelEmitter::ParseInstructions() { TreePatternNode *DstPattern = TheInst.getResultPattern(); PatternsToMatch. push_back(PatternToMatch(Instr->getValueAsListInit("Predicates"), - SrcPattern, DstPattern)); + SrcPattern, DstPattern, + Instr->getValueAsInt("AddedComplexity"))); } } @@ -1384,7 +1555,7 @@ void DAGISelEmitter::ParsePatterns() { // Validate that the input pattern is correct. { std::map InstInputs; - std::map InstResults; + std::map InstResults; std::vector InstImpInputs; std::vector InstImpResults; FindPatternInputsAndOutputs(Pattern, Pattern->getOnlyTree(), @@ -1410,6 +1581,27 @@ void DAGISelEmitter::ParsePatterns() { Result->error("Cannot handle instructions producing instructions " "with temporaries yet!"); + // Promote the xform function to be an explicit node if set. + std::vector 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 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); @@ -1417,7 +1609,8 @@ void DAGISelEmitter::ParsePatterns() { PatternsToMatch. push_back(PatternToMatch(Patterns[i]->getValueAsListInit("Predicates"), Pattern->getOnlyTree(), - Result->getOnlyTree())); + Temp.getOnlyTree(), + Patterns[i]->getValueAsInt("AddedComplexity"))); } } @@ -1660,7 +1853,8 @@ void DAGISelEmitter::GenerateVariants() { // Otherwise, add it to the list of patterns we have. PatternsToMatch. push_back(PatternToMatch(PatternsToMatch[i].getPredicates(), - Variant, PatternsToMatch[i].getDstPattern())); + Variant, PatternsToMatch[i].getDstPattern(), + PatternsToMatch[i].getAddedComplexity())); } DEBUG(std::cerr << "\n"); @@ -1697,12 +1891,17 @@ static const ComplexPattern *NodeGetComplexPattern(TreePatternNode *N, /// patterns before small ones. This is used to determine the size of a /// pattern. static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) { - assert(isExtIntegerInVTs(P->getExtTypes()) || - isExtFloatingPointInVTs(P->getExtTypes()) || - P->getExtTypeNum(0) == MVT::isVoid || - P->getExtTypeNum(0) == MVT::Flag && + assert((isExtIntegerInVTs(P->getExtTypes()) || + isExtFloatingPointInVTs(P->getExtTypes()) || + P->getExtTypeNum(0) == MVT::isVoid || + P->getExtTypeNum(0) == MVT::Flag || + P->getExtTypeNum(0) == MVT::iPTR) && "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(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. @@ -1712,7 +1911,12 @@ static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) { const ComplexPattern *AM = NodeGetComplexPattern(P, ISE); if (AM) 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); @@ -1720,9 +1924,11 @@ static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) { Size += getPatternSize(Child, ISE); else if (Child->isLeaf()) { if (dynamic_cast(Child->getLeafValue())) - Size += 3; // 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; } } @@ -1732,12 +1938,19 @@ static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) { /// 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; } @@ -1752,12 +1965,14 @@ struct PatternSortingPredicate { PatternToMatch *RHS) { unsigned LHSSize = getPatternSize(LHS->getSrcPattern(), ISE); unsigned RHSSize = getPatternSize(RHS->getSrcPattern(), ISE); + LHSSize += LHS->getAddedComplexity(); + RHSSize += RHS->getAddedComplexity(); if (LHSSize > RHSSize) return true; // LHS -> bigger -> less 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); } }; @@ -1781,7 +1996,10 @@ static void RemoveAllTypes(TreePatternNode *N) { 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; } @@ -1819,57 +2037,89 @@ private: // Predicates. ListInit *Predicates; + // Pattern cost. + unsigned Cost; // Instruction selector pattern. TreePatternNode *Pattern; // Matched instruction. TreePatternNode *Instruction; - unsigned PatternNo; - std::ostream &OS; + // Node to name mapping - std::map VariableMap; + std::map VariableMap; + // Node to operator mapping + std::map OperatorMap; // Names of all the folded nodes which produce chains. std::vector > FoldedChains; + std::set Duplicates; + /// These nodes are being marked "in-flight" so they cannot be folded. + std::vector InflightNodes; + + /// 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 > &GeneratedCode; + /// GeneratedDecl - This is the set of all SDOperand declarations needed for + /// the set of patterns for each top-level opcode. + std::set > &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) {} + std::vector > &gc, + std::set > &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(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(N->getLeafValue())) { - OS << " if (cast(" << RootName - << ")->getSignExtended() != " << II->getValue() << ")\n" - << " goto P" << PatternNo << "Fail;\n"; + emitCheck("cast(" + RootName + + ")->getSignExtended() == " + itostr(II->getValue())); return; } else if (!NodeIsComplexPattern(N)) { assert(0 && "Cannot match this as a leaf value!"); @@ -1877,7 +2127,7 @@ public: } } - // 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()]; @@ -1888,61 +2138,156 @@ public: // 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 = NodeHasProperty(N, SDNodeInfo::SDNPHasChain, 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"; + // Not in flight? + emitCheck("InFlightSet.count(" + RootName + ".Val) == 0"); + // 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);"); + } } - if (!FoundChain) { - OS << " SDOperand Chain = " << RootName << ".getOperand(0);\n"; - FoundChain = true; + } + + // 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 << " SDOperand " << RootName << OpNo << " = " - << 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 (NodeHasProperty(Child, SDNodeInfo::SDNPHasChain, 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; } } @@ -1960,24 +2305,25 @@ public: // 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(" << RootName << OpNo << ")->getVT() != " - << "MVT::" << LeafRec->getName() << ") goto P" << PatternNo - << "Fail;\n"; + emitCheck("cast(" + RootName + utostr(OpNo) + + ")->getVT() == MVT::" + LeafRec->getName()); } else if (LeafRec->isSubClassOf("CondCode")) { // Make sure this is the specified cond code. - OS << " if (cast(" << RootName << OpNo - << ")->get() != " << "ISD::" << LeafRec->getName() - << ") goto P" << PatternNo << "Fail;\n"; + emitCheck("cast(" + RootName + utostr(OpNo) + + ")->get() == ISD::" + LeafRec->getName()); } else { Child->dump(); std::cerr << " "; assert(0 && "Unknown leaf type!"); } - } else if (IntInit *II = dynamic_cast(Child->getLeafValue())) { - OS << " if (!isa(" << RootName << OpNo << ") ||\n" - << " cast(" << RootName << OpNo - << ")->getSignExtended() != " << II->getValue() << ")\n" - << " goto P" << PatternNo << "Fail;\n"; + } else if (IntInit *II = + dynamic_cast(Child->getLeafValue())) { + emitCheck("isa(" + RootName + utostr(OpNo) + ")"); + unsigned CTmp = TmpNo++; + emitCode("int64_t CN"+utostr(CTmp)+" = cast("+ + RootName + utostr(OpNo) + ")->getSignExtended();"); + + emitCheck("CN" + utostr(CTmp) + " == " +itostr(II->getValue())); } else { Child->dump(); assert(0 && "Unknown leaf type!"); @@ -1987,17 +2333,16 @@ public: // 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 - 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!"); @@ -2011,64 +2356,123 @@ public: unsigned NumRes = 1; if (!N->isLeaf() && N->getOperator()->getName() == "imm") { 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: 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; + 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(" + Val + ")->getValue();"); + emitDecl("Tmp" + utostr(ResNo)); + emitCode("Tmp" + utostr(ResNo) + + " = CurDAG->getTargetConstant(Tmp" + utostr(ResNo) + + "C, " + 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(" + + Val + ")->getSymbol(), " + + getEnumName(N->getTypeNum(0)) + ");"); + } else { + emitDecl("Tmp" + utostr(ResNo)); + emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";"); } - OS << ResNo << "C = cast(" << Val << ")->getValue();\n"; - OS << " SDOperand Tmp" << utostr(ResNo) - << " = CurDAG->getTargetConstant(Tmp" - << ResNo << "C, MVT::" << getEnumName(N->getTypeNum(0)) << ");\n"; } else if (!N->isLeaf() && N->getOperator()->getName() == "tglobaladdr") { - OS << " SDOperand Tmp" << ResNo << " = " << Val << ";\n"; - } else if (!N->isLeaf() && N->getOperator()->getName() == "tconstpool") { - OS << " SDOperand Tmp" << ResNo << " = " << 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(" + Val + + ")->getGlobal(), " + getEnumName(N->getTypeNum(0)) + + ");"); + } else { + emitDecl("Tmp" + utostr(ResNo)); + emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";"); + } } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){ - OS << " SDOperand Tmp" << ResNo << " = " << Val << ";\n"; + emitDecl("Tmp" + utostr(ResNo)); + emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";"); + } else if (!N->isLeaf() && N->getOperator()->getName() == "tconstpool") { + 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(); - OS << " SDOperand "; - for (unsigned i = 0; i < NumRes - 1; ++i) - OS << "Tmp" << (i+ResNo) << ","; - OS << "Tmp" << (NumRes - 1 + ResNo) << ";\n"; - - OS << " if (!" << Fn << "(" << Val; + for (unsigned i = 0; i < NumRes; ++i) + emitDecl("CPTmp" + utostr(i+ResNo)); + + std::string Code = "bool Match = " + Fn + "(" + Val; for (unsigned i = 0; i < NumRes; i++) - OS << ", Tmp" << i + ResNo; - OS << ")) goto P" << PatternNo << "Fail;\n"; + Code += ", CPTmp" + utostr(i + ResNo); + emitCode(Code + ");"); + if (InflightNodes.size()) { + // Remove the in-flight nodes if the ComplexPattern does not match! + emitCode("if (!Match) {"); + for (std::vector::iterator AI = InflightNodes.begin(), + AE = InflightNodes.end(); AI != AE; ++AI) + emitCode(" InFlightSet.erase(" + *AI + ".Val);"); + emitCode("}"); + } + + emitCheck("Match"); + + for (unsigned i = 0; i < NumRes; ++i) { + emitCode("InFlightSet.insert(CPTmp" + utostr(i+ResNo) + ".Val);"); + InflightNodes.push_back("CPTmp" + utostr(i+ResNo)); + } + for (unsigned i = 0; i < NumRes; ++i) { + emitDecl("Tmp" + utostr(i+ResNo)); + emitCode("Select(Tmp" + utostr(i+ResNo) + ", CPTmp" + + utostr(i+ResNo) + ");"); + } + TmpNo = ResNo + NumRes; } else { - OS << " SDOperand Tmp" << ResNo << " = 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 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(N->getLeafValue())) { unsigned ResNo = TmpNo++; if (DI->getDef()->isSubClassOf("Register")) { - OS << " SDOperand Tmp" << ResNo << " = CurDAG->getRegister(" - << ISE.getQualifiedName(DI->getDef()) << ", MVT::" - << getEnumName(N->getTypeNum(0)) - << ");\n"; + emitDecl("Tmp" + utostr(ResNo)); + emitCode("Tmp" + utostr(ResNo) + " = CurDAG->getRegister(" + + ISE.getQualifiedName(DI->getDef()) + ", " + + getEnumName(N->getTypeNum(0)) + ");"); return std::make_pair(1, ResNo); } } else if (IntInit *II = dynamic_cast(N->getLeafValue())) { unsigned ResNo = TmpNo++; assert(N->getExtTypes().size() == 1 && "Multiple types not handled!"); - OS << " SDOperand Tmp" << ResNo << " = CurDAG->getTargetConstant(" - << II->getValue() << ", MVT::" - << getEnumName(N->getTypeNum(0)) - << ");\n"; + emitDecl("Tmp" + utostr(ResNo)); + emitCode("Tmp" + utostr(ResNo) + + " = CurDAG->getTargetConstant(" + itostr(II->getValue()) + + ", " + getEnumName(N->getTypeNum(0)) + ");"); return std::make_pair(1, ResNo); } @@ -2082,19 +2486,38 @@ public: const CodeGenTarget &CGT = ISE.getTargetInfo(); CodeGenInstruction &II = CGT.getInstruction(Op->getName()); const DAGInstruction &Inst = ISE.getInstruction(Op); - bool HasImpInputs = Inst.getNumImpOperands() > 0; - bool HasImpResults = Inst.getNumImpResults() > 0; - bool HasOptInFlag = isRoot && - NodeHasProperty(Pattern, SDNodeInfo::SDNPOptInFlag, ISE); - bool HasInFlag = isRoot && - NodeHasProperty(Pattern, SDNodeInfo::SDNPInFlag, ISE); - bool HasOutFlag = HasImpResults || - (isRoot && PatternHasProperty(Pattern, SDNodeInfo::SDNPOutFlag, ISE)); - bool HasChain = II.hasCtrlDep || - (isRoot && PatternHasProperty(Pattern, SDNodeInfo::SDNPHasChain, ISE)); - - if (HasOutFlag || HasInFlag || HasOptInFlag || HasImpInputs) - OS << " SDOperand InFlag = SDOperand(0, 0);\n"; + TreePattern *InstPat = Inst.getPattern(); + TreePatternNode *InstPatNode = + isRoot ? (InstPat ? InstPat->getOnlyTree() : Pattern) + : (InstPat ? InstPat->getOnlyTree() : NULL); + if (InstPatNode && InstPatNode->getOperator()->getName() == "set") { + InstPatNode = InstPatNode->getChild(1); + } + bool HasImpInputs = isRoot && Inst.getNumImpOperands() > 0; + bool HasImpResults = isRoot && Inst.getNumImpResults() > 0; + bool NodeHasOptInFlag = isRoot && + PatternHasProperty(Pattern, SDNodeInfo::SDNPOptInFlag, ISE); + bool NodeHasInFlag = isRoot && + PatternHasProperty(Pattern, SDNodeInfo::SDNPInFlag, ISE); + bool NodeHasOutFlag = HasImpResults || (isRoot && + PatternHasProperty(Pattern, SDNodeInfo::SDNPOutFlag, ISE)); + bool NodeHasChain = InstPatNode && + PatternHasProperty(InstPatNode, SDNodeInfo::SDNPHasChain, ISE); + bool InputHasChain = isRoot && + NodeHasProperty(Pattern, SDNodeInfo::SDNPHasChain, ISE); + + if (NodeHasInFlag || NodeHasOutFlag || NodeHasOptInFlag || HasImpInputs) + emitDecl("InFlag"); + if (NodeHasOptInFlag) + 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 > EmitOrder; @@ -2111,6 +2534,21 @@ public: } } + // Make sure these operands which would be selected won't be folded while + // the isel traverses the DAG upward. + for (unsigned i = 0, e = EmitOrder.size(); i != e; ++i) { + TreePatternNode *Child = EmitOrder[i].second; + if (!Child->getName().empty()) { + std::string &Val = VariableMap[Child->getName()]; + assert(!Val.empty() && + "Variable referenced but not defined and not caught earlier!"); + if (Child->isLeaf() && !NodeGetComplexPattern(Child, ISE)) { + emitCode("InFlightSet.insert(" + Val + ".Val);"); + InflightNodes.push_back(Val); + } + } + } + // Emit all of the operands. std::vector > NumTemps(EmitOrder.size()); for (unsigned i = 0, e = EmitOrder.size(); i != e; ++i) { @@ -2128,155 +2566,244 @@ public: } // Emit all the chain and CopyToReg stuff. - if (HasChain) - OS << " Chain = Select(Chain);\n"; - if (HasImpInputs) - EmitCopyToRegs(Pattern, "N", HasChain, true); - if (HasInFlag || HasOptInFlag) { - unsigned FlagNo = (unsigned) HasChain + Pattern->getNumChildren(); - if (HasOptInFlag) - OS << " if (N.getNumOperands() == " << FlagNo+1 << ") "; - else - OS << " "; - OS << "InFlag = Select(N.getOperand(" << FlagNo << "));\n"; + bool ChainEmitted = NodeHasChain; + if (NodeHasChain) + emitCode("Select(" + ChainName + ", " + ChainName + ");"); + if (NodeHasInFlag || NodeHasOptInFlag || HasImpInputs) + EmitInFlagSelectCode(Pattern, "N", ChainEmitted, true); + + if (isRoot) { + // The operands have been selected. Remove them from InFlightSet. + for (std::vector::iterator AI = InflightNodes.begin(), + AE = InflightNodes.end(); AI != AE; ++AI) + emitCode("InFlightSet.erase(" + *AI + ".Val);"); } unsigned NumResults = Inst.getNumResults(); unsigned ResNo = TmpNo++; - if (!isRoot) { - OS << " SDOperand Tmp" << ResNo << " = CurDAG->getTargetNode(" - << II.Namespace << "::" << II.TheDef->getName(); - if (N->getTypeNum(0) != MVT::isVoid) - OS << ", MVT::" << getEnumName(N->getTypeNum(0)); - if (HasOutFlag) - OS << ", MVT::Flag"; - - unsigned LastOp = 0; - for (unsigned i = 0, e = Ops.size(); i != e; ++i) { - LastOp = Ops[i]; - OS << ", Tmp" << LastOp; - } - OS << ");\n"; - if (HasChain) { - // Must have at least one result - OS << " Chain = Tmp" << LastOp << ".getValue(" - << NumResults << ");\n"; - } - } else if (HasChain || HasOutFlag) { - OS << " SDOperand Result = CurDAG->getTargetNode(" - << II.Namespace << "::" << II.TheDef->getName(); - - // Output order: results, chain, flags - // Result types. - if (NumResults > 0) { - if (N->getTypeNum(0) != MVT::isVoid) - OS << ", MVT::" << getEnumName(N->getTypeNum(0)); + if (!isRoot || InputHasChain || NodeHasChain || NodeHasOutFlag || + NodeHasOptInFlag) { + if (NodeHasOptInFlag) { + 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 (PatResults > 0) { + if (N->getTypeNum(0) != MVT::isVoid) + Code += ", " + getEnumName(N->getTypeNum(0)); + } + if (NodeHasChain) + 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 (NodeHasChain) Code += ", " + ChainName; + emitCode(Code + ", InFlag);"); + + emitCode("else"); + Code = " ResNode = CurDAG->getTargetNode(" + II.Namespace + "::" + + II.TheDef->getName(); + + // Output order: results, chain, flags + // Result types. + if (PatResults > 0 && N->getTypeNum(0) != MVT::isVoid) + Code += ", " + getEnumName(N->getTypeNum(0)); + if (NodeHasChain) + 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 (NodeHasChain) Code += ", " + ChainName + ");"; + emitCode(Code); + + if (NodeHasChain) + // Remember which op produces the chain. + emitCode(ChainName + " = SDOperand(ResNode" + + ", " + utostr(PatResults) + ");"); + } else { + std::string Code; + std::string NodeName; + if (!isRoot) { + NodeName = "Tmp" + utostr(ResNo); + emitDecl(NodeName); + Code = NodeName + " = SDOperand("; + } else { + NodeName = "ResNode"; + emitDecl(NodeName, true); + Code = NodeName + " = "; + } + Code += "CurDAG->getTargetNode(" + + II.Namespace + "::" + II.TheDef->getName(); + + // Output order: results, chain, flags + // Result types. + if (NumResults > 0 && N->getTypeNum(0) != MVT::isVoid) + Code += ", " + getEnumName(N->getTypeNum(0)); + if (NodeHasChain) + 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 (NodeHasChain) Code += ", " + ChainName; + if (NodeHasInFlag || HasImpInputs) Code += ", InFlag"; + if (!isRoot) + emitCode(Code + "), 0);"); + else + emitCode(Code + ");"); + + if (NodeHasChain) + // Remember which op produces the chain. + if (!isRoot) + emitCode(ChainName + " = SDOperand(" + NodeName + + ".Val, " + utostr(PatResults) + ");"); + else + emitCode(ChainName + " = SDOperand(" + NodeName + + ", " + utostr(PatResults) + ");"); } - 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 || HasImpInputs) 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 (!isRoot) + return std::make_pair(1, ResNo); - if (HasChain) - OS << " Chain = Result.getValue(" << ValNo << ");\n"; + if (NewTF) + emitCode("if (OldTF) " + "SelectionDAG::InsertISelMapEntry(CodeGenMap, OldTF, 0, " + + ChainName + ".Val, 0);"); - if (HasOutFlag) - OS << " InFlag = Result.getValue(" - << ValNo + (unsigned)HasChain << ");\n"; + for (unsigned i = 0; i < NumResults; i++) + emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " + + utostr(i) + ", ResNode, " + utostr(i) + ");"); - if (HasImpResults) { - if (EmitCopyFromRegs(N, HasChain)) { - OS << " CodeGenMap[N.getValue(" << ValNo << ")] = " - << "Result.getValue(" << ValNo << ");\n"; - ValNo++; - HasChain = true; - } + if (NodeHasOutFlag) + emitCode("InFlag = SDOperand(ResNode, " + + utostr(NumResults + (unsigned)NodeHasChain) + ");"); + + 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 NodeHasChain = - NodeHasProperty(Pattern, SDNodeInfo::SDNPHasChain, ISE); - bool AddedChain = HasChain && !NodeHasChain; - if (NodeHasChain) - OS << " CodeGenMap[N.getValue(" << ValNo++ << ")] = Chain;\n"; + if (InputHasChain) { + emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " + + utostr(PatResults) + ", " + ChainName + ".Val, " + + ChainName + ".ResNo" + ");"); + if (DoReplace) + emitCode("if (N.ResNo == 0) AddHandleReplacement(N.Val, " + + utostr(PatResults) + ", " + ChainName + ".Val, " + + ChainName + ".ResNo" + ");"); + } 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)InputHasChain) + + ", 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 = NodeHasChain && !InputHasChain; + 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 if (InputHasChain && !NodeHasChain) { + // One of the inner node produces a chain. + emitCode("if (N.ResNo < " + utostr(PatResults) + ")"); + emitCode(" Result = SDOperand(ResNode, N.ResNo);"); + if (NodeHasOutFlag) { + emitCode("else if (N.ResNo > " + utostr(PatResults) + ")"); + emitCode(" Result = SDOperand(ResNode, N.ResNo-1);"); + } + emitCode("else"); + emitCode(" Result = SDOperand(" + ChainName + ".Val, " + ChainName + ".ResNo);"); } 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(); + emitCode("if (N.Val->hasOneUse()) {"); + std::string Code = " Result = CurDAG->SelectNodeTo(N.Val, " + + II.Namespace + "::" + II.TheDef->getName(); if (N->getTypeNum(0) != MVT::isVoid) - OS << ", MVT::" << getEnumName(N->getTypeNum(0)); - if (HasOutFlag) - OS << ", MVT::Flag"; + Code += ", " + 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 || HasImpInputs) - OS << ", InFlag"; - OS << ");\n"; - OS << " } else {\n"; - OS << " return CodeGenMap[N] = CurDAG->getTargetNode(" - << II.Namespace << "::" << II.TheDef->getName(); + Code += ", Tmp" + utostr(Ops[i]); + if (NodeHasInFlag || 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) - OS << ", MVT::" << getEnumName(N->getTypeNum(0)); - if (HasOutFlag) - OS << ", MVT::Flag"; + Code += ", " + 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 || HasImpInputs) - OS << ", InFlag"; - OS << ");\n"; - OS << " }\n"; + Code += ", Tmp" + utostr(Ops[i]); + if (NodeHasInFlag || 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 << " SDOperand Tmp" << ResNo << " = 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 { @@ -2286,18 +2813,18 @@ public: } } - /// 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, const std::string &Prefix) { // Did we find one? - if (!Pat->hasTypeSet()) { + if (Pat->getExtTypes() != Other->getExtTypes()) { // Move a type over from 'other' to 'pat'. Pat->setTypes(Other->getExtTypes()); - OS << " if (" << Prefix << ".Val->getValueType(0) != MVT::" - << getName(Pat->getTypeNum(0)) << ") goto P" << PatternNo << "Fail;\n"; + emitCheck(Prefix + ".Val->getValueType(0) == MVT::" + + getName(Pat->getTypeNum(0))); return true; } @@ -2311,78 +2838,96 @@ public: } private: - /// EmitCopyToRegs - Emit the flag operands for the DAG that is + /// EmitInFlagSelectCode - Emit the flag operands for the DAG that is /// being built. - void EmitCopyToRegs(TreePatternNode *N, const std::string &RootName, - bool HasChain, bool isRoot = false) { + void EmitInFlagSelectCode(TreePatternNode *N, const std::string &RootName, + bool &ChainEmitted, bool isRoot = false) { const CodeGenTarget &T = ISE.getTargetInfo(); 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()) { - EmitCopyToRegs(Child, RootName + utostr(OpNo), HasChain); + EmitInFlagSelectCode(Child, RootName + utostr(OpNo), ChainEmitted); } else { if (DefInit *DI = dynamic_cast(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) + + ", " + getEnumName(RVT) + "), " + + RootName + utostr(OpNo) + ", InFlag).Val;"); + emitCode(ChainName + " = SDOperand(ResNode, 0);"); + emitCode("InFlag = SDOperand(ResNode, 1);"); } } } } } + + 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")) { const DAGInstruction &Inst = ISE.getInstruction(Op); const CodeGenTarget &CGT = ISE.getTargetInfo(); - CodeGenInstruction &II = CGT.getInstruction(Op->getName()); unsigned NumImpResults = Inst.getNumImpResults(); for (unsigned i = 0; i < NumImpResults; i++) { Record *RR = Inst.getImpResult(i); 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) + ", " + getEnumName(RVT) + + ", InFlag).Val;"); + emitCode(ChainName + " = SDOperand(ResNode, 1);"); + emitCode("InFlag = SDOperand(ResNode, 2);"); RetVal = true; } } @@ -2394,29 +2939,18 @@ private: /// 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 > &GeneratedCode, + std::set > &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; @@ -2441,7 +2975,8 @@ void DAGISelEmitter::EmitCodeForPattern(PatternToMatch &Pattern, 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!"); @@ -2453,14 +2988,139 @@ void DAGISelEmitter::EmitCodeForPattern(PatternToMatch &Pattern, // 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 > > > + &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 > > > + &Patterns, unsigned Indent, + std::ostream &OS) { + typedef std::pair CodeLine; + typedef std::vector CodeList; + typedef std::vector > 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"; + unsigned AddedComplexity = Pattern.getAddedComplexity(); + OS << std::string(Indent, ' ') << "// Pattern complexity = " + << getPatternSize(Pattern.getSrcPattern(), *this) + AddedComplexity + << " 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"; + unsigned AddedComplexity = Pattern.getAddedComplexity(); + OS << std::string(Indent, ' ') << "// Pattern complexity = " + << getPatternSize(Pattern.getSrcPattern(), *this) + AddedComplexity + << " cost = " + << getResultPatternCost(Pattern.getDstPattern(), *this) << "\n"; + } + EmitPatterns(Other, Indent, OS); + return; + } + + // 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; + } - OS << " }\n P" << PatternNo << "Fail:\n"; + 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. @@ -2493,14 +3153,15 @@ void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) { } else if ((CP = NodeGetComplexPattern(Node, *this))) { std::vector OpNodes = CP->getRootNodes(); for (unsigned j = 0, e = OpNodes.size(); j != e; j++) { - PatternsByOpcode[OpNodes[j]].insert(PatternsByOpcode[OpNodes[j]].begin(), - &PatternsToMatch[i]); + 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 << + PatternsToMatch[i].getDstPattern()->getOperator()->getName(); std::cerr << "'!\n"; exit(1); } @@ -2513,104 +3174,256 @@ void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) { for (std::map, CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(), E = PatternsByOpcode.end(); PBOI != E; ++PBOI) { - OS << "SDOperand Select_" << PBOI->first->getName() << "(SDOperand N) {\n"; + 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 &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 > CodeList; + typedef std::set DeclSet; - for (unsigned i = 0, e = Patterns.size(); i != e; ++i) - EmitCodeForPattern(*Patterns[i], OS); + std::vector > CodeForPatterns; + std::set > 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)); + } - OS << " std::cerr << \"Cannot yet select: \";\n" - << " N.Val->dump(CurDAG);\n" - << " std::cerr << '\\n';\n" - << " abort();\n" - << "}\n\n"; + // 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 >::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"; + if (OpcodeInfo.getEnumName() != "ISD::INTRINSIC_W_CHAIN" && + OpcodeInfo.getEnumName() != "ISD::INTRINSIC_WO_CHAIN" && + OpcodeInfo.getEnumName() != "ISD::INTRINSIC_VOID") { + OS << " N.Val->dump(CurDAG);\n"; + } else { + OS << " unsigned iid = cast(N.getOperand(" + "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n" + << " std::cerr << \"intrinsic %\"<< " + "Intrinsic::getName((Intrinsic::ID)iid);\n"; + } + OS << " std::cerr << '\\n';\n" + << " abort();\n"; + } + OS << "}\n\n"; } // Emit boilerplate. + OS << "void Select_INLINEASM(SDOperand& Result, SDOperand N) {\n" + << " std::vector 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 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::iterator CGMI = CodeGenMap.find(N);\n" - << " if (CGMI != CodeGenMap.end()) return CGMI->second;\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" << " case ISD::Register:\n" - << " return N;\n" + << " case ISD::HANDLENODE:\n" + << " case ISD::TargetConstant:\n" + << " case ISD::TargetConstantPool:\n" + << " case ISD::TargetFrameIndex:\n" + << " case ISD::TargetJumpTable:\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 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" - << " SDOperand Chain = Select(N.getOperand(0));\n" + << " SDOperand Chain;\n" + << " Select(Chain, N.getOperand(0));\n" << " unsigned Reg = cast(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" - << " SDOperand Chain = Select(N.getOperand(0));\n" + << " SDOperand Chain;\n" + << " Select(Chain, N.getOperand(0));\n" << " unsigned Reg = cast(N.getOperand(1))->getReg();\n" - << " SDOperand Val = Select(N.getOperand(2));\n" - << " SDOperand Result = N;\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"; + // Loop over all of the case statements, emiting a call to each method we // emitted above. @@ -2620,12 +3433,21 @@ void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) { const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first); OS << " case " << OpcodeInfo.getEnumName() << ": " << std::string(std::max(0, int(24-OpcodeInfo.getEnumName().size())), ' ') - << "return Select_" << PBOI->first->getName() << "(N);\n"; + << "Select_" << PBOI->first->getName() << "(Result, N); return;\n"; } OS << " } // end of big switch.\n\n" << " std::cerr << \"Cannot yet select: \";\n" - << " N.Val->dump(CurDAG);\n" + << " if (N.getOpcode() != ISD::INTRINSIC_W_CHAIN &&\n" + << " N.getOpcode() != ISD::INTRINSIC_WO_CHAIN &&\n" + << " N.getOpcode() != ISD::INTRINSIC_VOID) {\n" + << " N.Val->dump(CurDAG);\n" + << " } else {\n" + << " unsigned iid = cast(N.getOperand(" + "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n" + << " std::cerr << \"intrinsic %\"<< " + "Intrinsic::getName((Intrinsic::ID)iid);\n" + << " }\n" << " std::cerr << '\\n';\n" << " abort();\n" << "}\n"; @@ -2642,7 +3464,145 @@ void DAGISelEmitter::run(std::ostream &OS) { OS << "// Instance var to keep track of multiply used nodes that have \n" << "// already been selected.\n" << "std::map CodeGenMap;\n"; + + OS << "// Instance var to keep track of mapping of chain generating nodes\n" + << "// and their place handle nodes.\n"; + OS << "std::map HandleMap;\n"; + OS << "// Instance var to keep track of mapping of place handle nodes\n" + << "// and their replacement nodes.\n"; + OS << "std::map ReplaceMap;\n"; + OS << "// Keep track of nodes that are currently being selecte and therefore\n" + << "// should not be folded.\n"; + OS << "std::set InFlightSet;\n"; + + OS << "\n"; + OS << "static void findNonImmUse(SDNode* Use, SDNode* Def, bool &found, " + << "std::set &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 != 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 << "static bool isNonImmUse(SDNode* Use, SDNode* Def) {\n"; + OS << " std::set 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::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::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::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 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::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 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();