crypto/bn/bn_exp.c:238: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, +oo] by call to `BN_mod_mul_reciprocal`.
Showing all 21 steps of the trace


crypto/bn/bn_exp.c:198:13: Call
196.               goto err;
197.           aa->neg = 0;
198.           if (BN_RECP_CTX_set(&recp, aa, ctx) <= 0)
                   ^
199.               goto err;
200.       } else {

crypto/bn/bn_recp.c:44:1: Parameter `*recp->Nr.d`
  42.   }
  43.   
  44. > int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
  45.   {
  46.       if (!BN_copy(&(recp->N), d))

crypto/bn/bn_exp.c:238:22: Call
236.           if (BN_is_bit_set(p, wstart) == 0) {
237.               if (!start)
238.                   if (!BN_mod_mul_reciprocal(r, r, r, &recp, ctx))
                            ^
239.                       goto err;
240.               if (wstart == 0)

crypto/bn/bn_recp.c:54:1: Parameter `*recp->Nr.d`
  52.   }
  53.   
  54. > int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
  55.                             BN_RECP_CTX *recp, BN_CTX *ctx)
  56.   {

crypto/bn/bn_recp.c:76:11: Call
  74.           ca = x;                 /* Just do the mod */
  75.   
  76.       ret = BN_div_recp(NULL, r, ca, recp, ctx);
                  ^
  77.    err:
  78.       BN_CTX_end(ctx);

crypto/bn/bn_recp.c:90:29: Call
    88.   
    89.       BN_CTX_start(ctx);
    90.       d = (dv != NULL) ? dv : BN_CTX_get(ctx);
                                      ^
    91.       r = (rem != NULL) ? rem : BN_CTX_get(ctx);
    92.       a = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:229:5: Call
      227.       }
      228.       /* OK, make sure the returned bignum is "zero" */
      229.       BN_zero(ret);
                 ^
      230.       ctx->used++;
      231.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:402:15: Assignment
        400.       a->neg = 0;
        401.       a->d[0] = w;
        402.       a->top = (w ? 1 : 0);
                             ^
        403.       bn_check_top(a);
        404.       return (1);

crypto/bn/bn_lib.c:402:5: Assignment
        400.       a->neg = 0;
        401.       a->d[0] = w;
        402.       a->top = (w ? 1 : 0);
                   ^
        403.       bn_check_top(a);
        404.       return (1);

crypto/bn/bn_recp.c:131:10: Call
    129.        *    = |m/N|
    130.        */
    131.       if (!BN_rshift(a, m, recp->num_bits))
                    ^
    132.           goto err;
    133.       if (!BN_mul(b, a, &(recp->Nr), ctx))

crypto/bn/bn_shift.c:122:1: Parameter `*r->d`
      120.   }
      121.   
      122. > int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
      123.   {
      124.       int i, j, nw, lb, rb;

crypto/bn/bn_shift.c:145:13: Call
      143.       i = (BN_num_bits(a) - n + (BN_BITS2 - 1)) / BN_BITS2;
      144.       if (r != a) {
      145.           if (bn_wexpand(r, i) == NULL)
                         ^
      146.               return (0);
      147.           r->neg = a->neg;

crypto/bn/bn_lib.c:948:1: Parameter `*a->d`
        946.   }
        947.   
        948. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        949.   {
        950.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:950:37: Call
        948.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
        949.   {
        950.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                   ^
        951.   }
        952.   

crypto/bn/bn_lib.c:284:1: Parameter `*b->d`
          282.    */
          283.   
          284. > BIGNUM *bn_expand2(BIGNUM *b, int words)
          285.   {
          286.       bn_check_top(b);

crypto/bn/bn_lib.c:289:23: Call
          287.   
          288.       if (words > b->dmax) {
          289.           BN_ULONG *a = bn_expand_internal(b, words);
                                       ^
          290.           if (!a)
          291.               return NULL;

crypto/bn/bn_lib.c:246:1: <Offset trace>
244.   /* This is used by bn_expand2() */
245.   /* The caller MUST check that words > b->dmax before calling this */
246. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
247.   {
248.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:246:1: Parameter `b->top`
            244.   /* This is used by bn_expand2() */
            245.   /* The caller MUST check that words > b->dmax before calling this */
            246. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
            247.   {
            248.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:246:1: <Length trace>
244.   /* This is used by bn_expand2() */
245.   /* The caller MUST check that words > b->dmax before calling this */
246. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
247.   {
248.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:246:1: Parameter `*b->d`
            244.   /* This is used by bn_expand2() */
            245.   /* The caller MUST check that words > b->dmax before calling this */
            246. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
            247.   {
            248.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:271:9: Array access: Offset added: [8, +oo] Size: [0, +oo] by call to `BN_mod_mul_reciprocal` 
            269.       assert(b->top <= words);
            270.       if (b->top > 0)
            271.           memcpy(a, b->d, sizeof(*a) * b->top);
                           ^
            272.   
            273.       return a;
