1 //===- DAGISelEmitter.cpp - Generate an instruction selector --------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Chris Lattner and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This tablegen backend emits a DAG instruction selector.
12 //===----------------------------------------------------------------------===//
14 #include "DAGISelEmitter.h"
16 #include "llvm/ADT/StringExtras.h"
17 #include "llvm/Support/Debug.h"
21 //===----------------------------------------------------------------------===//
22 // SDTypeConstraint implementation
25 SDTypeConstraint::SDTypeConstraint(Record *R) {
26 OperandNo = R->getValueAsInt("OperandNum");
28 if (R->isSubClassOf("SDTCisVT")) {
29 ConstraintType = SDTCisVT;
30 x.SDTCisVT_Info.VT = getValueType(R->getValueAsDef("VT"));
31 } else if (R->isSubClassOf("SDTCisInt")) {
32 ConstraintType = SDTCisInt;
33 } else if (R->isSubClassOf("SDTCisFP")) {
34 ConstraintType = SDTCisFP;
35 } else if (R->isSubClassOf("SDTCisSameAs")) {
36 ConstraintType = SDTCisSameAs;
37 x.SDTCisSameAs_Info.OtherOperandNum = R->getValueAsInt("OtherOperandNum");
38 } else if (R->isSubClassOf("SDTCisVTSmallerThanOp")) {
39 ConstraintType = SDTCisVTSmallerThanOp;
40 x.SDTCisVTSmallerThanOp_Info.OtherOperandNum =
41 R->getValueAsInt("OtherOperandNum");
43 std::cerr << "Unrecognized SDTypeConstraint '" << R->getName() << "'!\n";
48 /// getOperandNum - Return the node corresponding to operand #OpNo in tree
49 /// N, which has NumResults results.
50 TreePatternNode *SDTypeConstraint::getOperandNum(unsigned OpNo,
52 unsigned NumResults) const {
53 assert(NumResults == 1 && "We only work with single result nodes so far!");
55 if (OpNo < NumResults)
56 return N; // FIXME: need value #
58 return N->getChild(OpNo-NumResults);
61 /// ApplyTypeConstraint - Given a node in a pattern, apply this type
62 /// constraint to the nodes operands. This returns true if it makes a
63 /// change, false otherwise. If a type contradiction is found, throw an
65 bool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N,
66 const SDNodeInfo &NodeInfo,
67 TreePattern &TP) const {
68 unsigned NumResults = NodeInfo.getNumResults();
69 assert(NumResults == 1 && "We only work with single result nodes so far!");
71 // Check that the number of operands is sane.
72 if (NodeInfo.getNumOperands() >= 0) {
73 if (N->getNumChildren() != (unsigned)NodeInfo.getNumOperands())
74 TP.error(N->getOperator()->getName() + " node requires exactly " +
75 itostr(NodeInfo.getNumOperands()) + " operands!");
78 TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NumResults);
80 switch (ConstraintType) {
81 default: assert(0 && "Unknown constraint type!");
83 // Operand must be a particular type.
84 return NodeToApply->UpdateNodeType(x.SDTCisVT_Info.VT, TP);
86 if (NodeToApply->hasTypeSet() && !MVT::isInteger(NodeToApply->getType()))
87 NodeToApply->UpdateNodeType(MVT::i1, TP); // throw an error.
89 // FIXME: can tell from the target if there is only one Int type supported.
92 if (NodeToApply->hasTypeSet() &&
93 !MVT::isFloatingPoint(NodeToApply->getType()))
94 NodeToApply->UpdateNodeType(MVT::f32, TP); // throw an error.
95 // FIXME: can tell from the target if there is only one FP type supported.
98 TreePatternNode *OtherNode =
99 getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NumResults);
100 return NodeToApply->UpdateNodeType(OtherNode->getType(), TP) |
101 OtherNode->UpdateNodeType(NodeToApply->getType(), TP);
103 case SDTCisVTSmallerThanOp: {
104 // The NodeToApply must be a leaf node that is a VT. OtherOperandNum must
105 // have an integer type that is smaller than the VT.
106 if (!NodeToApply->isLeaf() ||
107 !dynamic_cast<DefInit*>(NodeToApply->getLeafValue()) ||
108 !static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef()
109 ->isSubClassOf("ValueType"))
110 TP.error(N->getOperator()->getName() + " expects a VT operand!");
112 getValueType(static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef());
113 if (!MVT::isInteger(VT))
114 TP.error(N->getOperator()->getName() + " VT operand must be integer!");
116 TreePatternNode *OtherNode =
117 getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N,NumResults);
118 if (OtherNode->hasTypeSet() &&
119 (!MVT::isInteger(OtherNode->getType()) ||
120 OtherNode->getType() <= VT))
121 OtherNode->UpdateNodeType(MVT::Other, TP); // Throw an error.
129 //===----------------------------------------------------------------------===//
130 // SDNodeInfo implementation
132 SDNodeInfo::SDNodeInfo(Record *R) : Def(R) {
133 EnumName = R->getValueAsString("Opcode");
134 SDClassName = R->getValueAsString("SDClass");
135 Record *TypeProfile = R->getValueAsDef("TypeProfile");
136 NumResults = TypeProfile->getValueAsInt("NumResults");
137 NumOperands = TypeProfile->getValueAsInt("NumOperands");
139 // Parse the type constraints.
140 ListInit *Constraints = TypeProfile->getValueAsListInit("Constraints");
141 for (unsigned i = 0, e = Constraints->getSize(); i != e; ++i) {
142 assert(dynamic_cast<DefInit*>(Constraints->getElement(i)) &&
143 "Constraints list should contain constraint definitions!");
145 static_cast<DefInit*>(Constraints->getElement(i))->getDef();
146 TypeConstraints.push_back(Constraint);
150 //===----------------------------------------------------------------------===//
151 // TreePatternNode implementation
154 TreePatternNode::~TreePatternNode() {
155 #if 0 // FIXME: implement refcounted tree nodes!
156 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
161 /// UpdateNodeType - Set the node type of N to VT if VT contains
162 /// information. If N already contains a conflicting type, then throw an
163 /// exception. This returns true if any information was updated.
165 bool TreePatternNode::UpdateNodeType(MVT::ValueType VT, TreePattern &TP) {
166 if (VT == MVT::LAST_VALUETYPE || getType() == VT) return false;
167 if (getType() == MVT::LAST_VALUETYPE) {
172 TP.error("Type inference contradiction found in node " +
173 getOperator()->getName() + "!");
174 return true; // unreachable
178 void TreePatternNode::print(std::ostream &OS) const {
180 OS << *getLeafValue();
182 OS << "(" << getOperator()->getName();
185 if (getType() == MVT::Other)
187 else if (getType() == MVT::LAST_VALUETYPE)
190 OS << ":" << getType();
193 if (getNumChildren() != 0) {
195 getChild(0)->print(OS);
196 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
198 getChild(i)->print(OS);
204 if (!PredicateFn.empty())
205 OS << "<<P:" << PredicateFn << ">>";
206 if (!TransformFn.empty())
207 OS << "<<X:" << TransformFn << ">>";
208 if (!getName().empty())
209 OS << ":$" << getName();
212 void TreePatternNode::dump() const {
216 /// clone - Make a copy of this tree and all of its children.
218 TreePatternNode *TreePatternNode::clone() const {
219 TreePatternNode *New;
221 New = new TreePatternNode(getLeafValue());
223 std::vector<TreePatternNode*> CChildren;
224 CChildren.reserve(Children.size());
225 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
226 CChildren.push_back(getChild(i)->clone());
227 New = new TreePatternNode(getOperator(), CChildren);
229 New->setName(getName());
230 New->setType(getType());
231 New->setPredicateFn(getPredicateFn());
232 New->setTransformFn(getTransformFn());
236 /// SubstituteFormalArguments - Replace the formal arguments in this tree
237 /// with actual values specified by ArgMap.
238 void TreePatternNode::
239 SubstituteFormalArguments(std::map<std::string, TreePatternNode*> &ArgMap) {
240 if (isLeaf()) return;
242 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
243 TreePatternNode *Child = getChild(i);
244 if (Child->isLeaf()) {
245 Init *Val = Child->getLeafValue();
246 if (dynamic_cast<DefInit*>(Val) &&
247 static_cast<DefInit*>(Val)->getDef()->getName() == "node") {
248 // We found a use of a formal argument, replace it with its value.
249 Child = ArgMap[Child->getName()];
250 assert(Child && "Couldn't find formal argument!");
254 getChild(i)->SubstituteFormalArguments(ArgMap);
260 /// InlinePatternFragments - If this pattern refers to any pattern
261 /// fragments, inline them into place, giving us a pattern without any
262 /// PatFrag references.
263 TreePatternNode *TreePatternNode::InlinePatternFragments(TreePattern &TP) {
264 if (isLeaf()) return this; // nothing to do.
265 Record *Op = getOperator();
267 if (!Op->isSubClassOf("PatFrag")) {
268 // Just recursively inline children nodes.
269 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
270 setChild(i, getChild(i)->InlinePatternFragments(TP));
274 // Otherwise, we found a reference to a fragment. First, look up its
275 // TreePattern record.
276 TreePattern *Frag = TP.getDAGISelEmitter().getPatternFragment(Op);
278 // Verify that we are passing the right number of operands.
279 if (Frag->getNumArgs() != Children.size())
280 TP.error("'" + Op->getName() + "' fragment requires " +
281 utostr(Frag->getNumArgs()) + " operands!");
283 TreePatternNode *FragTree = Frag->getOnlyTree()->clone();
285 // Resolve formal arguments to their actual value.
286 if (Frag->getNumArgs()) {
287 // Compute the map of formal to actual arguments.
288 std::map<std::string, TreePatternNode*> ArgMap;
289 for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i)
290 ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
292 FragTree->SubstituteFormalArguments(ArgMap);
295 FragTree->setName(getName());
297 // Get a new copy of this fragment to stitch into here.
298 //delete this; // FIXME: implement refcounting!
302 /// ApplyTypeConstraints - Apply all of the type constraints relevent to
303 /// this node and its children in the tree. This returns true if it makes a
304 /// change, false otherwise. If a type contradiction is found, throw an
306 bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP) {
307 if (isLeaf()) return false;
309 // special handling for set, which isn't really an SDNode.
310 if (getOperator()->getName() == "set") {
311 assert (getNumChildren() == 2 && "Only handle 2 operand set's for now!");
312 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP);
313 MadeChange |= getChild(1)->ApplyTypeConstraints(TP);
315 // Types of operands must match.
316 MadeChange |= getChild(0)->UpdateNodeType(getChild(1)->getType(), TP);
317 MadeChange |= getChild(1)->UpdateNodeType(getChild(0)->getType(), TP);
318 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
322 const SDNodeInfo &NI = TP.getDAGISelEmitter().getSDNodeInfo(getOperator());
324 bool MadeChange = NI.ApplyTypeConstraints(this, TP);
325 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
326 MadeChange |= getChild(i)->ApplyTypeConstraints(TP);
331 //===----------------------------------------------------------------------===//
332 // TreePattern implementation
335 TreePattern::TreePattern(Record *TheRec, const std::vector<DagInit *> &RawPat,
336 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
338 for (unsigned i = 0, e = RawPat.size(); i != e; ++i)
339 Trees.push_back(ParseTreePattern(RawPat[i]));
342 void TreePattern::error(const std::string &Msg) const {
343 throw "In " + TheRecord->getName() + ": " + Msg;
346 /// getIntrinsicType - Check to see if the specified record has an intrinsic
347 /// type which should be applied to it. This infer the type of register
348 /// references from the register file information, for example.
350 MVT::ValueType TreePattern::getIntrinsicType(Record *R) const {
351 // Check to see if this is a register or a register class...
352 if (R->isSubClassOf("RegisterClass"))
353 return getValueType(R->getValueAsDef("RegType"));
354 else if (R->isSubClassOf("PatFrag")) {
355 // Pattern fragment types will be resolved when they are inlined.
356 return MVT::LAST_VALUETYPE;
357 } else if (R->isSubClassOf("Register")) {
358 assert(0 && "Explicit registers not handled here yet!\n");
359 return MVT::LAST_VALUETYPE;
360 } else if (R->isSubClassOf("ValueType")) {
363 } else if (R->getName() == "node") {
365 return MVT::LAST_VALUETYPE;
368 error("Unknown value used: " + R->getName());
372 TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) {
373 Record *Operator = Dag->getNodeType();
375 if (Operator->isSubClassOf("ValueType")) {
376 // If the operator is a ValueType, then this must be "type cast" of a leaf
378 if (Dag->getNumArgs() != 1)
379 error("Type cast only valid for a leaf node!");
381 Init *Arg = Dag->getArg(0);
382 TreePatternNode *New;
383 if (DefInit *DI = dynamic_cast<DefInit*>(Arg)) {
384 New = new TreePatternNode(DI);
385 // If it's a regclass or something else known, set the type.
386 New->setType(getIntrinsicType(DI->getDef()));
387 } else if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
388 New = ParseTreePattern(DI);
391 error("Unknown leaf value for tree pattern!");
395 // Apply the type cast.
396 New->UpdateNodeType(getValueType(Operator), *this);
400 // Verify that this is something that makes sense for an operator.
401 if (!Operator->isSubClassOf("PatFrag") && !Operator->isSubClassOf("SDNode") &&
402 Operator->getName() != "set")
403 error("Unrecognized node '" + Operator->getName() + "'!");
405 std::vector<TreePatternNode*> Children;
407 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
408 Init *Arg = Dag->getArg(i);
409 if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
410 Children.push_back(ParseTreePattern(DI));
411 Children.back()->setName(Dag->getArgName(i));
412 } else if (DefInit *DefI = dynamic_cast<DefInit*>(Arg)) {
413 Record *R = DefI->getDef();
414 // Direct reference to a leaf DagNode or PatFrag? Turn it into a
415 // TreePatternNode if its own.
416 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
417 Dag->setArg(i, new DagInit(R,
418 std::vector<std::pair<Init*, std::string> >()));
419 --i; // Revisit this node...
421 TreePatternNode *Node = new TreePatternNode(DefI);
422 Node->setName(Dag->getArgName(i));
423 Children.push_back(Node);
425 // If it's a regclass or something else known, set the type.
426 Node->setType(getIntrinsicType(R));
429 if (R->getName() == "node") {
430 if (Dag->getArgName(i).empty())
431 error("'node' argument requires a name to match with operand list");
432 Args.push_back(Dag->getArgName(i));
437 error("Unknown leaf value for tree pattern!");
441 return new TreePatternNode(Operator, Children);
444 /// InferAllTypes - Infer/propagate as many types throughout the expression
445 /// patterns as possible. Return true if all types are infered, false
446 /// otherwise. Throw an exception if a type contradiction is found.
447 bool TreePattern::InferAllTypes() {
448 bool MadeChange = true;
451 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
452 MadeChange |= Trees[i]->ApplyTypeConstraints(*this);
455 bool HasUnresolvedTypes = false;
456 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
457 HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType();
458 return !HasUnresolvedTypes;
461 void TreePattern::print(std::ostream &OS) const {
462 OS << getRecord()->getName();
464 OS << "(" << Args[0];
465 for (unsigned i = 1, e = Args.size(); i != e; ++i)
466 OS << ", " << Args[i];
471 if (Trees.size() > 1)
473 for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
479 if (Trees.size() > 1)
483 void TreePattern::dump() const { print(std::cerr); }
487 //===----------------------------------------------------------------------===//
488 // DAGISelEmitter implementation
491 // Parse all of the SDNode definitions for the target, populating SDNodes.
492 void DAGISelEmitter::ParseNodeInfo() {
493 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode");
494 while (!Nodes.empty()) {
495 SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
500 /// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
501 /// map, and emit them to the file as functions.
502 void DAGISelEmitter::ParseNodeTransforms(std::ostream &OS) {
503 OS << "\n// Node transformations.\n";
504 std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm");
505 while (!Xforms.empty()) {
506 Record *XFormNode = Xforms.back();
507 Record *SDNode = XFormNode->getValueAsDef("Opcode");
508 std::string Code = XFormNode->getValueAsCode("XFormFunction");
509 SDNodeXForms.insert(std::make_pair(XFormNode,
510 std::make_pair(SDNode, Code)));
513 std::string ClassName = getSDNodeInfo(SDNode).getSDClassName();
514 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
516 OS << "inline SDOperand Transform_" << XFormNode->getName()
517 << "(SDNode *" << C2 << ") {\n";
518 if (ClassName != "SDNode")
519 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
520 OS << Code << "\n}\n";
529 /// ParseAndResolvePatternFragments - Parse all of the PatFrag definitions in
530 /// the .td file, building up the PatternFragments map. After we've collected
531 /// them all, inline fragments together as necessary, so that there are no
532 /// references left inside a pattern fragment to a pattern fragment.
534 /// This also emits all of the predicate functions to the output file.
536 void DAGISelEmitter::ParseAndResolvePatternFragments(std::ostream &OS) {
537 std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrag");
539 // First step, parse all of the fragments and emit predicate functions.
540 OS << "\n// Predicate functions.\n";
541 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
542 std::vector<DagInit*> Trees;
543 Trees.push_back(Fragments[i]->getValueAsDag("Fragment"));
544 TreePattern *P = new TreePattern(Fragments[i], Trees, *this);
545 PatternFragments[Fragments[i]] = P;
547 // Validate the argument list, converting it to map, to discard duplicates.
548 std::vector<std::string> &Args = P->getArgList();
549 std::set<std::string> OperandsMap(Args.begin(), Args.end());
551 if (OperandsMap.count(""))
552 P->error("Cannot have unnamed 'node' values in pattern fragment!");
554 // Parse the operands list.
555 DagInit *OpsList = Fragments[i]->getValueAsDag("Operands");
556 if (OpsList->getNodeType()->getName() != "ops")
557 P->error("Operands list should start with '(ops ... '!");
559 // Copy over the arguments.
561 for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {
562 if (!dynamic_cast<DefInit*>(OpsList->getArg(j)) ||
563 static_cast<DefInit*>(OpsList->getArg(j))->
564 getDef()->getName() != "node")
565 P->error("Operands list should all be 'node' values.");
566 if (OpsList->getArgName(j).empty())
567 P->error("Operands list should have names for each operand!");
568 if (!OperandsMap.count(OpsList->getArgName(j)))
569 P->error("'" + OpsList->getArgName(j) +
570 "' does not occur in pattern or was multiply specified!");
571 OperandsMap.erase(OpsList->getArgName(j));
572 Args.push_back(OpsList->getArgName(j));
575 if (!OperandsMap.empty())
576 P->error("Operands list does not contain an entry for operand '" +
577 *OperandsMap.begin() + "'!");
579 // If there is a code init for this fragment, emit the predicate code and
580 // keep track of the fact that this fragment uses it.
581 std::string Code = Fragments[i]->getValueAsCode("Predicate");
583 assert(!P->getOnlyTree()->isLeaf() && "Can't be a leaf!");
584 std::string ClassName =
585 getSDNodeInfo(P->getOnlyTree()->getOperator()).getSDClassName();
586 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
588 OS << "inline bool Predicate_" << Fragments[i]->getName()
589 << "(SDNode *" << C2 << ") {\n";
590 if (ClassName != "SDNode")
591 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
592 OS << Code << "\n}\n";
593 P->getOnlyTree()->setPredicateFn("Predicate_"+Fragments[i]->getName());
596 // If there is a node transformation corresponding to this, keep track of
598 Record *Transform = Fragments[i]->getValueAsDef("OperandTransform");
599 if (!getSDNodeTransform(Transform).second.empty()) // not noop xform?
600 P->getOnlyTree()->setTransformFn("Transform_"+Transform->getName());
605 // Now that we've parsed all of the tree fragments, do a closure on them so
606 // that there are not references to PatFrags left inside of them.
607 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
608 E = PatternFragments.end(); I != E; ++I) {
609 TreePattern *ThePat = I->second;
610 ThePat->InlinePatternFragments();
612 // Infer as many types as possible. Don't worry about it if we don't infer
613 // all of them, some may depend on the inputs of the pattern.
615 ThePat->InferAllTypes();
617 // If this pattern fragment is not supported by this target (no types can
618 // satisfy its constraints), just ignore it. If the bogus pattern is
619 // actually used by instructions, the type consistency error will be
623 // If debugging, print out the pattern fragment result.
624 DEBUG(ThePat->dump());
628 /// ParseAndResolveInstructions - Parse all of the instructions, inlining and
629 /// resolving any fragments involved. This populates the Instructions list with
630 /// fully resolved instructions.
631 void DAGISelEmitter::ParseAndResolveInstructions() {
632 std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction");
634 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
635 if (!dynamic_cast<ListInit*>(Instrs[i]->getValueInit("Pattern")))
636 continue; // no pattern yet, ignore it.
638 ListInit *LI = Instrs[i]->getValueAsListInit("Pattern");
639 if (LI->getSize() == 0) continue; // no pattern.
641 std::vector<DagInit*> Trees;
642 for (unsigned j = 0, e = LI->getSize(); j != e; ++j)
643 Trees.push_back((DagInit*)LI->getElement(j));
645 // Parse the instruction.
646 TreePattern *I = new TreePattern(Instrs[i], Trees, *this);
647 // Inline pattern fragments into it.
648 I->InlinePatternFragments();
650 // Infer as many types as possible. If we cannot infer all of them, we can
651 // never do anything with this instruction pattern: report it to the user.
652 if (!I->InferAllTypes()) {
654 I->error("Could not infer all types in pattern!");
657 // SetDestinations - Keep track of all the virtual registers that are 'set'
658 // in the instruction, including what reg class they are.
659 std::map<std::string, Record*> SetDestinations;
661 // Verify that the top-level forms in the instruction are of void type, and
662 // fill in the SetDestinations map.
663 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {
664 TreePatternNode *Pat = I->getTree(j);
665 if (Pat->getType() != MVT::isVoid) {
667 I->error("Top-level forms in instruction pattern should have"
672 if (Pat->getOperator()->getName() == "set") {
673 if (Pat->getNumChildren() == 0)
674 I->error("set requires operands!");
675 else if (Pat->getNumChildren() & 1)
676 I->error("set requires an even number of operands");
678 // Check the set destinations.
679 unsigned NumValues = Pat->getNumChildren()/2;
680 for (unsigned i = 0; i != NumValues; ++i) {
681 TreePatternNode *Dest = Pat->getChild(i);
683 I->error("set destination should be a virtual register!");
685 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
687 I->error("set destination should be a virtual register!");
689 if (!Val->getDef()->isSubClassOf("RegisterClass"))
690 I->error("set destination should be a virtual register!");
691 if (Dest->getName().empty())
692 I->error("set destination must have a name!");
693 if (SetDestinations.count(Dest->getName()))
694 I->error("cannot set '" + Dest->getName() +"' multiple times");
695 SetDestinations[Dest->getName()] = Val->getDef();
700 // Now that we have operands that are sets, inspect the operands list for
701 // the instruction. This determines the order that operands are added to
702 // the machine instruction the node corresponds to.
703 unsigned NumResults = SetDestinations.size();
704 assert(NumResults == 1 &&
705 "This code only handles a single set right now!");
707 unsigned NumOperands = 0;
710 Instructions.push_back(DAGInstruction(I, NumResults, NumOperands));
713 // If we can, convert the instructions to be a patterns that are matched!
714 for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {
715 TreePattern *I = Instructions[i].getPattern();
717 if (I->getNumTrees() != 1) {
718 std::cerr << "CANNOT HANDLE: " << I->getRecord()->getName() << " yet!";
721 TreePatternNode *Pattern = I->getTree(0);
722 if (Pattern->getOperator()->getName() != "set")
723 continue; // Not a set (store or something?)
725 if (Pattern->getNumChildren() != 2)
726 continue; // Not a set of a single value (not handled so far)
728 TreePatternNode *SrcPattern = Pattern->getChild(1)->clone();
729 TreePatternNode *DstPattern = SrcPattern->clone(); // FIXME: WRONG
730 PatternsToMatch.push_back(std::make_pair(SrcPattern, DstPattern));
731 DEBUG(std::cerr << "PATTERN TO MATCH: "; SrcPattern->dump();
732 std::cerr << "\nRESULT DAG : ";
733 DstPattern->dump(); std::cerr << "\n");
737 void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) {
739 OS << "// The main instruction selector code.\n"
740 << "SDOperand SelectCode(SDOperand Op) {\n"
741 << " SDNode *N = Op.Val;\n"
742 << " if (N->getOpcode() >= ISD::BUILTIN_OP_END &&\n"
743 << " N->getOpcode() < PPCISD::FIRST_NUMBER)\n"
744 << " return Op; // Already selected.\n\n"
745 << " switch (N->getOpcode()) {\n"
746 << " default: break;\n"
747 << " case ISD::EntryToken: // These leaves remain the same.\n"
749 << " case ISD::AssertSext:\n"
750 << " case ISD::AssertZext:\n"
751 << " return Select(N->getOperand(0));\n";
755 OS << " } // end of big switch.\n\n"
756 << " std::cerr << \"Cannot yet select: \";\n"
758 << " std::cerr << '\\n';\n"
763 void DAGISelEmitter::run(std::ostream &OS) {
764 EmitSourceFileHeader("DAG Instruction Selector for the " + Target.getName() +
767 OS << "// *** NOTE: This file is #included into the middle of the target\n"
768 << "// *** instruction selector class. These functions are really "
771 ParseNodeTransforms(OS);
772 ParseAndResolvePatternFragments(OS);
773 ParseAndResolveInstructions();
775 // TODO: convert some instructions to expanders if needed or something.
777 EmitInstructionSelector(OS);
779 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
780 E = PatternFragments.end(); I != E; ++I)
782 PatternFragments.clear();
784 Instructions.clear();