HomeSort by: relevance | last modified time | path
    Searched refs:Product (Results 1 - 17 of 17) sorted by relevancy

  /src/sys/external/bsd/acpica/dist/utilities/
utstrsuppt.c 430 UINT64 Product;
435 Status = AcpiUtStrtoulMultiply64 (*AccumulatedValue, Base, &Product);
443 Status = AcpiUtStrtoulAdd64 (Product, AcpiUtAsciiCharToHex (AsciiDigit),
456 * OutProduct - Where the product is returned
458 * RETURN: Status and 64-bit product
472 UINT64 Product;
498 Product = Multiplicand * Base;
502 if ((AcpiGbl_IntegerBitWidth == 32) && (Product > ACPI_UINT32_MAX))
507 *OutProduct = Product;
utmath.c 81 * OutProduct - Pointer to where the product is returned
94 UINT64_OVERLAY Product;
104 * The Product is 64 bits, the carry is always 32 bits,
108 Product.Part.Hi, Carry32);
111 Product.Part.Lo, Carry32);
113 Product.Part.Hi += Carry32;
119 *OutProduct = Product.Full;
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
CheckedArithmetic.h 62 /// \return Optional of product if no signed overflow occurred,
70 /// Multiply A and B, and add C to the resulting product.
76 if (auto Product = checkedMul(A, B))
77 return checkedAdd(*Product, C);
91 /// \return Optional of product if no unsigned overflow occurred,
99 /// Multiply unsigned integers A and B, and add C to the resulting product.
105 if (auto Product = checkedMulUnsigned(A, B))
106 return checkedAddUnsigned(*Product, C);
MathExtras.h 861 /// the product. Clamp the result to the maximum representable value of T on
870 T Product = SaturatingMultiply(X, Y, &Overflowed);
872 return Product;
874 return SaturatingAdd(A, Product, &Overflowed);
  /src/sys/external/bsd/drm2/dist/drm/amd/powerplay/hwmgr/
ppevvmath.h 63 static fInt fMultiply (fInt, fInt); /* Returns the product of two fInt numbers */
336 fInt Product;
347 Product.full = X.full * Y.full;
348 return Product
353 Product.full = (int)tempProduct; /*The int64_t will lose the leading 16 bits that were part of the integer portion */
355 return Product;
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ImplicitNullChecks.cpp 431 // Sign of the product depends on the sign of the ImmVal, since Multiplier
433 APInt Product = ImmValC.smul_ov(MultiplierC, IsOverflow);
437 DisplacementC = Product.sadd_ov(DisplacementC, IsOverflow);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
IntegerDivision.cpp 86 // ; %product = mul i32 %divisor, %quotient
87 // ; %remainder = sub i32 %dividend, %product
89 Value *Product = Builder.CreateMul(Divisor, Quotient);
90 Value *Remainder = Builder.CreateSub(Dividend, Product);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
DependenceAnalysis.cpp 1172 const SCEV *Product = SE->getMulExpr(UpperBound, AbsCoeff);
1173 if (isKnownPredicate(CmpInst::ICMP_SGT, AbsDelta, Product)) {
1716 const SCEV *Product = SE->getMulExpr(AbsCoeff, UpperBound);
1717 if (isKnownPredicate(CmpInst::ICMP_SGT, NewDelta, Product)) {
1722 if (isKnownPredicate(CmpInst::ICMP_EQ, NewDelta, Product)) {
1825 const SCEV *Product = SE->getMulExpr(AbsCoeff, UpperBound);
1826 if (isKnownPredicate(CmpInst::ICMP_SGT, NewDelta, Product)) {
1831 if (isKnownPredicate(CmpInst::ICMP_EQ, NewDelta, Product)) {
2286 // Given a product, e.g., 10*X*Y, returns the first constant operand,
2292 else if (const auto *Product = dyn_cast<SCEVMulExpr>(Expr)
    [all...]
LoopAccessAnalysis.cpp 1385 const SCEV *Product = SE.getMulExpr(&BackedgeTakenCount, Step);
1388 const SCEV *CastedProduct = Product;
1390 uint64_t ProductTypeSize = DL.getTypeAllocSize(Product->getType());
1394 // backedgeTakenCount is non-negative, so we zero extend Product.
1396 CastedProduct = SE.getZeroExtendExpr(Product, Dist.getType());
1398 CastedDist = SE.getNoopOrSignExtend(&Dist, Product->getType());
ConstantFolding.cpp 2786 APInt Product = (C0->sextOrSelf(ExtendedWidth) *
2791 Product = APIntOps::smin(Product, Max);
2792 Product = APIntOps::smax(Product, Min);
2794 return ConstantInt::get(Ty->getContext(), Product.sextOrTrunc(Width));
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombineMulDivRem.cpp 690 static bool multiplyOverflows(const APInt &C1, const APInt &C2, APInt &Product,
693 Product = IsSigned ? C1.smul_ov(C2, Overflow) : C1.umul_ov(C2, Overflow);
745 APInt Product(C1->getBitWidth(), /*val=*/0ULL, IsSigned);
746 if (!multiplyOverflows(*C1, *C2, Product, IsSigned))
748 ConstantInt::get(Ty, Product));
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LICM.cpp 121 // instead of the cross product using AA to identify aliasing of the memory
125 cl::desc("How many instruction to cross product using AA"));
939 auto Product =
941 Product->setFastMathFlags(I.getFastMathFlags());
942 SafetyInfo->insertInstructionTo(Product, I.getParent());
943 Product->insertAfter(&I);
944 I.replaceAllUsesWith(Product);
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
MVEGatherScatterLowering.cpp 845 Instruction *Product =
847 OffsSecondOperand, "Product", InsertionPoint);
848 // Increment NewIndex by Product instead of the multiplication
850 Instruction::Add, Phi, Product, "IncrementPushedOutMul",
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/
ObjCARCOpts.cpp 307 unsigned long long Product =
309 // Overflow occurred if any of the upper bits of Product are set or if all
310 // the lower bits of Product are all set.
311 return (Product >> 32) ||
312 ((PathCount = Product) == OverflowOccurredValue);
  /src/external/gpl3/gcc.old/dist/libgcc/config/avr/
lib1funcs.S 687 ;; A[0..2]: In: Multiplicand; Out: Product
853 ;; Out: Product
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
LegalizeIntegerTypes.cpp 3422 SDValue Product = Result.getValue(0);
3430 SDValue ProdNeg = DAG.getSetCC(dl, BoolVT, Product, Zero, ISD::SETLT);
3432 Result = DAG.getSelect(dl, VT, Overflow, Result, Product);
3438 Result = DAG.getSelect(dl, VT, Overflow, SatMax, Product);
TargetLowering.cpp 8103 SDValue Product = Result.getValue(0);
8111 SDValue ProdNeg = DAG.getSetCC(dl, BoolVT, Product, Zero, ISD::SETLT);
8113 return DAG.getSelect(dl, VT, Overflow, Result, Product);
8117 SDValue Product = Result.getValue(0);
8122 return DAG.getSelect(dl, VT, Overflow, SatMax, Product);
8190 // Saturated to SatMin if wide product is negative, and SatMax if wide
8191 // product is positive ...

Completed in 87 milliseconds