4 |
|
/* |
5 |
|
* ranimove2.c |
6 |
|
* |
7 |
< |
* Frame refinement routines for ranimate(1). |
7 |
> |
* Frame refinement routines for ranimove(1). |
8 |
|
* |
9 |
|
* Created by Gregory Ward on Wed Jan 08 2003. |
10 |
|
*/ |
21 |
|
|
22 |
|
int cerrzero; /* is cerrmap all zeroes? */ |
23 |
|
|
24 |
+ |
static int ppri_cmp(const void *pp1, const void *pp2); |
25 |
+ |
static int ray_refine(int n); |
26 |
+ |
static long refine_rays(long nrays); |
27 |
|
|
28 |
+ |
|
29 |
|
int |
30 |
< |
refine_first() /* initial refinement pass */ |
30 |
> |
refine_first(void) /* initial refinement pass */ |
31 |
|
{ |
32 |
|
int *esamp = (int *)zprev; /* OK to reuse */ |
33 |
|
int hl_erri = errori(HL_ERR); |
34 |
|
int nextra = 0; |
35 |
|
int x, y, xp, yp; |
36 |
|
int neigh; |
37 |
< |
register int n, np; |
37 |
> |
int n, np; |
38 |
|
|
39 |
|
if (sizeof(int) < sizeof(*zprev)) |
40 |
|
error(CONSISTENCY, "code error in refine_first"); |
121 |
|
static double pixel_deg; /* base pixel frequency */ |
122 |
|
static int fhsiz, fvsiz; /* foveal subimage size */ |
123 |
|
|
124 |
+ |
static void clr_consp(struct ConspSum *cs); |
125 |
+ |
static void sum_consp(struct ConspSum *cdest, struct ConspSum *cs); |
126 |
+ |
static void est_consp(int x0, int y0, int x1, int y1, struct ConspSum *cs); |
127 |
+ |
static void subconspicuity(int x0, int y0, int x1, int y1, struct ConspSum *cs); |
128 |
+ |
|
129 |
|
static void |
130 |
< |
clr_consp(cs) /* initialize a conspicuity sum */ |
131 |
< |
register struct ConspSum *cs; |
130 |
> |
clr_consp( /* initialize a conspicuity sum */ |
131 |
> |
struct ConspSum *cs |
132 |
> |
) |
133 |
|
{ |
134 |
|
if (cs == NULL) |
135 |
|
return; |
142 |
|
} |
143 |
|
|
144 |
|
static void |
145 |
< |
sum_consp(cdest, cs) /* sum in conspicuity result */ |
146 |
< |
register struct ConspSum *cdest, *cs; |
145 |
> |
sum_consp( /* sum in conspicuity result */ |
146 |
> |
struct ConspSum *cdest, |
147 |
> |
struct ConspSum *cs |
148 |
> |
) |
149 |
|
{ |
150 |
|
if ((cdest == NULL) | (cs == NULL)) |
151 |
|
return; |
160 |
|
} |
161 |
|
|
162 |
|
static void |
163 |
< |
est_consp(x0,y0,x1,y1, cs) /* estimate error conspicuity & update */ |
164 |
< |
int x0, y0, x1, y1; |
165 |
< |
register struct ConspSum *cs; |
163 |
> |
est_consp( /* estimate error conspicuity & update */ |
164 |
> |
int x0, |
165 |
> |
int y0, |
166 |
> |
int x1, |
167 |
> |
int y1, |
168 |
> |
struct ConspSum *cs |
169 |
> |
) |
170 |
|
{ |
171 |
|
double rad2, mtn2, cpd, vm, vr, csf, eest; |
172 |
|
/* do we care? */ |
233 |
|
/* worth the bother? */ |
234 |
|
if (eest <= .01) |
235 |
|
return; |
236 |
< |
/* sum into map */ |
236 |
> |
/* put into map */ |
237 |
|
for ( ; y0 < y1; y0++) { |
238 |
|
float *em0 = cerrmap + fndx(x0, y0); |
239 |
< |
register float *emp = em0 + (x1-x0); |
239 |
> |
float *emp = em0 + (x1-x0); |
240 |
|
while (emp-- > em0) |
241 |
< |
*emp += eest; |
241 |
> |
if (eest > *emp) |
242 |
> |
*emp = eest; |
243 |
|
} |
244 |
|
cerrzero = 0; |
245 |
|
} |
246 |
|
|
247 |
|
static void |
248 |
< |
subconspicuity(x0,y0,x1,y1, cs) /* compute subportion of conspicuity */ |
249 |
< |
int x0, y0, x1, y1; |
250 |
< |
struct ConspSum *cs; |
248 |
> |
subconspicuity( /* compute subportion of conspicuity */ |
249 |
> |
int x0, |
250 |
> |
int y0, |
251 |
> |
int x1, |
252 |
> |
int y1, |
253 |
> |
struct ConspSum *cs |
254 |
> |
) |
255 |
|
{ |
256 |
|
struct ConspSum mysum; |
257 |
|
int i; |
263 |
|
|
264 |
|
if ((x0 == x1-1) & (y0 == y1-1)) { /* single pixel */ |
265 |
|
double hls; |
266 |
< |
register int n = fndx(x0, y0); |
266 |
> |
int n = fndx(x0, y0); |
267 |
|
if (sbuffer[n]) { |
268 |
|
copycolor(mysum.vsum, cbuffer[n]); |
269 |
|
copycolor(mysum.v2sum, val2map[n]); |
311 |
|
} |
312 |
|
|
313 |
|
void |
314 |
< |
conspicuity() /* compute conspicuous error map */ |
314 |
> |
conspicuity(void) /* compute conspicuous error map */ |
315 |
|
{ |
316 |
|
int fhres, fvres; |
317 |
|
int fx, fy; |
351 |
|
|
352 |
|
|
353 |
|
static int |
354 |
< |
ppri_cmp(pp1, pp2) /* pixel priority comparison */ |
355 |
< |
const void *pp1, *pp2; |
354 |
> |
ppri_cmp( /* pixel priority comparison */ |
355 |
> |
const void *pp1, |
356 |
> |
const void *pp2 |
357 |
> |
) |
358 |
|
{ |
359 |
|
double se1 = cerrmap[*(const int *)pp1]; |
360 |
|
double se2 = cerrmap[*(const int *)pp2]; |
374 |
|
|
375 |
|
|
376 |
|
static int |
377 |
< |
ray_refine(n) /* refine the given pixel by tracing a ray */ |
378 |
< |
register int n; |
377 |
> |
ray_refine( /* refine the given pixel by tracing a ray */ |
378 |
> |
int n |
379 |
> |
) |
380 |
|
{ |
381 |
|
RAY ir; |
382 |
< |
int neigh[NSAMPOK]; |
359 |
< |
int nc; |
360 |
< |
COLOR ctmp; |
382 |
> |
COLOR rcol, ctmp, csqr; |
383 |
|
int i; |
384 |
|
|
385 |
|
if (n < 0) { /* fetching stragglers */ |
396 |
|
return(-1); |
397 |
|
if (nprocs > 1) { |
398 |
|
int rval; |
399 |
< |
rayorigin(&ir, NULL, PRIMARY, 1.0); |
399 |
> |
rayorigin(&ir, PRIMARY, NULL, NULL); |
400 |
|
ir.rno = n; |
401 |
|
rval = ray_pqueue(&ir); |
402 |
|
if (!rval) |
407 |
|
} else |
408 |
|
ray_trace(&ir); |
409 |
|
} |
410 |
+ |
scolor_rgb(rcol, ir.rcol); |
411 |
|
if (abuffer[n] == ALOWQ && asump != NULL) { |
412 |
|
if (sbuffer[n] != 1) |
413 |
|
error(CONSISTENCY, "bad code in ray_refine"); |
417 |
|
(colval(ctmp,BLU) > 0.01)) { |
418 |
|
for (i = 0; i < 3; i++) |
419 |
|
asump->diffsum[i] += |
420 |
< |
(colval(ir.rcol,i) - colval(cbuffer[n],i)) |
420 |
> |
(colval(rcol,i) - colval(cbuffer[n],i)) |
421 |
|
/ colval(ctmp,i); |
422 |
|
asump->nsamps++; |
423 |
|
} |
424 |
|
sbuffer[n] = 0; |
425 |
|
} |
426 |
< |
setcolor(ctmp, |
427 |
< |
colval(ir.rcol,RED)*colval(ir.rcol,RED), |
405 |
< |
colval(ir.rcol,GRN)*colval(ir.rcol,GRN), |
406 |
< |
colval(ir.rcol,BLU)*colval(ir.rcol,BLU)); |
426 |
> |
copycolor(csqr, rcol); |
427 |
> |
multcolor(csqr, rcol); |
428 |
|
if (!sbuffer[n]) { /* first sample */ |
429 |
< |
copycolor(cbuffer[n], ir.rcol); |
430 |
< |
copycolor(val2map[n], ctmp); |
429 |
> |
copycolor(cbuffer[n], rcol); |
430 |
> |
copycolor(val2map[n], csqr); |
431 |
|
abuffer[n] = AHIGHQ; |
432 |
|
sbuffer[n] = 1; |
433 |
|
} else { /* else sum in sample */ |
434 |
< |
addcolor(cbuffer[n], ir.rcol); |
435 |
< |
addcolor(val2map[n], ctmp); |
434 |
> |
addcolor(cbuffer[n], rcol); |
435 |
> |
addcolor(val2map[n], csqr); |
436 |
|
sbuffer[n]++; |
437 |
|
} |
438 |
|
return(n); |
440 |
|
|
441 |
|
|
442 |
|
static long |
443 |
< |
refine_rays(nrays) /* compute refinement rays */ |
444 |
< |
long nrays; |
443 |
> |
refine_rays( /* compute refinement rays */ |
444 |
> |
long nrays |
445 |
> |
) |
446 |
|
{ |
447 |
|
int *pord; |
448 |
|
int ntodo; |
462 |
|
i = 0; |
463 |
|
/* trace rays in list */ |
464 |
|
for (rdone = 0; rdone < nrays; rdone++) { |
465 |
< |
if (ndtset && i >= 1000 && cerrmap[pord[i]] <= FTINY) |
465 |
> |
if (ndtset && (i >= 1000) & (i < ntodo) && |
466 |
> |
cerrmap[pord[i]] <= FTINY) |
467 |
|
ntodo = i; |
468 |
|
if (i >= ntodo) { /* redo conspicuity & priority */ |
469 |
|
while (ray_refine(-1) >= 0) |
487 |
|
|
488 |
|
|
489 |
|
int |
490 |
< |
refine_frame(pass) /* refine current frame */ |
491 |
< |
int pass; |
490 |
> |
refine_frame( /* refine current frame */ |
491 |
> |
int pass |
492 |
> |
) |
493 |
|
{ |
494 |
|
static double rtime_used = 0; |
495 |
|
static long ray_cnt = 0; |
499 |
|
double time_start, rtime_start, time_done; |
500 |
|
struct AmbSum myAmbSum; |
501 |
|
long rays_todo, nr; |
502 |
< |
register int n; |
502 |
> |
int n; |
503 |
|
/* IBR refinement? */ |
504 |
|
if ((pass == 0) & (fcur > fbeg)) |
505 |
|
return(refine_first()); |
578 |
|
/* compute refinement rays */ |
579 |
|
if (!silent) { |
580 |
|
printf("\tRefinement pass %d...", |
581 |
< |
pass+1, rays_todo); |
581 |
> |
pass+1); /*, rays_todo); */ |
582 |
|
fflush(stdout); |
583 |
|
} |
584 |
|
if (asump != NULL) /* flag low-quality samples */ |
588 |
|
/* trace those rays */ |
589 |
|
nr = refine_rays(rays_todo); |
590 |
|
if (!silent) |
591 |
< |
printf("traced %d HQ rays\n", nr); |
591 |
> |
printf("traced %ld HQ rays\n", nr); |
592 |
|
if (nr <= 0) |
593 |
|
return(0); |
594 |
|
/* update timing stats */ |