Searched defs:poly (Results 1 - 6 of 6) sorted by relevance

/ast/src/lib/libz/
H A Dcrc32.c110 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;
/ast/src/lib/libtk/generic/
H A DtkTrig.c306 double radius, poly[10];
344 poly[0] = coordPtr[0] - radius;
345 poly[1] = coordPtr[1] - radius;
346 poly[2] = coordPtr[0] + radius;
347 poly[3] = coordPtr[1] + radius;
348 if (TkOvalToArea(poly, rectPtr) != inside) {
361 capStyle == CapProjecting, poly, poly+2);
363 poly[0] = poly[
303 double radius, poly[10]; local
[all...]
H A Dtk3d.c761 XPoint poly[4], b1, b2, newB1, newB2;
805 * poly[1] /
808 * b1 * poly[0] (pointPtr[i-1])
822 * pointPtr[i]) and put it in poly[2]. As part of
825 * (b) Put pointPtr[i] into poly[3].
826 * (c) Draw the polygon given by poly[0..3].
827 * (d) Advance poly[0], poly[1], b1, and b2 for the
857 poly[3] = *p1Ptr;
860 parallel = Intersect(&newB1, &newB2, &b1, &b2, &poly[
749 XPoint poly[4], b1, b2, newB1, newB2; local
[all...]
H A DtkCanvArc.c761 double poly[8], polyDist, width, t1, t2;
862 poly[0] = poly[6] = vertex[0];
863 poly[1] = poly[7] = vertex[1];
864 poly[2] = arcPtr->center1[0];
865 poly[3] = arcPtr->center1[1];
866 poly[4] = arcPtr->center2[0];
867 poly[5] = arcPtr->center2[1];
868 polyDist = TkPolygonToPoint(poly,
754 double poly[8], polyDist, width, t1, t2; local
[all...]
H A DtkCanvLine.c821 double poly[10];
888 linePtr->capStyle == CapProjecting, poly, poly+2);
890 poly[0] = poly[6];
891 poly[1] = poly[7];
892 poly[2] = poly[4];
893 poly[
814 double poly[10]; local
1326 double *poly, *coordPtr; local
[all...]
/ast/src/lib/libvcodex/
H A Dvclzparse.c47 ssize_t poly; /* number of polynomial terms */ member in struct:_hash_s
78 hs->poly = (mmin = mmin >= HMIN ? mmin : HMIN);
97 for(k = 1; k < hs->poly; ++k)
116 ky = cm ? cm[ks[hs->poly - 1]] : ks[hs->poly - 1];
117 for(k = hs->poly-2; k >= 0; --k)
221 mmin = hs->poly;
224 if(vcpa->nsrc >= hs->poly) /* add source data into hash table */

Completed in 26 milliseconds