bare-buffer 1.2.2 → 1.2.4

package/CMakeLists.txt

@@ -4,6 +4,10 @@ project(bare_buffer C)
 
 include(bare)
 
+if(NOT TARGET utf)
+  add_subdirectory(vendor/libutf EXCLUDE_FROM_ALL)
+endif()
+
 if(NOT TARGET base64)
   add_subdirectory(vendor/libbase64 EXCLUDE_FROM_ALL)
 endif()
@@ -23,6 +27,7 @@ target_sources(
 target_include_directories(
   bare_buffer
   PRIVATE
+    $<TARGET_PROPERTY:utf,INTERFACE_INCLUDE_DIRECTORIES>
     $<TARGET_PROPERTY:base64,INTERFACE_INCLUDE_DIRECTORIES>
     $<TARGET_PROPERTY:hex,INTERFACE_INCLUDE_DIRECTORIES>
 )

package/binding.c

@@ -6,6 +6,7 @@
 #include <js/ffi.h>
 #include <stdlib.h>
 #include <string.h>
+#include <utf.h>
 
 static void
 bare_buffer_set_zero_fill_enabled_fast (js_ffi_receiver_t *receiver, uint32_t enabled) {
@@ -80,7 +81,7 @@ bare_buffer_to_string_utf8 (js_env_t *env, js_callback_info_t *info) {
   assert(argc == 1);
 
   size_t str_len;
-  char *str;
+  utf8_t *str;
   err = js_get_typedarray_info(env, argv[0], NULL, (void **) &str, &str_len, NULL, NULL);
   assert(err == 0);
 
@@ -119,6 +120,64 @@ bare_buffer_write_utf8 (js_env_t *env, js_callback_info_t *info) {
   return result;
 }
 
+static js_value_t *
+bare_buffer_to_string_utf16le (js_env_t *env, js_callback_info_t *info) {
+  int err;
+
+  size_t argc = 1;
+  js_value_t *argv[1];
+
+  err = js_get_callback_info(env, info, &argc, argv, NULL, NULL);
+  assert(err == 0);
+
+  assert(argc == 1);
+
+  size_t str_len;
+  utf16_t *str;
+  err = js_get_typedarray_info(env, argv[0], NULL, (void **) &str, &str_len, NULL, NULL);
+  assert(err == 0);
+
+  str_len /= sizeof(utf16_t);
+
+  js_value_t *result;
+  err = js_create_string_utf16le(env, str, str_len, &result);
+  assert(err == 0);
+
+  return result;
+}
+
+static js_value_t *
+bare_buffer_write_utf16le (js_env_t *env, js_callback_info_t *info) {
+  int err;
+
+  size_t argc = 2;
+  js_value_t *argv[2];
+
+  err = js_get_callback_info(env, info, &argc, argv, NULL, NULL);
+  assert(err == 0);
+
+  assert(argc == 2);
+
+  size_t buf_len;
+  void *buf;
+  err = js_get_typedarray_info(env, argv[0], NULL, &buf, &buf_len, NULL, NULL);
+  assert(err == 0);
+
+  buf_len /= sizeof(utf16_t);
+
+  size_t str_len;
+  err = js_get_value_string_utf16le(env, argv[1], buf, buf_len, &str_len);
+  assert(err == 0);
+
+  str_len *= sizeof(utf16_t);
+
+  js_value_t *result;
+  err = js_create_uint32(env, (uint32_t) str_len, &result);
+  assert(err == 0);
+
+  return result;
+}
+
 static js_value_t *
 bare_buffer_to_string_base64 (js_env_t *env, js_callback_info_t *info) {
   int err;
@@ -140,7 +199,7 @@ bare_buffer_to_string_base64 (js_env_t *env, js_callback_info_t *info) {
   err = base64_encode(buf, buf_len, NULL, &str_len);
   assert(err == 0);
 
-  char *str = malloc(str_len);
+  utf8_t *str = malloc(str_len);
   err = base64_encode(buf, buf_len, str, &str_len);
   assert(err == 0);
 
@@ -174,7 +233,7 @@ bare_buffer_write_base64 (js_env_t *env, js_callback_info_t *info) {
   err = js_get_value_string_utf8(env, argv[1], NULL, 0, &str_len);
   assert(err == 0);
 
-  char *str = malloc(str_len);
+  utf8_t *str = malloc(str_len);
   err = js_get_value_string_utf8(env, argv[1], str, str_len, NULL);
   assert(err == 0);
 
@@ -211,7 +270,7 @@ bare_buffer_to_string_hex (js_env_t *env, js_callback_info_t *info) {
   err = hex_encode(buf, buf_len, NULL, &str_len);
   assert(err == 0);
 
-  char *str = malloc(str_len);
+  utf8_t *str = malloc(str_len);
   err = hex_encode(buf, buf_len, str, &str_len);
   assert(err == 0);
 
@@ -245,7 +304,7 @@ bare_buffer_write_hex (js_env_t *env, js_callback_info_t *info) {
   err = js_get_value_string_utf8(env, argv[1], NULL, 0, &str_len);
   assert(err == 0);
 
-  char *str = malloc(str_len);
+  utf8_t *str = malloc(str_len);
   err = js_get_value_string_utf8(env, argv[1], str, str_len, NULL);
   assert(err == 0);
 
@@ -356,6 +415,16 @@ init (js_env_t *env, js_value_t *exports) {
     js_create_function(env, "writeUTF8", -1, bare_buffer_write_utf8, NULL, &val);
     js_set_named_property(env, exports, "writeUTF8", val);
   }
+  {
+    js_value_t *val;
+    js_create_function(env, "toStringUTF16LE", -1, bare_buffer_to_string_utf16le, NULL, &val);
+    js_set_named_property(env, exports, "toStringUTF16LE", val);
+  }
+  {
+    js_value_t *val;
+    js_create_function(env, "writeUTF16LE", -1, bare_buffer_write_utf16le, NULL, &val);
+    js_set_named_property(env, exports, "writeUTF16LE", val);
+  }
   {
     js_value_t *val;
     js_create_function(env, "toStringBase64", -1, bare_buffer_to_string_base64, NULL, &val);

package/lib/utf16le.js

@@ -1,34 +1,13 @@
+const binding = require('../binding')
+
 exports.byteLength = function byteLength (string) {
   return string.length * 2
 }
 
 exports.toString = function toString (buffer) {
-  const len = buffer.byteLength
-
-  let result = ''
-
-  for (let i = 0; i < len - 1; i += 2) {
-    result += String.fromCharCode(buffer[i] + (buffer[i + 1] * 256))
-  }
-
-  return result
+  return binding.toStringUTF16LE(buffer)
 }
 
 exports.write = function write (buffer, string) {
-  const len = buffer.byteLength
-
-  let units = len
-
-  for (let i = 0; i < string.length; ++i) {
-    if ((units -= 2) < 0) break
-
-    const c = string.charCodeAt(i)
-    const hi = c >> 8
-    const lo = c % 256
-
-    buffer[i * 2] = lo
-    buffer[i * 2 + 1] = hi
-  }
-
-  return len
+  return binding.writeUTF16LE(buffer, string)
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "bare-buffer",
-  "version": "1.2.2",
+  "version": "1.2.4",
   "description": "Native buffers for JavaScript",
   "main": "index.js",
   "files": [
@@ -13,7 +13,9 @@
     "vendor/libbase64/include",
     "vendor/libbase64/src",
     "vendor/libhex/include",
-    "vendor/libhex/src"
+    "vendor/libhex/src",
+    "vendor/libutf/include",
+    "vendor/libutf/src"
   ],
   "scripts": {
     "test": "standard && bare test/all.js",

package/vendor/libbase64/CMakeLists.txt

@@ -2,6 +2,10 @@ cmake_minimum_required(VERSION 3.22)
 
 project(base64 C)
 
+if(NOT TARGET utf)
+  add_subdirectory(vendor/libutf EXCLUDE_FROM_ALL)
+endif()
+
 add_library(base64 OBJECT)
 
 set_target_properties(
@@ -23,6 +27,7 @@ target_include_directories(
   base64
   PUBLIC
     include
+    $<TARGET_PROPERTY:utf,INTERFACE_INCLUDE_DIRECTORIES>
 )
 
 add_library(base64_shared SHARED $<TARGET_OBJECTS:base64>)
@@ -40,6 +45,7 @@ set_target_properties(
   base64_static
   PROPERTIES
   OUTPUT_NAME base64
+  PREFIX lib
 )
 
 install(TARGETS base64_shared base64_static)

package/vendor/libbase64/README.md

@@ -8,4 +8,4 @@ See [`include/base64.h`](include/base64.h) for the public API.
 
 ## License
 
-ISC
+Apache-2.0

package/vendor/libbase64/include/base64.h

@@ -3,16 +3,17 @@
 
 #include <stddef.h>
 #include <stdint.h>
+#include <utf.h>
 
 #ifdef __cplusplus
 extern "C" {
 #endif
 
 int
-base64_encode (const uint8_t *buffer, size_t buffer_len, char *string, size_t *string_len);
+base64_encode (const uint8_t *buffer, size_t buffer_len, utf8_t *string, size_t *string_len);
 
 int
-base64_decode (const char *string, size_t string_len, uint8_t *buffer, size_t *buffer_len);
+base64_decode (const utf8_t *string, size_t string_len, uint8_t *buffer, size_t *buffer_len);
 
 #ifdef __cplusplus
 }

package/vendor/libbase64/src/base64.c

@@ -1,6 +1,7 @@
 #include <stdbool.h>
 #include <stddef.h>
 #include <stdint.h>
+#include <utf.h>
 
 #include "../include/base64.h"
 
@@ -9,7 +10,7 @@ static const char base64_alphabet[64] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklm
 static const char base64_inverse_alphabet[256] = {-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, -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, -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, -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};
 
 int
-base64_encode (const uint8_t *buffer, size_t buffer_len, char *string, size_t *string_len) {
+base64_encode (const uint8_t *buffer, size_t buffer_len, utf8_t *string, size_t *string_len) {
   size_t len = 4 * ((buffer_len + 2) / 3);
 
   if (string == NULL) {
@@ -52,7 +53,7 @@ base64_encode (const uint8_t *buffer, size_t buffer_len, char *string, size_t *s
 }
 
 int
-base64_decode (const char *string, size_t string_len, uint8_t *buffer, size_t *buffer_len) {
+base64_decode (const utf8_t *string, size_t string_len, uint8_t *buffer, size_t *buffer_len) {
   if (string_len % 4 != 0) return -1;
 
   if (string_len == 0) {
@@ -82,7 +83,7 @@ base64_decode (const char *string, size_t string_len, uint8_t *buffer, size_t *b
     for (size_t j = 0; j < 4; j++) {
       chunk[j] = string[i + j] == '=' ? 0 : base64_inverse_alphabet[string[i + j]];
 
-      if (chunk[j] == -1) return -1;
+      if (chunk[j] == (char) -1) return -1;
     }
 
     uint32_t triple = (chunk[0] << 3 * 6) + (chunk[1] << 2 * 6) + (chunk[2] << 1 * 6) + (chunk[3] << 0 * 6);

package/vendor/libhex/CMakeLists.txt

@@ -2,6 +2,10 @@ cmake_minimum_required(VERSION 3.22)
 
 project(hex C)
 
+if(NOT TARGET utf)
+  add_subdirectory(vendor/libutf EXCLUDE_FROM_ALL)
+endif()
+
 add_library(hex OBJECT)
 
 set_target_properties(
@@ -23,6 +27,7 @@ target_include_directories(
   hex
   PUBLIC
     include
+    $<TARGET_PROPERTY:utf,INTERFACE_INCLUDE_DIRECTORIES>
 )
 
 add_library(hex_shared SHARED $<TARGET_OBJECTS:hex>)
@@ -40,6 +45,7 @@ set_target_properties(
   hex_static
   PROPERTIES
   OUTPUT_NAME hex
+  PREFIX lib
 )
 
 install(TARGETS hex_shared hex_static)

package/vendor/libhex/README.md

@@ -8,4 +8,4 @@ See [`include/hex.h`](include/hex.h) for the public API.
 
 ## License
 
-ISC
+Apache-2.0

package/vendor/libhex/include/hex.h

@@ -3,16 +3,17 @@
 
 #include <stddef.h>
 #include <stdint.h>
+#include <utf.h>
 
 #ifdef __cplusplus
 extern "C" {
 #endif
 
 int
-hex_encode (const uint8_t *buffer, size_t buffer_len, char *string, size_t *string_len);
+hex_encode (const uint8_t *buffer, size_t buffer_len, utf8_t *string, size_t *string_len);
 
 int
-hex_decode (const char *string, size_t string_len, uint8_t *buffer, size_t *buffer_len);
+hex_decode (const utf8_t *string, size_t string_len, uint8_t *buffer, size_t *buffer_len);
 
 #ifdef __cplusplus
 }

package/vendor/libhex/src/hex.c

@@ -1,6 +1,7 @@
 #include <stdbool.h>
 #include <stddef.h>
 #include <stdint.h>
+#include <utf.h>
 
 #include "../include/hex.h"
 
@@ -9,7 +10,7 @@ static const char hex_alphabet[16] = "0123456789abcdef";
 static const char hex_inverse_alphabet[256] = {-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, -1, -1, -1, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, -1, -1, -1, -1, -1, -1, -1, 10, 11, 12, 13, 14, 15, -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, 10, 11, 12, 13, 14, 15, -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, -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, -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, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1};
 
 int
-hex_encode (const uint8_t *buffer, size_t buffer_len, char *string, size_t *string_len) {
+hex_encode (const uint8_t *buffer, size_t buffer_len, utf8_t *string, size_t *string_len) {
   size_t len = buffer_len * 2;
 
   if (string == NULL) {
@@ -36,7 +37,7 @@ hex_encode (const uint8_t *buffer, size_t buffer_len, char *string, size_t *stri
 }
 
 int
-hex_decode (const char *string, size_t string_len, uint8_t *buffer, size_t *buffer_len) {
+hex_decode (const utf8_t *string, size_t string_len, uint8_t *buffer, size_t *buffer_len) {
   size_t len = string_len >> 1;
 
   if (buffer == NULL) {
@@ -56,7 +57,7 @@ hex_decode (const char *string, size_t string_len, uint8_t *buffer, size_t *buff
     for (size_t j = 0; j < 2; j++) {
       chunk[j] = i + j < n ? hex_inverse_alphabet[string[i + j]] : 0;
 
-      if (chunk[j] == -1) return -1;
+      if (chunk[j] == (char) -1) return -1;
     }
 
     buffer[k++] = (chunk[0] << 4) | chunk[1];

package/vendor/libutf/CMakeLists.txt

@@ -0,0 +1,59 @@
+cmake_minimum_required(VERSION 3.25)
+
+project(utf C)
+
+add_library(utf OBJECT)
+
+set_target_properties(
+  utf
+  PROPERTIES
+  C_STANDARD 99
+  POSITION_INDEPENDENT_CODE ON
+)
+
+target_sources(
+  utf
+  INTERFACE
+    include/utf.h
+  PRIVATE
+    src/endianness.c
+    src/utf8/utf16-convert.c
+    src/utf8/utf16-length.c
+    src/utf8/validate.c
+    src/utf16/utf8-convert.c
+    src/utf16/utf8-length.c
+    src/utf16/validate.c
+)
+
+target_include_directories(
+  utf
+  PUBLIC
+    include
+)
+
+add_library(utf_shared SHARED $<TARGET_OBJECTS:utf>)
+
+set_target_properties(
+  utf_shared
+  PROPERTIES
+  OUTPUT_NAME utf
+  WINDOWS_EXPORT_ALL_SYMBOLS ON
+)
+
+add_library(utf_static STATIC $<TARGET_OBJECTS:utf>)
+
+set_target_properties(
+  utf_static
+  PROPERTIES
+  OUTPUT_NAME utf
+  PREFIX lib
+)
+
+install(TARGETS utf_shared utf_static)
+
+install(FILES include/utf.h DESTINATION include)
+
+if(PROJECT_IS_TOP_LEVEL)
+  enable_testing()
+  add_subdirectory(test)
+endif()

package/vendor/libutf/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/vendor/libutf/README.md

@@ -0,0 +1,11 @@
+# libutf
+
+Small library for working with Unicode in C.
+
+## API
+
+See [`include/utf.h`](include/utf.h) for the public API.
+
+## License
+
+Apache-2.0

package/vendor/libutf/include/utf/endianness.h

@@ -0,0 +1,46 @@
+#ifndef UTF_ENDIANNESS_H
+#define UTF_ENDIANNESS_H
+
+#include <stdbool.h>
+#include <stdint.h>
+
+typedef enum {
+  utf_le,
+  utf_be
+} utf_endianness_t;
+
+inline utf_endianness_t
+utf_endianness (void) {
+  const union {
+    uint8_t u8[2];
+    uint16_t u16;
+  } byte_order = {{1, 0}};
+
+  return byte_order.u16 == 1 ? utf_le : utf_be;
+}
+
+inline bool
+utf_is_le (void) {
+  return utf_endianness() == utf_le;
+}
+
+inline bool
+utf_is_be (void) {
+  return utf_endianness() == utf_be;
+}
+
+inline uint16_t
+utf_swap_uint16 (uint16_t n) {
+  return ((n & 0x00ff) << 8) |
+         ((n & 0xff00) >> 8);
+}
+
+inline uint32_t
+utf_swap_uint32 (uint32_t n) {
+  return ((n & 0x000000ff) << 24) |
+         ((n & 0x0000ff00) << 8) |
+         ((n & 0x00ff0000) >> 8) |
+         ((n & 0xff000000) >> 24);
+}
+
+#endif // UTF_ENDIANNESS_H

package/vendor/libutf/include/utf.h

@@ -0,0 +1,47 @@
+#ifndef UTF_H
+#define UTF_H
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+
+#include "utf/endianness.h"
+
+typedef uint_least8_t utf8_t;
+typedef uint_least16_t utf16_t;
+
+/**
+ * UTF-8
+ */
+
+bool
+utf8_validate (const utf8_t *data, size_t len);
+
+size_t
+utf8_length_from_utf16le (const utf16_t *data, size_t len);
+
+size_t
+utf8_convert_to_utf16le (const utf8_t *data, size_t len, utf16_t *result);
+
+/**
+ * UTF-16
+ */
+
+bool
+utf16le_validate (const utf16_t *data, size_t len);
+
+size_t
+utf16_length_from_utf8 (const utf8_t *data, size_t len);
+
+size_t
+utf16le_convert_to_utf8 (const utf16_t *data, size_t len, utf8_t *result);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // UTF_H

package/vendor/libutf/src/endianness.c

@@ -0,0 +1,19 @@
+#include <stdbool.h>
+#include <stdint.h>
+
+#include "../include/utf/endianness.h"
+
+extern utf_endianness_t
+utf_endianness (void);
+
+extern bool
+utf_is_le (void);
+
+extern bool
+utf_is_be (void);
+
+extern uint16_t
+utf_swap_uint16 (uint16_t n);
+
+extern uint32_t
+utf_swap_uint32 (uint32_t n);

package/vendor/libutf/src/utf16/utf8-convert.c

@@ -0,0 +1,76 @@
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+#include <string.h>
+
+#include "../../include/utf.h"
+
+/**
+ * Modified from https://github.com/simdutf/simdutf
+ *
+ * Copyright 2020 The simdutf authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+size_t
+utf16le_convert_to_utf8 (const utf16_t *data, size_t len, utf8_t *result) {
+  size_t pos = 0;
+  uint16_t word, diff;
+  utf8_t *start = result;
+
+  while (pos < len) {
+    if (pos + 4 <= len) {
+      uint64_t v;
+      memcpy(&v, data + pos, sizeof(uint64_t));
+      if (utf_is_be()) v = (v >> 8) | (v << (64 - 8));
+      if ((v & 0xff80ff80ff80ff80) == 0) {
+        size_t final_pos = pos + 4;
+        while (pos < final_pos) {
+          *result++ = utf_is_be() ? utf_swap_uint16(data[pos]) : data[pos];
+          pos++;
+        }
+        continue;
+      }
+    }
+
+    word = utf_is_be() ? utf_swap_uint16(data[pos]) : data[pos];
+    if ((word & 0xff80) == 0) {
+      *result++ = word;
+      pos++;
+    } else if ((word & 0xf800) == 0) {
+      *result++ = (word >> 6) | 0b11000000;
+      *result++ = (word & 0b111111) | 0b10000000;
+      pos++;
+    } else if ((word & 0xf800) != 0xd800) {
+      *result++ = (word >> 12) | 0b11100000;
+      *result++ = ((word >> 6) & 0b111111) | 0b10000000;
+      *result++ = (word & 0b111111) | 0b10000000;
+      pos++;
+    } else {
+      diff = word - 0xd800;
+      if (pos + 1 >= len) {
+        return 0;
+      }
+      word = utf_is_be() ? utf_swap_uint16(data[pos + 1]) : data[pos + 1];
+      uint32_t value = (diff << 10) + (word - 0xdc00) + 0x10000;
+      *result++ = (value >> 18) | 0b11110000;
+      *result++ = ((value >> 12) & 0b111111) | 0b10000000;
+      *result++ = ((value >> 6) & 0b111111) | 0b10000000;
+      *result++ = (value & 0b111111) | 0b10000000;
+      pos += 2;
+    }
+  }
+
+  return result - start;
+}

package/vendor/libutf/src/utf16/utf8-length.c

@@ -0,0 +1,44 @@
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+
+#include "../../include/utf.h"
+
+/**
+ * Modified from https://github.com/simdutf/simdutf
+ *
+ * Copyright 2020 The simdutf authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+size_t
+utf8_length_from_utf16le (const utf16_t *data, size_t len) {
+  size_t counter = 0;
+  uint16_t word;
+
+  for (size_t i = 0; i < len; i++) {
+    word = utf_is_be() ? utf_swap_uint16(data[i]) : data[i];
+    if (word <= 0x7f) {
+      counter++;
+    } else if (word <= 0x7ff) {
+      counter += 2;
+    } else if ((word <= 0xd7ff) || (word >= 0xe000)) {
+      counter += 3;
+    } else {
+      counter += 2;
+    }
+  }
+
+  return counter;
+}

package/vendor/libutf/src/utf16/validate.c

@@ -0,0 +1,52 @@
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+
+#include "../../include/utf.h"
+
+/**
+ * Modified from https://github.com/simdutf/simdutf
+ *
+ * Copyright 2020 The simdutf authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+bool
+utf16le_validate (const utf16_t *data, size_t len) {
+  uint64_t pos = 0;
+  uint16_t word, diff;
+
+  while (pos < len) {
+    word = utf_is_be() ? utf_swap_uint16(data[pos]) : data[pos];
+    if ((word & 0xf800) == 0xd800) {
+      if (pos + 1 >= len) {
+        return false;
+      }
+      diff = word - 0xd800;
+      if (diff > 0x3ff) {
+        return false;
+      }
+      word = utf_is_be() ? utf_swap_uint16(data[pos + 1]) : data[pos + 1];
+      diff = word - 0xdc00;
+      if (diff > 0x3ff) {
+        return false;
+      }
+      pos += 2;
+    } else {
+      pos++;
+    }
+  }
+
+  return true;
+}

package/vendor/libutf/src/utf8/utf16-convert.c

@@ -0,0 +1,89 @@
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+#include <string.h>
+
+#include "../../include/utf.h"
+
+/**
+ * Modified from https://github.com/simdutf/simdutf
+ *
+ * Copyright 2020 The simdutf authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+size_t
+utf8_convert_to_utf16le (const utf8_t *data, size_t len, utf16_t *result) {
+  size_t pos = 0;
+  utf16_t *start = result;
+
+  while (pos < len) {
+    if (pos + 8 <= len) {
+      uint64_t v;
+      memcpy(&v, data + pos, sizeof(uint64_t));
+      if ((v & 0x8080808080808080) == 0) {
+        size_t final_pos = pos + 8;
+        while (pos < final_pos) {
+          *result++ = utf_is_be() ? utf_swap_uint16(data[pos]) : data[pos];
+          pos++;
+        }
+        continue;
+      }
+    }
+    uint8_t leading_byte = data[pos];
+    if (leading_byte < 0b10000000) {
+      *result++ = utf_is_be() ? utf_swap_uint16(leading_byte) : leading_byte;
+      pos++;
+    } else if ((leading_byte & 0b11100000) == 0b11000000) {
+      if (pos + 1 >= len) {
+        break;
+      }
+      uint16_t code_point = ((leading_byte & 0b00011111) << 6) | (data[pos + 1] & 0b00111111);
+      if (utf_is_be()) {
+        code_point = utf_swap_uint16(code_point);
+      }
+      *result++ = code_point;
+      pos += 2;
+    } else if ((leading_byte & 0b11110000) == 0b11100000) {
+      if (pos + 2 >= len) {
+        break;
+      }
+      uint16_t code_point = ((leading_byte & 0b00001111) << 12) | ((data[pos + 1] & 0b00111111) << 6) | (data[pos + 2] & 0b00111111);
+      if (utf_is_be()) {
+        code_point = utf_swap_uint16(code_point);
+      }
+      *result++ = code_point;
+      pos += 3;
+    } else if ((leading_byte & 0b11111000) == 0b11110000) {
+      if (pos + 3 >= len) {
+        break;
+      }
+      uint32_t code_point = ((leading_byte & 0b00000111) << 18) | ((data[pos + 1] & 0b00111111) << 12) | ((data[pos + 2] & 0b00111111) << 6) | (data[pos + 3] & 0b00111111);
+      code_point -= 0x10000;
+      uint16_t high_surrogate = 0xd800 + (code_point >> 10);
+      uint16_t low_surrogate = 0xdc00 + (code_point & 0x3ff);
+      if (utf_is_be()) {
+        high_surrogate = utf_swap_uint16(high_surrogate);
+        low_surrogate = utf_swap_uint16(low_surrogate);
+      }
+      *result++ = high_surrogate;
+      *result++ = low_surrogate;
+      pos += 4;
+    } else {
+      return 0;
+    }
+  }
+
+  return result - start;
+}

package/vendor/libutf/src/utf8/utf16-length.c

@@ -0,0 +1,39 @@
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+
+#include "../../include/utf.h"
+
+/**
+ * Modified from https://github.com/simdutf/simdutf
+ *
+ * Copyright 2020 The simdutf authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+size_t
+utf16_length_from_utf8 (const utf8_t *data, size_t len) {
+  size_t counter = 0;
+
+  for (size_t i = 0; i < len; i++) {
+    if ((int8_t) data[i] > -65) {
+      counter++;
+    }
+    if (data[i] >= 240) {
+      counter++;
+    }
+  }
+
+  return counter;
+}

package/vendor/libutf/src/utf8/validate.c

@@ -0,0 +1,107 @@
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+#include <string.h>
+
+#include "../../include/utf.h"
+
+/**
+ * Modified from https://github.com/simdutf/simdutf
+ *
+ * Copyright 2020 The simdutf authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+bool
+utf8_validate (const utf8_t *data, size_t len) {
+  uint64_t pos = 0;
+  uint32_t code_point;
+  uint8_t word;
+
+  while (pos < len) {
+    uint64_t next_pos = pos + 16;
+    if (next_pos <= len) {
+      uint64_t v1;
+      memcpy(&v1, data + pos, sizeof(uint64_t));
+      uint64_t v2;
+      memcpy(&v2, data + pos + sizeof(uint64_t), sizeof(uint64_t));
+      uint64_t v = v1 | v2;
+      if ((v & 0x8080808080808080) == 0) {
+        pos = next_pos;
+        continue;
+      }
+    }
+
+    word = data[pos];
+    while (word < 0b10000000) {
+      if (++pos == len) return true;
+      word = data[pos];
+    }
+
+    if ((word & 0b11100000) == 0b11000000) {
+      next_pos = pos + 2;
+      if (next_pos > len) {
+        return false;
+      }
+      if ((data[pos + 1] & 0b11000000) != 0b10000000) {
+        return false;
+      }
+      code_point = (word & 0b00011111) << 6 | (data[pos + 1] & 0b00111111);
+      if ((code_point < 0x80) || (0x7ff < code_point)) {
+        return false;
+      }
+    } else if ((word & 0b11110000) == 0b11100000) {
+      next_pos = pos + 3;
+      if (next_pos > len) {
+        return false;
+      }
+      if ((data[pos + 1] & 0b11000000) != 0b10000000) {
+        return false;
+      }
+      if ((data[pos + 2] & 0b11000000) != 0b10000000) {
+        return false;
+      }
+      code_point = (word & 0b00001111) << 12 |
+                   (data[pos + 1] & 0b00111111) << 6 |
+                   (data[pos + 2] & 0b00111111);
+      if ((code_point < 0x800) || (0xffff < code_point) || (0xd7ff < code_point && code_point < 0xe000)) {
+        return false;
+      }
+    } else if ((word & 0b11111000) == 0b11110000) {
+      next_pos = pos + 4;
+      if (next_pos > len) {
+        return false;
+      }
+      if ((data[pos + 1] & 0b11000000) != 0b10000000) {
+        return false;
+      }
+      if ((data[pos + 2] & 0b11000000) != 0b10000000) {
+        return false;
+      }
+      if ((data[pos + 3] & 0b11000000) != 0b10000000) {
+        return false;
+      }
+      code_point = (word & 0b00000111) << 18 | (data[pos + 1] & 0b00111111) << 12 |
+                   (data[pos + 2] & 0b00111111) << 6 | (data[pos + 3] & 0b00111111);
+      if (code_point <= 0xffff || 0x10ffff < code_point) {
+        return false;
+      }
+    } else {
+      return false;
+    }
+    pos = next_pos;
+  }
+
+  return true;
+}