29 |
|
int nvs; /* number of vertices in our list */ |
30 |
|
FVECT *vnlist; /* vertex normal list */ |
31 |
|
int nvns; |
32 |
< |
FLOAT (*vtlist)[2]; /* map vertex list */ |
32 |
> |
RREAL (*vtlist)[2]; /* map vertex list */ |
33 |
|
int nvts; |
34 |
|
|
35 |
|
typedef int VNDX[3]; /* vertex index (point,map,normal) */ |
470 |
|
register char **av; |
471 |
|
{ |
472 |
|
VNDX vi; |
473 |
< |
FLOAT *p0, *p1; |
473 |
> |
RREAL *p0, *p1; |
474 |
|
FVECT v1, v2, nsum, newn; |
475 |
|
double d; |
476 |
|
register int i; |
555 |
|
char *mod; |
556 |
|
VNDX v1i, v2i, v3i; |
557 |
|
BARYCCM bvecs; |
558 |
< |
FLOAT bcoor[3][3]; |
558 |
> |
RREAL bcoor[3][3]; |
559 |
|
int texOK, patOK; |
560 |
|
int flatness; |
561 |
|
register int i; |
664 |
|
if (nvs == 0) |
665 |
|
vlist = (FVECT *)malloc(CHUNKSIZ*sizeof(FVECT)); |
666 |
|
else |
667 |
< |
vlist = (FVECT *)realloc((char *)vlist, |
667 |
> |
vlist = (FVECT *)realloc((void *)vlist, |
668 |
|
(nvs+CHUNKSIZ)*sizeof(FVECT)); |
669 |
|
if (vlist == NULL) { |
670 |
|
fprintf(stderr, |
688 |
|
if (nvns == 0) |
689 |
|
vnlist = (FVECT *)malloc(CHUNKSIZ*sizeof(FVECT)); |
690 |
|
else |
691 |
< |
vnlist = (FVECT *)realloc((char *)vnlist, |
691 |
> |
vnlist = (FVECT *)realloc((void *)vnlist, |
692 |
|
(nvns+CHUNKSIZ)*sizeof(FVECT)); |
693 |
|
if (vnlist == NULL) { |
694 |
|
fprintf(stderr, |
712 |
|
{ |
713 |
|
if (!(nvts%CHUNKSIZ)) { /* allocate next block */ |
714 |
|
if (nvts == 0) |
715 |
< |
vtlist = (FLOAT (*)[2])malloc(CHUNKSIZ*2*sizeof(FLOAT)); |
715 |
> |
vtlist = (RREAL (*)[2])malloc(CHUNKSIZ*2*sizeof(RREAL)); |
716 |
|
else |
717 |
< |
vtlist = (FLOAT (*)[2])realloc((char *)vtlist, |
718 |
< |
(nvts+CHUNKSIZ)*2*sizeof(FLOAT)); |
717 |
> |
vtlist = (RREAL (*)[2])realloc((void *)vtlist, |
718 |
> |
(nvts+CHUNKSIZ)*2*sizeof(RREAL)); |
719 |
|
if (vtlist == NULL) { |
720 |
|
fprintf(stderr, |
721 |
|
"Out of memory while allocating texture vertex %d\n", |