144 lines
4.6 KiB
C
144 lines
4.6 KiB
C
/*
|
|
* This file is part of the MicroPython project, http://micropython.org/
|
|
*
|
|
* The MIT License (MIT)
|
|
*
|
|
* Copyright (c) 2018 Scott Shawcroft for Adafruit Industries
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
* in the Software without restriction, including without limitation the rights
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
* furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in
|
|
* all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
* THE SOFTWARE.
|
|
*/
|
|
|
|
#include "supervisor/shared/translate/translate.h"
|
|
|
|
#include <stdbool.h>
|
|
#include <stdint.h>
|
|
#include <string.h>
|
|
|
|
#ifndef NO_QSTR
|
|
#include "genhdr/compression.generated.h"
|
|
#endif
|
|
|
|
#include "py/misc.h"
|
|
#include "py/mpprint.h"
|
|
#include "supervisor/serial.h"
|
|
|
|
void serial_write_compressed(const compressed_string_t *compressed) {
|
|
mp_printf(MP_PYTHON_PRINTER, "%S", compressed);
|
|
}
|
|
|
|
STATIC void get_word(int n, const mchar_t **pos, const mchar_t **end) {
|
|
int len = minlen;
|
|
int i = 0;
|
|
*pos = words;
|
|
while (wlencount[i] <= n) {
|
|
n -= wlencount[i];
|
|
*pos += len * wlencount[i];
|
|
i++;
|
|
len++;
|
|
}
|
|
*pos += len * n;
|
|
*end = *pos + len;
|
|
}
|
|
|
|
STATIC int put_utf8(char *buf, int u) {
|
|
if (u >= translation_offstart) {
|
|
u += translation_offset;
|
|
}
|
|
if (u <= 0x7f) {
|
|
*buf = u;
|
|
return 1;
|
|
} else if (word_start <= u && u <= word_end) {
|
|
uint n = (u - word_start);
|
|
const mchar_t *pos, *end;
|
|
get_word(n, &pos, &end);
|
|
int ret = 0;
|
|
// note that at present, entries in the words table are
|
|
// guaranteed not to represent words themselves, so this adds
|
|
// at most 1 level of recursive call
|
|
for (; pos < end; pos++) {
|
|
int len = put_utf8(buf, *pos);
|
|
buf += len;
|
|
ret += len;
|
|
}
|
|
return ret;
|
|
} else if (u <= 0x07ff) {
|
|
*buf++ = 0b11000000 | (u >> 6);
|
|
*buf = 0b10000000 | (u & 0b00111111);
|
|
return 2;
|
|
} else { // u <= 0xffff
|
|
*buf++ = 0b11100000 | (u >> 12);
|
|
*buf++ = 0b10000000 | ((u >> 6) & 0b00111111);
|
|
*buf = 0b10000000 | (u & 0b00111111);
|
|
return 3;
|
|
}
|
|
}
|
|
|
|
uint16_t decompress_length(const compressed_string_t *compressed) {
|
|
#ifndef NO_QSTR
|
|
#if (compress_max_length_bits <= 8)
|
|
return 1 + (compressed->data >> (8 - compress_max_length_bits));
|
|
#else
|
|
return 1 + ((compressed->data * 256 + compressed->tail[0]) >> (16 - compress_max_length_bits));
|
|
#endif
|
|
#endif
|
|
}
|
|
|
|
char *decompress(const compressed_string_t *compressed, char *decompressed) {
|
|
uint8_t this_byte = compress_max_length_bits / 8;
|
|
uint8_t this_bit = 7 - compress_max_length_bits % 8;
|
|
uint8_t b = (&compressed->data)[this_byte] << (compress_max_length_bits % 8);
|
|
uint16_t length = decompress_length(compressed);
|
|
|
|
// Stop one early because the last byte is always NULL.
|
|
for (uint16_t i = 0; i < length - 1;) {
|
|
uint32_t bits = 0;
|
|
uint8_t bit_length = 0;
|
|
uint32_t max_code = lengths[0];
|
|
uint32_t searched_length = lengths[0];
|
|
while (true) {
|
|
bits <<= 1;
|
|
if ((0x80 & b) != 0) {
|
|
bits |= 1;
|
|
}
|
|
b <<= 1;
|
|
bit_length += 1;
|
|
if (this_bit == 0) {
|
|
this_bit = 7;
|
|
this_byte += 1;
|
|
b = (&compressed->data)[this_byte]; // This may read past the end but its never used.
|
|
} else {
|
|
this_bit -= 1;
|
|
}
|
|
if (max_code > 0 && bits < max_code) {
|
|
break;
|
|
}
|
|
max_code = (max_code << 1) + lengths[bit_length];
|
|
searched_length += lengths[bit_length];
|
|
}
|
|
i += put_utf8(decompressed + i, values[searched_length + bits - max_code]);
|
|
}
|
|
|
|
decompressed[length - 1] = '\0';
|
|
return decompressed;
|
|
}
|
|
|
|
#if CIRCUITPY_TRANSLATE_OBJECT == 1
|
|
#include "supervisor/shared/translate/translate_impl.h"
|
|
#endif
|