crypto/rsa/rsa_chk.c:104: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mul`.
Showing all 24 steps of the trace


crypto/rsa/rsa_chk.c:86:9: Call
84.   
85.       /* p prime? */
86.       r = BN_is_prime_ex(key->p, BN_prime_checks, NULL, cb);
              ^
87.       if (r != 1) {
88.           ret = r;

crypto/bn/bn_prime.c:303:12: Call
  301.                      BN_GENCB *cb)
  302.   {
  303.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  304.   }
  305.   

crypto/bn/bn_prime.c:377:10: Call
    375.       if (mont == NULL)
    376.           goto err;
    377.       if (!BN_MONT_CTX_set(mont, A, ctx))
                    ^
    378.           goto err;
    379.   

crypto/bn/bn_mont.c:358:15: Call
      356.   
      357.       BN_CTX_start(ctx);
      358.       if ((Ri = BN_CTX_get(ctx)) == NULL)
                           ^
      359.           goto err;
      360.       R = &(mont->RR);            /* grab RR as a temp */

crypto/bn/bn_ctx.c:284:5: Call
        282.       }
        283.       /* OK, make sure the returned bignum is "zero" */
        284.       BN_zero(ret);
                   ^
        285.       ctx->used++;
        286.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:530:1: Parameter `*a->d`
          528.   }
          529.   
          530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
          531.   {
          532.       bn_check_top(a);

crypto/bn/bn_mont.c:428:14: Call
      426.           tmod.top = buf[0] != 0 ? 1 : 0;
      427.           /* Ri = R^-1 mod N */
      428.           if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL)
                          ^
      429.               goto err;
      430.           if (!BN_lshift(Ri, Ri, BN_BITS2))

crypto/bn/bn_gcd.c:226:1: Parameter `*in->d`
        224.                                           BN_CTX *ctx);
        225.   
        226. > BIGNUM *BN_mod_inverse(BIGNUM *in,
        227.                          const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
        228.   {

crypto/bn/bn_gcd.c:231:10: Call
        229.       BIGNUM *rv;
        230.       int noinv;
        231.       rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);
                        ^
        232.       if (noinv)
        233.           BNerr(BN_F_BN_MOD_INVERSE, BN_R_NO_INVERSE);

crypto/bn/bn_gcd.c:237:1: Parameter `*in->d`
          235.   }
          236.   
          237. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
          238.                              const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
          239.                              int *pnoinv)

crypto/bn/bn_gcd.c:533:18: Call
          531.           /* Y*a == 1  (mod |n|) */
          532.           if (!Y->neg && BN_ucmp(Y, n) < 0) {
          533.               if (!BN_copy(R, Y))
                                  ^
          534.                   goto err;
          535.           } else {

crypto/bn/bn_lib.c:429:1: Parameter `*a->d`
            427.   }
            428.   
            429. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
            430.   {
            431.       int i;

crypto/rsa/rsa_chk.c:104:9: Call
102.   
103.       /* n = p*q? */
104.       r = BN_mul(i, key->p, key->q, ctx);
               ^
105.       if (!r) {
106.           ret = -1;

crypto/bn/bn_mul.c:911:19: Call
  909.       BN_CTX_start(ctx);
  910.       if ((r == a) || (r == b)) {
  911.           if ((rr = BN_CTX_get(ctx)) == NULL)
                           ^
  912.               goto err;
  913.       } else

crypto/bn/bn_ctx.c:284:5: Call
    282.       }
    283.       /* OK, make sure the returned bignum is "zero" */
    284.       BN_zero(ret);
               ^
    285.       ctx->used++;
    286.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:530:1: Parameter `*a->d`
      528.   }
      529.   
      530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
      531.   {
      532.       bn_check_top(a);

crypto/bn/bn_mul.c:964:17: Call
  962.                   if (bn_wexpand(rr, k * 4) == NULL)
  963.                       goto err;
  964.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                         ^
  965.                                         j, al - j, bl - j, t->d);
  966.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:534:1: Parameter `*t`
    532.    */
    533.   /* tnX may not be negative but less than n */
    534. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
    535.                              int tna, int tnb, BN_ULONG *t)
    536.   {

crypto/bn/bn_mul.c:597:9: Call
    595.       } else {
    596.           p = &(t[n2 * 2]);
    597.           bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
                   ^
    598.           bn_mul_recursive(r, a, b, n, 0, 0, p);
    599.           i = n / 2;

crypto/bn/bn_mul.c:387:1: Parameter `*a`
      385.    */
      386.   /* dnX may not be positive, but n2/2+dnX has to be */
      387. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
      388.                         int dna, int dnb, BN_ULONG *t)
      389.   {

crypto/bn/bn_mul.c:413:9: Call
      411.       /* Else do normal multiply */
      412.       if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) {
      413.           bn_mul_normal(r, a, n2 + dna, b, n2 + dnb);
                     ^
      414.           if ((dna + dnb) < 0)
      415.               memset(&r[2 * n2 + dna + dnb], 0,

crypto/bn/bn_mul.c:1037:1: <Length trace>
1035.   }
1036.   
1037. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
1038.   {
1039.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1037:1: Parameter `*b`
        1035.   }
        1036.   
        1037. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
        1038.   {
        1039.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1072:50: Array access: Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mul` 
        1070.           if (--nb <= 0)
        1071.               return;
        1072.           rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);
                                                                 ^
        1073.           rr += 4;
        1074.           r += 4;
