fashex 0.0.10

Hexadecimal string encoding and decoding with best-effort SIMD acceleration.
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

//! Generic implementations.

use core::mem::MaybeUninit;

use crate::error::InvalidInput;
use crate::util::lut16;

#[allow(unsafe_code, reason = "XXX")]
/// ## Safety
///
/// We assume that:
///
/// 1. `src.len() <= dst.len()`.
pub(crate) const unsafe fn encode_generic_unchecked<const UPPER: bool>(
    mut src: &[u8],
    mut dst: &mut [[MaybeUninit<u8>; 2]],
) {
    debug_assert!(
        src.len() <= dst.len(),
        "implementation bug: `src` should not be longer than `dst`"
    );

    let digits = lut16::<UPPER>();

    while !src.is_empty() {
        let cur_src;
        // SAFETY: `src` is not empty.
        (cur_src, src) = src.split_first().unwrap_unchecked();

        let cur_dst;
        // SAFETY: it's guaranteed by the caller that `dst` has at least the same length
        // as `src`, then `dst` is not empty.
        (cur_dst, dst) = dst.split_first_mut().unwrap_unchecked();

        cur_dst[0].write(digits[(*cur_src >> 4) as usize]);
        cur_dst[1].write(digits[(*cur_src & 0x0F) as usize]);
    }
}

#[allow(unsafe_code, reason = "XXX")]
/// ## Safety
///
/// We assume that:
///
/// 1. `src.len() <= dst.len()`.
/// 2. When `VALIDATED`, the input contains only valid hexadecimal characters.
///
/// ## Errors
///
/// When `!VALIDATED` and the input contains invalid hexadecimal characters.
pub(crate) const unsafe fn decode_generic_unchecked<const VALIDATED: bool>(
    mut src: &[[u8; 2]],
    mut dst: &mut [MaybeUninit<u8>],
) -> Result<(), InvalidInput> {
    const NIL: u8 = u8::MAX;

    const LUT: [u8; u8::MAX as usize + 1] = {
        let mut lut = [NIL; _];

        let mut i = 0;

        while i <= u8::MAX as usize {
            #[allow(clippy::cast_possible_truncation, reason = "XXX")]
            match i as u8 {
                b'0'..=b'9' => {
                    lut[i] = i as u8 - b'0';
                }
                b'a'..=b'f' => {
                    lut[i] = i as u8 - b'a' + 10;
                }
                b'A'..=b'F' => {
                    lut[i] = i as u8 - b'A' + 10;
                }
                _ => {}
            };

            i += 1;
        }

        lut
    };

    debug_assert!(
        src.len() <= dst.len(),
        "implementation bug: `src` should not be longer than `dst`"
    );

    while !src.is_empty() {
        let cur_src;
        // SAFETY: `src` is not empty.
        (cur_src, src) = src.split_first().unwrap_unchecked();

        let cur_dst;
        // SAFETY: it's guaranteed by the caller that `dst` has at least the same length
        // as `src`, then `dst` is not empty.
        (cur_dst, dst) = dst.split_first_mut().unwrap_unchecked();

        let &[hi, lo] = cur_src;

        let hi = LUT[hi as usize];
        let lo = LUT[lo as usize];

        if !VALIDATED && (hi == NIL || lo == NIL) {
            return Err(InvalidInput);
        }

        cur_dst.write(hi << 4 | lo);
    }

    Ok(())
}