referrerpolicy=no-referrer-when-downgrade
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
// Copyright (C) Parity Technologies (UK) Ltd.
// This file is part of Polkadot.

// Polkadot is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.

// Polkadot is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with Polkadot.  If not, see <http://www.gnu.org/licenses/>.

use std::collections::{HashMap, HashSet};

use futures::{Future, FutureExt};

use polkadot_node_network_protocol::{
	request_response::{
		outgoing::RequestError,
		v1::{DisputeRequest, DisputeResponse},
		OutgoingRequest, OutgoingResult, Recipient, Requests,
	},
	IfDisconnected,
};
use polkadot_node_subsystem::{messages::NetworkBridgeTxMessage, overseer};
use polkadot_node_subsystem_util::{metrics, nesting_sender::NestingSender, runtime::RuntimeInfo};
use polkadot_primitives::{
	AuthorityDiscoveryId, CandidateHash, Hash, SessionIndex, ValidatorIndex,
};

use super::error::{FatalError, Result};

use crate::{
	metrics::{FAILED, SUCCEEDED},
	Metrics, LOG_TARGET,
};

/// Delivery status for a particular dispute.
///
/// Keeps track of all the validators that have to be reached for a dispute.
///
/// The unit of work for a `SendTask` is an authority/validator.
pub struct SendTask<M> {
	/// The request we are supposed to get out to all `parachain` validators of the dispute's
	/// session and to all current authorities.
	request: DisputeRequest,

	/// The set of authorities we need to send our messages to. This set will change at session
	/// boundaries. It will always be at least the `parachain` validators of the session where the
	/// dispute happened and the authorities of the current sessions as determined by active heads.
	deliveries: HashMap<AuthorityDiscoveryId, DeliveryStatus>,

	/// Whether we have any tasks failed since the last refresh.
	has_failed_sends: bool,

	/// Sender to be cloned for tasks.
	tx: NestingSender<M, TaskFinish>,
}

/// Status of a particular vote/statement delivery to a particular validator.
enum DeliveryStatus {
	/// Request is still in flight.
	Pending,
	/// Succeeded - no need to send request to this peer anymore.
	Succeeded,
}

/// A sending task finishes with this result:
#[derive(Debug)]
pub struct TaskFinish {
	/// The candidate this task was running for.
	pub candidate_hash: CandidateHash,
	/// The authority the request was sent to.
	pub receiver: AuthorityDiscoveryId,
	/// The result of the delivery attempt.
	pub result: TaskResult,
}

#[derive(Debug)]
pub enum TaskResult {
	/// Task succeeded in getting the request to its peer.
	Succeeded,
	/// Task was not able to get the request out to its peer.
	///
	/// It should be retried in that case.
	Failed(RequestError),
}

impl TaskResult {
	pub fn as_metrics_label(&self) -> &'static str {
		match self {
			Self::Succeeded => SUCCEEDED,
			Self::Failed(_) => FAILED,
		}
	}
}

