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
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
// SPDX-License-Identifier: GPL-3.0-or-later WITH Classpath-exception-2.0
// This file is part of Frontier.
//
// Copyright (c) 2022 Parity Technologies (UK) Ltd.
//
// This program 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.
//
// This program 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 this program. If not, see <https://www.gnu.org/licenses/>.

mod lru_cache;

use std::{
    collections::{BTreeMap, HashMap},
    marker::PhantomData,
    sync::{Arc, Mutex},
};

use ethereum::BlockV2 as EthereumBlock;
use ethereum_types::U256;
use futures::StreamExt;
use tokio::sync::{mpsc, oneshot};
// Substrate
use sc_client_api::{
    backend::{Backend, StorageProvider},
    client::BlockchainEvents,
};
use sc_service::SpawnTaskHandle;
use sp_api::ProvideRuntimeApi;
use sp_blockchain::HeaderBackend;
use sp_runtime::traits::{Block as BlockT, Header as HeaderT, UniqueSaturatedInto};
// Frontier
use fc_rpc_core::types::*;
use fc_storage::{OverrideHandle, StorageOverride};
use fp_rpc::{EthereumRuntimeRPCApi, TransactionStatus};
use fp_storage::EthereumStorageSchema;

use self::lru_cache::LRUCacheByteLimited;

type WaitList<Hash, T> = HashMap<Hash, Vec<oneshot::Sender<Option<T>>>>;

enum EthBlockDataCacheMessage<B: BlockT> {
    RequestCurrentBlock {
        block_hash: B::Hash,
        schema: EthereumStorageSchema,
        response_tx: oneshot::Sender<Option<EthereumBlock>>,
    },
    FetchedCurrentBlock {
        block_hash: B::Hash,
        block: Option<EthereumBlock>,
    },

    RequestCurrentTransactionStatuses {
        block_hash: B::Hash,
        schema: EthereumStorageSchema,
        response_tx: oneshot::Sender<Option<Vec<TransactionStatus>>>,
    },
    FetchedCurrentTransactionStatuses {
        block_hash: B::Hash,
        statuses: Option<Vec<TransactionStatus>>,
    },
}

/// Manage LRU caches for block data and their transaction statuses.
/// These are large and take a lot of time to fetch from the database.
/// Storing them in an LRU cache will allow to reduce database accesses
/// when many subsequent requests are related to the same blocks.
pub struct EthBlockDataCacheTask<B: BlockT>(mpsc::Sender<EthBlockDataCacheMessage<B>>);

