crypto/ec/ecp_oct.c:73: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_mod_lshift1_quick`.
Showing all 16 steps of the trace


crypto/ec/ecp_oct.c:67:14: Call
65.           if (!BN_mod_sqr(tmp2, x_, group->field, ctx))
66.               goto err;
67.           if (!BN_mod_mul(tmp1, tmp2, x_, group->field, ctx))
                   ^
68.               goto err;
69.       }

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/ec/ecp_oct.c:73:14: Call
71.       /* tmp1 := tmp1 + a*x */
72.       if (group->a_is_minus3) {
73.           if (!BN_mod_lshift1_quick(tmp2, x, group->field))
                   ^
74.               goto err;
75.           if (!BN_mod_add_quick(tmp2, tmp2, x, group->field))

crypto/bn/bn_mod.c:122:1: Parameter `*r->d`
  120.    * m
  121.    */
  122. > int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m)
  123.   {
  124.       if (!BN_lshift1(r, a))

crypto/bn/bn_mod.c:124:10: Call
  122.   int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m)
  123.   {
  124.       if (!BN_lshift1(r, a))
                  ^
  125.           return 0;
  126.       bn_check_top(r);

crypto/bn/bn_shift.c:13:1: Parameter `*r->d`
    11.   #include "bn_lcl.h"
    12.   
    13. > int BN_lshift1(BIGNUM *r, const BIGNUM *a)
    14.   {
    15.       register BN_ULONG *ap, *rp, t, c;

crypto/bn/bn_shift.c:23:13: Call
    21.       if (r != a) {
    22.           r->neg = a->neg;
    23.           if (bn_wexpand(r, a->top + 1) == NULL)
                      ^
    24.               return (0);
    25.           r->top = a->top;

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, 536870848] by call to `BN_mod_lshift1_quick` 
          269.       assert(b->top <= words);
          270.       if (b->top > 0)
          271.           memcpy(a, b->d, sizeof(*a) * b->top);
                         ^
          272.   
          273.       return a;
