5 |
|
* Routines for tracking beam compuatations |
6 |
|
*/ |
7 |
|
|
8 |
< |
#include "rholo.h" |
8 |
> |
#include <time.h> |
9 |
> |
#include <string.h> |
10 |
> |
#include <stdio.h> |
11 |
> |
|
12 |
|
#include "view.h" |
13 |
+ |
#include "rholo.h" |
14 |
|
|
15 |
|
#ifndef NFRAG2CHUNK |
16 |
|
#define NFRAG2CHUNK 4096 /* number of fragments to start chunking */ |
25 |
|
|
26 |
|
#define rchunk(n) (((n)+(RPACKSIZ/2))/RPACKSIZ) |
27 |
|
|
24 |
– |
extern time_t time(); |
25 |
– |
|
28 |
|
int chunkycmp = 0; /* clump beams together on disk */ |
29 |
|
|
30 |
|
static PACKHEAD *complist=NULL; /* list of beams to compute */ |
32 |
|
static int listpos=0; /* current list position for next_packet */ |
33 |
|
static int lastin= -1; /* last ordered position in list */ |
34 |
|
|
35 |
+ |
static void sortcomplist(void); |
36 |
+ |
static void mergeclists(PACKHEAD *cdest, PACKHEAD *cl1, int n1, PACKHEAD *cl2, int n2); |
37 |
+ |
static void view_list(FILE *fp); |
38 |
+ |
static void ambient_list(void); |
39 |
+ |
static double beamvolume(HOLO *hp, int bi); |
40 |
+ |
static void dispbeam(BEAM *b, HDBEAMI *hb); |
41 |
|
|
42 |
< |
int |
42 |
> |
|
43 |
> |
|
44 |
> |
static int |
45 |
|
beamcmp(b0, b1) /* comparison for compute order */ |
46 |
|
register PACKHEAD *b0, *b1; |
47 |
|
{ |
85 |
|
} |
86 |
|
|
87 |
|
|
88 |
< |
int |
89 |
< |
dispbeam(b, hb) /* display a holodeck beam */ |
90 |
< |
register BEAM *b; |
91 |
< |
register HDBEAMI *hb; |
88 |
> |
static void |
89 |
> |
dispbeam( /* display a holodeck beam */ |
90 |
> |
register BEAM *b, |
91 |
> |
register HDBEAMI *hb |
92 |
> |
) |
93 |
|
{ |
94 |
|
static int n = 0; |
95 |
|
static PACKHEAD *p = NULL; |
103 |
|
CHECK(p==NULL, SYSTEM, "out of memory in dispbeam"); |
104 |
|
} |
105 |
|
/* assign packet fields */ |
106 |
< |
bcopy((void *)hdbray(b), (void *)packra(p), b->nrm*sizeof(RAYVAL)); |
106 |
> |
memcpy((void *)packra(p), (void *)hdbray(b), b->nrm*sizeof(RAYVAL)); |
107 |
|
p->nr = p->nc = b->nrm; |
108 |
|
for (p->hd = 0; hdlist[p->hd] != hb->h; p->hd++) |
109 |
|
if (hdlist[p->hd] == NULL) |
117 |
|
} |
118 |
|
|
119 |
|
|
120 |
< |
bundle_set(op, clist, nents) /* bundle set operation */ |
121 |
< |
int op; |
122 |
< |
PACKHEAD *clist; |
123 |
< |
int nents; |
120 |
> |
extern void |
121 |
> |
bundle_set( /* bundle set operation */ |
122 |
> |
int op, |
123 |
> |
PACKHEAD *clist, |
124 |
> |
int nents |
125 |
> |
) |
126 |
|
{ |
127 |
|
int oldnr, n; |
128 |
|
HDBEAMI *hbarr; |
179 |
|
complist = (PACKHEAD *)malloc(nents*sizeof(PACKHEAD)); |
180 |
|
if (complist == NULL) |
181 |
|
goto memerr; |
182 |
< |
bcopy((void *)clist, (void *)complist, nents*sizeof(PACKHEAD)); |
182 |
> |
memcpy((void *)complist, (void *)clist, nents*sizeof(PACKHEAD)); |
183 |
|
break; |
184 |
|
case BS_ADD: /* add to computation set */ |
185 |
|
case BS_MAX: /* maximum of quantities */ |
238 |
|
} |
239 |
|
|
240 |
|
|
241 |
< |
double |
242 |
< |
beamvolume(hp, bi) /* compute approximate volume of a beam */ |
243 |
< |
HOLO *hp; |
244 |
< |
int bi; |
241 |
> |
static double |
242 |
> |
beamvolume( /* compute approximate volume of a beam */ |
243 |
> |
HOLO *hp, |
244 |
> |
int bi |
245 |
> |
) |
246 |
|
{ |
247 |
|
GCOORD gc[2]; |
248 |
|
FVECT cp[4], edgeA, edgeB, cent[2]; |
249 |
< |
FVECT v, crossp[2], diffv; |
249 |
> |
FVECT crossp[2], diffv; |
250 |
|
double vol[2]; |
251 |
|
register int i; |
252 |
|
/* get grid coordinates */ |
272 |
|
} |
273 |
|
|
274 |
|
|
275 |
< |
ambient_list() /* compute ambient beam list */ |
275 |
> |
static void |
276 |
> |
ambient_list(void) /* compute ambient beam list */ |
277 |
|
{ |
278 |
< |
int4 wtotal, minrt; |
278 |
> |
int32 wtotal, minrt; |
279 |
|
double frac; |
280 |
|
int i; |
281 |
|
register int j, k; |
314 |
|
} |
315 |
|
|
316 |
|
|
317 |
< |
view_list(fp) /* assign beam priority from view list */ |
318 |
< |
FILE *fp; |
317 |
> |
static void |
318 |
> |
view_list( /* assign beam priority from view list */ |
319 |
> |
FILE *fp |
320 |
> |
) |
321 |
|
{ |
322 |
|
double pa = 1.; |
323 |
|
VIEW curview; |
325 |
|
char *err; |
326 |
|
BEAMLIST blist; |
327 |
|
|
328 |
< |
copystruct(&curview, &stdview); |
328 |
> |
curview = stdview; |
329 |
|
while (nextview(&curview, fp) != EOF) { |
330 |
|
if ((err = setview(&curview)) != NULL) { |
331 |
|
error(WARNING, err); |
340 |
|
} |
341 |
|
|
342 |
|
|
343 |
< |
init_global() /* initialize global ray computation */ |
343 |
> |
extern void |
344 |
> |
init_global(void) /* initialize global ray computation */ |
345 |
|
{ |
328 |
– |
register int k; |
346 |
|
/* free old list and empty queue */ |
347 |
|
if (complen > 0) { |
348 |
|
free((void *)complist); |
360 |
|
} |
361 |
|
|
362 |
|
|
363 |
< |
mergeclists(cdest, cl1, n1, cl2, n2) /* merge two sorted lists */ |
364 |
< |
register PACKHEAD *cdest; |
365 |
< |
register PACKHEAD *cl1, *cl2; |
366 |
< |
int n1, n2; |
363 |
> |
static void |
364 |
> |
mergeclists( /* merge two sorted lists */ |
365 |
> |
register PACKHEAD *cdest, |
366 |
> |
register PACKHEAD *cl1, |
367 |
> |
int n1, |
368 |
> |
register PACKHEAD *cl2, |
369 |
> |
int n2 |
370 |
> |
) |
371 |
|
{ |
372 |
|
register int cmp; |
373 |
|
|
376 |
|
else if (!n2) cmp = -1; |
377 |
|
else cmp = beamcmp(cl1, cl2); |
378 |
|
if (cmp > 0) { |
379 |
< |
copystruct(cdest, cl2); |
379 |
> |
*cdest = *cl2; |
380 |
|
cl2++; n2--; |
381 |
|
} else { |
382 |
< |
copystruct(cdest, cl1); |
382 |
> |
*cdest = *cl1; |
383 |
|
cl1++; n1--; |
384 |
|
} |
385 |
|
cdest++; |
387 |
|
} |
388 |
|
|
389 |
|
|
390 |
< |
sortcomplist() /* fix our list order */ |
390 |
> |
static void |
391 |
> |
sortcomplist(void) /* fix our list order */ |
392 |
|
{ |
393 |
|
PACKHEAD *list2; |
394 |
|
int listlen; |
413 |
|
else if (listpos) { /* else sort and merge sublist */ |
414 |
|
list2 = (PACKHEAD *)malloc(listpos*sizeof(PACKHEAD)); |
415 |
|
CHECK(list2==NULL, SYSTEM, "out of memory in sortcomplist"); |
416 |
< |
bcopy((void *)complist,(void *)list2,listpos*sizeof(PACKHEAD)); |
416 |
> |
memcpy((void *)list2,(void *)complist,listpos*sizeof(PACKHEAD)); |
417 |
|
qsort((void *)list2, listpos, sizeof(PACKHEAD), beamcmp); |
418 |
|
mergeclists(complist, list2, listpos, |
419 |
|
complist+listpos, complen-listpos); |
446 |
|
* list and start again from the beginning. Since |
447 |
|
* a merge sort is used, the sorting costs are minimal. |
448 |
|
*/ |
449 |
< |
next_packet(p, n) /* prepare packet for computation */ |
450 |
< |
register PACKET *p; |
451 |
< |
int n; |
449 |
> |
extern int |
450 |
> |
next_packet( /* prepare packet for computation */ |
451 |
> |
register PACKET *p, |
452 |
> |
int n |
453 |
> |
) |
454 |
|
{ |
431 |
– |
register int i; |
432 |
– |
|
455 |
|
if (listpos > lastin) /* time to sort the list */ |
456 |
|
sortcomplist(); |
457 |
|
if (complen <= 0) |