Blame view

Giac_maj/libtommath-0.39/bn_mp_div_2d.c 2.29 KB
6663b6c9   adorian   projet complet av...
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
  #include <tommath.h>
  #ifdef BN_MP_DIV_2D_C
  /* LibTomMath, multiple-precision integer library -- Tom St Denis
   *
   * LibTomMath is a library that provides multiple-precision
   * integer arithmetic as well as number theoretic functionality.
   *
   * The library was designed directly after the MPI library by
   * Michael Fromberger but has been written from scratch with
   * additional optimizations in place.
   *
   * The library is free for all purposes without any express
   * guarantee it works.
   *
   * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
   */
  
  /* shift right by a certain bit count (store quotient in c, optional remainder in d) */
  int mp_div_2d (mp_int * a, int b, mp_int * c, mp_int * d)
  {
    mp_digit D, r, rr;
    int     x, res;
    mp_int  t;
    char t_used;
  
    /* if the shift count is <= 0 then we do no work */
    if (b <= 0) {
      res = mp_copy (a, c);
      if (d != NULL) {
        mp_zero (d);
      }
      return res;
    }
  
    t_used = a==d;
  
    if (t_used && (res = mp_init (&t)) != MP_OKAY) {
      return res;
    }
  
    /* get the remainder */
    if (d != NULL) {
      if ((res = mp_mod_2d (a, b, t_used?&t:d)) != MP_OKAY) {
        if (t_used) mp_clear (&t);
        return res;
      }
    }
  
    /* copy */
    if ((res = mp_copy (a, c)) != MP_OKAY) {
      if (t_used) mp_clear (&t);
      return res;
    }
  
    /* shift by as many digits in the bit count */
    if (b >= (int)DIGIT_BIT) {
      mp_rshd (c, b / DIGIT_BIT);
    }
  
    /* shift any bit count < DIGIT_BIT */
    D = (mp_digit) (b % DIGIT_BIT);
    if (D != 0) {
      register mp_digit *tmpc, mask, shift;
  
      /* mask */
      mask = (((mp_digit)1) << D) - 1;
  
      /* shift for lsb */
      shift = DIGIT_BIT - D;
  
      /* alias */
      tmpc = c->dp + (c->used - 1);
  
      /* carry */
      r = 0;
      for (x = c->used - 1; x >= 0; x--) {
        /* get the lower  bits of this word in a temp */
        rr = *tmpc & mask;
  
        /* shift the current word and mix in the carry bits from the previous word */
        *tmpc = (*tmpc >> D) | (r << shift);
        --tmpc;
  
        /* set the carry to the carry bits of the current word found above */
        r = rr;
      }
    }
    mp_clamp (c);
    if (t_used && d != NULL) {
      mp_exch (&t, d);
    }
    if (t_used) mp_clear (&t);
    return MP_OKAY;
  }
  #endif
  
  /* $Source: /cvs/libtom/libtommath/bn_mp_div_2d.c,v $ */
  /* $Revision: 1.3 $ */
  /* $Date: 2006/03/31 14:18:44 $ */