2221 lines
79 KiB
Rust
2221 lines
79 KiB
Rust
//! The `cluster_info` module defines a data structure that is shared by all the nodes in the network over
|
|
//! a gossip control plane. The goal is to share small bits of off-chain information and detect and
|
|
//! repair partitions.
|
|
//!
|
|
//! This CRDT only supports a very limited set of types. A map of Pubkey -> Versioned Struct.
|
|
//! The last version is always picked during an update.
|
|
//!
|
|
//! The network is arranged in layers:
|
|
//!
|
|
//! * layer 0 - Leader.
|
|
//! * layer 1 - As many nodes as we can fit
|
|
//! * layer 2 - Everyone else, if layer 1 is `2^10`, layer 2 should be able to fit `2^20` number of nodes.
|
|
//!
|
|
//! Bank needs to provide an interface for us to query the stake weight
|
|
use crate::bank_forks::BankForks;
|
|
use crate::blocktree::Blocktree;
|
|
use crate::contact_info::ContactInfo;
|
|
use crate::crds_gossip::CrdsGossip;
|
|
use crate::crds_gossip_error::CrdsGossipError;
|
|
use crate::crds_gossip_pull::CRDS_GOSSIP_PULL_CRDS_TIMEOUT_MS;
|
|
use crate::crds_value::{CrdsValue, CrdsValueLabel, Vote};
|
|
use crate::packet::{to_shared_blob, Blob, SharedBlob, BLOB_SIZE};
|
|
use crate::repair_service::RepairType;
|
|
use crate::result::Result;
|
|
use crate::staking_utils;
|
|
use crate::streamer::{BlobReceiver, BlobSender};
|
|
use bincode::{deserialize, serialize};
|
|
use core::cmp;
|
|
use hashbrown::HashMap;
|
|
use rand::{thread_rng, Rng};
|
|
use rayon::prelude::*;
|
|
use solana_metrics::counter::Counter;
|
|
use solana_metrics::{influxdb, submit};
|
|
use solana_netutil::{
|
|
bind_in_range, bind_to, find_available_port_in_range, multi_bind_in_range, PortRange,
|
|
};
|
|
use solana_runtime::bloom::Bloom;
|
|
use solana_sdk::hash::Hash;
|
|
use solana_sdk::pubkey::Pubkey;
|
|
use solana_sdk::signature::{Keypair, KeypairUtil, Signable, Signature};
|
|
use solana_sdk::timing::{duration_as_ms, timestamp};
|
|
use solana_sdk::transaction::Transaction;
|
|
use std::cmp::min;
|
|
use std::fmt;
|
|
use std::io;
|
|
use std::net::{IpAddr, Ipv4Addr, SocketAddr, UdpSocket};
|
|
use std::sync::atomic::{AtomicBool, Ordering};
|
|
use std::sync::{Arc, RwLock};
|
|
use std::thread::{sleep, Builder, JoinHandle};
|
|
use std::time::{Duration, Instant};
|
|
|
|
pub const FULLNODE_PORT_RANGE: PortRange = (8000, 10_000);
|
|
|
|
/// The Data plane "neighborhood" size
|
|
pub const NEIGHBORHOOD_SIZE: usize = 200;
|
|
/// Set whether node capacity should grow as layers are added
|
|
pub const GROW_LAYER_CAPACITY: bool = false;
|
|
|
|
/// milliseconds we sleep for between gossip requests
|
|
pub const GOSSIP_SLEEP_MILLIS: u64 = 100;
|
|
|
|
/// the number of slots to respond with when responding to `Orphan` requests
|
|
pub const MAX_ORPHAN_REPAIR_RESPONSES: usize = 10;
|
|
|
|
#[derive(Debug, PartialEq, Eq)]
|
|
pub enum ClusterInfoError {
|
|
NoPeers,
|
|
NoLeader,
|
|
BadContactInfo,
|
|
BadGossipAddress,
|
|
}
|
|
#[derive(Clone)]
|
|
pub struct ClusterInfo {
|
|
/// The network
|
|
pub gossip: CrdsGossip,
|
|
/// set the keypair that will be used to sign crds values generated. It is unset only in tests.
|
|
pub(crate) keypair: Arc<Keypair>,
|
|
// TODO: remove gossip_leader_id once all usage of `set_leader()` and `leader_data()` is
|
|
// purged
|
|
gossip_leader_id: Pubkey,
|
|
/// The network entrypoint
|
|
entrypoint: Option<ContactInfo>,
|
|
}
|
|
|
|
#[derive(Default, Clone)]
|
|
pub struct Locality {
|
|
/// The bounds of the neighborhood represented by this locality
|
|
pub neighbor_bounds: (usize, usize),
|
|
/// The `avalanche` layer this locality is in
|
|
pub layer_ix: usize,
|
|
/// The bounds of the current layer
|
|
pub layer_bounds: (usize, usize),
|
|
/// The bounds of the next layer
|
|
pub child_layer_bounds: Option<(usize, usize)>,
|
|
/// The indices of the nodes that should be contacted in next layer
|
|
pub child_layer_peers: Vec<usize>,
|
|
}
|
|
|
|
impl fmt::Debug for Locality {
|
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
|
write!(
|
|
f,
|
|
"Packet {{ neighborhood_bounds: {:?}, current_layer: {:?}, child_layer_bounds: {:?} child_layer_peers: {:?} }}",
|
|
self.neighbor_bounds, self.layer_ix, self.child_layer_bounds, self.child_layer_peers
|
|
)
|
|
}
|
|
}
|
|
|
|
#[derive(Debug, Deserialize, Serialize)]
|
|
pub struct PruneData {
|
|
/// Pubkey of the node that sent this prune data
|
|
pub pubkey: Pubkey,
|
|
/// Pubkeys of nodes that should be pruned
|
|
pub prunes: Vec<Pubkey>,
|
|
/// Signature of this Prune Message
|
|
pub signature: Signature,
|
|
/// The Pubkey of the intended node/destination for this message
|
|
pub destination: Pubkey,
|
|
/// Wallclock of the node that generated this message
|
|
pub wallclock: u64,
|
|
}
|
|
|
|
impl Signable for PruneData {
|
|
fn pubkey(&self) -> Pubkey {
|
|
self.pubkey
|
|
}
|
|
|
|
fn signable_data(&self) -> Vec<u8> {
|
|
#[derive(Serialize)]
|
|
struct SignData {
|
|
pubkey: Pubkey,
|
|
prunes: Vec<Pubkey>,
|
|
destination: Pubkey,
|
|
wallclock: u64,
|
|
}
|
|
let data = SignData {
|
|
pubkey: self.pubkey,
|
|
prunes: self.prunes.clone(),
|
|
destination: self.destination,
|
|
wallclock: self.wallclock,
|
|
};
|
|
serialize(&data).expect("serialize PruneData")
|
|
}
|
|
|
|
fn get_signature(&self) -> Signature {
|
|
self.signature
|
|
}
|
|
|
|
fn set_signature(&mut self, signature: Signature) {
|
|
self.signature = signature
|
|
}
|
|
}
|
|
|
|
// TODO These messages should go through the gpu pipeline for spam filtering
|
|
#[derive(Serialize, Deserialize, Debug)]
|
|
#[allow(clippy::large_enum_variant)]
|
|
enum Protocol {
|
|
/// Gossip protocol messages
|
|
PullRequest(Bloom<Hash>, CrdsValue),
|
|
PullResponse(Pubkey, Vec<CrdsValue>),
|
|
PushMessage(Pubkey, Vec<CrdsValue>),
|
|
PruneMessage(Pubkey, PruneData),
|
|
|
|
/// Window protocol messages
|
|
/// TODO: move this message to a different module
|
|
RequestWindowIndex(ContactInfo, u64, u64),
|
|
RequestHighestWindowIndex(ContactInfo, u64, u64),
|
|
RequestOrphan(ContactInfo, u64),
|
|
}
|
|
|
|
impl ClusterInfo {
|
|
/// Without a valid keypair gossip will not function. Only useful for tests.
|
|
pub fn new_with_invalid_keypair(contact_info: ContactInfo) -> Self {
|
|
Self::new(contact_info, Arc::new(Keypair::new()))
|
|
}
|
|
|
|
pub fn new(contact_info: ContactInfo, keypair: Arc<Keypair>) -> Self {
|
|
let mut me = Self {
|
|
gossip: CrdsGossip::default(),
|
|
keypair,
|
|
gossip_leader_id: Pubkey::default(),
|
|
entrypoint: None,
|
|
};
|
|
let id = contact_info.id;
|
|
me.gossip.set_self(&id);
|
|
me.insert_self(contact_info);
|
|
me.push_self(&HashMap::new());
|
|
me
|
|
}
|
|
|
|
pub fn insert_self(&mut self, contact_info: ContactInfo) {
|
|
if self.id() == contact_info.id {
|
|
let mut value = CrdsValue::ContactInfo(contact_info.clone());
|
|
value.sign(&self.keypair);
|
|
let _ = self.gossip.crds.insert(value, timestamp());
|
|
}
|
|
}
|
|
|
|
fn push_self(&mut self, stakes: &HashMap<Pubkey, u64>) {
|
|
let mut my_data = self.my_data();
|
|
let now = timestamp();
|
|
my_data.wallclock = now;
|
|
let mut entry = CrdsValue::ContactInfo(my_data);
|
|
entry.sign(&self.keypair);
|
|
self.gossip.refresh_push_active_set(stakes);
|
|
self.gossip.process_push_message(&[entry], now);
|
|
}
|
|
|
|
// TODO kill insert_info, only used by tests
|
|
pub fn insert_info(&mut self, contact_info: ContactInfo) {
|
|
let mut value = CrdsValue::ContactInfo(contact_info);
|
|
value.sign(&self.keypair);
|
|
let _ = self.gossip.crds.insert(value, timestamp());
|
|
}
|
|
|
|
pub fn set_entrypoint(&mut self, entrypoint: ContactInfo) {
|
|
self.entrypoint = Some(entrypoint)
|
|
}
|
|
|
|
pub fn id(&self) -> Pubkey {
|
|
self.gossip.id
|
|
}
|
|
|
|
pub fn lookup(&self, id: &Pubkey) -> Option<&ContactInfo> {
|
|
let entry = CrdsValueLabel::ContactInfo(*id);
|
|
self.gossip
|
|
.crds
|
|
.lookup(&entry)
|
|
.and_then(CrdsValue::contact_info)
|
|
}
|
|
|
|
pub fn my_data(&self) -> ContactInfo {
|
|
self.lookup(&self.id()).cloned().unwrap()
|
|
}
|
|
|
|
// Deprecated: don't use leader_data().
|
|
pub fn leader_data(&self) -> Option<&ContactInfo> {
|
|
let leader_id = self.gossip_leader_id;
|
|
if leader_id == Pubkey::default() {
|
|
return None;
|
|
}
|
|
self.lookup(&leader_id)
|
|
}
|
|
|
|
pub fn contact_info_trace(&self) -> String {
|
|
let now = timestamp();
|
|
let mut spy_nodes = 0;
|
|
let nodes: Vec<_> = self
|
|
.all_peers()
|
|
.into_iter()
|
|
.map(|node| {
|
|
if !ContactInfo::is_valid_address(&node.gossip) {
|
|
spy_nodes += 1;
|
|
}
|
|
fn addr_to_string(addr: &SocketAddr) -> String {
|
|
if ContactInfo::is_valid_address(addr) {
|
|
addr.to_string()
|
|
} else {
|
|
"none".to_string()
|
|
}
|
|
}
|
|
|
|
format!(
|
|
"- gossip: {:20} | {:5}ms | {}\n \
|
|
tpu: {:20} | |\n \
|
|
rpc: {:20} | |\n",
|
|
addr_to_string(&node.gossip),
|
|
now.saturating_sub(node.wallclock),
|
|
node.id,
|
|
addr_to_string(&node.tpu),
|
|
addr_to_string(&node.rpc),
|
|
)
|
|
})
|
|
.collect();
|
|
|
|
format!(
|
|
" Node contact info | Age | Node identifier \n\
|
|
-------------------------------+---------+-----------------------------------\n\
|
|
{}\
|
|
Nodes: {}{}",
|
|
nodes.join(""),
|
|
nodes.len() - spy_nodes,
|
|
if spy_nodes > 0 {
|
|
format!("\nSpies: {}", spy_nodes)
|
|
} else {
|
|
"".to_string()
|
|
}
|
|
)
|
|
}
|
|
|
|
/// Record the id of the current leader for use by `leader_tpu_via_blobs()`
|
|
pub fn set_leader(&mut self, leader_id: &Pubkey) {
|
|
warn!(
|
|
"{}: LEADER_UPDATE TO {} from {}",
|
|
self.gossip.id, leader_id, self.gossip_leader_id,
|
|
);
|
|
self.gossip_leader_id = *leader_id;
|
|
}
|
|
|
|
pub fn push_vote(&mut self, vote: Transaction) {
|
|
let now = timestamp();
|
|
let vote = Vote::new(&self.id(), vote, now);
|
|
let mut entry = CrdsValue::Vote(vote);
|
|
entry.sign(&self.keypair);
|
|
self.gossip.process_push_message(&[entry], now);
|
|
}
|
|
|
|
/// Get votes in the crds
|
|
/// * since - The timestamp of when the vote inserted must be greater than
|
|
/// since. This allows the bank to query for new votes only.
|
|
///
|
|
/// * return - The votes, and the max timestamp from the new set.
|
|
pub fn get_votes(&self, since: u64) -> (Vec<Transaction>, u64) {
|
|
let votes: Vec<_> = self
|
|
.gossip
|
|
.crds
|
|
.table
|
|
.values()
|
|
.filter(|x| x.insert_timestamp > since)
|
|
.filter_map(|x| {
|
|
x.value
|
|
.vote()
|
|
.map(|v| (x.insert_timestamp, v.transaction.clone()))
|
|
})
|
|
.collect();
|
|
let max_ts = votes.iter().map(|x| x.0).max().unwrap_or(since);
|
|
let txs: Vec<Transaction> = votes.into_iter().map(|x| x.1).collect();
|
|
(txs, max_ts)
|
|
}
|
|
|
|
pub fn purge(&mut self, now: u64) {
|
|
self.gossip.purge(now);
|
|
}
|
|
|
|
pub fn rpc_peers(&self) -> Vec<ContactInfo> {
|
|
let me = self.my_data().id;
|
|
self.gossip
|
|
.crds
|
|
.table
|
|
.values()
|
|
.filter_map(|x| x.value.contact_info())
|
|
.filter(|x| x.id != me)
|
|
.filter(|x| ContactInfo::is_valid_address(&x.rpc))
|
|
.cloned()
|
|
.collect()
|
|
}
|
|
|
|
// All nodes in gossip, including spy nodes
|
|
fn all_peers(&self) -> Vec<ContactInfo> {
|
|
let me = self.my_data().id;
|
|
self.gossip
|
|
.crds
|
|
.table
|
|
.values()
|
|
.filter_map(|x| x.value.contact_info())
|
|
.filter(|x| x.id != me)
|
|
.cloned()
|
|
.collect()
|
|
}
|
|
|
|
pub fn gossip_peers(&self) -> Vec<ContactInfo> {
|
|
let me = self.my_data().id;
|
|
self.gossip
|
|
.crds
|
|
.table
|
|
.values()
|
|
.filter_map(|x| x.value.contact_info())
|
|
.filter(|x| x.id != me)
|
|
.filter(|x| ContactInfo::is_valid_address(&x.gossip))
|
|
.cloned()
|
|
.collect()
|
|
}
|
|
|
|
/// compute broadcast table
|
|
pub fn tvu_peers(&self) -> Vec<ContactInfo> {
|
|
let me = self.my_data().id;
|
|
self.gossip
|
|
.crds
|
|
.table
|
|
.values()
|
|
.filter_map(|x| x.value.contact_info())
|
|
.filter(|x| ContactInfo::is_valid_address(&x.tvu))
|
|
.filter(|x| x.id != me)
|
|
.cloned()
|
|
.collect()
|
|
}
|
|
|
|
/// all peers that have a valid tvu
|
|
pub fn retransmit_peers(&self) -> Vec<ContactInfo> {
|
|
let me = self.my_data().id;
|
|
self.gossip
|
|
.crds
|
|
.table
|
|
.values()
|
|
.filter_map(|x| x.value.contact_info())
|
|
.filter(|x| x.id != me)
|
|
.filter(|x| ContactInfo::is_valid_address(&x.tvu))
|
|
.cloned()
|
|
.collect()
|
|
}
|
|
|
|
/// all tvu peers with valid gossip addrs
|
|
fn repair_peers(&self) -> Vec<ContactInfo> {
|
|
let me = self.my_data().id;
|
|
ClusterInfo::tvu_peers(self)
|
|
.into_iter()
|
|
.filter(|x| x.id != me)
|
|
.filter(|x| ContactInfo::is_valid_address(&x.gossip))
|
|
.collect()
|
|
}
|
|
|
|
fn sort_by_stake<S: std::hash::BuildHasher>(
|
|
peers: &[ContactInfo],
|
|
stakes: &HashMap<Pubkey, u64, S>,
|
|
) -> Vec<(u64, ContactInfo)> {
|
|
let mut peers_with_stakes: Vec<_> = peers
|
|
.iter()
|
|
.map(|c| (*stakes.get(&c.id).unwrap_or(&0), c.clone()))
|
|
.collect();
|
|
peers_with_stakes.sort_unstable_by(|(l_stake, l_info), (r_stake, r_info)| {
|
|
if r_stake == l_stake {
|
|
r_info.id.cmp(&l_info.id)
|
|
} else {
|
|
r_stake.cmp(&l_stake)
|
|
}
|
|
});
|
|
peers_with_stakes.dedup();
|
|
peers_with_stakes
|
|
}
|
|
|
|
/// Return sorted Retransmit peers and index of `Self.id()` as if it were in that list
|
|
fn sorted_peers_and_index<S: std::hash::BuildHasher>(
|
|
&self,
|
|
stakes: &HashMap<Pubkey, u64, S>,
|
|
) -> (usize, Vec<ContactInfo>) {
|
|
let mut peers = self.retransmit_peers();
|
|
peers.push(self.lookup(&self.id()).unwrap().clone());
|
|
let contacts_and_stakes: Vec<_> = ClusterInfo::sort_by_stake(&peers, stakes);
|
|
let mut index = 0;
|
|
let peers: Vec<_> = contacts_and_stakes
|
|
.into_iter()
|
|
.enumerate()
|
|
.filter_map(|(i, (_, peer))| {
|
|
if peer.id == self.id() {
|
|
index = i;
|
|
None
|
|
} else {
|
|
Some(peer)
|
|
}
|
|
})
|
|
.collect();
|
|
(index, peers)
|
|
}
|
|
|
|
pub fn sorted_tvu_peers(&self, stakes: &HashMap<Pubkey, u64>) -> Vec<ContactInfo> {
|
|
let peers = self.tvu_peers();
|
|
let peers_with_stakes: Vec<_> = ClusterInfo::sort_by_stake(&peers, stakes);
|
|
peers_with_stakes
|
|
.iter()
|
|
.map(|(_, peer)| (*peer).clone())
|
|
.collect()
|
|
}
|
|
|
|
/// compute broadcast table
|
|
pub fn tpu_peers(&self) -> Vec<ContactInfo> {
|
|
let me = self.my_data().id;
|
|
self.gossip
|
|
.crds
|
|
.table
|
|
.values()
|
|
.filter_map(|x| x.value.contact_info())
|
|
.filter(|x| x.id != me)
|
|
.filter(|x| ContactInfo::is_valid_address(&x.tpu))
|
|
.cloned()
|
|
.collect()
|
|
}
|
|
|
|
/// Given a node count, neighborhood size, and an initial fanout (leader -> layer 1), it
|
|
/// calculates how many layers are needed and at what index each layer begins.
|
|
/// The `grow` parameter is used to determine if the network should 'fanout' or keep
|
|
/// layer capacities constant.
|
|
pub fn describe_data_plane(
|
|
nodes: usize,
|
|
fanout: usize,
|
|
hood_size: usize,
|
|
grow: bool,
|
|
) -> (usize, Vec<usize>) {
|
|
let mut layer_indices: Vec<usize> = vec![0];
|
|
if nodes == 0 {
|
|
(0, vec![])
|
|
} else if nodes <= fanout {
|
|
// single layer data plane
|
|
(1, layer_indices)
|
|
} else {
|
|
//layer 1 is going to be the first num fanout nodes, so exclude those
|
|
let mut remaining_nodes = nodes - fanout;
|
|
layer_indices.push(fanout);
|
|
let mut num_layers = 2;
|
|
let mut num_neighborhoods = fanout / 2;
|
|
let mut layer_capacity = hood_size * num_neighborhoods;
|
|
while remaining_nodes > 0 {
|
|
if remaining_nodes > layer_capacity {
|
|
// Needs more layers.
|
|
num_layers += 1;
|
|
remaining_nodes -= layer_capacity;
|
|
let end = *layer_indices.last().unwrap();
|
|
layer_indices.push(layer_capacity + end);
|
|
|
|
if grow {
|
|
// Next layer's capacity
|
|
num_neighborhoods *= num_neighborhoods;
|
|
layer_capacity = hood_size * num_neighborhoods;
|
|
}
|
|
} else {
|
|
//everything will now fit in the layers we have
|
|
let end = *layer_indices.last().unwrap();
|
|
layer_indices.push(layer_capacity + end);
|
|
break;
|
|
}
|
|
}
|
|
assert_eq!(num_layers, layer_indices.len() - 1);
|
|
(num_layers, layer_indices)
|
|
}
|
|
}
|
|
|
|
fn localize_item(
|
|
layer_indices: &[usize],
|
|
hood_size: usize,
|
|
select_index: usize,
|
|
curr_index: usize,
|
|
) -> Option<(Locality)> {
|
|
let end = layer_indices.len() - 1;
|
|
let next = min(end, curr_index + 1);
|
|
let value = layer_indices[curr_index];
|
|
let localized = select_index >= value && select_index < layer_indices[next];
|
|
let mut locality = Locality::default();
|
|
if localized {
|
|
match curr_index {
|
|
_ if curr_index == 0 => {
|
|
locality.layer_ix = 0;
|
|
locality.layer_bounds = (0, hood_size);
|
|
locality.neighbor_bounds = locality.layer_bounds;
|
|
if next == end {
|
|
locality.child_layer_bounds = None;
|
|
locality.child_layer_peers = vec![];
|
|
} else {
|
|
locality.child_layer_bounds =
|
|
Some((layer_indices[next], layer_indices[next + 1]));
|
|
locality.child_layer_peers = ClusterInfo::lower_layer_peers(
|
|
select_index,
|
|
layer_indices[next],
|
|
layer_indices[next + 1],
|
|
hood_size,
|
|
);
|
|
}
|
|
}
|
|
_ if curr_index == end => {
|
|
locality.layer_ix = end;
|
|
locality.layer_bounds = (end - hood_size, end);
|
|
locality.neighbor_bounds = locality.layer_bounds;
|
|
locality.child_layer_bounds = None;
|
|
locality.child_layer_peers = vec![];
|
|
}
|
|
ix => {
|
|
let hood_ix = (select_index - value) / hood_size;
|
|
locality.layer_ix = ix;
|
|
locality.layer_bounds = (value, layer_indices[next]);
|
|
locality.neighbor_bounds = (
|
|
((hood_ix * hood_size) + value),
|
|
((hood_ix + 1) * hood_size + value),
|
|
);
|
|
if next == end {
|
|
locality.child_layer_bounds = None;
|
|
locality.child_layer_peers = vec![];
|
|
} else {
|
|
locality.child_layer_bounds =
|
|
Some((layer_indices[next], layer_indices[next + 1]));
|
|
locality.child_layer_peers = ClusterInfo::lower_layer_peers(
|
|
select_index,
|
|
layer_indices[next],
|
|
layer_indices[next + 1],
|
|
hood_size,
|
|
);
|
|
}
|
|
}
|
|
}
|
|
Some(locality)
|
|
} else {
|
|
None
|
|
}
|
|
}
|
|
|
|
/// Given a array of layer indices and another index, returns (as a `Locality`) the layer,
|
|
/// layer-bounds and neighborhood-bounds in which the index resides
|
|
fn localize(layer_indices: &[usize], hood_size: usize, select_index: usize) -> Locality {
|
|
(0..layer_indices.len())
|
|
.find_map(|i| ClusterInfo::localize_item(layer_indices, hood_size, select_index, i))
|
|
.or_else(|| Some(Locality::default()))
|
|
.unwrap()
|
|
}
|
|
|
|
fn lower_layer_peers(index: usize, start: usize, end: usize, hood_size: usize) -> Vec<usize> {
|
|
(start..end)
|
|
.step_by(hood_size)
|
|
.map(|x| x + index % hood_size)
|
|
.collect()
|
|
}
|
|
|
|
/// broadcast messages from the leader to layer 1 nodes
|
|
/// # Remarks
|
|
pub fn broadcast(
|
|
id: &Pubkey,
|
|
contains_last_tick: bool,
|
|
broadcast_table: &[ContactInfo],
|
|
s: &UdpSocket,
|
|
blobs: &[SharedBlob],
|
|
) -> Result<()> {
|
|
if broadcast_table.is_empty() {
|
|
debug!("{}:not enough peers in cluster_info table", id);
|
|
inc_new_counter_info!("cluster_info-broadcast-not_enough_peers_error", 1);
|
|
Err(ClusterInfoError::NoPeers)?;
|
|
}
|
|
|
|
let orders = Self::create_broadcast_orders(contains_last_tick, blobs, broadcast_table);
|
|
|
|
trace!("broadcast orders table {}", orders.len());
|
|
|
|
let errs = Self::send_orders(id, s, orders);
|
|
|
|
for e in errs {
|
|
if let Err(e) = &e {
|
|
trace!("{}: broadcast result {:?}", id, e);
|
|
}
|
|
e?;
|
|
}
|
|
|
|
inc_new_counter_info!("cluster_info-broadcast-max_idx", blobs.len());
|
|
|
|
Ok(())
|
|
}
|
|
|
|
/// retransmit messages to a list of nodes
|
|
/// # Remarks
|
|
/// We need to avoid having obj locked while doing any io, such as the `send_to`
|
|
pub fn retransmit_to(
|
|
obj: &Arc<RwLock<Self>>,
|
|
peers: &[ContactInfo],
|
|
blob: &SharedBlob,
|
|
s: &UdpSocket,
|
|
) -> Result<()> {
|
|
let (me, orders): (ContactInfo, &[ContactInfo]) = {
|
|
// copy to avoid locking during IO
|
|
let s = obj.read().unwrap();
|
|
(s.my_data().clone(), peers)
|
|
};
|
|
let rblob = blob.read().unwrap();
|
|
trace!("retransmit orders {}", orders.len());
|
|
let errs: Vec<_> = orders
|
|
.par_iter()
|
|
.map(|v| {
|
|
debug!(
|
|
"{}: retransmit blob {} to {} {}",
|
|
me.id,
|
|
rblob.index(),
|
|
v.id,
|
|
v.tvu,
|
|
);
|
|
//TODO profile this, may need multiple sockets for par_iter
|
|
assert!(rblob.meta.size <= BLOB_SIZE);
|
|
s.send_to(&rblob.data[..rblob.meta.size], &v.tvu)
|
|
})
|
|
.collect();
|
|
for e in errs {
|
|
if let Err(e) = &e {
|
|
inc_new_counter_info!("cluster_info-retransmit-send_to_error", 1, 1);
|
|
error!("retransmit result {:?}", e);
|
|
}
|
|
e?;
|
|
}
|
|
Ok(())
|
|
}
|
|
|
|
/// retransmit messages from the leader to layer 1 nodes
|
|
/// # Remarks
|
|
/// We need to avoid having obj locked while doing any io, such as the `send_to`
|
|
pub fn retransmit(obj: &Arc<RwLock<Self>>, blob: &SharedBlob, s: &UdpSocket) -> Result<()> {
|
|
let peers = obj.read().unwrap().retransmit_peers();
|
|
ClusterInfo::retransmit_to(obj, &peers, blob, s)
|
|
}
|
|
|
|
fn send_orders(
|
|
id: &Pubkey,
|
|
s: &UdpSocket,
|
|
orders: Vec<(SharedBlob, Vec<&ContactInfo>)>,
|
|
) -> Vec<io::Result<usize>> {
|
|
orders
|
|
.into_iter()
|
|
.flat_map(|(b, vs)| {
|
|
let blob = b.read().unwrap();
|
|
|
|
let ids_and_tvus = if log_enabled!(log::Level::Trace) {
|
|
let v_ids = vs.iter().map(|v| v.id);
|
|
let tvus = vs.iter().map(|v| v.tvu);
|
|
let ids_and_tvus = v_ids.zip(tvus).collect();
|
|
|
|
trace!(
|
|
"{}: BROADCAST idx: {} sz: {} to {:?} coding: {}",
|
|
id,
|
|
blob.index(),
|
|
blob.meta.size,
|
|
ids_and_tvus,
|
|
blob.is_coding()
|
|
);
|
|
|
|
ids_and_tvus
|
|
} else {
|
|
vec![]
|
|
};
|
|
|
|
assert!(blob.meta.size <= BLOB_SIZE);
|
|
let send_errs_for_blob: Vec<_> = vs
|
|
.iter()
|
|
.map(move |v| {
|
|
let e = s.send_to(&blob.data[..blob.meta.size], &v.tvu);
|
|
trace!(
|
|
"{}: done broadcast {} to {:?}",
|
|
id,
|
|
blob.meta.size,
|
|
ids_and_tvus
|
|
);
|
|
e
|
|
})
|
|
.collect();
|
|
send_errs_for_blob
|
|
})
|
|
.collect()
|
|
}
|
|
|
|
pub fn create_broadcast_orders<'a, T>(
|
|
contains_last_tick: bool,
|
|
blobs: &[T],
|
|
broadcast_table: &'a [ContactInfo],
|
|
) -> Vec<(T, Vec<&'a ContactInfo>)>
|
|
where
|
|
T: Clone,
|
|
{
|
|
// enumerate all the blobs in the window, those are the indices
|
|
// transmit them to nodes, starting from a different node.
|
|
if blobs.is_empty() {
|
|
return vec![];
|
|
}
|
|
let mut orders = Vec::with_capacity(blobs.len());
|
|
|
|
let x = thread_rng().gen_range(0, broadcast_table.len());
|
|
for (i, blob) in blobs.iter().enumerate() {
|
|
let br_idx = (x + i) % broadcast_table.len();
|
|
|
|
trace!("broadcast order data br_idx {}", br_idx);
|
|
|
|
orders.push((blob.clone(), vec![&broadcast_table[br_idx]]));
|
|
}
|
|
|
|
if contains_last_tick {
|
|
// Broadcast the last tick to everyone on the network so it doesn't get dropped
|
|
// (Need to maximize probability the next leader in line sees this handoff tick
|
|
// despite packet drops)
|
|
// If we had a tick at max_tick_height, then we know it must be the last
|
|
// Blob in the broadcast, There cannot be an entry that got sent after the
|
|
// last tick, guaranteed by the PohService).
|
|
orders.push((
|
|
blobs.last().unwrap().clone(),
|
|
broadcast_table.iter().collect(),
|
|
));
|
|
}
|
|
|
|
orders
|
|
}
|
|
|
|
pub fn window_index_request_bytes(&self, slot: u64, blob_index: u64) -> Result<Vec<u8>> {
|
|
let req = Protocol::RequestWindowIndex(self.my_data().clone(), slot, blob_index);
|
|
let out = serialize(&req)?;
|
|
Ok(out)
|
|
}
|
|
|
|
fn window_highest_index_request_bytes(&self, slot: u64, blob_index: u64) -> Result<Vec<u8>> {
|
|
let req = Protocol::RequestHighestWindowIndex(self.my_data().clone(), slot, blob_index);
|
|
let out = serialize(&req)?;
|
|
Ok(out)
|
|
}
|
|
|
|
fn orphan_bytes(&self, slot: u64) -> Result<Vec<u8>> {
|
|
let req = Protocol::RequestOrphan(self.my_data().clone(), slot);
|
|
let out = serialize(&req)?;
|
|
Ok(out)
|
|
}
|
|
|
|
pub fn repair_request(&self, repair_request: &RepairType) -> Result<(SocketAddr, Vec<u8>)> {
|
|
// find a peer that appears to be accepting replication, as indicated
|
|
// by a valid tvu port location
|
|
let valid: Vec<_> = self.repair_peers();
|
|
if valid.is_empty() {
|
|
Err(ClusterInfoError::NoPeers)?;
|
|
}
|
|
let n = thread_rng().gen::<usize>() % valid.len();
|
|
let addr = valid[n].gossip; // send the request to the peer's gossip port
|
|
let out = {
|
|
match repair_request {
|
|
RepairType::Blob(slot, blob_index) => {
|
|
submit(
|
|
influxdb::Point::new("cluster_info-repair")
|
|
.add_field("repair-slot", influxdb::Value::Integer(*slot as i64))
|
|
.add_field("repair-ix", influxdb::Value::Integer(*blob_index as i64))
|
|
.to_owned(),
|
|
);
|
|
self.window_index_request_bytes(*slot, *blob_index)?
|
|
}
|
|
RepairType::HighestBlob(slot, blob_index) => {
|
|
submit(
|
|
influxdb::Point::new("cluster_info-repair_highest")
|
|
.add_field(
|
|
"repair-highest-slot",
|
|
influxdb::Value::Integer(*slot as i64),
|
|
)
|
|
.add_field(
|
|
"repair-highest-ix",
|
|
influxdb::Value::Integer(*blob_index as i64),
|
|
)
|
|
.to_owned(),
|
|
);
|
|
self.window_highest_index_request_bytes(*slot, *blob_index)?
|
|
}
|
|
RepairType::Orphan(slot) => {
|
|
submit(
|
|
influxdb::Point::new("cluster_info-repair_orphan")
|
|
.add_field("repair-orphan", influxdb::Value::Integer(*slot as i64))
|
|
.to_owned(),
|
|
);
|
|
self.orphan_bytes(*slot)?
|
|
}
|
|
}
|
|
};
|
|
|
|
Ok((addr, out))
|
|
}
|
|
// If the network entrypoint hasn't been discovered yet, add it to the crds table
|
|
fn add_entrypoint(&mut self, pulls: &mut Vec<(Pubkey, Bloom<Hash>, SocketAddr, CrdsValue)>) {
|
|
match &self.entrypoint {
|
|
Some(entrypoint) => {
|
|
let self_info = self
|
|
.gossip
|
|
.crds
|
|
.lookup(&CrdsValueLabel::ContactInfo(self.id()))
|
|
.unwrap_or_else(|| panic!("self_id invalid {}", self.id()));
|
|
|
|
pulls.push((
|
|
entrypoint.id,
|
|
self.gossip.pull.build_crds_filter(&self.gossip.crds),
|
|
entrypoint.gossip,
|
|
self_info.clone(),
|
|
))
|
|
}
|
|
None => (),
|
|
}
|
|
}
|
|
|
|
fn new_pull_requests(&mut self, stakes: &HashMap<Pubkey, u64>) -> Vec<(SocketAddr, Protocol)> {
|
|
let now = timestamp();
|
|
let pulls: Vec<_> = self
|
|
.gossip
|
|
.new_pull_request(now, stakes)
|
|
.ok()
|
|
.into_iter()
|
|
.collect();
|
|
|
|
let mut pr: Vec<_> = pulls
|
|
.into_iter()
|
|
.filter_map(|(peer, filter, self_info)| {
|
|
let peer_label = CrdsValueLabel::ContactInfo(peer);
|
|
self.gossip
|
|
.crds
|
|
.lookup(&peer_label)
|
|
.and_then(CrdsValue::contact_info)
|
|
.map(|peer_info| (peer, filter, peer_info.gossip, self_info))
|
|
})
|
|
.collect();
|
|
if pr.is_empty() {
|
|
self.add_entrypoint(&mut pr);
|
|
}
|
|
pr.into_iter()
|
|
.map(|(peer, filter, gossip, self_info)| {
|
|
self.gossip.mark_pull_request_creation_time(&peer, now);
|
|
(gossip, Protocol::PullRequest(filter, self_info))
|
|
})
|
|
.collect()
|
|
}
|
|
fn new_push_requests(&mut self) -> Vec<(SocketAddr, Protocol)> {
|
|
let self_id = self.gossip.id;
|
|
let (_, peers, msgs) = self.gossip.new_push_messages(timestamp());
|
|
peers
|
|
.into_iter()
|
|
.filter_map(|p| {
|
|
let peer_label = CrdsValueLabel::ContactInfo(p);
|
|
self.gossip
|
|
.crds
|
|
.lookup(&peer_label)
|
|
.and_then(CrdsValue::contact_info)
|
|
.map(|p| p.gossip)
|
|
})
|
|
.map(|peer| (peer, Protocol::PushMessage(self_id, msgs.clone())))
|
|
.collect()
|
|
}
|
|
|
|
fn gossip_request(&mut self, stakes: &HashMap<Pubkey, u64>) -> Vec<(SocketAddr, Protocol)> {
|
|
let pulls: Vec<_> = self.new_pull_requests(stakes);
|
|
let pushes: Vec<_> = self.new_push_requests();
|
|
vec![pulls, pushes].into_iter().flat_map(|x| x).collect()
|
|
}
|
|
|
|
/// At random pick a node and try to get updated changes from them
|
|
fn run_gossip(
|
|
obj: &Arc<RwLock<Self>>,
|
|
stakes: &HashMap<Pubkey, u64>,
|
|
blob_sender: &BlobSender,
|
|
) -> Result<()> {
|
|
let reqs = obj.write().unwrap().gossip_request(&stakes);
|
|
let blobs = reqs
|
|
.into_iter()
|
|
.filter_map(|(remote_gossip_addr, req)| to_shared_blob(req, remote_gossip_addr).ok())
|
|
.collect();
|
|
blob_sender.send(blobs)?;
|
|
Ok(())
|
|
}
|
|
|
|
/// randomly pick a node and ask them for updates asynchronously
|
|
pub fn gossip(
|
|
obj: Arc<RwLock<Self>>,
|
|
bank_forks: Option<Arc<RwLock<BankForks>>>,
|
|
blob_sender: BlobSender,
|
|
exit: &Arc<AtomicBool>,
|
|
) -> JoinHandle<()> {
|
|
let exit = exit.clone();
|
|
Builder::new()
|
|
.name("solana-gossip".to_string())
|
|
.spawn(move || {
|
|
let mut last_push = timestamp();
|
|
loop {
|
|
let start = timestamp();
|
|
let stakes: HashMap<_, _> = match bank_forks {
|
|
Some(ref bank_forks) => staking_utils::delegated_stakes(
|
|
&bank_forks.read().unwrap().working_bank(),
|
|
),
|
|
None => HashMap::new(),
|
|
};
|
|
let _ = Self::run_gossip(&obj, &stakes, &blob_sender);
|
|
if exit.load(Ordering::Relaxed) {
|
|
return;
|
|
}
|
|
obj.write().unwrap().purge(timestamp());
|
|
//TODO: possibly tune this parameter
|
|
//we saw a deadlock passing an obj.read().unwrap().timeout into sleep
|
|
if start - last_push > CRDS_GOSSIP_PULL_CRDS_TIMEOUT_MS / 2 {
|
|
obj.write().unwrap().push_self(&stakes);
|
|
last_push = timestamp();
|
|
}
|
|
let elapsed = timestamp() - start;
|
|
if GOSSIP_SLEEP_MILLIS > elapsed {
|
|
let time_left = GOSSIP_SLEEP_MILLIS - elapsed;
|
|
sleep(Duration::from_millis(time_left));
|
|
}
|
|
}
|
|
})
|
|
.unwrap()
|
|
}
|
|
|
|
fn run_window_request(
|
|
from: &ContactInfo,
|
|
from_addr: &SocketAddr,
|
|
blocktree: Option<&Arc<Blocktree>>,
|
|
me: &ContactInfo,
|
|
slot: u64,
|
|
blob_index: u64,
|
|
) -> Vec<SharedBlob> {
|
|
if let Some(blocktree) = blocktree {
|
|
// Try to find the requested index in one of the slots
|
|
let blob = blocktree.get_data_blob(slot, blob_index);
|
|
|
|
if let Ok(Some(mut blob)) = blob {
|
|
inc_new_counter_info!("cluster_info-window-request-ledger", 1);
|
|
blob.meta.set_addr(from_addr);
|
|
|
|
return vec![Arc::new(RwLock::new(blob))];
|
|
}
|
|
}
|
|
|
|
inc_new_counter_info!("cluster_info-window-request-fail", 1);
|
|
trace!(
|
|
"{}: failed RequestWindowIndex {} {} {}",
|
|
me.id,
|
|
from.id,
|
|
slot,
|
|
blob_index,
|
|
);
|
|
|
|
vec![]
|
|
}
|
|
|
|
fn run_highest_window_request(
|
|
from_addr: &SocketAddr,
|
|
blocktree: Option<&Arc<Blocktree>>,
|
|
slot: u64,
|
|
highest_index: u64,
|
|
) -> Vec<SharedBlob> {
|
|
if let Some(blocktree) = blocktree {
|
|
// Try to find the requested index in one of the slots
|
|
let meta = blocktree.meta(slot);
|
|
|
|
if let Ok(Some(meta)) = meta {
|
|
if meta.received > highest_index {
|
|
// meta.received must be at least 1 by this point
|
|
let blob = blocktree.get_data_blob(slot, meta.received - 1);
|
|
|
|
if let Ok(Some(mut blob)) = blob {
|
|
blob.meta.set_addr(from_addr);
|
|
return vec![Arc::new(RwLock::new(blob))];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
vec![]
|
|
}
|
|
|
|
fn run_orphan(
|
|
from_addr: &SocketAddr,
|
|
blocktree: Option<&Arc<Blocktree>>,
|
|
mut slot: u64,
|
|
max_responses: usize,
|
|
) -> Vec<SharedBlob> {
|
|
let mut res = vec![];
|
|
if let Some(blocktree) = blocktree {
|
|
// Try to find the next "n" parent slots of the input slot
|
|
while let Ok(Some(meta)) = blocktree.meta(slot) {
|
|
if meta.received == 0 {
|
|
break;
|
|
}
|
|
let blob = blocktree.get_data_blob(slot, meta.received - 1);
|
|
if let Ok(Some(mut blob)) = blob {
|
|
blob.meta.set_addr(from_addr);
|
|
res.push(Arc::new(RwLock::new(blob)));
|
|
}
|
|
if meta.is_parent_set() && res.len() <= max_responses {
|
|
slot = meta.parent_slot;
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
res
|
|
}
|
|
|
|
//TODO we should first coalesce all the requests
|
|
fn handle_blob(
|
|
obj: &Arc<RwLock<Self>>,
|
|
blocktree: Option<&Arc<Blocktree>>,
|
|
blob: &Blob,
|
|
) -> Vec<SharedBlob> {
|
|
deserialize(&blob.data[..blob.meta.size])
|
|
.into_iter()
|
|
.flat_map(|request| {
|
|
ClusterInfo::handle_protocol(obj, &blob.meta.addr(), blocktree, request)
|
|
})
|
|
.collect()
|
|
}
|
|
|
|
fn handle_pull_request(
|
|
me: &Arc<RwLock<Self>>,
|
|
filter: Bloom<Hash>,
|
|
caller: CrdsValue,
|
|
from_addr: &SocketAddr,
|
|
) -> Vec<SharedBlob> {
|
|
let self_id = me.read().unwrap().gossip.id;
|
|
inc_new_counter_info!("cluster_info-pull_request", 1);
|
|
if caller.contact_info().is_none() {
|
|
return vec![];
|
|
}
|
|
let mut from = caller.contact_info().cloned().unwrap();
|
|
if from.id == self_id {
|
|
warn!(
|
|
"PullRequest ignored, I'm talking to myself: me={} remoteme={}",
|
|
self_id, from.id
|
|
);
|
|
inc_new_counter_info!("cluster_info-window-request-loopback", 1);
|
|
return vec![];
|
|
}
|
|
let now = timestamp();
|
|
let data = me
|
|
.write()
|
|
.unwrap()
|
|
.gossip
|
|
.process_pull_request(caller, filter, now);
|
|
let len = data.len();
|
|
trace!("get updates since response {}", len);
|
|
let rsp = Protocol::PullResponse(self_id, data);
|
|
// The remote node may not know its public IP:PORT. Record what it looks like to us.
|
|
// This may or may not be correct for everybody, but it's better than leaving the remote with
|
|
// an unspecified address in our table
|
|
if from.gossip.ip().is_unspecified() {
|
|
inc_new_counter_info!("cluster_info-window-request-updates-unspec-gossip", 1);
|
|
from.gossip = *from_addr;
|
|
}
|
|
inc_new_counter_info!("cluster_info-pull_request-rsp", len);
|
|
to_shared_blob(rsp, from.gossip).ok().into_iter().collect()
|
|
}
|
|
fn handle_pull_response(me: &Arc<RwLock<Self>>, from: &Pubkey, data: Vec<CrdsValue>) {
|
|
let len = data.len();
|
|
let now = Instant::now();
|
|
let self_id = me.read().unwrap().gossip.id;
|
|
trace!("PullResponse me: {} from: {} len={}", self_id, from, len);
|
|
me.write()
|
|
.unwrap()
|
|
.gossip
|
|
.process_pull_response(from, data, timestamp());
|
|
inc_new_counter_info!("cluster_info-pull_request_response", 1);
|
|
inc_new_counter_info!("cluster_info-pull_request_response-size", len);
|
|
|
|
report_time_spent("ReceiveUpdates", &now.elapsed(), &format!(" len: {}", len));
|
|
}
|
|
fn handle_push_message(
|
|
me: &Arc<RwLock<Self>>,
|
|
from: &Pubkey,
|
|
data: &[CrdsValue],
|
|
) -> Vec<SharedBlob> {
|
|
let self_id = me.read().unwrap().gossip.id;
|
|
inc_new_counter_info!("cluster_info-push_message", 1);
|
|
let prunes: Vec<_> = me
|
|
.write()
|
|
.unwrap()
|
|
.gossip
|
|
.process_push_message(&data, timestamp());
|
|
if !prunes.is_empty() {
|
|
inc_new_counter_info!("cluster_info-push_message-prunes", prunes.len());
|
|
let ci = me.read().unwrap().lookup(from).cloned();
|
|
let pushes: Vec<_> = me.write().unwrap().new_push_requests();
|
|
inc_new_counter_info!("cluster_info-push_message-pushes", pushes.len());
|
|
let mut rsp: Vec<_> = ci
|
|
.and_then(|ci| {
|
|
let mut prune_msg = PruneData {
|
|
pubkey: self_id,
|
|
prunes,
|
|
signature: Signature::default(),
|
|
destination: *from,
|
|
wallclock: timestamp(),
|
|
};
|
|
prune_msg.sign(&me.read().unwrap().keypair);
|
|
let rsp = Protocol::PruneMessage(self_id, prune_msg);
|
|
to_shared_blob(rsp, ci.gossip).ok()
|
|
})
|
|
.into_iter()
|
|
.collect();
|
|
let mut blobs: Vec<_> = pushes
|
|
.into_iter()
|
|
.filter_map(|(remote_gossip_addr, req)| {
|
|
to_shared_blob(req, remote_gossip_addr).ok()
|
|
})
|
|
.collect();
|
|
rsp.append(&mut blobs);
|
|
rsp
|
|
} else {
|
|
vec![]
|
|
}
|
|
}
|
|
|
|
fn get_repair_sender(request: &Protocol) -> &ContactInfo {
|
|
match request {
|
|
Protocol::RequestWindowIndex(ref from, _, _) => from,
|
|
Protocol::RequestHighestWindowIndex(ref from, _, _) => from,
|
|
Protocol::RequestOrphan(ref from, _) => from,
|
|
_ => panic!("Not a repair request"),
|
|
}
|
|
}
|
|
|
|
fn handle_repair(
|
|
me: &Arc<RwLock<Self>>,
|
|
from_addr: &SocketAddr,
|
|
blocktree: Option<&Arc<Blocktree>>,
|
|
request: Protocol,
|
|
) -> Vec<SharedBlob> {
|
|
let now = Instant::now();
|
|
|
|
//TODO this doesn't depend on cluster_info module, could be moved
|
|
//but we are using the listen thread to service these request
|
|
//TODO verify from is signed
|
|
|
|
let self_id = me.read().unwrap().gossip.id;
|
|
let from = Self::get_repair_sender(&request);
|
|
if from.id == me.read().unwrap().gossip.id {
|
|
warn!(
|
|
"{}: Ignored received repair request from ME {}",
|
|
self_id, from.id,
|
|
);
|
|
inc_new_counter_info!("cluster_info-handle-repair--eq", 1);
|
|
return vec![];
|
|
}
|
|
|
|
me.write()
|
|
.unwrap()
|
|
.gossip
|
|
.crds
|
|
.update_record_timestamp(&from.id, timestamp());
|
|
let my_info = me.read().unwrap().my_data().clone();
|
|
|
|
let (res, label) = {
|
|
match &request {
|
|
Protocol::RequestWindowIndex(from, slot, blob_index) => {
|
|
inc_new_counter_info!("cluster_info-request-window-index", 1);
|
|
(
|
|
Self::run_window_request(
|
|
from,
|
|
&from_addr,
|
|
blocktree,
|
|
&my_info,
|
|
*slot,
|
|
*blob_index,
|
|
),
|
|
"RequestWindowIndex",
|
|
)
|
|
}
|
|
|
|
Protocol::RequestHighestWindowIndex(_, slot, highest_index) => {
|
|
inc_new_counter_info!("cluster_info-request-highest-window-index", 1);
|
|
(
|
|
Self::run_highest_window_request(
|
|
&from_addr,
|
|
blocktree,
|
|
*slot,
|
|
*highest_index,
|
|
),
|
|
"RequestHighestWindowIndex",
|
|
)
|
|
}
|
|
Protocol::RequestOrphan(_, slot) => {
|
|
inc_new_counter_info!("cluster_info-request-orphan", 1);
|
|
(
|
|
Self::run_orphan(&from_addr, blocktree, *slot, MAX_ORPHAN_REPAIR_RESPONSES),
|
|
"RequestOrphan",
|
|
)
|
|
}
|
|
_ => panic!("Not a repair request"),
|
|
}
|
|
};
|
|
|
|
trace!("{}: received repair request: {:?}", self_id, request);
|
|
report_time_spent(label, &now.elapsed(), "");
|
|
res
|
|
}
|
|
|
|
fn handle_protocol(
|
|
me: &Arc<RwLock<Self>>,
|
|
from_addr: &SocketAddr,
|
|
blocktree: Option<&Arc<Blocktree>>,
|
|
request: Protocol,
|
|
) -> Vec<SharedBlob> {
|
|
match request {
|
|
// TODO verify messages faster
|
|
Protocol::PullRequest(filter, caller) => {
|
|
if !caller.verify() {
|
|
inc_new_counter_info!("cluster_info-gossip_pull_request_verify_fail", 1);
|
|
vec![]
|
|
} else {
|
|
Self::handle_pull_request(me, filter, caller, from_addr)
|
|
}
|
|
}
|
|
Protocol::PullResponse(from, mut data) => {
|
|
data.retain(|v| {
|
|
let ret = v.verify();
|
|
if !ret {
|
|
inc_new_counter_info!("cluster_info-gossip_pull_response_verify_fail", 1);
|
|
}
|
|
ret
|
|
});
|
|
Self::handle_pull_response(me, &from, data);
|
|
vec![]
|
|
}
|
|
Protocol::PushMessage(from, mut data) => {
|
|
data.retain(|v| {
|
|
let ret = v.verify();
|
|
if !ret {
|
|
inc_new_counter_info!("cluster_info-gossip_push_msg_verify_fail", 1);
|
|
}
|
|
ret
|
|
});
|
|
Self::handle_push_message(me, &from, &data)
|
|
}
|
|
Protocol::PruneMessage(from, data) => {
|
|
if data.verify() {
|
|
inc_new_counter_info!("cluster_info-prune_message", 1);
|
|
inc_new_counter_info!("cluster_info-prune_message-size", data.prunes.len());
|
|
match me.write().unwrap().gossip.process_prune_msg(
|
|
&from,
|
|
&data.destination,
|
|
&data.prunes,
|
|
data.wallclock,
|
|
timestamp(),
|
|
) {
|
|
Err(CrdsGossipError::PruneMessageTimeout) => {
|
|
inc_new_counter_info!("cluster_info-prune_message_timeout", 1)
|
|
}
|
|
Err(CrdsGossipError::BadPruneDestination) => {
|
|
inc_new_counter_info!("cluster_info-bad_prune_destination", 1)
|
|
}
|
|
Err(_) => (),
|
|
Ok(_) => (),
|
|
}
|
|
} else {
|
|
inc_new_counter_info!("cluster_info-gossip_prune_msg_verify_fail", 1);
|
|
}
|
|
vec![]
|
|
}
|
|
_ => Self::handle_repair(me, from_addr, blocktree, request),
|
|
}
|
|
}
|
|
|
|
/// Process messages from the network
|
|
fn run_listen(
|
|
obj: &Arc<RwLock<Self>>,
|
|
blocktree: Option<&Arc<Blocktree>>,
|
|
requests_receiver: &BlobReceiver,
|
|
response_sender: &BlobSender,
|
|
) -> Result<()> {
|
|
//TODO cache connections
|
|
let timeout = Duration::new(1, 0);
|
|
let mut reqs = requests_receiver.recv_timeout(timeout)?;
|
|
while let Ok(mut more) = requests_receiver.try_recv() {
|
|
reqs.append(&mut more);
|
|
}
|
|
let mut resps = Vec::new();
|
|
for req in reqs {
|
|
let mut resp = Self::handle_blob(obj, blocktree, &req.read().unwrap());
|
|
resps.append(&mut resp);
|
|
}
|
|
response_sender.send(resps)?;
|
|
Ok(())
|
|
}
|
|
pub fn listen(
|
|
me: Arc<RwLock<Self>>,
|
|
blocktree: Option<Arc<Blocktree>>,
|
|
requests_receiver: BlobReceiver,
|
|
response_sender: BlobSender,
|
|
exit: &Arc<AtomicBool>,
|
|
) -> JoinHandle<()> {
|
|
let exit = exit.clone();
|
|
Builder::new()
|
|
.name("solana-listen".to_string())
|
|
.spawn(move || loop {
|
|
let e = Self::run_listen(
|
|
&me,
|
|
blocktree.as_ref(),
|
|
&requests_receiver,
|
|
&response_sender,
|
|
);
|
|
if exit.load(Ordering::Relaxed) {
|
|
return;
|
|
}
|
|
if e.is_err() {
|
|
let me = me.read().unwrap();
|
|
debug!(
|
|
"{}: run_listen timeout, table size: {}",
|
|
me.gossip.id,
|
|
me.gossip.crds.table.len()
|
|
);
|
|
}
|
|
})
|
|
.unwrap()
|
|
}
|
|
|
|
pub fn spy_node(id: &Pubkey) -> (ContactInfo, UdpSocket) {
|
|
let (_, gossip_socket) = bind_in_range(FULLNODE_PORT_RANGE).unwrap();
|
|
let daddr = socketaddr_any!();
|
|
|
|
let node = ContactInfo::new(
|
|
id,
|
|
daddr,
|
|
daddr,
|
|
daddr,
|
|
daddr,
|
|
daddr,
|
|
daddr,
|
|
daddr,
|
|
timestamp(),
|
|
);
|
|
(node, gossip_socket)
|
|
}
|
|
}
|
|
|
|
/// Avalanche logic
|
|
/// 1 - For the current node find out if it is in layer 1
|
|
/// 1.1 - If yes, then broadcast to all layer 1 nodes
|
|
/// 1 - using the layer 1 index, broadcast to all layer 2 nodes assuming you know neighborhood size
|
|
/// 1.2 - If no, then figure out what layer the node is in and who the neighbors are and only broadcast to them
|
|
/// 1 - also check if there are nodes in lower layers and repeat the layer 1 to layer 2 logic
|
|
|
|
/// Returns Neighbor Nodes and Children Nodes `(neighbors, children)` for a given node based on its stake (Bank Balance)
|
|
pub fn compute_retransmit_peers<S: std::hash::BuildHasher>(
|
|
stakes: &HashMap<Pubkey, u64, S>,
|
|
cluster_info: &Arc<RwLock<ClusterInfo>>,
|
|
fanout: usize,
|
|
hood_size: usize,
|
|
grow: bool,
|
|
) -> (Vec<ContactInfo>, Vec<ContactInfo>) {
|
|
let (my_index, peers) = cluster_info.read().unwrap().sorted_peers_and_index(stakes);
|
|
//calc num_layers and num_neighborhoods using the total number of nodes
|
|
let (num_layers, layer_indices) =
|
|
ClusterInfo::describe_data_plane(peers.len(), fanout, hood_size, grow);
|
|
|
|
if num_layers <= 1 {
|
|
/* single layer data plane */
|
|
(peers, vec![])
|
|
} else {
|
|
//find my layer
|
|
let locality = ClusterInfo::localize(&layer_indices, hood_size, my_index);
|
|
let upper_bound = cmp::min(locality.neighbor_bounds.1, peers.len());
|
|
let neighbors = peers[locality.neighbor_bounds.0..upper_bound].to_vec();
|
|
let mut children = Vec::new();
|
|
for ix in locality.child_layer_peers {
|
|
if let Some(peer) = peers.get(ix) {
|
|
children.push(peer.clone());
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
(neighbors, children)
|
|
}
|
|
}
|
|
|
|
#[derive(Debug)]
|
|
pub struct Sockets {
|
|
pub gossip: UdpSocket,
|
|
pub tvu: Vec<UdpSocket>,
|
|
pub tpu: Vec<UdpSocket>,
|
|
pub tpu_via_blobs: Vec<UdpSocket>,
|
|
pub broadcast: UdpSocket,
|
|
pub repair: UdpSocket,
|
|
pub retransmit: UdpSocket,
|
|
pub storage: Option<UdpSocket>,
|
|
}
|
|
|
|
#[derive(Debug)]
|
|
pub struct Node {
|
|
pub info: ContactInfo,
|
|
pub sockets: Sockets,
|
|
}
|
|
|
|
impl Node {
|
|
pub fn new_localhost() -> Self {
|
|
let pubkey = Pubkey::new_rand();
|
|
Self::new_localhost_with_pubkey(&pubkey)
|
|
}
|
|
pub fn new_localhost_replicator(pubkey: &Pubkey) -> Self {
|
|
let gossip = UdpSocket::bind("127.0.0.1:0").unwrap();
|
|
let tvu = UdpSocket::bind("127.0.0.1:0").unwrap();
|
|
let storage = UdpSocket::bind("127.0.0.1:0").unwrap();
|
|
let empty = "0.0.0.0:0".parse().unwrap();
|
|
let repair = UdpSocket::bind("127.0.0.1:0").unwrap();
|
|
|
|
let broadcast = UdpSocket::bind("0.0.0.0:0").unwrap();
|
|
let retransmit = UdpSocket::bind("0.0.0.0:0").unwrap();
|
|
let info = ContactInfo::new(
|
|
pubkey,
|
|
gossip.local_addr().unwrap(),
|
|
tvu.local_addr().unwrap(),
|
|
empty,
|
|
empty,
|
|
storage.local_addr().unwrap(),
|
|
empty,
|
|
empty,
|
|
timestamp(),
|
|
);
|
|
|
|
Node {
|
|
info,
|
|
sockets: Sockets {
|
|
gossip,
|
|
tvu: vec![tvu],
|
|
tpu: vec![],
|
|
tpu_via_blobs: vec![],
|
|
broadcast,
|
|
repair,
|
|
retransmit,
|
|
storage: Some(storage),
|
|
},
|
|
}
|
|
}
|
|
pub fn new_localhost_with_pubkey(pubkey: &Pubkey) -> Self {
|
|
let tpu = UdpSocket::bind("127.0.0.1:0").unwrap();
|
|
let gossip = UdpSocket::bind("127.0.0.1:0").unwrap();
|
|
let tvu = UdpSocket::bind("127.0.0.1:0").unwrap();
|
|
let tpu_via_blobs = UdpSocket::bind("127.0.0.1:0").unwrap();
|
|
let repair = UdpSocket::bind("127.0.0.1:0").unwrap();
|
|
let rpc_port = find_available_port_in_range((1024, 65535)).unwrap();
|
|
let rpc_addr = SocketAddr::new(IpAddr::V4(Ipv4Addr::new(127, 0, 0, 1)), rpc_port);
|
|
let rpc_pubsub_port = find_available_port_in_range((1024, 65535)).unwrap();
|
|
let rpc_pubsub_addr =
|
|
SocketAddr::new(IpAddr::V4(Ipv4Addr::new(127, 0, 0, 1)), rpc_pubsub_port);
|
|
|
|
let broadcast = UdpSocket::bind("0.0.0.0:0").unwrap();
|
|
let retransmit = UdpSocket::bind("0.0.0.0:0").unwrap();
|
|
let storage = UdpSocket::bind("0.0.0.0:0").unwrap();
|
|
let info = ContactInfo::new(
|
|
pubkey,
|
|
gossip.local_addr().unwrap(),
|
|
tvu.local_addr().unwrap(),
|
|
tpu.local_addr().unwrap(),
|
|
tpu_via_blobs.local_addr().unwrap(),
|
|
storage.local_addr().unwrap(),
|
|
rpc_addr,
|
|
rpc_pubsub_addr,
|
|
timestamp(),
|
|
);
|
|
Node {
|
|
info,
|
|
sockets: Sockets {
|
|
gossip,
|
|
tvu: vec![tvu],
|
|
tpu: vec![tpu],
|
|
tpu_via_blobs: vec![tpu_via_blobs],
|
|
broadcast,
|
|
repair,
|
|
retransmit,
|
|
storage: None,
|
|
},
|
|
}
|
|
}
|
|
fn get_gossip_port(gossip_addr: &SocketAddr, port_range: PortRange) -> (u16, UdpSocket) {
|
|
if gossip_addr.port() != 0 {
|
|
(
|
|
gossip_addr.port(),
|
|
bind_to(gossip_addr.port(), false).unwrap_or_else(|e| {
|
|
panic!("gossip_addr bind_to port {}: {}", gossip_addr.port(), e)
|
|
}),
|
|
)
|
|
} else {
|
|
Self::bind(port_range)
|
|
}
|
|
}
|
|
fn bind(port_range: PortRange) -> (u16, UdpSocket) {
|
|
bind_in_range(port_range).expect("Failed to bind")
|
|
}
|
|
pub fn new_with_external_ip(
|
|
pubkey: &Pubkey,
|
|
gossip_addr: &SocketAddr,
|
|
port_range: PortRange,
|
|
) -> Node {
|
|
let (gossip_port, gossip) = Self::get_gossip_port(gossip_addr, port_range);
|
|
|
|
let (tvu_port, tvu_sockets) = multi_bind_in_range(port_range, 8).expect("tvu multi_bind");
|
|
|
|
let (tpu_port, tpu_sockets) = multi_bind_in_range(port_range, 32).expect("tpu multi_bind");
|
|
|
|
let (tpu_via_blobs_port, tpu_via_blobs_sockets) =
|
|
multi_bind_in_range(port_range, 8).expect("tpu multi_bind");
|
|
|
|
let (_, repair) = Self::bind(port_range);
|
|
let (_, broadcast) = Self::bind(port_range);
|
|
let (_, retransmit) = Self::bind(port_range);
|
|
|
|
let info = ContactInfo::new(
|
|
pubkey,
|
|
SocketAddr::new(gossip_addr.ip(), gossip_port),
|
|
SocketAddr::new(gossip_addr.ip(), tvu_port),
|
|
SocketAddr::new(gossip_addr.ip(), tpu_port),
|
|
SocketAddr::new(gossip_addr.ip(), tpu_via_blobs_port),
|
|
socketaddr_any!(),
|
|
socketaddr_any!(),
|
|
socketaddr_any!(),
|
|
0,
|
|
);
|
|
trace!("new ContactInfo: {:?}", info);
|
|
|
|
Node {
|
|
info,
|
|
sockets: Sockets {
|
|
gossip,
|
|
tvu: tvu_sockets,
|
|
tpu: tpu_sockets,
|
|
tpu_via_blobs: tpu_via_blobs_sockets,
|
|
broadcast,
|
|
repair,
|
|
retransmit,
|
|
storage: None,
|
|
},
|
|
}
|
|
}
|
|
pub fn new_replicator_with_external_ip(
|
|
pubkey: &Pubkey,
|
|
gossip_addr: &SocketAddr,
|
|
port_range: PortRange,
|
|
) -> Node {
|
|
let mut new = Self::new_with_external_ip(pubkey, gossip_addr, port_range);
|
|
let (storage_port, storage_socket) = Self::bind(port_range);
|
|
|
|
new.info.storage_addr = SocketAddr::new(gossip_addr.ip(), storage_port);
|
|
new.sockets.storage = Some(storage_socket);
|
|
|
|
let empty = socketaddr_any!();
|
|
new.info.tpu = empty;
|
|
new.info.tpu_via_blobs = empty;
|
|
new.sockets.tpu = vec![];
|
|
new.sockets.tpu_via_blobs = vec![];
|
|
|
|
new
|
|
}
|
|
}
|
|
|
|
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);
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use super::*;
|
|
use crate::blocktree::get_tmp_ledger_path;
|
|
use crate::blocktree::tests::make_many_slot_entries;
|
|
use crate::blocktree::Blocktree;
|
|
use crate::crds_value::CrdsValueLabel;
|
|
use crate::packet::BLOB_HEADER_SIZE;
|
|
use crate::repair_service::RepairType;
|
|
use crate::result::Error;
|
|
use crate::test_tx::test_tx;
|
|
use solana_sdk::signature::{Keypair, KeypairUtil};
|
|
use std::collections::HashSet;
|
|
use std::net::{IpAddr, Ipv4Addr};
|
|
use std::sync::{Arc, RwLock};
|
|
|
|
#[test]
|
|
fn test_cluster_spy_gossip() {
|
|
//check that gossip doesn't try to push to invalid addresses
|
|
let node = Node::new_localhost();
|
|
let (spy, _) = ClusterInfo::spy_node(&Pubkey::new_rand());
|
|
let cluster_info = Arc::new(RwLock::new(ClusterInfo::new_with_invalid_keypair(
|
|
node.info,
|
|
)));
|
|
cluster_info.write().unwrap().insert_info(spy);
|
|
cluster_info
|
|
.write()
|
|
.unwrap()
|
|
.gossip
|
|
.refresh_push_active_set(&HashMap::new());
|
|
let reqs = cluster_info
|
|
.write()
|
|
.unwrap()
|
|
.gossip_request(&HashMap::new());
|
|
//assert none of the addrs are invalid.
|
|
reqs.iter().all(|(addr, _)| {
|
|
let res = ContactInfo::is_valid_address(addr);
|
|
assert!(res);
|
|
res
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn test_cluster_info_new() {
|
|
let d = ContactInfo::new_localhost(&Pubkey::new_rand(), timestamp());
|
|
let cluster_info = ClusterInfo::new_with_invalid_keypair(d.clone());
|
|
assert_eq!(d.id, cluster_info.my_data().id);
|
|
}
|
|
|
|
#[test]
|
|
fn insert_info_test() {
|
|
let d = ContactInfo::new_localhost(&Pubkey::new_rand(), timestamp());
|
|
let mut cluster_info = ClusterInfo::new_with_invalid_keypair(d);
|
|
let d = ContactInfo::new_localhost(&Pubkey::new_rand(), timestamp());
|
|
let label = CrdsValueLabel::ContactInfo(d.id);
|
|
cluster_info.insert_info(d);
|
|
assert!(cluster_info.gossip.crds.lookup(&label).is_some());
|
|
}
|
|
#[test]
|
|
fn test_insert_self() {
|
|
let d = ContactInfo::new_localhost(&Pubkey::new_rand(), timestamp());
|
|
let mut cluster_info = ClusterInfo::new_with_invalid_keypair(d.clone());
|
|
let entry_label = CrdsValueLabel::ContactInfo(cluster_info.id());
|
|
assert!(cluster_info.gossip.crds.lookup(&entry_label).is_some());
|
|
|
|
// inserting something else shouldn't work
|
|
let d = ContactInfo::new_localhost(&Pubkey::new_rand(), timestamp());
|
|
cluster_info.insert_self(d.clone());
|
|
let label = CrdsValueLabel::ContactInfo(d.id);
|
|
assert!(cluster_info.gossip.crds.lookup(&label).is_none());
|
|
}
|
|
#[test]
|
|
fn window_index_request() {
|
|
let me = ContactInfo::new_localhost(&Pubkey::new_rand(), timestamp());
|
|
let mut cluster_info = ClusterInfo::new_with_invalid_keypair(me);
|
|
let rv = cluster_info.repair_request(&RepairType::Blob(0, 0));
|
|
assert_matches!(rv, Err(Error::ClusterInfoError(ClusterInfoError::NoPeers)));
|
|
|
|
let gossip_addr = socketaddr!([127, 0, 0, 1], 1234);
|
|
let nxt = ContactInfo::new(
|
|
&Pubkey::new_rand(),
|
|
gossip_addr,
|
|
socketaddr!([127, 0, 0, 1], 1235),
|
|
socketaddr!([127, 0, 0, 1], 1236),
|
|
socketaddr!([127, 0, 0, 1], 1237),
|
|
socketaddr!([127, 0, 0, 1], 1238),
|
|
socketaddr!([127, 0, 0, 1], 1239),
|
|
socketaddr!([127, 0, 0, 1], 1240),
|
|
0,
|
|
);
|
|
cluster_info.insert_info(nxt.clone());
|
|
let rv = cluster_info
|
|
.repair_request(&RepairType::Blob(0, 0))
|
|
.unwrap();
|
|
assert_eq!(nxt.gossip, gossip_addr);
|
|
assert_eq!(rv.0, nxt.gossip);
|
|
|
|
let gossip_addr2 = socketaddr!([127, 0, 0, 2], 1234);
|
|
let nxt = ContactInfo::new(
|
|
&Pubkey::new_rand(),
|
|
gossip_addr2,
|
|
socketaddr!([127, 0, 0, 1], 1235),
|
|
socketaddr!([127, 0, 0, 1], 1236),
|
|
socketaddr!([127, 0, 0, 1], 1237),
|
|
socketaddr!([127, 0, 0, 1], 1238),
|
|
socketaddr!([127, 0, 0, 1], 1239),
|
|
socketaddr!([127, 0, 0, 1], 1240),
|
|
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 = cluster_info
|
|
.repair_request(&RepairType::Blob(0, 0))
|
|
.unwrap();
|
|
if rv.0 == gossip_addr {
|
|
one = true;
|
|
}
|
|
if rv.0 == gossip_addr2 {
|
|
two = true;
|
|
}
|
|
}
|
|
assert!(one && two);
|
|
}
|
|
|
|
/// test window requests respond with the right blob, and do not overrun
|
|
#[test]
|
|
fn run_window_request() {
|
|
solana_logger::setup();
|
|
let ledger_path = get_tmp_ledger_path!();
|
|
{
|
|
let blocktree = Arc::new(Blocktree::open(&ledger_path).unwrap());
|
|
let me = ContactInfo::new(
|
|
&Pubkey::new_rand(),
|
|
socketaddr!("127.0.0.1:1234"),
|
|
socketaddr!("127.0.0.1:1235"),
|
|
socketaddr!("127.0.0.1:1236"),
|
|
socketaddr!("127.0.0.1:1237"),
|
|
socketaddr!("127.0.0.1:1238"),
|
|
socketaddr!("127.0.0.1:1239"),
|
|
socketaddr!("127.0.0.1:1240"),
|
|
0,
|
|
);
|
|
let rv = ClusterInfo::run_window_request(
|
|
&me,
|
|
&socketaddr_any!(),
|
|
Some(&blocktree),
|
|
&me,
|
|
0,
|
|
0,
|
|
);
|
|
assert!(rv.is_empty());
|
|
let data_size = 1;
|
|
let blob = SharedBlob::default();
|
|
{
|
|
let mut w_blob = blob.write().unwrap();
|
|
w_blob.set_size(data_size);
|
|
w_blob.set_index(1);
|
|
w_blob.set_slot(2);
|
|
w_blob.meta.size = data_size + BLOB_HEADER_SIZE;
|
|
}
|
|
|
|
blocktree
|
|
.write_shared_blobs(vec![&blob])
|
|
.expect("Expect successful ledger write");
|
|
|
|
let rv = ClusterInfo::run_window_request(
|
|
&me,
|
|
&socketaddr_any!(),
|
|
Some(&blocktree),
|
|
&me,
|
|
2,
|
|
1,
|
|
);
|
|
assert!(!rv.is_empty());
|
|
let v = rv[0].clone();
|
|
assert_eq!(v.read().unwrap().index(), 1);
|
|
assert_eq!(v.read().unwrap().slot(), 2);
|
|
assert_eq!(v.read().unwrap().meta.size, BLOB_HEADER_SIZE + data_size);
|
|
}
|
|
|
|
Blocktree::destroy(&ledger_path).expect("Expected successful database destruction");
|
|
}
|
|
|
|
/// test run_window_requestwindow requests respond with the right blob, and do not overrun
|
|
#[test]
|
|
fn run_highest_window_request() {
|
|
solana_logger::setup();
|
|
let ledger_path = get_tmp_ledger_path!();
|
|
{
|
|
let blocktree = Arc::new(Blocktree::open(&ledger_path).unwrap());
|
|
let rv =
|
|
ClusterInfo::run_highest_window_request(&socketaddr_any!(), Some(&blocktree), 0, 0);
|
|
assert!(rv.is_empty());
|
|
|
|
let data_size = 1;
|
|
let max_index = 5;
|
|
let blobs: Vec<_> = (0..max_index)
|
|
.map(|i| {
|
|
let mut blob = Blob::default();
|
|
blob.set_size(data_size);
|
|
blob.set_index(i);
|
|
blob.set_slot(2);
|
|
blob.meta.size = data_size + BLOB_HEADER_SIZE;
|
|
blob
|
|
})
|
|
.collect();
|
|
|
|
blocktree
|
|
.write_blobs(&blobs)
|
|
.expect("Expect successful ledger write");
|
|
|
|
let rv =
|
|
ClusterInfo::run_highest_window_request(&socketaddr_any!(), Some(&blocktree), 2, 1);
|
|
assert!(!rv.is_empty());
|
|
let v = rv[0].clone();
|
|
assert_eq!(v.read().unwrap().index(), max_index - 1);
|
|
assert_eq!(v.read().unwrap().slot(), 2);
|
|
assert_eq!(v.read().unwrap().meta.size, BLOB_HEADER_SIZE + data_size);
|
|
|
|
let rv = ClusterInfo::run_highest_window_request(
|
|
&socketaddr_any!(),
|
|
Some(&blocktree),
|
|
2,
|
|
max_index,
|
|
);
|
|
assert!(rv.is_empty());
|
|
}
|
|
|
|
Blocktree::destroy(&ledger_path).expect("Expected successful database destruction");
|
|
}
|
|
|
|
#[test]
|
|
fn run_orphan() {
|
|
solana_logger::setup();
|
|
let ledger_path = get_tmp_ledger_path!();
|
|
{
|
|
let blocktree = Arc::new(Blocktree::open(&ledger_path).unwrap());
|
|
let rv = ClusterInfo::run_orphan(&socketaddr_any!(), Some(&blocktree), 2, 0);
|
|
assert!(rv.is_empty());
|
|
|
|
// Create slots 1, 2, 3 with 5 blobs apiece
|
|
let (blobs, _) = make_many_slot_entries(1, 3, 5);
|
|
|
|
blocktree
|
|
.write_blobs(&blobs)
|
|
.expect("Expect successful ledger write");
|
|
|
|
// We don't have slot 4, so we don't know how to service this requeset
|
|
let rv = ClusterInfo::run_orphan(&socketaddr_any!(), Some(&blocktree), 4, 5);
|
|
assert!(rv.is_empty());
|
|
|
|
// For slot 3, we should return the highest blobs from slots 3, 2, 1 respectively
|
|
// for this request
|
|
let rv: Vec<_> = ClusterInfo::run_orphan(&socketaddr_any!(), Some(&blocktree), 3, 5)
|
|
.iter()
|
|
.map(|b| b.read().unwrap().clone())
|
|
.collect();
|
|
let expected: Vec<_> = (1..=3)
|
|
.rev()
|
|
.map(|slot| blocktree.get_data_blob(slot, 4).unwrap().unwrap())
|
|
.collect();
|
|
assert_eq!(rv, expected)
|
|
}
|
|
|
|
Blocktree::destroy(&ledger_path).expect("Expected successful database destruction");
|
|
}
|
|
|
|
#[test]
|
|
fn test_default_leader() {
|
|
solana_logger::setup();
|
|
let contact_info = ContactInfo::new_localhost(&Pubkey::new_rand(), 0);
|
|
let mut cluster_info = ClusterInfo::new_with_invalid_keypair(contact_info);
|
|
let network_entry_point =
|
|
ContactInfo::new_gossip_entry_point(&socketaddr!("127.0.0.1:1239"));
|
|
cluster_info.insert_info(network_entry_point);
|
|
assert!(cluster_info.leader_data().is_none());
|
|
}
|
|
|
|
fn assert_in_range(x: u16, range: (u16, u16)) {
|
|
assert!(x >= range.0);
|
|
assert!(x < range.1);
|
|
}
|
|
|
|
fn check_sockets(sockets: &Vec<UdpSocket>, ip: IpAddr, range: (u16, u16)) {
|
|
assert!(sockets.len() > 1);
|
|
let port = sockets[0].local_addr().unwrap().port();
|
|
for socket in sockets.iter() {
|
|
check_socket(socket, ip, range);
|
|
assert_eq!(socket.local_addr().unwrap().port(), port);
|
|
}
|
|
}
|
|
|
|
fn check_socket(socket: &UdpSocket, ip: IpAddr, range: (u16, u16)) {
|
|
let local_addr = socket.local_addr().unwrap();
|
|
assert_eq!(local_addr.ip(), ip);
|
|
assert_in_range(local_addr.port(), range);
|
|
}
|
|
|
|
fn check_node_sockets(node: &Node, ip: IpAddr, range: (u16, u16)) {
|
|
check_socket(&node.sockets.gossip, ip, range);
|
|
check_socket(&node.sockets.repair, ip, range);
|
|
|
|
check_sockets(&node.sockets.tvu, ip, range);
|
|
check_sockets(&node.sockets.tpu, ip, range);
|
|
}
|
|
|
|
#[test]
|
|
fn new_with_external_ip_test_random() {
|
|
let ip = Ipv4Addr::from(0);
|
|
let node = Node::new_with_external_ip(
|
|
&Pubkey::new_rand(),
|
|
&socketaddr!(ip, 0),
|
|
FULLNODE_PORT_RANGE,
|
|
);
|
|
|
|
check_node_sockets(&node, IpAddr::V4(ip), FULLNODE_PORT_RANGE);
|
|
}
|
|
|
|
#[test]
|
|
fn new_with_external_ip_test_gossip() {
|
|
let ip = IpAddr::V4(Ipv4Addr::from(0));
|
|
let port = {
|
|
bind_in_range(FULLNODE_PORT_RANGE)
|
|
.expect("Failed to bind")
|
|
.0
|
|
};
|
|
let node = Node::new_with_external_ip(
|
|
&Pubkey::new_rand(),
|
|
&socketaddr!(0, port),
|
|
FULLNODE_PORT_RANGE,
|
|
);
|
|
|
|
check_node_sockets(&node, ip, FULLNODE_PORT_RANGE);
|
|
|
|
assert_eq!(node.sockets.gossip.local_addr().unwrap().port(), port);
|
|
}
|
|
|
|
#[test]
|
|
fn new_replicator_external_ip_test() {
|
|
let ip = Ipv4Addr::from(0);
|
|
let node = Node::new_replicator_with_external_ip(
|
|
&Pubkey::new_rand(),
|
|
&socketaddr!(ip, 0),
|
|
FULLNODE_PORT_RANGE,
|
|
);
|
|
|
|
let ip = IpAddr::V4(ip);
|
|
check_socket(&node.sockets.storage.unwrap(), ip, FULLNODE_PORT_RANGE);
|
|
check_socket(&node.sockets.gossip, ip, FULLNODE_PORT_RANGE);
|
|
check_socket(&node.sockets.repair, ip, FULLNODE_PORT_RANGE);
|
|
|
|
check_sockets(&node.sockets.tvu, ip, FULLNODE_PORT_RANGE);
|
|
}
|
|
|
|
//test that all cluster_info objects only generate signed messages
|
|
//when constructed with keypairs
|
|
#[test]
|
|
fn test_gossip_signature_verification() {
|
|
//create new cluster info, leader, and peer
|
|
let keypair = Keypair::new();
|
|
let peer_keypair = Keypair::new();
|
|
let leader_keypair = Keypair::new();
|
|
let contact_info = ContactInfo::new_localhost(&keypair.pubkey(), 0);
|
|
let leader = ContactInfo::new_localhost(&leader_keypair.pubkey(), 0);
|
|
let peer = ContactInfo::new_localhost(&peer_keypair.pubkey(), 0);
|
|
let mut cluster_info = ClusterInfo::new(contact_info.clone(), Arc::new(keypair));
|
|
cluster_info.set_leader(&leader.id);
|
|
cluster_info.insert_info(peer.clone());
|
|
//check that all types of gossip messages are signed correctly
|
|
let (_, _, vals) = cluster_info.gossip.new_push_messages(timestamp());
|
|
// there should be some pushes ready
|
|
assert!(vals.len() > 0);
|
|
vals.par_iter().for_each(|v| assert!(v.verify()));
|
|
|
|
let (_, _, val) = cluster_info
|
|
.gossip
|
|
.new_pull_request(timestamp(), &HashMap::new())
|
|
.ok()
|
|
.unwrap();
|
|
assert!(val.verify());
|
|
}
|
|
|
|
fn num_layers(nodes: usize, fanout: usize, hood_size: usize, grow: bool) -> usize {
|
|
ClusterInfo::describe_data_plane(nodes, fanout, hood_size, grow).0
|
|
}
|
|
|
|
#[test]
|
|
fn test_describe_data_plane() {
|
|
// no nodes
|
|
assert_eq!(num_layers(0, 200, 200, false), 0);
|
|
|
|
// 1 node
|
|
assert_eq!(num_layers(1, 200, 200, false), 1);
|
|
|
|
// 10 nodes with fanout of 2 and hood size of 2
|
|
assert_eq!(num_layers(10, 2, 2, false), 5);
|
|
|
|
// fanout + 1 nodes with fanout of 2 and hood size of 2
|
|
assert_eq!(num_layers(3, 2, 2, false), 2);
|
|
|
|
// 10 nodes with fanout of 4 and hood size of 2 while growing
|
|
assert_eq!(num_layers(10, 4, 2, true), 3);
|
|
|
|
// A little more realistic
|
|
assert_eq!(num_layers(100, 10, 10, false), 3);
|
|
|
|
// A little more realistic with odd numbers
|
|
assert_eq!(num_layers(103, 13, 13, false), 3);
|
|
|
|
// larger
|
|
let (layer_cnt, layer_indices) = ClusterInfo::describe_data_plane(10_000, 10, 10, false);
|
|
assert_eq!(layer_cnt, 201);
|
|
// distances between index values should be the same since we aren't growing.
|
|
let capacity = 10 / 2 * 10;
|
|
assert_eq!(layer_indices[1], 10);
|
|
layer_indices[1..layer_indices.len()]
|
|
.chunks(2)
|
|
.for_each(|x| {
|
|
if x.len() == 2 {
|
|
assert_eq!(x[1] - x[0], capacity);
|
|
}
|
|
});
|
|
|
|
// massive
|
|
let (layer_cnt, layer_indices) = ClusterInfo::describe_data_plane(500_000, 200, 200, false);
|
|
let capacity = 200 / 2 * 200;
|
|
let cnt = 500_000 / capacity + 1;
|
|
assert_eq!(layer_cnt, cnt);
|
|
// distances between index values should be the same since we aren't growing.
|
|
assert_eq!(layer_indices[1], 200);
|
|
layer_indices[1..layer_indices.len()]
|
|
.chunks(2)
|
|
.for_each(|x| {
|
|
if x.len() == 2 {
|
|
assert_eq!(x[1] - x[0], capacity);
|
|
}
|
|
});
|
|
let total_capacity: usize = *layer_indices.last().unwrap();
|
|
assert!(total_capacity >= 500_000);
|
|
|
|
// massive with growth
|
|
assert_eq!(num_layers(500_000, 200, 200, true), 3);
|
|
}
|
|
|
|
#[test]
|
|
fn test_localize() {
|
|
// go for gold
|
|
let (_, layer_indices) = ClusterInfo::describe_data_plane(500_000, 200, 200, false);
|
|
let mut me = 0;
|
|
let mut layer_ix = 0;
|
|
let locality = ClusterInfo::localize(&layer_indices, 200, me);
|
|
assert_eq!(locality.layer_ix, layer_ix);
|
|
assert_eq!(
|
|
locality.child_layer_bounds,
|
|
Some((layer_indices[layer_ix + 1], layer_indices[layer_ix + 2]))
|
|
);
|
|
me = 201;
|
|
layer_ix = 1;
|
|
let locality = ClusterInfo::localize(&layer_indices, 200, me);
|
|
assert_eq!(
|
|
locality.layer_ix, layer_ix,
|
|
"layer_indices[layer_ix] is actually {}",
|
|
layer_indices[layer_ix]
|
|
);
|
|
assert_eq!(
|
|
locality.child_layer_bounds,
|
|
Some((layer_indices[layer_ix + 1], layer_indices[layer_ix + 2]))
|
|
);
|
|
me = 20_201;
|
|
layer_ix = 2;
|
|
let locality = ClusterInfo::localize(&layer_indices, 200, me);
|
|
assert_eq!(
|
|
locality.layer_ix, layer_ix,
|
|
"layer_indices[layer_ix] is actually {}",
|
|
layer_indices[layer_ix]
|
|
);
|
|
assert_eq!(
|
|
locality.child_layer_bounds,
|
|
Some((layer_indices[layer_ix + 1], layer_indices[layer_ix + 2]))
|
|
);
|
|
|
|
// test no child layer since last layer should have massive capacity
|
|
let (_, layer_indices) = ClusterInfo::describe_data_plane(500_000, 200, 200, true);
|
|
me = 20_201;
|
|
layer_ix = 2;
|
|
let locality = ClusterInfo::localize(&layer_indices, 200, me);
|
|
assert_eq!(
|
|
locality.layer_ix, layer_ix,
|
|
"layer_indices[layer_ix] is actually {}",
|
|
layer_indices[layer_ix]
|
|
);
|
|
assert_eq!(locality.child_layer_bounds, None);
|
|
}
|
|
|
|
#[test]
|
|
fn test_localize_child_peer_overlap() {
|
|
let (_, layer_indices) = ClusterInfo::describe_data_plane(500_000, 200, 200, false);
|
|
let last_ix = layer_indices.len() - 1;
|
|
// sample every 33 pairs to reduce test time
|
|
for x in (0..*layer_indices.get(last_ix - 2).unwrap()).step_by(33) {
|
|
let me_locality = ClusterInfo::localize(&layer_indices, 200, x);
|
|
let buddy_locality = ClusterInfo::localize(&layer_indices, 200, x + 1);
|
|
assert!(!me_locality.child_layer_peers.is_empty());
|
|
assert!(!buddy_locality.child_layer_peers.is_empty());
|
|
me_locality
|
|
.child_layer_peers
|
|
.iter()
|
|
.zip(buddy_locality.child_layer_peers.iter())
|
|
.for_each(|(x, y)| assert_ne!(x, y));
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn test_network_coverage() {
|
|
// pretend to be each node in a scaled down network and make sure the set of all the broadcast peers
|
|
// includes every node in the network.
|
|
let (_, layer_indices) = ClusterInfo::describe_data_plane(25_000, 10, 10, false);
|
|
let mut broadcast_set = HashSet::new();
|
|
for my_index in 0..25_000 {
|
|
let my_locality = ClusterInfo::localize(&layer_indices, 10, my_index);
|
|
broadcast_set.extend(my_locality.neighbor_bounds.0..my_locality.neighbor_bounds.1);
|
|
broadcast_set.extend(my_locality.child_layer_peers);
|
|
}
|
|
|
|
for i in 0..25_000 {
|
|
assert!(broadcast_set.contains(&(i as usize)));
|
|
}
|
|
assert!(broadcast_set.contains(&(layer_indices.last().unwrap() - 1)));
|
|
//sanity check for past total capacity.
|
|
assert!(!broadcast_set.contains(&(layer_indices.last().unwrap())));
|
|
}
|
|
|
|
#[test]
|
|
fn test_push_vote() {
|
|
let keys = Keypair::new();
|
|
let now = timestamp();
|
|
let contact_info = ContactInfo::new_localhost(&keys.pubkey(), 0);
|
|
let mut cluster_info = ClusterInfo::new_with_invalid_keypair(contact_info);
|
|
|
|
// make sure empty crds is handled correctly
|
|
let (votes, max_ts) = cluster_info.get_votes(now);
|
|
assert_eq!(votes, vec![]);
|
|
assert_eq!(max_ts, now);
|
|
|
|
// add a vote
|
|
let tx = test_tx();
|
|
cluster_info.push_vote(tx.clone());
|
|
|
|
// -1 to make sure that the clock is strictly lower then when insert occurred
|
|
let (votes, max_ts) = cluster_info.get_votes(now - 1);
|
|
assert_eq!(votes, vec![tx]);
|
|
assert!(max_ts >= now - 1);
|
|
|
|
// make sure timestamp filter works
|
|
let (votes, new_max_ts) = cluster_info.get_votes(max_ts);
|
|
assert_eq!(votes, vec![]);
|
|
assert_eq!(max_ts, new_max_ts);
|
|
}
|
|
}
|
|
#[test]
|
|
fn test_add_entrypoint() {
|
|
let node_keypair = Arc::new(Keypair::new());
|
|
let mut cluster_info = ClusterInfo::new(
|
|
ContactInfo::new_localhost(&node_keypair.pubkey(), timestamp()),
|
|
node_keypair,
|
|
);
|
|
let entrypoint_id = Pubkey::new_rand();
|
|
let entrypoint = ContactInfo::new_localhost(&entrypoint_id, timestamp());
|
|
cluster_info.set_entrypoint(entrypoint.clone());
|
|
let pulls = cluster_info.new_pull_requests(&HashMap::new());
|
|
assert_eq!(1, pulls.len());
|
|
match pulls.get(0) {
|
|
Some((addr, msg)) => {
|
|
assert_eq!(*addr, entrypoint.gossip);
|
|
match msg {
|
|
Protocol::PullRequest(_, value) => {
|
|
assert!(value.verify());
|
|
assert_eq!(value.pubkey(), cluster_info.id())
|
|
}
|
|
_ => panic!("wrong protocol"),
|
|
}
|
|
}
|
|
None => panic!("entrypoint should be a pull destination"),
|
|
}
|
|
|
|
// now add this message back to the table and make sure after the next pull, the entrypoint is unset
|
|
let entrypoint_crdsvalue = CrdsValue::ContactInfo(entrypoint.clone());
|
|
let cluster_info = Arc::new(RwLock::new(cluster_info));
|
|
ClusterInfo::handle_pull_response(&cluster_info, &entrypoint_id, vec![entrypoint_crdsvalue]);
|
|
let pulls = cluster_info
|
|
.write()
|
|
.unwrap()
|
|
.new_pull_requests(&HashMap::new());
|
|
assert_eq!(1, pulls.len());
|
|
assert_eq!(cluster_info.read().unwrap().entrypoint, Some(entrypoint));
|
|
}
|