brec 0.6.0

A flexible binary format for storing and streaming structured data as packets with CRC protection and recoverability from corruption. Built for extensibility and robustness.
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
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
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
use std::{io::BufRead, ops::RangeInclusive};

use crate::*;

/// Represents the result of reading from `PacketBufReaderDef`.
pub enum NextPacket<B: BlockDef, P: PayloadDef<Inner>, Inner: PayloadInnerDef> {
    /// Not enough data available to read the current packet.
    /// This does not necessarily mean that a `brec` packet was detected but rather that
    /// additional data is required to determine its presence.
    ///
    /// `PacketBufReaderDef` may also return `NotEnoughData(0)` if a previous iteration
    /// was unable to read a `brec` header. In such cases, reading should continue.
    NotEnoughData(usize),

    /// Returned when `PacketBufReaderDef` is unable to obtain new data.
    /// If this result is received, there is no point in continuing the read operation
    /// as the data source appears to be exhausted.
    NoData,

    /// Returned if `PacketBufReaderDef` reads a segment of data but does not detect a `brec` packet.
    /// Reading may continue in the next iteration.
    ///
    /// If a non-`brec` segment is detected in the same iteration where a `brec` packet is found,
    /// `NoData` will not be returned. Instead, `NotEnoughData`, `Ignored`, or `Found` will be used.
    NotFound,

    /// Returned when `PacketBufReaderDef` recognizes a `brec` packet but it was ignored according to the rules.
    Skipped,

    /// Indicates successful parsing of a `brec` packet that has passed filtering rules (if any exist).
    Found(PacketDef<B, P, Inner>),
}
/// Internal structure used by `PacketBufReaderDef` when reading packet headers.
pub enum PacketHeaderState {
    /// Header was not found.
    NotFound,
    /// Not enough data available to read the header.
    NotEnoughData(usize, usize),
    /// Header was successfully read.
    ///
    /// Contains:
    /// - The parsed `PacketHeader`.
    /// - The position of the header within the provided data slice.
    Found(PacketHeader, RangeInclusive<usize>),
}

/// Internal structure used by `PacketBufReaderDef` when reading packet headers.
/// This structure is utilized in rare cases when there is insufficient data to read a header.
pub enum HeaderReadState {
    /// The header has been successfully read.
    Ready(Option<PacketHeader>),
    /// More data is required.
    ///
    /// Contains:
    /// - A buffer storing previously received data.
    /// - The size of the missing data required to complete the header read.
    Refill(Option<(Vec<u8>, usize)>),
    /// Default state. Indicates that no additional data loading is required for reading a header.
    Empty,
}

/// Internal structure used by `PacketBufReaderDef` for handling packet header resolution.
pub enum ResolveHeaderReady<B: BlockDef, P: PayloadDef<Inner>, Inner: PayloadInnerDef> {
    /// Indicates that the next action should be taken in processing.
    Next(NextPacket<B, P, Inner>),
    /// The packet header has been successfully resolved.
    Resolved(PacketHeader),
}

/// A stream reader for extracting `brec` packets.
///
/// `PacketBufReaderDef` supports reading from both "pure" streams containing only `brec` packets
/// and mixed streams where `brec` packets are interspersed with other data. The `Rules` mechanism
/// allows users to handle non-`brec` data instead of discarding it, enabling logging or reprocessing
/// if necessary.
///
/// Reader rules may also use a user-owned workflow context. Construct the reader with
/// [`PacketBufReaderDef::with_context`] to attach any diagnostics or control state to the reader.
/// `RuleDef::IgnoredControl` can inspect ignored bytes and return `IgnoredAction::Stop` to abort
/// scanning with `Error::IgnoredDataRejected`. `RuleDef::NextPacket` observes each non-error
/// `NextPacket` result before it is returned, which is useful for collecting stream health metrics such
/// as good packets versus ignored bytes.
///
/// It is important to note that there is no need to use `PacketBufReaderDef` directly.
/// When invoking the `generate!()` macro, a wrapper type `PacketBufReader<R: std::io::Read, WorkflowCtx = ()>`
/// is generated, eliminating the requirement to specify all generic parameters manually. Users should
/// prefer `PacketBufReader` when creating a reader instance.
///
/// The generic parameters `<B, BR, P, Inner>` are automatically bound to the `Block` and `Payload`
/// types defined by the user using the corresponding `#[block]` and `#[payload]` macros.
/// This abstraction frees the user from the need to explicitly propagate these types.
pub struct PacketBufReaderDef<
    'a,
    R: std::io::Read,
    B: BlockDef,
    BR: BlockReferredDef<B>,
    P: PayloadDef<Inner>,
    Inner: PayloadInnerDef,
    WorkflowCtx = (),
> {
    /// Buffered reader for handling input stream operations.
    inner: std::io::BufReader<&'a mut R>,
    /// Collection of processing rules applied to incoming data.
    rules: RulesDef<B, BR, P, Inner, WorkflowCtx>,
    /// User-owned workflow context available to reader rules.
    workflow: WorkflowCtx,
    /// Stores the current state of the header reading process.
    recent: HeaderReadState,
    /// Internal buffer for accumulating data before processing.
    buffered: Vec<u8>,
}

