crypto/bn/bn_prime.c:316: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_MONT_CTX_set`.
Showing all 43 steps of the trace


crypto/bn/bn_prime.c:243:1: Parameter `ctx_passed->pool.used`
241.   	}
242.   
243. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
244.   		int do_trial_division, BN_GENCB *cb)
245.   	{

crypto/bn/bn_prime.c:289:7: Call
287.   	else
288.   		A = a;
289.   	A1 = BN_CTX_get(ctx);
             ^
290.   	A1_odd = BN_CTX_get(ctx);
291.   	check = BN_CTX_get(ctx);

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

crypto/bn/bn_prime.c:290:11: Call
288.   		A = a;
289.   	A1 = BN_CTX_get(ctx);
290.   	A1_odd = BN_CTX_get(ctx);
                 ^
291.   	check = BN_CTX_get(ctx);
292.   	if (check == NULL) goto err;

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

crypto/bn/bn_prime.c:291:10: Call
289.   	A1 = BN_CTX_get(ctx);
290.   	A1_odd = BN_CTX_get(ctx);
291.   	check = BN_CTX_get(ctx);
                ^
292.   	if (check == NULL) goto err;
293.   

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

crypto/bn/bn_prime.c:316:7: Call
314.   	if (mont == NULL)
315.   		goto err;
316.   	if (!BN_MONT_CTX_set(mont, A, ctx))
             ^
317.   		goto err;
318.   	

crypto/bn/bn_mont.c:272:1: Parameter `ctx->pool.used`
  270.   	}
  271.   
  272. > int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)
  273.   	{
  274.   	int ret = 0;

crypto/bn/bn_mont.c:278:11: Call
  276.   
  277.   	BN_CTX_start(ctx);
  278.   	if((Ri = BN_CTX_get(ctx)) == NULL) goto err;
                   ^
  279.   	R= &(mont->RR);					/* grab RR as a temp */
  280.   	if (!BN_copy(&(mont->N),mod)) goto err;		/* Set N */

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

crypto/bn/bn_mont.c:299:8: Call
  297.   		tmod.neg=0;
  298.   							/* Ri = R^-1 mod N*/
  299.   		if ((BN_mod_inverse(Ri,R,&tmod,ctx)) == NULL)
                ^
  300.   			goto err;
  301.   		if (!BN_lshift(Ri,Ri,BN_BITS2)) goto err; /* R*Ri */

crypto/bn/bn_gcd.c:206:1: Parameter `ctx->pool.used`
    204.   
    205.   /* solves ax == 1 (mod n) */
    206. > BIGNUM *BN_mod_inverse(BIGNUM *in,
    207.   	const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
    208.   	{

crypto/bn/bn_gcd.c:217:6: Call
    215.   
    216.   	BN_CTX_start(ctx);
    217.   	A = BN_CTX_get(ctx);
                ^
    218.   	B = BN_CTX_get(ctx);
    219.   	X = BN_CTX_get(ctx);

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

crypto/bn/bn_gcd.c:218:6: Call
    216.   	BN_CTX_start(ctx);
    217.   	A = BN_CTX_get(ctx);
    218.   	B = BN_CTX_get(ctx);
                ^
    219.   	X = BN_CTX_get(ctx);
    220.   	D = BN_CTX_get(ctx);

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

crypto/bn/bn_gcd.c:219:6: Call
    217.   	A = BN_CTX_get(ctx);
    218.   	B = BN_CTX_get(ctx);
    219.   	X = BN_CTX_get(ctx);
                ^
    220.   	D = BN_CTX_get(ctx);
    221.   	M = BN_CTX_get(ctx);

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

crypto/bn/bn_gcd.c:220:6: Call
    218.   	B = BN_CTX_get(ctx);
    219.   	X = BN_CTX_get(ctx);
    220.   	D = BN_CTX_get(ctx);
                ^
    221.   	M = BN_CTX_get(ctx);
    222.   	Y = BN_CTX_get(ctx);

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

crypto/bn/bn_gcd.c:221:6: Call
    219.   	X = BN_CTX_get(ctx);
    220.   	D = BN_CTX_get(ctx);
    221.   	M = BN_CTX_get(ctx);
                ^
    222.   	Y = BN_CTX_get(ctx);
    223.   	T = BN_CTX_get(ctx);

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

crypto/bn/bn_gcd.c:222:6: Call
    220.   	D = BN_CTX_get(ctx);
    221.   	M = BN_CTX_get(ctx);
    222.   	Y = BN_CTX_get(ctx);
                ^
    223.   	T = BN_CTX_get(ctx);
    224.   	if (T == NULL) goto err;

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

crypto/bn/bn_gcd.c:223:6: Call
    221.   	M = BN_CTX_get(ctx);
    222.   	Y = BN_CTX_get(ctx);
    223.   	T = BN_CTX_get(ctx);
                ^
    224.   	if (T == NULL) goto err;
    225.   

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

crypto/bn/bn_gcd.c:239:8: Call
    237.   	if (B->neg || (BN_ucmp(B, A) >= 0))
    238.   		{
    239.   		if (!BN_nnmod(B, B, A, ctx)) goto err;
                  ^
    240.   		}
    241.   	sign = -1;

crypto/bn/bn_mod.c:127:1: Parameter `ctx->pool.used`
      125.   
      126.   
      127. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
      128.   	{
      129.   	/* like BN_mod, but returns non-negative remainder

crypto/bn/bn_mod.c:132:8: Call
      130.   	 * (i.e.,  0 <= r < |d|  always holds) */
      131.   
      132.   	if (!(BN_mod(r,m,d,ctx)))
                    ^
      133.   		return 0;
      134.   	if (!r->neg)

crypto/bn/bn_div.c:179:1: Parameter `ctx->pool.used`
        177.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
        178.    */
        179. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
        180.   	   BN_CTX *ctx)
        181.   	{

crypto/bn/bn_div.c:210:6: Call
        208.   
        209.   	BN_CTX_start(ctx);
        210.   	tmp=BN_CTX_get(ctx);
                    ^
        211.   	snum=BN_CTX_get(ctx);
        212.   	sdiv=BN_CTX_get(ctx);

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

crypto/bn/bn_div.c:211:7: Call
        209.   	BN_CTX_start(ctx);
        210.   	tmp=BN_CTX_get(ctx);
        211.   	snum=BN_CTX_get(ctx);
                     ^
        212.   	sdiv=BN_CTX_get(ctx);
        213.   	if (dv == NULL)

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

crypto/bn/bn_div.c:212:7: Call
        210.   	tmp=BN_CTX_get(ctx);
        211.   	snum=BN_CTX_get(ctx);
        212.   	sdiv=BN_CTX_get(ctx);
                     ^
        213.   	if (dv == NULL)
        214.   		res=BN_CTX_get(ctx);

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

crypto/bn/bn_div.c:394:2: Call
        392.   		bn_check_top(rm);
        393.   		}
        394.   	BN_CTX_end(ctx);
                ^
        395.   	return(1);
        396.   err:

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

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

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

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

crypto/bn/bn_ctx.c:437:2: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_MONT_CTX_set` 
            435.   static void BN_POOL_release(BN_POOL *p, unsigned int num)
            436.   	{
            437.   	unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;
                    ^
            438.   	p->used -= num;
            439.   	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--;
		}
	}
