Searched refs:poly (Results 1 - 25 of 38) sorted by relevance

12

/xsrc/external/mit/libXmu/dist/src/
H A DDrawLogo.c48 XPoint poly[4]; local in function:XmuDrawLogo
78 poly[0].x = x + size; poly[0].y = y;
79 poly[1].x = x + size-d31; poly[1].y = y;
80 poly[2].x = x + 0; poly[2].y = y + size;
81 poly[3].x = x + d31; poly[3].y = y + size;
82 XFillPolygon(dpy, drawable, gcFore, poly,
[all...]
/xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
H A DpolyDBG.h45 Int DBG_polygonSelfIntersect(directedLine* poly);
46 Int DBG_edgeIntersectPoly(directedLine* edge, directedLine* poly);
50 Int DBG_isCounterclockwise(directedLine* poly);
52 Int DBG_pointInsidePoly(Real v[2], directedLine* poly);
53 Int DBG_enclosingPolygons(directedLine* poly, directedLine* list);
54 void DBG_reverse(directedLine* poly);
57 Int DBG_isConvex(directedLine *poly);
58 Int DBG_is_U_direction(directedLine *poly);
59 Int DBG_is_U_monotone(directedLine* poly);
H A DpolyDBG.cc60 Int DBG_isConvex(directedLine *poly) argument
63 if(area(poly->head(), poly->tail(), poly->getNext()->tail()) < 0.00000)
65 for(temp = poly->getNext(); temp != poly; temp = temp->getNext())
73 Int DBG_is_U_monotone(directedLine* poly) argument
79 cur_sign = compV2InX(poly->tail(), poly->head());
81 n_changes = (compV2InX(poly
98 DBG_is_U_direction(directedLine * poly) argument
230 DBG_polygonSelfIntersect(directedLine * poly) argument
257 DBG_edgeIntersectPoly(directedLine * edge,directedLine * poly) argument
302 DBG_isCounterclockwise(directedLine * poly) argument
378 DBG_rayIntersectPoly(Real v0[2],Real dx,Real dy,directedLine * poly) argument
392 DBG_pointInsidePoly(Real v[2],directedLine * poly) argument
412 DBG_enclosingPolygons(directedLine * poly,directedLine * list) argument
435 DBG_reverse(directedLine * poly) argument
[all...]
H A DsampleCompRight.cc420 directedLine* poly = NULL; local in function:sampleRightOneGridStep
444 if(poly == NULL)
445 poly = dline;
447 poly->insert(dline);
456 if(poly == NULL)
457 poly = dline;
459 poly->insert(dline);
469 poly->insert(dline);
476 poly->insert(dline);
484 poly
[all...]
H A DmonoTriangulation.cc53 /*poly is NOT deleted
55 void monoTriangulationOpt(directedLine* poly, primStream* pStream) argument
58 Int n_edges = poly->numEdges();
61 findInteriorCuspsX(poly, n_cusps, cusps);
64 monoTriangulationFun(poly, compV2InX, pStream);
75 monoTriangulationFun(poly, compV2InX, pStream);
98 monoTriangulationFun(poly, compV2InY, pStream);
341 directedLine* poly; local in function:monoTriangulationRecGenOpt
346 poly = new directedLine(INCREASING, sline);
351 poly
[all...]
H A DsampleMonoPoly.cc2031 directedLine* poly = NULL; local in function:sampleLeftOneGridStep
2053 if(poly == NULL)
2054 poly = dline;
2056 poly->insert(dline);
2064 if(poly == NULL)
2065 poly = dline;
2067 poly->insert(dline);
2074 poly->insert(dline);
2082 poly->insert(dline);
2092 poly
[all...]
H A DmonoTriangulation.h178 void monoTriangulationOpt(directedLine* poly, primStream* pStream);
/xsrc/external/mit/xlogo/dist/
H A DRenderLogo.c64 XPointDouble poly[6]; local in function:RenderLogo
98 poly[0] = thick_left.p1;
99 poly[1] = thick_right.p1;
100 intersect(&thick_right, &gap_left, &poly[2]);
101 poly[3] = gap_left.p2;
102 poly[4] = thin_left.p2;
103 intersect(&thick_left, &thin_left, &poly[5]);
108 poly, 6, 0);
110 poly[0] = thin_right.p1;
111 poly[
[all...]
/xsrc/external/mit/oclock/dist/
H A DClockP.h87 extern int check_jewel_poly ( ClockWidget w, TPoint poly[6] );
90 TPoint poly[6] );
92 extern void paint_hand ( ClockWidget w, Drawable d, GC gc, TPoint poly[6] );
H A DClock.c475 check_jewel_poly (ClockWidget w, TPoint poly[POLY_SIZE]) argument
492 a2 = sqr (poly[i].x - x) + sqr (poly[i].y - y);
493 b2 = sqr (poly[i+1].x - x) + sqr (poly[i+1].y - y);
494 c2 = sqr (poly[i].x - poly[i+1].x) + sqr (poly[i].y - poly[i+1].y);
526 TPoint poly[POLY_SIZ
525 compute_hand(ClockWidget w,double a,double l,double width,TPoint poly[POLY_SIZE]) argument
557 paint_hand(ClockWidget w,Drawable d,GC gc,TPoint poly[POLY_SIZE]) argument
[all...]
/xsrc/external/mit/xorg-server.old/dist/Xext/
H A Dxselinux_label.c100 obj->poly = 1;
104 obj->poly = 0;
187 if (obj->poly && avc_compute_member(subj->sid, obj->sid,
195 *poly_rtn = obj->poly;
229 if (obj->poly) {
240 *poly_rtn = obj->poly;
H A Dxselinuxint.h58 int poly; member in struct:__anon7c6613f20208
H A Dxselinux_hooks.c504 rc = SELinuxSelectionToSID(name, subj, &obj->sid, &obj->poly);
510 else if (obj->poly) {
567 rc = SELinuxPropertyToSID(name, subj, &obj->sid, &obj->poly);
574 else if (obj->poly) {
/xsrc/external/mit/xorg-server/dist/Xext/
H A Dxselinux_label.c103 obj->poly = 1;
107 obj->poly = 0;
193 if (obj->poly && avc_compute_member(subj->sid, obj->sid,
201 *poly_rtn = obj->poly;
234 if (obj->poly) {
245 *poly_rtn = obj->poly;
H A Dxselinuxint.h58 int poly; member in struct:__anon4f2b70050208
H A Dxselinux_hooks.c507 rc = SELinuxSelectionToSID(name, subj, &obj->sid, &obj->poly);
513 else if (obj->poly) {
570 rc = SELinuxPropertyToSID(name, subj, &obj->sid, &obj->poly);
577 else if (obj->poly) {
/xsrc/external/mit/mesa-demos/dist/src/trivial/
H A DMakefile.am89 poly \ program in directory:bin
90 poly-flat \
91 poly-flat-clip \
92 poly-flat-unfilled-clip \
93 poly-unfilled \
H A DMakefile.in151 @HAVE_GLUT_TRUE@ poly$(EXEEXT) poly-flat$(EXEEXT) \
152 @HAVE_GLUT_TRUE@ poly-flat-clip$(EXEEXT) \
153 @HAVE_GLUT_TRUE@ poly-flat-unfilled-clip$(EXEEXT) \
154 @HAVE_GLUT_TRUE@ poly-unfilled$(EXEEXT) quad$(EXEEXT) \
408 poly_SOURCES = poly.c
409 poly_OBJECTS = poly.$(OBJEXT)
411 poly_flat_SOURCES = poly-flat.c
412 poly_flat_OBJECTS = poly-flat.$(OBJEXT)
414 poly_flat_clip_SOURCES = poly
[all...]
/xsrc/external/mit/ico/dist/
H A Dico.c238 static Polyinfo *polyobj; /* -obj: the poly to draw */
472 initPoly(struct closure *closure, Polyinfo *poly, int icoW, int icoH) argument
474 const Point3D *vertices = poly->v;
475 int NV = poly->numverts;
559 * poly the polyhedron to draw
567 drawPoly(struct closure *closure, Polyinfo *poly, GC gc, argument
570 const int *f = poly->f;
571 int NV = poly->numverts;
572 int NF = poly->numfaces;
1137 Polyinfo *poly local in function:giveObjHelp
1152 Polyinfo *poly = polygons+i; local in function:findpoly
[all...]
/xsrc/external/mit/xclock/dist/
H A DClock.c995 XPointDouble poly[4]; local in function:RenderLine
1002 poly[0].x = XCoord(x1 + ldx, w);
1003 poly[0].y = YCoord(y1 - ldy, w);
1005 poly[1].x = XCoord(x2 + ldx, w);
1006 poly[1].y = YCoord(y2 - ldy, w);
1008 poly[2].x = XCoord(x2 - ldx, w);
1009 poly[2].y = YCoord(y2 + ldy, w);
1011 poly[3].x = XCoord(x1 - ldx, w);
1012 poly[3].y = YCoord(y1 + ldy, w);
1014 RenderUpdateBounds(poly,
1043 XPointDouble poly[3]; local in function:RenderHand
1088 XPointDouble poly[10]; local in function:RenderSec
[all...]
/xsrc/external/mit/xorg-server.old/dist/mi/
H A Dmiarc.c1218 SppPointRec poly[5], e; local in function:miArcJoin
1290 poly[0] = corner;
1291 poly[1] = center;
1292 poly[2] = otherCorner;
1302 poly[3].x = e.x + de * (e.x - center.x) / ae;
1303 poly[3].y = e.y + de * (e.y - center.y) / ae;
1304 poly[4] = corner;
1309 poly[0] = corner;
1310 poly[1] = center;
1311 poly[
1331 SppPointRec corner, otherCorner, center, endPoint, poly[5]; local in function:miArcCap
1532 SppPointPtr poly; local in function:miGetArcPts
[all...]
/xsrc/external/mit/xorg-server/dist/mi/
H A Dmiarc.c1349 SppPointRec poly[5], e; local in function:miArcJoin
1421 poly[0] = corner;
1422 poly[1] = center;
1423 poly[2] = otherCorner;
1433 poly[3].x = e.x + de * (e.x - center.x) / ae;
1434 poly[3].y = e.y + de * (e.y - center.y) / ae;
1435 poly[4] = corner;
1440 poly[0] = corner;
1441 poly[1] = center;
1442 poly[
1456 SppPointRec corner, otherCorner, center, endPoint, poly[5]; local in function:miArcCap
1658 SppPointPtr poly; local in function:miGetArcPts
[all...]
/xsrc/external/mit/glu/dist/src/libnurbs/internals/
H A Dsubdivider.cc265 directedLine *poly; local in function:Subdivider::drawSurfaces
269 poly = bin_to_DLineLoops(initialbin);
271 poly=poly->deleteDegenerateLinesAllPolygons();
275 poly = MC_partitionY(poly, &retSampledLines);
285 for(temp=poly; temp != NULL; temp=temp->getNextPolygon())
300 printf("num_polygons=%i\n", poly->numPolygons());
301 printf("num_edges=%i\n", poly->numEdgesAllPolygons());
302 poly
[all...]
H A Dslicer.cc1140 directedLine* poly = arcLoopToDLineLoop(loop); local in function:Slicer::slice_new
1146 sampleMonoPoly(poly, &grid, ulinear, vlinear, &pStream, &rbArray);
1156 poly->deleteSinglePolygonWithSline();
/xsrc/external/mit/xedit/dist/lisp/modules/
H A Dpsql.c543 LispObj *poly, *box, *p = NIL, *cdr, *obj; local in function:Lisp_PQgetvalue
583 poly = EVAL(CONS(ATOM("MAKE-PG-POLYGON"),
594 return (poly);

Completed in 62 milliseconds

12