#include "moar.h" /* UTF-8 Clean-8 is an encoder/decoder that primarily works as the UTF-8 one. * However, upon encountering a byte sequence that will either not decode as * valid UTF-8, or that would not round-trip due to normalization, it will use * NFG synthetics to keep track of the original bytes involved. This means that * encoding back to UTF-8 Clean-8 will be able to recreate the bytes as they * originally existed. The synthetics contain 4 codepoints: * * * The codepoint 0x10FFFD (which is a private use codepoint) * * The codepoint 'x' * * The upper 4 bits of the non-decodable byte as a hex char (0..9A..F) * * The lower 4 bits as the non-decodable byte as a hex char (0..9A..F) * * Under normal UTF-8 encoding, this means the unrepresentable characters will * come out as something like `?xFF`. * * UTF-8 Clean-8 is used in places where MoarVM receives strings from the * environment, command line arguments, and file system queries. */ /* begin not_gerd section (modified from original) // Copyright 2012 not_gerd // see http://irclog.perlgeek.de/perl6/2012-06-04#i_5681122 Permission is granted to use, modify, and / or redistribute at will. This includes removing authorship notices, re-use of code parts in other software (with or without giving credit), and / or creating a commercial product based on it. This permission is not revocable by the author. This software is provided as-is. Use it at your own risk. There is no warranty whatsoever, neither expressed nor implied, and by using this software you accept that the author(s) shall not be held liable for any loss of data, loss of service, or other damages, be they incidental or consequential. Your only option other than accepting this is not to use the software at all. */ enum { CP_CHAR = 1 << 0, CP_LOW_SURROGATE = 1 << 1, CP_HIGH_SURROGATE = 1 << 2, CP_NONCHAR = 1 << 3, CP_OVERFLOW = 1 << 4, U8_SINGLE = 1 << 5, U8_DOUBLE = 1 << 6, U8_TRIPLE = 1 << 7, U8_QUAD = 1 << 8 }; static unsigned classify(MVMCodepoint cp) { if(cp <= 0x7F) return CP_CHAR | U8_SINGLE; if(cp <= 0x07FF) return CP_CHAR | U8_DOUBLE; if(0xD800 <= cp && cp <= 0xDBFF) return CP_HIGH_SURROGATE | U8_TRIPLE; if(0xDC00 <= cp && cp <= 0xDFFF) return CP_LOW_SURROGATE | U8_TRIPLE; if(0xFDD0 <= cp && cp <= 0xFDEF) return CP_NONCHAR | U8_TRIPLE; if(cp <= 0xFFFD) return CP_CHAR | U8_TRIPLE; if(cp == 0xFFFE || cp == 0xFFFF) return CP_NONCHAR | U8_TRIPLE; if(cp <= 0x10FFFF && ((cp & 0xFFFF) == 0xFFFE || (cp & 0xFFFF) == 0xFFFF)) return CP_NONCHAR | U8_QUAD; if(cp <= 0x10FFFF) return CP_CHAR | U8_QUAD; if(cp <= 0x1FFFFF) return CP_OVERFLOW | U8_QUAD; return 0; } static MVMuint32 utf8_encode(MVMuint8 *bp, MVMCodepoint cp) { unsigned cc = classify(cp); if (!(cc & (CP_CHAR | CP_NONCHAR))) return 0; if (cc & U8_SINGLE) { bp[0] = (MVMuint8)cp; return 1; } if (cc & U8_DOUBLE) { bp[0] = (MVMuint8)(( 6 << 5) | (cp >> 6)); bp[1] = (MVMuint8)(( 2 << 6) | (cp & 0x3F)); return 2; } if (cc & U8_TRIPLE) { bp[0] = (MVMuint8)((14 << 4) | (cp >> 12)); bp[1] = (MVMuint8)(( 2 << 6) | ((cp >> 6) & 0x3F)); bp[2] = (MVMuint8)(( 2 << 6) | ( cp & 0x3F)); return 3; } if (cc & U8_QUAD) { bp[0] = (MVMuint8)((30 << 3) | (cp >> 18)); bp[1] = (MVMuint8)(( 2 << 6) | ((cp >> 12) & 0x3F)); bp[2] = (MVMuint8)(( 2 << 6) | ((cp >> 6) & 0x3F)); bp[3] = (MVMuint8)(( 2 << 6) | ( cp & 0x3F)); return 4; } return 0; } /* end not_gerd section */ #define UTF8_MAXINC (32 * 1024 * 1024) static const MVMuint8 hex_chars[] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' }; static MVMGrapheme32 synthetic_for(MVMThreadContext *tc, MVMuint8 invalid) { if (invalid > 0x7F) { /* A real invalid. */ MVMuint8 high = invalid >> 4; MVMuint8 low = invalid & 0x0F; MVMCodepoint cps[] = { 0x10FFFD, 'x', hex_chars[high], hex_chars[low] }; return MVM_nfg_codes_to_grapheme_utf8_c8(tc, cps, 4); } else { /* Was in things thrown out as invalid by the decoder, but has an * ASCII interpretation, so hand it back as is. */ return invalid; } } /* What the UTF-C8 decode process is expecting. */ typedef enum { EXPECT_START = 0, EXPECT_CONTINUATION = 1 } Expecting; /* Decode state for the UTF8-C8 decoder. */ typedef struct { /* The UTF-8 we're decoding. */ const MVMuint8 *utf8; /* The index of the current byte we're decoding. */ size_t cur_byte; /* The index of the first unaccepted byte. */ size_t unaccepted_start; /* What kind of byte we're expecting next. */ Expecting expecting; /* The current codepoint we're decoding. */ MVMCodepoint cur_codepoint; /* The result buffer we're decoding into. */ MVMGrapheme32 *result; /* The current position in the result buffer. */ size_t result_pos; /* Buffer of original codepoints, to ensure we will not spit out any * synthetics into the result that will re-order on round-trip. */ MVMCodepoint *orig_codes; /* Position we're at in inserting into orig_codes. */ size_t orig_codes_pos; /* First orig_codes index that did not yet go through the normalizer. */ size_t orig_codes_unnormalized; /* The normalizer we're using to make synthetics that will not cause an * order change on output. */ MVMNormalizer norm; /* Bad bytes from an earlier buffer, for the sake of streaming decode. */ MVMuint8 prev_bad_bytes[4]; MVMuint32 num_prev_bad_bytes; } DecodeState; /* Appends a single grapheme to the buffer if it will not cause a mismatch * with the original codepoints upon encoding back to UTF-8. Returns non-zero * in this case. Otherwise, appends synthetics for the bytes the original code * points were encoded as. Since we can end up with index mis-matches, we just * spit out codepoints to catch the normalizer up to everything in the orig * codes buffer. */ static int append_grapheme(MVMThreadContext *tc, DecodeState *state, MVMGrapheme32 g) { if (g == state->orig_codes[state->orig_codes_unnormalized]) { /* Easy case: exact match. */ state->result[state->result_pos++] = g; state->orig_codes_unnormalized++; return 1; } else if (g < 0) { MVMNFGSynthetic *synth = MVM_nfg_get_synthetic_info(tc, g); int mismatch = 0; if (synth->codes[0] == state->orig_codes[state->orig_codes_unnormalized]) { MVMint32 i; for (i = 1; i < synth->num_codes; i++) { size_t orig_idx = state->orig_codes_unnormalized + i; if (state->orig_codes_pos <= orig_idx || state->orig_codes[orig_idx] != synth->codes[i]) { mismatch = 1; break; } } } else { mismatch = 1; } if (!mismatch) { state->result[state->result_pos++] = g; state->orig_codes_unnormalized += synth->num_codes; return 1; } } /* If we get here, then normalization would trash the original bytes. */ { /* Spit out synthetics to keep the bytes as is. */ size_t i, j; for (i = state->orig_codes_unnormalized; i < state->orig_codes_pos; i++) { MVMCodepoint to_encode = state->orig_codes[i]; MVMuint8 encoded[4]; MVMuint32 bytes = utf8_encode(encoded, to_encode); for (j = 0; j < bytes; j++) state->result[state->result_pos++] = synthetic_for(tc, encoded[j]); } /* Consider all codes pushed now normalized. */ state->orig_codes_unnormalized = state->orig_codes_pos; /* Put a clean normalizer in place. */ MVM_unicode_normalizer_cleanup(tc, &(state->norm)); MVM_unicode_normalizer_init(tc, &(state->norm), MVM_NORMALIZE_NFG); return 0; } } /* Called when decoding has reached an acceptable codepoint. */ static void process_ok_codepoint(MVMThreadContext *tc, DecodeState *state) { MVMint32 ready; MVMGrapheme32 g; /* Consider the byte range accepted. */ state->unaccepted_start = state->cur_byte + 1; /* Insert into original codepoints list and hand it to the normalizer. */ state->orig_codes[state->orig_codes_pos++] = state->cur_codepoint; ready = MVM_unicode_normalizer_process_codepoint_to_grapheme(tc, &(state->norm), state->cur_codepoint, &g); /* If the normalizer produced some output... */ if (ready) { if (append_grapheme(tc, state, g)) { while (--ready > 0) { g = MVM_unicode_normalizer_get_grapheme(tc, &(state->norm)); if (!append_grapheme(tc, state, g)) break; } } } /* We've no longer any bad bytes to care about from earlier buffers; * they ended up making an acceptable codepoint. */ state->num_prev_bad_bytes = 0; } /* Called when a bad byte has been encountered, or at the end of output. */ static void process_bad_bytes(MVMThreadContext *tc, DecodeState *state) { size_t i; MVMint32 ready; /* Flush normalization buffer and take from that. */ MVM_unicode_normalizer_eof(tc, &(state->norm)); ready = MVM_unicode_normalizer_available(tc, &(state->norm)); while (ready-- > 0) { MVMGrapheme32 g = MVM_unicode_normalizer_get_grapheme(tc, &(state->norm)); if (!append_grapheme(tc, state, g)) break; } /* Now add in synthetics for bad bytes. */ for (i = 0; i < state->num_prev_bad_bytes; i++) state->result[state->result_pos++] = synthetic_for(tc, state->prev_bad_bytes[i]); state->num_prev_bad_bytes = 0; for (i = state->unaccepted_start; i <= state->cur_byte; i++) state->result[state->result_pos++] = synthetic_for(tc, state->utf8[i]); state->unaccepted_start = state->cur_byte + 1; } /* Check for if the codepoint is in range. Make sure it's not over 0x10FFFF * and make sure it isn't a Surrogate */ MVM_STATIC_INLINE int in_range (MVMCodepoint cp) { return ( 0 <= cp && cp <= 0x10FFFF) && (cp < 0xD800 || 0xDFFF < cp); /* Surrogates */ } /* Decodes the specified number of bytes of utf8 into an NFG string, creating * a result of the specified type. The type must have the MVMString REPR. */ MVMString * MVM_string_utf8_c8_decode(MVMThreadContext *tc, const MVMObject *result_type, const char *utf8, size_t bytes) { DecodeState state; /* Local state for decode loop. */ int expected_continuations = 0; int min_expected_codepoint = 0; /* Don't do anything if empty. */ if (bytes == 0) return tc->instance->str_consts.empty; /* Decoding state, in a struct to easily pass to utility routines. * Result buffer is a maximum estimate to avoid realloc; we can shrink * it at the end. */ state.utf8 = (MVMuint8 *)utf8; state.cur_byte = 0; state.unaccepted_start = 0; state.expecting = EXPECT_START; state.cur_codepoint = 0; state.result = MVM_malloc(sizeof(MVMGrapheme32) * bytes); state.result_pos = 0; state.orig_codes = MVM_malloc(sizeof(MVMCodepoint) * bytes); state.orig_codes_pos = 0; state.orig_codes_unnormalized = 0; state.num_prev_bad_bytes = 0; MVM_unicode_normalizer_init(tc, &(state.norm), MVM_NORMALIZE_NFG); while (state.cur_byte < bytes) { MVMuint8 decode_byte = utf8[state.cur_byte]; switch (state.expecting) { case EXPECT_START: if ((decode_byte & 0x80) == 0) { /* Single byte sequence. */ state.cur_codepoint = decode_byte; process_ok_codepoint(tc, &state); } else if ((decode_byte & 0xE0) == 0xC0) { state.cur_codepoint = decode_byte & 0x1F; state.expecting = EXPECT_CONTINUATION; expected_continuations = 1; min_expected_codepoint = 0x80; } else if ((decode_byte & 0xF0) == 0xE0) { state.cur_codepoint = decode_byte & 0x0F; state.expecting = EXPECT_CONTINUATION; expected_continuations = 2; min_expected_codepoint = 0x800; } else if ((decode_byte & 0xF8) == 0xF0) { state.cur_codepoint = decode_byte & 0x07; state.expecting = EXPECT_CONTINUATION; expected_continuations = 3; min_expected_codepoint = 0x10000; } else { /* Invalid byte sequence. */ process_bad_bytes(tc, &state); } break; case EXPECT_CONTINUATION: if ((decode_byte & 0xC0) == 0x80) { state.cur_codepoint = (state.cur_codepoint << 6) | (decode_byte & 0x3F); expected_continuations--; if (expected_continuations == 0) { if (min_expected_codepoint <= state.cur_codepoint && in_range(state.cur_codepoint)) process_ok_codepoint(tc, &state); else process_bad_bytes(tc, &state); state.expecting = EXPECT_START; } } else { /* Invalid byte sequence. */ process_bad_bytes(tc, &state); state.expecting = EXPECT_START; } break; } state.cur_byte++; } /* Handle anything dangling off the end. */ state.cur_byte--; /* So we don't read 1 past the end. */ process_bad_bytes(tc, &state); MVM_free(state.orig_codes); MVM_unicode_normalizer_cleanup(tc, &(state.norm)); { MVMString *result = (MVMString *)REPR(result_type)->allocate(tc, STABLE(result_type)); result->body.storage.blob_32 = state.result; result->body.storage_type = MVM_STRING_GRAPHEME_32; result->body.num_graphs = state.result_pos; return result; } } /* Decodes using a decodestream. Decodes as far as it can with the input * buffers, or until a stopper is reached. */ MVMuint32 MVM_string_utf8_c8_decodestream(MVMThreadContext *tc, MVMDecodeStream *ds, const MVMuint32 *stopper_chars, MVMDecodeStreamSeparators *seps, MVMint32 eof) { /* Local state for decode loop. */ MVMDecodeStreamBytes *cur_bytes; MVMDecodeStreamBytes *last_accept_bytes = ds->bytes_head; MVMint32 last_accept_pos = ds->bytes_head_pos; DecodeState state; int expected_continuations = 0; int min_expected_codepoint = 0; MVMuint32 reached_stopper = 0; MVMint32 result_graphs = 0; /* If there's no buffers, we're done. */ if (!ds->bytes_head) return 0; /* If we're asked for zero chars, also done. */ if (stopper_chars && *stopper_chars == 0) return 1; /* Otherwise set up decode state, stealing normalizer of the decode * stream and re-instating any past orig_codes. */ state.expecting = EXPECT_START; state.cur_codepoint = 0; state.num_prev_bad_bytes = 0; memcpy(&(state.norm), &(ds->norm), sizeof(MVMNormalizer)); if (ds->decoder_state) { MVMCodepoint *saved = (MVMCodepoint *)ds->decoder_state; state.orig_codes = MVM_malloc( sizeof(MVMCodepoint) * (saved[0] + ds->bytes_head->length) ); state.orig_codes_pos = saved[0]; state.orig_codes_unnormalized = 0; memcpy(state.orig_codes, saved + 1, saved[0] * sizeof(MVMCodepoint)); MVM_free_null(ds->decoder_state); } else { state.orig_codes = NULL; state.orig_codes_pos = 0; state.orig_codes_unnormalized = 0; } /* Decode each of the buffers. */ cur_bytes = ds->bytes_head; reached_stopper = 0; while (cur_bytes && !reached_stopper) { /* Set up decode state for this buffer. */ const MVMuint32 bytes = cur_bytes->length; /* Space for graphemes we have + 1 grapheme we receive from last buffer */ state.result = MVM_malloc((bytes + 1) * sizeof(MVMGrapheme32)); state.orig_codes = MVM_realloc(state.orig_codes, sizeof(MVMCodepoint) * (state.orig_codes_pos + bytes)); state.result_pos = 0; state.utf8 = (const MVMuint8*)cur_bytes->bytes; state.cur_byte = cur_bytes == ds->bytes_head ? ds->bytes_head_pos : 0; state.unaccepted_start = state.cur_byte; /* Process this buffer. */ while (state.cur_byte < bytes) { /* Process a byte. */ MVMuint8 decode_byte = state.utf8[state.cur_byte]; MVMint32 maybe_new_graph = 0; switch (state.expecting) { case EXPECT_START: if ((decode_byte & 0x80) == 0) { /* Single byte sequence. */ state.cur_codepoint = decode_byte; process_ok_codepoint(tc, &state); maybe_new_graph = 1; } else if ((decode_byte & 0xE0) == 0xC0) { state.cur_codepoint = decode_byte & 0x1F; state.expecting = EXPECT_CONTINUATION; expected_continuations = 1; min_expected_codepoint = 0x80; } else if ((decode_byte & 0xF0) == 0xE0) { state.cur_codepoint = decode_byte & 0x0F; state.expecting = EXPECT_CONTINUATION; expected_continuations = 2; min_expected_codepoint = 0x800; } else if ((decode_byte & 0xF8) == 0xF0) { state.cur_codepoint = decode_byte & 0x07; state.expecting = EXPECT_CONTINUATION; expected_continuations = 3; min_expected_codepoint = 0x10000; } else { /* Invalid byte sequence. */ process_bad_bytes(tc, &state); maybe_new_graph = 1; } break; case EXPECT_CONTINUATION: if ((decode_byte & 0xC0) == 0x80) { state.cur_codepoint = (state.cur_codepoint << 6) | (decode_byte & 0x3F); expected_continuations--; if (expected_continuations == 0) { if (state.cur_codepoint >= min_expected_codepoint) process_ok_codepoint(tc, &state); else process_bad_bytes(tc, &state); maybe_new_graph = 1; state.expecting = EXPECT_START; } } else { /* Invalid byte sequence. */ process_bad_bytes(tc, &state); maybe_new_graph = 1; state.expecting = EXPECT_START; } break; } state.cur_byte++; /* See if we've reached a stopper. */ if (maybe_new_graph && state.result_pos > 0) { if (stopper_chars) { if (result_graphs + state.result_pos >= *stopper_chars) { reached_stopper = 1; break; } } if (MVM_string_decode_stream_maybe_sep(tc, seps, state.result[state.result_pos - 1])) { reached_stopper = 1; break; } } } /* If we're at EOF and this is the last buffer, force out last bytes. */ if (eof && !reached_stopper && !cur_bytes->next) { state.cur_byte--; /* So we don't read 1 past the end. */ process_bad_bytes(tc, &state); } /* Attach what we successfully parsed as a result buffer, and trim away * what we chewed through. */ if (state.result_pos) { /* Release memory we didn't use */ if ((bytes + 1) > state.result_pos) state.result = MVM_realloc(state.result,sizeof(MVMGrapheme32) * state.result_pos); MVM_string_decodestream_add_chars(tc, ds, state.result, state.result_pos); } else MVM_free(state.result); result_graphs += state.result_pos; /* Update our accepted position. */ if (state.unaccepted_start > 0) { last_accept_bytes = cur_bytes; last_accept_pos = state.unaccepted_start; } /* If there were bytes we didn't accept, hold on to them in case we * need to emit them as bad bytes. */ if (state.unaccepted_start != state.cur_byte && cur_bytes->next) { size_t i; for (i = state.unaccepted_start; i < state.cur_byte; i++) state.prev_bad_bytes[state.num_prev_bad_bytes++] = state.utf8[i]; } cur_bytes = cur_bytes->next; } /* Eat the bytes we decoded. */ MVM_string_decodestream_discard_to(tc, ds, last_accept_bytes, last_accept_pos); /* Persist current normalizer. */ memcpy(&(ds->norm), &(state.norm), sizeof(MVMNormalizer)); /* Stash away any leftover codepoints we'll need to examine. */ if (state.orig_codes_pos && state.orig_codes_pos != state.orig_codes_unnormalized) { size_t diff = state.orig_codes_pos - state.orig_codes_unnormalized; MVMCodepoint *saved = MVM_malloc(sizeof(MVMCodepoint) * (1 + diff)); saved[0] = diff; memcpy(saved + 1, state.orig_codes + state.orig_codes_unnormalized, diff * sizeof(MVMCodepoint)); ds->decoder_state = saved; } MVM_free(state.orig_codes); return reached_stopper; } /* Encodes the specified string to UTF-8. */ static void emit_cp(MVMThreadContext *tc, MVMCodepoint cp, MVMuint8 **result, size_t *result_pos, size_t *result_limit, MVMuint8 *repl_bytes, MVMuint64 repl_length) { MVMuint32 bytes; if (*result_pos >= *result_limit) { *result_limit *= 2; *result = MVM_realloc(*result, *result_limit + 4); } bytes = utf8_encode(*result + *result_pos, cp); if (bytes) *result_pos += bytes; else if (repl_bytes) { if (repl_length >= *result_limit || *result_pos >= *result_limit - repl_length) { *result_limit += repl_length; *result = MVM_realloc(*result, *result_limit + 4); } memcpy(*result + *result_pos, repl_bytes, repl_length); *result_pos += repl_length; } else { MVM_free(*result); MVM_free(repl_bytes); MVM_string_utf8_throw_encoding_exception(tc, cp); } } static int hex2int(MVMThreadContext *tc, MVMCodepoint cp) { if (cp >= '0' && cp <= '9') return cp - '0'; else if (cp >= 'A' && cp <= 'F') return 10 + (cp - 'A'); else MVM_exception_throw_adhoc(tc, "UTF-8 C-8 encoding encountered corrupt synthetic (%"PRId32")", cp); } char * MVM_string_utf8_c8_encode_substr(MVMThreadContext *tc, MVMString *str, MVMuint64 *output_size, MVMint64 start, MVMint64 length, MVMString *replacement) { MVMuint8 *result; size_t result_pos, result_limit; MVMGraphemeIter gi; MVMStringIndex strgraphs = MVM_string_graphs(tc, str); MVMuint8 *repl_bytes = NULL; MVMuint64 repl_length; if (start < 0 || start > strgraphs) MVM_exception_throw_adhoc(tc, "start (%"PRId64") out of range (0..%"PRIu32")", start, strgraphs); if (length == -1) length = strgraphs; if (length < 0 || start + length > strgraphs) MVM_exception_throw_adhoc(tc, "length (%"PRId64") out of range (0..%"PRIu32")", length, strgraphs); if (replacement) repl_bytes = (MVMuint8 *) MVM_string_utf8_c8_encode_substr(tc, replacement, &repl_length, 0, -1, NULL); /* Guesstimate that we'll be within 2 bytes for most chars most of the * time, and give ourselves 4 bytes breathing space. */ result_limit = 2 * length; result = MVM_malloc(result_limit + 4); result_pos = 0; /* We iterate graphemes, looking out for any synthetics. If we find a * UTF-8 C-8 synthetic, then we spit out the raw byte. If we find any * other synthetic, we iterate its codepoints. */ MVM_string_gi_init(tc, &gi, str); while (MVM_string_gi_has_more(tc, &gi)) { MVMGrapheme32 g = MVM_string_gi_get_grapheme(tc, &gi); if (g >= 0) { emit_cp(tc, g, &result, &result_pos, &result_limit, repl_bytes, repl_length); } else { MVMNFGSynthetic *synth = MVM_nfg_get_synthetic_info(tc, g); if (synth->is_utf8_c8) { /* UTF-8 C-8 synthetic; emit the byte. */ if (result_pos >= result_limit) { result_limit *= 2; result = MVM_realloc(result, result_limit + 1); } result[result_pos++] = (hex2int(tc, synth->codes[2]) << 4) + hex2int(tc, synth->codes[3]); } else { MVMint32 i; for (i = 0; i < synth->num_codes; i++) emit_cp(tc, synth->codes[i], &result, &result_pos, &result_limit, repl_bytes, repl_length); } } } if (output_size) *output_size = (MVMuint64)result_pos; MVM_free(repl_bytes); return (char *)result; } /* Encodes the specified string to UTF-8 C-8. */ char * MVM_string_utf8_c8_encode(MVMThreadContext *tc, MVMString *str, MVMuint64 *output_size) { return MVM_string_utf8_c8_encode_substr(tc, str, output_size, 0, MVM_string_graphs(tc, str), NULL); } /* Encodes the specified string to a UTF-8 C-8 C string. */ char * MVM_string_utf8_c8_encode_C_string(MVMThreadContext *tc, MVMString *str) { MVMuint64 output_size; char * utf8_string = MVM_string_utf8_c8_encode(tc, str, &output_size); utf8_string = MVM_realloc(utf8_string, output_size + 1); utf8_string[output_size] = (char)0; return utf8_string; }