Blame view

Giac_maj/libtommath-0.39/bn_mp_sub_d.c 2.1 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
  #include <tommath.h>
  #ifdef BN_MP_SUB_D_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
   */
  
  /* single digit subtraction */
  int
  mp_sub_d (mp_int * a, mp_digit b, mp_int * c)
  {
    mp_digit *tmpa, *tmpc, mu;
    int       res, ix, oldused;
  
    /* grow c as required */
    if (c->alloc < a->used + 1) {
       if ((res = mp_grow(c, a->used + 1)) != MP_OKAY) {
          return res;
       }
    }
  
    /* if a is negative just do an unsigned
     * addition [with fudged signs]
     */
    if (a->sign == MP_NEG) {
       a->sign = MP_ZPOS;
       res     = mp_add_d(a, b, c);
       a->sign = c->sign = MP_NEG;
  
       /* clamp */
       mp_clamp(c);
  
       return res;
    }
  
    /* setup regs */
    oldused = c->used;
    tmpa    = a->dp;
    tmpc    = c->dp;
  
    /* if a <= b simply fix the single digit */
    if ((a->used == 1 && a->dp[0] <= b) || a->used == 0) {
       if (a->used == 1) {
          *tmpc++ = b - *tmpa;
       } else {
          *tmpc++ = b;
       }
       ix      = 1;
  
       /* negative/1digit */
       c->sign = MP_NEG;
       c->used = 1;
    } else {
       /* positive/size */
       c->sign = MP_ZPOS;
       c->used = a->used;
  
       /* subtract first digit */
       *tmpc    = *tmpa++ - b;
       mu       = *tmpc >> (sizeof(mp_digit) * CHAR_BIT - 1);
       *tmpc++ &= MP_MASK;
  
       /* handle rest of the digits */
       for (ix = 1; ix < a->used; ix++) {
          *tmpc    = *tmpa++ - mu;
          mu       = *tmpc >> (sizeof(mp_digit) * CHAR_BIT - 1);
          *tmpc++ &= MP_MASK;
       }
    }
  
    /* zero excess digits */
    while (ix++ < oldused) {
       *tmpc++ = 0;
    }
    mp_clamp(c);
    return MP_OKAY;
  }
  
  #endif
  
  /* $Source: /cvs/libtom/libtommath/bn_mp_sub_d.c,v $ */
  /* $Revision: 1.5 $ */
  /* $Date: 2006/03/31 14:18:44 $ */