Home
last modified time | relevance | path

Searched refs:fraction (Results 1 – 18 of 18) sorted by relevance

/llvm-project-15.0.7/flang/include/flang/Evaluate/
H A Drounding-bits.h27 constexpr RoundingBits(const FRACTION &fraction, int rshift) { in RoundingBits() argument
28 if (rshift > 0 && rshift < fraction.bits + 1) { in RoundingBits()
29 guard_ = fraction.BTEST(rshift - 1); in RoundingBits()
31 if (rshift > 1 && rshift < fraction.bits + 2) { in RoundingBits()
32 round_ = fraction.BTEST(rshift - 2); in RoundingBits()
35 if (rshift >= fraction.bits + 2) { in RoundingBits()
36 sticky_ = !fraction.IsZero(); in RoundingBits()
38 auto mask{fraction.MASKR(rshift - 2)}; in RoundingBits()
39 sticky_ = !fraction.IAND(mask).IsZero(); in RoundingBits()
H A Dreal.h241 Fraction fraction{Fraction::ConvertUnsigned(absN).value};
243 isNegative, exponent, fraction.SHIFTL(-bitsLost));
245 Fraction fraction{Fraction::ConvertUnsigned(absN.SHIFTR(bitsLost)).value};
246 result.flags |= result.value.Normalize(isNegative, exponent, fraction);
320 Fraction fraction{
322 result.flags |= result.value.Normalize(isNegative, exponent, fraction);
324 Fraction fraction{
326 result.flags |= result.value.Normalize(isNegative, exponent, fraction);
412 RealFlags Normalize(bool negative, int exponent, const Fraction &fraction,
/llvm-project-15.0.7/flang/lib/Decimal/
H A Ddecimal-to-binary.cpp246 IntType fraction{value_}; in ToBinary() local
252 fraction >>= 1; in ToBinary()
263 while (fraction < topBit && expo > 1) { in ToBinary()
265 fraction = fraction * 2 + (guard >> (guardBits - 2)); in ToBinary()
287 if (fraction == mask) { in ToBinary()
290 fraction = topBit; in ToBinary()
292 ++fraction; in ToBinary()
295 if (expo == 1 && fraction < topBit) { in ToBinary()
301 fraction = 0; in ToBinary()
307 fraction &= ~topBit; in ToBinary()
[all …]
/llvm-project-15.0.7/libc/AOR_v20.02/math/test/rtest/
H A Dsemi.c620 int fraction = x[0] & 0x007fffff; in test_isnanf() local
621 if ((exponent == 0x7f800000) && (fraction != 0)) out[0] = 1; in test_isnanf()
674 int fraction = (x[0] & 0x000fffff) | x[1]; in test_fpclassify() local
676 if ((exponent == 0x00) && (fraction == 0)) out[0] = 0; in test_fpclassify()
677 else if ((exponent == 0x00) && (fraction != 0)) out[0] = 4; in test_fpclassify()
678 else if ((exponent == 0x7ff) && (fraction == 0)) out[0] = 3; in test_fpclassify()
679 else if ((exponent == 0x7ff) && (fraction != 0)) out[0] = 7; in test_fpclassify()
687 int fraction = x[0] & 0x007fffff; in test_fpclassifyf() local
689 if ((exponent == 0x000) && (fraction == 0)) out[0] = 0; in test_fpclassifyf()
691 else if ((exponent == 0xff) && (fraction == 0)) out[0] = 3; in test_fpclassifyf()
[all …]
/llvm-project-15.0.7/flang/lib/Evaluate/
H A Dreal.cpp109 Fraction fraction{GetFraction()}; in Add() local
124 auto sum{fraction.AddUnsigned(yFraction, carry)}; in Add()
125 fraction = sum.value; in Add()
128 fraction = fraction.SHIFTR(1).IBSET(fraction.bits - 1); in Add()
334 Fraction fraction{GetFraction()}; in NEAREST() local
340 auto next{fraction.AddUnsigned(one)}; in NEAREST()
352 auto sub1{fraction.SubtractSigned(one)}; in NEAREST()
494 int lshift{fraction.LEADZ()}; in Normalize()
495 if (lshift == fraction.bits /* fraction is zero */ && in Normalize()
525 if (!fraction.IsZero()) { in Normalize()
[all …]
/llvm-project-15.0.7/flang/runtime/
H A Drandom.cpp72 Int fraction{GetNextValue()}; in Generate() local
78 fraction = (fraction << rangeBits) | word; in Generate()
81 fraction >>= words * rangeBits - PREC; in Generate()
82 REAL next{std::ldexp(static_cast<REAL>(fraction), -(PREC + 1))}; in Generate()
/llvm-project-15.0.7/libclc/generic/lib/math/
H A Dsincos_helpers.cl255 // Get 2 lsb of int part and msb of fraction
258 // Scoot up 2 more bits so only fraction remains
263 // Subtract 1 if msb of fraction is 1, i.e. fraction >= 0.5
276 // Most significant part of fraction
282 // Get 24 more bits of fraction in another float, there are not long strings of zeroes here
287 // At this point, the fraction q1 + q0 is correct to at least 48 bits
288 // Now we need to multiply the fraction by pi/2
488 // Subtract 1 if fraction is >= 0.5, and update regn
496 // Multiply precise fraction by pi/2 to get radians
H A Dclc_fma.cl68 // mantissa is 24 bits => product is 48 bits, 2bits non-fraction.
/llvm-project-15.0.7/lldb/source/Plugins/Language/ObjC/
H A DCocoa.cpp854 uint64_t fraction : 52; // unsigned member
860 uint64_t fraction : 52; // unsigned member
886 decodedBits.fraction = encodedBits.fraction; in decodeTaggedTimeInterval()
/llvm-project-15.0.7/libclc/clspv/lib/math/
H A Dfma.cl79 // mantissa is 24 bits => product is 48 bits, 2bits non-fraction.
/llvm-project-15.0.7/llvm/docs/
H A DHowToUseInstrMappings.rst19 some support from the .td files for a fraction of maintenance cost.
H A DAMDGPUOperandSyntax.rst608 Only a small fraction of integer numbers may be encoded as *inline constants*.
629 Only a small fraction of floating-point numbers may be encoded as *inline constants*.
H A DHowToSetUpLLVMStyleRTTI.rst241 will end up being a tiny fraction of the code.
H A DLibFuzzer.rst758 * If a single test run takes a considerable fraction of a second (or
/llvm-project-15.0.7/mlir/include/mlir/Dialect/X86Vector/
H A DX86Vector.td129 Round packed floating-point elements in `a` to the number of fraction bits
/llvm-project-15.0.7/llvm/lib/Support/
H A DAPFloat.cpp3043 lostFraction fraction; in convertNormalToHexString() local
3046 fraction = lostFractionThroughTruncation (significand, partsCount, bits); in convertNormalToHexString()
3047 roundUp = roundAwayFromZero(rounding_mode, fraction, bits); in convertNormalToHexString()
/llvm-project-15.0.7/mlir/lib/Conversion/TosaToLinalg/
H A DTosaToLinalg.cpp2178 Value fraction = in matchAndRewrite() local
2205 Value diffScaled = rewriter.create<arith::MulIOp>(loc, diff, fraction); in matchAndRewrite()
/llvm-project-15.0.7/clang/docs/
H A DPCHInternals.rst108 For this small program, only a tiny fraction of the source locations, types,