diff options
| author | Wladimir J. van der Laan <[email protected]> | 2016-01-18 10:26:42 +0100 |
|---|---|---|
| committer | Wladimir J. van der Laan <[email protected]> | 2016-01-18 10:26:48 +0100 |
| commit | f2cf071e702ffe5a3fec5e21804d18211af9015d (patch) | |
| tree | a54cd0b0baedd53411a62ef1795d68f43e889f64 | |
| parent | Merge pull request #7322 (diff) | |
| parent | Eliminate race condition in mempool_packages test (diff) | |
| download | discoin-f2cf071e702ffe5a3fec5e21804d18211af9015d.tar.xz discoin-f2cf071e702ffe5a3fec5e21804d18211af9015d.zip | |
Merge pull request #7368
4d10d2e Eliminate race condition in mempool_packages test (Suhas Daftuar)
| -rwxr-xr-x | qa/rpc-tests/mempool_packages.py | 9 |
1 files changed, 9 insertions, 0 deletions
diff --git a/qa/rpc-tests/mempool_packages.py b/qa/rpc-tests/mempool_packages.py index 063308d39..47c1028b9 100755 --- a/qa/rpc-tests/mempool_packages.py +++ b/qa/rpc-tests/mempool_packages.py @@ -87,9 +87,18 @@ class MempoolPackagesTest(BitcoinTestFramework): print "too-long-ancestor-chain successfully rejected" # Check that prioritising a tx before it's added to the mempool works + # First clear the mempool by mining a block. self.nodes[0].generate(1) + sync_blocks(self.nodes) + assert_equal(len(self.nodes[0].getrawmempool()), 0) + # Prioritise a transaction that has been mined, then add it back to the + # mempool by using invalidateblock. self.nodes[0].prioritisetransaction(chain[-1], 0, 2000) self.nodes[0].invalidateblock(self.nodes[0].getbestblockhash()) + # Keep node1's tip synced with node0 + self.nodes[1].invalidateblock(self.nodes[1].getbestblockhash()) + + # Now check that the transaction is in the mempool, with the right modified fee mempool = self.nodes[0].getrawmempool(True) descendant_fees = 0 |