apps/dhparam.c:361: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `DH_check`.
Showing all 31 steps of the trace


apps/dhparam.c:298:32: Call
296.                          num, g);
297.               BIO_printf(bio_err, "This is going to take a long time\n");
298.               if (dh == NULL || !DH_generate_parameters_ex(dh, num, g, cb)) {
                                      ^
299.                   BN_GENCB_free(cb);
300.                   ERR_print_errors(bio_err);

crypto/dh/dh_gen.c:71:1: Parameter `ret->p->top`
  69.                                   BN_GENCB *cb);
  70.   
  71. > int DH_generate_parameters_ex(DH *ret, int prime_len, int generator,
  72.                                 BN_GENCB *cb)
  73.   {

apps/dhparam.c:361:14: Call
359.   
360.       if (check) {
361.           if (!DH_check(dh, &i)) {
                    ^
362.               ERR_print_errors(bio_err);
363.               goto end;

crypto/dh/dh_check.c:73:1: Parameter `dh->g->top`
  71.    */
  72.   
  73. > int DH_check(const DH *dh, int *ret)
  74.   {
  75.       int ok = 0;

crypto/dh/dh_check.c:93:13: Call
  91.   
  92.       if (dh->q) {
  93.           if (BN_cmp(dh->g, BN_value_one()) <= 0)
                    ^
  94.               *ret |= DH_NOT_SUITABLE_GENERATOR;
  95.           else if (BN_cmp(dh->g, dh->p) >= 0)

crypto/bn/bn_lib.c:623:1: Parameter `a->top`
    621.   }
    622.   
    623. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
    624.   {
    625.       int i;

crypto/dh/dh_check.c:95:18: Call
  93.           if (BN_cmp(dh->g, BN_value_one()) <= 0)
  94.               *ret |= DH_NOT_SUITABLE_GENERATOR;
  95.           else if (BN_cmp(dh->g, dh->p) >= 0)
                         ^
  96.               *ret |= DH_NOT_SUITABLE_GENERATOR;
  97.           else {

crypto/bn/bn_lib.c:623:1: Parameter `a->top`
    621.   }
    622.   
    623. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
    624.   {
    625.       int i;

crypto/dh/dh_check.c:99:18: Call
  97.           else {
  98.               /* Check g^q == 1 mod p */
  99.               if (!BN_mod_exp(t1, dh->g, dh->q, dh->p, ctx))
                          ^
  100.                   goto err;
  101.               if (!BN_is_one(t1))

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

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

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

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

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

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

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

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

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

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

crypto/bn/bn_sqr.c:165:9: Assignment
                163.       j = n;
                164.   
                165.       if (--j > 0) {
                               ^
                166.           ap++;
                167.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

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:162:5: Assignment
                160.       rp = r;
                161.       rp[0] = rp[max - 1] = 0;
                162.       rp++;
                           ^
                163.       j = n;
                164.   

crypto/bn/bn_sqr.c:167:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `DH_check` 
                165.       if (--j > 0) {
                166.           ap++;
                167.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                               ^
                168.           rp += 2;
                169.       }
