1 |
< |
/* Copyright (c) 1997 Silicon Graphics, Inc. */ |
1 |
> |
/* Copyright (c) 1998 Silicon Graphics, Inc. */ |
2 |
|
|
3 |
|
#ifndef lint |
4 |
|
static char SCCSid[] = "$SunId$ SGI"; |
16 |
|
#define CACHESIZE 16 /* default cache size (Mbytes, 0==inf) */ |
17 |
|
#endif |
18 |
|
#ifndef FREEBEAMS |
19 |
< |
#define FREEBEAMS 512 /* maximum beams to free at a time */ |
19 |
> |
#define FREEBEAMS 1024 /* maximum beams to free at a time */ |
20 |
|
#endif |
21 |
|
#ifndef PCTFREE |
22 |
< |
#define PCTFREE 20 /* maximum fraction to free (%) */ |
22 |
> |
#define PCTFREE 15 /* maximum fraction to free (%) */ |
23 |
|
#endif |
24 |
|
#ifndef MAXFRAG |
25 |
|
#define MAXFRAG 32767 /* maximum fragments/file to track (0==inf) */ |
105 |
|
int fd; /* corresponding file descriptor */ |
106 |
|
HDGRID *hproto; /* holodeck section grid */ |
107 |
|
{ |
108 |
+ |
long rtrunc; |
109 |
|
long fpos; |
110 |
|
register HOLO *hp; |
111 |
|
register int n; |
127 |
|
error(SYSTEM, "failure loading holodeck directory"); |
128 |
|
/* check that it's clean */ |
129 |
|
if (hp->bi[nbeams(hp)].fo < 0) |
130 |
< |
error(USER, "dirty holodeck section"); |
130 |
> |
error(WARNING, "dirty holodeck section"); |
131 |
|
} else { /* assume we're creating it */ |
132 |
|
if ((hp = hdalloc(hproto)) == NULL) |
133 |
|
goto memerr; |
145 |
|
hdattach(fd); |
146 |
|
/* check rays on disk */ |
147 |
|
fpos = hdfilen(fd); |
148 |
< |
biglob(hp)->nrd = 0; |
148 |
> |
biglob(hp)->nrd = rtrunc = 0; |
149 |
|
for (n = hproto == NULL ? nbeams(hp) : 0; n > 0; n--) |
150 |
|
if (hp->bi[n].nrd) |
151 |
< |
if (hp->bi[n].fo + hp->bi[n].nrd > fpos) |
152 |
< |
hp->bi[n].nrd = 0; /* off end */ |
153 |
< |
else |
151 |
> |
if (hp->bi[n].fo + hp->bi[n].nrd > fpos) { |
152 |
> |
rtrunc += hp->bi[n].nrd; |
153 |
> |
hp->bi[n].nrd = 0; |
154 |
> |
} else |
155 |
|
biglob(hp)->nrd += hp->bi[n].nrd; |
156 |
+ |
if (rtrunc) { |
157 |
+ |
sprintf(errmsg, "truncated section, %ld rays lost (%.1f%%)", |
158 |
+ |
rtrunc, 100.*rtrunc/(rtrunc+biglob(hp)->nrd)); |
159 |
+ |
error(WARNING, errmsg); |
160 |
+ |
} |
161 |
|
/* add to holodeck list */ |
162 |
|
for (n = 0; n < HDMAX; n++) |
163 |
|
if (hdlist[n] == NULL) { |
417 |
|
} |
418 |
|
|
419 |
|
|
420 |
+ |
hdfreefrag(fd, bi) /* free a file fragment */ |
421 |
+ |
int fd; |
422 |
+ |
register BEAMI *bi; |
423 |
+ |
{ |
424 |
+ |
register struct fraglist *f; |
425 |
+ |
register int j, k; |
426 |
+ |
|
427 |
+ |
if (bi->nrd == 0) |
428 |
+ |
return; |
429 |
+ |
#ifdef DEBUG |
430 |
+ |
if (fd < 0 | fd >= nhdfragls || !hdfragl[fd].nlinks) |
431 |
+ |
error(CONSISTENCY, "bad file descriptor in hdfreefrag"); |
432 |
+ |
#endif |
433 |
+ |
f = &hdfragl[fd]; |
434 |
+ |
if (f->nfrags % FRAGBLK == 0) { /* delete empty remnants */ |
435 |
+ |
for (j = k = 0; k < f->nfrags; j++, k++) { |
436 |
+ |
while (f->fi[k].nrd == 0) |
437 |
+ |
if (++k >= f->nfrags) |
438 |
+ |
goto endloop; |
439 |
+ |
if (k > j) |
440 |
+ |
copystruct(f->fi+j, f->fi+k); |
441 |
+ |
} |
442 |
+ |
endloop: |
443 |
+ |
f->nfrags = j; |
444 |
+ |
} |
445 |
+ |
j = f->nfrags++; /* allocate a slot in free list */ |
446 |
+ |
#if MAXFRAG |
447 |
+ |
if (j >= MAXFRAG-1) |
448 |
+ |
f->nfrags--; |
449 |
+ |
#endif |
450 |
+ |
if (j % FRAGBLK == 0) { /* more free list space */ |
451 |
+ |
if (f->fi == NULL) |
452 |
+ |
f->fi = (BEAMI *)malloc(FRAGBLK*sizeof(BEAMI)); |
453 |
+ |
else |
454 |
+ |
f->fi = (BEAMI *)realloc((char *)f->fi, |
455 |
+ |
(j+FRAGBLK)*sizeof(BEAMI)); |
456 |
+ |
if (f->fi == NULL) |
457 |
+ |
error(SYSTEM, "out of memory in hdfreefrag"); |
458 |
+ |
} |
459 |
+ |
for ( ; ; j--) { /* insert in descending list */ |
460 |
+ |
if (!j || bi->fo < f->fi[j-1].fo) { |
461 |
+ |
f->fi[j].fo = bi->fo; |
462 |
+ |
f->fi[j].nrd = bi->nrd; |
463 |
+ |
break; |
464 |
+ |
} |
465 |
+ |
copystruct(f->fi+j, f->fi+(j-1)); |
466 |
+ |
} |
467 |
+ |
/* coalesce adjacent fragments */ |
468 |
+ |
/* successors never empty */ |
469 |
+ |
if (j && f->fi[j-1].fo == f->fi[j].fo + f->fi[j].nrd*sizeof(RAYVAL)) { |
470 |
+ |
f->fi[j].nrd += f->fi[j-1].nrd; |
471 |
+ |
f->fi[j-1].nrd = 0; |
472 |
+ |
} |
473 |
+ |
for (k = j+1; k < f->nfrags; k++) /* get non-empty predecessor */ |
474 |
+ |
if (f->fi[k].nrd) { |
475 |
+ |
if (f->fi[j].fo == f->fi[k].fo + |
476 |
+ |
f->fi[k].nrd*sizeof(RAYVAL)) { |
477 |
+ |
f->fi[k].nrd += f->fi[j].nrd; |
478 |
+ |
f->fi[j].nrd = 0; |
479 |
+ |
} |
480 |
+ |
break; |
481 |
+ |
} |
482 |
+ |
} |
483 |
+ |
|
484 |
+ |
|
485 |
+ |
long |
486 |
+ |
hdallocfrag(fd, nrays) /* allocate a file fragment */ |
487 |
+ |
int fd; |
488 |
+ |
unsigned int4 nrays; |
489 |
+ |
{ |
490 |
+ |
register struct fraglist *f; |
491 |
+ |
register int j, k; |
492 |
+ |
long nfo; |
493 |
+ |
|
494 |
+ |
if (nrays == 0) |
495 |
+ |
return(-1L); |
496 |
+ |
#ifdef DEBUG |
497 |
+ |
if (fd < 0 | fd >= nhdfragls || !hdfragl[fd].nlinks) |
498 |
+ |
error(CONSISTENCY, "bad file descriptor in hdallocfrag"); |
499 |
+ |
#endif |
500 |
+ |
f = &hdfragl[fd]; |
501 |
+ |
k = -1; /* find closest-sized fragment */ |
502 |
+ |
for (j = f->nfrags; j-- > 0; ) |
503 |
+ |
if (f->fi[j].nrd >= nrays && |
504 |
+ |
(k < 0 || f->fi[j].nrd < f->fi[k].nrd)) |
505 |
+ |
if (f->fi[k=j].nrd == nrays) |
506 |
+ |
break; |
507 |
+ |
if (k < 0) { /* no fragment -- extend file */ |
508 |
+ |
nfo = f->flen; |
509 |
+ |
f->flen += nrays*sizeof(RAYVAL); |
510 |
+ |
} else { /* else use fragment */ |
511 |
+ |
nfo = f->fi[k].fo; |
512 |
+ |
f->fi[k].fo += nrays*sizeof(RAYVAL); |
513 |
+ |
f->fi[k].nrd -= nrays; |
514 |
+ |
} |
515 |
+ |
return(nfo); |
516 |
+ |
} |
517 |
+ |
|
518 |
+ |
|
519 |
|
int |
520 |
|
hdsyncbeam(hp, i) /* sync beam in memory with beam on disk */ |
521 |
|
register HOLO *hp; |
522 |
|
register int i; |
523 |
|
{ |
524 |
< |
unsigned int nrays; |
419 |
< |
long nfo; |
524 |
> |
unsigned int4 nrays; |
525 |
|
unsigned int n; |
526 |
+ |
long nfo; |
527 |
|
/* check file status */ |
528 |
|
if (hdfragl[hp->fd].writerr) |
529 |
|
return(-1); |
534 |
|
/* is current fragment OK? */ |
535 |
|
if (hp->bl[i] == NULL || (nrays = hp->bl[i]->nrm) == hp->bi[i].nrd) |
536 |
|
return(0); |
537 |
< |
/* locate fragment */ |
538 |
< |
if (hp->fd >= nhdfragls || !hdfragl[hp->fd].nlinks) /* untracked */ |
539 |
< |
hp->bi[i].fo = lseek(hp->fd, 0L, 2); |
540 |
< |
|
435 |
< |
else if (hp->bi[i].fo + hp->bi[i].nrd*sizeof(RAYVAL) == |
436 |
< |
hdfragl[hp->fd].flen) /* EOF special case */ |
437 |
< |
hdfragl[hp->fd].flen = (nfo=hp->bi[i].fo) + nrays*sizeof(RAYVAL); |
438 |
< |
|
439 |
< |
else { /* general case */ |
440 |
< |
register struct fraglist *f = &hdfragl[hp->fd]; |
441 |
< |
register int j, k; |
442 |
< |
n = f->nfrags; /* relinquish old fragment */ |
443 |
< |
if (hp->bi[i].nrd) { |
444 |
< |
j = f->nfrags++; |
445 |
< |
#if MAXFRAG |
446 |
< |
if (j >= MAXFRAG-1) |
447 |
< |
f->nfrags--; |
448 |
< |
#endif |
449 |
< |
if (j % FRAGBLK == 0) { /* more frag. space */ |
450 |
< |
if (f->fi == NULL) |
451 |
< |
f->fi = (BEAMI *)malloc( |
452 |
< |
FRAGBLK*sizeof(BEAMI)); |
453 |
< |
else |
454 |
< |
f->fi = (BEAMI *)realloc((char *)f->fi, |
455 |
< |
(j+FRAGBLK)*sizeof(BEAMI)); |
456 |
< |
if (f->fi == NULL) |
457 |
< |
error(SYSTEM, |
458 |
< |
"out of memory in hdsyncbeam"); |
459 |
< |
} |
460 |
< |
for ( ; ; j--) { /* insert in descending list */ |
461 |
< |
if (!j || hp->bi[i].fo < f->fi[j-1].fo) { |
462 |
< |
f->fi[j].fo = hp->bi[i].fo; |
463 |
< |
f->fi[j].nrd = hp->bi[i].nrd; |
464 |
< |
break; |
465 |
< |
} |
466 |
< |
copystruct(f->fi+j, f->fi+(j-1)); |
467 |
< |
} |
468 |
< |
/* coalesce adjacent fragments */ |
469 |
< |
if (j && f->fi[j-1].fo == f->fi[j].fo + |
470 |
< |
f->fi[j].nrd*sizeof(RAYVAL)) { |
471 |
< |
f->fi[j].nrd += f->fi[j-1].nrd; |
472 |
< |
f->fi[j-1].nrd = 0; |
473 |
< |
n = j-1; |
474 |
< |
} |
475 |
< |
if (j+1 < f->nfrags && f->fi[j].fo == f->fi[j+1].fo + |
476 |
< |
f->fi[j+1].nrd*sizeof(RAYVAL)) { |
477 |
< |
f->fi[j+1].nrd += f->fi[j].nrd; |
478 |
< |
f->fi[j].nrd = 0; |
479 |
< |
if (j < n) n = j; |
480 |
< |
} |
481 |
< |
} |
482 |
< |
k = -1; /* find closest-sized fragment */ |
483 |
< |
for (j = (nrays ? f->nfrags : 0); j-- > 0; ) |
484 |
< |
if (f->fi[j].nrd >= nrays && |
485 |
< |
(k < 0 || f->fi[j].nrd < f->fi[k].nrd)) |
486 |
< |
if (f->fi[k=j].nrd == nrays) |
487 |
< |
break; |
488 |
< |
if (k < 0) { /* no fragment -- extend file */ |
489 |
< |
nfo = f->flen; |
490 |
< |
f->flen += nrays*sizeof(RAYVAL); |
491 |
< |
} else { /* else use fragment */ |
492 |
< |
nfo = f->fi[k].fo; |
493 |
< |
f->fi[k].fo += nrays*sizeof(RAYVAL); |
494 |
< |
if (!(f->fi[k].nrd -= nrays) && k < n) |
495 |
< |
n = k; |
496 |
< |
} |
497 |
< |
/* delete empty remnants */ |
498 |
< |
for (j = k = n; k < f->nfrags; j++, k++) { |
499 |
< |
while (f->fi[k].nrd == 0) |
500 |
< |
if (++k >= f->nfrags) |
501 |
< |
goto endloop; |
502 |
< |
if (k > j) |
503 |
< |
copystruct(f->fi+j, f->fi+k); |
504 |
< |
} |
505 |
< |
endloop: |
506 |
< |
f->nfrags = j; |
507 |
< |
} |
508 |
< |
if (nrays) { /* write the new fragment */ |
537 |
> |
if (hp->bi[i].nrd) /* relinquish old fragment */ |
538 |
> |
hdfreefrag(hp->fd, &hp->bi[i]); |
539 |
> |
if (nrays) { /* get and write new fragment */ |
540 |
> |
nfo = hdallocfrag(hp->fd, nrays); |
541 |
|
errno = 0; |
542 |
|
if (lseek(hp->fd, nfo, 0) < 0) |
543 |
|
error(SYSTEM, "cannot seek on holodeck file"); |
544 |
|
n = hp->bl[i]->nrm * sizeof(RAYVAL); |
545 |
|
if (write(hp->fd, (char *)hdbray(hp->bl[i]), n) != n) { |
546 |
|
hdfragl[hp->fd].writerr++; |
547 |
< |
hdsync(hp, 0); /* sync directory */ |
547 |
> |
hdsync(NULL, 0); /* sync directories */ |
548 |
|
error(SYSTEM, "write error in hdsyncbeam"); |
549 |
|
} |
550 |
< |
} |
550 |
> |
hp->bi[i].fo = nfo; |
551 |
> |
} else |
552 |
> |
hp->bi[i].fo = 0L; |
553 |
|
biglob(hp)->nrd += nrays - hp->bi[i].nrd; |
554 |
|
hp->bi[i].nrd = nrays; |
555 |
< |
hp->bi[i].fo = nfo; |
522 |
< |
markdirty(hp); /* section directory now out of date */ |
555 |
> |
markdirty(hp); /* section directory now out of date */ |
556 |
|
return(1); |
557 |
|
} |
558 |
|
|
648 |
|
{ |
649 |
|
register int i, j; |
650 |
|
/* insert each beam from hp */ |
651 |
< |
for (i = nbeams(hp); i > 0; i--) { |
651 |
> |
for (i = 1; i <= nbeams(hp); i++) { |
652 |
|
if (hp->bl[i] == NULL) /* check if loaded */ |
653 |
|
continue; |
654 |
|
#if 0 |