1380 lines
48 KiB
Rust
1380 lines
48 KiB
Rust
use {
|
|
crate::{
|
|
cluster_slots::ClusterSlots,
|
|
duplicate_repair_status::ANCESTOR_HASH_REPAIR_SAMPLE_SIZE,
|
|
packet_threshold::DynamicPacketToProcessThreshold,
|
|
repair_response,
|
|
repair_service::{OutstandingShredRepairs, RepairStats},
|
|
request_response::RequestResponse,
|
|
result::{Error, Result},
|
|
},
|
|
bincode::serialize,
|
|
lru::LruCache,
|
|
rand::{
|
|
distributions::{Distribution, WeightedError, WeightedIndex},
|
|
Rng,
|
|
},
|
|
solana_gossip::{
|
|
cluster_info::{ClusterInfo, ClusterInfoError},
|
|
contact_info::ContactInfo,
|
|
weighted_shuffle::WeightedShuffle,
|
|
},
|
|
solana_ledger::{
|
|
ancestor_iterator::{AncestorIterator, AncestorIteratorWithHash},
|
|
blockstore::Blockstore,
|
|
shred::{Nonce, Shred, SIZE_OF_NONCE},
|
|
},
|
|
solana_metrics::inc_new_counter_debug,
|
|
solana_perf::packet::{limited_deserialize, PacketBatch, PacketBatchRecycler},
|
|
solana_sdk::{
|
|
clock::Slot, hash::Hash, packet::PACKET_DATA_SIZE, pubkey::Pubkey, timing::duration_as_ms,
|
|
},
|
|
solana_streamer::streamer::{PacketBatchReceiver, PacketBatchSender},
|
|
std::{
|
|
collections::HashSet,
|
|
net::SocketAddr,
|
|
sync::{
|
|
atomic::{AtomicBool, Ordering},
|
|
Arc, RwLock,
|
|
},
|
|
thread::{Builder, JoinHandle},
|
|
time::{Duration, Instant},
|
|
},
|
|
};
|
|
|
|
type SlotHash = (Slot, Hash);
|
|
|
|
/// the number of slots to respond with when responding to `Orphan` requests
|
|
pub const MAX_ORPHAN_REPAIR_RESPONSES: usize = 10;
|
|
// Number of slots to cache their respective repair peers and sampling weights.
|
|
pub(crate) const REPAIR_PEERS_CACHE_CAPACITY: usize = 128;
|
|
// Limit cache entries ttl in order to avoid re-using outdated data.
|
|
const REPAIR_PEERS_CACHE_TTL: Duration = Duration::from_secs(10);
|
|
pub const MAX_ANCESTOR_BYTES_IN_PACKET: usize =
|
|
PACKET_DATA_SIZE -
|
|
SIZE_OF_NONCE -
|
|
4 /*(response version enum discriminator)*/ -
|
|
4 /*slot_hash length*/;
|
|
pub const MAX_ANCESTOR_RESPONSES: usize =
|
|
MAX_ANCESTOR_BYTES_IN_PACKET / std::mem::size_of::<SlotHash>();
|
|
#[cfg(test)]
|
|
static_assertions::const_assert_eq!(MAX_ANCESTOR_RESPONSES, 30);
|
|
|
|
#[derive(Serialize, Deserialize, Debug, Clone, Copy, Hash, PartialEq, Eq)]
|
|
pub enum ShredRepairType {
|
|
Orphan(Slot),
|
|
HighestShred(Slot, u64),
|
|
Shred(Slot, u64),
|
|
}
|
|
|
|
impl ShredRepairType {
|
|
pub fn slot(&self) -> Slot {
|
|
match self {
|
|
ShredRepairType::Orphan(slot) => *slot,
|
|
ShredRepairType::HighestShred(slot, _) => *slot,
|
|
ShredRepairType::Shred(slot, _) => *slot,
|
|
}
|
|
}
|
|
}
|
|
|
|
impl RequestResponse for ShredRepairType {
|
|
type Response = Shred;
|
|
fn num_expected_responses(&self) -> u32 {
|
|
match self {
|
|
ShredRepairType::Orphan(_) => (MAX_ORPHAN_REPAIR_RESPONSES + 1) as u32, // run_orphan uses <= MAX_ORPHAN_REPAIR_RESPONSES
|
|
ShredRepairType::HighestShred(_, _) => 1,
|
|
ShredRepairType::Shred(_, _) => 1,
|
|
}
|
|
}
|
|
fn verify_response(&self, response_shred: &Shred) -> bool {
|
|
match self {
|
|
ShredRepairType::Orphan(slot) => response_shred.slot() <= *slot,
|
|
ShredRepairType::HighestShred(slot, index) => {
|
|
response_shred.slot() as u64 == *slot && response_shred.index() as u64 >= *index
|
|
}
|
|
ShredRepairType::Shred(slot, index) => {
|
|
response_shred.slot() as u64 == *slot && response_shred.index() as u64 == *index
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
pub struct AncestorHashesRepairType(pub Slot);
|
|
impl AncestorHashesRepairType {
|
|
pub fn slot(&self) -> Slot {
|
|
self.0
|
|
}
|
|
}
|
|
|
|
#[derive(Debug, Serialize, Deserialize)]
|
|
pub enum AncestorHashesResponseVersion {
|
|
Current(Vec<SlotHash>),
|
|
}
|
|
impl AncestorHashesResponseVersion {
|
|
pub fn into_slot_hashes(self) -> Vec<SlotHash> {
|
|
match self {
|
|
AncestorHashesResponseVersion::Current(slot_hashes) => slot_hashes,
|
|
}
|
|
}
|
|
|
|
pub fn slot_hashes(&self) -> &[SlotHash] {
|
|
match self {
|
|
AncestorHashesResponseVersion::Current(slot_hashes) => slot_hashes,
|
|
}
|
|
}
|
|
|
|
fn max_ancestors_in_response(&self) -> usize {
|
|
match self {
|
|
AncestorHashesResponseVersion::Current(_) => MAX_ANCESTOR_RESPONSES,
|
|
}
|
|
}
|
|
}
|
|
|
|
impl RequestResponse for AncestorHashesRepairType {
|
|
type Response = AncestorHashesResponseVersion;
|
|
fn num_expected_responses(&self) -> u32 {
|
|
1
|
|
}
|
|
fn verify_response(&self, response: &AncestorHashesResponseVersion) -> bool {
|
|
response.slot_hashes().len() <= response.max_ancestors_in_response()
|
|
}
|
|
}
|
|
|
|
#[derive(Default)]
|
|
pub struct ServeRepairStats {
|
|
pub total_packets: usize,
|
|
pub dropped_packets: usize,
|
|
pub processed: usize,
|
|
pub self_repair: usize,
|
|
pub window_index: usize,
|
|
pub highest_window_index: usize,
|
|
pub orphan: usize,
|
|
pub ancestor_hashes: usize,
|
|
}
|
|
|
|
/// Window protocol messages
|
|
#[derive(Serialize, Deserialize, Debug)]
|
|
pub enum RepairProtocol {
|
|
WindowIndex(ContactInfo, Slot, u64),
|
|
HighestWindowIndex(ContactInfo, Slot, u64),
|
|
Orphan(ContactInfo, Slot),
|
|
WindowIndexWithNonce(ContactInfo, Slot, u64, Nonce),
|
|
HighestWindowIndexWithNonce(ContactInfo, Slot, u64, Nonce),
|
|
OrphanWithNonce(ContactInfo, Slot, Nonce),
|
|
AncestorHashes(ContactInfo, Slot, Nonce),
|
|
}
|
|
|
|
#[derive(Clone)]
|
|
pub struct ServeRepair {
|
|
cluster_info: Arc<ClusterInfo>,
|
|
}
|
|
|
|
// Cache entry for repair peers for a slot.
|
|
pub(crate) struct RepairPeers {
|
|
asof: Instant,
|
|
peers: Vec<(Pubkey, /*ContactInfo.serve_repair:*/ SocketAddr)>,
|
|
weighted_index: WeightedIndex<u64>,
|
|
}
|
|
|
|
impl RepairPeers {
|
|
fn new(asof: Instant, peers: &[ContactInfo], weights: &[u64]) -> Result<Self> {
|
|
if peers.is_empty() {
|
|
return Err(Error::from(ClusterInfoError::NoPeers));
|
|
}
|
|
if peers.len() != weights.len() {
|
|
return Err(Error::from(WeightedError::InvalidWeight));
|
|
}
|
|
let weighted_index = WeightedIndex::new(weights)?;
|
|
let peers = peers
|
|
.iter()
|
|
.map(|peer| (peer.id, peer.serve_repair))
|
|
.collect();
|
|
Ok(Self {
|
|
asof,
|
|
peers,
|
|
weighted_index,
|
|
})
|
|
}
|
|
|
|
fn sample<R: Rng>(&self, rng: &mut R) -> (Pubkey, SocketAddr) {
|
|
let index = self.weighted_index.sample(rng);
|
|
self.peers[index]
|
|
}
|
|
}
|
|
|
|
impl ServeRepair {
|
|
pub fn new(cluster_info: Arc<ClusterInfo>) -> Self {
|
|
Self { cluster_info }
|
|
}
|
|
|
|
fn my_info(&self) -> ContactInfo {
|
|
self.cluster_info.my_contact_info()
|
|
}
|
|
|
|
pub(crate) fn my_id(&self) -> Pubkey {
|
|
self.cluster_info.id()
|
|
}
|
|
|
|
fn get_repair_sender(request: &RepairProtocol) -> &ContactInfo {
|
|
match request {
|
|
RepairProtocol::WindowIndex(ref from, _, _) => from,
|
|
RepairProtocol::HighestWindowIndex(ref from, _, _) => from,
|
|
RepairProtocol::Orphan(ref from, _) => from,
|
|
RepairProtocol::WindowIndexWithNonce(ref from, _, _, _) => from,
|
|
RepairProtocol::HighestWindowIndexWithNonce(ref from, _, _, _) => from,
|
|
RepairProtocol::OrphanWithNonce(ref from, _, _) => from,
|
|
RepairProtocol::AncestorHashes(ref from, _, _) => from,
|
|
}
|
|
}
|
|
|
|
fn handle_repair(
|
|
me: &Arc<RwLock<Self>>,
|
|
recycler: &PacketBatchRecycler,
|
|
from_addr: &SocketAddr,
|
|
blockstore: Option<&Arc<Blockstore>>,
|
|
request: RepairProtocol,
|
|
stats: &mut ServeRepairStats,
|
|
) -> Option<PacketBatch> {
|
|
let now = Instant::now();
|
|
|
|
let my_id = me.read().unwrap().my_id();
|
|
//TODO: verify `from` is signed
|
|
let from = Self::get_repair_sender(&request);
|
|
if from.id == my_id {
|
|
stats.self_repair += 1;
|
|
return None;
|
|
}
|
|
|
|
let (res, label) = {
|
|
match &request {
|
|
RepairProtocol::WindowIndexWithNonce(_, slot, shred_index, nonce) => {
|
|
stats.window_index += 1;
|
|
(
|
|
Self::run_window_request(
|
|
recycler,
|
|
from,
|
|
from_addr,
|
|
blockstore,
|
|
&my_id,
|
|
*slot,
|
|
*shred_index,
|
|
*nonce,
|
|
),
|
|
"WindowIndexWithNonce",
|
|
)
|
|
}
|
|
RepairProtocol::HighestWindowIndexWithNonce(_, slot, highest_index, nonce) => {
|
|
stats.highest_window_index += 1;
|
|
(
|
|
Self::run_highest_window_request(
|
|
recycler,
|
|
from_addr,
|
|
blockstore,
|
|
*slot,
|
|
*highest_index,
|
|
*nonce,
|
|
),
|
|
"HighestWindowIndexWithNonce",
|
|
)
|
|
}
|
|
RepairProtocol::OrphanWithNonce(_, slot, nonce) => {
|
|
stats.orphan += 1;
|
|
(
|
|
Self::run_orphan(
|
|
recycler,
|
|
from_addr,
|
|
blockstore,
|
|
*slot,
|
|
MAX_ORPHAN_REPAIR_RESPONSES,
|
|
*nonce,
|
|
),
|
|
"OrphanWithNonce",
|
|
)
|
|
}
|
|
RepairProtocol::AncestorHashes(_, slot, nonce) => {
|
|
stats.ancestor_hashes += 1;
|
|
(
|
|
Self::run_ancestor_hashes(recycler, from_addr, blockstore, *slot, *nonce),
|
|
"AncestorHashes",
|
|
)
|
|
}
|
|
_ => (None, "Unsupported repair type"),
|
|
}
|
|
};
|
|
|
|
trace!("{}: received repair request: {:?}", my_id, request);
|
|
Self::report_time_spent(label, &now.elapsed(), "");
|
|
res
|
|
}
|
|
|
|
fn report_time_spent(label: &str, time: &Duration, extra: &str) {
|
|
let count = duration_as_ms(time);
|
|
if count > 5 {
|
|
info!("{} took: {} ms {}", label, count, extra);
|
|
}
|
|
}
|
|
|
|
/// Process messages from the network
|
|
fn run_listen(
|
|
obj: &Arc<RwLock<Self>>,
|
|
recycler: &PacketBatchRecycler,
|
|
blockstore: Option<&Arc<Blockstore>>,
|
|
requests_receiver: &PacketBatchReceiver,
|
|
response_sender: &PacketBatchSender,
|
|
stats: &mut ServeRepairStats,
|
|
packet_threshold: &mut DynamicPacketToProcessThreshold,
|
|
) -> Result<()> {
|
|
//TODO cache connections
|
|
let timeout = Duration::new(1, 0);
|
|
let mut reqs_v = vec![requests_receiver.recv_timeout(timeout)?];
|
|
let mut total_packets = reqs_v[0].packets.len();
|
|
|
|
let mut dropped_packets = 0;
|
|
while let Ok(more) = requests_receiver.try_recv() {
|
|
total_packets += more.packets.len();
|
|
if packet_threshold.should_drop(total_packets) {
|
|
dropped_packets += more.packets.len();
|
|
} else {
|
|
reqs_v.push(more);
|
|
}
|
|
}
|
|
|
|
stats.dropped_packets += dropped_packets;
|
|
stats.total_packets += total_packets;
|
|
|
|
let timer = Instant::now();
|
|
for reqs in reqs_v {
|
|
Self::handle_packets(obj, recycler, blockstore, reqs, response_sender, stats);
|
|
}
|
|
packet_threshold.update(total_packets, timer.elapsed());
|
|
Ok(())
|
|
}
|
|
|
|
fn report_reset_stats(me: &Arc<RwLock<Self>>, stats: &mut ServeRepairStats) {
|
|
if stats.self_repair > 0 {
|
|
let my_id = me.read().unwrap().cluster_info.id();
|
|
warn!(
|
|
"{}: Ignored received repair requests from ME: {}",
|
|
my_id, stats.self_repair,
|
|
);
|
|
inc_new_counter_debug!("serve_repair-handle-repair--eq", stats.self_repair);
|
|
}
|
|
|
|
inc_new_counter_info!("serve_repair-total_packets", stats.total_packets);
|
|
inc_new_counter_info!("serve_repair-dropped_packets", stats.dropped_packets);
|
|
|
|
debug!(
|
|
"repair_listener: total_packets: {} passed: {}",
|
|
stats.total_packets, stats.processed
|
|
);
|
|
|
|
inc_new_counter_debug!("serve_repair-request-window-index", stats.window_index);
|
|
inc_new_counter_debug!(
|
|
"serve_repair-request-highest-window-index",
|
|
stats.highest_window_index
|
|
);
|
|
inc_new_counter_debug!("serve_repair-request-orphan", stats.orphan);
|
|
inc_new_counter_debug!(
|
|
"serve_repair-request-ancestor-hashes",
|
|
stats.ancestor_hashes
|
|
);
|
|
*stats = ServeRepairStats::default();
|
|
}
|
|
|
|
pub fn listen(
|
|
me: Arc<RwLock<Self>>,
|
|
blockstore: Option<Arc<Blockstore>>,
|
|
requests_receiver: PacketBatchReceiver,
|
|
response_sender: PacketBatchSender,
|
|
exit: &Arc<AtomicBool>,
|
|
) -> JoinHandle<()> {
|
|
let exit = exit.clone();
|
|
let recycler = PacketBatchRecycler::default();
|
|
Builder::new()
|
|
.name("solana-repair-listen".to_string())
|
|
.spawn(move || {
|
|
let mut last_print = Instant::now();
|
|
let mut stats = ServeRepairStats::default();
|
|
let mut packet_threshold = DynamicPacketToProcessThreshold::default();
|
|
loop {
|
|
let result = Self::run_listen(
|
|
&me,
|
|
&recycler,
|
|
blockstore.as_ref(),
|
|
&requests_receiver,
|
|
&response_sender,
|
|
&mut stats,
|
|
&mut packet_threshold,
|
|
);
|
|
match result {
|
|
Err(Error::RecvTimeout(_)) | Ok(_) => {}
|
|
Err(err) => info!("repair listener error: {:?}", err),
|
|
};
|
|
if exit.load(Ordering::Relaxed) {
|
|
return;
|
|
}
|
|
if last_print.elapsed().as_secs() > 2 {
|
|
Self::report_reset_stats(&me, &mut stats);
|
|
last_print = Instant::now();
|
|
}
|
|
}
|
|
})
|
|
.unwrap()
|
|
}
|
|
|
|
fn handle_packets(
|
|
me: &Arc<RwLock<Self>>,
|
|
recycler: &PacketBatchRecycler,
|
|
blockstore: Option<&Arc<Blockstore>>,
|
|
packet_batch: PacketBatch,
|
|
response_sender: &PacketBatchSender,
|
|
stats: &mut ServeRepairStats,
|
|
) {
|
|
// iter over the packets
|
|
packet_batch.packets.iter().for_each(|packet| {
|
|
let from_addr = packet.meta.addr();
|
|
limited_deserialize(&packet.data[..packet.meta.size])
|
|
.into_iter()
|
|
.for_each(|request| {
|
|
stats.processed += 1;
|
|
let rsp =
|
|
Self::handle_repair(me, recycler, &from_addr, blockstore, request, stats);
|
|
if let Some(rsp) = rsp {
|
|
let _ignore_disconnect = response_sender.send(rsp);
|
|
}
|
|
});
|
|
});
|
|
}
|
|
|
|
fn window_index_request_bytes(
|
|
&self,
|
|
slot: Slot,
|
|
shred_index: u64,
|
|
nonce: Nonce,
|
|
) -> Result<Vec<u8>> {
|
|
let req = RepairProtocol::WindowIndexWithNonce(self.my_info(), slot, shred_index, nonce);
|
|
let out = serialize(&req)?;
|
|
Ok(out)
|
|
}
|
|
|
|
fn window_highest_index_request_bytes(
|
|
&self,
|
|
slot: Slot,
|
|
shred_index: u64,
|
|
nonce: Nonce,
|
|
) -> Result<Vec<u8>> {
|
|
let req =
|
|
RepairProtocol::HighestWindowIndexWithNonce(self.my_info(), slot, shred_index, nonce);
|
|
let out = serialize(&req)?;
|
|
Ok(out)
|
|
}
|
|
|
|
fn orphan_bytes(&self, slot: Slot, nonce: Nonce) -> Result<Vec<u8>> {
|
|
let req = RepairProtocol::OrphanWithNonce(self.my_info(), slot, nonce);
|
|
let out = serialize(&req)?;
|
|
Ok(out)
|
|
}
|
|
|
|
pub fn ancestor_repair_request_bytes(
|
|
&self,
|
|
request_slot: Slot,
|
|
nonce: Nonce,
|
|
) -> Result<Vec<u8>> {
|
|
let repair_request = RepairProtocol::AncestorHashes(self.my_info(), request_slot, nonce);
|
|
let out = serialize(&repair_request)?;
|
|
Ok(out)
|
|
}
|
|
|
|
pub(crate) fn repair_request(
|
|
&self,
|
|
cluster_slots: &ClusterSlots,
|
|
repair_request: ShredRepairType,
|
|
peers_cache: &mut LruCache<Slot, RepairPeers>,
|
|
repair_stats: &mut RepairStats,
|
|
repair_validators: &Option<HashSet<Pubkey>>,
|
|
outstanding_requests: &mut OutstandingShredRepairs,
|
|
) -> Result<(SocketAddr, Vec<u8>)> {
|
|
// find a peer that appears to be accepting replication and has the desired slot, as indicated
|
|
// by a valid tvu port location
|
|
let slot = repair_request.slot();
|
|
let repair_peers = match peers_cache.get(&slot) {
|
|
Some(entry) if entry.asof.elapsed() < REPAIR_PEERS_CACHE_TTL => entry,
|
|
_ => {
|
|
peers_cache.pop(&slot);
|
|
let repair_peers = self.repair_peers(repair_validators, slot);
|
|
let weights = cluster_slots.compute_weights(slot, &repair_peers);
|
|
let repair_peers = RepairPeers::new(Instant::now(), &repair_peers, &weights)?;
|
|
peers_cache.put(slot, repair_peers);
|
|
peers_cache.get(&slot).unwrap()
|
|
}
|
|
};
|
|
let (peer, addr) = repair_peers.sample(&mut rand::thread_rng());
|
|
let nonce =
|
|
outstanding_requests.add_request(repair_request, solana_sdk::timing::timestamp());
|
|
let out = self.map_repair_request(&repair_request, &peer, repair_stats, nonce)?;
|
|
Ok((addr, out))
|
|
}
|
|
|
|
pub fn repair_request_ancestor_hashes_sample_peers(
|
|
&self,
|
|
slot: Slot,
|
|
cluster_slots: &ClusterSlots,
|
|
repair_validators: &Option<HashSet<Pubkey>>,
|
|
) -> Result<Vec<(Pubkey, SocketAddr)>> {
|
|
let repair_peers: Vec<_> = self.repair_peers(repair_validators, slot);
|
|
if repair_peers.is_empty() {
|
|
return Err(ClusterInfoError::NoPeers.into());
|
|
}
|
|
let (weights, index): (Vec<_>, Vec<_>) = cluster_slots
|
|
.compute_weights_exclude_nonfrozen(slot, &repair_peers)
|
|
.into_iter()
|
|
.unzip();
|
|
let peers = WeightedShuffle::new("repair_request_ancestor_hashes", &weights)
|
|
.shuffle(&mut rand::thread_rng())
|
|
.take(ANCESTOR_HASH_REPAIR_SAMPLE_SIZE)
|
|
.map(|i| index[i])
|
|
.map(|i| (repair_peers[i].id, repair_peers[i].serve_repair))
|
|
.collect();
|
|
Ok(peers)
|
|
}
|
|
|
|
pub fn repair_request_duplicate_compute_best_peer(
|
|
&self,
|
|
slot: Slot,
|
|
cluster_slots: &ClusterSlots,
|
|
repair_validators: &Option<HashSet<Pubkey>>,
|
|
) -> Result<(Pubkey, SocketAddr)> {
|
|
let repair_peers: Vec<_> = self.repair_peers(repair_validators, slot);
|
|
if repair_peers.is_empty() {
|
|
return Err(ClusterInfoError::NoPeers.into());
|
|
}
|
|
let (weights, index): (Vec<_>, Vec<_>) = cluster_slots
|
|
.compute_weights_exclude_nonfrozen(slot, &repair_peers)
|
|
.into_iter()
|
|
.unzip();
|
|
let k = WeightedIndex::new(weights)?.sample(&mut rand::thread_rng());
|
|
let n = index[k];
|
|
Ok((repair_peers[n].id, repair_peers[n].serve_repair))
|
|
}
|
|
|
|
pub fn map_repair_request(
|
|
&self,
|
|
repair_request: &ShredRepairType,
|
|
repair_peer_id: &Pubkey,
|
|
repair_stats: &mut RepairStats,
|
|
nonce: Nonce,
|
|
) -> Result<Vec<u8>> {
|
|
match repair_request {
|
|
ShredRepairType::Shred(slot, shred_index) => {
|
|
repair_stats
|
|
.shred
|
|
.update(repair_peer_id, *slot, *shred_index);
|
|
Ok(self.window_index_request_bytes(*slot, *shred_index, nonce)?)
|
|
}
|
|
ShredRepairType::HighestShred(slot, shred_index) => {
|
|
repair_stats
|
|
.highest_shred
|
|
.update(repair_peer_id, *slot, *shred_index);
|
|
Ok(self.window_highest_index_request_bytes(*slot, *shred_index, nonce)?)
|
|
}
|
|
ShredRepairType::Orphan(slot) => {
|
|
repair_stats.orphan.update(repair_peer_id, *slot, 0);
|
|
Ok(self.orphan_bytes(*slot, nonce)?)
|
|
}
|
|
}
|
|
}
|
|
|
|
fn repair_peers(
|
|
&self,
|
|
repair_validators: &Option<HashSet<Pubkey>>,
|
|
slot: Slot,
|
|
) -> Vec<ContactInfo> {
|
|
if let Some(repair_validators) = repair_validators {
|
|
repair_validators
|
|
.iter()
|
|
.filter_map(|key| {
|
|
if *key != self.my_id() {
|
|
self.cluster_info.lookup_contact_info(key, |ci| ci.clone())
|
|
} else {
|
|
None
|
|
}
|
|
})
|
|
.collect()
|
|
} else {
|
|
self.cluster_info.repair_peers(slot)
|
|
}
|
|
}
|
|
|
|
fn run_window_request(
|
|
recycler: &PacketBatchRecycler,
|
|
from: &ContactInfo,
|
|
from_addr: &SocketAddr,
|
|
blockstore: Option<&Arc<Blockstore>>,
|
|
my_id: &Pubkey,
|
|
slot: Slot,
|
|
shred_index: u64,
|
|
nonce: Nonce,
|
|
) -> Option<PacketBatch> {
|
|
if let Some(blockstore) = blockstore {
|
|
// Try to find the requested index in one of the slots
|
|
let packet = repair_response::repair_response_packet(
|
|
blockstore,
|
|
slot,
|
|
shred_index,
|
|
from_addr,
|
|
nonce,
|
|
);
|
|
|
|
if let Some(packet) = packet {
|
|
inc_new_counter_debug!("serve_repair-window-request-ledger", 1);
|
|
return Some(PacketBatch::new_unpinned_with_recycler_data(
|
|
recycler,
|
|
"run_window_request",
|
|
vec![packet],
|
|
));
|
|
}
|
|
}
|
|
|
|
inc_new_counter_debug!("serve_repair-window-request-fail", 1);
|
|
trace!(
|
|
"{}: failed WindowIndex {} {} {}",
|
|
my_id,
|
|
from.id,
|
|
slot,
|
|
shred_index,
|
|
);
|
|
|
|
None
|
|
}
|
|
|
|
fn run_highest_window_request(
|
|
recycler: &PacketBatchRecycler,
|
|
from_addr: &SocketAddr,
|
|
blockstore: Option<&Arc<Blockstore>>,
|
|
slot: Slot,
|
|
highest_index: u64,
|
|
nonce: Nonce,
|
|
) -> Option<PacketBatch> {
|
|
let blockstore = blockstore?;
|
|
// Try to find the requested index in one of the slots
|
|
let meta = blockstore.meta(slot).ok()??;
|
|
if meta.received > highest_index {
|
|
// meta.received must be at least 1 by this point
|
|
let packet = repair_response::repair_response_packet(
|
|
blockstore,
|
|
slot,
|
|
meta.received - 1,
|
|
from_addr,
|
|
nonce,
|
|
)?;
|
|
return Some(PacketBatch::new_unpinned_with_recycler_data(
|
|
recycler,
|
|
"run_highest_window_request",
|
|
vec![packet],
|
|
));
|
|
}
|
|
None
|
|
}
|
|
|
|
fn run_orphan(
|
|
recycler: &PacketBatchRecycler,
|
|
from_addr: &SocketAddr,
|
|
blockstore: Option<&Arc<Blockstore>>,
|
|
mut slot: Slot,
|
|
max_responses: usize,
|
|
nonce: Nonce,
|
|
) -> Option<PacketBatch> {
|
|
let mut res = PacketBatch::new_unpinned_with_recycler(recycler.clone(), 64, "run_orphan");
|
|
if let Some(blockstore) = blockstore {
|
|
// Try to find the next "n" parent slots of the input slot
|
|
while let Ok(Some(meta)) = blockstore.meta(slot) {
|
|
if meta.received == 0 {
|
|
break;
|
|
}
|
|
let packet = repair_response::repair_response_packet(
|
|
blockstore,
|
|
slot,
|
|
meta.received - 1,
|
|
from_addr,
|
|
nonce,
|
|
);
|
|
if let Some(packet) = packet {
|
|
res.packets.push(packet);
|
|
} else {
|
|
break;
|
|
}
|
|
if meta.parent_slot.is_some() && res.packets.len() <= max_responses {
|
|
slot = meta.parent_slot.unwrap();
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
if res.is_empty() {
|
|
return None;
|
|
}
|
|
Some(res)
|
|
}
|
|
|
|
fn run_ancestor_hashes(
|
|
recycler: &PacketBatchRecycler,
|
|
from_addr: &SocketAddr,
|
|
blockstore: Option<&Arc<Blockstore>>,
|
|
slot: Slot,
|
|
nonce: Nonce,
|
|
) -> Option<PacketBatch> {
|
|
let blockstore = blockstore?;
|
|
let ancestor_slot_hashes = if blockstore.is_duplicate_confirmed(slot) {
|
|
let ancestor_iterator =
|
|
AncestorIteratorWithHash::from(AncestorIterator::new_inclusive(slot, blockstore));
|
|
ancestor_iterator.take(MAX_ANCESTOR_RESPONSES).collect()
|
|
} else {
|
|
// If this slot is not duplicate confirmed, return nothing
|
|
vec![]
|
|
};
|
|
let response = AncestorHashesResponseVersion::Current(ancestor_slot_hashes);
|
|
let serialized_response = serialize(&response).ok()?;
|
|
|
|
// Could probably directly write response into packet via `serialize_into()`
|
|
// instead of incurring extra copy in `repair_response_packet_from_bytes`, but
|
|
// serialize_into doesn't return the written size...
|
|
let packet = repair_response::repair_response_packet_from_bytes(
|
|
serialized_response,
|
|
from_addr,
|
|
nonce,
|
|
)?;
|
|
Some(PacketBatch::new_unpinned_with_recycler_data(
|
|
recycler,
|
|
"run_ancestor_hashes",
|
|
vec![packet],
|
|
))
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use {
|
|
super::*,
|
|
crate::{repair_response, result::Error},
|
|
solana_gossip::{socketaddr, socketaddr_any},
|
|
solana_ledger::{
|
|
blockstore::make_many_slot_entries,
|
|
blockstore_processor::fill_blockstore_slot_with_ticks,
|
|
get_tmp_ledger_path,
|
|
shred::{max_ticks_per_n_shreds, Shred},
|
|
},
|
|
solana_perf::packet::Packet,
|
|
solana_sdk::{hash::Hash, pubkey::Pubkey, signature::Keypair, timing::timestamp},
|
|
solana_streamer::socket::SocketAddrSpace,
|
|
};
|
|
|
|
#[test]
|
|
fn test_run_highest_window_request() {
|
|
run_highest_window_request(5, 3, 9);
|
|
}
|
|
|
|
/// test run_window_request responds with the right shred, and do not overrun
|
|
fn run_highest_window_request(slot: Slot, num_slots: u64, nonce: Nonce) {
|
|
let recycler = PacketBatchRecycler::default();
|
|
solana_logger::setup();
|
|
let ledger_path = get_tmp_ledger_path!();
|
|
{
|
|
let blockstore = Arc::new(Blockstore::open(&ledger_path).unwrap());
|
|
let rv = ServeRepair::run_highest_window_request(
|
|
&recycler,
|
|
&socketaddr_any!(),
|
|
Some(&blockstore),
|
|
0,
|
|
0,
|
|
nonce,
|
|
);
|
|
assert!(rv.is_none());
|
|
|
|
let _ = fill_blockstore_slot_with_ticks(
|
|
&blockstore,
|
|
max_ticks_per_n_shreds(1, None) + 1,
|
|
slot,
|
|
slot - num_slots + 1,
|
|
Hash::default(),
|
|
);
|
|
|
|
let index = 1;
|
|
let rv = ServeRepair::run_highest_window_request(
|
|
&recycler,
|
|
&socketaddr_any!(),
|
|
Some(&blockstore),
|
|
slot,
|
|
index,
|
|
nonce,
|
|
)
|
|
.expect("packets");
|
|
let request = ShredRepairType::HighestShred(slot, index);
|
|
verify_responses(&request, rv.packets.iter());
|
|
|
|
let rv: Vec<Shred> = rv
|
|
.packets
|
|
.into_iter()
|
|
.filter_map(|b| {
|
|
assert_eq!(repair_response::nonce(&b.data[..]).unwrap(), nonce);
|
|
Shred::new_from_serialized_shred(b.data.to_vec()).ok()
|
|
})
|
|
.collect();
|
|
assert!(!rv.is_empty());
|
|
let index = blockstore.meta(slot).unwrap().unwrap().received - 1;
|
|
assert_eq!(rv[0].index(), index as u32);
|
|
assert_eq!(rv[0].slot(), slot);
|
|
|
|
let rv = ServeRepair::run_highest_window_request(
|
|
&recycler,
|
|
&socketaddr_any!(),
|
|
Some(&blockstore),
|
|
slot,
|
|
index + 1,
|
|
nonce,
|
|
);
|
|
assert!(rv.is_none());
|
|
}
|
|
|
|
Blockstore::destroy(&ledger_path).expect("Expected successful database destruction");
|
|
}
|
|
|
|
#[test]
|
|
fn test_run_window_request() {
|
|
run_window_request(2, 9);
|
|
}
|
|
|
|
/// test window requests respond with the right shred, and do not overrun
|
|
fn run_window_request(slot: Slot, nonce: Nonce) {
|
|
let recycler = PacketBatchRecycler::default();
|
|
solana_logger::setup();
|
|
let ledger_path = get_tmp_ledger_path!();
|
|
{
|
|
let blockstore = Arc::new(Blockstore::open(&ledger_path).unwrap());
|
|
let me = ContactInfo {
|
|
id: solana_sdk::pubkey::new_rand(),
|
|
gossip: socketaddr!("127.0.0.1:1234"),
|
|
tvu: socketaddr!("127.0.0.1:1235"),
|
|
tvu_forwards: socketaddr!("127.0.0.1:1236"),
|
|
repair: socketaddr!("127.0.0.1:1237"),
|
|
tpu: socketaddr!("127.0.0.1:1238"),
|
|
tpu_forwards: socketaddr!("127.0.0.1:1239"),
|
|
tpu_vote: socketaddr!("127.0.0.1:1240"),
|
|
rpc: socketaddr!("127.0.0.1:1241"),
|
|
rpc_pubsub: socketaddr!("127.0.0.1:1242"),
|
|
serve_repair: socketaddr!("127.0.0.1:1243"),
|
|
wallclock: 0,
|
|
shred_version: 0,
|
|
};
|
|
let rv = ServeRepair::run_window_request(
|
|
&recycler,
|
|
&me,
|
|
&socketaddr_any!(),
|
|
Some(&blockstore),
|
|
&me.id,
|
|
slot,
|
|
0,
|
|
nonce,
|
|
);
|
|
assert!(rv.is_none());
|
|
let shred = Shred::new_from_data(slot, 1, 1, None, false, false, 0, 2, 0);
|
|
|
|
blockstore
|
|
.insert_shreds(vec![shred], None, false)
|
|
.expect("Expect successful ledger write");
|
|
|
|
let index = 1;
|
|
let rv = ServeRepair::run_window_request(
|
|
&recycler,
|
|
&me,
|
|
&socketaddr_any!(),
|
|
Some(&blockstore),
|
|
&me.id,
|
|
slot,
|
|
index,
|
|
nonce,
|
|
)
|
|
.expect("packets");
|
|
let request = ShredRepairType::Shred(slot, index);
|
|
verify_responses(&request, rv.packets.iter());
|
|
let rv: Vec<Shred> = rv
|
|
.packets
|
|
.into_iter()
|
|
.filter_map(|b| {
|
|
assert_eq!(repair_response::nonce(&b.data[..]).unwrap(), nonce);
|
|
Shred::new_from_serialized_shred(b.data.to_vec()).ok()
|
|
})
|
|
.collect();
|
|
assert_eq!(rv[0].index(), 1);
|
|
assert_eq!(rv[0].slot(), slot);
|
|
}
|
|
|
|
Blockstore::destroy(&ledger_path).expect("Expected successful database destruction");
|
|
}
|
|
|
|
fn new_test_cluster_info(contact_info: ContactInfo) -> ClusterInfo {
|
|
ClusterInfo::new(
|
|
contact_info,
|
|
Arc::new(Keypair::new()),
|
|
SocketAddrSpace::Unspecified,
|
|
)
|
|
}
|
|
|
|
#[test]
|
|
fn window_index_request() {
|
|
let cluster_slots = ClusterSlots::default();
|
|
let me = ContactInfo::new_localhost(&solana_sdk::pubkey::new_rand(), timestamp());
|
|
let cluster_info = Arc::new(new_test_cluster_info(me));
|
|
let serve_repair = ServeRepair::new(cluster_info.clone());
|
|
let mut outstanding_requests = OutstandingShredRepairs::default();
|
|
let rv = serve_repair.repair_request(
|
|
&cluster_slots,
|
|
ShredRepairType::Shred(0, 0),
|
|
&mut LruCache::new(100),
|
|
&mut RepairStats::default(),
|
|
&None,
|
|
&mut outstanding_requests,
|
|
);
|
|
assert_matches!(rv, Err(Error::ClusterInfo(ClusterInfoError::NoPeers)));
|
|
|
|
let serve_repair_addr = socketaddr!([127, 0, 0, 1], 1243);
|
|
let nxt = ContactInfo {
|
|
id: solana_sdk::pubkey::new_rand(),
|
|
gossip: socketaddr!([127, 0, 0, 1], 1234),
|
|
tvu: socketaddr!([127, 0, 0, 1], 1235),
|
|
tvu_forwards: socketaddr!([127, 0, 0, 1], 1236),
|
|
repair: socketaddr!([127, 0, 0, 1], 1237),
|
|
tpu: socketaddr!([127, 0, 0, 1], 1238),
|
|
tpu_forwards: socketaddr!([127, 0, 0, 1], 1239),
|
|
tpu_vote: socketaddr!([127, 0, 0, 1], 1240),
|
|
rpc: socketaddr!([127, 0, 0, 1], 1241),
|
|
rpc_pubsub: socketaddr!([127, 0, 0, 1], 1242),
|
|
serve_repair: serve_repair_addr,
|
|
wallclock: 0,
|
|
shred_version: 0,
|
|
};
|
|
cluster_info.insert_info(nxt.clone());
|
|
let rv = serve_repair
|
|
.repair_request(
|
|
&cluster_slots,
|
|
ShredRepairType::Shred(0, 0),
|
|
&mut LruCache::new(100),
|
|
&mut RepairStats::default(),
|
|
&None,
|
|
&mut outstanding_requests,
|
|
)
|
|
.unwrap();
|
|
assert_eq!(nxt.serve_repair, serve_repair_addr);
|
|
assert_eq!(rv.0, nxt.serve_repair);
|
|
|
|
let serve_repair_addr2 = socketaddr!([127, 0, 0, 2], 1243);
|
|
let nxt = ContactInfo {
|
|
id: solana_sdk::pubkey::new_rand(),
|
|
gossip: socketaddr!([127, 0, 0, 1], 1234),
|
|
tvu: socketaddr!([127, 0, 0, 1], 1235),
|
|
tvu_forwards: socketaddr!([127, 0, 0, 1], 1236),
|
|
repair: socketaddr!([127, 0, 0, 1], 1237),
|
|
tpu: socketaddr!([127, 0, 0, 1], 1238),
|
|
tpu_forwards: socketaddr!([127, 0, 0, 1], 1239),
|
|
tpu_vote: socketaddr!([127, 0, 0, 1], 1240),
|
|
rpc: socketaddr!([127, 0, 0, 1], 1241),
|
|
rpc_pubsub: socketaddr!([127, 0, 0, 1], 1242),
|
|
serve_repair: serve_repair_addr2,
|
|
wallclock: 0,
|
|
shred_version: 0,
|
|
};
|
|
cluster_info.insert_info(nxt);
|
|
let mut one = false;
|
|
let mut two = false;
|
|
while !one || !two {
|
|
//this randomly picks an option, so eventually it should pick both
|
|
let rv = serve_repair
|
|
.repair_request(
|
|
&cluster_slots,
|
|
ShredRepairType::Shred(0, 0),
|
|
&mut LruCache::new(100),
|
|
&mut RepairStats::default(),
|
|
&None,
|
|
&mut outstanding_requests,
|
|
)
|
|
.unwrap();
|
|
if rv.0 == serve_repair_addr {
|
|
one = true;
|
|
}
|
|
if rv.0 == serve_repair_addr2 {
|
|
two = true;
|
|
}
|
|
}
|
|
assert!(one && two);
|
|
}
|
|
|
|
#[test]
|
|
fn test_run_orphan() {
|
|
run_orphan(2, 3, 9);
|
|
}
|
|
|
|
fn run_orphan(slot: Slot, num_slots: u64, nonce: Nonce) {
|
|
solana_logger::setup();
|
|
let recycler = PacketBatchRecycler::default();
|
|
let ledger_path = get_tmp_ledger_path!();
|
|
{
|
|
let blockstore = Arc::new(Blockstore::open(&ledger_path).unwrap());
|
|
let rv = ServeRepair::run_orphan(
|
|
&recycler,
|
|
&socketaddr_any!(),
|
|
Some(&blockstore),
|
|
slot,
|
|
0,
|
|
nonce,
|
|
);
|
|
assert!(rv.is_none());
|
|
|
|
// Create slots [slot, slot + num_slots) with 5 shreds apiece
|
|
let (shreds, _) = make_many_slot_entries(slot, num_slots, 5);
|
|
|
|
blockstore
|
|
.insert_shreds(shreds, None, false)
|
|
.expect("Expect successful ledger write");
|
|
|
|
// We don't have slot `slot + num_slots`, so we don't know how to service this request
|
|
let rv = ServeRepair::run_orphan(
|
|
&recycler,
|
|
&socketaddr_any!(),
|
|
Some(&blockstore),
|
|
slot + num_slots,
|
|
5,
|
|
nonce,
|
|
);
|
|
assert!(rv.is_none());
|
|
|
|
// For a orphan request for `slot + num_slots - 1`, we should return the highest shreds
|
|
// from slots in the range [slot, slot + num_slots - 1]
|
|
let rv: Vec<_> = ServeRepair::run_orphan(
|
|
&recycler,
|
|
&socketaddr_any!(),
|
|
Some(&blockstore),
|
|
slot + num_slots - 1,
|
|
5,
|
|
nonce,
|
|
)
|
|
.expect("run_orphan packets")
|
|
.packets
|
|
.iter()
|
|
.cloned()
|
|
.collect();
|
|
|
|
// Verify responses
|
|
let request = ShredRepairType::Orphan(slot);
|
|
verify_responses(&request, rv.iter());
|
|
|
|
let expected: Vec<_> = (slot..slot + num_slots)
|
|
.rev()
|
|
.filter_map(|slot| {
|
|
let index = blockstore.meta(slot).unwrap().unwrap().received - 1;
|
|
repair_response::repair_response_packet(
|
|
&blockstore,
|
|
slot,
|
|
index,
|
|
&socketaddr_any!(),
|
|
nonce,
|
|
)
|
|
})
|
|
.collect();
|
|
assert_eq!(rv, expected);
|
|
}
|
|
|
|
Blockstore::destroy(&ledger_path).expect("Expected successful database destruction");
|
|
}
|
|
|
|
#[test]
|
|
fn run_orphan_corrupted_shred_size() {
|
|
solana_logger::setup();
|
|
let recycler = PacketBatchRecycler::default();
|
|
let ledger_path = get_tmp_ledger_path!();
|
|
{
|
|
let blockstore = Arc::new(Blockstore::open(&ledger_path).unwrap());
|
|
// Create slots [1, 2] with 1 shred apiece
|
|
let (mut shreds, _) = make_many_slot_entries(1, 2, 1);
|
|
|
|
// Make shred for slot 1 too large
|
|
assert_eq!(shreds[0].slot(), 1);
|
|
assert_eq!(shreds[0].index(), 0);
|
|
shreds[0].payload.push(10);
|
|
shreds[0].data_header.size = shreds[0].payload.len() as u16;
|
|
blockstore
|
|
.insert_shreds(shreds, None, false)
|
|
.expect("Expect successful ledger write");
|
|
let nonce = 42;
|
|
// Make sure repair response is corrupted
|
|
assert!(repair_response::repair_response_packet(
|
|
&blockstore,
|
|
1,
|
|
0,
|
|
&socketaddr_any!(),
|
|
nonce,
|
|
)
|
|
.is_none());
|
|
|
|
// Orphan request for slot 2 should only return slot 1 since
|
|
// calling `repair_response_packet` on slot 1's shred will
|
|
// be corrupted
|
|
let rv: Vec<_> = ServeRepair::run_orphan(
|
|
&recycler,
|
|
&socketaddr_any!(),
|
|
Some(&blockstore),
|
|
2,
|
|
5,
|
|
nonce,
|
|
)
|
|
.expect("run_orphan packets")
|
|
.packets
|
|
.iter()
|
|
.cloned()
|
|
.collect();
|
|
|
|
// Verify responses
|
|
let expected = vec![repair_response::repair_response_packet(
|
|
&blockstore,
|
|
2,
|
|
0,
|
|
&socketaddr_any!(),
|
|
nonce,
|
|
)
|
|
.unwrap()];
|
|
assert_eq!(rv, expected);
|
|
}
|
|
|
|
Blockstore::destroy(&ledger_path).expect("Expected successful database destruction");
|
|
}
|
|
|
|
#[test]
|
|
fn test_run_ancestor_hashes() {
|
|
fn deserialize_ancestor_hashes_response(packet: &Packet) -> AncestorHashesResponseVersion {
|
|
limited_deserialize(&packet.data[..packet.meta.size - SIZE_OF_NONCE]).unwrap()
|
|
}
|
|
|
|
solana_logger::setup();
|
|
let recycler = PacketBatchRecycler::default();
|
|
let ledger_path = get_tmp_ledger_path!();
|
|
{
|
|
let slot = 0;
|
|
let num_slots = MAX_ANCESTOR_RESPONSES as u64;
|
|
let nonce = 10;
|
|
|
|
let blockstore = Arc::new(Blockstore::open(&ledger_path).unwrap());
|
|
|
|
// Create slots [slot, slot + num_slots) with 5 shreds apiece
|
|
let (shreds, _) = make_many_slot_entries(slot, num_slots, 5);
|
|
|
|
blockstore
|
|
.insert_shreds(shreds, None, false)
|
|
.expect("Expect successful ledger write");
|
|
|
|
// We don't have slot `slot + num_slots`, so we return empty
|
|
let rv = ServeRepair::run_ancestor_hashes(
|
|
&recycler,
|
|
&socketaddr_any!(),
|
|
Some(&blockstore),
|
|
slot + num_slots,
|
|
nonce,
|
|
)
|
|
.expect("run_ancestor_hashes packets")
|
|
.packets;
|
|
assert_eq!(rv.len(), 1);
|
|
let packet = &rv[0];
|
|
let ancestor_hashes_response = deserialize_ancestor_hashes_response(packet);
|
|
assert!(ancestor_hashes_response.into_slot_hashes().is_empty());
|
|
|
|
// `slot + num_slots - 1` is not marked duplicate confirmed so nothing should return
|
|
// empty
|
|
let rv = ServeRepair::run_ancestor_hashes(
|
|
&recycler,
|
|
&socketaddr_any!(),
|
|
Some(&blockstore),
|
|
slot + num_slots - 1,
|
|
nonce,
|
|
)
|
|
.expect("run_ancestor_hashes packets")
|
|
.packets;
|
|
assert_eq!(rv.len(), 1);
|
|
let packet = &rv[0];
|
|
let ancestor_hashes_response = deserialize_ancestor_hashes_response(packet);
|
|
assert!(ancestor_hashes_response.into_slot_hashes().is_empty());
|
|
|
|
// Set duplicate confirmed
|
|
let mut expected_ancestors = Vec::with_capacity(num_slots as usize);
|
|
expected_ancestors.resize(num_slots as usize, (0, Hash::default()));
|
|
for (i, duplicate_confirmed_slot) in (slot..slot + num_slots).enumerate() {
|
|
let frozen_hash = Hash::new_unique();
|
|
expected_ancestors[num_slots as usize - i - 1] =
|
|
(duplicate_confirmed_slot, frozen_hash);
|
|
blockstore.insert_bank_hash(duplicate_confirmed_slot, frozen_hash, true);
|
|
}
|
|
let rv = ServeRepair::run_ancestor_hashes(
|
|
&recycler,
|
|
&socketaddr_any!(),
|
|
Some(&blockstore),
|
|
slot + num_slots - 1,
|
|
nonce,
|
|
)
|
|
.expect("run_ancestor_hashes packets")
|
|
.packets;
|
|
assert_eq!(rv.len(), 1);
|
|
let packet = &rv[0];
|
|
let ancestor_hashes_response = deserialize_ancestor_hashes_response(packet);
|
|
assert_eq!(
|
|
ancestor_hashes_response.into_slot_hashes(),
|
|
expected_ancestors
|
|
);
|
|
}
|
|
|
|
Blockstore::destroy(&ledger_path).expect("Expected successful database destruction");
|
|
}
|
|
|
|
#[test]
|
|
fn test_repair_with_repair_validators() {
|
|
let cluster_slots = ClusterSlots::default();
|
|
let me = ContactInfo::new_localhost(&solana_sdk::pubkey::new_rand(), timestamp());
|
|
let cluster_info = Arc::new(new_test_cluster_info(me.clone()));
|
|
|
|
// Insert two peers on the network
|
|
let contact_info2 =
|
|
ContactInfo::new_localhost(&solana_sdk::pubkey::new_rand(), timestamp());
|
|
let contact_info3 =
|
|
ContactInfo::new_localhost(&solana_sdk::pubkey::new_rand(), timestamp());
|
|
cluster_info.insert_info(contact_info2.clone());
|
|
cluster_info.insert_info(contact_info3.clone());
|
|
let serve_repair = ServeRepair::new(cluster_info);
|
|
|
|
// If:
|
|
// 1) repair validator set doesn't exist in gossip
|
|
// 2) repair validator set only includes our own id
|
|
// then no repairs should be generated
|
|
for pubkey in &[solana_sdk::pubkey::new_rand(), me.id] {
|
|
let known_validators = Some(vec![*pubkey].into_iter().collect());
|
|
assert!(serve_repair.repair_peers(&known_validators, 1).is_empty());
|
|
assert!(serve_repair
|
|
.repair_request(
|
|
&cluster_slots,
|
|
ShredRepairType::Shred(0, 0),
|
|
&mut LruCache::new(100),
|
|
&mut RepairStats::default(),
|
|
&known_validators,
|
|
&mut OutstandingShredRepairs::default(),
|
|
)
|
|
.is_err());
|
|
}
|
|
|
|
// If known validator exists in gossip, should return repair successfully
|
|
let known_validators = Some(vec![contact_info2.id].into_iter().collect());
|
|
let repair_peers = serve_repair.repair_peers(&known_validators, 1);
|
|
assert_eq!(repair_peers.len(), 1);
|
|
assert_eq!(repair_peers[0].id, contact_info2.id);
|
|
assert!(serve_repair
|
|
.repair_request(
|
|
&cluster_slots,
|
|
ShredRepairType::Shred(0, 0),
|
|
&mut LruCache::new(100),
|
|
&mut RepairStats::default(),
|
|
&known_validators,
|
|
&mut OutstandingShredRepairs::default(),
|
|
)
|
|
.is_ok());
|
|
|
|
// Using no known validators should default to all
|
|
// validator's available in gossip, excluding myself
|
|
let repair_peers: HashSet<Pubkey> = serve_repair
|
|
.repair_peers(&None, 1)
|
|
.into_iter()
|
|
.map(|c| c.id)
|
|
.collect();
|
|
assert_eq!(repair_peers.len(), 2);
|
|
assert!(repair_peers.contains(&contact_info2.id));
|
|
assert!(repair_peers.contains(&contact_info3.id));
|
|
assert!(serve_repair
|
|
.repair_request(
|
|
&cluster_slots,
|
|
ShredRepairType::Shred(0, 0),
|
|
&mut LruCache::new(100),
|
|
&mut RepairStats::default(),
|
|
&None,
|
|
&mut OutstandingShredRepairs::default(),
|
|
)
|
|
.is_ok());
|
|
}
|
|
|
|
#[test]
|
|
fn test_verify_shred_response() {
|
|
let repair = ShredRepairType::Orphan(9);
|
|
// Ensure new options are addded to this test
|
|
match repair {
|
|
ShredRepairType::Orphan(_) => (),
|
|
ShredRepairType::HighestShred(_, _) => (),
|
|
ShredRepairType::Shred(_, _) => (),
|
|
};
|
|
|
|
let slot = 9;
|
|
let index = 5;
|
|
|
|
// Orphan
|
|
let mut shred = Shred::new_empty_data_shred();
|
|
shred.set_slot(slot);
|
|
let request = ShredRepairType::Orphan(slot);
|
|
assert!(request.verify_response(&shred));
|
|
shred.set_slot(slot - 1);
|
|
assert!(request.verify_response(&shred));
|
|
shred.set_slot(slot + 1);
|
|
assert!(!request.verify_response(&shred));
|
|
|
|
// HighestShred
|
|
shred = Shred::new_empty_data_shred();
|
|
shred.set_slot(slot);
|
|
shred.set_index(index);
|
|
let request = ShredRepairType::HighestShred(slot, index as u64);
|
|
assert!(request.verify_response(&shred));
|
|
shred.set_index(index + 1);
|
|
assert!(request.verify_response(&shred));
|
|
shred.set_index(index - 1);
|
|
assert!(!request.verify_response(&shred));
|
|
shred.set_slot(slot - 1);
|
|
shred.set_index(index);
|
|
assert!(!request.verify_response(&shred));
|
|
shred.set_slot(slot + 1);
|
|
assert!(!request.verify_response(&shred));
|
|
|
|
// Shred
|
|
shred = Shred::new_empty_data_shred();
|
|
shred.set_slot(slot);
|
|
shred.set_index(index);
|
|
let request = ShredRepairType::Shred(slot, index as u64);
|
|
assert!(request.verify_response(&shred));
|
|
shred.set_index(index + 1);
|
|
assert!(!request.verify_response(&shred));
|
|
shred.set_slot(slot + 1);
|
|
shred.set_index(index);
|
|
assert!(!request.verify_response(&shred));
|
|
}
|
|
|
|
fn verify_responses<'a>(request: &ShredRepairType, packets: impl Iterator<Item = &'a Packet>) {
|
|
for packet in packets {
|
|
let shred_payload = packet.data.to_vec();
|
|
let shred = Shred::new_from_serialized_shred(shred_payload).unwrap();
|
|
request.verify_response(&shred);
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn test_verify_ancestor_response() {
|
|
let request_slot = MAX_ANCESTOR_RESPONSES as Slot;
|
|
let repair = AncestorHashesRepairType(request_slot);
|
|
let mut response: Vec<SlotHash> = (0..request_slot)
|
|
.into_iter()
|
|
.map(|slot| (slot, Hash::new_unique()))
|
|
.collect();
|
|
assert!(repair.verify_response(&AncestorHashesResponseVersion::Current(response.clone())));
|
|
|
|
// over the allowed limit, should fail
|
|
response.push((request_slot, Hash::new_unique()));
|
|
assert!(!repair.verify_response(&AncestorHashesResponseVersion::Current(response)));
|
|
}
|
|
}
|