test/dhtest.c:50: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `DH_check`.
Showing all 16 steps of the trace


test/dhtest.c:46:17: Call
44.       BN_GENCB_set(_cb, &cb, NULL);
45.       if (!TEST_ptr(a = DH_new())
46.               || !TEST_true(DH_generate_parameters_ex(a, 64,
                      ^
47.                                                       DH_GENERATOR_5, _cb)))
48.           goto err;

crypto/dh/dh_gen.c:23:1: Parameter `ret->p->top`
  21.                                   BN_GENCB *cb);
  22.   
  23. > int DH_generate_parameters_ex(DH *ret, int prime_len, int generator,
  24.                                 BN_GENCB *cb)
  25.   {

test/dhtest.c:50:10: Call
48.           goto err;
49.   
50.       if (!DH_check(a, &i))
               ^
51.           goto err;
52.       if (!TEST_false(i & DH_CHECK_P_NOT_PRIME)

crypto/dh/dh_check.c:101:1: Parameter `dh->p->top`
  99.   }
  100.   
  101. > int DH_check(const DH *dh, int *ret)
  102.   {
  103.       int ok = 0, r;

crypto/dh/dh_check.c:136:14: Call
  134.               *ret |= DH_CHECK_Q_NOT_PRIME;
  135.           /* Check p == 1 mod q  i.e. q divides p - 1 */
  136.           if (!BN_div(t1, t2, dh->p, dh->q, ctx))
                      ^
  137.               goto err;
  138.           if (!BN_is_one(t2))

crypto/bn/bn_div.c:137:1: Parameter `num->top`
    135.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
    136.    */
    137. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
    138.              BN_CTX *ctx)
    139.   {

crypto/bn/bn_div.c:204:11: Call
    202.       sdiv->neg = 0;
    203.       norm_shift += BN_BITS2;
    204.       if (!(BN_lshift(snum, num, norm_shift)))
                     ^
    205.           goto err;
    206.       snum->neg = 0;

crypto/bn/bn_shift.c:83:1: <Offset trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `n`
      81.   }
      82.   
      83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
      84.   {
      85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:5: Assignment
      95.       }
      96.   
      97.       nw = n / BN_BITS2;
                 ^
      98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
      99.           return 0;

crypto/bn/bn_shift.c:83:1: <Length trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `*r->d`
      81.   }
      82.   
      83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
      84.   {
      85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:98:9: Call
      96.   
      97.       nw = n / BN_BITS2;
      98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                     ^
      99.           return 0;
      100.       r->neg = a->neg;

crypto/bn/bn_lib.c:940:1: Parameter `*a->d`
        938.   }
        939.   
        940. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        941.   {
        942.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:104:5: Assignment
      102.       rb = BN_BITS2 - lb;
      103.       f = a->d;
      104.       t = r->d;
                 ^
      105.       t[a->top + nw] = 0;
      106.       if (lb == 0)

crypto/bn/bn_shift.c:112:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `DH_check` 
      110.           for (i = a->top - 1; i >= 0; i--) {
      111.               l = f[i];
      112.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                         ^
      113.               t[nw + i] = (l << lb) & BN_MASK2;
      114.           }

int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
{
    int i, nw, lb, rb;
    BN_ULONG *t, *f;
    BN_ULONG l;
    bn_check_top(r);
    bn_check_top(a);
    if (n < 0) {
        BNerr(BN_F_BN_LSHIFT, BN_R_INVALID_SHIFT);
        return 0;
    }
    nw = n / BN_BITS2;
    if (bn_wexpand(r, a->top + nw + 1) == NULL)
        return 0;
    r->neg = a->neg;
    lb = n % BN_BITS2;
    rb = BN_BITS2 - lb;
    f = a->d;
    t = r->d;
    t[a->top + nw] = 0;
    if (lb == 0)
        for (i = a->top - 1; i >= 0; i--)
            t[nw + i] = f[i];
    else
        for (i = a->top - 1; i >= 0; i--) {
            l = f[i];
            t[nw + i + 1] |= (l >> rb) & BN_MASK2;
            t[nw + i] = (l << lb) & BN_MASK2;
        }
    memset(t, 0, sizeof(*t) * nw);
    r->top = a->top + nw + 1;
    bn_correct_top(r);
    bn_check_top(r);
    return 1;
}
['static int dh_test(void)\n{\n    BN_GENCB *_cb = NULL;\n    DH *a = NULL;\n    DH *b = NULL;\n    DH *c = NULL;\n    const BIGNUM *ap = NULL, *ag = NULL, *apub_key = NULL;\n    const BIGNUM *bpub_key = NULL, *bpriv_key = NULL;\n    BIGNUM *bp = NULL, *bg = NULL, *cpriv_key = NULL;\n    unsigned char *abuf = NULL;\n    unsigned char *bbuf = NULL;\n    unsigned char *cbuf = NULL;\n    int i, alen, blen, clen, aout, bout, cout;\n    int ret = 0;\n    if (!TEST_ptr(_cb = BN_GENCB_new()))\n        goto err;\n    BN_GENCB_set(_cb, &cb, NULL);\n    if (!TEST_ptr(a = DH_new())\n            || !TEST_true(DH_generate_parameters_ex(a, 64,\n                                                    DH_GENERATOR_5, _cb)))\n        goto err;\n    if (!DH_check(a, &i))\n        goto err;\n    if (!TEST_false(i & DH_CHECK_P_NOT_PRIME)\n            || !TEST_false(i & DH_CHECK_P_NOT_SAFE_PRIME)\n            || !TEST_false(i & DH_UNABLE_TO_CHECK_GENERATOR)\n            || !TEST_false(i & DH_NOT_SUITABLE_GENERATOR))\n        goto err;\n    DH_get0_pqg(a, &ap, NULL, &ag);\n    if (!TEST_ptr(b = DH_new()))\n        goto err;\n    if (!TEST_ptr(bp = BN_dup(ap))\n            || !TEST_ptr(bg = BN_dup(ag))\n            || !TEST_true(DH_set0_pqg(b, bp, NULL, bg)))\n        goto err;\n    bp = bg = NULL;\n    if (!DH_generate_key(a))\n        goto err;\n    DH_get0_key(a, &apub_key, NULL);\n    if (!DH_generate_key(b))\n        goto err;\n    DH_get0_key(b, &bpub_key, &bpriv_key);\n    if (!TEST_ptr(c = DHparams_dup(b))\n            || !TEST_ptr(cpriv_key = BN_dup(bpriv_key))\n            || !TEST_true(DH_set0_key(c, NULL, cpriv_key)))\n        goto err;\n    cpriv_key = NULL;\n    alen = DH_size(a);\n    if (!TEST_ptr(abuf = OPENSSL_malloc(alen))\n            || !TEST_true((aout = DH_compute_key(abuf, bpub_key, a)) != -1))\n        goto err;\n    blen = DH_size(b);\n    if (!TEST_ptr(bbuf = OPENSSL_malloc(blen))\n            || !TEST_true((bout = DH_compute_key(bbuf, apub_key, b)) != -1))\n        goto err;\n    clen = DH_size(c);\n    if (!TEST_ptr(cbuf = OPENSSL_malloc(clen))\n            || !TEST_true((cout = DH_compute_key(cbuf, apub_key, c)) != -1))\n        goto err;\n    if (!TEST_true(aout >= 4)\n            || !TEST_mem_eq(abuf, aout, bbuf, bout)\n            || !TEST_mem_eq(abuf, aout, cbuf, cout))\n        goto err;\n    ret = 1;\n err:\n    OPENSSL_free(abuf);\n    OPENSSL_free(bbuf);\n    OPENSSL_free(cbuf);\n    DH_free(b);\n    DH_free(a);\n    DH_free(c);\n    BN_free(bp);\n    BN_free(bg);\n    BN_free(cpriv_key);\n    BN_GENCB_free(_cb);\n    return ret;\n}', 'int DH_generate_parameters_ex(DH *ret, int prime_len, int generator,\n                              BN_GENCB *cb)\n{\n    if (ret->meth->generate_params)\n        return ret->meth->generate_params(ret, prime_len, generator, cb);\n    return dh_builtin_genparams(ret, prime_len, generator, cb);\n}', 'int DH_check(const DH *dh, int *ret)\n{\n    int ok = 0, r;\n    BN_CTX *ctx = NULL;\n    BN_ULONG l;\n    BIGNUM *t1 = NULL, *t2 = NULL;\n    *ret = 0;\n    ctx = BN_CTX_new();\n    if (ctx == NULL)\n        goto err;\n    BN_CTX_start(ctx);\n    t1 = BN_CTX_get(ctx);\n    t2 = BN_CTX_get(ctx);\n    if (t2 == NULL)\n        goto err;\n    if (dh->q) {\n        if (BN_cmp(dh->g, BN_value_one()) <= 0)\n            *ret |= DH_NOT_SUITABLE_GENERATOR;\n        else if (BN_cmp(dh->g, dh->p) >= 0)\n            *ret |= DH_NOT_SUITABLE_GENERATOR;\n        else {\n            if (!BN_mod_exp(t1, dh->g, dh->q, dh->p, ctx))\n                goto err;\n            if (!BN_is_one(t1))\n                *ret |= DH_NOT_SUITABLE_GENERATOR;\n        }\n        r = BN_is_prime_ex(dh->q, BN_prime_checks, ctx, NULL);\n        if (r < 0)\n            goto err;\n        if (!r)\n            *ret |= DH_CHECK_Q_NOT_PRIME;\n        if (!BN_div(t1, t2, dh->p, dh->q, ctx))\n            goto err;\n        if (!BN_is_one(t2))\n            *ret |= DH_CHECK_INVALID_Q_VALUE;\n        if (dh->j && BN_cmp(dh->j, t1))\n            *ret |= DH_CHECK_INVALID_J_VALUE;\n    } else if (BN_is_word(dh->g, DH_GENERATOR_2)) {\n        l = BN_mod_word(dh->p, 24);\n        if (l == (BN_ULONG)-1)\n            goto err;\n        if (l != 11)\n            *ret |= DH_NOT_SUITABLE_GENERATOR;\n    } else if (BN_is_word(dh->g, DH_GENERATOR_5)) {\n        l = BN_mod_word(dh->p, 10);\n        if (l == (BN_ULONG)-1)\n            goto err;\n        if ((l != 3) && (l != 7))\n            *ret |= DH_NOT_SUITABLE_GENERATOR;\n    } else\n        *ret |= DH_UNABLE_TO_CHECK_GENERATOR;\n    r = BN_is_prime_ex(dh->p, BN_prime_checks, ctx, NULL);\n    if (r < 0)\n        goto err;\n    if (!r)\n        *ret |= DH_CHECK_P_NOT_PRIME;\n    else if (!dh->q) {\n        if (!BN_rshift1(t1, dh->p))\n            goto err;\n        r = BN_is_prime_ex(t1, BN_prime_checks, ctx, NULL);\n        if (r < 0)\n            goto err;\n        if (!r)\n            *ret |= DH_CHECK_P_NOT_SAFE_PRIME;\n    }\n    ok = 1;\n err:\n    if (ctx != NULL) {\n        BN_CTX_end(ctx);\n        BN_CTX_free(ctx);\n    }\n    return ok;\n}', 'int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,\n           BN_CTX *ctx)\n{\n    int norm_shift, i, loop;\n    BIGNUM *tmp, wnum, *snum, *sdiv, *res;\n    BN_ULONG *resp, *wnump;\n    BN_ULONG d0, d1;\n    int num_n, div_n;\n    int no_branch = 0;\n    if ((num->top > 0 && num->d[num->top - 1] == 0) ||\n        (divisor->top > 0 && divisor->d[divisor->top - 1] == 0)) {\n        BNerr(BN_F_BN_DIV, BN_R_NOT_INITIALIZED);\n        return 0;\n    }\n    bn_check_top(num);\n    bn_check_top(divisor);\n    if ((BN_get_flags(num, BN_FLG_CONSTTIME) != 0)\n        || (BN_get_flags(divisor, BN_FLG_CONSTTIME) != 0)) {\n        no_branch = 1;\n    }\n    bn_check_top(dv);\n    bn_check_top(rm);\n    if (BN_is_zero(divisor)) {\n        BNerr(BN_F_BN_DIV, BN_R_DIV_BY_ZERO);\n        return 0;\n    }\n    if (!no_branch && BN_ucmp(num, divisor) < 0) {\n        if (rm != NULL) {\n            if (BN_copy(rm, num) == NULL)\n                return 0;\n        }\n        if (dv != NULL)\n            BN_zero(dv);\n        return 1;\n    }\n    BN_CTX_start(ctx);\n    res = (dv == NULL) ? BN_CTX_get(ctx) : dv;\n    tmp = BN_CTX_get(ctx);\n    snum = BN_CTX_get(ctx);\n    sdiv = BN_CTX_get(ctx);\n    if (sdiv == NULL)\n        goto err;\n    norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);\n    if (!(BN_lshift(sdiv, divisor, norm_shift)))\n        goto err;\n    sdiv->neg = 0;\n    norm_shift += BN_BITS2;\n    if (!(BN_lshift(snum, num, norm_shift)))\n        goto err;\n    snum->neg = 0;\n    if (no_branch) {\n        if (snum->top <= sdiv->top + 1) {\n            if (bn_wexpand(snum, sdiv->top + 2) == NULL)\n                goto err;\n            for (i = snum->top; i < sdiv->top + 2; i++)\n                snum->d[i] = 0;\n            snum->top = sdiv->top + 2;\n        } else {\n            if (bn_wexpand(snum, snum->top + 1) == NULL)\n                goto err;\n            snum->d[snum->top] = 0;\n            snum->top++;\n        }\n    }\n    div_n = sdiv->top;\n    num_n = snum->top;\n    loop = num_n - div_n;\n    wnum.neg = 0;\n    wnum.d = &(snum->d[loop]);\n    wnum.top = div_n;\n    wnum.dmax = snum->dmax - loop;\n    d0 = sdiv->d[div_n - 1];\n    d1 = (div_n == 1) ? 0 : sdiv->d[div_n - 2];\n    wnump = &(snum->d[num_n - 1]);\n    if (!bn_wexpand(res, (loop + 1)))\n        goto err;\n    res->neg = (num->neg ^ divisor->neg);\n    res->top = loop - no_branch;\n    resp = &(res->d[loop - 1]);\n    if (!bn_wexpand(tmp, (div_n + 1)))\n        goto err;\n    if (!no_branch) {\n        if (BN_ucmp(&wnum, sdiv) >= 0) {\n            bn_clear_top2max(&wnum);\n            bn_sub_words(wnum.d, wnum.d, sdiv->d, div_n);\n            *resp = 1;\n        } else\n            res->top--;\n    }\n    resp++;\n    if (res->top == 0)\n        res->neg = 0;\n    else\n        resp--;\n    for (i = 0; i < loop - 1; i++, wnump--) {\n        BN_ULONG q, l0;\n# if defined(BN_DIV3W) && !defined(OPENSSL_NO_ASM)\n        BN_ULONG bn_div_3_words(BN_ULONG *, BN_ULONG, BN_ULONG);\n        q = bn_div_3_words(wnump, d1, d0);\n# else\n        BN_ULONG n0, n1, rem = 0;\n        n0 = wnump[0];\n        n1 = wnump[-1];\n        if (n0 == d0)\n            q = BN_MASK2;\n        else {\n#  ifdef BN_LLONG\n            BN_ULLONG t2;\n#   if defined(BN_LLONG) && defined(BN_DIV2W) && !defined(bn_div_words)\n            q = (BN_ULONG)(((((BN_ULLONG) n0) << BN_BITS2) | n1) / d0);\n#   else\n            q = bn_div_words(n0, n1, d0);\n#   endif\n#   ifndef REMAINDER_IS_ALREADY_CALCULATED\n            rem = (n1 - q * d0) & BN_MASK2;\n#   endif\n            t2 = (BN_ULLONG) d1 *q;\n            for (;;) {\n                if (t2 <= ((((BN_ULLONG) rem) << BN_BITS2) | wnump[-2]))\n                    break;\n                q--;\n                rem += d0;\n                if (rem < d0)\n                    break;\n                t2 -= d1;\n            }\n#  else\n            BN_ULONG t2l, t2h;\n            q = bn_div_words(n0, n1, d0);\n#   ifndef REMAINDER_IS_ALREADY_CALCULATED\n            rem = (n1 - q * d0) & BN_MASK2;\n#   endif\n#   if defined(BN_UMULT_LOHI)\n            BN_UMULT_LOHI(t2l, t2h, d1, q);\n#   elif defined(BN_UMULT_HIGH)\n            t2l = d1 * q;\n            t2h = BN_UMULT_HIGH(d1, q);\n#   else\n            {\n                BN_ULONG ql, qh;\n                t2l = LBITS(d1);\n                t2h = HBITS(d1);\n                ql = LBITS(q);\n                qh = HBITS(q);\n                mul64(t2l, t2h, ql, qh);\n            }\n#   endif\n            for (;;) {\n                if ((t2h < rem) || ((t2h == rem) && (t2l <= wnump[-2])))\n                    break;\n                q--;\n                rem += d0;\n                if (rem < d0)\n                    break;\n                if (t2l < d1)\n                    t2h--;\n                t2l -= d1;\n            }\n#  endif\n        }\n# endif\n        l0 = bn_mul_words(tmp->d, sdiv->d, div_n, q);\n        tmp->d[div_n] = l0;\n        wnum.d--;\n        if (bn_sub_words(wnum.d, wnum.d, tmp->d, div_n + 1)) {\n            q--;\n            if (bn_add_words(wnum.d, wnum.d, sdiv->d, div_n))\n                (*wnump)++;\n        }\n        resp--;\n        *resp = q;\n    }\n    bn_correct_top(snum);\n    if (rm != NULL) {\n        int neg = num->neg;\n        BN_rshift(rm, snum, norm_shift);\n        if (!BN_is_zero(rm))\n            rm->neg = neg;\n        bn_check_top(rm);\n    }\n    if (no_branch)\n        bn_correct_top(res);\n    BN_CTX_end(ctx);\n    return 1;\n err:\n    bn_check_top(rm);\n    BN_CTX_end(ctx);\n    return 0;\n}', 'int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)\n{\n    int i, nw, lb, rb;\n    BN_ULONG *t, *f;\n    BN_ULONG l;\n    bn_check_top(r);\n    bn_check_top(a);\n    if (n < 0) {\n        BNerr(BN_F_BN_LSHIFT, BN_R_INVALID_SHIFT);\n        return 0;\n    }\n    nw = n / BN_BITS2;\n    if (bn_wexpand(r, a->top + nw + 1) == NULL)\n        return 0;\n    r->neg = a->neg;\n    lb = n % BN_BITS2;\n    rb = BN_BITS2 - lb;\n    f = a->d;\n    t = r->d;\n    t[a->top + nw] = 0;\n    if (lb == 0)\n        for (i = a->top - 1; i >= 0; i--)\n            t[nw + i] = f[i];\n    else\n        for (i = a->top - 1; i >= 0; i--) {\n            l = f[i];\n            t[nw + i + 1] |= (l >> rb) & BN_MASK2;\n            t[nw + i] = (l << lb) & BN_MASK2;\n        }\n    memset(t, 0, sizeof(*t) * nw);\n    r->top = a->top + nw + 1;\n    bn_correct_top(r);\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}']