Browse Source

test

release/v0.1
jl777 9 years ago
parent
commit
7dc41be1bc
  1. 6
      iguana/iguana_recv.c

6
iguana/iguana_recv.c

@ -432,7 +432,7 @@ int32_t iguana_bundlekick(struct iguana_info *coin,struct iguana_bundle *bp,int3
if ( block->issued == 0 || now > block->issued+60 ) if ( block->issued == 0 || now > block->issued+60 )
{ {
block->numrequests++; block->numrequests++;
//printf("bundleQ issue %d %x %d [%d:%d] numsaved.%d\n",block->RO.recvlen,block->fpipbits,block->fpos,bp->hdrsi,i,bp->numsaved); printf("bundleQ issue %d %x %d [%d:%d] numsaved.%d\n",block->RO.recvlen,block->fpipbits,block->fpos,bp->hdrsi,i,bp->numsaved);
/*if ( bp->hdrsi == starti ) /*if ( bp->hdrsi == starti )
{ {
//if ( coin->peers.ranked[0] != 0 ) //if ( coin->peers.ranked[0] != 0 )
@ -541,7 +541,7 @@ int32_t iguana_bundleiters(struct iguana_info *coin,struct iguana_bundle *bp,int
return(0); return(0);
} }
//printf("BUNDLEITERS.%d\n",bp->hdrsi); //printf("BUNDLEITERS.%d\n",bp->hdrsi);
if ( bp->hdrsi <= starti+coin->MAXBUNDLES && coin->lastpending != 0 ) if ( bp->hdrsi <= starti+8 && coin->lastpending != 0 )
{ {
for (i=0; i<bp->n; i++) for (i=0; i<bp->n; i++)
{ {
@ -785,7 +785,7 @@ struct iguana_bundlereq *iguana_recvblockhashes(struct iguana_info *coin,struct
if ( num < 2 ) if ( num < 2 )
return(req); return(req);
iguana_bundlefind(coin,&bp,&bundlei,blockhashes[1]); iguana_bundlefind(coin,&bp,&bundlei,blockhashes[1]);
iguana_blockQ(coin,0,-1,blockhashes[1],0); //iguana_blockQ(coin,0,-1,blockhashes[1],0);
iguana_blockQ(coin,0,-1,blockhashes[1],1); iguana_blockQ(coin,0,-1,blockhashes[1],1);
//char str[65]; //char str[65];
//if ( bp != 0 && bp->hdrsi == 0 ) //if ( bp != 0 && bp->hdrsi == 0 )

Loading…
Cancel
Save