Merge branch 'master' into engine-password
This commit is contained in:
commit
92d566c900
8
Cargo.lock
generated
8
Cargo.lock
generated
@ -24,7 +24,7 @@ dependencies = [
|
|||||||
"ethcore-stratum 1.4.0",
|
"ethcore-stratum 1.4.0",
|
||||||
"ethcore-util 1.5.0",
|
"ethcore-util 1.5.0",
|
||||||
"ethsync 1.5.0",
|
"ethsync 1.5.0",
|
||||||
"fdlimit 0.1.0",
|
"fdlimit 0.1.1 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||||
"hyper 0.9.10 (registry+https://github.com/rust-lang/crates.io-index)",
|
"hyper 0.9.10 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||||
"isatty 0.1.1 (registry+https://github.com/rust-lang/crates.io-index)",
|
"isatty 0.1.1 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||||
"lazy_static 0.2.1 (registry+https://github.com/rust-lang/crates.io-index)",
|
"lazy_static 0.2.1 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||||
@ -684,7 +684,8 @@ dependencies = [
|
|||||||
|
|
||||||
[[package]]
|
[[package]]
|
||||||
name = "fdlimit"
|
name = "fdlimit"
|
||||||
version = "0.1.0"
|
version = "0.1.1"
|
||||||
|
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||||
dependencies = [
|
dependencies = [
|
||||||
"libc 0.2.16 (registry+https://github.com/rust-lang/crates.io-index)",
|
"libc 0.2.16 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||||
]
|
]
|
||||||
@ -1270,7 +1271,7 @@ dependencies = [
|
|||||||
[[package]]
|
[[package]]
|
||||||
name = "parity-ui-precompiled"
|
name = "parity-ui-precompiled"
|
||||||
version = "1.4.0"
|
version = "1.4.0"
|
||||||
source = "git+https://github.com/ethcore/js-precompiled.git#7700411d2b0ba1372e0d6cf72a84ecf873a181f3"
|
source = "git+https://github.com/ethcore/js-precompiled.git#3cf6c68b7d08be71d12ff142e255a42043e50c75"
|
||||||
dependencies = [
|
dependencies = [
|
||||||
"parity-dapps-glue 1.4.0 (registry+https://github.com/rust-lang/crates.io-index)",
|
"parity-dapps-glue 1.4.0 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||||
]
|
]
|
||||||
@ -2027,6 +2028,7 @@ dependencies = [
|
|||||||
"checksum env_logger 0.3.3 (registry+https://github.com/rust-lang/crates.io-index)" = "aba65b63ffcc17ffacd6cf5aa843da7c5a25e3bd4bbe0b7def8b214e411250e5"
|
"checksum env_logger 0.3.3 (registry+https://github.com/rust-lang/crates.io-index)" = "aba65b63ffcc17ffacd6cf5aa843da7c5a25e3bd4bbe0b7def8b214e411250e5"
|
||||||
"checksum eth-secp256k1 0.5.4 (git+https://github.com/ethcore/rust-secp256k1)" = "<none>"
|
"checksum eth-secp256k1 0.5.4 (git+https://github.com/ethcore/rust-secp256k1)" = "<none>"
|
||||||
"checksum ethabi 0.2.2 (registry+https://github.com/rust-lang/crates.io-index)" = "f7b0c53453517f620847be51943db329276ae52f2e210cfc659e81182864be2f"
|
"checksum ethabi 0.2.2 (registry+https://github.com/rust-lang/crates.io-index)" = "f7b0c53453517f620847be51943db329276ae52f2e210cfc659e81182864be2f"
|
||||||
|
"checksum fdlimit 0.1.1 (registry+https://github.com/rust-lang/crates.io-index)" = "b1ee15a7050e5580b3712877157068ea713b245b080ff302ae2ca973cfcd9baa"
|
||||||
"checksum flate2 0.2.14 (registry+https://github.com/rust-lang/crates.io-index)" = "3eeb481e957304178d2e782f2da1257f1434dfecbae883bafb61ada2a9fea3bb"
|
"checksum flate2 0.2.14 (registry+https://github.com/rust-lang/crates.io-index)" = "3eeb481e957304178d2e782f2da1257f1434dfecbae883bafb61ada2a9fea3bb"
|
||||||
"checksum gcc 0.3.35 (registry+https://github.com/rust-lang/crates.io-index)" = "91ecd03771effb0c968fd6950b37e89476a578aaf1c70297d8e92b6516ec3312"
|
"checksum gcc 0.3.35 (registry+https://github.com/rust-lang/crates.io-index)" = "91ecd03771effb0c968fd6950b37e89476a578aaf1c70297d8e92b6516ec3312"
|
||||||
"checksum glob 0.2.11 (registry+https://github.com/rust-lang/crates.io-index)" = "8be18de09a56b60ed0edf84bc9df007e30040691af7acd1c41874faac5895bfb"
|
"checksum glob 0.2.11 (registry+https://github.com/rust-lang/crates.io-index)" = "8be18de09a56b60ed0edf84bc9df007e30040691af7acd1c41874faac5895bfb"
|
||||||
|
@ -30,7 +30,7 @@ serde = "0.8.0"
|
|||||||
serde_json = "0.8.0"
|
serde_json = "0.8.0"
|
||||||
hyper = { version = "0.9", default-features = false }
|
hyper = { version = "0.9", default-features = false }
|
||||||
ctrlc = { git = "https://github.com/ethcore/rust-ctrlc.git" }
|
ctrlc = { git = "https://github.com/ethcore/rust-ctrlc.git" }
|
||||||
fdlimit = { path = "util/fdlimit" }
|
fdlimit = "0.1"
|
||||||
ethcore = { path = "ethcore" }
|
ethcore = { path = "ethcore" }
|
||||||
ethcore-util = { path = "util" }
|
ethcore-util = { path = "util" }
|
||||||
ethsync = { path = "sync" }
|
ethsync = { path = "sync" }
|
||||||
|
@ -17,7 +17,7 @@
|
|||||||
//! A queue of blocks. Sits between network or other I/O and the `BlockChain`.
|
//! A queue of blocks. Sits between network or other I/O and the `BlockChain`.
|
||||||
//! Sorts them ready for blockchain insertion.
|
//! Sorts them ready for blockchain insertion.
|
||||||
|
|
||||||
use std::thread::{JoinHandle, self};
|
use std::thread::{self, JoinHandle};
|
||||||
use std::sync::atomic::{AtomicBool, AtomicUsize, Ordering as AtomicOrdering};
|
use std::sync::atomic::{AtomicBool, AtomicUsize, Ordering as AtomicOrdering};
|
||||||
use std::sync::{Condvar as SCondvar, Mutex as SMutex};
|
use std::sync::{Condvar as SCondvar, Mutex as SMutex};
|
||||||
use util::*;
|
use util::*;
|
||||||
@ -64,35 +64,11 @@ impl Default for Config {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
struct VerifierHandle {
|
// pool states
|
||||||
deleting: Arc<AtomicBool>,
|
enum State {
|
||||||
sleep: Arc<AtomicBool>,
|
// all threads with id < inner value are to work.
|
||||||
thread: JoinHandle<()>,
|
Work(usize),
|
||||||
}
|
Exit,
|
||||||
|
|
||||||
impl VerifierHandle {
|
|
||||||
// signal to the verifier thread that it should sleep.
|
|
||||||
fn sleep(&self) {
|
|
||||||
self.sleep.store(true, AtomicOrdering::SeqCst);
|
|
||||||
}
|
|
||||||
|
|
||||||
// signal to the verifier thread that it should wake up.
|
|
||||||
fn wake_up(&self) {
|
|
||||||
self.sleep.store(false, AtomicOrdering::SeqCst);
|
|
||||||
self.thread.thread().unpark();
|
|
||||||
}
|
|
||||||
|
|
||||||
// signal to the verifier thread that it should conclude its
|
|
||||||
// operations.
|
|
||||||
fn conclude(&self) {
|
|
||||||
self.wake_up();
|
|
||||||
self.deleting.store(true, AtomicOrdering::Release);
|
|
||||||
}
|
|
||||||
|
|
||||||
// join the verifier thread.
|
|
||||||
fn join(self) {
|
|
||||||
self.thread.join().expect("Verifier thread panicked");
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/// An item which is in the process of being verified.
|
/// An item which is in the process of being verified.
|
||||||
@ -131,7 +107,6 @@ pub struct VerificationQueue<K: Kind> {
|
|||||||
engine: Arc<Engine>,
|
engine: Arc<Engine>,
|
||||||
more_to_verify: Arc<SCondvar>,
|
more_to_verify: Arc<SCondvar>,
|
||||||
verification: Arc<Verification<K>>,
|
verification: Arc<Verification<K>>,
|
||||||
verifiers: Mutex<(Vec<VerifierHandle>, usize)>,
|
|
||||||
deleting: Arc<AtomicBool>,
|
deleting: Arc<AtomicBool>,
|
||||||
ready_signal: Arc<QueueSignal>,
|
ready_signal: Arc<QueueSignal>,
|
||||||
empty: Arc<SCondvar>,
|
empty: Arc<SCondvar>,
|
||||||
@ -139,6 +114,8 @@ pub struct VerificationQueue<K: Kind> {
|
|||||||
ticks_since_adjustment: AtomicUsize,
|
ticks_since_adjustment: AtomicUsize,
|
||||||
max_queue_size: usize,
|
max_queue_size: usize,
|
||||||
max_mem_use: usize,
|
max_mem_use: usize,
|
||||||
|
verifier_handles: Vec<JoinHandle<()>>,
|
||||||
|
state: Arc<(Mutex<State>, Condvar)>,
|
||||||
}
|
}
|
||||||
|
|
||||||
struct QueueSignal {
|
struct QueueSignal {
|
||||||
@ -224,40 +201,39 @@ impl<K: Kind> VerificationQueue<K> {
|
|||||||
|
|
||||||
let max_verifiers = min(::num_cpus::get(), MAX_VERIFIERS);
|
let max_verifiers = min(::num_cpus::get(), MAX_VERIFIERS);
|
||||||
let default_amount = max(::num_cpus::get(), 3) - 2;
|
let default_amount = max(::num_cpus::get(), 3) - 2;
|
||||||
let mut verifiers = Vec::with_capacity(max_verifiers);
|
let state = Arc::new((Mutex::new(State::Work(default_amount)), Condvar::new()));
|
||||||
|
let mut verifier_handles = Vec::with_capacity(max_verifiers);
|
||||||
|
|
||||||
debug!(target: "verification", "Allocating {} verifiers, {} initially active", max_verifiers, default_amount);
|
debug!(target: "verification", "Allocating {} verifiers, {} initially active", max_verifiers, default_amount);
|
||||||
|
|
||||||
for i in 0..max_verifiers {
|
for i in 0..max_verifiers {
|
||||||
debug!(target: "verification", "Adding verification thread #{}", i);
|
debug!(target: "verification", "Adding verification thread #{}", i);
|
||||||
|
|
||||||
let deleting = deleting.clone();
|
|
||||||
let panic_handler = panic_handler.clone();
|
let panic_handler = panic_handler.clone();
|
||||||
let verification = verification.clone();
|
let verification = verification.clone();
|
||||||
let engine = engine.clone();
|
let engine = engine.clone();
|
||||||
let wait = more_to_verify.clone();
|
let wait = more_to_verify.clone();
|
||||||
let ready = ready_signal.clone();
|
let ready = ready_signal.clone();
|
||||||
let empty = empty.clone();
|
let empty = empty.clone();
|
||||||
|
let state = state.clone();
|
||||||
|
|
||||||
// enable only the first few verifiers.
|
let handle = thread::Builder::new()
|
||||||
let sleep = if i < default_amount {
|
|
||||||
Arc::new(AtomicBool::new(false))
|
|
||||||
} else {
|
|
||||||
Arc::new(AtomicBool::new(true))
|
|
||||||
};
|
|
||||||
|
|
||||||
verifiers.push(VerifierHandle {
|
|
||||||
deleting: deleting.clone(),
|
|
||||||
sleep: sleep.clone(),
|
|
||||||
thread: thread::Builder::new()
|
|
||||||
.name(format!("Verifier #{}", i))
|
.name(format!("Verifier #{}", i))
|
||||||
.spawn(move || {
|
.spawn(move || {
|
||||||
panic_handler.catch_panic(move || {
|
panic_handler.catch_panic(move || {
|
||||||
VerificationQueue::verify(verification, engine, wait, ready, deleting, empty, sleep)
|
VerificationQueue::verify(
|
||||||
|
verification,
|
||||||
|
engine,
|
||||||
|
wait,
|
||||||
|
ready,
|
||||||
|
empty,
|
||||||
|
state,
|
||||||
|
i,
|
||||||
|
)
|
||||||
}).unwrap()
|
}).unwrap()
|
||||||
})
|
})
|
||||||
.expect("Failed to create verifier thread.")
|
.expect("Failed to create verifier thread.");
|
||||||
});
|
verifier_handles.push(handle);
|
||||||
}
|
}
|
||||||
|
|
||||||
VerificationQueue {
|
VerificationQueue {
|
||||||
@ -266,13 +242,14 @@ impl<K: Kind> VerificationQueue<K> {
|
|||||||
ready_signal: ready_signal,
|
ready_signal: ready_signal,
|
||||||
more_to_verify: more_to_verify,
|
more_to_verify: more_to_verify,
|
||||||
verification: verification,
|
verification: verification,
|
||||||
verifiers: Mutex::new((verifiers, default_amount)),
|
|
||||||
deleting: deleting,
|
deleting: deleting,
|
||||||
processing: RwLock::new(HashSet::new()),
|
processing: RwLock::new(HashSet::new()),
|
||||||
empty: empty,
|
empty: empty,
|
||||||
ticks_since_adjustment: AtomicUsize::new(0),
|
ticks_since_adjustment: AtomicUsize::new(0),
|
||||||
max_queue_size: max(config.max_queue_size, MIN_QUEUE_LIMIT),
|
max_queue_size: max(config.max_queue_size, MIN_QUEUE_LIMIT),
|
||||||
max_mem_use: max(config.max_mem_use, MIN_MEM_LIMIT),
|
max_mem_use: max(config.max_mem_use, MIN_MEM_LIMIT),
|
||||||
|
verifier_handles: verifier_handles,
|
||||||
|
state: state,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -281,23 +258,30 @@ impl<K: Kind> VerificationQueue<K> {
|
|||||||
engine: Arc<Engine>,
|
engine: Arc<Engine>,
|
||||||
wait: Arc<SCondvar>,
|
wait: Arc<SCondvar>,
|
||||||
ready: Arc<QueueSignal>,
|
ready: Arc<QueueSignal>,
|
||||||
deleting: Arc<AtomicBool>,
|
|
||||||
empty: Arc<SCondvar>,
|
empty: Arc<SCondvar>,
|
||||||
sleep: Arc<AtomicBool>,
|
state: Arc<(Mutex<State>, Condvar)>,
|
||||||
|
id: usize,
|
||||||
) {
|
) {
|
||||||
while !deleting.load(AtomicOrdering::Acquire) {
|
loop {
|
||||||
|
// check current state.
|
||||||
{
|
{
|
||||||
while sleep.load(AtomicOrdering::SeqCst) {
|
let mut cur_state = state.0.lock();
|
||||||
trace!(target: "verification", "Verifier sleeping");
|
while let State::Work(x) = *cur_state {
|
||||||
::std::thread::park();
|
// sleep until this thread is required.
|
||||||
trace!(target: "verification", "Verifier waking up");
|
if id < x { break }
|
||||||
|
|
||||||
if deleting.load(AtomicOrdering::Acquire) {
|
debug!(target: "verification", "verifier {} sleeping", id);
|
||||||
return;
|
state.1.wait(&mut cur_state);
|
||||||
|
debug!(target: "verification", "verifier {} waking up", id);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
if let State::Exit = *cur_state {
|
||||||
|
debug!(target: "verification", "verifier {} exiting", id);
|
||||||
|
break;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// wait for work if empty.
|
||||||
{
|
{
|
||||||
let mut more_to_verify = verification.more_to_verify.lock().unwrap();
|
let mut more_to_verify = verification.more_to_verify.lock().unwrap();
|
||||||
|
|
||||||
@ -305,15 +289,22 @@ impl<K: Kind> VerificationQueue<K> {
|
|||||||
empty.notify_all();
|
empty.notify_all();
|
||||||
}
|
}
|
||||||
|
|
||||||
while verification.unverified.lock().is_empty() && !deleting.load(AtomicOrdering::Acquire) {
|
while verification.unverified.lock().is_empty() {
|
||||||
|
if let State::Exit = *state.0.lock() {
|
||||||
|
debug!(target: "verification", "verifier {} exiting", id);
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
more_to_verify = wait.wait(more_to_verify).unwrap();
|
more_to_verify = wait.wait(more_to_verify).unwrap();
|
||||||
}
|
}
|
||||||
|
|
||||||
if deleting.load(AtomicOrdering::Acquire) {
|
if let State::Exit = *state.0.lock() {
|
||||||
|
debug!(target: "verification", "verifier {} exiting", id);
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// do work.
|
||||||
let item = {
|
let item = {
|
||||||
// acquire these locks before getting the item to verify.
|
// acquire these locks before getting the item to verify.
|
||||||
let mut unverified = verification.unverified.lock();
|
let mut unverified = verification.unverified.lock();
|
||||||
@ -568,6 +559,14 @@ impl<K: Kind> VerificationQueue<K> {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/// Get the current number of working verifiers.
|
||||||
|
pub fn num_verifiers(&self) -> usize {
|
||||||
|
match *self.state.0.lock() {
|
||||||
|
State::Work(x) => x,
|
||||||
|
State::Exit => panic!("state only set to exit on drop; queue live now; qed"),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
/// Optimise memory footprint of the heap fields, and adjust the number of threads
|
/// Optimise memory footprint of the heap fields, and adjust the number of threads
|
||||||
/// to better suit the workload.
|
/// to better suit the workload.
|
||||||
pub fn collect_garbage(&self) {
|
pub fn collect_garbage(&self) {
|
||||||
@ -604,7 +603,7 @@ impl<K: Kind> VerificationQueue<K> {
|
|||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
let current = self.verifiers.lock().1;
|
let current = self.num_verifiers();
|
||||||
|
|
||||||
let diff = (v_len - u_len).abs();
|
let diff = (v_len - u_len).abs();
|
||||||
let total = v_len + u_len;
|
let total = v_len + u_len;
|
||||||
@ -626,27 +625,14 @@ impl<K: Kind> VerificationQueue<K> {
|
|||||||
// possible, never going over the amount of initially allocated threads
|
// possible, never going over the amount of initially allocated threads
|
||||||
// or below 1.
|
// or below 1.
|
||||||
fn scale_verifiers(&self, target: usize) {
|
fn scale_verifiers(&self, target: usize) {
|
||||||
let mut verifiers = self.verifiers.lock();
|
let current = self.num_verifiers();
|
||||||
let &mut (ref mut verifiers, ref mut verifier_count) = &mut *verifiers;
|
let target = min(self.verifier_handles.len(), target);
|
||||||
|
|
||||||
let target = min(verifiers.len(), target);
|
|
||||||
let target = max(1, target);
|
let target = max(1, target);
|
||||||
|
|
||||||
debug!(target: "verification", "Scaling from {} to {} verifiers", verifier_count, target);
|
debug!(target: "verification", "Scaling from {} to {} verifiers", current, target);
|
||||||
|
|
||||||
// scaling up
|
*self.state.0.lock() = State::Work(target);
|
||||||
for i in *verifier_count..target {
|
self.state.1.notify_all();
|
||||||
debug!(target: "verification", "Waking up verifier {}", i);
|
|
||||||
verifiers[i].wake_up();
|
|
||||||
}
|
|
||||||
|
|
||||||
// scaling down.
|
|
||||||
for i in target..*verifier_count {
|
|
||||||
debug!(target: "verification", "Putting verifier {} to sleep", i);
|
|
||||||
verifiers[i].sleep();
|
|
||||||
}
|
|
||||||
|
|
||||||
*verifier_count = target;
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -660,22 +646,18 @@ impl<K: Kind> Drop for VerificationQueue<K> {
|
|||||||
fn drop(&mut self) {
|
fn drop(&mut self) {
|
||||||
trace!(target: "shutdown", "[VerificationQueue] Closing...");
|
trace!(target: "shutdown", "[VerificationQueue] Closing...");
|
||||||
self.clear();
|
self.clear();
|
||||||
self.deleting.store(true, AtomicOrdering::Release);
|
self.deleting.store(true, AtomicOrdering::SeqCst);
|
||||||
|
|
||||||
let mut verifiers = self.verifiers.get_mut();
|
// set exit state; should be done before `more_to_verify` notification.
|
||||||
let mut verifiers = &mut verifiers.0;
|
*self.state.0.lock() = State::Exit;
|
||||||
|
self.state.1.notify_all();
|
||||||
// first pass to signal conclusion. must be done before
|
|
||||||
// notify or deadlock possible.
|
|
||||||
for handle in verifiers.iter() {
|
|
||||||
handle.conclude();
|
|
||||||
}
|
|
||||||
|
|
||||||
|
// wake up all threads waiting for more work.
|
||||||
self.more_to_verify.notify_all();
|
self.more_to_verify.notify_all();
|
||||||
|
|
||||||
// second pass to join.
|
// wait for all verifier threads to join.
|
||||||
for handle in verifiers.drain(..) {
|
for thread in self.verifier_handles.drain(..) {
|
||||||
handle.join();
|
thread.join().expect("Propagating verifier thread panic on shutdown");
|
||||||
}
|
}
|
||||||
|
|
||||||
trace!(target: "shutdown", "[VerificationQueue] Closed.");
|
trace!(target: "shutdown", "[VerificationQueue] Closed.");
|
||||||
@ -687,7 +669,7 @@ mod tests {
|
|||||||
use util::*;
|
use util::*;
|
||||||
use io::*;
|
use io::*;
|
||||||
use spec::*;
|
use spec::*;
|
||||||
use super::{BlockQueue, Config};
|
use super::{BlockQueue, Config, State};
|
||||||
use super::kind::blocks::Unverified;
|
use super::kind::blocks::Unverified;
|
||||||
use tests::helpers::*;
|
use tests::helpers::*;
|
||||||
use error::*;
|
use error::*;
|
||||||
@ -784,11 +766,11 @@ mod tests {
|
|||||||
let queue = get_test_queue();
|
let queue = get_test_queue();
|
||||||
queue.scale_verifiers(MAX_VERIFIERS + 1);
|
queue.scale_verifiers(MAX_VERIFIERS + 1);
|
||||||
|
|
||||||
assert!(queue.verifiers.lock().1 < MAX_VERIFIERS + 1);
|
assert!(queue.num_verifiers() < MAX_VERIFIERS + 1);
|
||||||
|
|
||||||
queue.scale_verifiers(0);
|
queue.scale_verifiers(0);
|
||||||
|
|
||||||
assert!(queue.verifiers.lock().1 == 1);
|
assert!(queue.num_verifiers() == 1);
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
@ -797,14 +779,7 @@ mod tests {
|
|||||||
|
|
||||||
// put all the verifiers to sleep to ensure
|
// put all the verifiers to sleep to ensure
|
||||||
// the test isn't timing sensitive.
|
// the test isn't timing sensitive.
|
||||||
let num_verifiers = {
|
*queue.state.0.lock() = State::Work(0);
|
||||||
let verifiers = queue.verifiers.lock();
|
|
||||||
for i in 0..verifiers.1 {
|
|
||||||
verifiers.0[i].sleep();
|
|
||||||
}
|
|
||||||
|
|
||||||
verifiers.1
|
|
||||||
};
|
|
||||||
|
|
||||||
for block in get_good_dummy_block_seq(5000) {
|
for block in get_good_dummy_block_seq(5000) {
|
||||||
queue.import(Unverified::new(block)).expect("Block good by definition; qed");
|
queue.import(Unverified::new(block)).expect("Block good by definition; qed");
|
||||||
@ -812,20 +787,12 @@ mod tests {
|
|||||||
|
|
||||||
// almost all unverified == bump verifier count.
|
// almost all unverified == bump verifier count.
|
||||||
queue.collect_garbage();
|
queue.collect_garbage();
|
||||||
assert_eq!(queue.verifiers.lock().1, num_verifiers + 1);
|
assert_eq!(queue.num_verifiers(), 1);
|
||||||
|
|
||||||
// wake them up again and verify everything.
|
|
||||||
{
|
|
||||||
let verifiers = queue.verifiers.lock();
|
|
||||||
for i in 0..verifiers.1 {
|
|
||||||
verifiers.0[i].wake_up();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
queue.flush();
|
queue.flush();
|
||||||
|
|
||||||
// nothing to verify == use minimum number of verifiers.
|
// nothing to verify == use minimum number of verifiers.
|
||||||
queue.collect_garbage();
|
queue.collect_garbage();
|
||||||
assert_eq!(queue.verifiers.lock().1, 1);
|
assert_eq!(queue.num_verifiers(), 1);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -1,6 +1,6 @@
|
|||||||
{
|
{
|
||||||
"name": "parity.js",
|
"name": "parity.js",
|
||||||
"version": "0.2.91",
|
"version": "0.2.92",
|
||||||
"main": "release/index.js",
|
"main": "release/index.js",
|
||||||
"jsnext:main": "src/index.js",
|
"jsnext:main": "src/index.js",
|
||||||
"author": "Parity Team <admin@parity.io>",
|
"author": "Parity Team <admin@parity.io>",
|
||||||
|
@ -457,6 +457,14 @@ class MethodDecoding extends Component {
|
|||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
const { signature, paramdata } = api.util.decodeCallData(input);
|
||||||
|
this.setState({ methodSignature: signature, methodParams: paramdata });
|
||||||
|
|
||||||
|
if (!signature || signature === CONTRACT_CREATE || transaction.creates) {
|
||||||
|
this.setState({ isDeploy: true });
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
if (contractAddress === '0x') {
|
if (contractAddress === '0x') {
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
@ -472,14 +480,6 @@ class MethodDecoding extends Component {
|
|||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
const { signature, paramdata } = api.util.decodeCallData(input);
|
|
||||||
this.setState({ methodSignature: signature, methodParams: paramdata });
|
|
||||||
|
|
||||||
if (!signature || signature === CONTRACT_CREATE || transaction.creates) {
|
|
||||||
this.setState({ isDeploy: true });
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
return Contracts.get()
|
return Contracts.get()
|
||||||
.signatureReg
|
.signatureReg
|
||||||
.lookup(signature)
|
.lookup(signature)
|
||||||
|
@ -1,10 +0,0 @@
|
|||||||
[package]
|
|
||||||
description = "Utility function to raise file descriptor limit on OS X"
|
|
||||||
homepage = "http://ethcore.io"
|
|
||||||
license = "GPL-3.0"
|
|
||||||
name = "fdlimit"
|
|
||||||
version = "0.1.0"
|
|
||||||
authors = ["Ethcore <admin@ethcore.io>"]
|
|
||||||
|
|
||||||
[dependencies]
|
|
||||||
libc = "0.2"
|
|
@ -1,19 +0,0 @@
|
|||||||
// Copyright 2015, 2016 Ethcore (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/>.extern crate libc;
|
|
||||||
|
|
||||||
extern crate libc;
|
|
||||||
mod raise_fd_limit;
|
|
||||||
pub use raise_fd_limit::raise_fd_limit;
|
|
@ -1,88 +0,0 @@
|
|||||||
// Copyright 2015 The Rust Project Developers. See the COPYRIGHT
|
|
||||||
// file at the top-level directory of this distribution and at
|
|
||||||
// http://rust-lang.org/COPYRIGHT.
|
|
||||||
//
|
|
||||||
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
||||||
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
||||||
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
||||||
// option. This file may not be copied, modified, or distributed
|
|
||||||
// except according to those terms.
|
|
||||||
|
|
||||||
/// darwin_fd_limit exists to work around an issue where launchctl on Mac OS X
|
|
||||||
/// defaults the rlimit maxfiles to 256/unlimited. The default soft limit of 256
|
|
||||||
/// ends up being far too low for our multithreaded scheduler testing, depending
|
|
||||||
/// on the number of cores available.
|
|
||||||
///
|
|
||||||
#[cfg(any(target_os = "macos", target_os = "ios"))]
|
|
||||||
#[allow(non_camel_case_types)]
|
|
||||||
pub fn raise_fd_limit() {
|
|
||||||
use libc;
|
|
||||||
use std::cmp;
|
|
||||||
use std::io;
|
|
||||||
use std::mem::size_of_val;
|
|
||||||
use std::ptr::null_mut;
|
|
||||||
|
|
||||||
unsafe {
|
|
||||||
static CTL_KERN: libc::c_int = 1;
|
|
||||||
static KERN_MAXFILESPERPROC: libc::c_int = 29;
|
|
||||||
|
|
||||||
// The strategy here is to fetch the current resource limits, read the
|
|
||||||
// kern.maxfilesperproc sysctl value, and bump the soft resource limit for
|
|
||||||
// maxfiles up to the sysctl value.
|
|
||||||
|
|
||||||
// Fetch the kern.maxfilesperproc value
|
|
||||||
let mut mib: [libc::c_int; 2] = [CTL_KERN, KERN_MAXFILESPERPROC];
|
|
||||||
let mut maxfiles: libc::c_int = 0;
|
|
||||||
let mut size: libc::size_t = size_of_val(&maxfiles) as libc::size_t;
|
|
||||||
if libc::sysctl(&mut mib[0], 2, &mut maxfiles as *mut _ as *mut _, &mut size,
|
|
||||||
null_mut(), 0) != 0 {
|
|
||||||
let err = io::Error::last_os_error();
|
|
||||||
panic!("raise_fd_limit: error calling sysctl: {}", err);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Fetch the current resource limits
|
|
||||||
let mut rlim = libc::rlimit{rlim_cur: 0, rlim_max: 0};
|
|
||||||
if libc::getrlimit(libc::RLIMIT_NOFILE, &mut rlim) != 0 {
|
|
||||||
let err = io::Error::last_os_error();
|
|
||||||
panic!("raise_fd_limit: error calling getrlimit: {}", err);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Bump the soft limit to the smaller of kern.maxfilesperproc and the hard
|
|
||||||
// limit
|
|
||||||
rlim.rlim_cur = cmp::min(maxfiles as libc::rlim_t, rlim.rlim_max);
|
|
||||||
|
|
||||||
// Set our newly-increased resource limit
|
|
||||||
if libc::setrlimit(libc::RLIMIT_NOFILE, &rlim) != 0 {
|
|
||||||
let err = io::Error::last_os_error();
|
|
||||||
panic!("raise_fd_limit: error calling setrlimit: {}", err);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(any(target_os = "linux"))]
|
|
||||||
#[allow(non_camel_case_types)]
|
|
||||||
pub fn raise_fd_limit() {
|
|
||||||
use libc;
|
|
||||||
use std::io;
|
|
||||||
|
|
||||||
unsafe {
|
|
||||||
// Fetch the current resource limits
|
|
||||||
let mut rlim = libc::rlimit{rlim_cur: 0, rlim_max: 0};
|
|
||||||
if libc::getrlimit(libc::RLIMIT_NOFILE, &mut rlim) != 0 {
|
|
||||||
let err = io::Error::last_os_error();
|
|
||||||
panic!("raise_fd_limit: error calling getrlimit: {}", err);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Set soft limit to hard imit
|
|
||||||
rlim.rlim_cur = rlim.rlim_max;
|
|
||||||
|
|
||||||
// Set our newly-increased resource limit
|
|
||||||
if libc::setrlimit(libc::RLIMIT_NOFILE, &rlim) != 0 {
|
|
||||||
let err = io::Error::last_os_error();
|
|
||||||
panic!("raise_fd_limit: error calling setrlimit: {}", err);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(not(any(target_os = "macos", target_os = "ios", target_os = "linux")))]
|
|
||||||
pub fn raise_fd_limit() {}
|
|
Loading…
Reference in New Issue
Block a user