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


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

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

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

crypto/ec/ecp_smpl.c:1048:18: Call
1046.               if (!BN_mod_lshift1_quick(tmp, Z4, p))
1047.                   goto err;
1048.               if (!BN_mod_add_quick(tmp, tmp, Z4, p))
                         ^
1049.                   goto err;
1050.               if (!BN_mod_sub_quick(rh, rh, tmp, p))

crypto/bn/bn_mod.c:146:1: Parameter `*r->d`
  144.    * less than m
  145.    */
  146. > int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  147.                        const BIGNUM *m)
  148.   {

crypto/bn/bn_mod.c:149:10: Call
  147.                        const BIGNUM *m)
  148.   {
  149.       if (!BN_uadd(r, a, b))
                  ^
  150.           return 0;
  151.       if (BN_ucmp(r, m) >= 0)

crypto/bn/bn_add.c:106:1: Parameter `*r->d`
    104.   
    105.   /* unsigned add of b to a */
    106. > int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
    107.   {
    108.       int max, min, dif;

crypto/bn/bn_add.c:125:9: Call
    123.       dif = max - min;
    124.   
    125.       if (bn_wexpand(r, max + 1) == NULL)
                   ^
    126.           return 0;
    127.   

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_lib.c:997:37: Call
      995.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      996.   {
      997.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                  ^
      998.   }
      999.   

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

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

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

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

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

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

static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
{
    BN_ULONG *A, *a = NULL;
    const BN_ULONG *B;
    int i;
    bn_check_top(b);
    if (words > (INT_MAX / (4 * BN_BITS2))) {
        BNerr(BN_F_BN_EXPAND_INTERNAL, BN_R_BIGNUM_TOO_LONG);
        return NULL;
    }
    if (BN_get_flags(b, BN_FLG_STATIC_DATA)) {
        BNerr(BN_F_BN_EXPAND_INTERNAL, BN_R_EXPAND_ON_STATIC_BIGNUM_DATA);
        return (NULL);
    }
    if (BN_get_flags(b,BN_FLG_SECURE))
        a = A = OPENSSL_secure_malloc(words * sizeof(*a));
    else
        a = A = OPENSSL_malloc(words * sizeof(*a));
    if (A == NULL) {
        BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);
        return (NULL);
    }
#ifdef PURIFY
    memset(a, 0, sizeof(*a) * words);
#endif
#if 1
    B = b->d;
    if (B != NULL) {
        for (i = b->top >> 2; i > 0; i--, A += 4, B += 4) {
            BN_ULONG a0, a1, a2, a3;
            a0 = B[0];
            a1 = B[1];
            a2 = B[2];
            a3 = B[3];
            A[0] = a0;
            A[1] = a1;
            A[2] = a2;
            A[3] = a3;
        }
        switch (b->top & 3) {
        case 3:
            A[2] = B[2];
        case 2:
            A[1] = B[1];
        case 1:
            A[0] = B[0];
        case 0:
            ;
        }
    }
#else
    memset(A, 0, sizeof(*A) * words);
    memcpy(A, b->d, sizeof(b->d[0]) * b->top);
#endif
    return (a);
}
['int ec_GFp_simple_is_on_curve(const EC_GROUP *group, const EC_POINT *point,\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 *rh, *tmp, *Z4, *Z6;\n    int ret = -1;\n    if (EC_POINT_is_at_infinity(group, point))\n        return 1;\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 -1;\n    }\n    BN_CTX_start(ctx);\n    rh = BN_CTX_get(ctx);\n    tmp = BN_CTX_get(ctx);\n    Z4 = BN_CTX_get(ctx);\n    Z6 = BN_CTX_get(ctx);\n    if (Z6 == NULL)\n        goto err;\n    if (!field_sqr(group, rh, point->X, ctx))\n        goto err;\n    if (!point->Z_is_one) {\n        if (!field_sqr(group, tmp, point->Z, ctx))\n            goto err;\n        if (!field_sqr(group, Z4, tmp, ctx))\n            goto err;\n        if (!field_mul(group, Z6, Z4, tmp, ctx))\n            goto err;\n        if (group->a_is_minus3) {\n            if (!BN_mod_lshift1_quick(tmp, Z4, p))\n                goto err;\n            if (!BN_mod_add_quick(tmp, tmp, Z4, p))\n                goto err;\n            if (!BN_mod_sub_quick(rh, rh, tmp, p))\n                goto err;\n            if (!field_mul(group, rh, rh, point->X, ctx))\n                goto err;\n        } else {\n            if (!field_mul(group, tmp, Z4, group->a, ctx))\n                goto err;\n            if (!BN_mod_add_quick(rh, rh, tmp, p))\n                goto err;\n            if (!field_mul(group, rh, rh, point->X, ctx))\n                goto err;\n        }\n        if (!field_mul(group, tmp, group->b, Z6, ctx))\n            goto err;\n        if (!BN_mod_add_quick(rh, rh, tmp, p))\n            goto err;\n    } else {\n        if (!BN_mod_add_quick(rh, rh, group->a, p))\n            goto err;\n        if (!field_mul(group, rh, rh, point->X, ctx))\n            goto err;\n        if (!BN_mod_add_quick(rh, rh, group->b, p))\n            goto err;\n    }\n    if (!field_sqr(group, tmp, point->Y, ctx))\n        goto err;\n    ret = (0 == BN_ucmp(tmp, rh));\n err:\n    BN_CTX_end(ctx);\n    BN_CTX_free(new_ctx);\n    return ret;\n}', 'BIGNUM *BN_CTX_get(BN_CTX *ctx)\n{\n    BIGNUM *ret;\n    CTXDBG_ENTRY("BN_CTX_get", ctx);\n    if (ctx->err_stack || ctx->too_many)\n        return NULL;\n    if ((ret = BN_POOL_get(&ctx->pool, ctx->flags)) == NULL) {\n        ctx->too_many = 1;\n        BNerr(BN_F_BN_CTX_GET, BN_R_TOO_MANY_TEMPORARY_VARIABLES);\n        return NULL;\n    }\n    BN_zero(ret);\n    ctx->used++;\n    CTXDBG_RET(ctx, ret);\n    return ret;\n}', 'int BN_set_word(BIGNUM *a, BN_ULONG w)\n{\n    bn_check_top(a);\n    if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)\n        return (0);\n    a->neg = 0;\n    a->d[0] = w;\n    a->top = (w ? 1 : 0);\n    bn_check_top(a);\n    return (1);\n}', 'int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n                     const BIGNUM *m)\n{\n    if (!BN_uadd(r, a, b))\n        return 0;\n    if (BN_ucmp(r, m) >= 0)\n        return BN_usub(r, r, m);\n    return 1;\n}', 'int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)\n{\n    int max, min, dif;\n    const BN_ULONG *ap, *bp;\n    BN_ULONG *rp, carry, t1, t2;\n    const BIGNUM *tmp;\n    bn_check_top(a);\n    bn_check_top(b);\n    if (a->top < b->top) {\n        tmp = a;\n        a = b;\n        b = tmp;\n    }\n    max = a->top;\n    min = b->top;\n    dif = max - min;\n    if (bn_wexpand(r, max + 1) == NULL)\n        return 0;\n    r->top = max;\n    ap = a->d;\n    bp = b->d;\n    rp = r->d;\n    carry = bn_add_words(rp, ap, bp, min);\n    rp += min;\n    ap += min;\n    bp += min;\n    if (carry) {\n        while (dif) {\n            dif--;\n            t1 = *(ap++);\n            t2 = (t1 + 1) & BN_MASK2;\n            *(rp++) = t2;\n            if (t2) {\n                carry = 0;\n                break;\n            }\n        }\n        if (carry) {\n            *rp = 1;\n            r->top++;\n        }\n    }\n    if (dif && rp != ap)\n        while (dif--)\n            *(rp++) = *(ap++);\n    r->neg = 0;\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}', 'BIGNUM *bn_expand2(BIGNUM *b, int words)\n{\n    bn_check_top(b);\n    if (words > b->dmax) {\n        BN_ULONG *a = bn_expand_internal(b, words);\n        if (!a)\n            return NULL;\n        if (b->d) {\n            OPENSSL_cleanse(b->d, b->dmax * sizeof(b->d[0]));\n            bn_free_d(b);\n        }\n        b->d = a;\n        b->dmax = words;\n    }\n    bn_check_top(b);\n    return b;\n}', 'static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)\n{\n    BN_ULONG *A, *a = NULL;\n    const BN_ULONG *B;\n    int i;\n    bn_check_top(b);\n    if (words > (INT_MAX / (4 * BN_BITS2))) {\n        BNerr(BN_F_BN_EXPAND_INTERNAL, BN_R_BIGNUM_TOO_LONG);\n        return NULL;\n    }\n    if (BN_get_flags(b, BN_FLG_STATIC_DATA)) {\n        BNerr(BN_F_BN_EXPAND_INTERNAL, BN_R_EXPAND_ON_STATIC_BIGNUM_DATA);\n        return (NULL);\n    }\n    if (BN_get_flags(b,BN_FLG_SECURE))\n        a = A = OPENSSL_secure_malloc(words * sizeof(*a));\n    else\n        a = A = OPENSSL_malloc(words * sizeof(*a));\n    if (A == NULL) {\n        BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);\n        return (NULL);\n    }\n#ifdef PURIFY\n    memset(a, 0, sizeof(*a) * words);\n#endif\n#if 1\n    B = b->d;\n    if (B != NULL) {\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        }\n    }\n#else\n    memset(A, 0, sizeof(*A) * words);\n    memcpy(A, b->d, sizeof(b->d[0]) * b->top);\n#endif\n    return (a);\n}']