engines/ccgost/gost2001_keyx.c:44: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul`.
Showing all 16 steps of the trace


engines/ccgost/gost2001_keyx.c:37:5: Call
35.           ukm_be[7 - i] = ukm[i];
36.       }
37.       BN_CTX_start(ctx);
          ^
38.       UKM = BN_bin2bn(ukm_be, 8, NULL);
39.       p = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:240:1: Parameter `ctx->stack.depth`
  238.   }
  239.   
  240. > void BN_CTX_start(BN_CTX *ctx)
  241.   {
  242.       CTXDBG_ENTRY("BN_CTX_start", ctx);

engines/ccgost/gost2001_keyx.c:44:5: Call
42.       Y = BN_CTX_get(ctx);
43.       EC_GROUP_get_order(EC_KEY_get0_group(priv_key), order, ctx);
44.       BN_mod_mul(p, key, UKM, order, ctx);
          ^
45.       EC_POINT_mul(EC_KEY_get0_group(priv_key), pnt, NULL, pub_key, p, ctx);
46.       EC_POINT_get_affine_coordinates_GFp(EC_KEY_get0_group(priv_key),

crypto/bn/bn_mod.c:179:1: Parameter `ctx->stack.depth`
  177.   
  178.   /* slow but works */
  179. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  180.                  BN_CTX *ctx)
  181.   {

crypto/bn/bn_mod.c:189:5: Call
  187.       bn_check_top(m);
  188.   
  189.       BN_CTX_start(ctx);
             ^
  190.       if ((t = BN_CTX_get(ctx)) == NULL)
  191.           goto err;

crypto/bn/bn_ctx.c:240:1: Parameter `ctx->stack.depth`
    238.   }
    239.   
    240. > void BN_CTX_start(BN_CTX *ctx)
    241.   {
    242.       CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_mod.c:193:14: Call
  191.           goto err;
  192.       if (a == b) {
  193.           if (!BN_sqr(t, a, ctx))
                      ^
  194.               goto err;
  195.       } else {

crypto/bn/bn_sqr.c:66:1: Parameter `ctx->stack.depth`
    64.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
    65.    */
    66. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
    67.   {
    68.       int max, al;

crypto/bn/bn_sqr.c:81:5: Call
    79.       }
    80.   
    81.       BN_CTX_start(ctx);
              ^
    82.       rr = (a != r) ? r : BN_CTX_get(ctx);
    83.       tmp = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:240:1: Parameter `ctx->stack.depth`
      238.   }
      239.   
      240. > void BN_CTX_start(BN_CTX *ctx)
      241.   {
      242.       CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_sqr.c:148:5: Call
    146.       bn_check_top(rr);
    147.       bn_check_top(tmp);
    148.       BN_CTX_end(ctx);
               ^
    149.       return (ret);
    150.   }

crypto/bn/bn_ctx.c:254:1: Parameter `ctx->stack.depth`
      252.   }
      253.   
      254. > void BN_CTX_end(BN_CTX *ctx)
      255.   {
      256.       CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/bn/bn_ctx.c:260:27: Call
      258.           ctx->err_stack--;
      259.       else {
      260.           unsigned int fp = BN_STACK_pop(&ctx->stack);
                                       ^
      261.           /* Does this stack frame have anything to release? */
      262.           if (fp < ctx->used)

crypto/bn/bn_ctx.c:330:1: <LHS trace>
328.   }
329.   
330. > static unsigned int BN_STACK_pop(BN_STACK *st)
331.   {
332.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:330:1: Parameter `st->depth`
        328.   }
        329.   
        330. > static unsigned int BN_STACK_pop(BN_STACK *st)
        331.   {
        332.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:332:12: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul` 
        330.   static unsigned int BN_STACK_pop(BN_STACK *st)
        331.   {
        332.       return st->indexes[--(st->depth)];
                          ^
        333.   }
        334.   

