Cross Reference: /xsrc/external/mit/glu/dist/src/libnurbs/internals/quilt.cc

Lines Matching refs:qspec
63     for( Quiltspec *q=qspec; q != eqspec; q++ ) {
85     ps += qspec[0].offset;
86     ps += qspec[1].offset;
87     for( int i=0; i!= qspec[0].order * qspec[0].width; i++ ) {
88 	for( int j = 0; j!= qspec[1].order * qspec[1].width; j++ ) {
90 		_glu_dprintf(  "%g ", ps[i*qspec[0].stride + j*qspec[1].stride + k] );
108     int dim = eqspec - qspec; 
111 	for( j=qspec[i].width-1; j>=0; j-- )
112 	    if( (qspec[i].breakpoints[j] <= pta[i]   ) &&
113 	    	(ptb[i] <= qspec[i].breakpoints[j+1] ) ) 
116 	qspec[i].index = j;
125 	ps += qspec[0].offset;
126 	ps += qspec[1].offset;
127 	ps += qspec[0].index * qspec[0].order * qspec[0].stride;
128 	ps += qspec[1].index * qspec[1].order * qspec[1].stride;
130 		  qspec[0].stride,
131 		  qspec[1].stride,
132 		  qspec[0].order,
133 		  qspec[1].order,
134 		  qspec[0].breakpoints[qspec[0].index],
135 		  qspec[0].breakpoints[qspec[0].index+1],
136 		  qspec[1].breakpoints[qspec[1].index],
137 		  qspec[1].breakpoints[qspec[1].index+1] );
140 	ps += qspec[0].offset;
141 	ps += qspec[0].index * qspec[0].order * qspec[0].stride;
143 		      qspec[0].stride,
144 		      qspec[0].order,
145 		      qspec[0].breakpoints[qspec[0].index],
146 		      qspec[0].breakpoints[qspec[0].index+1] );
173 	return mapdesc->xformAndCullCheck( cpts + qspec[0].offset + qspec[1].offset,
174 			qspec[0].order * qspec[0].width, qspec[0].stride, 
175 			qspec[1].order * qspec[1].width, qspec[1].stride );
199     from[i] = maps->qspec[i].breakpoints[0];
200     to[i]   = maps->qspec[i].breakpoints[maps->qspec[i].width];
204 	if( m->qspec[i].breakpoints[0] > from[i] ) 
205 	    from[i] = m->qspec[i].breakpoints[0]; 
206 	if( m->qspec[i].breakpoints[m->qspec[i].width] < to[i] ) 
207 	    to[i] = m->qspec[i].breakpoints[m->qspec[i].width]; 
208 	maxpts += m->qspec[i].width + 1;
214 	for( int j=0; j<=m->qspec[i].width; j++ ) {
215 	    list.add( m->qspec[i].breakpoints[j] );
232     rate[0] = qspec[0].step_size;
233     rate[1] = qspec[1].step_size;
237 	if( q->qspec[0].step_size < rate[0] ) 
238 	    rate[0] = q->qspec[0].step_size;
239 	if( q->qspec[1].step_size < rate[1] ) 
240 	    rate[1] = q->qspec[1].step_size;
247     qspec[0].step_size = DEF_PATCH_STEPSIZE * 
248 	    (qspec[0].breakpoints[qspec[0].width] - qspec[0].breakpoints[0]); 
249     qspec[1].step_size = DEF_PATCH_STEPSIZE * 
250 	    (qspec[1].breakpoints[qspec[1].width] - qspec[1].breakpoints[0]); 
267 	    if( patchlist.getStepsize(0)/edge_len_s < qspec[0].step_size ) 
268 	       qspec[0].step_size = patchlist.getStepsize(0)/edge_len_s;
269 	    if( patchlist.getStepsize(1)/edge_len_t < qspec[1].step_size ) 
270 	      qspec[1].step_size = patchlist.getStepsize(1)/edge_len_t;