usbmodeswitch: Updated to v.1.2.6 from shibby's branch.
[tomato.git] / release / src / router / dropbear / libtommath / bn_mp_div_3.c
blobc6090f420f287bf3cc2e6be9c08fcc2613fd6225
1 #include <tommath.h>
2 #ifdef BN_MP_DIV_3_C
3 /* LibTomMath, multiple-precision integer library -- Tom St Denis
5 * LibTomMath is a library that provides multiple-precision
6 * integer arithmetic as well as number theoretic functionality.
8 * The library was designed directly after the MPI library by
9 * Michael Fromberger but has been written from scratch with
10 * additional optimizations in place.
12 * The library is free for all purposes without any express
13 * guarantee it works.
15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
18 /* divide by three (based on routine from MPI and the GMP manual) */
19 int
20 mp_div_3 (mp_int * a, mp_int *c, mp_digit * d)
22 mp_int q;
23 mp_word w, t;
24 mp_digit b;
25 int res, ix;
27 /* b = 2**DIGIT_BIT / 3 */
28 b = (((mp_word)1) << ((mp_word)DIGIT_BIT)) / ((mp_word)3);
30 if ((res = mp_init_size(&q, a->used)) != MP_OKAY) {
31 return res;
34 q.used = a->used;
35 q.sign = a->sign;
36 w = 0;
37 for (ix = a->used - 1; ix >= 0; ix--) {
38 w = (w << ((mp_word)DIGIT_BIT)) | ((mp_word)a->dp[ix]);
40 if (w >= 3) {
41 /* multiply w by [1/3] */
42 t = (w * ((mp_word)b)) >> ((mp_word)DIGIT_BIT);
44 /* now subtract 3 * [w/3] from w, to get the remainder */
45 w -= t+t+t;
47 /* fixup the remainder as required since
48 * the optimization is not exact.
50 while (w >= 3) {
51 t += 1;
52 w -= 3;
54 } else {
55 t = 0;
57 q.dp[ix] = (mp_digit)t;
60 /* [optional] store the remainder */
61 if (d != NULL) {
62 *d = (mp_digit)w;
65 /* [optional] store the quotient */
66 if (c != NULL) {
67 mp_clamp(&q);
68 mp_exch(&q, c);
70 mp_clear(&q);
72 return res;
75 #endif
77 /* $Source: /cvs/libtom/libtommath/bn_mp_div_3.c,v $ */
78 /* $Revision: 1.3 $ */
79 /* $Date: 2006/03/31 14:18:44 $ */