crypto/dsa/dsa_gen.c:157: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_is_prime_fasttest_ex`.
Showing all 49 steps of the trace


crypto/dsa/dsa_gen.c:115:10: Call
113.           goto err;
114.   
115.       if (!BN_lshift(test, BN_value_one(), bits - 1))
                ^
116.           goto err;
117.   

crypto/bn/bn_shift.c:83:1: Parameter `r->top`
  81.   }
  82.   
  83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
  84.   {
  85.       int i, nw, lb, rb;

crypto/dsa/dsa_gen.c:157:17: Call
155.   
156.               /* step 4 */
157.               r = BN_is_prime_fasttest_ex(q, DSS_prime_checks, ctx,
                       ^
158.                                           use_random_seed, cb);
159.               if (r > 0)

crypto/bn/bn_prime.c:151:1: Parameter `a->top`
  149.   }
  150.   
  151. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  152.                               int do_trial_division, BN_GENCB *cb)
  153.   {

crypto/bn/bn_prime.c:161:9: Call
  159.   
  160.       /* Take care of the really small primes 2 & 3 */
  161.       if (BN_is_word(a, 2) || BN_is_word(a, 3))
                 ^
  162.           return 1;
  163.   

crypto/bn/bn_lib.c:856:1: Parameter `a->top`
    854.   }
    855.   
    856. > int BN_is_word(const BIGNUM *a, const BN_ULONG w)
    857.   {
    858.       return BN_abs_is_word(a, w) && (!w || !a->neg);

crypto/bn/bn_lib.c:858:12: Call
    856.   int BN_is_word(const BIGNUM *a, const BN_ULONG w)
    857.   {
    858.       return BN_abs_is_word(a, w) && (!w || !a->neg);
                      ^
    859.   }
    860.   

crypto/bn/bn_lib.c:841:1: Parameter `a->top`
      839.   }
      840.   
      841. > int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w)
      842.   {
      843.       return ((a->top == 1) && (a->d[0] == w)) || ((w == 0) && (a->top == 0));

crypto/bn/bn_prime.c:161:29: Call
  159.   
  160.       /* Take care of the really small primes 2 & 3 */
  161.       if (BN_is_word(a, 2) || BN_is_word(a, 3))
                                     ^
  162.           return 1;
  163.   

crypto/bn/bn_lib.c:856:1: Parameter `a->top`
    854.   }
    855.   
    856. > int BN_is_word(const BIGNUM *a, const BN_ULONG w)
    857.   {
    858.       return BN_abs_is_word(a, w) && (!w || !a->neg);

crypto/bn/bn_lib.c:858:12: Call
    856.   int BN_is_word(const BIGNUM *a, const BN_ULONG w)
    857.   {
    858.       return BN_abs_is_word(a, w) && (!w || !a->neg);
                      ^
    859.   }
    860.   

crypto/bn/bn_lib.c:841:1: Parameter `a->top`
      839.   }
      840.   
      841. > int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w)
      842.   {
      843.       return ((a->top == 1) && (a->d[0] == w)) || ((w == 0) && (a->top == 0));

crypto/bn/bn_prime.c:165:10: Call
  163.   
  164.       /* Check odd and bigger than 1 */
  165.       if (!BN_is_odd(a) || BN_cmp(a, BN_value_one()) <= 0)
                  ^
  166.           return 0;
  167.   

crypto/bn/bn_lib.c:861:1: Parameter `a->top`
    859.   }
    860.   
    861. > int BN_is_odd(const BIGNUM *a)
    862.   {
    863.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_prime.c:165:26: Call
  163.   
  164.       /* Check odd and bigger than 1 */
  165.       if (!BN_is_odd(a) || BN_cmp(a, BN_value_one()) <= 0)
                                  ^
  166.           return 0;
  167.   

crypto/bn/bn_lib.c:541:1: Parameter `a->top`
    539.   }
    540.   
    541. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
    542.   {
    543.       int i;

crypto/bn/bn_prime.c:198:10: Call
  196.   
  197.       /* compute A1 := a - 1 */
  198.       if (!BN_copy(A1, a) || !BN_sub_word(A1, 1))
                  ^
  199.           goto err;
  200.       /* compute A3 := a - 3 */

crypto/bn/bn_lib.c:280:1: Parameter `b->top`
    278.   }
    279.   
    280. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    281.   {
    282.       bn_check_top(b);

crypto/bn/bn_prime.c:201:10: Call
  199.           goto err;
  200.       /* compute A3 := a - 3 */
  201.       if (!BN_copy(A3, a) || !BN_sub_word(A3, 3))
                  ^
  202.           goto err;
  203.   

crypto/bn/bn_lib.c:280:1: Parameter `b->top`
    278.   }
    279.   
    280. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    281.   {
    282.       bn_check_top(b);

crypto/bn/bn_prime.c:215:10: Call
  213.       if (mont == NULL)
  214.           goto err;
  215.       if (!BN_MONT_CTX_set(mont, a, ctx))
                  ^
  216.           goto err;
  217.   

crypto/bn/bn_mont.c:238:9: Call
    236.       BIGNUM *Ri, *R;
    237.   
    238.       if (BN_is_zero(mod))
                   ^
    239.           return 0;
    240.   

crypto/bn/bn_lib.c:846:1: Parameter `a->top`
      844.   }
      845.   
      846. > int BN_is_zero(const BIGNUM *a)
      847.   {
      848.       return a->top == 0;

crypto/bn/bn_prime.c:223:13: Call
  221.               goto err;
  222.   
  223.           j = witness(check, a, A1, A1_odd, k, ctx, mont);
                     ^
  224.           if (j == -1)
  225.               goto err;

crypto/bn/bn_prime.c:245:1: Parameter `a->top`
    243.   }
    244.   
    245. > static int witness(BIGNUM *w, const BIGNUM *a, const BIGNUM *a1,
    246.                      const BIGNUM *a1_odd, int k, BN_CTX *ctx,
    247.                      BN_MONT_CTX *mont)

crypto/bn/bn_prime.c:249:10: Call
    247.                      BN_MONT_CTX *mont)
    248.   {
    249.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
                    ^
    250.           return -1;
    251.       if (BN_is_one(w))

crypto/bn/bn_exp.c:296:1: Parameter `m->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:745:14: Assignment
        743.           /* 2^(top*BN_BITS2) - m */
        744.           tmp.d[0] = (0 - m->d[0]) & BN_MASK2;
        745.           for (i = 1; i < top; i++)
                            ^
        746.               tmp.d[i] = (~m->d[i]) & BN_MASK2;
        747.           tmp.top = top;

