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: udivmodti4.c

//===-- udivmodti4.c - Implement __udivmodti4 -----------------------------===//
//
// 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 __udivmodti4 for the compiler_rt library.
//
//===----------------------------------------------------------------------===//

#include "int_lib.h"

#ifdef CRT_HAS_128BIT

// Returns the 128 bit division result by 64 bit. Result must fit in 64 bits.
// Remainder stored in r.
// Taken and adjusted from libdivide libdivide_128_div_64_to_64 division
// fallback. For a correctness proof see the reference for this algorithm
// in Knuth, Volume 2, section 4.3.1, Algorithm D.
UNUSED
static inline du_int udiv128by64to64default(du_int u1, du_int u0, du_int v,
                                            du_int *r) {
  const unsigned n_udword_bits = sizeof(du_int) * CHAR_BIT;
  const du_int b = (1ULL << (n_udword_bits / 2)); // Number base (32 bits)
  du_int un1, un0;                                // Norm. dividend LSD's
  du_int vn1, vn0;                                // Norm. divisor digits
  du_int q1, q0;                                  // Quotient digits
  du_int un64, un21, un10;                        // Dividend digit pairs
  du_int rhat;                                    // A remainder
  si_int s;                                       // Shift amount for normalization

s = __builtin_clzll(v);
  if (s > 0) {
    // Normalize the divisor.
    v = v << s;
    un64 = (u1 << s) | (u0 >> (n_udword_bits - s));
    un10 = u0 << s; // Shift dividend left
  } else {
    // Avoid undefined behavior of (u0 >> 64).
    un64 = u1;
    un10 = u0;
  }

// Break divisor up into two 32-bit digits.
  vn1 = v >> (n_udword_bits / 2);
  vn0 = v & 0xFFFFFFFF;

// Break right half of dividend into two digits.
  un1 = un10 >> (n_udword_bits / 2);
  un0 = un10 & 0xFFFFFFFF;

// Compute the first quotient digit, q1.
  q1 = un64 / vn1;
  rhat = un64 - q1 * vn1;

// q1 has at most error 2. No more than 2 iterations.
  while (q1 >= b || q1 * vn0 > b * rhat + un1) {
    q1 = q1 - 1;
    rhat = rhat + vn1;
    if (rhat >= b)
      break;
  }

un21 = un64 * b + un1 - q1 * v;

// Compute the second quotient digit.
  q0 = un21 / vn1;
  rhat = un21 - q0 * vn1;

// q0 has at most error 2. No more than 2 iterations.
  while (q0 >= b || q0 * vn0 > b * rhat + un0) {
    q0 = q0 - 1;
    rhat = rhat + vn1;
    if (rhat >= b)
      break;
  }

*r = (un21 * b + un0 - q0 * v) >> s;
  return q1 * b + q0;
}

static inline du_int udiv128by64to64(du_int u1, du_int u0, du_int v,
                                     du_int *r) {
#if defined(__x86_64__)
  du_int result;
  __asm__("divq %[v]"
          : "=a"(result), "=d"(*r)
          : [ v ] "r"(v), "a"(u0), "d"(u1));
  return result;
#else
  return udiv128by64to64default(u1, u0, v, r);
#endif
}

// Effects: if rem != 0, *rem = a % b
// Returns: a / b

COMPILER_RT_ABI tu_int __udivmodti4(tu_int a, tu_int b, tu_int *rem) {
  const unsigned n_utword_bits = sizeof(tu_int) * CHAR_BIT;
  utwords dividend;
  dividend.all = a;
  utwords divisor;
  divisor.all = b;
  utwords quotient;
  utwords remainder;
  if (divisor.all > dividend.all) {
    if (rem)
      *rem = dividend.all;
    return 0;
  }
  // When the divisor fits in 64 bits, we can use an optimized path.
  if (divisor.s.high == 0) {
    remainder.s.high = 0;
    if (dividend.s.high < divisor.s.low) {
      // The result fits in 64 bits.
      quotient.s.low = udiv128by64to64(dividend.s.high, dividend.s.low,
                                       divisor.s.low, &remainder.s.low);
      quotient.s.high = 0;
    } else {
      // First, divide with the high part to get the remainder in dividend.s.high.
      // After that dividend.s.high < divisor.s.low.
      quotient.s.high = dividend.s.high / divisor.s.low;
      dividend.s.high = dividend.s.high % divisor.s.low;
      quotient.s.low = udiv128by64to64(dividend.s.high, dividend.s.low,
                                       divisor.s.low, &remainder.s.low);
    }
    if (rem)
      *rem = remainder.all;
    return quotient.all;
  }
  // 0 <= shift <= 63.
  si_int shift =
      __builtin_clzll(divisor.s.high) - __builtin_clzll(dividend.s.high);
  divisor.all <<= shift;
  quotient.s.high = 0;
  quotient.s.low = 0;
  for (; shift >= 0; --shift) {
    quotient.s.low <<= 1;
    // Branch free version of.
    // if (dividend.all >= divisor.all)
    // {
    //    dividend.all -= divisor.all;
    //    carry = 1;
    // }
    const ti_int s =
        (ti_int)(divisor.all - dividend.all - 1) >> (n_utword_bits - 1);
    quotient.s.low |= s & 1;
    dividend.all -= divisor.all & s;
    divisor.all >>= 1;
  }
  if (rem)
    *rem = dividend.all;
  return quotient.all;
}

#endif // CRT_HAS_128BIT

003 File Manager

Editing: udivmodti4.c

Upload File

Create Folder