1 //==-llvm/CodeGen/DAGISelHeader.h - Common DAG ISel definitions -*- C++ -*-==//
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 // This file provides definitions of the common, target-independent methods and
11 // data, which is used by SelectionDAG-based instruction selectors.
13 // *** NOTE: This file is #included into the middle of the target
14 // instruction selector class. These functions are really methods.
15 // This is a little awkward, but it allows this code to be shared
16 // by all the targets while still being able to call into
17 // target-specific code without using a virtual function call.
19 //===----------------------------------------------------------------------===//
21 #ifndef LLVM_CODEGEN_DAGISEL_HEADER_H
22 #define LLVM_CODEGEN_DAGISEL_HEADER_H
24 /// ISelPosition - Node iterator marking the current position of
25 /// instruction selection as it procedes through the topologically-sorted
27 SelectionDAG::allnodes_iterator ISelPosition;
29 /// ChainNotReachable - Returns true if Chain does not reach Op.
30 static bool ChainNotReachable(SDNode *Chain, SDNode *Op) {
31 if (Chain->getOpcode() == ISD::EntryToken)
33 if (Chain->getOpcode() == ISD::TokenFactor)
35 if (Chain->getNumOperands() > 0) {
36 SDValue C0 = Chain->getOperand(0);
37 if (C0.getValueType() == MVT::Other)
38 return C0.getNode() != Op && ChainNotReachable(C0.getNode(), Op);
43 /// IsChainCompatible - Returns true if Chain is Op or Chain does not reach Op.
44 /// This is used to ensure that there are no nodes trapped between Chain, which
45 /// is the first chain node discovered in a pattern and Op, a later node, that
46 /// will not be selected into the pattern.
47 static bool IsChainCompatible(SDNode *Chain, SDNode *Op) {
48 return Chain == Op || ChainNotReachable(Chain, Op);
52 /// ISelUpdater - helper class to handle updates of the
53 /// instruciton selection graph.
54 class VISIBILITY_HIDDEN ISelUpdater : public SelectionDAG::DAGUpdateListener {
55 SelectionDAG::allnodes_iterator &ISelPosition;
57 explicit ISelUpdater(SelectionDAG::allnodes_iterator &isp)
58 : ISelPosition(isp) {}
60 /// NodeDeleted - Handle nodes deleted from the graph. If the
61 /// node being deleted is the current ISelPosition node, update
64 virtual void NodeDeleted(SDNode *N, SDNode *E) {
65 if (ISelPosition == SelectionDAG::allnodes_iterator(N))
69 /// NodeUpdated - Ignore updates for now.
70 virtual void NodeUpdated(SDNode *N) {}
73 /// ReplaceUses - replace all uses of the old node F with the use
74 /// of the new node T.
75 DISABLE_INLINE void ReplaceUses(SDValue F, SDValue T) {
76 ISelUpdater ISU(ISelPosition);
77 CurDAG->ReplaceAllUsesOfValueWith(F, T, &ISU);
80 /// ReplaceUses - replace all uses of the old nodes F with the use
81 /// of the new nodes T.
82 DISABLE_INLINE void ReplaceUses(const SDValue *F, const SDValue *T,
84 ISelUpdater ISU(ISelPosition);
85 CurDAG->ReplaceAllUsesOfValuesWith(F, T, Num, &ISU);
88 /// ReplaceUses - replace all uses of the old node F with the use
89 /// of the new node T.
90 DISABLE_INLINE void ReplaceUses(SDNode *F, SDNode *T) {
91 ISelUpdater ISU(ISelPosition);
92 CurDAG->ReplaceAllUsesWith(F, T, &ISU);
95 /// SelectRoot - Top level entry to DAG instruction selector.
96 /// Selects instructions starting at the root of the current DAG.
97 void SelectRoot(SelectionDAG &DAG) {
100 // Create a dummy node (which is not added to allnodes), that adds
101 // a reference to the root node, preventing it from being deleted,
102 // and tracking any changes of the root.
103 HandleSDNode Dummy(CurDAG->getRoot());
104 ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode());
107 // The AllNodes list is now topological-sorted. Visit the
108 // nodes by starting at the end of the list (the root of the
109 // graph) and preceding back toward the beginning (the entry
111 while (ISelPosition != CurDAG->allnodes_begin()) {
112 SDNode *Node = --ISelPosition;
113 // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes,
114 // but there are currently some corner cases that it misses. Also, this
115 // makes it theoretically possible to disable the DAGCombiner.
116 if (Node->use_empty())
119 SDNode *ResNode = Select(Node);
120 // If node should not be replaced, continue with the next one.
125 ReplaceUses(Node, ResNode);
127 // If after the replacement this node is not used any more,
128 // remove this dead node.
129 if (Node->use_empty()) { // Don't delete EntryToken, etc.
130 ISelUpdater ISU(ISelPosition);
131 CurDAG->RemoveDeadNode(Node, &ISU);
135 CurDAG->setRoot(Dummy.getValue());
139 /// CheckInteger - Return true if the specified node is not a ConstantSDNode or
140 /// if it doesn't have the specified value.
141 static bool CheckInteger(SDValue V, int64_t Val) {
142 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
143 return C == 0 || C->getSExtValue() != Val;
146 /// CheckAndImmediate - Check to see if the specified node is an and with an
147 /// immediate returning true on failure.
149 /// FIXME: Inline this gunk into CheckAndMask.
150 bool CheckAndImmediate(SDValue V, int64_t Val) {
151 if (V->getOpcode() == ISD::AND)
152 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(V->getOperand(1)))
153 if (CheckAndMask(V.getOperand(0), C, Val))
158 /// CheckOrImmediate - Check to see if the specified node is an or with an
159 /// immediate returning true on failure.
161 /// FIXME: Inline this gunk into CheckOrMask.
162 bool CheckOrImmediate(SDValue V, int64_t Val) {
163 if (V->getOpcode() == ISD::OR)
164 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(V->getOperand(1)))
165 if (CheckOrMask(V.getOperand(0), C, Val))
170 void EmitInteger(int64_t Val, MVT::SimpleValueType VT,
171 SmallVectorImpl<SDValue> &RecordedNodes) {
172 RecordedNodes.push_back(CurDAG->getTargetConstant(Val, VT));
175 // These functions are marked always inline so that Idx doesn't get pinned to
177 ALWAYS_INLINE static int8_t
178 GetInt1(const unsigned char *MatcherTable, unsigned &Idx) {
179 return MatcherTable[Idx++];
182 ALWAYS_INLINE static int16_t
183 GetInt2(const unsigned char *MatcherTable, unsigned &Idx) {
184 int16_t Val = (uint8_t)GetInt1(MatcherTable, Idx);
185 Val |= int16_t(GetInt1(MatcherTable, Idx)) << 8;
189 ALWAYS_INLINE static int32_t
190 GetInt4(const unsigned char *MatcherTable, unsigned &Idx) {
191 int32_t Val = (uint16_t)GetInt2(MatcherTable, Idx);
192 Val |= int32_t(GetInt2(MatcherTable, Idx)) << 16;
196 ALWAYS_INLINE static int64_t
197 GetInt8(const unsigned char *MatcherTable, unsigned &Idx) {
198 int64_t Val = (uint32_t)GetInt4(MatcherTable, Idx);
199 Val |= int64_t(GetInt4(MatcherTable, Idx)) << 32;
203 /// GetVBR - decode a vbr encoding whose top bit is set.
204 ALWAYS_INLINE static unsigned
205 GetVBR(unsigned Val, const unsigned char *MatcherTable, unsigned &Idx) {
206 assert(Val >= 128 && "Not a VBR");
207 Val &= 127; // Remove first vbr bit.
212 NextBits = GetInt1(MatcherTable, Idx);
213 Val |= (NextBits&127) << Shift;
215 } while (NextBits & 128);
221 enum BuiltinOpcodes {
225 OPC_CaptureFlagInput,
229 OPC_CheckPatternPredicate,
232 OPC_CheckMultiOpcode,
234 OPC_CheckInteger1, OPC_CheckInteger2, OPC_CheckInteger4, OPC_CheckInteger8,
238 OPC_CheckAndImm1, OPC_CheckAndImm2, OPC_CheckAndImm4, OPC_CheckAndImm8,
239 OPC_CheckOrImm1, OPC_CheckOrImm2, OPC_CheckOrImm4, OPC_CheckOrImm8,
240 OPC_CheckFoldableChainNode,
241 OPC_CheckChainCompatible,
243 OPC_EmitInteger1, OPC_EmitInteger2, OPC_EmitInteger4, OPC_EmitInteger8,
245 OPC_EmitConvertToTarget,
246 OPC_EmitMergeInputChains,
254 OPFL_None = 0, // Node has no chain or flag input and isn't variadic.
255 OPFL_Chain = 1, // Node has a chain input.
256 OPFL_Flag = 2, // Node has a flag input.
257 OPFL_MemRefs = 4, // Node gets accumulated MemRefs.
258 OPFL_Variadic0 = 1<<3, // Node is variadic, root has 0 fixed inputs.
259 OPFL_Variadic1 = 2<<3, // Node is variadic, root has 1 fixed inputs.
260 OPFL_Variadic2 = 3<<3, // Node is variadic, root has 2 fixed inputs.
261 OPFL_Variadic3 = 4<<3, // Node is variadic, root has 3 fixed inputs.
262 OPFL_Variadic4 = 5<<3, // Node is variadic, root has 4 fixed inputs.
263 OPFL_Variadic5 = 6<<3, // Node is variadic, root has 5 fixed inputs.
264 OPFL_Variadic6 = 7<<3, // Node is variadic, root has 6 fixed inputs.
266 OPFL_VariadicInfo = OPFL_Variadic6
269 /// getNumFixedFromVariadicInfo - Transform an EmitNode flags word into the
270 /// number of fixed arity values that should be skipped when copying from the
272 static inline int getNumFixedFromVariadicInfo(unsigned Flags) {
273 return ((Flags&OPFL_VariadicInfo) >> 3)-1;
277 /// FailIndex - If this match fails, this is the index to continue with.
280 /// NodeStackSize - The size of the node stack when the scope was formed.
281 unsigned NodeStackSize;
283 /// NumRecordedNodes - The number of recorded nodes when the scope was formed.
284 unsigned NumRecordedNodes;
286 /// NumMatchedMemRefs - The number of matched memref entries.
287 unsigned NumMatchedMemRefs;
289 /// InputChain/InputFlag - The current chain/flag
290 SDValue InputChain, InputFlag;
292 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
293 bool HasChainNodesMatched;
296 SDNode *SelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable,
297 unsigned TableSize) {
298 // FIXME: Should these even be selected? Handle these cases in the caller?
299 switch (NodeToMatch->getOpcode()) {
302 case ISD::EntryToken: // These nodes remain the same.
303 case ISD::BasicBlock:
305 case ISD::HANDLENODE:
306 case ISD::TargetConstant:
307 case ISD::TargetConstantFP:
308 case ISD::TargetConstantPool:
309 case ISD::TargetFrameIndex:
310 case ISD::TargetExternalSymbol:
311 case ISD::TargetBlockAddress:
312 case ISD::TargetJumpTable:
313 case ISD::TargetGlobalTLSAddress:
314 case ISD::TargetGlobalAddress:
315 case ISD::TokenFactor:
316 case ISD::CopyFromReg:
319 case ISD::AssertSext:
320 case ISD::AssertZext:
321 ReplaceUses(SDValue(NodeToMatch, 0), NodeToMatch->getOperand(0));
323 case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch);
324 case ISD::EH_LABEL: return Select_EH_LABEL(NodeToMatch);
325 case ISD::UNDEF: return Select_UNDEF(NodeToMatch);
328 assert(!NodeToMatch->isMachineOpcode() && "Node already selected!");
330 // Set up the node stack with NodeToMatch as the only node on the stack.
331 SmallVector<SDValue, 8> NodeStack;
332 SDValue N = SDValue(NodeToMatch, 0);
333 NodeStack.push_back(N);
335 // MatchScopes - Scopes used when matching, if a match failure happens, this
336 // indicates where to continue checking.
337 SmallVector<MatchScope, 8> MatchScopes;
339 // RecordedNodes - This is the set of nodes that have been recorded by the
341 SmallVector<SDValue, 8> RecordedNodes;
343 // MatchedMemRefs - This is the set of MemRef's we've seen in the input
345 SmallVector<MachineMemOperand*, 2> MatchedMemRefs;
347 // These are the current input chain and flag for use when generating nodes.
348 // Various Emit operations change these. For example, emitting a copytoreg
349 // uses and updates these.
350 SDValue InputChain, InputFlag;
352 // ChainNodesMatched - If a pattern matches nodes that have input/output
353 // chains, the OPC_EmitMergeInputChains operation is emitted which indicates
354 // which ones they are. The result is captured into this list so that we can
355 // update the chain results when the pattern is complete.
356 SmallVector<SDNode*, 3> ChainNodesMatched;
358 DEBUG(errs() << "ISEL: Starting pattern match on root node: ";
359 NodeToMatch->dump(CurDAG);
362 // Interpreter starts at opcode #0.
363 unsigned MatcherIndex = 0;
365 assert(MatcherIndex < TableSize && "Invalid index");
366 switch ((BuiltinOpcodes)MatcherTable[MatcherIndex++]) {
368 unsigned NumToSkip = MatcherTable[MatcherIndex++];
370 NewEntry.FailIndex = MatcherIndex+NumToSkip;
371 NewEntry.NodeStackSize = NodeStack.size();
372 NewEntry.NumRecordedNodes = RecordedNodes.size();
373 NewEntry.NumMatchedMemRefs = MatchedMemRefs.size();
374 NewEntry.InputChain = InputChain;
375 NewEntry.InputFlag = InputFlag;
376 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
377 MatchScopes.push_back(NewEntry);
381 unsigned NumToSkip = GetInt2(MatcherTable, MatcherIndex);
383 NewEntry.FailIndex = MatcherIndex+NumToSkip;
384 NewEntry.NodeStackSize = NodeStack.size();
385 NewEntry.NumRecordedNodes = RecordedNodes.size();
386 NewEntry.NumMatchedMemRefs = MatchedMemRefs.size();
387 NewEntry.InputChain = InputChain;
388 NewEntry.InputFlag = InputFlag;
389 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
390 MatchScopes.push_back(NewEntry);
394 // Remember this node, it may end up being an operand in the pattern.
395 RecordedNodes.push_back(N);
397 case OPC_RecordMemRef:
398 MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand());
401 case OPC_CaptureFlagInput:
402 // If the current node has an input flag, capture it in InputFlag.
403 if (N->getNumOperands() != 0 &&
404 N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Flag)
405 InputFlag = N->getOperand(N->getNumOperands()-1);
408 case OPC_MoveChild: {
409 unsigned Child = MatcherTable[MatcherIndex++];
410 if (Child >= N.getNumOperands())
411 break; // Match fails if out of range child #.
412 N = N.getOperand(Child);
413 NodeStack.push_back(N);
418 // Pop the current node off the NodeStack.
419 NodeStack.pop_back();
420 assert(!NodeStack.empty() && "Node stack imbalance!");
421 N = NodeStack.back();
424 case OPC_CheckSame: {
425 // Accept if it is exactly the same as a previously recorded node.
426 unsigned RecNo = MatcherTable[MatcherIndex++];
427 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
428 if (N != RecordedNodes[RecNo]) break;
431 case OPC_CheckPatternPredicate:
432 if (!CheckPatternPredicate(MatcherTable[MatcherIndex++])) break;
434 case OPC_CheckPredicate:
435 if (!CheckNodePredicate(N.getNode(), MatcherTable[MatcherIndex++])) break;
437 case OPC_CheckComplexPat:
438 if (!CheckComplexPattern(NodeToMatch, N,
439 MatcherTable[MatcherIndex++], RecordedNodes))
442 case OPC_CheckOpcode:
443 if (N->getOpcode() != MatcherTable[MatcherIndex++]) break;
446 case OPC_CheckMultiOpcode: {
447 unsigned NumOps = MatcherTable[MatcherIndex++];
448 bool OpcodeEquals = false;
449 for (unsigned i = 0; i != NumOps; ++i)
450 OpcodeEquals |= N->getOpcode() == MatcherTable[MatcherIndex++];
451 if (!OpcodeEquals) break;
455 case OPC_CheckType: {
456 MVT::SimpleValueType VT =
457 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
458 if (N.getValueType() != VT) {
459 // Handle the case when VT is iPTR.
460 if (VT != MVT::iPTR || N.getValueType() != TLI.getPointerTy())
465 case OPC_CheckCondCode:
466 if (cast<CondCodeSDNode>(N)->get() !=
467 (ISD::CondCode)MatcherTable[MatcherIndex++]) break;
469 case OPC_CheckValueType: {
470 MVT::SimpleValueType VT =
471 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
472 if (cast<VTSDNode>(N)->getVT() != VT) {
473 // Handle the case when VT is iPTR.
474 if (VT != MVT::iPTR || cast<VTSDNode>(N)->getVT() != TLI.getPointerTy())
479 case OPC_CheckInteger1:
480 if (CheckInteger(N, GetInt1(MatcherTable, MatcherIndex))) break;
482 case OPC_CheckInteger2:
483 if (CheckInteger(N, GetInt2(MatcherTable, MatcherIndex))) break;
485 case OPC_CheckInteger4:
486 if (CheckInteger(N, GetInt4(MatcherTable, MatcherIndex))) break;
488 case OPC_CheckInteger8:
489 if (CheckInteger(N, GetInt8(MatcherTable, MatcherIndex))) break;
492 case OPC_CheckAndImm1:
493 if (CheckAndImmediate(N, GetInt1(MatcherTable, MatcherIndex))) break;
495 case OPC_CheckAndImm2:
496 if (CheckAndImmediate(N, GetInt2(MatcherTable, MatcherIndex))) break;
498 case OPC_CheckAndImm4:
499 if (CheckAndImmediate(N, GetInt4(MatcherTable, MatcherIndex))) break;
501 case OPC_CheckAndImm8:
502 if (CheckAndImmediate(N, GetInt8(MatcherTable, MatcherIndex))) break;
505 case OPC_CheckOrImm1:
506 if (CheckOrImmediate(N, GetInt1(MatcherTable, MatcherIndex))) break;
508 case OPC_CheckOrImm2:
509 if (CheckOrImmediate(N, GetInt2(MatcherTable, MatcherIndex))) break;
511 case OPC_CheckOrImm4:
512 if (CheckOrImmediate(N, GetInt4(MatcherTable, MatcherIndex))) break;
514 case OPC_CheckOrImm8:
515 if (CheckOrImmediate(N, GetInt8(MatcherTable, MatcherIndex))) break;
518 case OPC_CheckFoldableChainNode: {
519 assert(NodeStack.size() != 1 && "No parent node");
520 // Verify that all intermediate nodes between the root and this one have
522 bool HasMultipleUses = false;
523 for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)
524 if (!NodeStack[i].hasOneUse()) {
525 HasMultipleUses = true;
528 if (HasMultipleUses) break;
530 // Check to see that the target thinks this is profitable to fold and that
531 // we can fold it without inducing cycles in the graph.
532 if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),
534 !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),
540 case OPC_CheckChainCompatible: {
541 unsigned PrevNode = MatcherTable[MatcherIndex++];
542 assert(PrevNode < RecordedNodes.size() && "Invalid CheckChainCompatible");
543 SDValue PrevChainedNode = RecordedNodes[PrevNode];
544 SDValue ThisChainedNode = RecordedNodes.back();
546 // We have two nodes with chains, verify that their input chains are good.
547 assert(PrevChainedNode.getOperand(0).getValueType() == MVT::Other &&
548 ThisChainedNode.getOperand(0).getValueType() == MVT::Other &&
549 "Invalid chained nodes");
551 if (!IsChainCompatible(// Input chain of the previous node.
552 PrevChainedNode.getOperand(0).getNode(),
554 ThisChainedNode.getNode()))
559 case OPC_EmitInteger1: {
560 MVT::SimpleValueType VT =
561 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
562 EmitInteger(GetInt1(MatcherTable, MatcherIndex), VT, RecordedNodes);
565 case OPC_EmitInteger2: {
566 MVT::SimpleValueType VT =
567 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
568 EmitInteger(GetInt2(MatcherTable, MatcherIndex), VT, RecordedNodes);
571 case OPC_EmitInteger4: {
572 MVT::SimpleValueType VT =
573 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
574 EmitInteger(GetInt4(MatcherTable, MatcherIndex), VT, RecordedNodes);
577 case OPC_EmitInteger8: {
578 MVT::SimpleValueType VT =
579 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
580 EmitInteger(GetInt8(MatcherTable, MatcherIndex), VT, RecordedNodes);
584 case OPC_EmitRegister: {
585 MVT::SimpleValueType VT =
586 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
587 unsigned RegNo = MatcherTable[MatcherIndex++];
588 RecordedNodes.push_back(CurDAG->getRegister(RegNo, VT));
592 case OPC_EmitConvertToTarget: {
593 // Convert from IMM/FPIMM to target version.
594 unsigned RecNo = MatcherTable[MatcherIndex++];
595 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
596 SDValue Imm = RecordedNodes[RecNo];
598 if (Imm->getOpcode() == ISD::Constant) {
599 int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue();
600 Imm = CurDAG->getTargetConstant(Val, Imm.getValueType());
601 } else if (Imm->getOpcode() == ISD::ConstantFP) {
602 const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue();
603 Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType());
606 RecordedNodes.push_back(Imm);
610 case OPC_EmitMergeInputChains: {
611 assert(InputChain.getNode() == 0 &&
612 "EmitMergeInputChains should be the first chain producing node");
613 // This node gets a list of nodes we matched in the input that have
614 // chains. We want to token factor all of the input chains to these nodes
615 // together. However, if any of the input chains is actually one of the
616 // nodes matched in this pattern, then we have an intra-match reference.
617 // Ignore these because the newly token factored chain should not refer to
619 unsigned NumChains = MatcherTable[MatcherIndex++];
620 assert(NumChains != 0 && "Can't TF zero chains");
622 assert(ChainNodesMatched.empty() &&
623 "Should only have one EmitMergeInputChains per match");
625 // Handle the first chain.
626 unsigned RecNo = MatcherTable[MatcherIndex++];
627 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
628 ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode());
630 // If the chained node is not the root, we can't fold it if it has
632 // FIXME: What if other value results of the node have uses not matched by
634 if (ChainNodesMatched.back() != NodeToMatch &&
635 !RecordedNodes[RecNo].hasOneUse()) {
636 ChainNodesMatched.clear();
640 // The common case here is that we have exactly one chain, which is really
641 // cheap to handle, just do it.
642 if (NumChains == 1) {
643 InputChain = RecordedNodes[RecNo].getOperand(0);
644 assert(InputChain.getValueType() == MVT::Other && "Not a chain");
648 // Read all of the chained nodes.
649 for (unsigned i = 1; i != NumChains; ++i) {
650 RecNo = MatcherTable[MatcherIndex++];
651 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
652 ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode());
654 // FIXME: What if other value results of the node have uses not matched by
656 if (ChainNodesMatched.back() != NodeToMatch &&
657 !RecordedNodes[RecNo].hasOneUse()) {
658 ChainNodesMatched.clear();
663 // Walk all the chained nodes, adding the input chains if they are not in
664 // ChainedNodes (and this, not in the matched pattern). This is an N^2
665 // algorithm, but # chains is usually 2 here, at most 3 for MSP430.
666 SmallVector<SDValue, 3> InputChains;
667 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
668 SDValue InChain = ChainNodesMatched[i]->getOperand(0);
669 assert(InChain.getValueType() == MVT::Other && "Not a chain");
670 bool Invalid = false;
671 for (unsigned j = 0; j != e; ++j)
672 Invalid |= ChainNodesMatched[j] == InChain.getNode();
674 InputChains.push_back(InChain);
678 if (InputChains.size() == 1)
679 InputChain = InputChains[0];
681 InputChain = CurDAG->getNode(ISD::TokenFactor,
682 NodeToMatch->getDebugLoc(), MVT::Other,
683 &InputChains[0], InputChains.size());
687 case OPC_EmitCopyToReg: {
688 unsigned RecNo = MatcherTable[MatcherIndex++];
689 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
690 unsigned DestPhysReg = MatcherTable[MatcherIndex++];
692 if (InputChain.getNode() == 0)
693 InputChain = CurDAG->getEntryNode();
695 InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(),
696 DestPhysReg, RecordedNodes[RecNo],
699 InputFlag = InputChain.getValue(1);
703 case OPC_EmitNodeXForm: {
704 unsigned XFormNo = MatcherTable[MatcherIndex++];
705 unsigned RecNo = MatcherTable[MatcherIndex++];
706 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
707 RecordedNodes.push_back(RunSDNodeXForm(RecordedNodes[RecNo], XFormNo));
712 uint16_t TargetOpc = GetInt2(MatcherTable, MatcherIndex);
713 unsigned EmitNodeInfo = MatcherTable[MatcherIndex++];
714 // Get the result VT list.
715 unsigned NumVTs = MatcherTable[MatcherIndex++];
716 assert(NumVTs != 0 && "Invalid node result");
717 SmallVector<EVT, 4> VTs;
718 for (unsigned i = 0; i != NumVTs; ++i) {
719 MVT::SimpleValueType VT =
720 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
721 if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy;
725 // FIXME: Use faster version for the common 'one VT' case?
726 SDVTList VTList = CurDAG->getVTList(VTs.data(), VTs.size());
728 // Get the operand list.
729 unsigned NumOps = MatcherTable[MatcherIndex++];
730 SmallVector<SDValue, 8> Ops;
731 for (unsigned i = 0; i != NumOps; ++i) {
732 unsigned RecNo = MatcherTable[MatcherIndex++];
734 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
736 assert(RecNo < RecordedNodes.size() && "Invalid EmitNode");
737 Ops.push_back(RecordedNodes[RecNo]);
740 // If there are variadic operands to add, handle them now.
741 if (EmitNodeInfo & OPFL_VariadicInfo) {
742 // Determine the start index to copy from.
743 unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo);
744 FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0;
745 assert(NodeToMatch->getNumOperands() >= FirstOpToCopy &&
746 "Invalid variadic node");
747 // Copy all of the variadic operands, not including a potential flag
749 for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands();
751 SDValue V = NodeToMatch->getOperand(i);
752 if (V.getValueType() == MVT::Flag) break;
757 // If this has chain/flag inputs, add them.
758 if (EmitNodeInfo & OPFL_Chain)
759 Ops.push_back(InputChain);
760 if ((EmitNodeInfo & OPFL_Flag) && InputFlag.getNode() != 0)
761 Ops.push_back(InputFlag);
764 MachineSDNode *Res = CurDAG->getMachineNode(TargetOpc,
765 NodeToMatch->getDebugLoc(),
767 Ops.data(), Ops.size());
768 // Add all the non-flag/non-chain results to the RecordedNodes list.
769 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
770 if (VTs[i] == MVT::Other || VTs[i] == MVT::Flag) break;
771 RecordedNodes.push_back(SDValue(Res, i));
774 // If the node had chain/flag results, update our notion of the current
776 if (VTs.back() == MVT::Flag) {
777 InputFlag = SDValue(Res, VTs.size()-1);
778 if (EmitNodeInfo & OPFL_Chain)
779 InputChain = SDValue(Res, VTs.size()-2);
780 } else if (EmitNodeInfo & OPFL_Chain)
781 InputChain = SDValue(Res, VTs.size()-1);
783 // If the OPFL_MemRefs flag is set on this node, slap all of the
784 // accumulated memrefs onto it.
786 // FIXME: This is vastly incorrect for patterns with multiple outputs
787 // instructions that access memory and for ComplexPatterns that match
789 if (EmitNodeInfo & OPFL_MemRefs) {
790 MachineSDNode::mmo_iterator MemRefs =
791 MF->allocateMemRefsArray(MatchedMemRefs.size());
792 std::copy(MatchedMemRefs.begin(), MatchedMemRefs.end(), MemRefs);
793 Res->setMemRefs(MemRefs, MemRefs + MatchedMemRefs.size());
796 DEBUG(errs() << " Created node: "; Res->dump(CurDAG); errs() << "\n");
800 case OPC_CompleteMatch: {
801 // The match has been completed, and any new nodes (if any) have been
802 // created. Patch up references to the matched dag to use the newly
804 unsigned NumResults = MatcherTable[MatcherIndex++];
806 for (unsigned i = 0; i != NumResults; ++i) {
807 unsigned ResSlot = MatcherTable[MatcherIndex++];
809 ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex);
811 assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame");
812 SDValue Res = RecordedNodes[ResSlot];
814 // FIXME2: Eliminate this horrible hack by fixing the 'Gen' program
815 // after (parallel) on input patterns are removed. This would also
816 // allow us to stop encoding #results in OPC_CompleteMatch's table
818 if (NodeToMatch->getNumValues() <= i ||
819 NodeToMatch->getValueType(i) == MVT::Other ||
820 NodeToMatch->getValueType(i) == MVT::Flag)
822 assert((NodeToMatch->getValueType(i) == Res.getValueType() ||
823 NodeToMatch->getValueType(i) == MVT::iPTR ||
824 Res.getValueType() == MVT::iPTR ||
825 NodeToMatch->getValueType(i).getSizeInBits() ==
826 Res.getValueType().getSizeInBits()) &&
827 "invalid replacement");
828 ReplaceUses(SDValue(NodeToMatch, i), Res);
831 // Now that all the normal results are replaced, we replace the chain and
832 // flag results if present.
833 if (!ChainNodesMatched.empty()) {
834 assert(InputChain.getNode() != 0 &&
835 "Matched input chains but didn't produce a chain");
836 // Loop over all of the nodes we matched that produced a chain result.
837 // Replace all the chain results with the final chain we ended up with.
838 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
839 SDNode *ChainNode = ChainNodesMatched[i];
840 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1);
841 if (ChainVal.getValueType() == MVT::Flag)
842 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2);
843 assert(ChainVal.getValueType() == MVT::Other && "Not a chain?");
844 ReplaceUses(ChainVal, InputChain);
847 // If the root node produces a flag, make sure to replace its flag
848 // result with the resultant flag.
849 if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) ==
851 ReplaceUses(SDValue(NodeToMatch, NodeToMatch->getNumValues()-1),
854 assert(NodeToMatch->use_empty() &&
855 "Didn't replace all uses of the node?");
857 DEBUG(errs() << "ISEL: Match complete!\n");
859 // FIXME: We just return here, which interacts correctly with SelectRoot
860 // above. We should fix this to not return an SDNode* anymore.
865 // If the code reached this point, then the match failed pop out to the next
867 if (MatchScopes.empty()) {
868 CannotYetSelect(NodeToMatch);
872 const MatchScope &LastScope = MatchScopes.back();
873 RecordedNodes.resize(LastScope.NumRecordedNodes);
874 NodeStack.resize(LastScope.NodeStackSize);
875 N = NodeStack.back();
877 DEBUG(errs() << " Match failed at index " << MatcherIndex
878 << " continuing at " << LastScope.FailIndex << "\n");
880 if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size())
881 MatchedMemRefs.resize(LastScope.NumMatchedMemRefs);
882 MatcherIndex = LastScope.FailIndex;
884 InputChain = LastScope.InputChain;
885 InputFlag = LastScope.InputFlag;
886 if (!LastScope.HasChainNodesMatched)
887 ChainNodesMatched.clear();
889 MatchScopes.pop_back();
894 #endif /* LLVM_CODEGEN_DAGISEL_HEADER_H */