mirror of
https://github.com/bitcoin/bitcoin.git
synced 2025-02-22 15:04:44 +01:00
Merge #18641: test: Create cached blocks not in the future
fa32097541
test: Create cached blocks not in the future (MarcoFalke) Pull request description: This avoids test failures when tests assume blocks are not from the future, like in wallet_dump: https://cirrus-ci.com/task/6607130193035264?command=ci#L3306 ACKs for top commit: jonatack: ACKfa32097541
Tree-SHA512: 60b6882e0e1df8c5d67f034533407a45d3685983891b67ff4631072bfd0a93a325c7ca18758d7a2df252e4fcdb7c87321cb1e84458b22782e57e719eec634c22
This commit is contained in:
commit
c54295c1a2
1 changed files with 7 additions and 3 deletions
|
@ -549,9 +549,13 @@ class BitcoinTestFramework(metaclass=BitcoinTestMetaClass):
|
|||
cwd=self.options.tmpdir,
|
||||
))
|
||||
self.start_node(CACHE_NODE_ID)
|
||||
cache_node = self.nodes[CACHE_NODE_ID]
|
||||
|
||||
# Wait for RPC connections to be ready
|
||||
self.nodes[CACHE_NODE_ID].wait_for_rpc_connection()
|
||||
cache_node.wait_for_rpc_connection()
|
||||
|
||||
# Set a time in the past, so that blocks don't end up in the future
|
||||
cache_node.setmocktime(cache_node.getblockheader(cache_node.getbestblockhash())['time'])
|
||||
|
||||
# Create a 199-block-long chain; each of the 4 first nodes
|
||||
# gets 25 mature blocks and 25 immature.
|
||||
|
@ -560,12 +564,12 @@ class BitcoinTestFramework(metaclass=BitcoinTestMetaClass):
|
|||
# This is needed so that we are out of IBD when the test starts,
|
||||
# see the tip age check in IsInitialBlockDownload().
|
||||
for i in range(8):
|
||||
self.nodes[CACHE_NODE_ID].generatetoaddress(
|
||||
cache_node.generatetoaddress(
|
||||
nblocks=25 if i != 7 else 24,
|
||||
address=TestNode.PRIV_KEYS[i % 4].address,
|
||||
)
|
||||
|
||||
assert_equal(self.nodes[CACHE_NODE_ID].getblockchaininfo()["blocks"], 199)
|
||||
assert_equal(cache_node.getblockchaininfo()["blocks"], 199)
|
||||
|
||||
# Shut it down, and clean up cache directories:
|
||||
self.stop_nodes()
|
||||
|
|
Loading…
Add table
Reference in a new issue