ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/hd/holofile.c
Revision: 3.32
Committed: Thu Jan 7 22:04:49 1999 UTC (25 years, 3 months ago) by gwlarson
Content type: text/plain
Branch: MAIN
Changes since 3.31: +72 -48 lines
Log Message:
created hdfragflags variable for controlling fragment deallocation
added "chunky" sorting mode to rholo to decrease file fragmentation problems

File Contents

# User Rev Content
1 gwlarson 3.32 /* Copyright (c) 1999 Silicon Graphics, Inc. */
2 gregl 3.1
3     #ifndef lint
4     static char SCCSid[] = "$SunId$ SGI";
5     #endif
6    
7     /*
8     * Routines for managing holodeck files
9     *
10     * 9/30/97 GWLarson
11     */
12    
13     #include "holo.h"
14    
15     #ifndef CACHESIZE
16     #define CACHESIZE 16 /* default cache size (Mbytes, 0==inf) */
17     #endif
18     #ifndef FREEBEAMS
19 gwlarson 3.25 #define FREEBEAMS 1500 /* maximum beams to free at a time */
20 gregl 3.1 #endif
21     #ifndef PCTFREE
22 gregl 3.21 #define PCTFREE 15 /* maximum fraction to free (%) */
23 gregl 3.1 #endif
24 gwlarson 3.31 #ifndef MAXFRAGB
25     #define MAXFRAGB 16 /* fragment blocks/file to track (0==inf) */
26 gregl 3.15 #endif
27 gwlarson 3.32 #ifndef FF_DEFAULT
28     /* when to free a beam fragment */
29     #define FF_DEFAULT (FF_ALLOC|FF_WRITE|FF_KILL)
30     #endif
31 gwlarson 3.29 #ifndef MINDIRSEL
32     /* minimum directory seek length */
33     #define MINDIRSEL (4*BUFSIZ/sizeof(BEAMI))
34     #endif
35 gregl 3.1
36 gregl 3.6 #ifndef BSD
37     #define write writebuf /* safe i/o routines */
38     #define read readbuf
39     #endif
40 gregl 3.4
41 gwlarson 3.31 #define FRAGBLK 512 /* number of fragments to allocate at a time */
42 gregl 3.4
43 gwlarson 3.32 int hdfragflags = FF_DEFAULT; /* tells when to free fragments */
44 gregl 3.14 unsigned hdcachesize = CACHESIZE*1024*1024; /* target cache size */
45 gwlarson 3.32 unsigned long hdclock; /* clock value */
46 gregl 3.1
47     HOLO *hdlist[HDMAX+1]; /* holodeck pointers (NULL term.) */
48    
49 gregl 3.16 static struct fraglist {
50 gregl 3.1 short nlinks; /* number of holodeck sections using us */
51 gregl 3.13 short writerr; /* write error encountered */
52     int nfrags; /* number of known fragments */
53 gregl 3.4 BEAMI *fi; /* fragments, descending file position */
54 gregl 3.1 long flen; /* last known file length */
55 gregl 3.16 } *hdfragl; /* fragment lists, indexed by file descriptor */
56 gregl 3.1
57 gregl 3.16 static int nhdfragls; /* size of hdfragl array */
58 gregl 3.1
59 gregl 3.4
60 gwlarson 3.26 char *
61     hdrealloc(ptr, siz, rout) /* (re)allocate memory, retry then error */
62     char *ptr;
63     unsigned siz;
64     char *rout;
65     {
66     register char *newp;
67     /* call malloc/realloc */
68     if (ptr == NULL) newp = (char *)malloc(siz);
69     else newp = (char *)realloc(ptr, siz);
70     /* check success */
71     if (newp == NULL && rout != NULL) {
72     hdfreecache(25, NULL); /* free some memory */
73     errno = 0; /* retry */
74     newp = hdrealloc(ptr, siz, NULL);
75     if (newp == NULL) { /* give up and report error */
76     sprintf(errmsg, "out of memory in %s", rout);
77     error(SYSTEM, errmsg);
78     }
79     }
80     return(newp);
81     }
82    
83    
84 gregl 3.1 hdattach(fd) /* start tracking file fragments for some section */
85     register int fd;
86     {
87 gregl 3.16 if (fd >= nhdfragls) {
88 gwlarson 3.26 hdfragl = (struct fraglist *)hdrealloc((char *)hdfragl,
89     (fd+1)*sizeof(struct fraglist), "hdattach");
90 gregl 3.16 bzero((char *)(hdfragl+nhdfragls),
91     (fd+1-nhdfragls)*sizeof(struct fraglist));
92     nhdfragls = fd+1;
93 gregl 3.1 }
94 gregl 3.16 hdfragl[fd].nlinks++;
95     hdfragl[fd].flen = lseek(fd, 0L, 2); /* get file length */
96 gregl 3.1 }
97    
98    
99     /* Do we need a routine to locate file fragments given known occupants? */
100    
101    
102     hdrelease(fd) /* stop tracking file fragments for some section */
103     register int fd;
104     {
105 gregl 3.16 if (fd < 0 | fd >= nhdfragls || !hdfragl[fd].nlinks)
106 gregl 3.1 return;
107 gregl 3.16 if (!--hdfragl[fd].nlinks && hdfragl[fd].nfrags) {
108     free((char *)hdfragl[fd].fi);
109     hdfragl[fd].fi = NULL;
110     hdfragl[fd].nfrags = 0;
111 gregl 3.1 }
112     }
113    
114    
115     HOLO *
116     hdinit(fd, hproto) /* initialize a holodeck section in a file */
117     int fd; /* corresponding file descriptor */
118     HDGRID *hproto; /* holodeck section grid */
119     {
120 gwlarson 3.22 long rtrunc;
121 gregl 3.1 long fpos;
122     register HOLO *hp;
123     register int n;
124     /* prepare for system errors */
125     errno = 0;
126     if ((fpos = lseek(fd, 0L, 1)) < 0)
127     error(SYSTEM, "cannot determine holodeck file position");
128     if (hproto == NULL) { /* assume we're loading it */
129     HDGRID hpr;
130     /* load header */
131     if (read(fd, (char *)&hpr, sizeof(HDGRID)) != sizeof(HDGRID))
132     error(SYSTEM, "cannot load holodeck header");
133     /* allocate grid */
134     if ((hp = hdalloc(&hpr)) == NULL)
135     goto memerr;
136     /* load beam directory */
137     n = nbeams(hp)*sizeof(BEAMI);
138     if (read(fd, (char *)(hp->bi+1), n) != n)
139     error(SYSTEM, "failure loading holodeck directory");
140 gregl 3.6 /* check that it's clean */
141 gwlarson 3.28 for (n = nbeams(hp); n > 0; n--)
142     if (hp->bi[n].fo < 0) {
143     hp->bi[n].fo = 0;
144     error(WARNING, "dirty holodeck section");
145     break;
146     }
147 gregl 3.1 } else { /* assume we're creating it */
148     if ((hp = hdalloc(hproto)) == NULL)
149     goto memerr;
150     /* write header and skeleton */
151     n = nbeams(hp)*sizeof(BEAMI);
152     if (write(fd, (char *)hproto, sizeof(HDGRID)) !=
153     sizeof(HDGRID) ||
154     write(fd, (char *)(hp->bi+1), n) != n)
155     error(SYSTEM, "cannot write header to holodeck file");
156     }
157     hp->fd = fd;
158     hp->dirty = 0;
159     biglob(hp)->fo = fpos + sizeof(HDGRID);
160 gregl 3.13 /* start tracking fragments */
161     hdattach(fd);
162     /* check rays on disk */
163     fpos = hdfilen(fd);
164 gwlarson 3.22 biglob(hp)->nrd = rtrunc = 0;
165 gregl 3.13 for (n = hproto == NULL ? nbeams(hp) : 0; n > 0; n--)
166     if (hp->bi[n].nrd)
167 gwlarson 3.27 if (hp->bi[n].fo+hp->bi[n].nrd*sizeof(RAYVAL) > fpos) {
168 gwlarson 3.22 rtrunc += hp->bi[n].nrd;
169     hp->bi[n].nrd = 0;
170     } else
171 gregl 3.13 biglob(hp)->nrd += hp->bi[n].nrd;
172 gwlarson 3.22 if (rtrunc) {
173     sprintf(errmsg, "truncated section, %ld rays lost (%.1f%%)",
174     rtrunc, 100.*rtrunc/(rtrunc+biglob(hp)->nrd));
175     error(WARNING, errmsg);
176     }
177 gregl 3.1 /* add to holodeck list */
178     for (n = 0; n < HDMAX; n++)
179     if (hdlist[n] == NULL) {
180     hdlist[n] = hp;
181     break;
182     }
183     /* all done */
184     return(hp);
185     memerr:
186     error(SYSTEM, "cannot allocate holodeck grid");
187     }
188    
189    
190 gwlarson 3.28 markdirty(hp, i) /* mark holodeck directory position dirty */
191     register HOLO *hp;
192     int i;
193     {
194     static BEAMI smudge = {0, -1};
195     int mindist, minpos;
196     register int j;
197    
198     if (!hp->dirty++) { /* write smudge first time */
199     if (lseek(hp->fd, biglob(hp)->fo+(i-1)*sizeof(BEAMI), 0) < 0
200     || write(hp->fd, (char *)&smudge,
201     sizeof(BEAMI)) != sizeof(BEAMI))
202     error(SYSTEM, "seek/write error in markdirty");
203     hp->dirseg[0].s = i;
204     hp->dirseg[0].n = 1;
205     return;
206     }
207     /* insert into segment list */
208     for (j = hp->dirty; j--; ) {
209     if (!j || hp->dirseg[j-1].s < i) {
210     hp->dirseg[j].s = i;
211     hp->dirseg[j].n = 1;
212     break;
213     }
214     copystruct(hp->dirseg+j, hp->dirseg+(j-1));
215     }
216 gwlarson 3.29 do { /* check neighbors */
217     mindist = nbeams(hp); /* find closest */
218     for (j = hp->dirty; --j; )
219     if (hp->dirseg[j].s -
220     (hp->dirseg[j-1].s + hp->dirseg[j-1].n)
221     < mindist) {
222     minpos = j;
223     mindist = hp->dirseg[j].s -
224 gwlarson 3.28 (hp->dirseg[j-1].s + hp->dirseg[j-1].n);
225 gwlarson 3.29 }
226     /* good enough? */
227     if (hp->dirty <= MAXDIRSE && mindist > MINDIRSEL)
228     break;
229 gwlarson 3.28 j = minpos - 1; /* coalesce neighbors */
230     if (hp->dirseg[j].s + hp->dirseg[j].n <
231 gwlarson 3.29 hp->dirseg[minpos].s + hp->dirseg[minpos].n)
232 gwlarson 3.28 hp->dirseg[j].n = hp->dirseg[minpos].s +
233     hp->dirseg[minpos].n - hp->dirseg[j].s;
234 gwlarson 3.29 hp->dirty--;
235     while (++j < hp->dirty) /* close the gap */
236 gwlarson 3.28 copystruct(hp->dirseg+j, hp->dirseg+(j+1));
237 gwlarson 3.29 } while (mindist <= MINDIRSEL);
238 gwlarson 3.28 }
239    
240    
241 gregl 3.1 int
242 gregl 3.12 hdsync(hp, all) /* update beams and directory on disk */
243 gregl 3.1 register HOLO *hp;
244 gregl 3.12 int all;
245 gregl 3.1 {
246     register int j, n;
247    
248 gregl 3.12 if (hp == NULL) { /* do all holodecks */
249 gregl 3.1 n = 0;
250     for (j = 0; hdlist[j] != NULL; j++)
251 gregl 3.12 n += hdsync(hdlist[j], all);
252 gregl 3.1 return(n);
253     }
254 gregl 3.12 /* sync the beams */
255 gregl 3.15 for (j = (all ? nbeams(hp) : 0); j > 0; j--)
256 gregl 3.12 if (hp->bl[j] != NULL)
257     hdsyncbeam(hp, j);
258 gregl 3.13 if (!hp->dirty) /* directory clean? */
259 gregl 3.1 return(0);
260 gwlarson 3.28 errno = 0; /* write dirty segments */
261     for (j = 0; j < hp->dirty; j++) {
262     if (lseek(hp->fd, biglob(hp)->fo +
263     (hp->dirseg[j].s-1)*sizeof(BEAMI), 0) < 0)
264     error(SYSTEM, "cannot seek on holodeck file");
265     n = hp->dirseg[j].n * sizeof(BEAMI);
266     if (write(hp->fd, (char *)(hp->bi+hp->dirseg[j].s), n) != n)
267     error(SYSTEM, "cannot update section directory");
268     }
269     hp->dirty = 0; /* all clean */
270 gregl 3.1 return(1);
271     }
272    
273    
274 gregl 3.14 unsigned
275 gregl 3.1 hdmemuse(all) /* return memory usage (in bytes) */
276     int all; /* include overhead (painful) */
277     {
278     long total = 0;
279     register int i, j;
280    
281     for (j = 0; hdlist[j] != NULL; j++) {
282     total += blglob(hdlist[j])->nrm * sizeof(RAYVAL);
283     if (all) {
284     total += sizeof(HOLO) + sizeof(BEAM *) +
285     nbeams(hdlist[j]) *
286     (sizeof(BEAM *)+sizeof(BEAMI));
287     for (i = nbeams(hdlist[j]); i > 0; i--)
288     if (hdlist[j]->bl[i] != NULL)
289     total += sizeof(BEAM);
290     }
291     }
292     if (all)
293 gregl 3.16 for (j = 0; j < nhdfragls; j++) {
294     total += sizeof(struct fraglist);
295     if (hdfragl[j].nfrags)
296 gregl 3.4 total += FRAGBLK*sizeof(BEAMI) *
297 gregl 3.16 ((hdfragl[j].nfrags-1)/FRAGBLK + 1) ;
298 gregl 3.4 }
299 gregl 3.1 return(total);
300 gregl 3.8 }
301    
302    
303     long
304     hdfilen(fd) /* return file length for fd */
305     int fd;
306     {
307     long fpos, flen;
308    
309     if (fd < 0)
310     return(-1);
311 gregl 3.16 if (fd >= nhdfragls || !hdfragl[fd].nlinks) {
312 gregl 3.8 if ((fpos = lseek(fd, 0L, 1)) < 0)
313     return(-1);
314     flen = lseek(fd, 0L, 2);
315     lseek(fd, fpos, 0);
316     return(flen);
317     }
318 gregl 3.16 return(hdfragl[fd].flen);
319 gregl 3.1 }
320    
321    
322     long
323     hdfiluse(fd, all) /* compute file usage (in bytes) */
324     int fd; /* open file descriptor to check */
325     int all; /* include overhead and unflushed data */
326     {
327     long total = 0;
328     register int i, j;
329    
330     for (j = 0; hdlist[j] != NULL; j++) {
331     if (hdlist[j]->fd != fd)
332     continue;
333     total += biglob(hdlist[j])->nrd * sizeof(RAYVAL);
334     if (all) {
335     for (i = nbeams(hdlist[j]); i > 0; i--)
336     if (hdlist[j]->bl[i] != NULL)
337     total += sizeof(RAYVAL) *
338     (hdlist[j]->bl[i]->nrm -
339     hdlist[j]->bi[i].nrd);
340     total += sizeof(HDGRID) +
341     nbeams(hdlist[j])*sizeof(BEAMI);
342     }
343     }
344     return(total); /* does not include fragments */
345     }
346    
347    
348     RAYVAL *
349     hdnewrays(hp, i, nr) /* allocate space for add'l rays and return pointer */
350     register HOLO *hp;
351     register int i;
352     int nr; /* number of new rays desired */
353     {
354     RAYVAL *p;
355     int n;
356    
357 gwlarson 3.32 if (nr <= 0) return(NULL);
358     CHECK(i < 1 | i > nbeams(hp),
359     CONSISTENCY, "bad beam index given to hdnewrays");
360 gregl 3.1 if (hp->bl[i] != NULL)
361     hp->bl[i]->tick = hdclock; /* preempt swap */
362     if (hdcachesize > 0 && hdmemuse(0) >= hdcachesize)
363     hdfreecache(PCTFREE, NULL); /* free some space */
364     if (hp->bl[i] == NULL) { /* allocate (and load) */
365     n = hp->bi[i].nrd + nr;
366 gwlarson 3.26 hp->bl[i] = (BEAM *)hdrealloc(NULL, hdbsiz(n), "hdnewrays");
367 gregl 3.1 blglob(hp)->nrm += n;
368 gwlarson 3.32 if ((n = hp->bl[i]->nrm = hp->bi[i].nrd)) {
369 gwlarson 3.26 errno = 0;
370 gregl 3.1 if (lseek(hp->fd, hp->bi[i].fo, 0) < 0)
371     error(SYSTEM, "seek error on holodeck file");
372     n *= sizeof(RAYVAL);
373     if (read(hp->fd, (char *)hdbray(hp->bl[i]), n) != n)
374     error(SYSTEM,
375     "error reading beam from holodeck file");
376     }
377     } else { /* just grow in memory */
378 gwlarson 3.26 hp->bl[i] = (BEAM *)hdrealloc((char *)hp->bl[i],
379     hdbsiz(hp->bl[i]->nrm + nr), "hdnewrays");
380 gregl 3.1 blglob(hp)->nrm += nr;
381     }
382 gwlarson 3.32 if (hdfragflags&FF_ALLOC && hp->bi[i].nrd)
383     hdfreefrag(hp, i); /* relinquish old fragment */
384 gregl 3.1 p = hdbray(hp->bl[i]) + hp->bl[i]->nrm;
385     hp->bl[i]->nrm += nr; /* update in-core structure */
386     bzero((char *)p, nr*sizeof(RAYVAL));
387 gwlarson 3.25 blglob(hp)->tick = hp->bl[i]->tick = hdclock++; /* update LRU clock */
388 gregl 3.1 return(p); /* point to new rays */
389     }
390    
391    
392     BEAM *
393     hdgetbeam(hp, i) /* get beam (from file if necessary) */
394     register HOLO *hp;
395     register int i;
396     {
397     register int n;
398    
399 gwlarson 3.32 CHECK(i < 1 | i > nbeams(hp),
400     CONSISTENCY, "bad beam index given to hdgetbeam");
401 gregl 3.1 if (hp->bl[i] == NULL) { /* load from disk */
402     if (!(n = hp->bi[i].nrd))
403     return(NULL);
404     if (hdcachesize > 0 && hdmemuse(0) >= hdcachesize)
405     hdfreecache(PCTFREE, NULL); /* get free space */
406 gwlarson 3.26 hp->bl[i] = (BEAM *)hdrealloc(NULL, hdbsiz(n), "hdgetbeam");
407     blglob(hp)->nrm += hp->bl[i]->nrm = n;
408 gregl 3.1 errno = 0;
409     if (lseek(hp->fd, hp->bi[i].fo, 0) < 0)
410     error(SYSTEM, "seek error on holodeck file");
411     n *= sizeof(RAYVAL);
412     if (read(hp->fd, (char *)hdbray(hp->bl[i]), n) != n)
413     error(SYSTEM, "error reading beam from holodeck file");
414 gwlarson 3.32 if (hdfragflags&FF_READ)
415     hdfreefrag(hp, i); /* relinquish old frag. */
416 gregl 3.1 }
417 gwlarson 3.25 blglob(hp)->tick = hp->bl[i]->tick = hdclock++; /* update LRU clock */
418 gregl 3.1 return(hp->bl[i]);
419     }
420    
421    
422     int
423 gregl 3.17 hdfilord(hb1, hb2) /* order beams for quick loading */
424 gregl 3.14 register HDBEAMI *hb1, *hb2;
425     {
426 gregl 3.17 register long c;
427     /* residents go first */
428     if (hb2->h->bl[hb2->b] != NULL)
429     return(hb1->h->bl[hb1->b] == NULL);
430     if (hb1->h->bl[hb1->b] != NULL)
431     return(-1);
432     /* otherwise sort by file descriptor */
433 gregl 3.14 if ((c = hb1->h->fd - hb2->h->fd))
434     return(c);
435     /* then by position in file */
436 gregl 3.17 c = hb1->h->bi[hb1->b].fo - hb2->h->bi[hb2->b].fo;
437     return(c > 0 ? 1 : c < 0 ? -1 : 0);
438 gregl 3.14 }
439    
440    
441     hdloadbeams(hb, n, bf) /* load a list of beams in optimal order */
442     register HDBEAMI *hb; /* list gets sorted by hdfilord() */
443     int n; /* list length */
444     int (*bf)(); /* callback function (optional) */
445     {
446     unsigned origcachesize, memuse;
447 gwlarson 3.23 int bytesloaded, needbytes, bytes2free;
448 gregl 3.14 register BEAM *bp;
449     register int i;
450     /* precheck consistency */
451 gwlarson 3.25 if (n <= 0) return;
452 gregl 3.14 for (i = n; i--; )
453 gwlarson 3.32 if (hb[i].h==NULL || hb[i].b<1 | hb[i].b>nbeams(hb[i].h))
454 gregl 3.14 error(CONSISTENCY, "bad beam in hdloadbeams");
455     /* sort list for optimal access */
456     qsort((char *)hb, n, sizeof(HDBEAMI), hdfilord);
457 gregl 3.17 bytesloaded = 0; /* run through loaded beams */
458     for ( ; n && (bp = hb->h->bl[hb->b]) != NULL; n--, hb++) {
459 gwlarson 3.23 bp->tick = hdclock; /* preempt swap */
460 gregl 3.17 bytesloaded += bp->nrm;
461     if (bf != NULL)
462 gwlarson 3.23 (*bf)(bp, hb);
463 gregl 3.17 }
464     bytesloaded *= sizeof(RAYVAL);
465 gregl 3.15 if ((origcachesize = hdcachesize) > 0) {
466 gregl 3.17 needbytes = 0; /* figure out memory needs */
467 gregl 3.15 for (i = n; i--; )
468 gregl 3.17 needbytes += hb[i].h->bi[hb[i].b].nrd;
469 gregl 3.15 needbytes *= sizeof(RAYVAL);
470     do { /* free enough memory */
471     memuse = hdmemuse(0);
472 gregl 3.17 bytes2free = needbytes - (int)(hdcachesize-memuse);
473     if (bytes2free > (int)(memuse - bytesloaded))
474 gregl 3.15 bytes2free = memuse - bytesloaded;
475     } while (bytes2free > 0 &&
476     hdfreecache(100*bytes2free/memuse, NULL) < 0);
477 gregl 3.17 hdcachesize = 0; /* load beams w/o swap */
478 gregl 3.15 }
479 gregl 3.14 for (i = 0; i < n; i++)
480     if ((bp = hdgetbeam(hb[i].h, hb[i].b)) != NULL && bf != NULL)
481 gwlarson 3.23 (*bf)(bp, hb+i);
482 gregl 3.14 hdcachesize = origcachesize; /* resume dynamic swapping */
483     }
484    
485    
486 gwlarson 3.32 hdfreefrag(hp, i) /* free a file fragment */
487     HOLO *hp;
488     int i;
489 gregl 3.19 {
490 gwlarson 3.32 register BEAMI *bi = &hp->bi[i];
491 gregl 3.19 register struct fraglist *f;
492     register int j, k;
493    
494 gwlarson 3.32 if (bi->nrd <= 0)
495 gregl 3.19 return;
496 gwlarson 3.32 DCHECK(hp->fd < 0 | hp->fd >= nhdfragls || !hdfragl[hp->fd].nlinks,
497     CONSISTENCY, "bad file descriptor in hdfreefrag");
498     f = &hdfragl[hp->fd];
499 gregl 3.19 if (f->nfrags % FRAGBLK == 0) { /* delete empty remnants */
500     for (j = k = 0; k < f->nfrags; j++, k++) {
501     while (f->fi[k].nrd == 0)
502     if (++k >= f->nfrags)
503     goto endloop;
504     if (k > j)
505     copystruct(f->fi+j, f->fi+k);
506     }
507     endloop:
508     f->nfrags = j;
509     }
510     j = f->nfrags++; /* allocate a slot in free list */
511 gwlarson 3.31 #if MAXFRAGB
512     if (j >= MAXFRAGB*FRAGBLK) {
513     f->nfrags = j--; /* stop list growth */
514     if (bi->nrd <= f->fi[j].nrd)
515     return; /* new one no better than discard */
516     }
517 gregl 3.19 #endif
518 gwlarson 3.32 if (j % FRAGBLK == 0) { /* more (or less) free list space */
519 gwlarson 3.26 register BEAMI *newp;
520 gregl 3.19 if (f->fi == NULL)
521 gwlarson 3.26 newp = (BEAMI *)malloc((j+FRAGBLK)*sizeof(BEAMI));
522 gregl 3.19 else
523 gwlarson 3.26 newp = (BEAMI *)realloc((char *)f->fi,
524 gregl 3.19 (j+FRAGBLK)*sizeof(BEAMI));
525 gwlarson 3.26 if (newp == NULL) {
526     f->nfrags--; /* graceful failure */
527     return;
528     }
529     f->fi = newp;
530 gregl 3.19 }
531     for ( ; ; j--) { /* insert in descending list */
532     if (!j || bi->fo < f->fi[j-1].fo) {
533     f->fi[j].fo = bi->fo;
534     f->fi[j].nrd = bi->nrd;
535     break;
536     }
537     copystruct(f->fi+j, f->fi+(j-1));
538     }
539     /* coalesce adjacent fragments */
540     /* successors never empty */
541     if (j && f->fi[j-1].fo == f->fi[j].fo + f->fi[j].nrd*sizeof(RAYVAL)) {
542     f->fi[j].nrd += f->fi[j-1].nrd;
543     f->fi[j-1].nrd = 0;
544     }
545     for (k = j+1; k < f->nfrags; k++) /* get non-empty predecessor */
546     if (f->fi[k].nrd) {
547     if (f->fi[j].fo == f->fi[k].fo +
548     f->fi[k].nrd*sizeof(RAYVAL)) {
549     f->fi[k].nrd += f->fi[j].nrd;
550     f->fi[j].nrd = 0;
551     }
552     break;
553     }
554 gwlarson 3.32 biglob(hp)->nrd -= bi->nrd; /* tell fragment it's free */
555     bi->nrd = 0;
556     bi->fo = 0;
557 gregl 3.19 }
558    
559    
560 gwlarson 3.32 int
561     hdfragOK(fd, listlen, listsiz) /* get fragment list status for file */
562     int fd;
563     int *listlen;
564     register int4 *listsiz;
565     {
566     register struct fraglist *f;
567     register int i;
568    
569     if (fd < 0 | fd >= nhdfragls || !(f = &hdfragl[fd])->nlinks)
570     return(0); /* listless */
571     if (listlen != NULL)
572     *listlen = f->nfrags;
573     if (listsiz != NULL)
574     for (i = f->nfrags, *listsiz = 0; i--; )
575     *listsiz += f->fi[i].nrd;
576     #if MAXFRAGB
577     return(f->nfrags < MAXFRAGB*FRAGBLK);
578     #else
579     return(1); /* list never fills up */
580     #endif
581     }
582    
583    
584 gregl 3.19 long
585     hdallocfrag(fd, nrays) /* allocate a file fragment */
586     int fd;
587     unsigned int4 nrays;
588     {
589     register struct fraglist *f;
590     register int j, k;
591     long nfo;
592    
593     if (nrays == 0)
594     return(-1L);
595 gwlarson 3.32 DCHECK(fd < 0 | fd >= nhdfragls || !hdfragl[fd].nlinks,
596     CONSISTENCY, "bad file descriptor in hdallocfrag");
597 gregl 3.19 f = &hdfragl[fd];
598     k = -1; /* find closest-sized fragment */
599     for (j = f->nfrags; j-- > 0; )
600     if (f->fi[j].nrd >= nrays &&
601     (k < 0 || f->fi[j].nrd < f->fi[k].nrd))
602     if (f->fi[k=j].nrd == nrays)
603     break;
604     if (k < 0) { /* no fragment -- extend file */
605     nfo = f->flen;
606     f->flen += nrays*sizeof(RAYVAL);
607     } else { /* else use fragment */
608     nfo = f->fi[k].fo;
609     f->fi[k].fo += nrays*sizeof(RAYVAL);
610     f->fi[k].nrd -= nrays;
611     }
612     return(nfo);
613     }
614    
615    
616 gregl 3.14 int
617 gregl 3.12 hdsyncbeam(hp, i) /* sync beam in memory with beam on disk */
618 gregl 3.1 register HOLO *hp;
619     register int i;
620     {
621 gregl 3.19 unsigned int4 nrays;
622     unsigned int n;
623 gregl 3.11 long nfo;
624 gregl 3.13 /* check file status */
625 gregl 3.16 if (hdfragl[hp->fd].writerr)
626 gregl 3.13 return(-1);
627 gwlarson 3.32 DCHECK(i < 1 | i > nbeams(hp),
628     CONSISTENCY, "bad beam index in hdsyncbeam");
629 gregl 3.11 /* is current fragment OK? */
630 gregl 3.12 if (hp->bl[i] == NULL || (nrays = hp->bl[i]->nrm) == hp->bi[i].nrd)
631 gregl 3.1 return(0);
632 gwlarson 3.32 if (hdfragflags&FF_WRITE && hp->bi[i].nrd)
633     hdfreefrag(hp, i); /* relinquish old fragment */
634 gregl 3.19 if (nrays) { /* get and write new fragment */
635     nfo = hdallocfrag(hp->fd, nrays);
636 gregl 3.11 errno = 0;
637     if (lseek(hp->fd, nfo, 0) < 0)
638     error(SYSTEM, "cannot seek on holodeck file");
639     n = hp->bl[i]->nrm * sizeof(RAYVAL);
640     if (write(hp->fd, (char *)hdbray(hp->bl[i]), n) != n) {
641 gregl 3.16 hdfragl[hp->fd].writerr++;
642 gregl 3.18 hdsync(NULL, 0); /* sync directories */
643 gregl 3.12 error(SYSTEM, "write error in hdsyncbeam");
644 gregl 3.11 }
645 gregl 3.19 hp->bi[i].fo = nfo;
646     } else
647     hp->bi[i].fo = 0L;
648 gwlarson 3.32 biglob(hp)->nrd += hp->bi[i].nrd = nrays;
649 gwlarson 3.28 markdirty(hp, i); /* section directory now out of date */
650 gregl 3.1 return(1);
651     }
652    
653    
654     int
655     hdfreebeam(hp, i) /* free beam, writing if dirty */
656     register HOLO *hp;
657     register int i;
658     {
659 gregl 3.11 int nchanged;
660 gregl 3.1
661     if (hp == NULL) { /* clear all holodecks */
662     nchanged = 0;
663     for (i = 0; hdlist[i] != NULL; i++)
664     nchanged += hdfreebeam(hdlist[i], 0);
665     return(nchanged);
666     }
667 gregl 3.16 if (hdfragl[hp->fd].writerr) /* check for file error */
668 gregl 3.13 return(0);
669 gregl 3.1 if (i == 0) { /* clear entire holodeck */
670     nchanged = 0;
671 gregl 3.10 for (i = nbeams(hp); i > 0; i--)
672     if (hp->bl[i] != NULL)
673     nchanged += hdfreebeam(hp, i);
674 gregl 3.1 return(nchanged);
675     }
676 gwlarson 3.32 DCHECK(i < 1 | i > nbeams(hp),
677     CONSISTENCY, "bad beam index to hdfreebeam");
678 gregl 3.1 if (hp->bl[i] == NULL)
679     return(0);
680     /* check for additions */
681     nchanged = hp->bl[i]->nrm - hp->bi[i].nrd;
682 gregl 3.11 if (nchanged)
683 gregl 3.12 hdsyncbeam(hp, i); /* write new fragment */
684 gregl 3.1 blglob(hp)->nrm -= hp->bl[i]->nrm;
685     free((char *)hp->bl[i]); /* free memory */
686     hp->bl[i] = NULL;
687     return(nchanged);
688     }
689    
690    
691 gregl 3.10 int
692     hdkillbeam(hp, i) /* delete beam from holodeck */
693     register HOLO *hp;
694     register int i;
695     {
696 gregl 3.11 int nchanged;
697 gregl 3.10
698     if (hp == NULL) { /* clobber all holodecks */
699     nchanged = 0;
700     for (i = 0; hdlist[i] != NULL; i++)
701     nchanged += hdkillbeam(hdlist[i], 0);
702     return(nchanged);
703     }
704     if (i == 0) { /* clobber entire holodeck */
705     nchanged = 0;
706     for (i = nbeams(hp); i > 0; i--)
707     if (hp->bi[i].nrd > 0 || hp->bl[i] != NULL)
708     nchanged += hdkillbeam(hp, i);
709 gwlarson 3.32 DCHECK(biglob(hp)->nrd != 0 | blglob(hp)->nrm != 0,
710     CONSISTENCY, "bad beam count in hdkillbeam");
711 gregl 3.10 return(nchanged);
712     }
713 gwlarson 3.32 DCHECK(i < 1 | i > nbeams(hp),
714     CONSISTENCY, "bad beam index to hdkillbeam");
715 gregl 3.10 if (hp->bl[i] != NULL) { /* free memory */
716     blglob(hp)->nrm -= nchanged = hp->bl[i]->nrm;
717     free((char *)hp->bl[i]);
718     } else
719     nchanged = hp->bi[i].nrd;
720 gwlarson 3.32 if (hp->bi[i].nrd) {
721     if (hdfragflags&FF_KILL)
722     hdfreefrag(hp, i);
723     hp->bi[i].nrd = 0; /* make sure it's gone */
724     hp->bi[i].fo = 0L;
725 gregl 3.10 }
726     hp->bl[i] = NULL;
727     return(nchanged);
728     }
729    
730    
731 gregl 3.14 int
732     hdlrulist(hb, nents, n, hp) /* add beams from holodeck to LRU list */
733     register HDBEAMI *hb; /* beam list */
734     int nents; /* current list length */
735     int n; /* maximum list length */
736 gregl 3.1 register HOLO *hp; /* section we're adding from */
737     {
738     register int i, j;
739     /* insert each beam from hp */
740 gregl 3.21 for (i = 1; i <= nbeams(hp); i++) {
741 gregl 3.1 if (hp->bl[i] == NULL) /* check if loaded */
742     continue;
743 gregl 3.14 #if 0
744     if (hp->bl[i]->tick == hdclock) /* preempt swap? */
745     continue;
746     #endif
747     if ((j = ++nents) >= n) /* grow list if we can */
748 gregl 3.1 nents--;
749     for ( ; ; ) { /* bubble into place */
750     if (!--j || hp->bl[i]->tick >=
751 gregl 3.14 hb[j-1].h->bl[hb[j-1].b]->tick) {
752     hb[j].h = hp;
753     hb[j].b = i;
754 gregl 3.1 break;
755     }
756 gregl 3.14 copystruct(hb+j, hb+(j-1));
757 gregl 3.1 }
758     }
759 gregl 3.14 return(nents); /* return new list length */
760 gregl 3.1 }
761    
762    
763 gregl 3.14 int
764 gregl 3.1 hdfreecache(pct, honly) /* free up cache space, writing changes */
765     int pct; /* maximum percentage to free */
766     register HOLO *honly; /* NULL means check all */
767     {
768 gregl 3.14 HDBEAMI hb[FREEBEAMS];
769 gregl 3.1 int freetarget;
770 gregl 3.14 int n;
771 gregl 3.1 register int i;
772 gwlarson 3.25 #ifdef DEBUG
773     unsigned membefore;
774    
775     membefore = hdmemuse(0);
776     #endif
777 gregl 3.1 /* compute free target */
778     freetarget = (honly != NULL) ? blglob(honly)->nrm :
779     hdmemuse(0)/sizeof(RAYVAL) ;
780     freetarget = freetarget*pct/100;
781 gregl 3.14 if (freetarget <= 0)
782     return(0);
783 gregl 3.1 /* find least recently used */
784 gregl 3.14 n = 0;
785 gregl 3.1 if (honly != NULL)
786 gregl 3.14 n = hdlrulist(hb, n, FREEBEAMS, honly);
787 gregl 3.1 else
788     for (i = 0; hdlist[i] != NULL; i++)
789 gregl 3.14 n = hdlrulist(hb, n, FREEBEAMS, hdlist[i]);
790 gregl 3.1 /* free LRU beams */
791 gregl 3.14 for (i = 0; i < n; i++) {
792     hdfreebeam(hb[i].h, hb[i].b);
793     if ((freetarget -= hb[i].h->bi[hb[i].b].nrd) <= 0)
794 gregl 3.1 break;
795     }
796 gregl 3.12 hdsync(honly, 0); /* synchronize directories as necessary */
797 gwlarson 3.25 #ifdef DEBUG
798     sprintf(errmsg,
799     "%dK before, %dK after hdfreecache (%dK total), %d rays short\n",
800     membefore>>10, hdmemuse(0)>>10, hdmemuse(1)>>10, freetarget);
801     wputs(errmsg);
802     #endif
803 gregl 3.14 return(-freetarget); /* return how far past goal we went */
804 gregl 3.1 }
805    
806    
807     hddone(hp) /* clean up holodeck section and free */
808     register HOLO *hp; /* NULL means clean up all */
809     {
810     register int i;
811    
812     if (hp == NULL) { /* NULL means clean up everything */
813     while (hdlist[0] != NULL)
814     hddone(hdlist[0]);
815 gwlarson 3.24 free((char *)hdfragl);
816     hdfragl = NULL; nhdfragls = 0;
817 gregl 3.1 return;
818     }
819     /* flush all data and free memory */
820 gwlarson 3.27 hdfreebeam(hp, 0);
821     hdsync(hp, 0);
822 gregl 3.1 /* release fragment resources */
823     hdrelease(hp->fd);
824     /* remove hp from active list */
825     for (i = 0; hdlist[i] != NULL; i++)
826     if (hdlist[i] == hp) {
827     while ((hdlist[i] = hdlist[i+1]) != NULL)
828     i++;
829     break;
830     }
831     free((char *)hp->bl); /* free beam list */
832     free((char *)hp); /* free holodeck struct */
833     }