crypto/ec/ec2_smpl.c:523: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_GF2m_add`.
Showing all 14 steps of the trace


crypto/ec/ec2_smpl.c:484:10: Call
482.   
483.       BN_CTX_start(ctx);
484.       x0 = BN_CTX_get(ctx);
                ^
485.       y0 = BN_CTX_get(ctx);
486.       x1 = 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/ec2_smpl.c:523:14: Call
521.           if (!group->meth->field_sqr(group, x2, s, ctx))
522.               goto err;
523.           if (!BN_GF2m_add(x2, x2, group->a))
                    ^
524.               goto err;
525.           if (!BN_GF2m_add(x2, x2, s))

crypto/bn/bn_gf2m.c:331:1: Parameter `*r->d`
  329.    * could be equal; r is the bitwise XOR of a and b.
  330.    */
  331. > int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  332.   {
  333.       int i;

crypto/bn/bn_gf2m.c:347:9: Call
  345.       }
  346.   
  347.       if (bn_wexpand(r, at->top) == NULL)
                 ^
  348.           return 0;
  349.   

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_GF2m_add` 
        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_GF2m_simple_add(const EC_GROUP *group, EC_POINT *r, const EC_POINT *a,\n                       const EC_POINT *b, BN_CTX *ctx)\n{\n    BN_CTX *new_ctx = NULL;\n    BIGNUM *x0, *y0, *x1, *y1, *x2, *y2, *s, *t;\n    int ret = 0;\n    if (EC_POINT_is_at_infinity(group, a)) {\n        if (!EC_POINT_copy(r, b))\n            return 0;\n        return 1;\n    }\n    if (EC_POINT_is_at_infinity(group, b)) {\n        if (!EC_POINT_copy(r, a))\n            return 0;\n        return 1;\n    }\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    x0 = BN_CTX_get(ctx);\n    y0 = BN_CTX_get(ctx);\n    x1 = BN_CTX_get(ctx);\n    y1 = BN_CTX_get(ctx);\n    x2 = BN_CTX_get(ctx);\n    y2 = BN_CTX_get(ctx);\n    s = BN_CTX_get(ctx);\n    t = BN_CTX_get(ctx);\n    if (t == NULL)\n        goto err;\n    if (a->Z_is_one) {\n        if (!BN_copy(x0, a->X))\n            goto err;\n        if (!BN_copy(y0, a->Y))\n            goto err;\n    } else {\n        if (!EC_POINT_get_affine_coordinates_GF2m(group, a, x0, y0, ctx))\n            goto err;\n    }\n    if (b->Z_is_one) {\n        if (!BN_copy(x1, b->X))\n            goto err;\n        if (!BN_copy(y1, b->Y))\n            goto err;\n    } else {\n        if (!EC_POINT_get_affine_coordinates_GF2m(group, b, x1, y1, ctx))\n            goto err;\n    }\n    if (BN_GF2m_cmp(x0, x1)) {\n        if (!BN_GF2m_add(t, x0, x1))\n            goto err;\n        if (!BN_GF2m_add(s, y0, y1))\n            goto err;\n        if (!group->meth->field_div(group, s, s, t, ctx))\n            goto err;\n        if (!group->meth->field_sqr(group, x2, s, ctx))\n            goto err;\n        if (!BN_GF2m_add(x2, x2, group->a))\n            goto err;\n        if (!BN_GF2m_add(x2, x2, s))\n            goto err;\n        if (!BN_GF2m_add(x2, x2, t))\n            goto err;\n    } else {\n        if (BN_GF2m_cmp(y0, y1) || BN_is_zero(x1)) {\n            if (!EC_POINT_set_to_infinity(group, r))\n                goto err;\n            ret = 1;\n            goto err;\n        }\n        if (!group->meth->field_div(group, s, y1, x1, ctx))\n            goto err;\n        if (!BN_GF2m_add(s, s, x1))\n            goto err;\n        if (!group->meth->field_sqr(group, x2, s, ctx))\n            goto err;\n        if (!BN_GF2m_add(x2, x2, s))\n            goto err;\n        if (!BN_GF2m_add(x2, x2, group->a))\n            goto err;\n    }\n    if (!BN_GF2m_add(y2, x1, x2))\n        goto err;\n    if (!group->meth->field_mul(group, y2, y2, s, ctx))\n        goto err;\n    if (!BN_GF2m_add(y2, y2, x2))\n        goto err;\n    if (!BN_GF2m_add(y2, y2, y1))\n        goto err;\n    if (!EC_POINT_set_affine_coordinates_GF2m(group, r, x2, y2, ctx))\n        goto err;\n    ret = 1;\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_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)\n{\n    int i;\n    const BIGNUM *at, *bt;\n    bn_check_top(a);\n    bn_check_top(b);\n    if (a->top < b->top) {\n        at = b;\n        bt = a;\n    } else {\n        at = a;\n        bt = b;\n    }\n    if (bn_wexpand(r, at->top) == NULL)\n        return 0;\n    for (i = 0; i < bt->top; i++) {\n        r->d[i] = at->d[i] ^ bt->d[i];\n    }\n    for (; i < at->top; i++) {\n        r->d[i] = at->d[i];\n    }\n    r->top = at->top;\n    bn_correct_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}']