crypto/rsa/rsa_ossl.c:302: 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:302:15: Call
300.   
301.           BN_BLINDING_lock(b);
302.           ret = BN_BLINDING_convert_ex(f, unblind, b, ctx);
                     ^
303.           BN_BLINDING_unlock(b);
304.   

crypto/bn/bn_blind.c:232:1: Parameter `b->mod->top`
  230.   }
  231.   
  232. > int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx)
  233.   {
  234.       int ret = 1;

crypto/bn/bn_blind.c:246:15: Call
  244.           /* Fresh blinding, doesn't need updating. */
  245.           b->counter = 0;
  246.       else if (!BN_BLINDING_update(b, ctx))
                       ^
  247.           return (0);
  248.   

crypto/bn/bn_blind.c:196:1: Parameter `b->mod->top`
    194.   }
    195.   
    196. > int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx)
    197.   {
    198.       int ret = 0;

crypto/bn/bn_blind.c:214:14: Call
    212.               goto err;
    213.       } else if (!(b->flags & BN_BLINDING_NO_UPDATE)) {
    214.           if (!BN_mod_mul(b->A, b->A, b->A, b->mod, ctx))
                        ^
    215.               goto err;
    216.           if (!BN_mod_mul(b->Ai, b->Ai, b->Ai, b->mod, ctx))

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

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

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

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

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

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

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

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

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

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

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

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

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

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

crypto/bn/bn_lib.c:1071:1: Parameter `*a->d`
              1069.   }
              1070.   
              1071. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
              1072.   {
              1073.       return (words <= a->dmax) ? a : bn_expand2(a, words);

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

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