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/Constants.h"
26 #include "llvm/InlineAsm.h"
27 #include "llvm/CodeGen/SelectionDAGNodes.h"
28 #include "llvm/CodeGen/RuntimeLibcalls.h"
29 #include "llvm/ADT/APFloat.h"
30 #include "llvm/ADT/STLExtras.h"
39 class TargetRegisterClass;
43 class MachineBasicBlock;
46 class TargetSubtarget;
48 //===----------------------------------------------------------------------===//
49 /// TargetLowering - This class defines information used to lower LLVM code to
50 /// legal SelectionDAG operators that the target instruction selector can accept
53 /// This class also defines callbacks that targets must implement to lower
54 /// target-specific constructs to SelectionDAG operators.
56 class TargetLowering {
58 /// LegalizeAction - This enum indicates whether operations are valid for a
59 /// target, and if not, what action should be used to make them valid.
61 Legal, // The target natively supports this operation.
62 Promote, // This operation should be executed in a larger type.
63 Expand, // Try to expand this to other ops, otherwise use a libcall.
64 Custom // Use the LowerOperation hook to implement custom lowering.
67 enum OutOfRangeShiftAmount {
68 Undefined, // Oversized shift amounts are undefined (default).
69 Mask, // Shift amounts are auto masked (anded) to value size.
70 Extend // Oversized shift pulls in zeros or sign bits.
73 enum SetCCResultValue {
74 UndefinedSetCCResult, // SetCC returns a garbage/unknown extend.
75 ZeroOrOneSetCCResult, // SetCC returns a zero extended result.
76 ZeroOrNegativeOneSetCCResult // SetCC returns a sign extended result.
79 enum SchedPreference {
80 SchedulingForLatency, // Scheduling for shortest total latency.
81 SchedulingForRegPressure // Scheduling for lowest register pressure.
84 explicit TargetLowering(TargetMachine &TM);
85 virtual ~TargetLowering();
87 TargetMachine &getTargetMachine() const { return TM; }
88 const TargetData *getTargetData() const { return TD; }
90 bool isBigEndian() const { return !IsLittleEndian; }
91 bool isLittleEndian() const { return IsLittleEndian; }
92 MVT::ValueType getPointerTy() const { return PointerTy; }
93 MVT::ValueType getShiftAmountTy() const { return ShiftAmountTy; }
94 OutOfRangeShiftAmount getShiftAmountFlavor() const {return ShiftAmtHandling; }
96 /// usesGlobalOffsetTable - Return true if this target uses a GOT for PIC
98 bool usesGlobalOffsetTable() const { return UsesGlobalOffsetTable; }
100 /// isSelectExpensive - Return true if the select operation is expensive for
102 bool isSelectExpensive() const { return SelectIsExpensive; }
104 /// isIntDivCheap() - Return true if integer divide is usually cheaper than
105 /// a sequence of several shifts, adds, and multiplies for this target.
106 bool isIntDivCheap() const { return IntDivIsCheap; }
108 /// isPow2DivCheap() - Return true if pow2 div is cheaper than a chain of
110 bool isPow2DivCheap() const { return Pow2DivIsCheap; }
112 /// getSetCCResultTy - Return the ValueType of the result of setcc operations.
114 MVT::ValueType getSetCCResultTy() const { return SetCCResultTy; }
116 /// getSetCCResultContents - For targets without boolean registers, this flag
117 /// returns information about the contents of the high-bits in the setcc
119 SetCCResultValue getSetCCResultContents() const { return SetCCResultContents;}
121 /// getSchedulingPreference - Return target scheduling preference.
122 SchedPreference getSchedulingPreference() const {
123 return SchedPreferenceInfo;
126 /// getRegClassFor - Return the register class that should be used for the
127 /// specified value type. This may only be called on legal types.
128 TargetRegisterClass *getRegClassFor(MVT::ValueType VT) const {
129 assert(VT < array_lengthof(RegClassForVT));
130 TargetRegisterClass *RC = RegClassForVT[VT];
131 assert(RC && "This value type is not natively supported!");
135 /// isTypeLegal - Return true if the target has native support for the
136 /// specified value type. This means that it has a register that directly
137 /// holds it without promotions or expansions.
138 bool isTypeLegal(MVT::ValueType VT) const {
139 assert(MVT::isExtendedVT(VT) || VT < array_lengthof(RegClassForVT));
140 return !MVT::isExtendedVT(VT) && RegClassForVT[VT] != 0;
143 class ValueTypeActionImpl {
144 /// ValueTypeActions - This is a bitvector that contains two bits for each
145 /// value type, where the two bits correspond to the LegalizeAction enum.
146 /// This can be queried with "getTypeAction(VT)".
147 uint32_t ValueTypeActions[2];
149 ValueTypeActionImpl() {
150 ValueTypeActions[0] = ValueTypeActions[1] = 0;
152 ValueTypeActionImpl(const ValueTypeActionImpl &RHS) {
153 ValueTypeActions[0] = RHS.ValueTypeActions[0];
154 ValueTypeActions[1] = RHS.ValueTypeActions[1];
157 LegalizeAction getTypeAction(MVT::ValueType VT) const {
158 if (MVT::isExtendedVT(VT)) {
159 if (MVT::isVector(VT)) return Expand;
160 if (MVT::isInteger(VT))
161 // First promote to a power-of-two size, then expand if necessary.
162 return VT == MVT::RoundIntegerType(VT) ? Expand : Promote;
163 assert(0 && "Unsupported extended type!");
165 assert(VT<4*array_lengthof(ValueTypeActions)*sizeof(ValueTypeActions[0]));
166 return (LegalizeAction)((ValueTypeActions[VT>>4] >> ((2*VT) & 31)) & 3);
168 void setTypeAction(MVT::ValueType VT, LegalizeAction Action) {
169 assert(VT<4*array_lengthof(ValueTypeActions)*sizeof(ValueTypeActions[0]));
170 ValueTypeActions[VT>>4] |= Action << ((VT*2) & 31);
174 const ValueTypeActionImpl &getValueTypeActions() const {
175 return ValueTypeActions;
178 /// getTypeAction - Return how we should legalize values of this type, either
179 /// it is already legal (return 'Legal') or we need to promote it to a larger
180 /// type (return 'Promote'), or we need to expand it into multiple registers
181 /// of smaller integer type (return 'Expand'). 'Custom' is not an option.
182 LegalizeAction getTypeAction(MVT::ValueType VT) const {
183 return ValueTypeActions.getTypeAction(VT);
186 /// getTypeToTransformTo - For types supported by the target, this is an
187 /// identity function. For types that must be promoted to larger types, this
188 /// returns the larger type to promote to. For integer types that are larger
189 /// than the largest integer register, this contains one step in the expansion
190 /// to get to the smaller register. For illegal floating point types, this
191 /// returns the integer type to transform to.
192 MVT::ValueType getTypeToTransformTo(MVT::ValueType VT) const {
193 if (!MVT::isExtendedVT(VT)) {
194 assert(VT < array_lengthof(TransformToType));
195 MVT::ValueType NVT = TransformToType[VT];
196 assert(getTypeAction(NVT) != Promote &&
197 "Promote may not follow Expand or Promote");
201 if (MVT::isVector(VT))
202 return MVT::getVectorType(MVT::getVectorElementType(VT),
203 MVT::getVectorNumElements(VT) / 2);
204 if (MVT::isInteger(VT)) {
205 MVT::ValueType NVT = MVT::RoundIntegerType(VT);
207 // Size is a power of two - expand to half the size.
208 return MVT::getIntegerType(MVT::getSizeInBits(VT) / 2);
210 // Promote to a power of two size, avoiding multi-step promotion.
211 return getTypeAction(NVT) == Promote ? getTypeToTransformTo(NVT) : NVT;
213 assert(0 && "Unsupported extended type!");
216 /// getTypeToExpandTo - For types supported by the target, this is an
217 /// identity function. For types that must be expanded (i.e. integer types
218 /// that are larger than the largest integer register or illegal floating
219 /// point types), this returns the largest legal type it will be expanded to.
220 MVT::ValueType getTypeToExpandTo(MVT::ValueType VT) const {
221 assert(!MVT::isVector(VT));
223 switch (getTypeAction(VT)) {
227 VT = getTypeToTransformTo(VT);
230 assert(false && "Type is not legal nor is it to be expanded!");
237 /// getVectorTypeBreakdown - Vector types are broken down into some number of
238 /// legal first class types. For example, MVT::v8f32 maps to 2 MVT::v4f32
239 /// with Altivec or SSE1, or 8 promoted MVT::f64 values with the X86 FP stack.
240 /// Similarly, MVT::v2i64 turns into 4 MVT::i32 values with both PPC and X86.
242 /// This method returns the number of registers needed, and the VT for each
243 /// register. It also returns the VT and quantity of the intermediate values
244 /// before they are promoted/expanded.
246 unsigned getVectorTypeBreakdown(MVT::ValueType VT,
247 MVT::ValueType &IntermediateVT,
248 unsigned &NumIntermediates,
249 MVT::ValueType &RegisterVT) const;
251 typedef std::vector<APFloat>::const_iterator legal_fpimm_iterator;
252 legal_fpimm_iterator legal_fpimm_begin() const {
253 return LegalFPImmediates.begin();
255 legal_fpimm_iterator legal_fpimm_end() const {
256 return LegalFPImmediates.end();
259 /// isShuffleMaskLegal - Targets can use this to indicate that they only
260 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
261 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
262 /// are assumed to be legal.
263 virtual bool isShuffleMaskLegal(SDOperand Mask, MVT::ValueType VT) const {
267 /// isVectorClearMaskLegal - Similar to isShuffleMaskLegal. This is
268 /// used by Targets can use this to indicate if there is a suitable
269 /// VECTOR_SHUFFLE that can be used to replace a VAND with a constant
271 virtual bool isVectorClearMaskLegal(std::vector<SDOperand> &BVOps,
273 SelectionDAG &DAG) const {
277 /// getOperationAction - Return how this operation should be treated: either
278 /// it is legal, needs to be promoted to a larger size, needs to be
279 /// expanded to some other code sequence, or the target has a custom expander
281 LegalizeAction getOperationAction(unsigned Op, MVT::ValueType VT) const {
282 if (MVT::isExtendedVT(VT)) return Expand;
283 assert(Op < array_lengthof(OpActions) &&
284 VT < sizeof(OpActions[0])*4 && "Table isn't big enough!");
285 return (LegalizeAction)((OpActions[Op] >> (2*VT)) & 3);
288 /// isOperationLegal - Return true if the specified operation is legal on this
290 bool isOperationLegal(unsigned Op, MVT::ValueType VT) const {
291 return getOperationAction(Op, VT) == Legal ||
292 getOperationAction(Op, VT) == Custom;
295 /// getLoadXAction - Return how this load with extension should be treated:
296 /// either it is legal, needs to be promoted to a larger size, needs to be
297 /// expanded to some other code sequence, or the target has a custom expander
299 LegalizeAction getLoadXAction(unsigned LType, MVT::ValueType VT) const {
300 assert(LType < array_lengthof(LoadXActions) &&
301 VT < sizeof(LoadXActions[0])*4 && "Table isn't big enough!");
302 return (LegalizeAction)((LoadXActions[LType] >> (2*VT)) & 3);
305 /// isLoadXLegal - Return true if the specified load with extension is legal
307 bool isLoadXLegal(unsigned LType, MVT::ValueType VT) const {
308 return !MVT::isExtendedVT(VT) &&
309 (getLoadXAction(LType, VT) == Legal ||
310 getLoadXAction(LType, VT) == Custom);
313 /// getTruncStoreAction - Return how this store with truncation should be
314 /// treated: either it is legal, needs to be promoted to a larger size, needs
315 /// to be expanded to some other code sequence, or the target has a custom
317 LegalizeAction getTruncStoreAction(MVT::ValueType ValVT,
318 MVT::ValueType MemVT) const {
319 assert(ValVT < array_lengthof(TruncStoreActions) &&
320 MemVT < sizeof(TruncStoreActions[0])*4 && "Table isn't big enough!");
321 return (LegalizeAction)((TruncStoreActions[ValVT] >> (2*MemVT)) & 3);
324 /// isTruncStoreLegal - Return true if the specified store with truncation is
325 /// legal on this target.
326 bool isTruncStoreLegal(MVT::ValueType ValVT, MVT::ValueType MemVT) const {
327 return !MVT::isExtendedVT(MemVT) &&
328 (getTruncStoreAction(ValVT, MemVT) == Legal ||
329 getTruncStoreAction(ValVT, MemVT) == Custom);
332 /// getIndexedLoadAction - Return how the indexed load should be treated:
333 /// either it is legal, needs to be promoted to a larger size, needs to be
334 /// expanded to some other code sequence, or the target has a custom expander
337 getIndexedLoadAction(unsigned IdxMode, MVT::ValueType VT) const {
338 assert(IdxMode < array_lengthof(IndexedModeActions[0]) &&
339 VT < sizeof(IndexedModeActions[0][0])*4 &&
340 "Table isn't big enough!");
341 return (LegalizeAction)((IndexedModeActions[0][IdxMode] >> (2*VT)) & 3);
344 /// isIndexedLoadLegal - Return true if the specified indexed load is legal
346 bool isIndexedLoadLegal(unsigned IdxMode, MVT::ValueType VT) const {
347 return getIndexedLoadAction(IdxMode, VT) == Legal ||
348 getIndexedLoadAction(IdxMode, VT) == Custom;
351 /// getIndexedStoreAction - Return how the indexed store should be treated:
352 /// either it is legal, needs to be promoted to a larger size, needs to be
353 /// expanded to some other code sequence, or the target has a custom expander
356 getIndexedStoreAction(unsigned IdxMode, MVT::ValueType VT) const {
357 assert(IdxMode < array_lengthof(IndexedModeActions[1]) &&
358 VT < sizeof(IndexedModeActions[1][0])*4 &&
359 "Table isn't big enough!");
360 return (LegalizeAction)((IndexedModeActions[1][IdxMode] >> (2*VT)) & 3);
363 /// isIndexedStoreLegal - Return true if the specified indexed load is legal
365 bool isIndexedStoreLegal(unsigned IdxMode, MVT::ValueType VT) const {
366 return getIndexedStoreAction(IdxMode, VT) == Legal ||
367 getIndexedStoreAction(IdxMode, VT) == Custom;
370 /// getConvertAction - Return how the conversion should be treated:
371 /// either it is legal, needs to be promoted to a larger size, needs to be
372 /// expanded to some other code sequence, or the target has a custom expander
375 getConvertAction(MVT::ValueType FromVT, MVT::ValueType ToVT) const {
376 assert(FromVT < array_lengthof(ConvertActions) &&
377 ToVT < sizeof(ConvertActions[0])*4 && "Table isn't big enough!");
378 return (LegalizeAction)((ConvertActions[FromVT] >> (2*ToVT)) & 3);
381 /// isConvertLegal - Return true if the specified conversion is legal
383 bool isConvertLegal(MVT::ValueType FromVT, MVT::ValueType ToVT) const {
384 return getConvertAction(FromVT, ToVT) == Legal ||
385 getConvertAction(FromVT, ToVT) == Custom;
388 /// getTypeToPromoteTo - If the action for this operation is to promote, this
389 /// method returns the ValueType to promote to.
390 MVT::ValueType getTypeToPromoteTo(unsigned Op, MVT::ValueType VT) const {
391 assert(getOperationAction(Op, VT) == Promote &&
392 "This operation isn't promoted!");
394 // See if this has an explicit type specified.
395 std::map<std::pair<unsigned, MVT::ValueType>,
396 MVT::ValueType>::const_iterator PTTI =
397 PromoteToType.find(std::make_pair(Op, VT));
398 if (PTTI != PromoteToType.end()) return PTTI->second;
400 assert((MVT::isInteger(VT) || MVT::isFloatingPoint(VT)) &&
401 "Cannot autopromote this type, add it with AddPromotedToType.");
403 MVT::ValueType NVT = VT;
405 NVT = (MVT::ValueType)(NVT+1);
406 assert(MVT::isInteger(NVT) == MVT::isInteger(VT) && NVT != MVT::isVoid &&
407 "Didn't find type to promote to!");
408 } while (!isTypeLegal(NVT) ||
409 getOperationAction(Op, NVT) == Promote);
413 /// getValueType - Return the MVT::ValueType corresponding to this LLVM type.
414 /// This is fixed by the LLVM operations except for the pointer size. If
415 /// AllowUnknown is true, this will return MVT::Other for types with no MVT
416 /// counterpart (e.g. structs), otherwise it will assert.
417 MVT::ValueType getValueType(const Type *Ty, bool AllowUnknown = false) const {
418 MVT::ValueType VT = MVT::getValueType(Ty, AllowUnknown);
419 return VT == MVT::iPTR ? PointerTy : VT;
422 /// getByValTypeAlignment - Return the desired alignment for ByVal aggregate
423 /// function arguments in the caller parameter area. This is the actual
424 /// alignment, not its logarithm.
425 virtual unsigned getByValTypeAlignment(const Type *Ty) const;
427 /// getRegisterType - Return the type of registers that this ValueType will
428 /// eventually require.
429 MVT::ValueType getRegisterType(MVT::ValueType VT) const {
430 if (!MVT::isExtendedVT(VT)) {
431 assert(VT < array_lengthof(RegisterTypeForVT));
432 return RegisterTypeForVT[VT];
434 if (MVT::isVector(VT)) {
435 MVT::ValueType VT1, RegisterVT;
436 unsigned NumIntermediates;
437 (void)getVectorTypeBreakdown(VT, VT1, NumIntermediates, RegisterVT);
440 if (MVT::isInteger(VT)) {
441 return getRegisterType(getTypeToTransformTo(VT));
443 assert(0 && "Unsupported extended type!");
446 /// getNumRegisters - Return the number of registers that this ValueType will
447 /// eventually require. This is one for any types promoted to live in larger
448 /// registers, but may be more than one for types (like i64) that are split
449 /// into pieces. For types like i140, which are first promoted then expanded,
450 /// it is the number of registers needed to hold all the bits of the original
451 /// type. For an i140 on a 32 bit machine this means 5 registers.
452 unsigned getNumRegisters(MVT::ValueType VT) const {
453 if (!MVT::isExtendedVT(VT)) {
454 assert(VT < array_lengthof(NumRegistersForVT));
455 return NumRegistersForVT[VT];
457 if (MVT::isVector(VT)) {
458 MVT::ValueType VT1, VT2;
459 unsigned NumIntermediates;
460 return getVectorTypeBreakdown(VT, VT1, NumIntermediates, VT2);
462 if (MVT::isInteger(VT)) {
463 unsigned BitWidth = MVT::getSizeInBits(VT);
464 unsigned RegWidth = MVT::getSizeInBits(getRegisterType(VT));
465 return (BitWidth + RegWidth - 1) / RegWidth;
467 assert(0 && "Unsupported extended type!");
470 /// hasTargetDAGCombine - If true, the target has custom DAG combine
471 /// transformations that it can perform for the specified node.
472 bool hasTargetDAGCombine(ISD::NodeType NT) const {
473 assert(unsigned(NT >> 3) < array_lengthof(TargetDAGCombineArray));
474 return TargetDAGCombineArray[NT >> 3] & (1 << (NT&7));
477 /// This function returns the maximum number of store operations permitted
478 /// to replace a call to llvm.memset. The value is set by the target at the
479 /// performance threshold for such a replacement.
480 /// @brief Get maximum # of store operations permitted for llvm.memset
481 unsigned getMaxStoresPerMemset() const { return maxStoresPerMemset; }
483 /// This function returns the maximum number of store operations permitted
484 /// to replace a call to llvm.memcpy. The value is set by the target at the
485 /// performance threshold for such a replacement.
486 /// @brief Get maximum # of store operations permitted for llvm.memcpy
487 unsigned getMaxStoresPerMemcpy() const { return maxStoresPerMemcpy; }
489 /// This function returns the maximum number of store operations permitted
490 /// to replace a call to llvm.memmove. The value is set by the target at the
491 /// performance threshold for such a replacement.
492 /// @brief Get maximum # of store operations permitted for llvm.memmove
493 unsigned getMaxStoresPerMemmove() const { return maxStoresPerMemmove; }
495 /// This function returns true if the target allows unaligned memory accesses.
496 /// This is used, for example, in situations where an array copy/move/set is
497 /// converted to a sequence of store operations. It's use helps to ensure that
498 /// such replacements don't generate code that causes an alignment error
499 /// (trap) on the target machine.
500 /// @brief Determine if the target supports unaligned memory accesses.
501 bool allowsUnalignedMemoryAccesses() const {
502 return allowUnalignedMemoryAccesses;
505 /// usesUnderscoreSetJmp - Determine if we should use _setjmp or setjmp
506 /// to implement llvm.setjmp.
507 bool usesUnderscoreSetJmp() const {
508 return UseUnderscoreSetJmp;
511 /// usesUnderscoreLongJmp - Determine if we should use _longjmp or longjmp
512 /// to implement llvm.longjmp.
513 bool usesUnderscoreLongJmp() const {
514 return UseUnderscoreLongJmp;
517 /// getStackPointerRegisterToSaveRestore - If a physical register, this
518 /// specifies the register that llvm.savestack/llvm.restorestack should save
520 unsigned getStackPointerRegisterToSaveRestore() const {
521 return StackPointerRegisterToSaveRestore;
524 /// getExceptionAddressRegister - If a physical register, this returns
525 /// the register that receives the exception address on entry to a landing
527 unsigned getExceptionAddressRegister() const {
528 return ExceptionPointerRegister;
531 /// getExceptionSelectorRegister - If a physical register, this returns
532 /// the register that receives the exception typeid on entry to a landing
534 unsigned getExceptionSelectorRegister() const {
535 return ExceptionSelectorRegister;
538 /// getJumpBufSize - returns the target's jmp_buf size in bytes (if never
539 /// set, the default is 200)
540 unsigned getJumpBufSize() const {
544 /// getJumpBufAlignment - returns the target's jmp_buf alignment in bytes
545 /// (if never set, the default is 0)
546 unsigned getJumpBufAlignment() const {
547 return JumpBufAlignment;
550 /// getIfCvtBlockLimit - returns the target specific if-conversion block size
551 /// limit. Any block whose size is greater should not be predicated.
552 unsigned getIfCvtBlockSizeLimit() const {
553 return IfCvtBlockSizeLimit;
556 /// getIfCvtDupBlockLimit - returns the target specific size limit for a
557 /// block to be considered for duplication. Any block whose size is greater
558 /// should not be duplicated to facilitate its predication.
559 unsigned getIfCvtDupBlockSizeLimit() const {
560 return IfCvtDupBlockSizeLimit;
563 /// getPrefLoopAlignment - return the preferred loop alignment.
565 unsigned getPrefLoopAlignment() const {
566 return PrefLoopAlignment;
569 /// getPreIndexedAddressParts - returns true by value, base pointer and
570 /// offset pointer and addressing mode by reference if the node's address
571 /// can be legally represented as pre-indexed load / store address.
572 virtual bool getPreIndexedAddressParts(SDNode *N, SDOperand &Base,
574 ISD::MemIndexedMode &AM,
579 /// getPostIndexedAddressParts - returns true by value, base pointer and
580 /// offset pointer and addressing mode by reference if this node can be
581 /// combined with a load / store to form a post-indexed load / store.
582 virtual bool getPostIndexedAddressParts(SDNode *N, SDNode *Op,
583 SDOperand &Base, SDOperand &Offset,
584 ISD::MemIndexedMode &AM,
589 /// getPICJumpTableRelocaBase - Returns relocation base for the given PIC
591 virtual SDOperand getPICJumpTableRelocBase(SDOperand Table,
592 SelectionDAG &DAG) const;
594 //===--------------------------------------------------------------------===//
595 // TargetLowering Optimization Methods
598 /// TargetLoweringOpt - A convenience struct that encapsulates a DAG, and two
599 /// SDOperands for returning information from TargetLowering to its clients
600 /// that want to combine
601 struct TargetLoweringOpt {
607 explicit TargetLoweringOpt(SelectionDAG &InDAG, bool afterLegalize)
608 : DAG(InDAG), AfterLegalize(afterLegalize) {}
610 bool CombineTo(SDOperand O, SDOperand N) {
616 /// ShrinkDemandedConstant - Check to see if the specified operand of the
617 /// specified instruction is a constant integer. If so, check to see if
618 /// there are any bits set in the constant that are not demanded. If so,
619 /// shrink the constant and return true.
620 bool ShrinkDemandedConstant(SDOperand Op, const APInt &Demanded);
623 /// SimplifyDemandedBits - Look at Op. At this point, we know that only the
624 /// DemandedMask bits of the result of Op are ever used downstream. If we can
625 /// use this information to simplify Op, create a new simplified DAG node and
626 /// return true, returning the original and new nodes in Old and New.
627 /// Otherwise, analyze the expression and return a mask of KnownOne and
628 /// KnownZero bits for the expression (used to simplify the caller).
629 /// The KnownZero/One bits may only be accurate for those bits in the
631 bool SimplifyDemandedBits(SDOperand Op, const APInt &DemandedMask,
632 APInt &KnownZero, APInt &KnownOne,
633 TargetLoweringOpt &TLO, unsigned Depth = 0) const;
635 /// computeMaskedBitsForTargetNode - Determine which of the bits specified in
636 /// Mask are known to be either zero or one and return them in the
637 /// KnownZero/KnownOne bitsets.
638 virtual void computeMaskedBitsForTargetNode(const SDOperand Op,
642 const SelectionDAG &DAG,
643 unsigned Depth = 0) const;
645 /// ComputeNumSignBitsForTargetNode - This method can be implemented by
646 /// targets that want to expose additional information about sign bits to the
648 virtual unsigned ComputeNumSignBitsForTargetNode(SDOperand Op,
649 unsigned Depth = 0) const;
651 struct DAGCombinerInfo {
652 void *DC; // The DAG Combiner object.
654 bool CalledByLegalizer;
658 DAGCombinerInfo(SelectionDAG &dag, bool bl, bool cl, void *dc)
659 : DC(dc), BeforeLegalize(bl), CalledByLegalizer(cl), DAG(dag) {}
661 bool isBeforeLegalize() const { return BeforeLegalize; }
662 bool isCalledByLegalizer() const { return CalledByLegalizer; }
664 void AddToWorklist(SDNode *N);
665 SDOperand CombineTo(SDNode *N, const std::vector<SDOperand> &To);
666 SDOperand CombineTo(SDNode *N, SDOperand Res);
667 SDOperand CombineTo(SDNode *N, SDOperand Res0, SDOperand Res1);
670 /// SimplifySetCC - Try to simplify a setcc built with the specified operands
671 /// and cc. If it is unable to simplify it, return a null SDOperand.
672 SDOperand SimplifySetCC(MVT::ValueType VT, SDOperand N0, SDOperand N1,
673 ISD::CondCode Cond, bool foldBooleans,
674 DAGCombinerInfo &DCI) const;
676 /// PerformDAGCombine - This method will be invoked for all target nodes and
677 /// for any target-independent nodes that the target has registered with
680 /// The semantics are as follows:
682 /// SDOperand.Val == 0 - No change was made
683 /// SDOperand.Val == N - N was replaced, is dead, and is already handled.
684 /// otherwise - N should be replaced by the returned Operand.
686 /// In addition, methods provided by DAGCombinerInfo may be used to perform
687 /// more complex transformations.
689 virtual SDOperand PerformDAGCombine(SDNode *N, DAGCombinerInfo &DCI) const;
691 //===--------------------------------------------------------------------===//
692 // TargetLowering Configuration Methods - These methods should be invoked by
693 // the derived class constructor to configure this object for the target.
697 /// setUsesGlobalOffsetTable - Specify that this target does or doesn't use a
698 /// GOT for PC-relative code.
699 void setUsesGlobalOffsetTable(bool V) { UsesGlobalOffsetTable = V; }
701 /// setShiftAmountType - Describe the type that should be used for shift
702 /// amounts. This type defaults to the pointer type.
703 void setShiftAmountType(MVT::ValueType VT) { ShiftAmountTy = VT; }
705 /// setSetCCResultType - Describe the type that shoudl be used as the result
706 /// of a setcc operation. This defaults to the pointer type.
707 void setSetCCResultType(MVT::ValueType VT) { SetCCResultTy = VT; }
709 /// setSetCCResultContents - Specify how the target extends the result of a
710 /// setcc operation in a register.
711 void setSetCCResultContents(SetCCResultValue Ty) { SetCCResultContents = Ty; }
713 /// setSchedulingPreference - Specify the target scheduling preference.
714 void setSchedulingPreference(SchedPreference Pref) {
715 SchedPreferenceInfo = Pref;
718 /// setShiftAmountFlavor - Describe how the target handles out of range shift
720 void setShiftAmountFlavor(OutOfRangeShiftAmount OORSA) {
721 ShiftAmtHandling = OORSA;
724 /// setUseUnderscoreSetJmp - Indicate whether this target prefers to
725 /// use _setjmp to implement llvm.setjmp or the non _ version.
726 /// Defaults to false.
727 void setUseUnderscoreSetJmp(bool Val) {
728 UseUnderscoreSetJmp = Val;
731 /// setUseUnderscoreLongJmp - Indicate whether this target prefers to
732 /// use _longjmp to implement llvm.longjmp or the non _ version.
733 /// Defaults to false.
734 void setUseUnderscoreLongJmp(bool Val) {
735 UseUnderscoreLongJmp = Val;
738 /// setStackPointerRegisterToSaveRestore - If set to a physical register, this
739 /// specifies the register that llvm.savestack/llvm.restorestack should save
741 void setStackPointerRegisterToSaveRestore(unsigned R) {
742 StackPointerRegisterToSaveRestore = R;
745 /// setExceptionPointerRegister - If set to a physical register, this sets
746 /// the register that receives the exception address on entry to a landing
748 void setExceptionPointerRegister(unsigned R) {
749 ExceptionPointerRegister = R;
752 /// setExceptionSelectorRegister - If set to a physical register, this sets
753 /// the register that receives the exception typeid on entry to a landing
755 void setExceptionSelectorRegister(unsigned R) {
756 ExceptionSelectorRegister = R;
759 /// SelectIsExpensive - Tells the code generator not to expand operations
760 /// into sequences that use the select operations if possible.
761 void setSelectIsExpensive() { SelectIsExpensive = true; }
763 /// setIntDivIsCheap - Tells the code generator that integer divide is
764 /// expensive, and if possible, should be replaced by an alternate sequence
765 /// of instructions not containing an integer divide.
766 void setIntDivIsCheap(bool isCheap = true) { IntDivIsCheap = isCheap; }
768 /// setPow2DivIsCheap - Tells the code generator that it shouldn't generate
769 /// srl/add/sra for a signed divide by power of two, and let the target handle
771 void setPow2DivIsCheap(bool isCheap = true) { Pow2DivIsCheap = isCheap; }
773 /// addRegisterClass - Add the specified register class as an available
774 /// regclass for the specified value type. This indicates the selector can
775 /// handle values of that class natively.
776 void addRegisterClass(MVT::ValueType VT, TargetRegisterClass *RC) {
777 assert(VT < array_lengthof(RegClassForVT));
778 AvailableRegClasses.push_back(std::make_pair(VT, RC));
779 RegClassForVT[VT] = RC;
782 /// computeRegisterProperties - Once all of the register classes are added,
783 /// this allows us to compute derived properties we expose.
784 void computeRegisterProperties();
786 /// setOperationAction - Indicate that the specified operation does not work
787 /// with the specified type and indicate what to do about it.
788 void setOperationAction(unsigned Op, MVT::ValueType VT,
789 LegalizeAction Action) {
790 assert(VT < sizeof(OpActions[0])*4 && Op < array_lengthof(OpActions) &&
791 "Table isn't big enough!");
792 OpActions[Op] &= ~(uint64_t(3UL) << VT*2);
793 OpActions[Op] |= (uint64_t)Action << VT*2;
796 /// setLoadXAction - Indicate that the specified load with extension does not
797 /// work with the with specified type and indicate what to do about it.
798 void setLoadXAction(unsigned ExtType, MVT::ValueType VT,
799 LegalizeAction Action) {
800 assert(VT < sizeof(LoadXActions[0])*4 &&
801 ExtType < array_lengthof(LoadXActions) &&
802 "Table isn't big enough!");
803 LoadXActions[ExtType] &= ~(uint64_t(3UL) << VT*2);
804 LoadXActions[ExtType] |= (uint64_t)Action << VT*2;
807 /// setTruncStoreAction - Indicate that the specified truncating store does
808 /// not work with the with specified type and indicate what to do about it.
809 void setTruncStoreAction(MVT::ValueType ValVT, MVT::ValueType MemVT,
810 LegalizeAction Action) {
811 assert(ValVT < array_lengthof(TruncStoreActions) &&
812 MemVT < sizeof(TruncStoreActions[0])*4 && "Table isn't big enough!");
813 TruncStoreActions[ValVT] &= ~(uint64_t(3UL) << MemVT*2);
814 TruncStoreActions[ValVT] |= (uint64_t)Action << MemVT*2;
817 /// setIndexedLoadAction - Indicate that the specified indexed load does or
818 /// does not work with the with specified type and indicate what to do abort
819 /// it. NOTE: All indexed mode loads are initialized to Expand in
820 /// TargetLowering.cpp
821 void setIndexedLoadAction(unsigned IdxMode, MVT::ValueType VT,
822 LegalizeAction Action) {
823 assert(VT < sizeof(IndexedModeActions[0])*4 && IdxMode <
824 array_lengthof(IndexedModeActions[0]) &&
825 "Table isn't big enough!");
826 IndexedModeActions[0][IdxMode] &= ~(uint64_t(3UL) << VT*2);
827 IndexedModeActions[0][IdxMode] |= (uint64_t)Action << VT*2;
830 /// setIndexedStoreAction - Indicate that the specified indexed store does or
831 /// does not work with the with specified type and indicate what to do about
832 /// it. NOTE: All indexed mode stores are initialized to Expand in
833 /// TargetLowering.cpp
834 void setIndexedStoreAction(unsigned IdxMode, MVT::ValueType VT,
835 LegalizeAction Action) {
836 assert(VT < sizeof(IndexedModeActions[1][0])*4 &&
837 IdxMode < array_lengthof(IndexedModeActions[1]) &&
838 "Table isn't big enough!");
839 IndexedModeActions[1][IdxMode] &= ~(uint64_t(3UL) << VT*2);
840 IndexedModeActions[1][IdxMode] |= (uint64_t)Action << VT*2;
843 /// setConvertAction - Indicate that the specified conversion does or does
844 /// not work with the with specified type and indicate what to do about it.
845 void setConvertAction(MVT::ValueType FromVT, MVT::ValueType ToVT,
846 LegalizeAction Action) {
847 assert(FromVT < array_lengthof(ConvertActions) &&
848 ToVT < sizeof(ConvertActions[0])*4 && "Table isn't big enough!");
849 ConvertActions[FromVT] &= ~(uint64_t(3UL) << ToVT*2);
850 ConvertActions[FromVT] |= (uint64_t)Action << ToVT*2;
853 /// AddPromotedToType - If Opc/OrigVT is specified as being promoted, the
854 /// promotion code defaults to trying a larger integer/fp until it can find
855 /// one that works. If that default is insufficient, this method can be used
856 /// by the target to override the default.
857 void AddPromotedToType(unsigned Opc, MVT::ValueType OrigVT,
858 MVT::ValueType DestVT) {
859 PromoteToType[std::make_pair(Opc, OrigVT)] = DestVT;
862 /// addLegalFPImmediate - Indicate that this target can instruction select
863 /// the specified FP immediate natively.
864 void addLegalFPImmediate(const APFloat& Imm) {
865 LegalFPImmediates.push_back(Imm);
868 /// setTargetDAGCombine - Targets should invoke this method for each target
869 /// independent node that they want to provide a custom DAG combiner for by
870 /// implementing the PerformDAGCombine virtual method.
871 void setTargetDAGCombine(ISD::NodeType NT) {
872 assert(unsigned(NT >> 3) < array_lengthof(TargetDAGCombineArray));
873 TargetDAGCombineArray[NT >> 3] |= 1 << (NT&7);
876 /// setJumpBufSize - Set the target's required jmp_buf buffer size (in
877 /// bytes); default is 200
878 void setJumpBufSize(unsigned Size) {
882 /// setJumpBufAlignment - Set the target's required jmp_buf buffer
883 /// alignment (in bytes); default is 0
884 void setJumpBufAlignment(unsigned Align) {
885 JumpBufAlignment = Align;
888 /// setIfCvtBlockSizeLimit - Set the target's if-conversion block size
889 /// limit (in number of instructions); default is 2.
890 void setIfCvtBlockSizeLimit(unsigned Limit) {
891 IfCvtBlockSizeLimit = Limit;
894 /// setIfCvtDupBlockSizeLimit - Set the target's block size limit (in number
895 /// of instructions) to be considered for code duplication during
896 /// if-conversion; default is 2.
897 void setIfCvtDupBlockSizeLimit(unsigned Limit) {
898 IfCvtDupBlockSizeLimit = Limit;
901 /// setPrefLoopAlignment - Set the target's preferred loop alignment. Default
902 /// alignment is zero, it means the target does not care about loop alignment.
903 void setPrefLoopAlignment(unsigned Align) {
904 PrefLoopAlignment = Align;
909 virtual const TargetSubtarget *getSubtarget() {
910 assert(0 && "Not Implemented");
911 return NULL; // this is here to silence compiler errors
913 //===--------------------------------------------------------------------===//
914 // Lowering methods - These methods must be implemented by targets so that
915 // the SelectionDAGLowering code knows how to lower these.
918 /// LowerArguments - This hook must be implemented to indicate how we should
919 /// lower the arguments for the specified function, into the specified DAG.
920 virtual std::vector<SDOperand>
921 LowerArguments(Function &F, SelectionDAG &DAG);
923 /// LowerCallTo - This hook lowers an abstract call to a function into an
924 /// actual call. This returns a pair of operands. The first element is the
925 /// return value for the function (if RetTy is not VoidTy). The second
926 /// element is the outgoing token chain.
927 struct ArgListEntry {
938 ArgListEntry() : isSExt(false), isZExt(false), isInReg(false),
939 isSRet(false), isNest(false), isByVal(false), Alignment(0) { }
941 typedef std::vector<ArgListEntry> ArgListTy;
942 virtual std::pair<SDOperand, SDOperand>
943 LowerCallTo(SDOperand Chain, const Type *RetTy, bool RetSExt, bool RetZExt,
944 bool isVarArg, unsigned CallingConv, bool isTailCall,
945 SDOperand Callee, ArgListTy &Args, SelectionDAG &DAG);
948 virtual SDOperand LowerMEMCPY(SDOperand Op, SelectionDAG &DAG);
949 virtual SDOperand LowerMEMCPYCall(SDOperand Chain, SDOperand Dest,
950 SDOperand Source, SDOperand Count,
952 virtual SDOperand LowerMEMCPYInline(SDOperand Chain, SDOperand Dest,
953 SDOperand Source, unsigned Size,
954 unsigned Align, SelectionDAG &DAG) {
955 assert(0 && "Not Implemented");
956 return SDOperand(); // this is here to silence compiler errors
960 /// LowerOperation - This callback is invoked for operations that are
961 /// unsupported by the target, which are registered to use 'custom' lowering,
962 /// and whose defined values are all legal.
963 /// If the target has no operations that require custom lowering, it need not
964 /// implement this. The default implementation of this aborts.
965 virtual SDOperand LowerOperation(SDOperand Op, SelectionDAG &DAG);
967 /// ExpandOperationResult - This callback is invoked for operations that are
968 /// unsupported by the target, which are registered to use 'custom' lowering,
969 /// and whose result type needs to be expanded. This must return a node whose
970 /// results precisely match the results of the input node. This typically
971 /// involves a MERGE_VALUES node and/or BUILD_PAIR.
973 /// If the target has no operations that require custom lowering, it need not
974 /// implement this. The default implementation of this aborts.
975 virtual SDNode *ExpandOperationResult(SDNode *N, SelectionDAG &DAG) {
976 assert(0 && "ExpandOperationResult not implemented for this target!");
980 /// IsEligibleForTailCallOptimization - Check whether the call is eligible for
981 /// tail call optimization. Targets which want to do tail call optimization
982 /// should override this function.
983 virtual bool IsEligibleForTailCallOptimization(SDOperand Call,
985 SelectionDAG &DAG) const {
989 /// CustomPromoteOperation - This callback is invoked for operations that are
990 /// unsupported by the target, are registered to use 'custom' lowering, and
991 /// whose type needs to be promoted.
992 virtual SDOperand CustomPromoteOperation(SDOperand Op, SelectionDAG &DAG);
994 /// getTargetNodeName() - This method returns the name of a target specific
996 virtual const char *getTargetNodeName(unsigned Opcode) const;
998 //===--------------------------------------------------------------------===//
999 // Inline Asm Support hooks
1002 enum ConstraintType {
1003 C_Register, // Constraint represents a single register.
1004 C_RegisterClass, // Constraint represents one or more registers.
1005 C_Memory, // Memory constraint.
1006 C_Other, // Something else.
1007 C_Unknown // Unsupported constraint.
1010 /// AsmOperandInfo - This contains information for each constraint that we are
1012 struct AsmOperandInfo : public InlineAsm::ConstraintInfo {
1013 /// ConstraintCode - This contains the actual string for the code, like "m".
1014 std::string ConstraintCode;
1016 /// ConstraintType - Information about the constraint code, e.g. Register,
1017 /// RegisterClass, Memory, Other, Unknown.
1018 TargetLowering::ConstraintType ConstraintType;
1020 /// CallOperandval - If this is the result output operand or a
1021 /// clobber, this is null, otherwise it is the incoming operand to the
1022 /// CallInst. This gets modified as the asm is processed.
1023 Value *CallOperandVal;
1025 /// ConstraintVT - The ValueType for the operand value.
1026 MVT::ValueType ConstraintVT;
1028 AsmOperandInfo(const InlineAsm::ConstraintInfo &info)
1029 : InlineAsm::ConstraintInfo(info),
1030 ConstraintType(TargetLowering::C_Unknown),
1031 CallOperandVal(0), ConstraintVT(MVT::Other) {
1034 /// getConstraintGenerality - Return an integer indicating how general CT is.
1035 unsigned getConstraintGenerality(TargetLowering::ConstraintType CT) {
1037 default: assert(0 && "Unknown constraint type!");
1038 case TargetLowering::C_Other:
1039 case TargetLowering::C_Unknown:
1041 case TargetLowering::C_Register:
1043 case TargetLowering::C_RegisterClass:
1045 case TargetLowering::C_Memory:
1050 /// ComputeConstraintToUse - Determines the constraint code and constraint
1052 void ComputeConstraintToUse(const TargetLowering &TLI) {
1053 assert(!Codes.empty() && "Must have at least one constraint");
1055 std::string *Current = &Codes[0];
1056 TargetLowering::ConstraintType CurType = TLI.getConstraintType(*Current);
1057 if (Codes.size() == 1) { // Single-letter constraints ('r') are very common.
1058 ConstraintCode = *Current;
1059 ConstraintType = CurType;
1061 unsigned CurGenerality = getConstraintGenerality(CurType);
1063 // If we have multiple constraints, try to pick the most general one ahead
1064 // of time. This isn't a wonderful solution, but handles common cases.
1065 for (unsigned j = 1, e = Codes.size(); j != e; ++j) {
1066 TargetLowering::ConstraintType ThisType = TLI.getConstraintType(Codes[j]);
1067 unsigned ThisGenerality = getConstraintGenerality(ThisType);
1068 if (ThisGenerality > CurGenerality) {
1069 // This constraint letter is more general than the previous one,
1072 Current = &Codes[j];
1073 CurGenerality = ThisGenerality;
1077 ConstraintCode = *Current;
1078 ConstraintType = CurType;
1081 if (ConstraintCode == "X" && CallOperandVal) {
1082 if (isa<BasicBlock>(CallOperandVal) || isa<ConstantInt>(CallOperandVal))
1084 // This matches anything. Labels and constants we handle elsewhere
1085 // ('X' is the only thing that matches labels). Otherwise, try to
1086 // resolve it to something we know about by looking at the actual
1089 TLI.lowerXConstraint(ConstraintVT, s);
1092 ConstraintType = TLI.getConstraintType(ConstraintCode);
1098 /// getConstraintType - Given a constraint, return the type of constraint it
1099 /// is for this target.
1100 virtual ConstraintType getConstraintType(const std::string &Constraint) const;
1102 /// getRegClassForInlineAsmConstraint - Given a constraint letter (e.g. "r"),
1103 /// return a list of registers that can be used to satisfy the constraint.
1104 /// This should only be used for C_RegisterClass constraints.
1105 virtual std::vector<unsigned>
1106 getRegClassForInlineAsmConstraint(const std::string &Constraint,
1107 MVT::ValueType VT) const;
1109 /// getRegForInlineAsmConstraint - Given a physical register constraint (e.g.
1110 /// {edx}), return the register number and the register class for the
1113 /// Given a register class constraint, like 'r', if this corresponds directly
1114 /// to an LLVM register class, return a register of 0 and the register class
1117 /// This should only be used for C_Register constraints. On error,
1118 /// this returns a register number of 0 and a null register class pointer..
1119 virtual std::pair<unsigned, const TargetRegisterClass*>
1120 getRegForInlineAsmConstraint(const std::string &Constraint,
1121 MVT::ValueType VT) const;
1123 /// LowerXConstraint - try to replace an X constraint, which matches anything,
1124 /// with another that has more specific requirements based on the type of the
1125 /// corresponding operand.
1126 virtual void lowerXConstraint(MVT::ValueType ConstraintVT,
1127 std::string&) const;
1129 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
1130 /// vector. If it is invalid, don't add anything to Ops.
1131 virtual void LowerAsmOperandForConstraint(SDOperand Op, char ConstraintLetter,
1132 std::vector<SDOperand> &Ops,
1135 //===--------------------------------------------------------------------===//
1139 // EmitInstrWithCustomInserter - This method should be implemented by targets
1140 // that mark instructions with the 'usesCustomDAGSchedInserter' flag. These
1141 // instructions are special in various ways, which require special support to
1142 // insert. The specified MachineInstr is created but not inserted into any
1143 // basic blocks, and the scheduler passes ownership of it to this method.
1144 virtual MachineBasicBlock *EmitInstrWithCustomInserter(MachineInstr *MI,
1145 MachineBasicBlock *MBB);
1147 //===--------------------------------------------------------------------===//
1148 // Addressing mode description hooks (used by LSR etc).
1151 /// AddrMode - This represents an addressing mode of:
1152 /// BaseGV + BaseOffs + BaseReg + Scale*ScaleReg
1153 /// If BaseGV is null, there is no BaseGV.
1154 /// If BaseOffs is zero, there is no base offset.
1155 /// If HasBaseReg is false, there is no base register.
1156 /// If Scale is zero, there is no ScaleReg. Scale of 1 indicates a reg with
1160 GlobalValue *BaseGV;
1164 AddrMode() : BaseGV(0), BaseOffs(0), HasBaseReg(false), Scale(0) {}
1167 /// isLegalAddressingMode - Return true if the addressing mode represented by
1168 /// AM is legal for this target, for a load/store of the specified type.
1169 /// TODO: Handle pre/postinc as well.
1170 virtual bool isLegalAddressingMode(const AddrMode &AM, const Type *Ty) const;
1172 /// isTruncateFree - Return true if it's free to truncate a value of
1173 /// type Ty1 to type Ty2. e.g. On x86 it's free to truncate a i32 value in
1174 /// register EAX to i16 by referencing its sub-register AX.
1175 virtual bool isTruncateFree(const Type *Ty1, const Type *Ty2) const {
1179 virtual bool isTruncateFree(MVT::ValueType VT1, MVT::ValueType VT2) const {
1183 //===--------------------------------------------------------------------===//
1184 // Div utility functions
1186 SDOperand BuildSDIV(SDNode *N, SelectionDAG &DAG,
1187 std::vector<SDNode*>* Created) const;
1188 SDOperand BuildUDIV(SDNode *N, SelectionDAG &DAG,
1189 std::vector<SDNode*>* Created) const;
1192 //===--------------------------------------------------------------------===//
1193 // Runtime Library hooks
1196 /// setLibcallName - Rename the default libcall routine name for the specified
1198 void setLibcallName(RTLIB::Libcall Call, const char *Name) {
1199 LibcallRoutineNames[Call] = Name;
1202 /// getLibcallName - Get the libcall routine name for the specified libcall.
1204 const char *getLibcallName(RTLIB::Libcall Call) const {
1205 return LibcallRoutineNames[Call];
1208 /// setCmpLibcallCC - Override the default CondCode to be used to test the
1209 /// result of the comparison libcall against zero.
1210 void setCmpLibcallCC(RTLIB::Libcall Call, ISD::CondCode CC) {
1211 CmpLibcallCCs[Call] = CC;
1214 /// getCmpLibcallCC - Get the CondCode that's to be used to test the result of
1215 /// the comparison libcall against zero.
1216 ISD::CondCode getCmpLibcallCC(RTLIB::Libcall Call) const {
1217 return CmpLibcallCCs[Call];
1222 const TargetData *TD;
1224 /// IsLittleEndian - True if this is a little endian target.
1226 bool IsLittleEndian;
1228 /// PointerTy - The type to use for pointers, usually i32 or i64.
1230 MVT::ValueType PointerTy;
1232 /// UsesGlobalOffsetTable - True if this target uses a GOT for PIC codegen.
1234 bool UsesGlobalOffsetTable;
1236 /// ShiftAmountTy - The type to use for shift amounts, usually i8 or whatever
1238 MVT::ValueType ShiftAmountTy;
1240 OutOfRangeShiftAmount ShiftAmtHandling;
1242 /// SelectIsExpensive - Tells the code generator not to expand operations
1243 /// into sequences that use the select operations if possible.
1244 bool SelectIsExpensive;
1246 /// IntDivIsCheap - Tells the code generator not to expand integer divides by
1247 /// constants into a sequence of muls, adds, and shifts. This is a hack until
1248 /// a real cost model is in place. If we ever optimize for size, this will be
1249 /// set to true unconditionally.
1252 /// Pow2DivIsCheap - Tells the code generator that it shouldn't generate
1253 /// srl/add/sra for a signed divide by power of two, and let the target handle
1255 bool Pow2DivIsCheap;
1257 /// SetCCResultTy - The type that SetCC operations use. This defaults to the
1259 MVT::ValueType SetCCResultTy;
1261 /// SetCCResultContents - Information about the contents of the high-bits in
1262 /// the result of a setcc comparison operation.
1263 SetCCResultValue SetCCResultContents;
1265 /// SchedPreferenceInfo - The target scheduling preference: shortest possible
1266 /// total cycles or lowest register usage.
1267 SchedPreference SchedPreferenceInfo;
1269 /// UseUnderscoreSetJmp - This target prefers to use _setjmp to implement
1270 /// llvm.setjmp. Defaults to false.
1271 bool UseUnderscoreSetJmp;
1273 /// UseUnderscoreLongJmp - This target prefers to use _longjmp to implement
1274 /// llvm.longjmp. Defaults to false.
1275 bool UseUnderscoreLongJmp;
1277 /// JumpBufSize - The size, in bytes, of the target's jmp_buf buffers
1278 unsigned JumpBufSize;
1280 /// JumpBufAlignment - The alignment, in bytes, of the target's jmp_buf
1282 unsigned JumpBufAlignment;
1284 /// IfCvtBlockSizeLimit - The maximum allowed size for a block to be
1286 unsigned IfCvtBlockSizeLimit;
1288 /// IfCvtDupBlockSizeLimit - The maximum allowed size for a block to be
1289 /// duplicated during if-conversion.
1290 unsigned IfCvtDupBlockSizeLimit;
1292 /// PrefLoopAlignment - The perferred loop alignment.
1294 unsigned PrefLoopAlignment;
1296 /// StackPointerRegisterToSaveRestore - If set to a physical register, this
1297 /// specifies the register that llvm.savestack/llvm.restorestack should save
1299 unsigned StackPointerRegisterToSaveRestore;
1301 /// ExceptionPointerRegister - If set to a physical register, this specifies
1302 /// the register that receives the exception address on entry to a landing
1304 unsigned ExceptionPointerRegister;
1306 /// ExceptionSelectorRegister - If set to a physical register, this specifies
1307 /// the register that receives the exception typeid on entry to a landing
1309 unsigned ExceptionSelectorRegister;
1311 /// RegClassForVT - This indicates the default register class to use for
1312 /// each ValueType the target supports natively.
1313 TargetRegisterClass *RegClassForVT[MVT::LAST_VALUETYPE];
1314 unsigned char NumRegistersForVT[MVT::LAST_VALUETYPE];
1315 MVT::ValueType RegisterTypeForVT[MVT::LAST_VALUETYPE];
1317 /// TransformToType - For any value types we are promoting or expanding, this
1318 /// contains the value type that we are changing to. For Expanded types, this
1319 /// contains one step of the expand (e.g. i64 -> i32), even if there are
1320 /// multiple steps required (e.g. i64 -> i16). For types natively supported
1321 /// by the system, this holds the same type (e.g. i32 -> i32).
1322 MVT::ValueType TransformToType[MVT::LAST_VALUETYPE];
1324 /// OpActions - For each operation and each value type, keep a LegalizeAction
1325 /// that indicates how instruction selection should deal with the operation.
1326 /// Most operations are Legal (aka, supported natively by the target), but
1327 /// operations that are not should be described. Note that operations on
1328 /// non-legal value types are not described here.
1329 uint64_t OpActions[156];
1331 /// LoadXActions - For each load of load extension type and each value type,
1332 /// keep a LegalizeAction that indicates how instruction selection should deal
1334 uint64_t LoadXActions[ISD::LAST_LOADX_TYPE];
1336 /// TruncStoreActions - For each truncating store, keep a LegalizeAction that
1337 /// indicates how instruction selection should deal with the store.
1338 uint64_t TruncStoreActions[MVT::LAST_VALUETYPE];
1340 /// IndexedModeActions - For each indexed mode and each value type, keep a
1341 /// pair of LegalizeAction that indicates how instruction selection should
1342 /// deal with the load / store.
1343 uint64_t IndexedModeActions[2][ISD::LAST_INDEXED_MODE];
1345 /// ConvertActions - For each conversion from source type to destination type,
1346 /// keep a LegalizeAction that indicates how instruction selection should
1347 /// deal with the conversion.
1348 /// Currently, this is used only for floating->floating conversions
1349 /// (FP_EXTEND and FP_ROUND).
1350 uint64_t ConvertActions[MVT::LAST_VALUETYPE];
1352 ValueTypeActionImpl ValueTypeActions;
1354 std::vector<APFloat> LegalFPImmediates;
1356 std::vector<std::pair<MVT::ValueType,
1357 TargetRegisterClass*> > AvailableRegClasses;
1359 /// TargetDAGCombineArray - Targets can specify ISD nodes that they would
1360 /// like PerformDAGCombine callbacks for by calling setTargetDAGCombine(),
1361 /// which sets a bit in this array.
1362 unsigned char TargetDAGCombineArray[160/(sizeof(unsigned char)*8)];
1364 /// PromoteToType - For operations that must be promoted to a specific type,
1365 /// this holds the destination type. This map should be sparse, so don't hold
1368 /// Targets add entries to this map with AddPromotedToType(..), clients access
1369 /// this with getTypeToPromoteTo(..).
1370 std::map<std::pair<unsigned, MVT::ValueType>, MVT::ValueType> PromoteToType;
1372 /// LibcallRoutineNames - Stores the name each libcall.
1374 const char *LibcallRoutineNames[RTLIB::UNKNOWN_LIBCALL];
1376 /// CmpLibcallCCs - The ISD::CondCode that should be used to test the result
1377 /// of each of the comparison libcall against zero.
1378 ISD::CondCode CmpLibcallCCs[RTLIB::UNKNOWN_LIBCALL];
1381 /// When lowering %llvm.memset this field specifies the maximum number of
1382 /// store operations that may be substituted for the call to memset. Targets
1383 /// must set this value based on the cost threshold for that target. Targets
1384 /// should assume that the memset will be done using as many of the largest
1385 /// store operations first, followed by smaller ones, if necessary, per
1386 /// alignment restrictions. For example, storing 9 bytes on a 32-bit machine
1387 /// with 16-bit alignment would result in four 2-byte stores and one 1-byte
1388 /// store. This only applies to setting a constant array of a constant size.
1389 /// @brief Specify maximum number of store instructions per memset call.
1390 unsigned maxStoresPerMemset;
1392 /// When lowering %llvm.memcpy this field specifies the maximum number of
1393 /// store operations that may be substituted for a call to memcpy. Targets
1394 /// must set this value based on the cost threshold for that target. Targets
1395 /// should assume that the memcpy will be done using as many of the largest
1396 /// store operations first, followed by smaller ones, if necessary, per
1397 /// alignment restrictions. For example, storing 7 bytes on a 32-bit machine
1398 /// with 32-bit alignment would result in one 4-byte store, a one 2-byte store
1399 /// and one 1-byte store. This only applies to copying a constant array of
1401 /// @brief Specify maximum bytes of store instructions per memcpy call.
1402 unsigned maxStoresPerMemcpy;
1404 /// When lowering %llvm.memmove this field specifies the maximum number of
1405 /// store instructions that may be substituted for a call to memmove. Targets
1406 /// must set this value based on the cost threshold for that target. Targets
1407 /// should assume that the memmove will be done using as many of the largest
1408 /// store operations first, followed by smaller ones, if necessary, per
1409 /// alignment restrictions. For example, moving 9 bytes on a 32-bit machine
1410 /// with 8-bit alignment would result in nine 1-byte stores. This only
1411 /// applies to copying a constant array of constant size.
1412 /// @brief Specify maximum bytes of store instructions per memmove call.
1413 unsigned maxStoresPerMemmove;
1415 /// This field specifies whether the target machine permits unaligned memory
1416 /// accesses. This is used, for example, to determine the size of store
1417 /// operations when copying small arrays and other similar tasks.
1418 /// @brief Indicate whether the target permits unaligned memory accesses.
1419 bool allowUnalignedMemoryAccesses;
1421 } // end llvm namespace