9 |
|
*/ |
10 |
|
|
11 |
|
#include "rholo.h" |
12 |
+ |
#include "view.h" |
13 |
+ |
#include <sys/types.h> |
14 |
|
|
15 |
+ |
#ifndef NFRAG2CHUNK |
16 |
+ |
#define NFRAG2CHUNK 4096 /* number of fragments to start chunking */ |
17 |
+ |
#endif |
18 |
+ |
|
19 |
+ |
#ifndef abs |
20 |
|
#define abs(x) ((x) > 0 ? (x) : -(x)) |
21 |
+ |
#endif |
22 |
+ |
#ifndef sgn |
23 |
|
#define sgn(x) ((x) > 0 ? 1 : (x) < 0 ? -1 : 0) |
24 |
+ |
#endif |
25 |
|
|
26 |
+ |
#define rchunk(n) (((n)+(RPACKSIZ/2))/RPACKSIZ) |
27 |
+ |
|
28 |
+ |
extern time_t time(); |
29 |
+ |
|
30 |
+ |
int chunkycmp = 0; /* clump beams together on disk */ |
31 |
+ |
|
32 |
|
static PACKHEAD *complist=NULL; /* list of beams to compute */ |
33 |
|
static int complen=0; /* length of complist */ |
34 |
|
static int listpos=0; /* current list position for next_packet */ |
39 |
|
beamcmp(b0, b1) /* comparison for compute order */ |
40 |
|
register PACKHEAD *b0, *b1; |
41 |
|
{ |
42 |
< |
return( b1->nr*(b0->nc+1) - b0->nr*(b1->nc+1) ); |
42 |
> |
BEAMI *bip0, *bip1; |
43 |
> |
register long c; |
44 |
> |
/* first check desired quantities */ |
45 |
> |
if (chunkycmp) |
46 |
> |
c = rchunk(b1->nr)*(rchunk(b0->nc)+1L) - |
47 |
> |
rchunk(b0->nr)*(rchunk(b1->nc)+1L); |
48 |
> |
else |
49 |
> |
c = b1->nr*(b0->nc+1L) - b0->nr*(b1->nc+1L); |
50 |
> |
if (c > 0) return(1); |
51 |
> |
if (c < 0) return(-1); |
52 |
> |
/* only one file, so skip the following: */ |
53 |
> |
#if 0 |
54 |
> |
/* next, check file descriptors */ |
55 |
> |
c = hdlist[b0->hd]->fd - hdlist[b1->hd]->fd; |
56 |
> |
if (c) return(c); |
57 |
> |
#endif |
58 |
> |
/* finally, check file positions */ |
59 |
> |
bip0 = &hdlist[b0->hd]->bi[b0->bi]; |
60 |
> |
bip1 = &hdlist[b1->hd]->bi[b1->bi]; |
61 |
> |
/* put diskless beams last */ |
62 |
> |
if (!bip0->nrd) |
63 |
> |
return(bip1->nrd > 0); |
64 |
> |
if (!bip1->nrd) |
65 |
> |
return(-1); |
66 |
> |
c = bip0->fo - bip1->fo; |
67 |
> |
return(c < 0 ? -1 : c > 0); |
68 |
|
} |
69 |
|
|
70 |
|
|
93 |
|
n = b->nrm; |
94 |
|
if (p == NULL) p = (PACKHEAD *)malloc(packsiz(n)); |
95 |
|
else p = (PACKHEAD *)realloc((char *)p, packsiz(n)); |
96 |
< |
if (p == NULL) |
56 |
< |
error(SYSTEM, "out of memory in dispbeam"); |
96 |
> |
CHECK(p==NULL, SYSTEM, "out of memory in dispbeam"); |
97 |
|
} |
98 |
|
/* assign packet fields */ |
99 |
|
bcopy((char *)hdbray(b), (char *)packra(p), b->nrm*sizeof(RAYVAL)); |
103 |
|
error(CONSISTENCY, "unregistered holodeck in dispbeam"); |
104 |
|
p->bi = hb->b; |
105 |
|
disp_packet(p); /* display it */ |
106 |
+ |
if (n >= 1024) { /* free ridiculous packets */ |
107 |
+ |
free((char *)p); |
108 |
+ |
p = NULL; n = 0; |
109 |
+ |
} |
110 |
|
} |
111 |
|
|
112 |
|
|
120 |
|
register PACKHEAD *csm; |
121 |
|
register int i; |
122 |
|
/* search for common members */ |
79 |
– |
qsort((char *)clist, nents, sizeof(PACKHEAD), beamidcmp); |
123 |
|
for (csm = clist+nents; csm-- > clist; ) |
124 |
|
csm->nc = -1; |
125 |
+ |
qsort((char *)clist, nents, sizeof(PACKHEAD), beamidcmp); |
126 |
|
for (i = 0; i < complen; i++) { |
127 |
|
csm = (PACKHEAD *)bsearch((char *)(complist+i), (char *)clist, |
128 |
|
nents, sizeof(PACKHEAD), beamidcmp); |
135 |
|
complist[i].nr += csm->nr; |
136 |
|
csm->nr = 0; |
137 |
|
break; |
138 |
+ |
case BS_MAX: /* maximum of counts */ |
139 |
+ |
if (csm->nr > complist[i].nr) |
140 |
+ |
complist[i].nr = csm->nr; |
141 |
+ |
csm->nr = 0; |
142 |
+ |
break; |
143 |
|
case BS_ADJ: /* reset count */ |
144 |
|
complist[i].nr = csm->nr; |
145 |
|
csm->nr = 0; |
173 |
|
bcopy((char *)clist, (char *)complist, nents*sizeof(PACKHEAD)); |
174 |
|
break; |
175 |
|
case BS_ADD: /* add to computation set */ |
176 |
+ |
case BS_MAX: /* maximum of quantities */ |
177 |
|
case BS_ADJ: /* adjust set quantities */ |
178 |
|
if (nents <= 0) |
179 |
|
return; |
183 |
|
for (i = nents, csm = clist; i-- && csm->nr > csm->nc; csm++) |
184 |
|
; |
185 |
|
n = csm - clist; |
186 |
< |
if (op == BS_ADJ) { /* don't regenerate adjusted beams */ |
186 |
> |
if (op != BS_ADD) { /* don't regenerate adjusted beams */ |
187 |
|
for (++i; i-- && csm->nr > 0; csm++) |
188 |
|
; |
189 |
|
nents = csm - clist; |
209 |
|
default: |
210 |
|
error(CONSISTENCY, "bundle_set called with unknown operation"); |
211 |
|
} |
212 |
< |
if (outdev == NULL) /* nothing to display? */ |
212 |
> |
if (outdev == NULL || !nents) /* nothing to display? */ |
213 |
|
return; |
214 |
|
/* load and display beams we have */ |
215 |
|
hbarr = (HDBEAMI *)malloc(nents*sizeof(HDBEAMI)); |
219 |
|
} |
220 |
|
hdloadbeams(hbarr, nents, dispbeam); |
221 |
|
free((char *)hbarr); |
222 |
+ |
if (hdfragflags&FF_READ) { |
223 |
+ |
listpos = 0; |
224 |
+ |
lastin = -1; /* need to re-sort list */ |
225 |
+ |
} |
226 |
|
return; |
227 |
|
memerr: |
228 |
|
error(SYSTEM, "out of memory in bundle_set"); |
262 |
|
} |
263 |
|
|
264 |
|
|
265 |
< |
init_global() /* initialize global ray computation */ |
265 |
> |
ambient_list() /* compute ambient beam list */ |
266 |
|
{ |
267 |
|
long wtotal = 0; |
268 |
|
double frac; |
269 |
|
int i; |
270 |
|
register int j, k; |
271 |
< |
/* free old list and empty queue */ |
218 |
< |
if (complen > 0) { |
219 |
< |
free((char *)complist); |
220 |
< |
done_packets(flush_queue()); |
221 |
< |
} |
222 |
< |
/* allocate beam list */ |
271 |
> |
|
272 |
|
complen = 0; |
273 |
|
for (j = 0; hdlist[j] != NULL; j++) |
274 |
|
complen += nbeams(hdlist[j]); |
275 |
|
complist = (PACKHEAD *)malloc(complen*sizeof(PACKHEAD)); |
276 |
< |
if (complist == NULL) |
228 |
< |
error(SYSTEM, "out of memory in init_global"); |
276 |
> |
CHECK(complist==NULL, SYSTEM, "out of memory in ambient_list"); |
277 |
|
/* compute beam weights */ |
278 |
|
k = 0; |
279 |
|
for (j = 0; hdlist[j] != NULL; j++) { |
288 |
|
wtotal += complist[k++].nr; |
289 |
|
} |
290 |
|
} |
291 |
< |
/* adjust weights */ |
291 |
> |
/* adjust sample weights */ |
292 |
|
if (vdef(DISKSPACE)) |
293 |
< |
frac = 1024.*1024.*vflt(DISKSPACE) / (wtotal*sizeof(RAYVAL)); |
293 |
> |
frac = 1024.*1024.*vflt(DISKSPACE) / |
294 |
> |
(wtotal*sizeof(RAYVAL)); |
295 |
|
else |
296 |
|
frac = 1024.*1024.*16384. / (wtotal*sizeof(RAYVAL)); |
297 |
< |
while (k--) |
298 |
< |
complist[k].nr = frac*complist[k].nr + 0.5; |
299 |
< |
listpos = 0; lastin = -1; /* perform initial sort */ |
300 |
< |
sortcomplist(); |
297 |
> |
if (frac > 1.11 || frac < 0.9) |
298 |
> |
for (k = complen; k--; ) |
299 |
> |
complist[k].nr = frac*complist[k].nr + 0.5; |
300 |
> |
listpos = 0; lastin = -1; /* flag initial sort */ |
301 |
|
} |
302 |
|
|
303 |
|
|
304 |
+ |
view_list(fp) /* assign beam priority from view list */ |
305 |
+ |
FILE *fp; |
306 |
+ |
{ |
307 |
+ |
double pa = 1.; |
308 |
+ |
VIEW curview; |
309 |
+ |
int xr, yr; |
310 |
+ |
char *err; |
311 |
+ |
BEAMLIST blist; |
312 |
+ |
|
313 |
+ |
copystruct(&curview, &stdview); |
314 |
+ |
while (nextview(&curview, fp) != EOF) { |
315 |
+ |
if ((err = setview(&curview)) != NULL) { |
316 |
+ |
error(WARNING, err); |
317 |
+ |
continue; |
318 |
+ |
} |
319 |
+ |
xr = yr = 1024; |
320 |
+ |
normaspect(viewaspect(&curview), &pa, &xr, &yr); |
321 |
+ |
viewbeams(&curview, xr, yr, &blist); |
322 |
+ |
bundle_set(BS_MAX, blist.bl, blist.nb); |
323 |
+ |
free((char *)blist.bl); |
324 |
+ |
} |
325 |
+ |
} |
326 |
+ |
|
327 |
+ |
|
328 |
+ |
init_global() /* initialize global ray computation */ |
329 |
+ |
{ |
330 |
+ |
register int k; |
331 |
+ |
/* free old list and empty queue */ |
332 |
+ |
if (complen > 0) { |
333 |
+ |
free((char *)complist); |
334 |
+ |
done_packets(flush_queue()); |
335 |
+ |
} |
336 |
+ |
/* reseed random number generator */ |
337 |
+ |
srandom(time(NULL)); |
338 |
+ |
/* allocate beam list */ |
339 |
+ |
if (readinp) |
340 |
+ |
view_list(stdin); |
341 |
+ |
else |
342 |
+ |
ambient_list(); |
343 |
+ |
/* no view vicinity */ |
344 |
+ |
myeye.rng = 0; |
345 |
+ |
} |
346 |
+ |
|
347 |
+ |
|
348 |
|
mergeclists(cdest, cl1, n1, cl2, n2) /* merge two sorted lists */ |
349 |
|
register PACKHEAD *cdest; |
350 |
|
register PACKHEAD *cl1, *cl2; |
371 |
|
sortcomplist() /* fix our list order */ |
372 |
|
{ |
373 |
|
PACKHEAD *list2; |
374 |
+ |
int listlen; |
375 |
|
register int i; |
376 |
|
|
377 |
|
if (complen <= 0) /* check to see if there is even a list */ |
378 |
|
return; |
379 |
+ |
if (!chunkycmp) /* check to see if fragment list is full */ |
380 |
+ |
if (!hdfragOK(hdlist[0]->fd, &listlen, NULL) |
381 |
+ |
#if NFRAG2CHUNK |
382 |
+ |
|| listlen >= NFRAG2CHUNK |
383 |
+ |
#endif |
384 |
+ |
) { |
385 |
+ |
chunkycmp++; /* use "chunky" comparison */ |
386 |
+ |
lastin = -1; /* need to re-sort list */ |
387 |
+ |
#ifdef DEBUG |
388 |
+ |
error(WARNING, "using chunky comparison mode"); |
389 |
+ |
#endif |
390 |
+ |
} |
391 |
|
if (lastin < 0 || listpos*4 >= complen*3) |
392 |
|
qsort((char *)complist, complen, sizeof(PACKHEAD), beamcmp); |
393 |
|
else if (listpos) { /* else sort and merge sublist */ |
394 |
|
list2 = (PACKHEAD *)malloc(listpos*sizeof(PACKHEAD)); |
395 |
< |
if (list2 == NULL) |
290 |
< |
error(SYSTEM, "out of memory in sortcomplist"); |
395 |
> |
CHECK(list2==NULL, SYSTEM, "out of memory in sortcomplist"); |
396 |
|
bcopy((char *)complist,(char *)list2,listpos*sizeof(PACKHEAD)); |
397 |
|
qsort((char *)list2, listpos, sizeof(PACKHEAD), beamcmp); |
398 |
|
mergeclists(complist, list2, listpos, |
409 |
|
} else if (i < complen-1) { |
410 |
|
list2 = (PACKHEAD *)realloc((char *)complist, |
411 |
|
(i+1)*sizeof(PACKHEAD)); |
412 |
< |
if (list2 != NULL) { |
412 |
> |
if (list2 != NULL) |
413 |
|
complist = list2; |
414 |
< |
complen = i+1; |
310 |
< |
} |
414 |
> |
complen = i+1; |
415 |
|
} |
416 |
|
listpos = 0; lastin = i; |
417 |
|
} |
422 |
|
* more or less evenly distributed, such that computing a packet causes |
423 |
|
* a given bundle to move way down in the computation order. We keep |
424 |
|
* track of where the computed bundle with the highest priority would end |
425 |
< |
* up, and if we get further in our compute list than this, we resort the |
425 |
> |
* up, and if we get further in our compute list than this, we re-sort the |
426 |
|
* list and start again from the beginning. Since |
427 |
|
* a merge sort is used, the sorting costs are minimal. |
428 |
|
*/ |
442 |
|
p->nr = complist[listpos].nr - p->nc; |
443 |
|
if (p->nr <= 0) |
444 |
|
return(0); |
445 |
< |
#ifdef DEBUG |
446 |
< |
if (n < 1 | n > RPACKSIZ) |
343 |
< |
error(CONSISTENCY, "next_packet called with bad n value"); |
344 |
< |
#endif |
445 |
> |
DCHECK(n < 1 | n > RPACKSIZ, |
446 |
> |
CONSISTENCY, "next_packet called with bad n value"); |
447 |
|
if (p->nr > n) |
448 |
|
p->nr = n; |
449 |
|
complist[listpos].nc += p->nr; /* find where this one would go */ |
450 |
+ |
if (hdgetbeam(hdlist[p->hd], p->bi) != NULL) |
451 |
+ |
hdfreefrag(hdlist[p->hd], p->bi); |
452 |
|
while (lastin > listpos && |
453 |
|
beamcmp(complist+lastin, complist+listpos) > 0) |
454 |
|
lastin--; |