['int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,\n\t\tint do_trial_division, BN_GENCB *cb)\n\t{\n\tint i, j, ret = -1;\n\tint k;\n\tBN_CTX *ctx = NULL;\n\tBIGNUM *A1, *A1_odd, *check;\n\tBN_MONT_CTX *mont = NULL;\n\tconst BIGNUM *A = NULL;\n\tif (BN_cmp(a, BN_value_one()) <= 0)\n\t\treturn 0;\n\tif (checks == BN_prime_checks)\n\t\tchecks = BN_prime_checks_for_size(BN_num_bits(a));\n\tif (!BN_is_odd(a))\n\t\treturn 0;\n\tif (do_trial_division)\n\t\t{\n\t\tfor (i = 1; i < NUMPRIMES; i++)\n\t\t\tif (BN_mod_word(a, primes[i]) == 0)\n\t\t\t\treturn 0;\n\t\tif(!BN_GENCB_call(cb, 1, -1))\n\t\t\tgoto err;\n\t\t}\n\tif (ctx_passed != NULL)\n\t\tctx = ctx_passed;\n\telse\n\t\tif ((ctx=BN_CTX_new()) == NULL)\n\t\t\tgoto err;\n\tBN_CTX_start(ctx);\n\tif (a->neg)\n\t\t{\n\t\tBIGNUM *t;\n\t\tif ((t = BN_CTX_get(ctx)) == NULL) goto err;\n\t\tBN_copy(t, a);\n\t\tt->neg = 0;\n\t\tA = t;\n\t\t}\n\telse\n\t\tA = a;\n\tA1 = BN_CTX_get(ctx);\n\tA1_odd = BN_CTX_get(ctx);\n\tcheck = BN_CTX_get(ctx);\n\tif (check == NULL) goto err;\n\tif (!BN_copy(A1, A))\n\t\tgoto err;\n\tif (!BN_sub_word(A1, 1))\n\t\tgoto err;\n\tif (BN_is_zero(A1))\n\t\t{\n\t\tret = 0;\n\t\tgoto err;\n\t\t}\n\tk = 1;\n\twhile (!BN_is_bit_set(A1, k))\n\t\tk++;\n\tif (!BN_rshift(A1_odd, A1, k))\n\t\tgoto err;\n\tmont = BN_MONT_CTX_new();\n\tif (mont == NULL)\n\t\tgoto err;\n\tif (!BN_MONT_CTX_set(mont, A, ctx))\n\t\tgoto err;\n\tfor (i = 0; i < checks; i++)\n\t\t{\n\t\tif (!BN_pseudo_rand_range(check, A1))\n\t\t\tgoto err;\n\t\tif (!BN_add_word(check, 1))\n\t\t\tgoto err;\n\t\tj = witness(check, A, A1, A1_odd, k, ctx, mont);\n\t\tif (j == -1) goto err;\n\t\tif (j)\n\t\t\t{\n\t\t\tret=0;\n\t\t\tgoto err;\n\t\t\t}\n\t\tif(!BN_GENCB_call(cb, 1, i))\n\t\t\tgoto err;\n\t\t}\n\tret=1;\nerr:\n\tif (ctx != NULL)\n\t\t{\n\t\tBN_CTX_end(ctx);\n\t\tif (ctx_passed == NULL)\n\t\t\tBN_CTX_free(ctx);\n\t\t}\n\tif (mont != NULL)\n\t\tBN_MONT_CTX_free(mont);\n\treturn(ret);\n\t}', '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}', 'int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)\n\t{\n\tint ret = 0;\n\tBIGNUM *Ri,*R;\n\tBN_CTX_start(ctx);\n\tif((Ri = BN_CTX_get(ctx)) == NULL) goto err;\n\tR= &(mont->RR);\n\tif (!BN_copy(&(mont->N),mod)) goto err;\n\tmont->N.neg = 0;\n#ifdef MONT_WORD\n\t\t{\n\t\tBIGNUM tmod;\n\t\tBN_ULONG buf[2];\n\t\tmont->ri=(BN_num_bits(mod)+(BN_BITS2-1))/BN_BITS2*BN_BITS2;\n\t\tBN_zero(R);\n\t\tif (!(BN_set_bit(R,BN_BITS2))) goto err;\n\t\tbuf[0]=mod->d[0];\n\t\tbuf[1]=0;\n\t\ttmod.d=buf;\n\t\ttmod.top=1;\n\t\ttmod.dmax=2;\n\t\ttmod.neg=0;\n\t\tif ((BN_mod_inverse(Ri,R,&tmod,ctx)) == NULL)\n\t\t\tgoto err;\n\t\tif (!BN_lshift(Ri,Ri,BN_BITS2)) goto err;\n\t\tif (!BN_is_zero(Ri))\n\t\t\t{\n\t\t\tif (!BN_sub_word(Ri,1)) goto err;\n\t\t\t}\n\t\telse\n\t\t\t{\n\t\t\tif (!BN_set_word(Ri,BN_MASK2)) goto err;\n\t\t\t}\n\t\tif (!BN_div(Ri,NULL,Ri,&tmod,ctx)) goto err;\n\t\tmont->n0 = (Ri->top > 0) ? Ri->d[0] : 0;\n\t\t}\n#else\n\t\t{\n\t\tmont->ri=BN_num_bits(&mont->N);\n\t\tBN_zero(R);\n\t\tif (!BN_set_bit(R,mont->ri)) goto err;\n\t\tif ((BN_mod_inverse(Ri,R,&mont->N,ctx)) == NULL)\n\t\t\tgoto err;\n\t\tif (!BN_lshift(Ri,Ri,mont->ri)) goto err;\n\t\tif (!BN_sub_word(Ri,1)) goto err;\n\t\tif (!BN_div(&(mont->Ni),NULL,Ri,&mont->N,ctx)) goto err;\n\t\t}\n#endif\n\tBN_zero(&(mont->RR));\n\tif (!BN_set_bit(&(mont->RR),mont->ri*2)) goto err;\n\tif (!BN_mod(&(mont->RR),&(mont->RR),&(mont->N),ctx)) goto err;\n\tret = 1;\nerr:\n\tBN_CTX_end(ctx);\n\treturn ret;\n\t}', 'BIGNUM *BN_mod_inverse(BIGNUM *in,\n\tconst BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)\n\t{\n\tBIGNUM *A,*B,*X,*Y,*M,*D,*T,*R=NULL;\n\tBIGNUM *ret=NULL;\n\tint sign;\n\tbn_check_top(a);\n\tbn_check_top(n);\n\tBN_CTX_start(ctx);\n\tA = BN_CTX_get(ctx);\n\tB = BN_CTX_get(ctx);\n\tX = BN_CTX_get(ctx);\n\tD = BN_CTX_get(ctx);\n\tM = BN_CTX_get(ctx);\n\tY = BN_CTX_get(ctx);\n\tT = BN_CTX_get(ctx);\n\tif (T == NULL) goto err;\n\tif (in == NULL)\n\t\tR=BN_new();\n\telse\n\t\tR=in;\n\tif (R == NULL) goto err;\n\tBN_one(X);\n\tBN_zero(Y);\n\tif (BN_copy(B,a) == NULL) goto err;\n\tif (BN_copy(A,n) == NULL) goto err;\n\tA->neg = 0;\n\tif (B->neg || (BN_ucmp(B, A) >= 0))\n\t\t{\n\t\tif (!BN_nnmod(B, B, A, ctx)) goto err;\n\t\t}\n\tsign = -1;\n\tif (BN_is_odd(n) && (BN_num_bits(n) <= (BN_BITS <= 32 ? 450 : 2048)))\n\t\t{\n\t\tint shift;\n\t\twhile (!BN_is_zero(B))\n\t\t\t{\n\t\t\tshift = 0;\n\t\t\twhile (!BN_is_bit_set(B, shift))\n\t\t\t\t{\n\t\t\t\tshift++;\n\t\t\t\tif (BN_is_odd(X))\n\t\t\t\t\t{\n\t\t\t\t\tif (!BN_uadd(X, X, n)) goto err;\n\t\t\t\t\t}\n\t\t\t\tif (!BN_rshift1(X, X)) goto err;\n\t\t\t\t}\n\t\t\tif (shift > 0)\n\t\t\t\t{\n\t\t\t\tif (!BN_rshift(B, B, shift)) goto err;\n\t\t\t\t}\n\t\t\tshift = 0;\n\t\t\twhile (!BN_is_bit_set(A, shift))\n\t\t\t\t{\n\t\t\t\tshift++;\n\t\t\t\tif (BN_is_odd(Y))\n\t\t\t\t\t{\n\t\t\t\t\tif (!BN_uadd(Y, Y, n)) goto err;\n\t\t\t\t\t}\n\t\t\t\tif (!BN_rshift1(Y, Y)) goto err;\n\t\t\t\t}\n\t\t\tif (shift > 0)\n\t\t\t\t{\n\t\t\t\tif (!BN_rshift(A, A, shift)) goto err;\n\t\t\t\t}\n\t\t\tif (BN_ucmp(B, A) >= 0)\n\t\t\t\t{\n\t\t\t\tif (!BN_uadd(X, X, Y)) goto err;\n\t\t\t\tif (!BN_usub(B, B, A)) goto err;\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\tif (!BN_uadd(Y, Y, X)) goto err;\n\t\t\t\tif (!BN_usub(A, A, B)) goto err;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\telse\n\t\t{\n\t\twhile (!BN_is_zero(B))\n\t\t\t{\n\t\t\tBIGNUM *tmp;\n\t\t\tif (BN_num_bits(A) == BN_num_bits(B))\n\t\t\t\t{\n\t\t\t\tif (!BN_one(D)) goto err;\n\t\t\t\tif (!BN_sub(M,A,B)) goto err;\n\t\t\t\t}\n\t\t\telse if (BN_num_bits(A) == BN_num_bits(B) + 1)\n\t\t\t\t{\n\t\t\t\tif (!BN_lshift1(T,B)) goto err;\n\t\t\t\tif (BN_ucmp(A,T) < 0)\n\t\t\t\t\t{\n\t\t\t\t\tif (!BN_one(D)) goto err;\n\t\t\t\t\tif (!BN_sub(M,A,B)) goto err;\n\t\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\tif (!BN_sub(M,A,T)) goto err;\n\t\t\t\t\tif (!BN_add(D,T,B)) goto err;\n\t\t\t\t\tif (BN_ucmp(A,D) < 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\tif (!BN_set_word(D,2)) goto err;\n\t\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\tif (!BN_set_word(D,3)) goto err;\n\t\t\t\t\t\tif (!BN_sub(M,M,B)) goto err;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\tif (!BN_div(D,M,A,B,ctx)) goto err;\n\t\t\t\t}\n\t\t\ttmp=A;\n\t\t\tA=B;\n\t\t\tB=M;\n\t\t\tif (BN_is_one(D))\n\t\t\t\t{\n\t\t\t\tif (!BN_add(tmp,X,Y)) goto err;\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\tif (BN_is_word(D,2))\n\t\t\t\t\t{\n\t\t\t\t\tif (!BN_lshift1(tmp,X)) goto err;\n\t\t\t\t\t}\n\t\t\t\telse if (BN_is_word(D,4))\n\t\t\t\t\t{\n\t\t\t\t\tif (!BN_lshift(tmp,X,2)) goto err;\n\t\t\t\t\t}\n\t\t\t\telse if (D->top == 1)\n\t\t\t\t\t{\n\t\t\t\t\tif (!BN_copy(tmp,X)) goto err;\n\t\t\t\t\tif (!BN_mul_word(tmp,D->d[0])) goto err;\n\t\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\tif (!BN_mul(tmp,D,X,ctx)) goto err;\n\t\t\t\t\t}\n\t\t\t\tif (!BN_add(tmp,tmp,Y)) goto err;\n\t\t\t\t}\n\t\t\tM=Y;\n\t\t\tY=X;\n\t\t\tX=tmp;\n\t\t\tsign = -sign;\n\t\t\t}\n\t\t}\n\tif (sign < 0)\n\t\t{\n\t\tif (!BN_sub(Y,n,Y)) goto err;\n\t\t}\n\tif (BN_is_one(A))\n\t\t{\n\t\tif (!Y->neg && BN_ucmp(Y,n) < 0)\n\t\t\t{\n\t\t\tif (!BN_copy(R,Y)) goto err;\n\t\t\t}\n\t\telse\n\t\t\t{\n\t\t\tif (!BN_nnmod(R,Y,n,ctx)) goto err;\n\t\t\t}\n\t\t}\n\telse\n\t\t{\n\t\tBNerr(BN_F_BN_MOD_INVERSE,BN_R_NO_INVERSE);\n\t\tgoto err;\n\t\t}\n\tret=R;\nerr:\n\tif ((ret == NULL) && (in == NULL)) BN_free(R);\n\tBN_CTX_end(ctx);\n\tif (ret)\n\t\tbn_check_top(ret);\n\treturn(ret);\n\t}', 'int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)\n\t{\n\tif (!(BN_mod(r,m,d,ctx)))\n\t\treturn 0;\n\tif (!r->neg)\n\t\treturn 1;\n\treturn (d->neg ? BN_sub : BN_add)(r, r, d);\n}', 'int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,\n\t   BN_CTX *ctx)\n\t{\n\tint norm_shift,i,loop;\n\tBIGNUM *tmp,wnum,*snum,*sdiv,*res;\n\tBN_ULONG *resp,*wnump;\n\tBN_ULONG d0,d1;\n\tint num_n,div_n;\n\tif (dv)\n\t\tbn_check_top(dv);\n\tif (rm)\n\t\tbn_check_top(rm);\n\tbn_check_top(num);\n\tbn_check_top(divisor);\n\tif (BN_is_zero(divisor))\n\t\t{\n\t\tBNerr(BN_F_BN_DIV,BN_R_DIV_BY_ZERO);\n\t\treturn(0);\n\t\t}\n\tif (BN_ucmp(num,divisor) < 0)\n\t\t{\n\t\tif (rm != NULL)\n\t\t\t{ if (BN_copy(rm,num) == NULL) return(0); }\n\t\tif (dv != NULL) BN_zero(dv);\n\t\treturn(1);\n\t\t}\n\tBN_CTX_start(ctx);\n\ttmp=BN_CTX_get(ctx);\n\tsnum=BN_CTX_get(ctx);\n\tsdiv=BN_CTX_get(ctx);\n\tif (dv == NULL)\n\t\tres=BN_CTX_get(ctx);\n\telse\tres=dv;\n\tif (sdiv == NULL || res == NULL) goto err;\n\tnorm_shift=BN_BITS2-((BN_num_bits(divisor))%BN_BITS2);\n\tif (!(BN_lshift(sdiv,divisor,norm_shift))) goto err;\n\tsdiv->neg=0;\n\tnorm_shift+=BN_BITS2;\n\tif (!(BN_lshift(snum,num,norm_shift))) goto err;\n\tsnum->neg=0;\n\tdiv_n=sdiv->top;\n\tnum_n=snum->top;\n\tloop=num_n-div_n;\n\twnum.neg   = 0;\n\twnum.d     = &(snum->d[loop]);\n\twnum.top   = div_n;\n\twnum.dmax  = snum->dmax - loop;\n\td0=sdiv->d[div_n-1];\n\td1=(div_n == 1)?0:sdiv->d[div_n-2];\n\twnump= &(snum->d[num_n-1]);\n\tres->neg= (num->neg^divisor->neg);\n\tif (!bn_wexpand(res,(loop+1))) goto err;\n\tres->top=loop;\n\tresp= &(res->d[loop-1]);\n\tif (!bn_wexpand(tmp,(div_n+1))) goto err;\n\tif (BN_ucmp(&wnum,sdiv) >= 0)\n\t\t{\n\t\tbn_clear_top2max(&wnum);\n\t\tbn_sub_words(wnum.d, wnum.d, sdiv->d, div_n);\n\t\t*resp=1;\n\t\t}\n\telse\n\t\tres->top--;\n\tif (res->top == 0)\n\t\tres->neg = 0;\n\telse\n\t\tresp--;\n\tfor (i=0; i<loop-1; i++, wnump--, resp--)\n\t\t{\n\t\tBN_ULONG q,l0;\n#if defined(BN_DIV3W) && !defined(OPENSSL_NO_ASM)\n\t\tBN_ULONG bn_div_3_words(BN_ULONG*,BN_ULONG,BN_ULONG);\n\t\tq=bn_div_3_words(wnump,d1,d0);\n#else\n\t\tBN_ULONG n0,n1,rem=0;\n\t\tn0=wnump[0];\n\t\tn1=wnump[-1];\n\t\tif (n0 == d0)\n\t\t\tq=BN_MASK2;\n\t\telse\n\t\t\t{\n#ifdef BN_LLONG\n\t\t\tBN_ULLONG t2;\n#if defined(BN_LLONG) && defined(BN_DIV2W) && !defined(bn_div_words)\n\t\t\tq=(BN_ULONG)(((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0);\n#else\n\t\t\tq=bn_div_words(n0,n1,d0);\n#ifdef BN_DEBUG_LEVITTE\n\t\t\tfprintf(stderr,"DEBUG: bn_div_words(0x%08X,0x%08X,0x%08\\\nX) -> 0x%08X\\n",\n\t\t\t\tn0, n1, d0, q);\n#endif\n#endif\n#ifndef REMAINDER_IS_ALREADY_CALCULATED\n\t\t\trem=(n1-q*d0)&BN_MASK2;\n#endif\n\t\t\tt2=(BN_ULLONG)d1*q;\n\t\t\tfor (;;)\n\t\t\t\t{\n\t\t\t\tif (t2 <= ((((BN_ULLONG)rem)<<BN_BITS2)|wnump[-2]))\n\t\t\t\t\tbreak;\n\t\t\t\tq--;\n\t\t\t\trem += d0;\n\t\t\t\tif (rem < d0) break;\n\t\t\t\tt2 -= d1;\n\t\t\t\t}\n#else\n\t\t\tBN_ULONG t2l,t2h,ql,qh;\n\t\t\tq=bn_div_words(n0,n1,d0);\n#ifdef BN_DEBUG_LEVITTE\n\t\t\tfprintf(stderr,"DEBUG: bn_div_words(0x%08X,0x%08X,0x%08\\\nX) -> 0x%08X\\n",\n\t\t\t\tn0, n1, d0, q);\n#endif\n#ifndef REMAINDER_IS_ALREADY_CALCULATED\n\t\t\trem=(n1-q*d0)&BN_MASK2;\n#endif\n#if defined(BN_UMULT_LOHI)\n\t\t\tBN_UMULT_LOHI(t2l,t2h,d1,q);\n#elif defined(BN_UMULT_HIGH)\n\t\t\tt2l = d1 * q;\n\t\t\tt2h = BN_UMULT_HIGH(d1,q);\n#else\n\t\t\tt2l=LBITS(d1); t2h=HBITS(d1);\n\t\t\tql =LBITS(q);  qh =HBITS(q);\n\t\t\tmul64(t2l,t2h,ql,qh);\n#endif\n\t\t\tfor (;;)\n\t\t\t\t{\n\t\t\t\tif ((t2h < rem) ||\n\t\t\t\t\t((t2h == rem) && (t2l <= wnump[-2])))\n\t\t\t\t\tbreak;\n\t\t\t\tq--;\n\t\t\t\trem += d0;\n\t\t\t\tif (rem < d0) break;\n\t\t\t\tif (t2l < d1) t2h--; t2l -= d1;\n\t\t\t\t}\n#endif\n\t\t\t}\n#endif\n\t\tl0=bn_mul_words(tmp->d,sdiv->d,div_n,q);\n\t\ttmp->d[div_n]=l0;\n\t\twnum.d--;\n\t\tif (bn_sub_words(wnum.d, wnum.d, tmp->d, div_n+1))\n\t\t\t{\n\t\t\tq--;\n\t\t\tif (bn_add_words(wnum.d, wnum.d, sdiv->d, div_n))\n\t\t\t\t(*wnump)++;\n\t\t\t}\n\t\t*resp = q;\n\t\t}\n\tbn_correct_top(snum);\n\tif (rm != NULL)\n\t\t{\n\t\tint neg = num->neg;\n\t\tBN_rshift(rm,snum,norm_shift);\n\t\tif (!BN_is_zero(rm))\n\t\t\trm->neg = neg;\n\t\tbn_check_top(rm);\n\t\t}\n\tBN_CTX_end(ctx);\n\treturn(1);\nerr:\n\tif (rm)\n\t\tbn_check_top(rm);\n\tBN_CTX_end(ctx);\n\treturn(0);\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}']