test/bntest.c:1890: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mul`.
Showing all 13 steps of the trace


test/bntest.c:1886:10: Call
1884.   
1885.       /* Test that BN_mul never gives negative zero. */
1886.       if (!BN_set_word(a, 1))
                 ^
1887.           goto err;
1888.       BN_set_negative(a, 1);

crypto/bn/bn_lib.c:463:1: Parameter `*a->d`
  461.   }
  462.   
  463. > int BN_set_word(BIGNUM *a, BN_ULONG w)
  464.   {
  465.       bn_check_top(a);

crypto/bn/bn_lib.c:466:9: Call
  464.   {
  465.       bn_check_top(a);
  466.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                 ^
  467.           return (0);
  468.       a->neg = 0;

crypto/bn/bn_lcl.h:674:1: Parameter `*a->d`
    672.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
    673.   
    674. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
    675.   {
    676.       if (bits > (INT_MAX - BN_BITS2 + 1))

test/bntest.c:1890:10: Call
1888.       BN_set_negative(a, 1);
1889.       BN_zero(b);
1890.       if (!BN_mul(c, a, b, ctx))
                 ^
1891.           goto err;
1892.       if (!BN_is_zero(c) || BN_is_negative(c)) {

crypto/bn/bn_mul.c:878:13: Assignment
  876.               if (bn_wexpand(rr, 16) == NULL)
  877.                   goto err;
  878.               rr->top = 16;
                     ^
  879.               bn_mul_comba8(rr->d, a->d, b->d);
  880.               goto end;

crypto/bn/bn_mul.c:972:5: Call
  970.   #endif
  971.       rr->neg = a->neg ^ b->neg;
  972.       bn_correct_top(rr);
             ^
  973.       if (r != rr && BN_copy(r, rr) == NULL)
  974.           goto err;

crypto/bn/bn_lib.c:1021:1: <Offset trace>
1019.   }
1020.   
1021. > void bn_correct_top(BIGNUM *a)
1022.   {
1023.       BN_ULONG *ftl;

crypto/bn/bn_lib.c:1021:1: Parameter `a->top`
    1019.   }
    1020.   
    1021. > void bn_correct_top(BIGNUM *a)
    1022.   {
    1023.       BN_ULONG *ftl;

crypto/bn/bn_lib.c:1024:5: Assignment
    1022.   {
    1023.       BN_ULONG *ftl;
    1024.       int tmp_top = a->top;
                ^
    1025.   
    1026.       if (tmp_top > 0) {

crypto/bn/bn_lib.c:1021:1: <Length trace>
1019.   }
1020.   
1021. > void bn_correct_top(BIGNUM *a)
1022.   {
1023.       BN_ULONG *ftl;

crypto/bn/bn_lib.c:1021:1: Parameter `*a->d`
    1019.   }
    1020.   
    1021. > void bn_correct_top(BIGNUM *a)
    1022.   {
    1023.       BN_ULONG *ftl;

crypto/bn/bn_lib.c:1027:14: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mul` 
    1025.   
    1026.       if (tmp_top > 0) {
    1027.           for (ftl = &(a->d[tmp_top]); tmp_top > 0; tmp_top--) {
                         ^
    1028.               ftl--;
    1029.               if (*ftl != 0)

void bn_correct_top(BIGNUM *a)
{
    BN_ULONG *ftl;
    int tmp_top = a->top;
    if (tmp_top > 0) {
        for (ftl = &(a->d[tmp_top]); tmp_top > 0; tmp_top--) {
            ftl--;
            if (*ftl != 0)
                break;
        }
        a->top = tmp_top;
    }
    if (a->top == 0)
        a->neg = 0;
    bn_pollute(a);
}
['static int test_negzero()\n{\n    BIGNUM *a = BN_new();\n    BIGNUM *b = BN_new();\n    BIGNUM *c = BN_new();\n    BIGNUM *d = BN_new();\n    BIGNUM *numerator = NULL, *denominator = NULL;\n    int consttime, st = 0;\n    if (a == NULL || b == NULL || c == NULL || d == NULL)\n        goto err;\n    if (!BN_set_word(a, 1))\n        goto err;\n    BN_set_negative(a, 1);\n    BN_zero(b);\n    if (!BN_mul(c, a, b, ctx))\n        goto err;\n    if (!BN_is_zero(c) || BN_is_negative(c)) {\n        fprintf(stderr, "Multiplication test failed!\\n");\n        goto err;\n    }\n    for (consttime = 0; consttime < 2; consttime++) {\n        numerator = BN_new();\n        denominator = BN_new();\n        if (numerator == NULL || denominator == NULL)\n            goto err;\n        if (consttime) {\n            BN_set_flags(numerator, BN_FLG_CONSTTIME);\n            BN_set_flags(denominator, BN_FLG_CONSTTIME);\n        }\n        if (!BN_set_word(numerator, 1) || !BN_set_word(denominator, 2))\n            goto err;\n        BN_set_negative(numerator, 1);\n        if (!BN_div(a, b, numerator, denominator, ctx))\n            goto err;\n        if (!BN_is_zero(a) || BN_is_negative(a)) {\n            fprintf(stderr, "Incorrect quotient (consttime = %d).\\n",\n                    consttime);\n            goto err;\n        }\n        if (!BN_set_word(denominator, 1))\n            goto err;\n        if (!BN_div(a, b, numerator, denominator, ctx))\n            goto err;\n        if (!BN_is_zero(b) || BN_is_negative(b)) {\n            fprintf(stderr, "Incorrect remainder (consttime = %d).\\n",\n                    consttime);\n            goto err;\n        }\n        BN_free(numerator);\n        BN_free(denominator);\n        numerator = denominator = NULL;\n    }\n    BN_zero(a);\n    BN_set_negative(a, 1);\n    if (BN_is_negative(a)) {\n        fprintf(stderr, "BN_set_negative produced a negative zero.\\n");\n        goto err;\n    }\n    st = 1;\nerr:\n    BN_free(a);\n    BN_free(b);\n    BN_free(c);\n    BN_free(d);\n    BN_free(numerator);\n    BN_free(denominator);\n    return st;\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}', 'int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)\n{\n    int ret = 0;\n    int top, al, bl;\n    BIGNUM *rr;\n#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)\n    int i;\n#endif\n#ifdef BN_RECURSION\n    BIGNUM *t = NULL;\n    int j = 0, k;\n#endif\n    bn_check_top(a);\n    bn_check_top(b);\n    bn_check_top(r);\n    al = a->top;\n    bl = b->top;\n    if ((al == 0) || (bl == 0)) {\n        BN_zero(r);\n        return (1);\n    }\n    top = al + bl;\n    BN_CTX_start(ctx);\n    if ((r == a) || (r == b)) {\n        if ((rr = BN_CTX_get(ctx)) == NULL)\n            goto err;\n    } else\n        rr = r;\n#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)\n    i = al - bl;\n#endif\n#ifdef BN_MUL_COMBA\n    if (i == 0) {\n# if 0\n        if (al == 4) {\n            if (bn_wexpand(rr, 8) == NULL)\n                goto err;\n            rr->top = 8;\n            bn_mul_comba4(rr->d, a->d, b->d);\n            goto end;\n        }\n# endif\n        if (al == 8) {\n            if (bn_wexpand(rr, 16) == NULL)\n                goto err;\n            rr->top = 16;\n            bn_mul_comba8(rr->d, a->d, b->d);\n            goto end;\n        }\n    }\n#endif\n#ifdef BN_RECURSION\n    if ((al >= BN_MULL_SIZE_NORMAL) && (bl >= BN_MULL_SIZE_NORMAL)) {\n        if (i >= -1 && i <= 1) {\n            if (i >= 0) {\n                j = BN_num_bits_word((BN_ULONG)al);\n            }\n            if (i == -1) {\n                j = BN_num_bits_word((BN_ULONG)bl);\n            }\n            j = 1 << (j - 1);\n            assert(j <= al || j <= bl);\n            k = j + j;\n            t = BN_CTX_get(ctx);\n            if (t == NULL)\n                goto err;\n            if (al > j || bl > j) {\n                if (bn_wexpand(t, k * 4) == NULL)\n                    goto err;\n                if (bn_wexpand(rr, k * 4) == NULL)\n                    goto err;\n                bn_mul_part_recursive(rr->d, a->d, b->d,\n                                      j, al - j, bl - j, t->d);\n            } else {\n                if (bn_wexpand(t, k * 2) == NULL)\n                    goto err;\n                if (bn_wexpand(rr, k * 2) == NULL)\n                    goto err;\n                bn_mul_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d);\n            }\n            rr->top = top;\n            goto end;\n        }\n# if 0\n        if (i == 1 && !BN_get_flags(b, BN_FLG_STATIC_DATA)) {\n            BIGNUM *tmp_bn = (BIGNUM *)b;\n            if (bn_wexpand(tmp_bn, al) == NULL)\n                goto err;\n            tmp_bn->d[bl] = 0;\n            bl++;\n            i--;\n        } else if (i == -1 && !BN_get_flags(a, BN_FLG_STATIC_DATA)) {\n            BIGNUM *tmp_bn = (BIGNUM *)a;\n            if (bn_wexpand(tmp_bn, bl) == NULL)\n                goto err;\n            tmp_bn->d[al] = 0;\n            al++;\n            i++;\n        }\n        if (i == 0) {\n            j = BN_num_bits_word((BN_ULONG)al);\n            j = 1 << (j - 1);\n            k = j + j;\n            t = BN_CTX_get(ctx);\n            if (al == j) {\n                if (bn_wexpand(t, k * 2) == NULL)\n                    goto err;\n                if (bn_wexpand(rr, k * 2) == NULL)\n                    goto err;\n                bn_mul_recursive(rr->d, a->d, b->d, al, t->d);\n            } else {\n                if (bn_wexpand(t, k * 4) == NULL)\n                    goto err;\n                if (bn_wexpand(rr, k * 4) == NULL)\n                    goto err;\n                bn_mul_part_recursive(rr->d, a->d, b->d, al - j, j, t->d);\n            }\n            rr->top = top;\n            goto end;\n        }\n# endif\n    }\n#endif\n    if (bn_wexpand(rr, top) == NULL)\n        goto err;\n    rr->top = top;\n    bn_mul_normal(rr->d, a->d, al, b->d, bl);\n#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)\n end:\n#endif\n    rr->neg = a->neg ^ b->neg;\n    bn_correct_top(rr);\n    if (r != rr && BN_copy(r, rr) == NULL)\n        goto err;\n    ret = 1;\n err:\n    bn_check_top(r);\n    BN_CTX_end(ctx);\n    return (ret);\n}', 'void bn_correct_top(BIGNUM *a)\n{\n    BN_ULONG *ftl;\n    int tmp_top = a->top;\n    if (tmp_top > 0) {\n        for (ftl = &(a->d[tmp_top]); tmp_top > 0; tmp_top--) {\n            ftl--;\n            if (*ftl != 0)\n                break;\n        }\n        a->top = tmp_top;\n    }\n    if (a->top == 0)\n        a->neg = 0;\n    bn_pollute(a);\n}']