-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathlib.rs
1483 lines (1385 loc) · 48.8 KB
/
lib.rs
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
// Copyright (C) 2023 Matthew Waters <[email protected]>
//
// Licensed under the MIT license <LICENSE-MIT> or
// http://opensource.org/licenses/MIT>, at your option. This file may not be
// copied, modified, or distributed except according to those terms.
//! # cea708-types
//!
//! Provides the necessary infrastructure to read and write [DTVCCPacket]'s containing [Service]s
//! with various [tables::Code]s
//!
//! The reference for this implementation is the [ANSI/CTA-708-E R-2018](https://shop.cta.tech/products/digital-television-dtv-closed-captioning) specification.
use std::time::Duration;
use muldiv::MulDiv;
#[macro_use]
extern crate log;
pub mod tables;
/// Various possible errors when parsing data
#[derive(Debug, Clone, Copy, PartialEq, Eq, thiserror::Error)]
pub enum ParserError {
/// Length of data does not match length advertised
#[error("The length of the data ({actual}) does not match the advertised expected ({expected}) length")]
LengthMismatch {
/// The expected size
expected: usize,
/// The actual size
actual: usize,
},
/// CEA-608 comaptibility bytes encountered after CEA-708
#[error("CEA-608 compatibility bytes were found after CEA-708 bytes at position {byte_pos}")]
Cea608AfterCea708 {
/// Position of the offending bytes
byte_pos: usize,
},
}
/// An error enum returned when writing data fails
#[derive(Debug, Clone, Copy, PartialEq, Eq, thiserror::Error)]
pub enum WriterError {
/// Writing would overflow by how many bytes
#[error("Writing the data would overflow by {0} bytes")]
WouldOverflow(usize),
/// It is not possible to write to this resource
#[error("The resource is not writable")]
ReadOnly,
}
impl From<tables::CodeError> for ParserError {
fn from(err: tables::CodeError) -> Self {
match err {
tables::CodeError::LengthMismatch { expected, actual } => {
ParserError::LengthMismatch { expected, actual }
}
}
}
}
/// Represents a CEA-608 compatibility byte pair
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum Cea608 {
Field1(u8, u8),
Field2(u8, u8),
}
#[derive(Debug, Default)]
pub struct CCDataParser {
pending_data: Vec<u8>,
packets: Vec<DTVCCPacket>,
cea608: Option<Vec<Cea608>>,
have_initial_ccp_header: bool,
ccp_bytes_needed: usize,
}
impl CCDataParser {
/// Create a new [CCDataParser]
pub fn new() -> Self {
Self::default()
}
pub fn handle_cea608(&mut self) {
self.cea608 = Some(vec![]);
}
/// Push a complete `cc_data` packet into the parser for processing.
///
/// Will fail with [ParserError::LengthMismatch] if the length of the data does not match the
/// number of cc triples specified in the `cc_data` header.
///
/// Ignores any CEA-608 data provided at the start of the data. Any CEA-608 data provided
/// after valid CEA-708 data will return [ParserError::Cea608AfterCea708].
pub fn push(&mut self, data: &[u8]) -> Result<(), ParserError> {
trace!("parsing {data:?}");
if let Some(ref mut cea608) = self.cea608 {
cea608.clear();
}
if data.len() < 5 {
// enough for 2 byte header plus 1 byte triple
return Ok(());
}
let process_cc_data_flag = data[0] & 0x40 > 0;
if !process_cc_data_flag {
return Ok(());
}
let cc_count = data[0] & 0x1F;
if cc_count == 0 {
return Ok(());
}
trace!("cc_count: {cc_count}, len = {}", data.len());
if (cc_count * 3 + 2) as usize != data.len() {
return Err(ParserError::LengthMismatch {
expected: (cc_count * 3 + 1) as usize,
actual: data.len(),
});
}
let mut ccp_data = {
let mut in_dtvcc = false;
let mut ccp_data = vec![];
// re-add first byte to pending_data
let pending_data = {
let mut ret = vec![];
for (i, d) in self.pending_data.chunks(2).enumerate() {
if i == 0 {
ret.push(0xFF);
} else {
ret.push(0xFE);
}
ret.extend(d);
if d.len() == 1 {
ret.push(0x00);
}
}
ret
};
// find the start of ccp in data
let ccp_offset = 2
+ {
let mut ret = None;
for (i, triple) in data[2..].chunks_exact(3).enumerate() {
let cc_valid = (triple[0] & 0x04) == 0x04;
let cc_type = triple[0] & 0x3;
trace!(
"byte:{} triple 0x{:02x} 0x{:02x} 0x{:02x}. valid: {cc_valid}, type: {cc_type}",
i * 3,
triple[0],
triple[1],
triple[2]
);
if (cc_type & 0b10) > 0 {
in_dtvcc = true;
}
if !cc_valid {
continue;
}
if !in_dtvcc && (cc_type == 0b00 || cc_type == 0b01) {
trace!(
"have cea608 bytes type {cc_type} 0x{:02x} 0x{:02x}",
triple[1],
triple[2]
);
if let Some(ref mut cea608) = self.cea608 {
let pair = match cc_type {
0b00 => Cea608::Field1(triple[1], triple[2]),
0b01 => Cea608::Field2(triple[1], triple[2]),
_ => unreachable!(),
};
cea608.push(pair);
}
continue;
}
if in_dtvcc && (cc_type == 0b00 || cc_type == 0b01) {
// invalid packet construction;
warn!("cea608 bytes after cea708 data at byte:{}", i * 3);
return Err(ParserError::Cea608AfterCea708 { byte_pos: i * 3 });
}
if ret.is_none() {
ret = Some(i * 3);
}
}
if let Some(ret) = ret {
ret
} else {
// no data to process
return Ok(());
}
};
trace!("ccp offset in input data is at index {ccp_offset}");
let mut data_iter = pending_data.iter().chain(data[ccp_offset..].iter());
let mut i = 0;
in_dtvcc = false;
loop {
let byte0 = data_iter.next();
let byte1 = data_iter.next();
let byte2 = data_iter.next();
i += 3;
if let (Some(byte0), Some(byte1), Some(byte2)) = (byte0, byte1, byte2) {
let cc_valid = (byte0 & 0x04) == 0x04;
let cc_type = byte0 & 0x3;
if (cc_type & 0b10) > 0 {
in_dtvcc = true;
}
if !cc_valid {
continue;
}
if !in_dtvcc && (cc_type == 0b00 || cc_type == 0b01) {
// 608-in-708 data should not be hit as we skip over it
unreachable!();
}
if (cc_type & 0b11) == 0b11 {
trace!("found ccp header at index {}", i - 3);
self.have_initial_ccp_header = true;
// a header byte truncates the size of any previous packet
match DTVCCPacket::parse(&ccp_data) {
Ok(packet) => self.packets.push(packet),
Err(ParserError::LengthMismatch { .. }) => (),
Err(e) => {
eprintln!("{e:?}");
unreachable!()
}
}
in_dtvcc = false;
ccp_data = vec![];
let (_seq_no, packet_len) = DTVCCPacket::parse_hdr_byte(*byte1);
trace!("waiting for {} dtvcc bytes", packet_len + 1);
self.ccp_bytes_needed = packet_len + 1;
}
if self.have_initial_ccp_header {
trace!("pushing 0x{:02x?}{:02x?}", byte1, byte2);
if self.ccp_bytes_needed > 0 {
ccp_data.push(*byte1);
self.ccp_bytes_needed -= 1;
}
if self.ccp_bytes_needed > 0 {
ccp_data.push(*byte2);
self.ccp_bytes_needed -= 1;
}
}
} else {
break;
}
}
ccp_data
};
if self.ccp_bytes_needed == 0 {
match DTVCCPacket::parse(&ccp_data) {
Ok(packet) => self.packets.push(packet),
Err(ParserError::LengthMismatch { .. }) => (),
_ => unreachable!(),
}
ccp_data = vec![];
}
self.pending_data = ccp_data;
Ok(())
}
/// Clear any internal buffers
pub fn flush(&mut self) {
*self = Self::default();
}
/// Pop a valid [DTVCCPacket] or None if no packet could be parsed
pub fn pop_packet(&mut self) -> Option<DTVCCPacket> {
let ret = self.packets.pop();
trace!("popped {ret:?}");
ret
}
pub fn cea608(&mut self) -> Option<&[Cea608]> {
if let Some(ref cea608) = self.cea608 {
Some(cea608)
} else {
None
}
}
}
/// A framerate. Framerates larger than 60fps are not well supported.
#[derive(Debug, Copy, Clone)]
pub struct Framerate {
numer: u32,
denom: u32,
}
impl Framerate {
/// Create a new [`Framerate`]
pub const fn new(numer: u32, denom: u32) -> Self {
Self { numer, denom }
}
/// The numerator of this [`Framerate`] fraction
pub fn numer(&self) -> u32 {
self.numer
}
/// The denominator of this [`Framerate`] fraction
pub fn denom(&self) -> u32 {
self.denom
}
fn cea608_pairs_per_field(&self) -> usize {
// CEA-608 has a max bitrate of 960 bits/s for a single field
// TODO: handle alternating counts for 24fps
60.mul_div_round(self.denom, self.numer).unwrap() as usize
}
fn max_cc_count(&self) -> usize {
// CEA-708 has a max bitrate of 9_600 bits/s
600.mul_div_round(self.denom, self.numer).unwrap() as usize
}
}
/// A struct for writing cc_data packets
#[derive(Debug, Default)]
pub struct CCDataWriter {
// settings
output_cea608_padding: bool,
output_padding: bool,
// state
packets: Vec<DTVCCPacket>,
// part of a packet we could not fit into the previous packet
pending_packet_data: Vec<u8>,
cea608_1: Vec<(u8, u8)>,
cea608_2: Vec<(u8, u8)>,
last_cea608_was_field1: bool,
}
impl CCDataWriter {
/// Whether to output padding CEA-608 bytes when not enough enough data has been provided
pub fn set_output_cea608_padding(&mut self, output_cea608_padding: bool) {
self.output_cea608_padding = output_cea608_padding;
}
/// Whether padding CEA-608 bytes will be used
pub fn output_cea608_padding(&self) -> bool {
self.output_cea608_padding
}
/// Whether to output padding data in the CCP bitstream when not enough data has been provided
pub fn set_output_padding(&mut self, output_padding: bool) {
self.output_padding = output_padding;
}
/// Whether padding data will be produced in the CCP
pub fn output_padding(&self) -> bool {
self.output_padding
}
/// Push a [`DTVCCPacket`] for writing
pub fn push_packet(&mut self, packet: DTVCCPacket) {
self.packets.push(packet)
}
/// Push a [`Cea608`] byte pair for writing
pub fn push_cea608(&mut self, cea608: Cea608) {
match cea608 {
Cea608::Field1(byte0, byte1) => self.cea608_1.push((byte0, byte1)),
Cea608::Field2(byte0, byte1) => self.cea608_2.push((byte0, byte1)),
}
}
/// Clear all stored data
pub fn flush(&mut self) {
self.packets.clear();
self.pending_packet_data.clear();
self.cea608_1.clear();
self.cea608_2.clear();
}
/// The amount of time that is currently stored for CEA-608 field 1 data
pub fn buffered_cea608_field1_duration(&self) -> Duration {
// CEA-608 has a max bitrate of 60000 * 2 / 1001 bytes/s
Duration::from_micros(
(self.cea608_1.len() as u64)
.mul_div_ceil(1001 * 1_000_000, 60000)
.unwrap(),
)
}
/// The amount of time that is currently stored for CEA-608 field 2 data
pub fn buffered_cea608_field2_duration(&self) -> Duration {
// CEA-608 has a max bitrate of 60000 * 2 / 1001 bytes/s
Duration::from_micros(
(self.cea608_2.len() as u64)
.mul_div_ceil(1001 * 1_000_000, 60000)
.unwrap(),
)
}
fn buffered_packet_bytes(&self) -> usize {
self.pending_packet_data.len()
+ self
.packets
.iter()
.map(|packet| packet.len())
.sum::<usize>()
}
/// The amount of time that is currently stored for CCP data
pub fn buffered_packet_duration(&self) -> Duration {
// CEA-708 has a max bitrate of 9600000 / 1001 bits/s
Duration::from_micros(
((self.buffered_packet_bytes() + 1) as u64 / 2)
.mul_div_ceil(2 * 1001 * 1_000_000, 9_600_000 / 8)
.unwrap(),
)
}
/// Write the next cc_data packet taking the next relevant CEA-608 byte pairs and
/// [`DTVCCPacket`]s. The framerate provided determines how many bytes are written.
pub fn write<W: std::io::Write>(
&mut self,
framerate: Framerate,
w: &mut W,
) -> Result<(), std::io::Error> {
let mut cea608_pair_rem = if self.output_cea608_padding {
framerate.cea608_pairs_per_field()
} else {
framerate
.cea608_pairs_per_field()
.min(self.cea608_1.len().max(self.cea608_2.len() * 2))
};
let mut cc_count_rem = if self.output_padding {
framerate.max_cc_count()
} else {
framerate.max_cc_count().min(
cea608_pair_rem
+ self.pending_packet_data.len() / 3
+ self.packets.iter().map(|p| p.cc_count()).sum::<usize>(),
)
};
trace!("writing with cc_count: {cc_count_rem} and {cea608_pair_rem} cea608 pairs");
let reserved = 0x80;
let process_cc_flag = 0x40;
w.write_all(&[
reserved | process_cc_flag | (cc_count_rem & 0x1f) as u8,
0xFF,
])?;
while cc_count_rem > 0 {
if cea608_pair_rem > 0 {
if !self.last_cea608_was_field1 {
trace!("attempting to write a cea608 byte pair from field 1");
if let Some((byte0, byte1)) = self.cea608_1.pop() {
w.write_all(&[0xFC, byte0, byte1])?;
cc_count_rem -= 1;
} else if !self.cea608_2.is_empty() {
// need to write valid field 0 if we are going to write field 1
w.write_all(&[0xFC, 0x80, 0x80])?;
cc_count_rem -= 1;
} else if self.output_cea608_padding {
w.write_all(&[0xF8, 0x80, 0x80])?;
cc_count_rem -= 1;
}
self.last_cea608_was_field1 = true;
} else {
trace!("attempting to write a cea608 byte pair from field 2");
if let Some((byte0, byte1)) = self.cea608_2.pop() {
w.write_all(&[0xFD, byte0, byte1])?;
cc_count_rem -= 1;
} else if self.output_cea608_padding {
w.write_all(&[0xF9, 0x80, 0x80])?;
cc_count_rem -= 1;
}
self.last_cea608_was_field1 = false;
}
cea608_pair_rem -= 1;
} else {
let mut current_packet_data = &mut self.pending_packet_data;
let mut packet_offset = 0;
while packet_offset >= current_packet_data.len() {
if let Some(packet) = self.packets.pop() {
trace!("starting packet {packet:?}");
packet.write_as_cc_data(&mut current_packet_data)?;
} else {
trace!("no packet to write");
break;
}
}
trace!("cea708 pending data length {}", current_packet_data.len(),);
while packet_offset < current_packet_data.len() && cc_count_rem > 0 {
assert!(current_packet_data.len() >= packet_offset + 3);
w.write_all(¤t_packet_data[packet_offset..packet_offset + 3])?;
packet_offset += 3;
cc_count_rem -= 1;
}
self.pending_packet_data = current_packet_data[packet_offset..].to_vec();
if self.packets.is_empty() && self.pending_packet_data.is_empty() {
// no more data to write
if self.output_padding {
trace!("writing {cc_count_rem} padding bytes");
while cc_count_rem > 0 {
w.write_all(&[0xFA, 0x00, 0x00])?;
cc_count_rem -= 1;
}
}
break;
}
}
}
Ok(())
}
}
/// A packet in the `cc_data` bitstream
#[derive(Debug)]
pub struct DTVCCPacket {
seq_no: u8,
services: Vec<Service>,
}
impl DTVCCPacket {
/// Create a new [DTVCCPacket] with the specified sequence number.
///
/// # Panics
///
/// * If seq_no >= 4
pub fn new(seq_no: u8) -> Self {
if seq_no > 3 {
panic!("DTVCCPacket sequence numbers must be between 0 and 3 inclusive, not {seq_no}");
}
Self {
seq_no,
services: vec![],
}
}
/// The sequence number of the DTVCCPacket
///
/// # Examples
/// ```
/// # use cea708_types::*;
/// let packet = DTVCCPacket::new(2);
/// assert_eq!(2, packet.sequence_no());
/// ```
pub fn sequence_no(&self) -> u8 {
self.seq_no
}
/// The amount of free space (in bytes) that can by placed inside this [DTVCCPacket]
pub fn free_space(&self) -> usize {
// 128 is the max size of a DTVCCPacket, minus 1 for the header
128 - self.len()
}
/// The number of bytes this [DTVCCPacket] will use when written to a byte stream.
///
/// # Examples
/// ```
/// # use cea708_types::{*, tables::*};
/// let mut packet = DTVCCPacket::new(2);
/// assert_eq!(0, packet.len());
/// let mut service = Service::new(1);
/// service.push_code(&Code::LatinCapitalA).unwrap();
/// packet.push_service(service);
/// assert_eq!(3, packet.len());
/// ```
pub fn len(&self) -> usize {
let services_len = self.services.iter().map(|s| s.len()).sum::<usize>();
if services_len > 0 {
1 + services_len
} else {
0
}
}
/// Push a completed service block into this [DTVCCPacket]
///
/// # Examples
/// ```
/// # use cea708_types::{*, tables::*};
/// let mut packet = DTVCCPacket::new(2);
/// assert_eq!(0, packet.len());
/// let mut service = Service::new(1);
/// service.push_code(&Code::LatinCapitalA).unwrap();
/// packet.push_service(service);
/// assert_eq!(3, packet.len());
/// ```
pub fn push_service(&mut self, service: Service) -> Result<(), WriterError> {
// TODO: fail if we would overrun max size
if service.len() > self.free_space() {
return Err(WriterError::WouldOverflow(
service.len() - self.free_space(),
));
}
self.services.push(service);
Ok(())
}
fn parse_hdr_byte(byte: u8) -> (u8, usize) {
let seq_no = (byte & 0xC0) >> 6;
let len = byte & 0x3F;
let len = if len == 0 {
127usize
} else {
((len as usize) * 2) - 1
};
(seq_no, len)
}
/// Parse bytes into a [DTVCCPacket]
///
/// Will return [ParserError::LengthMismatch] if the data is shorter than the length advertised in
/// the [DTVCCPacket] header.
///
/// Will return errors from [Service::parse] if parsing the contained [Service]s fails.
///
/// # Examples
/// ```
/// # use cea708_types::{*, tables::*};
/// let data = [0x02, 0x21, 0x41, 0x00];
/// let packet = DTVCCPacket::parse(&data).unwrap();
/// assert_eq!(3, packet.len());
/// assert_eq!(0, packet.sequence_no());
/// ```
pub fn parse(data: &[u8]) -> Result<Self, ParserError> {
if data.is_empty() {
return Err(ParserError::LengthMismatch {
expected: 1,
actual: 0,
});
}
let (seq_no, len) = Self::parse_hdr_byte(data[0]);
trace!(
"dtvcc seq:{seq_no} len {len} data {data_len}",
data_len = data.len()
);
if (len + 1) < data.len() {
return Err(ParserError::LengthMismatch {
expected: len + 1,
actual: data.len(),
});
}
let mut offset = 1;
let mut services = vec![];
while offset < data.len() {
let service = Service::parse(&data[offset..])?;
trace!("parsed service {service:?}, len:{}", service.len());
if service.len() == 0 {
offset += 1;
continue;
}
offset += service.len();
services.push(service);
}
Ok(Self { seq_no, services })
}
/// Returns a copy of the [Service]s for this [DTVCCPacket]
pub fn services(&self) -> &[Service] {
&self.services
}
fn cc_count(&self) -> usize {
(self.len() + 1) / 2
}
fn hdr_byte(&self) -> u8 {
let packet_size_code = if self.len() == 127 {
0
} else {
(self.len() + 1) / 2
};
(self.seq_no & 0x3) << 6 | packet_size_code as u8
}
/// Write the [DTVCCPacket] to a byte stream
///
/// # Examples
/// ```
/// # use cea708_types::{*, tables::*};
/// let mut packet = DTVCCPacket::new(2);
/// let mut service = Service::new(1);
/// service.push_code(&Code::LatinCapitalA).unwrap();
/// packet.push_service(service);
/// let mut written = vec![];
/// packet.write(&mut written);
/// let expected = [0x82, 0x21, 0x41, 0x00];
/// assert_eq!(written, expected);
/// ```
pub fn write<W: std::io::Write>(&self, w: &mut W) -> Result<(), std::io::Error> {
// TODO: fail if we would overrun max size
w.write_all(&[self.hdr_byte()])?;
for service in self.services.iter() {
service.write(w)?;
}
if self.len() % 2 == 1 {
w.write_all(&[0x00])?;
}
Ok(())
}
fn write_as_cc_data<W: std::io::Write>(&self, w: &mut W) -> Result<(), std::io::Error> {
// TODO: fail if we would overrun max size
// TODO: handle framerate?
if self.services.is_empty() {
return Ok(());
}
let mut written = vec![];
for service in self.services.iter() {
service.write(&mut written)?;
trace!("wrote service {service:?}");
}
w.write_all(&[0xFF, self.hdr_byte(), written[0]])?;
for pair in written[1..].chunks(2) {
let cc_valid = 0x04;
let cc_type = 0b10;
let reserved = 0xF8;
w.write_all(&[reserved | cc_valid | cc_type])?;
w.write_all(pair)?;
if pair.len() == 1 {
w.write_all(&[0x00])?;
}
}
Ok(())
}
}
/// A [Service] in a [DTVCCPacket]
///
/// As specified in CEA-708, there can be a maximum of 63 services. Service 1 is the primary
/// caption service and Service 2 is the secondary caption service. All other services are
/// undefined.
#[derive(Debug, Clone)]
pub struct Service {
number: u8,
codes: Vec<tables::Code>,
}
impl Service {
/// Create a new [Service]
///
/// # Panics
///
/// * if number >= 64
pub fn new(service_no: u8) -> Self {
if service_no >= 64 {
panic!("Service numbers must be between 0 and 63 inclusive, not {service_no}");
}
Self {
number: service_no,
codes: vec![],
}
}
/// Returns the number of this [Service]
///
/// # Examples
/// ```
/// # use cea708_types::{*, tables::*};
/// let mut service = Service::new(1);
/// assert_eq!(service.number(), 1);
/// ```
pub fn number(&self) -> u8 {
self.number
}
fn codes_len(&self) -> usize {
self.codes.iter().map(|c| c.byte_len()).sum()
}
/// The amount of free space (in bytes) that can by placed inside this [Service] block
///
/// # Examples
/// ```
/// # use cea708_types::{*, tables::*};
/// let service = Service::new(1);
/// assert_eq!(service.free_space(), 31);
/// ```
pub fn free_space(&self) -> usize {
// 31 is the maximum size of a service block
31 - self.codes_len()
}
/// The length in bytes of this [Service] block
///
/// # Examples
/// ```
/// # use cea708_types::{*, tables::*};
/// let mut service = Service::new(1);
/// assert_eq!(service.len(), 0);
/// service.push_code(&Code::LatinCapitalA).unwrap();
/// assert_eq!(service.len(), 2);
/// service.push_code(&Code::LatinCapitalB).unwrap();
/// assert_eq!(service.len(), 3);
/// ```
pub fn len(&self) -> usize {
if self.number == 0 {
return 0;
}
if self.codes.is_empty() {
return 0;
}
let hdr_size = if self.number >= 7 { 2 } else { 1 };
hdr_size + self.codes_len()
}
/// Push a [tables::Code] to the end of this [Service]
///
/// # Errors
///
/// * [WriterError::ReadOnly] if [Service] is number 0 (called the NULL Service)
/// * [WriterError::WouldOverflow] if adding the [tables::Code] would cause to [Service] to overflow
///
/// # Examples
/// ```
/// # use cea708_types::{*, tables::*};
/// let mut service = Service::new(1);
/// service.push_code(&Code::LatinCapitalA).unwrap();
/// ```
pub fn push_code(&mut self, code: &tables::Code) -> Result<(), WriterError> {
// TODO: errors?
if self.number == 0 {
return Err(WriterError::ReadOnly);
}
if code.byte_len() > self.free_space() {
let overflow_bytes = code.byte_len() - self.free_space();
debug!("pushing would overflow by {overflow_bytes} bytes");
return Err(WriterError::WouldOverflow(overflow_bytes));
}
trace!("pushing {code:?}");
self.codes.push(code.clone());
Ok(())
}
/// Parse a [Service] from a set of bytes
///
/// # Errors
///
/// * [ParserError::LengthMismatch] if the length of the data is less than the size advertised in the
/// header
///
/// # Examples
/// ```
/// # use cea708_types::{*, tables::*};
/// let bytes = [0x21, 0x41];
/// let service = Service::parse(&bytes).unwrap();
/// assert_eq!(service.number(), 1);
/// assert_eq!(service.codes()[0], Code::LatinCapitalA);
/// ```
pub fn parse(data: &[u8]) -> Result<Self, ParserError> {
if data.is_empty() {
return Err(ParserError::LengthMismatch {
expected: 1,
actual: 0,
});
}
let byte = data[0];
let mut service_no = (byte & 0xE0) >> 5;
let block_size = (byte & 0x1F) as usize;
let mut idx = 1;
trace!("block_size: {block_size}");
if service_no == 7 && block_size != 0 {
if data.len() == 1 {
return Err(ParserError::LengthMismatch {
expected: 2,
actual: data.len(),
});
}
let byte2 = data[1];
service_no = byte2 & 0x3F;
idx += 1;
}
if data.len() < idx + block_size {
return Err(ParserError::LengthMismatch {
expected: idx + block_size,
actual: data.len(),
});
}
if service_no != 0 {
Ok(Self {
number: service_no,
codes: tables::Code::from_data(&data[idx..idx + block_size])?,
})
} else {
Ok(Self {
number: 0,
codes: vec![],
})
}
}
/// The ordered list of [tables::Code]s present in this [Service] block
///
/// # Examples
/// ```
/// # use cea708_types::{*, tables::*};
/// let mut service = Service::new(1);
/// service.push_code(&Code::LatinCapitalA).unwrap();
/// let codes = service.codes();
/// assert_eq!(codes, [Code::LatinCapitalA]);
/// ```
pub fn codes(&self) -> &[tables::Code] {
&self.codes
}
/// Write the [Service] block to a byte stream
///
/// # Examples
/// ```
/// # use cea708_types::{*, tables::*};
/// let mut service = Service::new(1);
/// service.push_code(&Code::LatinCapitalA).unwrap();
/// let mut written = vec![];
/// service.write(&mut written);
/// let expected = [0x21, 0x41];
/// assert_eq!(written, expected);
/// ```
pub fn write<W: std::io::Write>(&self, w: &mut W) -> Result<(), std::io::Error> {
// TODO: fail if we would overrun max size
let len = (self.codes_len() & 0x3F) as u8;
if self.number > 7 {
let mut buf = [0; 2];
buf[0] = 0xC0 | len;
buf[1] = self.number;
w.write_all(&buf)?;
} else {
let byte = (self.number & 0x7) << 5 | len;
w.write_all(&[byte])?;
}
for code in self.codes.iter() {
code.write(w)?;
}
Ok(())
}
}
#[cfg(test)]
mod test {
use super::*;
use crate::tests::*;
#[test]
fn simple_parse_dtvcc() {
test_init_log();
let data = [0x02, 0x01 << 5 | 0x01, 0x2A];
let dtvcc = DTVCCPacket::parse(&data).unwrap();
let services = dtvcc.services();
assert_eq!(services.len(), 1);
for service in services.iter() {
assert_eq!(service.number, 1);
let codes = service.codes();
for code in codes.iter() {
trace!("parsed {code:?}");
}
}
}
#[test]
fn simple_write_dtvcc() {
test_init_log();
let mut service = Service::new(1);
let code = tables::Code::Asterisk;
service.push_code(&code).unwrap();
let mut dtvcc = DTVCCPacket::new(0);
dtvcc.push_service(service).unwrap();
let mut written = vec![];
dtvcc.write(&mut written).unwrap();
let data = [0x02, 0x01 << 5 | 0x01, 0x2A, 0x00];
assert_eq!(written, data);
}
#[derive(Debug)]
struct ServiceData<'a> {
service_no: u8,
codes: &'a [tables::Code],
}
#[derive(Debug)]
struct PacketData<'a> {
sequence_no: u8,
services: &'a [ServiceData<'a>],
}