blob: 5d0140cc3e759d7dc9d620cb6c5bc5e7e99f8773 [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
Chandler Carruth0193b742012-06-22 21:09:15 +000021ARM_EABI_FNALIAS(uidiv, udivsi3)
Anton Korobeynikov37b97d12011-04-19 17:51:24 +000022
Stephen Canoncd25a5f2012-06-22 14:44:13 +000023/* This function should not call __divsi3! */
Anton Korobeynikov1c5f89b2011-04-19 17:52:09 +000024COMPILER_RT_ABI su_int
Daniel Dunbarb3a69012009-06-26 16:47:03 +000025__udivsi3(su_int n, su_int d)
26{
27 const unsigned n_uword_bits = sizeof(su_int) * CHAR_BIT;
28 su_int q;
29 su_int r;
30 unsigned sr;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000031 /* special cases */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000032 if (d == 0)
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000033 return 0; /* ?! */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000034 if (n == 0)
35 return 0;
36 sr = __builtin_clz(d) - __builtin_clz(n);
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000037 /* 0 <= sr <= n_uword_bits - 1 or sr large */
38 if (sr > n_uword_bits - 1) /* d > r */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000039 return 0;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000040 if (sr == n_uword_bits - 1) /* d == 1 */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000041 return n;
42 ++sr;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000043 /* 1 <= sr <= n_uword_bits - 1 */
44 /* Not a special case */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000045 q = n << (n_uword_bits - sr);
46 r = n >> sr;
47 su_int carry = 0;
48 for (; sr > 0; --sr)
49 {
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000050 /* r:q = ((r:q) << 1) | carry */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000051 r = (r << 1) | (q >> (n_uword_bits - 1));
52 q = (q << 1) | carry;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000053 /* carry = 0;
54 * if (r.all >= d.all)
55 * {
56 * r.all -= d.all;
57 * carry = 1;
58 * }
59 */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000060 const si_int s = (si_int)(d - r - 1) >> (n_uword_bits - 1);
61 carry = s & 1;
62 r -= d & s;
63 }
64 q = (q << 1) | carry;
65 return q;
66}