| 230 |
|
{ |
| 231 |
|
char buf[MAXSTR]; |
| 232 |
|
int i, n; |
| 233 |
< |
register int c; |
| 233 |
> |
int c; |
| 234 |
|
/* get file name */ |
| 235 |
|
if (fgets(buf, MAXSTR, fp) == NULL) |
| 236 |
|
goto readerr; |
| 285 |
|
FILE *fp |
| 286 |
|
) |
| 287 |
|
{ |
| 288 |
< |
register int i; |
| 288 |
> |
int i; |
| 289 |
|
|
| 290 |
|
fprintf(fp, "# File created by: %s\n", progname); |
| 291 |
|
fprintf(fp, "# Input file: %s\n", fhead.filename); |
| 300 |
|
|
| 301 |
|
int |
| 302 |
|
getblock( /* get an Architrion block */ |
| 303 |
< |
register BLOCK *bp, |
| 303 |
> |
BLOCK *bp, |
| 304 |
|
FILE *fp |
| 305 |
|
) |
| 306 |
|
{ |
| 343 |
|
|
| 344 |
|
int |
| 345 |
|
getopening( /* read in opening from fp */ |
| 346 |
< |
register OPNG *op, |
| 346 |
> |
OPNG *op, |
| 347 |
|
FILE *fp |
| 348 |
|
) |
| 349 |
|
{ |
| 350 |
< |
register int c; |
| 350 |
> |
int c; |
| 351 |
|
char word[32]; |
| 352 |
|
|
| 353 |
|
if (fgets(word, sizeof(word), fp) == NULL) |
| 384 |
|
|
| 385 |
|
void |
| 386 |
|
doneblock( /* free data associated with bp */ |
| 387 |
< |
register BLOCK *bp |
| 387 |
> |
BLOCK *bp |
| 388 |
|
) |
| 389 |
|
{ |
| 390 |
< |
register int i; |
| 390 |
> |
int i; |
| 391 |
|
|
| 392 |
|
if (bp->nopenings > 0) { |
| 393 |
|
for (i = 0; i < bp->nopenings; i++) |
| 400 |
|
|
| 401 |
|
void |
| 402 |
|
add2quals( /* add to qualifier lists */ |
| 403 |
< |
register BLOCK *bp |
| 403 |
> |
BLOCK *bp |
| 404 |
|
) |
| 405 |
|
{ |
| 406 |
|
ID tmpid; |
| 468 |
|
) |
| 469 |
|
{ |
| 470 |
|
int rept, nrepts; |
| 471 |
< |
register int i, j; |
| 471 |
> |
int i, j; |
| 472 |
|
|
| 473 |
|
if (sm == NULL) { /* if no sill modifier, use list */ |
| 474 |
|
sm = *ml++; |
| 506 |
|
{ |
| 507 |
|
static int nopens = 0; |
| 508 |
|
char buf[32]; |
| 509 |
< |
register PRISM *p = &op->p; |
| 509 |
> |
PRISM *p = &op->p; |
| 510 |
|
PRISM newp; |
| 511 |
< |
register int i; |
| 511 |
> |
int i; |
| 512 |
|
/* copy original prism */ |
| 513 |
|
for (i = 0; i < 4; i++) { |
| 514 |
|
newp.x[i] = p->x[i]; |
| 552 |
|
|
| 553 |
|
int |
| 554 |
|
matchrule( /* see if block matches this rule */ |
| 555 |
< |
register BLOCK *bp, |
| 556 |
< |
register RULEHD *rp |
| 555 |
> |
BLOCK *bp, |
| 556 |
> |
RULEHD *rp |
| 557 |
|
) |
| 558 |
|
{ |
| 559 |
< |
register int i; |
| 559 |
> |
int i; |
| 560 |
|
ID tmpid; |
| 561 |
|
|
| 562 |
|
if (rp->qflg & FL(Q_LAY)) { /* check layer */ |
| 589 |
|
putfaces( /* put out faces */ |
| 590 |
|
char *m, |
| 591 |
|
BLOCK *bp, |
| 592 |
< |
register int ff, |
| 592 |
> |
int ff, |
| 593 |
|
FILE *fp |
| 594 |
|
) |
| 595 |
|
{ |
| 615 |
|
|
| 616 |
|
char * |
| 617 |
|
blkname( /* think up a good name for this block */ |
| 618 |
< |
register BLOCK *bp |
| 618 |
> |
BLOCK *bp |
| 619 |
|
) |
| 620 |
|
{ |
| 621 |
|
static char nambuf[32]; |
| 622 |
|
static int blkcnt = 0; |
| 623 |
< |
register char *nam; |
| 624 |
< |
register int i, j; |
| 623 |
> |
char *nam; |
| 624 |
> |
int i, j; |
| 625 |
|
|
| 626 |
|
sprintf(nambuf, "l%d.", bp->layer); |
| 627 |
|
i = strlen(nambuf); |
| 696 |
|
|
| 697 |
|
void |
| 698 |
|
lcross( /* compute cross product */ |
| 699 |
< |
register long vr[3], |
| 700 |
< |
register long v1[3], |
| 701 |
< |
register long v2[3] |
| 699 |
> |
long vr[3], |
| 700 |
> |
long v1[3], |
| 701 |
> |
long v2[3] |
| 702 |
|
) |
| 703 |
|
{ |
| 704 |
|
vr[0] = v1[1]*v2[2] - v1[2]*v2[1]; |
| 712 |
|
|
| 713 |
|
int |
| 714 |
|
checkface( /* check a face for validity */ |
| 715 |
< |
register PRISM *p, |
| 715 |
> |
PRISM *p, |
| 716 |
|
int a, |
| 717 |
|
int b, |
| 718 |
|
int c, |
| 767 |
|
|
| 768 |
|
void |
| 769 |
|
putpoint( /* put out a point */ |
| 770 |
< |
register PRISM *p, |
| 770 |
> |
PRISM *p, |
| 771 |
|
int n, |
| 772 |
|
FILE *fp |
| 773 |
|
) |
| 781 |
|
|
| 782 |
|
void |
| 783 |
|
eputs( |
| 784 |
< |
char *s |
| 784 |
> |
const char *s |
| 785 |
|
) |
| 786 |
|
{ |
| 787 |
|
fputs(s, stderr); |