ffi-hydrogen 0.1.0

data/vendor/stringencoders/src/modp_burl_gen.c

@@ -0,0 +1,121 @@
+#include "arraytoc.h"
+
+static void hexencodemap(void)
+{
+    static const char sHexChars[] = "0123456789ABCDEF";
+    int i;
+    char hexEncode1[256];
+    char hexEncode2[256];
+    for (i = 0; i < 256; ++i) {
+        hexEncode1[i] = sHexChars[i >> 4];
+        hexEncode2[i] = sHexChars[i & 0x0f];
+    }
+
+    char_array_to_c(hexEncode1, sizeof(hexEncode1), "gsHexEncodeMap1");
+    char_array_to_c(hexEncode2, sizeof(hexEncode2), "gsHexEncodeMap2");
+}
+
+static void urlencodemap(void)
+{
+    uint32_t i;
+    char urlEncodeMap[256];
+
+    /* 0 means unsafe */
+    for (i = 0; i < 256; ++i) {
+        urlEncodeMap[i] = 0;
+    }
+
+    /* upper case */
+    for (i = 'A'; i <= 'Z'; ++i) {
+        urlEncodeMap[i] = (char)i;
+    }
+    /* lower case */
+    for (i = 'a'; i <= 'z'; ++i) {
+        urlEncodeMap[i] = (char)i;
+    }
+    /* numbers */
+    for (i = '0'; i <= '9'; ++i) {
+        urlEncodeMap[i] = (char)i;
+    }
+    /* safe chars */
+    urlEncodeMap[(int)'.'] = '.';
+    urlEncodeMap[(int)'-'] = '-';
+    urlEncodeMap[(int)'_'] = '_';
+    /* space is special */
+    urlEncodeMap[(int)' '] = '+';
+
+    char_array_to_c(urlEncodeMap, sizeof(urlEncodeMap), "gsUrlEncodeMap");
+}
+
+static void urlencodeminmap(void)
+{
+    int i;
+    char urlEncodeMap[256];
+    const char safechar[] = { '_', '.', '-', '~',
+        '!', '$', '(', ')', '*', ',', ';',
+        ':', '@', '/', '?' };
+
+    int imax = sizeof(safechar);
+
+    /* 0 means unsafe */
+    for (i = 0; i < 256; ++i) {
+        urlEncodeMap[i] = 0;
+    }
+
+    /* upper case */
+    for (i = 'A'; i <= 'Z'; ++i) {
+        urlEncodeMap[i] = (char)i;
+    }
+    /* lower case */
+    for (i = 'a'; i <= 'z'; ++i) {
+        urlEncodeMap[i] = (char)i;
+    }
+    /* numbers */
+    for (i = '0'; i <= '9'; ++i) {
+        urlEncodeMap[i] = (char)i;
+    }
+
+    /* space */
+    urlEncodeMap[(int)' '] = '+';
+
+    for (i = 0; i < imax; ++i) {
+        urlEncodeMap[(int)(safechar[i])] = safechar[i];
+    }
+
+    char_array_to_c(urlEncodeMap, sizeof(urlEncodeMap), "gsUrlEncodeMinMap");
+}
+
+static void hexdecodemap(void)
+{
+    uint32_t i;
+    uint32_t map[256];
+    for (i = 0; i <= 255; ++i) {
+        map[i] = 256;
+    }
+
+    /* digits */
+    for (i = '0'; i <= '9'; ++i) {
+        map[i] = i - '0';
+    }
+
+    /* upper */
+    for (i = 'A'; i <= 'F'; ++i) {
+        map[i] = i - 'A' + 10;
+    }
+
+    /* lower */
+    for (i = 'a'; i <= 'f'; ++i) {
+        map[i] = i - 'a' + 10;
+    }
+
+    uint32_array_to_c(map, sizeof(map) / sizeof(uint32_t), "gsHexDecodeMap");
+}
+
+int main(void)
+{
+    urlencodemap();
+    urlencodeminmap();
+    hexdecodemap();
+    hexencodemap();
+    return 0;
+}

data/vendor/stringencoders/src/modp_html.c

