mirror of https://github.com/bitcoin/bitcoin
parent
e254ff5d53
commit
fa85c985ed
@ -0,0 +1,43 @@
|
||||
#!/usr/bin/env python3
|
||||
# Copyright (c) 2015-2017 The Bitcoin Core developers
|
||||
# Distributed under the MIT software license, see the accompanying
|
||||
# file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
||||
"""Test node responses to invalid locators.
|
||||
"""
|
||||
|
||||
from test_framework.messages import msg_getheaders, msg_getblocks, MAX_LOCATOR_SZ
|
||||
from test_framework.mininode import P2PInterface
|
||||
from test_framework.test_framework import BitcoinTestFramework
|
||||
|
||||
|
||||
class InvalidLocatorTest(BitcoinTestFramework):
|
||||
def set_test_params(self):
|
||||
self.num_nodes = 1
|
||||
self.setup_clean_chain = False
|
||||
|
||||
def run_test(self):
|
||||
node = self.nodes[0] # convenience reference to the node
|
||||
node.generate(1) # Get node out of IBD
|
||||
|
||||
self.log.info('Test max locator size')
|
||||
block_count = node.getblockcount()
|
||||
for msg in [msg_getheaders(), msg_getblocks()]:
|
||||
self.log.info('Wait for disconnect when sending {} hashes in locator'.format(MAX_LOCATOR_SZ + 1))
|
||||
node.add_p2p_connection(P2PInterface())
|
||||
msg.locator.vHave = [int(node.getblockhash(i - 1), 16) for i in range(block_count, block_count - (MAX_LOCATOR_SZ + 1), -1)]
|
||||
node.p2p.send_message(msg)
|
||||
node.p2p.wait_for_disconnect()
|
||||
node.disconnect_p2ps()
|
||||
|
||||
self.log.info('Wait for response when sending {} hashes in locator'.format(MAX_LOCATOR_SZ))
|
||||
node.add_p2p_connection(P2PInterface())
|
||||
msg.locator.vHave = [int(node.getblockhash(i - 1), 16) for i in range(block_count, block_count - (MAX_LOCATOR_SZ), -1)]
|
||||
node.p2p.send_message(msg)
|
||||
if type(msg) == msg_getheaders:
|
||||
node.p2p.wait_for_header(int(node.getbestblockhash(), 16))
|
||||
else:
|
||||
node.p2p.wait_for_block(int(node.getbestblockhash(), 16))
|
||||
|
||||
|
||||
if __name__ == '__main__':
|
||||
InvalidLocatorTest().main()
|
Loading…
Reference in new issue