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


ssl/tls_srp.c:284:1: Parameter `s->srp_ctx.A->top`
282.   }
283.   
284. > int srp_generate_server_master_secret(SSL *s)
285.   {
286.       BIGNUM *K = NULL, *u = NULL;

ssl/tls_srp.c:290:10: Call
288.       unsigned char *tmp = NULL;
289.   
290.       if (!SRP_Verify_A_mod_N(s->srp_ctx.A, s->srp_ctx.N))
                ^
291.           goto err;
292.       if ((u = SRP_Calc_u(s->srp_ctx.A, s->srp_ctx.B, s->srp_ctx.N)) == NULL)

crypto/srp/srp_lib.c:273:1: Parameter `A->top`
  271.   }
  272.   
  273. > int SRP_Verify_A_mod_N(BIGNUM *A, BIGNUM *N)
  274.   {
  275.       /* Checks if A % N == 0 */

crypto/srp/srp_lib.c:276:12: Call
  274.   {
  275.       /* Checks if A % N == 0 */
  276.       return SRP_Verify_B_mod_N(A, N);
                    ^
  277.   }
  278.   

crypto/srp/srp_lib.c:252:1: Parameter `B->top`
    250.   }
    251.   
    252. > int SRP_Verify_B_mod_N(BIGNUM *B, BIGNUM *N)
    253.   {
    254.       BIGNUM *r;

ssl/tls_srp.c:292:14: Call
290.       if (!SRP_Verify_A_mod_N(s->srp_ctx.A, s->srp_ctx.N))
291.           goto err;
292.       if ((u = SRP_Calc_u(s->srp_ctx.A, s->srp_ctx.B, s->srp_ctx.N)) == NULL)
                    ^
293.           goto err;
294.       if ((K = SRP_Calc_server_key(s->srp_ctx.A, s->srp_ctx.v, u, s->srp_ctx.b,

crypto/srp/srp_lib.c:55:1: Parameter `A->top`
  53.   }
  54.   
  55. > BIGNUM *SRP_Calc_u(BIGNUM *A, BIGNUM *B, BIGNUM *N)
  56.   {
  57.       /* k = SHA1(PAD(A) || PAD(B) ) -- tls-srp draft 8 */

ssl/tls_srp.c:294:14: Call
292.       if ((u = SRP_Calc_u(s->srp_ctx.A, s->srp_ctx.B, s->srp_ctx.N)) == NULL)
293.           goto err;
294.       if ((K = SRP_Calc_server_key(s->srp_ctx.A, s->srp_ctx.v, u, s->srp_ctx.b,
                    ^
295.                                    s->srp_ctx.N)) == NULL)
296.           goto err;

crypto/srp/srp_lib.c:98:1: Parameter `A->top`
  96.   }
  97.   
  98. > BIGNUM *SRP_Calc_server_key(BIGNUM *A, BIGNUM *v, BIGNUM *u, BIGNUM *b,
  99.                               BIGNUM *N)
  100.   {

crypto/srp/srp_lib.c:114:10: Call
  112.       if (!BN_mod_exp(tmp, v, u, N, bn_ctx))
  113.           goto err;
  114.       if (!BN_mod_mul(tmp, A, tmp, N, bn_ctx))
                  ^
  115.           goto err;
  116.   

crypto/bn/bn_mod.c:73:1: Parameter `a->top`
    71.   
    72.   /* slow but works */
    73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
    74.                  BN_CTX *ctx)
    75.   {

crypto/bn/bn_mod.c:87:14: Call
    85.           goto err;
    86.       if (a == b) {
    87.           if (!BN_sqr(t, a, ctx))
                       ^
    88.               goto err;
    89.       } 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:104:1: <Offset trace>
102.   
103.   /* tmp must have 2*n words */
104. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
105.   {
106.       int i, j, max;

crypto/bn/bn_sqr.c:104:1: Parameter `n`
        102.   
        103.   /* tmp must have 2*n words */
        104. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
        105.   {
        106.       int i, j, max;

crypto/bn/bn_sqr.c:110:5: Assignment
        108.       BN_ULONG *rp;
        109.   
        110.       max = n * 2;
                   ^
        111.       ap = a;
        112.       rp = r;

crypto/bn/bn_sqr.c:104:1: <Length trace>
102.   
103.   /* tmp must have 2*n words */
104. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
105.   {
106.       int i, j, max;

crypto/bn/bn_sqr.c:104:1: Parameter `*r`
        102.   
        103.   /* tmp must have 2*n words */
        104. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
        105.   {
        106.       int i, j, max;

crypto/bn/bn_sqr.c:112:5: Assignment
        110.       max = n * 2;
        111.       ap = a;
        112.       rp = r;
                   ^
        113.       rp[0] = rp[max - 1] = 0;
        114.       rp++;

crypto/bn/bn_sqr.c:113:13: Array access: Offset: [31, +oo] Size: [0, 8388607] by call to `SRP_Calc_server_key` 
        111.       ap = a;
        112.       rp = r;
        113.       rp[0] = rp[max - 1] = 0;
                           ^
        114.       rp++;
        115.       j = n;
