| /external/clang/test/CXX/basic/basic.def.odr/ |
| p2-typeid.cpp | 13 struct Poly {
14 virtual ~Poly();
28 void test(X<Poly> xp, X<Poly, Poly&> xpr, X<NonPoly> xnp, X<NonPoly, NonPoly&> xnpr) {
30 xp.g(Poly());
35 xpr.g(Poly()); // expected-note{{instantiation of member function}}
|
| /external/clang/test/SemaCXX/ |
| dynamic-cast.cpp | 13 struct Poly
18 struct PolyDerived : Poly
64 void poly() function
66 (void)dynamic_cast<A*>((Poly*)0);
67 (void)dynamic_cast<A&>(*((Poly*)0));
72 (void)dynamic_cast<Poly*>((A*)0); // expected-error {{'A' is not polymorphic}}
|
| /external/webkit/Tools/iExploder/iexploder-1.7.2/src/html-attrs/ |
| gtkhtml | 40 poly
|
| /external/srtp/test/ |
| lfsr.c | 120 weight(uint32_t poly) {
124 wt += octet_weight[poly & 0xff];
125 wt += octet_weight[(poly >> 8) & 0xff];
126 wt += octet_weight[(poly >> 16) & 0xff];
127 wt += octet_weight[(poly >> 24)];
137 period(uint32_t poly) {
149 x = (x >> 1) ^ poly;
167 * code generated by the polynomial poly
176 weight_distribution2(uint32_t poly, int *A) {
194 x = (x >> 1) ^ poly;
[all...] |
| /external/llvm/test/CodeGen/XCore/ |
| misc-intrinsics.ll | 17 define i32 @crc32(i32 %crc, i32 %data, i32 %poly) {
20 %result = call i32 @llvm.xcore.crc32(i32 %crc, i32 %data, i32 %poly)
24 define %0 @crc8(i32 %crc, i32 %data, i32 %poly) {
27 %result = call %0 @llvm.xcore.crc8(i32 %crc, i32 %data, i32 %poly)
|
| /external/webkit/Tools/iExploder/iexploder-1.7.2/src/html-values/ |
| webkit | 63 poly
|
| /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));
|
| /external/e2fsprogs/lib/ext2fs/ |
| crc16.h | 6 * Poly 0x8005 (x16 + x15 + x2 + 1)
|
| /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;
160 group->poly[5] = -1;
173 dest->poly[0] = src->poly[0];
174 dest->poly[1] = src->poly[1]
[all...] |
| ec_lcl.h | 208 int poly[6]; /* 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.
212 * The array is terminated with poly[k+1]=-1.
|
| 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/Source/WebCore/html/ |
| HTMLAreaElement.cpp | 62 else if (equalIgnoringCase(attr->value(), "poly"))
63 m_shape = Poly;
135 shape = Poly;
140 case Poly:
|
| HTMLAreaElement.h | 62 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...] |
| /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...] |
| /external/llvm/utils/TableGen/ |
| NeonEmitter.cpp | 103 static char ClassifyType(StringRef ty, bool &quad, bool &poly, bool &usgn) {
112 // remember poly.
114 poly = true;
130 static char ModType(const char mod, char type, bool &quad, bool &poly,
134 if (poly) {
135 poly = false;
141 poly = false;
147 poly = false;
208 bool poly = false; local
220 char type = ClassifyType(typestr, quad, poly, usgn)
297 bool poly = false; local
395 bool poly = false; local
849 bool poly = false; local
1145 bool dummy, quad = false, poly = false; local
1345 bool quad = false, poly = false, usgn = false; local
[all...] |
| /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...] |
| /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...] |
| /external/skia/src/core/ |
| SkMatrix.cpp | [all...] |
| /external/webkit/Source/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/clang/test/Sema/ |
| flexible-array-init.c | 48 struct polygon poly = { variable in typeref:struct:polygon
|
