crypto/srp/srp_lib.c:198: error: INTEGER_OVERFLOW_L2
  (0 - [0, max(1, `N->top`)]):unsigned64 by call to `BN_mod_exp`.
Showing all 41 steps of the trace


crypto/srp/srp_lib.c:170:1: Parameter `N->top`
168.   }
169.   
170. > BIGNUM *SRP_Calc_client_key(const BIGNUM *N, const BIGNUM *B, const BIGNUM *g,
171.                               const BIGNUM *x, const BIGNUM *a, const BIGNUM *u)
172.   {

crypto/srp/srp_lib.c:185:10: Call
183.           goto err;
184.   
185.       if (!BN_mod_exp(tmp, g, x, N, bn_ctx))
                ^
186.           goto err;
187.       if ((k = srp_Calc_k(N, g)) == NULL)

crypto/bn/bn_exp.c:89:1: Parameter `m->top`
  87.   }
  88.   
  89. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
  90.                  BN_CTX *ctx)
  91.   {

crypto/bn/bn_exp.c:134:9: Call
  132.   
  133.   #ifdef MONT_MUL_MOD
  134.       if (BN_is_odd(m)) {
                 ^
  135.   # ifdef MONT_EXP_WORD
  136.           if (a->top == 1 && !a->neg

crypto/bn/bn_lib.c:829:1: Parameter `a->top`
    827.   }
    828.   
    829. > int BN_is_odd(const BIGNUM *a)
    830.   {
    831.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_exp.c:141:19: Call
  139.               && (BN_get_flags(m, BN_FLG_CONSTTIME) == 0)) {
  140.               BN_ULONG A = a->d[0];
  141.               ret = BN_mod_exp_mont_word(r, A, p, m, ctx, NULL);
                           ^
  142.           } else
  143.   # endif

crypto/bn/bn_exp.c:1101:1: Parameter `m->top`
    1099.   }
    1100.   
    1101. > int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
    1102.                            const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    1103.   {

crypto/srp/srp_lib.c:187:14: Call
185.       if (!BN_mod_exp(tmp, g, x, N, bn_ctx))
186.           goto err;
187.       if ((k = srp_Calc_k(N, g)) == NULL)
                    ^
188.           goto err;
189.       if (!BN_mod_mul(tmp2, tmp, k, N, bn_ctx))

crypto/srp/srp_lib.c:41:1: Parameter `N->top`
  39.   }
  40.   
  41. > static BIGNUM *srp_Calc_k(const BIGNUM *N, const BIGNUM *g)
  42.   {
  43.       /* k = SHA1(N | PAD(g)) -- tls-srp draft 8 */

crypto/srp/srp_lib.c:44:12: Call
  42.   {
  43.       /* k = SHA1(N | PAD(g)) -- tls-srp draft 8 */
  44.       return srp_Calc_xy(N, g, N);
                   ^
  45.   }
  46.   

crypto/srp/srp_lib.c:19:1: Parameter `N->top`
    17.   /* calculate = SHA1(PAD(x) || PAD(y)) */
    18.   
    19. > static BIGNUM *srp_Calc_xy(const BIGNUM *x, const BIGNUM *y, const BIGNUM *N)
    20.   {
    21.       unsigned char digest[SHA_DIGEST_LENGTH];

crypto/srp/srp_lib.c:23:16: Call
    21.       unsigned char digest[SHA_DIGEST_LENGTH];
    22.       unsigned char *tmp = NULL;
    23.       int numN = BN_num_bytes(N);
                         ^
    24.       BIGNUM *res = NULL;
    25.       if (x != N && BN_ucmp(x, N) >= 0)

crypto/bn/bn_lib.c:139:9: Call
      137.       bn_check_top(a);
      138.   
      139.       if (BN_is_zero(a))
                     ^
      140.           return 0;
      141.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));

crypto/bn/bn_lib.c:814:1: Parameter `a->top`
        812.   }
        813.   
        814. > int BN_is_zero(const BIGNUM *a)
        815.   {
        816.       return a->top == 0;

crypto/srp/srp_lib.c:189:10: Call
187.       if ((k = srp_Calc_k(N, g)) == NULL)
188.           goto err;
189.       if (!BN_mod_mul(tmp2, tmp, k, N, bn_ctx))
                ^
190.           goto err;
191.       if (!BN_mod_sub(tmp, B, tmp2, N, bn_ctx))

crypto/bn/bn_mod.c:73:1: Parameter `m->top`
  71.   
  72.   /* slow but works */
  73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  74.                  BN_CTX *ctx)
  75.   {

crypto/srp/srp_lib.c:191:10: Call
189.       if (!BN_mod_mul(tmp2, tmp, k, N, bn_ctx))
190.           goto err;
191.       if (!BN_mod_sub(tmp, B, tmp2, N, bn_ctx))
                ^
192.           goto err;
193.       if (!BN_mul(tmp3, u, x, bn_ctx))

crypto/bn/bn_mod.c:50:1: Parameter `m->top`
  48.   }
  49.   
  50. > int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  51.                  BN_CTX *ctx)
  52.   {

crypto/srp/srp_lib.c:198:23: Call
196.           goto err;
197.       K = BN_new();
198.       if (K != NULL && !BN_mod_exp(K, tmp, tmp2, N, bn_ctx)) {
                             ^
199.           BN_free(K);
200.           K = NULL;

crypto/bn/bn_exp.c:89:1: Parameter `m->top`
  87.   }
  88.   
  89. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
  90.                  BN_CTX *ctx)
  91.   {

crypto/bn/bn_exp.c:134:9: Call
  132.   
  133.   #ifdef MONT_MUL_MOD
  134.       if (BN_is_odd(m)) {
                 ^
  135.   # ifdef MONT_EXP_WORD
  136.           if (a->top == 1 && !a->neg

crypto/bn/bn_lib.c:829:1: Parameter `a->top`
    827.   }
    828.   
    829. > int BN_is_odd(const BIGNUM *a)
    830.   {
    831.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_exp.c:144:19: Call
  142.           } else
  143.   # endif
  144.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                           ^
  145.       } else
  146.   #endif

crypto/bn/bn_exp.c:296:1: Parameter `m->top`
    294.   }
    295.   
    296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    298.   {

crypto/bn/bn_exp.c:310:16: Call
    308.               || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
    309.               || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
    310.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                          ^
    311.       }
    312.   

