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
// Copyright 2019-2022 PureStake Inc.
// This file is part of Moonbeam.
// Moonbeam 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.
// Moonbeam 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 Moonbeam. If not, see <http://www.gnu.org/licenses/>.
use ethereum_types::{H160, H256};
use std::{collections::btree_map::BTreeMap, vec, vec::Vec};
use crate::types::{convert_memory, single::RawStepLog, ContextType};
use evm_tracing_events::{
runtime::{Capture, ExitReason},
Event, GasometerEvent, Listener as ListenerT, RuntimeEvent, StepEventFilter,
};
#[derive(Debug)]
pub struct Listener {
disable_storage: bool,
disable_memory: bool,
disable_stack: bool,
new_context: bool,
context_stack: Vec<Context>,
pub struct_logs: Vec<RawStepLog>,
pub return_value: Vec<u8>,
pub final_gas: u64,
pub remaining_memory_usage: Option<usize>,
}
#[derive(Debug)]
struct Context {
storage_cache: BTreeMap<H256, H256>,
address: H160,
current_step: Option<Step>,
global_storage_changes: BTreeMap<H160, BTreeMap<H256, H256>>,
}
#[derive(Debug)]
struct Step {
/// Current opcode.
opcode: Vec<u8>,
/// Depth of the context.
depth: usize,
/// Remaining gas.
gas: u64,
/// Gas cost of the following opcode.
gas_cost: u64,
/// Program counter position.
position: usize,
/// EVM memory copy (if not disabled).
memory: Option<Vec<u8>>,
/// EVM stack copy (if not disabled).
stack: Option<Vec<H256>>,
}
impl Listener {
pub fn new(
disable_storage: bool,
disable_memory: bool,
disable_stack: bool,
raw_max_memory_usage: usize,
) -> Self {
Self {
disable_storage,
disable_memory,
disable_stack,
remaining_memory_usage: Some(raw_max_memory_usage),
struct_logs: vec![],
return_value: vec![],
final_gas: 0,
new_context: false,
context_stack: vec![],
}
}
pub fn using<R, F: FnOnce() -> R>(&mut self, f: F) -> R {
evm_tracing_events::using(self, f)
}
pub fn gasometer_event(&mut self, event: GasometerEvent) {
match event {
GasometerEvent::RecordTransaction { cost, .. } => {
// First event of a transaction.
// Next step will be the first context.
self.new_context = true;
self.final_gas = cost;
}
GasometerEvent::RecordCost { cost, snapshot } => {
if let Some(context) = self.context_stack.last_mut() {
// Register opcode cost. (ignore costs not between Step and StepResult)
if let Some(step) = &mut context.current_step {
step.gas = snapshot.gas();
step.gas_cost = cost;
}
self.final_gas = snapshot.used_gas;
}
}
GasometerEvent::RecordDynamicCost {
gas_cost, snapshot, ..
} => {
if let Some(context) = self.context_stack.last_mut() {
// Register opcode cost. (ignore costs not between Step and StepResult)
if let Some(step) = &mut context.current_step {
step.gas = snapshot.gas();
step.gas_cost = gas_cost;
}
self.final_gas = snapshot.used_gas;
}
}
// We ignore other kinds of message if any (new ones may be added in the future).
#[allow(unreachable_patterns)]
_ => (),
}
}
pub fn runtime_event(&mut self, event: RuntimeEvent) {
match event {
RuntimeEvent::Step {
context,
opcode,
position,
stack,
memory,
} => {
// Create a context if needed.
if self.new_context {
self.new_context = false;
self.context_stack.push(Context {
storage_cache: BTreeMap::new(),
address: context.address,
current_step: None,
global_storage_changes: BTreeMap::new(),
});
}
let depth = self.context_stack.len();
// Ignore steps outside of any context (shouldn't even be possible).
if let Some(context) = self.context_stack.last_mut() {
context.current_step = Some(Step {
opcode,
depth,
gas: 0, // 0 for now, will add with gas events
gas_cost: 0, // 0 for now, will add with gas events
position: *position.as_ref().unwrap_or(&0) as usize,
memory: if self.disable_memory {
None
} else {
let memory = memory.expect("memory data to not be filtered out");
self.remaining_memory_usage = self
.remaining_memory_usage
.and_then(|inner| inner.checked_sub(memory.data.len()));
if self.remaining_memory_usage.is_none() {
return;
}
Some(memory.data.clone())
},
stack: if self.disable_stack {
None
} else {
let stack = stack.expect("stack data to not be filtered out");
self.remaining_memory_usage = self
.remaining_memory_usage
.and_then(|inner| inner.checked_sub(stack.data.len()));
if self.remaining_memory_usage.is_none() {
return;
}
Some(stack.data.clone())
},
});
}
}
RuntimeEvent::StepResult {
result,
return_value,
} => {
// StepResult is expected to be emited after a step (in a context).
// Only case StepResult will occur without a Step before is in a transfer
// transaction to a non-contract address. However it will not contain any
// steps and return an empty trace, so we can ignore this edge case.
if let Some(context) = self.context_stack.last_mut() {
if let Some(current_step) = context.current_step.take() {
let Step {
opcode,
depth,
gas,
gas_cost,
position,
memory,
stack,
} = current_step;
let memory = memory.map(convert_memory);
let storage = if self.disable_storage {
None
} else {
self.remaining_memory_usage =
self.remaining_memory_usage.and_then(|inner| {
inner.checked_sub(context.storage_cache.len() * 64)
});
if self.remaining_memory_usage.is_none() {
return;
}
Some(context.storage_cache.clone())
};
self.struct_logs.push(RawStepLog {
depth: depth.into(),
gas: gas.into(),
gas_cost: gas_cost.into(),
memory,
op: opcode,
pc: position.into(),
stack,
storage,
});
}
}
// We match on the capture to handle traps/exits.
match result {
Err(Capture::Exit(reason)) => {
// Exit = we exit the context (should always be some)
if let Some(mut context) = self.context_stack.pop() {
// If final context is exited, we store gas and return value.
if self.context_stack.is_empty() {
self.return_value = return_value.to_vec();
}
// If the context exited without revert we must keep track of the
// updated storage keys.
if !self.disable_storage && matches!(reason, ExitReason::Succeed(_)) {
if let Some(parent_context) = self.context_stack.last_mut() {
// Add cache to storage changes.
context
.global_storage_changes
.insert(context.address, context.storage_cache);
// Apply storage changes to parent, either updating its cache or map of changes.
for (address, mut storage) in
context.global_storage_changes.into_iter()
{
// Same address => We update its cache (only tracked keys)
if parent_context.address == address {
for (cached_key, cached_value) in
parent_context.storage_cache.iter_mut()
{
if let Some(value) = storage.remove(cached_key) {
*cached_value = value;
}
}
}
// Otherwise, update the storage changes.
else {
parent_context
.global_storage_changes
.entry(address)
.or_insert_with(BTreeMap::new)
.append(&mut storage);
}
}
}
}
}
}
Err(Capture::Trap(opcode)) if ContextType::from(opcode.clone()).is_some() => {
self.new_context = true;
}
_ => (),
}
}
RuntimeEvent::SLoad {
address: _,
index,
value,
}
| RuntimeEvent::SStore {
address: _,
index,
value,
} => {
if let Some(context) = self.context_stack.last_mut() {
if !self.disable_storage {
context.storage_cache.insert(index, value);
}
}
}
// We ignore other kinds of message if any (new ones may be added in the future).
#[allow(unreachable_patterns)]
_ => (),
}
}
}
impl ListenerT for Listener {
fn event(&mut self, event: Event) {
if self.remaining_memory_usage.is_none() {
return;
}
match event {
Event::Gasometer(e) => self.gasometer_event(e),
Event::Runtime(e) => self.runtime_event(e),
_ => {}
};
}
fn step_event_filter(&self) -> StepEventFilter {
StepEventFilter {
enable_memory: !self.disable_memory,
enable_stack: !self.disable_stack,
}
}
}