tycho-block-util 0.3.9

Shared utilities for blockchain models.
Documentation
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
use std::collections::BTreeMap;
use std::sync::Arc;

use anyhow::Result;
use tl_proto::TlRead;
use tycho_types::cell::Lazy;
use tycho_types::error::Error;
use tycho_types::models::*;
use tycho_types::prelude::*;

use crate::archive::WithArchiveData;
use crate::queue::RouterPartitions;
use crate::queue::proto::{QueueDiff, QueueKey};

pub type QueueDiffStuffAug = WithArchiveData<QueueDiffStuff>;

pub struct QueueDiffStuffBuilder {
    inner: Arc<Inner>,
}

impl QueueDiffStuffBuilder {
    pub fn serialize(mut self) -> SerializedQueueDiff {
        let data = tl_proto::serialize(&self.inner.diff);
        self.inner_mut().diff.hash = QueueDiff::compute_hash(&data);

        SerializedQueueDiff {
            inner: self.inner,
            data,
        }
    }

    pub fn with_processed_to(mut self, processed_to: BTreeMap<ShardIdent, QueueKey>) -> Self {
        self.inner_mut().diff.processed_to = processed_to;
        self
    }

    pub fn with_router(
        mut self,
        src_router: RouterPartitions,
        dsc_router: RouterPartitions,
    ) -> Self {
        let inner = self.inner_mut();
        inner.diff.router_partitions_src = src_router;
        inner.diff.router_partitions_dst = dsc_router;
        self
    }

    pub fn with_messages<'a, I>(
        mut self,
        min_message: &QueueKey,
        max_message: &QueueKey,
        hashes: I,
    ) -> Self
    where
        I: IntoIterator<Item = &'a HashBytes>,
    {
        let inner = self.inner_mut();
        inner.diff.min_message = *min_message;
        inner.diff.max_message = *max_message;
        inner.diff.messages = hashes.into_iter().copied().collect();
        inner.diff.messages.sort_unstable();
        self
    }

    fn inner_mut(&mut self) -> &mut Inner {
        Arc::get_mut(&mut self.inner).expect("inner is not shared")
    }
}

pub struct SerializedQueueDiff {
    inner: Arc<Inner>,
    data: Vec<u8>,
}

impl SerializedQueueDiff {
    pub fn build(mut self, block_id: &BlockId) -> QueueDiffStuffAug {
        let inner = self.inner_mut();
        debug_assert_eq!(inner.diff.shard_ident, block_id.shard);
        debug_assert_eq!(inner.diff.seqno, block_id.seqno);
        inner.block_id = *block_id;

        QueueDiffStuffAug::new(QueueDiffStuff { inner: self.inner }, self.data)
    }

    pub fn hash(&self) -> &HashBytes {
        &self.inner.diff.hash
    }

    pub fn processed_to(&self) -> &BTreeMap<ShardIdent, QueueKey> {
        &self.inner.diff.processed_to
    }

    fn inner_mut(&mut self) -> &mut Inner {
        Arc::get_mut(&mut self.inner).expect("inner is not shared")
    }
}

#[derive(Clone)]
#[repr(transparent)]
pub struct QueueDiffStuff {
    inner: Arc<Inner>,
}

impl QueueDiffStuff {
    pub fn new_empty(block_id: &BlockId) -> Self {
        use std::collections::BTreeMap;

        Self {
            inner: Arc::new(Inner {
                block_id: *block_id,
                diff: QueueDiff {
                    hash: HashBytes::ZERO,
                    prev_hash: HashBytes::ZERO,
                    shard_ident: block_id.shard,
                    seqno: block_id.seqno,
                    processed_to: BTreeMap::from([(block_id.shard, QueueKey::MIN)]),
                    min_message: QueueKey::MIN,
                    max_message: QueueKey::MIN,
                    messages: Vec::new(),
                    router_partitions_src: Default::default(),
                    router_partitions_dst: Default::default(),
                },
            }),
        }
    }

    #[cfg(any(test, feature = "test"))]
    pub fn new(block_id: &BlockId, diff: QueueDiff) -> Self {
        Self {
            inner: Arc::new(Inner {
                block_id: *block_id,
                diff,
            }),
        }
    }

