Peerplays_Blockchain/peerplays_migrated
1
0
Fork 0
Code Issues 35 Pull requests 4 Projects Releases 20 Packages Wiki Activity Actions

potential fix and extra debugging for get_scheduled_witness

Browse source
This commit is contained in:
Daniel Larimer 2015-08-27 10:46:09 -04:00
parent b8e16e2e94
commit 3bc66e31a2
1 changed files with 15 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

20
libraries/chain/db_witness_schedule.cpp
View file

@ -45,12 +45,11 @@ witness_id_type database::get_scheduled_witness( uint32_t slot_num )const
const flat_set< witness_id_type >& active_witnesses = get_global_properties().active_witnesses; const flat_set< witness_id_type >& active_witnesses = get_global_properties().active_witnesses;
uint32_t n = active_witnesses.size(); uint32_t n = active_witnesses.size();
uint64_t min_witness_separation = (n / 2)+1; uint64_t min_witness_separation = (n / 2); /// should work in cases where n is 0,1, and 2
uint64_t current_aslot = get_dynamic_global_properties().current_aslot + slot_num; uint64_t current_aslot = get_dynamic_global_properties().current_aslot + slot_num;
uint64_t start_of_current_round_aslot = current_aslot - (current_aslot % n); uint64_t start_of_current_round_aslot = current_aslot - (current_aslot % n);
uint64_t first_ineligible_aslot = std::min( uint64_t first_ineligible_aslot = std::min( start_of_current_round_aslot + 1, current_aslot - min_witness_separation );
start_of_current_round_aslot, current_aslot - min_witness_separation );
// //
// overflow analysis of above subtraction: // overflow analysis of above subtraction:
// //
@ -76,7 +75,9 @@ witness_id_type database::get_scheduled_witness( uint32_t slot_num )const
if( wit.last_aslot >= first_ineligible_aslot ) if( wit.last_aslot >= first_ineligible_aslot )
continue; continue;
uint64_t k = now_hi + uint64_t(wit_id); /// High performance random generator
/// http://xorshift.di.unimi.it/
uint64_t k = now_hi + uint64_t(wit_id)*2685821657736338717ULL;
k ^= (k >> 12); k ^= (k >> 12);
k ^= (k << 25); k ^= (k << 25);
k ^= (k >> 27); k ^= (k >> 27);
@ -93,8 +94,17 @@ witness_id_type database::get_scheduled_witness( uint32_t slot_num )const
// at most K elements are susceptible to the filter, // at most K elements are susceptible to the filter,
// otherwise we have an inconsistent database (such as // otherwise we have an inconsistent database (such as
// wit.last_aslot values that are non-unique or in the future) // wit.last_aslot values that are non-unique or in the future)
if( !success ) {
edump((best_k)(slot_num)(first_ineligible_aslot)(current_aslot)(start_of_current_round_aslot)(min_witness_separation)(active_witnesses.size()));
assert( success ); for( const witness_id_type& wit_id : active_witnesses )
{
const witness_object& wit = wit_id(*this);
if( wit.last_aslot >= first_ineligible_aslot )
idump((wit_id)(wit.last_aslot));
}
assert( success );
}
return best_wit; return best_wit;
} }