-
Notifications
You must be signed in to change notification settings - Fork 71
/
Copy pathunapplied_transaction_queue_tests.cpp
416 lines (365 loc) · 14.6 KB
/
unapplied_transaction_queue_tests.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
#include <boost/test/unit_test.hpp>
#include <eosio/testing/tester.hpp>
#include <eosio/chain/unapplied_transaction_queue.hpp>
#include <eosio/chain/contract_types.hpp>
using namespace eosio;
using namespace eosio::chain;
BOOST_AUTO_TEST_SUITE(unapplied_transaction_queue_tests)
auto unique_trx_meta_data( fc::time_point expire = fc::time_point::now() + fc::seconds( 120 ) ) {
static uint64_t nextid = 0;
++nextid;
signed_transaction trx;
account_name creator = config::system_account_name;
trx.expiration = fc::time_point_sec{expire};
trx.actions.emplace_back( vector<permission_level>{{creator,config::active_name}},
onerror{ nextid, "test", 4 });
return transaction_metadata::create_no_recover_keys( std::make_shared<packed_transaction>( std::move(trx) ),
transaction_metadata::trx_type::input );
}
auto next( unapplied_transaction_queue& q ) {
transaction_metadata_ptr trx;
auto itr = q.begin();
if( itr != q.end() ) {
trx = itr->trx_meta;
q.erase( itr );
}
return trx;
}
auto create_test_block_state( deque<transaction_metadata_ptr> trx_metas ) {
signed_block_ptr block = std::make_shared<signed_block>();
for( auto& trx_meta : trx_metas ) {
block->transactions.emplace_back( *trx_meta->packed_trx() );
}
block->producer = eosio::chain::config::system_account_name;
auto priv_key = eosio::testing::base_tester::get_private_key( block->producer, "active" );
auto pub_key = eosio::testing::base_tester::get_public_key( block->producer, "active" );
auto prev = std::make_shared<block_state_legacy>();
auto header_bmroot = digest_type::hash( std::make_pair( block->digest(), prev->blockroot_merkle.get_root() ) );
auto sig_digest = digest_type::hash( std::make_pair(header_bmroot, prev->pending_schedule.schedule_hash) );
block->producer_signature = priv_key.sign( sig_digest );
vector<private_key_type> signing_keys;
signing_keys.emplace_back( std::move( priv_key ) );
auto signer = [&]( digest_type d ) {
std::vector<signature_type> result;
result.reserve(signing_keys.size());
for (const auto& k: signing_keys)
result.emplace_back(k.sign(d));
return result;
};
pending_block_header_state_legacy pbhs;
pbhs.producer = block->producer;
producer_authority_schedule schedule = { 0, { producer_authority{block->producer, block_signing_authority_v0{ 1, {{pub_key, 1}} } } } };
pbhs.active_schedule = schedule;
pbhs.valid_block_signing_authority = block_signing_authority_v0{ 1, {{pub_key, 1}} };
auto bsp = std::make_shared<block_state_legacy>(
std::move( pbhs ),
std::move( block ),
std::move( trx_metas ),
protocol_feature_set(),
[]( block_timestamp_type timestamp,
const flat_set<digest_type>& cur_features,
const vector<digest_type>& new_features )
{},
signer
);
return bsp;
}
// given a current itr make sure expected number of items are iterated over
void verify_order( unapplied_transaction_queue& q, unapplied_transaction_queue::iterator itr, size_t expected ) {
size_t size = 0;
std::set<transaction_id_type> ids;
for( ; itr != q.end(); ++itr, ++size ) {
ids.insert( itr->id() );
}
BOOST_TEST( size == expected );
BOOST_TEST( ids.size() == expected );
}
BOOST_AUTO_TEST_CASE( unapplied_transaction_queue_test ) try {
unapplied_transaction_queue q;
BOOST_CHECK( q.empty() );
BOOST_CHECK( q.size() == 0u );
auto trx1 = unique_trx_meta_data();
auto trx2 = unique_trx_meta_data();
auto trx3 = unique_trx_meta_data();
auto trx4 = unique_trx_meta_data();
auto trx5 = unique_trx_meta_data();
auto trx6 = unique_trx_meta_data();
auto trx7 = unique_trx_meta_data();
auto trx8 = unique_trx_meta_data();
auto trx9 = unique_trx_meta_data();
// empty
auto p = next( q );
BOOST_CHECK( p == nullptr );
// fifo aborted
q.add_aborted( { trx1, trx2, trx3 } );
q.add_aborted( { trx1, trx2, trx3 } ); // duplicates ignored
BOOST_CHECK( q.size() == 3u );
BOOST_REQUIRE( next( q ) == trx1 );
BOOST_CHECK( q.size() == 2u );
BOOST_REQUIRE( next( q ) == trx2 );
BOOST_CHECK( q.size() == 1u );
BOOST_REQUIRE( next( q ) == trx3 );
BOOST_CHECK( q.size() == 0u );
BOOST_REQUIRE( next( q ) == nullptr );
BOOST_CHECK( q.empty() );
// clear applied
q.add_aborted( { trx1, trx2, trx3 } );
auto bs0 = create_test_block_state( { trx1, trx3, trx4 } );
q.clear_applied( bs0->block );
BOOST_CHECK( q.size() == 1u );
BOOST_REQUIRE( next( q ) == trx2 );
BOOST_CHECK( q.size() == 0u );
BOOST_REQUIRE( next( q ) == nullptr );
BOOST_CHECK( q.empty() );
// fifo forked, one fork
auto bs1 = create_test_block_state( { trx1, trx2 } );
auto bs2 = create_test_block_state( { trx3, trx4, trx5 } );
auto bs3 = create_test_block_state( { trx6 } );
q.add_forked( { bs3, bs2, bs1, bs1 } ); // bs1 duplicate ignored
BOOST_CHECK( q.size() == 6u );
BOOST_REQUIRE( next( q ) == trx1 );
BOOST_CHECK( q.size() == 5u );
BOOST_REQUIRE( next( q ) == trx2 );
BOOST_CHECK( q.size() == 4u );
BOOST_REQUIRE_EQUAL( next( q ), trx3 );
BOOST_CHECK( q.size() == 3u );
BOOST_REQUIRE( next( q ) == trx4 );
BOOST_CHECK( q.size() == 2u );
BOOST_REQUIRE( next( q ) == trx5 );
BOOST_CHECK( q.size() == 1u );
BOOST_REQUIRE( next( q ) == trx6 );
BOOST_CHECK( q.size() == 0u );
BOOST_REQUIRE( next( q ) == nullptr );
BOOST_CHECK( q.empty() );
// fifo forked
auto bs4 = create_test_block_state( { trx7 } );
q.add_forked( { bs1 } );
q.add_forked( { bs3, bs2 } );
q.add_forked( { bs4 } );
BOOST_CHECK( q.size() == 7u );
BOOST_REQUIRE( next( q ) == trx1 );
BOOST_CHECK( q.size() == 6u );
BOOST_REQUIRE( next( q ) == trx2 );
BOOST_CHECK( q.size() == 5u );
BOOST_REQUIRE_EQUAL( next( q ), trx3 );
BOOST_CHECK( q.size() == 4u );
BOOST_REQUIRE( next( q ) == trx4 );
BOOST_CHECK( q.size() == 3u );
BOOST_REQUIRE( next( q ) == trx5 );
BOOST_CHECK( q.size() == 2u );
BOOST_REQUIRE( next( q ) == trx6 );
BOOST_CHECK( q.size() == 1u );
BOOST_REQUIRE( next( q ) == trx7 );
BOOST_CHECK( q.size() == 0u );
BOOST_REQUIRE( next( q ) == nullptr );
BOOST_CHECK( q.empty() );
auto trx11 = unique_trx_meta_data();
auto trx12 = unique_trx_meta_data();
auto trx13 = unique_trx_meta_data();
auto trx14 = unique_trx_meta_data();
auto trx15 = unique_trx_meta_data();
auto trx16 = unique_trx_meta_data();
auto trx17 = unique_trx_meta_data();
auto trx18 = unique_trx_meta_data();
auto trx19 = unique_trx_meta_data();
// fifo forked, multi forks
auto bs5 = create_test_block_state( { trx11, trx12, trx13 } );
auto bs6 = create_test_block_state( { trx11, trx15 } );
q.add_forked( { bs3, bs2, bs1 } );
q.add_forked( { bs4 } );
q.add_forked( { bs3, bs2 } ); // dups ignored
q.add_forked( { bs6, bs5 } );
BOOST_CHECK_EQUAL( q.size(), 11u );
BOOST_REQUIRE( next( q ) == trx1 );
BOOST_CHECK( q.size() == 10u );
BOOST_REQUIRE( next( q ) == trx2 );
BOOST_CHECK( q.size() == 9u );
BOOST_REQUIRE_EQUAL( next( q ), trx3 );
BOOST_CHECK( q.size() == 8u );
BOOST_REQUIRE( next( q ) == trx4 );
BOOST_CHECK( q.size() == 7u );
BOOST_REQUIRE( next( q ) == trx5 );
BOOST_CHECK( q.size() == 6u );
BOOST_REQUIRE( next( q ) == trx6 );
BOOST_CHECK( q.size() == 5u );
BOOST_REQUIRE( next( q ) == trx7 );
BOOST_CHECK( q.size() == 4u );
BOOST_REQUIRE_EQUAL( next( q ), trx11 );
BOOST_CHECK( q.size() == 3u );
BOOST_REQUIRE( next( q ) == trx12 );
BOOST_CHECK( q.size() == 2u );
BOOST_REQUIRE( next( q ) == trx13 );
BOOST_CHECK( q.size() == 1u );
BOOST_REQUIRE( next( q ) == trx15 );
BOOST_CHECK( q.size() == 0u );
BOOST_REQUIRE( next( q ) == nullptr );
BOOST_CHECK( q.empty() );
// altogether, order fifo: forked, aborted
q.add_forked( { bs3, bs2, bs1 } );
q.add_aborted( { trx9, trx14 } );
q.add_aborted( { trx18, trx19 } );
q.add_forked( { bs6, bs5, bs4 } );
// verify order
verify_order( q, q.begin(), 15 );
// verify type order
BOOST_CHECK( q.size() == 15u );
verify_order( q, q.lower_bound(trx1->id()), 15 );
BOOST_REQUIRE( next( q ) == trx1 );
BOOST_CHECK( q.size() == 14u );
verify_order( q, q.lower_bound(trx2->id()), 14 );
BOOST_REQUIRE( next( q ) == trx2 );
BOOST_CHECK( q.size() == 13u );
verify_order( q, q.lower_bound(trx3->id()), 13 );
verify_order( q, q.lower_bound(trx15->id()), 5 );
BOOST_REQUIRE_EQUAL( next( q ), trx3 );
BOOST_CHECK( q.size() == 12u );
verify_order( q, q.lower_bound(trx4->id()), 12 );
BOOST_REQUIRE( next( q ) == trx4 );
BOOST_CHECK( q.size() == 11u );
verify_order( q, q.lower_bound(trx5->id()), 11 );
BOOST_REQUIRE( next( q ) == trx5 );
BOOST_CHECK( q.size() == 10u );
verify_order( q, q.lower_bound(trx6->id()), 10 );
verify_order( q, q.lower_bound(trx15->id()), 5 );
BOOST_REQUIRE( next( q ) == trx6 );
BOOST_CHECK( q.size() == 9u );
verify_order( q, q.lower_bound(trx7->id()), 9 );
BOOST_REQUIRE( next( q ) == trx7 );
BOOST_CHECK( q.size() == 8u );
verify_order( q, q.lower_bound(trx11->id()), 8 );
BOOST_REQUIRE( next( q ) == trx11 );
BOOST_CHECK( q.size() == 7u );
verify_order( q, q.lower_bound(trx12->id()), 7 );
BOOST_REQUIRE_EQUAL( next( q ), trx12 );
BOOST_CHECK( q.size() == 6u );
verify_order( q, q.lower_bound(trx13->id()), 6 );
BOOST_REQUIRE( next( q ) == trx13 );
BOOST_CHECK( q.size() == 5u );
verify_order( q, q.lower_bound(trx15->id()), 5 );
BOOST_REQUIRE( next( q ) == trx15 );
BOOST_CHECK( q.size() == 4u );
verify_order( q, q.lower_bound(trx9->id()), 4 );
BOOST_REQUIRE( next( q ) == trx9 );
BOOST_CHECK( q.size() == 3u );
verify_order( q, q.lower_bound(trx14->id()), 3 );
BOOST_REQUIRE( next( q ) == trx14 );
BOOST_CHECK( q.size() == 2u );
verify_order( q, q.lower_bound(trx18->id()), 2 );
BOOST_REQUIRE( next( q ) == trx18 );
BOOST_CHECK( q.size() == 1u );
verify_order( q, q.lower_bound(trx19->id()), 1 );
BOOST_REQUIRE( next( q ) == trx19 );
BOOST_CHECK( q.size() == 0u );
verify_order( q, q.lower_bound(trx19->id()), 0 );
BOOST_REQUIRE( next( q ) == nullptr );
BOOST_CHECK( q.empty() );
auto trx20 = unique_trx_meta_data( fc::time_point::now() - fc::seconds( 1 ) );
auto trx21 = unique_trx_meta_data( fc::time_point::now() - fc::seconds( 1 ) );
auto trx22 = unique_trx_meta_data( fc::time_point::now() + fc::seconds( 120 ) );
auto trx23 = unique_trx_meta_data( fc::time_point::now() + fc::seconds( 120 ) );
q.add_aborted( { trx20, trx22 } );
q.clear_expired( fc::time_point::now(), [](){ return false; }, [](auto, auto){} );
BOOST_CHECK( q.size() == 1u );
BOOST_REQUIRE( next( q ) == trx22 );
BOOST_CHECK( q.empty() );
q.add_forked( { bs3, bs2, bs1 } );
q.add_aborted( { trx9, trx11 } );
q.clear();
BOOST_CHECK( q.empty() );
BOOST_CHECK( q.size() == 0u );
BOOST_REQUIRE( next( q ) == nullptr );
} FC_LOG_AND_RETHROW() /// unapplied_transaction_queue_test
BOOST_AUTO_TEST_CASE( unapplied_transaction_queue_erase_add ) try {
unapplied_transaction_queue q;
BOOST_CHECK( q.empty() );
BOOST_CHECK( q.size() == 0u );
auto trx1 = unique_trx_meta_data();
auto trx2 = unique_trx_meta_data();
auto trx3 = unique_trx_meta_data();
auto trx4 = unique_trx_meta_data();
auto trx5 = unique_trx_meta_data();
auto trx6 = unique_trx_meta_data();
auto trx7 = unique_trx_meta_data();
auto trx8 = unique_trx_meta_data();
auto trx9 = unique_trx_meta_data();
q.add_incoming( trx1, false, false, [](auto){} );
q.add_incoming( trx2, false, false, [](auto){} );
q.add_incoming( trx3, false, false, [](auto){} );
q.add_incoming( trx4, false, false, [](auto){} );
q.add_incoming( trx5, false, false, [](auto){} );
q.add_incoming( trx6, false, false, [](auto){} );
auto itr = q.incoming_begin();
auto end = q.incoming_end();
auto count = q.incoming_size();
// count required to avoid infinite loop
while( count && itr != end ) {
auto trx_meta = itr->trx_meta;
if( count == 6 ) BOOST_CHECK( trx_meta == trx1 );
if( count == 5 ) BOOST_CHECK( trx_meta == trx2 );
if( count == 4 ) BOOST_CHECK( trx_meta == trx3 );
if( count == 3 ) BOOST_CHECK( trx_meta == trx4 );
if( count == 2 ) BOOST_CHECK( trx_meta == trx5 );
if( count == 1 ) BOOST_CHECK( trx_meta == trx6 );
itr = q.erase( itr );
q.add_incoming( trx_meta, false, false, [](auto){} );
--count;
}
BOOST_CHECK( q.size() == 6u );
BOOST_REQUIRE( next( q ) == trx1 );
BOOST_REQUIRE( next( q ) == trx2 );
BOOST_REQUIRE( next( q ) == trx3 );
BOOST_REQUIRE( next( q ) == trx4 );
BOOST_REQUIRE( next( q ) == trx5 );
BOOST_REQUIRE( next( q ) == trx6 );
BOOST_CHECK( q.empty() );
// incoming ++itr w/ erase
q.add_incoming( trx1, false, false, [](auto){} );
q.add_incoming( trx2, false, false, [](auto){} );
q.add_incoming( trx3, false, false, [](auto){} );
q.add_incoming( trx4, false, false, [](auto){} );
q.add_incoming( trx5, false, false, [](auto){} );
q.add_incoming( trx6, false, false, [](auto){} );
itr = q.incoming_begin();
end = q.incoming_end();
count = q.incoming_size();
while( itr != end ) {
if( count % 2 == 0) {
itr = q.erase( itr );
} else {
++itr;
}
--count;
}
BOOST_REQUIRE( count == 0 );
q.clear();
} FC_LOG_AND_RETHROW() /// unapplied_transaction_queue_test
BOOST_AUTO_TEST_CASE( unapplied_transaction_queue_incoming_count ) try {
unapplied_transaction_queue q;
BOOST_CHECK( q.empty() );
BOOST_CHECK( q.size() == 0u );
auto trx1 = unique_trx_meta_data();
auto trx2 = unique_trx_meta_data();
auto trx3 = unique_trx_meta_data();
auto trx4 = unique_trx_meta_data();
auto trx5 = unique_trx_meta_data();
auto trx6 = unique_trx_meta_data();
q.add_incoming( trx1, false, false, [](auto){} );
q.add_incoming( trx2, false, false, [](auto){} );
q.add_incoming( trx3, false, false, [](auto){} );
q.add_incoming( trx4, false, false, [](auto){} );
q.add_incoming( trx5, false, false, [](auto){} );
q.add_incoming( trx6, false, false, [](auto){} );
auto expected = q.size();
BOOST_CHECK( q.incoming_size() == expected );
auto itr = q.begin();
auto end = q.end();
unapplied_transaction_queue q2;
expected = 0;
while( itr != end ) {
q2.add_incoming( itr->trx_meta, false, false, [](auto){} );
++expected;
BOOST_TEST( q2.incoming_size() == expected );
++itr;
}
} FC_LOG_AND_RETHROW() /// unapplied_transaction_queue_incoming_count
BOOST_AUTO_TEST_SUITE_END()