Searched refs:n_upper (Results 1 - 8 of 8) sorted by relevance
| /xsrc/external/mit/glu/dist/src/libnurbs/interface/ |
| H A D | glsurfeval.cc | 74 extern "C" { void evalUStripExt(int n_upper, REAL v_upper, REAL* upper_val,
343 OpenGLSurfaceEvaluator::evalUStrip(int n_upper, REAL v_upper, REAL* upper_val, int n_lower, REAL v_lower, REAL* lower_val) argument
346 inEvalUStrip(n_upper, v_upper, upper_val,
351 evalUStripExt(n_upper, v_upper, upper_val,
394 if(i >= n_upper) /*case1: no more in upper*/
416 if(i<n_upper-1) /*at least two vertices in upper*/
423 for(k=n_upper-1; k>=i; k--) /*reverse order for two-side lighting*/
448 while(k<n_upper)
|
| H A D | glsurfeval.h | 132 void evalUStrip(int n_upper, REAL v_upper, REAL* upper_val,
309 void inEvalUStrip(int n_upper, REAL v_upper, REAL* upper_val,
|
| H A D | insurfeval.cc | 1163 *n_upper >=1
1166 void OpenGLSurfaceEvaluator::inEvalUStrip(int n_upper, REAL v_upper, REAL* upper_val, int n_lower, REAL v_lower, REAL* lower_val) argument
1172 REAL3* upperXYZ = (REAL3*) malloc(sizeof(REAL3)*n_upper);
1174 REAL3* upperNormal = (REAL3*) malloc(sizeof(REAL3) * n_upper);
1181 inEvalULine(n_upper, v_upper, upper_val, 1, upperXYZ, upperNormal);
1226 if(i >= n_upper) /*case1: no more in upper*/
1246 if(i<n_upper-1) /*at least two vertices in upper*/
1252 for(k=n_upper-1; k>=i; k--) /*reverse order for two-side lighting*/
1276 while(k<n_upper)
|
| /xsrc/external/mit/glu/dist/src/libnurbs/internals/ |
| H A D | backend.h | 80 void evalUStrip(int n_upper, REAL v_upper, REAL* upper_val,
|
| H A D | basicsurfeval.h | 75 virtual void evalUStrip(int n_upper, REAL v_upper, REAL* upper_val,
|
| H A D | backend.cc | 221 Backend::evalUStrip(int n_upper, REAL v_upper, REAL* upper_val, argument
225 surfaceEvaluator.evalUStrip(n_upper, v_upper, upper_val,
|
| /xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/ |
| H A D | sampleMonoPoly.h | 41 void triangulateXYMono(Int n_upper, Real upperVerts[][2],
|
| H A D | sampleMonoPoly.cc | 2255 /*n_upper>=1
2258 void triangulateXYMono(Int n_upper, Real upperVerts[][2], argument
2265 assert(n_upper>=1 && n_lower>=1);
2281 if(i >= n_upper) /*case1: no more in upper*/
2300 if(i<n_upper-1) /*at least two vertices in upper*/
2305 for(k=n_upper-1; k>=i; k--)
2325 while(k<n_upper)
|
Completed in 13 milliseconds