blob: 8a5695d2024840e0ff59523bc47c4fb47e6d323f [file] [log] [blame]
Edward O'Callaghan37a6a452009-08-07 20:30:09 +00001/* ===-- udivsi3.c - Implement __udivsi3 -----------------------------------===
2 *
3 * The LLVM Compiler Infrastructure
4 *
Howard Hinnant9ad441f2010-11-16 22:13:33 +00005 * This file is dual licensed under the MIT and the University of Illinois Open
6 * Source Licenses. See LICENSE.TXT for details.
Edward O'Callaghan37a6a452009-08-07 20:30:09 +00007 *
8 * ===----------------------------------------------------------------------===
9 *
10 * This file implements __udivsi3 for the compiler_rt library.
11 *
12 * ===----------------------------------------------------------------------===
13 */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000014
15#include "int_lib.h"
16
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000017/* Returns: a / b */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000018
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000019/* Translated from Figure 3-40 of The PowerPC Compiler Writer's Guide */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000020
Anton Korobeynikov37b97d12011-04-19 17:51:24 +000021ARM_EABI_FNALIAS(uidiv, udivsi3);
22
Daniel Dunbarb3a69012009-06-26 16:47:03 +000023su_int
24__udivsi3(su_int n, su_int d)
25{
26 const unsigned n_uword_bits = sizeof(su_int) * CHAR_BIT;
27 su_int q;
28 su_int r;
29 unsigned sr;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000030 /* special cases */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000031 if (d == 0)
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000032 return 0; /* ?! */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000033 if (n == 0)
34 return 0;
35 sr = __builtin_clz(d) - __builtin_clz(n);
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000036 /* 0 <= sr <= n_uword_bits - 1 or sr large */
37 if (sr > n_uword_bits - 1) /* d > r */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000038 return 0;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000039 if (sr == n_uword_bits - 1) /* d == 1 */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000040 return n;
41 ++sr;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000042 /* 1 <= sr <= n_uword_bits - 1 */
43 /* Not a special case */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000044 q = n << (n_uword_bits - sr);
45 r = n >> sr;
46 su_int carry = 0;
47 for (; sr > 0; --sr)
48 {
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000049 /* r:q = ((r:q) << 1) | carry */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000050 r = (r << 1) | (q >> (n_uword_bits - 1));
51 q = (q << 1) | carry;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000052 /* carry = 0;
53 * if (r.all >= d.all)
54 * {
55 * r.all -= d.all;
56 * carry = 1;
57 * }
58 */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000059 const si_int s = (si_int)(d - r - 1) >> (n_uword_bits - 1);
60 carry = s & 1;
61 r -= d & s;
62 }
63 q = (q << 1) | carry;
64 return q;
65}