ssl/tls_srp.c:280: error: BUFFER_OVERRUN_L3
  Offset: [31, +oo] Size: [0, 8388607] by call to `SRP_create_verifier_BN`.
Showing all 23 steps of the trace


ssl/tls_srp.c:280:10: Call
278.       BN_clear_free(s->srp_ctx.s);
279.       s->srp_ctx.s = NULL;
280.       if (!SRP_create_verifier_BN
                ^
281.           (user, pass, &s->srp_ctx.s, &s->srp_ctx.v, GN->N, GN->g))
282.           return -1;

crypto/srp/srp_vfy.c:609:1: Parameter `g->top`
  607.    * BIGNUMS.
  608.    */
  609. > int SRP_create_verifier_BN(const char *user, const char *pass, BIGNUM **salt,
  610.                              BIGNUM **verifier, const BIGNUM *N,
  611.                              const BIGNUM *g)

crypto/srp/srp_vfy.c:640:10: Call
  638.           goto err;
  639.   
  640.       if (!BN_mod_exp(*verifier, g, x, N, bn_ctx)) {
                  ^
  641.           BN_clear_free(*verifier);
  642.           goto err;

crypto/bn/bn_exp.c:191:1: Parameter `a->top`
    189.   }
    190.   
    191. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
    192.                  BN_CTX *ctx)
    193.   {

crypto/bn/bn_exp.c:251:19: Call
    249.           } else
    250.   # endif
    251.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                             ^
    252.       } else
    253.   #endif

crypto/bn/bn_exp.c:401:1: Parameter `a->top`
      399.   }
      400.   
      401. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      402.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
      403.   {

crypto/bn/bn_exp.c:413:16: Call
      411.   
      412.       if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
      413.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                            ^
      414.       }
      415.   

crypto/bn/bn_exp.c:655:1: Parameter `a->top`
        653.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
        654.    */
        655. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
        656.                                 const BIGNUM *m, BN_CTX *ctx,
        657.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:812:17: Call
        810.           if (!BN_to_montgomery(&am, &am, mont, ctx))
        811.               goto err;
        812.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                               ^
        813.           goto err;
        814.   

crypto/bn/bn_lib.c:924:1: Parameter `a->top`
          922.   }
          923.   
          924. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
          925.                        BN_CTX *ctx)
          926.   {

crypto/bn/bn_lib.c:927:12: Call
          925.                        BN_CTX *ctx)
          926.   {
          927.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                            ^
          928.   }
          929.   

crypto/bn/bn_mont.c:128:1: Parameter `a->top`
            126.   #endif
            127.   
            128. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
            129.                             BN_MONT_CTX *mont, BN_CTX *ctx)
            130.   {

crypto/bn/bn_mont.c:155:14: Call
            153.       bn_check_top(tmp);
            154.       if (a == b) {
            155.           if (!BN_sqr(tmp, a, ctx))
                                ^
            156.               goto err;
            157.       } 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 `SRP_create_verifier_BN` 
                160.       ap = a;
                161.       rp = r;
                162.       rp[0] = rp[max - 1] = 0;
                                   ^
                163.       rp++;
                164.       j = n;
