|
|
@ -516,7 +516,7 @@ struct iguana_bundlereq *iguana_recvblockhdrs(struct iguana_info *coin,struct ig |
|
|
|
{ |
|
|
|
for (i=match=0; i<n; i++) |
|
|
|
{ |
|
|
|
//fprintf(stderr,"i.%d of %d bundleset\n",i,n);
|
|
|
|
fprintf(stderr,"i.%d of %d bundleset\n",i,n); |
|
|
|
bp = 0, bundlei = -1; |
|
|
|
if ( (bp= iguana_bundleset(coin,&block,&bundlei,&blocks[i])) != 0 ) |
|
|
|
{ |
|
|
@ -531,7 +531,7 @@ struct iguana_bundlereq *iguana_recvblockhdrs(struct iguana_info *coin,struct ig |
|
|
|
{ |
|
|
|
if ( firstbp->queued == 0 ) |
|
|
|
{ |
|
|
|
//printf("firstbp blockQ %d\n",firstbp->bundleheight);
|
|
|
|
printf("firstbp blockQ %d\n",firstbp->bundleheight); |
|
|
|
iguana_bundleQ(coin,firstbp,1000 + 10*(rand() % (int32_t)(1+sqrt(firstbp->bundleheight)))); |
|
|
|
} |
|
|
|
} else printf("match.%d vs n.%d bp->n.%d ht.%d\n",match,n,firstbp->n,firstbp->bundleheight); |
|
|
|