impl<B: BlockT> EthBlockDataCacheTask<B> {
    pub fn new(
        spawn_handle: SpawnTaskHandle,
        overrides: Arc<OverrideHandle<B>>,
        blocks_cache_max_size: usize,
        statuses_cache_max_size: usize,
        prometheus_registry: Option<prometheus_endpoint::Registry>,
    ) -> Self {
        let (task_tx, mut task_rx) = mpsc::channel(100);
        let outer_task_tx = task_tx.clone();
        let outer_spawn_handle = spawn_handle.clone();

        outer_spawn_handle.spawn("EthBlockDataCacheTask", None, async move {
            let mut blocks_cache = LRUCacheByteLimited::<B::Hash, EthereumBlock>::new(
                "blocks_cache",
                blocks_cache_max_size as u64,
                prometheus_registry.clone(),
            );
            let mut statuses_cache = LRUCacheByteLimited::<B::Hash, Vec<TransactionStatus>>::new(
                "statuses_cache",
                statuses_cache_max_size as u64,
                prometheus_registry,
            );

            let mut awaiting_blocks =
                HashMap::<B::Hash, Vec<oneshot::Sender<Option<EthereumBlock>>>>::new();
            let mut awaiting_statuses =
                HashMap::<B::Hash, Vec<oneshot::Sender<Option<Vec<TransactionStatus>>>>>::new();

            // Handle all incoming messages.
            // Exits when there are no more senders.
            // Any long computation should be spawned in a separate task
            // to keep this task handle messages as soon as possible.
            while let Some(message) = task_rx.recv().await {
                use EthBlockDataCacheMessage::*;
                match message {
                    RequestCurrentBlock {
                        block_hash,
                        schema,
                        response_tx,
                    } => Self::request_current(
                        &spawn_handle,
                        &mut blocks_cache,
                        &mut awaiting_blocks,
                        Arc::clone(&overrides),
                        block_hash,
                        schema,
                        response_tx,
                        task_tx.clone(),
                        move |handler| FetchedCurrentBlock {
                            block_hash,
                            block: handler.current_block(block_hash),
                        },
                    ),
                    FetchedCurrentBlock { block_hash, block } => {
                        if let Some(wait_list) = awaiting_blocks.remove(&block_hash) {
                            for sender in wait_list {
                                let _ = sender.send(block.clone());
                            }
                        }

                        if let Some(block) = block {
                            blocks_cache.put(block_hash, block);
                        }
                    },

                    RequestCurrentTransactionStatuses {
                        block_hash,
                        schema,
                        response_tx,
                    } => Self::request_current(
                        &spawn_handle,
                        &mut statuses_cache,
                        &mut awaiting_statuses,
                        Arc::clone(&overrides),
                        block_hash,
                        schema,
                        response_tx,
                        task_tx.clone(),
                        move |handler| FetchedCurrentTransactionStatuses {
                            block_hash,
                            statuses: handler.current_transaction_statuses(block_hash),
                        },
                    ),
                    FetchedCurrentTransactionStatuses {
                        block_hash,
                        statuses,
                    } => {
                        if let Some(wait_list) = awaiting_statuses.remove(&block_hash) {
                            for sender in wait_list {
                                let _ = sender.send(statuses.clone());
                            }
                        }

                        if let Some(statuses) = statuses {
                            statuses_cache.put(block_hash, statuses);
                        }
                    },
                }
            }
        });

        Self(outer_task_tx)
    }

    fn request_current<T, F>(
        spawn_handle: &SpawnTaskHandle,
        cache: &mut LRUCacheByteLimited<B::Hash, T>,
        wait_list: &mut WaitList<B::Hash, T>,
        overrides: Arc<OverrideHandle<B>>,
        block_hash: B::Hash,
        schema: EthereumStorageSchema,
        response_tx: oneshot::Sender<Option<T>>,
        task_tx: mpsc::Sender<EthBlockDataCacheMessage<B>>,
        handler_call: F,
    ) where
        T: Clone + scale_codec::Encode,
        F: FnOnce(&Box<dyn StorageOverride<B>>) -> EthBlockDataCacheMessage<B>,
        F: Send + 'static,
    {
        // Data is cached, we respond immediately.
        if let Some(data) = cache.get(&block_hash).cloned() {
            let _ = response_tx.send(Some(data));
            return
        }

        // Another request already triggered caching but the
        // response is not known yet, we add the sender to the waiting
        // list.
        if let Some(waiting) = wait_list.get_mut(&block_hash) {
            waiting.push(response_tx);
            return
        }

        // Data is neither cached nor already requested, so we start fetching
        // the data.
        wait_list.insert(block_hash, vec![response_tx]);

        spawn_handle.spawn("EthBlockDataCacheTask Worker", None, async move {
            let handler = overrides
                .schemas
                .get(&schema)
                .unwrap_or(&overrides.fallback);

            let message = handler_call(handler);
            let _ = task_tx.send(message).await;
        });
    }

    /// Cache for `handler.current_block`.
    pub async fn current_block(
        &self,
        schema: EthereumStorageSchema,
        block_hash: B::Hash,
    ) -> Option<EthereumBlock> {
        let (response_tx, response_rx) = oneshot::channel();

        self.0
            .send(EthBlockDataCacheMessage::RequestCurrentBlock {
                block_hash,
                schema,
                response_tx,
            })
            .await
            .ok()?;

        response_rx.await.ok()?
    }

