21 |
|
#ifndef PCTFREE |
22 |
|
#define PCTFREE 15 /* maximum fraction to free (%) */ |
23 |
|
#endif |
24 |
< |
#ifndef MAXFRAG |
25 |
< |
#define MAXFRAG 32767 /* maximum fragments/file to track (0==inf) */ |
24 |
> |
#ifndef MAXFRAGB |
25 |
> |
#define MAXFRAGB 16 /* fragment blocks/file to track (0==inf) */ |
26 |
|
#endif |
27 |
+ |
#ifndef MINDIRSEL |
28 |
+ |
/* minimum directory seek length */ |
29 |
+ |
#define MINDIRSEL (4*BUFSIZ/sizeof(BEAMI)) |
30 |
+ |
#endif |
31 |
|
|
32 |
|
#ifndef BSD |
33 |
|
#define write writebuf /* safe i/o routines */ |
34 |
|
#define read readbuf |
35 |
|
#endif |
36 |
|
|
37 |
< |
#define FRAGBLK 256 /* number of fragments to allocate at a time */ |
37 |
> |
#define FRAGBLK 512 /* number of fragments to allocate at a time */ |
38 |
|
|
39 |
|
unsigned hdcachesize = CACHESIZE*1024*1024; /* target cache size */ |
40 |
|
unsigned long hdclock; /* clock value */ |
52 |
|
static int nhdfragls; /* size of hdfragl array */ |
53 |
|
|
54 |
|
|
55 |
+ |
char * |
56 |
+ |
hdrealloc(ptr, siz, rout) /* (re)allocate memory, retry then error */ |
57 |
+ |
char *ptr; |
58 |
+ |
unsigned siz; |
59 |
+ |
char *rout; |
60 |
+ |
{ |
61 |
+ |
register char *newp; |
62 |
+ |
/* call malloc/realloc */ |
63 |
+ |
if (ptr == NULL) newp = (char *)malloc(siz); |
64 |
+ |
else newp = (char *)realloc(ptr, siz); |
65 |
+ |
/* check success */ |
66 |
+ |
if (newp == NULL && rout != NULL) { |
67 |
+ |
hdfreecache(25, NULL); /* free some memory */ |
68 |
+ |
errno = 0; /* retry */ |
69 |
+ |
newp = hdrealloc(ptr, siz, NULL); |
70 |
+ |
if (newp == NULL) { /* give up and report error */ |
71 |
+ |
sprintf(errmsg, "out of memory in %s", rout); |
72 |
+ |
error(SYSTEM, errmsg); |
73 |
+ |
} |
74 |
+ |
} |
75 |
+ |
return(newp); |
76 |
+ |
} |
77 |
+ |
|
78 |
+ |
|
79 |
|
hdattach(fd) /* start tracking file fragments for some section */ |
80 |
|
register int fd; |
81 |
|
{ |
82 |
|
if (fd >= nhdfragls) { |
83 |
< |
if (nhdfragls) |
84 |
< |
hdfragl = (struct fraglist *)realloc((char *)hdfragl, |
57 |
< |
(fd+1)*sizeof(struct fraglist)); |
58 |
< |
else |
59 |
< |
hdfragl = (struct fraglist *)malloc( |
60 |
< |
(fd+1)*sizeof(struct fraglist)); |
61 |
< |
if (hdfragl == NULL) |
62 |
< |
error(SYSTEM, "out of memory in hdattach"); |
83 |
> |
hdfragl = (struct fraglist *)hdrealloc((char *)hdfragl, |
84 |
> |
(fd+1)*sizeof(struct fraglist), "hdattach"); |
85 |
|
bzero((char *)(hdfragl+nhdfragls), |
86 |
|
(fd+1-nhdfragls)*sizeof(struct fraglist)); |
87 |
|
nhdfragls = fd+1; |
107 |
|
} |
108 |
|
|
109 |
|
|
88 |
– |
markdirty(hp) /* mark holodeck section directory dirty */ |
89 |
– |
register HOLO *hp; |
90 |
– |
{ |
91 |
– |
static BEAMI smudge = {0, -1}; |
92 |
– |
|
93 |
– |
if (hp->dirty) /* already marked? */ |
94 |
– |
return; |
95 |
– |
hp->dirty = 1; |
96 |
– |
if (lseek(hp->fd, biglob(hp)->fo+(nbeams(hp)-1)*sizeof(BEAMI), 0) < 0 |
97 |
– |
|| write(hp->fd, (char *)&smudge, |
98 |
– |
sizeof(BEAMI)) != sizeof(BEAMI)) |
99 |
– |
error(SYSTEM, "seek/write error in markdirty"); |
100 |
– |
} |
101 |
– |
|
102 |
– |
|
110 |
|
HOLO * |
111 |
|
hdinit(fd, hproto) /* initialize a holodeck section in a file */ |
112 |
|
int fd; /* corresponding file descriptor */ |
133 |
|
if (read(fd, (char *)(hp->bi+1), n) != n) |
134 |
|
error(SYSTEM, "failure loading holodeck directory"); |
135 |
|
/* check that it's clean */ |
136 |
< |
if (hp->bi[nbeams(hp)].fo < 0) |
137 |
< |
error(WARNING, "dirty holodeck section"); |
136 |
> |
for (n = nbeams(hp); n > 0; n--) |
137 |
> |
if (hp->bi[n].fo < 0) { |
138 |
> |
hp->bi[n].fo = 0; |
139 |
> |
error(WARNING, "dirty holodeck section"); |
140 |
> |
break; |
141 |
> |
} |
142 |
|
} else { /* assume we're creating it */ |
143 |
|
if ((hp = hdalloc(hproto)) == NULL) |
144 |
|
goto memerr; |
159 |
|
biglob(hp)->nrd = rtrunc = 0; |
160 |
|
for (n = hproto == NULL ? nbeams(hp) : 0; n > 0; n--) |
161 |
|
if (hp->bi[n].nrd) |
162 |
< |
if (hp->bi[n].fo + hp->bi[n].nrd > fpos) { |
162 |
> |
if (hp->bi[n].fo+hp->bi[n].nrd*sizeof(RAYVAL) > fpos) { |
163 |
|
rtrunc += hp->bi[n].nrd; |
164 |
|
hp->bi[n].nrd = 0; |
165 |
|
} else |
182 |
|
} |
183 |
|
|
184 |
|
|
185 |
+ |
markdirty(hp, i) /* mark holodeck directory position dirty */ |
186 |
+ |
register HOLO *hp; |
187 |
+ |
int i; |
188 |
+ |
{ |
189 |
+ |
static BEAMI smudge = {0, -1}; |
190 |
+ |
int mindist, minpos; |
191 |
+ |
register int j; |
192 |
+ |
|
193 |
+ |
if (!hp->dirty++) { /* write smudge first time */ |
194 |
+ |
if (lseek(hp->fd, biglob(hp)->fo+(i-1)*sizeof(BEAMI), 0) < 0 |
195 |
+ |
|| write(hp->fd, (char *)&smudge, |
196 |
+ |
sizeof(BEAMI)) != sizeof(BEAMI)) |
197 |
+ |
error(SYSTEM, "seek/write error in markdirty"); |
198 |
+ |
hp->dirseg[0].s = i; |
199 |
+ |
hp->dirseg[0].n = 1; |
200 |
+ |
return; |
201 |
+ |
} |
202 |
+ |
/* insert into segment list */ |
203 |
+ |
for (j = hp->dirty; j--; ) { |
204 |
+ |
if (!j || hp->dirseg[j-1].s < i) { |
205 |
+ |
hp->dirseg[j].s = i; |
206 |
+ |
hp->dirseg[j].n = 1; |
207 |
+ |
break; |
208 |
+ |
} |
209 |
+ |
copystruct(hp->dirseg+j, hp->dirseg+(j-1)); |
210 |
+ |
} |
211 |
+ |
do { /* check neighbors */ |
212 |
+ |
mindist = nbeams(hp); /* find closest */ |
213 |
+ |
for (j = hp->dirty; --j; ) |
214 |
+ |
if (hp->dirseg[j].s - |
215 |
+ |
(hp->dirseg[j-1].s + hp->dirseg[j-1].n) |
216 |
+ |
< mindist) { |
217 |
+ |
minpos = j; |
218 |
+ |
mindist = hp->dirseg[j].s - |
219 |
+ |
(hp->dirseg[j-1].s + hp->dirseg[j-1].n); |
220 |
+ |
} |
221 |
+ |
/* good enough? */ |
222 |
+ |
if (hp->dirty <= MAXDIRSE && mindist > MINDIRSEL) |
223 |
+ |
break; |
224 |
+ |
j = minpos - 1; /* coalesce neighbors */ |
225 |
+ |
if (hp->dirseg[j].s + hp->dirseg[j].n < |
226 |
+ |
hp->dirseg[minpos].s + hp->dirseg[minpos].n) |
227 |
+ |
hp->dirseg[j].n = hp->dirseg[minpos].s + |
228 |
+ |
hp->dirseg[minpos].n - hp->dirseg[j].s; |
229 |
+ |
hp->dirty--; |
230 |
+ |
while (++j < hp->dirty) /* close the gap */ |
231 |
+ |
copystruct(hp->dirseg+j, hp->dirseg+(j+1)); |
232 |
+ |
} while (mindist <= MINDIRSEL); |
233 |
+ |
} |
234 |
+ |
|
235 |
+ |
|
236 |
|
int |
237 |
|
hdsync(hp, all) /* update beams and directory on disk */ |
238 |
|
register HOLO *hp; |
252 |
|
hdsyncbeam(hp, j); |
253 |
|
if (!hp->dirty) /* directory clean? */ |
254 |
|
return(0); |
255 |
< |
errno = 0; |
256 |
< |
if (lseek(hp->fd, biglob(hp)->fo, 0) < 0) |
257 |
< |
error(SYSTEM, "cannot seek on holodeck file"); |
258 |
< |
n = nbeams(hp)*sizeof(BEAMI); |
259 |
< |
if (write(hp->fd, (char *)(hp->bi+1), n) != n) |
260 |
< |
error(SYSTEM, "cannot update holodeck section directory"); |
261 |
< |
hp->dirty = 0; |
255 |
> |
errno = 0; /* write dirty segments */ |
256 |
> |
for (j = 0; j < hp->dirty; j++) { |
257 |
> |
if (lseek(hp->fd, biglob(hp)->fo + |
258 |
> |
(hp->dirseg[j].s-1)*sizeof(BEAMI), 0) < 0) |
259 |
> |
error(SYSTEM, "cannot seek on holodeck file"); |
260 |
> |
n = hp->dirseg[j].n * sizeof(BEAMI); |
261 |
> |
if (write(hp->fd, (char *)(hp->bi+hp->dirseg[j].s), n) != n) |
262 |
> |
error(SYSTEM, "cannot update section directory"); |
263 |
> |
} |
264 |
> |
hp->dirty = 0; /* all clean */ |
265 |
|
return(1); |
266 |
|
} |
267 |
|
|
357 |
|
hp->bl[i]->tick = hdclock; /* preempt swap */ |
358 |
|
if (hdcachesize > 0 && hdmemuse(0) >= hdcachesize) |
359 |
|
hdfreecache(PCTFREE, NULL); /* free some space */ |
295 |
– |
errno = 0; |
360 |
|
if (hp->bl[i] == NULL) { /* allocate (and load) */ |
361 |
|
n = hp->bi[i].nrd + nr; |
362 |
< |
if ((hp->bl[i] = (BEAM *)malloc(hdbsiz(n))) == NULL) |
299 |
< |
goto memerr; |
362 |
> |
hp->bl[i] = (BEAM *)hdrealloc(NULL, hdbsiz(n), "hdnewrays"); |
363 |
|
blglob(hp)->nrm += n; |
364 |
|
if (n = hp->bl[i]->nrm = hp->bi[i].nrd) { |
365 |
+ |
errno = 0; |
366 |
|
if (lseek(hp->fd, hp->bi[i].fo, 0) < 0) |
367 |
|
error(SYSTEM, "seek error on holodeck file"); |
368 |
|
n *= sizeof(RAYVAL); |
371 |
|
"error reading beam from holodeck file"); |
372 |
|
} |
373 |
|
} else { /* just grow in memory */ |
374 |
< |
hp->bl[i] = (BEAM *)realloc( (char *)hp->bl[i], |
375 |
< |
hdbsiz(hp->bl[i]->nrm + nr) ); |
312 |
< |
if (hp->bl[i] == NULL) |
313 |
< |
goto memerr; |
374 |
> |
hp->bl[i] = (BEAM *)hdrealloc((char *)hp->bl[i], |
375 |
> |
hdbsiz(hp->bl[i]->nrm + nr), "hdnewrays"); |
376 |
|
blglob(hp)->nrm += nr; |
377 |
|
} |
378 |
|
p = hdbray(hp->bl[i]) + hp->bl[i]->nrm; |
380 |
|
bzero((char *)p, nr*sizeof(RAYVAL)); |
381 |
|
blglob(hp)->tick = hp->bl[i]->tick = hdclock++; /* update LRU clock */ |
382 |
|
return(p); /* point to new rays */ |
321 |
– |
memerr: |
322 |
– |
error(SYSTEM, "out of memory in hdnewrays"); |
383 |
|
} |
384 |
|
|
385 |
|
|
397 |
|
return(NULL); |
398 |
|
if (hdcachesize > 0 && hdmemuse(0) >= hdcachesize) |
399 |
|
hdfreecache(PCTFREE, NULL); /* get free space */ |
400 |
< |
errno = 0; |
341 |
< |
if ((hp->bl[i] = (BEAM *)malloc(hdbsiz(n))) == NULL) |
342 |
< |
error(SYSTEM, "cannot allocate memory for beam"); |
400 |
> |
hp->bl[i] = (BEAM *)hdrealloc(NULL, hdbsiz(n), "hdgetbeam"); |
401 |
|
blglob(hp)->nrm += hp->bl[i]->nrm = n; |
402 |
+ |
errno = 0; |
403 |
|
if (lseek(hp->fd, hp->bi[i].fo, 0) < 0) |
404 |
|
error(SYSTEM, "seek error on holodeck file"); |
405 |
|
n *= sizeof(RAYVAL); |
501 |
|
f->nfrags = j; |
502 |
|
} |
503 |
|
j = f->nfrags++; /* allocate a slot in free list */ |
504 |
< |
#if MAXFRAG |
505 |
< |
if (j >= MAXFRAG-1) |
506 |
< |
f->nfrags--; |
504 |
> |
#if MAXFRAGB |
505 |
> |
if (j >= MAXFRAGB*FRAGBLK) { |
506 |
> |
f->nfrags = j--; /* stop list growth */ |
507 |
> |
if (bi->nrd <= f->fi[j].nrd) |
508 |
> |
return; /* new one no better than discard */ |
509 |
> |
} |
510 |
|
#endif |
511 |
|
if (j % FRAGBLK == 0) { /* more free list space */ |
512 |
+ |
register BEAMI *newp; |
513 |
|
if (f->fi == NULL) |
514 |
< |
f->fi = (BEAMI *)malloc(FRAGBLK*sizeof(BEAMI)); |
514 |
> |
newp = (BEAMI *)malloc((j+FRAGBLK)*sizeof(BEAMI)); |
515 |
|
else |
516 |
< |
f->fi = (BEAMI *)realloc((char *)f->fi, |
516 |
> |
newp = (BEAMI *)realloc((char *)f->fi, |
517 |
|
(j+FRAGBLK)*sizeof(BEAMI)); |
518 |
< |
if (f->fi == NULL) |
519 |
< |
error(SYSTEM, "out of memory in hdfreefrag"); |
518 |
> |
if (newp == NULL) { |
519 |
> |
f->nfrags--; /* graceful failure */ |
520 |
> |
return; |
521 |
> |
} |
522 |
> |
f->fi = newp; |
523 |
|
} |
524 |
|
for ( ; ; j--) { /* insert in descending list */ |
525 |
|
if (!j || bi->fo < f->fi[j-1].fo) { |
617 |
|
hp->bi[i].fo = 0L; |
618 |
|
biglob(hp)->nrd += nrays - hp->bi[i].nrd; |
619 |
|
hp->bi[i].nrd = nrays; |
620 |
< |
markdirty(hp); /* section directory now out of date */ |
620 |
> |
markdirty(hp, i); /* section directory now out of date */ |
621 |
|
return(1); |
622 |
|
} |
623 |
|
|
793 |
|
return; |
794 |
|
} |
795 |
|
/* flush all data and free memory */ |
796 |
< |
hdflush(hp); |
796 |
> |
hdfreebeam(hp, 0); |
797 |
> |
hdsync(hp, 0); |
798 |
|
/* release fragment resources */ |
799 |
|
hdrelease(hp->fd); |
800 |
|
/* remove hp from active list */ |