thermark 0.36.1

Local sticker printing for pocket thermal printers over BLE/USB — QR links, inventory tags, badges, photos; no vendor app
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
//! NIIMBOT binary packet framing.
//!
//! ```text
//! 0x55 0x55 | CMD | LEN | DATA… | CHECKSUM | 0xAA 0xAA
//! ```
//!
//! Checksum = XOR of CMD, LEN, and every DATA byte.

use thiserror::Error;

pub const HEAD: [u8; 2] = [0x55, 0x55];
pub const TAIL: [u8; 2] = [0xAA, 0xAA];

/// Largest payload the single-byte `LEN` field can describe.
pub const MAX_DATA_LEN: usize = u8::MAX as usize;
/// Bytes a frame adds around its payload: head, cmd, len, checksum, tail.
pub const FRAME_OVERHEAD: usize = 7;
/// Largest possible encoded frame.
pub const MAX_FRAME_LEN: usize = FRAME_OVERHEAD + MAX_DATA_LEN;

#[derive(Debug, Clone, PartialEq, Eq)]
pub struct Packet {
    pub cmd: u8,
    pub data: Vec<u8>,
}

#[derive(Debug, Error)]
pub enum PacketError {
    #[error("packet too short ({0} bytes)")]
    TooShort(usize),
    #[error("invalid head (expected 55 55)")]
    BadHead,
    #[error("invalid tail (expected AA AA)")]
    BadTail,
    #[error("length field {claimed} does not match buffer")]
    BadLength { claimed: usize },
    #[error("checksum mismatch: got {got:#04x}, expected {expected:#04x}")]
    BadChecksum { got: u8, expected: u8 },
    #[error("data is {len} bytes; the LEN field allows at most {MAX_DATA_LEN}")]
    DataTooLong { len: usize },
}

impl Packet {
    /// Build a packet without checking the payload length.
    ///
    /// Kept infallible for the fixed-size [`crate::protocol`] helpers, whose
    /// payloads are statically well under [`MAX_DATA_LEN`]. Any over-long
    /// payload is rejected later by [`Packet::encode`] rather than silently
    /// truncated — use [`Packet::try_new`] to reject it at the input boundary.
    pub fn new(cmd: u8, data: impl Into<Vec<u8>>) -> Self {
        Self {
            cmd,
            data: data.into(),
        }
    }

    /// Build a packet, rejecting payloads the `LEN` field cannot describe.
    ///
    /// Prefer this for data of unbounded or caller-supplied length.
    pub fn try_new(cmd: u8, data: impl Into<Vec<u8>>) -> Result<Self, PacketError> {
        let data = data.into();
        if data.len() > MAX_DATA_LEN {
            return Err(PacketError::DataTooLong { len: data.len() });
        }
        Ok(Self { cmd, data })
    }

    /// XOR of `CMD`, `LEN`, and every data byte.
    ///
    /// Takes `len` explicitly so the checksum can never be computed over a
    /// length that disagrees with the one written to the wire.
    pub fn checksum(cmd: u8, len: u8, data: &[u8]) -> u8 {
        let mut c = cmd ^ len;
        for b in data {
            c ^= *b;
        }
        c
    }

    /// Encode to on-wire bytes.
    ///
    /// Fails with [`PacketError::DataTooLong`] rather than truncating the
    /// length field and emitting an undecodable frame.
    pub fn encode(&self) -> Result<Vec<u8>, PacketError> {
        let mut frame = [0; MAX_FRAME_LEN];
        Ok(self.encode_into(&mut frame)?.to_vec())
    }

