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 "view.h" |
13 |
– |
#include <sys/types.h> |
12 |
|
|
13 |
|
#ifndef NFRAG2CHUNK |
14 |
|
#define NFRAG2CHUNK 4096 /* number of fragments to start chunking */ |
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)); |
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) |
102 |
|
p->bi = hb->b; |
103 |
|
disp_packet(p); /* display it */ |
104 |
|
if (n >= 1024) { /* free ridiculous packets */ |
105 |
< |
free((char *)p); |
105 |
> |
free((void *)p); |
106 |
|
p = NULL; n = 0; |
107 |
|
} |
108 |
|
} |
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; |
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 */ |
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 |
|
; |
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 */ |
262 |
|
|
263 |
|
ambient_list() /* compute ambient beam list */ |
264 |
|
{ |
265 |
< |
int4 wtotal, minrt; |
265 |
> |
int32 wtotal, minrt; |
266 |
|
double frac; |
267 |
|
int i; |
268 |
|
register int j, k; |
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); |
323 |
> |
free((void *)blist.bl); |
324 |
|
} |
325 |
|
} |
326 |
|
|
330 |
|
register int k; |
331 |
|
/* free old list and empty queue */ |
332 |
|
if (complen > 0) { |
333 |
< |
free((char *)complist); |
333 |
> |
free((void *)complist); |
334 |
|
done_packets(flush_queue()); |
335 |
|
} |
336 |
|
/* reseed random number generator */ |
389 |
|
#endif |
390 |
|
} |
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 |
|
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); |
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; |