/external/dropbear/libtomcrypt/src/encauth/ocb/ |
ocb_init.c | 50 int poly, x, y, m, err; local 63 for (poly = 0; poly < (int)(sizeof(polys)/sizeof(polys[0])); poly++) { 64 if (polys[poly].len == ocb->block_len) { 68 if (polys[poly].len != ocb->block_len) { 102 ocb->Ls[x][y] ^= polys[poly].poly_mul[y]; 118 ocb->Lr[x] ^= polys[poly].poly_div[x];
|
/external/dropbear/libtomcrypt/src/mac/pmac/ |
pmac_init.c | 48 int poly, x, y, m, err; local 61 for (poly = 0; poly < (int)(sizeof(polys)/sizeof(polys[0])); poly++) { 62 if (polys[poly].len == pmac->block_len) { 66 if (polys[poly].len != pmac->block_len) { 105 pmac->Ls[x][y] ^= polys[poly].poly_mul[y]; 121 pmac->Lr[x] ^= polys[poly].poly_div[x];
|
/frameworks/base/core/jni/android/opengl/ |
poly.h | 41 } Poly; 47 int poly_clip_to_frustum(Poly *p1);
|
poly_clip.cpp | 30 #include "poly.h" 59 void poly_clip_to_halfspace(Poly* p, Poly* q, int index, float sign, float k) 104 * (n+6)gon, so POLY_NMAX in poly.h must be big enough to allow that. 107 int poly_clip_to_frustum(Poly *p1) 112 Poly p2, *p, *q, *r; 151 memcpy(p1, &p2, sizeof(Poly)-(POLY_NMAX-p2.n)*sizeof(Poly_vert));
|
util.cpp | 37 #include "poly.h" 77 print_poly(const char* label, Poly* pPoly) { 138 Poly poly; local 139 float* pDest = & poly.vert[0].sx; 141 poly.n = 3; 145 result = poly_clip_to_frustum(&poly);
|
/external/openssl/crypto/ec/ |
ec2_smpl.c | 155 group->poly[0] = 0; 156 group->poly[1] = 0; 157 group->poly[2] = 0; 158 group->poly[3] = 0; 159 group->poly[4] = 0; 172 dest->poly[0] = src->poly[0]; 173 dest->poly[1] = src->poly[1]; 174 dest->poly[2] = src->poly[2] [all...] |
ec2_smpt.c | 99 if (!BN_GF2m_mod_arr(x, x_, group->poly)) goto err; 102 if (!BN_GF2m_mod_sqrt_arr(y, &group->b, group->poly, ctx)) goto err; 110 if (!BN_GF2m_mod_solve_quad_arr(z, tmp, group->poly, ctx))
|
ec_lcl.h | 208 unsigned int poly[5]; /* Field specification for curves over GF(2^m). member in struct:ec_group_st 210 * t^poly[0] + t^poly[1] + ... + t^poly[k] 211 * where m = poly[0] > poly[1] > ... > poly[k] = 0.
|
ec_asn1.c | 75 while (group->poly[i] != 0) 93 || !((group->poly[0] != 0) && (group->poly[1] != 0) && (group->poly[2] == 0))) 100 *k = group->poly[1]; 112 || !((group->poly[0] != 0) && (group->poly[1] != 0) && (group->poly[2] != 0) && (group->poly[3] != 0) && (group->poly[4] == 0)) [all...] |
/external/webkit/WebCore/html/ |
HTMLAreaElement.cpp | 60 else if (equalIgnoringCase(attr->value(), "poly")) 61 m_shape = Poly; 126 shape = Poly; 131 case Poly:
|
HTMLAreaElement.h | 68 enum Shape { Default, Poly, Rect, Circle, Unknown };
|
/bionic/libm/src/ |
s_erf.c | 35 * where R = P/Q where P is an odd poly of degree 8 and 36 * Q is an odd poly of degree 10. 57 * erf(1+s) = erf(1) + s*Poly(s) 63 * P1(s) = degree 6 poly in s 64 * Q1(s) = degree 6 poly in s 70 * R1(z) = degree 7 poly in z, (z=1/x^2) 71 * S1(z) = degree 8 poly in z 80 * R2(z) = degree 6 poly in z, (z=1/x^2) 81 * S2(z) = degree 7 poly in z 92 * erfc(x) ~ ---------- * ( 1 + Poly(1/x^2) [all...] |
s_atan.c | 111 /* break sum from i=0 to 10 aT[i]z**(i+1) into odd and even poly */
|
s_atanf.c | 91 /* break sum from i=0 to 10 aT[i]z**(i+1) into odd and even poly */
|
/external/fdlibm/ |
s_erf.c | 32 * where R = P/Q where P is an odd poly of degree 8 and 33 * Q is an odd poly of degree 10. 54 * erf(1+s) = ieee_erf(1) + s*Poly(s) 60 * P1(s) = degree 6 poly in s 61 * Q1(s) = degree 6 poly in s 67 * R1(z) = degree 7 poly in z, (z=1/x^2) 68 * S1(z) = degree 8 poly in z 77 * R2(z) = degree 6 poly in z, (z=1/x^2) 78 * S2(z) = degree 7 poly in z 89 * erfc(x) ~ ---------- * ( 1 + Poly(1/x^2) [all...] |
s_atan.c | 126 /* break sum from i=0 to 10 aT[i]z**(i+1) into odd and even poly */
|
/external/quake/quake/src/QW/client/ |
gl_rsurf.c | 322 // normal lightmaped poly 428 // normal lightmaped poly 816 // add the poly to the proper lightmap chain 1491 glpoly_t *poly; local 1501 poly = Hunk_Alloc (sizeof(glpoly_t) + (lnumverts-4) * VERTEXSIZE*sizeof(float)); 1502 poly->next = fa->polys; 1503 poly->flags = fa->flags; 1504 fa->polys = poly; 1505 poly->numverts = lnumverts; 1527 VectorCopy (vec, poly->verts[i]) [all...] |
gl_warp.c | 64 glpoly_t *poly; local 123 poly = Hunk_Alloc (sizeof(glpoly_t) + (numverts-4) * VERTEXSIZE*sizeof(float)); 124 poly->next = warpface->polys; 125 warpface->polys = poly; 126 poly->numverts = numverts; 129 VectorCopy (verts, poly->verts[i]); 132 poly->verts[i][3] = s; 133 poly->verts[i][4] = t;
|
/external/quake/quake/src/WinQuake/ |
gl_rsurf.cpp | 323 // normal lightmaped poly 424 // normal lightmaped poly 884 // add the poly to the proper lightmap chain 1565 glpoly_t *poly; local [all...] |
gl_warp.cpp | 64 glpoly_t *poly; local 123 poly = (glpoly_t*) Hunk_Alloc (sizeof(glpoly_t) + (numverts-4) * VERTEXSIZE*sizeof(float)); 124 poly->next = warpface->polys; 125 warpface->polys = poly; 126 poly->numverts = numverts; 129 VectorCopy (verts, poly->verts[i]); 132 poly->verts[i][3] = s; 133 poly->verts[i][4] = t;
|
/external/skia/src/core/ |
SkMatrix.cpp | [all...] |
/external/webkit/WebCore/platform/graphics/wince/ |
PlatformPathWince.cpp | 204 static void addArcPoint(PathPolygon& poly, const PathPoint& center, const PathPoint& radius, double angle) 209 if (poly.isEmpty() || poly.last() != p) 210 poly.append(p); 213 static void addArcPoints(PathPolygon& poly, const PlatformPathElement::ArcTo& data) 215 const PathPoint& startPoint = poly.last(); 229 addArcPoint(poly, data.m_center, data.m_radius, curAngle); 231 if (poly.isEmpty() || poly.last() != data.m_end) 232 poly.append(data.m_end) [all...] |
/external/bluetooth/glib/tests/ |
hash-test.c | 147 * This fast table calculation works only if POLY is a prime polynomial 163 #define POLY 0x48000000L /* 31-bit polynomial (avoids sign problems) */ 179 sum ^= POLY >> j;
|
/external/speex/libspeex/ |
lsp.c | 325 psuml = cheb_poly_eva(pt,xl,m,stack); /* evals poly. at xl */ 340 psumr = cheb_poly_eva(pt,xr,m,stack);/* poly(xl-delta_x) */ 344 /* if no sign change increment xr and re-evaluate poly(xr). Repeat til 349 If there is no sign change between poly(xm) and poly(xl) set interval
|
/external/qemu/distrib/zlib-1.2.3/ |
crc32.c | 110 unsigned long poly; /* polynomial exclusive-or pattern */ local 122 poly = 0UL; 124 poly |= 1UL << (31 - p[n]); 130 c = c & 1 ? poly ^ (c >> 1) : c >> 1;
|