crypto/rsa/rsa_ossl.c:409: error: BUFFER_OVERRUN_L3
  Offset: [31, +oo] Size: [0, 8388607] by call to `rsa_blinding_convert`.
Showing all 19 steps of the trace


crypto/rsa/rsa_ossl.c:386:9: Call
384.           goto err;
385.   
386.       if (BN_bin2bn(buf, num, f) == NULL)
               ^
387.           goto err;
388.   

crypto/bn/bn_lib.c:532:1: Parameter `ret->top`
  530.   }
  531.   
  532. > BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
  533.   {
  534.       unsigned int i, m;

crypto/rsa/rsa_ossl.c:409:14: Call
407.               goto err;
408.           }
409.           if (!rsa_blinding_convert(blinding, f, unblind, ctx))
                    ^
410.               goto err;
411.       }

crypto/rsa/rsa_ossl.c:305:1: Parameter `f->top`
  303.   }
  304.   
  305. > static int rsa_blinding_convert(BN_BLINDING *b, BIGNUM *f, BIGNUM *unblind,
  306.                                   BN_CTX *ctx)
  307.   {

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:220:1: Parameter `n->top`
    218.   }
    219.   
    220. > int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx)
    221.   {
    222.       int ret = 1;

crypto/bn/bn_blind.c:242:10: Call
    240.       }
    241.   
    242.       if (!BN_mod_mul(n, n, b->A, b->mod, ctx))
                    ^
    243.           ret = 0;
    244.   

crypto/bn/bn_mod.c:178:1: Parameter `a->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:192:14: Call
      190.           goto err;
      191.       if (a == b) {
      192.           if (!BN_sqr(t, a, ctx))
                          ^
      193.               goto err;
      194.       } else {

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

crypto/bn/bn_sqr.c:73:5: Assignment
        71.       bn_check_top(a);
        72.   
        73.       al = a->top;
                  ^
        74.       if (al <= 0) {
        75.           r->top = 0;

crypto/bn/bn_sqr.c:122:17: Call
        120.                   if (bn_wexpand(tmp, max) == NULL)
        121.                       goto err;
        122.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                               ^
        123.               }
        124.           }

crypto/bn/bn_sqr.c:152:1: <Offset trace>
150.   
151.   /* tmp must have 2*n words */
152. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
153.   {
154.       int i, j, max;

crypto/bn/bn_sqr.c:152:1: Parameter `n`
          150.   
          151.   /* tmp must have 2*n words */
          152. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
          153.   {
          154.       int i, j, max;

crypto/bn/bn_sqr.c:158:5: Assignment
          156.       BN_ULONG *rp;
          157.   
          158.       max = n * 2;
                     ^
          159.       ap = a;
          160.       rp = r;

crypto/bn/bn_sqr.c:152:1: <Length trace>
150.   
151.   /* tmp must have 2*n words */
152. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
153.   {
154.       int i, j, max;

crypto/bn/bn_sqr.c:152:1: Parameter `*r`
          150.   
          151.   /* tmp must have 2*n words */
          152. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
          153.   {
          154.       int i, j, max;

crypto/bn/bn_sqr.c:160:5: Assignment
          158.       max = n * 2;
          159.       ap = a;
          160.       rp = r;
                     ^
          161.       rp[0] = rp[max - 1] = 0;
          162.       rp++;

crypto/bn/bn_sqr.c:161:13: Array access: Offset: [31, +oo] Size: [0, 8388607] by call to `rsa_blinding_convert` 
          159.       ap = a;
          160.       rp = r;
          161.       rp[0] = rp[max - 1] = 0;
                             ^
          162.       rp++;
          163.       j = n;
