Lines Matching full:uorder
113 * for max(uorder,vorder) points is needed in the
119 GLuint dim, GLuint uorder, GLuint vorder)
121 GLfloat *cp = cn + uorder * vorder * dim;
124 if (vorder > uorder) {
125 if (uorder >= 2) {
135 bincoeff = (GLfloat) (uorder - 1);
141 for (i = 2, ucp += 2 * uinc, poweru = u * u; i < uorder;
143 bincoeff *= (GLfloat) (uorder - i);
155 else /* uorder=1 -> cn defines a curve in v */
158 else { /* vorder <= uorder */
164 for (i = 0; i < uorder; i++, cn += uinc) {
173 _math_horner_bezier_curve(cp, out, u, dim, uorder);
176 _math_horner_bezier_curve(cn, out, u, dim, uorder);
187 * must be multiplied with the (u2-u1)/uorder-1 and (v2-v1)/vorder-1.
190 * De Casteljau needs additional storage for uorder*vorder
197 GLuint uorder, GLuint vorder)
199 GLfloat *dcn = cn + uorder * vorder * dim;
202 GLuint minorder = uorder < vorder ? uorder : vorder;
208 /* algorithm. If additional storage for (uorder-1)*(vorder-1) */
215 if (uorder == vorder) {
230 else if (minorder == uorder) {
272 for (i = 0; i < uorder - 1; i++) {
283 for (h = minorder; h < uorder - 1; h++)
284 for (i = 0; i < uorder - h; i++) {
303 else if (uorder == vorder) {
306 for (i = 0; i < uorder - 1; i++) {
316 for (i = 0; i < uorder - h; i++) {
335 else if (minorder == uorder) {
338 for (i = 0; i < uorder - 1; i++) {
348 for (i = 0; i < uorder - h; i++) {
393 for (i = 0; i < uorder - 1; i++) {
403 for (i = 0; i < uorder - h; i++) {
414 for (i = 0; i < uorder - 1; i++) {
425 for (h = minorder; h < uorder - 1; h++)
426 for (i = 0; i < uorder - h; i++) {
