Qualify std::sync::Mutex in the unit tests (#2304)
Also add a missing zebra_test::init().
This commit is contained in:
parent
3f7410d073
commit
3932661a93
|
@ -1,6 +1,6 @@
|
||||||
use std::{
|
use std::{
|
||||||
env,
|
env,
|
||||||
sync::{Arc, Mutex},
|
sync::Arc,
|
||||||
time::{Duration, Instant},
|
time::{Duration, Instant},
|
||||||
};
|
};
|
||||||
|
|
||||||
|
@ -69,7 +69,7 @@ proptest! {
|
||||||
// Since the address book is empty, there won't be any available peers
|
// Since the address book is empty, there won't be any available peers
|
||||||
let address_book = AddressBook::new(&Config::default(), Span::none());
|
let address_book = AddressBook::new(&Config::default(), Span::none());
|
||||||
|
|
||||||
let mut candidate_set = CandidateSet::new(Arc::new(Mutex::new(address_book)), peer_service);
|
let mut candidate_set = CandidateSet::new(Arc::new(std::sync::Mutex::new(address_book)), peer_service);
|
||||||
|
|
||||||
// Make sure that the rate-limit is never triggered, even after multiple calls
|
// Make sure that the rate-limit is never triggered, even after multiple calls
|
||||||
for _ in 0..next_peer_attempts {
|
for _ in 0..next_peer_attempts {
|
||||||
|
@ -106,7 +106,7 @@ proptest! {
|
||||||
let mut address_book = AddressBook::new(&Config::default(), Span::none());
|
let mut address_book = AddressBook::new(&Config::default(), Span::none());
|
||||||
address_book.extend(peers);
|
address_book.extend(peers);
|
||||||
|
|
||||||
let mut candidate_set = CandidateSet::new(Arc::new(Mutex::new(address_book)), peer_service);
|
let mut candidate_set = CandidateSet::new(Arc::new(std::sync::Mutex::new(address_book)), peer_service);
|
||||||
|
|
||||||
let checks = async move {
|
let checks = async move {
|
||||||
// Check rate limiting for initial peers
|
// Check rate limiting for initial peers
|
||||||
|
|
|
@ -3,7 +3,7 @@ use std::{
|
||||||
convert::TryInto,
|
convert::TryInto,
|
||||||
iter,
|
iter,
|
||||||
net::{IpAddr, SocketAddr},
|
net::{IpAddr, SocketAddr},
|
||||||
sync::{Arc, Mutex},
|
sync::Arc,
|
||||||
time::Duration as StdDuration,
|
time::Duration as StdDuration,
|
||||||
};
|
};
|
||||||
|
|
||||||
|
@ -139,12 +139,15 @@ fn candidate_set_updates_are_rate_limited() {
|
||||||
// How many times should `update` be called in each rate limit interval
|
// How many times should `update` be called in each rate limit interval
|
||||||
const POLL_FREQUENCY_FACTOR: u32 = 3;
|
const POLL_FREQUENCY_FACTOR: u32 = 3;
|
||||||
|
|
||||||
|
zebra_test::init();
|
||||||
|
|
||||||
let runtime = Runtime::new().expect("Failed to create Tokio runtime");
|
let runtime = Runtime::new().expect("Failed to create Tokio runtime");
|
||||||
let _guard = runtime.enter();
|
let _guard = runtime.enter();
|
||||||
|
|
||||||
let address_book = AddressBook::new(&Config::default(), Span::none());
|
let address_book = AddressBook::new(&Config::default(), Span::none());
|
||||||
let (peer_service, call_count) = mock_peer_service();
|
let (peer_service, call_count) = mock_peer_service();
|
||||||
let mut candidate_set = CandidateSet::new(Arc::new(Mutex::new(address_book)), peer_service);
|
let mut candidate_set =
|
||||||
|
CandidateSet::new(Arc::new(std::sync::Mutex::new(address_book)), peer_service);
|
||||||
|
|
||||||
runtime.block_on(async move {
|
runtime.block_on(async move {
|
||||||
time::pause();
|
time::pause();
|
||||||
|
@ -178,7 +181,8 @@ fn candidate_set_update_after_update_initial_is_rate_limited() {
|
||||||
|
|
||||||
let address_book = AddressBook::new(&Config::default(), Span::none());
|
let address_book = AddressBook::new(&Config::default(), Span::none());
|
||||||
let (peer_service, call_count) = mock_peer_service();
|
let (peer_service, call_count) = mock_peer_service();
|
||||||
let mut candidate_set = CandidateSet::new(Arc::new(Mutex::new(address_book)), peer_service);
|
let mut candidate_set =
|
||||||
|
CandidateSet::new(Arc::new(std::sync::Mutex::new(address_book)), peer_service);
|
||||||
|
|
||||||
runtime.block_on(async move {
|
runtime.block_on(async move {
|
||||||
time::pause();
|
time::pause();
|
||||||
|
|
Loading…
Reference in New Issue