Add 'meshmc/' from commit 'fad6a1066616b69d7f5fef01178efdf014c59537'

git-subtree-dir: meshmc
git-subtree-mainline: 934382c8a1ce738589dee9ee0f14e1cec812770e
git-subtree-split: fad6a1066616b69d7f5fef01178efdf014c59537

19 files changed, 6345 insertions, 0 deletions

diff --git a/meshmc/libraries/hoedown/CMakeLists.txt b/meshmc/libraries/hoedown/CMakeLists.txt
new file mode 100644
index 0000000000..7902e734de
--- /dev/null
+++ b/meshmc/libraries/hoedown/CMakeLists.txt
@@ -0,0 +1,26 @@
+# hoedown 3.0.2 - https://github.com/hoedown/hoedown/archive/3.0.2.tar.gz
+project(hoedown LANGUAGES C VERSION 3.0.2)
+
+set(HOEDOWN_SOURCES
+include/hoedown/autolink.h
+include/hoedown/buffer.h
+include/hoedown/document.h
+include/hoedown/escape.h
+include/hoedown/html.h
+include/hoedown/stack.h
+include/hoedown/version.h
+src/autolink.c
+src/buffer.c
+src/document.c
+src/escape.c
+src/html.c
+src/html_blocks.c
+src/html_smartypants.c
+src/stack.c
+src/version.c
+)
+
+# Include self.
+add_library(hoedown STATIC ${HOEDOWN_SOURCES})
+
+target_include_directories(hoedown PUBLIC ${CMAKE_CURRENT_SOURCE_DIR}/include)
diff --git a/meshmc/libraries/hoedown/LICENSE b/meshmc/libraries/hoedown/LICENSE
new file mode 100644
index 0000000000..4e75de4dfe
--- /dev/null
+++ b/meshmc/libraries/hoedown/LICENSE
@@ -0,0 +1,15 @@
+Copyright (c) 2008, Natacha Porté
+Copyright (c) 2011, Vicent Martí
+Copyright (c) 2014, Xavier Mendez, Devin Torres and the Hoedown authors
+
+Permission to use, copy, modify, and distribute this software for any
+purpose with or without fee is hereby granted, provided that the above
+copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
diff --git a/meshmc/libraries/hoedown/README.md b/meshmc/libraries/hoedown/README.md
new file mode 100644
index 0000000000..abe2b6ca08
--- /dev/null
+++ b/meshmc/libraries/hoedown/README.md
@@ -0,0 +1,9 @@
+Hoedown
+=======
+
+This is Hoedown 3.0.2, taken from [the hoedown github repo](https://github.com/hoedown/hoedown).
+
+`Hoedown` is a revived fork of [Sundown](https://github.com/vmg/sundown),
+the Markdown parser based on the original code of the
+[Upskirt library](http://fossil.instinctive.eu/libupskirt/index)
+by Natacha Porté.
diff --git a/meshmc/libraries/hoedown/include/hoedown/autolink.h b/meshmc/libraries/hoedown/include/hoedown/autolink.h
new file mode 100644
index 0000000000..04015ffc44
--- /dev/null
+++ b/meshmc/libraries/hoedown/include/hoedown/autolink.h
@@ -0,0 +1,65 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ *//* autolink.h - versatile autolinker */
+
+#ifndef HOEDOWN_AUTOLINK_H
+#define HOEDOWN_AUTOLINK_H
+
+#include "buffer.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*************
+ * CONSTANTS *
+ *************/
+
+typedef enum hoedown_autolink_flags {
+	HOEDOWN_AUTOLINK_SHORT_DOMAINS = (1 << 0)
+} hoedown_autolink_flags;
+
+/*************
+ * FUNCTIONS *
+ *************/
+
+/* hoedown_autolink_is_safe: verify that a URL has a safe protocol */
+int hoedown_autolink_is_safe(const uint8_t* data, size_t size);
+
+/* hoedown_autolink__www: search for the next www link in data */
+size_t hoedown_autolink__www(size_t* rewind_p, hoedown_buffer* link,
+							 uint8_t* data, size_t offset, size_t size,
+							 hoedown_autolink_flags flags);
+
+/* hoedown_autolink__email: search for the next email in data */
+size_t hoedown_autolink__email(size_t* rewind_p, hoedown_buffer* link,
+							   uint8_t* data, size_t offset, size_t size,
+							   hoedown_autolink_flags flags);
+
+/* hoedown_autolink__url: search for the next URL in data */
+size_t hoedown_autolink__url(size_t* rewind_p, hoedown_buffer* link,
+							 uint8_t* data, size_t offset, size_t size,
+							 hoedown_autolink_flags flags);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /** HOEDOWN_AUTOLINK_H **/
diff --git a/meshmc/libraries/hoedown/include/hoedown/buffer.h b/meshmc/libraries/hoedown/include/hoedown/buffer.h
new file mode 100644
index 0000000000..df2d17acda
--- /dev/null
+++ b/meshmc/libraries/hoedown/include/hoedown/buffer.h
@@ -0,0 +1,153 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ *//* buffer.h - simple, fast buffers */
+
+#ifndef HOEDOWN_BUFFER_H
+#define HOEDOWN_BUFFER_H
+
+#include <stdio.h>
+#include <stddef.h>
+#include <stdarg.h>
+#include <stdint.h>
+#include <stdlib.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if defined(_MSC_VER)
+#define __attribute__(x)
+#define inline __inline
+#define __builtin_expect(x, n) x
+#endif
+
+/*********
+ * TYPES *
+ *********/
+
+typedef void* (*hoedown_realloc_callback)(void*, size_t);
+typedef void (*hoedown_free_callback)(void*);
+
+struct hoedown_buffer {
+	uint8_t* data; /* actual character data */
+	size_t size;   /* size of the string */
+	size_t asize;  /* allocated size (0 = volatile buffer) */
+	size_t unit;   /* reallocation unit size (0 = read-only buffer) */
+
+	hoedown_realloc_callback data_realloc;
+	hoedown_free_callback data_free;
+	hoedown_free_callback buffer_free;
+};
+
+typedef struct hoedown_buffer hoedown_buffer;
+
+/*************
+ * FUNCTIONS *
+ *************/
+
+/* allocation wrappers */
+void* hoedown_malloc(size_t size) __attribute__((malloc));
+void* hoedown_calloc(size_t nmemb, size_t size) __attribute__((malloc));
+void* hoedown_realloc(void* ptr, size_t size) __attribute__((malloc));
+
+/* hoedown_buffer_init: initialize a buffer with custom allocators */
+void hoedown_buffer_init(hoedown_buffer* buffer, size_t unit,
+						 hoedown_realloc_callback data_realloc,
+						 hoedown_free_callback data_free,
+						 hoedown_free_callback buffer_free);
+
+/* hoedown_buffer_uninit: uninitialize an existing buffer */
+void hoedown_buffer_uninit(hoedown_buffer* buf);
+
+/* hoedown_buffer_new: allocate a new buffer */
+hoedown_buffer* hoedown_buffer_new(size_t unit) __attribute__((malloc));
+
+/* hoedown_buffer_reset: free internal data of the buffer */
+void hoedown_buffer_reset(hoedown_buffer* buf);
+
+/* hoedown_buffer_grow: increase the allocated size to the given value */
+void hoedown_buffer_grow(hoedown_buffer* buf, size_t neosz);
+
+/* hoedown_buffer_put: append raw data to a buffer */
+void hoedown_buffer_put(hoedown_buffer* buf, const uint8_t* data, size_t size);
+
+/* hoedown_buffer_puts: append a NUL-terminated string to a buffer */
+void hoedown_buffer_puts(hoedown_buffer* buf, const char* str);
+
+/* hoedown_buffer_putc: append a single char to a buffer */
+void hoedown_buffer_putc(hoedown_buffer* buf, uint8_t c);
+
+/* hoedown_buffer_putf: read from a file and append to a buffer, until EOF or
+ * error */
+int hoedown_buffer_putf(hoedown_buffer* buf, FILE* file);
+
+/* hoedown_buffer_set: replace the buffer's contents with raw data */
+void hoedown_buffer_set(hoedown_buffer* buf, const uint8_t* data, size_t size);
+
+/* hoedown_buffer_sets: replace the buffer's contents with a NUL-terminated
+ * string */
+void hoedown_buffer_sets(hoedown_buffer* buf, const char* str);
+
+/* hoedown_buffer_eq: compare a buffer's data with other data for equality */
+int hoedown_buffer_eq(const hoedown_buffer* buf, const uint8_t* data,
+					  size_t size);
+
+/* hoedown_buffer_eq: compare a buffer's data with NUL-terminated string for
+ * equality */
+int hoedown_buffer_eqs(const hoedown_buffer* buf, const char* str);
+
+/* hoedown_buffer_prefix: compare the beginning of a buffer with a string */
+int hoedown_buffer_prefix(const hoedown_buffer* buf, const char* prefix);
+
+/* hoedown_buffer_slurp: remove a given number of bytes from the head of the
+ * buffer */
+void hoedown_buffer_slurp(hoedown_buffer* buf, size_t size);
+
+/* hoedown_buffer_cstr: NUL-termination of the string array (making a C-string)
+ */
+const char* hoedown_buffer_cstr(hoedown_buffer* buf);
+
+/* hoedown_buffer_printf: formatted printing to a buffer */
+void hoedown_buffer_printf(hoedown_buffer* buf, const char* fmt, ...)
+	__attribute__((format(printf, 2, 3)));
+
+/* hoedown_buffer_put_utf8: put a Unicode character encoded as UTF-8 */
+void hoedown_buffer_put_utf8(hoedown_buffer* buf, unsigned int codepoint);
+
+/* hoedown_buffer_free: free the buffer */
+void hoedown_buffer_free(hoedown_buffer* buf);
+
+/* HOEDOWN_BUFPUTSL: optimized hoedown_buffer_puts of a string literal */
+#define HOEDOWN_BUFPUTSL(output, literal)                                      \
+	hoedown_buffer_put(output, (const uint8_t*)literal, sizeof(literal) - 1)
+
+/* HOEDOWN_BUFSETSL: optimized hoedown_buffer_sets of a string literal */
+#define HOEDOWN_BUFSETSL(output, literal)                                      \
+	hoedown_buffer_set(output, (const uint8_t*)literal, sizeof(literal) - 1)
+
+/* HOEDOWN_BUFEQSL: optimized hoedown_buffer_eqs of a string literal */
+#define HOEDOWN_BUFEQSL(output, literal)                                       \
+	hoedown_buffer_eq(output, (const uint8_t*)literal, sizeof(literal) - 1)
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /** HOEDOWN_BUFFER_H **/
diff --git a/meshmc/libraries/hoedown/include/hoedown/document.h b/meshmc/libraries/hoedown/include/hoedown/document.h
new file mode 100644
index 0000000000..f88eef4f3e
--- /dev/null
+++ b/meshmc/libraries/hoedown/include/hoedown/document.h
@@ -0,0 +1,221 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ *//* document.h - generic markdown parser */
+
+#ifndef HOEDOWN_DOCUMENT_H
+#define HOEDOWN_DOCUMENT_H
+
+#include "buffer.h"
+#include "autolink.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*************
+ * CONSTANTS *
+ *************/
+
+typedef enum hoedown_extensions {
+	/* block-level extensions */
+	HOEDOWN_EXT_TABLES = (1 << 0),
+	HOEDOWN_EXT_FENCED_CODE = (1 << 1),
+	HOEDOWN_EXT_FOOTNOTES = (1 << 2),
+
+	/* span-level extensions */
+	HOEDOWN_EXT_AUTOLINK = (1 << 3),
+	HOEDOWN_EXT_STRIKETHROUGH = (1 << 4),
+	HOEDOWN_EXT_UNDERLINE = (1 << 5),
+	HOEDOWN_EXT_HIGHLIGHT = (1 << 6),
+	HOEDOWN_EXT_QUOTE = (1 << 7),
+	HOEDOWN_EXT_SUPERSCRIPT = (1 << 8),
+	HOEDOWN_EXT_MATH = (1 << 9),
+
+	/* other flags */
+	HOEDOWN_EXT_NO_INTRA_EMPHASIS = (1 << 11),
+	HOEDOWN_EXT_SPACE_HEADERS = (1 << 12),
+	HOEDOWN_EXT_MATH_EXPLICIT = (1 << 13),
+
+	/* negative flags */
+	HOEDOWN_EXT_DISABLE_INDENTED_CODE = (1 << 14)
+} hoedown_extensions;
+
+#define HOEDOWN_EXT_BLOCK                                                      \
+	(HOEDOWN_EXT_TABLES | HOEDOWN_EXT_FENCED_CODE | HOEDOWN_EXT_FOOTNOTES)
+
+#define HOEDOWN_EXT_SPAN                                                       \
+	(HOEDOWN_EXT_AUTOLINK | HOEDOWN_EXT_STRIKETHROUGH |                        \
+	 HOEDOWN_EXT_UNDERLINE | HOEDOWN_EXT_HIGHLIGHT | HOEDOWN_EXT_QUOTE |       \
+	 HOEDOWN_EXT_SUPERSCRIPT | HOEDOWN_EXT_MATH)
+
+#define HOEDOWN_EXT_FLAGS                                                      \
+	(HOEDOWN_EXT_NO_INTRA_EMPHASIS | HOEDOWN_EXT_SPACE_HEADERS |               \
+	 HOEDOWN_EXT_MATH_EXPLICIT)
+
+#define HOEDOWN_EXT_NEGATIVE (HOEDOWN_EXT_DISABLE_INDENTED_CODE)
+
+typedef enum hoedown_list_flags {
+	HOEDOWN_LIST_ORDERED = (1 << 0),
+	HOEDOWN_LI_BLOCK = (1 << 1) /* <li> containing block data */
+} hoedown_list_flags;
+
+typedef enum hoedown_table_flags {
+	HOEDOWN_TABLE_ALIGN_LEFT = 1,
+	HOEDOWN_TABLE_ALIGN_RIGHT = 2,
+	HOEDOWN_TABLE_ALIGN_CENTER = 3,
+	HOEDOWN_TABLE_ALIGNMASK = 3,
+	HOEDOWN_TABLE_HEADER = 4
+} hoedown_table_flags;
+
+typedef enum hoedown_autolink_type {
+	HOEDOWN_AUTOLINK_NONE,	 /* used internally when it is not an autolink*/
+	HOEDOWN_AUTOLINK_NORMAL, /* normal http/http/ftp/mailto/etc link */
+	HOEDOWN_AUTOLINK_EMAIL	 /* e-mail link without explit mailto: */
+} hoedown_autolink_type;
+
+/*********
+ * TYPES *
+ *********/
+
+struct hoedown_document;
+typedef struct hoedown_document hoedown_document;
+
+struct hoedown_renderer_data {
+	void* opaque;
+};
+typedef struct hoedown_renderer_data hoedown_renderer_data;
+
+/* hoedown_renderer - functions for rendering parsed data */
+struct hoedown_renderer {
+	/* state object */
+	void* opaque;
+
+	/* block level callbacks - NULL skips the block */
+	void (*blockcode)(hoedown_buffer* ob, const hoedown_buffer* text,
+					  const hoedown_buffer* lang,
+					  const hoedown_renderer_data* data);
+	void (*blockquote)(hoedown_buffer* ob, const hoedown_buffer* content,
+					   const hoedown_renderer_data* data);
+	void (*header)(hoedown_buffer* ob, const hoedown_buffer* content, int level,
+				   const hoedown_renderer_data* data);
+	void (*hrule)(hoedown_buffer* ob, const hoedown_renderer_data* data);
+	void (*list)(hoedown_buffer* ob, const hoedown_buffer* content,
+				 hoedown_list_flags flags, const hoedown_renderer_data* data);
+	void (*listitem)(hoedown_buffer* ob, const hoedown_buffer* content,
+					 hoedown_list_flags flags,
+					 const hoedown_renderer_data* data);
+	void (*paragraph)(hoedown_buffer* ob, const hoedown_buffer* content,
+					  const hoedown_renderer_data* data);
+	void (*table)(hoedown_buffer* ob, const hoedown_buffer* content,
+				  const hoedown_renderer_data* data);
+	void (*table_header)(hoedown_buffer* ob, const hoedown_buffer* content,
+						 const hoedown_renderer_data* data);
+	void (*table_body)(hoedown_buffer* ob, const hoedown_buffer* content,
+					   const hoedown_renderer_data* data);
+	void (*table_row)(hoedown_buffer* ob, const hoedown_buffer* content,
+					  const hoedown_renderer_data* data);
+	void (*table_cell)(hoedown_buffer* ob, const hoedown_buffer* content,
+					   hoedown_table_flags flags,
+					   const hoedown_renderer_data* data);
+	void (*footnotes)(hoedown_buffer* ob, const hoedown_buffer* content,
+					  const hoedown_renderer_data* data);
+	void (*footnote_def)(hoedown_buffer* ob, const hoedown_buffer* content,
+						 unsigned int num, const hoedown_renderer_data* data);
+	void (*blockhtml)(hoedown_buffer* ob, const hoedown_buffer* text,
+					  const hoedown_renderer_data* data);
+
+	/* span level callbacks - NULL or return 0 prints the span verbatim */
+	int (*autolink)(hoedown_buffer* ob, const hoedown_buffer* link,
+					hoedown_autolink_type type,
+					const hoedown_renderer_data* data);
+	int (*codespan)(hoedown_buffer* ob, const hoedown_buffer* text,
+					const hoedown_renderer_data* data);
+	int (*double_emphasis)(hoedown_buffer* ob, const hoedown_buffer* content,
+						   const hoedown_renderer_data* data);
+	int (*emphasis)(hoedown_buffer* ob, const hoedown_buffer* content,
+					const hoedown_renderer_data* data);
+	int (*underline)(hoedown_buffer* ob, const hoedown_buffer* content,
+					 const hoedown_renderer_data* data);
+	int (*highlight)(hoedown_buffer* ob, const hoedown_buffer* content,
+					 const hoedown_renderer_data* data);
+	int (*quote)(hoedown_buffer* ob, const hoedown_buffer* content,
+				 const hoedown_renderer_data* data);
+	int (*image)(hoedown_buffer* ob, const hoedown_buffer* link,
+				 const hoedown_buffer* title, const hoedown_buffer* alt,
+				 const hoedown_renderer_data* data);
+	int (*linebreak)(hoedown_buffer* ob, const hoedown_renderer_data* data);
+	int (*link)(hoedown_buffer* ob, const hoedown_buffer* content,
+				const hoedown_buffer* link, const hoedown_buffer* title,
+				const hoedown_renderer_data* data);
+	int (*triple_emphasis)(hoedown_buffer* ob, const hoedown_buffer* content,
+						   const hoedown_renderer_data* data);
+	int (*strikethrough)(hoedown_buffer* ob, const hoedown_buffer* content,
+						 const hoedown_renderer_data* data);
+	int (*superscript)(hoedown_buffer* ob, const hoedown_buffer* content,
+					   const hoedown_renderer_data* data);
+	int (*footnote_ref)(hoedown_buffer* ob, unsigned int num,
+						const hoedown_renderer_data* data);
+	int (*math)(hoedown_buffer* ob, const hoedown_buffer* text, int displaymode,
+				const hoedown_renderer_data* data);
+	int (*raw_html)(hoedown_buffer* ob, const hoedown_buffer* text,
+					const hoedown_renderer_data* data);
+
+	/* low level callbacks - NULL copies input directly into the output */
+	void (*entity)(hoedown_buffer* ob, const hoedown_buffer* text,
+				   const hoedown_renderer_data* data);
+	void (*normal_text)(hoedown_buffer* ob, const hoedown_buffer* text,
+						const hoedown_renderer_data* data);
+
+	/* miscellaneous callbacks */
+	void (*doc_header)(hoedown_buffer* ob, int inline_render,
+					   const hoedown_renderer_data* data);
+	void (*doc_footer)(hoedown_buffer* ob, int inline_render,
+					   const hoedown_renderer_data* data);
+};
+typedef struct hoedown_renderer hoedown_renderer;
+
+/*************
+ * FUNCTIONS *
+ *************/
+
+/* hoedown_document_new: allocate a new document processor instance */
+hoedown_document* hoedown_document_new(const hoedown_renderer* renderer,
+									   hoedown_extensions extensions,
+									   size_t max_nesting)
+	__attribute__((malloc));
+
+/* hoedown_document_render: render regular Markdown using the document processor
+ */
+void hoedown_document_render(hoedown_document* doc, hoedown_buffer* ob,
+							 const uint8_t* data, size_t size);
+
+/* hoedown_document_render_inline: render inline Markdown using the document
+ * processor */
+void hoedown_document_render_inline(hoedown_document* doc, hoedown_buffer* ob,
+									const uint8_t* data, size_t size);
+
+/* hoedown_document_free: deallocate a document processor instance */
+void hoedown_document_free(hoedown_document* doc);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /** HOEDOWN_DOCUMENT_H **/
diff --git a/meshmc/libraries/hoedown/include/hoedown/escape.h b/meshmc/libraries/hoedown/include/hoedown/escape.h
new file mode 100644
index 0000000000..a7fefa2f7c
--- /dev/null
+++ b/meshmc/libraries/hoedown/include/hoedown/escape.h
@@ -0,0 +1,46 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ *//* escape.h - escape utilities */
+
+#ifndef HOEDOWN_ESCAPE_H
+#define HOEDOWN_ESCAPE_H
+
+#include "buffer.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*************
+ * FUNCTIONS *
+ *************/
+
+/* hoedown_escape_href: escape (part of) a URL inside HTML */
+void hoedown_escape_href(hoedown_buffer* ob, const uint8_t* data, size_t size);
+
+/* hoedown_escape_html: escape HTML */
+void hoedown_escape_html(hoedown_buffer* ob, const uint8_t* data, size_t size,
+						 int secure);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /** HOEDOWN_ESCAPE_H **/
diff --git a/meshmc/libraries/hoedown/include/hoedown/html.h b/meshmc/libraries/hoedown/include/hoedown/html.h
new file mode 100644
index 0000000000..f774a9f513
--- /dev/null
+++ b/meshmc/libraries/hoedown/include/hoedown/html.h
@@ -0,0 +1,102 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ *//* html.h - HTML renderer and utilities */
+
+#ifndef HOEDOWN_HTML_H
+#define HOEDOWN_HTML_H
+
+#include "document.h"
+#include "buffer.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*************
+ * CONSTANTS *
+ *************/
+
+typedef enum hoedown_html_flags {
+	HOEDOWN_HTML_SKIP_HTML = (1 << 0),
+	HOEDOWN_HTML_ESCAPE = (1 << 1),
+	HOEDOWN_HTML_HARD_WRAP = (1 << 2),
+	HOEDOWN_HTML_USE_XHTML = (1 << 3)
+} hoedown_html_flags;
+
+typedef enum hoedown_html_tag {
+	HOEDOWN_HTML_TAG_NONE = 0,
+	HOEDOWN_HTML_TAG_OPEN,
+	HOEDOWN_HTML_TAG_CLOSE
+} hoedown_html_tag;
+
+/*********
+ * TYPES *
+ *********/
+
+struct hoedown_html_renderer_state {
+	void* opaque;
+
+	struct {
+		int header_count;
+		int current_level;
+		int level_offset;
+		int nesting_level;
+	} toc_data;
+
+	hoedown_html_flags flags;
+
+	/* extra callbacks */
+	void (*link_attributes)(hoedown_buffer* ob, const hoedown_buffer* url,
+							const hoedown_renderer_data* data);
+};
+typedef struct hoedown_html_renderer_state hoedown_html_renderer_state;
+
+/*************
+ * FUNCTIONS *
+ *************/
+
+/* hoedown_html_smartypants: process an HTML snippet using SmartyPants for smart
+ * punctuation */
+void hoedown_html_smartypants(hoedown_buffer* ob, const uint8_t* data,
+							  size_t size);
+
+/* hoedown_html_is_tag: checks if data starts with a specific tag, returns the
+ * tag type or NONE */
+hoedown_html_tag hoedown_html_is_tag(const uint8_t* data, size_t size,
+									 const char* tagname);
+
+/* hoedown_html_renderer_new: allocates a regular HTML renderer */
+hoedown_renderer* hoedown_html_renderer_new(hoedown_html_flags render_flags,
+											int nesting_level)
+	__attribute__((malloc));
+
+/* hoedown_html_toc_renderer_new: like hoedown_html_renderer_new, but the
+ * returned renderer produces the Table of Contents */
+hoedown_renderer* hoedown_html_toc_renderer_new(int nesting_level)
+	__attribute__((malloc));
+
+/* hoedown_html_renderer_free: deallocate an HTML renderer */
+void hoedown_html_renderer_free(hoedown_renderer* renderer);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /** HOEDOWN_HTML_H **/
diff --git a/meshmc/libraries/hoedown/include/hoedown/stack.h b/meshmc/libraries/hoedown/include/hoedown/stack.h
new file mode 100644
index 0000000000..fa1deccfa8
--- /dev/null
+++ b/meshmc/libraries/hoedown/include/hoedown/stack.h
@@ -0,0 +1,68 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ *//* stack.h - simple stacking */
+
+#ifndef HOEDOWN_STACK_H
+#define HOEDOWN_STACK_H
+
+#include <stddef.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*********
+ * TYPES *
+ *********/
+
+struct hoedown_stack {
+	void** item;
+	size_t size;
+	size_t asize;
+};
+typedef struct hoedown_stack hoedown_stack;
+
+/*************
+ * FUNCTIONS *
+ *************/
+
+/* hoedown_stack_init: initialize a stack */
+void hoedown_stack_init(hoedown_stack* st, size_t initial_size);
+
+/* hoedown_stack_uninit: free internal data of the stack */
+void hoedown_stack_uninit(hoedown_stack* st);
+
+/* hoedown_stack_grow: increase the allocated size to the given value */
+void hoedown_stack_grow(hoedown_stack* st, size_t neosz);
+
+/* hoedown_stack_push: push an item to the top of the stack */
+void hoedown_stack_push(hoedown_stack* st, void* item);
+
+/* hoedown_stack_pop: retrieve and remove the item at the top of the stack */
+void* hoedown_stack_pop(hoedown_stack* st);
+
+/* hoedown_stack_top: retrieve the item at the top of the stack */
+void* hoedown_stack_top(const hoedown_stack* st);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /** HOEDOWN_STACK_H **/
diff --git a/meshmc/libraries/hoedown/include/hoedown/version.h b/meshmc/libraries/hoedown/include/hoedown/version.h
new file mode 100644
index 0000000000..e913bb4468
--- /dev/null
+++ b/meshmc/libraries/hoedown/include/hoedown/version.h
@@ -0,0 +1,49 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ *//* version.h - holds Hoedown's version */
+
+#ifndef HOEDOWN_VERSION_H
+#define HOEDOWN_VERSION_H
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*************
+ * CONSTANTS *
+ *************/
+
+#define HOEDOWN_VERSION "3.0.2"
+#define HOEDOWN_VERSION_MAJOR 3
+#define HOEDOWN_VERSION_MINOR 0
+#define HOEDOWN_VERSION_REVISION 2
+
+/*************
+ * FUNCTIONS *
+ *************/
+
+/* hoedown_version: retrieve Hoedown's version numbers */
+void hoedown_version(int* major, int* minor, int* revision);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /** HOEDOWN_VERSION_H **/
diff --git a/meshmc/libraries/hoedown/src/autolink.c b/meshmc/libraries/hoedown/src/autolink.c
new file mode 100644
index 0000000000..ab8d64d601
--- /dev/null
+++ b/meshmc/libraries/hoedown/src/autolink.c
@@ -0,0 +1,292 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+#include "hoedown/autolink.h"
+
+#include <string.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <ctype.h>
+
+#ifndef _MSC_VER
+#include <strings.h>
+#else
+#define strncasecmp _strnicmp
+#endif
+
+int hoedown_autolink_is_safe(const uint8_t* data, size_t size)
+{
+	static const size_t valid_uris_count = 6;
+	static const char* valid_uris[] = {"http://", "https://", "/",
+									   "#",		  "ftp://",	  "mailto:"};
+	static const size_t valid_uris_size[] = {7, 8, 1, 1, 6, 7};
+	size_t i;
+
+	for (i = 0; i < valid_uris_count; ++i) {
+		size_t len = valid_uris_size[i];
+
+		if (size > len && strncasecmp((char*)data, valid_uris[i], len) == 0 &&
+			isalnum(data[len]))
+			return 1;
+	}
+
+	return 0;
+}
+
+static size_t autolink_delim(uint8_t* data, size_t link_end, size_t max_rewind,
+							 size_t size)
+{
+	uint8_t cclose, copen = 0;
+	size_t i;
+
+	for (i = 0; i < link_end; ++i)
+		if (data[i] == '<') {
+			link_end = i;
+			break;
+		}
+
+	while (link_end > 0) {
+		if (strchr("?!.,:", data[link_end - 1]) != NULL)
+			link_end--;
+
+		else if (data[link_end - 1] == ';') {
+			size_t new_end = link_end - 2;
+
+			while (new_end > 0 && isalpha(data[new_end]))
+				new_end--;
+
+			if (new_end < link_end - 2 && data[new_end] == '&')
+				link_end = new_end;
+			else
+				link_end--;
+		} else
+			break;
+	}
+
+	if (link_end == 0)
+		return 0;
+
+	cclose = data[link_end - 1];
+
+	switch (cclose) {
+		case '"':
+			copen = '"';
+			break;
+		case '\'':
+			copen = '\'';
+			break;
+		case ')':
+			copen = '(';
+			break;
+		case ']':
+			copen = '[';
+			break;
+		case '}':
+			copen = '{';
+			break;
+	}
+
+	if (copen != 0) {
+		size_t closing = 0;
+		size_t opening = 0;
+		size_t i = 0;
+
+		/* Try to close the final punctuation sign in this same line;
+		 * if we managed to close it outside of the URL, that means that it's
+		 * not part of the URL. If it closes inside the URL, that means it
+		 * is part of the URL.
+		 *
+		 * Examples:
+		 *
+		 *    foo http://www.pokemon.com/Pikachu_(Electric) bar
+		 *        => http://www.pokemon.com/Pikachu_(Electric)
+		 *
+		 *    foo (http://www.pokemon.com/Pikachu_(Electric)) bar
+		 *        => http://www.pokemon.com/Pikachu_(Electric)
+		 *
+		 *    foo http://www.pokemon.com/Pikachu_(Electric)) bar
+		 *        => http://www.pokemon.com/Pikachu_(Electric))
+		 *
+		 *    (foo http://www.pokemon.com/Pikachu_(Electric)) bar
+		 *        => foo http://www.pokemon.com/Pikachu_(Electric)
+		 */
+
+		while (i < link_end) {
+			if (data[i] == copen)
+				opening++;
+			else if (data[i] == cclose)
+				closing++;
+
+			i++;
+		}
+
+		if (closing != opening)
+			link_end--;
+	}
+
+	return link_end;
+}
+
+static size_t check_domain(uint8_t* data, size_t size, int allow_short)
+{
+	size_t i, np = 0;
+
+	if (!isalnum(data[0]))
+		return 0;
+
+	for (i = 1; i < size - 1; ++i) {
+		if (strchr(".:", data[i]) != NULL)
+			np++;
+		else if (!isalnum(data[i]) && data[i] != '-')
+			break;
+	}
+
+	if (allow_short) {
+		/* We don't need a valid domain in the strict sense (with
+		 * least one dot; so just make sure it's composed of valid
+		 * domain characters and return the length of the the valid
+		 * sequence. */
+		return i;
+	} else {
+		/* a valid domain needs to have at least a dot.
+		 * that's as far as we get */
+		return np ? i : 0;
+	}
+}
+
+size_t hoedown_autolink__www(size_t* rewind_p, hoedown_buffer* link,
+							 uint8_t* data, size_t max_rewind, size_t size,
+							 unsigned int flags)
+{
+	size_t link_end;
+
+	if (max_rewind > 0 && !ispunct(data[-1]) && !isspace(data[-1]))
+		return 0;
+
+	if (size < 4 || memcmp(data, "www.", strlen("www.")) != 0)
+		return 0;
+
+	link_end = check_domain(data, size, 0);
+
+	if (link_end == 0)
+		return 0;
+
+	while (link_end < size && !isspace(data[link_end]))
+		link_end++;
+
+	link_end = autolink_delim(data, link_end, max_rewind, size);
+
+	if (link_end == 0)
+		return 0;
+
+	hoedown_buffer_put(link, data, link_end);
+	*rewind_p = 0;
+
+	return (int)link_end;
+}
+
+size_t hoedown_autolink__email(size_t* rewind_p, hoedown_buffer* link,
+							   uint8_t* data, size_t max_rewind, size_t size,
+							   unsigned int flags)
+{
+	size_t link_end, rewind;
+	int nb = 0, np = 0;
+
+	for (rewind = 0; rewind < max_rewind; ++rewind) {
+		uint8_t c = data[-1 - rewind];
+
+		if (isalnum(c))
+			continue;
+
+		if (strchr(".+-_", c) != NULL)
+			continue;
+
+		break;
+	}
+
+	if (rewind == 0)
+		return 0;
+
+	for (link_end = 0; link_end < size; ++link_end) {
+		uint8_t c = data[link_end];
+
+		if (isalnum(c))
+			continue;
+
+		if (c == '@')
+			nb++;
+		else if (c == '.' && link_end < size - 1)
+			np++;
+		else if (c != '-' && c != '_')
+			break;
+	}
+
+	if (link_end < 2 || nb != 1 || np == 0 || !isalpha(data[link_end - 1]))
+		return 0;
+
+	link_end = autolink_delim(data, link_end, max_rewind, size);
+
+	if (link_end == 0)
+		return 0;
+
+	hoedown_buffer_put(link, data - rewind, link_end + rewind);
+	*rewind_p = rewind;
+
+	return link_end;
+}
+
+size_t hoedown_autolink__url(size_t* rewind_p, hoedown_buffer* link,
+							 uint8_t* data, size_t max_rewind, size_t size,
+							 unsigned int flags)
+{
+	size_t link_end, rewind = 0, domain_len;
+
+	if (size < 4 || data[1] != '/' || data[2] != '/')
+		return 0;
+
+	while (rewind < max_rewind && isalpha(data[-1 - rewind]))
+		rewind++;
+
+	if (!hoedown_autolink_is_safe(data - rewind, size + rewind))
+		return 0;
+
+	link_end = strlen("://");
+
+	domain_len = check_domain(data + link_end, size - link_end,
+							  flags & HOEDOWN_AUTOLINK_SHORT_DOMAINS);
+
+	if (domain_len == 0)
+		return 0;
+
+	link_end += domain_len;
+	while (link_end < size && !isspace(data[link_end]))
+		link_end++;
+
+	link_end = autolink_delim(data, link_end, max_rewind, size);
+
+	if (link_end == 0)
+		return 0;
+
+	hoedown_buffer_put(link, data - rewind, link_end + rewind);
+	*rewind_p = rewind;
+
+	return link_end;
+}
diff --git a/meshmc/libraries/hoedown/src/buffer.c b/meshmc/libraries/hoedown/src/buffer.c
new file mode 100644
index 0000000000..b3559eb09f
--- /dev/null
+++ b/meshmc/libraries/hoedown/src/buffer.c
@@ -0,0 +1,307 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+#include "hoedown/buffer.h"
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <assert.h>
+
+void* hoedown_malloc(size_t size)
+{
+	void* ret = malloc(size);
+
+	if (!ret) {
+		fprintf(stderr, "Allocation failed.\n");
+		abort();
+	}
+
+	return ret;
+}
+
+void* hoedown_calloc(size_t nmemb, size_t size)
+{
+	void* ret = calloc(nmemb, size);
+
+	if (!ret) {
+		fprintf(stderr, "Allocation failed.\n");
+		abort();
+	}
+
+	return ret;
+}
+
+void* hoedown_realloc(void* ptr, size_t size)
+{
+	void* ret = realloc(ptr, size);
+
+	if (!ret) {
+		fprintf(stderr, "Allocation failed.\n");
+		abort();
+	}
+
+	return ret;
+}
+
+void hoedown_buffer_init(hoedown_buffer* buf, size_t unit,
+						 hoedown_realloc_callback data_realloc,
+						 hoedown_free_callback data_free,
+						 hoedown_free_callback buffer_free)
+{
+	assert(buf);
+
+	buf->data = NULL;
+	buf->size = buf->asize = 0;
+	buf->unit = unit;
+	buf->data_realloc = data_realloc;
+	buf->data_free = data_free;
+	buf->buffer_free = buffer_free;
+}
+
+void hoedown_buffer_uninit(hoedown_buffer* buf)
+{
+	assert(buf && buf->unit);
+	buf->data_free(buf->data);
+}
+
+hoedown_buffer* hoedown_buffer_new(size_t unit)
+{
+	hoedown_buffer* ret = hoedown_malloc(sizeof(hoedown_buffer));
+	hoedown_buffer_init(ret, unit, hoedown_realloc, free, free);
+	return ret;
+}
+
+void hoedown_buffer_free(hoedown_buffer* buf)
+{
+	if (!buf)
+		return;
+	assert(buf && buf->unit);
+
+	buf->data_free(buf->data);
+
+	if (buf->buffer_free)
+		buf->buffer_free(buf);
+}
+
+void hoedown_buffer_reset(hoedown_buffer* buf)
+{
+	assert(buf && buf->unit);
+
+	buf->data_free(buf->data);
+	buf->data = NULL;
+	buf->size = buf->asize = 0;
+}
+
+void hoedown_buffer_grow(hoedown_buffer* buf, size_t neosz)
+{
+	size_t neoasz;
+	assert(buf && buf->unit);
+
+	if (buf->asize >= neosz)
+		return;
+
+	neoasz = buf->asize + buf->unit;
+	while (neoasz < neosz)
+		neoasz += buf->unit;
+
+	buf->data = (uint8_t*)buf->data_realloc(buf->data, neoasz);
+	buf->asize = neoasz;
+}
+
+void hoedown_buffer_put(hoedown_buffer* buf, const uint8_t* data, size_t size)
+{
+	assert(buf && buf->unit);
+
+	if (buf->size + size > buf->asize)
+		hoedown_buffer_grow(buf, buf->size + size);
+
+	memcpy(buf->data + buf->size, data, size);
+	buf->size += size;
+}
+
+void hoedown_buffer_puts(hoedown_buffer* buf, const char* str)
+{
+	hoedown_buffer_put(buf, (const uint8_t*)str, strlen(str));
+}
+
+void hoedown_buffer_putc(hoedown_buffer* buf, uint8_t c)
+{
+	assert(buf && buf->unit);
+
+	if (buf->size >= buf->asize)
+		hoedown_buffer_grow(buf, buf->size + 1);
+
+	buf->data[buf->size] = c;
+	buf->size += 1;
+}
+
+int hoedown_buffer_putf(hoedown_buffer* buf, FILE* file)
+{
+	assert(buf && buf->unit);
+
+	while (!(feof(file) || ferror(file))) {
+		hoedown_buffer_grow(buf, buf->size + buf->unit);
+		buf->size += fread(buf->data + buf->size, 1, buf->unit, file);
+	}
+
+	return ferror(file);
+}
+
+void hoedown_buffer_set(hoedown_buffer* buf, const uint8_t* data, size_t size)
+{
+	assert(buf && buf->unit);
+
+	if (size > buf->asize)
+		hoedown_buffer_grow(buf, size);
+
+	memcpy(buf->data, data, size);
+	buf->size = size;
+}
+
+void hoedown_buffer_sets(hoedown_buffer* buf, const char* str)
+{
+	hoedown_buffer_set(buf, (const uint8_t*)str, strlen(str));
+}
+
+int hoedown_buffer_eq(const hoedown_buffer* buf, const uint8_t* data,
+					  size_t size)
+{
+	if (buf->size != size)
+		return 0;
+	return memcmp(buf->data, data, size) == 0;
+}
+
+int hoedown_buffer_eqs(const hoedown_buffer* buf, const char* str)
+{
+	return hoedown_buffer_eq(buf, (const uint8_t*)str, strlen(str));
+}
+
+int hoedown_buffer_prefix(const hoedown_buffer* buf, const char* prefix)
+{
+	size_t i;
+
+	for (i = 0; i < buf->size; ++i) {
+		if (prefix[i] == 0)
+			return 0;
+
+		if (buf->data[i] != prefix[i])
+			return buf->data[i] - prefix[i];
+	}
+
+	return 0;
+}
+
+void hoedown_buffer_slurp(hoedown_buffer* buf, size_t size)
+{
+	assert(buf && buf->unit);
+
+	if (size >= buf->size) {
+		buf->size = 0;
+		return;
+	}
+
+	buf->size -= size;
+	memmove(buf->data, buf->data + size, buf->size);
+}
+
+const char* hoedown_buffer_cstr(hoedown_buffer* buf)
+{
+	assert(buf && buf->unit);
+
+	if (buf->size < buf->asize && buf->data[buf->size] == 0)
+		return (char*)buf->data;
+
+	hoedown_buffer_grow(buf, buf->size + 1);
+	buf->data[buf->size] = 0;
+
+	return (char*)buf->data;
+}
+
+void hoedown_buffer_printf(hoedown_buffer* buf, const char* fmt, ...)
+{
+	va_list ap;
+	int n;
+
+	assert(buf && buf->unit);
+
+	if (buf->size >= buf->asize)
+		hoedown_buffer_grow(buf, buf->size + 1);
+
+	va_start(ap, fmt);
+	n = vsnprintf((char*)buf->data + buf->size, buf->asize - buf->size, fmt,
+				  ap);
+	va_end(ap);
+
+	if (n < 0) {
+#ifndef _MSC_VER
+		return;
+#else
+		va_start(ap, fmt);
+		n = _vscprintf(fmt, ap);
+		va_end(ap);
+#endif
+	}
+
+	if ((size_t)n >= buf->asize - buf->size) {
+		hoedown_buffer_grow(buf, buf->size + n + 1);
+
+		va_start(ap, fmt);
+		n = vsnprintf((char*)buf->data + buf->size, buf->asize - buf->size, fmt,
+					  ap);
+		va_end(ap);
+	}
+
+	if (n < 0)
+		return;
+
+	buf->size += n;
+}
+
+void hoedown_buffer_put_utf8(hoedown_buffer* buf, unsigned int c)
+{
+	unsigned char unichar[4];
+
+	assert(buf && buf->unit);
+
+	if (c < 0x80) {
+		hoedown_buffer_putc(buf, c);
+	} else if (c < 0x800) {
+		unichar[0] = 192 + (c / 64);
+		unichar[1] = 128 + (c % 64);
+		hoedown_buffer_put(buf, unichar, 2);
+	} else if (c - 0xd800u < 0x800) {
+		HOEDOWN_BUFPUTSL(buf, "\xef\xbf\xbd");
+	} else if (c < 0x10000) {
+		unichar[0] = 224 + (c / 4096);
+		unichar[1] = 128 + (c / 64) % 64;
+		unichar[2] = 128 + (c % 64);
+		hoedown_buffer_put(buf, unichar, 3);
+	} else if (c < 0x110000) {
+		unichar[0] = 240 + (c / 262144);
+		unichar[1] = 128 + (c / 4096) % 64;
+		unichar[2] = 128 + (c / 64) % 64;
+		unichar[3] = 128 + (c % 64);
+		hoedown_buffer_put(buf, unichar, 4);
+	} else {
+		HOEDOWN_BUFPUTSL(buf, "\xef\xbf\xbd");
+	}
+}
diff --git a/meshmc/libraries/hoedown/src/document.c b/meshmc/libraries/hoedown/src/document.c
new file mode 100644
index 0000000000..31819a7c98
--- /dev/null
+++ b/meshmc/libraries/hoedown/src/document.c
@@ -0,0 +1,3102 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+#include "hoedown/document.h"
+
+#include <assert.h>
+#include <string.h>
+#include <ctype.h>
+#include <stdio.h>
+
+#include "hoedown/stack.h"
+
+#ifndef _MSC_VER
+#include <strings.h>
+#else
+#define strncasecmp _strnicmp
+#endif
+
+#define REF_TABLE_SIZE 8
+
+#define BUFFER_BLOCK 0
+#define BUFFER_SPAN 1
+
+#define HOEDOWN_LI_END 8 /* internal list flag */
+
+const char* hoedown_find_block_tag(const char* str, unsigned int len);
+
+/***************
+ * LOCAL TYPES *
+ ***************/
+
+/* link_ref: reference to a link */
+struct link_ref {
+	unsigned int id;
+
+	hoedown_buffer* link;
+	hoedown_buffer* title;
+
+	struct link_ref* next;
+};
+
+/* footnote_ref: reference to a footnote */
+struct footnote_ref {
+	unsigned int id;
+
+	int is_used;
+	unsigned int num;
+
+	hoedown_buffer* contents;
+};
+
+/* footnote_item: an item in a footnote_list */
+struct footnote_item {
+	struct footnote_ref* ref;
+	struct footnote_item* next;
+};
+
+/* footnote_list: linked list of footnote_item */
+struct footnote_list {
+	unsigned int count;
+	struct footnote_item* head;
+	struct footnote_item* tail;
+};
+
+/* char_trigger: function pointer to render active chars */
+/*   returns the number of chars taken care of */
+/*   data is the pointer of the beginning of the span */
+/*   offset is the number of valid chars before data */
+typedef size_t (*char_trigger)(hoedown_buffer* ob, hoedown_document* doc,
+							   uint8_t* data, size_t offset, size_t size);
+
+static size_t char_emphasis(hoedown_buffer* ob, hoedown_document* doc,
+							uint8_t* data, size_t offset, size_t size);
+static size_t char_quote(hoedown_buffer* ob, hoedown_document* doc,
+						 uint8_t* data, size_t offset, size_t size);
+static size_t char_linebreak(hoedown_buffer* ob, hoedown_document* doc,
+							 uint8_t* data, size_t offset, size_t size);
+static size_t char_codespan(hoedown_buffer* ob, hoedown_document* doc,
+							uint8_t* data, size_t offset, size_t size);
+static size_t char_escape(hoedown_buffer* ob, hoedown_document* doc,
+						  uint8_t* data, size_t offset, size_t size);
+static size_t char_entity(hoedown_buffer* ob, hoedown_document* doc,
+						  uint8_t* data, size_t offset, size_t size);
+static size_t char_langle_tag(hoedown_buffer* ob, hoedown_document* doc,
+							  uint8_t* data, size_t offset, size_t size);
+static size_t char_autolink_url(hoedown_buffer* ob, hoedown_document* doc,
+								uint8_t* data, size_t offset, size_t size);
+static size_t char_autolink_email(hoedown_buffer* ob, hoedown_document* doc,
+								  uint8_t* data, size_t offset, size_t size);
+static size_t char_autolink_www(hoedown_buffer* ob, hoedown_document* doc,
+								uint8_t* data, size_t offset, size_t size);
+static size_t char_link(hoedown_buffer* ob, hoedown_document* doc,
+						uint8_t* data, size_t offset, size_t size);
+static size_t char_superscript(hoedown_buffer* ob, hoedown_document* doc,
+							   uint8_t* data, size_t offset, size_t size);
+static size_t char_math(hoedown_buffer* ob, hoedown_document* doc,
+						uint8_t* data, size_t offset, size_t size);
+
+enum markdown_char_t {
+	MD_CHAR_NONE = 0,
+	MD_CHAR_EMPHASIS,
+	MD_CHAR_CODESPAN,
+	MD_CHAR_LINEBREAK,
+	MD_CHAR_LINK,
+	MD_CHAR_LANGLE,
+	MD_CHAR_ESCAPE,
+	MD_CHAR_ENTITY,
+	MD_CHAR_AUTOLINK_URL,
+	MD_CHAR_AUTOLINK_EMAIL,
+	MD_CHAR_AUTOLINK_WWW,
+	MD_CHAR_SUPERSCRIPT,
+	MD_CHAR_QUOTE,
+	MD_CHAR_MATH
+};
+
+static char_trigger markdown_char_ptrs[] = {NULL,
+											&char_emphasis,
+											&char_codespan,
+											&char_linebreak,
+											&char_link,
+											&char_langle_tag,
+											&char_escape,
+											&char_entity,
+											&char_autolink_url,
+											&char_autolink_email,
+											&char_autolink_www,
+											&char_superscript,
+											&char_quote,
+											&char_math};
+
+struct hoedown_document {
+	hoedown_renderer md;
+	hoedown_renderer_data data;
+
+	struct link_ref* refs[REF_TABLE_SIZE];
+	struct footnote_list footnotes_found;
+	struct footnote_list footnotes_used;
+	uint8_t active_char[256];
+	hoedown_stack work_bufs[2];
+	hoedown_extensions ext_flags;
+	size_t max_nesting;
+	int in_link_body;
+};
+
+/***************************
+ * HELPER FUNCTIONS *
+ ***************************/
+
+static hoedown_buffer* newbuf(hoedown_document* doc, int type)
+{
+	static const size_t buf_size[2] = {256, 64};
+	hoedown_buffer* work = NULL;
+	hoedown_stack* pool = &doc->work_bufs[type];
+
+	if (pool->size < pool->asize && pool->item[pool->size] != NULL) {
+		work = pool->item[pool->size++];
+		work->size = 0;
+	} else {
+		work = hoedown_buffer_new(buf_size[type]);
+		hoedown_stack_push(pool, work);
+	}
+
+	return work;
+}
+
+static void popbuf(hoedown_document* doc, int type)
+{
+	doc->work_bufs[type].size--;
+}
+
+static void unscape_text(hoedown_buffer* ob, hoedown_buffer* src)
+{
+	size_t i = 0, org;
+	while (i < src->size) {
+		org = i;
+		while (i < src->size && src->data[i] != '\\')
+			i++;
+
+		if (i > org)
+			hoedown_buffer_put(ob, src->data + org, i - org);
+
+		if (i + 1 >= src->size)
+			break;
+
+		hoedown_buffer_putc(ob, src->data[i + 1]);
+		i += 2;
+	}
+}
+
+static unsigned int hash_link_ref(const uint8_t* link_ref, size_t length)
+{
+	size_t i;
+	unsigned int hash = 0;
+
+	for (i = 0; i < length; ++i)
+		hash = tolower(link_ref[i]) + (hash << 6) + (hash << 16) - hash;
+
+	return hash;
+}
+
+static struct link_ref* add_link_ref(struct link_ref** references,
+									 const uint8_t* name, size_t name_size)
+{
+	struct link_ref* ref = hoedown_calloc(1, sizeof(struct link_ref));
+
+	ref->id = hash_link_ref(name, name_size);
+	ref->next = references[ref->id % REF_TABLE_SIZE];
+
+	references[ref->id % REF_TABLE_SIZE] = ref;
+	return ref;
+}
+
+static struct link_ref* find_link_ref(struct link_ref** references,
+									  uint8_t* name, size_t length)
+{
+	unsigned int hash = hash_link_ref(name, length);
+	struct link_ref* ref = NULL;
+
+	ref = references[hash % REF_TABLE_SIZE];
+
+	while (ref != NULL) {
+		if (ref->id == hash)
+			return ref;
+
+		ref = ref->next;
+	}
+
+	return NULL;
+}
+
+static void free_link_refs(struct link_ref** references)
+{
+	size_t i;
+
+	for (i = 0; i < REF_TABLE_SIZE; ++i) {
+		struct link_ref* r = references[i];
+		struct link_ref* next;
+
+		while (r) {
+			next = r->next;
+			hoedown_buffer_free(r->link);
+			hoedown_buffer_free(r->title);
+			free(r);
+			r = next;
+		}
+	}
+}
+
+static struct footnote_ref* create_footnote_ref(struct footnote_list* list,
+												const uint8_t* name,
+												size_t name_size)
+{
+	struct footnote_ref* ref = hoedown_calloc(1, sizeof(struct footnote_ref));
+
+	ref->id = hash_link_ref(name, name_size);
+
+	return ref;
+}
+
+static int add_footnote_ref(struct footnote_list* list,
+							struct footnote_ref* ref)
+{
+	struct footnote_item* item =
+		hoedown_calloc(1, sizeof(struct footnote_item));
+	if (!item)
+		return 0;
+	item->ref = ref;
+
+	if (list->head == NULL) {
+		list->head = list->tail = item;
+	} else {
+		list->tail->next = item;
+		list->tail = item;
+	}
+	list->count++;
+
+	return 1;
+}
+
+static struct footnote_ref* find_footnote_ref(struct footnote_list* list,
+											  uint8_t* name, size_t length)
+{
+	unsigned int hash = hash_link_ref(name, length);
+	struct footnote_item* item = NULL;
+
+	item = list->head;
+
+	while (item != NULL) {
+		if (item->ref->id == hash)
+			return item->ref;
+		item = item->next;
+	}
+
+	return NULL;
+}
+
+static void free_footnote_ref(struct footnote_ref* ref)
+{
+	hoedown_buffer_free(ref->contents);
+	free(ref);
+}
+
+static void free_footnote_list(struct footnote_list* list, int free_refs)
+{
+	struct footnote_item* item = list->head;
+	struct footnote_item* next;
+
+	while (item) {
+		next = item->next;
+		if (free_refs)
+			free_footnote_ref(item->ref);
+		free(item);
+		item = next;
+	}
+}
+
+/*
+ * Check whether a char is a Markdown spacing char.
+
+ * Right now we only consider spaces the actual
+ * space and a newline: tabs and carriage returns
+ * are filtered out during the preprocessing phase.
+ *
+ * If we wanted to actually be UTF-8 compliant, we
+ * should instead extract an Unicode codepoint from
+ * this character and check for space properties.
+ */
+static int _isspace(int c)
+{
+	return c == ' ' || c == '\n';
+}
+
+/* is_empty_all: verify that all the data is spacing */
+static int is_empty_all(const uint8_t* data, size_t size)
+{
+	size_t i = 0;
+	while (i < size && _isspace(data[i]))
+		i++;
+	return i == size;
+}
+
+/*
+ * Replace all spacing characters in data with spaces. As a special
+ * case, this collapses a newline with the previous space, if possible.
+ */
+static void replace_spacing(hoedown_buffer* ob, const uint8_t* data,
+							size_t size)
+{
+	size_t i = 0, mark;
+	hoedown_buffer_grow(ob, size);
+	while (1) {
+		mark = i;
+		while (i < size && data[i] != '\n')
+			i++;
+		hoedown_buffer_put(ob, data + mark, i - mark);
+
+		if (i >= size)
+			break;
+
+		if (!(i > 0 && data[i - 1] == ' '))
+			hoedown_buffer_putc(ob, ' ');
+		i++;
+	}
+}
+
+/****************************
+ * INLINE PARSING FUNCTIONS *
+ ****************************/
+
+/* is_mail_autolink • looks for the address part of a mail autolink and '>' */
+/* this is less strict than the original markdown e-mail address matching */
+static size_t is_mail_autolink(uint8_t* data, size_t size)
+{
+	size_t i = 0, nb = 0;
+
+	/* address is assumed to be: [-@._a-zA-Z0-9]+ with exactly one '@' */
+	for (i = 0; i < size; ++i) {
+		if (isalnum(data[i]))
+			continue;
+
+		switch (data[i]) {
+			case '@':
+				nb++;
+
+			case '-':
+			case '.':
+			case '_':
+				break;
+
+			case '>':
+				return (nb == 1) ? i + 1 : 0;
+
+			default:
+				return 0;
+		}
+	}
+
+	return 0;
+}
+
+/* tag_length • returns the length of the given tag, or 0 is it's not valid */
+static size_t tag_length(uint8_t* data, size_t size,
+						 hoedown_autolink_type* autolink)
+{
+	size_t i, j;
+
+	/* a valid tag can't be shorter than 3 chars */
+	if (size < 3)
+		return 0;
+
+	/* begins with a '<' optionally followed by '/', followed by letter or
+	 * number */
+	if (data[0] != '<')
+		return 0;
+	i = (data[1] == '/') ? 2 : 1;
+
+	if (!isalnum(data[i]))
+		return 0;
+
+	/* scheme test */
+	*autolink = HOEDOWN_AUTOLINK_NONE;
+
+	/* try to find the beginning of an URI */
+	while (i < size && (isalnum(data[i]) || data[i] == '.' || data[i] == '+' ||
+						data[i] == '-'))
+		i++;
+
+	if (i > 1 && data[i] == '@') {
+		if ((j = is_mail_autolink(data + i, size - i)) != 0) {
+			*autolink = HOEDOWN_AUTOLINK_EMAIL;
+			return i + j;
+		}
+	}
+
+	if (i > 2 && data[i] == ':') {
+		*autolink = HOEDOWN_AUTOLINK_NORMAL;
+		i++;
+	}
+
+	/* completing autolink test: no spacing or ' or " */
+	if (i >= size)
+		*autolink = HOEDOWN_AUTOLINK_NONE;
+
+	else if (*autolink) {
+		j = i;
+
+		while (i < size) {
+			if (data[i] == '\\')
+				i += 2;
+			else if (data[i] == '>' || data[i] == '\'' || data[i] == '"' ||
+					 data[i] == ' ' || data[i] == '\n')
+				break;
+			else
+				i++;
+		}
+
+		if (i >= size)
+			return 0;
+		if (i > j && data[i] == '>')
+			return i + 1;
+		/* one of the forbidden chars has been found */
+		*autolink = HOEDOWN_AUTOLINK_NONE;
+	}
+
+	/* looking for something looking like a tag end */
+	while (i < size && data[i] != '>')
+		i++;
+	if (i >= size)
+		return 0;
+	return i + 1;
+}
+
+/* parse_inline • parses inline markdown elements */
+static void parse_inline(hoedown_buffer* ob, hoedown_document* doc,
+						 uint8_t* data, size_t size)
+{
+	size_t i = 0, end = 0, consumed = 0;
+	hoedown_buffer work = {0, 0, 0, 0, NULL, NULL, NULL};
+	uint8_t* active_char = doc->active_char;
+
+	if (doc->work_bufs[BUFFER_SPAN].size + doc->work_bufs[BUFFER_BLOCK].size >
+		doc->max_nesting)
+		return;
+
+	while (i < size) {
+		/* copying inactive chars into the output */
+		while (end < size && active_char[data[end]] == 0)
+			end++;
+
+		if (doc->md.normal_text) {
+			work.data = data + i;
+			work.size = end - i;
+			doc->md.normal_text(ob, &work, &doc->data);
+		} else
+			hoedown_buffer_put(ob, data + i, end - i);
+
+		if (end >= size)
+			break;
+		i = end;
+
+		end = markdown_char_ptrs[(int)active_char[data[end]]](
+			ob, doc, data + i, i - consumed, size - i);
+		if (!end) /* no action from the callback */
+			end = i + 1;
+		else {
+			i += end;
+			end = i;
+			consumed = i;
+		}
+	}
+}
+
+/* is_escaped • returns whether special char at data[loc] is escaped by '\\' */
+static int is_escaped(uint8_t* data, size_t loc)
+{
+	size_t i = loc;
+	while (i >= 1 && data[i - 1] == '\\')
+		i--;
+
+	/* odd numbers of backslashes escapes data[loc] */
+	return (loc - i) % 2;
+}
+
+/* find_emph_char • looks for the next emph uint8_t, skipping other constructs
+ */
+static size_t find_emph_char(uint8_t* data, size_t size, uint8_t c)
+{
+	size_t i = 0;
+
+	while (i < size) {
+		while (i < size && data[i] != c && data[i] != '[' && data[i] != '`')
+			i++;
+
+		if (i == size)
+			return 0;
+
+		/* not counting escaped chars */
+		if (is_escaped(data, i)) {
+			i++;
+			continue;
+		}
+
+		if (data[i] == c)
+			return i;
+
+		/* skipping a codespan */
+		if (data[i] == '`') {
+			size_t span_nb = 0, bt;
+			size_t tmp_i = 0;
+
+			/* counting the number of opening backticks */
+			while (i < size && data[i] == '`') {
+				i++;
+				span_nb++;
+			}
+
+			if (i >= size)
+				return 0;
+
+			/* finding the matching closing sequence */
+			bt = 0;
+			while (i < size && bt < span_nb) {
+				if (!tmp_i && data[i] == c)
+					tmp_i = i;
+				if (data[i] == '`')
+					bt++;
+				else
+					bt = 0;
+				i++;
+			}
+
+			/* not a well-formed codespan; use found matching emph char */
+			if (i >= size)
+				return tmp_i;
+		}
+		/* skipping a link */
+		else if (data[i] == '[') {
+			size_t tmp_i = 0;
+			uint8_t cc;
+
+			i++;
+			while (i < size && data[i] != ']') {
+				if (!tmp_i && data[i] == c)
+					tmp_i = i;
+				i++;
+			}
+
+			i++;
+			while (i < size && _isspace(data[i]))
+				i++;
+
+			if (i >= size)
+				return tmp_i;
+
+			switch (data[i]) {
+				case '[':
+					cc = ']';
+					break;
+
+				case '(':
+					cc = ')';
+					break;
+
+				default:
+					if (tmp_i)
+						return tmp_i;
+					else
+						continue;
+			}
+
+			i++;
+			while (i < size && data[i] != cc) {
+				if (!tmp_i && data[i] == c)
+					tmp_i = i;
+				i++;
+			}
+
+			if (i >= size)
+				return tmp_i;
+
+			i++;
+		}
+	}
+
+	return 0;
+}
+
+/* parse_emph1 • parsing single emphase */
+/* closed by a symbol not preceded by spacing and not followed by symbol */
+static size_t parse_emph1(hoedown_buffer* ob, hoedown_document* doc,
+						  uint8_t* data, size_t size, uint8_t c)
+{
+	size_t i = 0, len;
+	hoedown_buffer* work = 0;
+	int r;
+
+	/* skipping one symbol if coming from emph3 */
+	if (size > 1 && data[0] == c && data[1] == c)
+		i = 1;
+
+	while (i < size) {
+		len = find_emph_char(data + i, size - i, c);
+		if (!len)
+			return 0;
+		i += len;
+		if (i >= size)
+			return 0;
+
+		if (data[i] == c && !_isspace(data[i - 1])) {
+
+			if (doc->ext_flags & HOEDOWN_EXT_NO_INTRA_EMPHASIS) {
+				if (i + 1 < size && isalnum(data[i + 1]))
+					continue;
+			}
+
+			work = newbuf(doc, BUFFER_SPAN);
+			parse_inline(work, doc, data, i);
+
+			if (doc->ext_flags & HOEDOWN_EXT_UNDERLINE && c == '_')
+				r = doc->md.underline(ob, work, &doc->data);
+			else
+				r = doc->md.emphasis(ob, work, &doc->data);
+
+			popbuf(doc, BUFFER_SPAN);
+			return r ? i + 1 : 0;
+		}
+	}
+
+	return 0;
+}
+
+/* parse_emph2 • parsing single emphase */
+static size_t parse_emph2(hoedown_buffer* ob, hoedown_document* doc,
+						  uint8_t* data, size_t size, uint8_t c)
+{
+	size_t i = 0, len;
+	hoedown_buffer* work = 0;
+	int r;
+
+	while (i < size) {
+		len = find_emph_char(data + i, size - i, c);
+		if (!len)
+			return 0;
+		i += len;
+
+		if (i + 1 < size && data[i] == c && data[i + 1] == c && i &&
+			!_isspace(data[i - 1])) {
+			work = newbuf(doc, BUFFER_SPAN);
+			parse_inline(work, doc, data, i);
+
+			if (c == '~')
+				r = doc->md.strikethrough(ob, work, &doc->data);
+			else if (c == '=')
+				r = doc->md.highlight(ob, work, &doc->data);
+			else
+				r = doc->md.double_emphasis(ob, work, &doc->data);
+
+			popbuf(doc, BUFFER_SPAN);
+			return r ? i + 2 : 0;
+		}
+		i++;
+	}
+	return 0;
+}
+
+/* parse_emph3 • parsing single emphase */
+/* finds the first closing tag, and delegates to the other emph */
+static size_t parse_emph3(hoedown_buffer* ob, hoedown_document* doc,
+						  uint8_t* data, size_t size, uint8_t c)
+{
+	size_t i = 0, len;
+	int r;
+
+	while (i < size) {
+		len = find_emph_char(data + i, size - i, c);
+		if (!len)
+			return 0;
+		i += len;
+
+		/* skip spacing preceded symbols */
+		if (data[i] != c || _isspace(data[i - 1]))
+			continue;
+
+		if (i + 2 < size && data[i + 1] == c && data[i + 2] == c &&
+			doc->md.triple_emphasis) {
+			/* triple symbol found */
+			hoedown_buffer* work = newbuf(doc, BUFFER_SPAN);
+
+			parse_inline(work, doc, data, i);
+			r = doc->md.triple_emphasis(ob, work, &doc->data);
+			popbuf(doc, BUFFER_SPAN);
+			return r ? i + 3 : 0;
+
+		} else if (i + 1 < size && data[i + 1] == c) {
+			/* double symbol found, handing over to emph1 */
+			len = parse_emph1(ob, doc, data - 2, size + 2, c);
+			if (!len)
+				return 0;
+			else
+				return len - 2;
+
+		} else {
+			/* single symbol found, handing over to emph2 */
+			len = parse_emph2(ob, doc, data - 1, size + 1, c);
+			if (!len)
+				return 0;
+			else
+				return len - 1;
+		}
+	}
+	return 0;
+}
+
+/* parse_math • parses a math span until the given ending delimiter */
+static size_t parse_math(hoedown_buffer* ob, hoedown_document* doc,
+						 uint8_t* data, size_t offset, size_t size,
+						 const char* end, size_t delimsz, int displaymode)
+{
+	hoedown_buffer text = {NULL, 0, 0, 0, NULL, NULL, NULL};
+	size_t i = delimsz;
+
+	if (!doc->md.math)
+		return 0;
+
+	/* find ending delimiter */
+	while (1) {
+		while (i < size && data[i] != (uint8_t)end[0])
+			i++;
+
+		if (i >= size)
+			return 0;
+
+		if (!is_escaped(data, i) && !(i + delimsz > size) &&
+			memcmp(data + i, end, delimsz) == 0)
+			break;
+
+		i++;
+	}
+
+	/* prepare buffers */
+	text.data = data + delimsz;
+	text.size = i - delimsz;
+
+	/* if this is a $$ and MATH_EXPLICIT is not active,
+	 * guess whether displaymode should be enabled from the context */
+	i += delimsz;
+	if (delimsz == 2 && !(doc->ext_flags & HOEDOWN_EXT_MATH_EXPLICIT))
+		displaymode = is_empty_all(data - offset, offset) &&
+					  is_empty_all(data + i, size - i);
+
+	/* call callback */
+	if (doc->md.math(ob, &text, displaymode, &doc->data))
+		return i;
+
+	return 0;
+}
+
+/* char_emphasis • single and double emphasis parsing */
+static size_t char_emphasis(hoedown_buffer* ob, hoedown_document* doc,
+							uint8_t* data, size_t offset, size_t size)
+{
+	uint8_t c = data[0];
+	size_t ret;
+
+	if (doc->ext_flags & HOEDOWN_EXT_NO_INTRA_EMPHASIS) {
+		if (offset > 0 && !_isspace(data[-1]) && data[-1] != '>' &&
+			data[-1] != '(')
+			return 0;
+	}
+
+	if (size > 2 && data[1] != c) {
+		/* spacing cannot follow an opening emphasis;
+		 * strikethrough and highlight only takes two characters '~~' */
+		if (c == '~' || c == '=' || _isspace(data[1]) ||
+			(ret = parse_emph1(ob, doc, data + 1, size - 1, c)) == 0)
+			return 0;
+
+		return ret + 1;
+	}
+
+	if (size > 3 && data[1] == c && data[2] != c) {
+		if (_isspace(data[2]) ||
+			(ret = parse_emph2(ob, doc, data + 2, size - 2, c)) == 0)
+			return 0;
+
+		return ret + 2;
+	}
+
+	if (size > 4 && data[1] == c && data[2] == c && data[3] != c) {
+		if (c == '~' || c == '=' || _isspace(data[3]) ||
+			(ret = parse_emph3(ob, doc, data + 3, size - 3, c)) == 0)
+			return 0;
+
+		return ret + 3;
+	}
+
+	return 0;
+}
+
+/* char_linebreak • '\n' preceded by two spaces (assuming linebreak != 0) */
+static size_t char_linebreak(hoedown_buffer* ob, hoedown_document* doc,
+							 uint8_t* data, size_t offset, size_t size)
+{
+	if (offset < 2 || data[-1] != ' ' || data[-2] != ' ')
+		return 0;
+
+	/* removing the last space from ob and rendering */
+	while (ob->size && ob->data[ob->size - 1] == ' ')
+		ob->size--;
+
+	return doc->md.linebreak(ob, &doc->data) ? 1 : 0;
+}
+
+/* char_codespan • '`' parsing a code span (assuming codespan != 0) */
+static size_t char_codespan(hoedown_buffer* ob, hoedown_document* doc,
+							uint8_t* data, size_t offset, size_t size)
+{
+	hoedown_buffer work = {NULL, 0, 0, 0, NULL, NULL, NULL};
+	size_t end, nb = 0, i, f_begin, f_end;
+
+	/* counting the number of backticks in the delimiter */
+	while (nb < size && data[nb] == '`')
+		nb++;
+
+	/* finding the next delimiter */
+	i = 0;
+	for (end = nb; end < size && i < nb; end++) {
+		if (data[end] == '`')
+			i++;
+		else
+			i = 0;
+	}
+
+	if (i < nb && end >= size)
+		return 0; /* no matching delimiter */
+
+	/* trimming outside spaces */
+	f_begin = nb;
+	while (f_begin < end && data[f_begin] == ' ')
+		f_begin++;
+
+	f_end = end - nb;
+	while (f_end > nb && data[f_end - 1] == ' ')
+		f_end--;
+
+	/* real code span */
+	if (f_begin < f_end) {
+		work.data = data + f_begin;
+		work.size = f_end - f_begin;
+
+		if (!doc->md.codespan(ob, &work, &doc->data))
+			end = 0;
+	} else {
+		if (!doc->md.codespan(ob, 0, &doc->data))
+			end = 0;
+	}
+
+	return end;
+}
+
+/* char_quote • '"' parsing a quote */
+static size_t char_quote(hoedown_buffer* ob, hoedown_document* doc,
+						 uint8_t* data, size_t offset, size_t size)
+{
+	size_t end, nq = 0, i, f_begin, f_end;
+
+	/* counting the number of quotes in the delimiter */
+	while (nq < size && data[nq] == '"')
+		nq++;
+
+	/* finding the next delimiter */
+	end = nq;
+	while (1) {
+		i = end;
+		end += find_emph_char(data + end, size - end, '"');
+		if (end == i)
+			return 0; /* no matching delimiter */
+		i = end;
+		while (end < size && data[end] == '"' && end - i < nq)
+			end++;
+		if (end - i >= nq)
+			break;
+	}
+
+	/* trimming outside spaces */
+	f_begin = nq;
+	while (f_begin < end && data[f_begin] == ' ')
+		f_begin++;
+
+	f_end = end - nq;
+	while (f_end > nq && data[f_end - 1] == ' ')
+		f_end--;
+
+	/* real quote */
+	if (f_begin < f_end) {
+		hoedown_buffer* work = newbuf(doc, BUFFER_SPAN);
+		parse_inline(work, doc, data + f_begin, f_end - f_begin);
+
+		if (!doc->md.quote(ob, work, &doc->data))
+			end = 0;
+		popbuf(doc, BUFFER_SPAN);
+	} else {
+		if (!doc->md.quote(ob, 0, &doc->data))
+			end = 0;
+	}
+
+	return end;
+}
+
+/* char_escape • '\\' backslash escape */
+static size_t char_escape(hoedown_buffer* ob, hoedown_document* doc,
+						  uint8_t* data, size_t offset, size_t size)
+{
+	static const char* escape_chars = "\\`*_{}[]()#+-.!:|&<>^~=\"$";
+	hoedown_buffer work = {0, 0, 0, 0, NULL, NULL, NULL};
+	size_t w;
+
+	if (size > 1) {
+		if (data[1] == '\\' && (doc->ext_flags & HOEDOWN_EXT_MATH) &&
+			size > 2 && (data[2] == '(' || data[2] == '[')) {
+			const char* end = (data[2] == '[') ? "\\\\]" : "\\\\)";
+			w = parse_math(ob, doc, data, offset, size, end, 3, data[2] == '[');
+			if (w)
+				return w;
+		}
+
+		if (strchr(escape_chars, data[1]) == NULL)
+			return 0;
+
+		if (doc->md.normal_text) {
+			work.data = data + 1;
+			work.size = 1;
+			doc->md.normal_text(ob, &work, &doc->data);
+		} else
+			hoedown_buffer_putc(ob, data[1]);
+	} else if (size == 1) {
+		hoedown_buffer_putc(ob, data[0]);
+	}
+
+	return 2;
+}
+
+/* char_entity • '&' escaped when it doesn't belong to an entity */
+/* valid entities are assumed to be anything matching &#?[A-Za-z0-9]+; */
+static size_t char_entity(hoedown_buffer* ob, hoedown_document* doc,
+						  uint8_t* data, size_t offset, size_t size)
+{
+	size_t end = 1;
+	hoedown_buffer work = {0, 0, 0, 0, NULL, NULL, NULL};
+
+	if (end < size && data[end] == '#')
+		end++;
+
+	while (end < size && isalnum(data[end]))
+		end++;
+
+	if (end < size && data[end] == ';')
+		end++; /* real entity */
+	else
+		return 0; /* lone '&' */
+
+	if (doc->md.entity) {
+		work.data = data;
+		work.size = end;
+		doc->md.entity(ob, &work, &doc->data);
+	} else
+		hoedown_buffer_put(ob, data, end);
+
+	return end;
+}
+
+/* char_langle_tag • '<' when tags or autolinks are allowed */
+static size_t char_langle_tag(hoedown_buffer* ob, hoedown_document* doc,
+							  uint8_t* data, size_t offset, size_t size)
+{
+	hoedown_buffer work = {NULL, 0, 0, 0, NULL, NULL, NULL};
+	hoedown_autolink_type altype = HOEDOWN_AUTOLINK_NONE;
+	size_t end = tag_length(data, size, &altype);
+	int ret = 0;
+
+	work.data = data;
+	work.size = end;
+
+	if (end > 2) {
+		if (doc->md.autolink && altype != HOEDOWN_AUTOLINK_NONE) {
+			hoedown_buffer* u_link = newbuf(doc, BUFFER_SPAN);
+			work.data = data + 1;
+			work.size = end - 2;
+			unscape_text(u_link, &work);
+			ret = doc->md.autolink(ob, u_link, altype, &doc->data);
+			popbuf(doc, BUFFER_SPAN);
+		} else if (doc->md.raw_html)
+			ret = doc->md.raw_html(ob, &work, &doc->data);
+	}
+
+	if (!ret)
+		return 0;
+	else
+		return end;
+}
+
+static size_t char_autolink_www(hoedown_buffer* ob, hoedown_document* doc,
+								uint8_t* data, size_t offset, size_t size)
+{
+	hoedown_buffer *link, *link_url, *link_text;
+	size_t link_len, rewind;
+
+	if (!doc->md.link || doc->in_link_body)
+		return 0;
+
+	link = newbuf(doc, BUFFER_SPAN);
+
+	if ((link_len = hoedown_autolink__www(&rewind, link, data, offset, size,
+										  HOEDOWN_AUTOLINK_SHORT_DOMAINS)) >
+		0) {
+		link_url = newbuf(doc, BUFFER_SPAN);
+		HOEDOWN_BUFPUTSL(link_url, "http://");
+		hoedown_buffer_put(link_url, link->data, link->size);
+
+		ob->size -= rewind;
+		if (doc->md.normal_text) {
+			link_text = newbuf(doc, BUFFER_SPAN);
+			doc->md.normal_text(link_text, link, &doc->data);
+			doc->md.link(ob, link_text, link_url, NULL, &doc->data);
+			popbuf(doc, BUFFER_SPAN);
+		} else {
+			doc->md.link(ob, link, link_url, NULL, &doc->data);
+		}
+		popbuf(doc, BUFFER_SPAN);
+	}
+
+	popbuf(doc, BUFFER_SPAN);
+	return link_len;
+}
+
+static size_t char_autolink_email(hoedown_buffer* ob, hoedown_document* doc,
+								  uint8_t* data, size_t offset, size_t size)
+{
+	hoedown_buffer* link;
+	size_t link_len, rewind;
+
+	if (!doc->md.autolink || doc->in_link_body)
+		return 0;
+
+	link = newbuf(doc, BUFFER_SPAN);
+
+	if ((link_len = hoedown_autolink__email(&rewind, link, data, offset, size,
+											0)) > 0) {
+		ob->size -= rewind;
+		doc->md.autolink(ob, link, HOEDOWN_AUTOLINK_EMAIL, &doc->data);
+	}
+
+	popbuf(doc, BUFFER_SPAN);
+	return link_len;
+}
+
+static size_t char_autolink_url(hoedown_buffer* ob, hoedown_document* doc,
+								uint8_t* data, size_t offset, size_t size)
+{
+	hoedown_buffer* link;
+	size_t link_len, rewind;
+
+	if (!doc->md.autolink || doc->in_link_body)
+		return 0;
+
+	link = newbuf(doc, BUFFER_SPAN);
+
+	if ((link_len =
+			 hoedown_autolink__url(&rewind, link, data, offset, size, 0)) > 0) {
+		ob->size -= rewind;
+		doc->md.autolink(ob, link, HOEDOWN_AUTOLINK_NORMAL, &doc->data);
+	}
+
+	popbuf(doc, BUFFER_SPAN);
+	return link_len;
+}
+
+/* char_link • '[': parsing a link, a footnote or an image */
+static size_t char_link(hoedown_buffer* ob, hoedown_document* doc,
+						uint8_t* data, size_t offset, size_t size)
+{
+	int is_img =
+		(offset && data[-1] == '!' && !is_escaped(data - offset, offset - 1));
+	int is_footnote =
+		(doc->ext_flags & HOEDOWN_EXT_FOOTNOTES && data[1] == '^');
+	size_t i = 1, txt_e, link_b = 0, link_e = 0, title_b = 0, title_e = 0;
+	hoedown_buffer* content = NULL;
+	hoedown_buffer* link = NULL;
+	hoedown_buffer* title = NULL;
+	hoedown_buffer* u_link = NULL;
+	size_t org_work_size = doc->work_bufs[BUFFER_SPAN].size;
+	int ret = 0, in_title = 0, qtype = 0;
+
+	/* checking whether the correct renderer exists */
+	if ((is_footnote && !doc->md.footnote_ref) || (is_img && !doc->md.image) ||
+		(!is_img && !is_footnote && !doc->md.link))
+		goto cleanup;
+
+	/* looking for the matching closing bracket */
+	i += find_emph_char(data + i, size - i, ']');
+	txt_e = i;
+
+	if (i < size && data[i] == ']')
+		i++;
+	else
+		goto cleanup;
+
+	/* footnote link */
+	if (is_footnote) {
+		hoedown_buffer id = {NULL, 0, 0, 0, NULL, NULL, NULL};
+		struct footnote_ref* fr;
+
+		if (txt_e < 3)
+			goto cleanup;
+
+		id.data = data + 2;
+		id.size = txt_e - 2;
+
+		fr = find_footnote_ref(&doc->footnotes_found, id.data, id.size);
+
+		/* mark footnote used */
+		if (fr && !fr->is_used) {
+			if (!add_footnote_ref(&doc->footnotes_used, fr))
+				goto cleanup;
+			fr->is_used = 1;
+			fr->num = doc->footnotes_used.count;
+
+			/* render */
+			if (doc->md.footnote_ref)
+				ret = doc->md.footnote_ref(ob, fr->num, &doc->data);
+		}
+
+		goto cleanup;
+	}
+
+	/* skip any amount of spacing */
+	/* (this is much more laxist than original markdown syntax) */
+	while (i < size && _isspace(data[i]))
+		i++;
+
+	/* inline style link */
+	if (i < size && data[i] == '(') {
+		size_t nb_p;
+
+		/* skipping initial spacing */
+		i++;
+
+		while (i < size && _isspace(data[i]))
+			i++;
+
+		link_b = i;
+
+		/* looking for link end: ' " ) */
+		/* Count the number of open parenthesis */
+		nb_p = 0;
+
+		while (i < size) {
+			if (data[i] == '\\')
+				i += 2;
+			else if (data[i] == '(' && i != 0) {
+				nb_p++;
+				i++;
+			} else if (data[i] == ')') {
+				if (nb_p == 0)
+					break;
+				else
+					nb_p--;
+				i++;
+			} else if (i >= 1 && _isspace(data[i - 1]) &&
+					   (data[i] == '\'' || data[i] == '"'))
+				break;
+			else
+				i++;
+		}
+
+		if (i >= size)
+			goto cleanup;
+		link_e = i;
+
+		/* looking for title end if present */
+		if (data[i] == '\'' || data[i] == '"') {
+			qtype = data[i];
+			in_title = 1;
+			i++;
+			title_b = i;
+
+			while (i < size) {
+				if (data[i] == '\\')
+					i += 2;
+				else if (data[i] == qtype) {
+					in_title = 0;
+					i++;
+				} else if ((data[i] == ')') && !in_title)
+					break;
+				else
+					i++;
+			}
+
+			if (i >= size)
+				goto cleanup;
+
+			/* skipping spacing after title */
+			title_e = i - 1;
+			while (title_e > title_b && _isspace(data[title_e]))
+				title_e--;
+
+			/* checking for closing quote presence */
+			if (data[title_e] != '\'' && data[title_e] != '"') {
+				title_b = title_e = 0;
+				link_e = i;
+			}
+		}
+
+		/* remove spacing at the end of the link */
+		while (link_e > link_b && _isspace(data[link_e - 1]))
+			link_e--;
+
+		/* remove optional angle brackets around the link */
+		if (data[link_b] == '<')
+			link_b++;
+		if (data[link_e - 1] == '>')
+			link_e--;
+
+		/* building escaped link and title */
+		if (link_e > link_b) {
+			link = newbuf(doc, BUFFER_SPAN);
+			hoedown_buffer_put(link, data + link_b, link_e - link_b);
+		}
+
+		if (title_e > title_b) {
+			title = newbuf(doc, BUFFER_SPAN);
+			hoedown_buffer_put(title, data + title_b, title_e - title_b);
+		}
+
+		i++;
+	}
+
+	/* reference style link */
+	else if (i < size && data[i] == '[') {
+		hoedown_buffer* id = newbuf(doc, BUFFER_SPAN);
+		struct link_ref* lr;
+
+		/* looking for the id */
+		i++;
+		link_b = i;
+		while (i < size && data[i] != ']')
+			i++;
+		if (i >= size)
+			goto cleanup;
+		link_e = i;
+
+		/* finding the link_ref */
+		if (link_b == link_e)
+			replace_spacing(id, data + 1, txt_e - 1);
+		else
+			hoedown_buffer_put(id, data + link_b, link_e - link_b);
+
+		lr = find_link_ref(doc->refs, id->data, id->size);
+		if (!lr)
+			goto cleanup;
+
+		/* keeping link and title from link_ref */
+		link = lr->link;
+		title = lr->title;
+		i++;
+	}
+
+	/* shortcut reference style link */
+	else {
+		hoedown_buffer* id = newbuf(doc, BUFFER_SPAN);
+		struct link_ref* lr;
+
+		/* crafting the id */
+		replace_spacing(id, data + 1, txt_e - 1);
+
+		/* finding the link_ref */
+		lr = find_link_ref(doc->refs, id->data, id->size);
+		if (!lr)
+			goto cleanup;
+
+		/* keeping link and title from link_ref */
+		link = lr->link;
+		title = lr->title;
+
+		/* rewinding the spacing */
+		i = txt_e + 1;
+	}
+
+	/* building content: img alt is kept, only link content is parsed */
+	if (txt_e > 1) {
+		content = newbuf(doc, BUFFER_SPAN);
+		if (is_img) {
+			hoedown_buffer_put(content, data + 1, txt_e - 1);
+		} else {
+			/* disable autolinking when parsing inline the
+			 * content of a link */
+			doc->in_link_body = 1;
+			parse_inline(content, doc, data + 1, txt_e - 1);
+			doc->in_link_body = 0;
+		}
+	}
+
+	if (link) {
+		u_link = newbuf(doc, BUFFER_SPAN);
+		unscape_text(u_link, link);
+	}
+
+	/* calling the relevant rendering function */
+	if (is_img) {
+		if (ob->size && ob->data[ob->size - 1] == '!')
+			ob->size -= 1;
+
+		ret = doc->md.image(ob, u_link, title, content, &doc->data);
+	} else {
+		ret = doc->md.link(ob, content, u_link, title, &doc->data);
+	}
+
+	/* cleanup */
+cleanup:
+	doc->work_bufs[BUFFER_SPAN].size = (int)org_work_size;
+	return ret ? i : 0;
+}
+
+static size_t char_superscript(hoedown_buffer* ob, hoedown_document* doc,
+							   uint8_t* data, size_t offset, size_t size)
+{
+	size_t sup_start, sup_len;
+	hoedown_buffer* sup;
+
+	if (!doc->md.superscript)
+		return 0;
+
+	if (size < 2)
+		return 0;
+
+	if (data[1] == '(') {
+		sup_start = 2;
+		sup_len = find_emph_char(data + 2, size - 2, ')') + 2;
+
+		if (sup_len == size)
+			return 0;
+	} else {
+		sup_start = sup_len = 1;
+
+		while (sup_len < size && !_isspace(data[sup_len]))
+			sup_len++;
+	}
+
+	if (sup_len - sup_start == 0)
+		return (sup_start == 2) ? 3 : 0;
+
+	sup = newbuf(doc, BUFFER_SPAN);
+	parse_inline(sup, doc, data + sup_start, sup_len - sup_start);
+	doc->md.superscript(ob, sup, &doc->data);
+	popbuf(doc, BUFFER_SPAN);
+
+	return (sup_start == 2) ? sup_len + 1 : sup_len;
+}
+
+static size_t char_math(hoedown_buffer* ob, hoedown_document* doc,
+						uint8_t* data, size_t offset, size_t size)
+{
+	/* double dollar */
+	if (size > 1 && data[1] == '$')
+		return parse_math(ob, doc, data, offset, size, "$$", 2, 1);
+
+	/* single dollar allowed only with MATH_EXPLICIT flag */
+	if (doc->ext_flags & HOEDOWN_EXT_MATH_EXPLICIT)
+		return parse_math(ob, doc, data, offset, size, "$", 1, 0);
+
+	return 0;
+}
+
+/*********************************
+ * BLOCK-LEVEL PARSING FUNCTIONS *
+ *********************************/
+
+/* is_empty • returns the line length when it is empty, 0 otherwise */
+static size_t is_empty(const uint8_t* data, size_t size)
+{
+	size_t i;
+
+	for (i = 0; i < size && data[i] != '\n'; i++)
+		if (data[i] != ' ')
+			return 0;
+
+	return i + 1;
+}
+
+/* is_hrule • returns whether a line is a horizontal rule */
+static int is_hrule(uint8_t* data, size_t size)
+{
+	size_t i = 0, n = 0;
+	uint8_t c;
+
+	/* skipping initial spaces */
+	if (size < 3)
+		return 0;
+	if (data[0] == ' ') {
+		i++;
+		if (data[1] == ' ') {
+			i++;
+			if (data[2] == ' ') {
+				i++;
+			}
+		}
+	}
+
+	/* looking at the hrule uint8_t */
+	if (i + 2 >= size || (data[i] != '*' && data[i] != '-' && data[i] != '_'))
+		return 0;
+	c = data[i];
+
+	/* the whole line must be the char or space */
+	while (i < size && data[i] != '\n') {
+		if (data[i] == c)
+			n++;
+		else if (data[i] != ' ')
+			return 0;
+
+		i++;
+	}
+
+	return n >= 3;
+}
+
+/* check if a line is a code fence; return the
+ * end of the code fence. if passed, width of
+ * the fence rule and character will be returned */
+static size_t is_codefence(uint8_t* data, size_t size, size_t* width,
+						   uint8_t* chr)
+{
+	size_t i = 0, n = 1;
+	uint8_t c;
+
+	/* skipping initial spaces */
+	if (size < 3)
+		return 0;
+
+	if (data[0] == ' ') {
+		i++;
+		if (data[1] == ' ') {
+			i++;
+			if (data[2] == ' ') {
+				i++;
+			}
+		}
+	}
+
+	/* looking at the hrule uint8_t */
+	c = data[i];
+	if (i + 2 >= size || !(c == '~' || c == '`'))
+		return 0;
+
+	/* the fence must be that same character */
+	while (++i < size && data[i] == c)
+		++n;
+
+	if (n < 3)
+		return 0;
+
+	if (width)
+		*width = n;
+	if (chr)
+		*chr = c;
+	return i;
+}
+
+/* expects single line, checks if it's a codefence and extracts language */
+static size_t parse_codefence(uint8_t* data, size_t size, hoedown_buffer* lang,
+							  size_t* width, uint8_t* chr)
+{
+	size_t i, w, lang_start;
+
+	i = w = is_codefence(data, size, width, chr);
+	if (i == 0)
+		return 0;
+
+	while (i < size && _isspace(data[i]))
+		i++;
+
+	lang_start = i;
+
+	while (i < size && !_isspace(data[i]))
+		i++;
+
+	lang->data = data + lang_start;
+	lang->size = i - lang_start;
+
+	/* Avoid parsing a codespan as a fence */
+	i = lang_start + 2;
+	while (i < size &&
+		   !(data[i] == *chr && data[i - 1] == *chr && data[i - 2] == *chr))
+		i++;
+	if (i < size)
+		return 0;
+
+	return w;
+}
+
+/* is_atxheader • returns whether the line is a hash-prefixed header */
+static int is_atxheader(hoedown_document* doc, uint8_t* data, size_t size)
+{
+	if (data[0] != '#')
+		return 0;
+
+	if (doc->ext_flags & HOEDOWN_EXT_SPACE_HEADERS) {
+		size_t level = 0;
+
+		while (level < size && level < 6 && data[level] == '#')
+			level++;
+
+		if (level < size && data[level] != ' ')
+			return 0;
+	}
+
+	return 1;
+}
+
+/* is_headerline • returns whether the line is a setext-style hdr underline */
+static int is_headerline(uint8_t* data, size_t size)
+{
+	size_t i = 0;
+
+	/* test of level 1 header */
+	if (data[i] == '=') {
+		for (i = 1; i < size && data[i] == '='; i++)
+			;
+		while (i < size && data[i] == ' ')
+			i++;
+		return (i >= size || data[i] == '\n') ? 1 : 0;
+	}
+
+	/* test of level 2 header */
+	if (data[i] == '-') {
+		for (i = 1; i < size && data[i] == '-'; i++)
+			;
+		while (i < size && data[i] == ' ')
+			i++;
+		return (i >= size || data[i] == '\n') ? 2 : 0;
+	}
+
+	return 0;
+}
+
+static int is_next_headerline(uint8_t* data, size_t size)
+{
+	size_t i = 0;
+
+	while (i < size && data[i] != '\n')
+		i++;
+
+	if (++i >= size)
+		return 0;
+
+	return is_headerline(data + i, size - i);
+}
+
+/* prefix_quote • returns blockquote prefix length */
+static size_t prefix_quote(uint8_t* data, size_t size)
+{
+	size_t i = 0;
+	if (i < size && data[i] == ' ')
+		i++;
+	if (i < size && data[i] == ' ')
+		i++;
+	if (i < size && data[i] == ' ')
+		i++;
+
+	if (i < size && data[i] == '>') {
+		if (i + 1 < size && data[i + 1] == ' ')
+			return i + 2;
+
+		return i + 1;
+	}
+
+	return 0;
+}
+
+/* prefix_code • returns prefix length for block code*/
+static size_t prefix_code(uint8_t* data, size_t size)
+{
+	if (size > 3 && data[0] == ' ' && data[1] == ' ' && data[2] == ' ' &&
+		data[3] == ' ')
+		return 4;
+
+	return 0;
+}
+
+/* prefix_oli • returns ordered list item prefix */
+static size_t prefix_oli(uint8_t* data, size_t size)
+{
+	size_t i = 0;
+
+	if (i < size && data[i] == ' ')
+		i++;
+	if (i < size && data[i] == ' ')
+		i++;
+	if (i < size && data[i] == ' ')
+		i++;
+
+	if (i >= size || data[i] < '0' || data[i] > '9')
+		return 0;
+
+	while (i < size && data[i] >= '0' && data[i] <= '9')
+		i++;
+
+	if (i + 1 >= size || data[i] != '.' || data[i + 1] != ' ')
+		return 0;
+
+	if (is_next_headerline(data + i, size - i))
+		return 0;
+
+	return i + 2;
+}
+
+/* prefix_uli • returns ordered list item prefix */
+static size_t prefix_uli(uint8_t* data, size_t size)
+{
+	size_t i = 0;
+
+	if (i < size && data[i] == ' ')
+		i++;
+	if (i < size && data[i] == ' ')
+		i++;
+	if (i < size && data[i] == ' ')
+		i++;
+
+	if (i + 1 >= size || (data[i] != '*' && data[i] != '+' && data[i] != '-') ||
+		data[i + 1] != ' ')
+		return 0;
+
+	if (is_next_headerline(data + i, size - i))
+		return 0;
+
+	return i + 2;
+}
+
+/* parse_block • parsing of one block, returning next uint8_t to parse */
+static void parse_block(hoedown_buffer* ob, hoedown_document* doc,
+						uint8_t* data, size_t size);
+
+/* parse_blockquote • handles parsing of a blockquote fragment */
+static size_t parse_blockquote(hoedown_buffer* ob, hoedown_document* doc,
+							   uint8_t* data, size_t size)
+{
+	size_t beg, end = 0, pre, work_size = 0;
+	uint8_t* work_data = 0;
+	hoedown_buffer* out = 0;
+
+	out = newbuf(doc, BUFFER_BLOCK);
+	beg = 0;
+	while (beg < size) {
+		for (end = beg + 1; end < size && data[end - 1] != '\n'; end++)
+			;
+
+		pre = prefix_quote(data + beg, end - beg);
+
+		if (pre)
+			beg += pre; /* skipping prefix */
+
+		/* empty line followed by non-quote line */
+		else if (is_empty(data + beg, end - beg) &&
+				 (end >= size || (prefix_quote(data + end, size - end) == 0 &&
+								  !is_empty(data + end, size - end))))
+			break;
+
+		if (beg < end) { /* copy into the in-place working buffer */
+			/* hoedown_buffer_put(work, data + beg, end - beg); */
+			if (!work_data)
+				work_data = data + beg;
+			else if (data + beg != work_data + work_size)
+				memmove(work_data + work_size, data + beg, end - beg);
+			work_size += end - beg;
+		}
+		beg = end;
+	}
+
+	parse_block(out, doc, work_data, work_size);
+	if (doc->md.blockquote)
+		doc->md.blockquote(ob, out, &doc->data);
+	popbuf(doc, BUFFER_BLOCK);
+	return end;
+}
+
+static size_t parse_htmlblock(hoedown_buffer* ob, hoedown_document* doc,
+							  uint8_t* data, size_t size, int do_render);
+
+/* parse_blockquote • handles parsing of a regular paragraph */
+static size_t parse_paragraph(hoedown_buffer* ob, hoedown_document* doc,
+							  uint8_t* data, size_t size)
+{
+	hoedown_buffer work = {NULL, 0, 0, 0, NULL, NULL, NULL};
+	size_t i = 0, end = 0;
+	int level = 0;
+
+	work.data = data;
+
+	while (i < size) {
+		for (end = i + 1; end < size && data[end - 1] != '\n';
+			 end++) /* empty */
+			;
+
+		if (is_empty(data + i, size - i))
+			break;
+
+		if ((level = is_headerline(data + i, size - i)) != 0)
+			break;
+
+		if (is_atxheader(doc, data + i, size - i) ||
+			is_hrule(data + i, size - i) || prefix_quote(data + i, size - i)) {
+			end = i;
+			break;
+		}
+
+		i = end;
+	}
+
+	work.size = i;
+	while (work.size && data[work.size - 1] == '\n')
+		work.size--;
+
+	if (!level) {
+		hoedown_buffer* tmp = newbuf(doc, BUFFER_BLOCK);
+		parse_inline(tmp, doc, work.data, work.size);
+		if (doc->md.paragraph)
+			doc->md.paragraph(ob, tmp, &doc->data);
+		popbuf(doc, BUFFER_BLOCK);
+	} else {
+		hoedown_buffer* header_work;
+
+		if (work.size) {
+			size_t beg;
+			i = work.size;
+			work.size -= 1;
+
+			while (work.size && data[work.size] != '\n')
+				work.size -= 1;
+
+			beg = work.size + 1;
+			while (work.size && data[work.size - 1] == '\n')
+				work.size -= 1;
+
+			if (work.size > 0) {
+				hoedown_buffer* tmp = newbuf(doc, BUFFER_BLOCK);
+				parse_inline(tmp, doc, work.data, work.size);
+
+				if (doc->md.paragraph)
+					doc->md.paragraph(ob, tmp, &doc->data);
+
+				popbuf(doc, BUFFER_BLOCK);
+				work.data += beg;
+				work.size = i - beg;
+			} else
+				work.size = i;
+		}
+
+		header_work = newbuf(doc, BUFFER_SPAN);
+		parse_inline(header_work, doc, work.data, work.size);
+
+		if (doc->md.header)
+			doc->md.header(ob, header_work, (int)level, &doc->data);
+
+		popbuf(doc, BUFFER_SPAN);
+	}
+
+	return end;
+}
+
+/* parse_fencedcode • handles parsing of a block-level code fragment */
+static size_t parse_fencedcode(hoedown_buffer* ob, hoedown_document* doc,
+							   uint8_t* data, size_t size)
+{
+	hoedown_buffer text = {0, 0, 0, 0, NULL, NULL, NULL};
+	hoedown_buffer lang = {0, 0, 0, 0, NULL, NULL, NULL};
+	size_t i = 0, text_start, line_start;
+	size_t w, w2;
+	size_t width, width2;
+	uint8_t chr, chr2;
+
+	/* parse codefence line */
+	while (i < size && data[i] != '\n')
+		i++;
+
+	w = parse_codefence(data, i, &lang, &width, &chr);
+	if (!w)
+		return 0;
+
+	/* search for end */
+	i++;
+	text_start = i;
+	while ((line_start = i) < size) {
+		while (i < size && data[i] != '\n')
+			i++;
+
+		w2 = is_codefence(data + line_start, i - line_start, &width2, &chr2);
+		if (w == w2 && width == width2 && chr == chr2 &&
+			is_empty(data + (line_start + w), i - (line_start + w)))
+			break;
+
+		i++;
+	}
+
+	text.data = data + text_start;
+	text.size = line_start - text_start;
+
+	if (doc->md.blockcode)
+		doc->md.blockcode(ob, text.size ? &text : NULL,
+						  lang.size ? &lang : NULL, &doc->data);
+
+	return i;
+}
+
+static size_t parse_blockcode(hoedown_buffer* ob, hoedown_document* doc,
+							  uint8_t* data, size_t size)
+{
+	size_t beg, end, pre;
+	hoedown_buffer* work = 0;
+
+	work = newbuf(doc, BUFFER_BLOCK);
+
+	beg = 0;
+	while (beg < size) {
+		for (end = beg + 1; end < size && data[end - 1] != '\n'; end++) {
+		};
+		pre = prefix_code(data + beg, end - beg);
+
+		if (pre)
+			beg += pre; /* skipping prefix */
+		else if (!is_empty(data + beg, end - beg))
+			/* non-empty non-prefixed line breaks the pre */
+			break;
+
+		if (beg < end) {
+			/* verbatim copy to the working buffer,
+				escaping entities */
+			if (is_empty(data + beg, end - beg))
+				hoedown_buffer_putc(work, '\n');
+			else
+				hoedown_buffer_put(work, data + beg, end - beg);
+		}
+		beg = end;
+	}
+
+	while (work->size && work->data[work->size - 1] == '\n')
+		work->size -= 1;
+
+	hoedown_buffer_putc(work, '\n');
+
+	if (doc->md.blockcode)
+		doc->md.blockcode(ob, work, NULL, &doc->data);
+
+	popbuf(doc, BUFFER_BLOCK);
+	return beg;
+}
+
+/* parse_listitem • parsing of a single list item */
+/*    assuming initial prefix is already removed */
+static size_t parse_listitem(hoedown_buffer* ob, hoedown_document* doc,
+							 uint8_t* data, size_t size,
+							 hoedown_list_flags* flags)
+{
+	hoedown_buffer *work = 0, *inter = 0;
+	size_t beg = 0, end, pre, sublist = 0, orgpre = 0, i;
+	int in_empty = 0, has_inside_empty = 0, in_fence = 0;
+
+	/* keeping track of the first indentation prefix */
+	while (orgpre < 3 && orgpre < size && data[orgpre] == ' ')
+		orgpre++;
+
+	beg = prefix_uli(data, size);
+	if (!beg)
+		beg = prefix_oli(data, size);
+
+	if (!beg)
+		return 0;
+
+	/* skipping to the beginning of the following line */
+	end = beg;
+	while (end < size && data[end - 1] != '\n')
+		end++;
+
+	/* getting working buffers */
+	work = newbuf(doc, BUFFER_SPAN);
+	inter = newbuf(doc, BUFFER_SPAN);
+
+	/* putting the first line into the working buffer */
+	hoedown_buffer_put(work, data + beg, end - beg);
+	beg = end;
+
+	/* process the following lines */
+	while (beg < size) {
+		size_t has_next_uli = 0, has_next_oli = 0;
+
+		end++;
+
+		while (end < size && data[end - 1] != '\n')
+			end++;
+
+		/* process an empty line */
+		if (is_empty(data + beg, end - beg)) {
+			in_empty = 1;
+			beg = end;
+			continue;
+		}
+
+		/* calculating the indentation */
+		i = 0;
+		while (i < 4 && beg + i < end && data[beg + i] == ' ')
+			i++;
+
+		pre = i;
+
+		if (doc->ext_flags & HOEDOWN_EXT_FENCED_CODE) {
+			if (is_codefence(data + beg + i, end - beg - i, NULL, NULL))
+				in_fence = !in_fence;
+		}
+
+		/* Only check for new list items if we are **not** inside
+		 * a fenced code block */
+		if (!in_fence) {
+			has_next_uli = prefix_uli(data + beg + i, end - beg - i);
+			has_next_oli = prefix_oli(data + beg + i, end - beg - i);
+		}
+
+		/* checking for a new item */
+		if ((has_next_uli && !is_hrule(data + beg + i, end - beg - i)) ||
+			has_next_oli) {
+			if (in_empty)
+				has_inside_empty = 1;
+
+			/* the following item must have the same (or less) indentation */
+			if (pre <= orgpre) {
+				/* if the following item has different list type, we end this
+				 * list */
+				if (in_empty &&
+					(((*flags & HOEDOWN_LIST_ORDERED) && has_next_uli) ||
+					 (!(*flags & HOEDOWN_LIST_ORDERED) && has_next_oli)))
+					*flags |= HOEDOWN_LI_END;
+
+				break;
+			}
+
+			if (!sublist)
+				sublist = work->size;
+		}
+		/* joining only indented stuff after empty lines;
+		 * note that now we only require 1 space of indentation
+		 * to continue a list */
+		else if (in_empty && pre == 0) {
+			*flags |= HOEDOWN_LI_END;
+			break;
+		}
+
+		if (in_empty) {
+			hoedown_buffer_putc(work, '\n');
+			has_inside_empty = 1;
+			in_empty = 0;
+		}
+
+		/* adding the line without prefix into the working buffer */
+		hoedown_buffer_put(work, data + beg + i, end - beg - i);
+		beg = end;
+	}
+
+	/* render of li contents */
+	if (has_inside_empty)
+		*flags |= HOEDOWN_LI_BLOCK;
+
+	if (*flags & HOEDOWN_LI_BLOCK) {
+		/* intermediate render of block li */
+		if (sublist && sublist < work->size) {
+			parse_block(inter, doc, work->data, sublist);
+			parse_block(inter, doc, work->data + sublist, work->size - sublist);
+		} else
+			parse_block(inter, doc, work->data, work->size);
+	} else {
+		/* intermediate render of inline li */
+		if (sublist && sublist < work->size) {
+			parse_inline(inter, doc, work->data, sublist);
+			parse_block(inter, doc, work->data + sublist, work->size - sublist);
+		} else
+			parse_inline(inter, doc, work->data, work->size);
+	}
+
+	/* render of li itself */
+	if (doc->md.listitem)
+		doc->md.listitem(ob, inter, *flags, &doc->data);
+
+	popbuf(doc, BUFFER_SPAN);
+	popbuf(doc, BUFFER_SPAN);
+	return beg;
+}
+
+/* parse_list • parsing ordered or unordered list block */
+static size_t parse_list(hoedown_buffer* ob, hoedown_document* doc,
+						 uint8_t* data, size_t size, hoedown_list_flags flags)
+{
+	hoedown_buffer* work = 0;
+	size_t i = 0, j;
+
+	work = newbuf(doc, BUFFER_BLOCK);
+
+	while (i < size) {
+		j = parse_listitem(work, doc, data + i, size - i, &flags);
+		i += j;
+
+		if (!j || (flags & HOEDOWN_LI_END))
+			break;
+	}
+
+	if (doc->md.list)
+		doc->md.list(ob, work, flags, &doc->data);
+	popbuf(doc, BUFFER_BLOCK);
+	return i;
+}
+
+/* parse_atxheader • parsing of atx-style headers */
+static size_t parse_atxheader(hoedown_buffer* ob, hoedown_document* doc,
+							  uint8_t* data, size_t size)
+{
+	size_t level = 0;
+	size_t i, end, skip;
+
+	while (level < size && level < 6 && data[level] == '#')
+		level++;
+
+	for (i = level; i < size && data[i] == ' '; i++)
+		;
+
+	for (end = i; end < size && data[end] != '\n'; end++)
+		;
+	skip = end;
+
+	while (end && data[end - 1] == '#')
+		end--;
+
+	while (end && data[end - 1] == ' ')
+		end--;
+
+	if (end > i) {
+		hoedown_buffer* work = newbuf(doc, BUFFER_SPAN);
+
+		parse_inline(work, doc, data + i, end - i);
+
+		if (doc->md.header)
+			doc->md.header(ob, work, (int)level, &doc->data);
+
+		popbuf(doc, BUFFER_SPAN);
+	}
+
+	return skip;
+}
+
+/* parse_footnote_def • parse a single footnote definition */
+static void parse_footnote_def(hoedown_buffer* ob, hoedown_document* doc,
+							   unsigned int num, uint8_t* data, size_t size)
+{
+	hoedown_buffer* work = 0;
+	work = newbuf(doc, BUFFER_SPAN);
+
+	parse_block(work, doc, data, size);
+
+	if (doc->md.footnote_def)
+		doc->md.footnote_def(ob, work, num, &doc->data);
+	popbuf(doc, BUFFER_SPAN);
+}
+
+/* parse_footnote_list • render the contents of the footnotes */
+static void parse_footnote_list(hoedown_buffer* ob, hoedown_document* doc,
+								struct footnote_list* footnotes)
+{
+	hoedown_buffer* work = 0;
+	struct footnote_item* item;
+	struct footnote_ref* ref;
+
+	if (footnotes->count == 0)
+		return;
+
+	work = newbuf(doc, BUFFER_BLOCK);
+
+	item = footnotes->head;
+	while (item) {
+		ref = item->ref;
+		parse_footnote_def(work, doc, ref->num, ref->contents->data,
+						   ref->contents->size);
+		item = item->next;
+	}
+
+	if (doc->md.footnotes)
+		doc->md.footnotes(ob, work, &doc->data);
+	popbuf(doc, BUFFER_BLOCK);
+}
+
+/* htmlblock_is_end • check for end of HTML block : </tag>( *)\n */
+/*    returns tag length on match, 0 otherwise */
+/*    assumes data starts with "<" */
+static size_t htmlblock_is_end(const char* tag, size_t tag_len,
+							   hoedown_document* doc, uint8_t* data,
+							   size_t size)
+{
+	size_t i = tag_len + 3, w;
+
+	/* try to match the end tag */
+	/* note: we're not considering tags like "</tag >" which are still valid */
+	if (i > size || data[1] != '/' ||
+		strncasecmp((char*)data + 2, tag, tag_len) != 0 ||
+		data[tag_len + 2] != '>')
+		return 0;
+
+	/* rest of the line must be empty */
+	if ((w = is_empty(data + i, size - i)) == 0 && i < size)
+		return 0;
+
+	return i + w;
+}
+
+/* htmlblock_find_end • try to find HTML block ending tag */
+/*    returns the length on match, 0 otherwise */
+static size_t htmlblock_find_end(const char* tag, size_t tag_len,
+								 hoedown_document* doc, uint8_t* data,
+								 size_t size)
+{
+	size_t i = 0, w;
+
+	while (1) {
+		while (i < size && data[i] != '<')
+			i++;
+		if (i >= size)
+			return 0;
+
+		w = htmlblock_is_end(tag, tag_len, doc, data + i, size - i);
+		if (w)
+			return i + w;
+		i++;
+	}
+}
+
+/* htmlblock_find_end_strict • try to find end of HTML block in strict mode */
+/*    (it must be an unindented line, and have a blank line afterwads) */
+/*    returns the length on match, 0 otherwise */
+static size_t htmlblock_find_end_strict(const char* tag, size_t tag_len,
+										hoedown_document* doc, uint8_t* data,
+										size_t size)
+{
+	size_t i = 0, mark;
+
+	while (1) {
+		mark = i;
+		while (i < size && data[i] != '\n')
+			i++;
+		if (i < size)
+			i++;
+		if (i == mark)
+			return 0;
+
+		if (data[mark] == ' ' && mark > 0)
+			continue;
+		mark += htmlblock_find_end(tag, tag_len, doc, data + mark, i - mark);
+		if (mark == i && (is_empty(data + i, size - i) || i >= size))
+			break;
+	}
+
+	return i;
+}
+
+/* parse_htmlblock • parsing of inline HTML block */
+static size_t parse_htmlblock(hoedown_buffer* ob, hoedown_document* doc,
+							  uint8_t* data, size_t size, int do_render)
+{
+	hoedown_buffer work = {NULL, 0, 0, 0, NULL, NULL, NULL};
+	size_t i, j = 0, tag_len, tag_end;
+	const char* curtag = NULL;
+
+	work.data = data;
+
+	/* identification of the opening tag */
+	if (size < 2 || data[0] != '<')
+		return 0;
+
+	i = 1;
+	while (i < size && data[i] != '>' && data[i] != ' ')
+		i++;
+
+	if (i < size)
+		curtag = hoedown_find_block_tag((char*)data + 1, (int)i - 1);
+
+	/* handling of special cases */
+	if (!curtag) {
+
+		/* HTML comment, laxist form */
+		if (size > 5 && data[1] == '!' && data[2] == '-' && data[3] == '-') {
+			i = 5;
+
+			while (i < size && !(data[i - 2] == '-' && data[i - 1] == '-' &&
+								 data[i] == '>'))
+				i++;
+
+			i++;
+
+			if (i < size)
+				j = is_empty(data + i, size - i);
+
+			if (j) {
+				work.size = i + j;
+				if (do_render && doc->md.blockhtml)
+					doc->md.blockhtml(ob, &work, &doc->data);
+				return work.size;
+			}
+		}
+
+		/* HR, which is the only self-closing block tag considered */
+		if (size > 4 && (data[1] == 'h' || data[1] == 'H') &&
+			(data[2] == 'r' || data[2] == 'R')) {
+			i = 3;
+			while (i < size && data[i] != '>')
+				i++;
+
+			if (i + 1 < size) {
+				i++;
+				j = is_empty(data + i, size - i);
+				if (j) {
+					work.size = i + j;
+					if (do_render && doc->md.blockhtml)
+						doc->md.blockhtml(ob, &work, &doc->data);
+					return work.size;
+				}
+			}
+		}
+
+		/* no special case recognised */
+		return 0;
+	}
+
+	/* looking for a matching closing tag in strict mode */
+	tag_len = strlen(curtag);
+	tag_end = htmlblock_find_end_strict(curtag, tag_len, doc, data, size);
+
+	/* if not found, trying a second pass looking for indented match */
+	/* but not if tag is "ins" or "del" (following original Markdown.pl) */
+	if (!tag_end && strcmp(curtag, "ins") != 0 && strcmp(curtag, "del") != 0)
+		tag_end = htmlblock_find_end(curtag, tag_len, doc, data, size);
+
+	if (!tag_end)
+		return 0;
+
+	/* the end of the block has been found */
+	work.size = tag_end;
+	if (do_render && doc->md.blockhtml)
+		doc->md.blockhtml(ob, &work, &doc->data);
+
+	return tag_end;
+}
+
+static void parse_table_row(hoedown_buffer* ob, hoedown_document* doc,
+							uint8_t* data, size_t size, size_t columns,
+							hoedown_table_flags* col_data,
+							hoedown_table_flags header_flag)
+{
+	size_t i = 0, col, len;
+	hoedown_buffer* row_work = 0;
+
+	if (!doc->md.table_cell || !doc->md.table_row)
+		return;
+
+	row_work = newbuf(doc, BUFFER_SPAN);
+
+	if (i < size && data[i] == '|')
+		i++;
+
+	for (col = 0; col < columns && i < size; ++col) {
+		size_t cell_start, cell_end;
+		hoedown_buffer* cell_work;
+
+		cell_work = newbuf(doc, BUFFER_SPAN);
+
+		while (i < size && _isspace(data[i]))
+			i++;
+
+		cell_start = i;
+
+		len = find_emph_char(data + i, size - i, '|');
+		i += len ? len : size - i;
+
+		cell_end = i - 1;
+
+		while (cell_end > cell_start && _isspace(data[cell_end]))
+			cell_end--;
+
+		parse_inline(cell_work, doc, data + cell_start,
+					 1 + cell_end - cell_start);
+		doc->md.table_cell(row_work, cell_work, col_data[col] | header_flag,
+						   &doc->data);
+
+		popbuf(doc, BUFFER_SPAN);
+		i++;
+	}
+
+	for (; col < columns; ++col) {
+		hoedown_buffer empty_cell = {0, 0, 0, 0, NULL, NULL, NULL};
+		doc->md.table_cell(row_work, &empty_cell, col_data[col] | header_flag,
+						   &doc->data);
+	}
+
+	doc->md.table_row(ob, row_work, &doc->data);
+
+	popbuf(doc, BUFFER_SPAN);
+}
+
+static size_t parse_table_header(hoedown_buffer* ob, hoedown_document* doc,
+								 uint8_t* data, size_t size, size_t* columns,
+								 hoedown_table_flags** column_data)
+{
+	int pipes;
+	size_t i = 0, col, header_end, under_end;
+
+	pipes = 0;
+	while (i < size && data[i] != '\n')
+		if (data[i++] == '|')
+			pipes++;
+
+	if (i == size || pipes == 0)
+		return 0;
+
+	header_end = i;
+
+	while (header_end > 0 && _isspace(data[header_end - 1]))
+		header_end--;
+
+	if (data[0] == '|')
+		pipes--;
+
+	if (header_end && data[header_end - 1] == '|')
+		pipes--;
+
+	if (pipes < 0)
+		return 0;
+
+	*columns = pipes + 1;
+	*column_data = hoedown_calloc(*columns, sizeof(hoedown_table_flags));
+
+	/* Parse the header underline */
+	i++;
+	if (i < size && data[i] == '|')
+		i++;
+
+	under_end = i;
+	while (under_end < size && data[under_end] != '\n')
+		under_end++;
+
+	for (col = 0; col < *columns && i < under_end; ++col) {
+		size_t dashes = 0;
+
+		while (i < under_end && data[i] == ' ')
+			i++;
+
+		if (data[i] == ':') {
+			i++;
+			(*column_data)[col] |= HOEDOWN_TABLE_ALIGN_LEFT;
+			dashes++;
+		}
+
+		while (i < under_end && data[i] == '-') {
+			i++;
+			dashes++;
+		}
+
+		if (i < under_end && data[i] == ':') {
+			i++;
+			(*column_data)[col] |= HOEDOWN_TABLE_ALIGN_RIGHT;
+			dashes++;
+		}
+
+		while (i < under_end && data[i] == ' ')
+			i++;
+
+		if (i < under_end && data[i] != '|' && data[i] != '+')
+			break;
+
+		if (dashes < 3)
+			break;
+
+		i++;
+	}
+
+	if (col < *columns)
+		return 0;
+
+	parse_table_row(ob, doc, data, header_end, *columns, *column_data,
+					HOEDOWN_TABLE_HEADER);
+
+	return under_end + 1;
+}
+
+static size_t parse_table(hoedown_buffer* ob, hoedown_document* doc,
+						  uint8_t* data, size_t size)
+{
+	size_t i;
+
+	hoedown_buffer* work = 0;
+	hoedown_buffer* header_work = 0;
+	hoedown_buffer* body_work = 0;
+
+	size_t columns;
+	hoedown_table_flags* col_data = NULL;
+
+	work = newbuf(doc, BUFFER_BLOCK);
+	header_work = newbuf(doc, BUFFER_SPAN);
+	body_work = newbuf(doc, BUFFER_BLOCK);
+
+	i = parse_table_header(header_work, doc, data, size, &columns, &col_data);
+	if (i > 0) {
+
+		while (i < size) {
+			size_t row_start;
+			int pipes = 0;
+
+			row_start = i;
+
+			while (i < size && data[i] != '\n')
+				if (data[i++] == '|')
+					pipes++;
+
+			if (pipes == 0 || i == size) {
+				i = row_start;
+				break;
+			}
+
+			parse_table_row(body_work, doc, data + row_start, i - row_start,
+							columns, col_data, 0);
+
+			i++;
+		}
+
+		if (doc->md.table_header)
+			doc->md.table_header(work, header_work, &doc->data);
+
+		if (doc->md.table_body)
+			doc->md.table_body(work, body_work, &doc->data);
+
+		if (doc->md.table)
+			doc->md.table(ob, work, &doc->data);
+	}
+
+	free(col_data);
+	popbuf(doc, BUFFER_SPAN);
+	popbuf(doc, BUFFER_BLOCK);
+	popbuf(doc, BUFFER_BLOCK);
+	return i;
+}
+
+/* parse_block • parsing of one block, returning next uint8_t to parse */
+static void parse_block(hoedown_buffer* ob, hoedown_document* doc,
+						uint8_t* data, size_t size)
+{
+	size_t beg, end, i;
+	uint8_t* txt_data;
+	beg = 0;
+
+	if (doc->work_bufs[BUFFER_SPAN].size + doc->work_bufs[BUFFER_BLOCK].size >
+		doc->max_nesting)
+		return;
+
+	while (beg < size) {
+		txt_data = data + beg;
+		end = size - beg;
+
+		if (is_atxheader(doc, txt_data, end))
+			beg += parse_atxheader(ob, doc, txt_data, end);
+
+		else if (data[beg] == '<' && doc->md.blockhtml &&
+				 (i = parse_htmlblock(ob, doc, txt_data, end, 1)) != 0)
+			beg += i;
+
+		else if ((i = is_empty(txt_data, end)) != 0)
+			beg += i;
+
+		else if (is_hrule(txt_data, end)) {
+			if (doc->md.hrule)
+				doc->md.hrule(ob, &doc->data);
+
+			while (beg < size && data[beg] != '\n')
+				beg++;
+
+			beg++;
+		}
+
+		else if ((doc->ext_flags & HOEDOWN_EXT_FENCED_CODE) != 0 &&
+				 (i = parse_fencedcode(ob, doc, txt_data, end)) != 0)
+			beg += i;
+
+		else if ((doc->ext_flags & HOEDOWN_EXT_TABLES) != 0 &&
+				 (i = parse_table(ob, doc, txt_data, end)) != 0)
+			beg += i;
+
+		else if (prefix_quote(txt_data, end))
+			beg += parse_blockquote(ob, doc, txt_data, end);
+
+		else if (!(doc->ext_flags & HOEDOWN_EXT_DISABLE_INDENTED_CODE) &&
+				 prefix_code(txt_data, end))
+			beg += parse_blockcode(ob, doc, txt_data, end);
+
+		else if (prefix_uli(txt_data, end))
+			beg += parse_list(ob, doc, txt_data, end, 0);
+
+		else if (prefix_oli(txt_data, end))
+			beg += parse_list(ob, doc, txt_data, end, HOEDOWN_LIST_ORDERED);
+
+		else
+			beg += parse_paragraph(ob, doc, txt_data, end);
+	}
+}
+
+/*********************
+ * REFERENCE PARSING *
+ *********************/
+
+/* is_footnote • returns whether a line is a footnote definition or not */
+static int is_footnote(const uint8_t* data, size_t beg, size_t end,
+					   size_t* last, struct footnote_list* list)
+{
+	size_t i = 0;
+	hoedown_buffer* contents = 0;
+	size_t ind = 0;
+	int in_empty = 0;
+	size_t start = 0;
+
+	size_t id_offset, id_end;
+
+	/* up to 3 optional leading spaces */
+	if (beg + 3 >= end)
+		return 0;
+	if (data[beg] == ' ') {
+		i = 1;
+		if (data[beg + 1] == ' ') {
+			i = 2;
+			if (data[beg + 2] == ' ') {
+				i = 3;
+				if (data[beg + 3] == ' ')
+					return 0;
+			}
+		}
+	}
+	i += beg;
+
+	/* id part: caret followed by anything between brackets */
+	if (data[i] != '[')
+		return 0;
+	i++;
+	if (i >= end || data[i] != '^')
+		return 0;
+	i++;
+	id_offset = i;
+	while (i < end && data[i] != '\n' && data[i] != '\r' && data[i] != ']')
+		i++;
+	if (i >= end || data[i] != ']')
+		return 0;
+	id_end = i;
+
+	/* spacer: colon (space | tab)* newline? (space | tab)* */
+	i++;
+	if (i >= end || data[i] != ':')
+		return 0;
+	i++;
+
+	/* getting content buffer */
+	contents = hoedown_buffer_new(64);
+
+	start = i;
+
+	/* process lines similar to a list item */
+	while (i < end) {
+		while (i < end && data[i] != '\n' && data[i] != '\r')
+			i++;
+
+		/* process an empty line */
+		if (is_empty(data + start, i - start)) {
+			in_empty = 1;
+			if (i < end && (data[i] == '\n' || data[i] == '\r')) {
+				i++;
+				if (i < end && data[i] == '\n' && data[i - 1] == '\r')
+					i++;
+			}
+			start = i;
+			continue;
+		}
+
+		/* calculating the indentation */
+		ind = 0;
+		while (ind < 4 && start + ind < end && data[start + ind] == ' ')
+			ind++;
+
+		/* joining only indented stuff after empty lines;
+		 * note that now we only require 1 space of indentation
+		 * to continue, just like lists */
+		if (ind == 0) {
+			if (start == id_end + 2 && data[start] == '\t') {
+			} else
+				break;
+		} else if (in_empty) {
+			hoedown_buffer_putc(contents, '\n');
+		}
+
+		in_empty = 0;
+
+		/* adding the line into the content buffer */
+		hoedown_buffer_put(contents, data + start + ind, i - start - ind);
+		/* add carriage return */
+		if (i < end) {
+			hoedown_buffer_putc(contents, '\n');
+			if (i < end && (data[i] == '\n' || data[i] == '\r')) {
+				i++;
+				if (i < end && data[i] == '\n' && data[i - 1] == '\r')
+					i++;
+			}
+		}
+		start = i;
+	}
+
+	if (last)
+		*last = start;
+
+	if (list) {
+		struct footnote_ref* ref;
+		ref = create_footnote_ref(list, data + id_offset, id_end - id_offset);
+		if (!ref)
+			return 0;
+		if (!add_footnote_ref(list, ref)) {
+			free_footnote_ref(ref);
+			return 0;
+		}
+		ref->contents = contents;
+	}
+
+	return 1;
+}
+
+/* is_ref • returns whether a line is a reference or not */
+static int is_ref(const uint8_t* data, size_t beg, size_t end, size_t* last,
+				  struct link_ref** refs)
+{
+	/*    int n; */
+	size_t i = 0;
+	size_t id_offset, id_end;
+	size_t link_offset, link_end;
+	size_t title_offset, title_end;
+	size_t line_end;
+
+	/* up to 3 optional leading spaces */
+	if (beg + 3 >= end)
+		return 0;
+	if (data[beg] == ' ') {
+		i = 1;
+		if (data[beg + 1] == ' ') {
+			i = 2;
+			if (data[beg + 2] == ' ') {
+				i = 3;
+				if (data[beg + 3] == ' ')
+					return 0;
+			}
+		}
+	}
+	i += beg;
+
+	/* id part: anything but a newline between brackets */
+	if (data[i] != '[')
+		return 0;
+	i++;
+	id_offset = i;
+	while (i < end && data[i] != '\n' && data[i] != '\r' && data[i] != ']')
+		i++;
+	if (i >= end || data[i] != ']')
+		return 0;
+	id_end = i;
+
+	/* spacer: colon (space | tab)* newline? (space | tab)* */
+	i++;
+	if (i >= end || data[i] != ':')
+		return 0;
+	i++;
+	while (i < end && data[i] == ' ')
+		i++;
+	if (i < end && (data[i] == '\n' || data[i] == '\r')) {
+		i++;
+		if (i < end && data[i] == '\r' && data[i - 1] == '\n')
+			i++;
+	}
+	while (i < end && data[i] == ' ')
+		i++;
+	if (i >= end)
+		return 0;
+
+	/* link: spacing-free sequence, optionally between angle brackets */
+	if (data[i] == '<')
+		i++;
+
+	link_offset = i;
+
+	while (i < end && data[i] != ' ' && data[i] != '\n' && data[i] != '\r')
+		i++;
+
+	if (data[i - 1] == '>')
+		link_end = i - 1;
+	else
+		link_end = i;
+
+	/* optional spacer: (space | tab)* (newline | '\'' | '"' | '(' ) */
+	while (i < end && data[i] == ' ')
+		i++;
+	if (i < end && data[i] != '\n' && data[i] != '\r' && data[i] != '\'' &&
+		data[i] != '"' && data[i] != '(')
+		return 0;
+	line_end = 0;
+	/* computing end-of-line */
+	if (i >= end || data[i] == '\r' || data[i] == '\n')
+		line_end = i;
+	if (i + 1 < end && data[i] == '\n' && data[i + 1] == '\r')
+		line_end = i + 1;
+
+	/* optional (space|tab)* spacer after a newline */
+	if (line_end) {
+		i = line_end + 1;
+		while (i < end && data[i] == ' ')
+			i++;
+	}
+
+	/* optional title: any non-newline sequence enclosed in '"()
+					alone on its line */
+	title_offset = title_end = 0;
+	if (i + 1 < end && (data[i] == '\'' || data[i] == '"' || data[i] == '(')) {
+		i++;
+		title_offset = i;
+		/* looking for EOL */
+		while (i < end && data[i] != '\n' && data[i] != '\r')
+			i++;
+		if (i + 1 < end && data[i] == '\n' && data[i + 1] == '\r')
+			title_end = i + 1;
+		else
+			title_end = i;
+		/* stepping back */
+		i -= 1;
+		while (i > title_offset && data[i] == ' ')
+			i -= 1;
+		if (i > title_offset &&
+			(data[i] == '\'' || data[i] == '"' || data[i] == ')')) {
+			line_end = title_end;
+			title_end = i;
+		}
+	}
+
+	if (!line_end || link_end == link_offset)
+		return 0; /* garbage after the link empty link */
+
+	/* a valid ref has been found, filling-in return structures */
+	if (last)
+		*last = line_end;
+
+	if (refs) {
+		struct link_ref* ref;
+
+		ref = add_link_ref(refs, data + id_offset, id_end - id_offset);
+		if (!ref)
+			return 0;
+
+		ref->link = hoedown_buffer_new(link_end - link_offset);
+		hoedown_buffer_put(ref->link, data + link_offset,
+						   link_end - link_offset);
+
+		if (title_end > title_offset) {
+			ref->title = hoedown_buffer_new(title_end - title_offset);
+			hoedown_buffer_put(ref->title, data + title_offset,
+							   title_end - title_offset);
+		}
+	}
+
+	return 1;
+}
+
+static void expand_tabs(hoedown_buffer* ob, const uint8_t* line, size_t size)
+{
+	/* This code makes two assumptions:
+	 * - Input is valid UTF-8.  (Any byte with top two bits 10 is skipped,
+	 *   whether or not it is a valid UTF-8 continuation byte.)
+	 * - Input contains no combining characters.  (Combining characters
+	 *   should be skipped but are not.)
+	 */
+	size_t i = 0, tab = 0;
+
+	while (i < size) {
+		size_t org = i;
+
+		while (i < size && line[i] != '\t') {
+			/* ignore UTF-8 continuation bytes */
+			if ((line[i] & 0xc0) != 0x80)
+				tab++;
+			i++;
+		}
+
+		if (i > org)
+			hoedown_buffer_put(ob, line + org, i - org);
+
+		if (i >= size)
+			break;
+
+		do {
+			hoedown_buffer_putc(ob, ' ');
+			tab++;
+		} while (tab % 4);
+
+		i++;
+	}
+}
+
+/**********************
+ * EXPORTED FUNCTIONS *
+ **********************/
+
+hoedown_document* hoedown_document_new(const hoedown_renderer* renderer,
+									   hoedown_extensions extensions,
+									   size_t max_nesting)
+{
+	hoedown_document* doc = NULL;
+
+	assert(max_nesting > 0 && renderer);
+
+	doc = hoedown_malloc(sizeof(hoedown_document));
+	memcpy(&doc->md, renderer, sizeof(hoedown_renderer));
+
+	doc->data.opaque = renderer->opaque;
+
+	hoedown_stack_init(&doc->work_bufs[BUFFER_BLOCK], 4);
+	hoedown_stack_init(&doc->work_bufs[BUFFER_SPAN], 8);
+
+	memset(doc->active_char, 0x0, 256);
+
+	if (extensions & HOEDOWN_EXT_UNDERLINE && doc->md.underline) {
+		doc->active_char['_'] = MD_CHAR_EMPHASIS;
+	}
+
+	if (doc->md.emphasis || doc->md.double_emphasis ||
+		doc->md.triple_emphasis) {
+		doc->active_char['*'] = MD_CHAR_EMPHASIS;
+		doc->active_char['_'] = MD_CHAR_EMPHASIS;
+		if (extensions & HOEDOWN_EXT_STRIKETHROUGH)
+			doc->active_char['~'] = MD_CHAR_EMPHASIS;
+		if (extensions & HOEDOWN_EXT_HIGHLIGHT)
+			doc->active_char['='] = MD_CHAR_EMPHASIS;
+	}
+
+	if (doc->md.codespan)
+		doc->active_char['`'] = MD_CHAR_CODESPAN;
+
+	if (doc->md.linebreak)
+		doc->active_char['\n'] = MD_CHAR_LINEBREAK;
+
+	if (doc->md.image || doc->md.link || doc->md.footnotes ||
+		doc->md.footnote_ref)
+		doc->active_char['['] = MD_CHAR_LINK;
+
+	doc->active_char['<'] = MD_CHAR_LANGLE;
+	doc->active_char['\\'] = MD_CHAR_ESCAPE;
+	doc->active_char['&'] = MD_CHAR_ENTITY;
+
+	if (extensions & HOEDOWN_EXT_AUTOLINK) {
+		doc->active_char[':'] = MD_CHAR_AUTOLINK_URL;
+		doc->active_char['@'] = MD_CHAR_AUTOLINK_EMAIL;
+		doc->active_char['w'] = MD_CHAR_AUTOLINK_WWW;
+	}
+
+	if (extensions & HOEDOWN_EXT_SUPERSCRIPT)
+		doc->active_char['^'] = MD_CHAR_SUPERSCRIPT;
+
+	if (extensions & HOEDOWN_EXT_QUOTE)
+		doc->active_char['"'] = MD_CHAR_QUOTE;
+
+	if (extensions & HOEDOWN_EXT_MATH)
+		doc->active_char['$'] = MD_CHAR_MATH;
+
+	/* Extension data */
+	doc->ext_flags = extensions;
+	doc->max_nesting = max_nesting;
+	doc->in_link_body = 0;
+
+	return doc;
+}
+
+void hoedown_document_render(hoedown_document* doc, hoedown_buffer* ob,
+							 const uint8_t* data, size_t size)
+{
+	static const uint8_t UTF8_BOM[] = {0xEF, 0xBB, 0xBF};
+
+	hoedown_buffer* text;
+	size_t beg, end;
+
+	int footnotes_enabled;
+
+	text = hoedown_buffer_new(64);
+
+	/* Preallocate enough space for our buffer to avoid expanding while copying
+	 */
+	hoedown_buffer_grow(text, size);
+
+	/* reset the references table */
+	memset(&doc->refs, 0x0, REF_TABLE_SIZE * sizeof(void*));
+
+	footnotes_enabled = doc->ext_flags & HOEDOWN_EXT_FOOTNOTES;
+
+	/* reset the footnotes lists */
+	if (footnotes_enabled) {
+		memset(&doc->footnotes_found, 0x0, sizeof(doc->footnotes_found));
+		memset(&doc->footnotes_used, 0x0, sizeof(doc->footnotes_used));
+	}
+
+	/* first pass: looking for references, copying everything else */
+	beg = 0;
+
+	/* Skip a possible UTF-8 BOM, even though the Unicode standard
+	 * discourages having these in UTF-8 documents */
+	if (size >= 3 && memcmp(data, UTF8_BOM, 3) == 0)
+		beg += 3;
+
+	while (beg < size) /* iterating over lines */
+		if (footnotes_enabled &&
+			is_footnote(data, beg, size, &end, &doc->footnotes_found))
+			beg = end;
+		else if (is_ref(data, beg, size, &end, doc->refs))
+			beg = end;
+		else { /* skipping to the next line */
+			end = beg;
+			while (end < size && data[end] != '\n' && data[end] != '\r')
+				end++;
+
+			/* adding the line body if present */
+			if (end > beg)
+				expand_tabs(text, data + beg, end - beg);
+
+			while (end < size && (data[end] == '\n' || data[end] == '\r')) {
+				/* add one \n per newline */
+				if (data[end] == '\n' ||
+					(end + 1 < size && data[end + 1] != '\n'))
+					hoedown_buffer_putc(text, '\n');
+				end++;
+			}
+
+			beg = end;
+		}
+
+	/* pre-grow the output buffer to minimize allocations */
+	hoedown_buffer_grow(ob, text->size + (text->size >> 1));
+
+	/* second pass: actual rendering */
+	if (doc->md.doc_header)
+		doc->md.doc_header(ob, 0, &doc->data);
+
+	if (text->size) {
+		/* adding a final newline if not already present */
+		if (text->data[text->size - 1] != '\n' &&
+			text->data[text->size - 1] != '\r')
+			hoedown_buffer_putc(text, '\n');
+
+		parse_block(ob, doc, text->data, text->size);
+	}
+
+	/* footnotes */
+	if (footnotes_enabled)
+		parse_footnote_list(ob, doc, &doc->footnotes_used);
+
+	if (doc->md.doc_footer)
+		doc->md.doc_footer(ob, 0, &doc->data);
+
+	/* clean-up */
+	hoedown_buffer_free(text);
+	free_link_refs(doc->refs);
+	if (footnotes_enabled) {
+		free_footnote_list(&doc->footnotes_found, 1);
+		free_footnote_list(&doc->footnotes_used, 0);
+	}
+
+	assert(doc->work_bufs[BUFFER_SPAN].size == 0);
+	assert(doc->work_bufs[BUFFER_BLOCK].size == 0);
+}
+
+void hoedown_document_render_inline(hoedown_document* doc, hoedown_buffer* ob,
+									const uint8_t* data, size_t size)
+{
+	size_t i = 0, mark;
+	hoedown_buffer* text = hoedown_buffer_new(64);
+
+	/* reset the references table */
+	memset(&doc->refs, 0x0, REF_TABLE_SIZE * sizeof(void*));
+
+	/* first pass: expand tabs and process newlines */
+	hoedown_buffer_grow(text, size);
+	while (1) {
+		mark = i;
+		while (i < size && data[i] != '\n' && data[i] != '\r')
+			i++;
+
+		expand_tabs(text, data + mark, i - mark);
+
+		if (i >= size)
+			break;
+
+		while (i < size && (data[i] == '\n' || data[i] == '\r')) {
+			/* add one \n per newline */
+			if (data[i] == '\n' || (i + 1 < size && data[i + 1] != '\n'))
+				hoedown_buffer_putc(text, '\n');
+			i++;
+		}
+	}
+
+	/* second pass: actual rendering */
+	hoedown_buffer_grow(ob, text->size + (text->size >> 1));
+
+	if (doc->md.doc_header)
+		doc->md.doc_header(ob, 1, &doc->data);
+
+	parse_inline(ob, doc, text->data, text->size);
+
+	if (doc->md.doc_footer)
+		doc->md.doc_footer(ob, 1, &doc->data);
+
+	/* clean-up */
+	hoedown_buffer_free(text);
+
+	assert(doc->work_bufs[BUFFER_SPAN].size == 0);
+	assert(doc->work_bufs[BUFFER_BLOCK].size == 0);
+}
+
+void hoedown_document_free(hoedown_document* doc)
+{
+	size_t i;
+
+	for (i = 0; i < (size_t)doc->work_bufs[BUFFER_SPAN].asize; ++i)
+		hoedown_buffer_free(doc->work_bufs[BUFFER_SPAN].item[i]);
+
+	for (i = 0; i < (size_t)doc->work_bufs[BUFFER_BLOCK].asize; ++i)
+		hoedown_buffer_free(doc->work_bufs[BUFFER_BLOCK].item[i]);
+
+	hoedown_stack_uninit(&doc->work_bufs[BUFFER_SPAN]);
+	hoedown_stack_uninit(&doc->work_bufs[BUFFER_BLOCK]);
+
+	free(doc);
+}
diff --git a/meshmc/libraries/hoedown/src/escape.c b/meshmc/libraries/hoedown/src/escape.c
new file mode 100644
index 0000000000..14a3dfa153
--- /dev/null
+++ b/meshmc/libraries/hoedown/src/escape.c
@@ -0,0 +1,191 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+#include "hoedown/escape.h"
+
+#include <assert.h>
+#include <stdio.h>
+#include <string.h>
+
+#define likely(x) __builtin_expect((x), 1)
+#define unlikely(x) __builtin_expect((x), 0)
+
+/*
+ * The following characters will not be escaped:
+ *
+ *        -_.+!*'(),%#@?=;:/,+&$ alphanum
+ *
+ * Note that this character set is the addition of:
+ *
+ *    - The characters which are safe to be in an URL
+ *    - The characters which are *not* safe to be in
+ *    an URL because they are RESERVED characters.
+ *
+ * We assume (lazily) that any RESERVED char that
+ * appears inside an URL is actually meant to
+ * have its native function (i.e. as an URL
+ * component/separator) and hence needs no escaping.
+ *
+ * There are two exceptions: the chacters & (amp)
+ * and ' (single quote) do not appear in the table.
+ * They are meant to appear in the URL as components,
+ * yet they require special HTML-entity escaping
+ * to generate valid HTML markup.
+ *
+ * All other characters will be escaped to %XX.
+ *
+ */
+static const uint8_t HREF_SAFE[UINT8_MAX + 1] = {
+	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, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1,
+	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 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, 0, 0, 0, 1,
+	0, 1, 1, 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, 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, 0, 0, 0, 0,
+};
+
+void hoedown_escape_href(hoedown_buffer* ob, const uint8_t* data, size_t size)
+{
+	static const char hex_chars[] = "0123456789ABCDEF";
+	size_t i = 0, mark;
+	char hex_str[3];
+
+	hex_str[0] = '%';
+
+	while (i < size) {
+		mark = i;
+		while (i < size && HREF_SAFE[data[i]])
+			i++;
+
+		/* Optimization for cases where there's nothing to escape */
+		if (mark == 0 && i >= size) {
+			hoedown_buffer_put(ob, data, size);
+			return;
+		}
+
+		if (likely(i > mark)) {
+			hoedown_buffer_put(ob, data + mark, i - mark);
+		}
+
+		/* escaping */
+		if (i >= size)
+			break;
+
+		switch (data[i]) {
+			/* amp appears all the time in URLs, but needs
+			 * HTML-entity escaping to be inside an href */
+			case '&':
+				HOEDOWN_BUFPUTSL(ob, "&amp;");
+				break;
+
+			/* the single quote is a valid URL character
+			 * according to the standard; it needs HTML
+			 * entity escaping too */
+			case '\'':
+				HOEDOWN_BUFPUTSL(ob, "&#x27;");
+				break;
+
+				/* the space can be escaped to %20 or a plus
+				 * sign. we're going with the generic escape
+				 * for now. the plus thing is more commonly seen
+				 * when building GET strings */
+#if 0
+        case ' ':
+            hoedown_buffer_putc(ob, '+');
+            break;
+#endif
+
+			/* every other character goes with a %XX escaping */
+			default:
+				hex_str[1] = hex_chars[(data[i] >> 4) & 0xF];
+				hex_str[2] = hex_chars[data[i] & 0xF];
+				hoedown_buffer_put(ob, (uint8_t*)hex_str, 3);
+		}
+
+		i++;
+	}
+}
+
+/**
+ * According to the OWASP rules:
+ *
+ * & --> &amp;
+ * < --> &lt;
+ * > --> &gt;
+ * " --> &quot;
+ * ' --> &#x27;     &apos; is not recommended
+ * / --> &#x2F;     forward slash is included as it helps end an HTML entity
+ *
+ */
+static const uint8_t HTML_ESCAPE_TABLE[UINT8_MAX + 1] = {
+	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, 0, 0, 0, 2, 3, 0, 0, 0, 0, 0, 0, 0, 4,
+	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 6, 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, 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,
+};
+
+static const char* HTML_ESCAPES[] = {"",	  "&quot;", "&amp;", "&#39;",
+									 "&#47;", "&lt;",	"&gt;"};
+
+void hoedown_escape_html(hoedown_buffer* ob, const uint8_t* data, size_t size,
+						 int secure)
+{
+	size_t i = 0, mark;
+
+	while (1) {
+		mark = i;
+		while (i < size && HTML_ESCAPE_TABLE[data[i]] == 0)
+			i++;
+
+		/* Optimization for cases where there's nothing to escape */
+		if (mark == 0 && i >= size) {
+			hoedown_buffer_put(ob, data, size);
+			return;
+		}
+
+		if (likely(i > mark))
+			hoedown_buffer_put(ob, data + mark, i - mark);
+
+		if (i >= size)
+			break;
+
+		/* The forward slash is only escaped in secure mode */
+		if (!secure && data[i] == '/') {
+			hoedown_buffer_putc(ob, '/');
+		} else {
+			hoedown_buffer_puts(ob, HTML_ESCAPES[HTML_ESCAPE_TABLE[data[i]]]);
+		}
+
+		i++;
+	}
+}
diff --git a/meshmc/libraries/hoedown/src/html.c b/meshmc/libraries/hoedown/src/html.c
new file mode 100644
index 0000000000..2778e7633c
--- /dev/null
+++ b/meshmc/libraries/hoedown/src/html.c
@@ -0,0 +1,823 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+#include "hoedown/html.h"
+
+#include <string.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <ctype.h>
+
+#include "hoedown/escape.h"
+
+#define USE_XHTML(opt) (opt->flags & HOEDOWN_HTML_USE_XHTML)
+
+hoedown_html_tag hoedown_html_is_tag(const uint8_t* data, size_t size,
+									 const char* tagname)
+{
+	size_t i;
+	int closed = 0;
+
+	if (size < 3 || data[0] != '<')
+		return HOEDOWN_HTML_TAG_NONE;
+
+	i = 1;
+
+	if (data[i] == '/') {
+		closed = 1;
+		i++;
+	}
+
+	for (; i < size; ++i, ++tagname) {
+		if (*tagname == 0)
+			break;
+
+		if (data[i] != *tagname)
+			return HOEDOWN_HTML_TAG_NONE;
+	}
+
+	if (i == size)
+		return HOEDOWN_HTML_TAG_NONE;
+
+	if (isspace(data[i]) || data[i] == '>')
+		return closed ? HOEDOWN_HTML_TAG_CLOSE : HOEDOWN_HTML_TAG_OPEN;
+
+	return HOEDOWN_HTML_TAG_NONE;
+}
+
+static void escape_html(hoedown_buffer* ob, const uint8_t* source,
+						size_t length)
+{
+	hoedown_escape_html(ob, source, length, 0);
+}
+
+static void escape_href(hoedown_buffer* ob, const uint8_t* source,
+						size_t length)
+{
+	hoedown_escape_href(ob, source, length);
+}
+
+/********************
+ * GENERIC RENDERER *
+ ********************/
+static int rndr_autolink(hoedown_buffer* ob, const hoedown_buffer* link,
+						 hoedown_autolink_type type,
+						 const hoedown_renderer_data* data)
+{
+	hoedown_html_renderer_state* state = data->opaque;
+
+	if (!link || !link->size)
+		return 0;
+
+	HOEDOWN_BUFPUTSL(ob, "<a href=\"");
+	if (type == HOEDOWN_AUTOLINK_EMAIL)
+		HOEDOWN_BUFPUTSL(ob, "mailto:");
+	escape_href(ob, link->data, link->size);
+
+	if (state->link_attributes) {
+		hoedown_buffer_putc(ob, '\"');
+		state->link_attributes(ob, link, data);
+		hoedown_buffer_putc(ob, '>');
+	} else {
+		HOEDOWN_BUFPUTSL(ob, "\">");
+	}
+
+	/*
+	 * Pretty printing: if we get an email address as
+	 * an actual URI, e.g. `mailto:foo@bar.com`, we don't
+	 * want to print the `mailto:` prefix
+	 */
+	if (hoedown_buffer_prefix(link, "mailto:") == 0) {
+		escape_html(ob, link->data + 7, link->size - 7);
+	} else {
+		escape_html(ob, link->data, link->size);
+	}
+
+	HOEDOWN_BUFPUTSL(ob, "</a>");
+
+	return 1;
+}
+
+static void rndr_blockcode(hoedown_buffer* ob, const hoedown_buffer* text,
+						   const hoedown_buffer* lang,
+						   const hoedown_renderer_data* data)
+{
+	if (ob->size)
+		hoedown_buffer_putc(ob, '\n');
+
+	if (lang) {
+		HOEDOWN_BUFPUTSL(ob, "<pre><code class=\"language-");
+		escape_html(ob, lang->data, lang->size);
+		HOEDOWN_BUFPUTSL(ob, "\">");
+	} else {
+		HOEDOWN_BUFPUTSL(ob, "<pre><code>");
+	}
+
+	if (text)
+		escape_html(ob, text->data, text->size);
+
+	HOEDOWN_BUFPUTSL(ob, "</code></pre>\n");
+}
+
+static void rndr_blockquote(hoedown_buffer* ob, const hoedown_buffer* content,
+							const hoedown_renderer_data* data)
+{
+	if (ob->size)
+		hoedown_buffer_putc(ob, '\n');
+	HOEDOWN_BUFPUTSL(ob, "<blockquote>\n");
+	if (content)
+		hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</blockquote>\n");
+}
+
+static int rndr_codespan(hoedown_buffer* ob, const hoedown_buffer* text,
+						 const hoedown_renderer_data* data)
+{
+	HOEDOWN_BUFPUTSL(ob, "<code>");
+	if (text)
+		escape_html(ob, text->data, text->size);
+	HOEDOWN_BUFPUTSL(ob, "</code>");
+	return 1;
+}
+
+static int rndr_strikethrough(hoedown_buffer* ob, const hoedown_buffer* content,
+							  const hoedown_renderer_data* data)
+{
+	if (!content || !content->size)
+		return 0;
+
+	HOEDOWN_BUFPUTSL(ob, "<del>");
+	hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</del>");
+	return 1;
+}
+
+static int rndr_double_emphasis(hoedown_buffer* ob,
+								const hoedown_buffer* content,
+								const hoedown_renderer_data* data)
+{
+	if (!content || !content->size)
+		return 0;
+
+	HOEDOWN_BUFPUTSL(ob, "<strong>");
+	hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</strong>");
+
+	return 1;
+}
+
+static int rndr_emphasis(hoedown_buffer* ob, const hoedown_buffer* content,
+						 const hoedown_renderer_data* data)
+{
+	if (!content || !content->size)
+		return 0;
+	HOEDOWN_BUFPUTSL(ob, "<em>");
+	if (content)
+		hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</em>");
+	return 1;
+}
+
+static int rndr_underline(hoedown_buffer* ob, const hoedown_buffer* content,
+						  const hoedown_renderer_data* data)
+{
+	if (!content || !content->size)
+		return 0;
+
+	HOEDOWN_BUFPUTSL(ob, "<u>");
+	hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</u>");
+
+	return 1;
+}
+
+static int rndr_highlight(hoedown_buffer* ob, const hoedown_buffer* content,
+						  const hoedown_renderer_data* data)
+{
+	if (!content || !content->size)
+		return 0;
+
+	HOEDOWN_BUFPUTSL(ob, "<mark>");
+	hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</mark>");
+
+	return 1;
+}
+
+static int rndr_quote(hoedown_buffer* ob, const hoedown_buffer* content,
+					  const hoedown_renderer_data* data)
+{
+	if (!content || !content->size)
+		return 0;
+
+	HOEDOWN_BUFPUTSL(ob, "<q>");
+	hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</q>");
+
+	return 1;
+}
+
+static int rndr_linebreak(hoedown_buffer* ob, const hoedown_renderer_data* data)
+{
+	hoedown_html_renderer_state* state = data->opaque;
+	hoedown_buffer_puts(ob, USE_XHTML(state) ? "<br/>\n" : "<br>\n");
+	return 1;
+}
+
+static void rndr_header(hoedown_buffer* ob, const hoedown_buffer* content,
+						int level, const hoedown_renderer_data* data)
+{
+	hoedown_html_renderer_state* state = data->opaque;
+
+	if (ob->size)
+		hoedown_buffer_putc(ob, '\n');
+
+	if (level <= state->toc_data.nesting_level)
+		hoedown_buffer_printf(ob, "<h%d id=\"toc_%d\">", level,
+							  state->toc_data.header_count++);
+	else
+		hoedown_buffer_printf(ob, "<h%d>", level);
+
+	if (content)
+		hoedown_buffer_put(ob, content->data, content->size);
+	hoedown_buffer_printf(ob, "</h%d>\n", level);
+}
+
+static int rndr_link(hoedown_buffer* ob, const hoedown_buffer* content,
+					 const hoedown_buffer* link, const hoedown_buffer* title,
+					 const hoedown_renderer_data* data)
+{
+	hoedown_html_renderer_state* state = data->opaque;
+
+	HOEDOWN_BUFPUTSL(ob, "<a href=\"");
+
+	if (link && link->size)
+		escape_href(ob, link->data, link->size);
+
+	if (title && title->size) {
+		HOEDOWN_BUFPUTSL(ob, "\" title=\"");
+		escape_html(ob, title->data, title->size);
+	}
+
+	if (state->link_attributes) {
+		hoedown_buffer_putc(ob, '\"');
+		state->link_attributes(ob, link, data);
+		hoedown_buffer_putc(ob, '>');
+	} else {
+		HOEDOWN_BUFPUTSL(ob, "\">");
+	}
+
+	if (content && content->size)
+		hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</a>");
+	return 1;
+}
+
+static void rndr_list(hoedown_buffer* ob, const hoedown_buffer* content,
+					  hoedown_list_flags flags,
+					  const hoedown_renderer_data* data)
+{
+	if (ob->size)
+		hoedown_buffer_putc(ob, '\n');
+	hoedown_buffer_put(
+		ob,
+		(const uint8_t*)(flags & HOEDOWN_LIST_ORDERED ? "<ol>\n" : "<ul>\n"),
+		5);
+	if (content)
+		hoedown_buffer_put(ob, content->data, content->size);
+	hoedown_buffer_put(
+		ob,
+		(const uint8_t*)(flags & HOEDOWN_LIST_ORDERED ? "</ol>\n" : "</ul>\n"),
+		6);
+}
+
+static void rndr_listitem(hoedown_buffer* ob, const hoedown_buffer* content,
+						  hoedown_list_flags flags,
+						  const hoedown_renderer_data* data)
+{
+	HOEDOWN_BUFPUTSL(ob, "<li>");
+	if (content) {
+		size_t size = content->size;
+		while (size && content->data[size - 1] == '\n')
+			size--;
+
+		hoedown_buffer_put(ob, content->data, size);
+	}
+	HOEDOWN_BUFPUTSL(ob, "</li>\n");
+}
+
+static void rndr_paragraph(hoedown_buffer* ob, const hoedown_buffer* content,
+						   const hoedown_renderer_data* data)
+{
+	hoedown_html_renderer_state* state = data->opaque;
+	size_t i = 0;
+
+	if (ob->size)
+		hoedown_buffer_putc(ob, '\n');
+
+	if (!content || !content->size)
+		return;
+
+	while (i < content->size && isspace(content->data[i]))
+		i++;
+
+	if (i == content->size)
+		return;
+
+	HOEDOWN_BUFPUTSL(ob, "<p>");
+	if (state->flags & HOEDOWN_HTML_HARD_WRAP) {
+		size_t org;
+		while (i < content->size) {
+			org = i;
+			while (i < content->size && content->data[i] != '\n')
+				i++;
+
+			if (i > org)
+				hoedown_buffer_put(ob, content->data + org, i - org);
+
+			/*
+			 * do not insert a line break if this newline
+			 * is the last character on the paragraph
+			 */
+			if (i >= content->size - 1)
+				break;
+
+			rndr_linebreak(ob, data);
+			i++;
+		}
+	} else {
+		hoedown_buffer_put(ob, content->data + i, content->size - i);
+	}
+	HOEDOWN_BUFPUTSL(ob, "</p>\n");
+}
+
+static void rndr_raw_block(hoedown_buffer* ob, const hoedown_buffer* text,
+						   const hoedown_renderer_data* data)
+{
+	size_t org, sz;
+
+	if (!text)
+		return;
+
+	/* FIXME: Do we *really* need to trim the HTML? How does that make a
+	 * difference? */
+	sz = text->size;
+	while (sz > 0 && text->data[sz - 1] == '\n')
+		sz--;
+
+	org = 0;
+	while (org < sz && text->data[org] == '\n')
+		org++;
+
+	if (org >= sz)
+		return;
+
+	if (ob->size)
+		hoedown_buffer_putc(ob, '\n');
+
+	hoedown_buffer_put(ob, text->data + org, sz - org);
+	hoedown_buffer_putc(ob, '\n');
+}
+
+static int rndr_triple_emphasis(hoedown_buffer* ob,
+								const hoedown_buffer* content,
+								const hoedown_renderer_data* data)
+{
+	if (!content || !content->size)
+		return 0;
+	HOEDOWN_BUFPUTSL(ob, "<strong><em>");
+	hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</em></strong>");
+	return 1;
+}
+
+static void rndr_hrule(hoedown_buffer* ob, const hoedown_renderer_data* data)
+{
+	hoedown_html_renderer_state* state = data->opaque;
+	if (ob->size)
+		hoedown_buffer_putc(ob, '\n');
+	hoedown_buffer_puts(ob, USE_XHTML(state) ? "<hr/>\n" : "<hr>\n");
+}
+
+static int rndr_image(hoedown_buffer* ob, const hoedown_buffer* link,
+					  const hoedown_buffer* title, const hoedown_buffer* alt,
+					  const hoedown_renderer_data* data)
+{
+	hoedown_html_renderer_state* state = data->opaque;
+	if (!link || !link->size)
+		return 0;
+
+	HOEDOWN_BUFPUTSL(ob, "<img src=\"");
+	escape_href(ob, link->data, link->size);
+	HOEDOWN_BUFPUTSL(ob, "\" alt=\"");
+
+	if (alt && alt->size)
+		escape_html(ob, alt->data, alt->size);
+
+	if (title && title->size) {
+		HOEDOWN_BUFPUTSL(ob, "\" title=\"");
+		escape_html(ob, title->data, title->size);
+	}
+
+	hoedown_buffer_puts(ob, USE_XHTML(state) ? "\"/>" : "\">");
+	return 1;
+}
+
+static int rndr_raw_html(hoedown_buffer* ob, const hoedown_buffer* text,
+						 const hoedown_renderer_data* data)
+{
+	hoedown_html_renderer_state* state = data->opaque;
+
+	/* ESCAPE overrides SKIP_HTML. It doesn't look to see if
+	 * there are any valid tags, just escapes all of them. */
+	if ((state->flags & HOEDOWN_HTML_ESCAPE) != 0) {
+		escape_html(ob, text->data, text->size);
+		return 1;
+	}
+
+	if ((state->flags & HOEDOWN_HTML_SKIP_HTML) != 0)
+		return 1;
+
+	hoedown_buffer_put(ob, text->data, text->size);
+	return 1;
+}
+
+static void rndr_table(hoedown_buffer* ob, const hoedown_buffer* content,
+					   const hoedown_renderer_data* data)
+{
+	if (ob->size)
+		hoedown_buffer_putc(ob, '\n');
+	HOEDOWN_BUFPUTSL(ob, "<table>\n");
+	hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</table>\n");
+}
+
+static void rndr_table_header(hoedown_buffer* ob, const hoedown_buffer* content,
+							  const hoedown_renderer_data* data)
+{
+	if (ob->size)
+		hoedown_buffer_putc(ob, '\n');
+	HOEDOWN_BUFPUTSL(ob, "<thead>\n");
+	hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</thead>\n");
+}
+
+static void rndr_table_body(hoedown_buffer* ob, const hoedown_buffer* content,
+							const hoedown_renderer_data* data)
+{
+	if (ob->size)
+		hoedown_buffer_putc(ob, '\n');
+	HOEDOWN_BUFPUTSL(ob, "<tbody>\n");
+	hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</tbody>\n");
+}
+
+static void rndr_tablerow(hoedown_buffer* ob, const hoedown_buffer* content,
+						  const hoedown_renderer_data* data)
+{
+	HOEDOWN_BUFPUTSL(ob, "<tr>\n");
+	if (content)
+		hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</tr>\n");
+}
+
+static void rndr_tablecell(hoedown_buffer* ob, const hoedown_buffer* content,
+						   hoedown_table_flags flags,
+						   const hoedown_renderer_data* data)
+{
+	if (flags & HOEDOWN_TABLE_HEADER) {
+		HOEDOWN_BUFPUTSL(ob, "<th");
+	} else {
+		HOEDOWN_BUFPUTSL(ob, "<td");
+	}
+
+	switch (flags & HOEDOWN_TABLE_ALIGNMASK) {
+		case HOEDOWN_TABLE_ALIGN_CENTER:
+			HOEDOWN_BUFPUTSL(ob, " style=\"text-align: center\">");
+			break;
+
+		case HOEDOWN_TABLE_ALIGN_LEFT:
+			HOEDOWN_BUFPUTSL(ob, " style=\"text-align: left\">");
+			break;
+
+		case HOEDOWN_TABLE_ALIGN_RIGHT:
+			HOEDOWN_BUFPUTSL(ob, " style=\"text-align: right\">");
+			break;
+
+		default:
+			HOEDOWN_BUFPUTSL(ob, ">");
+	}
+
+	if (content)
+		hoedown_buffer_put(ob, content->data, content->size);
+
+	if (flags & HOEDOWN_TABLE_HEADER) {
+		HOEDOWN_BUFPUTSL(ob, "</th>\n");
+	} else {
+		HOEDOWN_BUFPUTSL(ob, "</td>\n");
+	}
+}
+
+static int rndr_superscript(hoedown_buffer* ob, const hoedown_buffer* content,
+							const hoedown_renderer_data* data)
+{
+	if (!content || !content->size)
+		return 0;
+	HOEDOWN_BUFPUTSL(ob, "<sup>");
+	hoedown_buffer_put(ob, content->data, content->size);
+	HOEDOWN_BUFPUTSL(ob, "</sup>");
+	return 1;
+}
+
+static void rndr_normal_text(hoedown_buffer* ob, const hoedown_buffer* content,
+							 const hoedown_renderer_data* data)
+{
+	if (content)
+		escape_html(ob, content->data, content->size);
+}
+
+static void rndr_footnotes(hoedown_buffer* ob, const hoedown_buffer* content,
+						   const hoedown_renderer_data* data)
+{
+	hoedown_html_renderer_state* state = data->opaque;
+
+	if (ob->size)
+		hoedown_buffer_putc(ob, '\n');
+	HOEDOWN_BUFPUTSL(ob, "<div class=\"footnotes\">\n");
+	hoedown_buffer_puts(ob, USE_XHTML(state) ? "<hr/>\n" : "<hr>\n");
+	HOEDOWN_BUFPUTSL(ob, "<ol>\n");
+
+	if (content)
+		hoedown_buffer_put(ob, content->data, content->size);
+
+	HOEDOWN_BUFPUTSL(ob, "\n</ol>\n</div>\n");
+}
+
+static void rndr_footnote_def(hoedown_buffer* ob, const hoedown_buffer* content,
+							  unsigned int num,
+							  const hoedown_renderer_data* data)
+{
+	size_t i = 0;
+	int pfound = 0;
+
+	/* insert anchor at the end of first paragraph block */
+	if (content) {
+		while ((i + 3) < content->size) {
+			if (content->data[i++] != '<')
+				continue;
+			if (content->data[i++] != '/')
+				continue;
+			if (content->data[i++] != 'p' && content->data[i] != 'P')
+				continue;
+			if (content->data[i] != '>')
+				continue;
+			i -= 3;
+			pfound = 1;
+			break;
+		}
+	}
+
+	hoedown_buffer_printf(ob, "\n<li id=\"fn%d\">\n", num);
+	if (pfound) {
+		hoedown_buffer_put(ob, content->data, i);
+		hoedown_buffer_printf(
+			ob, "&nbsp;<a href=\"#fnref%d\" rev=\"footnote\">&#8617;</a>", num);
+		hoedown_buffer_put(ob, content->data + i, content->size - i);
+	} else if (content) {
+		hoedown_buffer_put(ob, content->data, content->size);
+	}
+	HOEDOWN_BUFPUTSL(ob, "</li>\n");
+}
+
+static int rndr_footnote_ref(hoedown_buffer* ob, unsigned int num,
+							 const hoedown_renderer_data* data)
+{
+	hoedown_buffer_printf(
+		ob,
+		"<sup id=\"fnref%d\"><a href=\"#fn%d\" rel=\"footnote\">%d</a></sup>",
+		num, num, num);
+	return 1;
+}
+
+static int rndr_math(hoedown_buffer* ob, const hoedown_buffer* text,
+					 int displaymode, const hoedown_renderer_data* data)
+{
+	hoedown_buffer_put(ob, (const uint8_t*)(displaymode ? "\\[" : "\\("), 2);
+	escape_html(ob, text->data, text->size);
+	hoedown_buffer_put(ob, (const uint8_t*)(displaymode ? "\\]" : "\\)"), 2);
+	return 1;
+}
+
+static void toc_header(hoedown_buffer* ob, const hoedown_buffer* content,
+					   int level, const hoedown_renderer_data* data)
+{
+	hoedown_html_renderer_state* state = data->opaque;
+
+	if (level <= state->toc_data.nesting_level) {
+		/* set the level offset if this is the first header
+		 * we're parsing for the document */
+		if (state->toc_data.current_level == 0)
+			state->toc_data.level_offset = level - 1;
+
+		level -= state->toc_data.level_offset;
+
+		if (level > state->toc_data.current_level) {
+			while (level > state->toc_data.current_level) {
+				HOEDOWN_BUFPUTSL(ob, "<ul>\n<li>\n");
+				state->toc_data.current_level++;
+			}
+		} else if (level < state->toc_data.current_level) {
+			HOEDOWN_BUFPUTSL(ob, "</li>\n");
+			while (level < state->toc_data.current_level) {
+				HOEDOWN_BUFPUTSL(ob, "</ul>\n</li>\n");
+				state->toc_data.current_level--;
+			}
+			HOEDOWN_BUFPUTSL(ob, "<li>\n");
+		} else {
+			HOEDOWN_BUFPUTSL(ob, "</li>\n<li>\n");
+		}
+
+		hoedown_buffer_printf(ob, "<a href=\"#toc_%d\">",
+							  state->toc_data.header_count++);
+		if (content)
+			hoedown_buffer_put(ob, content->data, content->size);
+		HOEDOWN_BUFPUTSL(ob, "</a>\n");
+	}
+}
+
+static int toc_link(hoedown_buffer* ob, const hoedown_buffer* content,
+					const hoedown_buffer* link, const hoedown_buffer* title,
+					const hoedown_renderer_data* data)
+{
+	if (content && content->size)
+		hoedown_buffer_put(ob, content->data, content->size);
+	return 1;
+}
+
+static void toc_finalize(hoedown_buffer* ob, int inline_render,
+						 const hoedown_renderer_data* data)
+{
+	hoedown_html_renderer_state* state;
+
+	if (inline_render)
+		return;
+
+	state = data->opaque;
+
+	while (state->toc_data.current_level > 0) {
+		HOEDOWN_BUFPUTSL(ob, "</li>\n</ul>\n");
+		state->toc_data.current_level--;
+	}
+
+	state->toc_data.header_count = 0;
+}
+
+hoedown_renderer* hoedown_html_toc_renderer_new(int nesting_level)
+{
+	static const hoedown_renderer cb_default = {NULL,
+
+												NULL,
+												NULL,
+												toc_header,
+												NULL,
+												NULL,
+												NULL,
+												NULL,
+												NULL,
+												NULL,
+												NULL,
+												NULL,
+												NULL,
+												NULL,
+												NULL,
+												NULL,
+
+												NULL,
+												rndr_codespan,
+												rndr_double_emphasis,
+												rndr_emphasis,
+												rndr_underline,
+												rndr_highlight,
+												rndr_quote,
+												NULL,
+												NULL,
+												toc_link,
+												rndr_triple_emphasis,
+												rndr_strikethrough,
+												rndr_superscript,
+												NULL,
+												NULL,
+												NULL,
+
+												NULL,
+												rndr_normal_text,
+
+												NULL,
+												toc_finalize};
+
+	hoedown_html_renderer_state* state;
+	hoedown_renderer* renderer;
+
+	/* Prepare the state pointer */
+	state = hoedown_malloc(sizeof(hoedown_html_renderer_state));
+	memset(state, 0x0, sizeof(hoedown_html_renderer_state));
+
+	state->toc_data.nesting_level = nesting_level;
+
+	/* Prepare the renderer */
+	renderer = hoedown_malloc(sizeof(hoedown_renderer));
+	memcpy(renderer, &cb_default, sizeof(hoedown_renderer));
+
+	renderer->opaque = state;
+	return renderer;
+}
+
+hoedown_renderer* hoedown_html_renderer_new(hoedown_html_flags render_flags,
+											int nesting_level)
+{
+	static const hoedown_renderer cb_default = {NULL,
+
+												rndr_blockcode,
+												rndr_blockquote,
+												rndr_header,
+												rndr_hrule,
+												rndr_list,
+												rndr_listitem,
+												rndr_paragraph,
+												rndr_table,
+												rndr_table_header,
+												rndr_table_body,
+												rndr_tablerow,
+												rndr_tablecell,
+												rndr_footnotes,
+												rndr_footnote_def,
+												rndr_raw_block,
+
+												rndr_autolink,
+												rndr_codespan,
+												rndr_double_emphasis,
+												rndr_emphasis,
+												rndr_underline,
+												rndr_highlight,
+												rndr_quote,
+												rndr_image,
+												rndr_linebreak,
+												rndr_link,
+												rndr_triple_emphasis,
+												rndr_strikethrough,
+												rndr_superscript,
+												rndr_footnote_ref,
+												rndr_math,
+												rndr_raw_html,
+
+												NULL,
+												rndr_normal_text,
+
+												NULL,
+												NULL};
+
+	hoedown_html_renderer_state* state;
+	hoedown_renderer* renderer;
+
+	/* Prepare the state pointer */
+	state = hoedown_malloc(sizeof(hoedown_html_renderer_state));
+	memset(state, 0x0, sizeof(hoedown_html_renderer_state));
+
+	state->flags = render_flags;
+	state->toc_data.nesting_level = nesting_level;
+
+	/* Prepare the renderer */
+	renderer = hoedown_malloc(sizeof(hoedown_renderer));
+	memcpy(renderer, &cb_default, sizeof(hoedown_renderer));
+
+	if (render_flags & HOEDOWN_HTML_SKIP_HTML ||
+		render_flags & HOEDOWN_HTML_ESCAPE)
+		renderer->blockhtml = NULL;
+
+	renderer->opaque = state;
+	return renderer;
+}
+
+void hoedown_html_renderer_free(hoedown_renderer* renderer)
+{
+	free(renderer->opaque);
+	free(renderer);
+}
diff --git a/meshmc/libraries/hoedown/src/html_blocks.c b/meshmc/libraries/hoedown/src/html_blocks.c
new file mode 100644
index 0000000000..bfccee4855
--- /dev/null
+++ b/meshmc/libraries/hoedown/src/html_blocks.c
@@ -0,0 +1,241 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+/* ANSI-C code produced by gperf version 3.0.3 */
+/* Command-line: gperf -L ANSI-C -N hoedown_find_block_tag -c -C -E -S 1
+ * --ignore-case -m100 html_block_names.gperf  */
+/* Computed positions: -k'1-2' */
+
+#if !(                                                                         \
+	(' ' == 32) && ('!' == 33) && ('"' == 34) && ('#' == 35) && ('%' == 37) && \
+	('&' == 38) && ('\'' == 39) && ('(' == 40) && (')' == 41) &&               \
+	('*' == 42) && ('+' == 43) && (',' == 44) && ('-' == 45) && ('.' == 46) && \
+	('/' == 47) && ('0' == 48) && ('1' == 49) && ('2' == 50) && ('3' == 51) && \
+	('4' == 52) && ('5' == 53) && ('6' == 54) && ('7' == 55) && ('8' == 56) && \
+	('9' == 57) && (':' == 58) && (';' == 59) && ('<' == 60) && ('=' == 61) && \
+	('>' == 62) && ('?' == 63) && ('A' == 65) && ('B' == 66) && ('C' == 67) && \
+	('D' == 68) && ('E' == 69) && ('F' == 70) && ('G' == 71) && ('H' == 72) && \
+	('I' == 73) && ('J' == 74) && ('K' == 75) && ('L' == 76) && ('M' == 77) && \
+	('N' == 78) && ('O' == 79) && ('P' == 80) && ('Q' == 81) && ('R' == 82) && \
+	('S' == 83) && ('T' == 84) && ('U' == 85) && ('V' == 86) && ('W' == 87) && \
+	('X' == 88) && ('Y' == 89) && ('Z' == 90) && ('[' == 91) &&                \
+	('\\' == 92) && (']' == 93) && ('^' == 94) && ('_' == 95) &&               \
+	('a' == 97) && ('b' == 98) && ('c' == 99) && ('d' == 100) &&               \
+	('e' == 101) && ('f' == 102) && ('g' == 103) && ('h' == 104) &&            \
+	('i' == 105) && ('j' == 106) && ('k' == 107) && ('l' == 108) &&            \
+	('m' == 109) && ('n' == 110) && ('o' == 111) && ('p' == 112) &&            \
+	('q' == 113) && ('r' == 114) && ('s' == 115) && ('t' == 116) &&            \
+	('u' == 117) && ('v' == 118) && ('w' == 119) && ('x' == 120) &&            \
+	('y' == 121) && ('z' == 122) && ('{' == 123) && ('|' == 124) &&            \
+	('}' == 125) && ('~' == 126))
+/* The character set is not based on ISO-646.  */
+#error                                                                         \
+	"gperf generated tables don't work with this execution character set. Please report a bug to <bug-gnu-gperf@gnu.org>."
+#endif
+
+/* maximum key range = 24, duplicates = 0 */
+
+#ifndef GPERF_DOWNCASE
+#define GPERF_DOWNCASE 1
+static unsigned char gperf_downcase[256] = {
+	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,  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,  52,	53,	 54,  55,  56,	57,	 58,  59,
+	60,	 61,  62,  63,	64,	 97,  98,  99,	100, 101, 102, 103, 104, 105, 106,
+	107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121,
+	122, 91,  92,  93,	94,	 95,  96,  97,	98,	 99,  100, 101, 102, 103, 104,
+	105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119,
+	120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134,
+	135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149,
+	150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164,
+	165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179,
+	180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194,
+	195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209,
+	210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224,
+	225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239,
+	240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254,
+	255};
+#endif
+
+#ifndef GPERF_CASE_STRNCMP
+#define GPERF_CASE_STRNCMP 1
+static int gperf_case_strncmp(register const char* s1, register const char* s2,
+							  register unsigned int n)
+{
+	for (; n > 0;) {
+		unsigned char c1 = gperf_downcase[(unsigned char)*s1++];
+		unsigned char c2 = gperf_downcase[(unsigned char)*s2++];
+		if (c1 != 0 && c1 == c2) {
+			n--;
+			continue;
+		}
+		return (int)c1 - (int)c2;
+	}
+	return 0;
+}
+#endif
+
+#ifdef __GNUC__
+__inline
+#else
+#ifdef __cplusplus
+inline
+#endif
+#endif
+	static unsigned int hash(register const char* str,
+							 register unsigned int len)
+{
+	static const unsigned char asso_values[] = {
+		25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
+		25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
+		25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 22, 21, 19, 18,
+		16, 0,	25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1,	25, 0,	25, 1,	0,
+		0,	13, 0,	25, 25, 11, 2,	1,	0,	25, 25, 5,	0,	2,	25, 25, 25, 25,
+		25, 25, 25, 25, 25, 25, 25, 25, 1,	25, 0,	25, 1,	0,	0,	13, 0,	25,
+		25, 11, 2,	1,	0,	25, 25, 5,	0,	2,	25, 25, 25, 25, 25, 25, 25, 25,
+		25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
+		25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
+		25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
+		25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
+		25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
+		25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
+		25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
+		25, 25, 25, 25, 25};
+	register int hval = (int)len;
+
+	switch (hval) {
+		default:
+			hval += asso_values[(unsigned char)str[1] + 1];
+		/*FALLTHROUGH*/
+		case 1:
+			hval += asso_values[(unsigned char)str[0]];
+			break;
+	}
+	return hval;
+}
+
+#ifdef __GNUC__
+__inline
+#ifdef __GNUC_STDC_INLINE__
+	__attribute__((__gnu_inline__))
+#endif
+#endif
+	const char* hoedown_find_block_tag(register const char* str,
+									   register unsigned int len)
+{
+	enum {
+		TOTAL_KEYWORDS = 24,
+		MIN_WORD_LENGTH = 1,
+		MAX_WORD_LENGTH = 10,
+		MIN_HASH_VALUE = 1,
+		MAX_HASH_VALUE = 24
+	};
+
+	if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH) {
+		register int key = hash(str, len);
+
+		if (key <= MAX_HASH_VALUE && key >= MIN_HASH_VALUE) {
+			register const char* resword;
+
+			switch (key - 1) {
+				case 0:
+					resword = "p";
+					goto compare;
+				case 1:
+					resword = "h6";
+					goto compare;
+				case 2:
+					resword = "div";
+					goto compare;
+				case 3:
+					resword = "del";
+					goto compare;
+				case 4:
+					resword = "form";
+					goto compare;
+				case 5:
+					resword = "table";
+					goto compare;
+				case 6:
+					resword = "figure";
+					goto compare;
+				case 7:
+					resword = "pre";
+					goto compare;
+				case 8:
+					resword = "fieldset";
+					goto compare;
+				case 9:
+					resword = "noscript";
+					goto compare;
+				case 10:
+					resword = "script";
+					goto compare;
+				case 11:
+					resword = "style";
+					goto compare;
+				case 12:
+					resword = "dl";
+					goto compare;
+				case 13:
+					resword = "ol";
+					goto compare;
+				case 14:
+					resword = "ul";
+					goto compare;
+				case 15:
+					resword = "math";
+					goto compare;
+				case 16:
+					resword = "ins";
+					goto compare;
+				case 17:
+					resword = "h5";
+					goto compare;
+				case 18:
+					resword = "iframe";
+					goto compare;
+				case 19:
+					resword = "h4";
+					goto compare;
+				case 20:
+					resword = "h3";
+					goto compare;
+				case 21:
+					resword = "blockquote";
+					goto compare;
+				case 22:
+					resword = "h2";
+					goto compare;
+				case 23:
+					resword = "h1";
+					goto compare;
+			}
+			return 0;
+		compare:
+			if ((((unsigned char)*str ^ (unsigned char)*resword) & ~32) == 0 &&
+				!gperf_case_strncmp(str, resword, len) && resword[len] == '\0')
+				return resword;
+		}
+	}
+	return 0;
+}
diff --git a/meshmc/libraries/hoedown/src/html_smartypants.c b/meshmc/libraries/hoedown/src/html_smartypants.c
new file mode 100644
index 0000000000..518bb1e220
--- /dev/null
+++ b/meshmc/libraries/hoedown/src/html_smartypants.c
@@ -0,0 +1,512 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+#include "hoedown/html.h"
+
+#include <string.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <ctype.h>
+
+#ifdef _MSC_VER
+#define snprintf _snprintf
+#endif
+
+struct smartypants_data {
+	int in_squote;
+	int in_dquote;
+};
+
+static size_t smartypants_cb__ltag(hoedown_buffer* ob,
+								   struct smartypants_data* smrt,
+								   uint8_t previous_char, const uint8_t* text,
+								   size_t size);
+static size_t smartypants_cb__dquote(hoedown_buffer* ob,
+									 struct smartypants_data* smrt,
+									 uint8_t previous_char, const uint8_t* text,
+									 size_t size);
+static size_t smartypants_cb__amp(hoedown_buffer* ob,
+								  struct smartypants_data* smrt,
+								  uint8_t previous_char, const uint8_t* text,
+								  size_t size);
+static size_t smartypants_cb__period(hoedown_buffer* ob,
+									 struct smartypants_data* smrt,
+									 uint8_t previous_char, const uint8_t* text,
+									 size_t size);
+static size_t smartypants_cb__number(hoedown_buffer* ob,
+									 struct smartypants_data* smrt,
+									 uint8_t previous_char, const uint8_t* text,
+									 size_t size);
+static size_t smartypants_cb__dash(hoedown_buffer* ob,
+								   struct smartypants_data* smrt,
+								   uint8_t previous_char, const uint8_t* text,
+								   size_t size);
+static size_t smartypants_cb__parens(hoedown_buffer* ob,
+									 struct smartypants_data* smrt,
+									 uint8_t previous_char, const uint8_t* text,
+									 size_t size);
+static size_t smartypants_cb__squote(hoedown_buffer* ob,
+									 struct smartypants_data* smrt,
+									 uint8_t previous_char, const uint8_t* text,
+									 size_t size);
+static size_t smartypants_cb__backtick(hoedown_buffer* ob,
+									   struct smartypants_data* smrt,
+									   uint8_t previous_char,
+									   const uint8_t* text, size_t size);
+static size_t smartypants_cb__escape(hoedown_buffer* ob,
+									 struct smartypants_data* smrt,
+									 uint8_t previous_char, const uint8_t* text,
+									 size_t size);
+
+static size_t (*smartypants_cb_ptrs[])(hoedown_buffer*,
+									   struct smartypants_data*, uint8_t,
+									   const uint8_t*, size_t) = {
+	NULL,					  /* 0 */
+	smartypants_cb__dash,	  /* 1 */
+	smartypants_cb__parens,	  /* 2 */
+	smartypants_cb__squote,	  /* 3 */
+	smartypants_cb__dquote,	  /* 4 */
+	smartypants_cb__amp,	  /* 5 */
+	smartypants_cb__period,	  /* 6 */
+	smartypants_cb__number,	  /* 7 */
+	smartypants_cb__ltag,	  /* 8 */
+	smartypants_cb__backtick, /* 9 */
+	smartypants_cb__escape,	  /* 10 */
+};
+
+static const uint8_t smartypants_cb_chars[UINT8_MAX + 1] = {
+	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, 4, 0, 0, 0, 5, 3, 2, 0, 0, 0, 0,	1, 6, 0,
+	0, 7, 0, 7, 0, 0, 0, 0, 0, 0, 0, 0, 8, 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, 10, 0, 0, 0,
+	9, 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, 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,
+};
+
+static int word_boundary(uint8_t c)
+{
+	return c == 0 || isspace(c) || ispunct(c);
+}
+
+/*
+	If 'text' begins with any kind of single quote (e.g. "'" or "&apos;" etc.),
+	returns the length of the sequence of characters that makes up the single-
+	quote.  Otherwise, returns zero.
+*/
+static size_t squote_len(const uint8_t* text, size_t size)
+{
+	static char* single_quote_list[] = {"'", "&#39;", "&#x27;", "&apos;", NULL};
+	char** p;
+
+	for (p = single_quote_list; *p; ++p) {
+		size_t len = strlen(*p);
+		if (size >= len && memcmp(text, *p, len) == 0) {
+			return len;
+		}
+	}
+
+	return 0;
+}
+
+/* Converts " or ' at very beginning or end of a word to left or right quote */
+static int smartypants_quotes(hoedown_buffer* ob, uint8_t previous_char,
+							  uint8_t next_char, uint8_t quote, int* is_open)
+{
+	char ent[8];
+
+	if (*is_open && !word_boundary(next_char))
+		return 0;
+
+	if (!(*is_open) && !word_boundary(previous_char))
+		return 0;
+
+	snprintf(ent, sizeof(ent), "&%c%cquo;", (*is_open) ? 'r' : 'l', quote);
+	*is_open = !(*is_open);
+	hoedown_buffer_puts(ob, ent);
+	return 1;
+}
+
+/*
+	Converts ' to left or right single quote; but the initial ' might be in
+	different forms, e.g. &apos; or &#39; or &#x27;.
+	'squote_text' points to the original single quote, and 'squote_size' is its
+   length. 'text' points at the last character of the single-quote, e.g. ' or ;
+*/
+static size_t smartypants_squote(hoedown_buffer* ob,
+								 struct smartypants_data* smrt,
+								 uint8_t previous_char, const uint8_t* text,
+								 size_t size, const uint8_t* squote_text,
+								 size_t squote_size)
+{
+	if (size >= 2) {
+		uint8_t t1 = tolower(text[1]);
+		size_t next_squote_len = squote_len(text + 1, size - 1);
+
+		/* convert '' to &ldquo; or &rdquo; */
+		if (next_squote_len > 0) {
+			uint8_t next_char =
+				(size > 1 + next_squote_len) ? text[1 + next_squote_len] : 0;
+			if (smartypants_quotes(ob, previous_char, next_char, 'd',
+								   &smrt->in_dquote))
+				return next_squote_len;
+		}
+
+		/* Tom's, isn't, I'm, I'd */
+		if ((t1 == 's' || t1 == 't' || t1 == 'm' || t1 == 'd') &&
+			(size == 3 || word_boundary(text[2]))) {
+			HOEDOWN_BUFPUTSL(ob, "&rsquo;");
+			return 0;
+		}
+
+		/* you're, you'll, you've */
+		if (size >= 3) {
+			uint8_t t2 = tolower(text[2]);
+
+			if (((t1 == 'r' && t2 == 'e') || (t1 == 'l' && t2 == 'l') ||
+				 (t1 == 'v' && t2 == 'e')) &&
+				(size == 4 || word_boundary(text[3]))) {
+				HOEDOWN_BUFPUTSL(ob, "&rsquo;");
+				return 0;
+			}
+		}
+	}
+
+	if (smartypants_quotes(ob, previous_char, size > 0 ? text[1] : 0, 's',
+						   &smrt->in_squote))
+		return 0;
+
+	hoedown_buffer_put(ob, squote_text, squote_size);
+	return 0;
+}
+
+/* Converts ' to left or right single quote. */
+static size_t smartypants_cb__squote(hoedown_buffer* ob,
+									 struct smartypants_data* smrt,
+									 uint8_t previous_char, const uint8_t* text,
+									 size_t size)
+{
+	return smartypants_squote(ob, smrt, previous_char, text, size, text, 1);
+}
+
+/* Converts (c), (r), (tm) */
+static size_t smartypants_cb__parens(hoedown_buffer* ob,
+									 struct smartypants_data* smrt,
+									 uint8_t previous_char, const uint8_t* text,
+									 size_t size)
+{
+	if (size >= 3) {
+		uint8_t t1 = tolower(text[1]);
+		uint8_t t2 = tolower(text[2]);
+
+		if (t1 == 'c' && t2 == ')') {
+			HOEDOWN_BUFPUTSL(ob, "&copy;");
+			return 2;
+		}
+
+		if (t1 == 'r' && t2 == ')') {
+			HOEDOWN_BUFPUTSL(ob, "&reg;");
+			return 2;
+		}
+
+		if (size >= 4 && t1 == 't' && t2 == 'm' && text[3] == ')') {
+			HOEDOWN_BUFPUTSL(ob, "&trade;");
+			return 3;
+		}
+	}
+
+	hoedown_buffer_putc(ob, text[0]);
+	return 0;
+}
+
+/* Converts "--" to em-dash, etc. */
+static size_t smartypants_cb__dash(hoedown_buffer* ob,
+								   struct smartypants_data* smrt,
+								   uint8_t previous_char, const uint8_t* text,
+								   size_t size)
+{
+	if (size >= 3 && text[1] == '-' && text[2] == '-') {
+		HOEDOWN_BUFPUTSL(ob, "&mdash;");
+		return 2;
+	}
+
+	if (size >= 2 && text[1] == '-') {
+		HOEDOWN_BUFPUTSL(ob, "&ndash;");
+		return 1;
+	}
+
+	hoedown_buffer_putc(ob, text[0]);
+	return 0;
+}
+
+/* Converts &quot; etc. */
+static size_t smartypants_cb__amp(hoedown_buffer* ob,
+								  struct smartypants_data* smrt,
+								  uint8_t previous_char, const uint8_t* text,
+								  size_t size)
+{
+	size_t len;
+	if (size >= 6 && memcmp(text, "&quot;", 6) == 0) {
+		if (smartypants_quotes(ob, previous_char, size >= 7 ? text[6] : 0, 'd',
+							   &smrt->in_dquote))
+			return 5;
+	}
+
+	len = squote_len(text, size);
+	if (len > 0) {
+		return (len - 1) + smartypants_squote(ob, smrt, previous_char,
+											  text + (len - 1),
+											  size - (len - 1), text, len);
+	}
+
+	if (size >= 4 && memcmp(text, "&#0;", 4) == 0)
+		return 3;
+
+	hoedown_buffer_putc(ob, '&');
+	return 0;
+}
+
+/* Converts "..." to ellipsis */
+static size_t smartypants_cb__period(hoedown_buffer* ob,
+									 struct smartypants_data* smrt,
+									 uint8_t previous_char, const uint8_t* text,
+									 size_t size)
+{
+	if (size >= 3 && text[1] == '.' && text[2] == '.') {
+		HOEDOWN_BUFPUTSL(ob, "&hellip;");
+		return 2;
+	}
+
+	if (size >= 5 && text[1] == ' ' && text[2] == '.' && text[3] == ' ' &&
+		text[4] == '.') {
+		HOEDOWN_BUFPUTSL(ob, "&hellip;");
+		return 4;
+	}
+
+	hoedown_buffer_putc(ob, text[0]);
+	return 0;
+}
+
+/* Converts `` to opening double quote */
+static size_t smartypants_cb__backtick(hoedown_buffer* ob,
+									   struct smartypants_data* smrt,
+									   uint8_t previous_char,
+									   const uint8_t* text, size_t size)
+{
+	if (size >= 2 && text[1] == '`') {
+		if (smartypants_quotes(ob, previous_char, size >= 3 ? text[2] : 0, 'd',
+							   &smrt->in_dquote))
+			return 1;
+	}
+
+	hoedown_buffer_putc(ob, text[0]);
+	return 0;
+}
+
+/* Converts 1/2, 1/4, 3/4 */
+static size_t smartypants_cb__number(hoedown_buffer* ob,
+									 struct smartypants_data* smrt,
+									 uint8_t previous_char, const uint8_t* text,
+									 size_t size)
+{
+	if (word_boundary(previous_char) && size >= 3) {
+		if (text[0] == '1' && text[1] == '/' && text[2] == '2') {
+			if (size == 3 || word_boundary(text[3])) {
+				HOEDOWN_BUFPUTSL(ob, "&frac12;");
+				return 2;
+			}
+		}
+
+		if (text[0] == '1' && text[1] == '/' && text[2] == '4') {
+			if (size == 3 || word_boundary(text[3]) ||
+				(size >= 5 && tolower(text[3]) == 't' &&
+				 tolower(text[4]) == 'h')) {
+				HOEDOWN_BUFPUTSL(ob, "&frac14;");
+				return 2;
+			}
+		}
+
+		if (text[0] == '3' && text[1] == '/' && text[2] == '4') {
+			if (size == 3 || word_boundary(text[3]) ||
+				(size >= 6 && tolower(text[3]) == 't' &&
+				 tolower(text[4]) == 'h' && tolower(text[5]) == 's')) {
+				HOEDOWN_BUFPUTSL(ob, "&frac34;");
+				return 2;
+			}
+		}
+	}
+
+	hoedown_buffer_putc(ob, text[0]);
+	return 0;
+}
+
+/* Converts " to left or right double quote */
+static size_t smartypants_cb__dquote(hoedown_buffer* ob,
+									 struct smartypants_data* smrt,
+									 uint8_t previous_char, const uint8_t* text,
+									 size_t size)
+{
+	if (!smartypants_quotes(ob, previous_char, size > 0 ? text[1] : 0, 'd',
+							&smrt->in_dquote))
+		HOEDOWN_BUFPUTSL(ob, "&quot;");
+
+	return 0;
+}
+
+static size_t smartypants_cb__ltag(hoedown_buffer* ob,
+								   struct smartypants_data* smrt,
+								   uint8_t previous_char, const uint8_t* text,
+								   size_t size)
+{
+	static const char* skip_tags[] = {"pre", "code", "var",	   "samp",
+									  "kbd", "math", "script", "style"};
+	static const size_t skip_tags_count = 8;
+
+	size_t tag, i = 0;
+
+	/* This is a comment. Copy everything verbatim until --> or EOF is seen. */
+	if (i + 4 < size && memcmp(text, "<!--", 4) == 0) {
+		i += 4;
+		while (i + 3 < size && memcmp(text + i, "-->", 3) != 0)
+			i++;
+		i += 3;
+		hoedown_buffer_put(ob, text, i + 1);
+		return i;
+	}
+
+	while (i < size && text[i] != '>')
+		i++;
+
+	for (tag = 0; tag < skip_tags_count; ++tag) {
+		if (hoedown_html_is_tag(text, size, skip_tags[tag]) ==
+			HOEDOWN_HTML_TAG_OPEN)
+			break;
+	}
+
+	if (tag < skip_tags_count) {
+		for (;;) {
+			while (i < size && text[i] != '<')
+				i++;
+
+			if (i == size)
+				break;
+
+			if (hoedown_html_is_tag(text + i, size - i, skip_tags[tag]) ==
+				HOEDOWN_HTML_TAG_CLOSE)
+				break;
+
+			i++;
+		}
+
+		while (i < size && text[i] != '>')
+			i++;
+	}
+
+	hoedown_buffer_put(ob, text, i + 1);
+	return i;
+}
+
+static size_t smartypants_cb__escape(hoedown_buffer* ob,
+									 struct smartypants_data* smrt,
+									 uint8_t previous_char, const uint8_t* text,
+									 size_t size)
+{
+	if (size < 2)
+		return 0;
+
+	switch (text[1]) {
+		case '\\':
+		case '"':
+		case '\'':
+		case '.':
+		case '-':
+		case '`':
+			hoedown_buffer_putc(ob, text[1]);
+			return 1;
+
+		default:
+			hoedown_buffer_putc(ob, '\\');
+			return 0;
+	}
+}
+
+#if 0
+static struct {
+    uint8_t c0;
+    const uint8_t *pattern;
+    const uint8_t *entity;
+    int skip;
+} smartypants_subs[] = {
+    { '\'', "'s>",      "&rsquo;",  0 },
+    { '\'', "'t>",      "&rsquo;",  0 },
+    { '\'', "'re>",     "&rsquo;",  0 },
+    { '\'', "'ll>",     "&rsquo;",  0 },
+    { '\'', "'ve>",     "&rsquo;",  0 },
+    { '\'', "'m>",      "&rsquo;",  0 },
+    { '\'', "'d>",      "&rsquo;",  0 },
+    { '-',  "--",       "&mdash;",  1 },
+    { '-',  "<->",      "&ndash;",  0 },
+    { '.',  "...",      "&hellip;", 2 },
+    { '.',  ". . .",    "&hellip;", 4 },
+    { '(',  "(c)",      "&copy;",   2 },
+    { '(',  "(r)",      "&reg;",    2 },
+    { '(',  "(tm)",     "&trade;",  3 },
+    { '3',  "<3/4>",    "&frac34;", 2 },
+    { '3',  "<3/4ths>", "&frac34;", 2 },
+    { '1',  "<1/2>",    "&frac12;", 2 },
+    { '1',  "<1/4>",    "&frac14;", 2 },
+    { '1',  "<1/4th>",  "&frac14;", 2 },
+    { '&',  "&#0;",      0,       3 },
+};
+#endif
+
+void hoedown_html_smartypants(hoedown_buffer* ob, const uint8_t* text,
+							  size_t size)
+{
+	size_t i;
+	struct smartypants_data smrt = {0, 0};
+
+	if (!text)
+		return;
+
+	hoedown_buffer_grow(ob, size);
+
+	for (i = 0; i < size; ++i) {
+		size_t org;
+		uint8_t action = 0;
+
+		org = i;
+		while (i < size && (action = smartypants_cb_chars[text[i]]) == 0)
+			i++;
+
+		if (i > org)
+			hoedown_buffer_put(ob, text + org, i - org);
+
+		if (i < size) {
+			i += smartypants_cb_ptrs[(int)action](
+				ob, &smrt, i ? text[i - 1] : 0, text + i, size - i);
+		}
+	}
+}
diff --git a/meshmc/libraries/hoedown/src/stack.c b/meshmc/libraries/hoedown/src/stack.c
new file mode 100644
index 0000000000..b3b72a19d4
--- /dev/null
+++ b/meshmc/libraries/hoedown/src/stack.c
@@ -0,0 +1,94 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+#include "hoedown/stack.h"
+
+#include "hoedown/buffer.h"
+
+#include <stdlib.h>
+#include <string.h>
+#include <assert.h>
+
+void hoedown_stack_init(hoedown_stack* st, size_t initial_size)
+{
+	assert(st);
+
+	st->item = NULL;
+	st->size = st->asize = 0;
+
+	if (!initial_size)
+		initial_size = 8;
+
+	hoedown_stack_grow(st, initial_size);
+}
+
+void hoedown_stack_uninit(hoedown_stack* st)
+{
+	assert(st);
+
+	free(st->item);
+}
+
+void hoedown_stack_grow(hoedown_stack* st, size_t neosz)
+{
+	assert(st);
+
+	if (st->asize >= neosz)
+		return;
+
+	st->item = hoedown_realloc(st->item, neosz * sizeof(void*));
+	memset(st->item + st->asize, 0x0, (neosz - st->asize) * sizeof(void*));
+
+	st->asize = neosz;
+
+	if (st->size > neosz)
+		st->size = neosz;
+}
+
+void hoedown_stack_push(hoedown_stack* st, void* item)
+{
+	assert(st);
+
+	if (st->size >= st->asize)
+		hoedown_stack_grow(st, st->size * 2);
+
+	st->item[st->size++] = item;
+}
+
+void* hoedown_stack_pop(hoedown_stack* st)
+{
+	assert(st);
+
+	if (!st->size)
+		return NULL;
+
+	return st->item[--st->size];
+}
+
+void* hoedown_stack_top(const hoedown_stack* st)
+{
+	assert(st);
+
+	if (!st->size)
+		return NULL;
+
+	return st->item[st->size - 1];
+}
diff --git a/meshmc/libraries/hoedown/src/version.c b/meshmc/libraries/hoedown/src/version.c
new file mode 100644
index 0000000000..3386d8a519
--- /dev/null
+++ b/meshmc/libraries/hoedown/src/version.c
@@ -0,0 +1,29 @@
+/* SPDX-FileCopyrightText: 2026 Project Tick
+ * SPDX-FileContributor: Project Tick
+ * SPDX-License-Identifier: GPL-3.0-or-later
+ *
+ *   MeshMC - A Custom Launcher for Minecraft
+ *   Copyright (C) 2026 Project Tick
+ *
+ *   This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *   GNU General Public License for more details.
+ *
+ *   You should have received a copy of the GNU General Public License
+ *   along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+#include "hoedown/version.h"
+
+void hoedown_version(int* major, int* minor, int* revision)
+{
+	*major = HOEDOWN_VERSION_MAJOR;
+	*minor = HOEDOWN_VERSION_MINOR;
+	*revision = HOEDOWN_VERSION_REVISION;
+}