33 // SystemZ cost model.
78   // There is no cost model for constants with a bit size of 0. Return TCC_Free  in getIntImmCost()
82   // No cost model for operations on integers larger than 128 bit implemented yet.  in getIntImmCost()
114   // There is no cost model for constants with a bit size of 0. Return TCC_Free  in getIntImmCostInst()
118   // No cost model for operations on integers larger than 64 bit implemented yet.  in getIntImmCostInst()
234   // There is no cost model for constants with a bit size of 0. Return TCC_Free  in getIntImmCostIntrin()
238   // No cost model for operations on integers larger than 64 bit implemented yet.  in getIntImmCostIntrin()
431   // TODO: Handle more cost kinds.  in getArithmeticInstrCost()
558     // FP128, the scalar cost is 1, and there is no overhead since the values  in getArithmeticInstrCost()
567         // Return the cost of multiple scalar invocation plus the cost of  in getArithmeticInstrCost()
572         InstructionCost Cost =  in getArithmeticInstrCost()  local
578           Cost *= 2;  in getArithmeticInstrCost()
579         return Cost;  in getArithmeticInstrCost()
592       InstructionCost Cost = (VF * LIBCALL_COST) +  in getArithmeticInstrCost()  local
596         Cost *= 2;  in getArithmeticInstrCost()
597       return Cost;  in getArithmeticInstrCost()
614     // TODO: Since fp32 is expanded, the shuffle cost should always be 0.  in getShuffleCost()
630       // Loop vectorizer calls here to figure out the extra cost of  in getShuffleCost()
668   // TODO: Since fp32 is expanded, the extract cost should always be 0.  in getVectorTruncCost()
679   unsigned Cost = 0;  in getVectorTruncCost()  local
685     Cost += NumParts;  in getVectorTruncCost()
689   // isel, which follow the cost computation above except for this case which  in getVectorTruncCost()
693     Cost--;  in getVectorTruncCost()
695   return Cost;  in getVectorTruncCost()
698 // Return the cost of converting a vector bitmask produced by a compare
716     // Extra cost for moving part of mask before unpacking.  in getVectorBitmaskConversionCost()
724 // cost for a Select / ZExt or SExt instruction.
749 // Get the cost of converting a boolean vector to a vector with same width
750 // and element size as Dst, plus the cost of zero extending if needed.
756   unsigned Cost = 0;  in getBoolVecToIntConversionCost()  local
757   // If we know what the widths of the compared operands, get any cost of  in getBoolVecToIntConversionCost()
761     Cost = getVectorBitmaskConversionCost(CmpOpTy, Dst);  in getBoolVecToIntConversionCost()
764     Cost += getNumVectorRegs(Dst);  in getBoolVecToIntConversionCost()
765   return Cost;  in getBoolVecToIntConversionCost()
773   // FIXME: Can the logic below also be used for these cost kinds?  in getCastInstrCost()
808         unsigned Cost = 0;  in getCastInstrCost()  local
810           Cost = (DstScalarBits < 64 ? 3 : 4);  in getCastInstrCost()
812           Cost = 3;  in getCastInstrCost()
816           Cost++;  in getCastInstrCost()
817         return Cost;  in getCastInstrCost()
898       // Return the cost of multiple scalar invocation plus the cost of  in getCastInstrCost()
974       // Test. The load is then not foldable, so return 0 cost for the ICmp.  in getCmpSelInstrCost()
983       unsigned Cost = 1;  in getCmpSelInstrCost()  local
985         Cost += (I != nullptr ? getOperandsExtensionCost(I) : 2);  in getCmpSelInstrCost()
986       return Cost;  in getCmpSelInstrCost()
1001         // Some predicates cost one or two extra instructions.  in getCmpSelInstrCost()
1026       unsigned Cost = (NumVecs_cmp * (CmpCostPerVector + PredicateExtraCost));  in getCmpSelInstrCost()  local
1027       return Cost;  in getCmpSelInstrCost()
1032       // We can figure out the extra cost of packing / unpacking if the  in getCmpSelInstrCost()
1057     int Cost = ((getScalarSizeInBits(Val) == 1) ? 2 /*+test-under-mask*/ : 1);  in getVectorInstrCost()  local
1061       Cost += 1;  in getVectorInstrCost()
1063     return Cost;  in getVectorInstrCost()
1166   // TODO: Handle other cost kinds.  in getMemoryOpCost()
1177       // UserI can't fold two loads, so in that case return 0 cost only  in getMemoryOpCost()
1215       // In case of load -> bswap -> store, return normal cost for the load.  in getMemoryOpCost()
1285   // Cost of load/store operations and the permutations needed.  in getInterleavedMemoryOpCost()
1299     // For scalar sizes >128 bits, we fall back to the generic cost estimate.  in getVectorIntrinsicInstrCost()
1310     int Cost = VectorRegsNeeded + LastVectorHandling - 1;  in getVectorIntrinsicInstrCost()  local
1311     return Cost;  in getVectorIntrinsicInstrCost()
1319   InstructionCost Cost = getVectorIntrinsicInstrCost(  in getIntrinsicInstrCost()  local
1321   if (Cost != -1)  in getIntrinsicInstrCost()
1322     return Cost;  in getIntrinsicInstrCost()