46 |
|
int argc; |
47 |
|
char *argv[]; |
48 |
|
{ |
49 |
+ |
extern long eclock; |
50 |
|
POINT *row0, *row1, *row2, *rp; |
51 |
|
int i, j, m, n; |
52 |
|
char stmp[256]; |
61 |
|
|
62 |
|
for (i = 8; i < argc; i++) |
63 |
|
if (!strcmp(argv[i], "-e")) |
64 |
< |
scompile(NULL, argv[++i]); |
64 |
> |
scompile(argv[++i], NULL, 0); |
65 |
|
else if (!strcmp(argv[i], "-f")) |
66 |
|
fcompile(argv[++i]); |
67 |
|
else if (!strcmp(argv[i], "-s")) |
72 |
|
modname = argv[1]; |
73 |
|
surfname = argv[2]; |
74 |
|
sprintf(stmp, "%s(s,t)=%s;", XNAME, argv[3]); |
75 |
< |
scompile(NULL, stmp); |
75 |
> |
scompile(stmp, NULL, 0); |
76 |
|
sprintf(stmp, "%s(s,t)=%s;", YNAME, argv[4]); |
77 |
< |
scompile(NULL, stmp); |
77 |
> |
scompile(stmp, NULL, 0); |
78 |
|
sprintf(stmp, "%s(s,t)=%s;", ZNAME, argv[5]); |
79 |
< |
scompile(NULL, stmp); |
79 |
> |
scompile(stmp, NULL, 0); |
80 |
|
m = atoi(argv[6]); |
81 |
|
n = atoi(argv[7]); |
82 |
|
if (m <= 0 || n <= 0) |
92 |
|
row0++; row1++; row2++; |
93 |
|
/* print header */ |
94 |
|
printhead(argc, argv); |
95 |
+ |
eclock = 0; |
96 |
|
/* initialize */ |
97 |
|
comprow(-1.0/m, row0, n); |
98 |
|
comprow(0.0, row1, n); |
248 |
|
register POINT *r0, *r1, *r2; |
249 |
|
int siz; |
250 |
|
{ |
251 |
< |
FVECT v1, v2, vc; |
251 |
> |
FVECT v1, v2; |
252 |
|
register int i; |
253 |
|
|
254 |
|
if (!smooth) /* not needed if no smoothing */ |
255 |
|
return; |
256 |
|
/* compute middle points */ |
257 |
|
while (siz-- >= 0) { |
258 |
< |
fvsum(v1, r2[0].p, r1[0].p, -1.0); |
259 |
< |
fvsum(v2, r1[1].p, r1[0].p, -1.0); |
258 |
> |
fvsum(v1, r2[0].p, r0[0].p, -1.0); |
259 |
> |
fvsum(v2, r1[1].p, r1[-1].p, -1.0); |
260 |
|
fcross(r1[0].n, v1, v2); |
259 |
– |
fvsum(v1, r0[0].p, r1[0].p, -1.0); |
260 |
– |
fcross(vc, v2, v1); |
261 |
– |
fvsum(r1[0].n, r1[0].n, vc, 1.0); |
262 |
– |
fvsum(v2, r1[-1].p, r1[0].p, -1.0); |
263 |
– |
fcross(vc, v1, v2); |
264 |
– |
fvsum(r1[0].n, r1[0].n, vc, 1.0); |
265 |
– |
fvsum(v1, r2[0].p, r1[0].p, -1.0); |
266 |
– |
fcross(vc, v2, v1); |
267 |
– |
fvsum(r1[0].n, r1[0].n, vc, 1.0); |
261 |
|
normalize(r1[0].n); |
262 |
|
r0++; r1++; r2++; |
263 |
|
} |
342 |
|
inverse[i][j] = i==j ? 1.0 : 0.0; |
343 |
|
|
344 |
|
for(i = 0; i < 4; i++) { |
345 |
< |
/* Look for raw with largest pivot and swap raws */ |
345 |
> |
/* Look for row with largest pivot and swap rows */ |
346 |
|
temp = FTINY; j = -1; |
347 |
|
for(k = i; k < 4; k++) |
348 |
|
if(ABS(m4tmp[k][i]) > temp) { |
349 |
|
temp = ABS(m4tmp[k][i]); |
350 |
|
j = k; |
351 |
|
} |
352 |
< |
if(j == -1) /* No replacing raw -> no inverse */ |
352 |
> |
if(j == -1) /* No replacing row -> no inverse */ |
353 |
|
return(0); |
354 |
|
if (j != i) |
355 |
|
for(k = 0; k < 4; k++) { |