2022-05-05 22:07:09 +03:00
|
|
|
///! Communicate with a group of web3 providers
|
|
|
|
use derive_more::From;
|
|
|
|
use futures::stream::FuturesUnordered;
|
|
|
|
use futures::StreamExt;
|
|
|
|
use governor::clock::{QuantaClock, QuantaInstant};
|
|
|
|
use governor::NotUntil;
|
|
|
|
use hashbrown::HashMap;
|
2022-05-06 08:44:30 +03:00
|
|
|
use parking_lot::RwLock;
|
2022-05-05 22:07:09 +03:00
|
|
|
use serde_json::value::RawValue;
|
|
|
|
use std::cmp;
|
|
|
|
use std::fmt;
|
2022-05-06 08:44:30 +03:00
|
|
|
use std::sync::atomic::{self, AtomicU64};
|
2022-05-05 22:07:09 +03:00
|
|
|
use std::sync::Arc;
|
|
|
|
use tracing::warn;
|
|
|
|
|
|
|
|
use crate::config::Web3ConnectionConfig;
|
2022-05-06 08:44:30 +03:00
|
|
|
use crate::connection::{ActiveRequestHandle, Web3Connection};
|
2022-05-05 22:07:09 +03:00
|
|
|
|
|
|
|
#[derive(Clone, Default)]
|
|
|
|
struct SyncedConnections {
|
|
|
|
head_block_number: u64,
|
|
|
|
inner: Vec<usize>,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl fmt::Debug for SyncedConnections {
|
|
|
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
|
|
|
// TODO: the default formatter takes forever to write. this is too quiet though
|
|
|
|
f.debug_struct("SyncedConnections").finish_non_exhaustive()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl SyncedConnections {
|
|
|
|
fn new(max_connections: usize) -> Self {
|
|
|
|
let inner = Vec::with_capacity(max_connections);
|
|
|
|
|
|
|
|
Self {
|
|
|
|
head_block_number: 0,
|
|
|
|
inner,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// A collection of web3 connections. Sends requests either the current best server or all servers.
|
|
|
|
#[derive(From)]
|
|
|
|
pub struct Web3Connections {
|
|
|
|
inner: Vec<Arc<Web3Connection>>,
|
|
|
|
/// TODO: what is the best type for this? Heavy reads with writes every few seconds. When writes happen, there is a burst of them
|
2022-05-06 08:44:30 +03:00
|
|
|
/// TODO: we probably need a better lock on this
|
|
|
|
synced_connections: RwLock<SyncedConnections>,
|
|
|
|
best_head_block_number: Arc<AtomicU64>,
|
2022-05-05 22:07:09 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
impl fmt::Debug for Web3Connections {
|
|
|
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
|
|
|
// TODO: the default formatter takes forever to write. this is too quiet though
|
|
|
|
f.debug_struct("Web3Connections")
|
|
|
|
.field("inner", &self.inner)
|
|
|
|
.finish_non_exhaustive()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl Web3Connections {
|
|
|
|
pub async fn try_new(
|
2022-05-06 08:44:30 +03:00
|
|
|
best_head_block_number: Arc<AtomicU64>,
|
2022-05-05 22:07:09 +03:00
|
|
|
servers: Vec<Web3ConnectionConfig>,
|
|
|
|
http_client: Option<reqwest::Client>,
|
|
|
|
clock: &QuantaClock,
|
|
|
|
) -> anyhow::Result<Arc<Self>> {
|
|
|
|
let mut connections = vec![];
|
|
|
|
|
|
|
|
let num_connections = servers.len();
|
|
|
|
|
|
|
|
for server_config in servers.into_iter() {
|
2022-05-06 00:38:15 +03:00
|
|
|
match server_config.try_build(clock, http_client.clone()).await {
|
|
|
|
Ok(connection) => connections.push(connection),
|
|
|
|
Err(e) => warn!("Unable to connect to a server! {}", e),
|
|
|
|
}
|
2022-05-05 22:07:09 +03:00
|
|
|
}
|
|
|
|
|
2022-05-06 00:38:15 +03:00
|
|
|
// TODO: exit if no connections?
|
|
|
|
|
2022-05-05 22:07:09 +03:00
|
|
|
let connections = Arc::new(Self {
|
2022-05-06 08:44:30 +03:00
|
|
|
best_head_block_number: best_head_block_number.clone(),
|
2022-05-05 22:07:09 +03:00
|
|
|
inner: connections,
|
2022-05-06 08:44:30 +03:00
|
|
|
synced_connections: RwLock::new(SyncedConnections::new(num_connections)),
|
2022-05-05 22:07:09 +03:00
|
|
|
});
|
|
|
|
|
|
|
|
for connection in connections.inner.iter() {
|
|
|
|
// subscribe to new heads in a spawned future
|
2022-05-06 08:44:30 +03:00
|
|
|
// TODO: channel instead. then we can have one future with write access to a left-right?
|
2022-05-05 22:07:09 +03:00
|
|
|
let connection = Arc::clone(connection);
|
|
|
|
let connections = connections.clone();
|
2022-05-06 08:44:30 +03:00
|
|
|
let best_head_block_number = best_head_block_number.clone();
|
2022-05-05 22:07:09 +03:00
|
|
|
tokio::spawn(async move {
|
2022-05-06 01:21:27 +03:00
|
|
|
let url = connection.url().to_string();
|
|
|
|
|
2022-05-05 22:07:09 +03:00
|
|
|
// TODO: instead of passing Some(connections), pass Some(channel_sender). Then listen on the receiver below to keep local heads up-to-date
|
2022-05-06 08:44:30 +03:00
|
|
|
if let Err(e) = connection
|
|
|
|
.new_heads(Some(connections), best_head_block_number)
|
|
|
|
.await
|
|
|
|
{
|
2022-05-06 01:21:27 +03:00
|
|
|
warn!("new_heads error on {}: {:?}", url, e);
|
2022-05-05 22:07:09 +03:00
|
|
|
}
|
|
|
|
});
|
|
|
|
}
|
|
|
|
|
|
|
|
Ok(connections)
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn head_block_number(&self) -> u64 {
|
2022-05-06 08:44:30 +03:00
|
|
|
self.best_head_block_number.load(atomic::Ordering::Acquire)
|
2022-05-05 22:07:09 +03:00
|
|
|
}
|
|
|
|
|
2022-05-06 08:44:30 +03:00
|
|
|
pub async fn try_send_request(
|
2022-05-05 22:07:09 +03:00
|
|
|
&self,
|
2022-05-06 07:29:25 +03:00
|
|
|
connection_handle: ActiveRequestHandle,
|
2022-05-05 22:07:09 +03:00
|
|
|
method: &str,
|
|
|
|
params: &RawValue,
|
2022-05-06 08:44:30 +03:00
|
|
|
) -> anyhow::Result<Box<RawValue>> {
|
2022-05-05 22:07:09 +03:00
|
|
|
// connection.in_active_requests was called when this rpc was selected
|
|
|
|
|
2022-05-06 07:29:25 +03:00
|
|
|
let response = connection_handle.request(method, params).await;
|
2022-05-05 22:07:09 +03:00
|
|
|
|
|
|
|
// TODO: if "no block with that header" or some other jsonrpc errors, skip this response
|
|
|
|
|
|
|
|
response.map_err(Into::into)
|
|
|
|
}
|
|
|
|
|
|
|
|
pub async fn try_send_requests(
|
|
|
|
self: Arc<Self>,
|
2022-05-06 07:29:25 +03:00
|
|
|
connections: Vec<ActiveRequestHandle>,
|
2022-05-05 22:07:09 +03:00
|
|
|
method: String,
|
|
|
|
params: Box<RawValue>,
|
2022-05-06 08:44:30 +03:00
|
|
|
response_sender: flume::Sender<anyhow::Result<Box<RawValue>>>,
|
2022-05-05 22:07:09 +03:00
|
|
|
) -> anyhow::Result<()> {
|
|
|
|
let mut unordered_futures = FuturesUnordered::new();
|
|
|
|
|
|
|
|
for connection in connections {
|
|
|
|
// clone things so we can pass them to a future
|
|
|
|
let connections = self.clone();
|
|
|
|
let method = method.clone();
|
|
|
|
let params = params.clone();
|
|
|
|
let response_sender = response_sender.clone();
|
|
|
|
|
|
|
|
let handle = tokio::spawn(async move {
|
|
|
|
// get the client for this rpc server
|
|
|
|
let response = connections
|
2022-05-06 07:29:25 +03:00
|
|
|
.try_send_request(connection, &method, ¶ms)
|
2022-05-05 22:07:09 +03:00
|
|
|
.await?;
|
|
|
|
|
|
|
|
// send the first good response to a one shot channel. that way we respond quickly
|
|
|
|
// drop the result because errors are expected after the first send
|
|
|
|
response_sender.send(Ok(response)).map_err(Into::into)
|
|
|
|
});
|
|
|
|
|
|
|
|
unordered_futures.push(handle);
|
|
|
|
}
|
|
|
|
|
|
|
|
// TODO: use iterators instead of pushing into a vec
|
|
|
|
let mut errs = vec![];
|
|
|
|
if let Some(x) = unordered_futures.next().await {
|
|
|
|
match x.unwrap() {
|
|
|
|
Ok(_) => {}
|
|
|
|
Err(e) => {
|
|
|
|
// TODO: better errors
|
|
|
|
warn!("Got an error sending request: {}", e);
|
|
|
|
errs.push(e);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// get the first error (if any)
|
|
|
|
// TODO: why collect multiple errors if we only pop one?
|
|
|
|
let e = if !errs.is_empty() {
|
|
|
|
Err(errs.pop().unwrap())
|
|
|
|
} else {
|
|
|
|
Err(anyhow::anyhow!("no successful responses"))
|
|
|
|
};
|
|
|
|
|
|
|
|
// send the error to the channel
|
|
|
|
if response_sender.send(e).is_ok() {
|
|
|
|
// if we were able to send an error, then we never sent a success
|
|
|
|
return Err(anyhow::anyhow!("no successful responses"));
|
|
|
|
} else {
|
|
|
|
// if sending the error failed. the other side must be closed (which means we sent a success earlier)
|
|
|
|
Ok(())
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn update_synced_rpcs(
|
|
|
|
&self,
|
|
|
|
rpc: &Arc<Web3Connection>,
|
|
|
|
new_block: u64,
|
|
|
|
) -> anyhow::Result<()> {
|
2022-05-06 08:44:30 +03:00
|
|
|
let mut synced_connections = self.synced_connections.write();
|
2022-05-05 22:07:09 +03:00
|
|
|
|
2022-05-06 08:44:30 +03:00
|
|
|
let current_block_number = synced_connections.head_block_number;
|
2022-05-05 22:07:09 +03:00
|
|
|
|
2022-05-06 08:44:30 +03:00
|
|
|
let best_head_block = self.head_block_number();
|
2022-05-05 22:07:09 +03:00
|
|
|
|
2022-05-06 08:44:30 +03:00
|
|
|
match current_block_number.cmp(&best_head_block) {
|
|
|
|
cmp::Ordering::Equal => {
|
|
|
|
// this rpc tier is synced, and it isn't the first to this block
|
|
|
|
}
|
|
|
|
cmp::Ordering::Less => {}
|
|
|
|
cmp::Ordering::Greater => {}
|
|
|
|
}
|
2022-05-05 22:07:09 +03:00
|
|
|
|
2022-05-06 08:44:30 +03:00
|
|
|
match current_block_number.cmp(&new_block) {
|
|
|
|
cmp::Ordering::Equal => {
|
|
|
|
// this rpc is synced, and it isn't the first to this block
|
|
|
|
}
|
|
|
|
cmp::Ordering::Less => {
|
|
|
|
// this is a new head block. clear the current synced connections
|
|
|
|
// TODO: this is too verbose with a bunch of tiers. include the tier
|
|
|
|
// info!("new head block from {:?}: {}", rpc, new_block);
|
2022-05-05 22:07:09 +03:00
|
|
|
|
2022-05-06 08:44:30 +03:00
|
|
|
synced_connections.inner.clear();
|
2022-05-05 22:07:09 +03:00
|
|
|
|
2022-05-06 08:44:30 +03:00
|
|
|
synced_connections.head_block_number = new_block;
|
|
|
|
}
|
|
|
|
cmp::Ordering::Greater => {
|
|
|
|
// not the latest block. return now
|
|
|
|
return Ok(());
|
|
|
|
}
|
|
|
|
}
|
2022-05-05 22:07:09 +03:00
|
|
|
|
|
|
|
let rpc_index = self
|
|
|
|
.inner
|
|
|
|
.iter()
|
|
|
|
.position(|x| x.url() == rpc.url())
|
|
|
|
.unwrap();
|
|
|
|
|
2022-05-06 08:44:30 +03:00
|
|
|
synced_connections.inner.push(rpc_index);
|
2022-05-05 22:07:09 +03:00
|
|
|
|
|
|
|
Ok(())
|
|
|
|
}
|
|
|
|
|
|
|
|
/// get the best available rpc server
|
|
|
|
pub async fn next_upstream_server(
|
|
|
|
&self,
|
2022-05-06 07:29:25 +03:00
|
|
|
) -> Result<ActiveRequestHandle, Option<NotUntil<QuantaInstant>>> {
|
2022-05-05 22:07:09 +03:00
|
|
|
let mut earliest_not_until = None;
|
|
|
|
|
|
|
|
// TODO: this clone is probably not the best way to do this
|
2022-05-06 08:44:30 +03:00
|
|
|
let mut synced_rpc_indexes = self.synced_connections.read().inner.clone();
|
2022-05-05 22:07:09 +03:00
|
|
|
|
|
|
|
let cache: HashMap<usize, u32> = synced_rpc_indexes
|
|
|
|
.iter()
|
|
|
|
.map(|synced_index| {
|
|
|
|
(
|
|
|
|
*synced_index,
|
|
|
|
self.inner.get(*synced_index).unwrap().active_requests(),
|
|
|
|
)
|
|
|
|
})
|
|
|
|
.collect();
|
|
|
|
|
|
|
|
// TODO: i think we might need to load active connections and then
|
|
|
|
synced_rpc_indexes.sort_unstable_by(|a, b| {
|
|
|
|
let a = cache.get(a).unwrap();
|
|
|
|
let b = cache.get(b).unwrap();
|
|
|
|
|
2022-05-06 07:29:25 +03:00
|
|
|
// TODO: don't just sort by active requests. sort by active requests as a percentage of soft limit
|
|
|
|
// TODO: if those are equal, sort on soft limit
|
|
|
|
|
2022-05-05 22:07:09 +03:00
|
|
|
a.cmp(b)
|
|
|
|
});
|
|
|
|
|
|
|
|
for selected_rpc in synced_rpc_indexes.into_iter() {
|
|
|
|
let selected_rpc = self.inner.get(selected_rpc).unwrap();
|
|
|
|
|
|
|
|
// increment our connection counter
|
2022-05-06 07:29:25 +03:00
|
|
|
match selected_rpc.try_request_handle() {
|
|
|
|
Err(not_until) => {
|
|
|
|
earliest_possible(&mut earliest_not_until, not_until);
|
|
|
|
}
|
|
|
|
Ok(handle) => return Ok(handle),
|
2022-05-05 22:07:09 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// this might be None
|
|
|
|
Err(earliest_not_until)
|
|
|
|
}
|
|
|
|
|
|
|
|
/// get all rpc servers that are not rate limited
|
|
|
|
/// even fetches if they aren't in sync. This is useful for broadcasting signed transactions
|
|
|
|
pub fn get_upstream_servers(
|
|
|
|
&self,
|
2022-05-06 07:29:25 +03:00
|
|
|
) -> Result<Vec<ActiveRequestHandle>, Option<NotUntil<QuantaInstant>>> {
|
2022-05-05 22:07:09 +03:00
|
|
|
let mut earliest_not_until = None;
|
|
|
|
// TODO: with capacity?
|
|
|
|
let mut selected_rpcs = vec![];
|
|
|
|
|
|
|
|
for connection in self.inner.iter() {
|
|
|
|
// check rate limits and increment our connection counter
|
2022-05-06 07:29:25 +03:00
|
|
|
match connection.try_request_handle() {
|
|
|
|
Err(not_until) => {
|
|
|
|
earliest_possible(&mut earliest_not_until, not_until);
|
|
|
|
// this rpc is not available. skip it
|
|
|
|
}
|
|
|
|
Ok(handle) => selected_rpcs.push(handle),
|
2022-05-05 22:07:09 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if !selected_rpcs.is_empty() {
|
|
|
|
return Ok(selected_rpcs);
|
|
|
|
}
|
|
|
|
|
|
|
|
// return the earliest not_until (if no rpcs are synced, this will be None)
|
|
|
|
Err(earliest_not_until)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn earliest_possible(
|
|
|
|
earliest_not_until_option: &mut Option<NotUntil<QuantaInstant>>,
|
|
|
|
new_not_until: NotUntil<QuantaInstant>,
|
|
|
|
) {
|
|
|
|
match earliest_not_until_option.as_ref() {
|
|
|
|
None => *earliest_not_until_option = Some(new_not_until),
|
|
|
|
Some(earliest_not_until) => {
|
|
|
|
let earliest_possible = earliest_not_until.earliest_possible();
|
|
|
|
let new_earliest_possible = new_not_until.earliest_possible();
|
|
|
|
|
|
|
|
if earliest_possible > new_earliest_possible {
|
|
|
|
*earliest_not_until_option = Some(new_not_until);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|