crypto/ec/ecp_smpl.c:915: error: BUFFER_OVERRUN_L3
  Offset added: [0, 24] Size: [0, 67108856] by call to `BN_mod_lshift_quick`.
Showing all 12 steps of the trace


crypto/ec/ecp_smpl.c:915:10: Call
913.       if (!field_sqr(group, n0, n3, ctx))
914.           goto err;
915.       if (!BN_mod_lshift_quick(n3, n0, 3, p))
                ^
916.           goto err;
917.       /* n3 = 8 * Y_a^4 */

crypto/bn/bn_mod.c:159:1: Parameter `n`
  157.    * m
  158.    */
  159. > int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m)
  160.   {
  161.       if (r != a) {

crypto/bn/bn_mod.c:182:18: Call
  180.   
  181.           if (max_shift) {
  182.               if (!BN_lshift(r, r, max_shift))
                          ^
  183.                   return 0;
  184.               n -= max_shift;

crypto/bn/bn_shift.c:81:1: <Offset trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

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

crypto/bn/bn_shift.c:95:5: Assignment
    93.       }
    94.   
    95.       nw = n / BN_BITS2;
              ^
    96.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
    97.           return (0);

crypto/bn/bn_shift.c:81:1: <Length trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

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

crypto/bn/bn_shift.c:96:9: Call
    94.   
    95.       nw = n / BN_BITS2;
    96.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                  ^
    97.           return (0);
    98.       r->neg = a->neg;

crypto/bn/bn_lib.c:1016:1: Parameter `*a->d`
      1014.   }
      1015.   
      1016. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      1017.   {
      1018.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:102:5: Assignment
    100.       rb = BN_BITS2 - lb;
    101.       f = a->d;
    102.       t = r->d;
               ^
    103.       t[a->top + nw] = 0;
    104.       if (lb == 0)

crypto/bn/bn_shift.c:113:5: Array access: Offset added: [0, 24] Size: [0, 67108856] by call to `BN_mod_lshift_quick` 
    111.               t[nw + i] = (l << lb) & BN_MASK2;
    112.           }
    113.       memset(t, 0, sizeof(*t) * nw);
               ^
    114.       r->top = a->top + nw + 1;
    115.       bn_correct_top(r);

int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
{
    int i, nw, lb, rb;
    BN_ULONG *t, *f;
    BN_ULONG l;
    bn_check_top(r);
    bn_check_top(a);
    if (n < 0) {
        BNerr(BN_F_BN_LSHIFT, BN_R_INVALID_SHIFT);
        return 0;
    }
    nw = n / BN_BITS2;
    if (bn_wexpand(r, a->top + nw + 1) == NULL)
        return (0);
    r->neg = a->neg;
    lb = n % BN_BITS2;
    rb = BN_BITS2 - lb;
    f = a->d;
    t = r->d;
    t[a->top + nw] = 0;
    if (lb == 0)
        for (i = a->top - 1; i >= 0; i--)
            t[nw + i] = f[i];
    else
        for (i = a->top - 1; i >= 0; i--) {
            l = f[i];
            t[nw + i + 1] |= (l >> rb) & BN_MASK2;
            t[nw + i] = (l << lb) & BN_MASK2;
        }
    memset(t, 0, sizeof(*t) * nw);
    r->top = a->top + nw + 1;
    bn_correct_top(r);
    bn_check_top(r);
    return (1);
}
['int ec_GFp_simple_dbl(const EC_GROUP *group, EC_POINT *r, const EC_POINT *a,\n                      BN_CTX *ctx)\n{\n    int (*field_mul) (const EC_GROUP *, BIGNUM *, const BIGNUM *,\n                      const BIGNUM *, BN_CTX *);\n    int (*field_sqr) (const EC_GROUP *, BIGNUM *, const BIGNUM *, BN_CTX *);\n    const BIGNUM *p;\n    BN_CTX *new_ctx = NULL;\n    BIGNUM *n0, *n1, *n2, *n3;\n    int ret = 0;\n    if (EC_POINT_is_at_infinity(group, a)) {\n        BN_zero(r->Z);\n        r->Z_is_one = 0;\n        return 1;\n    }\n    field_mul = group->meth->field_mul;\n    field_sqr = group->meth->field_sqr;\n    p = group->field;\n    if (ctx == NULL) {\n        ctx = new_ctx = BN_CTX_new();\n        if (ctx == NULL)\n            return 0;\n    }\n    BN_CTX_start(ctx);\n    n0 = BN_CTX_get(ctx);\n    n1 = BN_CTX_get(ctx);\n    n2 = BN_CTX_get(ctx);\n    n3 = BN_CTX_get(ctx);\n    if (n3 == NULL)\n        goto err;\n    if (a->Z_is_one) {\n        if (!field_sqr(group, n0, a->X, ctx))\n            goto err;\n        if (!BN_mod_lshift1_quick(n1, n0, p))\n            goto err;\n        if (!BN_mod_add_quick(n0, n0, n1, p))\n            goto err;\n        if (!BN_mod_add_quick(n1, n0, group->a, p))\n            goto err;\n    } else if (group->a_is_minus3) {\n        if (!field_sqr(group, n1, a->Z, ctx))\n            goto err;\n        if (!BN_mod_add_quick(n0, a->X, n1, p))\n            goto err;\n        if (!BN_mod_sub_quick(n2, a->X, n1, p))\n            goto err;\n        if (!field_mul(group, n1, n0, n2, ctx))\n            goto err;\n        if (!BN_mod_lshift1_quick(n0, n1, p))\n            goto err;\n        if (!BN_mod_add_quick(n1, n0, n1, p))\n            goto err;\n    } else {\n        if (!field_sqr(group, n0, a->X, ctx))\n            goto err;\n        if (!BN_mod_lshift1_quick(n1, n0, p))\n            goto err;\n        if (!BN_mod_add_quick(n0, n0, n1, p))\n            goto err;\n        if (!field_sqr(group, n1, a->Z, ctx))\n            goto err;\n        if (!field_sqr(group, n1, n1, ctx))\n            goto err;\n        if (!field_mul(group, n1, n1, group->a, ctx))\n            goto err;\n        if (!BN_mod_add_quick(n1, n1, n0, p))\n            goto err;\n    }\n    if (a->Z_is_one) {\n        if (!BN_copy(n0, a->Y))\n            goto err;\n    } else {\n        if (!field_mul(group, n0, a->Y, a->Z, ctx))\n            goto err;\n    }\n    if (!BN_mod_lshift1_quick(r->Z, n0, p))\n        goto err;\n    r->Z_is_one = 0;\n    if (!field_sqr(group, n3, a->Y, ctx))\n        goto err;\n    if (!field_mul(group, n2, a->X, n3, ctx))\n        goto err;\n    if (!BN_mod_lshift_quick(n2, n2, 2, p))\n        goto err;\n    if (!BN_mod_lshift1_quick(n0, n2, p))\n        goto err;\n    if (!field_sqr(group, r->X, n1, ctx))\n        goto err;\n    if (!BN_mod_sub_quick(r->X, r->X, n0, p))\n        goto err;\n    if (!field_sqr(group, n0, n3, ctx))\n        goto err;\n    if (!BN_mod_lshift_quick(n3, n0, 3, p))\n        goto err;\n    if (!BN_mod_sub_quick(n0, n2, r->X, p))\n        goto err;\n    if (!field_mul(group, n0, n1, n0, ctx))\n        goto err;\n    if (!BN_mod_sub_quick(r->Y, n0, n3, p))\n        goto err;\n    ret = 1;\n err:\n    BN_CTX_end(ctx);\n    BN_CTX_free(new_ctx);\n    return ret;\n}', 'int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m)\n{\n    if (r != a) {\n        if (BN_copy(r, a) == NULL)\n            return 0;\n    }\n    while (n > 0) {\n        int max_shift;\n        max_shift = BN_num_bits(m) - BN_num_bits(r);\n        if (max_shift < 0) {\n            BNerr(BN_F_BN_MOD_LSHIFT_QUICK, BN_R_INPUT_NOT_REDUCED);\n            return 0;\n        }\n        if (max_shift > n)\n            max_shift = n;\n        if (max_shift) {\n            if (!BN_lshift(r, r, max_shift))\n                return 0;\n            n -= max_shift;\n        } else {\n            if (!BN_lshift1(r, r))\n                return 0;\n            --n;\n        }\n        if (BN_cmp(r, m) >= 0) {\n            if (!BN_sub(r, r, m))\n                return 0;\n        }\n    }\n    bn_check_top(r);\n    return 1;\n}', 'int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)\n{\n    int i, nw, lb, rb;\n    BN_ULONG *t, *f;\n    BN_ULONG l;\n    bn_check_top(r);\n    bn_check_top(a);\n    if (n < 0) {\n        BNerr(BN_F_BN_LSHIFT, BN_R_INVALID_SHIFT);\n        return 0;\n    }\n    nw = n / BN_BITS2;\n    if (bn_wexpand(r, a->top + nw + 1) == NULL)\n        return (0);\n    r->neg = a->neg;\n    lb = n % BN_BITS2;\n    rb = BN_BITS2 - lb;\n    f = a->d;\n    t = r->d;\n    t[a->top + nw] = 0;\n    if (lb == 0)\n        for (i = a->top - 1; i >= 0; i--)\n            t[nw + i] = f[i];\n    else\n        for (i = a->top - 1; i >= 0; i--) {\n            l = f[i];\n            t[nw + i + 1] |= (l >> rb) & BN_MASK2;\n            t[nw + i] = (l << lb) & BN_MASK2;\n        }\n    memset(t, 0, sizeof(*t) * nw);\n    r->top = a->top + nw + 1;\n    bn_correct_top(r);\n    bn_check_top(r);\n    return (1);\n}', 'BIGNUM *bn_wexpand(BIGNUM *a, int words)\n{\n    return (words <= a->dmax) ? a : bn_expand2(a, words);\n}']