crypto/srp/srp_lib.c:118: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_exp`.
Showing all 25 steps of the trace


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 `r->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/srp/srp_lib.c:118:23: Call
116.   
117.       S = BN_new();
118.       if (S != NULL && !BN_mod_exp(S, tmp, b, N, bn_ctx)) {
                             ^
119.           BN_free(S);
120.           S = NULL;

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

crypto/bn/bn_exp.c:150:19: Call
  148.           } else
  149.   # endif
  150.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                           ^
  151.       } else
  152.   #endif

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

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

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

crypto/bn/bn_exp.c:749:17: Call
      747.           if (!BN_to_montgomery(&am, &am, mont, ctx))
      748.               goto err;
      749.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                             ^
      750.           goto err;
      751.   

crypto/bn/bn_lib.c:943:1: Parameter `a->top`
        941.   }
        942.   
        943. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
        944.                        BN_CTX *ctx)
        945.   {

crypto/bn/bn_lib.c:946:12: Call
        944.                        BN_CTX *ctx)
        945.   {
        946.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                          ^
        947.   }
        948.   

crypto/bn/bn_mont.c:26:1: Parameter `a->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:53:14: Call
          51.       bn_check_top(tmp);
          52.       if (a == b) {
          53.           if (!BN_sqr(tmp, a, ctx))
                             ^
          54.               goto err;
          55.       } 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:115:5: Assignment
              113.       rp[0] = rp[max - 1] = 0;
              114.       rp++;
              115.       j = n;
                         ^
              116.   
              117.       if (--j > 0) {

crypto/bn/bn_sqr.c:117:9: Assignment
              115.       j = n;
              116.   
              117.       if (--j > 0) {
                             ^
              118.           ap++;
              119.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

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:114:5: Assignment
              112.       rp = r;
              113.       rp[0] = rp[max - 1] = 0;
              114.       rp++;
                         ^
              115.       j = n;
              116.   

crypto/bn/bn_sqr.c:119:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_exp` 
              117.       if (--j > 0) {
              118.           ap++;
              119.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                             ^
              120.           rp += 2;
              121.       }
