ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/hd/rholo3.c
Revision: 3.5
Committed: Thu Nov 6 16:11:49 1997 UTC (26 years, 4 months ago) by gregl
Content type: text/plain
Branch: MAIN
Changes since 3.4: +3 -3 lines
Log Message:
changed disp_packet to take PACKHEAD* r.t. PACKET*

File Contents

# Content
1 /* Copyright (c) 1997 Silicon Graphics, Inc. */
2
3 #ifndef lint
4 static char SCCSid[] = "$SunId$ SGI";
5 #endif
6
7 /*
8 * Routines for tracking beam compuatations
9 */
10
11 #include "rholo.h"
12
13
14 #define abs(x) ((x) > 0 ? (x) : -(x))
15 #define sgn(x) ((x) > 0 ? 1 : (x) < 0 ? -1 : 0)
16
17
18 static PACKHEAD *complist=NULL; /* list of beams to compute */
19 static int complen=0; /* length of complist */
20 static int listpos=0; /* current list position for next_packet */
21 static int lastin= -1; /* last ordered position in list */
22
23
24 int
25 beamcmp(b0, b1) /* comparison for descending compute order */
26 register PACKHEAD *b0, *b1;
27 {
28 return( b1->nr*(bnrays(hdlist[b0->hd],b0->bi)+1) -
29 b0->nr*(bnrays(hdlist[b1->hd],b1->bi)+1) );
30 }
31
32
33 bundle_set(op, clist, nents) /* bundle set operation */
34 int op;
35 PACKHEAD *clist;
36 int nents;
37 {
38 BEAM *b;
39 PACKHEAD *p;
40 register int i, n;
41
42 switch (op) {
43 case BS_NEW: /* new computation set */
44 if (complen)
45 free((char *)complist);
46 if (nents <= 0) {
47 complist = NULL;
48 listpos = complen = 0;
49 lastin = -1;
50 return;
51 }
52 complist = (PACKHEAD *)malloc(nents*sizeof(PACKHEAD));
53 if (complist == NULL)
54 goto memerr;
55 bcopy((char *)clist, (char *)complist, nents*sizeof(PACKHEAD));
56 complen = nents;
57 listpos = 0;
58 lastin = -1; /* flag for initial sort */
59 break;
60 case BS_ADD: /* add to computation set */
61 if (nents <= 0)
62 return;
63 /* merge any common members */
64 for (i = 0; i < complen; i++)
65 for (n = 0; n < nents; n++)
66 if (clist[n].bi == complist[i].bi &&
67 clist[n].hd == complist[i].hd) {
68 complist[i].nr += clist[n].nr;
69 clist[n].nr = 0;
70 lastin = -1; /* flag full sort */
71 break;
72 }
73 /* sort updated list */
74 sortcomplist();
75 /* sort new entries */
76 qsort((char *)clist, nents, sizeof(PACKHEAD), beamcmp);
77 /* what can't we satisfy? */
78 for (n = 0; n < nents && clist[n].nr >
79 bnrays(hdlist[clist[n].hd],clist[n].bi); n++)
80 ;
81 if (n) { /* allocate space for merged list */
82 PACKHEAD *newlist;
83 newlist = (PACKHEAD *)malloc(
84 (complen+n)*sizeof(PACKHEAD) );
85 if (newlist == NULL)
86 goto memerr;
87 /* merge lists */
88 mergeclists(newlist, clist, n, complist, complen);
89 if (complen)
90 free((char *)complist);
91 complist = newlist;
92 complen += n;
93 }
94 listpos = 0;
95 lastin = complen-1; /* list is now sorted */
96 break;
97 case BS_DEL: /* delete from computation set */
98 if (nents <= 0)
99 return;
100 /* find each member */
101 for (i = 0; i < complen; i++)
102 for (n = 0; n < nents; n++)
103 if (clist[n].bi == complist[i].bi &&
104 clist[n].hd == complist[i].hd) {
105 if (clist[n].nr == 0 ||
106 clist[n].nr >= complist[i].nr)
107 complist[i].nr = 0;
108 else
109 complist[i].nr -= clist[n].nr;
110 lastin = -1; /* flag full sort */
111 break;
112 }
113 if (lastin < 0) /* sort updated list */
114 sortcomplist();
115 return; /* no display */
116 default:
117 error(CONSISTENCY, "bundle_set called with unknown operation");
118 }
119 n = 0; /* allocate packet holder */
120 for (i = 0; i < nents; i++)
121 if (clist[i].nr > n)
122 n = clist[i].nr;
123 p = (PACKHEAD *)malloc(packsiz(n));
124 if (p == NULL)
125 goto memerr;
126 /* display what we have */
127 for (i = 0; i < nents; i++)
128 if ((b = hdgetbeam(hdlist[clist[i].hd], clist[i].bi)) != NULL) {
129 bcopy((char *)hdbray(b), (char *)packrays(p),
130 (p->nr=b->nrm)*sizeof(RAYVAL));
131 disp_packet(p);
132 }
133 free((char *)p); /* clean up */
134 return;
135 memerr:
136 error(SYSTEM, "out of memory in bundle_set");
137 }
138
139
140 int
141 weightf(hp, x0, x1, x2) /* voxel weighting function */
142 register HOLO *hp;
143 register int x0, x1, x2;
144 {
145 switch (vlet(OCCUPANCY)) {
146 case 'U': /* uniform weighting */
147 return(1);
148 case 'C': /* center weighting (crude) */
149 x0 += x0 - hp->grid[0] + 1;
150 x0 = abs(x0)*hp->grid[1]*hp->grid[2];
151 x1 += x1 - hp->grid[1] + 1;
152 x1 = abs(x1)*hp->grid[0]*hp->grid[2];
153 x2 += x2 - hp->grid[2] + 1;
154 x2 = abs(x2)*hp->grid[0]*hp->grid[1];
155 return(hp->grid[0]*hp->grid[1]*hp->grid[2] -
156 (x0+x1+x2)/3);
157 default:
158 badvalue(OCCUPANCY);
159 }
160 }
161
162
163 /* The following is by Daniel Cohen, taken from Graphics Gems IV, p. 368 */
164 long
165 lineweight(hp, x, y, z, dx, dy, dz) /* compute weights along a line */
166 HOLO *hp;
167 int x, y, z, dx, dy, dz;
168 {
169 long wres = 0;
170 int n, sx, sy, sz, exy, exz, ezy, ax, ay, az, bx, by, bz;
171
172 sx = sgn(dx); sy = sgn(dy); sz = sgn(dz);
173 ax = abs(dx); ay = abs(dy); az = abs(dz);
174 bx = 2*ax; by = 2*ay; bz = 2*az;
175 exy = ay-ax; exz = az-ax; ezy = ay-az;
176 n = ax+ay+az + 1; /* added increment to visit last */
177 while (n--) {
178 wres += weightf(hp, x, y, z);
179 if (exy < 0) {
180 if (exz < 0) {
181 x += sx;
182 exy += by; exz += bz;
183 } else {
184 z += sz;
185 exz -= bx; ezy += by;
186 }
187 } else {
188 if (ezy < 0) {
189 z += sz;
190 exz -= bx; ezy += by;
191 } else {
192 y += sy;
193 exy -= bx; ezy -= bz;
194 }
195 }
196 }
197 return(wres);
198 }
199
200
201 init_global() /* initialize global ray computation */
202 {
203 long wtotal = 0;
204 int i, j;
205 int lseg[2][3];
206 double frac;
207 register int k;
208 /* free old list */
209 if (complen > 0)
210 free((char *)complist);
211 /* allocate beam list */
212 complen = 0;
213 for (j = 0; hdlist[j] != NULL; j++)
214 complen += nbeams(hdlist[j]);
215 complist = (PACKHEAD *)malloc(complen*sizeof(PACKHEAD));
216 if (complist == NULL)
217 error(SYSTEM, "out of memory in init_global");
218 /* compute beam weights */
219 k = 0;
220 for (j = 0; hdlist[j] != NULL; j++)
221 for (i = nbeams(hdlist[j]); i > 0; i--) {
222 hdlseg(lseg, hdlist[j], i);
223 complist[k].hd = j;
224 complist[k].bi = i;
225 complist[k].nr = lineweight( hdlist[j],
226 lseg[0][0], lseg[0][1], lseg[0][2],
227 lseg[1][0] - lseg[0][0],
228 lseg[1][1] - lseg[0][1],
229 lseg[1][2] - lseg[0][2] );
230 wtotal += complist[k++].nr;
231 }
232 /* adjust weights */
233 if (vdef(DISKSPACE)) {
234 frac = 1024.*1024.*vflt(DISKSPACE) / (wtotal*sizeof(RAYVAL));
235 if (frac < 0.95 | frac > 1.05)
236 while (k--)
237 complist[k].nr = frac * complist[k].nr;
238 }
239 listpos = 0; lastin = -1; /* flag initial sort */
240 }
241
242
243 mergeclists(cdest, cl1, n1, cl2, n2) /* merge two sorted lists */
244 PACKHEAD *cdest;
245 PACKHEAD *cl1, *cl2;
246 int n1, n2;
247 {
248 int cmp;
249
250 while (n1 | n2) {
251 if (!n1) cmp = 1;
252 else if (!n2) cmp = -1;
253 else cmp = beamcmp(cl1, cl2);
254 if (cmp > 0) {
255 copystruct(cdest, cl2);
256 cl2++; n2--;
257 } else {
258 copystruct(cdest, cl1);
259 cl1++; n1--;
260 }
261 cdest++;
262 }
263 }
264
265
266 sortcomplist() /* fix our list order */
267 {
268 PACKHEAD *list2;
269 register int i;
270
271 /* empty queue */
272 done_packets(flush_queue());
273 if (complen <= 0) /* check to see if there is even a list */
274 return;
275 if (lastin < 0) /* flag to sort entire list */
276 qsort((char *)complist, complen, sizeof(PACKHEAD), beamcmp);
277 else if (listpos) { /* else sort and merge sublist */
278 list2 = (PACKHEAD *)malloc(listpos*sizeof(PACKHEAD));
279 if (list2 == NULL)
280 error(SYSTEM, "out of memory in sortcomplist");
281 bcopy((char *)complist,(char *)list2,listpos*sizeof(PACKHEAD));
282 qsort((char *)list2, listpos, sizeof(PACKHEAD), beamcmp);
283 mergeclists(complist, list2, listpos,
284 complist+listpos, complen-listpos);
285 free((char *)list2);
286 }
287 /* check for all finished */
288 if (complist[0].nr <= bnrays(hdlist[complist[0].hd],complist[0].bi)) {
289 free((char *)complist);
290 complist = NULL;
291 complen = 0;
292 }
293 /* drop satisfied requests */
294 for (i = complen; i-- && complist[i].nr <=
295 bnrays(hdlist[complist[i].hd],complist[i].bi); )
296 ;
297 if (i < 0) {
298 free((char *)complist);
299 complist = NULL;
300 complen = 0;
301 } else if (i < complen-1) {
302 list2 = (PACKHEAD *)realloc((char *)complist,
303 (i+1)*sizeof(PACKHEAD));
304 if (list2 != NULL) {
305 complist = list2;
306 complen = i+1;
307 }
308 }
309 listpos = 0; lastin = i;
310 }
311
312
313 /*
314 * The following routine works on the assumption that the bundle weights are
315 * more or less evenly distributed, such that computing a packet causes
316 * a given bundle to move way down in the computation order. We keep
317 * track of where the computed bundle with the highest priority would end
318 * up, and if we get further in our compute list than this, we resort the
319 * list and start again from the beginning. We have to flush the queue
320 * each time we sort, to ensure that we are not disturbing the order.
321 * If our major assumption is violated, and we have a very steep
322 * descent in our weights, then we will end up resorting much more often
323 * than necessary, resulting in frequent flushing of the queue. Since
324 * a merge sort is used, the sorting costs will be minimal.
325 */
326 next_packet(p) /* prepare packet for computation */
327 register PACKET *p;
328 {
329 int ncomp;
330 register int i;
331
332 if (complen <= 0)
333 return(0);
334 if (listpos > lastin) /* time to sort the list */
335 sortcomplist();
336 p->hd = complist[listpos].hd;
337 p->bi = complist[listpos].bi;
338 ncomp = bnrays(hdlist[p->hd],p->bi);
339 p->nr = complist[listpos].nr - ncomp;
340 if (p->nr <= 0)
341 return(0);
342 if (p->nr > RPACKSIZ)
343 p->nr = RPACKSIZ;
344 ncomp += p->nr; /* find where this one would go */
345 while (lastin > listpos && complist[listpos].nr *
346 (bnrays(hdlist[complist[lastin].hd],complist[lastin].bi)+1)
347 > complist[lastin].nr * (ncomp+1))
348 lastin--;
349 listpos++;
350 return(1);
351 }