crypto/rsa/rsa_lib.c:385: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `rsa_get_public_exp`.
Showing all 19 steps of the trace


crypto/rsa/rsa_lib.c:362:1: Parameter `in_ctx->pool.used`
360.   }
361.   
362. > BN_BLINDING *RSA_setup_blinding(RSA *rsa, BN_CTX *in_ctx)
363.   {
364.   	BIGNUM *e;

crypto/rsa/rsa_lib.c:376:7: Call
374.   
375.   	BN_CTX_start(ctx);
376.   	e  = BN_CTX_get(ctx);
             ^
377.   	if (e == NULL)
378.   		{

crypto/bn/bn_ctx.c:288:1: Parameter `ctx->pool.used`
  286.   	}
  287.   
  288. > BIGNUM *BN_CTX_get(BN_CTX *ctx)
  289.   	{
  290.   	BIGNUM *ret;

crypto/rsa/rsa_lib.c:385:7: Call
383.   	if (rsa->e == NULL)
384.   		{
385.   		e = rsa_get_public_exp(rsa->d, rsa->p, rsa->q, ctx);
             ^
386.   		if (e == NULL)
387.   			{

crypto/rsa/rsa_lib.c:337:1: Parameter `ctx->pool.used`
  335.   	}
  336.   
  337. > static BIGNUM *rsa_get_public_exp(const BIGNUM *d, const BIGNUM *p,
  338.   	const BIGNUM *q, BN_CTX *ctx)
  339.   {

crypto/rsa/rsa_lib.c:346:7: Call
  344.   
  345.   	BN_CTX_start(ctx);
  346.   	r0 = BN_CTX_get(ctx);
               ^
  347.   	r1 = BN_CTX_get(ctx);
  348.   	r2 = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:288:1: Parameter `ctx->pool.used`
    286.   	}
    287.   
    288. > BIGNUM *BN_CTX_get(BN_CTX *ctx)
    289.   	{
    290.   	BIGNUM *ret;

crypto/rsa/rsa_lib.c:347:7: Call
  345.   	BN_CTX_start(ctx);
  346.   	r0 = BN_CTX_get(ctx);
  347.   	r1 = BN_CTX_get(ctx);
               ^
  348.   	r2 = BN_CTX_get(ctx);
  349.   	if (r2 == NULL)

crypto/bn/bn_ctx.c:288:1: Parameter `ctx->pool.used`
    286.   	}
    287.   
    288. > BIGNUM *BN_CTX_get(BN_CTX *ctx)
    289.   	{
    290.   	BIGNUM *ret;

crypto/rsa/rsa_lib.c:348:7: Call
  346.   	r0 = BN_CTX_get(ctx);
  347.   	r1 = BN_CTX_get(ctx);
  348.   	r2 = BN_CTX_get(ctx);
               ^
  349.   	if (r2 == NULL)
  350.   		goto err;

crypto/bn/bn_ctx.c:288:1: Parameter `ctx->pool.used`
    286.   	}
    287.   
    288. > BIGNUM *BN_CTX_get(BN_CTX *ctx)
    289.   	{
    290.   	BIGNUM *ret;

crypto/rsa/rsa_lib.c:354:7: Call
  352.   	if (!BN_sub(r1, p, BN_value_one())) goto err;
  353.   	if (!BN_sub(r2, q, BN_value_one())) goto err;
  354.   	if (!BN_mul(r0, r1, r2, ctx)) goto err;
               ^
  355.   
  356.   	ret = BN_mod_inverse(NULL, d, r0, ctx);

crypto/bn/bn_mul.c:941:1: Parameter `ctx->pool.used`
    939.   #endif /* BN_RECURSION */
    940.   
    941. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    942.   	{
    943.   	int ret=0;

crypto/bn/bn_mul.c:1098:2: Call
    1096.   err:
    1097.   	bn_check_top(r);
    1098.   	BN_CTX_end(ctx);
             ^
    1099.   	return(ret);
    1100.   	}

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

crypto/bn/bn_ctx.c:280:4: Call
      278.   		/* Does this stack frame have anything to release? */
      279.   		if(fp < ctx->used)
      280.   			BN_POOL_release(&ctx->pool, ctx->used - fp);
                ^
      281.   		ctx->used = fp;
      282.   		/* Unjam "too_many" in case "get" had failed */

crypto/bn/bn_ctx.c:438:1: <LHS trace>
436.   	}
437.   
438. > static void BN_POOL_release(BN_POOL *p, unsigned int num)
439.   	{
440.   	unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;

crypto/bn/bn_ctx.c:438:1: Parameter `p->used`
        436.   	}
        437.   
        438. > static void BN_POOL_release(BN_POOL *p, unsigned int num)
        439.   	{
        440.   	unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;

crypto/bn/bn_ctx.c:440:2: Binary operation: ([0, +oo] - 1):unsigned32 by call to `rsa_get_public_exp` 
        438.   static void BN_POOL_release(BN_POOL *p, unsigned int num)
        439.   	{
        440.   	unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;
                ^
        441.   	p->used -= num;
        442.   	while(num--)

static void BN_POOL_release(BN_POOL *p, unsigned int num)
	{
	unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;
	p->used -= num;
	while(num--)
		{
		bn_check_top(p->current->vals + offset);
		if(!offset)
			{
			offset = BN_CTX_POOL_SIZE - 1;
			p->current = p->current->prev;
			}
		else
			offset--;
		}
	}
['BN_BLINDING *RSA_setup_blinding(RSA *rsa, BN_CTX *in_ctx)\n{\n\tBIGNUM *e;\n\tBN_CTX *ctx;\n\tBN_BLINDING *ret = NULL;\n\tif (in_ctx == NULL)\n\t\t{\n\t\tif ((ctx = BN_CTX_new()) == NULL) return 0;\n\t\t}\n\telse\n\t\tctx = in_ctx;\n\tBN_CTX_start(ctx);\n\te  = BN_CTX_get(ctx);\n\tif (e == NULL)\n\t\t{\n\t\tRSAerr(RSA_F_RSA_SETUP_BLINDING, ERR_R_MALLOC_FAILURE);\n\t\tgoto err;\n\t\t}\n\tif (rsa->e == NULL)\n\t\t{\n\t\te = rsa_get_public_exp(rsa->d, rsa->p, rsa->q, ctx);\n\t\tif (e == NULL)\n\t\t\t{\n\t\t\tRSAerr(RSA_F_RSA_SETUP_BLINDING, RSA_R_NO_PUBLIC_EXPONENT);\n\t\t\tgoto err;\n\t\t\t}\n\t\t}\n\telse\n\t\te = rsa->e;\n\tif ((RAND_status() == 0) && rsa->d != NULL && rsa->d->d != NULL)\n\t\t{\n\t\tRAND_add(rsa->d->d, rsa->d->dmax * sizeof rsa->d->d[0], 0.0);\n\t\t}\n\tret = BN_BLINDING_create_param(NULL, e, rsa->n, ctx,\n\t\t\trsa->meth->bn_mod_exp, rsa->_method_mod_n);\n\tif (ret == NULL)\n\t\t{\n\t\tRSAerr(RSA_F_RSA_SETUP_BLINDING, ERR_R_BN_LIB);\n\t\tgoto err;\n\t\t}\n\tBN_BLINDING_set_thread_id(ret, CRYPTO_thread_id());\nerr:\n\tBN_CTX_end(ctx);\n\tif (in_ctx == NULL)\n\t\tBN_CTX_free(ctx);\n\treturn ret;\n}', 'BIGNUM *BN_CTX_get(BN_CTX *ctx)\n\t{\n\tBIGNUM *ret;\n\tCTXDBG_ENTRY("BN_CTX_get", ctx);\n\tif(ctx->err_stack || ctx->too_many) return NULL;\n\tif((ret = BN_POOL_get(&ctx->pool)) == NULL)\n\t\t{\n\t\tctx->too_many = 1;\n\t\tBNerr(BN_F_BN_CTX_GET,BN_R_TOO_MANY_TEMPORARY_VARIABLES);\n\t\treturn NULL;\n\t\t}\n\tBN_zero(ret);\n\tctx->used++;\n\tCTXDBG_RET(ctx, ret);\n\treturn ret;\n\t}', 'static BIGNUM *rsa_get_public_exp(const BIGNUM *d, const BIGNUM *p,\n\tconst BIGNUM *q, BN_CTX *ctx)\n{\n\tBIGNUM *ret = NULL, *r0, *r1, *r2;\n\tif (d == NULL || p == NULL || q == NULL)\n\t\treturn NULL;\n\tBN_CTX_start(ctx);\n\tr0 = BN_CTX_get(ctx);\n\tr1 = BN_CTX_get(ctx);\n\tr2 = BN_CTX_get(ctx);\n\tif (r2 == NULL)\n\t\tgoto err;\n\tif (!BN_sub(r1, p, BN_value_one())) goto err;\n\tif (!BN_sub(r2, q, BN_value_one())) goto err;\n\tif (!BN_mul(r0, r1, r2, ctx)) goto err;\n\tret = BN_mod_inverse(NULL, d, r0, ctx);\nerr:\n\tBN_CTX_end(ctx);\n\treturn ret;\n}', 'int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)\n\t{\n\tint ret=0;\n\tint top,al,bl;\n\tBIGNUM *rr;\n#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)\n\tint i;\n#endif\n#ifdef BN_RECURSION\n\tBIGNUM *t=NULL;\n\tint j=0,k;\n#endif\n#ifdef BN_COUNT\n\tfprintf(stderr,"BN_mul %d * %d\\n",a->top,b->top);\n#endif\n\tbn_check_top(a);\n\tbn_check_top(b);\n\tbn_check_top(r);\n\tal=a->top;\n\tbl=b->top;\n\tif ((al == 0) || (bl == 0))\n\t\t{\n\t\tBN_zero(r);\n\t\treturn(1);\n\t\t}\n\ttop=al+bl;\n\tBN_CTX_start(ctx);\n\tif ((r == a) || (r == b))\n\t\t{\n\t\tif ((rr = BN_CTX_get(ctx)) == NULL) goto err;\n\t\t}\n\telse\n\t\trr = r;\n\trr->neg=a->neg^b->neg;\n#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)\n\ti = al-bl;\n#endif\n#ifdef BN_MUL_COMBA\n\tif (i == 0)\n\t\t{\n# if 0\n\t\tif (al == 4)\n\t\t\t{\n\t\t\tif (bn_wexpand(rr,8) == NULL) goto err;\n\t\t\trr->top=8;\n\t\t\tbn_mul_comba4(rr->d,a->d,b->d);\n\t\t\tgoto end;\n\t\t\t}\n# endif\n\t\tif (al == 8)\n\t\t\t{\n\t\t\tif (bn_wexpand(rr,16) == NULL) goto err;\n\t\t\trr->top=16;\n\t\t\tbn_mul_comba8(rr->d,a->d,b->d);\n\t\t\tgoto end;\n\t\t\t}\n\t\t}\n#endif\n#ifdef BN_RECURSION\n\tif ((al >= BN_MULL_SIZE_NORMAL) && (bl >= BN_MULL_SIZE_NORMAL))\n\t\t{\n\t\tif (i >= -1 && i <= 1)\n\t\t\t{\n\t\t\tint sav_j =0;\n\t\t\tif (i >= 0)\n\t\t\t\t{\n\t\t\t\tj = BN_num_bits_word((BN_ULONG)al);\n\t\t\t\t}\n\t\t\tif (i == -1)\n\t\t\t\t{\n\t\t\t\tj = BN_num_bits_word((BN_ULONG)bl);\n\t\t\t\t}\n\t\t\tsav_j = j;\n\t\t\tj = 1<<(j-1);\n\t\t\tassert(j <= al || j <= bl);\n\t\t\tk = j+j;\n\t\t\tt = BN_CTX_get(ctx);\n\t\t\tif (al > j || bl > j)\n\t\t\t\t{\n\t\t\t\tbn_wexpand(t,k*4);\n\t\t\t\tbn_wexpand(rr,k*4);\n\t\t\t\tbn_mul_part_recursive(rr->d,a->d,b->d,\n\t\t\t\t\tj,al-j,bl-j,t->d);\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\tbn_wexpand(t,k*2);\n\t\t\t\tbn_wexpand(rr,k*2);\n\t\t\t\tbn_mul_recursive(rr->d,a->d,b->d,\n\t\t\t\t\tj,al-j,bl-j,t->d);\n\t\t\t\t}\n\t\t\trr->top=top;\n\t\t\tgoto end;\n\t\t\t}\n#if 0\n\t\tif (i == 1 && !BN_get_flags(b,BN_FLG_STATIC_DATA))\n\t\t\t{\n\t\t\tBIGNUM *tmp_bn = (BIGNUM *)b;\n\t\t\tif (bn_wexpand(tmp_bn,al) == NULL) goto err;\n\t\t\ttmp_bn->d[bl]=0;\n\t\t\tbl++;\n\t\t\ti--;\n\t\t\t}\n\t\telse if (i == -1 && !BN_get_flags(a,BN_FLG_STATIC_DATA))\n\t\t\t{\n\t\t\tBIGNUM *tmp_bn = (BIGNUM *)a;\n\t\t\tif (bn_wexpand(tmp_bn,bl) == NULL) goto err;\n\t\t\ttmp_bn->d[al]=0;\n\t\t\tal++;\n\t\t\ti++;\n\t\t\t}\n\t\tif (i == 0)\n\t\t\t{\n\t\t\tj=BN_num_bits_word((BN_ULONG)al);\n\t\t\tj=1<<(j-1);\n\t\t\tk=j+j;\n\t\t\tt = BN_CTX_get(ctx);\n\t\t\tif (al == j)\n\t\t\t\t{\n\t\t\t\tif (bn_wexpand(t,k*2) == NULL) goto err;\n\t\t\t\tif (bn_wexpand(rr,k*2) == NULL) goto err;\n\t\t\t\tbn_mul_recursive(rr->d,a->d,b->d,al,t->d);\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\tif (bn_wexpand(t,k*4) == NULL) goto err;\n\t\t\t\tif (bn_wexpand(rr,k*4) == NULL) goto err;\n\t\t\t\tbn_mul_part_recursive(rr->d,a->d,b->d,al-j,j,t->d);\n\t\t\t\t}\n\t\t\trr->top=top;\n\t\t\tgoto end;\n\t\t\t}\n#endif\n\t\t}\n#endif\n\tif (bn_wexpand(rr,top) == NULL) goto err;\n\trr->top=top;\n\tbn_mul_normal(rr->d,a->d,al,b->d,bl);\n#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)\nend:\n#endif\n\tbn_correct_top(rr);\n\tif (r != rr) BN_copy(r,rr);\n\tret=1;\nerr:\n\tbn_check_top(r);\n\tBN_CTX_end(ctx);\n\treturn(ret);\n\t}', 'void BN_CTX_end(BN_CTX *ctx)\n\t{\n\tCTXDBG_ENTRY("BN_CTX_end", ctx);\n\tif(ctx->err_stack)\n\t\tctx->err_stack--;\n\telse\n\t\t{\n\t\tunsigned int fp = BN_STACK_pop(&ctx->stack);\n\t\tif(fp < ctx->used)\n\t\t\tBN_POOL_release(&ctx->pool, ctx->used - fp);\n\t\tctx->used = fp;\n\t\tctx->too_many = 0;\n\t\t}\n\tCTXDBG_EXIT(ctx);\n\t}', 'static void BN_POOL_release(BN_POOL *p, unsigned int num)\n\t{\n\tunsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;\n\tp->used -= num;\n\twhile(num--)\n\t\t{\n\t\tbn_check_top(p->current->vals + offset);\n\t\tif(!offset)\n\t\t\t{\n\t\t\toffset = BN_CTX_POOL_SIZE - 1;\n\t\t\tp->current = p->current->prev;\n\t\t\t}\n\t\telse\n\t\t\toffset--;\n\t\t}\n\t}']