    /// Encode into caller-owned storage large enough for any valid frame.
    ///
    /// The transport hot path keeps this buffer inline, avoiding one heap
    /// allocation for every row packet while retaining [`Packet::encode`] as
    /// the convenient public API.
    pub(crate) fn encode_into<'a>(
        &self,
        out: &'a mut [u8; MAX_FRAME_LEN],
    ) -> Result<&'a [u8], PacketError> {
        let len = u8::try_from(self.data.len()).map_err(|_| PacketError::DataTooLong {
            len: self.data.len(),
        })?;
        let data_end = 4 + self.data.len();
        let frame_len = FRAME_OVERHEAD + self.data.len();

        out[..2].copy_from_slice(&HEAD);
        out[2] = self.cmd;
        out[3] = len;
        out[4..data_end].copy_from_slice(&self.data);
        out[data_end] = Self::checksum(self.cmd, len, &self.data);
        out[data_end + 1..frame_len].copy_from_slice(&TAIL);

        Ok(&out[..frame_len])
    }

    /// Decode a single complete packet from `buf`.
    pub fn decode(buf: &[u8]) -> Result<Self, PacketError> {
        if buf.len() < 7 {
            return Err(PacketError::TooShort(buf.len()));
        }
        if buf[0] != HEAD[0] || buf[1] != HEAD[1] {
            return Err(PacketError::BadHead);
        }
        let cmd = buf[2];
        let len = buf[3] as usize;
        let total = 7 + len;
        if buf.len() < total {
            return Err(PacketError::BadLength { claimed: len });
        }
        if buf[total - 2] != TAIL[0] || buf[total - 1] != TAIL[1] {
            return Err(PacketError::BadTail);
        }
        let data = &buf[4..4 + len];
        let got = buf[4 + len];
        // `len` came from a single byte, so the cast back is lossless.
        let expected = Self::checksum(cmd, len as u8, data);
        if got != expected {
            return Err(PacketError::BadChecksum { got, expected });
        }
        Ok(Self {
            cmd,
            data: data.to_vec(),
        })
    }

    /// Pull zero or more complete packets from a growing receive buffer.
    pub fn drain_buffer(buf: &mut Vec<u8>) -> Vec<Self> {
        PacketDecoder::drain(buf)
    }
}

/// Stateful decoder for arbitrarily fragmented transport reads.
///
/// It retains a lone trailing `0x55`, because that byte may be the first half
/// of a frame header split across two BLE notifications or serial reads.
#[derive(Debug, Default)]
pub struct PacketDecoder {
    buf: Vec<u8>,
}

impl PacketDecoder {
    pub fn new() -> Self {
        Self::default()
    }

    /// Append bytes and return every complete, valid frame now available.
    pub fn push(&mut self, bytes: &[u8]) -> Vec<Packet> {
        let mut packets = Vec::new();
        // Bound the retained allocation even when a caller supplies a large
        // batch. At most one incomplete frame survives each chunk.
        for chunk in bytes.chunks(MAX_FRAME_LEN) {
            self.buf.extend_from_slice(chunk);
            Self::drain_into(&mut self.buf, &mut packets);
        }
        packets
    }

    pub fn buffered_len(&self) -> usize {
        self.buf.len()
    }

    fn drain(buf: &mut Vec<u8>) -> Vec<Packet> {
        let mut packets = Vec::new();
        Self::drain_into(buf, &mut packets);
        packets
    }

