crypto/bn/bn_mont.c:92: error: INTEGER_OVERFLOW_L2
  ([0, 3+max(0, `ctx->stack.depth`)] - 1):unsigned32 by call to `BN_from_montgomery`.
Showing all 15 steps of the trace


crypto/bn/bn_mont.c:72:1: Parameter `ctx->stack.depth`
70.   #define MONT_WORD /* use the faster word-based algorithm */
71.   
72. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
73.   			  BN_MONT_CTX *mont, BN_CTX *ctx)
74.   	{

crypto/bn/bn_mont.c:78:2: Call
76.   	int ret=0;
77.   
78.   	BN_CTX_start(ctx);
       ^
79.   	tmp = BN_CTX_get(ctx);
80.   	if (tmp == NULL) goto err;

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

crypto/bn/bn_mont.c:85:8: Call
83.   	if (a == b)
84.   		{
85.   		if (!BN_sqr(tmp,a,ctx)) goto err;
             ^
86.   		}
87.   	else

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

crypto/bn/bn_mont.c:92:7: Call
90.   		}
91.   	/* reduce from aRR to aR */
92.   	if (!BN_from_montgomery(r,tmp,mont,ctx)) goto err;
            ^
93.   	bn_check_top(r);
94.   	ret=1;

crypto/bn/bn_mont.c:100:1: Parameter `ctx->stack.depth`
  98.   	}
  99.   
  100. > int BN_from_montgomery(BIGNUM *ret, const BIGNUM *a, BN_MONT_CTX *mont,
  101.   	     BN_CTX *ctx)
  102.   	{

crypto/bn/bn_mont.c:110:2: Call
  108.   	int al,nl,max,i,x,ri;
  109.   
  110.   	BN_CTX_start(ctx);
          ^
  111.   	if ((r = BN_CTX_get(ctx)) == NULL) goto err;
  112.   

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

crypto/bn/bn_mont.c:235:2: Call
  233.   	bn_check_top(ret);
  234.    err:
  235.   	BN_CTX_end(ctx);
          ^
  236.   	return(retn);
  237.   	}

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

crypto/bn/bn_ctx.c:277:21: Call
    275.   	else
    276.   		{
    277.   		unsigned int fp = BN_STACK_pop(&ctx->stack);
                               ^
    278.   		/* Does this stack frame have anything to release? */
    279.   		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:9: Binary operation: ([0, 3+max(0, ctx->stack.depth)] - 1):unsigned32 by call to `BN_from_montgomery` 
      351.   static unsigned int BN_STACK_pop(BN_STACK *st)
      352.   	{
      353.   	return st->indexes[--(st->depth)];
                     ^
      354.   	}
      355.   
