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 |
|
* Routines for tracking beam compuatations |
6 |
|
*/ |
7 |
|
|
8 |
+ |
#include <string.h> |
9 |
+ |
|
10 |
|
#include "rholo.h" |
11 |
< |
#include <sys/types.h> |
11 |
> |
#include "view.h" |
12 |
|
|
13 |
|
#ifndef NFRAG2CHUNK |
14 |
|
#define NFRAG2CHUNK 4096 /* number of fragments to start chunking */ |
25 |
|
|
26 |
|
extern time_t time(); |
27 |
|
|
28 |
+ |
int chunkycmp = 0; /* clump beams together on disk */ |
29 |
+ |
|
30 |
|
static PACKHEAD *complist=NULL; /* list of beams to compute */ |
31 |
|
static int complen=0; /* length of complist */ |
32 |
|
static int listpos=0; /* current list position for next_packet */ |
33 |
|
static int lastin= -1; /* last ordered position in list */ |
33 |
– |
static int chunky=0; /* clump beams together on disk */ |
34 |
|
|
35 |
|
|
36 |
|
int |
40 |
|
BEAMI *bip0, *bip1; |
41 |
|
register long c; |
42 |
|
/* first check desired quantities */ |
43 |
< |
if (chunky) |
43 |
> |
if (chunkycmp) |
44 |
|
c = rchunk(b1->nr)*(rchunk(b0->nc)+1L) - |
45 |
|
rchunk(b0->nr)*(rchunk(b1->nc)+1L); |
46 |
|
else |
77 |
|
} |
78 |
|
|
79 |
|
|
80 |
< |
int |
80 |
> |
void |
81 |
|
dispbeam(b, hb) /* display a holodeck beam */ |
82 |
|
register BEAM *b; |
83 |
|
register HDBEAMI *hb; |
90 |
|
if (b->nrm > n) { /* (re)allocate packet holder */ |
91 |
|
n = b->nrm; |
92 |
|
if (p == NULL) p = (PACKHEAD *)malloc(packsiz(n)); |
93 |
< |
else p = (PACKHEAD *)realloc((char *)p, packsiz(n)); |
94 |
< |
if (p == NULL) |
95 |
< |
error(SYSTEM, "out of memory in dispbeam"); |
93 |
> |
else p = (PACKHEAD *)realloc((void *)p, packsiz(n)); |
94 |
> |
CHECK(p==NULL, SYSTEM, "out of memory in dispbeam"); |
95 |
|
} |
96 |
|
/* assign packet fields */ |
97 |
< |
bcopy((char *)hdbray(b), (char *)packra(p), b->nrm*sizeof(RAYVAL)); |
97 |
> |
memcpy((void *)packra(p), (void *)hdbray(b), b->nrm*sizeof(RAYVAL)); |
98 |
|
p->nr = p->nc = b->nrm; |
99 |
|
for (p->hd = 0; hdlist[p->hd] != hb->h; p->hd++) |
100 |
|
if (hdlist[p->hd] == NULL) |
101 |
|
error(CONSISTENCY, "unregistered holodeck in dispbeam"); |
102 |
|
p->bi = hb->b; |
103 |
|
disp_packet(p); /* display it */ |
104 |
+ |
if (n >= 1024) { /* free ridiculous packets */ |
105 |
+ |
free((void *)p); |
106 |
+ |
p = NULL; n = 0; |
107 |
+ |
} |
108 |
|
} |
109 |
|
|
110 |
|
|
120 |
|
/* search for common members */ |
121 |
|
for (csm = clist+nents; csm-- > clist; ) |
122 |
|
csm->nc = -1; |
123 |
< |
qsort((char *)clist, nents, sizeof(PACKHEAD), beamidcmp); |
123 |
> |
qsort((void *)clist, nents, sizeof(PACKHEAD), beamidcmp); |
124 |
|
for (i = 0; i < complen; i++) { |
125 |
< |
csm = (PACKHEAD *)bsearch((char *)(complist+i), (char *)clist, |
125 |
> |
csm = (PACKHEAD *)bsearch((void *)(complist+i), (void *)clist, |
126 |
|
nents, sizeof(PACKHEAD), beamidcmp); |
127 |
|
if (csm == NULL) |
128 |
|
continue; |
133 |
|
complist[i].nr += csm->nr; |
134 |
|
csm->nr = 0; |
135 |
|
break; |
136 |
+ |
case BS_MAX: /* maximum of counts */ |
137 |
+ |
if (csm->nr > complist[i].nr) |
138 |
+ |
complist[i].nr = csm->nr; |
139 |
+ |
csm->nr = 0; |
140 |
+ |
break; |
141 |
|
case BS_ADJ: /* reset count */ |
142 |
|
complist[i].nr = csm->nr; |
143 |
|
csm->nr = 0; |
161 |
|
case BS_NEW: /* new computation set */ |
162 |
|
listpos = 0; lastin = -1; |
163 |
|
if (complen) /* free old list */ |
164 |
< |
free((char *)complist); |
164 |
> |
free((void *)complist); |
165 |
|
complist = NULL; |
166 |
|
if (!(complen = nents)) |
167 |
|
return; |
168 |
|
complist = (PACKHEAD *)malloc(nents*sizeof(PACKHEAD)); |
169 |
|
if (complist == NULL) |
170 |
|
goto memerr; |
171 |
< |
bcopy((char *)clist, (char *)complist, nents*sizeof(PACKHEAD)); |
171 |
> |
memcpy((void *)complist, (void *)clist, nents*sizeof(PACKHEAD)); |
172 |
|
break; |
173 |
|
case BS_ADD: /* add to computation set */ |
174 |
+ |
case BS_MAX: /* maximum of quantities */ |
175 |
|
case BS_ADJ: /* adjust set quantities */ |
176 |
|
if (nents <= 0) |
177 |
|
return; |
178 |
|
sortcomplist(); /* sort updated list & new entries */ |
179 |
< |
qsort((char *)clist, nents, sizeof(PACKHEAD), beamcmp); |
179 |
> |
qsort((void *)clist, nents, sizeof(PACKHEAD), beamcmp); |
180 |
|
/* what can't we satisfy? */ |
181 |
|
for (i = nents, csm = clist; i-- && csm->nr > csm->nc; csm++) |
182 |
|
; |
183 |
|
n = csm - clist; |
184 |
< |
if (op == BS_ADJ) { /* don't regenerate adjusted beams */ |
184 |
> |
if (op != BS_ADD) { /* don't regenerate adjusted beams */ |
185 |
|
for (++i; i-- && csm->nr > 0; csm++) |
186 |
|
; |
187 |
|
nents = csm - clist; |
195 |
|
/* merge lists */ |
196 |
|
mergeclists(newlist, clist, n, complist, complen); |
197 |
|
if (complen) |
198 |
< |
free((char *)complist); |
198 |
> |
free((void *)complist); |
199 |
|
complist = newlist; |
200 |
|
complen += n; |
201 |
|
} |
216 |
|
hbarr[i].b = clist[i].bi; |
217 |
|
} |
218 |
|
hdloadbeams(hbarr, nents, dispbeam); |
219 |
< |
free((char *)hbarr); |
219 |
> |
free((void *)hbarr); |
220 |
|
if (hdfragflags&FF_READ) { |
221 |
|
listpos = 0; |
222 |
|
lastin = -1; /* need to re-sort list */ |
260 |
|
} |
261 |
|
|
262 |
|
|
263 |
< |
init_global() /* initialize global ray computation */ |
263 |
> |
ambient_list() /* compute ambient beam list */ |
264 |
|
{ |
265 |
< |
long wtotal = 0; |
265 |
> |
int32 wtotal, minrt; |
266 |
|
double frac; |
267 |
|
int i; |
268 |
|
register int j, k; |
269 |
< |
/* free old list and empty queue */ |
261 |
< |
if (complen > 0) { |
262 |
< |
free((char *)complist); |
263 |
< |
done_packets(flush_queue()); |
264 |
< |
} |
265 |
< |
/* reseed random number generator */ |
266 |
< |
srandom(time(NULL)); |
267 |
< |
/* allocate beam list */ |
269 |
> |
|
270 |
|
complen = 0; |
271 |
|
for (j = 0; hdlist[j] != NULL; j++) |
272 |
|
complen += nbeams(hdlist[j]); |
273 |
|
complist = (PACKHEAD *)malloc(complen*sizeof(PACKHEAD)); |
274 |
< |
if (complist == NULL) |
273 |
< |
error(SYSTEM, "out of memory in init_global"); |
274 |
> |
CHECK(complist==NULL, SYSTEM, "out of memory in ambient_list"); |
275 |
|
/* compute beam weights */ |
276 |
< |
k = 0; |
276 |
> |
k = 0; wtotal = 0; |
277 |
|
for (j = 0; hdlist[j] != NULL; j++) { |
278 |
|
frac = 512. * VLEN(hdlist[j]->wg[0]) * |
279 |
|
VLEN(hdlist[j]->wg[1]) * |
286 |
|
wtotal += complist[k++].nr; |
287 |
|
} |
288 |
|
} |
289 |
< |
/* adjust weights */ |
289 |
> |
/* adjust sample weights */ |
290 |
|
if (vdef(DISKSPACE)) |
291 |
|
frac = 1024.*1024.*vflt(DISKSPACE) / (wtotal*sizeof(RAYVAL)); |
292 |
|
else |
293 |
< |
frac = 1024.*1024.*16384. / (wtotal*sizeof(RAYVAL)); |
294 |
< |
while (k--) |
295 |
< |
complist[k].nr = frac*complist[k].nr + 0.5; |
296 |
< |
listpos = 0; lastin = -1; /* perform initial sort */ |
297 |
< |
sortcomplist(); |
293 |
> |
frac = 1024.*1024.*2048. / (wtotal*sizeof(RAYVAL)); |
294 |
> |
minrt = .02*frac*wtotal/complen + .5; /* heuristic mimimum */ |
295 |
> |
if (minrt > RPACKSIZ) |
296 |
> |
minrt = RPACKSIZ; |
297 |
> |
for (k = complen; k--; ) |
298 |
> |
if ((complist[k].nr = frac*complist[k].nr + 0.5) < minrt) |
299 |
> |
complist[k].nr = minrt; |
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((void *)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((void *)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 |
|
} |
376 |
|
|
377 |
|
if (complen <= 0) /* check to see if there is even a list */ |
378 |
|
return; |
379 |
< |
if (!chunky) /* check to see if fragment list is full */ |
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 |
342 |
– |
chunky++; /* use "chunky" comparison */ |
343 |
– |
lastin = -1; /* need to re-sort list */ |
390 |
|
} |
345 |
– |
#ifdef DEBUG |
346 |
– |
else |
347 |
– |
fprintf(stderr, "sortcomplist: %d fragments\n", |
348 |
– |
listlen); |
349 |
– |
#endif |
391 |
|
if (lastin < 0 || listpos*4 >= complen*3) |
392 |
< |
qsort((char *)complist, complen, sizeof(PACKHEAD), beamcmp); |
392 |
> |
qsort((void *)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) |
396 |
< |
error(SYSTEM, "out of memory in sortcomplist"); |
397 |
< |
bcopy((char *)complist,(char *)list2,listpos*sizeof(PACKHEAD)); |
357 |
< |
qsort((char *)list2, listpos, sizeof(PACKHEAD), beamcmp); |
395 |
> |
CHECK(list2==NULL, SYSTEM, "out of memory in sortcomplist"); |
396 |
> |
memcpy((void *)list2,(void *)complist,listpos*sizeof(PACKHEAD)); |
397 |
> |
qsort((void *)list2, listpos, sizeof(PACKHEAD), beamcmp); |
398 |
|
mergeclists(complist, list2, listpos, |
399 |
|
complist+listpos, complen-listpos); |
400 |
< |
free((char *)list2); |
400 |
> |
free((void *)list2); |
401 |
|
} |
402 |
|
/* drop satisfied requests */ |
403 |
|
for (i = complen; i-- && complist[i].nr <= complist[i].nc; ) |
404 |
|
; |
405 |
|
if (i < 0) { |
406 |
< |
free((char *)complist); |
406 |
> |
free((void *)complist); |
407 |
|
complist = NULL; |
408 |
|
complen = 0; |
409 |
|
} else if (i < complen-1) { |
410 |
< |
list2 = (PACKHEAD *)realloc((char *)complist, |
410 |
> |
list2 = (PACKHEAD *)realloc((void *)complist, |
411 |
|
(i+1)*sizeof(PACKHEAD)); |
412 |
|
if (list2 != NULL) |
413 |
|
complist = list2; |