mirror of
https://github.com/dashpay/dash.git
synced 2024-12-26 20:42:59 +01:00
07dcddb4ca
* Merge #9815: Trivial: use EXIT_ codes instead of magic numbersa87d02ause EXIT_ codes instead of magic numbers (Marko Bencun) * Merge #9801: Removed redundant parameter from mempool.PrioritiseTransactioneaea2bbRemoved redundant parameter from mempool.PrioritiseTransaction (gubatron) * remove extra parameter (see 3a3745bb) in dash specific code * Merge #9819: Remove harmless read of unusued priority estimatesbc8fd12Remove harmless read of unusued priority estimates (Alex Morcos) * Merge #9766: Add --exclude option to rpc-tests.pyc578408Add exclude option to rpc-tests.py (John Newbery) * Merge #9577: Fix docstrings in qa tests3f95a80Fix docstrings in qa tests (John Newbery) * Merge #9823: qa: Set correct path for binaries in rpc tests3333ad0qa: Set correct path for binaries in rpc tests (MarcoFalke) * Merge #9833: Trivial: fix comments referencing AppInit2ef9f495Trivial: fix comments referencing AppInit2 (Marko Bencun) * Merge #9612: [trivial] Rephrase the definition of difficulty.dc222f8Trivial: Rephrase the definition of difficulty in the code. (Karl-Johan Alm) * Merge #9847: Extra test vector for BIP3230aedcbBIP32 extra test vector (Pieter Wuille) * Merge #9839: [qa] Make import-rescan.py watchonly check reliable864890a[qa] Make import-rescan.py watchonly check reliable (Russell Yanofsky) Tree-SHA512: ea0e2b1d4fc8f35174c3d575fb751b428daf6ad3aa944fad4e3ddcc9195e4f17051473acabc54203b1d27cca64cf911b737ab92e986c40ef384410652e2dbea1 * Change back file params
69 lines
2.3 KiB
Python
Executable File
69 lines
2.3 KiB
Python
Executable File
#!/usr/bin/env python3
|
|
# Copyright (c) 2014-2016 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 the getchaintips RPC.
|
|
|
|
- introduce a network split
|
|
- work on chains of different lengths
|
|
- join the network together again
|
|
- verify that getchaintips now returns two chain tips.
|
|
"""
|
|
|
|
from test_framework.test_framework import BitcoinTestFramework
|
|
from test_framework.util import assert_equal
|
|
|
|
class GetChainTipsTest (BitcoinTestFramework):
|
|
def __init__(self):
|
|
super().__init__()
|
|
self.num_nodes = 4
|
|
self.setup_clean_chain = False
|
|
|
|
def run_test (self):
|
|
|
|
tips = self.nodes[0].getchaintips ()
|
|
assert_equal (len (tips), 1)
|
|
assert_equal (tips[0]['branchlen'], 0)
|
|
assert_equal (tips[0]['height'], 200)
|
|
assert_equal (tips[0]['status'], 'active')
|
|
|
|
# Split the network and build two chains of different lengths.
|
|
self.split_network ()
|
|
self.nodes[0].generate(10)
|
|
self.nodes[2].generate(20)
|
|
self.sync_all ()
|
|
|
|
tips = self.nodes[1].getchaintips ()
|
|
assert_equal (len (tips), 1)
|
|
shortTip = tips[0]
|
|
assert_equal (shortTip['branchlen'], 0)
|
|
assert_equal (shortTip['height'], 210)
|
|
assert_equal (tips[0]['status'], 'active')
|
|
|
|
tips = self.nodes[3].getchaintips ()
|
|
assert_equal (len (tips), 1)
|
|
longTip = tips[0]
|
|
assert_equal (longTip['branchlen'], 0)
|
|
assert_equal (longTip['height'], 220)
|
|
assert_equal (tips[0]['status'], 'active')
|
|
|
|
# Join the network halves and check that we now have two tips
|
|
# (at least at the nodes that previously had the short chain).
|
|
self.join_network ()
|
|
|
|
tips = self.nodes[0].getchaintips ()
|
|
assert_equal (len (tips), 2)
|
|
assert_equal (tips[0], longTip)
|
|
|
|
assert_equal (tips[1]['branchlen'], 10)
|
|
assert_equal (tips[1]['status'], 'valid-fork')
|
|
# We already checked that the long tip is the active one,
|
|
# update data to verify that the short tip matches the expected one.
|
|
tips[1]['branchlen'] = 0
|
|
tips[1]['status'] = 'active'
|
|
tips[1]['forkpoint'] = tips[1]['hash']
|
|
assert_equal (tips[1], shortTip)
|
|
|
|
if __name__ == '__main__':
|
|
GetChainTipsTest ().main ()
|