crypto/ec/ecp_smpl.c:331: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_lshift`.
Showing all 12 steps of the trace


crypto/ec/ecp_smpl.c:312:14: Call
310.               goto err;
311.       } else {
312.           if (!BN_copy(a, group->a))
                    ^
313.               goto err;
314.           if (!BN_copy(b, group->b))

crypto/bn/bn_lib.c:429:1: Parameter `a->top`
  427.   }
  428.   
  429. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
  430.   {
  431.       int i;

crypto/ec/ecp_smpl.c:331:14: Call
329.           if (!BN_mod_mul(tmp_2, tmp_1, a, p, ctx))
330.               goto err;
331.           if (!BN_lshift(tmp_1, tmp_2, 2))
                    ^
332.               goto err;
333.           /* tmp_1 = 4*a^3 */

crypto/bn/bn_shift.c:130:1: <Offset trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `n`
  128.   }
  129.   
  130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
  131.   {
  132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:145:5: Assignment
  143.   
  144.       r->neg = a->neg;
  145.       nw = n / BN_BITS2;
             ^
  146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
  147.           return (0);

crypto/bn/bn_shift.c:130:1: <Length trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `*r->d`
  128.   }
  129.   
  130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
  131.   {
  132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:146:9: Call
  144.       r->neg = a->neg;
  145.       nw = n / BN_BITS2;
  146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                 ^
  147.           return (0);
  148.       lb = n % BN_BITS2;

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

crypto/bn/bn_shift.c:151:5: Assignment
  149.       rb = BN_BITS2 - lb;
  150.       f = a->d;
  151.       t = r->d;
             ^
  152.       t[a->top + nw] = 0;
  153.       if (lb == 0)

crypto/bn/bn_shift.c:159:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_lshift` 
  157.           for (i = a->top - 1; i >= 0; i--) {
  158.               l = f[i];
  159.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                     ^
  160.               t[nw + i] = (l << lb) & BN_MASK2;
  161.           }

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;
    }
    r->neg = a->neg;
    nw = n / BN_BITS2;
    if (bn_wexpand(r, a->top + nw + 1) == NULL)
        return (0);
    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_group_check_discriminant(const EC_GROUP *group, BN_CTX *ctx)\n{\n    int ret = 0;\n    BIGNUM *a, *b, *order, *tmp_1, *tmp_2;\n    const BIGNUM *p = group->field;\n    BN_CTX *new_ctx = NULL;\n    if (ctx == NULL) {\n        ctx = new_ctx = BN_CTX_new();\n        if (ctx == NULL) {\n            ECerr(EC_F_EC_GFP_SIMPLE_GROUP_CHECK_DISCRIMINANT,\n                  ERR_R_MALLOC_FAILURE);\n            goto err;\n        }\n    }\n    BN_CTX_start(ctx);\n    a = BN_CTX_get(ctx);\n    b = BN_CTX_get(ctx);\n    tmp_1 = BN_CTX_get(ctx);\n    tmp_2 = BN_CTX_get(ctx);\n    order = BN_CTX_get(ctx);\n    if (order == NULL)\n        goto err;\n    if (group->meth->field_decode) {\n        if (!group->meth->field_decode(group, a, group->a, ctx))\n            goto err;\n        if (!group->meth->field_decode(group, b, group->b, ctx))\n            goto err;\n    } else {\n        if (!BN_copy(a, group->a))\n            goto err;\n        if (!BN_copy(b, group->b))\n            goto err;\n    }\n    if (BN_is_zero(a)) {\n        if (BN_is_zero(b))\n            goto err;\n    } else if (!BN_is_zero(b)) {\n        if (!BN_mod_sqr(tmp_1, a, p, ctx))\n            goto err;\n        if (!BN_mod_mul(tmp_2, tmp_1, a, p, ctx))\n            goto err;\n        if (!BN_lshift(tmp_1, tmp_2, 2))\n            goto err;\n        if (!BN_mod_sqr(tmp_2, b, p, ctx))\n            goto err;\n        if (!BN_mul_word(tmp_2, 27))\n            goto err;\n        if (!BN_mod_add(a, tmp_1, tmp_2, p, ctx))\n            goto err;\n        if (BN_is_zero(a))\n            goto err;\n    }\n    ret = 1;\n err:\n    if (ctx != NULL)\n        BN_CTX_end(ctx);\n    BN_CTX_free(new_ctx);\n    return ret;\n}', 'BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)\n{\n    int i;\n    BN_ULONG *A;\n    const BN_ULONG *B;\n    bn_check_top(b);\n    if (a == b)\n        return (a);\n    if (bn_wexpand(a, b->top) == NULL)\n        return (NULL);\n#if 1\n    A = a->d;\n    B = b->d;\n    for (i = b->top >> 2; i > 0; i--, A += 4, B += 4) {\n        BN_ULONG a0, a1, a2, a3;\n        a0 = B[0];\n        a1 = B[1];\n        a2 = B[2];\n        a3 = B[3];\n        A[0] = a0;\n        A[1] = a1;\n        A[2] = a2;\n        A[3] = a3;\n    }\n    switch (b->top & 3) {\n    case 3:\n        A[2] = B[2];\n    case 2:\n        A[1] = B[1];\n    case 1:\n        A[0] = B[0];\n    case 0:;\n    }\n#else\n    memcpy(a->d, b->d, sizeof(b->d[0]) * b->top);\n#endif\n    a->top = b->top;\n    a->neg = b->neg;\n    bn_check_top(a);\n    return (a);\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    r->neg = a->neg;\n    nw = n / BN_BITS2;\n    if (bn_wexpand(r, a->top + nw + 1) == NULL)\n        return (0);\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}']