1use super::{Decoder, Encoder};
2use crate::media::{PcmBuf, Sample};
3
4const SEG_SHIFT: i16 = 4;
5const QUANT_MASK: i16 = 0x0F;
6const SEG_END: [i16; 8] = [0xFF, 0x1FF, 0x3FF, 0x7FF, 0xFFF, 0x1FFF, 0x3FFF, 0x7FFF];
7
8const fn search(val: i16, table: &[i16], size: usize) -> usize {
9 let mut i = 0;
10 while i < size {
11 if val <= table[i] {
12 return i;
13 }
14 i += 1;
15 }
16 size
17}
18
19const fn linear2alaw_algo(pcm_val: i16) -> u8 {
20 if pcm_val < 0 && pcm_val >= -8 {
22 return 0xD5;
23 }
24
25 let (mask, abs_val) = if pcm_val >= 0 {
27 (0xD5, pcm_val) } else {
29 if pcm_val == i16::MIN {
31 (0x55, i16::MAX) } else {
33 (0x55, -pcm_val - 8) }
35 };
36
37 let seg = search(abs_val, &SEG_END, 8);
39
40 if seg >= 8 {
42 return (0x7F ^ mask) as u8;
43 }
44
45 let aval = (seg as i16) << SEG_SHIFT;
47
48 let shift = if seg < 2 { 4 } else { seg as i16 + 3 };
50 let result = aval | ((abs_val >> shift) & QUANT_MASK);
51
52 (result ^ mask) as u8
54}
55
56static ALAW_ENCODE_TABLE: [u8; 65536] = {
57 let mut table = [0; 65536];
58 let mut i = 0;
59 while i < 65536 {
60 let s = (i as i32 - 32768) as i16;
61 table[i] = linear2alaw_algo(s);
62 i += 1;
63 }
64 table
65};
66
67static ALAW_DECODE_TABLE: [i16; 256] = [
69 -5504, -5248, -6016, -5760, -4480, -4224, -4992, -4736, -7552, -7296, -8064, -7808, -6528,
70 -6272, -7040, -6784, -2752, -2624, -3008, -2880, -2240, -2112, -2496, -2368, -3776, -3648,
71 -4032, -3904, -3264, -3136, -3520, -3392, -22016, -20992, -24064, -23040, -17920, -16896,
72 -19968, -18944, -30208, -29184, -32256, -31232, -26112, -25088, -28160, -27136, -11008, -10496,
73 -12032, -11520, -8960, -8448, -9984, -9472, -15104, -14592, -16128, -15616, -13056, -12544,
74 -14080, -13568, -344, -328, -376, -360, -280, -264, -312, -296, -472, -456, -504, -488, -408,
75 -392, -440, -424, -88, -72, -120, -104, -24, -8, -56, -40, -216, -200, -248, -232, -152, -136,
76 -184, -168, -1376, -1312, -1504, -1440, -1120, -1056, -1248, -1184, -1888, -1824, -2016, -1952,
77 -1632, -1568, -1760, -1696, -688, -656, -752, -720, -560, -528, -624, -592, -944, -912, -1008,
78 -976, -816, -784, -880, -848, 5504, 5248, 6016, 5760, 4480, 4224, 4992, 4736, 7552, 7296, 8064,
79 7808, 6528, 6272, 7040, 6784, 2752, 2624, 3008, 2880, 2240, 2112, 2496, 2368, 3776, 3648, 4032,
80 3904, 3264, 3136, 3520, 3392, 22016, 20992, 24064, 23040, 17920, 16896, 19968, 18944, 30208,
81 29184, 32256, 31232, 26112, 25088, 28160, 27136, 11008, 10496, 12032, 11520, 8960, 8448, 9984,
82 9472, 15104, 14592, 16128, 15616, 13056, 12544, 14080, 13568, 344, 328, 376, 360, 280, 264,
83 312, 296, 472, 456, 504, 488, 408, 392, 440, 424, 88, 72, 120, 104, 24, 8, 56, 40, 216, 200,
84 248, 232, 152, 136, 184, 168, 1376, 1312, 1504, 1440, 1120, 1056, 1248, 1184, 1888, 1824, 2016,
85 1952, 1632, 1568, 1760, 1696, 688, 656, 752, 720, 560, 528, 624, 592, 944, 912, 1008, 976, 816,
86 784, 880, 848,
87];
88
89#[derive(Default)]
91pub struct PcmaDecoder {}
92
93impl PcmaDecoder {
94 pub fn new() -> Self {
96 Self {}
97 }
98}
99
100impl Decoder for PcmaDecoder {
101 fn decode(&mut self, samples: &[u8]) -> PcmBuf {
102 samples.iter().map(|&sample| decode_a_law(sample)).collect()
103 }
104
105 fn sample_rate(&self) -> u32 {
106 8000
107 }
108
109 fn channels(&self) -> u16 {
110 1
111 }
112}
113
114fn decode_a_law(a_law_sample: u8) -> i16 {
116 ALAW_DECODE_TABLE[a_law_sample as usize]
117}
118
119#[derive(Default)]
121pub struct PcmaEncoder {}
122
123impl PcmaEncoder {
124 pub fn new() -> Self {
126 Self {}
127 }
128
129 fn linear2alaw(&self, sample: i16) -> u8 {
131 let index = (sample as i32 + 32768) as usize;
132 ALAW_ENCODE_TABLE[index]
133 }
134}
135
136impl Encoder for PcmaEncoder {
137 fn encode(&mut self, samples: &[Sample]) -> Vec<u8> {
138 samples
139 .iter()
140 .map(|&sample| self.linear2alaw(sample))
141 .collect()
142 }
143
144 fn sample_rate(&self) -> u32 {
145 8000
146 }
147
148 fn channels(&self) -> u16 {
149 1
150 }
151}