|
| 1 | +use std::{ |
| 2 | + cmp, |
| 3 | + collections::{BTreeMap, BTreeSet, HashSet, VecDeque}, |
| 4 | + sync::Arc, |
| 5 | +}; |
| 6 | + |
| 7 | +use bdk_wallet::{ |
| 8 | + bitcoin::{ |
| 9 | + self, absolute::LockTime, hashes::Hash, transaction::Version, Amount, BlockHash, OutPoint, |
| 10 | + Transaction, TxIn, TxOut, Txid, |
| 11 | + }, |
| 12 | + chain::{BlockId, CheckPoint, ConfirmationBlockTime}, |
| 13 | + KeychainKind, Wallet, |
| 14 | +}; |
| 15 | + |
| 16 | +use crate::fuzzed_data_provider::{ |
| 17 | + consume_bool, consume_bytes, consume_u32, consume_u64, consume_u8, |
| 18 | +}; |
| 19 | + |
| 20 | +pub fn consume_block_hash(data: &mut &[u8]) -> BlockHash { |
| 21 | + let bytes: [u8; 32] = match consume_bytes(data, 32).try_into() { |
| 22 | + Ok(bytes) => bytes, |
| 23 | + Err(_) => [0; 32], |
| 24 | + }; |
| 25 | + |
| 26 | + BlockHash::from_byte_array(bytes) |
| 27 | +} |
| 28 | + |
| 29 | +pub fn consume_txid(data: &mut &[u8]) -> Txid { |
| 30 | + let bytes: [u8; 32] = match consume_bytes(data, 32).try_into() { |
| 31 | + Ok(bytes) => bytes, |
| 32 | + Err(_) => [0; 32], |
| 33 | + }; |
| 34 | + |
| 35 | + Txid::from_byte_array(bytes) |
| 36 | +} |
| 37 | + |
| 38 | +pub fn consume_keychain_indices( |
| 39 | + data: &mut &[u8], |
| 40 | + keychain: KeychainKind, |
| 41 | +) -> BTreeMap<KeychainKind, u32> { |
| 42 | + let mut indices = BTreeMap::new(); |
| 43 | + if consume_bool(data) { |
| 44 | + let count = consume_u8(data) as u32; |
| 45 | + let start = consume_u8(data) as u32; |
| 46 | + indices.extend((start..count).map(|idx| (keychain, idx))) |
| 47 | + } |
| 48 | + indices |
| 49 | +} |
| 50 | + |
| 51 | +// TODO: (@leonardo) improve this implementation to not rely on UniqueHash |
| 52 | +pub fn consume_spk(data: &mut &[u8], wallet: &mut Wallet) -> bitcoin::ScriptBuf { |
| 53 | + if data.is_empty() { |
| 54 | + let bytes = consume_bytes(data, 32); |
| 55 | + return bitcoin::ScriptBuf::from_bytes(bytes); |
| 56 | + } |
| 57 | + |
| 58 | + let flags = data[0]; |
| 59 | + *data = &data[1..]; |
| 60 | + |
| 61 | + match flags.trailing_zeros() { |
| 62 | + 0 => wallet |
| 63 | + .next_unused_address(KeychainKind::External) |
| 64 | + .script_pubkey(), |
| 65 | + 1 => wallet |
| 66 | + .next_unused_address(KeychainKind::Internal) |
| 67 | + .script_pubkey(), |
| 68 | + _ => { |
| 69 | + let bytes = consume_bytes(data, 32); |
| 70 | + bitcoin::ScriptBuf::from_bytes(bytes) |
| 71 | + } |
| 72 | + } |
| 73 | +} |
| 74 | + |
| 75 | +// TODO: (@leonardo) improve this implementation to not rely on UniqueHash |
| 76 | +pub fn consume_txs(mut data: &[u8], wallet: &mut Wallet) -> Vec<Arc<Transaction>> { |
| 77 | + // TODO: (@leonardo) should this be a usize ? |
| 78 | + |
| 79 | + let count = consume_u8(&mut data); |
| 80 | + let mut txs = Vec::with_capacity(count as usize); |
| 81 | + for _ in 0..count { |
| 82 | + let version = consume_u32(&mut data); |
| 83 | + // TODO: (@leonardo) should we use the Version::consensus_decode instead ? |
| 84 | + let version = Version(version as i32); |
| 85 | + |
| 86 | + let locktime = consume_u32(&mut data); |
| 87 | + let locktime = LockTime::from_consensus(locktime); |
| 88 | + |
| 89 | + let txin_count = consume_u8(&mut data); |
| 90 | + let mut tx_inputs = Vec::with_capacity(txin_count as usize); |
| 91 | + |
| 92 | + for _ in 0..txin_count { |
| 93 | + let prev_txid = consume_txid(&mut data); |
| 94 | + let prev_vout = consume_u32(&mut data); |
| 95 | + let prev_output = OutPoint::new(prev_txid, prev_vout); |
| 96 | + let tx_input = TxIn { |
| 97 | + previous_output: prev_output, |
| 98 | + ..Default::default() |
| 99 | + }; |
| 100 | + tx_inputs.push(tx_input); |
| 101 | + } |
| 102 | + |
| 103 | + let txout_count = consume_u8(&mut data); |
| 104 | + let mut tx_outputs = Vec::with_capacity(txout_count as usize); |
| 105 | + |
| 106 | + for _ in 0..txout_count { |
| 107 | + let spk = consume_spk(&mut data, wallet); |
| 108 | + let sats = (consume_u8(&mut data) as u64) * 1_000; |
| 109 | + let amount = Amount::from_sat(sats); |
| 110 | + let tx_output = TxOut { |
| 111 | + value: amount, |
| 112 | + script_pubkey: spk, |
| 113 | + }; |
| 114 | + tx_outputs.push(tx_output); |
| 115 | + } |
| 116 | + |
| 117 | + let tx = Transaction { |
| 118 | + version, |
| 119 | + lock_time: locktime, |
| 120 | + input: tx_inputs, |
| 121 | + output: tx_outputs, |
| 122 | + }; |
| 123 | + |
| 124 | + txs.push(tx.into()); |
| 125 | + } |
| 126 | + txs |
| 127 | +} |
| 128 | + |
| 129 | +pub fn consume_txouts(mut data: &[u8]) -> BTreeMap<OutPoint, TxOut> { |
| 130 | + // TODO: (@leonardo) should this be a usize ? |
| 131 | + let count = consume_u8(&mut data); |
| 132 | + let mut txouts = BTreeMap::new(); |
| 133 | + for _ in 0..count { |
| 134 | + let prev_txid = consume_txid(&mut data); |
| 135 | + let prev_vout = consume_u32(&mut data); |
| 136 | + let prev_output = OutPoint::new(prev_txid, prev_vout); |
| 137 | + |
| 138 | + let sats = (consume_u8(&mut data) as u64) * 1_000; |
| 139 | + let amount = Amount::from_sat(sats); |
| 140 | + |
| 141 | + // TODO: (@leonardo) should we use different spks ? |
| 142 | + let txout = TxOut { |
| 143 | + value: amount, |
| 144 | + script_pubkey: Default::default(), |
| 145 | + }; |
| 146 | + |
| 147 | + txouts.insert(prev_output, txout); |
| 148 | + } |
| 149 | + txouts |
| 150 | +} |
| 151 | + |
| 152 | +pub fn consume_anchors( |
| 153 | + mut data: &[u8], |
| 154 | + mut unconfirmed_txids: VecDeque<Txid>, |
| 155 | +) -> BTreeSet<(ConfirmationBlockTime, Txid)> { |
| 156 | + let mut anchors = BTreeSet::new(); |
| 157 | + |
| 158 | + let count = consume_u8(&mut data); |
| 159 | + // FIXME: (@leonardo) should we use while limited by a flag instead ? (as per antoine's impls) |
| 160 | + for _ in 0..count { |
| 161 | + let block_height = consume_u32(&mut data); |
| 162 | + let block_hash = consume_block_hash(&mut data); |
| 163 | + |
| 164 | + let block_id = BlockId { |
| 165 | + height: block_height, |
| 166 | + hash: block_hash, |
| 167 | + }; |
| 168 | + |
| 169 | + let confirmation_time = consume_u64(&mut data); |
| 170 | + |
| 171 | + let anchor = ConfirmationBlockTime { |
| 172 | + block_id, |
| 173 | + confirmation_time, |
| 174 | + }; |
| 175 | + |
| 176 | + if let Some(txid) = unconfirmed_txids.pop_front() { |
| 177 | + anchors.insert((anchor, txid)); |
| 178 | + } else { |
| 179 | + break; |
| 180 | + } |
| 181 | + } |
| 182 | + anchors |
| 183 | +} |
| 184 | + |
| 185 | +pub fn consume_seen_ats( |
| 186 | + mut data: &[u8], |
| 187 | + mut unconfirmed_txids: VecDeque<Txid>, |
| 188 | +) -> HashSet<(Txid, u64)> { |
| 189 | + let mut seen_ats = HashSet::new(); |
| 190 | + |
| 191 | + let count = consume_u8(&mut data); |
| 192 | + // FIXME: (@leonardo) should we use while limited by a flag instead ? (as per antoine's impls) |
| 193 | + for _ in 0..count { |
| 194 | + let time = cmp::min(consume_u64(&mut data), i64::MAX as u64 - 1); |
| 195 | + |
| 196 | + if let Some(txid) = unconfirmed_txids.pop_front() { |
| 197 | + seen_ats.insert((txid, time)); |
| 198 | + } else { |
| 199 | + let txid = consume_txid(&mut data); |
| 200 | + seen_ats.insert((txid, time)); |
| 201 | + } |
| 202 | + } |
| 203 | + seen_ats |
| 204 | +} |
| 205 | + |
| 206 | +pub fn consume_evicted_ats( |
| 207 | + mut data: &[u8], |
| 208 | + mut unconfirmed_txids: VecDeque<Txid>, |
| 209 | +) -> HashSet<(Txid, u64)> { |
| 210 | + let mut evicted_at = HashSet::new(); |
| 211 | + |
| 212 | + let count = consume_u8(&mut data); |
| 213 | + // FIXME: (@leonardo) should we use while limited by a flag instead ? (as per antoine's impls) |
| 214 | + for _ in 0..count { |
| 215 | + let time = cmp::min(consume_u64(&mut data), i64::MAX as u64 - 1); |
| 216 | + if let Some(txid) = unconfirmed_txids.pop_front() { |
| 217 | + evicted_at.insert((txid, time)); |
| 218 | + } else { |
| 219 | + let txid = consume_txid(&mut data); |
| 220 | + evicted_at.insert((txid, time)); |
| 221 | + } |
| 222 | + } |
| 223 | + |
| 224 | + evicted_at |
| 225 | +} |
| 226 | + |
| 227 | +pub fn consume_checkpoint(mut data: &[u8], wallet: &mut Wallet) -> CheckPoint { |
| 228 | + let mut tip = wallet.latest_checkpoint(); |
| 229 | + |
| 230 | + let _tip_hash = tip.hash(); |
| 231 | + let tip_height = tip.height(); |
| 232 | + |
| 233 | + let count = consume_u8(&mut data); |
| 234 | + // FIXME: (@leonardo) should we use while limited by a flag instead ? (as per antoine's impls) |
| 235 | + for i in 1..count { |
| 236 | + let height = tip_height + i as u32; |
| 237 | + let hash = consume_block_hash(&mut data); |
| 238 | + |
| 239 | + let block_id = BlockId { height, hash }; |
| 240 | + |
| 241 | + tip = tip.push(block_id).unwrap(); |
| 242 | + } |
| 243 | + tip |
| 244 | +} |
0 commit comments