    /// Cache for `handler.current_transaction_statuses`.
    pub async fn current_transaction_statuses(
        &self,
        schema: EthereumStorageSchema,
        block_hash: B::Hash,
    ) -> Option<Vec<TransactionStatus>> {
        let (response_tx, response_rx) = oneshot::channel();

        self.0
            .send(
                EthBlockDataCacheMessage::RequestCurrentTransactionStatuses {
                    block_hash,
                    schema,
                    response_tx,
                },
            )
            .await
            .ok()?;

        response_rx.await.ok()?
    }
}

pub struct EthTask<B, C, BE>(PhantomData<(B, C, BE)>);

impl<B, C, BE> EthTask<B, C, BE>
where
    B: BlockT,
    C: ProvideRuntimeApi<B>,
    C::Api: EthereumRuntimeRPCApi<B>,
    C: BlockchainEvents<B> + 'static,
    C: HeaderBackend<B> + StorageProvider<B, BE>,
    BE: Backend<B> + 'static,
{
    pub async fn filter_pool_task(
        client: Arc<C>,
        filter_pool: Arc<Mutex<BTreeMap<U256, FilterPoolItem>>>,
        retain_threshold: u64,
    ) {
        let mut notification_st = client.import_notification_stream();

        while let Some(notification) = notification_st.next().await {
            if let Ok(filter_pool) = &mut filter_pool.lock() {
                let imported_number: u64 = UniqueSaturatedInto::<u64>::unique_saturated_into(
                    *notification.header.number(),
                );

                filter_pool.retain(|_, v| v.at_block + retain_threshold > imported_number);
            }
        }
    }

    pub async fn fee_history_task(
        client: Arc<C>,
        overrides: Arc<OverrideHandle<B>>,
        fee_history_cache: FeeHistoryCache,
        block_limit: u64,
    ) {
        struct TransactionHelper {
            gas_used: u64,
            effective_reward: u64,
        }
        // Calculates the cache for a single block
        #[rustfmt::skip]
			let fee_history_cache_item = |hash: B::Hash| -> (
			FeeHistoryCacheItem,
			Option<u64>
		) {
			let schema = fc_storage::onchain_storage_schema(client.as_ref(), hash);
			let handler = overrides
				.schemas
				.get(&schema)
				.unwrap_or(&overrides.fallback);

			// Evenly spaced percentile list from 0.0 to 100.0 with a 0.5 resolution.
			// This means we cache 200 percentile points.
			// Later in request handling we will approximate by rounding percentiles that
			// fall in between with `(round(n*2)/2)`.
			let reward_percentiles: Vec<f64> = {
				let mut percentile: f64 = 0.0;
				(0..201)
					.map(|_| {
						let val = percentile;
						percentile += 0.5;
						val
					})
					.collect()
			};

			let block = handler.current_block(hash);
			let mut block_number: Option<u64> = None;
			let base_fee = client.runtime_api().gas_price(hash).unwrap_or_default();
			let receipts = handler.current_receipts(hash);
			let mut result = FeeHistoryCacheItem {
				base_fee: UniqueSaturatedInto::<u64>::unique_saturated_into(base_fee),
				gas_used_ratio: 0f64,
				rewards: Vec::new(),
			};
			if let (Some(block), Some(receipts)) = (block, receipts) {
				block_number = Some(UniqueSaturatedInto::<u64>::unique_saturated_into(block.header.number));
				let gas_used = UniqueSaturatedInto::<u64>::unique_saturated_into(block.header.gas_used) as f64;
				let gas_limit = UniqueSaturatedInto::<u64>::unique_saturated_into(block.header.gas_limit) as f64;
				result.gas_used_ratio = gas_used / gas_limit;

				let mut previous_cumulative_gas = U256::zero();
				let used_gas = |current: U256, previous: &mut U256| -> u64 {
					let r = UniqueSaturatedInto::<u64>::unique_saturated_into(current.saturating_sub(*previous));
					*previous = current;
					r
				};
				// Build a list of relevant transaction information.
				let mut transactions: Vec<TransactionHelper> = receipts
					.iter()
					.enumerate()
					.map(|(i, receipt)| TransactionHelper {
						gas_used: match receipt {
							ethereum::ReceiptV3::Legacy(d) | ethereum::ReceiptV3::EIP2930(d) | ethereum::ReceiptV3::EIP1559(d) => used_gas(d.used_gas, &mut previous_cumulative_gas),
						},
						effective_reward: match block.transactions.get(i) {
							Some(ethereum::TransactionV2::Legacy(t)) => {
								UniqueSaturatedInto::<u64>::unique_saturated_into(t.gas_price.saturating_sub(base_fee))
							}
							Some(ethereum::TransactionV2::EIP2930(t)) => {
								UniqueSaturatedInto::<u64>::unique_saturated_into(t.gas_price.saturating_sub(base_fee))
							}
							Some(ethereum::TransactionV2::EIP1559(t)) => UniqueSaturatedInto::<u64>::unique_saturated_into(
									t
										.max_priority_fee_per_gas
										.min(t.max_fee_per_gas.saturating_sub(base_fee))
							),
							None => 0,
						},
					})
					.collect();
				// Sort ASC by effective reward.
				transactions.sort_by(|a, b| a.effective_reward.cmp(&b.effective_reward));

				// Calculate percentile rewards.
				result.rewards = reward_percentiles
					.into_iter()
					.filter_map(|p| {
						let target_gas = (p * gas_used / 100f64) as u64;
						let mut sum_gas = 0;
						for tx in &transactions {
							sum_gas += tx.gas_used;
							if target_gas <= sum_gas {
								return Some(tx.effective_reward);
							}
						}
						None
					})
					.collect();
			} else {
				result.rewards = reward_percentiles.iter().map(|_| 0).collect();
			}
			(result, block_number)
		};

        // Commits the result to cache
        let commit_if_any = |item: FeeHistoryCacheItem, key: Option<u64>| {
            if let (Some(block_number), Ok(fee_history_cache)) =
                (key, &mut fee_history_cache.lock())
            {
                fee_history_cache.insert(block_number, item);
                // We want to remain within the configured cache bounds.
                // The first key out of bounds.
                let first_out = block_number.saturating_sub(block_limit);
                // Out of bounds size.
                let to_remove = (fee_history_cache.len() as u64).saturating_sub(block_limit);
                // Remove all cache data before `block_limit`.
                for i in 0..to_remove {
                    // Cannot overflow.
                    let key = first_out - i;
                    fee_history_cache.remove(&key);
                }
            }
        };

        let mut notification_st = client.import_notification_stream();

        while let Some(notification) = notification_st.next().await {
            if notification.is_new_best {
                // In case a re-org happened on import.
                if let Some(tree_route) = notification.tree_route {
                    if let Ok(fee_history_cache) = &mut fee_history_cache.lock() {
                        // Remove retracted.
                        let _lock = tree_route.retracted().iter().map(|hash_and_number| {
                            let n = UniqueSaturatedInto::<u64>::unique_saturated_into(
                                hash_and_number.number,
                            );
                            fee_history_cache.remove(&n);
                        });
                        // Insert enacted.
                        let _ = tree_route.enacted().iter().map(|hash_and_number| {
                            let (result, block_number) =
                                fee_history_cache_item(hash_and_number.hash);
                            commit_if_any(result, block_number);
                        });
                    }
                }
                // Cache the imported block.
                let (result, block_number) = fee_history_cache_item(notification.hash);
                commit_if_any(result, block_number);
            }
        }
    }
}