crypto/rsa/rsa_ossl.c:312: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_BLINDING_convert_ex`.
Showing all 22 steps of the trace


crypto/rsa/rsa_ossl.c:312:16: Call
310.            * Local blinding: store the unblinding factor in BN_BLINDING.
311.            */
312.           return BN_BLINDING_convert_ex(f, NULL, b, ctx);
                      ^
313.       else {
314.           /*

crypto/bn/bn_blind.c:221:1: Parameter `b->mod->top`
  219.   }
  220.   
  221. > int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx)
  222.   {
  223.       int ret = 1;

crypto/bn/bn_blind.c:235:15: Call
  233.           /* Fresh blinding, doesn't need updating. */
  234.           b->counter = 0;
  235.       else if (!BN_BLINDING_update(b, ctx))
                       ^
  236.           return (0);
  237.   

crypto/bn/bn_blind.c:185:1: Parameter `b->mod->top`
    183.   }
    184.   
    185. > int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx)
    186.   {
    187.       int ret = 0;

crypto/bn/bn_blind.c:203:14: Call
    201.               goto err;
    202.       } else if (!(b->flags & BN_BLINDING_NO_UPDATE)) {
    203.           if (!BN_mod_mul(b->A, b->A, b->A, b->mod, ctx))
                        ^
    204.               goto err;
    205.           if (!BN_mod_mul(b->Ai, b->Ai, b->Ai, b->mod, ctx))

crypto/bn/bn_mod.c:179:1: Parameter `m->top`
      177.   
      178.   /* slow but works */
      179. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
      180.                  BN_CTX *ctx)
      181.   {

crypto/bn/bn_mod.c:199:10: Call
      197.               goto err;
      198.       }
      199.       if (!BN_nnmod(r, t, m, ctx))
                      ^
      200.           goto err;
      201.       bn_check_top(r);

crypto/bn/bn_mod.c:119:1: Parameter `d->top`
        117.   #include "bn_lcl.h"
        118.   
        119. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
        120.   {
        121.       /*

crypto/bn/bn_mod.c:126:11: Call
        124.        */
        125.   
        126.       if (!(BN_mod(r, m, d, ctx)))
                         ^
        127.           return 0;
        128.       if (!r->neg)

crypto/bn/bn_div.c:254:31: Call
          252.   
          253.       /* First we normalise the numbers */
          254.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                               ^
          255.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
          256.           goto err;

crypto/bn/bn_lib.c:221:9: Assignment
            219.   
            220.       if (BN_is_zero(a))
            221.           return 0;
                           ^
            222.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
            223.   }

crypto/bn/bn_div.c:254:5: Assignment
          252.   
          253.       /* First we normalise the numbers */
          254.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                     ^
          255.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
          256.           goto err;

crypto/bn/bn_div.c:255:11: Call
          253.       /* First we normalise the numbers */
          254.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
          255.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                           ^
          256.           goto err;
          257.       sdiv->neg = 0;

crypto/bn/bn_shift.c:130:1: <Offset trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `n`
            128.   }
            129.   
            130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
            131.   {
            132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:145:5: Assignment
            143.   
            144.       r->neg = a->neg;
            145.       nw = n / BN_BITS2;
                       ^
            146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
            147.           return (0);

crypto/bn/bn_shift.c:130:1: <Length trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `*r->d`
            128.   }
            129.   
            130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
            131.   {
            132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:146:9: Call
            144.       r->neg = a->neg;
            145.       nw = n / BN_BITS2;
            146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                           ^
            147.           return (0);
            148.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
              993.   }
              994.   
              995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
              996.   {
              997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:151:5: Assignment
            149.       rb = BN_BITS2 - lb;
            150.       f = a->d;
            151.       t = r->d;
                       ^
            152.       t[a->top + nw] = 0;
            153.       if (lb == 0)

crypto/bn/bn_shift.c:159:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_BLINDING_convert_ex` 
            157.           for (i = a->top - 1; i >= 0; i--) {
            158.               l = f[i];
            159.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                               ^
            160.               t[nw + i] = (l << lb) & BN_MASK2;
            161.           }
