93 lines
3.5 KiB
Python
Executable file
93 lines
3.5 KiB
Python
Executable file
#!/usr/bin/env python3
|
|
# Copyright (c) 2016-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 processing of feefilter messages."""
|
|
|
|
from test_framework.mininode import *
|
|
from test_framework.test_framework import BitcoinTestFramework
|
|
from test_framework.util import *
|
|
import time
|
|
|
|
|
|
def hashToHex(hash):
|
|
return format(hash, '064x')
|
|
|
|
# Wait up to 60 secs to see if the testnode has received all the expected invs
|
|
def allInvsMatch(invsExpected, testnode):
|
|
for x in range(60):
|
|
with mininode_lock:
|
|
if (sorted(invsExpected) == sorted(testnode.txinvs)):
|
|
return True
|
|
time.sleep(1)
|
|
return False
|
|
|
|
class TestP2PConn(P2PInterface):
|
|
def __init__(self):
|
|
super().__init__()
|
|
self.txinvs = []
|
|
|
|
def on_inv(self, message):
|
|
for i in message.inv:
|
|
if (i.type == 1):
|
|
self.txinvs.append(hashToHex(i.hash))
|
|
|
|
def clear_invs(self):
|
|
with mininode_lock:
|
|
self.txinvs = []
|
|
|
|
class FeeFilterTest(BitcoinTestFramework):
|
|
def set_test_params(self):
|
|
self.num_nodes = 2
|
|
|
|
def run_test(self):
|
|
node1 = self.nodes[1]
|
|
node0 = self.nodes[0]
|
|
# Get out of IBD
|
|
node1.generate(1)
|
|
sync_blocks(self.nodes)
|
|
|
|
# Setup the p2p connections and start up the network thread.
|
|
self.nodes[0].add_p2p_connection(TestP2PConn())
|
|
network_thread_start()
|
|
self.nodes[0].p2p.wait_for_verack()
|
|
|
|
# Test that invs are received for all txs at feerate of 20 sat/byte
|
|
node1.settxfee(Decimal("0.00020000"))
|
|
txids = [node1.sendtoaddress(node1.getnewaddress(), 1) for x in range(3)]
|
|
assert(allInvsMatch(txids, self.nodes[0].p2p))
|
|
self.nodes[0].p2p.clear_invs()
|
|
|
|
# Set a filter of 15 sat/byte
|
|
self.nodes[0].p2p.send_and_ping(msg_feefilter(15000))
|
|
|
|
# Test that txs are still being received (paying 20 sat/byte)
|
|
txids = [node1.sendtoaddress(node1.getnewaddress(), 1) for x in range(3)]
|
|
assert(allInvsMatch(txids, self.nodes[0].p2p))
|
|
self.nodes[0].p2p.clear_invs()
|
|
|
|
# Change tx fee rate to 10 sat/byte and test they are no longer received
|
|
node1.settxfee(Decimal("0.00010000"))
|
|
[node1.sendtoaddress(node1.getnewaddress(), 1) for x in range(3)]
|
|
sync_mempools(self.nodes) # must be sure node 0 has received all txs
|
|
|
|
# Send one transaction from node0 that should be received, so that we
|
|
# we can sync the test on receipt (if node1's txs were relayed, they'd
|
|
# be received by the time this node0 tx is received). This is
|
|
# unfortunately reliant on the current relay behavior where we batch up
|
|
# to 35 entries in an inv, which means that when this next transaction
|
|
# is eligible for relay, the prior transactions from node1 are eligible
|
|
# as well.
|
|
node0.settxfee(Decimal("0.00020000"))
|
|
txids = [node0.sendtoaddress(node0.getnewaddress(), 1)]
|
|
assert(allInvsMatch(txids, self.nodes[0].p2p))
|
|
self.nodes[0].p2p.clear_invs()
|
|
|
|
# Remove fee filter and check that txs are received again
|
|
self.nodes[0].p2p.send_and_ping(msg_feefilter(0))
|
|
txids = [node1.sendtoaddress(node1.getnewaddress(), 1) for x in range(3)]
|
|
assert(allInvsMatch(txids, self.nodes[0].p2p))
|
|
self.nodes[0].p2p.clear_invs()
|
|
|
|
if __name__ == '__main__':
|
|
FeeFilterTest().main()
|