static unsigned int BN_STACK_pop(BN_STACK *st)
{
    return st->indexes[--(st->depth)];
}
['static int VKO_compute_key(unsigned char *shared_key, size_t shared_key_size,\n                           const EC_POINT *pub_key, EC_KEY *priv_key,\n                           const unsigned char *ukm)\n{\n    unsigned char ukm_be[8], databuf[64], hashbuf[64];\n    BIGNUM *UKM = NULL, *p = NULL, *order = NULL, *X = NULL, *Y = NULL;\n    const BIGNUM *key = EC_KEY_get0_private_key(priv_key);\n    EC_POINT *pnt = EC_POINT_new(EC_KEY_get0_group(priv_key));\n    int i;\n    gost_hash_ctx hash_ctx;\n    BN_CTX *ctx = BN_CTX_new();\n    for (i = 0; i < 8; i++) {\n        ukm_be[7 - i] = ukm[i];\n    }\n    BN_CTX_start(ctx);\n    UKM = BN_bin2bn(ukm_be, 8, NULL);\n    p = BN_CTX_get(ctx);\n    order = BN_CTX_get(ctx);\n    X = BN_CTX_get(ctx);\n    Y = BN_CTX_get(ctx);\n    EC_GROUP_get_order(EC_KEY_get0_group(priv_key), order, ctx);\n    BN_mod_mul(p, key, UKM, order, ctx);\n    EC_POINT_mul(EC_KEY_get0_group(priv_key), pnt, NULL, pub_key, p, ctx);\n    EC_POINT_get_affine_coordinates_GFp(EC_KEY_get0_group(priv_key),\n                                        pnt, X, Y, ctx);\n    store_bignum(Y, databuf, 32);\n    store_bignum(X, databuf + 32, 32);\n    for (i = 0; i < 64; i++) {\n        hashbuf[63 - i] = databuf[i];\n    }\n    init_gost_hash_ctx(&hash_ctx, &GostR3411_94_CryptoProParamSet);\n    start_hash(&hash_ctx);\n    hash_block(&hash_ctx, hashbuf, 64);\n    finish_hash(&hash_ctx, shared_key);\n    done_gost_hash_ctx(&hash_ctx);\n    BN_free(UKM);\n    BN_CTX_end(ctx);\n    BN_CTX_free(ctx);\n    EC_POINT_free(pnt);\n    return 32;\n}', 'void BN_CTX_start(BN_CTX *ctx)\n{\n    CTXDBG_ENTRY("BN_CTX_start", ctx);\n    if (ctx->err_stack || ctx->too_many)\n        ctx->err_stack++;\n    else if (!BN_STACK_push(&ctx->stack, ctx->used)) {\n        BNerr(BN_F_BN_CTX_START, BN_R_TOO_MANY_TEMPORARY_VARIABLES);\n        ctx->err_stack++;\n    }\n    CTXDBG_EXIT(ctx);\n}', 'int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,\n               BN_CTX *ctx)\n{\n    BIGNUM *t;\n    int ret = 0;\n    bn_check_top(a);\n    bn_check_top(b);\n    bn_check_top(m);\n    BN_CTX_start(ctx);\n    if ((t = BN_CTX_get(ctx)) == NULL)\n        goto err;\n    if (a == b) {\n        if (!BN_sqr(t, a, ctx))\n            goto err;\n    } else {\n        if (!BN_mul(t, a, b, ctx))\n            goto err;\n    }\n    if (!BN_nnmod(r, t, m, ctx))\n        goto err;\n    bn_check_top(r);\n    ret = 1;\n err:\n    BN_CTX_end(ctx);\n    return (ret);\n}', 'int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)\n{\n    int max, al;\n    int ret = 0;\n    BIGNUM *tmp, *rr;\n    bn_check_top(a);\n    al = a->top;\n    if (al <= 0) {\n        r->top = 0;\n        r->neg = 0;\n        return 1;\n    }\n    BN_CTX_start(ctx);\n    rr = (a != r) ? r : BN_CTX_get(ctx);\n    tmp = BN_CTX_get(ctx);\n    if (!rr || !tmp)\n        goto err;\n    max = 2 * al;\n    if (bn_wexpand(rr, max) == NULL)\n        goto err;\n    if (al == 4) {\n#ifndef BN_SQR_COMBA\n        BN_ULONG t[8];\n        bn_sqr_normal(rr->d, a->d, 4, t);\n#else\n        bn_sqr_comba4(rr->d, a->d);\n#endif\n    } else if (al == 8) {\n#ifndef BN_SQR_COMBA\n        BN_ULONG t[16];\n        bn_sqr_normal(rr->d, a->d, 8, t);\n#else\n        bn_sqr_comba8(rr->d, a->d);\n#endif\n    } else {\n#if defined(BN_RECURSION)\n        if (al < BN_SQR_RECURSIVE_SIZE_NORMAL) {\n            BN_ULONG t[BN_SQR_RECURSIVE_SIZE_NORMAL * 2];\n            bn_sqr_normal(rr->d, a->d, al, t);\n        } else {\n            int j, k;\n            j = BN_num_bits_word((BN_ULONG)al);\n            j = 1 << (j - 1);\n            k = j + j;\n            if (al == j) {\n                if (bn_wexpand(tmp, k * 2) == NULL)\n                    goto err;\n                bn_sqr_recursive(rr->d, a->d, al, tmp->d);\n            } else {\n                if (bn_wexpand(tmp, max) == NULL)\n                    goto err;\n                bn_sqr_normal(rr->d, a->d, al, tmp->d);\n            }\n        }\n#else\n        if (bn_wexpand(tmp, max) == NULL)\n            goto err;\n        bn_sqr_normal(rr->d, a->d, al, tmp->d);\n#endif\n    }\n    rr->neg = 0;\n    if (a->d[al - 1] == (a->d[al - 1] & BN_MASK2l))\n        rr->top = max - 1;\n    else\n        rr->top = max;\n    if (rr != r)\n        BN_copy(r, rr);\n    ret = 1;\n err:\n    bn_check_top(rr);\n    bn_check_top(tmp);\n    BN_CTX_end(ctx);\n    return (ret);\n}', 'void BN_CTX_end(BN_CTX *ctx)\n{\n    CTXDBG_ENTRY("BN_CTX_end", ctx);\n    if (ctx->err_stack)\n        ctx->err_stack--;\n    else {\n        unsigned int fp = BN_STACK_pop(&ctx->stack);\n        if (fp < ctx->used)\n            BN_POOL_release(&ctx->pool, ctx->used - fp);\n        ctx->used = fp;\n        ctx->too_many = 0;\n    }\n    CTXDBG_EXIT(ctx);\n}', 'static unsigned int BN_STACK_pop(BN_STACK *st)\n{\n    return st->indexes[--(st->depth)];\n}']