File Manager

003 File Manager

Current Path: /usr/src/contrib/llvm-project/compiler-rt/lib/builtins

usr / src / contrib / llvm-project / compiler-rt / lib / builtins /

📁 ..
📄 README.txt(14.85 KB)
📁 aarch64
📄 absvdi2.c(815 B)
📄 absvsi2.c(815 B)
📄 absvti2.c(864 B)
📄 adddf3.c(859 B)
📄 addsf3.c(853 B)
📄 addtf3.c(730 B)
📄 addvdi3.c(819 B)
📄 addvsi3.c(819 B)
📄 addvti3.c(868 B)
📄 apple_versioning.c(13.1 KB)
📁 arm
📄 ashldi3.c(1.17 KB)
📄 ashlti3.c(1.15 KB)
📄 ashrdi3.c(1.27 KB)
📄 ashrti3.c(1.25 KB)
📄 assembly.h(7.11 KB)
📄 atomic.c(16.86 KB)
📄 atomic_flag_clear.c(791 B)
📄 atomic_flag_clear_explicit.c(859 B)
📄 atomic_flag_test_and_set.c(823 B)
📄 atomic_flag_test_and_set_explicit.c(898 B)
📄 atomic_signal_fence.c(761 B)
📄 atomic_thread_fence.c(761 B)
📄 bswapdi2.c(958 B)
📄 bswapsi2.c(743 B)
📄 clear_cache.c(6.13 KB)
📄 clzdi2.c(1.27 KB)
📄 clzsi2.c(1.48 KB)
📄 clzti2.c(884 B)
📄 cmpdi2.c(1.12 KB)
📄 cmpti2.c(974 B)
📄 comparedf2.c(4.29 KB)
📄 comparesf2.c(4.28 KB)
📄 comparetf2.c(3.79 KB)
📄 cpu_model.c(21.28 KB)
📄 ctzdi2.c(1.27 KB)
📄 ctzsi2.c(1.61 KB)
📄 ctzti2.c(884 B)
📄 divdc3.c(2.18 KB)
📄 divdf3.c(7.55 KB)
📄 divdi3.c(1.13 KB)
📄 divmoddi4.c(712 B)
📄 divmodsi4.c(715 B)
📄 divsc3.c(2.14 KB)
📄 divsf3.c(6.96 KB)
📄 divsi3.c(1.32 KB)
📄 divtc3.c(2.23 KB)
📄 divtf3.c(8.01 KB)
📄 divti3.c(1.18 KB)
📄 divxc3.c(2.17 KB)
📄 emutls.c(12.39 KB)
📄 enable_execute_stack.c(2.08 KB)
📄 eprintf.c(953 B)
📄 extenddftf2.c(623 B)
📄 extendhfsf2.c(946 B)
📄 extendsfdf2.c(716 B)
📄 extendsftf2.c(622 B)
📄 ffsdi2.c(900 B)
📄 ffssi2.c(776 B)
📄 ffsti2.c(969 B)
📄 fixdfdi.c(1.22 KB)
📄 fixdfsi.c(755 B)
📄 fixdfti.c(633 B)
📄 fixsfdi.c(1.22 KB)
📄 fixsfsi.c(755 B)
📄 fixsfti.c(633 B)
📄 fixtfdi.c(624 B)
📄 fixtfsi.c(624 B)
📄 fixtfti.c(624 B)
📄 fixunsdfdi.c(1.29 KB)
📄 fixunsdfsi.c(743 B)
📄 fixunsdfti.c(611 B)
📄 fixunssfdi.c(1.3 KB)
📄 fixunssfsi.c(896 B)
📄 fixunssfti.c(731 B)
📄 fixunstfdi.c(604 B)
📄 fixunstfsi.c(604 B)
📄 fixunstfti.c(604 B)
📄 fixunsxfdi.c(1.65 KB)
📄 fixunsxfsi.c(1.62 KB)
📄 fixunsxfti.c(1.41 KB)
📄 fixxfdi.c(1.75 KB)
📄 fixxfti.c(1.48 KB)
📄 floatdidf.c(3.37 KB)
📄 floatdisf.c(2.49 KB)
📄 floatditf.c(1.5 KB)
📄 floatdixf.c(1.37 KB)
📄 floatsidf.c(1.7 KB)
📄 floatsisf.c(1.89 KB)
📄 floatsitf.c(1.5 KB)
📄 floattidf.c(2.49 KB)
📄 floattisf.c(2.33 KB)
📄 floattitf.c(2.72 KB)
📄 floattixf.c(2.53 KB)
📄 floatundidf.c(3.43 KB)
📄 floatundisf.c(2.4 KB)
📄 floatunditf.c(1.27 KB)
📄 floatundixf.c(1.24 KB)
📄 floatunsidf.c(1.43 KB)
📄 floatunsisf.c(1.75 KB)
📄 floatunsitf.c(1.29 KB)
📄 floatuntidf.c(2.38 KB)
📄 floatuntisf.c(2.24 KB)
📄 floatuntitf.c(2.6 KB)
📄 floatuntixf.c(2.39 KB)
📄 fp_add_impl.inc(5.4 KB)
📄 fp_extend.h(2.36 KB)
📄 fp_extend_impl.inc(4.53 KB)
📄 fp_fixint_impl.inc(1.52 KB)
📄 fp_fixuint_impl.inc(1.42 KB)
📄 fp_lib.h(10.12 KB)
📄 fp_mode.c(812 B)
📄 fp_mode.h(824 B)
📄 fp_mul_impl.inc(4.37 KB)
📄 fp_trunc.h(2.01 KB)
📄 fp_trunc_impl.inc(5.57 KB)
📄 gcc_personality_v0.c(8.3 KB)
📁 hexagon
📁 i386
📄 int_div_impl.inc(2.19 KB)
📄 int_endianness.h(2.75 KB)
📄 int_lib.h(4.57 KB)
📄 int_math.h(3.6 KB)
📄 int_types.h(4.16 KB)
📄 int_util.c(1.95 KB)
📄 int_util.h(1.32 KB)
📄 lshrdi3.c(1.18 KB)
📄 lshrti3.c(1.17 KB)
📄 mingw_fixfloat.c(1.29 KB)
📄 moddi3.c(1004 B)
📄 modsi3.c(649 B)
📄 modti3.c(1.03 KB)
📄 muldc3.c(2.14 KB)
📄 muldf3.c(918 B)
📄 muldi3.c(1.55 KB)
📄 mulodi4.c(1.31 KB)
📄 mulosi4.c(1.31 KB)
📄 muloti4.c(1.36 KB)
📄 mulsc3.c(2.11 KB)
📄 mulsf3.c(918 B)
📄 multc3.c(2.02 KB)
📄 multf3.c(799 B)
📄 multi3.c(1.53 KB)
📄 mulvdi3.c(1.26 KB)
📄 mulvsi3.c(1.26 KB)
📄 mulvti3.c(1.31 KB)
📄 mulxc3.c(2.22 KB)
📄 negdf2.c(832 B)
📄 negdi2.c(719 B)
📄 negsf2.c(832 B)
📄 negti2.c(768 B)
📄 negvdi2.c(768 B)
📄 negvsi2.c(768 B)
📄 negvti2.c(817 B)
📄 os_version_check.c(8.07 KB)
📄 paritydi2.c(712 B)
📄 paritysi2.c(751 B)
📄 parityti2.c(761 B)
📄 popcountdi2.c(1.33 KB)
📄 popcountsi2.c(1.13 KB)
📄 popcountti2.c(1.69 KB)
📄 powidf2.c(786 B)
📄 powisf2.c(783 B)
📄 powitf2.c(888 B)
📄 powixf2.c(825 B)
📁 ppc
📁 riscv
📁 sparc64
📄 subdf3.c(917 B)
📄 subsf3.c(917 B)
📄 subtf3.c(825 B)
📄 subvdi3.c(819 B)
📄 subvsi3.c(819 B)
📄 subvti3.c(868 B)
📄 trampoline_setup.c(1.75 KB)
📄 truncdfhf2.c(715 B)
📄 truncdfsf2.c(711 B)
📄 truncsfhf2.c(940 B)
📄 trunctfdf2.c(625 B)
📄 trunctfsf2.c(624 B)
📄 ucmpdi2.c(1.13 KB)
📄 ucmpti2.c(978 B)
📄 udivdi3.c(724 B)
📄 udivmoddi4.c(5.4 KB)
📄 udivmodsi4.c(715 B)
📄 udivmodti4.c(4.87 KB)
📄 udivsi3.c(802 B)
📄 udivti3.c(699 B)
📄 umoddi3.c(724 B)
📄 umodsi3.c(724 B)
📄 umodti3.c(717 B)
📄 unwind-ehabi-helpers.h(1.86 KB)
📁 ve
📁 x86_64

