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
#![forbid(unsafe_code)]
use crate::{components::chunk_output::ChunkOutput, metrics::APTOS_EXECUTOR_ERRORS};
use anyhow::{ensure, Result};
use aptos_crypto::{
hash::{CryptoHash, EventAccumulatorHasher},
HashValue,
};
use aptos_logger::error;
use aptos_types::{
nibble::nibble_path::NibblePath,
proof::accumulator::InMemoryAccumulator,
state_store::{state_key::StateKey, state_value::StateValue},
transaction::{Transaction, TransactionInfo, TransactionOutput, TransactionStatus},
};
use executor_types::{
in_memory_state_calculator::InMemoryStateCalculator, ExecutedChunk, ParsedTransactionOutput,
TransactionData,
};
use std::{collections::HashMap, iter::repeat, sync::Arc};
use storage_interface::ExecutedTrees;
pub struct ApplyChunkOutput;
impl ApplyChunkOutput {
pub fn apply(
chunk_output: ChunkOutput,
base_view: &ExecutedTrees,
) -> Result<(ExecutedChunk, Vec<Transaction>, Vec<Transaction>)> {
let ChunkOutput {
state_cache,
transactions,
transaction_outputs,
} = chunk_output;
let (new_epoch, status, to_keep, to_discard, to_retry) =
Self::sort_transactions(transactions, transaction_outputs)?;
let (
state_updates_vec,
new_node_hashes_vec,
state_checkpoint_hashes,
result_state,
next_epoch_state,
) = InMemoryStateCalculator::new(base_view.state(), state_cache)
.calculate_for_transaction_chunk(&to_keep, new_epoch)?;
let (to_commit, transaction_info_hashes) = Self::assemble_ledger_diff(
to_keep,
state_updates_vec,
new_node_hashes_vec,
state_checkpoint_hashes,
);
let result_view = ExecutedTrees::new(
result_state,
Arc::new(base_view.txn_accumulator().append(&transaction_info_hashes)),
);
Ok((
ExecutedChunk {
status,
to_commit,
result_view,
next_epoch_state,
ledger_info: None,
},
to_discard,
to_retry,
))
}
fn sort_transactions(
mut transactions: Vec<Transaction>,
transaction_outputs: Vec<TransactionOutput>,
) -> Result<(
bool,
Vec<TransactionStatus>,
Vec<(Transaction, ParsedTransactionOutput)>,
Vec<Transaction>,
Vec<Transaction>,
)> {
let num_txns = transactions.len();
let mut transaction_outputs: Vec<ParsedTransactionOutput> =
transaction_outputs.into_iter().map(Into::into).collect();
let new_epoch_marker = transaction_outputs
.iter()
.position(|o| o.is_reconfig())
.map(|idx| idx + 1);
let to_retry = if let Some(pos) = new_epoch_marker {
transaction_outputs.drain(pos..);
transactions.drain(pos..).collect()
} else {
vec![]
};
let status = transaction_outputs
.iter()
.map(|t| t.status())
.cloned()
.chain(repeat(TransactionStatus::Retry))
.take(num_txns)
.collect();
let (to_keep, to_discard) =
itertools::zip_eq(transactions.into_iter(), transaction_outputs.into_iter())
.partition::<Vec<(Transaction, ParsedTransactionOutput)>, _>(|(_, o)| {
matches!(o.status(), TransactionStatus::Keep(_))
});
let to_discard = to_discard
.into_iter()
.map(|(t, o)| {
if !matches!(o.status(), TransactionStatus::Discard(_)) {
error!("Status other than Retry, Keep or Discard; Transaction discarded.");
}
if !o.write_set().is_empty() || !o.events().is_empty() {
error!(
"Discarded transaction has non-empty write set or events. \
Transaction: {:?}. Status: {:?}.",
t,
o.status(),
);
APTOS_EXECUTOR_ERRORS.inc();
}
Ok(t)
})
.collect::<Result<Vec<_>>>()?;
Ok((
new_epoch_marker.is_some(),
status,
to_keep,
to_discard,
to_retry,
))
}
fn assemble_ledger_diff(
to_keep: Vec<(Transaction, ParsedTransactionOutput)>,
state_updates_vec: Vec<HashMap<StateKey, StateValue>>,
new_node_hashes_vec: Vec<HashMap<NibblePath, HashValue>>,
state_checkpoint_hashes: Vec<Option<HashValue>>,
) -> (Vec<(Transaction, TransactionData)>, Vec<HashValue>) {
let mut to_commit = vec![];
let mut txn_info_hashes = vec![];
for (((txn, txn_output), state_checkpoint_hash), (new_node_hashes, state_updates)) in
itertools::zip_eq(
itertools::zip_eq(to_keep, state_checkpoint_hashes),
itertools::zip_eq(new_node_hashes_vec, state_updates_vec),
)
{
let (write_set, events, reconfig_events, gas_used, status) = txn_output.unpack();
let event_tree = {
let event_hashes: Vec<_> = events.iter().map(CryptoHash::hash).collect();
InMemoryAccumulator::<EventAccumulatorHasher>::from_leaves(&event_hashes)
};
let state_change_hash = CryptoHash::hash(&write_set);
let txn_info = match &status {
TransactionStatus::Keep(status) => TransactionInfo::new(
txn.hash(),
state_change_hash,
event_tree.root_hash(),
state_checkpoint_hash,
gas_used,
status.clone(),
),
_ => unreachable!("Transaction sorted by status already."),
};
let txn_info_hash = txn_info.hash();
txn_info_hashes.push(txn_info_hash);
to_commit.push((
txn,
TransactionData::new(
state_updates,
new_node_hashes,
write_set,
events,
reconfig_events,
status,
Arc::new(event_tree),
gas_used,
txn_info,
txn_info_hash,
),
))
}
(to_commit, txn_info_hashes)
}
}
pub fn ensure_no_discard(to_discard: Vec<Transaction>) -> Result<()> {
ensure!(to_discard.is_empty(), "Syncing discarded transactions");
Ok(())
}
pub fn ensure_no_retry(to_retry: Vec<Transaction>) -> Result<()> {
ensure!(to_retry.is_empty(), "Chunk crosses epoch boundary.",);
Ok(())
}