Changeset View
Changeset View
Standalone View
Standalone View
qa/rpc-tests/preciousblock.py
Show All 9 Lines | |||||
from test_framework.test_framework import BitcoinTestFramework | from test_framework.test_framework import BitcoinTestFramework | ||||
from test_framework.util import ( | from test_framework.util import ( | ||||
assert_equal, | assert_equal, | ||||
connect_nodes_bi, | connect_nodes_bi, | ||||
sync_chain, | sync_chain, | ||||
sync_blocks, | sync_blocks, | ||||
) | ) | ||||
def unidirectional_node_sync_via_rpc(node_src, node_dest): | def unidirectional_node_sync_via_rpc(node_src, node_dest): | ||||
blocks_to_copy = [] | blocks_to_copy = [] | ||||
blockhash = node_src.getbestblockhash() | blockhash = node_src.getbestblockhash() | ||||
while True: | while True: | ||||
try: | try: | ||||
assert(len(node_dest.getblock(blockhash, False)) > 0) | assert(len(node_dest.getblock(blockhash, False)) > 0) | ||||
break | break | ||||
except: | except: | ||||
blocks_to_copy.append(blockhash) | blocks_to_copy.append(blockhash) | ||||
blockhash = node_src.getblockheader(blockhash, True)['previousblockhash'] | blockhash = node_src.getblockheader( | ||||
blockhash, True)['previousblockhash'] | |||||
blocks_to_copy.reverse() | blocks_to_copy.reverse() | ||||
for blockhash in blocks_to_copy: | for blockhash in blocks_to_copy: | ||||
blockdata = node_src.getblock(blockhash, False) | blockdata = node_src.getblock(blockhash, False) | ||||
assert(node_dest.submitblock(blockdata) in (None, 'inconclusive')) | assert(node_dest.submitblock(blockdata) in (None, 'inconclusive')) | ||||
def node_sync_via_rpc(nodes): | def node_sync_via_rpc(nodes): | ||||
for node_src in nodes: | for node_src in nodes: | ||||
for node_dest in nodes: | for node_dest in nodes: | ||||
if node_src is node_dest: | if node_src is node_dest: | ||||
continue | continue | ||||
unidirectional_node_sync_via_rpc(node_src, node_dest) | unidirectional_node_sync_via_rpc(node_src, node_dest) | ||||
class PreciousTest(BitcoinTestFramework): | class PreciousTest(BitcoinTestFramework): | ||||
def __init__(self): | def __init__(self): | ||||
super().__init__() | super().__init__() | ||||
self.setup_clean_chain = True | self.setup_clean_chain = True | ||||
self.num_nodes = 3 | self.num_nodes = 3 | ||||
self.extra_args = [["-debug"]] * self.num_nodes | self.extra_args = [["-debug"]] * self.num_nodes | ||||
def setup_network(self): | def setup_network(self): | ||||
self.nodes = self.setup_nodes() | self.nodes = self.setup_nodes() | ||||
Show All 10 Lines | def run_test(self): | ||||
print("Mine blocks A-B-C on Node 0") | print("Mine blocks A-B-C on Node 0") | ||||
(hashA, hashB, hashC) = self.nodes[0].generate(3) | (hashA, hashB, hashC) = self.nodes[0].generate(3) | ||||
assert_equal(self.nodes[0].getblockcount(), 5) | assert_equal(self.nodes[0].getblockcount(), 5) | ||||
print("Mine competing blocks E-F-G on Node 1") | print("Mine competing blocks E-F-G on Node 1") | ||||
(hashE, hashF, hashG) = self.nodes[1].generate(3) | (hashE, hashF, hashG) = self.nodes[1].generate(3) | ||||
assert_equal(self.nodes[1].getblockcount(), 5) | assert_equal(self.nodes[1].getblockcount(), 5) | ||||
assert(hashC != hashG) | assert(hashC != hashG) | ||||
print("Connect nodes and check no reorg occurs") | print("Connect nodes and check no reorg occurs") | ||||
# Submit competing blocks via RPC so any reorg should occur before we proceed (no way to wait on inaction for p2p sync) | # Submit competing blocks via RPC so any reorg should occur before we | ||||
# proceed (no way to wait on inaction for p2p sync) | |||||
node_sync_via_rpc(self.nodes[0:2]) | node_sync_via_rpc(self.nodes[0:2]) | ||||
connect_nodes_bi(self.nodes,0,1) | connect_nodes_bi(self.nodes, 0, 1) | ||||
assert_equal(self.nodes[0].getbestblockhash(), hashC) | assert_equal(self.nodes[0].getbestblockhash(), hashC) | ||||
assert_equal(self.nodes[1].getbestblockhash(), hashG) | assert_equal(self.nodes[1].getbestblockhash(), hashG) | ||||
print("Make Node0 prefer block G") | print("Make Node0 prefer block G") | ||||
self.nodes[0].preciousblock(hashG) | self.nodes[0].preciousblock(hashG) | ||||
assert_equal(self.nodes[0].getbestblockhash(), hashG) | assert_equal(self.nodes[0].getbestblockhash(), hashG) | ||||
print("Make Node0 prefer block C again") | print("Make Node0 prefer block C again") | ||||
self.nodes[0].preciousblock(hashC) | self.nodes[0].preciousblock(hashC) | ||||
assert_equal(self.nodes[0].getbestblockhash(), hashC) | assert_equal(self.nodes[0].getbestblockhash(), hashC) | ||||
print("Make Node1 prefer block C") | print("Make Node1 prefer block C") | ||||
self.nodes[1].preciousblock(hashC) | self.nodes[1].preciousblock(hashC) | ||||
sync_chain(self.nodes[0:2]) # wait because node 1 may not have downloaded hashC | sync_chain(self.nodes[0:2]) | ||||
# wait because node 1 may not have downloaded hashC | |||||
assert_equal(self.nodes[1].getbestblockhash(), hashC) | assert_equal(self.nodes[1].getbestblockhash(), hashC) | ||||
print("Make Node1 prefer block G again") | print("Make Node1 prefer block G again") | ||||
self.nodes[1].preciousblock(hashG) | self.nodes[1].preciousblock(hashG) | ||||
assert_equal(self.nodes[1].getbestblockhash(), hashG) | assert_equal(self.nodes[1].getbestblockhash(), hashG) | ||||
print("Make Node0 prefer block G again") | print("Make Node0 prefer block G again") | ||||
self.nodes[0].preciousblock(hashG) | self.nodes[0].preciousblock(hashG) | ||||
assert_equal(self.nodes[0].getbestblockhash(), hashG) | assert_equal(self.nodes[0].getbestblockhash(), hashG) | ||||
print("Make Node1 prefer block C again") | print("Make Node1 prefer block C again") | ||||
Show All 9 Lines | def run_test(self): | ||||
self.nodes[1].preciousblock(hashC) | self.nodes[1].preciousblock(hashC) | ||||
assert_equal(self.nodes[1].getbestblockhash(), hashH) | assert_equal(self.nodes[1].getbestblockhash(), hashH) | ||||
print("Mine competing blocks I-J-K-L on Node 2") | print("Mine competing blocks I-J-K-L on Node 2") | ||||
self.nodes[2].generate(4) | self.nodes[2].generate(4) | ||||
assert_equal(self.nodes[2].getblockcount(), 6) | assert_equal(self.nodes[2].getblockcount(), 6) | ||||
hashL = self.nodes[2].getbestblockhash() | hashL = self.nodes[2].getbestblockhash() | ||||
print("Connect nodes and check no reorg occurs") | print("Connect nodes and check no reorg occurs") | ||||
node_sync_via_rpc(self.nodes[1:3]) | node_sync_via_rpc(self.nodes[1:3]) | ||||
connect_nodes_bi(self.nodes,1,2) | connect_nodes_bi(self.nodes, 1, 2) | ||||
connect_nodes_bi(self.nodes,0,2) | connect_nodes_bi(self.nodes, 0, 2) | ||||
assert_equal(self.nodes[0].getbestblockhash(), hashH) | assert_equal(self.nodes[0].getbestblockhash(), hashH) | ||||
assert_equal(self.nodes[1].getbestblockhash(), hashH) | assert_equal(self.nodes[1].getbestblockhash(), hashH) | ||||
assert_equal(self.nodes[2].getbestblockhash(), hashL) | assert_equal(self.nodes[2].getbestblockhash(), hashL) | ||||
print("Make Node1 prefer block L") | print("Make Node1 prefer block L") | ||||
self.nodes[1].preciousblock(hashL) | self.nodes[1].preciousblock(hashL) | ||||
assert_equal(self.nodes[1].getbestblockhash(), hashL) | assert_equal(self.nodes[1].getbestblockhash(), hashL) | ||||
print("Make Node2 prefer block H") | print("Make Node2 prefer block H") | ||||
self.nodes[2].preciousblock(hashH) | self.nodes[2].preciousblock(hashH) | ||||
assert_equal(self.nodes[2].getbestblockhash(), hashH) | assert_equal(self.nodes[2].getbestblockhash(), hashH) | ||||
if __name__ == '__main__': | if __name__ == '__main__': | ||||
PreciousTest().main() | PreciousTest().main() |