11 |
|
|
12 |
|
#include <string.h> |
13 |
|
|
14 |
– |
#include "holo.h" |
15 |
– |
|
14 |
|
#include "platform.h" |
15 |
+ |
#include "rtprocess.h" |
16 |
|
|
17 |
+ |
#include "holo.h" |
18 |
+ |
|
19 |
|
#ifndef CACHESIZE |
20 |
|
#ifdef SMLMEM |
21 |
< |
#define CACHESIZE 5 |
21 |
> |
#define CACHESIZE 100 |
22 |
|
#else |
23 |
< |
#define CACHESIZE 17 /* default cache size (Mbytes, 0==inf) */ |
23 |
> |
#define CACHESIZE 1000 /* default cache size (Mbytes, 0==inf) */ |
24 |
|
#endif |
25 |
|
#endif |
26 |
|
#ifndef FREEBEAMS |
30 |
|
#define PCTFREE 15 /* maximum fraction to free (%) */ |
31 |
|
#endif |
32 |
|
#ifndef MAXFRAGB |
33 |
< |
#define MAXFRAGB 16 /* fragment blocks/file to track (0==inf) */ |
33 |
> |
#define MAXFRAGB 64 /* fragment blocks/file to track (0==inf) */ |
34 |
|
#endif |
35 |
|
#ifndef FF_DEFAULT |
36 |
|
/* when to free a beam fragment */ |
42 |
|
#endif |
43 |
|
|
44 |
|
#ifndef BSD |
45 |
+ |
#ifdef write /* platform.h renames those for Windows */ |
46 |
+ |
#undef write |
47 |
+ |
#endif |
48 |
|
#define write writebuf /* safe i/o routines */ |
49 |
+ |
#ifdef read |
50 |
+ |
#undef read |
51 |
+ |
#endif |
52 |
|
#define read readbuf |
53 |
|
#endif |
54 |
|
|
70 |
|
|
71 |
|
static int nhdfragls; /* size of hdfragl array */ |
72 |
|
|
73 |
+ |
static HOLO *hdalloc(HDGRID *hproto); |
74 |
+ |
static char *hdrealloc(char *ptr, unsigned siz, char *rout); |
75 |
+ |
static void hdattach(int fd, int wr); |
76 |
+ |
static void hdrelease(int fd); |
77 |
+ |
static void hdmarkdirty(HOLO *hp, int i); |
78 |
+ |
static unsigned int hdmemuse(int all); |
79 |
+ |
static int hdfilord(const void *hb1, const void *hb2); |
80 |
+ |
static off_t hdallocfrag(int fd, uint32 nrays); |
81 |
+ |
static int hdsyncbeam(HOLO *hp, int i); |
82 |
+ |
static int hdlrulist(HDBEAMI *hb, int nents, int n, HOLO *hp); |
83 |
+ |
static int hdfreecache(int pct, HOLO *honly); |
84 |
|
|
85 |
+ |
|
86 |
+ |
|
87 |
|
HOLO * |
88 |
< |
hdalloc(hproto) /* allocate and set holodeck section based on grid */ |
89 |
< |
HDGRID *hproto; |
88 |
> |
hdalloc( /* allocate and set holodeck section based on grid */ |
89 |
> |
HDGRID *hproto |
90 |
> |
) |
91 |
|
{ |
92 |
|
HOLO hdhead; |
93 |
< |
register HOLO *hp; |
93 |
> |
HOLO *hp; |
94 |
|
int n; |
95 |
|
/* copy grid to temporary header */ |
96 |
|
memcpy((void *)&hdhead, (void *)hproto, sizeof(HDGRID)); |
120 |
|
|
121 |
|
|
122 |
|
char * |
123 |
< |
hdrealloc(ptr, siz, rout) /* (re)allocate memory, retry then error */ |
124 |
< |
char *ptr; |
125 |
< |
unsigned siz; |
126 |
< |
char *rout; |
123 |
> |
hdrealloc( /* (re)allocate memory, retry then error */ |
124 |
> |
char *ptr, |
125 |
> |
unsigned siz, |
126 |
> |
char *rout |
127 |
> |
) |
128 |
|
{ |
129 |
< |
register char *newp; |
129 |
> |
char *newp; |
130 |
|
/* call malloc/realloc */ |
131 |
|
if (ptr == NULL) newp = (char *)malloc(siz); |
132 |
|
else newp = (char *)realloc((void *)ptr, siz); |
144 |
|
} |
145 |
|
|
146 |
|
|
147 |
< |
hdattach(fd, wr) /* start tracking file fragments for some section */ |
148 |
< |
register int fd; |
149 |
< |
int wr; |
147 |
> |
void |
148 |
> |
hdattach( /* start tracking file fragments for some section */ |
149 |
> |
int fd, |
150 |
> |
int wr |
151 |
> |
) |
152 |
|
{ |
153 |
|
if (fd >= nhdfragls) { |
154 |
|
hdfragl = (struct fraglist *)hdrealloc((char *)hdfragl, |
167 |
|
/* Do we need a routine to locate file fragments given known occupants? */ |
168 |
|
|
169 |
|
|
170 |
< |
hdrelease(fd) /* stop tracking file fragments for some section */ |
171 |
< |
register int fd; |
170 |
> |
void |
171 |
> |
hdrelease( /* stop tracking file fragments for some section */ |
172 |
> |
int fd |
173 |
> |
) |
174 |
|
{ |
175 |
|
if ((fd < 0) | (fd >= nhdfragls) || !hdfragl[fd].nlinks) |
176 |
|
return; |
183 |
|
|
184 |
|
|
185 |
|
HOLO * |
186 |
< |
hdinit(fd, hproto) /* initialize a holodeck section in a file */ |
187 |
< |
int fd; /* corresponding file descriptor */ |
188 |
< |
HDGRID *hproto; /* holodeck section grid */ |
186 |
> |
hdinit( /* initialize a holodeck section in a file */ |
187 |
> |
int fd, /* corresponding file descriptor */ |
188 |
> |
HDGRID *hproto /* holodeck section grid */ |
189 |
> |
) |
190 |
|
{ |
191 |
|
off_t rtrunc; |
192 |
|
off_t fpos; |
193 |
|
int writable; |
194 |
< |
register HOLO *hp; |
195 |
< |
register int n; |
194 |
> |
HOLO *hp; |
195 |
> |
int n; |
196 |
|
/* prepare for system errors */ |
197 |
|
errno = 0; |
198 |
|
if ((fpos = lseek(fd, (off_t)0, SEEK_CUR)) < 0) |
252 |
|
} |
253 |
|
if (rtrunc) { |
254 |
|
sprintf(errmsg, "truncated section, %ld rays lost (%.1f%%)", |
255 |
< |
rtrunc, 100.*rtrunc/(rtrunc+biglob(hp)->nrd)); |
255 |
> |
(long)rtrunc, |
256 |
> |
100.*rtrunc/(rtrunc+biglob(hp)->nrd)); |
257 |
|
error(WARNING, errmsg); |
258 |
|
} |
259 |
|
/* add to holodeck list */ |
266 |
|
return(hp); |
267 |
|
memerr: |
268 |
|
error(SYSTEM, "cannot allocate holodeck grid"); |
269 |
+ |
return NULL; /* pro forma return */ |
270 |
|
} |
271 |
|
|
272 |
|
|
273 |
< |
hdmarkdirty(hp, i) /* mark holodeck directory position dirty */ |
274 |
< |
register HOLO *hp; |
275 |
< |
int i; |
273 |
> |
void |
274 |
> |
hdmarkdirty( /* mark holodeck directory position dirty */ |
275 |
> |
HOLO *hp, |
276 |
> |
int i |
277 |
> |
) |
278 |
|
{ |
279 |
|
static BEAMI smudge = {0, -1}; |
280 |
|
int mindist, minpos; |
281 |
< |
register int j; |
281 |
> |
int j; |
282 |
|
|
283 |
|
if (!hp->dirty++) { /* write smudge first time */ |
284 |
|
if (lseek(hp->fd, biglob(hp)->fo+(i-1)*sizeof(BEAMI), |
325 |
|
|
326 |
|
|
327 |
|
int |
328 |
< |
hdsync(hp, all) /* update beams and directory on disk */ |
329 |
< |
register HOLO *hp; |
330 |
< |
int all; |
328 |
> |
hdsync( /* update beams and directory on disk */ |
329 |
> |
HOLO *hp, |
330 |
> |
int all |
331 |
> |
) |
332 |
|
{ |
333 |
< |
register int j, n; |
333 |
> |
int j, n; |
334 |
|
|
335 |
|
if (hp == NULL) { /* do all holodecks */ |
336 |
|
n = 0; |
358 |
|
} |
359 |
|
|
360 |
|
|
361 |
< |
unsigned |
362 |
< |
hdmemuse(all) /* return memory usage (in bytes) */ |
363 |
< |
int all; /* include overhead (painful) */ |
361 |
> |
unsigned int |
362 |
> |
hdmemuse( /* return memory usage (in bytes) */ |
363 |
> |
int all /* include overhead (painful) */ |
364 |
> |
) |
365 |
|
{ |
366 |
|
long total = 0; |
367 |
< |
register int i, j; |
367 |
> |
int i, j; |
368 |
|
|
369 |
|
for (j = 0; hdlist[j] != NULL; j++) { |
370 |
|
total += blglob(hdlist[j])->nrm * sizeof(RAYVAL); |
389 |
|
|
390 |
|
|
391 |
|
off_t |
392 |
< |
hdfilen(fd) /* return file length for fd */ |
393 |
< |
int fd; |
392 |
> |
hdfilen( /* return file length for fd */ |
393 |
> |
int fd |
394 |
> |
) |
395 |
|
{ |
396 |
|
off_t fpos, flen; |
397 |
|
|
409 |
|
|
410 |
|
|
411 |
|
off_t |
412 |
< |
hdfiluse(fd, all) /* compute file usage (in bytes) */ |
413 |
< |
int fd; /* open file descriptor to check */ |
414 |
< |
int all; /* include overhead and unflushed data */ |
412 |
> |
hdfiluse( /* compute file usage (in bytes) */ |
413 |
> |
int fd /* open file descriptor to check */ |
414 |
> |
) |
415 |
|
{ |
416 |
|
off_t total = 0; |
417 |
< |
register int i, j; |
417 |
> |
int j; |
418 |
|
|
419 |
|
for (j = 0; hdlist[j] != NULL; j++) { |
420 |
|
if (hdlist[j]->fd != fd) |
421 |
|
continue; |
422 |
|
total += biglob(hdlist[j])->nrd * sizeof(RAYVAL); |
423 |
< |
if (all) { |
424 |
< |
for (i = nbeams(hdlist[j]); i > 0; i--) |
425 |
< |
if (hdlist[j]->bl[i] != NULL) |
426 |
< |
total += sizeof(RAYVAL) * |
423 |
> |
total += nbeams(hdlist[j])*sizeof(BEAMI) + sizeof(HDGRID); |
424 |
> |
#if 0 |
425 |
> |
for (i = nbeams(hdlist[j]); i > 0; i--) |
426 |
> |
if (hdlist[j]->bl[i] != NULL) |
427 |
> |
total += sizeof(RAYVAL) * |
428 |
|
(hdlist[j]->bl[i]->nrm - |
429 |
|
hdlist[j]->bi[i].nrd); |
430 |
< |
total += sizeof(HDGRID) + |
396 |
< |
nbeams(hdlist[j])*sizeof(BEAMI); |
397 |
< |
} |
430 |
> |
#endif |
431 |
|
} |
432 |
< |
return(total); /* does not include fragments */ |
432 |
> |
return(total); /* doesn't include fragments, unflushed rays */ |
433 |
|
} |
434 |
|
|
435 |
|
|
436 |
|
RAYVAL * |
437 |
< |
hdnewrays(hp, i, nr) /* allocate space for add'l rays and return pointer */ |
438 |
< |
register HOLO *hp; |
439 |
< |
register int i; |
440 |
< |
int nr; /* number of new rays desired */ |
437 |
> |
hdnewrays( /* allocate space for add'l rays and return pointer */ |
438 |
> |
HOLO *hp, |
439 |
> |
int i, |
440 |
> |
int nr /* number of new rays desired */ |
441 |
> |
) |
442 |
|
{ |
443 |
|
RAYVAL *p; |
444 |
|
int n; |
479 |
|
|
480 |
|
|
481 |
|
BEAM * |
482 |
< |
hdgetbeam(hp, i) /* get beam (from file if necessary) */ |
483 |
< |
register HOLO *hp; |
484 |
< |
register int i; |
482 |
> |
hdgetbeam( /* get beam (from file if necessary) */ |
483 |
> |
HOLO *hp, |
484 |
> |
int i |
485 |
> |
) |
486 |
|
{ |
487 |
< |
register int n; |
487 |
> |
int n; |
488 |
|
|
489 |
|
CHECK((i < 1) | (i > nbeams(hp)), |
490 |
|
CONSISTENCY, "bad beam index given to hdgetbeam"); |
510 |
|
|
511 |
|
|
512 |
|
int |
513 |
< |
hdfilord(hb1, hb2) /* order beams for quick loading */ |
514 |
< |
register HDBEAMI *hb1, *hb2; |
513 |
> |
hdfilord( /* order beams for quick loading */ |
514 |
> |
const void *hb1, |
515 |
> |
const void *hb2 |
516 |
> |
) |
517 |
|
{ |
518 |
< |
register off_t c; |
518 |
> |
off_t c; |
519 |
|
/* residents go first */ |
520 |
< |
if (hb2->h->bl[hb2->b] != NULL) |
521 |
< |
return(hb1->h->bl[hb1->b] == NULL); |
522 |
< |
if (hb1->h->bl[hb1->b] != NULL) |
520 |
> |
if (((HDBEAMI*)hb2)->h->bl[((HDBEAMI*)hb2)->b] != NULL) |
521 |
> |
return(((HDBEAMI*)hb1)->h->bl[((HDBEAMI*)hb1)->b] == NULL); |
522 |
> |
if (((HDBEAMI*)hb1)->h->bl[((HDBEAMI*)hb1)->b] != NULL) |
523 |
|
return(-1); |
524 |
|
/* otherwise sort by file descriptor */ |
525 |
< |
if (hb1->h->fd != hb2->h->fd) |
526 |
< |
return(hb1->h->fd - hb2->h->fd); |
525 |
> |
if (((HDBEAMI*)hb1)->h->fd != ((HDBEAMI*)hb2)->h->fd) |
526 |
> |
return(((HDBEAMI*)hb1)->h->fd - ((HDBEAMI*)hb2)->h->fd); |
527 |
|
/* then by position in file */ |
528 |
< |
c = hb1->h->bi[hb1->b].fo - hb2->h->bi[hb2->b].fo; |
528 |
> |
c = ((HDBEAMI*)hb1)->h->bi[((HDBEAMI*)hb1)->b].fo |
529 |
> |
- ((HDBEAMI*)hb2)->h->bi[((HDBEAMI*)hb2)->b].fo; |
530 |
|
return(c > 0 ? 1 : c < 0 ? -1 : 0); |
531 |
|
} |
532 |
|
|
533 |
|
|
534 |
< |
hdloadbeams(hb, n, bf) /* load a list of beams in optimal order */ |
535 |
< |
register HDBEAMI *hb; /* list gets sorted by hdfilord() */ |
536 |
< |
int n; /* list length */ |
537 |
< |
void (*bf)(); /* callback function (optional) */ |
534 |
> |
void |
535 |
> |
hdloadbeams( /* load a list of beams in optimal order */ |
536 |
> |
HDBEAMI *hb, /* list gets sorted by hdfilord() */ |
537 |
> |
int n, /* list length */ |
538 |
> |
void (*bf)(BEAM *bp, HDBEAMI *hb) /* callback function (optional) */ |
539 |
> |
) |
540 |
|
{ |
541 |
|
unsigned origcachesize, memuse; |
542 |
|
int bytesloaded, needbytes, bytes2free; |
543 |
< |
register BEAM *bp; |
544 |
< |
register int i; |
543 |
> |
BEAM *bp; |
544 |
> |
int i; |
545 |
|
/* precheck consistency */ |
546 |
|
if (n <= 0) return; |
547 |
|
for (i = n; i--; ) |
579 |
|
|
580 |
|
|
581 |
|
int |
582 |
< |
hdfreefrag(hp, i) /* free a file fragment */ |
583 |
< |
HOLO *hp; |
584 |
< |
int i; |
582 |
> |
hdfreefrag( /* free a file fragment */ |
583 |
> |
HOLO *hp, |
584 |
> |
int i |
585 |
> |
) |
586 |
|
{ |
587 |
< |
register BEAMI *bi = &hp->bi[i]; |
588 |
< |
register struct fraglist *f; |
589 |
< |
register int j, k; |
587 |
> |
BEAMI *bi = &hp->bi[i]; |
588 |
> |
struct fraglist *f; |
589 |
> |
int j, k; |
590 |
|
|
591 |
|
if (bi->nrd <= 0) |
592 |
|
return(0); |
615 |
|
} |
616 |
|
#endif |
617 |
|
if (j % FRAGBLK == 0) { /* more (or less) free list space */ |
618 |
< |
register BEAMI *newp; |
618 |
> |
BEAMI *newp; |
619 |
|
if (f->fi == NULL) |
620 |
|
newp = (BEAMI *)malloc((j+FRAGBLK)*sizeof(BEAMI)); |
621 |
|
else |
659 |
|
|
660 |
|
|
661 |
|
int |
662 |
< |
hdfragOK(fd, listlen, listsiz) /* get fragment list status for file */ |
663 |
< |
int fd; |
664 |
< |
int *listlen; |
665 |
< |
register int32 *listsiz; |
662 |
> |
hdfragOK( /* get fragment list status for file */ |
663 |
> |
int fd, |
664 |
> |
int *listlen, |
665 |
> |
int32 *listsiz |
666 |
> |
) |
667 |
|
{ |
668 |
< |
register struct fraglist *f; |
669 |
< |
register int i; |
668 |
> |
struct fraglist *f; |
669 |
> |
int i; |
670 |
|
|
671 |
|
if ((fd < 0) | (fd >= nhdfragls) || !(f = &hdfragl[fd])->nlinks) |
672 |
|
return(0); /* listless */ |
684 |
|
|
685 |
|
|
686 |
|
off_t |
687 |
< |
hdallocfrag(fd, nrays) /* allocate a file fragment */ |
688 |
< |
int fd; |
689 |
< |
uint32 nrays; |
687 |
> |
hdallocfrag( /* allocate a file fragment */ |
688 |
> |
int fd, |
689 |
> |
uint32 nrays |
690 |
> |
) |
691 |
|
{ |
692 |
< |
register struct fraglist *f; |
693 |
< |
register int j; |
692 |
> |
struct fraglist *f; |
693 |
> |
int j; |
694 |
|
off_t nfo; |
695 |
|
|
696 |
|
if (nrays == 0) |
714 |
|
|
715 |
|
|
716 |
|
int |
717 |
< |
hdsyncbeam(hp, i) /* sync beam in memory with beam on disk */ |
718 |
< |
register HOLO *hp; |
719 |
< |
register int i; |
717 |
> |
hdsyncbeam( /* sync beam in memory with beam on disk */ |
718 |
> |
HOLO *hp, |
719 |
> |
int i |
720 |
> |
) |
721 |
|
{ |
722 |
|
int fragfreed; |
723 |
|
uint32 nrays; |
756 |
|
|
757 |
|
|
758 |
|
int |
759 |
< |
hdfreebeam(hp, i) /* free beam, writing if dirty */ |
760 |
< |
register HOLO *hp; |
761 |
< |
register int i; |
759 |
> |
hdfreebeam( /* free beam, writing if dirty */ |
760 |
> |
HOLO *hp, |
761 |
> |
int i |
762 |
> |
) |
763 |
|
{ |
764 |
|
int nchanged; |
765 |
|
|
798 |
|
|
799 |
|
|
800 |
|
int |
801 |
< |
hdkillbeam(hp, i) /* delete beam from holodeck */ |
802 |
< |
register HOLO *hp; |
803 |
< |
register int i; |
801 |
> |
hdkillbeam( /* delete beam from holodeck */ |
802 |
> |
HOLO *hp, |
803 |
> |
int i |
804 |
> |
) |
805 |
|
{ |
806 |
|
int nchanged; |
807 |
|
|
844 |
|
|
845 |
|
|
846 |
|
int |
847 |
< |
hdlrulist(hb, nents, n, hp) /* add beams from holodeck to LRU list */ |
848 |
< |
register HDBEAMI *hb; /* beam list */ |
849 |
< |
int nents; /* current list length */ |
850 |
< |
int n; /* maximum list length */ |
851 |
< |
register HOLO *hp; /* section we're adding from */ |
847 |
> |
hdlrulist( /* add beams from holodeck to LRU list */ |
848 |
> |
HDBEAMI *hb, /* beam list */ |
849 |
> |
int nents, /* current list length */ |
850 |
> |
int n, /* maximum list length */ |
851 |
> |
HOLO *hp /* section we're adding from */ |
852 |
> |
) |
853 |
|
{ |
854 |
< |
register int i, j; |
854 |
> |
int i, j; |
855 |
|
/* insert each beam from hp */ |
856 |
|
for (i = 1; i <= nbeams(hp); i++) { |
857 |
|
if (hp->bl[i] == NULL) /* check if loaded */ |
877 |
|
|
878 |
|
|
879 |
|
int |
880 |
< |
hdfreecache(pct, honly) /* free up cache space, writing changes */ |
881 |
< |
int pct; /* maximum percentage to free */ |
882 |
< |
register HOLO *honly; /* NULL means check all */ |
880 |
> |
hdfreecache( /* free up cache space, writing changes */ |
881 |
> |
int pct, /* maximum percentage to free */ |
882 |
> |
HOLO *honly /* NULL means check all */ |
883 |
> |
) |
884 |
|
{ |
885 |
|
HDBEAMI hb[FREEBEAMS]; |
886 |
|
int freetarget; |
887 |
|
int n; |
888 |
< |
register int i; |
888 |
> |
int i; |
889 |
|
#ifdef DEBUG |
890 |
|
unsigned membefore; |
891 |
|
|
921 |
|
} |
922 |
|
|
923 |
|
|
924 |
< |
hddone(hp) /* clean up holodeck section and free */ |
925 |
< |
register HOLO *hp; /* NULL means clean up all */ |
924 |
> |
void |
925 |
> |
hddone( /* clean up holodeck section and free */ |
926 |
> |
HOLO *hp /* NULL means clean up all */ |
927 |
> |
) |
928 |
|
{ |
929 |
< |
register int i; |
929 |
> |
int i; |
930 |
|
|
931 |
|
if (hp == NULL) { /* NULL means clean up everything */ |
932 |
|
while (hdlist[0] != NULL) |