crypto/bn/bn_exp.c:747:14: Assignment
      745.           /* 2^(top*BN_BITS2) - m */
      746.           tmp.d[0] = (0 - m->d[0]) & BN_MASK2;
      747.           for (i = 1; i < top; i++)
                          ^
      748.               tmp.d[i] = (~m->d[i]) & BN_MASK2;
      749.           tmp.top = top;

crypto/bn/bn_exp.c:1046:14: Call
      1044.           for (wvalue = 0, i = bits % window; i >= 0; i--, bits--)
      1045.               wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
      1046.           if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&tmp, top, powerbuf, wvalue,
                           ^
      1047.                                               window))
      1048.               goto err;

crypto/bn/bn_exp.c:522:1: Parameter `top`
        520.   }
        521.   
        522. > static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top,
        523.                                             unsigned char *buf, int idx,
        524.                                             int window)

crypto/bn/bn_exp.c:579:5: Assignment
        577.       }
        578.   
        579.       b->top = top;
                   ^
        580.       bn_correct_top(b);
        581.       return 1;

crypto/bn/bn_exp.c:580:5: Call
        578.   
        579.       b->top = top;
        580.       bn_correct_top(b);
                   ^
        581.       return 1;
        582.   }

crypto/bn/bn_lib.c:915:1: Parameter `a->top`
          913.   }
          914.   
          915. > void bn_correct_top(BIGNUM *a)
          916.   {
          917.       BN_ULONG *ftl;

crypto/bn/bn_exp.c:1059:22: Call
      1057.               /* Scan the window, squaring the result as we go */
      1058.               for (i = 0; i < window; i++, bits--) {
      1059.                   if (!BN_mod_mul_montgomery(&tmp, &tmp, &tmp, mont, ctx))
                                   ^
      1060.                       goto err;
      1061.                   wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);

crypto/bn/bn_mont.c:26:1: Parameter `a->top`
        24.   #endif
        25.   
        26. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
        27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
        28.   {

crypto/bn/bn_mont.c:53:14: Call
        51.       bn_check_top(tmp);
        52.       if (a == b) {
        53.           if (!BN_sqr(tmp, a, ctx))
                           ^
        54.               goto err;
        55.       } else {

crypto/bn/bn_sqr.c:17:1: Parameter `a->top`
          15.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
          16.    */
          17. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
          18.   {
          19.       int max, al;

crypto/bn/bn_sqr.c:25:5: Assignment
          23.       bn_check_top(a);
          24.   
          25.       al = a->top;
                    ^
          26.       if (al <= 0) {
          27.           r->top = 0;

crypto/bn/bn_sqr.c:64:17: Call
          62.               int j, k;
          63.   
          64.               j = BN_num_bits_word((BN_ULONG)al);
                                ^
          65.               j = 1 << (j - 1);
          66.               k = j + j;

crypto/bn/bn_lib.c:89:1: <RHS trace>
87.   }
88.   
89. > int BN_num_bits_word(BN_ULONG l)
90.   {
91.       BN_ULONG x, mask;

crypto/bn/bn_lib.c:89:1: Parameter `l`
            87.   }
            88.   
            89. > int BN_num_bits_word(BN_ULONG l)
            90.   {
            91.       BN_ULONG x, mask;

crypto/bn/bn_lib.c:95:5: Assignment
            93.   
            94.   #if BN_BITS2 > 32
            95.       x = l >> 32;
                      ^
            96.       mask = (0 - x) & BN_MASK2;
            97.       mask = (0 - (mask >> (BN_BITS2 - 1)));

crypto/bn/bn_lib.c:96:5: Binary operation: (0 - [0, max(1, N->top)]):unsigned64 by call to `BN_mod_exp` 
            94.   #if BN_BITS2 > 32
            95.       x = l >> 32;
            96.       mask = (0 - x) & BN_MASK2;
                      ^
            97.       mask = (0 - (mask >> (BN_BITS2 - 1)));
            98.       bits += 32 & mask;
