Lines Matching defs:divs
96 int divs = (divs0 > 0) ? divs0 : 1;
99 float* dc = (float*)malloc(teeth * segs * divs * sizeof(float));
100 float* ds = (float*)malloc(teeth * segs * divs * sizeof(float));
101 int num_vertices = teeth * segs * 2 * (3 + 2 * divs);
102 int num_triangles = base_triangles * (1 + divs);
111 da = (float)(2.0 * M_PI / (teeth * segs * divs));
112 for(i = 0; i < teeth * segs * divs; ++i) {
119 s[i] = ds[i * divs];
120 c[i] = dc[i * divs];
140 for(i = 0; i < teeth * segs * divs; ++i) {
150 for(k = j * divs; k < (j + 1) * divs; ++k) {
152 if(nextk == teeth * segs * divs)
157 indices.poly(teeth * segs + nextj * divs, j, nextj);
161 indices.base += teeth * segs * (1 + divs);
205 for(i = 0; i < teeth * segs * divs; i++) {
207 if(next == teeth * segs * divs)
218 indices.base += teeth * segs * divs * 2;