impl<
    'a,
    R: std::io::Read,
    B: BlockDef,
    BR: BlockReferredDef<B>,
    P: PayloadDef<Inner>,
    Inner: PayloadInnerDef,
    WorkflowCtx,
> PacketBufReaderDef<'a, R, B, BR, P, Inner, WorkflowCtx>
{
    /// Parses a packet header from the provided buffer.
    ///
    /// This function attempts to locate the `brec` packet signature in the given byte slice.
    /// If a signature is found but there is insufficient data to parse the full header,
    /// it returns `PacketHeaderState::NotEnoughData`. If the header is successfully parsed,
    /// it returns `PacketHeaderState::Found`.
    fn read_header(buffer: &[u8]) -> Result<PacketHeaderState, Error> {
        let mut first_not_enough: Option<(usize, usize)> = None;
        let mut base = 0usize;
        while base < buffer.len() {
            let Some(relative) = PacketHeader::get_pos(&buffer[base..]) else {
                break;
            };
            let offset = base + relative;
            if let Some(needed) = PacketHeader::is_not_enought(&buffer[offset..]) {
                if first_not_enough.is_none() {
                    first_not_enough = Some((offset, needed));
                }
                base = offset + 1;
                continue;
            }
            match PacketHeader::read_from_slice(&buffer[offset..], false) {
                Ok(header) => {
                    return Ok(PacketHeaderState::Found(
                        header,
                        RangeInclusive::new(offset, offset + PacketHeader::ssize() as usize),
                    ));
                }
                // Litter can accidentally contain a packet signature; continue searching.
                Err(Error::SignatureDismatch(_)) | Err(Error::CrcDismatch) => {
                    base = offset + 1;
                }
                Err(err) => return Err(err),
            }
        }
        if let Some((from, needed)) = first_not_enough {
            Ok(PacketHeaderState::NotEnoughData(from, needed))
        } else {
            // Signature of PacketDef isn't found
            Ok(PacketHeaderState::NotFound)
        }
    }

    /// Clears the internal buffer and consumes a specified number of bytes from the reader.
    ///
    /// This function is used to maintain the correct reading position while ensuring
    /// that previously processed data does not interfere with subsequent reads.
    fn drop_and_consume(
        &mut self,
        consume: Option<usize>,
        result: Result<NextPacket<B, P, Inner>, Error>,
    ) -> Result<NextPacket<B, P, Inner>, Error> {
        self.buffered.clear();
        if let Some(s) = consume {
            self.inner.consume(s)
        }
        match result {
            Ok(next) => self.emit_next(next),
            Err(err) => Err(err),
        }
    }

    fn emit_next(
        &mut self,
        next: NextPacket<B, P, Inner>,
    ) -> Result<NextPacket<B, P, Inner>, Error> {
        self.rules.next_packet(&next, &mut self.workflow)?;
        Ok(next)
    }

    /// Attempts to process a previously detected header when sufficient data is available.
    ///
    /// If enough data is present in the buffer, the method confirms the presence of the packet
    /// and returns `ResolveHeaderReady::Resolved`. Otherwise, it buffers additional data and
    /// signals `ResolveHeaderReady::Next` with `NotEnoughData`.
    fn resolve_header_ready(
        &mut self,
        header: PacketHeader,
    ) -> Result<ResolveHeaderReady<B, P, Inner>, Error> {
        if header.size > Inner::MAX_PACKET_LEN {
            return Err(Error::InvalidLength);
        }
        let buffer = self.inner.fill_buf()?;
        // Check do we have enough data to load packet
        let packet_size = header.size as usize;
        let available = self.buffered.len() + buffer.len();
        if packet_size > available {
            // Not enough data to load packet
            let consumed = buffer.len();
            self.buffered.extend_from_slice(buffer);
            self.inner.consume(consumed);
            self.recent = HeaderReadState::Ready(Some(header));
            return Ok(ResolveHeaderReady::Next(NextPacket::NotEnoughData(
                packet_size - available,
            )));
        }
        if packet_size < self.buffered.len() {
            return Err(Error::InvalidPacketReaderLogic);
        }
        let rest_data = packet_size - self.buffered.len();
        // Copy and consume only needed data
        self.buffered.extend_from_slice(&buffer[..rest_data]);
        self.inner.consume(rest_data);
        Ok(ResolveHeaderReady::Resolved(header))
    }

    /// Processes buffered data when more input is required to complete header parsing.
    ///
    /// This method is used in cases where an incomplete header was previously encountered.
    /// It attempts to read additional data and, if successful, resumes header parsing.
    fn resolve_header_refill(
        &mut self,
        mut buffer: Vec<u8>,
        needed: usize,
    ) -> Result<NextPacket<B, P, Inner>, Error> {
        let read_header = PacketBufReaderDef::<'a, R, B, BR, P, Inner>::read_header;
        let extracted = self.inner.fill_buf()?;
        let extracted_len = extracted.len();
        let buffered = buffer.len();
        let mut appended = extracted_len.min(needed);
        if appended > 0 {
            // First make attempt to read header with just enough newly received bytes.
            buffer.extend_from_slice(&extracted[..appended]);
        }
        let mut status = read_header(&buffer)?;
        if !matches!(status, PacketHeaderState::Found(_, _)) && appended < extracted_len {
            // If not found yet, include all currently available bytes and re-check.
            buffer.extend_from_slice(&extracted[appended..]);
            appended = extracted_len;
            status = read_header(&buffer)?;
        }
        let header_len = PacketHeader::ssize() as usize;
        match status {
            PacketHeaderState::Found(header, sgmt) => {
                if header.size > Inner::MAX_PACKET_LEN {
                    return Err(Error::InvalidLength);
                }
                let header_start = *sgmt.start();
                let header_end = *sgmt.end();
                if header_start > 0 {
                    self.rules
                        .ignore(&buffer[..header_start], &mut self.workflow)?;
                }
                let consumed_from_extracted = header_end.saturating_sub(buffered).min(appended);
                let consumed_front = buffered + consumed_from_extracted;
                let payload_prefetched = consumed_front
                    .saturating_sub(header_end)
                    .min(header.size as usize);
                let packet_end = header_end + header.size as usize;
                let ignored_tail_end = consumed_front.min(buffer.len());
                if packet_end < ignored_tail_end {
                    self.rules
                        .ignore(&buffer[packet_end..ignored_tail_end], &mut self.workflow)?;
                }
                self.buffered.clear();
                if payload_prefetched > 0 {
                    self.buffered
                        .extend_from_slice(&buffer[header_end..header_end + payload_prefetched]);
                }
                self.inner.consume(consumed_from_extracted);
                self.recent = HeaderReadState::Ready(Some(header));
                self.emit_next(NextPacket::NotEnoughData(0))
            }
            PacketHeaderState::NotEnoughData(from, needed) => {
                if appended == 0 {
                    self.rules.ignore(&buffer, &mut self.workflow)?;
                    return self.emit_next(NextPacket::NoData);
                }
                if from > 0 {
                    // We can drain most bytes in buffer and left only length of header signature
                    self.rules.ignore(&buffer[..from], &mut self.workflow)?;
                    buffer.drain(..from);
                }
                self.inner.consume(appended);
                self.recent = HeaderReadState::Refill(Some((buffer, needed)));
                self.emit_next(NextPacket::NotEnoughData(needed))
            }
            PacketHeaderState::NotFound => {
                if appended == 0 {
                    self.rules.ignore(&buffer, &mut self.workflow)?;
                    return self.emit_next(NextPacket::NoData);
                }
                if buffer.len() > header_len {
                    self.rules
                        .ignore(&buffer[..buffer.len() - header_len], &mut self.workflow)?;
                    // We can drain most bytes in buffer and left only length of header signature
                    buffer.drain(..(buffer.len() - header_len));
                }
                self.inner.consume(appended);
                self.recent = HeaderReadState::Refill(Some((buffer, header_len)));
                self.emit_next(NextPacket::NotFound)
            }
        }
    }

    /// Creates a new reader with an explicit workflow context.
    ///
    /// The workflow context is independent from `ProtocolSchema::Context`: protocol context is passed
    /// to `read(ctx)` for payload decoding, while workflow context is owned by the reader and passed
    /// to workflow-oriented rules such as `RuleDef::IgnoredControl` and `RuleDef::NextPacket`.
    pub fn with_context(inner: &'a mut R, workflow: WorkflowCtx) -> Self {
        Self {
            inner: std::io::BufReader::new(inner),
            rules: RulesDef::default(),
            workflow,
            recent: HeaderReadState::Empty,
            buffered: Vec::with_capacity(
                Inner::INITIAL_PACKET_BUFFER_CAPACITY.min(Inner::MAX_PAYLOAD_LEN as usize),
            ),
        }
    }

    /// Returns an immutable reference to the reader workflow context.
    pub fn context(&self) -> &WorkflowCtx {
        &self.workflow
    }

    /// Returns a mutable reference to the reader workflow context.
    pub fn context_mut(&mut self) -> &mut WorkflowCtx {
        &mut self.workflow
    }

    /// Consumes the reader and returns its workflow context.
    pub fn into_context(self) -> WorkflowCtx {
        self.workflow
    }

    /// Adds a processing rule. See `RuleDef` for more details.
    pub fn add_rule(&mut self, rule: RuleDef<B, BR, P, Inner, WorkflowCtx>) -> Result<(), Error> {
        self.rules.add_rule(rule)
    }

    /// Removes a previously added rule. See `RuleDef` for more details.
    pub fn remove_rule(&mut self, rule: RuleDefId) {
        self.rules.remove_rule(rule);
    }

    /// Reads the current portion of data available in the internal `BufReader`.
    ///
    /// This method does **not** invoke `read` or otherwise fetch additional data into the internal buffer.
    /// Instead, it processes only the existing buffered data. However, `consume` **will be called** to advance
    /// the read position.
    ///
    /// To continue reading, the user must call `read` on `PacketBufReaderDef` again to process more data.
    pub fn read(
        &mut self,
        ctx: &mut <Inner as ProtocolSchema>::Context<'_>,
    ) -> Result<NextPacket<B, P, Inner>, Error> {
        let recent = std::mem::replace(&mut self.recent, HeaderReadState::Empty);
        let (packet_buffer, header, consume) = match recent {
            HeaderReadState::Ready(Some(header)) => match self.resolve_header_ready(header)? {
                ResolveHeaderReady::Next(next) => return self.emit_next(next),
                ResolveHeaderReady::Resolved(header) => (self.buffered.as_slice(), header, None),
            },
            HeaderReadState::Refill(Some((buffer, needed))) => {
                return self.resolve_header_refill(buffer, needed);
            }
            HeaderReadState::Empty => {
                self.buffered.clear();
                let buffer = self.inner.fill_buf()?;
                if buffer.is_empty() {
                    return self.emit_next(NextPacket::NoData);
                }
                let available = buffer.len();
                if available < PacketHeader::ssize() as usize {
                    let needed = (PacketHeader::ssize() as usize) - available;
                    let mut data: Vec<u8> = Vec::with_capacity(available);
                    data.extend_from_slice(buffer);
                    self.recent = HeaderReadState::Refill(Some((data, needed)));
                    self.inner.consume(available);
                    return self.emit_next(NextPacket::NotEnoughData(needed));
                }
                match PacketBufReaderDef::<'a, R, B, BR, P, Inner>::read_header(buffer)? {
                    PacketHeaderState::NotFound => {
                        let header_len = PacketHeader::ssize() as usize;
                        if available > header_len {
                            self.rules
                                .ignore(&buffer[..available - header_len], &mut self.workflow)?;
                            self.recent = HeaderReadState::Refill(Some((
                                buffer[available - header_len..].to_vec(),
                                header_len,
                            )));
                        } else {
                            self.recent =
                                HeaderReadState::Refill(Some((buffer.to_vec(), header_len)));
                        }
                        self.inner.consume(available);
                        return self.emit_next(NextPacket::NotFound);
                    }
                    PacketHeaderState::NotEnoughData(from, needed) => {
                        // Not enough data to read packet header
                        if from > 0 {
                            self.rules.ignore(&buffer[..from], &mut self.workflow)?;
                        }
                        let mut data: Vec<u8> = Vec::with_capacity(buffer.len() - from);
                        data.extend_from_slice(&buffer[from..]);
                        self.recent = HeaderReadState::Refill(Some((data, needed)));
                        self.inner.consume(available);
                        return self.emit_next(NextPacket::NotEnoughData(needed));
                    }
                    PacketHeaderState::Found(header, sgmt) => {
                        if header.size > Inner::MAX_PACKET_LEN {
                            return Err(Error::InvalidLength);
                        }
                        // PacketDef header has been found
                        if sgmt.start() > &0 {
                            self.rules
                                .ignore(&buffer[..*sgmt.start()], &mut self.workflow)?;
                        }
                        let packet_size = header.size as usize;
                        let needs = packet_size + *sgmt.end();
                        if needs > available {
                            // Not enough data to load packet
                            self.buffered.extend_from_slice(&buffer[*sgmt.end()..]);
                            self.inner.consume(available);
                            self.recent = HeaderReadState::Ready(Some(header));
                            return self.emit_next(NextPacket::NotEnoughData(needs - available));
                        }
                        let consume = Some(*sgmt.end() + header.size as usize);
                        (
                            &buffer[*sgmt.end()..*sgmt.end() + header.size as usize],
                            header,
                            consume,
                        )
                    }
                }
            }
            _error => {
                // We cannot be in this situation, because recent switched to
                // HeaderReadState::Empty by default
                return Err(Error::InvalidPacketReaderLogic);
            }
        };
        let blocks_len = header.blocks_len as usize;
        let blocks_buffer = &packet_buffer[..blocks_len];
        let mut blocks = Vec::new();
        let mut processed = 0;
        let mut count = 0;
        if !blocks_buffer.is_empty() {
            loop {
                if count == MAX_BLOCKS_COUNT {
                    self.buffered.clear();
                    return Err(Error::MaxBlocksCount);
                }
                let blk = match BR::read_from_slice(&blocks_buffer[processed..], false) {
                    Ok(blk) => blk,
                    Err(err) => {
                        return self.drop_and_consume(consume, Err(err));
                    }
                };
                if blk.size() == 0 {
                    return self.drop_and_consume(consume, Err(Error::ZeroLengthBlock));
                }
                processed += blk.size() as usize;
                count += 1;
                blocks.push(blk);
                if processed == blocks_buffer.len() {
                    break;
                }
            }
        }
        if !self.rules.prefilter(&blocks) {
            // PacketDef marked as ignored
            return self.drop_and_consume(consume, Ok(NextPacket::Skipped));
        }
        // Loading payload if exists
        let pkg = if header.payload {
            let mut payload_buffer = &packet_buffer[blocks_len..];
            match <PayloadHeader as TryReadFromBuffered>::try_read::<_, Inner>(&mut payload_buffer)
            {
                Ok(ReadStatus::Success(payload_header)) => {
                    if let Err(err) = header.validate_payload(&payload_header) {
                        return self.drop_and_consume(consume, Err(err));
                    }
                    let mut payload_buffer = &packet_buffer[blocks_len + payload_header.size()..];
                    if !self.rules.filter_payload(payload_buffer) {
                        // PacketDef marked as ignored
                        return self.drop_and_consume(consume, Ok(NextPacket::Skipped));
                    }
                    match <P as TryExtractPayloadFromBuffered<Inner>>::try_read(
                        &mut payload_buffer,
                        &payload_header,
                        ctx,
                    )? {
                        ReadStatus::Success(payload) => PacketDef::new(
                            blocks.into_iter().map(|blk| blk.into()).collect::<Vec<B>>(),
                            Some(payload),
                        ),
                        ReadStatus::NotEnoughData(needed) => {
                            // This is error, but not NextPacket::NotEnoughData because length of payload
                            // already has been check. If we are here - some data is invalid and
                            // it's an error
                            return self.drop_and_consume(
                                consume,
                                Err(Error::NotEnoughData(needed as usize)),
                            );
                        }
                    }
                }
                Ok(ReadStatus::NotEnoughData(needed)) => {
                    // This is error, but not NextPacket::NotEnoughData because length of payload
                    // already has been check. If we are here - some data is invalid and
                    // it's an error
                    return self
                        .drop_and_consume(consume, Err(Error::NotEnoughData(needed as usize)));
                }
                Err(err) => {
                    return self.drop_and_consume(consume, Err(err));
                }
            }
        } else {
            PacketDef::new(
                blocks.into_iter().map(|blk| blk.into()).collect::<Vec<B>>(),
                None,
            )
        };
        if !self.rules.filter_packet(&pkg) {
            // PacketDef marked as ignored
            self.drop_and_consume(consume, Ok(NextPacket::Skipped))
        } else {
            self.drop_and_consume(consume, Ok(NextPacket::Found(pkg)))
        }
    }
}

