|
@@ -0,0 +1,82 @@
|
|
|
|
+/**
|
|
|
|
+ * Copyright (c) 2008-2010 Bjoern Hoehrmann <[email protected]>
|
|
|
|
+ *
|
|
|
|
+ * MIT License
|
|
|
|
+ *
|
|
|
|
+ * 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.
|
|
|
|
+ *
|
|
|
|
+ * See http://bjoern.hoehrmann.de/utf-8/decoder/dfa/ for details.
|
|
|
|
+ */
|
|
|
|
+
|
|
|
|
+#ifdef EMBEDDED_UTF8_DECODE
|
|
|
|
+
|
|
|
|
+#ifndef _UTF8_DECODE_H_
|
|
|
|
+#define _UTF8_DECODE_H_
|
|
|
|
+
|
|
|
|
+#include <stdint.h>
|
|
|
|
+#include <stddef.h>
|
|
|
|
+
|
|
|
|
+#define UTF8_ACCEPT 0
|
|
|
|
+#define UTF8_REJECT 12
|
|
|
|
+
|
|
|
|
+static const uint8_t utf8d[] = {
|
|
|
|
+ // The first part of the table maps bytes to character classes that
|
|
|
|
+ // to reduce the size of the transition table and create bitmasks.
|
|
|
|
+ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
|
|
|
|
+ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
|
|
|
|
+ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
|
|
|
|
+ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
|
|
|
|
+ 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,
|
|
|
|
+ 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
|
|
|
|
+ 8,8,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
|
|
|
|
+ 10,3,3,3,3,3,3,3,3,3,3,3,3,4,3,3, 11,6,6,6,5,8,8,8,8,8,8,8,8,8,8,8,
|
|
|
|
+
|
|
|
|
+ // The second part is a transition table that maps a combination
|
|
|
|
+ // of a state of the automaton and a character class to a state.
|
|
|
|
+ 0,12,24,36,60,96,84,12,12,12,48,72, 12,12,12,12,12,12,12,12,12,12,12,12,
|
|
|
|
+ 12, 0,12,12,12,12,12, 0,12, 0,12,12, 12,24,12,12,12,12,12,24,12,24,12,12,
|
|
|
|
+ 12,12,12,12,12,12,12,24,12,12,12,12, 12,24,12,12,12,12,12,12,12,24,12,12,
|
|
|
|
+ 12,12,12,12,12,12,12,36,12,36,12,12, 12,36,12,12,12,12,12,36,12,36,12,12,
|
|
|
|
+ 12,36,12,12,12,12,12,12,12,12,12,12,
|
|
|
|
+};
|
|
|
|
+
|
|
|
|
+static inline uint32_t decode(uint32_t* state, uint32_t* codep, uint32_t byte)
|
|
|
|
+{
|
|
|
|
+ uint32_t type = utf8d[byte];
|
|
|
|
+
|
|
|
|
+ *codep = (*state != UTF8_ACCEPT) ?
|
|
|
|
+ (byte & 0x3fu) | (*codep << 6) :
|
|
|
|
+ (0xff >> type) & (byte);
|
|
|
|
+
|
|
|
|
+ *state = utf8d[256 + *state + type];
|
|
|
|
+ return *state;
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+static inline int IsUTF8(uint8_t* s, size_t len)
|
|
|
|
+{
|
|
|
|
+ uint32_t codepoint, state = 0;
|
|
|
|
+
|
|
|
|
+ while (len--)
|
|
|
|
+ decode(&state, &codepoint, *s++);
|
|
|
|
+
|
|
|
|
+ return state == UTF8_ACCEPT;
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+#endif
|
|
|
|
+
|
|
|
|
+#endif
|