wangtao
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Allow set operators with multiple destinations, i.e. (set x, y, (op a, b)). 

llvm-svn: 41861
This commit is contained in:
Evan Cheng 2007-09-11 19:52:18 +00:00
parent cfc3e4d346
commit c7852a689a
1 changed files with 24 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

45
llvm/utils/TableGen/DAGISelEmitter.cpp
View File

@ -676,14 +676,20 @@ bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
// special handling for set, which isn't really an SDNode. // special handling for set, which isn't really an SDNode.
if (getOperator()->getName() == "set") { if (getOperator()->getName() == "set") {
assert (getNumChildren() == 2 && "Only handle 2 operand set's for now!"); assert (getNumChildren() >= 2 && "Missing RHS of a set?");
bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters); unsigned NC = getNumChildren();
MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters); bool MadeChange = false;
for (unsigned i = 0; i < NC-1; ++i) {
MadeChange = getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
MadeChange |= getChild(NC-1)->ApplyTypeConstraints(TP, NotRegisters);
// Types of operands must match. // Types of operands must match.
MadeChange |= getChild(0)->UpdateNodeType(getChild(1)->getExtTypes(), TP); MadeChange |= getChild(i)->UpdateNodeType(getChild(NC-1)->getExtTypes(),
MadeChange |= getChild(1)->UpdateNodeType(getChild(0)->getExtTypes(), TP); TP);
MadeChange |= UpdateNodeType(MVT::isVoid, TP); MadeChange |= getChild(NC-1)->UpdateNodeType(getChild(i)->getExtTypes(),
TP);
MadeChange |= UpdateNodeType(MVT::isVoid, TP);
}
return MadeChange; return MadeChange;
} else if (getOperator() == ISE.get_intrinsic_void_sdnode() || } else if (getOperator() == ISE.get_intrinsic_void_sdnode() ||
getOperator() == ISE.get_intrinsic_w_chain_sdnode() || getOperator() == ISE.get_intrinsic_w_chain_sdnode() ||
@ -1316,6 +1322,7 @@ static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
I->error("Input " + DI->getDef()->getName() + " must be named!"); I->error("Input " + DI->getDef()->getName() + " must be named!");
else if (DI && DI->getDef()->isSubClassOf("Register")) else if (DI && DI->getDef()->isSubClassOf("Register"))
InstImpInputs.push_back(DI->getDef()); InstImpInputs.push_back(DI->getDef());
;
} }
return false; return false;
} }
@ -1393,15 +1400,13 @@ FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
// Otherwise, this is a set, validate and collect instruction results. // Otherwise, this is a set, validate and collect instruction results.
if (Pat->getNumChildren() == 0) if (Pat->getNumChildren() == 0)
I->error("set requires operands!"); I->error("set requires operands!");
else if (Pat->getNumChildren() & 1)
I->error("set requires an even number of operands");
if (Pat->getTransformFn()) if (Pat->getTransformFn())
I->error("Cannot specify a transform function on a set node!"); I->error("Cannot specify a transform function on a set node!");
// Check the set destinations. // Check the set destinations.
unsigned NumValues = Pat->getNumChildren()/2; unsigned NumDests = Pat->getNumChildren()-1;
for (unsigned i = 0; i != NumValues; ++i) { for (unsigned i = 0; i != NumDests; ++i) {
TreePatternNode *Dest = Pat->getChild(i); TreePatternNode *Dest = Pat->getChild(i);
if (!Dest->isLeaf()) if (!Dest->isLeaf())
I->error("set destination should be a register!"); I->error("set destination should be a register!");
@ -1419,15 +1424,16 @@ FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
InstResults[Dest->getName()] = Dest; InstResults[Dest->getName()] = Dest;
} else if (Val->getDef()->isSubClassOf("Register")) { } else if (Val->getDef()->isSubClassOf("Register")) {
InstImpResults.push_back(Val->getDef()); InstImpResults.push_back(Val->getDef());
;
} else { } else {
I->error("set destination should be a register!"); I->error("set destination should be a register!");
} }
// Verify and collect info from the computation.
FindPatternInputsAndOutputs(I, Pat->getChild(i+NumValues),
InstInputs, InstResults,
InstImpInputs, InstImpResults);
} }
// Verify and collect info from the computation.
FindPatternInputsAndOutputs(I, Pat->getChild(NumDests),
InstInputs, InstResults,
InstImpInputs, InstImpResults);
} }
/// ParseInstructions - Parse all of the instructions, inlining and resolving /// ParseInstructions - Parse all of the instructions, inlining and resolving
@ -1644,10 +1650,7 @@ void DAGISelEmitter::ParseInstructions() {
TreePatternNode *Pattern = I->getTree(0); TreePatternNode *Pattern = I->getTree(0);
TreePatternNode *SrcPattern; TreePatternNode *SrcPattern;
if (Pattern->getOperator()->getName() == "set") { if (Pattern->getOperator()->getName() == "set") {
if (Pattern->getNumChildren() != 2) SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();
continue; // Not a set of a single value (not handled so far)
SrcPattern = Pattern->getChild(1)->clone();
} else{ } else{
// Not a set (store or something?) // Not a set (store or something?)
SrcPattern = Pattern; SrcPattern = Pattern;
@ -2759,7 +2762,7 @@ public:
isRoot ? (InstPat ? InstPat->getOnlyTree() : Pattern) isRoot ? (InstPat ? InstPat->getOnlyTree() : Pattern)
: (InstPat ? InstPat->getOnlyTree() : NULL); : (InstPat ? InstPat->getOnlyTree() : NULL);
if (InstPatNode && InstPatNode->getOperator()->getName() == "set") { if (InstPatNode && InstPatNode->getOperator()->getName() == "set") {
InstPatNode = InstPatNode->getChild(1); InstPatNode = InstPatNode->getChild(InstPatNode->getNumChildren()-1);
} }
bool HasVarOps = isRoot && II.hasVariableNumberOfOperands; bool HasVarOps = isRoot && II.hasVariableNumberOfOperands;
bool HasImpInputs = isRoot && Inst.getNumImpOperands() > 0; bool HasImpInputs = isRoot && Inst.getNumImpOperands() > 0;