| 20 |
|
* is desired, a negative value may be returned. |
| 21 |
|
* |
| 22 |
|
* The ray_fifo_in() call takes a ray that has been initialized in |
| 23 |
< |
* the same manner as for the ray_trace() call, i.e., the origin, |
| 24 |
< |
* direction, and maximum length have been assigned. The ray number |
| 25 |
< |
* will be set according to the number of rays traced since the |
| 23 |
> |
* the same manner as for the ray_pqueue() call, i.e., rayorigin() |
| 24 |
> |
* has been called and the origin, direction and maximum distance |
| 25 |
> |
* have all been assigned. However, the ray number will be reset |
| 26 |
> |
* by ray_fifo_in() according to the number of rays traced since the |
| 27 |
|
* last call to ray_fifo_flush(). This final call completes all |
| 28 |
|
* pending ray calculations and frees the FIFO buffer. If any of |
| 29 |
|
* the automatic calls to the ray_fifo_out callback return a |
| 55 |
|
int i; |
| 56 |
|
|
| 57 |
|
if (r_fifo_buf == NULL) |
| 58 |
< |
r_fifo_len = 1<<4; |
| 58 |
> |
r_fifo_len = 1<<5; |
| 59 |
|
else |
| 60 |
|
r_fifo_len <<= 1; |
| 61 |
|
/* allocate new */ |
| 85 |
|
error(INTERNAL, "unexpected ray number in ray_fifo_push()"); |
| 86 |
|
|
| 87 |
|
if (r->rno > r_fifo_start) { /* insert into output queue */ |
| 88 |
< |
if (r->rno - r_fifo_start >= r_fifo_len) |
| 88 |
> |
while (r->rno - r_fifo_start >= r_fifo_len) |
| 89 |
|
ray_fifo_growbuf(); /* need more space */ |
| 90 |
|
*r_fifo(r->rno) = *r; |
| 91 |
|
if (r->rno >= r_fifo_end) |
| 126 |
|
rval += rv; |
| 127 |
|
} |
| 128 |
|
/* queue ray */ |
| 128 |
– |
rayorigin(r, PRIMARY, NULL, NULL); |
| 129 |
|
r->rno = r_fifo_next++; |
| 130 |
|
if ((rv = ray_pqueue(r)) < 0) |
| 131 |
|
{--incall; return(-1);} |