@@ -0,0 +1,128 @@
+/*
+ * <pre>
+ * modp_html xml decoders
+ * https://github.com/client9/stringencoders
+ *
+ * Copyright &copy; 2013-2016  Nick Galbreath
+ * All rights reserved.
+ * Released under MIT license. See LICENSE for details.
+ * </PRE>
+ */
+#include "modp_html.h"
+#include "modp_html_named_entities.h"
+
+static const int gsHexDecodeMap[256] = {
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 256, 256,
+    256, 256, 256, 256, 256, 10, 11, 12, 13, 14, 15, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 10, 11, 12, 13, 14, 15, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256,
+    256, 256, 256, 256
+};
+
+int modp_html_decode_char_at(const char* src, size_t len, size_t* consumed)
+{
+    if (len == 0 || src == NULL) {
+        *consumed = 0;
+        return -1;
+    }
+
+    *consumed = 1;
+    if (*src != '&' || len < 2) {
+        return (uint8_t)(*src);
+    }
+
+    int val = 0;
+    size_t i;
+    int ch;
+    if (*(src + 1) == '#') {
+        val = 0;
+        if (*(src + 2) == 'x' || *(src + 2) == 'X') {
+            i = 3;
+            ch = (uint8_t)(*(src + 3));
+            ch = gsHexDecodeMap[ch];
+            if (ch == 256) {
+                /* degenerate case  '&#[?]' */
+                return '&';
+            }
+            val = ch;
+            i = 4;
+            while (i < len) {
+                ch = (uint8_t)src[i];
+                if (ch == ';') {
+                    *consumed = i + 1;
+                    return val;
+                }
+                ch = gsHexDecodeMap[ch];
+                if (ch == 256) {
+                    *consumed = i;
+                    return val;
+                }
+                val = (val * 16) + ch;
+                if (val > 0x1000FF) {
+                    return '&';
+                }
+                ++i;
+            }
+            *consumed = i;
+            return val;
+        } else {
+            i = 2;
+            ch = (uint8_t)src[i];
+            if (ch < '0' || ch > '9') {
+                return '&';
+            }
+            val = ch - '0';
+            i += 1;
+            while (i < len) {
+                ch = (uint8_t)src[i];
+                if (ch == ';') {
+                    *consumed = i + 1;
+                    return val;
+                }
+                if (ch < '0' || ch > '9') {
+                    *consumed = i;
+                    return val;
+                }
+                val = (val * 10) + (ch - '0');
+                if (val > 0x1000FF) {
+                    return '&';
+                }
+                ++i;
+            }
+            *consumed = i;
+            return val;
+        }
+    } else {
+        /* case &[^#] -- check for named entity */
+        /* named entities are surprisingly complicated
+         * * case sensitive
+         * * may or maybe end in ";"
+         * * longest match
+         */
+        int codepoint = html_named_entity_decode(src + 1, len - 1, consumed);
+        if (codepoint == 0) {
+            *consumed = 1;
+            return '&';
+        } else {
+            *consumed += 1;
+            return codepoint;
+        }
+    }
+}

data/vendor/stringencoders/src/modp_html.h

@@ -0,0 +1,53 @@
+/**
+ * \file modp_html.h
+ * \brief Experimental HTML decoder
+ *
+ * This is mostly experimental.
+ */
+
+/*
+ * <PRE>
+ * High Performance HTML Decoder (for now)
+ *
+ * Copyright &copy; 2013-2016 Nick Galbreath
+ * All rights reserved.
+ *
+ * https://github.com/client9/stringencoders
+ *
+ * Released under MIT license.  See LICENSE for details.
+ * </PRE>
+ */
+
+#ifndef COM_MODP_STRINGENCODERS_HTML
+#define COM_MODP_STRINGENCODERS_HTML
+
+#include "modp_stdint.h"
+
+#ifdef __cplusplus
+#define BEGIN_C extern "C" {
+#define END_C }
+#else
+#define BEGIN_C
+#define END_C
+#endif
+
+BEGIN_C
+
+/**
+ * \brief HTML decode a single character
+ *
+ * \param[in] str The input string
+ * \param[in] len  The length of the input string, excluding any
+ *   final null byte.
+ * \param[out] Number of characters consumed
+ * \return unicode character value or -1 if error
+ *
+ * Decode numerical entities (decimal or hexadecimal),
+ *   and all named characters
+ *
+ */
+int modp_html_decode_char_at(const char* str, size_t len, size_t* consumed);
+
+END_C
+
+#endif