Changeset View
Changeset View
Standalone View
Standalone View
test/functional/preciousblock.py
| Show First 20 Lines • Show All 66 Lines • ▼ Show 20 Lines | def run_test(self): | ||||
| self.log.info("Mine competing blocks E-F-G on Node 1") | self.log.info("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) | ||||
| self.log.info("Connect nodes and check no reorg occurs") | self.log.info("Connect nodes and check no reorg occurs") | ||||
| # Submit competing blocks via RPC so any reorg should occur before we | # Submit competing blocks via RPC so any reorg should occur before we | ||||
| # proceed (no way to wait on inaction for p2p sync) | # 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], self.nodes[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) | ||||
| self.log.info("Make Node0 prefer block G") | self.log.info("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) | ||||
| self.log.info("Make Node0 prefer block C again") | self.log.info("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) | ||||
| Show All 22 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) | ||||
| self.log.info("Mine competing blocks I-J-K-L on Node 2") | self.log.info("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() | ||||
| self.log.info("Connect nodes and check no reorg occurs") | self.log.info("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], self.nodes[2]) | ||||
| connect_nodes_bi(self.nodes, 0, 2) | connect_nodes_bi(self.nodes[0], self.nodes[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) | ||||
| self.log.info("Make Node1 prefer block L") | self.log.info("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) | ||||
| self.log.info("Make Node2 prefer block H") | self.log.info("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() | ||||