--- ray/src/hd/holofile.c 1997/12/31 11:35:39 3.16 +++ ray/src/hd/holofile.c 1998/09/15 14:26:23 3.24 @@ -1,4 +1,4 @@ -/* Copyright (c) 1997 Silicon Graphics, Inc. */ +/* Copyright (c) 1998 Silicon Graphics, Inc. */ #ifndef lint static char SCCSid[] = "$SunId$ SGI"; @@ -16,10 +16,10 @@ static char SCCSid[] = "$SunId$ SGI"; #define CACHESIZE 16 /* default cache size (Mbytes, 0==inf) */ #endif #ifndef FREEBEAMS -#define FREEBEAMS 512 /* maximum beams to free at a time */ +#define FREEBEAMS 1024 /* maximum beams to free at a time */ #endif #ifndef PCTFREE -#define PCTFREE 20 /* maximum fraction to free (%) */ +#define PCTFREE 15 /* maximum fraction to free (%) */ #endif #ifndef MAXFRAG #define MAXFRAG 32767 /* maximum fragments/file to track (0==inf) */ @@ -105,6 +105,7 @@ hdinit(fd, hproto) /* initialize a holodeck section in int fd; /* corresponding file descriptor */ HDGRID *hproto; /* holodeck section grid */ { + long rtrunc; long fpos; register HOLO *hp; register int n; @@ -126,7 +127,7 @@ HDGRID *hproto; /* holodeck section grid */ error(SYSTEM, "failure loading holodeck directory"); /* check that it's clean */ if (hp->bi[nbeams(hp)].fo < 0) - error(USER, "dirty holodeck section"); + error(WARNING, "dirty holodeck section"); } else { /* assume we're creating it */ if ((hp = hdalloc(hproto)) == NULL) goto memerr; @@ -144,13 +145,19 @@ HDGRID *hproto; /* holodeck section grid */ hdattach(fd); /* check rays on disk */ fpos = hdfilen(fd); - biglob(hp)->nrd = 0; + biglob(hp)->nrd = rtrunc = 0; for (n = hproto == NULL ? nbeams(hp) : 0; n > 0; n--) if (hp->bi[n].nrd) - if (hp->bi[n].fo + hp->bi[n].nrd > fpos) - hp->bi[n].nrd = 0; /* off end */ - else + if (hp->bi[n].fo + hp->bi[n].nrd > fpos) { + rtrunc += hp->bi[n].nrd; + hp->bi[n].nrd = 0; + } else biglob(hp)->nrd += hp->bi[n].nrd; + if (rtrunc) { + sprintf(errmsg, "truncated section, %ld rays lost (%.1f%%)", + rtrunc, 100.*rtrunc/(rtrunc+biglob(hp)->nrd)); + error(WARNING, errmsg); + } /* add to holodeck list */ for (n = 0; n < HDMAX; n++) if (hdlist[n] == NULL) { @@ -348,15 +355,21 @@ register int i; int -hdfilord(hb1, hb2) /* order beams for optimal loading */ +hdfilord(hb1, hb2) /* order beams for quick loading */ register HDBEAMI *hb1, *hb2; { - register int c; - /* sort by file descriptor first */ + register long c; + /* residents go first */ + if (hb2->h->bl[hb2->b] != NULL) + return(hb1->h->bl[hb1->b] == NULL); + if (hb1->h->bl[hb1->b] != NULL) + return(-1); + /* otherwise sort by file descriptor */ if ((c = hb1->h->fd - hb2->h->fd)) return(c); /* then by position in file */ - return(hb1->h->bi[hb1->b].fo - hb2->h->bi[hb2->b].fo); + c = hb1->h->bi[hb1->b].fo - hb2->h->bi[hb2->b].fo; + return(c > 0 ? 1 : c < 0 ? -1 : 0); } @@ -366,8 +379,8 @@ int n; /* list length */ int (*bf)(); /* callback function (optional) */ { unsigned origcachesize, memuse; - register BEAM *bp; int bytesloaded, needbytes, bytes2free; + register BEAM *bp; register int i; /* precheck consistency */ for (i = n; i--; ) @@ -375,40 +388,142 @@ int (*bf)(); /* callback function (optional) */ error(CONSISTENCY, "bad beam in hdloadbeams"); /* sort list for optimal access */ qsort((char *)hb, n, sizeof(HDBEAMI), hdfilord); - bytesloaded = needbytes = 0; /* figure out memory needs */ + bytesloaded = 0; /* run through loaded beams */ + for ( ; n && (bp = hb->h->bl[hb->b]) != NULL; n--, hb++) { + bp->tick = hdclock; /* preempt swap */ + bytesloaded += bp->nrm; + if (bf != NULL) + (*bf)(bp, hb); + } + bytesloaded *= sizeof(RAYVAL); if ((origcachesize = hdcachesize) > 0) { + needbytes = 0; /* figure out memory needs */ for (i = n; i--; ) - if ((bp = hb[i].h->bl[hb[i].b]) != NULL) { - bp->tick = hdclock; /* preempt swap */ - bytesloaded += bp->nrm; - } else /* prepare to load */ - needbytes += hb[i].h->bi[hb[i].b].nrd; - bytesloaded *= sizeof(RAYVAL); + needbytes += hb[i].h->bi[hb[i].b].nrd; needbytes *= sizeof(RAYVAL); do { /* free enough memory */ memuse = hdmemuse(0); - bytes2free = needbytes - (signed)(hdcachesize-memuse); - if (bytes2free > (signed)(memuse - bytesloaded)) + bytes2free = needbytes - (int)(hdcachesize-memuse); + if (bytes2free > (int)(memuse - bytesloaded)) bytes2free = memuse - bytesloaded; } while (bytes2free > 0 && hdfreecache(100*bytes2free/memuse, NULL) < 0); + hdcachesize = 0; /* load beams w/o swap */ } - hdcachesize = 0; /* load the ordered beams w/o swap */ for (i = 0; i < n; i++) if ((bp = hdgetbeam(hb[i].h, hb[i].b)) != NULL && bf != NULL) - (*bf)(bp, hb[i].h, hb[i].b); + (*bf)(bp, hb+i); hdcachesize = origcachesize; /* resume dynamic swapping */ } +hdfreefrag(fd, bi) /* free a file fragment */ +int fd; +register BEAMI *bi; +{ + register struct fraglist *f; + register int j, k; + + if (bi->nrd == 0) + return; +#ifdef DEBUG + if (fd < 0 | fd >= nhdfragls || !hdfragl[fd].nlinks) + error(CONSISTENCY, "bad file descriptor in hdfreefrag"); +#endif + f = &hdfragl[fd]; + if (f->nfrags % FRAGBLK == 0) { /* delete empty remnants */ + for (j = k = 0; k < f->nfrags; j++, k++) { + while (f->fi[k].nrd == 0) + if (++k >= f->nfrags) + goto endloop; + if (k > j) + copystruct(f->fi+j, f->fi+k); + } + endloop: + f->nfrags = j; + } + j = f->nfrags++; /* allocate a slot in free list */ +#if MAXFRAG + if (j >= MAXFRAG-1) + f->nfrags--; +#endif + if (j % FRAGBLK == 0) { /* more free list space */ + if (f->fi == NULL) + f->fi = (BEAMI *)malloc(FRAGBLK*sizeof(BEAMI)); + else + f->fi = (BEAMI *)realloc((char *)f->fi, + (j+FRAGBLK)*sizeof(BEAMI)); + if (f->fi == NULL) + error(SYSTEM, "out of memory in hdfreefrag"); + } + for ( ; ; j--) { /* insert in descending list */ + if (!j || bi->fo < f->fi[j-1].fo) { + f->fi[j].fo = bi->fo; + f->fi[j].nrd = bi->nrd; + break; + } + copystruct(f->fi+j, f->fi+(j-1)); + } + /* coalesce adjacent fragments */ + /* successors never empty */ + if (j && f->fi[j-1].fo == f->fi[j].fo + f->fi[j].nrd*sizeof(RAYVAL)) { + f->fi[j].nrd += f->fi[j-1].nrd; + f->fi[j-1].nrd = 0; + } + for (k = j+1; k < f->nfrags; k++) /* get non-empty predecessor */ + if (f->fi[k].nrd) { + if (f->fi[j].fo == f->fi[k].fo + + f->fi[k].nrd*sizeof(RAYVAL)) { + f->fi[k].nrd += f->fi[j].nrd; + f->fi[j].nrd = 0; + } + break; + } +} + + +long +hdallocfrag(fd, nrays) /* allocate a file fragment */ +int fd; +unsigned int4 nrays; +{ + register struct fraglist *f; + register int j, k; + long nfo; + + if (nrays == 0) + return(-1L); +#ifdef DEBUG + if (fd < 0 | fd >= nhdfragls || !hdfragl[fd].nlinks) + error(CONSISTENCY, "bad file descriptor in hdallocfrag"); +#endif + f = &hdfragl[fd]; + k = -1; /* find closest-sized fragment */ + for (j = f->nfrags; j-- > 0; ) + if (f->fi[j].nrd >= nrays && + (k < 0 || f->fi[j].nrd < f->fi[k].nrd)) + if (f->fi[k=j].nrd == nrays) + break; + if (k < 0) { /* no fragment -- extend file */ + nfo = f->flen; + f->flen += nrays*sizeof(RAYVAL); + } else { /* else use fragment */ + nfo = f->fi[k].fo; + f->fi[k].fo += nrays*sizeof(RAYVAL); + f->fi[k].nrd -= nrays; + } + return(nfo); +} + + int hdsyncbeam(hp, i) /* sync beam in memory with beam on disk */ register HOLO *hp; register int i; { - unsigned int nrays; - long nfo; + unsigned int4 nrays; unsigned int n; + long nfo; /* check file status */ if (hdfragl[hp->fd].writerr) return(-1); @@ -419,98 +534,25 @@ register int i; /* is current fragment OK? */ if (hp->bl[i] == NULL || (nrays = hp->bl[i]->nrm) == hp->bi[i].nrd) return(0); - /* locate fragment */ - if (hp->fd >= nhdfragls || !hdfragl[hp->fd].nlinks) /* untracked */ - hp->bi[i].fo = lseek(hp->fd, 0L, 2); - - else if (hp->bi[i].fo + hp->bi[i].nrd*sizeof(RAYVAL) == - hdfragl[hp->fd].flen) /* EOF special case */ - hdfragl[hp->fd].flen = (nfo=hp->bi[i].fo) + nrays*sizeof(RAYVAL); - - else { /* general case */ - register struct fraglist *f = &hdfragl[hp->fd]; - register int j, k; - n = f->nfrags; /* relinquish old fragment */ - if (hp->bi[i].nrd) { - j = f->nfrags++; -#if MAXFRAG - if (j >= MAXFRAG-1) - f->nfrags--; -#endif - if (j % FRAGBLK == 0) { /* more frag. space */ - if (f->fi == NULL) - f->fi = (BEAMI *)malloc( - FRAGBLK*sizeof(BEAMI)); - else - f->fi = (BEAMI *)realloc((char *)f->fi, - (j+FRAGBLK)*sizeof(BEAMI)); - if (f->fi == NULL) - error(SYSTEM, - "out of memory in hdsyncbeam"); - } - for ( ; ; j--) { /* insert in descending list */ - if (!j || hp->bi[i].fo < f->fi[j-1].fo) { - f->fi[j].fo = hp->bi[i].fo; - f->fi[j].nrd = hp->bi[i].nrd; - break; - } - copystruct(f->fi+j, f->fi+(j-1)); - } - /* coalesce adjacent fragments */ - if (j && f->fi[j-1].fo == f->fi[j].fo + - f->fi[j].nrd*sizeof(RAYVAL)) { - f->fi[j].nrd += f->fi[j-1].nrd; - f->fi[j-1].nrd = 0; - n = j-1; - } - if (j+1 < f->nfrags && f->fi[j].fo == f->fi[j+1].fo + - f->fi[j+1].nrd*sizeof(RAYVAL)) { - f->fi[j+1].nrd += f->fi[j].nrd; - f->fi[j].nrd = 0; - if (j < n) n = j; - } - } - k = -1; /* find closest-sized fragment */ - for (j = (nrays ? f->nfrags : 0); j-- > 0; ) - if (f->fi[j].nrd >= nrays && - (k < 0 || f->fi[j].nrd < f->fi[k].nrd)) - if (f->fi[k=j].nrd == nrays) - break; - if (k < 0) { /* no fragment -- extend file */ - nfo = f->flen; - f->flen += nrays*sizeof(RAYVAL); - } else { /* else use fragment */ - nfo = f->fi[k].fo; - f->fi[k].fo += nrays*sizeof(RAYVAL); - if (!(f->fi[k].nrd -= nrays) && k < n) - n = k; - } - /* delete empty remnants */ - for (j = k = n; k < f->nfrags; j++, k++) { - while (f->fi[k].nrd == 0) - if (++k >= f->nfrags) - goto endloop; - if (k > j) - copystruct(f->fi+j, f->fi+k); - } - endloop: - f->nfrags = j; - } - if (nrays) { /* write the new fragment */ + if (hp->bi[i].nrd) /* relinquish old fragment */ + hdfreefrag(hp->fd, &hp->bi[i]); + if (nrays) { /* get and write new fragment */ + nfo = hdallocfrag(hp->fd, nrays); errno = 0; if (lseek(hp->fd, nfo, 0) < 0) error(SYSTEM, "cannot seek on holodeck file"); n = hp->bl[i]->nrm * sizeof(RAYVAL); if (write(hp->fd, (char *)hdbray(hp->bl[i]), n) != n) { hdfragl[hp->fd].writerr++; - hdsync(hp, 0); /* sync directory */ + hdsync(NULL, 0); /* sync directories */ error(SYSTEM, "write error in hdsyncbeam"); } - } + hp->bi[i].fo = nfo; + } else + hp->bi[i].fo = 0L; biglob(hp)->nrd += nrays - hp->bi[i].nrd; hp->bi[i].nrd = nrays; - hp->bi[i].fo = nfo; - markdirty(hp); /* section directory now out of date */ + markdirty(hp); /* section directory now out of date */ return(1); } @@ -606,7 +648,7 @@ register HOLO *hp; /* section we're adding from */ { register int i, j; /* insert each beam from hp */ - for (i = nbeams(hp); i > 0; i--) { + for (i = 1; i <= nbeams(hp); i++) { if (hp->bl[i] == NULL) /* check if loaded */ continue; #if 0 @@ -670,6 +712,8 @@ register HOLO *hp; /* NULL means clean up all */ if (hp == NULL) { /* NULL means clean up everything */ while (hdlist[0] != NULL) hddone(hdlist[0]); + free((char *)hdfragl); + hdfragl = NULL; nhdfragls = 0; return; } /* flush all data and free memory */