mirror of
https://github.com/ziglang/zig.git
synced 2025-02-10 22:50:18 +00:00
rework std.base64 api
* rename decode to decodeExactUnsafe. * add decodeExact, which checks for invalid chars and padding. * add decodeWithIgnore, which also allows ignoring chars. * alphabets are supplied to the decoders with their char-to-index mapping already built, which enables it to be done at comptime. * all decode/encode apis except decodeWithIgnore require dest to be the exactly correct length. This is calculated by a calc function corresponding to each api. These apis no longer return the dest parameter. * for decodeWithIgnore, an exact size cannot be known a priori. Instead, a calc function gives an upperbound, and a runtime error is returned in case of overflow. decodeWithIgnore returns the number of bytes written to dest. closes #611
This commit is contained in:
Josh Wolfe
parent
339d48ac15
commit
a44283b0b2
@ -5412,10 +5412,13 @@ const c = @cImport({
|
||||
export fn decode_base_64(dest_ptr: &u8, dest_len: usize,
|
||||
source_ptr: &const u8, source_len: usize) -> usize
|
||||
{
|
||||
const src = source_ptr[0...source_len];
|
||||
const dest = dest_ptr[0...dest_len];
|
||||
return base64.decode(dest, src).len;
|
||||
}</code></pre>
|
||||
const src = source_ptr[0..source_len];
|
||||
const dest = dest_ptr[0..dest_len];
|
||||
const decoded_size = base64.calcDecodedSizeExactUnsafe(src, base64.standard_pad_char);
|
||||
base64.decodeExactUnsafe(dest[0..decoded_size], src, base64.standard_alphabet_unsafe);
|
||||
return decoded_size;
|
||||
}
|
||||
</code></pre>
|
||||
<h4>test.c</h4>
|
||||
<pre><code class="c">// This header is generated by zig from base64.zig
|
||||
#include "base64.h"
|
||||
|
||||
@ -3,5 +3,7 @@ const base64 = @import("std").base64;
|
||||
export fn decode_base_64(dest_ptr: &u8, dest_len: usize, source_ptr: &const u8, source_len: usize) -> usize {
|
||||
const src = source_ptr[0..source_len];
|
||||
const dest = dest_ptr[0..dest_len];
|
||||
return base64.decode(dest, src).len;
|
||||
const decoded_size = base64.calcDecodedSizeExactUnsafe(src, base64.standard_pad_char);
|
||||
base64.decodeExactUnsafe(dest[0..decoded_size], src, base64.standard_alphabet_unsafe);
|
||||
return decoded_size;
|
||||
}
|
||||
|
||||
484
std/base64.zig
484
std/base64.zig
@ -1,100 +1,332 @@
|
||||
const assert = @import("debug.zig").assert;
|
||||
const mem = @import("mem.zig");
|
||||
|
||||
pub const standard_alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
|
||||
pub const standard_alphabet_chars = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
||||
pub const standard_pad_char = '=';
|
||||
|
||||
pub fn encode(dest: []u8, source: []const u8) -> []u8 {
|
||||
return encodeWithAlphabet(dest, source, standard_alphabet);
|
||||
/// ceil(source_len * 4/3)
|
||||
pub fn calcEncodedSize(source_len: usize) -> usize {
|
||||
return @divTrunc(source_len + 2, 3) * 4;
|
||||
}
|
||||
|
||||
/// invalid characters in source are allowed, but they cause the value of dest to be undefined.
|
||||
pub fn decode(dest: []u8, source: []const u8) -> []u8 {
|
||||
return decodeWithAlphabet(dest, source, standard_alphabet);
|
||||
}
|
||||
|
||||
pub fn encodeWithAlphabet(dest: []u8, source: []const u8, alphabet: []const u8) -> []u8 {
|
||||
assert(alphabet.len == 65);
|
||||
assert(dest.len >= calcEncodedSize(source.len));
|
||||
/// dest.len must be what you get from ::calcEncodedSize.
|
||||
/// It is assumed that alphabet_chars and pad_char are all unique characters.
|
||||
pub fn encode(dest: []u8, source: []const u8, alphabet_chars: []const u8, pad_char: u8) {
|
||||
assert(alphabet_chars.len == 64);
|
||||
assert(dest.len == calcEncodedSize(source.len));
|
||||
|
||||
var i: usize = 0;
|
||||
var out_index: usize = 0;
|
||||
while (i + 2 < source.len) : (i += 3) {
|
||||
dest[out_index] = alphabet[(source[i] >> 2) & 0x3f];
|
||||
dest[out_index] = alphabet_chars[(source[i] >> 2) & 0x3f];
|
||||
out_index += 1;
|
||||
|
||||
dest[out_index] = alphabet[((source[i] & 0x3) << 4) |
|
||||
dest[out_index] = alphabet_chars[((source[i] & 0x3) << 4) |
|
||||
((source[i + 1] & 0xf0) >> 4)];
|
||||
out_index += 1;
|
||||
|
||||
dest[out_index] = alphabet[((source[i + 1] & 0xf) << 2) |
|
||||
dest[out_index] = alphabet_chars[((source[i + 1] & 0xf) << 2) |
|
||||
((source[i + 2] & 0xc0) >> 6)];
|
||||
out_index += 1;
|
||||
|
||||
dest[out_index] = alphabet[source[i + 2] & 0x3f];
|
||||
dest[out_index] = alphabet_chars[source[i + 2] & 0x3f];
|
||||
out_index += 1;
|
||||
}
|
||||
|
||||
if (i < source.len) {
|
||||
dest[out_index] = alphabet[(source[i] >> 2) & 0x3f];
|
||||
dest[out_index] = alphabet_chars[(source[i] >> 2) & 0x3f];
|
||||
out_index += 1;
|
||||
|
||||
if (i + 1 == source.len) {
|
||||
dest[out_index] = alphabet[(source[i] & 0x3) << 4];
|
||||
dest[out_index] = alphabet_chars[(source[i] & 0x3) << 4];
|
||||
out_index += 1;
|
||||
|
||||
dest[out_index] = alphabet[64];
|
||||
dest[out_index] = pad_char;
|
||||
out_index += 1;
|
||||
} else {
|
||||
dest[out_index] = alphabet[((source[i] & 0x3) << 4) |
|
||||
dest[out_index] = alphabet_chars[((source[i] & 0x3) << 4) |
|
||||
((source[i + 1] & 0xf0) >> 4)];
|
||||
out_index += 1;
|
||||
|
||||
dest[out_index] = alphabet[(source[i + 1] & 0xf) << 2];
|
||||
dest[out_index] = alphabet_chars[(source[i + 1] & 0xf) << 2];
|
||||
out_index += 1;
|
||||
}
|
||||
|
||||
dest[out_index] = alphabet[64];
|
||||
dest[out_index] = pad_char;
|
||||
out_index += 1;
|
||||
}
|
||||
|
||||
return dest[0..out_index];
|
||||
}
|
||||
|
||||
/// invalid characters in source are allowed, but they cause the value of dest to be undefined.
|
||||
pub fn decodeWithAlphabet(dest: []u8, source: []const u8, alphabet: []const u8) -> []u8 {
|
||||
assert(alphabet.len == 65);
|
||||
pub const standard_alphabet = Base64Alphabet.init(standard_alphabet_chars, standard_pad_char);
|
||||
|
||||
var ascii6 = []u8{64} ** 256;
|
||||
for (alphabet) |c, i| {
|
||||
ascii6[c] = u8(i);
|
||||
/// For use with ::decodeExact.
|
||||
pub const Base64Alphabet = struct {
|
||||
/// e.g. 'A' => 0.
|
||||
/// undefined for any value not in the 64 alphabet chars.
|
||||
char_to_index: [256]u8,
|
||||
/// true only for the 64 chars in the alphabet, not the pad char.
|
||||
char_in_alphabet: [256]bool,
|
||||
pad_char: u8,
|
||||
|
||||
pub fn init(alphabet_chars: []const u8, pad_char: u8) -> Base64Alphabet {
|
||||
assert(alphabet_chars.len == 64);
|
||||
|
||||
var result = Base64Alphabet{
|
||||
.char_to_index = undefined,
|
||||
.char_in_alphabet = []bool{false} ** 256,
|
||||
.pad_char = pad_char,
|
||||
};
|
||||
|
||||
for (alphabet_chars) |c, i| {
|
||||
assert(!result.char_in_alphabet[c]);
|
||||
assert(c != pad_char);
|
||||
|
||||
result.char_to_index[c] = u8(i);
|
||||
result.char_in_alphabet[c] = true;
|
||||
}
|
||||
|
||||
return result;
|
||||
}
|
||||
};
|
||||
|
||||
error InvalidPadding;
|
||||
/// For use with ::decodeExact.
|
||||
/// If the encoded buffer is detected to be invalid, returns error.InvalidPadding.
|
||||
pub fn calcDecodedSizeExact(encoded: []const u8, pad_char: u8) -> %usize {
|
||||
if (encoded.len % 4 != 0) return error.InvalidPadding;
|
||||
return calcDecodedSizeExactUnsafe(encoded, pad_char);
|
||||
}
|
||||
|
||||
error InvalidCharacter;
|
||||
/// dest.len must be what you get from ::calcDecodedSizeExact.
|
||||
/// invalid characters result in error.InvalidCharacter.
|
||||
/// invalid padding results in error.InvalidPadding.
|
||||
pub fn decodeExact(dest: []u8, source: []const u8, alphabet: &const Base64Alphabet) -> %void {
|
||||
assert(dest.len == %%calcDecodedSizeExact(source, alphabet.pad_char));
|
||||
assert(source.len % 4 == 0);
|
||||
|
||||
var src_cursor: usize = 0;
|
||||
var dest_cursor: usize = 0;
|
||||
|
||||
while (src_cursor < source.len) : (src_cursor += 4) {
|
||||
if (!alphabet.char_in_alphabet[source[src_cursor + 0]]) return error.InvalidCharacter;
|
||||
if (!alphabet.char_in_alphabet[source[src_cursor + 1]]) return error.InvalidCharacter;
|
||||
if (src_cursor < source.len - 4 or source[src_cursor + 3] != alphabet.pad_char) {
|
||||
// common case
|
||||
if (!alphabet.char_in_alphabet[source[src_cursor + 2]]) return error.InvalidCharacter;
|
||||
if (!alphabet.char_in_alphabet[source[src_cursor + 3]]) return error.InvalidCharacter;
|
||||
dest[dest_cursor + 0] = alphabet.char_to_index[source[src_cursor + 0]] << 2 |
|
||||
alphabet.char_to_index[source[src_cursor + 1]] >> 4;
|
||||
dest[dest_cursor + 1] = alphabet.char_to_index[source[src_cursor + 1]] << 4 |
|
||||
alphabet.char_to_index[source[src_cursor + 2]] >> 2;
|
||||
dest[dest_cursor + 2] = alphabet.char_to_index[source[src_cursor + 2]] << 6 |
|
||||
alphabet.char_to_index[source[src_cursor + 3]];
|
||||
dest_cursor += 3;
|
||||
} else if (source[src_cursor + 2] != alphabet.pad_char) {
|
||||
// one pad char
|
||||
if (!alphabet.char_in_alphabet[source[src_cursor + 2]]) return error.InvalidCharacter;
|
||||
dest[dest_cursor + 0] = alphabet.char_to_index[source[src_cursor + 0]] << 2 |
|
||||
alphabet.char_to_index[source[src_cursor + 1]] >> 4;
|
||||
dest[dest_cursor + 1] = alphabet.char_to_index[source[src_cursor + 1]] << 4 |
|
||||
alphabet.char_to_index[source[src_cursor + 2]] >> 2;
|
||||
if (alphabet.char_to_index[source[src_cursor + 2]] << 6 != 0) return error.InvalidPadding;
|
||||
dest_cursor += 2;
|
||||
} else {
|
||||
// two pad chars
|
||||
dest[dest_cursor + 0] = alphabet.char_to_index[source[src_cursor + 0]] << 2 |
|
||||
alphabet.char_to_index[source[src_cursor + 1]] >> 4;
|
||||
if (alphabet.char_to_index[source[src_cursor + 1]] << 4 != 0) return error.InvalidPadding;
|
||||
dest_cursor += 1;
|
||||
}
|
||||
}
|
||||
|
||||
return decodeWithAscii6BitMap(dest, source, ascii6[0..], alphabet[64]);
|
||||
assert(src_cursor == source.len);
|
||||
assert(dest_cursor == dest.len);
|
||||
}
|
||||
|
||||
pub fn decodeWithAscii6BitMap(dest: []u8, source: []const u8, ascii6: []const u8, pad_char: u8) -> []u8 {
|
||||
assert(ascii6.len == 256);
|
||||
assert(dest.len >= calcExactDecodedSizeWithPadChar(source, pad_char));
|
||||
/// For use with ::decodeWithIgnore.
|
||||
pub const Base64AlphabetWithIgnore = struct {
|
||||
alphabet: Base64Alphabet,
|
||||
char_is_ignored: [256]bool,
|
||||
pub fn init(alphabet_chars: []const u8, pad_char: u8, ignore_chars: []const u8) -> Base64AlphabetWithIgnore {
|
||||
var result = Base64AlphabetWithIgnore {
|
||||
.alphabet = Base64Alphabet.init(alphabet_chars, pad_char),
|
||||
.char_is_ignored = []bool{false} ** 256,
|
||||
};
|
||||
|
||||
for (ignore_chars) |c| {
|
||||
assert(!result.alphabet.char_in_alphabet[c]);
|
||||
assert(!result.char_is_ignored[c]);
|
||||
assert(result.alphabet.pad_char != c);
|
||||
result.char_is_ignored[c] = true;
|
||||
}
|
||||
|
||||
return result;
|
||||
}
|
||||
};
|
||||
|
||||
/// For use with ::decodeWithIgnore.
|
||||
/// If no characters end up being ignored, this will be the exact decoded size.
|
||||
pub fn calcDecodedSizeUpperBound(encoded_len: usize) -> %usize {
|
||||
return @divTrunc(encoded_len, 4) * 3;
|
||||
}
|
||||
|
||||
error OutputTooSmall;
|
||||
/// Invalid characters that are not ignored results in error.InvalidCharacter.
|
||||
/// Invalid padding results in error.InvalidPadding.
|
||||
/// Decoding more data than can fit in dest results in error.OutputTooSmall. See also ::calcDecodedSizeUpperBound.
|
||||
/// Returns the number of bytes writen to dest.
|
||||
pub fn decodeWithIgnore(dest: []u8, source: []const u8, alphabet_with_ignore: &const Base64AlphabetWithIgnore) -> %usize {
|
||||
const alphabet = &const alphabet_with_ignore.alphabet;
|
||||
|
||||
var src_cursor: usize = 0;
|
||||
var dest_cursor: usize = 0;
|
||||
|
||||
while (true) {
|
||||
// get the next 4 chars, if available
|
||||
var next_4_chars: [4]u8 = undefined;
|
||||
var available_chars: usize = 0;
|
||||
var pad_char_count: usize = 0;
|
||||
while (available_chars < 4 and src_cursor < source.len) {
|
||||
var c = source[src_cursor];
|
||||
src_cursor += 1;
|
||||
|
||||
if (alphabet.char_in_alphabet[c]) {
|
||||
// normal char
|
||||
next_4_chars[available_chars] = c;
|
||||
available_chars += 1;
|
||||
} else if (alphabet_with_ignore.char_is_ignored[c]) {
|
||||
// we're told to skip this one
|
||||
continue;
|
||||
} else if (c == alphabet.pad_char) {
|
||||
// the padding has begun. count the pad chars.
|
||||
pad_char_count += 1;
|
||||
while (src_cursor < source.len) {
|
||||
c = source[src_cursor];
|
||||
src_cursor += 1;
|
||||
if (c == alphabet.pad_char) {
|
||||
pad_char_count += 1;
|
||||
if (pad_char_count > 2) return error.InvalidCharacter;
|
||||
} else if (alphabet_with_ignore.char_is_ignored[c]) {
|
||||
// we can even ignore chars during the padding
|
||||
continue;
|
||||
} else return error.InvalidCharacter;
|
||||
}
|
||||
break;
|
||||
} else return error.InvalidCharacter;
|
||||
}
|
||||
|
||||
switch (available_chars) {
|
||||
4 => {
|
||||
// common case
|
||||
if (dest_cursor + 3 > dest.len) return error.OutputTooSmall;
|
||||
assert(pad_char_count == 0);
|
||||
dest[dest_cursor + 0] = alphabet.char_to_index[next_4_chars[0]] << 2 |
|
||||
alphabet.char_to_index[next_4_chars[1]] >> 4;
|
||||
dest[dest_cursor + 1] = alphabet.char_to_index[next_4_chars[1]] << 4 |
|
||||
alphabet.char_to_index[next_4_chars[2]] >> 2;
|
||||
dest[dest_cursor + 2] = alphabet.char_to_index[next_4_chars[2]] << 6 |
|
||||
alphabet.char_to_index[next_4_chars[3]];
|
||||
dest_cursor += 3;
|
||||
continue;
|
||||
},
|
||||
3 => {
|
||||
if (dest_cursor + 2 > dest.len) return error.OutputTooSmall;
|
||||
if (pad_char_count != 1) return error.InvalidPadding;
|
||||
dest[dest_cursor + 0] = alphabet.char_to_index[next_4_chars[0]] << 2 |
|
||||
alphabet.char_to_index[next_4_chars[1]] >> 4;
|
||||
dest[dest_cursor + 1] = alphabet.char_to_index[next_4_chars[1]] << 4 |
|
||||
alphabet.char_to_index[next_4_chars[2]] >> 2;
|
||||
if (alphabet.char_to_index[next_4_chars[2]] << 6 != 0) return error.InvalidPadding;
|
||||
dest_cursor += 2;
|
||||
break;
|
||||
},
|
||||
2 => {
|
||||
if (dest_cursor + 1 > dest.len) return error.OutputTooSmall;
|
||||
if (pad_char_count != 2) return error.InvalidPadding;
|
||||
dest[dest_cursor + 0] = alphabet.char_to_index[next_4_chars[0]] << 2 |
|
||||
alphabet.char_to_index[next_4_chars[1]] >> 4;
|
||||
if (alphabet.char_to_index[next_4_chars[1]] << 4 != 0) return error.InvalidPadding;
|
||||
dest_cursor += 1;
|
||||
break;
|
||||
},
|
||||
1 => {
|
||||
return error.InvalidPadding;
|
||||
},
|
||||
0 => {
|
||||
if (pad_char_count != 0) return error.InvalidPadding;
|
||||
break;
|
||||
},
|
||||
else => unreachable,
|
||||
}
|
||||
}
|
||||
|
||||
assert(src_cursor == source.len);
|
||||
|
||||
return dest_cursor;
|
||||
}
|
||||
|
||||
pub const standard_alphabet_unsafe = Base64AlphabetUnsafe.init(standard_alphabet_chars, standard_pad_char);
|
||||
|
||||
/// For use with ::decodeExactUnsafe.
|
||||
pub const Base64AlphabetUnsafe = struct {
|
||||
/// e.g. 'A' => 0.
|
||||
/// undefined for any value not in the 64 alphabet chars.
|
||||
char_to_index: [256]u8,
|
||||
pad_char: u8,
|
||||
|
||||
pub fn init(alphabet_chars: []const u8, pad_char: u8) -> Base64AlphabetUnsafe {
|
||||
assert(alphabet_chars.len == 64);
|
||||
var result = Base64AlphabetUnsafe {
|
||||
.char_to_index = undefined,
|
||||
.pad_char = pad_char,
|
||||
};
|
||||
for (alphabet_chars) |c, i| {
|
||||
assert(c != pad_char);
|
||||
result.char_to_index[c] = u8(i);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
};
|
||||
|
||||
/// For use with ::decodeExactUnsafe.
|
||||
/// The encoded buffer must be valid.
|
||||
pub fn calcDecodedSizeExactUnsafe(encoded: []const u8, pad_char: u8) -> usize {
|
||||
if (encoded.len == 0) return 0;
|
||||
var result = @divExact(encoded.len, 4) * 3;
|
||||
if (encoded[encoded.len - 1] == pad_char) {
|
||||
result -= 1;
|
||||
if (encoded[encoded.len - 2] == pad_char) {
|
||||
result -= 1;
|
||||
}
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
/// dest.len must be what you get from ::calcDecodedSizeExactUnsafe.
|
||||
/// invalid characters or padding will result in undefined values.
|
||||
pub fn decodeExactUnsafe(dest: []u8, source: []const u8, alphabet: &const Base64AlphabetUnsafe) {
|
||||
assert(dest.len == calcDecodedSizeExactUnsafe(source, alphabet.pad_char));
|
||||
|
||||
var src_index: usize = 0;
|
||||
var dest_index: usize = 0;
|
||||
var in_buf_len: usize = source.len;
|
||||
|
||||
while (in_buf_len > 0 and source[in_buf_len - 1] == pad_char) {
|
||||
while (in_buf_len > 0 and source[in_buf_len - 1] == alphabet.pad_char) {
|
||||
in_buf_len -= 1;
|
||||
}
|
||||
|
||||
while (in_buf_len > 4) {
|
||||
dest[dest_index] = ascii6[source[src_index + 0]] << 2 |
|
||||
ascii6[source[src_index + 1]] >> 4;
|
||||
dest[dest_index] = alphabet.char_to_index[source[src_index + 0]] << 2 |
|
||||
alphabet.char_to_index[source[src_index + 1]] >> 4;
|
||||
dest_index += 1;
|
||||
|
||||
dest[dest_index] = ascii6[source[src_index + 1]] << 4 |
|
||||
ascii6[source[src_index + 2]] >> 2;
|
||||
dest[dest_index] = alphabet.char_to_index[source[src_index + 1]] << 4 |
|
||||
alphabet.char_to_index[source[src_index + 2]] >> 2;
|
||||
dest_index += 1;
|
||||
|
||||
dest[dest_index] = ascii6[source[src_index + 2]] << 6 |
|
||||
ascii6[source[src_index + 3]];
|
||||
dest[dest_index] = alphabet.char_to_index[source[src_index + 2]] << 6 |
|
||||
alphabet.char_to_index[source[src_index + 3]];
|
||||
dest_index += 1;
|
||||
|
||||
src_index += 4;
|
||||
@ -102,85 +334,131 @@ pub fn decodeWithAscii6BitMap(dest: []u8, source: []const u8, ascii6: []const u8
|
||||
}
|
||||
|
||||
if (in_buf_len > 1) {
|
||||
dest[dest_index] = ascii6[source[src_index + 0]] << 2 |
|
||||
ascii6[source[src_index + 1]] >> 4;
|
||||
dest[dest_index] = alphabet.char_to_index[source[src_index + 0]] << 2 |
|
||||
alphabet.char_to_index[source[src_index + 1]] >> 4;
|
||||
dest_index += 1;
|
||||
}
|
||||
if (in_buf_len > 2) {
|
||||
dest[dest_index] = ascii6[source[src_index + 1]] << 4 |
|
||||
ascii6[source[src_index + 2]] >> 2;
|
||||
dest[dest_index] = alphabet.char_to_index[source[src_index + 1]] << 4 |
|
||||
alphabet.char_to_index[source[src_index + 2]] >> 2;
|
||||
dest_index += 1;
|
||||
}
|
||||
if (in_buf_len > 3) {
|
||||
dest[dest_index] = ascii6[source[src_index + 2]] << 6 |
|
||||
ascii6[source[src_index + 3]];
|
||||
dest[dest_index] = alphabet.char_to_index[source[src_index + 2]] << 6 |
|
||||
alphabet.char_to_index[source[src_index + 3]];
|
||||
dest_index += 1;
|
||||
}
|
||||
|
||||
return dest[0..dest_index];
|
||||
}
|
||||
|
||||
pub fn calcEncodedSize(source_len: usize) -> usize {
|
||||
return (((source_len * 4) / 3 + 3) / 4) * 4;
|
||||
}
|
||||
|
||||
/// Computes the upper bound of the decoded size based only on the encoded length.
|
||||
/// To compute the exact decoded size, see ::calcExactDecodedSize
|
||||
pub fn calcMaxDecodedSize(encoded_len: usize) -> usize {
|
||||
return @divExact(encoded_len * 3, 4);
|
||||
}
|
||||
|
||||
/// Computes the number of decoded bytes there will be. This function must
|
||||
/// be given the encoded buffer because there might be padding
|
||||
/// bytes at the end ('=' in the standard alphabet)
|
||||
pub fn calcExactDecodedSize(encoded: []const u8) -> usize {
|
||||
return calcExactDecodedSizeWithAlphabet(encoded, standard_alphabet);
|
||||
}
|
||||
|
||||
pub fn calcExactDecodedSizeWithAlphabet(encoded: []const u8, alphabet: []const u8) -> usize {
|
||||
assert(alphabet.len == 65);
|
||||
return calcExactDecodedSizeWithPadChar(encoded, alphabet[64]);
|
||||
}
|
||||
|
||||
pub fn calcExactDecodedSizeWithPadChar(encoded: []const u8, pad_char: u8) -> usize {
|
||||
var buf_len = encoded.len;
|
||||
|
||||
while (buf_len > 0 and encoded[buf_len - 1] == pad_char) {
|
||||
buf_len -= 1;
|
||||
}
|
||||
|
||||
return (buf_len * 3) / 4;
|
||||
}
|
||||
|
||||
test "base64" {
|
||||
testBase64();
|
||||
comptime testBase64();
|
||||
@setEvalBranchQuota(5000);
|
||||
%%testBase64();
|
||||
comptime %%testBase64();
|
||||
}
|
||||
|
||||
fn testBase64() {
|
||||
testBase64Case("", "");
|
||||
testBase64Case("f", "Zg==");
|
||||
testBase64Case("fo", "Zm8=");
|
||||
testBase64Case("foo", "Zm9v");
|
||||
testBase64Case("foob", "Zm9vYg==");
|
||||
testBase64Case("fooba", "Zm9vYmE=");
|
||||
testBase64Case("foobar", "Zm9vYmFy");
|
||||
fn testBase64() -> %void {
|
||||
%return testAllApis("", "");
|
||||
%return testAllApis("f", "Zg==");
|
||||
%return testAllApis("fo", "Zm8=");
|
||||
%return testAllApis("foo", "Zm9v");
|
||||
%return testAllApis("foob", "Zm9vYg==");
|
||||
%return testAllApis("fooba", "Zm9vYmE=");
|
||||
%return testAllApis("foobar", "Zm9vYmFy");
|
||||
|
||||
%return testDecodeIgnoreSpace("", " ");
|
||||
%return testDecodeIgnoreSpace("f", "Z g= =");
|
||||
%return testDecodeIgnoreSpace("fo", " Zm8=");
|
||||
%return testDecodeIgnoreSpace("foo", "Zm9v ");
|
||||
%return testDecodeIgnoreSpace("foob", "Zm9vYg = = ");
|
||||
%return testDecodeIgnoreSpace("fooba", "Zm9v YmE=");
|
||||
%return testDecodeIgnoreSpace("foobar", " Z m 9 v Y m F y ");
|
||||
|
||||
// test getting some api errors
|
||||
%return testError("A", error.InvalidPadding);
|
||||
%return testError("AA", error.InvalidPadding);
|
||||
%return testError("AAA", error.InvalidPadding);
|
||||
%return testError("A..A", error.InvalidCharacter);
|
||||
%return testError("AA=A", error.InvalidCharacter);
|
||||
%return testError("AA/=", error.InvalidPadding);
|
||||
%return testError("A/==", error.InvalidPadding);
|
||||
%return testError("A===", error.InvalidCharacter);
|
||||
%return testError("====", error.InvalidCharacter);
|
||||
|
||||
%return testOutputTooSmallError("AA==");
|
||||
%return testOutputTooSmallError("AAA=");
|
||||
%return testOutputTooSmallError("AAAA");
|
||||
%return testOutputTooSmallError("AAAAAA==");
|
||||
}
|
||||
|
||||
fn testBase64Case(expected_decoded: []const u8, expected_encoded: []const u8) {
|
||||
const calculated_decoded_len = calcExactDecodedSize(expected_encoded);
|
||||
assert(calculated_decoded_len == expected_decoded.len);
|
||||
fn testAllApis(expected_decoded: []const u8, expected_encoded: []const u8) -> %void {
|
||||
// encode
|
||||
{
|
||||
var buffer: [0x100]u8 = undefined;
|
||||
var encoded = buffer[0..calcEncodedSize(expected_decoded.len)];
|
||||
encode(encoded, expected_decoded, standard_alphabet_chars, standard_pad_char);
|
||||
assert(mem.eql(u8, encoded, expected_encoded));
|
||||
}
|
||||
|
||||
const calculated_encoded_len = calcEncodedSize(expected_decoded.len);
|
||||
assert(calculated_encoded_len == expected_encoded.len);
|
||||
// decodeExact
|
||||
{
|
||||
var buffer: [0x100]u8 = undefined;
|
||||
var decoded = buffer[0..%return calcDecodedSizeExact(expected_encoded, standard_pad_char)];
|
||||
%return decodeExact(decoded, expected_encoded, standard_alphabet);
|
||||
assert(mem.eql(u8, decoded, expected_decoded));
|
||||
}
|
||||
|
||||
var buf: [100]u8 = undefined;
|
||||
// decodeWithIgnore
|
||||
{
|
||||
const standard_alphabet_ignore_nothing = Base64AlphabetWithIgnore.init(
|
||||
standard_alphabet_chars, standard_pad_char, "");
|
||||
var buffer: [0x100]u8 = undefined;
|
||||
var decoded = buffer[0..%return calcDecodedSizeUpperBound(expected_encoded.len)];
|
||||
var written = %return decodeWithIgnore(decoded, expected_encoded, standard_alphabet_ignore_nothing);
|
||||
assert(written <= decoded.len);
|
||||
assert(mem.eql(u8, decoded[0..written], expected_decoded));
|
||||
}
|
||||
|
||||
const actual_decoded = decode(buf[0..], expected_encoded);
|
||||
assert(actual_decoded.len == expected_decoded.len);
|
||||
assert(mem.eql(u8, expected_decoded, actual_decoded));
|
||||
|
||||
const actual_encoded = encode(buf[0..], expected_decoded);
|
||||
assert(actual_encoded.len == expected_encoded.len);
|
||||
assert(mem.eql(u8, expected_encoded, actual_encoded));
|
||||
// decodeExactUnsafe
|
||||
{
|
||||
var buffer: [0x100]u8 = undefined;
|
||||
var decoded = buffer[0..calcDecodedSizeExactUnsafe(expected_encoded, standard_pad_char)];
|
||||
decodeExactUnsafe(decoded, expected_encoded, standard_alphabet_unsafe);
|
||||
assert(mem.eql(u8, decoded, expected_decoded));
|
||||
}
|
||||
}
|
||||
|
||||
fn testDecodeIgnoreSpace(expected_decoded: []const u8, encoded: []const u8) -> %void {
|
||||
const standard_alphabet_ignore_space = Base64AlphabetWithIgnore.init(
|
||||
standard_alphabet_chars, standard_pad_char, " ");
|
||||
var buffer: [0x100]u8 = undefined;
|
||||
var decoded = buffer[0..%return calcDecodedSizeUpperBound(encoded.len)];
|
||||
var written = %return decodeWithIgnore(decoded, encoded, standard_alphabet_ignore_space);
|
||||
assert(mem.eql(u8, decoded[0..written], expected_decoded));
|
||||
}
|
||||
|
||||
error ExpectedError;
|
||||
fn testError(encoded: []const u8, expected_err: error) -> %void {
|
||||
const standard_alphabet_ignore_space = Base64AlphabetWithIgnore.init(
|
||||
standard_alphabet_chars, standard_pad_char, " ");
|
||||
var buffer: [0x100]u8 = undefined;
|
||||
if (calcDecodedSizeExact(encoded, standard_pad_char)) |decoded_size| {
|
||||
var decoded = buffer[0..decoded_size];
|
||||
if (decodeExact(decoded, encoded, standard_alphabet)) |_| {
|
||||
return error.ExpectedError;
|
||||
} else |err| if (err != expected_err) return err;
|
||||
} else |err| if (err != expected_err) return err;
|
||||
|
||||
if (decodeWithIgnore(buffer[0..], encoded, standard_alphabet_ignore_space)) |_| {
|
||||
return error.ExpectedError;
|
||||
} else |err| if (err != expected_err) return err;
|
||||
}
|
||||
|
||||
fn testOutputTooSmallError(encoded: []const u8) -> %void {
|
||||
const standard_alphabet_ignore_space = Base64AlphabetWithIgnore.init(
|
||||
standard_alphabet_chars, standard_pad_char, " ");
|
||||
var buffer: [0x100]u8 = undefined;
|
||||
var decoded = buffer[0..calcDecodedSizeExactUnsafe(encoded, standard_pad_char) - 1];
|
||||
if (decodeWithIgnore(decoded, encoded, standard_alphabet_ignore_space)) |_| {
|
||||
return error.ExpectedError;
|
||||
} else |err| if (err != error.OutputTooSmall) return err;
|
||||
}
|
||||
|
||||
@ -622,7 +622,7 @@ pub fn symLinkPosix(allocator: &Allocator, existing_path: []const u8, new_path:
|
||||
}
|
||||
|
||||
// here we replace the standard +/ with -_ so that it can be used in a file name
|
||||
const b64_fs_alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=";
|
||||
const b64_fs_alphabet_chars = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_";
|
||||
|
||||
pub fn atomicSymLink(allocator: &Allocator, existing_path: []const u8, new_path: []const u8) -> %void {
|
||||
if (symLink(allocator, existing_path, new_path)) {
|
||||
@ -639,7 +639,7 @@ pub fn atomicSymLink(allocator: &Allocator, existing_path: []const u8, new_path:
|
||||
mem.copy(u8, tmp_path[0..], new_path);
|
||||
while (true) {
|
||||
%return getRandomBytes(rand_buf[0..]);
|
||||
_ = base64.encodeWithAlphabet(tmp_path[new_path.len..], rand_buf, b64_fs_alphabet);
|
||||
base64.encode(tmp_path[new_path.len..], rand_buf, b64_fs_alphabet_chars, base64.standard_pad_char);
|
||||
if (symLink(allocator, existing_path, tmp_path)) {
|
||||
return rename(allocator, tmp_path, new_path);
|
||||
} else |err| {
|
||||
@ -721,7 +721,7 @@ pub fn copyFileMode(allocator: &Allocator, source_path: []const u8, dest_path: [
|
||||
defer allocator.free(tmp_path);
|
||||
mem.copy(u8, tmp_path[0..], dest_path);
|
||||
%return getRandomBytes(rand_buf[0..]);
|
||||
_ = base64.encodeWithAlphabet(tmp_path[dest_path.len..], rand_buf, b64_fs_alphabet);
|
||||
base64.encode(tmp_path[dest_path.len..], rand_buf, b64_fs_alphabet_chars, base64.standard_pad_char);
|
||||
|
||||
var out_file = %return io.File.openWriteMode(tmp_path, mode, allocator);
|
||||
defer out_file.close();
|
||||
|
||||
Loading…
Reference in New Issue
Block a user