| /reactos/dll/opengl/glu32/src/libnurbs/internals/ |
| H A D | trimline.h | 48 TrimVertex** pts;
53 TrimVertex t, b;
54 TrimVertex *tinterp, *binterp;
59 static long interpvert( TrimVertex *, TrimVertex *, TrimVertex *, REAL );
66 void init( TrimVertex * );
74 inline TrimVertex * next( void );
77 inline TrimVertex * last( void );
80 inline TrimVertex *
86 inline TrimVertex *
92 inline TrimVertex *
[all …]
|
| H A D | ccw.cc | 50 Subdivider::bbox( TrimVertex *a, TrimVertex *b, TrimVertex *c, int p ) in bbox()
61 TrimVertex *v2 = &j2->pwlArc->pts[0]; in ccwTurn_sr()
63 TrimVertex *v1next = v1-1; in ccwTurn_sr()
64 TrimVertex *v2next = v2+1; in ccwTurn_sr()
176 TrimVertex *v1next = v1-1; in ccwTurn_sl()
177 TrimVertex *v2next = v2+1; in ccwTurn_sl()
289 TrimVertex *v1next = v1-1; in ccwTurn_tr()
290 TrimVertex *v2next = v2+1; in ccwTurn_tr()
402 TrimVertex *v1next = v1-1; in ccwTurn_tl()
403 TrimVertex *v2next = v2+1; in ccwTurn_tl()
[all …]
|
| H A D | trimline.cc | 58 Trimline::init( TrimVertex *v ) in init()
76 Trimline::append( TrimVertex *v ) in append()
92 TrimVertex *tmp=tinterp; in swap()
120 TrimVertex *p; in getNextPts()
142 TrimVertex *q; in getPrevPts()
165 TrimVertex *lastpt1 = &lastpwl->pts[lastpwl->npts-1]; in getNextPts()
167 TrimVertex *lastpt2 = botarc->pwlArc->pts; in getNextPts()
168 TrimVertex *p = jarcl.getnextpt(); in getNextPts()
183 TrimVertex *lastpt2 = botarc->pwlArc->pts; in getPrevPts()
186 TrimVertex *q = jarcl.getprevpt(); in getPrevPts()
[all …]
|
| H A D | reader.cc | 60 O_pwlcurve::O_pwlcurve( long _type, long count, INREAL *array, long byte_stride, TrimVertex *trimpt… in O_pwlcurve()
73 TrimVertex *v = pts; in O_pwlcurve()
74 TrimVertex *prev = NULL; in O_pwlcurve()
101 TrimVertex *v = pts; in O_pwlcurve()
102 for( TrimVertex *lastv = v + count; v != lastv; v++ ) { in O_pwlcurve()
112 O_pwlcurve::O_pwlcurve( long _type, long count, INREAL *array, long byte_stride, TrimVertex *trimpt… in O_pwlcurve()
124 TrimVertex *v = pts; in O_pwlcurve()
125 for( TrimVertex *lastv = v + count; v != lastv; v++ ) { in O_pwlcurve()
133 TrimVertex *v = pts; in O_pwlcurve()
134 for( TrimVertex *lastv = v + count; v != lastv; v++ ) { in O_pwlcurve()
|
| H A D | backend.h | 66 void tmeshvert( TrimVertex * );
69 void linevert( TrimVertex * );
74 void triangle( TrimVertex*, TrimVertex*, TrimVertex* );
86 void tmeshvertNOGE(TrimVertex *t);
87 void tmeshvertNOGE_BU(TrimVertex *t);
88 void tmeshvertNOGE_BV(TrimVertex *t);
|
| H A D | pwlarc.h | 42 class TrimVertex; variable
46 TrimVertex * pts; /* sample points */
50 inline PwlArc( int, TrimVertex * );
51 inline PwlArc( int, TrimVertex *, long );
63 PwlArc::PwlArc( int _npts, TrimVertex *_pts ) in PwlArc()
71 PwlArc::PwlArc( int _npts, TrimVertex *_pts, long _type ) in PwlArc()
|
| H A D | trimregion.cc | 86 TrimRegion::getGridExtent( TrimVertex *l, TrimVertex *r ) in getGridExtent()
104 TrimVertex *lf = left.first(); in canTile()
105 TrimVertex *ll = left.last(); in canTile()
106 TrimVertex *l = ( ll->param[0] > lf->param[0] ) ? ll : lf; in canTile()
108 TrimVertex *rf = right.first(); in canTile()
109 TrimVertex *rl = right.last(); in canTile()
110 TrimVertex *r = ( rl->param[0] < rf->param[0] ) ? rl : rf; in canTile()
|
| H A D | jarcloc.h | 44 TrimVertex *p;
45 TrimVertex *plast;
48 inline TrimVertex * getnextpt( void );
49 inline TrimVertex * getprevpt( void );
62 inline TrimVertex *
75 inline TrimVertex *
|
| H A D | coveandtiler.h | 59 void coveUpperLeftNoGrid( TrimVertex * );
60 void coveUpperRightNoGrid( TrimVertex * );
61 void coveLowerLeftNoGrid( TrimVertex * );
62 void coveLowerRightNoGrid( TrimVertex * );
69 inline void output( TrimVertex* );
|
| H A D | trimvertex.h | 43 class TrimVertex { /* a vertex on a trim curve */
53 typedef class TrimVertex *TrimVertex_p;
56 det3( TrimVertex *a, TrimVertex *b, TrimVertex *c ) in det3()
|
| H A D | trimvertpool.cc | 53 : pool( sizeof(TrimVertex)*3, 32, "Threevertspool" ) in TrimVertexPool()
102 TrimVertex *
105 TrimVertex *v; in get()
107 v = (TrimVertex *) pool.new_buffer(); in get()
116 v = vlist[nextvlistslot++] = new TrimVertex[n]; in get()
|
| H A D | coveandtiler.cc | 66 CoveAndTiler::output( TrimVertex *tv ) in output()
94 TrimVertex blv, tlv, *bl, *tl; in coveAndTile()
96 TrimVertex *lf = left.first(); in coveAndTile()
97 TrimVertex *ll = left.last(); in coveAndTile()
130 TrimVertex brv, trv, *br, *tr; in coveAndTile()
132 TrimVertex *rf = right.first(); in coveAndTile()
133 TrimVertex *rl = right.last(); in coveAndTile()
228 TrimVertex *vert = right.next(); in coveUR()
290 TrimVertex *vert = left.next(); in coveUL()
351 TrimVertex *vert = left.prev(); in coveLL()
[all …]
|
| H A D | subdivider.h | 64 void addArc( int, TrimVertex *, long );
167 inline int bbox( TrimVertex *, TrimVertex *, TrimVertex *, int );
169 static int ccw( TrimVertex *, TrimVertex *, TrimVertex * );
|
| H A D | gridtrimvertex.h | 47 TrimVertex dummyt;
51 TrimVertex *t;
56 inline void set( TrimVertex * );
82 GridTrimVertex::set( TrimVertex *v ) in set()
|
| H A D | trimvertpool.h | 41 class TrimVertex; variable
50 TrimVertex * get( int );
53 TrimVertex ** vlist;
|
| H A D | monotonizer.cc | 116 TrimVertex *firstvert = jarc->pwlArc->pts; in monotonize()
117 TrimVertex *lastvert = firstvert + (jarc->pwlArc->npts - 1); in monotonize()
127 TrimVertex *vert; in monotonize()
212 TrimVertex *firstvert = jarc->pwlArc->pts; in isMonotone()
213 TrimVertex *lastvert = firstvert + (jarc->pwlArc->npts - 1); in isMonotone()
217 TrimVertex *vert = firstvert; in isMonotone()
|
| H A D | backend.cc | 279 Backend::tmeshvertNOGE(TrimVertex *t) in tmeshvertNOGE()
289 Backend::tmeshvertNOGE_BU(TrimVertex *t) in tmeshvertNOGE_BU()
298 Backend::tmeshvertNOGE_BV(TrimVertex *t) in tmeshvertNOGE_BV()
323 Backend::tmeshvert( TrimVertex *t ) in tmeshvert()
487 Backend::linevert( TrimVertex *t ) in linevert()
517 Backend::triangle( TrimVertex *a, TrimVertex *b, TrimVertex *c ) in triangle()
|
| H A D | hull.cc | 65 TrimVertex *lfirst = left.first(); in init()
66 TrimVertex *llast = left.last(); in init()
91 TrimVertex *rfirst = right.first(); in init()
92 TrimVertex *rlast = right.last(); in init()
|
| H A D | reader.h | 52 class TrimVertex; variable
85 TrimVertex *pts; /* array of trim vertices */
91 O_pwlcurve( long, long, INREAL *, long, TrimVertex * );
|
| H A D | intersect.cc | 157 vert_interp( TrimVertex *n, TrimVertex *l, TrimVertex *r, int p, REAL val ) in vert_interp()
179 TrimVertex* v = jarc->pwlArc->pts; in arc_split()
220 TrimVertex *newjunk = trimvertexpool.get(maxvertex -i+1 /*-j*/); in arc_split()
228 TrimVertex *vcopy = trimvertexpool.get(maxvertex); in arc_split()
263 TrimVertex *newjunk = trimvertexpool.get(3); in arc_split()
356 TrimVertex *v = pwlArc->pts; in pwlarc_intersect()
376 TrimVertex *v = pwlArc->pts; in pwlarc_intersect()
|
| H A D | trimregion.h | 65 void getGridExtent( TrimVertex *, TrimVertex * );
|
| H A D | arctess.cc | 108 TrimVertex *p = trimvertexpool.get(2); in bezier()
136 TrimVertex *newvert = trimvertexpool.get( nsteps+1 ); in pwl_left()
165 TrimVertex *newvert = trimvertexpool.get( nsteps+1 ); in pwl_right()
195 TrimVertex *newvert = trimvertexpool.get( nsteps+1 ); in pwl_top()
224 TrimVertex *newvert = trimvertexpool.get( nsteps+1 ); in pwl_bottom()
254 TrimVertex *newvert = trimvertexpool.get( nsteps+1 ); in pwl()
361 TrimVertex *vert = trimvertexpool.get( nsteps+1 ); in tessellateNonlinear()
|
| H A D | slicer.cc | 265 static void evalLineNOGE_BU(TrimVertex *verts, int n, Backend& backend) in evalLineNOGE_BU()
276 static void evalLineNOGE_BV(TrimVertex *verts, int n, Backend& backend) in evalLineNOGE_BV()
287 static void evalLineNOGE(TrimVertex *verts, int n, Backend& backend) in evalLineNOGE()
303 inline void OPT_OUTVERT(TrimVertex& vv, Backend& backend) in OPT_OUTVERT()
1032 TrimVertex *trimVert =/*&X*/ (TrimVertex*)malloc(sizeof(TrimVertex)); in evalStream()
|
| H A D | slicer.h | 47 class TrimVertex; variable
|
| H A D | bin.cc | 157 TrimVertex *pts = jarc->pwlArc->pts; in listBezier()
|