crypto/rsa/rsa_sp800_56b_check.c:60: error: INTEGER_OVERFLOW_L2
  ([0, 6+max(0, `ctx->stack.depth`)] - 1):unsigned32 by call to `BN_mod_mul`.
Showing all 25 steps of the trace


crypto/rsa/rsa_sp800_56b_check.c:24:1: Parameter `ctx->stack.depth`
22.    *   6.4.1.3.3: rsakpv2-crt Step 7
23.    */
24. > int rsa_check_crt_components(const RSA *rsa, BN_CTX *ctx)
25.   {
26.       int ret = 0;

crypto/rsa/rsa_sp800_56b_check.c:36:5: Call
34.       }
35.   
36.       BN_CTX_start(ctx);
          ^
37.       r = BN_CTX_get(ctx);
38.       p1 = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:194:1: Parameter `ctx->stack.depth`
  192.   }
  193.   
  194. > void BN_CTX_start(BN_CTX *ctx)
  195.   {
  196.       CTXDBG("ENTER BN_CTX_start()", ctx);

crypto/rsa/rsa_sp800_56b_check.c:57:14: Call
55.             && (BN_cmp(rsa->iqmp, rsa->p) < 0)
56.             /* (d) 1 = (dP . e) mod (p - 1)*/
57.             && BN_mod_mul(r, rsa->dmp1, rsa->e, p1, ctx)
                   ^
58.             && BN_is_one(r)
59.             /* (e) 1 = (dQ . e) mod (q - 1) */

crypto/bn/bn_mod.c:193:1: Parameter `ctx->stack.depth`
  191.   
  192.   /* slow but works */
  193. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  194.                  BN_CTX *ctx)
  195.   {

crypto/bn/bn_mod.c:203:5: Call
  201.       bn_check_top(m);
  202.   
  203.       BN_CTX_start(ctx);
             ^
  204.       if ((t = BN_CTX_get(ctx)) == NULL)
  205.           goto err;

crypto/bn/bn_ctx.c:194:1: Parameter `ctx->stack.depth`
    192.   }
    193.   
    194. > void BN_CTX_start(BN_CTX *ctx)
    195.   {
    196.       CTXDBG("ENTER BN_CTX_start()", ctx);

crypto/bn/bn_mod.c:218:5: Call
  216.       ret = 1;
  217.    err:
  218.       BN_CTX_end(ctx);
             ^
  219.       return ret;
  220.   }

crypto/bn/bn_ctx.c:208:1: Parameter `ctx->stack.depth`
    206.   }
    207.   
    208. > void BN_CTX_end(BN_CTX *ctx)
    209.   {
    210.       if (ctx == NULL)

crypto/rsa/rsa_sp800_56b_check.c:60:14: Call
58.             && BN_is_one(r)
59.             /* (e) 1 = (dQ . e) mod (q - 1) */
60.             && BN_mod_mul(r, rsa->dmq1, rsa->e, q1, ctx)
                   ^
61.             && BN_is_one(r)
62.             /* (f) 1 = (qInv . q) mod p */

crypto/bn/bn_mod.c:193:1: Parameter `ctx->stack.depth`
  191.   
  192.   /* slow but works */
  193. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  194.                  BN_CTX *ctx)
  195.   {

crypto/bn/bn_mod.c:203:5: Call
  201.       bn_check_top(m);
  202.   
  203.       BN_CTX_start(ctx);
             ^
  204.       if ((t = BN_CTX_get(ctx)) == NULL)
  205.           goto err;

crypto/bn/bn_ctx.c:194:1: Parameter `ctx->stack.depth`
    192.   }
    193.   
    194. > void BN_CTX_start(BN_CTX *ctx)
    195.   {
    196.       CTXDBG("ENTER BN_CTX_start()", ctx);

crypto/bn/bn_mod.c:207:14: Call
  205.           goto err;
  206.       if (a == b) {
  207.           if (!BN_sqr(t, a, ctx))
                      ^
  208.               goto err;
  209.       } else {

crypto/bn/bn_sqr.c:17:1: Parameter `ctx->stack.depth`
    15.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
    16.    */
    17. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
    18.   {
    19.       int ret = bn_sqr_fixed_top(r, a, ctx);

crypto/bn/bn_sqr.c:19:15: Call
    17.   int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
    18.   {
    19.       int ret = bn_sqr_fixed_top(r, a, ctx);
                        ^
    20.   
    21.       bn_correct_top(r);

crypto/bn/bn_sqr.c:27:1: Parameter `ctx->stack.depth`
      25.   }
      26.   
      27. > int bn_sqr_fixed_top(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
      28.   {
      29.       int max, al;

crypto/bn/bn_sqr.c:42:5: Call
      40.       }
      41.   
      42.       BN_CTX_start(ctx);
                ^
      43.       rr = (a != r) ? r : BN_CTX_get(ctx);
      44.       tmp = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:194:1: Parameter `ctx->stack.depth`
        192.   }
        193.   
        194. > void BN_CTX_start(BN_CTX *ctx)
        195.   {
        196.       CTXDBG("ENTER BN_CTX_start()", ctx);

crypto/bn/bn_sqr.c:104:5: Call
      102.       bn_check_top(rr);
      103.       bn_check_top(tmp);
      104.       BN_CTX_end(ctx);
                 ^
      105.       return ret;
      106.   }

crypto/bn/bn_ctx.c:208:1: Parameter `ctx->stack.depth`
        206.   }
        207.   
        208. > void BN_CTX_end(BN_CTX *ctx)
        209.   {
        210.       if (ctx == NULL)

crypto/bn/bn_ctx.c:216:27: Call
        214.           ctx->err_stack--;
        215.       else {
        216.           unsigned int fp = BN_STACK_pop(&ctx->stack);
                                         ^
        217.           /* Does this stack frame have anything to release? */
        218.           if (fp < ctx->used)

crypto/bn/bn_ctx.c:298:1: <LHS trace>
296.   }
297.   
298. > static unsigned int BN_STACK_pop(BN_STACK *st)
299.   {
300.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:298:1: Parameter `st->depth`
          296.   }
          297.   
          298. > static unsigned int BN_STACK_pop(BN_STACK *st)
          299.   {
          300.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:300:12: Binary operation: ([0, 6+max(0, ctx->stack.depth)] - 1):unsigned32 by call to `BN_mod_mul` 
          298.   static unsigned int BN_STACK_pop(BN_STACK *st)
          299.   {
          300.       return st->indexes[--(st->depth)];
                            ^
          301.   }
          302.   
