1*8a6a9560SDaniel Boulby//===-- int_div_impl.inc - Integer division ---------------------*- C++ -*-===// 2*8a6a9560SDaniel Boulby// 3*8a6a9560SDaniel Boulby// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4*8a6a9560SDaniel Boulby// See https://llvm.org/LICENSE.txt for license information. 5*8a6a9560SDaniel Boulby// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6*8a6a9560SDaniel Boulby// 7*8a6a9560SDaniel Boulby//===----------------------------------------------------------------------===// 8*8a6a9560SDaniel Boulby// 9*8a6a9560SDaniel Boulby// Helpers used by __udivsi3, __umodsi3, __udivdi3, and __umodsi3. 10*8a6a9560SDaniel Boulby// 11*8a6a9560SDaniel Boulby//===----------------------------------------------------------------------===// 12*8a6a9560SDaniel Boulby 13*8a6a9560SDaniel Boulby#define clz(a) (sizeof(a) == sizeof(unsigned long long) ? __builtin_clzll(a) : clzsi(a)) 14*8a6a9560SDaniel Boulby 15*8a6a9560SDaniel Boulby// Adapted from Figure 3-40 of The PowerPC Compiler Writer's Guide 16*8a6a9560SDaniel Boulbystatic __inline fixuint_t __udivXi3(fixuint_t n, fixuint_t d) { 17*8a6a9560SDaniel Boulby const unsigned N = sizeof(fixuint_t) * CHAR_BIT; 18*8a6a9560SDaniel Boulby // d == 0 cases are unspecified. 19*8a6a9560SDaniel Boulby unsigned sr = (d ? clz(d) : N) - (n ? clz(n) : N); 20*8a6a9560SDaniel Boulby // 0 <= sr <= N - 1 or sr is very large. 21*8a6a9560SDaniel Boulby if (sr > N - 1) // n < d 22*8a6a9560SDaniel Boulby return 0; 23*8a6a9560SDaniel Boulby if (sr == N - 1) // d == 1 24*8a6a9560SDaniel Boulby return n; 25*8a6a9560SDaniel Boulby ++sr; 26*8a6a9560SDaniel Boulby // 1 <= sr <= N - 1. Shifts do not trigger UB. 27*8a6a9560SDaniel Boulby fixuint_t r = n >> sr; 28*8a6a9560SDaniel Boulby n <<= N - sr; 29*8a6a9560SDaniel Boulby fixuint_t carry = 0; 30*8a6a9560SDaniel Boulby for (; sr > 0; --sr) { 31*8a6a9560SDaniel Boulby r = (r << 1) | (n >> (N - 1)); 32*8a6a9560SDaniel Boulby n = (n << 1) | carry; 33*8a6a9560SDaniel Boulby // Branch-less version of: 34*8a6a9560SDaniel Boulby // carry = 0; 35*8a6a9560SDaniel Boulby // if (r >= d) r -= d, carry = 1; 36*8a6a9560SDaniel Boulby const fixint_t s = (fixint_t)(d - r - 1) >> (N - 1); 37*8a6a9560SDaniel Boulby carry = s & 1; 38*8a6a9560SDaniel Boulby r -= d & s; 39*8a6a9560SDaniel Boulby } 40*8a6a9560SDaniel Boulby n = (n << 1) | carry; 41*8a6a9560SDaniel Boulby return n; 42*8a6a9560SDaniel Boulby} 43*8a6a9560SDaniel Boulby 44*8a6a9560SDaniel Boulby// Mostly identical to __udivXi3 but the return values are different. 45*8a6a9560SDaniel Boulbystatic __inline fixuint_t __umodXi3(fixuint_t n, fixuint_t d) { 46*8a6a9560SDaniel Boulby const unsigned N = sizeof(fixuint_t) * CHAR_BIT; 47*8a6a9560SDaniel Boulby // d == 0 cases are unspecified. 48*8a6a9560SDaniel Boulby unsigned sr = (d ? clz(d) : N) - (n ? clz(n) : N); 49*8a6a9560SDaniel Boulby // 0 <= sr <= N - 1 or sr is very large. 50*8a6a9560SDaniel Boulby if (sr > N - 1) // n < d 51*8a6a9560SDaniel Boulby return n; 52*8a6a9560SDaniel Boulby if (sr == N - 1) // d == 1 53*8a6a9560SDaniel Boulby return 0; 54*8a6a9560SDaniel Boulby ++sr; 55*8a6a9560SDaniel Boulby // 1 <= sr <= N - 1. Shifts do not trigger UB. 56*8a6a9560SDaniel Boulby fixuint_t r = n >> sr; 57*8a6a9560SDaniel Boulby n <<= N - sr; 58*8a6a9560SDaniel Boulby fixuint_t carry = 0; 59*8a6a9560SDaniel Boulby for (; sr > 0; --sr) { 60*8a6a9560SDaniel Boulby r = (r << 1) | (n >> (N - 1)); 61*8a6a9560SDaniel Boulby n = (n << 1) | carry; 62*8a6a9560SDaniel Boulby // Branch-less version of: 63*8a6a9560SDaniel Boulby // carry = 0; 64*8a6a9560SDaniel Boulby // if (r >= d) r -= d, carry = 1; 65*8a6a9560SDaniel Boulby const fixint_t s = (fixint_t)(d - r - 1) >> (N - 1); 66*8a6a9560SDaniel Boulby carry = s & 1; 67*8a6a9560SDaniel Boulby r -= d & s; 68*8a6a9560SDaniel Boulby } 69*8a6a9560SDaniel Boulby return r; 70*8a6a9560SDaniel Boulby} 71*8a6a9560SDaniel Boulby 72*8a6a9560SDaniel Boulby#ifdef COMPUTE_UDIV 73*8a6a9560SDaniel Boulbystatic __inline fixint_t __divXi3(fixint_t a, fixint_t b) { 74*8a6a9560SDaniel Boulby const int N = (int)(sizeof(fixint_t) * CHAR_BIT) - 1; 75*8a6a9560SDaniel Boulby fixint_t s_a = a >> N; // s_a = a < 0 ? -1 : 0 76*8a6a9560SDaniel Boulby fixint_t s_b = b >> N; // s_b = b < 0 ? -1 : 0 77*8a6a9560SDaniel Boulby fixuint_t a_u = (fixuint_t)(a ^ s_a) + (-s_a); // negate if s_a == -1 78*8a6a9560SDaniel Boulby fixuint_t b_u = (fixuint_t)(b ^ s_b) + (-s_b); // negate if s_b == -1 79*8a6a9560SDaniel Boulby s_a ^= s_b; // sign of quotient 80*8a6a9560SDaniel Boulby return (COMPUTE_UDIV(a_u, b_u) ^ s_a) + (-s_a); // negate if s_a == -1 81*8a6a9560SDaniel Boulby} 82*8a6a9560SDaniel Boulby#endif // COMPUTE_UDIV 83*8a6a9560SDaniel Boulby 84*8a6a9560SDaniel Boulby#ifdef ASSIGN_UMOD 85*8a6a9560SDaniel Boulbystatic __inline fixint_t __modXi3(fixint_t a, fixint_t b) { 86*8a6a9560SDaniel Boulby const int N = (int)(sizeof(fixint_t) * CHAR_BIT) - 1; 87*8a6a9560SDaniel Boulby fixint_t s = b >> N; // s = b < 0 ? -1 : 0 88*8a6a9560SDaniel Boulby fixuint_t b_u = (fixuint_t)(b ^ s) + (-s); // negate if s == -1 89*8a6a9560SDaniel Boulby s = a >> N; // s = a < 0 ? -1 : 0 90*8a6a9560SDaniel Boulby fixuint_t a_u = (fixuint_t)(a ^ s) + (-s); // negate if s == -1 91*8a6a9560SDaniel Boulby fixuint_t res; 92*8a6a9560SDaniel Boulby ASSIGN_UMOD(res, a_u, b_u); 93*8a6a9560SDaniel Boulby return (res ^ s) + (-s); // negate if s == -1 94*8a6a9560SDaniel Boulby} 95*8a6a9560SDaniel Boulby#endif // ASSIGN_UMOD 96