    pub fn builder(
        shard_ident: ShardIdent,
        seqno: u32,
        prev_hash: &HashBytes,
    ) -> QueueDiffStuffBuilder {
        QueueDiffStuffBuilder {
            inner: Arc::new(Inner {
                block_id: BlockId::default(),
                diff: QueueDiff {
                    hash: HashBytes::ZERO,
                    prev_hash: *prev_hash,
                    shard_ident,
                    seqno,
                    processed_to: Default::default(),
                    min_message: Default::default(),
                    max_message: Default::default(),
                    messages: Default::default(),
                    router_partitions_src: Default::default(),
                    router_partitions_dst: Default::default(),
                },
            }),
        }
    }

    pub fn deserialize(block_id: &BlockId, data: &[u8]) -> Result<Self> {
        let packet = &mut std::convert::identity(data);
        let mut diff = QueueDiff::read_from(packet)?;
        anyhow::ensure!(
            block_id.shard == diff.shard_ident && block_id.seqno == diff.seqno,
            "short block id mismatch"
        );
        anyhow::ensure!(packet.is_empty(), "unexpected data after the diff");

        diff.hash = QueueDiff::compute_hash(data);

        Ok(Self {
            inner: Arc::new(Inner {
                block_id: *block_id,
                diff,
            }),
        })
    }

    pub fn block_id(&self) -> &BlockId {
        &self.inner.block_id
    }

    pub fn diff_hash(&self) -> &HashBytes {
        &self.inner.diff.hash
    }

    // TODO: Use only `AsRef<QueueDiff>`?
    pub fn diff(&self) -> &QueueDiff {
        &self.inner.diff
    }

    pub fn zip(&self, out_messages: &OutMsgDescr) -> QueueDiffMessagesIter {
        QueueDiffMessagesIter {
            index: 0,
            out_messages: out_messages.dict().clone(),
            inner: self.inner.clone(),
        }
    }
}

impl AsRef<QueueDiff> for QueueDiffStuff {
    fn as_ref(&self) -> &QueueDiff {
        &self.inner.diff
    }
}

unsafe impl arc_swap::RefCnt for QueueDiffStuff {
    type Base = Inner;

    fn into_ptr(me: Self) -> *mut Self::Base {
        arc_swap::RefCnt::into_ptr(me.inner)
    }

    fn as_ptr(me: &Self) -> *mut Self::Base {
        arc_swap::RefCnt::as_ptr(&me.inner)
    }

    unsafe fn from_ptr(ptr: *const Self::Base) -> Self {
        Self {
            inner: unsafe { arc_swap::RefCnt::from_ptr(ptr) },
        }
    }
}

#[doc(hidden)]
pub struct Inner {
    block_id: BlockId,
    diff: QueueDiff,
}

/// Iterator over the messages in the queue diff.
#[derive(Clone)]
pub struct QueueDiffMessagesIter {
    index: usize,
    out_messages: Dict<HashBytes, (CurrencyCollection, OutMsg)>,
    inner: Arc<Inner>,
}

impl Iterator for QueueDiffMessagesIter {
    type Item = Result<Lazy<OwnedMessage>, Error>;

    fn next(&mut self) -> Option<Self::Item> {
        let messages = &self.inner.diff.messages;
        if self.index >= messages.len() {
            return None;
        }

        let hash = &messages[self.index];
        self.index += 1;

        match self.out_messages.get(hash) {
            Ok(Some((_, out_msg))) => {
                let OutMsg::New(out_msg) = &out_msg else {
                    return Some(Err(Error::InvalidData));
                };

                // Get the last ref from the envelope, it will be the message itself
                let out_msg = out_msg.out_msg_envelope.inner();
                let ref_count = out_msg.descriptor().reference_count();
                if ref_count > 0
                    && let Some(cell) = out_msg.reference_cloned(ref_count - 1)
                {
                    return Some(Lazy::from_raw(cell));
                }

                Some(Err(Error::InvalidData))
            }
            Ok(None) => Some(Err(Error::InvalidData)),
            Err(e) => Some(Err(e)),
        }
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        // NOTE: `seld.index` increment stops at `len`
        let len = self.inner.diff.messages.len() - self.index;
        (len, Some(len))
    }
}

