poly
if (!BN_GF2m_mod_arr(x1, &point->X, group->poly))
if (!BN_GF2m_mod_arr(x, x_, group->poly))
if (!BN_GF2m_mod_sqrt_arr(y, &group->b, group->poly, ctx))
if (!BN_GF2m_mod_solve_quad_arr(z, tmp, group->poly, ctx)) {
group->poly[0] = 0;
group->poly[1] = 0;
group->poly[2] = 0;
group->poly[3] = 0;
group->poly[4] = 0;
group->poly[5] = -1;
dest->poly[0] = src->poly[0];
dest->poly[1] = src->poly[1];
dest->poly[2] = src->poly[2];
dest->poly[3] = src->poly[3];
dest->poly[4] = src->poly[4];
dest->poly[5] = src->poly[5];
if (bn_wexpand(&dest->a, (int) (dest->poly[0] + BN_BITS2 - 1) / BN_BITS2) == NULL)
if (bn_wexpand(&dest->b, (int) (dest->poly[0] + BN_BITS2 - 1) / BN_BITS2) == NULL)
i = BN_GF2m_poly2arr(&group->field, group->poly, 6) - 1;
if (!BN_GF2m_mod_arr(&group->a, a, group->poly))
if (bn_wexpand(&group->a, (int) (group->poly[0] + BN_BITS2 - 1) / BN_BITS2) == NULL)
if (!BN_GF2m_mod_arr(&group->b, b, group->poly))
if (bn_wexpand(&group->b, (int) (group->poly[0] + BN_BITS2 - 1) / BN_BITS2) == NULL)
if (!BN_GF2m_mod_arr(b, &group->b, group->poly))
return BN_GF2m_mod_mul_arr(r, a, b, group->poly, ctx);
return BN_GF2m_mod_sqr_arr(r, a, group->poly, ctx);
|| !((group->poly[0] != 0) && (group->poly[1] != 0) && (group->poly[2] == 0))) {
*k = group->poly[1];
|| !((group->poly[0] != 0) && (group->poly[1] != 0) && (group->poly[2] != 0) && (group->poly[3] != 0) && (group->poly[4] == 0))) {
*k1 = group->poly[3];
*k2 = group->poly[2];
*k3 = group->poly[1];
while (group->poly[i] != 0)
int poly[6]; /* Field specification for curves over GF(2^m).
poly1305_update(&ctx->poly, pad0, PADDING_LEN(ctx->ad_len));
poly1305_update(&ctx->poly, out, in_len);
poly1305_update(&ctx->poly, in, in_len);
poly1305_update(&ctx->poly, pad0, PADDING_LEN(ctx->ad_len));
poly1305_update(&ctx->poly, out, in_len);
poly1305_update(&ctx->poly, in, in_len);
poly1305_update(&ctx->poly, pad0, PADDING_LEN(in_len));
poly1305_update(&ctx->poly, (uint8_t *)lens, sizeof(lens));
poly1305_finish(&ctx->poly, tag);
poly1305_state poly;
poly1305_init(&ctx->poly, poly_key);
poly1305_update(&ctx->poly, ad, ad_len);
u32 poly = 0xEDB88320; /* Polynomial for 802.3 CRC calculation */
crc = (crc >> 1) ^ (poly & mask);
const u_int poly = 0xedb88320;
v = (v >> 1)^(((v ^ c) & 0x01) ? poly : 0);
return poly(y2000, coef2006, nitems(coef2006)) / 86400.0;
return poly(y2000, coef1987, nitems(coef1987)) / 86400.0;
return poly(c, coef1900, nitems(coef1900));
return poly(c, coef1800, nitems(coef1800));
return poly(y1700, coef1700, nitems(coef1700)) / 86400.0;
return poly(y1600, coef1600, nitems(coef1600)) / 86400.0;
return poly(y1000, coef500, nitems(coef500)) / 86400.0;
return poly(y0, coef0, nitems(coef0)) / 86400.0;
return mod_f(poly(c, coef, nitems(coef)), 360);
double correction = poly(c, coef, nitems(coef));
double approx = j2000 + poly(c, coef_ap, nitems(coef_ap));
double solar_anomaly = poly(c, coef_sa, nitems(coef_sa));
double lunar_anomaly = poly(c, coef_la, nitems(coef_la));
double moon_argument = poly(c, coef_ma, nitems(coef_ma));
double omega = poly(c, coef_om, nitems(coef_om));
return mod_f(poly(c, coef, nitems(coef)), 360);
return mod_f(poly(c, coef, nitems(coef)), 360);
return mod_f(poly(c, coef, nitems(coef)), 360);
return mod_f(poly(c, coef, nitems(coef)), 360);
return mod_f(poly(c, coef, nitems(coef)), 360);
double A = poly(c, coefsA, nitems(coefsA));
double B = poly(c, coefsB, nitems(coefsB));
double poly(double x, const double *coefs, size_t n);