1 //===- DAGISelMatcherGen.cpp - Matcher generator --------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "DAGISelMatcher.h"
11 #include "CodeGenDAGPatterns.h"
13 #include "llvm/ADT/SmallVector.h"
14 #include "llvm/ADT/StringMap.h"
19 /// getRegisterValueType - Look up and return the ValueType of the specified
20 /// register. If the register is a member of multiple register classes which
21 /// have different associated types, return MVT::Other.
22 static MVT::SimpleValueType getRegisterValueType(Record *R,
23 const CodeGenTarget &T) {
25 MVT::SimpleValueType VT = MVT::Other;
26 const std::vector<CodeGenRegisterClass> &RCs = T.getRegisterClasses();
27 std::vector<Record*>::const_iterator Element;
29 for (unsigned rc = 0, e = RCs.size(); rc != e; ++rc) {
30 const CodeGenRegisterClass &RC = RCs[rc];
31 if (!std::count(RC.Elements.begin(), RC.Elements.end(), R))
36 VT = RC.getValueTypeNum(0);
40 // In multiple RC's. If the Types of the RC's do not agree, return
41 // MVT::Other. The target is responsible for handling this.
42 if (VT != RC.getValueTypeNum(0))
43 // FIXME2: when does this happen? Abort?
52 const PatternToMatch &Pattern;
53 const CodeGenDAGPatterns &CGP;
55 /// PatWithNoTypes - This is a clone of Pattern.getSrcPattern() that starts
56 /// out with all of the types removed. This allows us to insert type checks
57 /// as we scan the tree.
58 TreePatternNode *PatWithNoTypes;
60 /// VariableMap - A map from variable names ('$dst') to the recorded operand
61 /// number that they were captured as. These are biased by 1 to make
63 StringMap<unsigned> VariableMap;
65 /// NextRecordedOperandNo - As we emit opcodes to record matched values in
66 /// the RecordedNodes array, this keeps track of which slot will be next to
68 unsigned NextRecordedOperandNo;
70 /// MatchedChainNodes - This maintains the position in the recorded nodes
71 /// array of all of the recorded input nodes that have chains.
72 SmallVector<unsigned, 2> MatchedChainNodes;
74 /// MatchedFlagResultNodes - This maintains the position in the recorded
75 /// nodes array of all of the recorded input nodes that have flag results.
76 SmallVector<unsigned, 2> MatchedFlagResultNodes;
78 /// PhysRegInputs - List list has an entry for each explicitly specified
79 /// physreg input to the pattern. The first elt is the Register node, the
80 /// second is the recorded slot number the input pattern match saved it in.
81 SmallVector<std::pair<Record*, unsigned>, 2> PhysRegInputs;
83 /// EmittedMergeInputChains - For nodes that match patterns involving
84 /// chains, is set to true if we emitted the "MergeInputChains" operation.
85 bool EmittedMergeInputChains;
87 /// Matcher - This is the top level of the generated matcher, the result.
90 /// CurPredicate - As we emit matcher nodes, this points to the latest check
91 /// which should have future checks stuck into its Next position.
92 Matcher *CurPredicate;
94 MatcherGen(const PatternToMatch &pattern, const CodeGenDAGPatterns &cgp);
97 delete PatWithNoTypes;
100 void EmitMatcherCode();
101 void EmitResultCode();
103 Matcher *GetMatcher() const { return TheMatcher; }
104 Matcher *GetCurPredicate() const { return CurPredicate; }
106 void AddMatcher(Matcher *NewNode);
107 void InferPossibleTypes();
109 // Matcher Generation.
110 void EmitMatchCode(const TreePatternNode *N, TreePatternNode *NodeNoTypes);
111 void EmitLeafMatchCode(const TreePatternNode *N);
112 void EmitOperatorMatchCode(const TreePatternNode *N,
113 TreePatternNode *NodeNoTypes);
115 // Result Code Generation.
116 unsigned getNamedArgumentSlot(StringRef Name) {
117 unsigned VarMapEntry = VariableMap[Name];
118 assert(VarMapEntry != 0 &&
119 "Variable referenced but not defined and not caught earlier!");
120 return VarMapEntry-1;
123 /// GetInstPatternNode - Get the pattern for an instruction.
124 const TreePatternNode *GetInstPatternNode(const DAGInstruction &Ins,
125 const TreePatternNode *N);
127 void EmitResultOperand(const TreePatternNode *N,
128 SmallVectorImpl<unsigned> &ResultOps);
129 void EmitResultOfNamedOperand(const TreePatternNode *N,
130 SmallVectorImpl<unsigned> &ResultOps);
131 void EmitResultLeafAsOperand(const TreePatternNode *N,
132 SmallVectorImpl<unsigned> &ResultOps);
133 void EmitResultInstructionAsOperand(const TreePatternNode *N,
134 SmallVectorImpl<unsigned> &ResultOps);
135 void EmitResultSDNodeXFormAsOperand(const TreePatternNode *N,
136 SmallVectorImpl<unsigned> &ResultOps);
139 } // end anon namespace.
141 MatcherGen::MatcherGen(const PatternToMatch &pattern,
142 const CodeGenDAGPatterns &cgp)
143 : Pattern(pattern), CGP(cgp), NextRecordedOperandNo(0),
144 EmittedMergeInputChains(false), TheMatcher(0), CurPredicate(0) {
145 // We need to produce the matcher tree for the patterns source pattern. To do
146 // this we need to match the structure as well as the types. To do the type
147 // matching, we want to figure out the fewest number of type checks we need to
148 // emit. For example, if there is only one integer type supported by a
149 // target, there should be no type comparisons at all for integer patterns!
151 // To figure out the fewest number of type checks needed, clone the pattern,
152 // remove the types, then perform type inference on the pattern as a whole.
153 // If there are unresolved types, emit an explicit check for those types,
154 // apply the type to the tree, then rerun type inference. Iterate until all
155 // types are resolved.
157 PatWithNoTypes = Pattern.getSrcPattern()->clone();
158 PatWithNoTypes->RemoveAllTypes();
160 // If there are types that are manifestly known, infer them.
161 InferPossibleTypes();
164 /// InferPossibleTypes - As we emit the pattern, we end up generating type
165 /// checks and applying them to the 'PatWithNoTypes' tree. As we do this, we
166 /// want to propagate implied types as far throughout the tree as possible so
167 /// that we avoid doing redundant type checks. This does the type propagation.
168 void MatcherGen::InferPossibleTypes() {
169 // TP - Get *SOME* tree pattern, we don't care which. It is only used for
170 // diagnostics, which we know are impossible at this point.
171 TreePattern &TP = *CGP.pf_begin()->second;
174 bool MadeChange = true;
176 MadeChange = PatWithNoTypes->ApplyTypeConstraints(TP,
177 true/*Ignore reg constraints*/);
179 errs() << "Type constraint application shouldn't fail!";
185 /// AddMatcher - Add a matcher node to the current graph we're building.
186 void MatcherGen::AddMatcher(Matcher *NewNode) {
187 if (CurPredicate != 0)
188 CurPredicate->setNext(NewNode);
190 TheMatcher = NewNode;
191 CurPredicate = NewNode;
195 //===----------------------------------------------------------------------===//
196 // Pattern Match Generation
197 //===----------------------------------------------------------------------===//
199 /// EmitLeafMatchCode - Generate matching code for leaf nodes.
200 void MatcherGen::EmitLeafMatchCode(const TreePatternNode *N) {
201 assert(N->isLeaf() && "Not a leaf?");
203 // If there are node predicates for this node, generate their checks.
204 for (unsigned i = 0, e = N->getPredicateFns().size(); i != e; ++i)
205 AddMatcher(new CheckPredicateMatcher(N->getPredicateFns()[i]));
207 // Direct match against an integer constant.
208 if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue()))
209 return AddMatcher(new CheckIntegerMatcher(II->getValue()));
211 DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue());
213 errs() << "Unknown leaf kind: " << *DI << "\n";
217 Record *LeafRec = DI->getDef();
218 if (// Handle register references. Nothing to do here, they always match.
219 LeafRec->isSubClassOf("RegisterClass") ||
220 LeafRec->isSubClassOf("PointerLikeRegClass") ||
221 // Place holder for SRCVALUE nodes. Nothing to do here.
222 LeafRec->getName() == "srcvalue")
225 // If we have a physreg reference like (mul gpr:$src, EAX) then we need to
226 // record the register
227 if (LeafRec->isSubClassOf("Register")) {
228 AddMatcher(new RecordMatcher("physreg input "+LeafRec->getName()));
229 PhysRegInputs.push_back(std::make_pair(LeafRec, NextRecordedOperandNo++));
233 if (LeafRec->isSubClassOf("ValueType"))
234 return AddMatcher(new CheckValueTypeMatcher(LeafRec->getName()));
236 if (LeafRec->isSubClassOf("CondCode"))
237 return AddMatcher(new CheckCondCodeMatcher(LeafRec->getName()));
239 if (LeafRec->isSubClassOf("ComplexPattern")) {
240 // We can't model ComplexPattern uses that don't have their name taken yet.
241 // The OPC_CheckComplexPattern operation implicitly records the results.
242 if (N->getName().empty()) {
243 errs() << "We expect complex pattern uses to have names: " << *N << "\n";
247 // Handle complex pattern.
248 const ComplexPattern &CP = CGP.getComplexPattern(LeafRec);
250 // If we're at the root of the pattern, we have to check that the opcode
251 // is a one of the ones requested to be matched.
252 if (N == Pattern.getSrcPattern()) {
253 const std::vector<Record*> &OpNodes = CP.getRootNodes();
254 if (OpNodes.size() == 1) {
255 AddMatcher(new CheckOpcodeMatcher(CGP.getSDNodeInfo(OpNodes[0])));
256 } else if (!OpNodes.empty()) {
257 SmallVector<const SDNodeInfo*, 4> OpNames;
258 for (unsigned i = 0, e = OpNodes.size(); i != e; i++)
259 OpNames.push_back(&CGP.getSDNodeInfo(OpNodes[i]));
260 AddMatcher(new CheckMultiOpcodeMatcher(OpNames.data(), OpNames.size()));
264 // Emit a CheckComplexPat operation, which does the match (aborting if it
265 // fails) and pushes the matched operands onto the recorded nodes list.
266 AddMatcher(new CheckComplexPatMatcher(CP));
268 // Record the right number of operands.
269 NextRecordedOperandNo += CP.getNumOperands();
270 if (CP.hasProperty(SDNPHasChain))
271 ++NextRecordedOperandNo; // Chained node operand.
273 // If the complex pattern has a chain, then we need to keep track of the
274 // fact that we just recorded a chain input. The chain input will be
275 // matched as the last operand of the predicate if it was successful.
276 if (CP.hasProperty(SDNPHasChain)) {
277 // It is the last operand recorded.
278 assert(NextRecordedOperandNo > 1 &&
279 "Should have recorded input/result chains at least!");
280 MatchedChainNodes.push_back(NextRecordedOperandNo-1);
282 // If we need to check chains, do so, see comment for
283 // "NodeHasProperty(SDNPHasChain" below.
284 if (MatchedChainNodes.size() > 1) {
285 // FIXME2: This is broken, we should eliminate this nonsense completely,
286 // but we want to produce the same selections that the old matcher does
288 unsigned PrevOp = MatchedChainNodes[MatchedChainNodes.size()-2];
289 AddMatcher(new CheckChainCompatibleMatcher(PrevOp));
293 // TODO: Complex patterns can't have output flags, if they did, we'd want
298 errs() << "Unknown leaf kind: " << *N << "\n";
302 void MatcherGen::EmitOperatorMatchCode(const TreePatternNode *N,
303 TreePatternNode *NodeNoTypes) {
304 assert(!N->isLeaf() && "Not an operator?");
305 const SDNodeInfo &CInfo = CGP.getSDNodeInfo(N->getOperator());
307 // If this is an 'and R, 1234' where the operation is AND/OR and the RHS is
308 // a constant without a predicate fn that has more that one bit set, handle
309 // this as a special case. This is usually for targets that have special
310 // handling of certain large constants (e.g. alpha with it's 8/16/32-bit
311 // handling stuff). Using these instructions is often far more efficient
312 // than materializing the constant. Unfortunately, both the instcombiner
313 // and the dag combiner can often infer that bits are dead, and thus drop
314 // them from the mask in the dag. For example, it might turn 'AND X, 255'
315 // into 'AND X, 254' if it knows the low bit is set. Emit code that checks
317 if ((N->getOperator()->getName() == "and" ||
318 N->getOperator()->getName() == "or") &&
319 N->getChild(1)->isLeaf() && N->getChild(1)->getPredicateFns().empty() &&
320 N->getPredicateFns().empty()) {
321 if (IntInit *II = dynamic_cast<IntInit*>(N->getChild(1)->getLeafValue())) {
322 if (!isPowerOf2_32(II->getValue())) { // Don't bother with single bits.
323 if (N->getOperator()->getName() == "and")
324 AddMatcher(new CheckAndImmMatcher(II->getValue()));
326 AddMatcher(new CheckOrImmMatcher(II->getValue()));
328 // Match the LHS of the AND as appropriate.
329 AddMatcher(new MoveChildMatcher(0));
330 EmitMatchCode(N->getChild(0), NodeNoTypes->getChild(0));
331 AddMatcher(new MoveParentMatcher());
337 // Check that the current opcode lines up.
338 AddMatcher(new CheckOpcodeMatcher(CInfo));
340 // If there are node predicates for this node, generate their checks.
341 for (unsigned i = 0, e = N->getPredicateFns().size(); i != e; ++i)
342 AddMatcher(new CheckPredicateMatcher(N->getPredicateFns()[i]));
345 // If this node has memory references (i.e. is a load or store), tell the
346 // interpreter to capture them in the memref array.
347 if (N->NodeHasProperty(SDNPMemOperand, CGP))
348 AddMatcher(new RecordMemRefMatcher());
350 // If this node has a chain, then the chain is operand #0 is the SDNode, and
351 // the child numbers of the node are all offset by one.
353 if (N->NodeHasProperty(SDNPHasChain, CGP)) {
354 // Record the node and remember it in our chained nodes list.
355 AddMatcher(new RecordMatcher("'" + N->getOperator()->getName() +
357 // Remember all of the input chains our pattern will match.
358 MatchedChainNodes.push_back(NextRecordedOperandNo++);
360 // If this is the second (e.g. indbr(load) or store(add(load))) or third
361 // input chain (e.g. (store (add (load, load))) from msp430) we need to make
362 // sure that folding the chain won't induce cycles in the DAG. This could
363 // happen if there were an intermediate node between the indbr and load, for
365 if (MatchedChainNodes.size() > 1) {
366 // FIXME2: This is broken, we should eliminate this nonsense completely,
367 // but we want to produce the same selections that the old matcher does
369 unsigned PrevOp = MatchedChainNodes[MatchedChainNodes.size()-2];
370 AddMatcher(new CheckChainCompatibleMatcher(PrevOp));
373 // Don't look at the input chain when matching the tree pattern to the
377 // If this node is not the root and the subtree underneath it produces a
378 // chain, then the result of matching the node is also produce a chain.
379 // Beyond that, this means that we're also folding (at least) the root node
380 // into the node that produce the chain (for example, matching
381 // "(add reg, (load ptr))" as a add_with_memory on X86). This is
382 // problematic, if the 'reg' node also uses the load (say, its chain).
387 // | \ DAG's like cheese.
393 // It would be invalid to fold XX and LD. In this case, folding the two
394 // nodes together would induce a cycle in the DAG, making it a 'cyclic DAG'
395 // To prevent this, we emit a dynamic check for legality before allowing
396 // this to be folded.
398 const TreePatternNode *Root = Pattern.getSrcPattern();
399 if (N != Root) { // Not the root of the pattern.
400 // If there is a node between the root and this node, then we definitely
401 // need to emit the check.
402 bool NeedCheck = !Root->hasChild(N);
404 // If it *is* an immediate child of the root, we can still need a check if
405 // the root SDNode has multiple inputs. For us, this means that it is an
406 // intrinsic, has multiple operands, or has other inputs like chain or
409 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Root->getOperator());
411 Root->getOperator() == CGP.get_intrinsic_void_sdnode() ||
412 Root->getOperator() == CGP.get_intrinsic_w_chain_sdnode() ||
413 Root->getOperator() == CGP.get_intrinsic_wo_chain_sdnode() ||
414 PInfo.getNumOperands() > 1 ||
415 PInfo.hasProperty(SDNPHasChain) ||
416 PInfo.hasProperty(SDNPInFlag) ||
417 PInfo.hasProperty(SDNPOptInFlag);
421 AddMatcher(new CheckFoldableChainNodeMatcher());
425 // If this node has an output flag and isn't the root, remember it.
426 if (N->NodeHasProperty(SDNPOutFlag, CGP) &&
427 N != Pattern.getSrcPattern()) {
428 // TODO: This redundantly records nodes with both flags and chains.
430 // Record the node and remember it in our chained nodes list.
431 AddMatcher(new RecordMatcher("'" + N->getOperator()->getName() +
432 "' flag output node"));
433 // Remember all of the nodes with output flags our pattern will match.
434 MatchedFlagResultNodes.push_back(NextRecordedOperandNo++);
437 // If this node is known to have an input flag or if it *might* have an input
438 // flag, capture it as the flag input of the pattern.
439 if (N->NodeHasProperty(SDNPOptInFlag, CGP) ||
440 N->NodeHasProperty(SDNPInFlag, CGP))
441 AddMatcher(new CaptureFlagInputMatcher());
443 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
444 // Get the code suitable for matching this child. Move to the child, check
445 // it then move back to the parent.
446 AddMatcher(new MoveChildMatcher(OpNo));
447 EmitMatchCode(N->getChild(i), NodeNoTypes->getChild(i));
448 AddMatcher(new MoveParentMatcher());
453 void MatcherGen::EmitMatchCode(const TreePatternNode *N,
454 TreePatternNode *NodeNoTypes) {
455 // If N and NodeNoTypes don't agree on a type, then this is a case where we
456 // need to do a type check. Emit the check, apply the tyep to NodeNoTypes and
457 // reinfer any correlated types.
458 if (NodeNoTypes->getExtTypes() != N->getExtTypes()) {
459 AddMatcher(new CheckTypeMatcher(N->getTypeNum(0)));
460 NodeNoTypes->setTypes(N->getExtTypes());
461 InferPossibleTypes();
464 // If this node has a name associated with it, capture it in VariableMap. If
465 // we already saw this in the pattern, emit code to verify dagness.
466 if (!N->getName().empty()) {
467 unsigned &VarMapEntry = VariableMap[N->getName()];
468 if (VarMapEntry == 0) {
469 // If it is a named node, we must emit a 'Record' opcode.
470 VarMapEntry = ++NextRecordedOperandNo;
471 AddMatcher(new RecordMatcher("$" + N->getName()));
473 // If we get here, this is a second reference to a specific name. Since
474 // we already have checked that the first reference is valid, we don't
475 // have to recursively match it, just check that it's the same as the
476 // previously named thing.
477 AddMatcher(new CheckSameMatcher(VarMapEntry-1));
483 EmitLeafMatchCode(N);
485 EmitOperatorMatchCode(N, NodeNoTypes);
488 void MatcherGen::EmitMatcherCode() {
489 // If the pattern has a predicate on it (e.g. only enabled when a subtarget
490 // feature is around, do the check).
491 // FIXME: This should get emitted after the match code below to encourage
492 // sharing. This can't happen until we get an X86ISD::AddrMode node made by
493 // dag combine, eliminating the horrible side-effect-full stuff from
494 // X86's MatchAddress.
495 if (!Pattern.getPredicateCheck().empty())
497 CheckPatternPredicateMatcher(Pattern.getPredicateCheck()));
499 // Emit the matcher for the pattern structure and types.
500 EmitMatchCode(Pattern.getSrcPattern(), PatWithNoTypes);
504 //===----------------------------------------------------------------------===//
505 // Node Result Generation
506 //===----------------------------------------------------------------------===//
508 void MatcherGen::EmitResultOfNamedOperand(const TreePatternNode *N,
509 SmallVectorImpl<unsigned> &ResultOps){
510 assert(!N->getName().empty() && "Operand not named!");
512 unsigned SlotNo = getNamedArgumentSlot(N->getName());
514 // A reference to a complex pattern gets all of the results of the complex
516 if (const ComplexPattern *CP = N->getComplexPatternInfo(CGP)) {
517 // The first slot entry is the node itself, the subsequent entries are the
519 for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
520 ResultOps.push_back(SlotNo+i+1);
524 // If this is an 'imm' or 'fpimm' node, make sure to convert it to the target
525 // version of the immediate so that it doesn't get selected due to some other
528 StringRef OperatorName = N->getOperator()->getName();
529 if (OperatorName == "imm" || OperatorName == "fpimm") {
530 AddMatcher(new EmitConvertToTargetMatcher(SlotNo));
531 ResultOps.push_back(NextRecordedOperandNo++);
536 ResultOps.push_back(SlotNo);
539 void MatcherGen::EmitResultLeafAsOperand(const TreePatternNode *N,
540 SmallVectorImpl<unsigned> &ResultOps) {
541 assert(N->isLeaf() && "Must be a leaf");
543 if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
544 AddMatcher(new EmitIntegerMatcher(II->getValue(),N->getTypeNum(0)));
545 ResultOps.push_back(NextRecordedOperandNo++);
549 // If this is an explicit register reference, handle it.
550 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
551 if (DI->getDef()->isSubClassOf("Register")) {
552 AddMatcher(new EmitRegisterMatcher(DI->getDef(),
554 ResultOps.push_back(NextRecordedOperandNo++);
558 if (DI->getDef()->getName() == "zero_reg") {
559 AddMatcher(new EmitRegisterMatcher(0, N->getTypeNum(0)));
560 ResultOps.push_back(NextRecordedOperandNo++);
564 // Handle a reference to a register class. This is used
565 // in COPY_TO_SUBREG instructions.
566 if (DI->getDef()->isSubClassOf("RegisterClass")) {
567 std::string Value = getQualifiedName(DI->getDef()) + "RegClassID";
568 AddMatcher(new EmitStringIntegerMatcher(Value, MVT::i32));
569 ResultOps.push_back(NextRecordedOperandNo++);
574 errs() << "unhandled leaf node: \n";
578 /// GetInstPatternNode - Get the pattern for an instruction.
580 const TreePatternNode *MatcherGen::
581 GetInstPatternNode(const DAGInstruction &Inst, const TreePatternNode *N) {
582 const TreePattern *InstPat = Inst.getPattern();
584 // FIXME2?: Assume actual pattern comes before "implicit".
585 TreePatternNode *InstPatNode;
587 InstPatNode = InstPat->getTree(0);
588 else if (/*isRoot*/ N == Pattern.getDstPattern())
589 InstPatNode = Pattern.getSrcPattern();
593 if (InstPatNode && !InstPatNode->isLeaf() &&
594 InstPatNode->getOperator()->getName() == "set")
595 InstPatNode = InstPatNode->getChild(InstPatNode->getNumChildren()-1);
601 EmitResultInstructionAsOperand(const TreePatternNode *N,
602 SmallVectorImpl<unsigned> &OutputOps) {
603 Record *Op = N->getOperator();
604 const CodeGenTarget &CGT = CGP.getTargetInfo();
605 CodeGenInstruction &II = CGT.getInstruction(Op->getName());
606 const DAGInstruction &Inst = CGP.getInstruction(Op);
608 // If we can, get the pattern for the instruction we're generating. We derive
609 // a variety of information from this pattern, such as whether it has a chain.
611 // FIXME2: This is extremely dubious for several reasons, not the least of
612 // which it gives special status to instructions with patterns that Pat<>
613 // nodes can't duplicate.
614 const TreePatternNode *InstPatNode = GetInstPatternNode(Inst, N);
616 // NodeHasChain - Whether the instruction node we're creating takes chains.
617 bool NodeHasChain = InstPatNode &&
618 InstPatNode->TreeHasProperty(SDNPHasChain, CGP);
620 bool isRoot = N == Pattern.getDstPattern();
622 // TreeHasOutFlag - True if this tree has a flag.
623 bool TreeHasInFlag = false, TreeHasOutFlag = false;
625 const TreePatternNode *SrcPat = Pattern.getSrcPattern();
626 TreeHasInFlag = SrcPat->TreeHasProperty(SDNPOptInFlag, CGP) ||
627 SrcPat->TreeHasProperty(SDNPInFlag, CGP);
629 // FIXME2: this is checking the entire pattern, not just the node in
630 // question, doing this just for the root seems like a total hack.
631 TreeHasOutFlag = SrcPat->TreeHasProperty(SDNPOutFlag, CGP);
634 // NumResults - This is the number of results produced by the instruction in
636 unsigned NumResults = Inst.getNumResults();
638 // Loop over all of the operands of the instruction pattern, emitting code
639 // to fill them all in. The node 'N' usually has number children equal to
640 // the number of input operands of the instruction. However, in cases
641 // where there are predicate operands for an instruction, we need to fill
642 // in the 'execute always' values. Match up the node operands to the
643 // instruction operands to do this.
644 SmallVector<unsigned, 8> InstOps;
645 for (unsigned ChildNo = 0, InstOpNo = NumResults, e = II.OperandList.size();
646 InstOpNo != e; ++InstOpNo) {
648 // Determine what to emit for this operand.
649 Record *OperandNode = II.OperandList[InstOpNo].Rec;
650 if ((OperandNode->isSubClassOf("PredicateOperand") ||
651 OperandNode->isSubClassOf("OptionalDefOperand")) &&
652 !CGP.getDefaultOperand(OperandNode).DefaultOps.empty()) {
653 // This is a predicate or optional def operand; emit the
654 // 'default ops' operands.
655 const DAGDefaultOperand &DefaultOp =
656 CGP.getDefaultOperand(II.OperandList[InstOpNo].Rec);
657 for (unsigned i = 0, e = DefaultOp.DefaultOps.size(); i != e; ++i)
658 EmitResultOperand(DefaultOp.DefaultOps[i], InstOps);
662 // Otherwise this is a normal operand or a predicate operand without
663 // 'execute always'; emit it.
664 EmitResultOperand(N->getChild(ChildNo), InstOps);
668 // Nodes that match patterns with (potentially multiple) chain inputs have to
669 // merge them together into a token factor.
670 if (NodeHasChain && !EmittedMergeInputChains) {
671 // FIXME2: Move this out of emitresult to a top level place.
672 assert(!MatchedChainNodes.empty() &&
673 "How can this node have chain if no inputs do?");
674 // Otherwise, we have to emit an operation to merge the input chains and
675 // set this as the current input chain.
676 AddMatcher(new EmitMergeInputChainsMatcher
677 (MatchedChainNodes.data(), MatchedChainNodes.size()));
678 EmittedMergeInputChains = true;
681 // If this node has an input flag or explicitly specified input physregs, we
682 // need to add chained and flagged copyfromreg nodes and materialize the flag
684 if (isRoot && !PhysRegInputs.empty()) {
685 // Emit all of the CopyToReg nodes for the input physical registers. These
686 // occur in patterns like (mul:i8 AL:i8, GR8:i8:$src).
687 for (unsigned i = 0, e = PhysRegInputs.size(); i != e; ++i)
688 AddMatcher(new EmitCopyToRegMatcher(PhysRegInputs[i].second,
689 PhysRegInputs[i].first));
690 // Even if the node has no other flag inputs, the resultant node must be
691 // flagged to the CopyFromReg nodes we just generated.
692 TreeHasInFlag = true;
695 // Result order: node results, chain, flags
697 // Determine the result types.
698 SmallVector<MVT::SimpleValueType, 4> ResultVTs;
699 if (NumResults != 0 && N->getTypeNum(0) != MVT::isVoid) {
700 // FIXME2: If the node has multiple results, we should add them. For now,
701 // preserve existing behavior?!
702 ResultVTs.push_back(N->getTypeNum(0));
706 // If this is the root instruction of a pattern that has physical registers in
707 // its result pattern, add output VTs for them. For example, X86 has:
708 // (set AL, (mul ...))
709 // This also handles implicit results like:
711 if (isRoot && Pattern.getDstRegs().size() != 0) {
712 for (unsigned i = 0; i != Pattern.getDstRegs().size(); ++i)
713 if (Pattern.getDstRegs()[i]->isSubClassOf("Register"))
714 ResultVTs.push_back(getRegisterValueType(Pattern.getDstRegs()[i], CGT));
717 // FIXME2: Instead of using the isVariadic flag on the instruction, we should
718 // have an SDNP that indicates variadicism. The TargetInstrInfo isVariadic
719 // property should be inferred from this when an instruction has a pattern.
720 int NumFixedArityOperands = -1;
721 if (isRoot && II.isVariadic)
722 NumFixedArityOperands = Pattern.getSrcPattern()->getNumChildren();
724 // If this is the root node and any of the nodes matched nodes in the input
725 // pattern have MemRefs in them, have the interpreter collect them and plop
726 // them onto this node.
728 // FIXME3: This is actively incorrect for result patterns where the root of
729 // the pattern is not the memory reference and is also incorrect when the
730 // result pattern has multiple memory-referencing instructions. For example,
731 // in the X86 backend, this pattern causes the memrefs to get attached to the
732 // CVTSS2SDrr instead of the MOVSSrm:
734 // def : Pat<(extloadf32 addr:$src),
735 // (CVTSS2SDrr (MOVSSrm addr:$src))>;
737 bool NodeHasMemRefs =
738 isRoot && Pattern.getSrcPattern()->TreeHasProperty(SDNPMemOperand, CGP);
740 AddMatcher(new EmitNodeMatcher(II.Namespace+"::"+II.TheDef->getName(),
741 ResultVTs.data(), ResultVTs.size(),
742 InstOps.data(), InstOps.size(),
743 NodeHasChain, TreeHasInFlag, TreeHasOutFlag,
744 NodeHasMemRefs, NumFixedArityOperands,
745 NextRecordedOperandNo));
747 // The non-chain and non-flag results of the newly emitted node get recorded.
748 for (unsigned i = 0, e = ResultVTs.size(); i != e; ++i) {
749 if (ResultVTs[i] == MVT::Other || ResultVTs[i] == MVT::Flag) break;
750 OutputOps.push_back(NextRecordedOperandNo++);
755 EmitResultSDNodeXFormAsOperand(const TreePatternNode *N,
756 SmallVectorImpl<unsigned> &ResultOps) {
757 assert(N->getOperator()->isSubClassOf("SDNodeXForm") && "Not SDNodeXForm?");
760 SmallVector<unsigned, 8> InputOps;
762 // FIXME2: Could easily generalize this to support multiple inputs and outputs
763 // to the SDNodeXForm. For now we just support one input and one output like
764 // the old instruction selector.
765 assert(N->getNumChildren() == 1);
766 EmitResultOperand(N->getChild(0), InputOps);
768 // The input currently must have produced exactly one result.
769 assert(InputOps.size() == 1 && "Unexpected input to SDNodeXForm");
771 AddMatcher(new EmitNodeXFormMatcher(InputOps[0], N->getOperator()));
772 ResultOps.push_back(NextRecordedOperandNo++);
775 void MatcherGen::EmitResultOperand(const TreePatternNode *N,
776 SmallVectorImpl<unsigned> &ResultOps) {
777 // This is something selected from the pattern we matched.
778 if (!N->getName().empty())
779 return EmitResultOfNamedOperand(N, ResultOps);
782 return EmitResultLeafAsOperand(N, ResultOps);
784 Record *OpRec = N->getOperator();
785 if (OpRec->isSubClassOf("Instruction"))
786 return EmitResultInstructionAsOperand(N, ResultOps);
787 if (OpRec->isSubClassOf("SDNodeXForm"))
788 return EmitResultSDNodeXFormAsOperand(N, ResultOps);
789 errs() << "Unknown result node to emit code for: " << *N << '\n';
790 throw std::string("Unknown node in result pattern!");
793 void MatcherGen::EmitResultCode() {
794 // Codegen the root of the result pattern, capturing the resulting values.
795 SmallVector<unsigned, 8> Ops;
796 EmitResultOperand(Pattern.getDstPattern(), Ops);
798 // At this point, we have however many values the result pattern produces.
799 // However, the input pattern might not need all of these. If there are
800 // excess values at the end (such as condition codes etc) just lop them off.
801 // This doesn't need to worry about flags or chains, just explicit results.
803 // FIXME2: This doesn't work because there is currently no way to get an
804 // accurate count of the # results the source pattern sets. This is because
805 // of the "parallel" construct in X86 land, which looks like this:
807 //def : Pat<(parallel (X86and_flag GR8:$src1, GR8:$src2),
808 // (implicit EFLAGS)),
809 // (AND8rr GR8:$src1, GR8:$src2)>;
811 // This idiom means to match the two-result node X86and_flag (which is
812 // declared as returning a single result, because we can't match multi-result
813 // nodes yet). In this case, we would have to know that the input has two
814 // results. However, mul8r is modelled exactly the same way, but without
815 // implicit defs included. The fix is to support multiple results directly
816 // and eliminate 'parallel'.
818 // FIXME2: When this is fixed, we should revert the terrible hack in the
819 // OPC_EmitNode code in the interpreter.
821 const TreePatternNode *Src = Pattern.getSrcPattern();
822 unsigned NumSrcResults = Src->getTypeNum(0) != MVT::isVoid ? 1 : 0;
823 NumSrcResults += Pattern.getDstRegs().size();
824 assert(Ops.size() >= NumSrcResults && "Didn't provide enough results");
825 Ops.resize(NumSrcResults);
828 // If the matched pattern covers nodes which define a flag result, emit a node
829 // that tells the matcher about them so that it can update their results.
830 if (!MatchedFlagResultNodes.empty())
831 AddMatcher(new MarkFlagResultsMatcher(MatchedFlagResultNodes.data(),
832 MatchedFlagResultNodes.size()));
835 // We know that the resulting pattern has exactly one result/
836 // FIXME2: why? what about something like (set a,b,c, (complexpat))
837 // FIXME2: Implicit results should be pushed here I guess?
838 AddMatcher(new CompleteMatchMatcher(Ops.data(), Ops.size(), Pattern));
842 Matcher *llvm::ConvertPatternToMatcher(const PatternToMatch &Pattern,
843 const CodeGenDAGPatterns &CGP) {
844 MatcherGen Gen(Pattern, CGP);
846 // Generate the code for the matcher.
847 Gen.EmitMatcherCode();
850 // FIXME2: Kill extra MoveParent commands at the end of the matcher sequence.
851 // FIXME2: Split result code out to another table, and make the matcher end
852 // with an "Emit <index>" command. This allows result generation stuff to be
853 // shared and factored?
855 // If the match succeeds, then we generate Pattern.
856 Gen.EmitResultCode();
858 // Unconditional match.
859 return Gen.GetMatcher();