1 //===-- llvm/Target/TargetLowering.h - Target Lowering Info -----*- 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 describes how to lower LLVM code to machine code. This has two
13 // 1. Which ValueTypes are natively supported by the target.
14 // 2. Which operations are supported for supported ValueTypes.
15 // 3. Cost thresholds for alternative implementations of certain operations.
17 // In addition it has a few other components, like information about FP
20 //===----------------------------------------------------------------------===//
22 #ifndef LLVM_TARGET_TARGETLOWERING_H
23 #define LLVM_TARGET_TARGETLOWERING_H
25 #include "llvm/CallingConv.h"
26 #include "llvm/InlineAsm.h"
27 #include "llvm/Attributes.h"
28 #include "llvm/CodeGen/SelectionDAGNodes.h"
29 #include "llvm/CodeGen/RuntimeLibcalls.h"
30 #include "llvm/ADT/APFloat.h"
31 #include "llvm/ADT/DenseMap.h"
32 #include "llvm/ADT/SmallSet.h"
33 #include "llvm/ADT/SmallVector.h"
34 #include "llvm/ADT/STLExtras.h"
35 #include "llvm/Support/DebugLoc.h"
36 #include "llvm/Target/TargetCallingConv.h"
37 #include "llvm/Target/TargetMachine.h"
47 class FunctionLoweringInfo;
48 class MachineBasicBlock;
49 class MachineFunction;
50 class MachineFrameInfo;
52 class MachineJumpTableInfo;
60 class TargetRegisterClass;
61 class TargetLoweringObjectFile;
64 // FIXME: should this be here?
73 TLSModel::Model getTLSModel(const GlobalValue *GV, Reloc::Model reloc);
76 //===----------------------------------------------------------------------===//
77 /// TargetLowering - This class defines information used to lower LLVM code to
78 /// legal SelectionDAG operators that the target instruction selector can accept
81 /// This class also defines callbacks that targets must implement to lower
82 /// target-specific constructs to SelectionDAG operators.
84 class TargetLowering {
85 TargetLowering(const TargetLowering&); // DO NOT IMPLEMENT
86 void operator=(const TargetLowering&); // DO NOT IMPLEMENT
88 /// LegalizeAction - This enum indicates whether operations are valid for a
89 /// target, and if not, what action should be used to make them valid.
91 Legal, // The target natively supports this operation.
92 Promote, // This operation should be executed in a larger type.
93 Expand, // Try to expand this to other ops, otherwise use a libcall.
94 Custom // Use the LowerOperation hook to implement custom lowering.
97 enum BooleanContent { // How the target represents true/false values.
98 UndefinedBooleanContent, // Only bit 0 counts, the rest can hold garbage.
99 ZeroOrOneBooleanContent, // All bits zero except for bit 0.
100 ZeroOrNegativeOneBooleanContent // All bits equal to bit 0.
103 /// NOTE: The constructor takes ownership of TLOF.
104 explicit TargetLowering(const TargetMachine &TM,
105 const TargetLoweringObjectFile *TLOF);
106 virtual ~TargetLowering();
108 const TargetMachine &getTargetMachine() const { return TM; }
109 const TargetData *getTargetData() const { return TD; }
110 const TargetLoweringObjectFile &getObjFileLowering() const { return TLOF; }
112 bool isBigEndian() const { return !IsLittleEndian; }
113 bool isLittleEndian() const { return IsLittleEndian; }
114 MVT getPointerTy() const { return PointerTy; }
115 MVT getShiftAmountTy() const { return ShiftAmountTy; }
117 /// isSelectExpensive - Return true if the select operation is expensive for
119 bool isSelectExpensive() const { return SelectIsExpensive; }
121 /// isIntDivCheap() - Return true if integer divide is usually cheaper than
122 /// a sequence of several shifts, adds, and multiplies for this target.
123 bool isIntDivCheap() const { return IntDivIsCheap; }
125 /// isPow2DivCheap() - Return true if pow2 div is cheaper than a chain of
127 bool isPow2DivCheap() const { return Pow2DivIsCheap; }
129 /// getSetCCResultType - Return the ValueType of the result of SETCC
130 /// operations. Also used to obtain the target's preferred type for
131 /// the condition operand of SELECT and BRCOND nodes. In the case of
132 /// BRCOND the argument passed is MVT::Other since there are no other
133 /// operands to get a type hint from.
135 MVT::SimpleValueType getSetCCResultType(EVT VT) const;
137 /// getCmpLibcallReturnType - Return the ValueType for comparison
138 /// libcalls. Comparions libcalls include floating point comparion calls,
139 /// and Ordered/Unordered check calls on floating point numbers.
141 MVT::SimpleValueType getCmpLibcallReturnType() const;
143 /// getBooleanContents - For targets without i1 registers, this gives the
144 /// nature of the high-bits of boolean values held in types wider than i1.
145 /// "Boolean values" are special true/false values produced by nodes like
146 /// SETCC and consumed (as the condition) by nodes like SELECT and BRCOND.
147 /// Not to be confused with general values promoted from i1.
148 BooleanContent getBooleanContents() const { return BooleanContents;}
150 /// getSchedulingPreference - Return target scheduling preference.
151 Sched::Preference getSchedulingPreference() const {
152 return SchedPreferenceInfo;
155 /// getSchedulingPreference - Some scheduler, e.g. hybrid, can switch to
156 /// different scheduling heuristics for different nodes. This function returns
157 /// the preference (or none) for the given node.
158 virtual Sched::Preference getSchedulingPreference(SDNode *N) const {
162 /// getRegClassFor - Return the register class that should be used for the
163 /// specified value type.
164 virtual TargetRegisterClass *getRegClassFor(EVT VT) const {
165 assert(VT.isSimple() && "getRegClassFor called on illegal type!");
166 TargetRegisterClass *RC = RegClassForVT[VT.getSimpleVT().SimpleTy];
167 assert(RC && "This value type is not natively supported!");
171 /// getRepRegClassFor - Return the 'representative' register class for the
172 /// specified value type. The 'representative' register class is the largest
173 /// legal super-reg register class for the register class of the value type.
174 /// For example, on i386 the rep register class for i8, i16, and i32 are GR32;
175 /// while the rep register class is GR64 on x86_64.
176 virtual const TargetRegisterClass *getRepRegClassFor(EVT VT) const {
177 assert(VT.isSimple() && "getRepRegClassFor called on illegal type!");
178 const TargetRegisterClass *RC = RepRegClassForVT[VT.getSimpleVT().SimpleTy];
182 /// getRepRegClassCostFor - Return the cost of the 'representative' register
183 /// class for the specified value type.
184 virtual uint8_t getRepRegClassCostFor(EVT VT) const {
185 assert(VT.isSimple() && "getRepRegClassCostFor called on illegal type!");
186 return RepRegClassCostForVT[VT.getSimpleVT().SimpleTy];
189 /// getRegPressureLimit - Return the register pressure "high water mark" for
190 /// the specific register class. The scheduler is in high register pressure
191 /// mode (for the specific register class) if it goes over the limit.
192 virtual unsigned getRegPressureLimit(const TargetRegisterClass *RC,
193 MachineFunction &MF) const {
197 /// isTypeLegal - Return true if the target has native support for the
198 /// specified value type. This means that it has a register that directly
199 /// holds it without promotions or expansions.
200 bool isTypeLegal(EVT VT) const {
201 assert(!VT.isSimple() ||
202 (unsigned)VT.getSimpleVT().SimpleTy < array_lengthof(RegClassForVT));
203 return VT.isSimple() && RegClassForVT[VT.getSimpleVT().SimpleTy] != 0;
206 /// isTypeSynthesizable - Return true if it's OK for the compiler to create
207 /// new operations of this type. All Legal types are synthesizable except
208 /// MMX vector types on X86. Non-Legal types are not synthesizable.
209 bool isTypeSynthesizable(EVT VT) const {
210 return isTypeLegal(VT) && Synthesizable[VT.getSimpleVT().SimpleTy];
213 class ValueTypeActionImpl {
214 /// ValueTypeActions - For each value type, keep a LegalizeAction enum
215 /// that indicates how instruction selection should deal with the type.
216 uint8_t ValueTypeActions[MVT::LAST_VALUETYPE];
218 LegalizeAction getExtendedTypeAction(EVT VT) const {
219 // Handle non-vector integers.
220 if (!VT.isVector()) {
221 assert(VT.isInteger() && "Unsupported extended type!");
222 unsigned BitSize = VT.getSizeInBits();
223 // First promote to a power-of-two size, then expand if necessary.
224 if (BitSize < 8 || !isPowerOf2_32(BitSize))
229 // If this is a type smaller than a legal vector type, promote to that
230 // type, e.g. <2 x float> -> <4 x float>.
231 if (VT.getVectorElementType().isSimple() &&
232 VT.getVectorNumElements() != 1) {
233 MVT EltType = VT.getVectorElementType().getSimpleVT();
234 unsigned NumElts = VT.getVectorNumElements();
236 // Round up to the nearest power of 2.
237 NumElts = (unsigned)NextPowerOf2(NumElts);
239 MVT LargerVector = MVT::getVectorVT(EltType, NumElts);
240 if (LargerVector == MVT()) break;
242 // If this the larger type is legal, promote to it.
243 if (getTypeAction(LargerVector) == Legal) return Promote;
247 return VT.isPow2VectorType() ? Expand : Promote;
250 ValueTypeActionImpl() {
251 std::fill(ValueTypeActions, array_endof(ValueTypeActions), 0);
254 /// FIXME: This Context argument is now dead, zap it.
255 LegalizeAction getTypeAction(LLVMContext &Context, EVT VT) const {
256 return getTypeAction(VT);
259 LegalizeAction getTypeAction(EVT VT) const {
260 if (!VT.isExtended())
261 return getTypeAction(VT.getSimpleVT());
262 return getExtendedTypeAction(VT);
265 LegalizeAction getTypeAction(MVT VT) const {
266 return (LegalizeAction)ValueTypeActions[VT.SimpleTy];
270 void setTypeAction(EVT VT, LegalizeAction Action) {
271 unsigned I = VT.getSimpleVT().SimpleTy;
272 ValueTypeActions[I] = Action;
276 const ValueTypeActionImpl &getValueTypeActions() const {
277 return ValueTypeActions;
280 /// getTypeAction - Return how we should legalize values of this type, either
281 /// it is already legal (return 'Legal') or we need to promote it to a larger
282 /// type (return 'Promote'), or we need to expand it into multiple registers
283 /// of smaller integer type (return 'Expand'). 'Custom' is not an option.
284 LegalizeAction getTypeAction(LLVMContext &Context, EVT VT) const {
285 return ValueTypeActions.getTypeAction(Context, VT);
288 /// getTypeToTransformTo - For types supported by the target, this is an
289 /// identity function. For types that must be promoted to larger types, this
290 /// returns the larger type to promote to. For integer types that are larger
291 /// than the largest integer register, this contains one step in the expansion
292 /// to get to the smaller register. For illegal floating point types, this
293 /// returns the integer type to transform to.
294 EVT getTypeToTransformTo(LLVMContext &Context, EVT VT) const {
296 assert((unsigned)VT.getSimpleVT().SimpleTy <
297 array_lengthof(TransformToType));
298 EVT NVT = TransformToType[VT.getSimpleVT().SimpleTy];
299 assert(getTypeAction(Context, NVT) != Promote &&
300 "Promote may not follow Expand or Promote");
305 EVT NVT = VT.getPow2VectorType(Context);
307 // Vector length is a power of 2 - split to half the size.
308 unsigned NumElts = VT.getVectorNumElements();
309 EVT EltVT = VT.getVectorElementType();
310 return (NumElts == 1) ?
311 EltVT : EVT::getVectorVT(Context, EltVT, NumElts / 2);
313 // Promote to a power of two size, avoiding multi-step promotion.
314 return getTypeAction(Context, NVT) == Promote ?
315 getTypeToTransformTo(Context, NVT) : NVT;
316 } else if (VT.isInteger()) {
317 EVT NVT = VT.getRoundIntegerType(Context);
319 // Size is a power of two - expand to half the size.
320 return EVT::getIntegerVT(Context, VT.getSizeInBits() / 2);
322 // Promote to a power of two size, avoiding multi-step promotion.
323 return getTypeAction(Context, NVT) == Promote ?
324 getTypeToTransformTo(Context, NVT) : NVT;
326 assert(0 && "Unsupported extended type!");
327 return MVT(MVT::Other); // Not reached
330 /// getTypeToExpandTo - For types supported by the target, this is an
331 /// identity function. For types that must be expanded (i.e. integer types
332 /// that are larger than the largest integer register or illegal floating
333 /// point types), this returns the largest legal type it will be expanded to.
334 EVT getTypeToExpandTo(LLVMContext &Context, EVT VT) const {
335 assert(!VT.isVector());
337 switch (getTypeAction(Context, VT)) {
341 VT = getTypeToTransformTo(Context, VT);
344 assert(false && "Type is not legal nor is it to be expanded!");
351 /// getVectorTypeBreakdown - Vector types are broken down into some number of
352 /// legal first class types. For example, EVT::v8f32 maps to 2 EVT::v4f32
353 /// with Altivec or SSE1, or 8 promoted EVT::f64 values with the X86 FP stack.
354 /// Similarly, EVT::v2i64 turns into 4 EVT::i32 values with both PPC and X86.
356 /// This method returns the number of registers needed, and the VT for each
357 /// register. It also returns the VT and quantity of the intermediate values
358 /// before they are promoted/expanded.
360 unsigned getVectorTypeBreakdown(LLVMContext &Context, EVT VT,
362 unsigned &NumIntermediates,
363 EVT &RegisterVT) const;
365 /// getTgtMemIntrinsic: Given an intrinsic, checks if on the target the
366 /// intrinsic will need to map to a MemIntrinsicNode (touches memory). If
367 /// this is the case, it returns true and store the intrinsic
368 /// information into the IntrinsicInfo that was passed to the function.
369 struct IntrinsicInfo {
370 unsigned opc; // target opcode
371 EVT memVT; // memory VT
372 const Value* ptrVal; // value representing memory location
373 int offset; // offset off of ptrVal
374 unsigned align; // alignment
375 bool vol; // is volatile?
376 bool readMem; // reads memory?
377 bool writeMem; // writes memory?
380 virtual bool getTgtMemIntrinsic(IntrinsicInfo &Info,
381 const CallInst &I, unsigned Intrinsic) const {
385 /// isFPImmLegal - Returns true if the target can instruction select the
386 /// specified FP immediate natively. If false, the legalizer will materialize
387 /// the FP immediate as a load from a constant pool.
388 virtual bool isFPImmLegal(const APFloat &Imm, EVT VT) const {
392 /// isShuffleMaskLegal - Targets can use this to indicate that they only
393 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
394 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
395 /// are assumed to be legal.
396 virtual bool isShuffleMaskLegal(const SmallVectorImpl<int> &Mask,
401 /// canOpTrap - Returns true if the operation can trap for the value type.
402 /// VT must be a legal type. By default, we optimistically assume most
403 /// operations don't trap except for divide and remainder.
404 virtual bool canOpTrap(unsigned Op, EVT VT) const;
406 /// isVectorClearMaskLegal - Similar to isShuffleMaskLegal. This is
407 /// used by Targets can use this to indicate if there is a suitable
408 /// VECTOR_SHUFFLE that can be used to replace a VAND with a constant
410 virtual bool isVectorClearMaskLegal(const SmallVectorImpl<int> &Mask,
415 /// getOperationAction - Return how this operation should be treated: either
416 /// it is legal, needs to be promoted to a larger size, needs to be
417 /// expanded to some other code sequence, or the target has a custom expander
419 LegalizeAction getOperationAction(unsigned Op, EVT VT) const {
420 if (VT.isExtended()) return Expand;
421 assert(Op < array_lengthof(OpActions[0]) && "Table isn't big enough!");
422 unsigned I = (unsigned) VT.getSimpleVT().SimpleTy;
423 return (LegalizeAction)OpActions[I][Op];
426 /// isOperationLegalOrCustom - Return true if the specified operation is
427 /// legal on this target or can be made legal with custom lowering. This
428 /// is used to help guide high-level lowering decisions.
429 bool isOperationLegalOrCustom(unsigned Op, EVT VT) const {
430 return (VT == MVT::Other || isTypeLegal(VT)) &&
431 (getOperationAction(Op, VT) == Legal ||
432 getOperationAction(Op, VT) == Custom);
435 /// isOperationLegal - Return true if the specified operation is legal on this
437 bool isOperationLegal(unsigned Op, EVT VT) const {
438 return (VT == MVT::Other || isTypeLegal(VT)) &&
439 getOperationAction(Op, VT) == Legal;
442 /// getLoadExtAction - Return how this load with extension should be treated:
443 /// either it is legal, needs to be promoted to a larger size, needs to be
444 /// expanded to some other code sequence, or the target has a custom expander
446 LegalizeAction getLoadExtAction(unsigned ExtType, EVT VT) const {
447 assert(ExtType < ISD::LAST_LOADEXT_TYPE &&
448 (unsigned)VT.getSimpleVT().SimpleTy < MVT::LAST_VALUETYPE &&
449 "Table isn't big enough!");
450 return (LegalizeAction)LoadExtActions[VT.getSimpleVT().SimpleTy][ExtType];
453 /// isLoadExtLegal - Return true if the specified load with extension is legal
455 bool isLoadExtLegal(unsigned ExtType, EVT VT) const {
456 return VT.isSimple() &&
457 (getLoadExtAction(ExtType, VT) == Legal ||
458 getLoadExtAction(ExtType, VT) == Custom);
461 /// getTruncStoreAction - Return how this store with truncation should be
462 /// treated: either it is legal, needs to be promoted to a larger size, needs
463 /// to be expanded to some other code sequence, or the target has a custom
465 LegalizeAction getTruncStoreAction(EVT ValVT, EVT MemVT) const {
466 assert((unsigned)ValVT.getSimpleVT().SimpleTy < MVT::LAST_VALUETYPE &&
467 (unsigned)MemVT.getSimpleVT().SimpleTy < MVT::LAST_VALUETYPE &&
468 "Table isn't big enough!");
469 return (LegalizeAction)TruncStoreActions[ValVT.getSimpleVT().SimpleTy]
470 [MemVT.getSimpleVT().SimpleTy];
473 /// isTruncStoreLegal - Return true if the specified store with truncation is
474 /// legal on this target.
475 bool isTruncStoreLegal(EVT ValVT, EVT MemVT) const {
476 return isTypeLegal(ValVT) && MemVT.isSimple() &&
477 (getTruncStoreAction(ValVT, MemVT) == Legal ||
478 getTruncStoreAction(ValVT, MemVT) == Custom);
481 /// getIndexedLoadAction - Return how the indexed load should be treated:
482 /// either it is legal, needs to be promoted to a larger size, needs to be
483 /// expanded to some other code sequence, or the target has a custom expander
486 getIndexedLoadAction(unsigned IdxMode, EVT VT) const {
487 assert( IdxMode < ISD::LAST_INDEXED_MODE &&
488 ((unsigned)VT.getSimpleVT().SimpleTy) < MVT::LAST_VALUETYPE &&
489 "Table isn't big enough!");
490 unsigned Ty = (unsigned)VT.getSimpleVT().SimpleTy;
491 return (LegalizeAction)((IndexedModeActions[Ty][IdxMode] & 0xf0) >> 4);
494 /// isIndexedLoadLegal - Return true if the specified indexed load is legal
496 bool isIndexedLoadLegal(unsigned IdxMode, EVT VT) const {
497 return VT.isSimple() &&
498 (getIndexedLoadAction(IdxMode, VT) == Legal ||
499 getIndexedLoadAction(IdxMode, VT) == Custom);
502 /// getIndexedStoreAction - Return how the indexed store should be treated:
503 /// either it is legal, needs to be promoted to a larger size, needs to be
504 /// expanded to some other code sequence, or the target has a custom expander
507 getIndexedStoreAction(unsigned IdxMode, EVT VT) const {
508 assert( IdxMode < ISD::LAST_INDEXED_MODE &&
509 ((unsigned)VT.getSimpleVT().SimpleTy) < MVT::LAST_VALUETYPE &&
510 "Table isn't big enough!");
511 unsigned Ty = (unsigned)VT.getSimpleVT().SimpleTy;
512 return (LegalizeAction)(IndexedModeActions[Ty][IdxMode] & 0x0f);
515 /// isIndexedStoreLegal - Return true if the specified indexed load is legal
517 bool isIndexedStoreLegal(unsigned IdxMode, EVT VT) const {
518 return VT.isSimple() &&
519 (getIndexedStoreAction(IdxMode, VT) == Legal ||
520 getIndexedStoreAction(IdxMode, VT) == Custom);
523 /// getCondCodeAction - Return how the condition code should be treated:
524 /// either it is legal, needs to be expanded to some other code sequence,
525 /// or the target has a custom expander for it.
527 getCondCodeAction(ISD::CondCode CC, EVT VT) const {
528 assert((unsigned)CC < array_lengthof(CondCodeActions) &&
529 (unsigned)VT.getSimpleVT().SimpleTy < sizeof(CondCodeActions[0])*4 &&
530 "Table isn't big enough!");
531 LegalizeAction Action = (LegalizeAction)
532 ((CondCodeActions[CC] >> (2*VT.getSimpleVT().SimpleTy)) & 3);
533 assert(Action != Promote && "Can't promote condition code!");
537 /// isCondCodeLegal - Return true if the specified condition code is legal
539 bool isCondCodeLegal(ISD::CondCode CC, EVT VT) const {
540 return getCondCodeAction(CC, VT) == Legal ||
541 getCondCodeAction(CC, VT) == Custom;
545 /// getTypeToPromoteTo - If the action for this operation is to promote, this
546 /// method returns the ValueType to promote to.
547 EVT getTypeToPromoteTo(unsigned Op, EVT VT) const {
548 assert(getOperationAction(Op, VT) == Promote &&
549 "This operation isn't promoted!");
551 // See if this has an explicit type specified.
552 std::map<std::pair<unsigned, MVT::SimpleValueType>,
553 MVT::SimpleValueType>::const_iterator PTTI =
554 PromoteToType.find(std::make_pair(Op, VT.getSimpleVT().SimpleTy));
555 if (PTTI != PromoteToType.end()) return PTTI->second;
557 assert((VT.isInteger() || VT.isFloatingPoint()) &&
558 "Cannot autopromote this type, add it with AddPromotedToType.");
562 NVT = (MVT::SimpleValueType)(NVT.getSimpleVT().SimpleTy+1);
563 assert(NVT.isInteger() == VT.isInteger() && NVT != MVT::isVoid &&
564 "Didn't find type to promote to!");
565 } while (!isTypeLegal(NVT) ||
566 getOperationAction(Op, NVT) == Promote);
570 /// getValueType - Return the EVT corresponding to this LLVM type.
571 /// This is fixed by the LLVM operations except for the pointer size. If
572 /// AllowUnknown is true, this will return MVT::Other for types with no EVT
573 /// counterpart (e.g. structs), otherwise it will assert.
574 EVT getValueType(const Type *Ty, bool AllowUnknown = false) const {
575 EVT VT = EVT::getEVT(Ty, AllowUnknown);
576 return VT == MVT::iPTR ? PointerTy : VT;
579 /// getByValTypeAlignment - Return the desired alignment for ByVal aggregate
580 /// function arguments in the caller parameter area. This is the actual
581 /// alignment, not its logarithm.
582 virtual unsigned getByValTypeAlignment(const Type *Ty) const;
584 /// getRegisterType - Return the type of registers that this ValueType will
585 /// eventually require.
586 EVT getRegisterType(MVT VT) const {
587 assert((unsigned)VT.SimpleTy < array_lengthof(RegisterTypeForVT));
588 return RegisterTypeForVT[VT.SimpleTy];
591 /// getRegisterType - Return the type of registers that this ValueType will
592 /// eventually require.
593 EVT getRegisterType(LLVMContext &Context, EVT VT) const {
595 assert((unsigned)VT.getSimpleVT().SimpleTy <
596 array_lengthof(RegisterTypeForVT));
597 return RegisterTypeForVT[VT.getSimpleVT().SimpleTy];
601 unsigned NumIntermediates;
602 (void)getVectorTypeBreakdown(Context, VT, VT1,
603 NumIntermediates, RegisterVT);
606 if (VT.isInteger()) {
607 return getRegisterType(Context, getTypeToTransformTo(Context, VT));
609 assert(0 && "Unsupported extended type!");
610 return EVT(MVT::Other); // Not reached
613 /// getNumRegisters - Return the number of registers that this ValueType will
614 /// eventually require. This is one for any types promoted to live in larger
615 /// registers, but may be more than one for types (like i64) that are split
616 /// into pieces. For types like i140, which are first promoted then expanded,
617 /// it is the number of registers needed to hold all the bits of the original
618 /// type. For an i140 on a 32 bit machine this means 5 registers.
619 unsigned getNumRegisters(LLVMContext &Context, EVT VT) const {
621 assert((unsigned)VT.getSimpleVT().SimpleTy <
622 array_lengthof(NumRegistersForVT));
623 return NumRegistersForVT[VT.getSimpleVT().SimpleTy];
627 unsigned NumIntermediates;
628 return getVectorTypeBreakdown(Context, VT, VT1, NumIntermediates, VT2);
630 if (VT.isInteger()) {
631 unsigned BitWidth = VT.getSizeInBits();
632 unsigned RegWidth = getRegisterType(Context, VT).getSizeInBits();
633 return (BitWidth + RegWidth - 1) / RegWidth;
635 assert(0 && "Unsupported extended type!");
636 return 0; // Not reached
639 /// ShouldShrinkFPConstant - If true, then instruction selection should
640 /// seek to shrink the FP constant of the specified type to a smaller type
641 /// in order to save space and / or reduce runtime.
642 virtual bool ShouldShrinkFPConstant(EVT VT) const { return true; }
644 /// hasTargetDAGCombine - If true, the target has custom DAG combine
645 /// transformations that it can perform for the specified node.
646 bool hasTargetDAGCombine(ISD::NodeType NT) const {
647 assert(unsigned(NT >> 3) < array_lengthof(TargetDAGCombineArray));
648 return TargetDAGCombineArray[NT >> 3] & (1 << (NT&7));
651 /// This function returns the maximum number of store operations permitted
652 /// to replace a call to llvm.memset. The value is set by the target at the
653 /// performance threshold for such a replacement.
654 /// @brief Get maximum # of store operations permitted for llvm.memset
655 unsigned getMaxStoresPerMemset() const { return maxStoresPerMemset; }
657 /// This function returns the maximum number of store operations permitted
658 /// to replace a call to llvm.memcpy. The value is set by the target at the
659 /// performance threshold for such a replacement.
660 /// @brief Get maximum # of store operations permitted for llvm.memcpy
661 unsigned getMaxStoresPerMemcpy() const { return maxStoresPerMemcpy; }
663 /// This function returns the maximum number of store operations permitted
664 /// to replace a call to llvm.memmove. The value is set by the target at the
665 /// performance threshold for such a replacement.
666 /// @brief Get maximum # of store operations permitted for llvm.memmove
667 unsigned getMaxStoresPerMemmove() const { return maxStoresPerMemmove; }
669 /// This function returns true if the target allows unaligned memory accesses.
670 /// of the specified type. This is used, for example, in situations where an
671 /// array copy/move/set is converted to a sequence of store operations. It's
672 /// use helps to ensure that such replacements don't generate code that causes
673 /// an alignment error (trap) on the target machine.
674 /// @brief Determine if the target supports unaligned memory accesses.
675 virtual bool allowsUnalignedMemoryAccesses(EVT VT) const {
679 /// This function returns true if the target would benefit from code placement
681 /// @brief Determine if the target should perform code placement optimization.
682 bool shouldOptimizeCodePlacement() const {
683 return benefitFromCodePlacementOpt;
686 /// getOptimalMemOpType - Returns the target specific optimal type for load
687 /// and store operations as a result of memset, memcpy, and memmove
688 /// lowering. If DstAlign is zero that means it's safe to destination
689 /// alignment can satisfy any constraint. Similarly if SrcAlign is zero it
690 /// means there isn't a need to check it against alignment requirement,
691 /// probably because the source does not need to be loaded. If
692 /// 'NonScalarIntSafe' is true, that means it's safe to return a
693 /// non-scalar-integer type, e.g. empty string source, constant, or loaded
694 /// from memory. 'MemcpyStrSrc' indicates whether the memcpy source is
695 /// constant so it does not need to be loaded.
696 /// It returns EVT::Other if the type should be determined using generic
697 /// target-independent logic.
698 virtual EVT getOptimalMemOpType(uint64_t Size,
699 unsigned DstAlign, unsigned SrcAlign,
700 bool NonScalarIntSafe, bool MemcpyStrSrc,
701 MachineFunction &MF) const {
705 /// usesUnderscoreSetJmp - Determine if we should use _setjmp or setjmp
706 /// to implement llvm.setjmp.
707 bool usesUnderscoreSetJmp() const {
708 return UseUnderscoreSetJmp;
711 /// usesUnderscoreLongJmp - Determine if we should use _longjmp or longjmp
712 /// to implement llvm.longjmp.
713 bool usesUnderscoreLongJmp() const {
714 return UseUnderscoreLongJmp;
717 /// getStackPointerRegisterToSaveRestore - If a physical register, this
718 /// specifies the register that llvm.savestack/llvm.restorestack should save
720 unsigned getStackPointerRegisterToSaveRestore() const {
721 return StackPointerRegisterToSaveRestore;
724 /// getExceptionAddressRegister - If a physical register, this returns
725 /// the register that receives the exception address on entry to a landing
727 unsigned getExceptionAddressRegister() const {
728 return ExceptionPointerRegister;
731 /// getExceptionSelectorRegister - If a physical register, this returns
732 /// the register that receives the exception typeid on entry to a landing
734 unsigned getExceptionSelectorRegister() const {
735 return ExceptionSelectorRegister;
738 /// getJumpBufSize - returns the target's jmp_buf size in bytes (if never
739 /// set, the default is 200)
740 unsigned getJumpBufSize() const {
744 /// getJumpBufAlignment - returns the target's jmp_buf alignment in bytes
745 /// (if never set, the default is 0)
746 unsigned getJumpBufAlignment() const {
747 return JumpBufAlignment;
750 /// getMinStackArgumentAlignment - return the minimum stack alignment of an
752 unsigned getMinStackArgumentAlignment() const {
753 return MinStackArgumentAlignment;
756 /// getPrefLoopAlignment - return the preferred loop alignment.
758 unsigned getPrefLoopAlignment() const {
759 return PrefLoopAlignment;
762 /// getShouldFoldAtomicFences - return whether the combiner should fold
763 /// fence MEMBARRIER instructions into the atomic intrinsic instructions.
765 bool getShouldFoldAtomicFences() const {
766 return ShouldFoldAtomicFences;
769 /// getPreIndexedAddressParts - returns true by value, base pointer and
770 /// offset pointer and addressing mode by reference if the node's address
771 /// can be legally represented as pre-indexed load / store address.
772 virtual bool getPreIndexedAddressParts(SDNode *N, SDValue &Base,
774 ISD::MemIndexedMode &AM,
775 SelectionDAG &DAG) const {
779 /// getPostIndexedAddressParts - returns true by value, base pointer and
780 /// offset pointer and addressing mode by reference if this node can be
781 /// combined with a load / store to form a post-indexed load / store.
782 virtual bool getPostIndexedAddressParts(SDNode *N, SDNode *Op,
783 SDValue &Base, SDValue &Offset,
784 ISD::MemIndexedMode &AM,
785 SelectionDAG &DAG) const {
789 /// getJumpTableEncoding - Return the entry encoding for a jump table in the
790 /// current function. The returned value is a member of the
791 /// MachineJumpTableInfo::JTEntryKind enum.
792 virtual unsigned getJumpTableEncoding() const;
794 virtual const MCExpr *
795 LowerCustomJumpTableEntry(const MachineJumpTableInfo *MJTI,
796 const MachineBasicBlock *MBB, unsigned uid,
797 MCContext &Ctx) const {
798 assert(0 && "Need to implement this hook if target has custom JTIs");
802 /// getPICJumpTableRelocaBase - Returns relocation base for the given PIC
804 virtual SDValue getPICJumpTableRelocBase(SDValue Table,
805 SelectionDAG &DAG) const;
807 /// getPICJumpTableRelocBaseExpr - This returns the relocation base for the
808 /// given PIC jumptable, the same as getPICJumpTableRelocBase, but as an
810 virtual const MCExpr *
811 getPICJumpTableRelocBaseExpr(const MachineFunction *MF,
812 unsigned JTI, MCContext &Ctx) const;
814 /// isOffsetFoldingLegal - Return true if folding a constant offset
815 /// with the given GlobalAddress is legal. It is frequently not legal in
816 /// PIC relocation models.
817 virtual bool isOffsetFoldingLegal(const GlobalAddressSDNode *GA) const;
819 /// getFunctionAlignment - Return the Log2 alignment of this function.
820 virtual unsigned getFunctionAlignment(const Function *) const = 0;
822 /// getStackCookieLocation - Return true if the target stores stack
823 /// protector cookies at a fixed offset in some non-standard address
824 /// space, and populates the address space and offset as
826 virtual bool getStackCookieLocation(unsigned &AddressSpace, unsigned &Offset) const {
830 /// getMaximalGlobalOffset - Returns the maximal possible offset which can be
831 /// used for loads / stores from the global.
832 virtual unsigned getMaximalGlobalOffset() const {
836 //===--------------------------------------------------------------------===//
837 // TargetLowering Optimization Methods
840 /// TargetLoweringOpt - A convenience struct that encapsulates a DAG, and two
841 /// SDValues for returning information from TargetLowering to its clients
842 /// that want to combine
843 struct TargetLoweringOpt {
850 explicit TargetLoweringOpt(SelectionDAG &InDAG,
852 DAG(InDAG), LegalTys(LT), LegalOps(LO) {}
854 bool LegalTypes() const { return LegalTys; }
855 bool LegalOperations() const { return LegalOps; }
857 bool CombineTo(SDValue O, SDValue N) {
863 /// ShrinkDemandedConstant - Check to see if the specified operand of the
864 /// specified instruction is a constant integer. If so, check to see if
865 /// there are any bits set in the constant that are not demanded. If so,
866 /// shrink the constant and return true.
867 bool ShrinkDemandedConstant(SDValue Op, const APInt &Demanded);
869 /// ShrinkDemandedOp - Convert x+y to (VT)((SmallVT)x+(SmallVT)y) if the
870 /// casts are free. This uses isZExtFree and ZERO_EXTEND for the widening
871 /// cast, but it could be generalized for targets with other types of
872 /// implicit widening casts.
873 bool ShrinkDemandedOp(SDValue Op, unsigned BitWidth, const APInt &Demanded,
877 /// SimplifyDemandedBits - Look at Op. At this point, we know that only the
878 /// DemandedMask bits of the result of Op are ever used downstream. If we can
879 /// use this information to simplify Op, create a new simplified DAG node and
880 /// return true, returning the original and new nodes in Old and New.
881 /// Otherwise, analyze the expression and return a mask of KnownOne and
882 /// KnownZero bits for the expression (used to simplify the caller).
883 /// The KnownZero/One bits may only be accurate for those bits in the
885 bool SimplifyDemandedBits(SDValue Op, const APInt &DemandedMask,
886 APInt &KnownZero, APInt &KnownOne,
887 TargetLoweringOpt &TLO, unsigned Depth = 0) const;
889 /// computeMaskedBitsForTargetNode - Determine which of the bits specified in
890 /// Mask are known to be either zero or one and return them in the
891 /// KnownZero/KnownOne bitsets.
892 virtual void computeMaskedBitsForTargetNode(const SDValue Op,
896 const SelectionDAG &DAG,
897 unsigned Depth = 0) const;
899 /// ComputeNumSignBitsForTargetNode - This method can be implemented by
900 /// targets that want to expose additional information about sign bits to the
902 virtual unsigned ComputeNumSignBitsForTargetNode(SDValue Op,
903 unsigned Depth = 0) const;
905 struct DAGCombinerInfo {
906 void *DC; // The DAG Combiner object.
908 bool BeforeLegalizeOps;
909 bool CalledByLegalizer;
913 DAGCombinerInfo(SelectionDAG &dag, bool bl, bool blo, bool cl, void *dc)
914 : DC(dc), BeforeLegalize(bl), BeforeLegalizeOps(blo),
915 CalledByLegalizer(cl), DAG(dag) {}
917 bool isBeforeLegalize() const { return BeforeLegalize; }
918 bool isBeforeLegalizeOps() const { return BeforeLegalizeOps; }
919 bool isCalledByLegalizer() const { return CalledByLegalizer; }
921 void AddToWorklist(SDNode *N);
922 SDValue CombineTo(SDNode *N, const std::vector<SDValue> &To,
924 SDValue CombineTo(SDNode *N, SDValue Res, bool AddTo = true);
925 SDValue CombineTo(SDNode *N, SDValue Res0, SDValue Res1, bool AddTo = true);
927 void CommitTargetLoweringOpt(const TargetLoweringOpt &TLO);
930 /// SimplifySetCC - Try to simplify a setcc built with the specified operands
931 /// and cc. If it is unable to simplify it, return a null SDValue.
932 SDValue SimplifySetCC(EVT VT, SDValue N0, SDValue N1,
933 ISD::CondCode Cond, bool foldBooleans,
934 DAGCombinerInfo &DCI, DebugLoc dl) const;
936 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
937 /// node is a GlobalAddress + offset.
939 isGAPlusOffset(SDNode *N, const GlobalValue* &GA, int64_t &Offset) const;
941 /// PerformDAGCombine - This method will be invoked for all target nodes and
942 /// for any target-independent nodes that the target has registered with
945 /// The semantics are as follows:
947 /// SDValue.Val == 0 - No change was made
948 /// SDValue.Val == N - N was replaced, is dead, and is already handled.
949 /// otherwise - N should be replaced by the returned Operand.
951 /// In addition, methods provided by DAGCombinerInfo may be used to perform
952 /// more complex transformations.
954 virtual SDValue PerformDAGCombine(SDNode *N, DAGCombinerInfo &DCI) const;
956 /// isTypeDesirableForOp - Return true if the target has native support for
957 /// the specified value type and it is 'desirable' to use the type for the
958 /// given node type. e.g. On x86 i16 is legal, but undesirable since i16
959 /// instruction encodings are longer and some i16 instructions are slow.
960 virtual bool isTypeDesirableForOp(unsigned Opc, EVT VT) const {
961 // By default, assume all legal types are desirable.
962 return isTypeLegal(VT);
965 /// IsDesirableToPromoteOp - This method query the target whether it is
966 /// beneficial for dag combiner to promote the specified node. If true, it
967 /// should return the desired promotion type by reference.
968 virtual bool IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const {
972 //===--------------------------------------------------------------------===//
973 // TargetLowering Configuration Methods - These methods should be invoked by
974 // the derived class constructor to configure this object for the target.
978 /// setShiftAmountType - Describe the type that should be used for shift
979 /// amounts. This type defaults to the pointer type.
980 void setShiftAmountType(MVT VT) { ShiftAmountTy = VT; }
982 /// setBooleanContents - Specify how the target extends the result of a
983 /// boolean value from i1 to a wider type. See getBooleanContents.
984 void setBooleanContents(BooleanContent Ty) { BooleanContents = Ty; }
986 /// setSchedulingPreference - Specify the target scheduling preference.
987 void setSchedulingPreference(Sched::Preference Pref) {
988 SchedPreferenceInfo = Pref;
991 /// setUseUnderscoreSetJmp - Indicate whether this target prefers to
992 /// use _setjmp to implement llvm.setjmp or the non _ version.
993 /// Defaults to false.
994 void setUseUnderscoreSetJmp(bool Val) {
995 UseUnderscoreSetJmp = Val;
998 /// setUseUnderscoreLongJmp - Indicate whether this target prefers to
999 /// use _longjmp to implement llvm.longjmp or the non _ version.
1000 /// Defaults to false.
1001 void setUseUnderscoreLongJmp(bool Val) {
1002 UseUnderscoreLongJmp = Val;
1005 /// setStackPointerRegisterToSaveRestore - If set to a physical register, this
1006 /// specifies the register that llvm.savestack/llvm.restorestack should save
1008 void setStackPointerRegisterToSaveRestore(unsigned R) {
1009 StackPointerRegisterToSaveRestore = R;
1012 /// setExceptionPointerRegister - If set to a physical register, this sets
1013 /// the register that receives the exception address on entry to a landing
1015 void setExceptionPointerRegister(unsigned R) {
1016 ExceptionPointerRegister = R;
1019 /// setExceptionSelectorRegister - If set to a physical register, this sets
1020 /// the register that receives the exception typeid on entry to a landing
1022 void setExceptionSelectorRegister(unsigned R) {
1023 ExceptionSelectorRegister = R;
1026 /// SelectIsExpensive - Tells the code generator not to expand operations
1027 /// into sequences that use the select operations if possible.
1028 void setSelectIsExpensive() { SelectIsExpensive = true; }
1030 /// setIntDivIsCheap - Tells the code generator that integer divide is
1031 /// expensive, and if possible, should be replaced by an alternate sequence
1032 /// of instructions not containing an integer divide.
1033 void setIntDivIsCheap(bool isCheap = true) { IntDivIsCheap = isCheap; }
1035 /// setPow2DivIsCheap - Tells the code generator that it shouldn't generate
1036 /// srl/add/sra for a signed divide by power of two, and let the target handle
1038 void setPow2DivIsCheap(bool isCheap = true) { Pow2DivIsCheap = isCheap; }
1040 /// addRegisterClass - Add the specified register class as an available
1041 /// regclass for the specified value type. This indicates the selector can
1042 /// handle values of that class natively.
1043 void addRegisterClass(EVT VT, TargetRegisterClass *RC,
1044 bool isSynthesizable = true) {
1045 assert((unsigned)VT.getSimpleVT().SimpleTy < array_lengthof(RegClassForVT));
1046 AvailableRegClasses.push_back(std::make_pair(VT, RC));
1047 RegClassForVT[VT.getSimpleVT().SimpleTy] = RC;
1048 Synthesizable[VT.getSimpleVT().SimpleTy] = isSynthesizable;
1051 /// findRepresentativeClass - Return the largest legal super-reg register class
1052 /// of the register class for the specified type and its associated "cost".
1053 virtual std::pair<const TargetRegisterClass*, uint8_t>
1054 findRepresentativeClass(EVT VT) const;
1056 /// computeRegisterProperties - Once all of the register classes are added,
1057 /// this allows us to compute derived properties we expose.
1058 void computeRegisterProperties();
1060 /// setOperationAction - Indicate that the specified operation does not work
1061 /// with the specified type and indicate what to do about it.
1062 void setOperationAction(unsigned Op, MVT VT,
1063 LegalizeAction Action) {
1064 assert(Op < array_lengthof(OpActions[0]) && "Table isn't big enough!");
1065 OpActions[(unsigned)VT.SimpleTy][Op] = (uint8_t)Action;
1068 /// setLoadExtAction - Indicate that the specified load with extension does
1069 /// not work with the specified type and indicate what to do about it.
1070 void setLoadExtAction(unsigned ExtType, MVT VT,
1071 LegalizeAction Action) {
1072 assert(ExtType < ISD::LAST_LOADEXT_TYPE &&
1073 (unsigned)VT.SimpleTy < MVT::LAST_VALUETYPE &&
1074 "Table isn't big enough!");
1075 LoadExtActions[VT.SimpleTy][ExtType] = (uint8_t)Action;
1078 /// setTruncStoreAction - Indicate that the specified truncating store does
1079 /// not work with the specified type and indicate what to do about it.
1080 void setTruncStoreAction(MVT ValVT, MVT MemVT,
1081 LegalizeAction Action) {
1082 assert((unsigned)ValVT.SimpleTy < MVT::LAST_VALUETYPE &&
1083 (unsigned)MemVT.SimpleTy < MVT::LAST_VALUETYPE &&
1084 "Table isn't big enough!");
1085 TruncStoreActions[ValVT.SimpleTy][MemVT.SimpleTy] = (uint8_t)Action;
1088 /// setIndexedLoadAction - Indicate that the specified indexed load does or
1089 /// does not work with the specified type and indicate what to do abort
1090 /// it. NOTE: All indexed mode loads are initialized to Expand in
1091 /// TargetLowering.cpp
1092 void setIndexedLoadAction(unsigned IdxMode, MVT VT,
1093 LegalizeAction Action) {
1094 assert((unsigned)VT.SimpleTy < MVT::LAST_VALUETYPE &&
1095 IdxMode < ISD::LAST_INDEXED_MODE &&
1096 (unsigned)Action < 0xf &&
1097 "Table isn't big enough!");
1098 // Load action are kept in the upper half.
1099 IndexedModeActions[(unsigned)VT.SimpleTy][IdxMode] &= ~0xf0;
1100 IndexedModeActions[(unsigned)VT.SimpleTy][IdxMode] |= ((uint8_t)Action) <<4;
1103 /// setIndexedStoreAction - Indicate that the specified indexed store does or
1104 /// does not work with the specified type and indicate what to do about
1105 /// it. NOTE: All indexed mode stores are initialized to Expand in
1106 /// TargetLowering.cpp
1107 void setIndexedStoreAction(unsigned IdxMode, MVT VT,
1108 LegalizeAction Action) {
1109 assert((unsigned)VT.SimpleTy < MVT::LAST_VALUETYPE &&
1110 IdxMode < ISD::LAST_INDEXED_MODE &&
1111 (unsigned)Action < 0xf &&
1112 "Table isn't big enough!");
1113 // Store action are kept in the lower half.
1114 IndexedModeActions[(unsigned)VT.SimpleTy][IdxMode] &= ~0x0f;
1115 IndexedModeActions[(unsigned)VT.SimpleTy][IdxMode] |= ((uint8_t)Action);
1118 /// setCondCodeAction - Indicate that the specified condition code is or isn't
1119 /// supported on the target and indicate what to do about it.
1120 void setCondCodeAction(ISD::CondCode CC, MVT VT,
1121 LegalizeAction Action) {
1122 assert((unsigned)VT.SimpleTy < MVT::LAST_VALUETYPE &&
1123 (unsigned)CC < array_lengthof(CondCodeActions) &&
1124 "Table isn't big enough!");
1125 CondCodeActions[(unsigned)CC] &= ~(uint64_t(3UL) << VT.SimpleTy*2);
1126 CondCodeActions[(unsigned)CC] |= (uint64_t)Action << VT.SimpleTy*2;
1129 /// AddPromotedToType - If Opc/OrigVT is specified as being promoted, the
1130 /// promotion code defaults to trying a larger integer/fp until it can find
1131 /// one that works. If that default is insufficient, this method can be used
1132 /// by the target to override the default.
1133 void AddPromotedToType(unsigned Opc, MVT OrigVT, MVT DestVT) {
1134 PromoteToType[std::make_pair(Opc, OrigVT.SimpleTy)] = DestVT.SimpleTy;
1137 /// setTargetDAGCombine - Targets should invoke this method for each target
1138 /// independent node that they want to provide a custom DAG combiner for by
1139 /// implementing the PerformDAGCombine virtual method.
1140 void setTargetDAGCombine(ISD::NodeType NT) {
1141 assert(unsigned(NT >> 3) < array_lengthof(TargetDAGCombineArray));
1142 TargetDAGCombineArray[NT >> 3] |= 1 << (NT&7);
1145 /// setJumpBufSize - Set the target's required jmp_buf buffer size (in
1146 /// bytes); default is 200
1147 void setJumpBufSize(unsigned Size) {
1151 /// setJumpBufAlignment - Set the target's required jmp_buf buffer
1152 /// alignment (in bytes); default is 0
1153 void setJumpBufAlignment(unsigned Align) {
1154 JumpBufAlignment = Align;
1157 /// setPrefLoopAlignment - Set the target's preferred loop alignment. Default
1158 /// alignment is zero, it means the target does not care about loop alignment.
1159 void setPrefLoopAlignment(unsigned Align) {
1160 PrefLoopAlignment = Align;
1163 /// setMinStackArgumentAlignment - Set the minimum stack alignment of an
1165 void setMinStackArgumentAlignment(unsigned Align) {
1166 MinStackArgumentAlignment = Align;
1169 /// setShouldFoldAtomicFences - Set if the target's implementation of the
1170 /// atomic operation intrinsics includes locking. Default is false.
1171 void setShouldFoldAtomicFences(bool fold) {
1172 ShouldFoldAtomicFences = fold;
1176 //===--------------------------------------------------------------------===//
1177 // Lowering methods - These methods must be implemented by targets so that
1178 // the SelectionDAGLowering code knows how to lower these.
1181 /// LowerFormalArguments - This hook must be implemented to lower the
1182 /// incoming (formal) arguments, described by the Ins array, into the
1183 /// specified DAG. The implementation should fill in the InVals array
1184 /// with legal-type argument values, and return the resulting token
1188 LowerFormalArguments(SDValue Chain,
1189 CallingConv::ID CallConv, bool isVarArg,
1190 const SmallVectorImpl<ISD::InputArg> &Ins,
1191 DebugLoc dl, SelectionDAG &DAG,
1192 SmallVectorImpl<SDValue> &InVals) const {
1193 assert(0 && "Not Implemented");
1194 return SDValue(); // this is here to silence compiler errors
1197 /// LowerCallTo - This function lowers an abstract call to a function into an
1198 /// actual call. This returns a pair of operands. The first element is the
1199 /// return value for the function (if RetTy is not VoidTy). The second
1200 /// element is the outgoing token chain. It calls LowerCall to do the actual
1202 struct ArgListEntry {
1213 ArgListEntry() : isSExt(false), isZExt(false), isInReg(false),
1214 isSRet(false), isNest(false), isByVal(false), Alignment(0) { }
1216 typedef std::vector<ArgListEntry> ArgListTy;
1217 std::pair<SDValue, SDValue>
1218 LowerCallTo(SDValue Chain, const Type *RetTy, bool RetSExt, bool RetZExt,
1219 bool isVarArg, bool isInreg, unsigned NumFixedArgs,
1220 CallingConv::ID CallConv, bool isTailCall,
1221 bool isReturnValueUsed, SDValue Callee, ArgListTy &Args,
1222 SelectionDAG &DAG, DebugLoc dl) const;
1224 /// LowerCall - This hook must be implemented to lower calls into the
1225 /// the specified DAG. The outgoing arguments to the call are described
1226 /// by the Outs array, and the values to be returned by the call are
1227 /// described by the Ins array. The implementation should fill in the
1228 /// InVals array with legal-type return values from the call, and return
1229 /// the resulting token chain value.
1231 LowerCall(SDValue Chain, SDValue Callee,
1232 CallingConv::ID CallConv, bool isVarArg, bool &isTailCall,
1233 const SmallVectorImpl<ISD::OutputArg> &Outs,
1234 const SmallVectorImpl<SDValue> &OutVals,
1235 const SmallVectorImpl<ISD::InputArg> &Ins,
1236 DebugLoc dl, SelectionDAG &DAG,
1237 SmallVectorImpl<SDValue> &InVals) const {
1238 assert(0 && "Not Implemented");
1239 return SDValue(); // this is here to silence compiler errors
1242 /// CanLowerReturn - This hook should be implemented to check whether the
1243 /// return values described by the Outs array can fit into the return
1244 /// registers. If false is returned, an sret-demotion is performed.
1246 virtual bool CanLowerReturn(CallingConv::ID CallConv, bool isVarArg,
1247 const SmallVectorImpl<ISD::OutputArg> &Outs,
1248 LLVMContext &Context) const
1250 // Return true by default to get preexisting behavior.
1254 /// LowerReturn - This hook must be implemented to lower outgoing
1255 /// return values, described by the Outs array, into the specified
1256 /// DAG. The implementation should return the resulting token chain
1260 LowerReturn(SDValue Chain, CallingConv::ID CallConv, bool isVarArg,
1261 const SmallVectorImpl<ISD::OutputArg> &Outs,
1262 const SmallVectorImpl<SDValue> &OutVals,
1263 DebugLoc dl, SelectionDAG &DAG) const {
1264 assert(0 && "Not Implemented");
1265 return SDValue(); // this is here to silence compiler errors
1268 /// LowerOperationWrapper - This callback is invoked by the type legalizer
1269 /// to legalize nodes with an illegal operand type but legal result types.
1270 /// It replaces the LowerOperation callback in the type Legalizer.
1271 /// The reason we can not do away with LowerOperation entirely is that
1272 /// LegalizeDAG isn't yet ready to use this callback.
1273 /// TODO: Consider merging with ReplaceNodeResults.
1275 /// The target places new result values for the node in Results (their number
1276 /// and types must exactly match those of the original return values of
1277 /// the node), or leaves Results empty, which indicates that the node is not
1278 /// to be custom lowered after all.
1279 /// The default implementation calls LowerOperation.
1280 virtual void LowerOperationWrapper(SDNode *N,
1281 SmallVectorImpl<SDValue> &Results,
1282 SelectionDAG &DAG) const;
1284 /// LowerOperation - This callback is invoked for operations that are
1285 /// unsupported by the target, which are registered to use 'custom' lowering,
1286 /// and whose defined values are all legal.
1287 /// If the target has no operations that require custom lowering, it need not
1288 /// implement this. The default implementation of this aborts.
1289 virtual SDValue LowerOperation(SDValue Op, SelectionDAG &DAG) const;
1291 /// ReplaceNodeResults - This callback is invoked when a node result type is
1292 /// illegal for the target, and the operation was registered to use 'custom'
1293 /// lowering for that result type. The target places new result values for
1294 /// the node in Results (their number and types must exactly match those of
1295 /// the original return values of the node), or leaves Results empty, which
1296 /// indicates that the node is not to be custom lowered after all.
1298 /// If the target has no operations that require custom lowering, it need not
1299 /// implement this. The default implementation aborts.
1300 virtual void ReplaceNodeResults(SDNode *N, SmallVectorImpl<SDValue> &Results,
1301 SelectionDAG &DAG) const {
1302 assert(0 && "ReplaceNodeResults not implemented for this target!");
1305 /// getTargetNodeName() - This method returns the name of a target specific
1307 virtual const char *getTargetNodeName(unsigned Opcode) const;
1309 /// createFastISel - This method returns a target specific FastISel object,
1310 /// or null if the target does not support "fast" ISel.
1311 virtual FastISel *createFastISel(FunctionLoweringInfo &funcInfo) const {
1315 //===--------------------------------------------------------------------===//
1316 // Inline Asm Support hooks
1319 /// ExpandInlineAsm - This hook allows the target to expand an inline asm
1320 /// call to be explicit llvm code if it wants to. This is useful for
1321 /// turning simple inline asms into LLVM intrinsics, which gives the
1322 /// compiler more information about the behavior of the code.
1323 virtual bool ExpandInlineAsm(CallInst *CI) const {
1327 enum ConstraintType {
1328 C_Register, // Constraint represents specific register(s).
1329 C_RegisterClass, // Constraint represents any of register(s) in class.
1330 C_Memory, // Memory constraint.
1331 C_Other, // Something else.
1332 C_Unknown // Unsupported constraint.
1335 /// AsmOperandInfo - This contains information for each constraint that we are
1337 struct AsmOperandInfo : public InlineAsm::ConstraintInfo {
1338 /// ConstraintCode - This contains the actual string for the code, like "m".
1339 /// TargetLowering picks the 'best' code from ConstraintInfo::Codes that
1340 /// most closely matches the operand.
1341 std::string ConstraintCode;
1343 /// ConstraintType - Information about the constraint code, e.g. Register,
1344 /// RegisterClass, Memory, Other, Unknown.
1345 TargetLowering::ConstraintType ConstraintType;
1347 /// CallOperandval - If this is the result output operand or a
1348 /// clobber, this is null, otherwise it is the incoming operand to the
1349 /// CallInst. This gets modified as the asm is processed.
1350 Value *CallOperandVal;
1352 /// ConstraintVT - The ValueType for the operand value.
1355 /// isMatchingInputConstraint - Return true of this is an input operand that
1356 /// is a matching constraint like "4".
1357 bool isMatchingInputConstraint() const;
1359 /// getMatchedOperand - If this is an input matching constraint, this method
1360 /// returns the output operand it matches.
1361 unsigned getMatchedOperand() const;
1363 AsmOperandInfo(const InlineAsm::ConstraintInfo &info)
1364 : InlineAsm::ConstraintInfo(info),
1365 ConstraintType(TargetLowering::C_Unknown),
1366 CallOperandVal(0), ConstraintVT(MVT::Other) {
1370 /// ComputeConstraintToUse - Determines the constraint code and constraint
1371 /// type to use for the specific AsmOperandInfo, setting
1372 /// OpInfo.ConstraintCode and OpInfo.ConstraintType. If the actual operand
1373 /// being passed in is available, it can be passed in as Op, otherwise an
1374 /// empty SDValue can be passed.
1375 virtual void ComputeConstraintToUse(AsmOperandInfo &OpInfo,
1377 SelectionDAG *DAG = 0) const;
1379 /// getConstraintType - Given a constraint, return the type of constraint it
1380 /// is for this target.
1381 virtual ConstraintType getConstraintType(const std::string &Constraint) const;
1383 /// getRegClassForInlineAsmConstraint - Given a constraint letter (e.g. "r"),
1384 /// return a list of registers that can be used to satisfy the constraint.
1385 /// This should only be used for C_RegisterClass constraints.
1386 virtual std::vector<unsigned>
1387 getRegClassForInlineAsmConstraint(const std::string &Constraint,
1390 /// getRegForInlineAsmConstraint - Given a physical register constraint (e.g.
1391 /// {edx}), return the register number and the register class for the
1394 /// Given a register class constraint, like 'r', if this corresponds directly
1395 /// to an LLVM register class, return a register of 0 and the register class
1398 /// This should only be used for C_Register constraints. On error,
1399 /// this returns a register number of 0 and a null register class pointer..
1400 virtual std::pair<unsigned, const TargetRegisterClass*>
1401 getRegForInlineAsmConstraint(const std::string &Constraint,
1404 /// LowerXConstraint - try to replace an X constraint, which matches anything,
1405 /// with another that has more specific requirements based on the type of the
1406 /// corresponding operand. This returns null if there is no replacement to
1408 virtual const char *LowerXConstraint(EVT ConstraintVT) const;
1410 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
1411 /// vector. If it is invalid, don't add anything to Ops.
1412 virtual void LowerAsmOperandForConstraint(SDValue Op, char ConstraintLetter,
1413 std::vector<SDValue> &Ops,
1414 SelectionDAG &DAG) const;
1416 //===--------------------------------------------------------------------===//
1417 // Instruction Emitting Hooks
1420 // EmitInstrWithCustomInserter - This method should be implemented by targets
1421 // that mark instructions with the 'usesCustomInserter' flag. These
1422 // instructions are special in various ways, which require special support to
1423 // insert. The specified MachineInstr is created but not inserted into any
1424 // basic blocks, and this method is called to expand it into a sequence of
1425 // instructions, potentially also creating new basic blocks and control flow.
1426 virtual MachineBasicBlock *
1427 EmitInstrWithCustomInserter(MachineInstr *MI, MachineBasicBlock *MBB) const;
1429 //===--------------------------------------------------------------------===//
1430 // Addressing mode description hooks (used by LSR etc).
1433 /// AddrMode - This represents an addressing mode of:
1434 /// BaseGV + BaseOffs + BaseReg + Scale*ScaleReg
1435 /// If BaseGV is null, there is no BaseGV.
1436 /// If BaseOffs is zero, there is no base offset.
1437 /// If HasBaseReg is false, there is no base register.
1438 /// If Scale is zero, there is no ScaleReg. Scale of 1 indicates a reg with
1442 GlobalValue *BaseGV;
1446 AddrMode() : BaseGV(0), BaseOffs(0), HasBaseReg(false), Scale(0) {}
1449 /// isLegalAddressingMode - Return true if the addressing mode represented by
1450 /// AM is legal for this target, for a load/store of the specified type.
1451 /// The type may be VoidTy, in which case only return true if the addressing
1452 /// mode is legal for a load/store of any legal type.
1453 /// TODO: Handle pre/postinc as well.
1454 virtual bool isLegalAddressingMode(const AddrMode &AM, const Type *Ty) const;
1456 /// isTruncateFree - Return true if it's free to truncate a value of
1457 /// type Ty1 to type Ty2. e.g. On x86 it's free to truncate a i32 value in
1458 /// register EAX to i16 by referencing its sub-register AX.
1459 virtual bool isTruncateFree(const Type *Ty1, const Type *Ty2) const {
1463 virtual bool isTruncateFree(EVT VT1, EVT VT2) const {
1467 /// isZExtFree - Return true if any actual instruction that defines a
1468 /// value of type Ty1 implicitly zero-extends the value to Ty2 in the result
1469 /// register. This does not necessarily include registers defined in
1470 /// unknown ways, such as incoming arguments, or copies from unknown
1471 /// virtual registers. Also, if isTruncateFree(Ty2, Ty1) is true, this
1472 /// does not necessarily apply to truncate instructions. e.g. on x86-64,
1473 /// all instructions that define 32-bit values implicit zero-extend the
1474 /// result out to 64 bits.
1475 virtual bool isZExtFree(const Type *Ty1, const Type *Ty2) const {
1479 virtual bool isZExtFree(EVT VT1, EVT VT2) const {
1483 /// isNarrowingProfitable - Return true if it's profitable to narrow
1484 /// operations of type VT1 to VT2. e.g. on x86, it's profitable to narrow
1485 /// from i32 to i8 but not from i32 to i16.
1486 virtual bool isNarrowingProfitable(EVT VT1, EVT VT2) const {
1490 /// isLegalICmpImmediate - Return true if the specified immediate is legal
1491 /// icmp immediate, that is the target has icmp instructions which can compare
1492 /// a register against the immediate without having to materialize the
1493 /// immediate into a register.
1494 virtual bool isLegalICmpImmediate(int64_t Imm) const {
1498 //===--------------------------------------------------------------------===//
1499 // Div utility functions
1501 SDValue BuildSDIV(SDNode *N, SelectionDAG &DAG,
1502 std::vector<SDNode*>* Created) const;
1503 SDValue BuildUDIV(SDNode *N, SelectionDAG &DAG,
1504 std::vector<SDNode*>* Created) const;
1507 //===--------------------------------------------------------------------===//
1508 // Runtime Library hooks
1511 /// setLibcallName - Rename the default libcall routine name for the specified
1513 void setLibcallName(RTLIB::Libcall Call, const char *Name) {
1514 LibcallRoutineNames[Call] = Name;
1517 /// getLibcallName - Get the libcall routine name for the specified libcall.
1519 const char *getLibcallName(RTLIB::Libcall Call) const {
1520 return LibcallRoutineNames[Call];
1523 /// setCmpLibcallCC - Override the default CondCode to be used to test the
1524 /// result of the comparison libcall against zero.
1525 void setCmpLibcallCC(RTLIB::Libcall Call, ISD::CondCode CC) {
1526 CmpLibcallCCs[Call] = CC;
1529 /// getCmpLibcallCC - Get the CondCode that's to be used to test the result of
1530 /// the comparison libcall against zero.
1531 ISD::CondCode getCmpLibcallCC(RTLIB::Libcall Call) const {
1532 return CmpLibcallCCs[Call];
1535 /// setLibcallCallingConv - Set the CallingConv that should be used for the
1536 /// specified libcall.
1537 void setLibcallCallingConv(RTLIB::Libcall Call, CallingConv::ID CC) {
1538 LibcallCallingConvs[Call] = CC;
1541 /// getLibcallCallingConv - Get the CallingConv that should be used for the
1542 /// specified libcall.
1543 CallingConv::ID getLibcallCallingConv(RTLIB::Libcall Call) const {
1544 return LibcallCallingConvs[Call];
1548 const TargetMachine &TM;
1549 const TargetData *TD;
1550 const TargetLoweringObjectFile &TLOF;
1552 /// PointerTy - The type to use for pointers, usually i32 or i64.
1556 /// IsLittleEndian - True if this is a little endian target.
1558 bool IsLittleEndian;
1560 /// SelectIsExpensive - Tells the code generator not to expand operations
1561 /// into sequences that use the select operations if possible.
1562 bool SelectIsExpensive;
1564 /// IntDivIsCheap - Tells the code generator not to expand integer divides by
1565 /// constants into a sequence of muls, adds, and shifts. This is a hack until
1566 /// a real cost model is in place. If we ever optimize for size, this will be
1567 /// set to true unconditionally.
1570 /// Pow2DivIsCheap - Tells the code generator that it shouldn't generate
1571 /// srl/add/sra for a signed divide by power of two, and let the target handle
1573 bool Pow2DivIsCheap;
1575 /// UseUnderscoreSetJmp - This target prefers to use _setjmp to implement
1576 /// llvm.setjmp. Defaults to false.
1577 bool UseUnderscoreSetJmp;
1579 /// UseUnderscoreLongJmp - This target prefers to use _longjmp to implement
1580 /// llvm.longjmp. Defaults to false.
1581 bool UseUnderscoreLongJmp;
1583 /// ShiftAmountTy - The type to use for shift amounts, usually i8 or whatever
1587 /// BooleanContents - Information about the contents of the high-bits in
1588 /// boolean values held in a type wider than i1. See getBooleanContents.
1589 BooleanContent BooleanContents;
1591 /// SchedPreferenceInfo - The target scheduling preference: shortest possible
1592 /// total cycles or lowest register usage.
1593 Sched::Preference SchedPreferenceInfo;
1595 /// JumpBufSize - The size, in bytes, of the target's jmp_buf buffers
1596 unsigned JumpBufSize;
1598 /// JumpBufAlignment - The alignment, in bytes, of the target's jmp_buf
1600 unsigned JumpBufAlignment;
1602 /// MinStackArgumentAlignment - The minimum alignment that any argument
1603 /// on the stack needs to have.
1605 unsigned MinStackArgumentAlignment;
1607 /// PrefLoopAlignment - The perferred loop alignment.
1609 unsigned PrefLoopAlignment;
1611 /// ShouldFoldAtomicFences - Whether fencing MEMBARRIER instructions should
1612 /// be folded into the enclosed atomic intrinsic instruction by the
1614 bool ShouldFoldAtomicFences;
1616 /// StackPointerRegisterToSaveRestore - If set to a physical register, this
1617 /// specifies the register that llvm.savestack/llvm.restorestack should save
1619 unsigned StackPointerRegisterToSaveRestore;
1621 /// ExceptionPointerRegister - If set to a physical register, this specifies
1622 /// the register that receives the exception address on entry to a landing
1624 unsigned ExceptionPointerRegister;
1626 /// ExceptionSelectorRegister - If set to a physical register, this specifies
1627 /// the register that receives the exception typeid on entry to a landing
1629 unsigned ExceptionSelectorRegister;
1631 /// RegClassForVT - This indicates the default register class to use for
1632 /// each ValueType the target supports natively.
1633 TargetRegisterClass *RegClassForVT[MVT::LAST_VALUETYPE];
1634 unsigned char NumRegistersForVT[MVT::LAST_VALUETYPE];
1635 EVT RegisterTypeForVT[MVT::LAST_VALUETYPE];
1637 /// RepRegClassForVT - This indicates the "representative" register class to
1638 /// use for each ValueType the target supports natively. This information is
1639 /// used by the scheduler to track register pressure. By default, the
1640 /// representative register class is the largest legal super-reg register
1641 /// class of the register class of the specified type. e.g. On x86, i8, i16,
1642 /// and i32's representative class would be GR32.
1643 const TargetRegisterClass *RepRegClassForVT[MVT::LAST_VALUETYPE];
1645 /// RepRegClassCostForVT - This indicates the "cost" of the "representative"
1646 /// register class for each ValueType. The cost is used by the scheduler to
1647 /// approximate register pressure.
1648 uint8_t RepRegClassCostForVT[MVT::LAST_VALUETYPE];
1650 /// Synthesizable indicates whether it is OK for the compiler to create new
1651 /// operations using this type. All Legal types are Synthesizable except
1652 /// MMX types on X86. Non-Legal types are not Synthesizable.
1653 bool Synthesizable[MVT::LAST_VALUETYPE];
1655 /// TransformToType - For any value types we are promoting or expanding, this
1656 /// contains the value type that we are changing to. For Expanded types, this
1657 /// contains one step of the expand (e.g. i64 -> i32), even if there are
1658 /// multiple steps required (e.g. i64 -> i16). For types natively supported
1659 /// by the system, this holds the same type (e.g. i32 -> i32).
1660 EVT TransformToType[MVT::LAST_VALUETYPE];
1662 /// OpActions - For each operation and each value type, keep a LegalizeAction
1663 /// that indicates how instruction selection should deal with the operation.
1664 /// Most operations are Legal (aka, supported natively by the target), but
1665 /// operations that are not should be described. Note that operations on
1666 /// non-legal value types are not described here.
1667 uint8_t OpActions[MVT::LAST_VALUETYPE][ISD::BUILTIN_OP_END];
1669 /// LoadExtActions - For each load extension type and each value type,
1670 /// keep a LegalizeAction that indicates how instruction selection should deal
1671 /// with a load of a specific value type and extension type.
1672 uint8_t LoadExtActions[MVT::LAST_VALUETYPE][ISD::LAST_LOADEXT_TYPE];
1674 /// TruncStoreActions - For each value type pair keep a LegalizeAction that
1675 /// indicates whether a truncating store of a specific value type and
1676 /// truncating type is legal.
1677 uint8_t TruncStoreActions[MVT::LAST_VALUETYPE][MVT::LAST_VALUETYPE];
1679 /// IndexedModeActions - For each indexed mode and each value type,
1680 /// keep a pair of LegalizeAction that indicates how instruction
1681 /// selection should deal with the load / store. The first dimension is the
1682 /// value_type for the reference. The second dimension represents the various
1683 /// modes for load store.
1684 uint8_t IndexedModeActions[MVT::LAST_VALUETYPE][ISD::LAST_INDEXED_MODE];
1686 /// CondCodeActions - For each condition code (ISD::CondCode) keep a
1687 /// LegalizeAction that indicates how instruction selection should
1688 /// deal with the condition code.
1689 uint64_t CondCodeActions[ISD::SETCC_INVALID];
1691 ValueTypeActionImpl ValueTypeActions;
1693 std::vector<std::pair<EVT, TargetRegisterClass*> > AvailableRegClasses;
1695 /// TargetDAGCombineArray - Targets can specify ISD nodes that they would
1696 /// like PerformDAGCombine callbacks for by calling setTargetDAGCombine(),
1697 /// which sets a bit in this array.
1699 TargetDAGCombineArray[(ISD::BUILTIN_OP_END+CHAR_BIT-1)/CHAR_BIT];
1701 /// PromoteToType - For operations that must be promoted to a specific type,
1702 /// this holds the destination type. This map should be sparse, so don't hold
1705 /// Targets add entries to this map with AddPromotedToType(..), clients access
1706 /// this with getTypeToPromoteTo(..).
1707 std::map<std::pair<unsigned, MVT::SimpleValueType>, MVT::SimpleValueType>
1710 /// LibcallRoutineNames - Stores the name each libcall.
1712 const char *LibcallRoutineNames[RTLIB::UNKNOWN_LIBCALL];
1714 /// CmpLibcallCCs - The ISD::CondCode that should be used to test the result
1715 /// of each of the comparison libcall against zero.
1716 ISD::CondCode CmpLibcallCCs[RTLIB::UNKNOWN_LIBCALL];
1718 /// LibcallCallingConvs - Stores the CallingConv that should be used for each
1720 CallingConv::ID LibcallCallingConvs[RTLIB::UNKNOWN_LIBCALL];
1723 /// When lowering \@llvm.memset this field specifies the maximum number of
1724 /// store operations that may be substituted for the call to memset. Targets
1725 /// must set this value based on the cost threshold for that target. Targets
1726 /// should assume that the memset will be done using as many of the largest
1727 /// store operations first, followed by smaller ones, if necessary, per
1728 /// alignment restrictions. For example, storing 9 bytes on a 32-bit machine
1729 /// with 16-bit alignment would result in four 2-byte stores and one 1-byte
1730 /// store. This only applies to setting a constant array of a constant size.
1731 /// @brief Specify maximum number of store instructions per memset call.
1732 unsigned maxStoresPerMemset;
1734 /// When lowering \@llvm.memcpy this field specifies the maximum number of
1735 /// store operations that may be substituted for a call to memcpy. Targets
1736 /// must set this value based on the cost threshold for that target. Targets
1737 /// should assume that the memcpy will be done using as many of the largest
1738 /// store operations first, followed by smaller ones, if necessary, per
1739 /// alignment restrictions. For example, storing 7 bytes on a 32-bit machine
1740 /// with 32-bit alignment would result in one 4-byte store, a one 2-byte store
1741 /// and one 1-byte store. This only applies to copying a constant array of
1743 /// @brief Specify maximum bytes of store instructions per memcpy call.
1744 unsigned maxStoresPerMemcpy;
1746 /// When lowering \@llvm.memmove this field specifies the maximum number of
1747 /// store instructions that may be substituted for a call to memmove. Targets
1748 /// must set this value based on the cost threshold for that target. Targets
1749 /// should assume that the memmove will be done using as many of the largest
1750 /// store operations first, followed by smaller ones, if necessary, per
1751 /// alignment restrictions. For example, moving 9 bytes on a 32-bit machine
1752 /// with 8-bit alignment would result in nine 1-byte stores. This only
1753 /// applies to copying a constant array of constant size.
1754 /// @brief Specify maximum bytes of store instructions per memmove call.
1755 unsigned maxStoresPerMemmove;
1757 /// This field specifies whether the target can benefit from code placement
1759 bool benefitFromCodePlacementOpt;
1762 /// isLegalRC - Return true if the value types that can be represented by the
1763 /// specified register class are all legal.
1764 bool isLegalRC(const TargetRegisterClass *RC) const;
1766 /// hasLegalSuperRegRegClasses - Return true if the specified register class
1767 /// has one or more super-reg register classes that are legal.
1768 bool hasLegalSuperRegRegClasses(const TargetRegisterClass *RC) const;
1771 /// GetReturnInfo - Given an LLVM IR type and return type attributes,
1772 /// compute the return value EVTs and flags, and optionally also
1773 /// the offsets, if the return value is being lowered to memory.
1774 void GetReturnInfo(const Type* ReturnType, Attributes attr,
1775 SmallVectorImpl<ISD::OutputArg> &Outs,
1776 const TargetLowering &TLI,
1777 SmallVectorImpl<uint64_t> *Offsets = 0);
1779 } // end llvm namespace