Browse Source

test

release/v0.1
jl777 9 years ago
parent
commit
6553fc8fea
  1. 13
      iguana/iguana_recv.c

13
iguana/iguana_recv.c

@ -1331,15 +1331,12 @@ int32_t iguana_blockQ(char *argstr,struct iguana_info *coin,struct iguana_bundle
req->bundlei = bundlei;
char str2[65];
//printf("%s %s %s [%d:%d] %d %s %d numranked.%d qsize.%d\n",coin->symbol,argstr,str,bp!=0?bp->hdrsi:-1,bundlei,req->height,bits256_str(str2,hash2),coin->blocks.recvblocks,coin->peers.numranked,queue_size(Q));
if ( Q == &coin->blocksQ )
if ( (n= queue_size(Q)) > 100000 )
{
if ( (n= queue_size(Q)) > 100000 )
{
if ( 0 && n > 200000 )
printf("%s %s %s [%d:%d] %d %s %d numranked.%d qsize.%d\n",coin->symbol,argstr,str,bp!=0?bp->hdrsi:-1,bundlei,req->height,bits256_str(str2,hash2),coin->blocks.recvblocks,coin->peers.numranked,queue_size(Q));
coin->backlog = n*10 + 1000000;
} else coin->backlog >>= 1;
}
if ( 1 && n > 200000 )
printf("%s %s %s [%d:%d] %d %s %d numranked.%d qsize.%d\n",coin->symbol,argstr,str,bp!=0?bp->hdrsi:-1,bundlei,req->height,bits256_str(str2,hash2),coin->blocks.recvblocks,coin->peers.numranked,queue_size(Q));
coin->backlog = n*10 + 1000000;
} else coin->backlog >>= 1;
if ( block != 0 )
{
block->numrequests++;

Loading…
Cancel
Save