crypto/bn/bn_exp.c:220: error: BUFFER_OVERRUN_L3
  Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mod_mul_reciprocal`.
Showing all 21 steps of the trace


crypto/bn/bn_exp.c:203:13: Call
201.               goto err;
202.           aa->neg = 0;
203.           if (BN_RECP_CTX_set(&recp, aa, ctx) <= 0)
                   ^
204.               goto err;
205.       } else {

crypto/bn/bn_recp.c:45:1: Parameter `*recp->Nr.d`
  43.   }
  44.   
  45. > int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
  46.   {
  47.       if (!BN_copy(&(recp->N), d))

crypto/bn/bn_exp.c:220:14: Call
218.       window = BN_window_bits_for_exponent_size(bits);
219.       if (window > 1) {
220.           if (!BN_mod_mul_reciprocal(aa, val[0], val[0], &recp, ctx))
                    ^
221.               goto err;           /* 2 */
222.           j = 1 << (window - 1);

crypto/bn/bn_recp.c:55:1: Parameter `*recp->Nr.d`
  53.   }
  54.   
  55. > int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
  56.                             BN_RECP_CTX *recp, BN_CTX *ctx)
  57.   {

crypto/bn/bn_recp.c:77:11: Call
  75.           ca = x;                 /* Just do the mod */
  76.   
  77.       ret = BN_div_recp(NULL, r, ca, recp, ctx);
                  ^
  78.    err:
  79.       BN_CTX_end(ctx);

crypto/bn/bn_recp.c:84:1: Parameter `*recp->Nr.d`
    82.   }
    83.   
    84. > int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
    85.                   BN_RECP_CTX *recp, BN_CTX *ctx)
    86.   {

crypto/bn/bn_recp.c:134:10: Call
    132.       if (!BN_rshift(a, m, recp->num_bits))
    133.           goto err;
    134.       if (!BN_mul(b, a, &(recp->Nr), ctx))
                    ^
    135.           goto err;
    136.       if (!BN_rshift(d, b, i - recp->num_bits))

crypto/bn/bn_mul.c:497:1: Parameter `*b->d`
      495.   #endif                          /* BN_RECURSION */
      496.   
      497. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
      498.   {
      499.       int ret = bn_mul_fixed_top(r, a, b, ctx);

crypto/bn/bn_mul.c:499:15: Call
      497.   int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
      498.   {
      499.       int ret = bn_mul_fixed_top(r, a, b, ctx);
                           ^
      500.   
      501.       bn_correct_top(r);

crypto/bn/bn_mul.c:507:1: Parameter `*b->d`
        505.   }
        506.   
        507. > int bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
        508.   {
        509.       int ret = 0;

crypto/bn/bn_mul.c:587:17: Call
        585.                   if (bn_wexpand(rr, k * 4) == NULL)
        586.                       goto err;
        587.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                               ^
        588.                                         j, al - j, bl - j, t->d);
        589.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:322:1: Parameter `n`
          320.    */
          321.   /* tnX may not be negative but less than n */
          322. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
          323.                              int tna, int tnb, BN_ULONG *t)
          324.   {

crypto/bn/bn_mul.c:336:10: Call
          334.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
          335.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
          336.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
                          ^
          337.       neg = 0;
          338.       switch (c1 * 3 + c2) {

crypto/bn/bn_lib.c:720:1: Parameter `cl`
            718.    */
            719.   
            720. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
            721.   {
            722.       int n, i;

crypto/bn/bn_lib.c:737:12: Call
            735.           }
            736.       }
            737.       return bn_cmp_words(a, b, cl);
                              ^
            738.   }
            739.   

crypto/bn/bn_lib.c:693:1: <Offset trace>
691.   }
692.   
693. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
694.   {
695.       int i;

crypto/bn/bn_lib.c:693:1: Parameter `n`
              691.   }
              692.   
              693. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
              694.   {
              695.       int i;

crypto/bn/bn_lib.c:702:10: Assignment
              700.       if (aa != bb)
              701.           return ((aa > bb) ? 1 : -1);
              702.       for (i = n - 2; i >= 0; i--) {
                              ^
              703.           aa = a[i];
              704.           bb = b[i];

crypto/bn/bn_lib.c:693:1: <Length trace>
691.   }
692.   
693. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
694.   {
695.       int i;

crypto/bn/bn_lib.c:693:1: Parameter `*a`
              691.   }
              692.   
              693. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
              694.   {
              695.       int i;

crypto/bn/bn_lib.c:703:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mod_mul_reciprocal` 
              701.           return ((aa > bb) ? 1 : -1);
              702.       for (i = n - 2; i >= 0; i--) {
              703.           aa = a[i];
                                  ^
              704.           bb = b[i];
              705.           if (aa != bb)
