| 53 |  | (ip[1][0]-ip[3][0])*(ip[2][1]-ip[3][1]); | 
| 54 |  | af *= af >= 0 ? 0.5 : -0.5; | 
| 55 |  | getback: | 
| 56 | < | copystruct(&vrev, vp);          /* compute reverse view */ | 
| 56 | > | vrev = *vp;             /* compute reverse view */ | 
| 57 |  | for (i = 0; i < 3; i++) { | 
| 58 |  | vrev.vdir[i] = -vp->vdir[i]; | 
| 59 |  | vrev.vup[i] = -vp->vup[i]; | 
| 239 |  | GCOORD  *gcp; | 
| 240 |  | register struct cellist *cl; | 
| 241 |  | { | 
| 242 | < | copystruct(cl->cl+cl->n, gcp); | 
| 242 | > | *(cl->cl+cl->n) = *gcp; | 
| 243 |  | cl->n++; | 
| 244 |  | return(1); | 
| 245 |  | } | 
| 292 |  | * sorted automatically by visit_cells(), so we don't need this. | 
| 293 |  | */ | 
| 294 |  | /* optimize memory use */ | 
| 295 | < | cl.cl = (GCOORD *)realloc((char *)cl.cl, cl.n*sizeof(GCOORD)); | 
| 295 | > | cl.cl = (GCOORD *)realloc((void *)cl.cl, cl.n*sizeof(GCOORD)); | 
| 296 |  | if (cl.cl == NULL) | 
| 297 |  | goto memerr; | 
| 298 |  | /* sort the list */ | 
| 304 |  | } | 
| 305 |  |  | 
| 306 |  |  | 
| 307 | < | gridlines(f)                    /* run through holodeck section grid lines */ | 
| 308 | < | int     (*f)(); | 
| 307 | > | extern void | 
| 308 | > | gridlines(                      /* run through holodeck section grid lines */ | 
| 309 | > | void    (*f)(FVECT wp[2]) | 
| 310 | > | ) | 
| 311 |  | { | 
| 312 |  | register int    hd, w, i; | 
| 313 |  | int     g0, g1; |