crypto/ec/ecp_smpl.c:1045: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_mod_lshift1_quick`.
Showing all 16 steps of the trace


crypto/ec/ecp_smpl.c:1014:10: Call
1012.   
1013.       BN_CTX_start(ctx);
1014.       rh = BN_CTX_get(ctx);
                 ^
1015.       tmp = BN_CTX_get(ctx);
1016.       Z4 = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:283:5: Call
  281.       }
  282.       /* OK, make sure the returned bignum is "zero" */
  283.       BN_zero(ret);
             ^
  284.       ctx->used++;
  285.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:529:1: Parameter `*a->d`
    527.   }
    528.   
    529. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    530.   {
    531.       bn_check_top(a);

crypto/ec/ecp_smpl.c:1045:18: Call
1043.           /* rh := (rh + a*Z^4)*X */
1044.           if (group->a_is_minus3) {
1045.               if (!BN_mod_lshift1_quick(tmp, Z4, p))
                         ^
1046.                   goto err;
1047.               if (!BN_mod_add_quick(tmp, tmp, Z4, p))

crypto/bn/bn_mod.c:227:1: Parameter `*r->d`
  225.    * m
  226.    */
  227. > int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m)
  228.   {
  229.       if (!BN_lshift1(r, a))

crypto/bn/bn_mod.c:229:10: Call
  227.   int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m)
  228.   {
  229.       if (!BN_lshift1(r, a))
                  ^
  230.           return 0;
  231.       bn_check_top(r);

crypto/bn/bn_shift.c:61:1: Parameter `*r->d`
    59.   #include "bn_lcl.h"
    60.   
    61. > int BN_lshift1(BIGNUM *r, const BIGNUM *a)
    62.   {
    63.       register BN_ULONG *ap, *rp, t, c;

crypto/bn/bn_shift.c:71:13: Call
    69.       if (r != a) {
    70.           r->neg = a->neg;
    71.           if (bn_wexpand(r, a->top + 1) == NULL)
                      ^
    72.               return (0);
    73.           r->top = a->top;

crypto/bn/bn_lib.c:994:1: Parameter `*a->d`
      992.   }
      993.   
      994. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      995.   {
      996.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:996:37: Call
      994.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      995.   {
      996.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                 ^
      997.   }
      998.   

crypto/bn/bn_lib.c:389:1: Parameter `*b->d`
        387.    */
        388.   
        389. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        390.   {
        391.       bn_check_top(b);

crypto/bn/bn_lib.c:394:23: Call
        392.   
        393.       if (words > b->dmax) {
        394.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        395.           if (!a)
        396.               return NULL;

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

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

crypto/bn/bn_lib.c:334:5: Assignment
          332.   
          333.   #if 1
          334.       B = b->d;
                     ^
          335.       /* Check if the previous number needs to be copied */
          336.       if (B != NULL) {

crypto/bn/bn_lib.c:351:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_mod_lshift1_quick` 
          349.               a1 = B[1];
          350.               a2 = B[2];
          351.               a3 = B[3];
                                  ^
          352.               A[0] = a0;
          353.               A[1] = a1;
