crypto/ec/ecp_smpl.c:1240: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_mod_inverse`.
Showing all 41 steps of the trace


crypto/ec/ecp_smpl.c:1175:1: Parameter `ctx->pool.used`
1173.   
1174.   
1175. > int ec_GFp_simple_points_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx)
1176.   	{
1177.   	BN_CTX *new_ctx = NULL;

crypto/ec/ecp_smpl.c:1194:8: Call
1192.   
1193.   	BN_CTX_start(ctx);
1194.   	tmp = BN_CTX_get(ctx);
               ^
1195.   	tmp_Z = BN_CTX_get(ctx);
1196.   	if (tmp == NULL || tmp_Z == NULL) goto err;

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

crypto/ec/ecp_smpl.c:1195:10: Call
1193.   	BN_CTX_start(ctx);
1194.   	tmp = BN_CTX_get(ctx);
1195.   	tmp_Z = BN_CTX_get(ctx);
                 ^
1196.   	if (tmp == NULL || tmp_Z == NULL) goto err;
1197.   

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

crypto/ec/ecp_smpl.c:1240:7: Call
1238.   	 * non-zero points[i]->Z by its inverse. */
1239.   
1240.   	if (!BN_mod_inverse(tmp, prod_Z[num - 1], &group->field, ctx))
              ^
1241.   		{
1242.   		ECerr(EC_F_EC_GFP_SIMPLE_POINTS_MAKE_AFFINE, ERR_R_BN_LIB);

crypto/bn/bn_gcd.c:211:1: Parameter `ctx->pool.used`
  209.           const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
  210.   
  211. > BIGNUM *BN_mod_inverse(BIGNUM *in,
  212.   	const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
  213.   	{

crypto/bn/bn_gcd.c:216:7: Call
  214.   	BIGNUM *rv;
  215.   	int noinv;
  216.   	rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);
               ^
  217.   	if (noinv)
  218.   		BNerr(BN_F_BN_MOD_INVERSE,BN_R_NO_INVERSE);

crypto/bn/bn_gcd.c:222:1: Parameter `ctx->pool.used`
    220.   	}
    221.   
    222. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
    223.   	const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx, int *pnoinv)
    224.   	{

crypto/bn/bn_gcd.c:234:10: Call
    232.   	if ((BN_get_flags(a, BN_FLG_CONSTTIME) != 0) || (BN_get_flags(n, BN_FLG_CONSTTIME) != 0))
    233.   		{
    234.   		return BN_mod_inverse_no_branch(in, a, n, ctx);
                    ^
    235.   		}
    236.   

crypto/bn/bn_gcd.c:524:1: Parameter `ctx->pool.used`
      522.    * It does not contain branches that may leak sensitive information.
      523.    */
      524. > static BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
      525.   	const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
      526.   	{

crypto/bn/bn_gcd.c:537:6: Call
      535.   
      536.   	BN_CTX_start(ctx);
      537.   	A = BN_CTX_get(ctx);
                  ^
      538.   	B = BN_CTX_get(ctx);
      539.   	X = BN_CTX_get(ctx);

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

crypto/bn/bn_gcd.c:538:6: Call
      536.   	BN_CTX_start(ctx);
      537.   	A = BN_CTX_get(ctx);
      538.   	B = BN_CTX_get(ctx);
                  ^
      539.   	X = BN_CTX_get(ctx);
      540.   	D = BN_CTX_get(ctx);

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

crypto/bn/bn_gcd.c:539:6: Call
      537.   	A = BN_CTX_get(ctx);
      538.   	B = BN_CTX_get(ctx);
      539.   	X = BN_CTX_get(ctx);
                  ^
      540.   	D = BN_CTX_get(ctx);
      541.   	M = BN_CTX_get(ctx);

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

crypto/bn/bn_gcd.c:540:6: Call
      538.   	B = BN_CTX_get(ctx);
      539.   	X = BN_CTX_get(ctx);
      540.   	D = BN_CTX_get(ctx);
                  ^
      541.   	M = BN_CTX_get(ctx);
      542.   	Y = BN_CTX_get(ctx);

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

crypto/bn/bn_gcd.c:541:6: Call
      539.   	X = BN_CTX_get(ctx);
      540.   	D = BN_CTX_get(ctx);
      541.   	M = BN_CTX_get(ctx);
                  ^
      542.   	Y = BN_CTX_get(ctx);
      543.   	T = BN_CTX_get(ctx);

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

crypto/bn/bn_gcd.c:542:6: Call
      540.   	D = BN_CTX_get(ctx);
      541.   	M = BN_CTX_get(ctx);
      542.   	Y = BN_CTX_get(ctx);
                  ^
      543.   	T = BN_CTX_get(ctx);
      544.   	if (T == NULL) goto err;

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

crypto/bn/bn_gcd.c:543:6: Call
      541.   	M = BN_CTX_get(ctx);
      542.   	Y = BN_CTX_get(ctx);
      543.   	T = BN_CTX_get(ctx);
                  ^
      544.   	if (T == NULL) goto err;
      545.   

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

crypto/bn/bn_gcd.c:565:8: Call
      563.   		pB = &local_B;
      564.   		BN_with_flags(pB, B, BN_FLG_CONSTTIME);	
      565.   		if (!BN_nnmod(B, pB, A, ctx)) goto err;
                    ^
      566.   		}
      567.   	sign = -1;

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

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

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

crypto/bn/bn_div.c:229:6: Call
          227.   
          228.   	BN_CTX_start(ctx);
          229.   	tmp=BN_CTX_get(ctx);
                      ^
          230.   	snum=BN_CTX_get(ctx);
          231.   	sdiv=BN_CTX_get(ctx);

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

crypto/bn/bn_div.c:230:7: Call
          228.   	BN_CTX_start(ctx);
          229.   	tmp=BN_CTX_get(ctx);
          230.   	snum=BN_CTX_get(ctx);
                       ^
          231.   	sdiv=BN_CTX_get(ctx);
          232.   	if (dv == NULL)

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

crypto/bn/bn_div.c:231:7: Call
          229.   	tmp=BN_CTX_get(ctx);
          230.   	snum=BN_CTX_get(ctx);
          231.   	sdiv=BN_CTX_get(ctx);
                       ^
          232.   	if (dv == NULL)
          233.   		res=BN_CTX_get(ctx);

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

crypto/bn/bn_div.c:443:2: Call
          441.   		}
          442.   	if (no_branch)	bn_correct_top(res);
          443.   	BN_CTX_end(ctx);
                  ^
          444.   	return(1);
          445.   err:

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

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

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

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

crypto/bn/bn_ctx.c:442:2: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_mod_inverse` 
              440.   static void BN_POOL_release(BN_POOL *p, unsigned int num)
              441.   	{
              442.   	unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;
                      ^
              443.   	p->used -= num;
              444.   	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 ec_GFp_simple_points_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx)\n\t{\n\tBN_CTX *new_ctx = NULL;\n\tBIGNUM *tmp, *tmp_Z;\n\tBIGNUM **prod_Z = NULL;\n\tsize_t i;\n\tint ret = 0;\n\tif (num == 0)\n\t\treturn 1;\n\tif (ctx == NULL)\n\t\t{\n\t\tctx = new_ctx = BN_CTX_new();\n\t\tif (ctx == NULL)\n\t\t\treturn 0;\n\t\t}\n\tBN_CTX_start(ctx);\n\ttmp = BN_CTX_get(ctx);\n\ttmp_Z = BN_CTX_get(ctx);\n\tif (tmp == NULL || tmp_Z == NULL) goto err;\n\tprod_Z = OPENSSL_malloc(num * sizeof prod_Z[0]);\n\tif (prod_Z == NULL) goto err;\n\tfor (i = 0; i < num; i++)\n\t\t{\n\t\tprod_Z[i] = BN_new();\n\t\tif (prod_Z[i] == NULL) goto err;\n\t\t}\n\tif (!BN_is_zero(&points[0]->Z))\n\t\t{\n\t\tif (!BN_copy(prod_Z[0], &points[0]->Z)) goto err;\n\t\t}\n\telse\n\t\t{\n\t\tif (group->meth->field_set_to_one != 0)\n\t\t\t{\n\t\t\tif (!group->meth->field_set_to_one(group, prod_Z[0], ctx)) goto err;\n\t\t\t}\n\t\telse\n\t\t\t{\n\t\t\tif (!BN_one(prod_Z[0])) goto err;\n\t\t\t}\n\t\t}\n\tfor (i = 1; i < num; i++)\n\t\t{\n\t\tif (!BN_is_zero(&points[i]->Z))\n\t\t\t{\n\t\t\tif (!group->meth->field_mul(group, prod_Z[i], prod_Z[i - 1], &points[i]->Z, ctx)) goto err;\n\t\t\t}\n\t\telse\n\t\t\t{\n\t\t\tif (!BN_copy(prod_Z[i], prod_Z[i - 1])) goto err;\n\t\t\t}\n\t\t}\n\tif (!BN_mod_inverse(tmp, prod_Z[num - 1], &group->field, ctx))\n\t\t{\n\t\tECerr(EC_F_EC_GFP_SIMPLE_POINTS_MAKE_AFFINE, ERR_R_BN_LIB);\n\t\tgoto err;\n\t\t}\n\tif (group->meth->field_encode != 0)\n\t\t{\n\t\tif (!group->meth->field_encode(group, tmp, tmp, ctx)) goto err;\n\t\tif (!group->meth->field_encode(group, tmp, tmp, ctx)) goto err;\n\t\t}\n\tfor (i = num - 1; i > 0; --i)\n\t\t{\n\t\tif (!BN_is_zero(&points[i]->Z))\n\t\t\t{\n\t\t\tif (!group->meth->field_mul(group, tmp_Z, prod_Z[i - 1], tmp, ctx)) goto err;\n\t\t\tif (!group->meth->field_mul(group, tmp, tmp, &points[i]->Z, ctx)) goto err;\n\t\t\tif (!BN_copy(&points[i]->Z, tmp_Z)) goto err;\n\t\t\t}\n\t\t}\n\tif (!BN_is_zero(&points[0]->Z))\n\t\t{\n\t\tif (!BN_copy(&points[0]->Z, tmp)) goto err;\n\t\t}\n\tfor (i = 0; i < num; i++)\n\t\t{\n\t\tEC_POINT *p = points[i];\n\t\tif (!BN_is_zero(&p->Z))\n\t\t\t{\n\t\t\tif (!group->meth->field_sqr(group, tmp, &p->Z, ctx)) goto err;\n\t\t\tif (!group->meth->field_mul(group, &p->X, &p->X, tmp, ctx)) goto err;\n\t\t\tif (!group->meth->field_mul(group, tmp, tmp, &p->Z, ctx)) goto err;\n\t\t\tif (!group->meth->field_mul(group, &p->Y, &p->Y, tmp, ctx)) goto err;\n\t\t\tif (group->meth->field_set_to_one != 0)\n\t\t\t\t{\n\t\t\t\tif (!group->meth->field_set_to_one(group, &p->Z, ctx)) goto err;\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\tif (!BN_one(&p->Z)) goto err;\n\t\t\t\t}\n\t\t\tp->Z_is_one = 1;\n\t\t\t}\n\t\t}\n\tret = 1;\n err:\n\tBN_CTX_end(ctx);\n\tif (new_ctx != NULL)\n\t\tBN_CTX_free(new_ctx);\n\tif (prod_Z != NULL)\n\t\t{\n\t\tfor (i = 0; i < num; i++)\n\t\t\t{\n\t\t\tif (prod_Z[i] != NULL)\n\t\t\t\tBN_clear_free(prod_Z[i]);\n\t\t\t}\n\t\tOPENSSL_free(prod_Z);\n\t\t}\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}', 'BIGNUM *BN_mod_inverse(BIGNUM *in,\n\tconst BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)\n\t{\n\tBIGNUM *rv;\n\tint noinv;\n\trv = int_bn_mod_inverse(in, a, n, ctx, &noinv);\n\tif (noinv)\n\t\tBNerr(BN_F_BN_MOD_INVERSE,BN_R_NO_INVERSE);\n\treturn rv;\n\t}', 'BIGNUM *int_bn_mod_inverse(BIGNUM *in,\n\tconst BIGNUM *a, const BIGNUM *n, BN_CTX *ctx, int *pnoinv)\n\t{\n\tBIGNUM *A,*B,*X,*Y,*M,*D,*T,*R=NULL;\n\tBIGNUM *ret=NULL;\n\tint sign;\n\tif (pnoinv)\n\t\t*pnoinv = 0;\n\tif ((BN_get_flags(a, BN_FLG_CONSTTIME) != 0) || (BN_get_flags(n, BN_FLG_CONSTTIME) != 0))\n\t\t{\n\t\treturn BN_mod_inverse_no_branch(in, a, n, ctx);\n\t\t}\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\tif (pnoinv)\n\t\t\t*pnoinv = 1;\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\tbn_check_top(ret);\n\treturn(ret);\n\t}', 'static BIGNUM *BN_mod_inverse_no_branch(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 local_A, local_B;\n\tBIGNUM *pA, *pB;\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\tpB = &local_B;\n\t\tBN_with_flags(pB, B, BN_FLG_CONSTTIME);\n\t\tif (!BN_nnmod(B, pB, A, ctx)) goto err;\n\t\t}\n\tsign = -1;\n\twhile (!BN_is_zero(B))\n\t\t{\n\t\tBIGNUM *tmp;\n\t\tpA = &local_A;\n\t\tBN_with_flags(pA, A, BN_FLG_CONSTTIME);\n\t\tif (!BN_div(D,M,pA,B,ctx)) goto err;\n\t\ttmp=A;\n\t\tA=B;\n\t\tB=M;\n\t\tif (!BN_mul(tmp,D,X,ctx)) goto err;\n\t\tif (!BN_add(tmp,tmp,Y)) goto err;\n\t\tM=Y;\n\t\tY=X;\n\t\tX=tmp;\n\t\tsign = -sign;\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_NO_BRANCH,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\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\tint no_branch=0;\n\tif (num->top > 0 && num->d[num->top - 1] == 0)\n\t\t{\n\t\tBNerr(BN_F_BN_DIV,BN_R_NOT_INITIALIZED);\n\t\treturn 0;\n\t\t}\n\tbn_check_top(num);\n\tif ((BN_get_flags(num, BN_FLG_CONSTTIME) != 0) || (BN_get_flags(divisor, BN_FLG_CONSTTIME) != 0))\n\t\t{\n\t\tno_branch=1;\n\t\t}\n\tbn_check_top(dv);\n\tbn_check_top(rm);\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 (!no_branch && 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 || tmp == NULL || snum == NULL)\n\t\tgoto 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\tif (no_branch)\n\t\t{\n\t\tif (snum->top <= sdiv->top+1)\n\t\t\t{\n\t\t\tif (bn_wexpand(snum, sdiv->top + 2) == NULL) goto err;\n\t\t\tfor (i = snum->top; i < sdiv->top + 2; i++) snum->d[i] = 0;\n\t\t\tsnum->top = sdiv->top + 2;\n\t\t\t}\n\t\telse\n\t\t\t{\n\t\t\tif (bn_wexpand(snum, snum->top + 1) == NULL) goto err;\n\t\t\tsnum->d[snum->top] = 0;\n\t\t\tsnum->top ++;\n\t\t\t}\n\t\t}\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-no_branch;\n\tresp= &(res->d[loop-1]);\n\tif (!bn_wexpand(tmp,(div_n+1))) goto err;\n\tif (!no_branch)\n\t\t{\n\t\tif (BN_ucmp(&wnum,sdiv) >= 0)\n\t\t\t{\n\t\t\tbn_clear_top2max(&wnum);\n\t\t\tbn_sub_words(wnum.d, wnum.d, sdiv->d, div_n);\n\t\t\t*resp=1;\n\t\t\t}\n\t\telse\n\t\t\tres->top--;\n\t\t}\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;\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\t{\n\t\t\tBN_ULONG ql, qh;\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\t\t\t}\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\tif (no_branch)\tbn_correct_top(res);\n\tBN_CTX_end(ctx);\n\treturn(1);\nerr:\n\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}']