| 316 |
|
* list and start again from the beginning. Since |
| 317 |
|
* a merge sort is used, the sorting costs are minimal. |
| 318 |
|
*/ |
| 319 |
< |
next_packet(p) /* prepare packet for computation */ |
| 319 |
> |
next_packet(p, n) /* prepare packet for computation */ |
| 320 |
|
register PACKET *p; |
| 321 |
+ |
int n; |
| 322 |
|
{ |
| 323 |
|
register int i; |
| 324 |
|
|
| 332 |
|
p->nr = complist[listpos].nr - p->nc; |
| 333 |
|
if (p->nr <= 0) |
| 334 |
|
return(0); |
| 335 |
< |
if (p->nr > RPACKSIZ) |
| 336 |
< |
p->nr = RPACKSIZ; |
| 335 |
> |
#ifdef DEBUG |
| 336 |
> |
if (n < 1 | n > RPACKSIZ) |
| 337 |
> |
error(CONSISTENCY, "next_packet called with bad n value"); |
| 338 |
> |
#endif |
| 339 |
> |
if (p->nr > n) |
| 340 |
> |
p->nr = n; |
| 341 |
|
complist[listpos].nc += p->nr; /* find where this one would go */ |
| 342 |
|
while (lastin > listpos && |
| 343 |
|
beamcmp(complist+lastin, complist+listpos) > 0) |
