test/ectest.c:59: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 67108856] by call to `BN_set_word`.
Showing all 21 steps of the trace


test/ectest.c:47:10: Call
45.           goto err;
46.   
47.       if (!TEST_true(EC_GROUP_get_order(group, order, ctx))
               ^
48.           || !TEST_true(EC_POINT_mul(group, Q, order, NULL, NULL, ctx))
49.           || !TEST_true(EC_POINT_is_at_infinity(group, Q))

crypto/ec/ec_lib.c:316:1: Parameter `order->top`
  314.   }
  315.   
  316. > int EC_GROUP_get_order(const EC_GROUP *group, BIGNUM *order, BN_CTX *ctx)
  317.   {
  318.       if (group->order == NULL)

test/ectest.c:59:14: Call
57.           const EC_POINT *points[6];
58.   
59.           if (!TEST_true(BN_set_word(n1, i))
                   ^
60.               /*
61.                * If i == 1, P will be the predefined generator for which

crypto/bn/bn_lib.c:387:1: Parameter `a->top`
  385.   }
  386.   
  387. > int BN_set_word(BIGNUM *a, BN_ULONG w)
  388.   {
  389.       bn_check_top(a);

crypto/bn/bn_lib.c:390:9: Call
  388.   {
  389.       bn_check_top(a);
  390.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                 ^
  391.           return 0;
  392.       a->neg = 0;

crypto/bn/bn_lcl.h:651:1: Parameter `a->top`
    649.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
    650.   
    651. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
    652.   {
    653.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_lcl.h:659:12: Call
    657.           return a;
    658.   
    659.       return bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2);
                      ^
    660.   }
    661.   

crypto/bn/bn_lib.c:273:1: Parameter `b->top`
      271.    */
      272.   
      273. > BIGNUM *bn_expand2(BIGNUM *b, int words)
      274.   {
      275.       bn_check_top(b);

crypto/bn/bn_lib.c:278:23: Call
      276.   
      277.       if (words > b->dmax) {
      278.           BN_ULONG *a = bn_expand_internal(b, words);
                                   ^
      279.           if (!a)
      280.               return NULL;

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

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

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

crypto/bn/bn_lib.c:235:1: Parameter `words`
        233.   /* This is used by bn_expand2() */
        234.   /* The caller MUST check that words > b->dmax before calling this */
        235. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
        236.   {
        237.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:252:13: Call
        250.           a = OPENSSL_secure_zalloc(words * sizeof(*a));
        251.       else
        252.           a = OPENSSL_zalloc(words * sizeof(*a));
                           ^
        253.       if (a == NULL) {
        254.           BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);

crypto/mem.c:218:1: Parameter `num`
          216.   }
          217.   
          218. > void *CRYPTO_zalloc(size_t num, const char *file, int line)
          219.   {
          220.       void *ret = CRYPTO_malloc(num, file, line);

crypto/mem.c:220:17: Call
          218.   void *CRYPTO_zalloc(size_t num, const char *file, int line)
          219.   {
          220.       void *ret = CRYPTO_malloc(num, file, line);
                                 ^
          221.   
          222.       FAILTEST();

crypto/mem.c:198:9: Assignment
            196.   
            197.       if (num == 0)
            198.           return NULL;
                           ^
            199.   
            200.       FAILTEST();

crypto/mem.c:220:5: Assignment
          218.   void *CRYPTO_zalloc(size_t num, const char *file, int line)
          219.   {
          220.       void *ret = CRYPTO_malloc(num, file, line);
                     ^
          221.   
          222.       FAILTEST();

crypto/mem.c:225:5: Assignment
          223.       if (ret != NULL)
          224.           memset(ret, 0, num);
          225.       return ret;
                     ^
          226.   }
          227.   

crypto/bn/bn_lib.c:252:9: Assignment
        250.           a = OPENSSL_secure_zalloc(words * sizeof(*a));
        251.       else
        252.           a = OPENSSL_zalloc(words * sizeof(*a));
                       ^
        253.       if (a == NULL) {
        254.           BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);

crypto/bn/bn_lib.c:260:9: Array access: Offset added: [8, +oo] Size: [0, 67108856] by call to `BN_set_word` 
        258.       assert(b->top <= words);
        259.       if (b->top > 0)
        260.           memcpy(a, b->d, sizeof(*a) * b->top);
                       ^
        261.   
        262.       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;
}
['static int group_order_tests(EC_GROUP *group)\n{\n    BIGNUM *n1 = NULL, *n2 = NULL, *order = NULL;\n    EC_POINT *P = NULL, *Q = NULL, *R = NULL, *S = NULL;\n    BN_CTX *ctx = NULL;\n    int i = 0, r = 0;\n    if (!TEST_ptr(n1 = BN_new())\n        || !TEST_ptr(n2 = BN_new())\n        || !TEST_ptr(order = BN_new())\n        || !TEST_ptr(ctx = BN_CTX_new())\n        || !TEST_ptr(P = EC_POINT_new(group))\n        || !TEST_ptr(Q = EC_POINT_new(group))\n        || !TEST_ptr(R = EC_POINT_new(group))\n        || !TEST_ptr(S = EC_POINT_new(group)))\n        goto err;\n    if (!TEST_true(EC_GROUP_get_order(group, order, ctx))\n        || !TEST_true(EC_POINT_mul(group, Q, order, NULL, NULL, ctx))\n        || !TEST_true(EC_POINT_is_at_infinity(group, Q))\n        || !TEST_true(EC_GROUP_precompute_mult(group, ctx))\n        || !TEST_true(EC_POINT_mul(group, Q, order, NULL, NULL, ctx))\n        || !TEST_true(EC_POINT_is_at_infinity(group, Q)))\n        goto err;\n    for (i = 1; i <= 2; i++) {\n        const BIGNUM *scalars[6];\n        const EC_POINT *points[6];\n        if (!TEST_true(BN_set_word(n1, i))\n            || !TEST_true(EC_POINT_mul(group, P, n1, NULL, NULL, ctx))\n            || !TEST_true(BN_one(n1))\n            || !TEST_true(BN_sub(n1, n1, order))\n            || !TEST_true(EC_POINT_mul(group, Q, NULL, P, n1, ctx))\n            || !TEST_int_eq(0, EC_POINT_cmp(group, Q, P, ctx))\n            || !TEST_true(BN_add(n2, order, BN_value_one()))\n            || !TEST_true(EC_POINT_mul(group, Q, NULL, P, n2, ctx))\n            || !TEST_int_eq(0, EC_POINT_cmp(group, Q, P, ctx))\n            || !TEST_true(BN_mul(n2, n1, n2, ctx))\n            || !TEST_true(EC_POINT_mul(group, Q, NULL, P, n2, ctx))\n            || !TEST_int_eq(0, EC_POINT_cmp(group, Q, P, ctx)))\n            goto err;\n        BN_set_negative(n2, 0);\n        if (!TEST_true(EC_POINT_mul(group, Q, NULL, P, n2, ctx))\n            || !TEST_true(EC_POINT_add(group, Q, Q, P, ctx))\n            || !TEST_true(EC_POINT_is_at_infinity(group, Q))\n            || !TEST_false(EC_POINT_is_at_infinity(group, P)))\n            goto err;\n        scalars[0] = scalars[1] = BN_value_one();\n        points[0]  = points[1]  = P;\n        if (!TEST_true(EC_POINTs_mul(group, R, NULL, 2, points, scalars, ctx))\n            || !TEST_true(EC_POINT_dbl(group, S, points[0], ctx))\n            || !TEST_int_eq(0, EC_POINT_cmp(group, R, S, ctx)))\n            goto err;\n        scalars[0] = n1;\n        points[0] = Q;\n        scalars[1] = n2;\n        points[1] = P;\n        scalars[2] = n1;\n        points[2] = Q;\n        scalars[3] = n2;\n        points[3] = Q;\n        scalars[4] = n1;\n        points[4] = P;\n        scalars[5] = n2;\n        points[5] = Q;\n        if (!TEST_true(EC_POINTs_mul(group, P, NULL, 6, points, scalars, ctx))\n            || !TEST_true(EC_POINT_is_at_infinity(group, P)))\n            goto err;\n    }\n    r = 1;\nerr:\n    if (r == 0 && i != 0)\n        TEST_info(i == 1 ? "allowing precomputation" :\n                           "without precomputation");\n    EC_POINT_free(P);\n    EC_POINT_free(Q);\n    EC_POINT_free(R);\n    EC_POINT_free(S);\n    BN_free(n1);\n    BN_free(n2);\n    BN_free(order);\n    BN_CTX_free(ctx);\n    return r;\n}', 'int EC_GROUP_get_order(const EC_GROUP *group, BIGNUM *order, BN_CTX *ctx)\n{\n    if (group->order == NULL)\n        return 0;\n    if (!BN_copy(order, group->order))\n        return 0;\n    return !BN_is_zero(order);\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}', 'static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)\n{\n    if (bits > (INT_MAX - BN_BITS2 + 1))\n        return NULL;\n    if (((bits+BN_BITS2-1)/BN_BITS2) <= (a)->dmax)\n        return a;\n    return bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2);\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}', 'void *CRYPTO_zalloc(size_t num, const char *file, int line)\n{\n    void *ret = CRYPTO_malloc(num, file, line);\n    FAILTEST();\n    if (ret != NULL)\n        memset(ret, 0, num);\n    return ret;\n}', 'void *CRYPTO_malloc(size_t num, const char *file, int line)\n{\n    void *ret = NULL;\n    INCREMENT(malloc_count);\n    if (malloc_impl != NULL && malloc_impl != CRYPTO_malloc)\n        return malloc_impl(num, file, line);\n    if (num == 0)\n        return NULL;\n    FAILTEST();\n    allow_customize = 0;\n#ifndef OPENSSL_NO_CRYPTO_MDEBUG\n    if (call_malloc_debug) {\n        CRYPTO_mem_debug_malloc(NULL, num, 0, file, line);\n        ret = malloc(num);\n        CRYPTO_mem_debug_malloc(ret, num, 1, file, line);\n    } else {\n        ret = malloc(num);\n    }\n#else\n    (void)(file); (void)(line);\n    ret = malloc(num);\n#endif\n    return ret;\n}']