feef2f8791
* updater: apply exponential backoff after download failure (#8059)
* updater: apply exponential backoff after download failure
* updater: reset backoff on new release
* Limit incoming connections. (#8060)
* Limit ingress connections
* Optimized handshakes logging
* Max code size on Kovan (#8067)
* Enable code size limit on kovan
* Fix formatting.
* add some dos protection (#8084)
* more dos protection (#8104)
* Const time comparison (#8113)
* Use `subtle::slices_equal` for constant time comparison.
Also update the existing version of subtle in `ethcrypto` from
0.1 to 0.5
* Test specifically for InvalidPassword error.
* revert removing blooms (#8066)
* Revert "fix traces, removed bloomchain crate, closes #7228, closes #7167"
This reverts commit 1bf62038678295e5586f02a38a0c5aab9a9efe62.
* Revert "fixed broken logs (#7934)"
This reverts commit f8a2e53f3e.
* fixed broken logs
* bring back old lock order
* remove migration v13
* revert CURRENT_VERSION to 12 in migration.rs
* Fix compilation.
* Check one step deeper if we're on release track branches
* add missing pr
* Fix blooms?
* Fix tests compiilation.
* Fix size.
56 lines
1.5 KiB
Rust
56 lines
1.5 KiB
Rust
// Copyright 2015-2017 Parity Technologies (UK) Ltd.
|
|
// This file is part of Parity.
|
|
|
|
// Parity is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
|
|
// Parity is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with Parity. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
use bloomchain::group as bc;
|
|
use bloomchain::{Bloom, BloomCompat};
|
|
use heapsize::HeapSizeOf;
|
|
|
|
/// Represents group of X consecutive blooms.
|
|
#[derive(Debug, Clone, RlpEncodableWrapper, RlpDecodableWrapper)]
|
|
pub struct BloomGroup {
|
|
blooms: Vec<Bloom>,
|
|
}
|
|
|
|
impl BloomGroup {
|
|
pub fn accrue_bloom_group(&mut self, group: &BloomGroup) {
|
|
for (bloom, other) in self.blooms.iter_mut().zip(group.blooms.iter()) {
|
|
bloom.accrue_bloom(other);
|
|
}
|
|
}
|
|
}
|
|
|
|
impl From<bc::BloomGroup> for BloomGroup {
|
|
fn from(group: bc::BloomGroup) -> Self {
|
|
BloomGroup {
|
|
blooms: group.blooms
|
|
}
|
|
}
|
|
}
|
|
|
|
impl Into<bc::BloomGroup> for BloomGroup {
|
|
fn into(self) -> bc::BloomGroup {
|
|
bc::BloomGroup {
|
|
blooms: self.blooms
|
|
}
|
|
}
|
|
}
|
|
|
|
impl HeapSizeOf for BloomGroup {
|
|
fn heap_size_of_children(&self) -> usize {
|
|
self.blooms.heap_size_of_children()
|
|
}
|
|
}
|