6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-12 17:32:19 +00:00
Code Issues Projects Releases Wiki Activity

complex patterns don't get 'record' nodes, they implicitly

Browse Source 
record all their results.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@96412 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2010-02-16 23:16:25 +00:00
parent 05446e7d47
commit 53a2f60062
1 changed files with 20 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
utils/TableGen/DAGISelMatcherGen.cpp
View File

@ -137,6 +137,11 @@ void MatcherGen::EmitLeafMatchCode(const TreePatternNode *N) {
return AddMatcherNode(new CheckCondCodeMatcherNode(LeafRec->getName())); return AddMatcherNode(new CheckCondCodeMatcherNode(LeafRec->getName()));
if (LeafRec->isSubClassOf("ComplexPattern")) { if (LeafRec->isSubClassOf("ComplexPattern")) {
if (!N->getName().empty()) {
errs() << "We expect complex pattern uses to have names: " << *N << "\n";
exit(1);
}
// Handle complex pattern. // Handle complex pattern.
const ComplexPattern &CP = CGP.getComplexPattern(LeafRec); const ComplexPattern &CP = CGP.getComplexPattern(LeafRec);
return AddMatcherNode(new CheckComplexPatMatcherNode(CP)); return AddMatcherNode(new CheckComplexPatMatcherNode(CP));
@ -236,6 +241,8 @@ void MatcherGen::EmitOperatorMatchCode(const TreePatternNode *N,
AddMatcherNode(new CheckFoldableChainNodeMatcherNode()); AddMatcherNode(new CheckFoldableChainNodeMatcherNode());
} }
} }
// FIXME: Need to generate IsChainCompatible checks.
for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) { for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
// Get the code suitable for matching this child. Move to the child, check // Get the code suitable for matching this child. Move to the child, check
@ -265,7 +272,19 @@ void MatcherGen::EmitMatchCode(const TreePatternNode *N,
unsigned &VarMapEntry = VariableMap[N->getName()]; unsigned &VarMapEntry = VariableMap[N->getName()];
if (VarMapEntry == 0) { if (VarMapEntry == 0) {
VarMapEntry = ++NextRecordedOperandNo; VarMapEntry = ++NextRecordedOperandNo;
AddMatcherNode(new RecordMatcherNode());
// If this is a complex pattern, the match operation for it will
// implicitly record all of the outputs of it (which may be more than
// one).
if (const ComplexPattern *AM = N->getComplexPatternInfo(CGP)) {
// Record the right number of operands.
// FIXME: Does this include chain?
VarMapEntry += AM->getNumOperands()-1;
} else {
// If it is a normal named node, we must emit a 'Record' opcode.
AddMatcherNode(new RecordMatcherNode());
}
} else { } else {
// If we get here, this is a second reference to a specific name. Since // 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 // we already have checked that the first reference is valid, we don't