ssl/tls_srp.c:189: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `SRP_create_verifier_BN`.
Showing all 27 steps of the trace


ssl/tls_srp.c:184:20: Call
182.           return -1;
183.       s->srp_ctx.N = BN_dup(GN->N);
184.       s->srp_ctx.g = BN_dup(GN->g);
                          ^
185.       BN_clear_free(s->srp_ctx.v);
186.       s->srp_ctx.v = NULL;

crypto/bn/bn_lib.c:261:1: Parameter `a->top`
  259.   }
  260.   
  261. > BIGNUM *BN_dup(const BIGNUM *a)
  262.   {
  263.       BIGNUM *t;

ssl/tls_srp.c:189:10: Call
187.       BN_clear_free(s->srp_ctx.s);
188.       s->srp_ctx.s = NULL;
189.       if (!SRP_create_verifier_BN
                ^
190.           (user, pass, &s->srp_ctx.s, &s->srp_ctx.v, GN->N, GN->g))
191.           return -1;

crypto/srp/srp_vfy.c:668:1: Parameter `g->top`
  666.    * BIGNUMS.
  667.    */
  668. > int SRP_create_verifier_BN(const char *user, const char *pass, BIGNUM **salt,
  669.                              BIGNUM **verifier, const BIGNUM *N,
  670.                              const BIGNUM *g)

crypto/srp/srp_vfy.c:699:10: Call
  697.           goto err;
  698.   
  699.       if (!BN_mod_exp(*verifier, g, x, N, bn_ctx)) {
                  ^
  700.           BN_clear_free(*verifier);
  701.           goto err;

crypto/bn/bn_exp.c:89:1: Parameter `a->top`
    87.   }
    88.   
    89. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
    90.                  BN_CTX *ctx)
    91.   {

crypto/bn/bn_exp.c:144:19: Call
    142.           } else
    143.   # endif
    144.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                             ^
    145.       } else
    146.   #endif

crypto/bn/bn_exp.c:296:1: Parameter `a->top`
      294.   }
      295.   
      296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
      298.   {

crypto/bn/bn_exp.c:310:16: Call
      308.               || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
      309.               || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
      310.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                            ^
      311.       }
      312.   

crypto/bn/bn_exp.c:596:1: Parameter `a->top`
        594.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
        595.    */
        596. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
        597.                                 const BIGNUM *m, BN_CTX *ctx,
        598.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:759:17: Call
        757.           if (!BN_to_montgomery(&am, &am, mont, ctx))
        758.               goto err;
        759.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                               ^
        760.           goto err;
        761.   

crypto/bn/bn_lib.c:871:1: Parameter `a->top`
          869.   }
          870.   
          871. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
          872.                        BN_CTX *ctx)
          873.   {

crypto/bn/bn_lib.c:874:12: Call
          872.                        BN_CTX *ctx)
          873.   {
          874.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                            ^
          875.   }
          876.   

crypto/bn/bn_mont.c:26:1: Parameter `b->top`
            24.   #endif
            25.   
            26. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
            27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
            28.   {

crypto/bn/bn_mont.c:56:14: Call
            54.       bn_check_top(tmp);
            55.       if (a == b) {
            56.           if (!BN_sqr(tmp, a, ctx))
                               ^
            57.               goto err;
            58.       } else {

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

crypto/bn/bn_sqr.c:25:5: Assignment
              23.       bn_check_top(a);
              24.   
              25.       al = a->top;
                        ^
              26.       if (al <= 0) {
              27.           r->top = 0;

crypto/bn/bn_sqr.c:74:17: Call
              72.                   if (bn_wexpand(tmp, max) == NULL)
              73.                       goto err;
              74.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                                    ^
              75.               }
              76.           }

crypto/bn/bn_sqr.c:99:1: <Offset trace>
97.   
98.   /* tmp must have 2*n words */
99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
100.   {
101.       int i, j, max;

crypto/bn/bn_sqr.c:99:1: Parameter `n`
                97.   
                98.   /* tmp must have 2*n words */
                99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
                100.   {
                101.       int i, j, max;

crypto/bn/bn_sqr.c:110:5: Assignment
                108.       rp[0] = rp[max - 1] = 0;
                109.       rp++;
                110.       j = n;
                           ^
                111.   
                112.       if (--j > 0) {

crypto/bn/bn_sqr.c:112:9: Assignment
                110.       j = n;
                111.   
                112.       if (--j > 0) {
                               ^
                113.           ap++;
                114.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:99:1: <Length trace>
97.   
98.   /* tmp must have 2*n words */
99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
100.   {
101.       int i, j, max;

crypto/bn/bn_sqr.c:99:1: Parameter `*r`
                97.   
                98.   /* tmp must have 2*n words */
                99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
                100.   {
                101.       int i, j, max;

crypto/bn/bn_sqr.c:107:5: Assignment
                105.       max = n * 2;
                106.       ap = a;
                107.       rp = r;
                           ^
                108.       rp[0] = rp[max - 1] = 0;
                109.       rp++;

crypto/bn/bn_sqr.c:109:5: Assignment
                107.       rp = r;
                108.       rp[0] = rp[max - 1] = 0;
                109.       rp++;
                           ^
                110.       j = n;
                111.   

crypto/bn/bn_sqr.c:114:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `SRP_create_verifier_BN` 
                112.       if (--j > 0) {
                113.           ap++;
                114.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                               ^
                115.           rp += 2;
                116.       }
