| 1 |
– |
/* Copyright (c) 1998 Silicon Graphics, Inc. */ |
| 2 |
– |
|
| 1 |
|
#ifndef lint |
| 2 |
< |
static char SCCSid[] = "$SunId$ SGI"; |
| 2 |
> |
static const char RCSid[] = "$Id$"; |
| 3 |
|
#endif |
| 6 |
– |
|
| 4 |
|
/* |
| 5 |
|
* Optimize holodeck for quick access. |
| 6 |
|
* |
| 7 |
|
* 11/4/98 Greg Ward Larson |
| 8 |
|
*/ |
| 9 |
|
|
| 13 |
– |
#include "holo.h" |
| 14 |
– |
|
| 10 |
|
#include <signal.h> |
| 11 |
+ |
#include <string.h> |
| 12 |
|
|
| 13 |
+ |
#include "rtprocess.h" /* getpid() */ |
| 14 |
+ |
#include "holo.h" |
| 15 |
+ |
|
| 16 |
|
#ifndef BKBSIZE |
| 17 |
|
#define BKBSIZE 256 /* beam clump size (kilobytes) */ |
| 18 |
|
#endif |
| 19 |
|
|
| 21 |
– |
#define flgop(p,i,op) ((p)[(i)>>5] op (1L<<((i)&0x1f))) |
| 22 |
– |
#define isset(p,i) flgop(p,i,&) |
| 23 |
– |
#define setfl(p,i) flgop(p,i,|=) |
| 24 |
– |
#define clrfl(p,i) flgop(p,i,&=~) |
| 25 |
– |
|
| 20 |
|
char *progname; |
| 21 |
|
char tempfile[128]; |
| 22 |
+ |
int dupchecking = 0; |
| 23 |
|
|
| 29 |
– |
extern char *rindex(); |
| 30 |
– |
extern int quit(); |
| 24 |
|
extern long rhinitcopy(); |
| 25 |
|
|
| 26 |
|
|
| 33 |
|
long nextipos, lastopos, thisopos; |
| 34 |
|
|
| 35 |
|
progname = argv[0]; |
| 36 |
< |
if (argc < 2 | argc > 3) { |
| 37 |
< |
fprintf(stderr, "Usage: %s input.hdk [output.hdk]\n", progname); |
| 36 |
> |
argv++; argc--; /* duplicate checking flag? */ |
| 37 |
> |
if (argc > 1 && !strcmp(argv[0], "-u")) { |
| 38 |
> |
dupchecking++; |
| 39 |
> |
argv++; argc--; |
| 40 |
> |
} |
| 41 |
> |
if ((argc < 1) | (argc > 2)) { |
| 42 |
> |
fprintf(stderr, "Usage: %s [-u] input.hdk [output.hdk]\n", |
| 43 |
> |
progname); |
| 44 |
|
exit(1); |
| 45 |
|
} |
| 46 |
< |
inpname = argv[1]; |
| 47 |
< |
if (argc == 3) /* use given output file */ |
| 48 |
< |
outname = argv[2]; |
| 46 |
> |
inpname = argv[0]; /* get input file */ |
| 47 |
> |
argv++; argc--; |
| 48 |
> |
if (argc == 1) /* use given output file */ |
| 49 |
> |
outname = argv[0]; |
| 50 |
|
else { /* else use temporary file */ |
| 51 |
|
if (access(inpname, R_OK|W_OK) < 0) { /* check permissions */ |
| 52 |
|
sprintf(errmsg, "cannot access \"%s\"", inpname); |
| 53 |
|
error(SYSTEM, errmsg); |
| 54 |
|
} |
| 55 |
|
strcpy(tempfile, inpname); |
| 56 |
< |
if ((outname = rindex(tempfile, '/')) != NULL) |
| 56 |
> |
if ((outname = strrchr(tempfile, '/')) != NULL) |
| 57 |
|
outname++; |
| 58 |
|
else |
| 59 |
|
outname = tempfile; |
| 65 |
|
lastopos = 0L; /* copy sections one by one */ |
| 66 |
|
while (nextipos != 0L) { |
| 67 |
|
/* set input position; get next */ |
| 68 |
< |
lseek(hdfd[0], nextipos, 0); |
| 68 |
> |
lseek(hdfd[0], (off_t)nextipos, 0); |
| 69 |
|
read(hdfd[0], (char *)&nextipos, sizeof(nextipos)); |
| 70 |
|
/* get output position; set last */ |
| 71 |
< |
thisopos = lseek(hdfd[1], 0L, 2); |
| 71 |
> |
thisopos = lseek(hdfd[1], (off_t)0, 2); |
| 72 |
|
if (lastopos > 0L) { |
| 73 |
< |
lseek(hdfd[1], lastopos, 0); |
| 73 |
> |
lseek(hdfd[1], (off_t)lastopos, 0); |
| 74 |
|
write(hdfd[1], (char *)&thisopos, sizeof(thisopos)); |
| 75 |
< |
lseek(hdfd[1], 0L, 2); |
| 75 |
> |
lseek(hdfd[1], (off_t)0, 2); |
| 76 |
|
} |
| 77 |
|
lastopos = thisopos; |
| 78 |
|
thisopos = 0L; /* write place holder */ |
| 104 |
|
sprintf(errmsg, "cannot open \"%s\" for reading", infn); |
| 105 |
|
error(SYSTEM, errmsg); |
| 106 |
|
} |
| 107 |
+ |
if (access(outfn, F_OK) == 0) { |
| 108 |
+ |
sprintf(errmsg, "output file \"%s\" already exists!", outfn); |
| 109 |
+ |
error(USER, errmsg); |
| 110 |
+ |
} |
| 111 |
|
if ((outfp = fopen(outfn, "w+")) == NULL) { |
| 112 |
|
sprintf(errmsg, "cannot open \"%s\" for writing", outfn); |
| 113 |
|
error(SYSTEM, errmsg); |
| 134 |
|
fclose(infp); |
| 135 |
|
if (fclose(outfp) == EOF) |
| 136 |
|
error(SYSTEM, "file flushing error in rhinitcopy"); |
| 137 |
< |
/* flush everything manually hence */ |
| 138 |
< |
hdcachesize = 0; |
| 137 |
> |
/* check cache size */ |
| 138 |
> |
if (BKBSIZE*1024*1.5 > hdcachesize) |
| 139 |
> |
hdcachesize = BKBSIZE*1024*1.5; |
| 140 |
|
/* return input position */ |
| 141 |
|
return(ifpos); |
| 142 |
|
} |
| 143 |
|
|
| 144 |
|
|
| 145 |
< |
gcshifti(gc, ia, di, hp) /* shift cell row or column */ |
| 146 |
< |
register GCOORD *gc; |
| 147 |
< |
int ia, di; |
| 148 |
< |
register HOLO *hp; |
| 145 |
> |
int |
| 146 |
> |
nuniq(rva, n) /* sort unique rays to front of beam list */ |
| 147 |
> |
register RAYVAL *rva; |
| 148 |
> |
int n; |
| 149 |
|
{ |
| 145 |
– |
int nw; |
| 146 |
– |
|
| 147 |
– |
if (di > 0) { |
| 148 |
– |
if (++gc->i[ia] >= hp->grid[((gc->w>>1)+1+ia)%3]) { |
| 149 |
– |
nw = ((gc->w&~1) + (ia<<1) + 3) % 6; |
| 150 |
– |
gc->i[ia] = gc->i[1-ia]; |
| 151 |
– |
gc->i[1-ia] = gc->w&1 ? hp->grid[((nw>>1)+2-ia)%3]-1 : 0; |
| 152 |
– |
gc->w = nw; |
| 153 |
– |
} |
| 154 |
– |
} else if (di < 0) { |
| 155 |
– |
if (--gc->i[ia] < 0) { |
| 156 |
– |
nw = ((gc->w&~1) + (ia<<1) + 2) % 6; |
| 157 |
– |
gc->i[ia] = gc->i[1-ia]; |
| 158 |
– |
gc->i[1-ia] = gc->w&1 ? hp->grid[((nw>>1)+2-ia)%3]-1 : 0; |
| 159 |
– |
gc->w = nw; |
| 160 |
– |
} |
| 161 |
– |
} |
| 162 |
– |
} |
| 163 |
– |
|
| 164 |
– |
|
| 165 |
– |
mkneighgrid(ng, hp, gc) /* compute neighborhood for grid cell */ |
| 166 |
– |
GCOORD ng[3*3]; |
| 167 |
– |
HOLO *hp; |
| 168 |
– |
GCOORD *gc; |
| 169 |
– |
{ |
| 170 |
– |
GCOORD gci0; |
| 150 |
|
register int i, j; |
| 151 |
+ |
RAYVAL rtmp; |
| 152 |
|
|
| 153 |
< |
for (i = 3; i--; ) { |
| 154 |
< |
copystruct(&gci0, gc); |
| 155 |
< |
gcshifti(&gci0, 0, i-1, hp); |
| 156 |
< |
for (j = 3; j--; ) { |
| 157 |
< |
copystruct(ng+(3*i+j), &gci0); |
| 158 |
< |
gcshifti(ng+(3*i+j), gci0.w==gc->w, j-1, hp); |
| 159 |
< |
} |
| 160 |
< |
} |
| 153 |
> |
for (j = 0; j < n; j++) |
| 154 |
> |
for (i = j+1; i < n; i++) |
| 155 |
> |
if ( rva[i].d == rva[j].d && |
| 156 |
> |
rva[i].r[0][0]==rva[j].r[0][0] && |
| 157 |
> |
rva[i].r[0][1]==rva[j].r[0][1] && |
| 158 |
> |
rva[i].r[1][0]==rva[j].r[1][0] && |
| 159 |
> |
rva[i].r[1][1]==rva[j].r[1][1] ) { |
| 160 |
> |
n--; /* swap duplicate with end */ |
| 161 |
> |
rtmp = *(rva+n); |
| 162 |
> |
*(rva+n) = *(rva+i); |
| 163 |
> |
*(rva+i) = rtmp; |
| 164 |
> |
i--; /* recheck one we swapped */ |
| 165 |
> |
} |
| 166 |
> |
return(n); |
| 167 |
|
} |
| 168 |
|
|
| 169 |
|
|
| 170 |
< |
int bneighlist[9*9-1]; |
| 185 |
< |
int bneighrem; |
| 170 |
> |
static BEAMI *beamdir; |
| 171 |
|
|
| 172 |
< |
#define nextneigh() (bneighrem<=0 ? 0 : bneighlist[--bneighrem]) |
| 173 |
< |
|
| 174 |
< |
int |
| 190 |
< |
firstneigh(hp, b) /* initialize neighbor list and return first */ |
| 191 |
< |
HOLO *hp; |
| 192 |
< |
int b; |
| 172 |
> |
static int |
| 173 |
> |
bpcmp(b1p, b2p) /* compare beam positions on disk */ |
| 174 |
> |
int *b1p, *b2p; |
| 175 |
|
{ |
| 176 |
< |
GCOORD wg0[9], wg1[9], bgc[2]; |
| 195 |
< |
int i, j; |
| 176 |
> |
register off_t pdif = beamdir[*b1p].fo - beamdir[*b2p].fo; |
| 177 |
|
|
| 178 |
< |
hdbcoord(bgc, hp, b); |
| 179 |
< |
mkneighgrid(wg0, hp, bgc); |
| 199 |
< |
mkneighgrid(wg1, hp, bgc+1); |
| 200 |
< |
bneighrem = 0; |
| 201 |
< |
for (i = 9; i--; ) |
| 202 |
< |
for (j = 9; j--; ) { |
| 203 |
< |
if (i == 4 & j == 4) /* don't copy starting beam */ |
| 204 |
< |
continue; |
| 205 |
< |
if (wg0[i].w == wg1[j].w) |
| 206 |
< |
continue; |
| 207 |
< |
copystruct(bgc, wg0+i); |
| 208 |
< |
copystruct(bgc+1, wg1+j); |
| 209 |
< |
bneighlist[bneighrem++] = hdbindex(hp, bgc); |
| 210 |
< |
#ifdef DEBUG |
| 211 |
< |
if (bneighlist[bneighrem-1] <= 0) |
| 212 |
< |
error(CONSISTENCY, "bad beam in firstneigh"); |
| 213 |
< |
#endif |
| 214 |
< |
} |
| 215 |
< |
return(nextneigh()); |
| 178 |
> |
if (pdif < 0L) return(-1); |
| 179 |
> |
return(pdif > 0L); |
| 180 |
|
} |
| 181 |
|
|
| 182 |
+ |
static HOLO *hout; |
| 183 |
|
|
| 184 |
< |
BEAMI *beamdir; |
| 185 |
< |
|
| 186 |
< |
int |
| 187 |
< |
bpcmp(b1p, b2p) /* compare beam positions on disk */ |
| 223 |
< |
int *b1p, *b2p; |
| 184 |
> |
static int |
| 185 |
> |
xferclump(hp, bq, nb) /* transfer the given clump to hout and free */ |
| 186 |
> |
HOLO *hp; |
| 187 |
> |
int *bq, nb; |
| 188 |
|
{ |
| 189 |
< |
register long pdif = beamdir[*b1p].fo - beamdir[*b2p].fo; |
| 189 |
> |
register int i; |
| 190 |
> |
register BEAM *bp; |
| 191 |
> |
int n; |
| 192 |
|
|
| 193 |
< |
if (pdif > 0L) return(1); |
| 194 |
< |
if (pdif < 0L) return(-1); |
| 193 |
> |
beamdir = hp->bi; /* sort based on file position */ |
| 194 |
> |
qsort((void *)bq, nb, sizeof(*bq), bpcmp); |
| 195 |
> |
/* transfer and free each beam */ |
| 196 |
> |
for (i = 0; i < nb; i++) { |
| 197 |
> |
bp = hdgetbeam(hp, bq[i]); |
| 198 |
> |
DCHECK(bp==NULL, CONSISTENCY, "empty beam in xferclump"); |
| 199 |
> |
n = dupchecking ? nuniq(hdbray(bp),bp->nrm) : bp->nrm; |
| 200 |
> |
memcpy((void *)hdnewrays(hout,bq[i],n),(void *)hdbray(bp), |
| 201 |
> |
n*sizeof(RAYVAL)); |
| 202 |
> |
hdfreebeam(hp, bq[i]); |
| 203 |
> |
} |
| 204 |
> |
hdfreebeam(hout, 0); /* write & free clump */ |
| 205 |
|
return(0); |
| 206 |
|
} |
| 207 |
|
|
| 232 |
– |
|
| 208 |
|
copysect(ifd, ofd) /* copy holodeck section from ifd to ofd */ |
| 209 |
|
int ifd, ofd; |
| 210 |
|
{ |
| 211 |
< |
static short primes[] = {9431,6803,4177,2659,1609,887,587,251,47,1}; |
| 237 |
< |
register HOLO *hinp; |
| 238 |
< |
HOLO *hout; |
| 239 |
< |
register BEAM *bp; |
| 240 |
< |
unsigned int4 *bflags; |
| 241 |
< |
int *bqueue; |
| 242 |
< |
int bqlen; |
| 243 |
< |
int4 bqtotal; |
| 244 |
< |
int bc, bci, bqc, myprime; |
| 245 |
< |
register int i; |
| 211 |
> |
HOLO *hinp; |
| 212 |
|
/* load input section directory */ |
| 213 |
|
hinp = hdinit(ifd, NULL); |
| 214 |
|
/* create output section directory */ |
| 215 |
|
hout = hdinit(ofd, (HDGRID *)hinp); |
| 216 |
< |
/* allocate beam queue */ |
| 217 |
< |
bqueue = (int *)malloc(nbeams(hinp)*sizeof(int)); |
| 218 |
< |
bflags = (unsigned int4 *)calloc((nbeams(hinp)>>5)+1, |
| 253 |
< |
sizeof(unsigned int4)); |
| 254 |
< |
if (bqueue == NULL | bflags == NULL) |
| 255 |
< |
error(SYSTEM, "out of memory in copysect"); |
| 256 |
< |
/* mark empty beams as done */ |
| 257 |
< |
for (i = nbeams(hinp); i > 0; i--) |
| 258 |
< |
if (!hinp->bi[i].nrd) |
| 259 |
< |
setfl(bflags, i); |
| 260 |
< |
/* pick a good prime step size */ |
| 261 |
< |
for (i = 0; primes[i]<<5 >= nbeams(hinp); i++) |
| 262 |
< |
; |
| 263 |
< |
while ((myprime = primes[i++]) > 1) |
| 264 |
< |
if (nbeams(hinp) % myprime) |
| 265 |
< |
break; |
| 266 |
< |
/* add each input beam and neighbors */ |
| 267 |
< |
for (bc = bci = nbeams(hinp); bc > 0; bc--, |
| 268 |
< |
bci += bci>myprime ? -myprime : nbeams(hinp)-myprime) { |
| 269 |
< |
if (isset(bflags, bci)) |
| 270 |
< |
continue; |
| 271 |
< |
bqueue[0] = bci; /* initialize queue */ |
| 272 |
< |
bqlen = 1; |
| 273 |
< |
bqtotal = hinp->bi[bci].nrd; |
| 274 |
< |
setfl(bflags, bci); |
| 275 |
< |
/* run through growing queue */ |
| 276 |
< |
for (bqc = 0; bqc < bqlen; bqc++) { |
| 277 |
< |
/* add neighbors until full */ |
| 278 |
< |
for (i = firstneigh(hinp,bqueue[bqc]); i > 0; |
| 279 |
< |
i = nextneigh()) { |
| 280 |
< |
if (isset(bflags, i)) /* done already? */ |
| 281 |
< |
continue; |
| 282 |
< |
bqueue[bqlen++] = i; /* add it */ |
| 283 |
< |
bqtotal += hinp->bi[i].nrd; |
| 284 |
< |
setfl(bflags, i); |
| 285 |
< |
if (bqtotal >= BKBSIZE*1024/sizeof(RAYVAL)) |
| 286 |
< |
break; /* queue full */ |
| 287 |
< |
} |
| 288 |
< |
if (i > 0) |
| 289 |
< |
break; |
| 290 |
< |
} |
| 291 |
< |
beamdir = hinp->bi; /* sort queue */ |
| 292 |
< |
qsort((char *)bqueue, bqlen, sizeof(*bqueue), bpcmp); |
| 293 |
< |
/* transfer each beam */ |
| 294 |
< |
for (i = 0; i < bqlen; i++) { |
| 295 |
< |
bp = hdgetbeam(hinp, bqueue[i]); |
| 296 |
< |
bcopy((char *)hdbray(bp), |
| 297 |
< |
(char *)hdnewrays(hout,bqueue[i],bp->nrm), |
| 298 |
< |
bp->nrm*sizeof(RAYVAL)); |
| 299 |
< |
hdfreebeam(hinp, bqueue[i]); |
| 300 |
< |
} |
| 301 |
< |
hdfreebeam(hout, 0); /* flush output block */ |
| 302 |
< |
#ifdef DEBUG |
| 303 |
< |
hdsync(hout, 0); |
| 304 |
< |
#endif |
| 305 |
< |
} |
| 306 |
< |
/* we're done -- clean up */ |
| 307 |
< |
free((char *)bqueue); |
| 308 |
< |
free((char *)bflags); |
| 216 |
> |
/* clump the beams */ |
| 217 |
> |
clumpbeams(hinp, 0, BKBSIZE*1024, xferclump); |
| 218 |
> |
/* clean up */ |
| 219 |
|
hddone(hinp); |
| 220 |
|
hddone(hout); |
| 221 |
|
} |
| 222 |
|
|
| 223 |
|
|
| 224 |
+ |
void |
| 225 |
|
eputs(s) /* put error message to stderr */ |
| 226 |
|
register char *s; |
| 227 |
|
{ |
| 241 |
|
} |
| 242 |
|
|
| 243 |
|
|
| 244 |
+ |
void |
| 245 |
|
quit(code) /* exit the program gracefully */ |
| 246 |
|
int code; |
| 247 |
|
{ |
