Lines Matching defs:dim
75 GLuint dim, GLuint order)
84 for (k = 0; k < dim; k++)
85 out[k] = s * cp[k] + bincoeff * t * cp[dim + k];
87 for (i = 2, cp += 2 * dim, powert = t * t; i < order;
88 i++, powert *= t, cp += dim) {
92 for (k = 0; k < dim; k++)
98 for (k = 0; k < dim; k++)
119 GLuint dim, GLuint uorder, GLuint vorder)
121 GLfloat *cp = cn + uorder * vorder * dim;
122 GLuint i, uinc = vorder * dim;
131 GLfloat *ucp = &cn[j * dim];
138 for (k = 0; k < dim; k++)
139 cp[j * dim + k] = s * ucp[k] + bincoeff * u * ucp[uinc + k];
146 for (k = 0; k < dim; k++)
147 cp[j * dim + k] =
148 s * cp[j * dim + k] + bincoeff * poweru * ucp[k];
153 _math_horner_bezier_curve(cp, out, v, dim, vorder);
156 _math_horner_bezier_curve(cn, out, v, dim, vorder);
169 _math_horner_bezier_curve(cn, &cp[i * dim], v, dim, vorder);
173 _math_horner_bezier_curve(cp, out, u, dim, uorder);
176 _math_horner_bezier_curve(cn, out, u, dim, uorder);
196 GLfloat * dv, GLfloat u, GLfloat v, GLuint dim,
199 GLfloat *dcn = cn + uorder * vorder * dim;
203 GLuint uinc = vorder * dim;
212 #define CN(I,J,K) cn[(I)*uinc+(J)*dim+(K)]
216 for (k = 0; k < dim; k++) {
231 for (k = 0; k < dim; k++) {
268 for (k = 0; k < dim; k++) {
304 for (k = 0; k < dim; k++) {
336 for (k = 0; k < dim; k++) {
391 for (k = 0; k < dim; k++) {