#[overseer::contextbounds(DisputeDistribution, prefix = self::overseer)]
impl<M: 'static + Send + Sync> SendTask<M> {
	/// Initiates sending a dispute message to peers.
	///
	/// Creation of new `SendTask`s is subject to rate limiting. As each `SendTask` will trigger
	/// sending a message to each validator, hence for employing a per-peer rate limit, we need to
	/// limit the construction of new `SendTask`s.
	pub async fn new<Context>(
		ctx: &mut Context,
		runtime: &mut RuntimeInfo,
		active_sessions: &HashMap<SessionIndex, Hash>,
		tx: NestingSender<M, TaskFinish>,
		request: DisputeRequest,
		metrics: &Metrics,
	) -> Result<Self> {
		let mut send_task =
			Self { request, deliveries: HashMap::new(), has_failed_sends: false, tx };
		send_task.refresh_sends(ctx, runtime, active_sessions, metrics).await?;
		Ok(send_task)
	}

	/// Make sure we are sending to all relevant authorities.
	///
	/// This function is called at construction and should also be called whenever a session change
	/// happens and on a regular basis to ensure we are retrying failed attempts.
	///
	/// This might resend to validators and is thus subject to any rate limiting we might want.
	/// Calls to this function for different instances should be rate limited according to
	/// `SEND_RATE_LIMIT`.
	///
	/// Returns: `True` if this call resulted in new requests.
	pub async fn refresh_sends<Context>(
		&mut self,
		ctx: &mut Context,
		runtime: &mut RuntimeInfo,
		active_sessions: &HashMap<SessionIndex, Hash>,
		metrics: &Metrics,
	) -> Result<bool> {
		let new_authorities = self.get_relevant_validators(ctx, runtime, active_sessions).await?;

		// Note this will also contain all authorities for which sending failed previously:
		let add_authorities: Vec<_> = new_authorities
			.iter()
			.filter(|a| !self.deliveries.contains_key(a))
			.map(Clone::clone)
			.collect();

		// Get rid of dead/irrelevant tasks/statuses:
		gum::trace!(
			target: LOG_TARGET,
			already_running_deliveries = ?self.deliveries.len(),
			"Cleaning up deliveries"
		);
		self.deliveries.retain(|k, _| new_authorities.contains(k));

		// Start any new tasks that are needed:
		gum::trace!(
			target: LOG_TARGET,
			new_and_failed_authorities = ?add_authorities.len(),
			overall_authority_set_size = ?new_authorities.len(),
			already_running_deliveries = ?self.deliveries.len(),
			"Starting new send requests for authorities."
		);
		let new_statuses =
			send_requests(ctx, self.tx.clone(), add_authorities, self.request.clone(), metrics)
				.await?;

		let was_empty = new_statuses.is_empty();
		gum::trace!(
			target: LOG_TARGET,
			sent_requests = ?new_statuses.len(),
			"Requests dispatched."
		);

		self.has_failed_sends = false;
		self.deliveries.extend(new_statuses.into_iter());
		Ok(!was_empty)
	}

	/// Whether any sends have failed since the last refresh.
	pub fn has_failed_sends(&self) -> bool {
		self.has_failed_sends
	}

	/// Handle a finished response waiting task.
	///
	/// Called by `DisputeSender` upon reception of the corresponding message from our spawned
	/// `wait_response_task`.
	pub fn on_finished_send(&mut self, authority: &AuthorityDiscoveryId, result: TaskResult) {
		match result {
			TaskResult::Failed(err) => {
				gum::trace!(
					target: LOG_TARGET,
					?authority,
					candidate_hash = %self.request.0.candidate_receipt.hash(),
					%err,
					"Error sending dispute statements to node."
				);

				self.has_failed_sends = true;
				// Remove state, so we know what to try again:
				self.deliveries.remove(authority);
			},
			TaskResult::Succeeded => {
				let status = match self.deliveries.get_mut(&authority) {
					None => {
						// Can happen when a sending became irrelevant while the response was
						// already queued.
						gum::debug!(
							target: LOG_TARGET,
							candidate = ?self.request.0.candidate_receipt.hash(),
							?authority,
							?result,
							"Received `FromSendingTask::Finished` for non existing task."
						);
						return
					},
					Some(status) => status,
				};
				// We are done here:
				*status = DeliveryStatus::Succeeded;
			},
		}
	}

	/// Determine all validators that should receive the given dispute requests.
	///
	/// This is all `parachain` validators of the session the candidate occurred and all authorities
	/// of all currently active sessions, determined by currently active heads.
	async fn get_relevant_validators<Context>(
		&self,
		ctx: &mut Context,
		runtime: &mut RuntimeInfo,
		active_sessions: &HashMap<SessionIndex, Hash>,
	) -> Result<HashSet<AuthorityDiscoveryId>> {
		let ref_head = self.request.0.candidate_receipt.descriptor.relay_parent();
		// Retrieve all authorities which participated in the parachain consensus of the session
		// in which the candidate was backed.
		let info = runtime
			.get_session_info_by_index(ctx.sender(), ref_head, self.request.0.session_index)
			.await?;
		let session_info = &info.session_info;
		let validator_count = session_info.validators.len();
		let mut authorities: HashSet<_> = session_info
			.discovery_keys
			.iter()
			.take(validator_count)
			.enumerate()
			.filter(|(i, _)| Some(ValidatorIndex(*i as _)) != info.validator_info.our_index)
			.map(|(_, v)| v.clone())
			.collect();

		// Retrieve all authorities for the current session as indicated by the active
		// heads we are tracking.
		for (session_index, head) in active_sessions.iter() {
			let info =
				runtime.get_session_info_by_index(ctx.sender(), *head, *session_index).await?;
			let session_info = &info.session_info;
			let new_set = session_info
				.discovery_keys
				.iter()
				.enumerate()
				.filter(|(i, _)| Some(ValidatorIndex(*i as _)) != info.validator_info.our_index)
				.map(|(_, v)| v.clone());
			authorities.extend(new_set);
		}
		Ok(authorities)
	}
}

/// Start sending of the given message to all given authorities.
///
/// And spawn tasks for handling the response.
#[overseer::contextbounds(DisputeDistribution, prefix = self::overseer)]
async fn send_requests<Context, M: 'static + Send + Sync>(
	ctx: &mut Context,
	tx: NestingSender<M, TaskFinish>,
	receivers: Vec<AuthorityDiscoveryId>,
	req: DisputeRequest,
	metrics: &Metrics,
) -> Result<HashMap<AuthorityDiscoveryId, DeliveryStatus>> {
	let mut statuses = HashMap::with_capacity(receivers.len());
	let mut reqs = Vec::with_capacity(receivers.len());

	for receiver in receivers {
		let (outgoing, pending_response) =
			OutgoingRequest::new(Recipient::Authority(receiver.clone()), req.clone());

		reqs.push(Requests::DisputeSendingV1(outgoing));

		let fut = wait_response_task(
			pending_response,
			req.0.candidate_receipt.hash(),
			receiver.clone(),
			tx.clone(),
			metrics.time_dispute_request(),
		);

		ctx.spawn("dispute-sender", fut.boxed()).map_err(FatalError::SpawnTask)?;
		statuses.insert(receiver, DeliveryStatus::Pending);
	}

	let msg = NetworkBridgeTxMessage::SendRequests(reqs, IfDisconnected::ImmediateError);
	ctx.send_message(msg).await;
	Ok(statuses)
}

/// Future to be spawned in a task for awaiting a response.
async fn wait_response_task<M: 'static + Send + Sync>(
	pending_response: impl Future<Output = OutgoingResult<DisputeResponse>>,
	candidate_hash: CandidateHash,
	receiver: AuthorityDiscoveryId,
	mut tx: NestingSender<M, TaskFinish>,
	_timer: Option<metrics::prometheus::prometheus::HistogramTimer>,
) {
	let result = pending_response.await;
	let msg = match result {
		Err(err) => TaskFinish { candidate_hash, receiver, result: TaskResult::Failed(err) },
		Ok(DisputeResponse::Confirmed) =>
			TaskFinish { candidate_hash, receiver, result: TaskResult::Succeeded },
	};
	if let Err(err) = tx.send_message(msg).await {
		gum::debug!(
			target: LOG_TARGET,
			%err,
			"Failed to notify subsystem about dispute sending result."
		);
	}
}