aboutsummaryrefslogtreecommitdiff
path: root/core/encoding/base64/base64.odin
blob: cf2ea1c123659381a6e5a6fba8c4dab410568218 (plain)
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
package base64

// @note(zh): Encoding utility for Base64
// A secondary param can be used to supply a custom alphabet to
// @link(encode) and a matching decoding table to @link(decode).
// If none is supplied it just uses the standard Base64 alphabet.
// Incase your specific version does not use padding, you may
// truncate it from the encoded output.

ENC_TABLE := [64]byte {
    'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',
    'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',
    'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',
    'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f',
    'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',
    'o', 'p', 'q', 'r', 's', 't', 'u', 'v',
    'w', 'x', 'y', 'z', '0', '1', '2', '3',
    '4', '5', '6', '7', '8', '9', '+', '/',
}

PADDING :: '='

DEC_TABLE := [128]int {
    -1, -1, -1, -1, -1, -1, -1, -1,
    -1, -1, -1, -1, -1, -1, -1, -1,
    -1, -1, -1, -1, -1, -1, -1, -1,
    -1, -1, -1, -1, -1, -1, -1, -1,
    -1, -1, -1, -1, -1, -1, -1, -1,
    -1, -1, -1, 62, -1, -1, -1, 63,
    52, 53, 54, 55, 56, 57, 58, 59,
    60, 61, -1, -1, -1, -1, -1, -1,
    -1,  0,  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, -1, -1, -1, -1, -1,
    -1, 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, -1, -1, -1, -1, -1,
}

encode :: proc(data: []byte, ENC_TBL := ENC_TABLE, allocator := context.allocator) -> string #no_bounds_check {
    length := len(data)
    if length == 0 {
        return ""
    }

    out_length := ((4 * length / 3) + 3) &~ 3
    out := make([]byte, out_length, allocator)

    c0, c1, c2, block: int

    for i, d := 0, 0; i < length; i, d = i + 3, d + 4 {
        c0, c1, c2 = int(data[i]), -1, -1

        if i + 1 < length { c1 = int(data[i + 1]) }
        if i + 2 < length { c2 = int(data[i + 2]) }

        block = (c0 << 16) | (max(c1, 0) << 8) | max(c2, 0)

        out[d]     = ENC_TBL[block >> 18 & 63]
        out[d + 1] = ENC_TBL[block >> 12 & 63]
        out[d + 2] = c1 == -1 ? PADDING : ENC_TBL[block >> 6 & 63]
        out[d + 3] = c2 == -1 ? PADDING : ENC_TBL[block & 63]
    }
    return string(out)
}

decode :: proc(data: string, DEC_TBL := DEC_TABLE, allocator := context.allocator) -> []byte #no_bounds_check {
    length := len(data)
    if length == 0 {
        return nil
    }

    pad_count := data[length - 1] == PADDING ? (data[length - 2] == PADDING ? 2 : 1) : 0
    out_length := ((length * 6) >> 3) - pad_count
    out := make([]byte, out_length, allocator)

    c0, c1, c2, c3: int
    b0, b1, b2: int

    for i, j := 0, 0; i < length; i, j = i + 4, j + 3 {
        c0 = DEC_TBL[data[i]]
        c1 = DEC_TBL[data[i + 1]]
        c2 = DEC_TBL[data[i + 2]]
        c3 = DEC_TBL[data[i + 3]]

        b0 = (c0 << 2) | (c1 >> 4)
        b1 = (c1 << 4) | (c2 >> 2)
        b2 = (c2 << 6) | c3

        out[j]     = byte(b0)
        out[j + 1] = byte(b1)
        out[j + 2] = byte(b2)
    }
    return out
}