crypto/ec/ec2_oct.c:85: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_GF2m_add`.
Showing all 16 steps of the trace


crypto/ec/ec2_oct.c:68:11: Call
66.   
67.       BN_CTX_start(ctx);
68.       tmp = BN_CTX_get(ctx);
                ^
69.       x = BN_CTX_get(ctx);
70.       y = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:229:5: Call
  227.       }
  228.       /* OK, make sure the returned bignum is "zero" */
  229.       BN_zero(ret);
             ^
  230.       ctx->used++;
  231.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:402:15: Assignment
    400.       a->neg = 0;
    401.       a->d[0] = w;
    402.       a->top = (w ? 1 : 0);
                         ^
    403.       bn_check_top(a);
    404.       return (1);

crypto/bn/bn_lib.c:402:5: Assignment
    400.       a->neg = 0;
    401.       a->d[0] = w;
    402.       a->top = (w ? 1 : 0);
               ^
    403.       bn_check_top(a);
    404.       return (1);

crypto/ec/ec2_oct.c:85:14: Call
83.           if (!group->meth->field_div(group, tmp, group->b, tmp, ctx))
84.               goto err;
85.           if (!BN_GF2m_add(tmp, group->a, tmp))
                   ^
86.               goto err;
87.           if (!BN_GF2m_add(tmp, x, tmp))

crypto/bn/bn_gf2m.c:260:1: Parameter `*r->d`
  258.    * could be equal; r is the bitwise XOR of a and b.
  259.    */
  260. > int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  261.   {
  262.       int i;

crypto/bn/bn_gf2m.c:276:9: Call
  274.       }
  275.   
  276.       if (bn_wexpand(r, at->top) == NULL)
                 ^
  277.           return 0;
  278.   

crypto/bn/bn_lib.c:948:1: Parameter `*a->d`
    946.   }
    947.   
    948. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
    949.   {
    950.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:950:37: Call
    948.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
    949.   {
    950.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                               ^
    951.   }
    952.   

crypto/bn/bn_lib.c:284:1: Parameter `*b->d`
      282.    */
      283.   
      284. > BIGNUM *bn_expand2(BIGNUM *b, int words)
      285.   {
      286.       bn_check_top(b);

crypto/bn/bn_lib.c:289:23: Call
      287.   
      288.       if (words > b->dmax) {
      289.           BN_ULONG *a = bn_expand_internal(b, words);
                                   ^
      290.           if (!a)
      291.               return NULL;

crypto/bn/bn_lib.c:246:1: <Offset trace>
244.   /* This is used by bn_expand2() */
245.   /* The caller MUST check that words > b->dmax before calling this */
246. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
247.   {
248.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:246:1: Parameter `b->top`
        244.   /* This is used by bn_expand2() */
        245.   /* The caller MUST check that words > b->dmax before calling this */
        246. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
        247.   {
        248.       BN_ULONG *a = NULL;

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

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

crypto/bn/bn_lib.c:271:9: Array access: Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_GF2m_add` 
        269.       assert(b->top <= words);
        270.       if (b->top > 0)
        271.           memcpy(a, b->d, sizeof(*a) * b->top);
                       ^
        272.   
        273.       return a;

static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
{
    BN_ULONG *a = NULL;
    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 = OPENSSL_secure_zalloc(words * sizeof(*a));
    else
        a = OPENSSL_zalloc(words * sizeof(*a));
    if (a == NULL) {
        BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);
        return (NULL);
    }
    assert(b->top <= words);
    if (b->top > 0)
        memcpy(a, b->d, sizeof(*a) * b->top);
    return a;
}
['int ec_GF2m_simple_set_compressed_coordinates(const EC_GROUP *group,\n                                              EC_POINT *point,\n                                              const BIGNUM *x_, int y_bit,\n                                              BN_CTX *ctx)\n{\n    BN_CTX *new_ctx = NULL;\n    BIGNUM *tmp, *x, *y, *z;\n    int ret = 0, z0;\n    ERR_clear_error();\n    if (ctx == NULL) {\n        ctx = new_ctx = BN_CTX_new();\n        if (ctx == NULL)\n            return 0;\n    }\n    y_bit = (y_bit != 0) ? 1 : 0;\n    BN_CTX_start(ctx);\n    tmp = BN_CTX_get(ctx);\n    x = BN_CTX_get(ctx);\n    y = BN_CTX_get(ctx);\n    z = BN_CTX_get(ctx);\n    if (z == NULL)\n        goto err;\n    if (!BN_GF2m_mod_arr(x, x_, group->poly))\n        goto err;\n    if (BN_is_zero(x)) {\n        if (!BN_GF2m_mod_sqrt_arr(y, group->b, group->poly, ctx))\n            goto err;\n    } else {\n        if (!group->meth->field_sqr(group, tmp, x, ctx))\n            goto err;\n        if (!group->meth->field_div(group, tmp, group->b, tmp, ctx))\n            goto err;\n        if (!BN_GF2m_add(tmp, group->a, tmp))\n            goto err;\n        if (!BN_GF2m_add(tmp, x, tmp))\n            goto err;\n        if (!BN_GF2m_mod_solve_quad_arr(z, tmp, group->poly, ctx)) {\n            unsigned long err = ERR_peek_last_error();\n            if (ERR_GET_LIB(err) == ERR_LIB_BN\n                && ERR_GET_REASON(err) == BN_R_NO_SOLUTION) {\n                ERR_clear_error();\n                ECerr(EC_F_EC_GF2M_SIMPLE_SET_COMPRESSED_COORDINATES,\n                      EC_R_INVALID_COMPRESSED_POINT);\n            } else\n                ECerr(EC_F_EC_GF2M_SIMPLE_SET_COMPRESSED_COORDINATES,\n                      ERR_R_BN_LIB);\n            goto err;\n        }\n        z0 = (BN_is_odd(z)) ? 1 : 0;\n        if (!group->meth->field_mul(group, y, x, z, ctx))\n            goto err;\n        if (z0 != y_bit) {\n            if (!BN_GF2m_add(y, y, x))\n                goto err;\n        }\n    }\n    if (!EC_POINT_set_affine_coordinates_GF2m(group, point, x, y, 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 = NULL;\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 = OPENSSL_secure_zalloc(words * sizeof(*a));\n    else\n        a = OPENSSL_zalloc(words * sizeof(*a));\n    if (a == NULL) {\n        BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);\n        return (NULL);\n    }\n    assert(b->top <= words);\n    if (b->top > 0)\n        memcpy(a, b->d, sizeof(*a) * b->top);\n    return a;\n}']