    fn drain_into(buf: &mut Vec<u8>, packets: &mut Vec<Packet>) {
        let mut consumed = 0;
        loop {
            let remaining = &buf[consumed..];
            let Some(pos) = remaining.windows(2).position(|w| w == HEAD) else {
                // A trailing 0x55 may be the start of the next frame.
                consumed = buf.len() - usize::from(remaining.last() == Some(&HEAD[0]));
                break;
            };
            consumed += pos;
            let remaining = &buf[consumed..];
            if remaining.len() < FRAME_OVERHEAD {
                break;
            }
            let total = FRAME_OVERHEAD + usize::from(remaining[3]);
            if remaining.len() < total {
                break;
            }
            match Packet::decode(&remaining[..total]) {
                Ok(packet) => {
                    packets.push(packet);
                    consumed += total;
                }
                Err(_) => consumed += 1,
            }
        }
        // Compact once per batch instead of shifting the remaining bytes for
        // every frame (quadratic work for a large coalesced read).
        buf.drain(..consumed);
        debug_assert!(buf.len() < MAX_FRAME_LEN);
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn large_input_does_not_leave_a_large_receive_allocation() {
        let packet = Packet::new(0x85, vec![0x42; MAX_DATA_LEN]);
        let mut bytes = packet.encode().unwrap().repeat(4_096);
        bytes.push(HEAD[0]);
        let mut decoder = PacketDecoder::new();
        let packets = decoder.push(&bytes);
        assert_eq!(packets.len(), 4_096);
        assert!(packets.iter().all(|p| p == &packet));
        assert_eq!(decoder.buffered_len(), 1);
        assert!(decoder.buf.capacity() <= MAX_FRAME_LEN * 4);
        assert!(decoder.push(&[]).is_empty());
        assert_eq!(decoder.buffered_len(), 1);
        let frame = packet.encode().unwrap();
        assert_eq!(decoder.push(&frame[1..]), vec![packet]);
        assert_eq!(decoder.buffered_len(), 0);
    }

    #[test]
    fn encode_simple_rfid() {
        // 55 55 1a 01 01 1a aa aa
        let p = Packet::new(0x1a, vec![0x01]);
        assert_eq!(
            p.encode().unwrap(),
            hex::decode("55551a01011aaaaa").unwrap()
        );
    }

    #[test]
    fn roundtrip() {
        let p = Packet::new(0x40, vec![0x0b]);
        let enc = p.encode().unwrap();
        let d = Packet::decode(&enc).unwrap();
        assert_eq!(d, p);
    }

    #[test]
    fn drain_fragmented() {
        let a = Packet::new(0x1a, vec![0x01]).encode().unwrap();
        let b = Packet::new(0x40, vec![0x0b]).encode().unwrap();
        let mut buf = Vec::new();
        buf.extend_from_slice(&a[..4]);
        assert!(Packet::drain_buffer(&mut buf).is_empty());
        buf.extend_from_slice(&a[4..]);
        buf.extend_from_slice(&b);
        let pkts = Packet::drain_buffer(&mut buf);
        assert_eq!(pkts.len(), 2);
        assert_eq!(pkts[0].cmd, 0x1a);
        assert_eq!(pkts[1].cmd, 0x40);
        assert!(buf.is_empty());
    }

    #[test]
    fn decoder_preserves_header_split_between_reads() {
        let packet = Packet::new(0x40, vec![0x0b]);
        let encoded = packet.encode().unwrap();
        let mut decoder = PacketDecoder::new();
        assert!(decoder.push(&encoded[..1]).is_empty());
        assert_eq!(decoder.buffered_len(), 1);
        assert_eq!(decoder.push(&encoded[1..]), vec![packet]);
    }

    #[test]
    fn decoder_accepts_every_single_split_point() {
        let packet = Packet::new(0x40, vec![0x0b, 0x55, 0xaa]);
        let encoded = packet.encode().unwrap();
        for split in 0..=encoded.len() {
            let mut decoder = PacketDecoder::new();
            let mut got = decoder.push(&encoded[..split]);
            got.extend(decoder.push(&encoded[split..]));
            assert_eq!(got, vec![packet.clone()], "split at {split}");
        }
    }

    #[test]
    fn print_start_b1_seven_bytes() {
        // B1 PrintStart payload from community wiki
        let data = [0x00u8, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00];
        let p = Packet::new(0x01, data);
        let enc = p.encode().unwrap();
        assert_eq!(&enc[..2], &[0x55, 0x55]);
        assert_eq!(enc[2], 0x01);
        assert_eq!(enc[3], 7);
        assert_eq!(&enc[enc.len() - 2..], &[0xAA, 0xAA]);
        assert_eq!(Packet::decode(&enc).unwrap(), p);
    }

    #[test]
    fn set_page_size_6b_checksum() {
        // rows=240 (0x00f0), cols=384 (0x0180), copies=1
        let mut data = Vec::new();
        data.extend_from_slice(&240u16.to_be_bytes());
        data.extend_from_slice(&384u16.to_be_bytes());
        data.extend_from_slice(&1u16.to_be_bytes());
        let p = Packet::new(0x13, data);
        let enc = p.encode().unwrap();
        assert_eq!(enc[3], 6);
        assert_eq!(Packet::decode(&enc).unwrap().data.len(), 6);
    }

    #[test]
    fn oversized_payload_is_rejected_not_truncated() {
        // 300 bytes used to encode with LEN=44 and a checksum over the wrong
        // length, producing a frame no receiver could decode.
        let p = Packet::new(0x85, vec![0xAB; 300]);
        assert!(matches!(
            p.encode(),
            Err(PacketError::DataTooLong { len: 300 })
        ));
        assert!(matches!(
            Packet::try_new(0x85, vec![0xAB; 300]),
            Err(PacketError::DataTooLong { len: 300 })
        ));
    }

    #[test]
    fn max_length_payload_still_roundtrips() {
        let p = Packet::try_new(0x85, vec![0xAB; MAX_DATA_LEN]).expect("255 bytes fits");
        let enc = p.encode().unwrap();
        assert_eq!(enc[3] as usize, MAX_DATA_LEN);
        assert_eq!(Packet::decode(&enc).unwrap(), p);
    }

    #[test]
    fn encoding_preserves_wire_fields_at_every_length() {
        let mut frame = [0xCC; MAX_FRAME_LEN];
        for len in 0..=MAX_DATA_LEN {
            let data: Vec<u8> = (0..len).map(|i| (i as u8).wrapping_mul(37)).collect();
            let packet = Packet::new((len as u8).wrapping_mul(11), data);
            let encoded = packet.encode().unwrap();
            assert_eq!(encoded.len(), FRAME_OVERHEAD + len);
            assert_eq!(&encoded[..2], &HEAD);
            assert_eq!(encoded[2], packet.cmd);
            assert_eq!(usize::from(encoded[3]), len);
            assert_eq!(&encoded[4..4 + len], packet.data);
            // Every byte from CMD through CHECKSUM XORs to zero.
            assert_eq!(encoded[2..5 + len].iter().fold(0, |sum, b| sum ^ b), 0);
            assert_eq!(&encoded[5 + len..], &TAIL);
            assert_eq!(Packet::decode(&encoded).unwrap(), packet);
            assert_eq!(packet.encode_into(&mut frame).unwrap(), encoded);
        }
    }

    #[test]
    fn fixed_buffer_can_be_reused_and_rejects_oversized_payloads() {
        let mut frame = [0xCC; MAX_FRAME_LEN];
        let longest = Packet::new(0x85, vec![0xAB; MAX_DATA_LEN]);
        assert_eq!(
            longest.encode_into(&mut frame).unwrap(),
            longest.encode().unwrap()
        );

        let shortest = Packet::new(0x1A, [0x01]);
        assert_eq!(
            shortest.encode_into(&mut frame).unwrap(),
            hex::decode("55551a01011aaaaa").unwrap()
        );

        let before = frame;
        let oversized = Packet::new(0x85, vec![0xAB; MAX_DATA_LEN + 1]);
        assert!(matches!(
            oversized.encode_into(&mut frame),
            Err(PacketError::DataTooLong { len }) if len == MAX_DATA_LEN + 1
        ));
        assert_eq!(frame, before, "failed encoding must not alter the buffer");
    }

    #[test]
    fn drain_garbage_never_panics_and_clears() {
        let mut buf = vec![0u8, 1, 2, 0xAA, 0x55, 0xFF];
        let pkts = Packet::drain_buffer(&mut buf);
        assert!(pkts.is_empty());
        // No complete head → buffer cleared
        assert!(buf.is_empty());
    }

    #[test]
    fn drain_recovers_valid_after_noise() {
        let good = Packet::new(0x1a, vec![0x01]).encode().unwrap();
        let mut buf = vec![0xDE, 0xAD, 0xBE, 0xEF];
        buf.extend_from_slice(&good);
        let pkts = Packet::drain_buffer(&mut buf);
        assert_eq!(pkts.len(), 1);
        assert_eq!(pkts[0].cmd, 0x1a);
        assert!(buf.is_empty());
    }

    #[test]
    fn drain_bad_checksum_skips_and_continues() {
        let good = Packet::new(0x40, vec![0x0b]).encode().unwrap();
        let mut bad = good.clone();
        // Flip checksum byte (second-to-last before tail)
        let cs = bad.len() - 3;
        bad[cs] ^= 0xFF;
        let mut buf = bad;
        buf.extend_from_slice(&good);
        let pkts = Packet::drain_buffer(&mut buf);
        assert_eq!(pkts.len(), 1);
        assert_eq!(pkts[0].cmd, 0x40);
    }

    /// Property: random noise never panics; output packets always re-encode cleanly.
    #[test]
    fn prop_drain_random_noise_no_panic() {
        use proptest::prelude::*;
        proptest::proptest!(|(noise in prop::collection::vec(any::<u8>(), 0..512))| {
            let mut buf = noise;
            let pkts = Packet::drain_buffer(&mut buf);
            for p in pkts {
                let enc = p.encode().unwrap();
                let dec = Packet::decode(&enc).expect("roundtrip after drain");
                prop_assert_eq!(dec, p);
            }
            // leftover is either empty or a proper incomplete frame starting at HEAD
            if !buf.is_empty() {
                prop_assert!(buf.len() < 7 || buf.starts_with(&HEAD));
            }
        });
    }

    /// Property: a valid packet is recovered when preceded by noise that cannot
    /// form a frame head (`55 55`).
    #[test]
    fn prop_valid_packet_survives_noise_wrap() {
        use proptest::prelude::*;
        // Bytes that never form HEAD when consecutive (exclude 0x55 entirely).
        let noise = prop::collection::vec(0u8..=0x54u8, 0..24);
        proptest::proptest!(|(
            cmd in any::<u8>(),
            data in prop::collection::vec(any::<u8>(), 0..32),
            prefix in noise.clone(),
            suffix in noise,
        )| {
            let p = Packet::new(cmd, data);
            let enc = p.encode().unwrap();
            let mut buf = prefix;
            buf.extend_from_slice(&enc);
            buf.extend_from_slice(&suffix);
            let pkts = Packet::drain_buffer(&mut buf);
            prop_assert!(
                pkts.iter().any(|x| x == &p),
                "lost packet among cmds {:?}",
                pkts.iter().map(|x| x.cmd).collect::<Vec<_>>()
            );
        });
    }
}