crypto/rsa/rsa_chk.c:145: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul`.
Showing all 34 steps of the trace


crypto/rsa/rsa_chk.c:86:9: Call
84.   
85.       /* p prime? */
86.       r = BN_is_prime_ex(key->p, BN_prime_checks, NULL, cb);
              ^
87.       if (r != 1) {
88.           ret = r;

crypto/bn/bn_prime.c:296:1: Parameter `ctx_passed->stack.depth`
  294.   }
  295.   
  296. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  297.                      BN_GENCB *cb)
  298.   {

crypto/bn/bn_prime.c:299:12: Call
  297.                      BN_GENCB *cb)
  298.   {
  299.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  300.   }
  301.   

crypto/bn/bn_prime.c:302:1: Parameter `ctx_passed->stack.depth`
    300.   }
    301.   
    302. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    303.                               int do_trial_division, BN_GENCB *cb)
    304.   {

crypto/rsa/rsa_chk.c:95:9: Call
93.   
94.       /* q prime? */
95.       r = BN_is_prime_ex(key->q, BN_prime_checks, NULL, cb);
              ^
96.       if (r != 1) {
97.           ret = r;

crypto/bn/bn_prime.c:296:1: Parameter `ctx_passed->stack.depth`
  294.   }
  295.   
  296. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  297.                      BN_GENCB *cb)
  298.   {

crypto/bn/bn_prime.c:299:12: Call
  297.                      BN_GENCB *cb)
  298.   {
  299.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  300.   }
  301.   

crypto/bn/bn_prime.c:302:1: Parameter `ctx_passed->stack.depth`
    300.   }
    301.   
    302. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    303.                               int do_trial_division, BN_GENCB *cb)
    304.   {

crypto/rsa/rsa_chk.c:104:9: Call
102.   
103.       /* n = p*q? */
104.       r = BN_mul(i, key->p, key->q, ctx);
               ^
105.       if (!r) {
106.           ret = -1;

crypto/bn/bn_mul.c:883:1: Parameter `ctx->stack.depth`
  881.   #endif                          /* BN_RECURSION */
  882.   
  883. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  884.   {
  885.       int ret = 0;

crypto/rsa/rsa_chk.c:129:9: Call
127.   
128.       /* now compute k = lcm(i,j) */
129.       r = BN_mul(l, i, j, ctx);
               ^
130.       if (!r) {
131.           ret = -1;

crypto/bn/bn_mul.c:883:1: Parameter `ctx->stack.depth`
  881.   #endif                          /* BN_RECURSION */
  882.   
  883. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  884.   {
  885.       int ret = 0;

crypto/rsa/rsa_chk.c:134:9: Call
132.           goto err;
133.       }
134.       r = BN_gcd(m, i, j, ctx);
               ^
135.       if (!r) {
136.           ret = -1;

crypto/bn/bn_gcd.c:117:1: Parameter `ctx->stack.depth`
  115.   static BIGNUM *euclid(BIGNUM *a, BIGNUM *b);
  116.   
  117. > int BN_gcd(BIGNUM *r, const BIGNUM *in_a, const BIGNUM *in_b, BN_CTX *ctx)
  118.   {
  119.       BIGNUM *a, *b, *t;

crypto/bn/bn_gcd.c:125:5: Call
  123.       bn_check_top(in_b);
  124.   
  125.       BN_CTX_start(ctx);
             ^
  126.       a = BN_CTX_get(ctx);
  127.       b = BN_CTX_get(ctx);

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

crypto/bn/bn_gcd.c:151:5: Call
  149.       ret = 1;
  150.    err:
  151.       BN_CTX_end(ctx);
             ^
  152.       bn_check_top(r);
  153.       return (ret);

crypto/bn/bn_ctx.c:267:1: Parameter `ctx->stack.depth`
    265.   }
    266.   
    267. > void BN_CTX_end(BN_CTX *ctx)
    268.   {
    269.       CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/rsa/rsa_chk.c:139:9: Call
137.           goto err;
138.       }
139.       r = BN_div(k, NULL, l, m, ctx); /* remainder is 0 */
               ^
140.       if (!r) {
141.           ret = -1;

crypto/bn/bn_div.c:189:1: Parameter `ctx->stack.depth`
  187.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
  188.    */
  189. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
  190.              BN_CTX *ctx)
  191.   {

crypto/rsa/rsa_chk.c:145:9: Call
143.       }
144.   
145.       r = BN_mod_mul(i, key->d, key->e, k, ctx);
               ^
146.       if (!r) {
147.           ret = -1;

crypto/bn/bn_mod.c:187:1: Parameter `ctx->stack.depth`
  185.   
  186.   /* slow but works */
  187. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  188.                  BN_CTX *ctx)
  189.   {

crypto/bn/bn_mod.c:197:5: Call
  195.       bn_check_top(m);
  196.   
  197.       BN_CTX_start(ctx);
             ^
  198.       if ((t = BN_CTX_get(ctx)) == NULL)
  199.           goto err;

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

crypto/bn/bn_mod.c:201:14: Call
  199.           goto err;
  200.       if (a == b) {
  201.           if (!BN_sqr(t, a, ctx))
                      ^
  202.               goto err;
  203.       } 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:253:1: Parameter `ctx->stack.depth`
      251.   }
      252.   
      253. > void BN_CTX_start(BN_CTX *ctx)
      254.   {
      255.       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:267:1: Parameter `ctx->stack.depth`
      265.   }
      266.   
      267. > void BN_CTX_end(BN_CTX *ctx)
      268.   {
      269.       CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/bn/bn_ctx.c:273:27: Call
      271.           ctx->err_stack--;
      272.       else {
      273.           unsigned int fp = BN_STACK_pop(&ctx->stack);
                                       ^
      274.           /* Does this stack frame have anything to release? */
      275.           if (fp < ctx->used)

crypto/bn/bn_ctx.c:351:1: <LHS trace>
349.   }
350.   
351. > static unsigned int BN_STACK_pop(BN_STACK *st)
352.   {
353.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:351:1: Parameter `st->depth`
        349.   }
        350.   
        351. > static unsigned int BN_STACK_pop(BN_STACK *st)
        352.   {
        353.       return st->indexes[--(st->depth)];

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