crypto/bn/bn_exp.c:1062:14: Call
        1060.           bits -= window0;
        1061.           wvalue = bn_get_bits(p, bits) & wmask;
        1062.           if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&tmp, top, powerbuf, wvalue,
                             ^
        1063.                                               window))
        1064.               goto err;

crypto/bn/bn_exp.c:520:1: Parameter `top`
          518.   }
          519.   
          520. > static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top,
          521.                                             unsigned char *buf, int idx,
          522.                                             int window)

crypto/bn/bn_exp.c:577:5: Assignment
          575.       }
          576.   
          577.       b->top = top;
                     ^
          578.       bn_correct_top(b);
          579.       return 1;

crypto/bn/bn_exp.c:578:5: Call
          576.   
          577.       b->top = top;
          578.       bn_correct_top(b);
                     ^
          579.       return 1;
          580.   }

crypto/bn/bn_lib.c:947:1: Parameter `a->top`
            945.   }
            946.   
            947. > void bn_correct_top(BIGNUM *a)
            948.   {
            949.       BN_ULONG *ftl;

crypto/bn/bn_exp.c:1075:22: Call
        1073.               /* Square the result window-size times */
        1074.               for (i = 0; i < window; i++)
        1075.                   if (!BN_mod_mul_montgomery(&tmp, &tmp, &tmp, mont, ctx))
                                     ^
        1076.                       goto err;
        1077.   

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 `BN_is_prime_fasttest_ex` 
              112.       if (--j > 0) {
              113.           ap++;
              114.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                             ^
              115.           rp += 2;
              116.       }