impl ExactSizeIterator for QueueDiffMessagesIter {
    fn len(&self) -> usize {
        // NOTE: `seld.index` increment stops at `len`
        self.inner.diff.messages.len() - self.index
    }
}

#[cfg(test)]
mod tests {
    use tycho_types::num::Tokens;

    use super::*;

    #[test]
    fn queue_diff_messages_iter() -> Result<()> {
        let mut out_messages = Dict::<HashBytes, (CurrencyCollection, OutMsg)>::new();

        let dummy_tx = Lazy::from_raw(Cell::default())?;

        // Fill with external messages
        for i in 0..10 {
            let message = Lazy::new(&Message {
                info: MsgInfo::ExtOut(ExtOutMsgInfo {
                    src: IntAddr::Std(StdAddr::new(0, HashBytes::from([i as u8; 32]))),
                    dst: None,
                    created_lt: i,
                    created_at: 0,
                }),
                init: None,
                body: Cell::empty_cell_ref().as_slice()?,
                layout: None,
            })?;

            out_messages.set(
                message.inner().repr_hash(),
                (
                    CurrencyCollection::ZERO,
                    OutMsg::External(OutMsgExternal {
                        out_msg: message.cast_ref().clone(),
                        transaction: dummy_tx.clone(),
                    }),
                ),
            )?;
        }

        // Fill with outgoing messages
        let mut message_hashes = Vec::new();
        for i in 0..10 {
            let addr = IntAddr::Std(StdAddr::new(0, HashBytes::from([i as u8; 32])));

            let message = Lazy::new(&Message {
                info: MsgInfo::Int(IntMsgInfo {
                    src: addr.clone(),
                    dst: addr,
                    created_lt: i,
                    ..Default::default()
                }),
                init: None,
                body: Cell::empty_cell_ref().as_slice()?,
                layout: None,
            })?;

            let message_hash = *message.inner().repr_hash();
            message_hashes.push(message_hash);

            let envelope = Lazy::new(&MsgEnvelope {
                cur_addr: IntermediateAddr::FULL_SRC_SAME_WORKCHAIN,
                next_addr: IntermediateAddr::FULL_DEST_SAME_WORKCHAIN,
                fwd_fee_remaining: Tokens::ZERO,
                message: message.cast_into(),
            })?;

            out_messages.set(
                message_hash,
                (
                    CurrencyCollection::ZERO,
                    OutMsg::New(OutMsgNew {
                        out_msg_envelope: envelope,
                        transaction: dummy_tx.clone(),
                    }),
                ),
            )?;
        }

        let out_messages = AugDict::from_parts(out_messages, CurrencyCollection::ZERO);

        // Create queue diff
        message_hashes.sort_unstable();
        assert_eq!(message_hashes.len(), 10);

        let diff = QueueDiffStuff {
            inner: Arc::new(Inner {
                block_id: BlockId::default(),
                diff: QueueDiff {
                    hash: HashBytes::ZERO,
                    prev_hash: HashBytes::ZERO,
                    shard_ident: ShardIdent::BASECHAIN,
                    seqno: 1,
                    processed_to: Default::default(),
                    min_message: QueueKey {
                        lt: 0,
                        hash: message_hashes[0],
                    },
                    max_message: QueueKey {
                        lt: 9,
                        hash: message_hashes[9],
                    },
                    messages: message_hashes.clone(),
                    router_partitions_src: Default::default(),
                    router_partitions_dst: Default::default(),
                },
            }),
        };

        // Verify messages
        let mut messages_iter = diff.zip(&out_messages);
        assert_eq!(message_hashes.len(), messages_iter.len());

        for expected_hash in message_hashes {
            let message = messages_iter.next().unwrap()?;
            assert_eq!(expected_hash, *message.inner().repr_hash());

            message.load().unwrap();
        }

        assert!(messages_iter.next().is_none());
        assert_eq!(messages_iter.len(), 0);
        assert_eq!(messages_iter.size_hint(), (0, Some(0)));

        Ok(())
    }
}