45 |
|
struct { |
46 |
|
int flags; /* data type */ |
47 |
|
short m, n; /* number of s and t values */ |
48 |
< |
FLOAT *data; /* the data itself, s major sort */ |
48 |
> |
RREAL *data; /* the data itself, s major sort */ |
49 |
|
} datarec; /* our recorded data */ |
50 |
|
|
51 |
|
double l_hermite(), l_bezier(), l_bspline(), l_dataval(); |
55 |
|
int valid; /* point is valid (vertex number) */ |
56 |
|
FVECT p; /* vertex position */ |
57 |
|
FVECT n; /* average normal */ |
58 |
< |
FLOAT uv[2]; /* (u,v) position */ |
58 |
> |
RREAL uv[2]; /* (u,v) position */ |
59 |
|
} POINT; |
60 |
|
|
61 |
|
|
180 |
|
FILE *fp; |
181 |
|
char word[64]; |
182 |
|
register int size; |
183 |
< |
register FLOAT *dp; |
183 |
> |
register RREAL *dp; |
184 |
|
|
185 |
|
datarec.flags = HASBORDER; /* assume border values */ |
186 |
|
datarec.m = m+1; |
188 |
|
size = datarec.m*datarec.n*pointsize; |
189 |
|
if (pointsize == 3) |
190 |
|
datarec.flags |= TRIPLETS; |
191 |
< |
dp = (FLOAT *)malloc(size*sizeof(FLOAT)); |
191 |
> |
dp = (RREAL *)malloc(size*sizeof(RREAL)); |
192 |
|
if ((datarec.data = dp) == NULL) { |
193 |
|
fputs("Out of memory\n", stderr); |
194 |
|
exit(1); |
211 |
|
size--; |
212 |
|
} |
213 |
|
if (size == (m+n+1)*pointsize) { /* no border after all */ |
214 |
< |
dp = (FLOAT *)realloc((char *)datarec.data, |
215 |
< |
m*n*pointsize*sizeof(FLOAT)); |
214 |
> |
dp = (RREAL *)realloc((void *)datarec.data, |
215 |
> |
m*n*pointsize*sizeof(RREAL)); |
216 |
|
if (dp != NULL) |
217 |
|
datarec.data = dp; |
218 |
|
datarec.flags &= ~HASBORDER; |
236 |
|
{ |
237 |
|
double u, v; |
238 |
|
register int i, j; |
239 |
< |
register FLOAT *dp; |
239 |
> |
register RREAL *dp; |
240 |
|
double d00, d01, d10, d11; |
241 |
|
/* compute coordinates */ |
242 |
|
u = argument(1); v = argument(2); |