Editing: divsf3.c

//===-- lib/divsf3.c - Single-precision division ------------------*- C -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// This file implements single-precision soft-float division
// with the IEEE-754 default rounding (to nearest, ties to even).
//
// For simplicity, this implementation currently flushes denormals to zero.
// It should be a fairly straightforward exercise to implement gradual
// underflow with correct rounding.
//
//===----------------------------------------------------------------------===//

#define SINGLE_PRECISION
#include "fp_lib.h"

COMPILER_RT_ABI fp_t __divsf3(fp_t a, fp_t b) {

const unsigned int aExponent = toRep(a) >> significandBits & maxExponent;
  const unsigned int bExponent = toRep(b) >> significandBits & maxExponent;
  const rep_t quotientSign = (toRep(a) ^ toRep(b)) & signBit;

rep_t aSignificand = toRep(a) & significandMask;
  rep_t bSignificand = toRep(b) & significandMask;
  int scale = 0;

// Detect if a or b is zero, denormal, infinity, or NaN.
  if (aExponent - 1U >= maxExponent - 1U ||
      bExponent - 1U >= maxExponent - 1U) {

const rep_t aAbs = toRep(a) & absMask;
    const rep_t bAbs = toRep(b) & absMask;

// NaN / anything = qNaN
    if (aAbs > infRep)
      return fromRep(toRep(a) | quietBit);
    // anything / NaN = qNaN
    if (bAbs > infRep)
      return fromRep(toRep(b) | quietBit);

if (aAbs == infRep) {
      // infinity / infinity = NaN
      if (bAbs == infRep)
        return fromRep(qnanRep);
      // infinity / anything else = +/- infinity
      else
        return fromRep(aAbs | quotientSign);
    }

// anything else / infinity = +/- 0
    if (bAbs == infRep)
      return fromRep(quotientSign);

if (!aAbs) {
      // zero / zero = NaN
      if (!bAbs)
        return fromRep(qnanRep);
      // zero / anything else = +/- zero
      else
        return fromRep(quotientSign);
    }
    // anything else / zero = +/- infinity
    if (!bAbs)
      return fromRep(infRep | quotientSign);

// One or both of a or b is denormal.  The other (if applicable) is a
    // normal number.  Renormalize one or both of a and b, and set scale to
    // include the necessary exponent adjustment.
    if (aAbs < implicitBit)
      scale += normalize(&aSignificand);
    if (bAbs < implicitBit)
      scale -= normalize(&bSignificand);
  }

// Set the implicit significand bit.  If we fell through from the
  // denormal path it was already set by normalize( ), but setting it twice
  // won't hurt anything.
  aSignificand |= implicitBit;
  bSignificand |= implicitBit;
  int quotientExponent = aExponent - bExponent + scale;
  // 0x7504F333 / 2^32 + 1 = 3/4 + 1/sqrt(2)

// Align the significand of b as a Q31 fixed-point number in the range
  // [1, 2.0) and get a Q32 approximate reciprocal using a small minimax
  // polynomial approximation: reciprocal = 3/4 + 1/sqrt(2) - b/2.  This
  // is accurate to about 3.5 binary digits.
  uint32_t q31b = bSignificand << 8;
  uint32_t reciprocal = UINT32_C(0x7504f333) - q31b;

// Now refine the reciprocal estimate using a Newton-Raphson iteration:
  //
  //     x1 = x0 * (2 - x0 * b)
  //
  // This doubles the number of correct binary digits in the approximation
  // with each iteration.
  uint32_t correction;
  correction = -((uint64_t)reciprocal * q31b >> 32);
  reciprocal = (uint64_t)reciprocal * correction >> 31;
  correction = -((uint64_t)reciprocal * q31b >> 32);
  reciprocal = (uint64_t)reciprocal * correction >> 31;
  correction = -((uint64_t)reciprocal * q31b >> 32);
  reciprocal = (uint64_t)reciprocal * correction >> 31;

// Adust the final 32-bit reciprocal estimate downward to ensure that it is
  // strictly smaller than the infinitely precise exact reciprocal.  Because
  // the computation of the Newton-Raphson step is truncating at every step,
  // this adjustment is small; most of the work is already done.
  reciprocal -= 2;

// The numerical reciprocal is accurate to within 2^-28, lies in the
  // interval [0x1.000000eep-1, 0x1.fffffffcp-1], and is strictly smaller
  // than the true reciprocal of b.  Multiplying a by this reciprocal thus
  // gives a numerical q = a/b in Q24 with the following properties:
  //
  //    1. q < a/b
  //    2. q is in the interval [0x1.000000eep-1, 0x1.fffffffcp0)
  //    3. The error in q is at most 2^-24 + 2^-27 -- the 2^24 term comes
  //       from the fact that we truncate the product, and the 2^27 term
  //       is the error in the reciprocal of b scaled by the maximum
  //       possible value of a.  As a consequence of this error bound,
  //       either q or nextafter(q) is the correctly rounded.
  rep_t quotient = (uint64_t)reciprocal * (aSignificand << 1) >> 32;

// Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
  // In either case, we are going to compute a residual of the form
  //
  //     r = a - q*b
  //
  // We know from the construction of q that r satisfies:
  //
  //     0 <= r < ulp(q)*b
  //
  // If r is greater than 1/2 ulp(q)*b, then q rounds up.  Otherwise, we
  // already have the correct result.  The exact halfway case cannot occur.
  // We also take this time to right shift quotient if it falls in the [1,2)
  // range and adjust the exponent accordingly.
  rep_t residual;
  if (quotient < (implicitBit << 1)) {
    residual = (aSignificand << 24) - quotient * bSignificand;
    quotientExponent--;
  } else {
    quotient >>= 1;
    residual = (aSignificand << 23) - quotient * bSignificand;
  }

const int writtenExponent = quotientExponent + exponentBias;

if (writtenExponent >= maxExponent) {
    // If we have overflowed the exponent, return infinity.
    return fromRep(infRep | quotientSign);
  }

else if (writtenExponent < 1) {
    if (writtenExponent == 0) {
      // Check whether the rounded result is normal.
      const bool round = (residual << 1) > bSignificand;
      // Clear the implicit bit.
      rep_t absResult = quotient & significandMask;
      // Round.
      absResult += round;
      if (absResult & ~significandMask) {
        // The rounded result is normal; return it.
        return fromRep(absResult | quotientSign);
      }
    }
    // Flush denormals to zero.  In the future, it would be nice to add
    // code to round them correctly.
    return fromRep(quotientSign);
  }

else {
    const bool round = (residual << 1) > bSignificand;
    // Clear the implicit bit.
    rep_t absResult = quotient & significandMask;
    // Insert the exponent.
    absResult |= (rep_t)writtenExponent << significandBits;
    // Round.
    absResult += round;
    // Insert the sign and return.
    return fromRep(absResult | quotientSign);
  }
}

#if defined(__ARM_EABI__)
#if defined(COMPILER_RT_ARMHF_TARGET)
AEABI_RTABI fp_t __aeabi_fdiv(fp_t a, fp_t b) { return __divsf3(a, b); }
#else
COMPILER_RT_ALIAS(__divsf3, __aeabi_fdiv)
#endif
#endif

003 File Manager

Editing: divsf3.c

Upload File

Create Folder