impl<
    'a,
    R: std::io::Read,
    B: BlockDef,
    BR: BlockReferredDef<B>,
    P: PayloadDef<Inner>,
    Inner: PayloadInnerDef,
> PacketBufReaderDef<'a, R, B, BR, P, Inner, ()>
{
    /// Creates a new reader with an empty workflow context.
    ///
    /// Use `with_context(inner, workflow)` when reader rules need to store diagnostics or control
    /// state while scanning mixed streams.
    pub fn new(inner: &'a mut R) -> Self {
        Self::with_context(inner, ())
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::{RuleDef, RuleFnDef, tests::*};
    use std::io::Cursor;
    use std::sync::{
        Arc, Mutex,
        atomic::{AtomicUsize, Ordering},
    };

    type ReaderUnderTest<'a> =
        PacketBufReaderDef<'a, Cursor<Vec<u8>>, TestBlock, TestBlock, TestPayload, TestPayload>;
    type ReaderWithContext<'a, Ctx> = PacketBufReaderDef<
        'a,
        Cursor<Vec<u8>>,
        TestBlock,
        TestBlock,
        TestPayload,
        TestPayload,
        Ctx,
    >;

    fn empty_packet_bytes() -> Vec<u8> {
        let header = PacketHeader::from_lengths(0, 0, false);
        let mut out = Vec::new();
        header.write_all(&mut out).expect("packet header write");
        out
    }

    #[test]
    fn read_header_handles_not_found_not_enough_and_found() {
        assert!(matches!(
            ReaderUnderTest::read_header(&[1, 2, 3, 4]).expect("read_header"),
            PacketHeaderState::NotFound
        ));

        let mut partial = empty_packet_bytes();
        partial.truncate((PacketHeader::ssize() as usize).saturating_sub(1));
        assert!(matches!(
            ReaderUnderTest::read_header(&partial).expect("read_header"),
            PacketHeaderState::NotEnoughData(_, _)
        ));

        let mut with_prefix = vec![9, 9, 9];
        with_prefix.extend_from_slice(&empty_packet_bytes());
        match ReaderUnderTest::read_header(&with_prefix).expect("read_header found") {
            PacketHeaderState::Found(_, range) => assert_eq!(*range.start(), 3),
            PacketHeaderState::NotFound | PacketHeaderState::NotEnoughData(_, _) => {
                panic!("expected found header")
            }
        }
    }

    #[test]
    fn read_skips_false_signature_in_litter_and_finds_real_packet() {
        let valid = empty_packet_bytes();
        let mut false_sig_tail = crate::PACKET_SIG.to_vec();
        false_sig_tail.extend_from_slice(&[0xDE, 0xAD, 0xBE, 0xEF]);

        let mut input_bytes = vec![0x11, 0x22, 0x33];
        input_bytes.extend_from_slice(&false_sig_tail);
        input_bytes.extend_from_slice(&[0x44, 0x55, 0x66]);
        let litter_len = input_bytes.len();
        input_bytes.extend_from_slice(&valid);

        let mut input = Cursor::new(input_bytes);
        let mut reader = ReaderUnderTest::new(&mut input);

        let ignored = Arc::new(AtomicUsize::new(0));
        let ignored_c = ignored.clone();
        reader
            .add_rule(RuleDef::Ignored(RuleFnDef::Dynamic(Box::new(
                move |bytes| {
                    ignored_c.fetch_add(bytes.len(), Ordering::SeqCst);
                },
            ))))
            .expect("ignored callback");

        match reader.read(&mut ()).expect("first read") {
            NextPacket::Found(packet) => {
                assert!(packet.blocks.is_empty());
                assert!(packet.payload.is_none());
            }
            NextPacket::NotEnoughData(_)
            | NextPacket::NoData
            | NextPacket::NotFound
            | NextPacket::Skipped => panic!("expected Found"),
        }
        assert_eq!(ignored.load(Ordering::SeqCst), litter_len);

        assert!(matches!(
            reader.read(&mut ()).expect("second read"),
            NextPacket::NoData
        ));
    }

    #[test]
    fn read_stops_when_ignored_control_rejects_prefix() {
        let mut input_bytes = vec![0x11, 0x22, 0x33];
        input_bytes.extend_from_slice(&empty_packet_bytes());

        let mut input = Cursor::new(input_bytes);
        let mut reader = ReaderUnderTest::new(&mut input);
        reader
            .add_rule(RuleDef::IgnoredControl(RuleFnDef::Static(|_, _| {
                Ok(IgnoredAction::Stop)
            })))
            .expect("ignored control rule");

        assert!(matches!(
            reader.read(&mut ()),
            Err(Error::IgnoredDataRejected)
        ));
    }

    #[test]
    fn read_calls_next_packet_rule_before_returning_results() {
        let mut input = Cursor::new(empty_packet_bytes());
        let mut reader = ReaderUnderTest::new(&mut input);

        let results = Arc::new(Mutex::new(Vec::<&'static str>::new()));
        let results_c = results.clone();
        reader
            .add_rule(RuleDef::NextPacket(RuleFnDef::Dynamic(Box::new(
                move |next, _| {
                    let name = match next {
                        NextPacket::NotEnoughData(_) => "not_enough",
                        NextPacket::NoData => "no_data",
                        NextPacket::NotFound => "not_found",
                        NextPacket::Skipped => "skipped",
                        NextPacket::Found(_) => "found",
                    };
                    results_c.lock().expect("results lock").push(name);
                    Ok(())
                },
            ))))
            .expect("next packet rule");

        assert!(matches!(
            reader.read(&mut ()).expect("first read"),
            NextPacket::Found(_)
        ));
        assert!(matches!(
            reader.read(&mut ()).expect("second read"),
            NextPacket::NoData
        ));

        assert_eq!(
            *results.lock().expect("results lock"),
            vec!["found", "no_data"]
        );
    }

    #[test]
    fn read_rules_can_update_owned_workflow_context() {
        #[derive(Default)]
        struct Stats {
            ignored_bytes: usize,
            found: usize,
        }

        let mut input_bytes = vec![0x11, 0x22, 0x33];
        input_bytes.extend_from_slice(&empty_packet_bytes());

        let mut input = Cursor::new(input_bytes);
        let mut reader: ReaderWithContext<'_, Stats> =
            PacketBufReaderDef::with_context(&mut input, Stats::default());
        reader
            .add_rule(RuleDef::IgnoredControl(RuleFnDef::Static(
                |bytes, stats| {
                    stats.ignored_bytes += bytes.len();
                    Ok(IgnoredAction::Continue)
                },
            )))
            .expect("ignored control rule");
        reader
            .add_rule(RuleDef::NextPacket(RuleFnDef::Static(|next, stats| {
                if matches!(next, NextPacket::Found(_)) {
                    stats.found += 1;
                }
                Ok(())
            })))
            .expect("next packet rule");

        assert!(matches!(
            reader.read(&mut ()).expect("read"),
            NextPacket::Found(_)
        ));
        assert_eq!(reader.context().ignored_bytes, 3);
        assert_eq!(reader.context().found, 1);
    }

    #[test]
    fn read_detects_payload_length_outside_packet_before_extracting_payload() {
        let payload_header = PayloadHeader {
            sig: ByteBlock::Len4(*b"ABCD"),
            crc: ByteBlock::Len4([1, 2, 3, 4]),
            len: 1,
        };
        let packet_header = PacketHeader::from_lengths(0, payload_header.size() as u64, true);
        let mut bytes = Vec::new();
        packet_header
            .write_all(&mut bytes)
            .expect("packet header write");
        bytes.extend_from_slice(&payload_header.as_vec());

        let mut input = Cursor::new(bytes);
        let mut reader = ReaderUnderTest::new(&mut input);
        assert!(matches!(reader.read(&mut ()), Err(Error::InvalidLength)));
    }

    #[test]
    fn read_rejects_packet_size_larger_than_schema_max_before_buffering_body() {
        let packet_header = PacketHeader::from_lengths(TestPayload::MAX_PACKET_LEN + 1, 0, false);
        let mut bytes = Vec::new();
        packet_header
            .write_all(&mut bytes)
            .expect("packet header write");

        let mut input = Cursor::new(bytes);
        let mut reader = ReaderUnderTest::new(&mut input);
        assert!(matches!(reader.read(&mut ()), Err(Error::InvalidLength)));
    }

    #[test]
    fn read_header_returns_first_not_enough_when_multiple_candidates_are_short() {
        let mut buffer = vec![0xA1, 0xA2];
        buffer.extend_from_slice(&crate::PACKET_SIG);
        buffer.extend_from_slice(&[0xB1, 0xB2, 0xB3]);
        buffer.extend_from_slice(&crate::PACKET_SIG);
        buffer.extend_from_slice(&[0xC1, 0xC2]);

        let first = PacketHeader::get_pos(&buffer).expect("first signature");
        let second = PacketHeader::get_pos(&buffer[first + 1..]).expect("second signature");
        let second = first + 1 + second;
        let expected = PacketHeader::ssize() as usize - (buffer.len() - first);

        // Phase 1: the first candidate is short, so reader reports NotEnoughData from it.
        match ReaderUnderTest::read_header(&buffer).expect("read_header not enough") {
            PacketHeaderState::NotEnoughData(from, needed) => {
                assert_eq!(from, first);
                assert_eq!(needed, expected);
                assert!(second > first);
            }
            PacketHeaderState::Found(_, _) | PacketHeaderState::NotFound => {
                panic!("expected NotEnoughData")
            }
        }

        // Phase 2: complete the second candidate into a valid header.
        let valid = empty_packet_bytes();
        let needed_len = second + valid.len();
        if buffer.len() < needed_len {
            buffer.resize(needed_len, 0);
        }
        buffer[second..second + valid.len()].copy_from_slice(&valid);

        // First candidate is ignored and second is accepted.
        match ReaderUnderTest::read_header(&buffer).expect("read_header found") {
            PacketHeaderState::Found(_, range) => {
                assert_eq!(*range.start(), second);
            }
            PacketHeaderState::NotFound | PacketHeaderState::NotEnoughData(_, _) => {
                panic!("expected Found")
            }
        }
    }

    #[test]
    fn read_refill_eof_keeps_valid_packet_from_buffer() {
        let valid = empty_packet_bytes();
        let before = vec![0xAB, 0xCD, 0xEF];
        let after = vec![0x42, 0x24];

        let mut refill_buffer = Vec::with_capacity(before.len() + valid.len() + after.len());
        refill_buffer.extend_from_slice(&before);
        refill_buffer.extend_from_slice(&valid);
        refill_buffer.extend_from_slice(&after);

        let mut input = Cursor::new(Vec::<u8>::new());
        let mut reader = ReaderUnderTest::new(&mut input);
        reader.recent = HeaderReadState::Refill(Some((refill_buffer, 11)));

        let ignored = Arc::new(AtomicUsize::new(0));
        let ignored_c = ignored.clone();
        reader
            .add_rule(RuleDef::Ignored(RuleFnDef::Dynamic(Box::new(
                move |bytes| {
                    ignored_c.fetch_add(bytes.len(), Ordering::SeqCst);
                },
            ))))
            .expect("ignored callback");

        assert!(matches!(
            reader.read(&mut ()).expect("refill at eof"),
            NextPacket::NotEnoughData(0)
        ));
        assert_eq!(ignored.load(Ordering::SeqCst), before.len() + after.len());

        match reader.read(&mut ()).expect("packet from refill buffer") {
            NextPacket::Found(packet) => {
                assert!(packet.blocks.is_empty());
                assert!(packet.payload.is_none());
            }
            NextPacket::NotEnoughData(_)
            | NextPacket::NoData
            | NextPacket::NotFound
            | NextPacket::Skipped => panic!("expected Found"),
        }

        assert!(matches!(
            reader.read(&mut ()).expect("stream end"),
            NextPacket::NoData
        ));
    }

    #[test]
    fn read_refill_not_enough_with_prefix_ignores_prefix_and_consumes_new_data() {
        let mut refill_buffer = vec![0x11, 0x22];
        refill_buffer.extend_from_slice(&crate::PACKET_SIG);
        refill_buffer.push(0x33);

        let mut input = Cursor::new(vec![0x44, 0x55, 0x66, 0x77, 0x88]);
        let mut reader = ReaderUnderTest::new(&mut input);
        reader.recent =
            HeaderReadState::Refill(Some((refill_buffer, PacketHeader::ssize() as usize)));

        let ignored = Arc::new(AtomicUsize::new(0));
        let ignored_c = ignored.clone();
        reader
            .add_rule(RuleDef::Ignored(RuleFnDef::Dynamic(Box::new(
                move |bytes| {
                    ignored_c.fetch_add(bytes.len(), Ordering::SeqCst);
                },
            ))))
            .expect("ignored callback");

        match reader.read(&mut ()).expect("refill read") {
            NextPacket::NotEnoughData(needed) => assert!(needed > 0),
            NextPacket::Found(_)
            | NextPacket::NoData
            | NextPacket::NotFound
            | NextPacket::Skipped => panic!("expected NotEnoughData"),
        }
        assert_eq!(ignored.load(Ordering::SeqCst), 2);
        assert_eq!(input.position() as usize, 5);
    }

    #[test]
    fn read_refill_not_found_with_new_data_keeps_only_signature_tail() {
        let initial = vec![0xAA, 0xBB, 0xCC];
        let header_len = PacketHeader::ssize() as usize;
        let extracted = vec![0x10; header_len + 5];

        let mut input = Cursor::new(extracted.clone());
        let mut reader = ReaderUnderTest::new(&mut input);
        reader.recent = HeaderReadState::Refill(Some((initial.clone(), header_len)));

        let ignored = Arc::new(AtomicUsize::new(0));
        let ignored_c = ignored.clone();
        reader
            .add_rule(RuleDef::Ignored(RuleFnDef::Dynamic(Box::new(
                move |bytes| {
                    ignored_c.fetch_add(bytes.len(), Ordering::SeqCst);
                },
            ))))
            .expect("ignored callback");

        assert!(matches!(
            reader.read(&mut ()).expect("refill not found"),
            NextPacket::NotFound
        ));
        assert_eq!(
            ignored.load(Ordering::SeqCst),
            initial.len() + extracted.len() - header_len
        );

        assert!(matches!(
            reader.read(&mut ()).expect("eof after tail"),
            NextPacket::NoData
        ));
        assert_eq!(
            ignored.load(Ordering::SeqCst),
            initial.len() + extracted.len()
        );
        drop(reader);
        assert_eq!(input.position() as usize, extracted.len());
    }

    #[test]
    fn read_preserves_full_ignored_bytes_sequence() {
        let packet = empty_packet_bytes();

        let litter_prefix = vec![0xA1, 0xB2, 0xC3, 0xD4];
        let mut litter_mid = vec![0x11, 0x22, 0x33];
        litter_mid.extend_from_slice(&crate::PACKET_SIG);
        litter_mid.extend_from_slice(&[0x44, 0x55, 0x66, 0x77]);
        let litter_suffix = vec![0xDE, 0xAD, 0xBE, 0xEF, 0x01];

        let mut stream = Vec::new();
        stream.extend_from_slice(&litter_prefix);
        stream.extend_from_slice(&packet);
        stream.extend_from_slice(&litter_mid);
        stream.extend_from_slice(&packet);
        stream.extend_from_slice(&litter_suffix);

        let mut expected_ignored = Vec::new();
        expected_ignored.extend_from_slice(&litter_prefix);
        expected_ignored.extend_from_slice(&litter_mid);
        expected_ignored.extend_from_slice(&litter_suffix);

        let mut input = Cursor::new(stream);
        let mut reader = ReaderUnderTest::new(&mut input);

        let ignored = Arc::new(Mutex::new(Vec::<u8>::new()));
        let ignored_c = ignored.clone();
        reader
            .add_rule(RuleDef::Ignored(RuleFnDef::Dynamic(Box::new(
                move |bytes| {
                    ignored_c
                        .lock()
                        .expect("ignored bytes lock")
                        .extend_from_slice(bytes);
                },
            ))))
            .expect("ignored callback");

        let mut found = 0usize;
        loop {
            match reader.read(&mut ()).expect("reader read") {
                NextPacket::Found(packet) => {
                    assert!(packet.blocks.is_empty());
                    assert!(packet.payload.is_none());
                    found += 1;
                }
                NextPacket::NotEnoughData(_) | NextPacket::NotFound | NextPacket::Skipped => {}
                NextPacket::NoData => break,
            }
        }

        assert_eq!(found, 2);
        assert_eq!(
            *ignored.lock().expect("ignored bytes lock"),
            expected_ignored
        );
    }

    #[test]
    fn read_emits_found_for_empty_packet_then_no_data() {
        let mut input = Cursor::new(empty_packet_bytes());
        let mut reader = ReaderUnderTest::new(&mut input);

        match reader.read(&mut ()).expect("first read") {
            NextPacket::Found(packet) => {
                assert!(packet.blocks.is_empty());
                assert!(packet.payload.is_none());
            }
            NextPacket::NotEnoughData(_)
            | NextPacket::NoData
            | NextPacket::NotFound
            | NextPacket::Skipped => panic!("expected Found"),
        }

        assert!(matches!(
            reader.read(&mut ()).expect("second read"),
            NextPacket::NoData
        ));
    }

    #[test]
    fn read_short_header_then_end_returns_not_enough_then_no_data() {
        let short_len = PacketHeader::ssize() as usize - 2;
        let mut input = Cursor::new(vec![0xAB; short_len]);
        let mut reader = ReaderUnderTest::new(&mut input);

        match reader.read(&mut ()).expect("first read") {
            NextPacket::NotEnoughData(needed) => assert_eq!(needed, 2),
            NextPacket::NoData
            | NextPacket::NotFound
            | NextPacket::Skipped
            | NextPacket::Found(_) => {
                panic!("expected NotEnoughData")
            }
        }

        assert!(matches!(
            reader.read(&mut ()).expect("second read"),
            NextPacket::NoData
        ));
    }

    #[test]
    fn read_can_skip_packet_with_prefilter_rule() {
        let mut input = Cursor::new(empty_packet_bytes());
        let mut reader = ReaderUnderTest::new(&mut input);
        reader
            .add_rule(RuleDef::Prefilter(RuleFnDef::Static(|_| false)))
            .expect("prefilter rule");

        assert!(matches!(
            reader.read(&mut ()).expect("read with prefilter"),
            NextPacket::Skipped
        ));
    }

    #[test]
    fn add_rule_duplicate_then_remove_allows_readd() {
        let mut input = Cursor::new(Vec::<u8>::new());
        let mut reader = ReaderUnderTest::new(&mut input);

        reader
            .add_rule(RuleDef::Prefilter(RuleFnDef::Static(|_| true)))
            .expect("first prefilter add");
        assert!(matches!(
            reader.add_rule(RuleDef::Prefilter(RuleFnDef::Static(|_| true))),
            Err(Error::RuleDuplicate)
        ));

        reader.remove_rule(RuleDefId::Prefilter);
        reader
            .add_rule(RuleDef::Prefilter(RuleFnDef::Static(|_| true)))
            .expect("prefilter re-add after remove");
    }
}