| 20 |
|
#define vfork fork |
| 21 |
|
#endif |
| 22 |
|
|
| 23 |
< |
#define MAXSBUF 409580 /* maximum total size of scanline buffer */ |
| 24 |
< |
#define HSIZE 227 /* size of scanline hash table */ |
| 23 |
> |
#define MAXSBUF 524268 /* maximum total size of scanline buffer */ |
| 24 |
> |
#define HSIZE 317 /* size of scanline hash table */ |
| 25 |
|
#define NRETIRE 16 /* number of scanlines to retire at once */ |
| 26 |
|
|
| 27 |
|
int rt_pid = -1; /* process id for rtrace */ |
| 75 |
|
if (sl->y == y) { /* reclaim */ |
| 76 |
|
sl->next = hashtab[hi]; |
| 77 |
|
hashtab[hi] = sl; |
| 78 |
+ |
#ifdef DEBUG |
| 79 |
+ |
if (verbose) |
| 80 |
+ |
fprintf(stderr, |
| 81 |
+ |
"%s: scanline %d reclaimed\n", |
| 82 |
+ |
progname, y); |
| 83 |
+ |
#endif |
| 84 |
|
} |
| 85 |
|
return(sl); |
| 86 |
|
} |
| 416 |
|
scanretire() /* retire old scanlines to free list */ |
| 417 |
|
{ |
| 418 |
|
SCAN *sold[NRETIRE]; |
| 413 |
– |
SCAN head; |
| 419 |
|
int n; |
| 420 |
|
int h; |
| 421 |
|
register SCAN *sl; |
| 422 |
|
register int i; |
| 423 |
|
/* grab the NRETIRE oldest scanlines */ |
| 424 |
|
sold[n = 0] = NULL; |
| 425 |
< |
for (h = 0; h < HSIZE; h++) { |
| 426 |
< |
head.next = hashtab[h]; |
| 427 |
< |
sl = &head; |
| 428 |
< |
while (sl->next != NULL) { |
| 424 |
< |
for (i = n; i && sold[i-1]->lused > sl->next->lused; i--) |
| 425 |
< |
if (i == NRETIRE) { /* reallocate */ |
| 426 |
< |
register int oh; |
| 427 |
< |
oh = shash(sold[NRETIRE-1]->y); |
| 428 |
< |
sold[NRETIRE-1]->next = hashtab[oh]; |
| 429 |
< |
if (h == oh && sl == &head) |
| 430 |
< |
head.next = sl = sold[NRETIRE-1]; |
| 431 |
< |
else |
| 432 |
< |
hashtab[oh] = sold[NRETIRE-1]; |
| 433 |
< |
} else /* else bubble up */ |
| 425 |
> |
for (h = 0; h < HSIZE; h++) |
| 426 |
> |
for (sl = hashtab[h]; sl != NULL; sl = sl->next) { |
| 427 |
> |
for (i = n; i && sold[i-1]->lused > sl->lused; i--) |
| 428 |
> |
if (i < NRETIRE) |
| 429 |
|
sold[i] = sold[i-1]; |
| 430 |
|
if (i < NRETIRE) { |
| 431 |
< |
sold[i] = sl->next; |
| 437 |
< |
sl->next = sl->next->next; |
| 431 |
> |
sold[i] = sl; |
| 432 |
|
if (n < NRETIRE) /* grow list */ |
| 433 |
|
n++; |
| 434 |
< |
} else |
| 441 |
< |
sl = sl->next; |
| 434 |
> |
} |
| 435 |
|
} |
| 443 |
– |
hashtab[h] = head.next; |
| 444 |
– |
} |
| 436 |
|
/* put scanlines into free list */ |
| 437 |
< |
for (i = 1; i < n; i++) { |
| 438 |
< |
sold[i]->next = freelist; |
| 439 |
< |
freelist = sold[i]; |
| 437 |
> |
for (i = 0; i < n; i++) { |
| 438 |
> |
h = shash(sold[i]->y); |
| 439 |
> |
sl = hashtab[h]; |
| 440 |
> |
if (sl == sold[i]) |
| 441 |
> |
hashtab[h] = sl->next; |
| 442 |
> |
else { |
| 443 |
> |
while (sl->next != sold[i]) /* IS in list */ |
| 444 |
> |
sl = sl->next; |
| 445 |
> |
sl->next = sold[i]->next; |
| 446 |
> |
} |
| 447 |
> |
if (i > 0) { /* save oldest as return value */ |
| 448 |
> |
sold[i]->next = freelist; |
| 449 |
> |
freelist = sold[i]; |
| 450 |
> |
} |
| 451 |
|
} |
| 452 |
|
return(sold[0]); |
| 453 |
|
} |
