crypto/rsa/rsa_ossl.c:450: error: BUFFER_OVERRUN_L3
  Offset: [31, +oo] Size: [0, 8388607] by call to `rsa_blinding_invert`.
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:542:1: Parameter `ret->top`
  540.   }
  541.   
  542. > BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
  543.   {
  544.       unsigned int i, m;

crypto/rsa/rsa_ossl.c:450:14: Call
448.   
449.       if (blinding)
450.           if (!rsa_blinding_invert(blinding, ret, unblind, ctx))
                    ^
451.               goto err;
452.   

crypto/rsa/rsa_ossl.c:325:1: Parameter `f->top`
  323.   }
  324.   
  325. > static int rsa_blinding_invert(BN_BLINDING *b, BIGNUM *f, BIGNUM *unblind,
  326.                                  BN_CTX *ctx)
  327.   {

crypto/rsa/rsa_ossl.c:336:12: Call
  334.        * to access the blinding without a lock.
  335.        */
  336.       return BN_BLINDING_invert_ex(f, unblind, b, ctx);
                    ^
  337.   }
  338.   

crypto/bn/bn_blind.c:254:1: Parameter `n->top`
    252.   }
    253.   
    254. > int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b,
    255.                             BN_CTX *ctx)
    256.   {

crypto/bn/bn_blind.c:262:15: Call
    260.   
    261.       if (r != NULL)
    262.           ret = BN_mod_mul(n, n, r, b->mod, ctx);
                         ^
    263.       else {
    264.           if (b->Ai == NULL) {

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

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

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

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

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

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

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

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

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

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

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