|
|
@ -80,7 +80,7 @@ class PruneTest(BitcoinTestFramework): |
|
|
|
if not os.path.isfile(self.prunedir+"blk00000.dat"): |
|
|
|
if not os.path.isfile(self.prunedir+"blk00000.dat"): |
|
|
|
raise AssertionError("blk00000.dat is missing, pruning too early") |
|
|
|
raise AssertionError("blk00000.dat is missing, pruning too early") |
|
|
|
self.log.info("Success") |
|
|
|
self.log.info("Success") |
|
|
|
self.log.info("Though we're already using more than 550MiB, current usage:", calc_usage(self.prunedir)) |
|
|
|
self.log.info("Though we're already using more than 550MiB, current usage: %d" % calc_usage(self.prunedir)) |
|
|
|
self.log.info("Mining 25 more blocks should cause the first block file to be pruned") |
|
|
|
self.log.info("Mining 25 more blocks should cause the first block file to be pruned") |
|
|
|
# Pruning doesn't run until we're allocating another chunk, 20 full blocks past the height cutoff will ensure this |
|
|
|
# Pruning doesn't run until we're allocating another chunk, 20 full blocks past the height cutoff will ensure this |
|
|
|
for i in range(25): |
|
|
|
for i in range(25): |
|
|
@ -94,7 +94,7 @@ class PruneTest(BitcoinTestFramework): |
|
|
|
|
|
|
|
|
|
|
|
self.log.info("Success") |
|
|
|
self.log.info("Success") |
|
|
|
usage = calc_usage(self.prunedir) |
|
|
|
usage = calc_usage(self.prunedir) |
|
|
|
self.log.info("Usage should be below target:", usage) |
|
|
|
self.log.info("Usage should be below target: %d" % usage) |
|
|
|
if (usage > 550): |
|
|
|
if (usage > 550): |
|
|
|
raise AssertionError("Pruning target not being met") |
|
|
|
raise AssertionError("Pruning target not being met") |
|
|
|
|
|
|
|
|
|
|
@ -124,7 +124,7 @@ class PruneTest(BitcoinTestFramework): |
|
|
|
connect_nodes(self.nodes[2], 0) |
|
|
|
connect_nodes(self.nodes[2], 0) |
|
|
|
sync_blocks(self.nodes[0:3]) |
|
|
|
sync_blocks(self.nodes[0:3]) |
|
|
|
|
|
|
|
|
|
|
|
self.log.info("Usage can be over target because of high stale rate:", calc_usage(self.prunedir)) |
|
|
|
self.log.info("Usage can be over target because of high stale rate: %d" % calc_usage(self.prunedir)) |
|
|
|
|
|
|
|
|
|
|
|
def reorg_test(self): |
|
|
|
def reorg_test(self): |
|
|
|
# Node 1 will mine a 300 block chain starting 287 blocks back from Node 0 and Node 2's tip |
|
|
|
# Node 1 will mine a 300 block chain starting 287 blocks back from Node 0 and Node 2's tip |
|
|
@ -135,11 +135,11 @@ class PruneTest(BitcoinTestFramework): |
|
|
|
self.nodes[1]=start_node(1, self.options.tmpdir, ["-maxreceivebuffer=20000","-blockmaxsize=5000", "-checkblocks=5", "-disablesafemode"], timewait=900) |
|
|
|
self.nodes[1]=start_node(1, self.options.tmpdir, ["-maxreceivebuffer=20000","-blockmaxsize=5000", "-checkblocks=5", "-disablesafemode"], timewait=900) |
|
|
|
|
|
|
|
|
|
|
|
height = self.nodes[1].getblockcount() |
|
|
|
height = self.nodes[1].getblockcount() |
|
|
|
self.log.info("Current block height:", height) |
|
|
|
self.log.info("Current block height: %d" % height) |
|
|
|
|
|
|
|
|
|
|
|
invalidheight = height-287 |
|
|
|
invalidheight = height-287 |
|
|
|
badhash = self.nodes[1].getblockhash(invalidheight) |
|
|
|
badhash = self.nodes[1].getblockhash(invalidheight) |
|
|
|
self.log.info("Invalidating block at height:",invalidheight,badhash) |
|
|
|
self.log.info("Invalidating block %s at height %d" % (badhash,invalidheight)) |
|
|
|
self.nodes[1].invalidateblock(badhash) |
|
|
|
self.nodes[1].invalidateblock(badhash) |
|
|
|
|
|
|
|
|
|
|
|
# We've now switched to our previously mined-24 block fork on node 1, but thats not what we want |
|
|
|
# We've now switched to our previously mined-24 block fork on node 1, but thats not what we want |
|
|
@ -151,7 +151,7 @@ class PruneTest(BitcoinTestFramework): |
|
|
|
curhash = self.nodes[1].getblockhash(invalidheight - 1) |
|
|
|
curhash = self.nodes[1].getblockhash(invalidheight - 1) |
|
|
|
|
|
|
|
|
|
|
|
assert(self.nodes[1].getblockcount() == invalidheight - 1) |
|
|
|
assert(self.nodes[1].getblockcount() == invalidheight - 1) |
|
|
|
self.log.info("New best height", self.nodes[1].getblockcount()) |
|
|
|
self.log.info("New best height: %d" % self.nodes[1].getblockcount()) |
|
|
|
|
|
|
|
|
|
|
|
# Reboot node1 to clear those giant tx's from mempool |
|
|
|
# Reboot node1 to clear those giant tx's from mempool |
|
|
|
self.stop_node(1) |
|
|
|
self.stop_node(1) |
|
|
@ -165,8 +165,8 @@ class PruneTest(BitcoinTestFramework): |
|
|
|
connect_nodes(self.nodes[2], 1) |
|
|
|
connect_nodes(self.nodes[2], 1) |
|
|
|
sync_blocks(self.nodes[0:3], timeout=120) |
|
|
|
sync_blocks(self.nodes[0:3], timeout=120) |
|
|
|
|
|
|
|
|
|
|
|
self.log.info("Verify height on node 2:",self.nodes[2].getblockcount()) |
|
|
|
self.log.info("Verify height on node 2: %d" % self.nodes[2].getblockcount()) |
|
|
|
self.log.info("Usage possibly still high bc of stale blocks in block files:", calc_usage(self.prunedir)) |
|
|
|
self.log.info("Usage possibly still high bc of stale blocks in block files: %d" % calc_usage(self.prunedir)) |
|
|
|
|
|
|
|
|
|
|
|
self.log.info("Mine 220 more blocks so we have requisite history (some blocks will be big and cause pruning of previous chain)") |
|
|
|
self.log.info("Mine 220 more blocks so we have requisite history (some blocks will be big and cause pruning of previous chain)") |
|
|
|
for i in range(22): |
|
|
|
for i in range(22): |
|
|
@ -176,7 +176,7 @@ class PruneTest(BitcoinTestFramework): |
|
|
|
sync_blocks(self.nodes[0:3], timeout=300) |
|
|
|
sync_blocks(self.nodes[0:3], timeout=300) |
|
|
|
|
|
|
|
|
|
|
|
usage = calc_usage(self.prunedir) |
|
|
|
usage = calc_usage(self.prunedir) |
|
|
|
self.log.info("Usage should be below target:", usage) |
|
|
|
self.log.info("Usage should be below target: %d" % usage) |
|
|
|
if (usage > 550): |
|
|
|
if (usage > 550): |
|
|
|
raise AssertionError("Pruning target not being met") |
|
|
|
raise AssertionError("Pruning target not being met") |
|
|
|
|
|
|
|
|
|
|
@ -185,7 +185,7 @@ class PruneTest(BitcoinTestFramework): |
|
|
|
def reorg_back(self): |
|
|
|
def reorg_back(self): |
|
|
|
# Verify that a block on the old main chain fork has been pruned away |
|
|
|
# Verify that a block on the old main chain fork has been pruned away |
|
|
|
assert_raises_jsonrpc(-1, "Block not available (pruned data)", self.nodes[2].getblock, self.forkhash) |
|
|
|
assert_raises_jsonrpc(-1, "Block not available (pruned data)", self.nodes[2].getblock, self.forkhash) |
|
|
|
self.log.info("Will need to redownload block",self.forkheight) |
|
|
|
self.log.info("Will need to redownload block %d" % self.forkheight) |
|
|
|
|
|
|
|
|
|
|
|
# Verify that we have enough history to reorg back to the fork point |
|
|
|
# Verify that we have enough history to reorg back to the fork point |
|
|
|
# Although this is more than 288 blocks, because this chain was written more recently |
|
|
|
# Although this is more than 288 blocks, because this chain was written more recently |
|
|
@ -209,7 +209,7 @@ class PruneTest(BitcoinTestFramework): |
|
|
|
# At this point node 2 is within 288 blocks of the fork point so it will preserve its ability to reorg |
|
|
|
# At this point node 2 is within 288 blocks of the fork point so it will preserve its ability to reorg |
|
|
|
if self.nodes[2].getblockcount() < self.mainchainheight: |
|
|
|
if self.nodes[2].getblockcount() < self.mainchainheight: |
|
|
|
blocks_to_mine = first_reorg_height + 1 - self.mainchainheight |
|
|
|
blocks_to_mine = first_reorg_height + 1 - self.mainchainheight |
|
|
|
self.log.info("Rewind node 0 to prev main chain to mine longer chain to trigger redownload. Blocks needed:", blocks_to_mine) |
|
|
|
self.log.info("Rewind node 0 to prev main chain to mine longer chain to trigger redownload. Blocks needed: %d" % blocks_to_mine) |
|
|
|
self.nodes[0].invalidateblock(curchainhash) |
|
|
|
self.nodes[0].invalidateblock(curchainhash) |
|
|
|
assert(self.nodes[0].getblockcount() == self.mainchainheight) |
|
|
|
assert(self.nodes[0].getblockcount() == self.mainchainheight) |
|
|
|
assert(self.nodes[0].getbestblockhash() == self.mainchainhash2) |
|
|
|
assert(self.nodes[0].getbestblockhash() == self.mainchainhash2) |
|
|
|